Scientific concerns: Mathematical methods of pattern recognition; algorithms for noiseproof processing and recognition of numeric sequences (signals); processing, recognition and synthesizing of speech signals. The main outcomes (professional experience): Effective (polynomial) a posteriori algorithms for processing (detection, distinguishing, recovery, clearing) and recognition of numeric quasiperiodic sequences; probabilistic estimations of accuracy for these algorithms and estimations of their temporary and capacitive complexity (1994–2002); the russian linguistic resource for training some systems of recognition and synthesizing of an oral speech (1997–1999); mathematical model for the speech signal formation under 3–grams interplay of phonemes in continuous speech (1990–1993); mathematical methods and algorithms for speech recognition system resistant to external acoustic noises, non-linear amplitude distortions of a signal, and such hindering as: vibrational distortions, overloads, and changes of a structure of a respiratory mix (1982–1989).
Biography
Graduated from Faculty of Physics of Novosibirsk State University (department of nuclear physics) in 1974. Ph.D. thesis was defended in 1997. A list of my publications contains about 100 titles. Now I am Senior Scientific Researcher in Institute of Mathematics of Siberian Branch of Russian Academy of Sciences.
From 1993 till now I was participator of six grants of Russian Foundation for Basic Research. I was awarded: The 2nd degree Diploma of the Siberian Branch of the Russian Academy of Sciences for a series of papers and complex of some algorithms to the prototype of an onboard speech recognition system (1989); The Main prize of the HEWLETT-PACKARD corporation for some methods and algorithms of noiseproof processing and recognition of speech signals (for East European countries) (1991); The Diploma and Golden medal of the International exhibition "Sibrobotndash;93" for a noiseproof speech interface to computers (1993).
Main publications:
Kel'manov A. V., Khamidullin S. A. Recognizing a quasiperiodic sequence composed of a given number of truncated subsequences // Pattern Recognition Image Anal., 2001, 11(4), 718–731.
A. V. Kel'manov, L. V. Mikhailova, P. S. Ruzankin, S. A. Khamidullin, “Recognition of a quasi-periodic sequence containing an unknown number of nonlinearly extended reference subsequences”, Zh. Vychisl. Mat. Mat. Fiz., 61:7 (2021), 1162–1171; Comput. Math. Math. Phys., 61:7 (2021), 1153–1161
A. V. Kel'manov, L. V. Mikhailova, P. S. Ruzankin, S. A. Khamidullin, “The
minimization problem for the sum of weighted convolution differences: the case of a given
number of elements in the sum”, Sib. Zh. Vychisl. Mat., 23:2 (2020), 127–142; Num. Anal. Appl., 13:2 (2020), 103–116
A. V. Kel'manov, L. V. Mikhailova, P. S. Ruzankin, S. A. Khamidullin, “Problem of minimizing a sum of differences of weighted convolutions”, Zh. Vychisl. Mat. Mat. Fiz., 60:12 (2020), 2015–2027; Comput. Math. Math. Phys., 60:12 (2020), 1951–1963
A. V. Kel'manov, S. A. Khamidullin, V. I. Khandeev, “A randomized algorithm for a sequence 2-clustering problem”, Zh. Vychisl. Mat. Mat. Fiz., 58:12 (2018), 2169–2178; Comput. Math. Math. Phys., 58:12 (2018), 2078–2085
A. V. Kel'manov, S. A. Khamidullin, V. I. Khandeev, “Exact pseudopolynomial algorithm for one sequence partitioning problem”, Avtomat. i Telemekh., 2017, no. 1, 80–90; Autom. Remote Control, 78:1 (2017), 67–74
A. V. Kelmanov, S. M. Romanchenko, S. A. Khamidullin, “An approximation scheme for a problem of finding a subsequence”, Sib. Zh. Vychisl. Mat., 20:4 (2017), 379–392; Num. Anal. Appl., 10:4 (2017), 313–323
A. V. Kel'manov, L. V. Mikhailova, S. A. Khamidullin, V. I. Khandeev, “Approximation algorithm for the problem of partitioning a sequence into clusters”, Zh. Vychisl. Mat. Mat. Fiz., 57:8 (2017), 1392–1400; Comput. Math. Math. Phys., 57:8 (2017), 1376–1383
A. V. Kel'manov, S. A. Khamidullin, V. I. Khandeev, “Fully polynomial-time approximation scheme for a sequence $2$-clustering problem”, Diskretn. Anal. Issled. Oper., 23:2 (2016), 21–40; J. Appl. Industr. Math., 10:2 (2016), 209–219
A. V. Kel'manov, L. V. Mikhailova, S. A. Khamidullin, V. I. Khandeev, “An approximation algorithm for the problem of partitioning a sequence into clusters with constraints on their cardinalities”, Trudy Inst. Mat. i Mekh. UrO RAN, 22:3 (2016), 144–152; Proc. Steklov Inst. Math. (Suppl.), 299, suppl. 1 (2017), 88–96
2015
10.
A. V. Kel'manov, S. A. Khamidullin, “An approximation polynomial-time algorithm for a sequence bi-clustering problem”, Zh. Vychisl. Mat. Mat. Fiz., 55:6 (2015), 1076–1085; Comput. Math. Math. Phys., 55:6 (2015), 1068–1076
A. V. Kelmanov, S. A. Khamidullin, “Approximation algorithm for one problem of partitioning a sequence”, Diskretn. Anal. Issled. Oper., 21:1 (2014), 53–66; J. Appl. Industr. Math., 8:2 (2014), 236–244
A. V. Kel'manov, S. M. Romanchenko, S. A. Khamidullin, “Точные псевдополиномиальные алгоритмы для некоторых труднорешаемых задач поиска подпоследовательности векторов”, Zh. Vychisl. Mat. Mat. Fiz., 53:1 (2013), 143–153
A. V. Kel'manov, S. M. Romanchenko, S. A. Khamidullin, “Approximation algorithms for some NP-hard problems of searching a vectors subsequence”, Diskretn. Anal. Issled. Oper., 19:3 (2012), 27–38; J. Appl. Industr. Math., 6:4 (2012), 443–450
A. V. Kel'manov, L. V. Mikhaylova, S. A. Khamidullin, “On one problem of searching for tuples of fragments in a numerical sequence”, Diskretn. Anal. Issled. Oper., 16:4 (2009), 31–46
A. V. Kel'manov, S. A. Khamidullin, “On one recognition problem of vector alphabet generating a sequence with a quasi-periodical structure”, Sib. Zh. Vychisl. Mat., 12:3 (2009), 275–287; Num. Anal. Appl., 2:2 (2009), 220–229
A. V. Kel'manov, L. V. Mikhailova, S. A. Khamidullin, “Распознавание квазипериодической последовательности, включающей повторяющийся набор фрагментов”, Sib. Zh. Ind. Mat., 11:2 (2008), 74–87
17.
A. V. Kel'manov, L. V. Mikhailova, S. A. Khamidullin, “Optimal detection of a recurring tuple of reference fragments in a quasi-periodic sequence”, Sib. Zh. Vychisl. Mat., 11:3 (2008), 311–327; Num. Anal. Appl., 1:3 (2008), 255–268
A. V. Kel'manov, L. V. Mikhailova, S. A. Khamidullin, “A posteriori joint detection of a recurring tuple of reference fragments in a quasi-periodic sequence”, Zh. Vychisl. Mat. Mat. Fiz., 48:12 (2008), 2247–2260; Comput. Math. Math. Phys., 48:12 (2008), 2276–2288
A. V. Kel'manov, S. A. Khamidullin, “Optimal detection of a given number of unknown quasiperiodic fragments in a numerical sequence”, Sib. Zh. Vychisl. Mat., 10:2 (2007), 159–175
A. V. Kel'manov, S. A. Khamidullin, “A posteriori detection of a given number of unknown quasiperiodic fragments in a numerical sequence”, Sib. Zh. Ind. Mat., 9:3 (2006), 50–65
21.
A. V. Kel'manov, S. A. Khamidullin, “Joint a posteriori detection and identification of quasiperiodic fragments in a sequence from pieces of them”, Sib. Zh. Ind. Mat., 9:2 (2006), 55–74
22.
E. Kh. Gimadi, A. V. Kel'manov, M. A. Kelmanova, S. A. Khamidullin, “A posteriori detection of a quasiperiodic fragment with a given number of repetitions in a numerical sequence”, Sib. Zh. Ind. Mat., 9:1 (2006), 55–74
A. V. Kel'manov, S. A. Khamidullin, “Joint a posteriori detection and identification of a given number of quasiperiodic fragments in a sequence from pieces of them”, Sib. Zh. Ind. Mat., 8:2 (2005), 83–102
A. V. Kel'manov, S. A. Khamidullin, “Recognition of a numerical sequence from fragments of a quasiperiodically repeating standard sequence”, Sib. Zh. Ind. Mat., 7:2 (2004), 68–87
A. V. Kel'manov, S. A. Khamidullin, “A posteriori detection of a quasiperiodically repeating fragment of a numerical sequence under conditions of noise and data loss”, Sib. Zh. Ind. Mat., 6:2 (2003), 46–63
A. V. Kel'manov, S. A. Khamidullin, L. V. Okol'nishnikova, “Recognition of a quasiperiodic sequence that includes identical subsequences-fragments”, Sib. Zh. Ind. Mat., 5:4 (2002), 38–54
A. V. Kel'manov, S. A. Khamidullin, L. V. Okol'nishnikova, “A posteriori detection of identical subsequence-fragments in a quasiperiodic sequence”, Sib. Zh. Ind. Mat., 5:2 (2002), 94–108
A. V. Kel'manov, S. A. Khamidullin, “Recognition of a quasiperiodic sequence formed from a given number of truncated subsequences”, Sib. Zh. Ind. Mat., 5:1 (2002), 85–104
A. V. Kel'manov, S. A. Khamidullin, “Posterior detection of a given number of identical subsequences in a quasi-periodic sequence”, Zh. Vychisl. Mat. Mat. Fiz., 41:5 (2001), 807–820; Comput. Math. Math. Phys., 41:5 (2001), 762–774
A. V. Kel'manov, S. A. Khamidullin, “A posteriori detection of a given number of truncated subsequences in a quasiperiodic sequence”, Sib. Zh. Ind. Mat., 3:1 (2000), 137–156
A. V. Kel'manov, S. A. Khamidullin, “A posteriori joint detection and distinction of a given number of subsequences in a quasiperiodic sequence”, Sib. Zh. Ind. Mat., 2:2 (1999), 106–119
A. V. Kel'manov, S. A. Khamidullin, “Recognition of a quasiperiodic sequence formed from a given number of identical subsequences”, Sib. Zh. Ind. Mat., 2:1 (1999), 53–74
A. V. Kel'manov, S. A. Khamidullin, “Optimal detection of given number of identical subsequences in quasiperiodic sequence”, Sib. Zh. Vychisl. Mat., 2:4 (1999), 333–349
Contact us: