Mathematical Modeling and Algorithms for Problem of Constructing Scent Lineups of Olfactory Analysis for Single Object and Single Test Subject
DOI:
https://doi.org/10.14529/cmse260104Keywords:
olfactory analysis, ethogram, formal language, combinatorics, algorithmizationAbstract
The aim of this study is to develop algorithms and a software package for generating scent lineups for odor traces in olfactory forensic examination. A mathematical model based on formal language theory is proposed for the problem of constructing scent lineups and forming an ethogram for identification-oriented olfactory examination involving a single object and a single test subject. An ethogram serves as a working research map, documenting the placement of objects in lineups, the deployment, and the signaling behavior of detector dogs. For each of the four comparative sequences within the ethogram of the examination under consideration, a distinct formal language is constructed. The generation of ten-letter words for each language follows standardized requirements, which allowed for the identification of specific templates. A template defines the order of placement for meaningful odor samples within each lineup. Thus, the mathematical problem of ethogram compilation is reduced to selecting four words from their corresponding languages. This problem is combinatorial nature, subject to multiple constraints dictated by the practical field. The paper presents a description of the algorithms and the software package developed to solve the stated problem. An analysis of the language cardinality for each lineup is performed, and the generative capabilities of the ethogram construction algorithm are examined.References
Rossiyskoy Federatsii (MVD Rossii) M. vnutrennikh del Prikaz MVD Rossii ot 29.06.2005 No. 511 “Voprosy organizatsii proizvodstva sudebnykh ekspertiz v ekspertnokriminalisticheskikh podrazdeleniyakh organov vnutrennikh del Rossiyskoy Federatsii”, Registered with the Ministry of Justice of Russia on 15.08.2005 No. 6903. / Online version of the legal reference system “ConsultantPlus”. URL: https://www.consultant.ru/document/cons_doc_LAW_55315/ (accessed: 18.12.2025) (in Russian).
Sulimov K.T. Kriminalisticheskaya odorologiya: kinologicheskij podhod. Moscow: Russian Heritage Institute, 2019. 312 p. (in Russian).
Obrazcov V.A. Kriminalistika: uchebnik. Moscow: YUrist, 1997. 760 p. (in Russian).
Zorina Z.A., Poletaeva I.I. Zoopsihologiya. Elementarnoe myshlenie zhivotnyh: Uchebnoe posobie. Moscow: Aspect Press Ltd, 2002. 102 p. (in Russian).
Sobko G.M. Veroyatnostno-statisticheskoe obosnovanie dostovernosti odorologicheskoj identifikacii. Voprosy teorii sudebnoj ekspertizy. Sbornik nauch. trudov. 1977. No. 31. P. 142–177. (in Russian).
Panfilov P.B. Veroyatnostno-statisticheskoe obosnovanie dostovernosti ol’faktornyh issledovanij zapahovyh sledov cheloveka v sudebnoj ekspertize. YUridicheskie nauki. 2006. Vol. 17, no. 1. P. 172–186. (in Russian).
Ferry B., Ensminger J.J., Schoon A., et al. Scent lineups compared across eleven countries: Looking for the future of a controversial forensic technique. Forensic Science International. 2019. Vol. 302. P. 109895. DOI: 10.1016/j.forsciint.2019.109895.
Pimenov M.G., Salamatin A.V., Panfilov P.B., et al. Podgotovka sobak-detektorov pahuchih sledov cheloveka: Metodicheskie rekomendacii. Moscow: EKC MVD Rossii, 2006. 56 p. (in Russian).
Panfilov P.B. Biodetekciya i interpretaciya povedeniya sobak-detektorov v indentifikacionnom ol’faktornom issledovanii. Forensic Examination. Volgograd, 2008. Vol. 15, no. 3. P. 104–112. (in Russian).
Aho A.V., Ullman J.D. The theory of parsing, translation, and compiling. Vol. 1. NJ: Prentice-Hall Englewood Cliffs, 1972. 560 p.
Lothaire M. Algebraic Combinatorics on Words. Cambridge University Press, 2002. 455 p. Encyclopedia of Mathematics and its Applications. DOI: 10.1017/CBO9781107326019.
Substitutions in Dynamics, Arithmetics and Combinatorics. Vol. 1794 / ed. by N.P. Fogg, V. Berthé, S. Ferenczi, et al. Springer Berlin, Heidelberg, 2002. 402 p. Lecture Notes in Mathematics. DOI: 10.1007/b13861.
Petrova E.A., Shur A.M. Branching Densities of Cube-Free and Square-Free Words. Algorithms. 2021. Vol. 14, no. 4. P. 1–19. DOI: 10.3390/a14040126.
Shur A.M. Kombinatornaya slozhnost’ ratsional’nykh yazykov [Combinatorial complexity of regular languages]. Diskretnyi Analiz i Issledovanie Operatsii. Seriya 1. 2005. Vol. 12, no. 2. P. 78–99. (in Russian).
Belazzougi J., Kolpakov R., Raffinot M. Indexing and Detecting Symbol Sets in One-Dimensional and Two-Dimensional Words. Journal of Mathematical Sciences. 2018. Vol. 233, no. 1. P. 1–9. DOI: 10.1007/s10958-018-3921-y.
MacFie A. Enumerative properties of restricted words and compositions. Carleton University, 2019. 121 p. DOI: 10.22215/etd/2019-13532.
Chen H.Z., Kitaev S., Mütze T., Sun B.Y. On universal partial words. The European Conference on Combinatorics, Graph Theory and Applications, EUROCOMB’17, Vienna, August 28 – September 1, 2017. Vol. 61. 2017. P. 231–237. DOI: 10.1016/j.endm.2017.06.043.
Starovoytov V.I. Forensic Olfactory Expertise Traces of Smelling Substances from the Person Blood and Sweat. Zakony Rossii: opyt, analiz. praktika. Moscow, 2011. No. 12. P. 70–79. (in Russian).
Soldatenko A., Semenova D., Goldenok E., et al. Research on the Problem of Constructing Scent Lineups of Olfactory Analysis. 2023 IEEE 17th International Conference on Application of Information and Communication Technologies, AICT. Baku, October 18–20, 2023. IEEE, 2023. P. 1–4. DOI: 10.1109/AICT59525.2023.10313149.
Soldatenko A.A., Semenova D.V. Postroenie sravnitel’nyh ryadov dlya zadachi ol’faktornogo analiza. Informational Technologies and Mathematical Modelling (ITMM-2024): Proceedings of the 23rd International Conference named after A.F. Terpugov, Tomsk, October 20–26, 2024. Tomsk: Tomsk State University Publishing, 2024. P. 263–268. (in Russian).
Glincka/dogtree-data Templates trees for problem of constructing scent lineups of olfactory analysis for single object and single test subject. URL: https://github.com/Glincka/dogtree-data (accessed: 02.04.2026).
