bsuirДоклады БГУИРDoklady BGUIR1729-76482708-0382БГУИР10.35596/1729-7648-2024-22-4-76-83bsuir-3959Research ArticleСтатьиМера различия для управляемых вероятностных тестовDifference Measure for Controlled Random TestsЯрмоликВ. Н.YarmolikV. N.

Ярмолик Вячеслав Николаевич, д-р техн. наук, проф., проф. каф. программного обеспечения информационных технологий,

220013, г. Минск, ул. П. Бровки, 6.

Тел.: +375 29 769-96-77.

Yarmolik Vyacheslav Nikolaevich, Dr. of Sci. (Tech.), Professor, Professor at the Department of Information Technology Software,

6, P. Brovki St., Minsk, 220013.

Phone: +375 29 769-96-77

yarmolik10ru@yahoo.comПетровскаяВ. В.PetrovskayaV. V.

Петровская В. В., магистр техн. наук каф. программного обеспечения информационных технологий, 

Минск.

VITA V. PETROVSKAYA, M. of Sci. at the Department of Information Technology Software, 

Minsk.

ШевченкоН. А.ShauchenkaM. A.

Шевченко Н. А., студент, 

г. Дармштадт.

MIKALAI А. SHAUCHENKA, Student,

Darmstadt.

Белорусский государственный университет информатики и радиоэлектроники (БГУИР)Belarusian State University of Informatics and Radioelectronics (BSUIR)Дармштадтский технический университетDarmstadt Technical University2024030920242247683Copyright © Ярмолик В.Н., Петровская В.В., Шевченко Н.А., 20242024Ярмолик В.Н., Петровская В.В., Шевченко Н.А.Yarmolik V.N., Petrovskaya V.V., Shauchenka M.A.Данная работа распространяется под лицензией Creative Commons Attribution 4.0.This work is licensed under a Creative Commons Attribution 4.0 License.https://doklady.bsuir.by/jour/article/view/3959

Исследована задача построения характеристик различия тестовых последовательностей. Обоснованы ее актуальность для генерирования управляемых вероятностных тестов и сложность нахождения мер отличия для символьных тестов. Показана ограниченность применения традиционных характеристик расстояния для получения меры различия тестовых наборов. Для двоичного случая определена новая мера различия MH(Ti, Tk) двух символьных тестовых наборов Ti и Tk на основе классического расстояния Хэмминга. Данная мера представляет собой n компонент, каждая из которых определяется расстоянием Хэмминга между двоичным набором Ti и циклически сдвинутым на v бит набором Tk. Рассмотрены основные свойства предложенной меры различия и показана ее эффективность для классификации кандидатов в тесты при генерировании управляемых вероятностных тестов. Приведены экспериментальные результаты, подтверждающие эффективность меры различия.

The task of constructing test sequences difference characteristics was studied. Its relevance for generating controlled random tests and complexity in finding difference measures for the case of symbolic tests were substantiated. The limitations of using traditional distance characteristics to obtain a measure of the difference between test sets are shown. For the binary case, a new measure of the difference MH(Ti, Tk) of two character test sets Ti and Tk is defined based on the classical Hamming distance. This measure represents n components, each of which is determined by the Hamming distance between the binary set Ti and the pattern Tk cyclically shifted by v bits. The main properties of the proposed dissimilarity measure are reviewed and its effectiveness for classifying test candidates when generating controlled random tests is shown. Experimental results are presented that confirm the effectiveness of the proposed difference measure.

мера различиярасстояние Хэммингарасстояние Левенштейнатесттестовый наборmeasure of differenceHamming distanceLevenshtein distancetesttest patternReferencesHamming R. W. (1950) Error Detecting and Error Correcting Codes. Bell System Tech. J. 29, 147‒160.Hamming R. W. (1950) Error Detecting and Error Correcting Codes. Bell System Tech. J. 29, 147‒160.Yarmolik V. N., Shevchenko N. A., Petrovskaya V. V. (2022) A Measure of Dissimilarity to Generate Controlled Random Tests. Doklady BGUIR. 20 (6), 52‒60 (in Russian).Yarmolik V. N., Shevchenko N. A., Petrovskaya V. V. (2022) A Measure of Dissimilarity to Generate Controlled Random Tests. Doklady BGUIR. 20 (6), 52‒60 (in Russian).Sadovsky M. G. (2002) Comparison of Symbol Sequences: No Editing, No Alignment. Open Systems & Information Dynamics. 9 (1), 19‒36.Sadovsky M. G. (2002) Comparison of Symbol Sequences: No Editing, No Alignment. Open Systems & Information Dynamics. 9 (1), 19‒36.Tannga M. J., Rahman S., Hasniati (2017) Comparative Analysis of Levenshnein Distance Algorithm and Jaro Winkler for Text Document Plagiarism Detection Application. J. of Technology Research in Information System and Engineering. 4 (2), 44‒54.Tannga M. J., Rahman S., Hasniati (2017) Comparative Analysis of Levenshnein Distance Algorithm and Jaro Winkler for Text Document Plagiarism Detection Application. J. of Technology Research in Information System and Engineering. 4 (2), 44‒54.Bookstein A., Klein S. T., Raita T. (2001) Fuzzy Hamming Distance: A New Dissimilarity Measure. Proceedings of 12th Annual Symposium on Combinatorial Pattern Matching, CPM2001. 1‒4.Bookstein A., Klein S. T., Raita T. (2001) Fuzzy Hamming Distance: A New Dissimilarity Measure. Proceedings of 12th Annual Symposium on Combinatorial Pattern Matching, CPM2001. 1‒4.Shallit J. (2009) Hamming Distance for Conjugates. Discrete Mathematics. 309 (12), 4197‒4199.Shallit J. (2009) Hamming Distance for Conjugates. Discrete Mathematics. 309 (12), 4197‒4199.Yarmolik V. N. (2019) Monitoring and Diagnostics of Computer Systems. Minsk, Bestprint Publ. (in Russian).Yarmolik V. N. (2019) Monitoring and Diagnostics of Computer Systems. Minsk, Bestprint Publ. (in Russian).Yarmolik V. N., Mrozek I., Yarmolik S. V. (2015) Controlled Method of Random Test Synthesis. Automatic Control and Computer Sciences. 49 (6), 395‒403.Yarmolik V. N., Mrozek I., Yarmolik S. V. (2015) Controlled Method of Random Test Synthesis. Automatic Control and Computer Sciences. 49 (6), 395‒403.Levantsevich V. A., Yarmolik V. N. (2019) Multiple Controlled Random Testing. Doklady BGUIR. 121 (3), 65‒69 (in Russian).Levantsevich V. A., Yarmolik V. N. (2019) Multiple Controlled Random Testing. Doklady BGUIR. 121 (3), 65‒69 (in Russian).Volchikhin V. I., Ivanov A. I., Karpov A. P., Yunin A. P. (2019) Conditions for the Correct Calculation of the Entropy of Meaningful Long Passwords in the Hamming Convolution Space with Reference Texts in Russian and English. Instruments and Methods of Measurement. 29 (3), 33–38 (in Russian).Volchikhin V. I., Ivanov A. I., Karpov A. P., Yunin A. P. (2019) Conditions for the Correct Calculation of the Entropy of Meaningful Long Passwords in the Hamming Convolution Space with Reference Texts in Russian and English. Instruments and Methods of Measurement. 29 (3), 33–38 (in Russian).

The authors declare that there are no conflicts of interest present.