Skip to main content
SpringerLink
Log in

Logic Separation: Discrete Modelling of Pattern Recognition

  • SCIENTIFIC SCHOOLS OF THE FEDERAL RESEARCH CENTER “COMPUTER SCIENCE AND CONTROL” OF THE RUSSIAN ACADEMY OF SCIENCES, MOSCOW, THE RUSSIAN FEDERATION
  • Yu.I. Zhuravlev’s Scientific School
  • Published:
Pattern Recognition and Image Analysis Aims and scope Submit manuscript

Abstract

Herein, a historical analytical survey of work of “Discrete Modelling of Pattern Recognition” (DM-Lab) research group in Armenia is presented. The group is since 1973, supervised by worldwide recognized scientist Yurii Ivanovich Zhuravlev and lead by his former student Levon Aslanyan. The general start of attention to computational mathematics and computational systems in Armenia is concerned with the times of cybernetics as a research direction, and the names of great scientists and policy makers, such as Andranik Iosifyan and Sergei Mergelyan. In early 1950’s a large number of HighTech and defense related organizations were established in area, and their theoretical, scientific cluster was formed around the Yerevan Research Institute of Mathematical Machines, and Computer Center of Academy of Sciences and Yerevan State University. This was the time for intensive stuff and student exchanges inside the larger country USSR. Rimma Podlovchenko, Rafik Tonoyan, Igor’ Zaslavski, Yuri Shoukourian started teaching at Yerevan State University in 70’s, a number of students were delegated to the recognized cybernetical centers, in Moscow, Kiev, Novosibirsk. And one of the results of these developments was appearance of DM-Lab in Armenia, composed by alumnus of Novosibirsk and Moscow State Universities, led by Levon Aslanyan, and supervised globally by RF Academician Yuri Ivanovich Zhuravlev. Further research and education activities lead to defenses of candidate and doctoral dissertations, in Armenia, and at the council of Computer Center of Academy of Sciences of Russian Federation. The initial stuff of DM-Lab group included Gevorg Tonoyan, Levon Asatryan, Vilik Karakhanyan. Local members of the group were Hasmik Sahakyan, Vladimir Sahakyan, Irina Arsenyan, Levon Kazaryan and large number of young PhD students. Research directions at the DM-Lab were and are related to the pattern recognition theory – to mathematical models of forming and analyzing learning sets, studying their properties such as the class compactness hypothesis, in terms of isoperimetry; to forming the logic of interrelations of classes, in terms of logic separation; setting up new approaches in data mining area, etc. All these studies involve intensive research over the years, addressing topics related to the geometry of n-dimensional unite cube and lattices in general, Boolean function minimization, discrete optimization problems, and algorithmic studies coming from data science and artificial intelligence. International relations and activities of the group includes: long term representation of Armenia in the ISO technical groups, representation of Armenia in ICT research programmes of European Council, membership at the ITHEA virtual research institute with its conferences and publishing house. 10’s of research projects were implemented during these years. Projects were funded by UNDP, NATO Research, INTAS, EC Esprit, IST and Horizone, RFBR, and other international and local sources. 16 candidate and 2 doctoral theses were defended by the group members.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.
Fig. 6.
Fig. 7.
Fig. 8.

REFERENCES

  1. S. V. Ablameyko, A. S. Biryukov, A. A. Dokukin, A. G. D’yakonov, Yu. I. Zhuravlev, V. V. Krasnoproshin, V. A. Obraztsov, M. Yu. Romanov, and V. V. Ryazanov, “Practical algorithms for algebraic and logical correction in precedent-based recognition problems,” Comput. Math. Math. Phys. 54, 1915–1928 (2014). https://doi.org/10.1134/s0965542514120033

    Article  MathSciNet  Google Scholar 

  2. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo, “Fast discovery of association rules,” in Advances in Knowledge Discovery and Data Mining, Ed. by U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy (AAAI, Menlo Park, Calif., 1996), pp. 307–328.

    Google Scholar 

  3. R. Ahlswede and G. O. H. Katona, “Contributions to the geometry of hamming spaces,” Discrete Math. 17, 1–22 (1977). https://doi.org/10.1016/0012-365x(77)90017-6

    Article  MathSciNet  Google Scholar 

  4. R. Ahlswede and L. H. Khachatrian, “The complete nontrivial-intersection theorem for systems of finite sets,” J. Comb. Theory, Ser. A 76 (1), 121–138 (1996). https://doi.org/10.1006/jcta.1996.0092

    Article  MathSciNet  Google Scholar 

  5. M. A. Aĭzerman, È. M. Braverman, and L. I. Rozonoèr, “Extrapolative problems in automatic control and the method of potential functions,” in Sixteen Papers on Differential and Difference Equations, Functional Analysis, Games and Control, American Mathematical Society Translations, Vol. 87 (American Mathematical Society, Providence, R.I., 1970), pp. 281–303. https://doi.org/10.1090/trans2/087/16

  6. I. Akopova and L. H. Aslanyan, “Proving estimates of reduced disjunctive normal forms of weakly defined Boolean functions,” Izv. Yerevansk. Gos. Univ. Ser. Estestv. Nauki, No. 1, 14–23 (1980).

  7. V. B. Alekseev, “Deciphering of some classes of monotonic many-valued functions,” USSR Comput. Math. Math. Phys. 16, 180–189 (1976). https://doi.org/10.1016/0041-5553(76)90083-5

    Article  Google Scholar 

  8. G. Anastasi, M. Conti, M. Di Francesco, and A. Passarella, “Energy conservation in wireless sensor networks: A survey,” Ad Hoc Networks 7, 537–568 (2009). https://doi.org/10.1016/j.adhoc.2008.06.003

    Article  Google Scholar 

  9. A. Arakelyan, L. Aslanyan, and A. Boyajyan, “High-throughput gene expression analysis concepts and applications,” in Sequence and Genome Analysis II-Bacteria, Viruses and Metabolic Pathways (iConcept Press, Hong Kong, 2013).

  10. A. Arakelyan, A. Boyajian, L. Aslanyan, D. Muradian, and H. Sahakyan, “Algorithmic analysis of functional pathways affected by typical and atypical antipsychotics,” iSiS 2, 1 (2009).

    Google Scholar 

  11. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu, “An optimal algorithm for approximate nearest neighbor searching fixed dimensions,” J. ACM 45, 891–923 (1998). https://doi.org/10.1145/293347.293348

    Article  MathSciNet  Google Scholar 

  12. L. H. Aslanyan and Yu. I. Zhuravlev, “Logic separation principle,” in Computer Science & Information Technologies Conf. (Yerevan, 2001), pp. 151–156.

  13. L. H. Aslanjan and I. A. Akopova, “On the distribution of the number of interior points in subsets of the n-dimensional unit cube,” in Finite and Infinite Sets, Colloquia Mathematica Societatis Yanos Bolyai, Vol. 37 (Elsevier, 1981), pp. 47–58. https://doi.org/10.1016/b978-0-444-86893-0.50008-5

  14. H. L. Aslanyan, “Greedy set cover estimations,” Preprint (2011). arXiv:1107.4224.

  15. L. Aslanyan, “Metric decompositions and the discrete isoperimetry,” IFAC Proc. Volumes 33, 457–462 (2000). https://doi.org/10.1016/s1474-6670(17)38092-8

  16. L. Aslanyan, A. Pasic, A. Kulin, and G. Salmonsen, “Security policy adaptation reinforced through agents,” in International Seminar Conversion Potential of Armenia and ISTC Programs (Yerevan, 2000), pp. 51–54.

  17. L. Aslanyan, H. Sahakyan, H. Gronau, and P. Wagner, “Constraint satisfaction problems on specific subsets of the n-dimensional unit cube,” in 2015 Computer Science and Information Technologies (CSIT), Yerevan, 2015 (IEEE, 2015), Vol. 3, pp. 47–52. https://doi.org/10.1109/csitechnol.2015.7358249

  18. L. H. Aslanyan, “On implementation of reduced disjunctive normal form in the problem of extension of partial Boolean functions,” Junior Res., Nat. Sci., Yerevan State Univ. 20 (2), 65–75 (1974).

  19. L. H. Aslanyan, “Recognition method based on classification by disjunctive normal forms,” Cybernetics 11, 779–787 (1975). https://doi.org/10.1007/bf01071371

    Article  Google Scholar 

  20. L. H. Aslanyan, “Recognition algorithm with logical separators,” in Collection of Works on Mathematical cybernetics (Vychislitel’nyi Tsentr Akad. Nauk SSSR, Moscow, 1975), pp. 116–131.

    Google Scholar 

  21. L. H. Aslanyan, “On length of shortest disjunctive normal forms of weakly defined Boolean functions,” Appl. Math., Yerevan State Univ., No. 2, 32–40 (1982).

  22. L. H. Aslanyan, “Synthesizing of compact subsets in discrete spaces, Mathematical Methods of Pattern Recognition,” in Mathematical Methods of Pattern Recognition (Arm. SSR, 1985), pp. 21–23.

  23. L. H. Aslanyan and H. E. Danoyan, “On the optimality of the hash-coding type nearest neighbour search algorithm,” in Ninth Int. Conf. on Computer Science and Information Technologies Revised Selected Papers, Yerevan, 2013 (IEEE, 2013), pp. 1–6. https://doi.org/10.1109/csitechnol.2013.6710336

  24. L. H. Aslanyan and H. E. Danoyan, “Complexity of hash-coding type search algorithms with perfect codes,” J. Next Gener. Inf. Technol. 5 (4), 26–35 (2014).

    Google Scholar 

  25. L. H. Aslanyan and H. E. Danoyan, “Complexity of hash-coding type search algorithms with perfect codes,” Math. Probl. Comput. Sci. 51, 7–20 (2019).

    MathSciNet  Google Scholar 

  26. L. A. Aslanyan, “On the complexity of the reduced disjunctive normal form of not everywhere defined Boolean functions 1,” Uchenye Zap. Yerevansk. Gos. Univ., No. 1, 11–18 (1974).

  27. L. A. Aslanyan, “On the complexity of the reduced disjunctive normal form of not everywhere defined Boolean functions 2,” Uchenye Zap. Yerevansk. Gos. Univ., No. 3, 16–23 (1974).

  28. L. A. Aslanyan, “On problem of weak Boolean function minimization,” in Problems of Automation of Design (SzTAKI, MTA, Tanulmanyok, 1982), Vol. 135, pp. 51–86.

  29. L. A. Aslanyan and V. M. Karakhanyan, “A general description of the solutions of a discrete isoperimetric problem,” Acad. Sci. Arm. SSR Dokl. 65, 211–215 (1977).

    MathSciNet  Google Scholar 

  30. L. A. Aslanyan, V. M. Karakhanyan, and B. E. Torosyan, “Solution of a discrete isoperimetric problem,” Akad. Nauk Arm. SSR Dokl. 65, 257–262 (1977).

    MathSciNet  Google Scholar 

  31. L. A. Aslanyan, V. M. Karakhanyan, and B. E. Torosyan, “On the compactness of subsets of vertices of the n-dimensional unit cube,” Sov. Math., Dokl. 19, 781–785 (1978).

    Google Scholar 

  32. L. Aslanyan, H. Aslanyan, and H. Khosravi, “Optimal node scheduling for integrated connected-coverage in wireless sensor networks,” in Ninth Int. Conf. on Computer Science and Information Technologies Revised Selected Papers (IEEE, 2013), pp. 1–13. https://doi.org/10.1109/csitechnol.2013.6710363

  33. L. Aslanyan and J. Castellanos, “Logic based pattern recognition ontology content (1),” Inf. Theories Appl. 14, 206–210 (2007).

    Google Scholar 

  34. L. Aslanyan, H. Avagyan, and Z. Karalyan, “Whole-genome-based phylogeny of African swine fever virus,” Veterinary World 13, 2118–2125 (2020). https://doi.org/10.14202/vetworld.2020.2118-2125

    Article  CAS  PubMed  PubMed Central  Google Scholar 

  35. L. Aslanyan, J. Castellanos, F. Mingo, H. Sahakyan, and V. Ryazanov, “Algorithms for data flows,” Int. J. Inf. Theor. Appl. 10, 279–282 (2003).

    Google Scholar 

  36. L. Aslanyan and V. Karakhanyan, “Cross intersection sequel of discrete isoperimetry,” Inf. Theories Appl. 18, 203–214 (2011).

    Google Scholar 

  37. L. Aslanyan, V. Krasnoproshin, V. Ryazanov, and H. Sahakyan, “Logical-combinatorial approaches in dynamic recognition problems,” Math. Probl. Comput. Sci. 54, 96–107 (2021). https://doi.org/10.51408/1963-0063

    Article  MathSciNet  Google Scholar 

  38. L. Aslanyan and V. Ryazanov, “Logic based pattern recognition-ontology content (2),” Inf. Theories Appl. 15, 314–318 (2008).

    Google Scholar 

  39. L. Aslanyan and H. Sahakyan, “Chain split and computations in practical rule mining,” in Int. Conf. Classification, Forecasting, Data Mining CFDM 2009, Varna, Bulgaria (2009).

  40. L. Aslanyan, K. Gishyan, and H. Sahakyan, “Composite block optimized classification data structures,” in New Trends in Classification and Data Mining, Information Science and Computing, Vol. 16 (ITHEA, Sofia, 2010), pp. 25–31.

  41. L. Aslanyan and H. Sahakyan, “The splitting technique in monotone recognition,” Discrete Appl. Math. 216, 502–512 (2017). https://doi.org/10.1016/j.dam.2016.04.008

    Article  MathSciNet  Google Scholar 

  42. L. Aslanyan, H. Sahakyan, V. Romanov, G. da Costa, and R. Kacimi, “Large network target coverage protocols,” in Computer Science and Information Technologies (CSIT) (IEEE, 2019), pp. 57–64.

    Google Scholar 

  43. L. H. Aslanyan, “The discrete isoperimetry problem and related extremal problems for discrete spaces,” Probl. Kibernetiki 36, 85–128 (1979).

    Google Scholar 

  44. L. H. Aslanyan, “The discrete isoperimetric problem: Asymptotic case,” Dokl. Akad. Nauk Arm. SSR 74 (3), 99–103 (1982).

    MathSciNet  Google Scholar 

  45. L. Aslanyan, H. Sahakyan, et al., “Managing risk and safety,” in Intelligent Data Processing in Global Monitoring for Environment and Security (ITHEA, Sofia, 2011), p. 410.

    Google Scholar 

  46. T. Baicheva, I. Bouyukliev, S. Dodunekov, and V. Fack, “Binary and ternary linear quasi-perfect codes with small dimensions,” IEEE Trans. Inf. Theory 54, 4335–4339 (2008). https://doi.org/10.1109/TIT.2008.928277

    Article  MathSciNet  Google Scholar 

  47. L. Baskakova and Yu. Zhuravlev, “A model of recognition algorithms with representative samples and systems of supporting sets,” USSR Comput. Math. Math. Phys. 21 (5), 189–199 (1981). https://doi.org/10.1016/0041-5553(81)90109-9

    Article  Google Scholar 

  48. L. A. Bassalygo, G. V. Zaitsev, and V. A. Zinov, “Uniformly packed codes,” Probl. Peredachi Inf. 10 (1), 9–14 (1974).

    MathSciNet  Google Scholar 

  49. W. Blaschke, Kreis und Kugel (De Gruyter, 1964).

    Google Scholar 

  50. M. M. Bongard, The Recognition Problem: Technical report, Foreign Technology div Wright-Patterson AFB Ohio (1968).

  51. E. M. Braverman, “Experiments on machine learning to recognize visual patterns,” Autom. Remote Control 23, 315–327 (1962).

    Google Scholar 

  52. G. de Bruijn, Asymptotic Methods in Analysis (Courier Corporation, 2014).

    Google Scholar 

  53. M. Cardei, M. Thai, Yingshu Li, and Weili Wu, “Energy-efficient target coverage in wireless sensor networks,” in Proc. IEEE 24th Annual Joint Conf. of the IEEE Computer and Communications Societies. (IEEE, 2005), Vol. 3, pp. 1976–1984. https://doi.org/10.1109/infcom.2005.1498475

  54. M. Cardei, Jie Wu, Mingming Lu, and M. Pervaiz, “Maximum network lifetime in wireless sensor networks with adjustable sensing ranges,” in IEEE Int. Conf. on Wireless and Mobile Computing, Networking and Communications, 2005. (IEEE, 2005), Vol. 3, pp. 438–445. https://doi.org/10.1109/wimob.2005.1512935

  55. S. P. Chaubal, Complexity Measures of Boolean Functions and Their Applications (Faculty of the Graduate School of The University of Texas at Austin, 2020).

    Google Scholar 

  56. I. A. Chegis and S. V. Yablonskii, “Logical methods for controlling electrical systems,” Tr. Mat. Inst. Steklova 51, 270–360 (1958).

    Google Scholar 

  57. B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, “Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks,” in Proc. 7th Annual Int. Conf. on Mobile Computing and Networking (ACM, 2001), pp. 85–96. https://doi.org/10.1145/381677.381686

  58. A. A. Sapozhenko and I. P. Chukhrov, “Boolean function minimization in the class of disjunctive normal forms,” J. Sov. Math. 46, 2021–2052 (1989). https://doi.org/10.1007/BF01096022

    Article  Google Scholar 

  59. C. Haim, “Random Boolean functions induced by random Boolean expressions,” in Diploma Thesis (TU Wien, Vienna, 2016), p. 119.

  60. G. Cohen, I. Honkala, S. Litsyn, and P. Sole, Covering Codes (Elsevier, 1997).

    Google Scholar 

  61. W. Dargie and C. Poellabauer, Fundamentals of Wireless Sensor Networks (Wiley, 2010). https://doi.org/10.1002/9780470666388

    Book  Google Scholar 

  62. N. Dmitriev, Yu. I. Zhuravlev, and F. P. Krendelev, “On mathematical principles for classification of objects and phenomena,” Diskretnyi Anal. 7, 3–15 (1966).

    Google Scholar 

  63. E. V. Dyukova, “On an asymptotically optimal algorithm for constructing irredundant tests,” Sov. Math., Dokl. 18, 423–426 (1977).

    Google Scholar 

  64. P. Erdos, “Graph theory and probability,” Can. J. Math. 11, 34–38 (1959). https://doi.org/10.4153/cjm-1959-003-9

    Article  MathSciNet  Google Scholar 

  65. T. Etzion and B. Mounits, “Quasi-perfect codes with small distance,” IEEE Trans. Inf. Theory 51, 3938–3946 (2005). https://doi.org/10.1109/tit.2005.856944

    Article  MathSciNet  Google Scholar 

  66. W. Feller, Introduction to the Probability Theory and Its Applications, 3rd ed. (John Wiley & Sons, Inc., 1968).

    Google Scholar 

  67. G. P. Gavrilov and A. A. Sapozhenko, Collection of Exercises on Discrete Mathematics (Nauka, Moscow, 1977; Springer, Dordrecht, 1996). https://doi.org/10.1007/978-94-017-2770-9

  68. E. Gabidulin, A. A. Davydov, and L. M. Tombak, “Linear codes with covering radius 2 and other new covering codes,” IEEE Trans. Inf. Theory 37, 219–224 (1991). https://doi.org/10.1109/18.61146

    Article  MathSciNet  Google Scholar 

  69. D. Gardy, “Random Boolean expressions,” Discrete Math. Theor. Comput. Sci. 5, 1–36 (2005). https://doi.org/10.46298/dmtcs.3475

    Article  Google Scholar 

  70. M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, Ed. by V. Klee, A Series of Books in the Mathematical Sciences (W.H. Freeman and Company, New York, 1979).

  71. A. Ghosh and S. K. Das, “A distributed greedy algorithm for connected sensor cover in dense sensor networks,” in Distributed Computing in Sensor Systems (Springer, Berlin, 2005), pp. 340–353. https://doi.org/10.1007/11502593_26

    Book  Google Scholar 

  72. V. Gimenez, L. H. Aslanyan, J. Castellanos, and V. V. Ryazanov, “Distribution functions as attractor for recurrent neural networks,” Pattern Recognit. Image Anal. 11, 492–497 (2001).

    Google Scholar 

  73. V. Glagolev, “Some estimates of disjunctive normal forms in the algebra of logic,” Probl. Kibernetiki 19, 75–94 (1967).

    MathSciNet  Google Scholar 

  74. C. Godsil and G. Royle, Algebraic Graph Theory, Graduate Texts in Mathematics, Vol. 207 (Springer, New York, 2001). https://doi.org/10.1007/978-1-4613-0163-9

  75. H.-D. Gronau, “On maximal families of subsets of a finite set,” Discrete Math. 34, 119–130 (1981). https://doi.org/10.1016/0012-365x(81)90059-5

    Article  MathSciNet  Google Scholar 

  76. H. Gupta, S. R. Das, and Q. Gu, “Connected sensor cover,” in Proc. 4th ACM Int. Symp. on Mobile ad Hoc Networking and Computing (ACM, 2003), pp. 189–200. https://doi.org/10.1145/778415.778438

  77. I. B. Gurevich, V. V. Yashina, S. V. Ablameyko, A. M. Nedzved, A. M. Ospanov, A. T. Tleubaev, A. A. Fedorov, and N. A. Fedoruk, “Development and experimental investigation of mathematical methods for automating the diagnostics and analysis of ophthalmological images,” Pattern Recognit. Image Anal. 28, 612–636 (2018). https://doi.org/10.1134/s1054661818040120

    Article  Google Scholar 

  78. I. B. Gurevich, V. V. Yashina, A. A. Fedorov, A. M. Nedzved’, and A. T. Tleubaev, “Development, investigation, and software implementation of a new mathematical method for automating the analysis of corneal endothelium images,” Pattern Recognit. Image Anal. 27, 550–559 (2017). https://doi.org/10.1134/s1054661817030130

    Article  Google Scholar 

  79. I. B. Gurevich, A. A. Myagkov, Yu. O. Trusova, V. V. Yashina, and Yu. I. Zhuravlev, “On basic problems of image recognition in neurosciences and heuristic methods for their solution,” Pattern Recognit. Image Anal. 25, 132–160 (2015). https://doi.org/10.1134/s105466181501006x

    Article  Google Scholar 

  80. I. Gurevich and V. Yashina, “Basic models of descriptive image analysis,” in Pattern Recognition. ICPR International Workshops and Challenges, Ed. by A. Del Bimbo, Lecture Notes in Computer Science, Vol. 12665 (Springer, Cham, 2021), pp. 275–288. https://doi.org/10.1007/978-3-030-68821-9_26

    Book  Google Scholar 

  81. I. Gurevich and V. Yashina, “The algebraic approaches and techniques in image analysis,” in 19th Int. Conf. on Pattern Recognition, Tampa, Fla. and 2008 (IEEE, 2008), Vol. 2014, p. 249. https://doi.org/10.1109/icpr.2008.4760939

  82. G. Hansel, “Sur le nombre des fonctions booleennes monotones de n variables,” C. R. Hebd. des Seances de l Acad. des Sci., Serie A 262, 1088 (1966).

    MathSciNet  Google Scholar 

  83. L. H. Harper, “Optimal numberings and isoperimetric problems on graphs,” J. Comb. Theory 1, 385–393 (1966).

    Article  MathSciNet  Google Scholar 

  84. L. H. Harper, “Optimal assignments of numbers to vertices,” J. Soc. Ind. Appl. Math. 12, 131–135 (1964).

    Article  MathSciNet  Google Scholar 

  85. P. Hrubeš, “On the complexity of computing a random Boolean function over the reals,” in Electronic Colloquium on Computational Complexity, Report No. 36 (2000), pp. 1–11.

  86. Ch.-F. Huang, Yu-Ch. Tseng, and H.-L. Wu, “Distributed protocols for ensuring both coverage and connectivity of a wireless sensor network,” ACM Trans. Sensor Networks 3, 5 (2007). https://doi.org/10.1145/1210669.1210674

    Article  Google Scholar 

  87. K. Ivanova, I. Mitov, K. Markov, P. Stanchev, K. Vanhoof, L. Aslanyan, and H. Sahakyan, “Metric categorization relations based on support system analysis,” in Proc. of the 7th Int. Conf. Computer Science and Information Technologies (Citeseer, Yerevan, 2009), pp. 85–88.

  88. S. Jukna, Boolean Function Complexity: Advances and Frontiers, Algorithms and Combinatorics, Vol. 27 (Springer, Berlin, 2012). https://doi.org/10.1007/978-3-642-24508-4

  89. N. N. Katerinochkina, “Sets containing a maximal number of pairwise incomparable n-dimensional k-ary sets,” Math. Notes Acad. Sci. USSR 24, 696–700 (1978). https://doi.org/10.1007/bf01097759

    Article  MathSciNet  Google Scholar 

  90. G. Katona, “The Hamming-sphere has minimum boundary,” Stud. Sci. Math.rum Hung. 10, 131–140 (1975).

  91. G. Katona, “A theorem of finite sets,” in Classic Papers in Combinatorics, Modern Birkhäuser Classics (Birkhäuser Boston, 2009), pp. 381–401. https://doi.org/10.1007/978-0-8176-4842-8_27

  92. R. Khachatryan, “Data mining algorithmic alternatives,” in Proc. Young Scientists Conf. on Perspectives for Development of Molecular and Cellular Biology (2008), pp. 54–55.

  93. V. K. Korobkov, “On monotone functions of the algebra of logic,” Probl. Kibernetiki 13, 5–28 (1965).

    MathSciNet  Google Scholar 

  94. D. Korshunov, “On the number of monotone Boolean functions,” Probl. Kibernetiki 38, 5–109 (1981).

    MathSciNet  Google Scholar 

  95. E. Kospanov, “On algorithm of synthesis of rather simple tests,” Discrete Anal. 8, 43–47 (1966).

    MathSciNet  Google Scholar 

  96. S. Kotsiantis and D. Kanellopoulos, “Association rules mining, a recent overview,” GESTS Int. Trans. Comput. Sci. Eng. 32 (1), 71–82 (2006).

    Google Scholar 

  97. S. B. Larin and V. V. Ryazanov, “The search of precedent based logical regularities for recognition and data analysis problems,” Pattern Recognit. Image Anal. 7, 322–333 (1997).

    Google Scholar 

  98. G. S. Lbov, “21 Logical functions in the problems of empirical prediction,” in Classification Pattern Recognition and Reduction of Dimensionality, Ed. by P. R. Krishnaiah and L. N. Kanal, Handbook of Statistics, Vol. 2 (Elsevier, 1982), pp. 479–491. https://doi.org/10.1016/s0169-7161(82)02024-0

  99. B. Lindström, “The optimal number of faces in cubical complexes,” Ark. Mat. 8, 245–257 (1971). https://doi.org/10.1007/bf02589576

    Article  MathSciNet  Google Scholar 

  100. M. Lu, J. Wu, M. Cardei, and M. Li, “Energy-efficient connected coverage of discrete targets in wireless sensor networks,” in Networking and Mobile Computing, Ed. by X. Lu and W. Zhao, Lecture Notes in Computer Science, Vol. 3619 (Springer, Berlin, 2005), pp. 43–52. https://doi.org/10.1007/11534310_7

    Book  Google Scholar 

  101. O. B. Lupanov and S. V. Yablonsky, Discrete Mathematics and Mathematical Problems of Cybernetics (Nauka, Moscow, 1974).

    Google Scholar 

  102. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes (Elsevier, 1977).

    Google Scholar 

  103. V. L. Matrosov, “The capacity of polynomial expansions of a set of algorithms for calculating estimates,” USSR Comput. Math. Math. Phys. 25, 79–87 (1985). https://doi.org/10.1016/0041-5553(85)90044-8

    Article  Google Scholar 

  104. L. F. Mingo, L. Aslanyan, J. Castellanos, V. Riazanov, and M. A. Díaz, “Context neural network for temporal correlation and prediction,” in Artificial Neural Nets and Genetic Algorithms, Ed. by V. Kůrková, R. Neruda, M. Kárný, and N. C. Steele (Springer, Vienna, 2001), pp. 110–113. https://doi.org/10.1007/978-3-7091-6230-9_26

    Book  Google Scholar 

  105. L. F. Mingo, L. Aslanyan, J. Castellanos, V. Riazanov, and M. Díaz, “Fourier neural networks: An approach with sinusoidal activation functions,” Int. J. Inf. Theor. Appl. 11 (1), 52–55 (2004).

    Google Scholar 

  106. M. Mohri, A. Rostamizadeh, and A. Talwalkar, Foundations of Machine Learning (MIT Press, 2018).

    Google Scholar 

  107. M. Yu. Moshkov, “On conditional tests,” Sov. Phys., Dokl. 27, 528–530 (1982).

    Google Scholar 

  108. E. I. Nechiporuk, “The topological principles of self-correction,” Sov. Phys., Dokl. 13, 299–301 (1968).

    MathSciNet  Google Scholar 

  109. R. G. Nigmatullin, “Some metrical relation in unite cube,” Diskretnyi Anal. 9, 47–58 (1967).

    MathSciNet  Google Scholar 

  110. R. G. Nigmatullin, “Variational principle in the algebra of logic,” Diskretnyi Anal. 10, 69–89 (1967).

    MathSciNet  Google Scholar 

  111. R. G. Nigmatullin, “On uniform representation of n-dimensional unit cube,” Uchenye Zap. Kazansk. Univ. 128 (2), 95–98 (1968).

    Google Scholar 

  112. O. R. Oellermann and A. J. Schwenk, “The Laplacian spectrum of graphs,” Graph. Theory Appl. 2, 871–898 (1991).

    MathSciNet  Google Scholar 

  113. W. Wesley Peterson and E. J. Weldon, Error-Correcting Codes (MIT press, 1972).

    Google Scholar 

  114. G. Putzolu and F. Mileto, “Average values of quantities appearing in Boolean function minimization,” IEEE Trans. Electron. Compon. EC-13, 87–92 (1964). https://doi.org/10.1109/PGEC.1964.263776

    Article  MathSciNet  Google Scholar 

  115. F. Mileto and G. Putzolu, “Average values of quantities appearing in multiple output Boolean minimization,” IEEE Trans. Electron. Comput., 542–552 (1965). https://doi.org/10.1109/PGEC.1965.263994

  116. J. Riordan, An Introduction to Combinatorial Analysis (John Wiley and Sons, New York, 1958).

    Google Scholar 

  117. R. L. Rivest, “On the optimality of Elias’s algorithm for performing best-match searches,” Inf. Process. 74, 678–681 (1974).

    MathSciNet  Google Scholar 

  118. F. Rosenblatt, The Perceptron, A Perceiving and Recognizing Automaton, Report 85-60-1 (Cornell Aeronautical Laboratory, Buffalo, N.Y., 1957).

  119. J. Ruiz-Shulcloper and M. A. Abidi, “Logical combinatorial pattern recognition: A review,” Recent Res. Dev. Pattern Recognit. 3, 133–176 (2002).

    Google Scholar 

  120. V. V. Ryazanov, O. V. Senko, and Yu. I. Zhuravlev, “Methods of recognition and prediction based on voting procedures,” Pattern Recognit. Image Anal. 9, 713–718 (1999).

    Google Scholar 

  121. V. V. Ryazanov, “Logical regularities in pattern recognition (parametric approach),” Comput. Math. Math. Phys. 47, 1720–1735 (2007). https://doi.org/10.1134/s0965542507100120

    Article  MathSciNet  Google Scholar 

  122. V. V. Ryazanov, O. V. Sen’ko, L. Aslanyan, H. Sahakyan, L. F. Mingo, and J. Castellanos, “On certain hybrid classification models based on neural network and logical approaches,” Pattern Recognit. Image Anal. 11, 80–82 (2001).

    Google Scholar 

  123. H. J. Ryser, Combinatorial Mathematics, The Carus Mathematical Monographs, Vol. 14 (American Mathematical Society, 1963). https://doi.org/10.5948/upo9781614440147

  124. H. A. Sahakyan, “Gradient algorithms of synthesis of (0,1)-matrices with different rows,” Dokl. Akad. Nauk Arm. SSR 83, 207–210 (1986).

    Google Scholar 

  125. H. Sahakyan, “(0,1)-Matrices with different rows,” in Ninth Int. Conf. on Computer Science and Information Technologies Revised Selected Papers, Yerevan, 2015 (IEEE, 2015), pp. 1–7. https://doi.org/10.1109/csitechnol.2013.6710342

  126. H. Sahakyan and L. Aslanyan, “Numerical characterization of n-cube subset partitioning,” Electron. Notes Discrete Math. 27, 3–4 (2006). https://doi.org/10.1016/j.endm.2006.08.027

    Article  Google Scholar 

  127. H. Sahakyan and L. Aslanyan, “Discrete tomography with distinct rows: Relaxation,” in 2017 Computer Science and Information Technologies (CSIT), Yerevan, 2017 (IEEE, 2017), pp. 117–120. https://doi.org/10.1109/csitechnol.2017.8312153

  128. H. Sahakyan, “Numerical characterization of n-cube subset partitioning,” Discrete Appl. Math. 157, 2191–2197 (2009). https://doi.org/10.1016/j.dam.2008.11.003

    Article  MathSciNet  Google Scholar 

  129. H. Sahakyan, “Essential points of the n-cube subset partitioning characterisation,” Discrete Appl. Math. 163, 205–213 (2014). https://doi.org/10.1016/j.dam.2013.07.015

    Article  MathSciNet  Google Scholar 

  130. H. Sahakyan, “On the set of simple hypergraph degree sequences,” Appl. Math. Sci. 9, 243–253 (2015). https://doi.org/10.12988/ams.2015.411972

    Article  Google Scholar 

  131. H. Sahakyan and L. Aslanyan, “Differential balanced trees and (0, 1) matrices,” in 10th Int. Conf. Knowledge-Dialogue-Solution, Varna, Bulgaria, 2003 (FOI-Commerce, Sofia, 2003), pp. 329–336.

  132. A. A. Sapozhenko, “Metric properties of almost all Boolean functions,” Diskretnyi Anal. 10, 91–119 (1967).

    Google Scholar 

  133. A. A. Sapozhenko, “Geometrical structure of almost all functions of algebra of logic,” Probl. Kibernetiki 30, 227–262 (1975).

    Google Scholar 

  134. A. V. Serjantov, “An optimal deciphering algorithm for some classes of monotonic functions,” USSR Comput. Math. Math. Phys. 23, 144–148 (1983). https://doi.org/10.1016/s0041-5553(83)80025-1

    Article  Google Scholar 

  135. V. A. Slepyan, “On the number of dead end tests and on measures of informativeness of a column for almost all binary tables,” Sov. Math., Dokl. 11, 326–329 (1970).

    Google Scholar 

  136. N. A. Sokolov, “On the optimal evaluation of monotonic Boolean functions,” USSR Comput. Math. Math. Phys. 22 (2), 207–220 (1982). https://doi.org/10.1016/0041-5553(82)90051-9

    Article  Google Scholar 

  137. N. A. Sokolov, “Optimal reconstruction of monotone Boolean functions,” USSR Comput. Math. Math. Phys. 27 (6), 181–187 (1987). https://doi.org/10.1016/0041-5553(87)90211-4

    Article  Google Scholar 

  138. J. H. Spencer and N. Alon, The Probabilistic Method, 2nd ed. (Wiley-Interscience, New York, 2000).

    Google Scholar 

  139. P. Erdös and J. Spencer, Probabilistic Methods in Combinatorics (Academic, New York, 1974).

    Google Scholar 

  140. E. Toman, “An upper bound for the average length of a disjunctive normal form of a random Boolean function,” Comput. Artif. Intell. 2, 13–17 (1983).

    Google Scholar 

  141. G. P. Tonoyan, “The successive splitting of vertices of an n-dimensional unit cube into chains and decoding problems of monotonic boolean functions,” USSR Comput. Math. Math. Phys. 19 (6), 179–191 (1979). https://doi.org/10.1016/0041-5553(79)90047-8

    Article  Google Scholar 

  142. V. I. Torvik and E. Triantaphyllou, “Discovering rules that govern monotone phenomena,” in Data Mining and Knowledge Discovery Approaches Based on Rule Induction Techniques. Massive Computing, Ed. by E. Triantaphyllou and G. Felici, Massive Computing, Vol. 6 (Springer, Boston, 2006), pp. 149–192. https://doi.org/10.1007/0-387-34296-6_4

  143. M. N. Vaintsvaig, “Pattern recognition learning algorithm Kora,” (Sovetskoe Radio, Moscow, 1973), pp. 110–116.

    Google Scholar 

  144. L. G. Valiant, “A theory of the learnable,” Commun. ACM 27, 1134–1142 (1984). https://doi.org/10.1145/1968.1972

    Article  Google Scholar 

  145. V. Vapnik and A. Chervonenkis, Theory of Pattern Recognition (Nauka, Moscow, 1974).

    Google Scholar 

  146. Yu. L. Vasil’ev, “Comparison of the complexity of impasse d.n.f. and minimal d.n.f.,” Sov. Math., Dokl. 2, 214–217 (1966).

    MathSciNet  Google Scholar 

  147. X. Wang, G. Xing, Yu. Zhang, C. Lu, R. Pless, and C. Gill, “Integrated coverage and connectivity configuration in wireless sensor networks,” in Proc. 1st Int. Conf. on Embedded Networked Sensor Systems (ACM, 2003), pp. 28–39. https://doi.org/10.1145/958491.958496

  148. K. Weber, “Prime implicants of random Boolean functions,” Elektronische Inf.sverarbeitung und Kybernetik 19, 449–458 (1983).

  149. D. Zakrevskij, “Zakrevskij, The knowledge: Its presentation and role in recognition systems,” Int. J. Inf. Theories Appl. 10, 44–53 (2003).

    Google Scholar 

  150. D. Zakrevskij, “A common logic approach to data mining and pattern recognition,” in Data Mining and Knowledge Discovery Approaches Based on Rule Induction Techniques, Ed. by E. Triantaphyllou and G. Felici, Massive Computing, Vol. 6 (Springer, Boston, 2006), pp. 1–43. https://doi.org/10.1007/0-387-34296-6_1

  151. H. Zhang and J. C. Hou, “Maintaining sensing coverage and connectivity in large sensor networks,” in Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks (Auerbach Publications, 2005), Vol. 1, pp. 89–124. https://doi.org/10.1201/9780203323687

    Book  Google Scholar 

  152. Zh. Zhou, S. Das, and H. Gupta, “Connected k-coverage problem in sensor networks,” in Proc. 13th Int. Conf. on Computer Communications and Networks, Chicago, 2004 (IEEE, 2004), pp. 373–378. https://doi.org/10.1109/ICCCN.2004.1401672

  153. Yu. I. Zhuravlev, L. Aslanyan, V. Ryazanov, and H. Sahakyan, “Application driven inverse type constraint satisfaction problems,” Pattern Recognit. Image Anal. 27, 418–425 (2017). https://doi.org/10.1134/S1054661817030324

    Article  Google Scholar 

  154. Yu. I. Zhuravlev, “Set-theoretical methods of algebra of logic,” Probl. Kibernetiki 8, 5–44 (1962).

    Google Scholar 

  155. Yu. I. Zhuravlev, “Correct algebras over sets of incorrect (heuristic) algorithms, I,” Cybernetics 13, 489–497 (1977). https://doi.org/10.1007/BF01069539

    Article  Google Scholar 

  156. Yu. I. Zhuravlev, “Correct algebras over sets of incorrect (heuristic) algorithms, II,” Cybernetics 13, 814–821 (1977). https://doi.org/10.1007/BF01068848

    Article  Google Scholar 

  157. Yu. I. Zhuravlev, “Correct algebras over sets of incorrect (heuristic) algorithms, III,” Cybernetics 14, 188–197 (1978). https://doi.org/10.1007/BF01069349

    Article  Google Scholar 

  158. Yu. I. Zhuravlev, “On algebraic approach to solve the problems of recognition and classification,” Probl. Kibernetiki 33, 5–68 (1978).

    Google Scholar 

  159. Yu. I. Zhuravlev, Selected Scientific Works (Magistr, Moscow, 1998).

    Google Scholar 

  160. Yu. I. Zhuravlev and I. Isaev, “Construction of recognition algorithms correct for a given control sample,” USSR Comput. Math. Math. Phys. 19 (3), 175–189 (1979). https://doi.org/10.1016/0041-5553(79)90138-1

    Article  Google Scholar 

  161. Yu. I. Zhuravlev and V. V. Nikiforov, “Recognition algorithms based on computation of estimates,” Cybernetics 7, 387–400 (1971). https://doi.org/10.1007/BF01070446

    Article  Google Scholar 

  162. Yu. I. Zhuravlev and K. V. Rudakov, “On algebraic corrections of procedures of maintenance of information,” in Problems of Applied Mathematics and Informatics (1987), pp. 187–198.

  163. Yu. I. Zhuravlev, V. V. Ryazanov, L. H. Aslanyan, and H. A. Sahakyan, “On a classification method for a large number of classes,” Pattern Recognit. Image Anal. 29, 366–376 (2019). https://doi.org/10.1134/S1054661819030246

    Article  Google Scholar 

  164. Yu. I. Zhuravlev, V. Vl. Ryazanov, Vl. V. Ryazanov, L. H. Aslanyan, and H. A. Sahakyan, “Comparison of different dichotomous classification algorithms,” Pattern Recognit. Image Anal. 30, 303–314 (2020). https://doi.org/10.1134/S105466182003030X

    Article  Google Scholar 

  165. Yu. I. Zhuravlev, V. V. Ryazanov, and O. V. Senko, Recognition, Mathematical Methods, Program System, Applications (Fuzis, Moscow, 2006).

    Google Scholar 

  166. Yu. I. Zhuravlev, “Separability of subsets of vertices of the n-dimensional unit cube,” Tr. Mat. Inst. Steklov 51, 143–157 (1958).

    MathSciNet  Google Scholar 

  167. N. Yu. Zolotykh and V. N. Shevchenko, “Estimating the complexity of deciphering threshold functions in a k-valued logic,” Comput. Math. Math. Phys. 39, 328–334 (1999).

    MathSciNet  Google Scholar 

  168. Yu. A. Zuev, “Methods to improve the classification reliability, in the presence of several classifiers, based on monotony principle,” Comput. Math. Math. Phys. 21, 157–167 (1981).

    Article  Google Scholar 

Download references

ACKNOWLEDGMENTS

The author and his students, current and established, are deeply satisfied to be the followers of the world-famous and talented scientist Yurii Zhuravlev, who founded our school, provided valuable advice, and helped in both scientific and various organizational matters. May everyone have the opportunity in their life to talk with a truly great person, because it surprises, because it enriches all of our lives. All our success and our recognition started when we become the student of Yurii Zhuravlev.

Funding

This paper is partially supported by grant nos. 21T-1B314 and 21SC-BRFFR-1B029 of the Science Committee of the Ministry of Education, Science, Culture and Sport of the Republic of Armenia.

Author information

Authors and Affiliations

  1. National Academy of Sciences of Republic of Armenia, 0019, Yerevan, Armenia

    L. Aslanyan

Authors
  1. L. Aslanyan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to L. Aslanyan.

Ethics declarations

CONFLICT OF INTEREST

The author of this work declares that he has no conflicts of interest.

ETHICS APPROVAL AND CONSENT TO PARTICIPATE

This article is a completely original work of its author: it has not been published before and will not be sent to other publications until the PRIA editorial board decides not to accept it for publication.

Additional information

Levon Hakob Aslanyan was studying at Avetiq Isahakyan Secondary School in 1950’s, then, after graduating from the Yerevan Electronic Computation Technical Colledge in 1963 entered the Faculty of Mechanics and Mathematics of Yerevan State University. In 1966 according to the student exchange target program, he transferred to the Novosibirsk State University, graduating with honors in 1968. In 1969–1972 he was a post-graduate student at the Computer Center of the USSR Academy of Sciences. In 1976 he defended his PhD thesis in Physics and Mathematics at the Computing Center of the USSR Academy of Sciences, Moscow. Doctoral dissertation he defended in 1997. In 1983 he was awarded the title of Senior Researcher, and in 2008 the title of Professor. In 2014 elected Corresponding Member of National Academy of Sciences of Armenia (NAS RA) in the field of Informatics. He is the head of Discrete Mathematics Department (DM-Lab) of the Institute of Informatics and Automation of NAS RA. Aslanyan’s biography began at the Institute of Energetics of the Academy of Sciences of the Armenian SSR in 1961, and his research activities at the Institute of Mathematics of the Siberian Department of the USSR Academy of Sciences, Department of Computational Theory in 1968.

Aslanyan’s theoretical results in the field of discrete analysis are of primary scientific importance: including characterization of the efficiency of local algorithms, derivation of asymptotic formulas of reduced disjunctive normal form complexity of weakly defined Boolean functions, development of a model of logic separators for pattern recognition, description of the set of all solutions to the discrete isoperimetric problems, associative rule mining chain based methods, etc.

The systems developed by him are of practical use: including optimal algorithm for searching for the best matches, design and implementation of “cluster analysis, cognition, and statistics” (CARS) software system, seismic information data analytics by the use of automated pre-processing hardware-software tools, integrated distributed enterprise information management system, ArmReader system for automatic character recognition (OCR), software system of network protection, etc.

Aslanyan has shown great effort and enthusiasm for scientific and organizational work. Since 2003 is Co-founder of the Bulgarian Institute for Information Theories and Applications (ITHEA), is Chairman of the Scientific Council of ITHEA, Member of the Editorial Board of 5 international journals (including Information Theories and Applications, ITHEA; Journal of Next Generation Information Technology, AICIT), Member of the Conference Program Committee (Natural Information Technologies, Madrid; Classification, Forecasting and Data mining, Varna; Intelligent Information and Engineering Systems, Rzeszow; etc.). In 1997–2020 he was national contact point of European Commission scientific programs on information and telecommunication technologies to Armenia.

Aslanyan is author of almost 200 scientific articles. He has lectured at universities in Belgium, Spain, Greece, Bulgaria, Germany and other countries. His works in the field of discrete mathematics, informatics and pattern recognition have significantly contributed to raising the international rating of Armenian science.

The main scientific cooperation of DM-Lab includes: the entire scientific school of Academician of the Russian Federation Academy of Sciences Yu. I. Zhuravlyov ( CC, Moscow, Russia), scientific schools of Dr. K. Markov (ITHEA, Sofia, Bulgaria), Prof. K. Vanhoff (HU, Haselt, Belgium), Prof. Kh. Castellanos (UPM, Madrid, Spain), Prof. P. Spirakis (PU, Patras, Greece), Academician S. Oblameyko (BSU, Minsk, Belarus), Prof. H.D. Grunau (RU, Rostock, Germany), Academician G. Katona (MI, Budapest, Hungary), and other groups.

Publisher’s Note.

Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Aslanyan, L. Logic Separation: Discrete Modelling of Pattern Recognition. Pattern Recognit. Image Anal. 33, 902–936 (2023). https://doi.org/10.1134/S1054661823040077

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1054661823040077

Keywords:

Search

Navigation