{"title":"An Algorithm for Finding an Exact Solution to the Problem of Multiple Traveling Salesmen","authors":"O. A. Klimenko, B. Ya. Steinberg","doi":"10.3103/S0005105526700330","DOIUrl":"10.3103/S0005105526700330","url":null,"abstract":"<p>The paper considers the problem of several traveling salesmen. The task is to find a set of a predetermined number of disjoint cycles on a graph with weighted arcs, in which the weight (the sum of the weights of the arcs) of the largest cycle is minimal. An accurate algorithm for solving the problem based on the branch-and-bound method has been developed. Similar to the well-known Balas–Christofides algorithm for solving the traveling salesman problem, the constructed algorithm uses the Hungarian algorithm for solving the assignment problem. Numerical experiments with large-dimensional random graphs have been carried out.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"60 2","pages":"S171 - S175"},"PeriodicalIF":0.4,"publicationDate":"2026-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148695107","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Ontological Model for Integrating Cognitive and Sociological Data for Personnel Assessment","authors":"Y. A. Khalin, A. A. Ilina","doi":"10.3103/S0005105526700433","DOIUrl":"10.3103/S0005105526700433","url":null,"abstract":"<p>In the context of digital transformation of organizations and the growing volume of data, there is a demand for more transparent and explainable approaches to employee evaluation. The purpose of the study is to design and validate an ontological model (OWL 2/SHACL) that integrates employees’ cognitive indicators and sociological characteristics into a unified knowledge space to support HR processes. The scientific novelty of the work lies in the development of a unified semantic model linking data from cognitive tests, questionnaires, work context, and performance indicators; in the formulation of competency questions (CQ) that trigger reasoning mechanisms within the knowledge graph; and in the creation of patterns for predicting competency gaps, identifying the risk of overload/burnout, while ensuring ethics and nondiscrimination control. The proposed approach is based on the ontological engineering methodologies METHONTOLOGY and NeOn, semantic web concepts, and psychometric methods.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"60 2","pages":"S252 - S259"},"PeriodicalIF":0.4,"publicationDate":"2026-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148695500","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Artificial Intelligence in a Few Fragments","authors":"Yu. E. Polyak","doi":"10.3103/S0005105526700354","DOIUrl":"10.3103/S0005105526700354","url":null,"abstract":"<p>This paper is a mosaic of vivid fragments describing various industrial aspects of artificial intelligence (AI). These are sketches of a bigger picture, which may never be completed, as each day brings more information about new achievements, ideas, and threats. Discussions center around issues of civilian AI and jobs, the development of algorithms for intelligent games, the threats and dangers posed by AI, AI ethics, and standards and international norms for artificial intelligence. Each fragment is a review of the latest (mid-January 2026) Russian and international sources, with quotations, translations, screenshots, and links to original documents. This text stands as a large “fragment” on the benefits of AI applications, which was drafted at a great speed. This may well be the beginning of a separate, never-ending study.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"60 2","pages":"S181 - S201"},"PeriodicalIF":0.4,"publicationDate":"2026-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148695109","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Place of Lisp in Teaching Functional Programming","authors":"B. L. Faifel, L. V. Gorodnyaya","doi":"10.3103/S0005105526700378","DOIUrl":"10.3103/S0005105526700378","url":null,"abstract":"<p>This article examines key challenges in teaching functional programming to students already familiar with the imperative paradigm. It describes the student models and underlying complexities that arise when teaching functional programming in this context (mutable variables, loops, and sequential computations). An extended example of the transition from the imperative to the functional paradigm is provided. The return of a functional value is examined in detail using examples of numerical differentiation and interpolation. An implementation of deferred evaluation based on anonymous functions is considered. The multiparadigm Lisp language is shown to be a convenient introduction to the functional paradigm.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"60 2","pages":"S209 - S218"},"PeriodicalIF":0.4,"publicationDate":"2026-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148695110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Keldysh Institute of Applied Mathematics’ Preprints: Conversion from MS Word to HTML","authors":"A. A. Vorobjov, R. Y. Skornyakova","doi":"10.3103/S0005105526700305","DOIUrl":"10.3103/S0005105526700305","url":null,"abstract":"<div><p>In recent years, the presentation of full-text scientific articles in HTML has become widespread. This format offers several advantages for online publication compared to the traditional PDF format, owing to its more advanced tools for structuring material, embedding multimedia content, and implementing various interactive and dynamic features. Therefore, the task of converting manuscripts from the traditionally used MS Word and LaTeX formats into a high-quality HTML version that is capable of realizing the advantages of this format has become relevant. This paper presents the results of applying the approach for converting scientific articles from MS Word to HTML, proposed in previous studies, to Keldysh Institute of Applied Mathematics’ preprints. The interactive capabilities of the resulting HTML versions are described.</p></div>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"60 2","pages":"S151 - S165"},"PeriodicalIF":0.4,"publicationDate":"2026-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148695501","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Analysis of the Efficiency of Subword Tokenizers in a Low-Resource Linguistic Environment: Implementation Experience for the Tajik Language","authors":"M. K. Arabov, S. S. Khaybullina","doi":"10.3103/S0005105526700391","DOIUrl":"10.3103/S0005105526700391","url":null,"abstract":"<p>Contemporary approaches to subword text tokenization are considered in application to the low-resource Tajik language, which is characterised by a complex morphological structure and high variability of word forms. In the course of the study, a large-scale heterogeneous corpus was compiled and preprocessed, comprising 99 books and 134 497 textual articles of various genres and topics, with a total volume exceeding 33 million tokens. The corpus was cleaned of noise, normalised, and used as a basis for training and subsequent testing of subword models. On the basis of this corpus, five tokenization models were trained and analyzed, implementing the BPE, WordPiece, and Unigram algorithms using the Hugging Face Tokenizers and SentencePiece libraries. A comparative assessment was carried out according to a number of key indicators, including the out-of-vocabulary (OOV) rate, text compression ratio, tokenization speed, as well as n-gram distribution characteristics that make it possible to evaluate the ability of the models to reflect the morphological and structural organization of the language. The experimental results revealed the strengths and weaknesses of various approaches to subword segmentation and identified the most effective tokenization strategies under the conditions of the morphological complexity of the Tajik language. The findings may be used in the development of language models and applied NLP tools for Tajik and other low-resource languages, thus contributing to the expansion of their presence in the digital environment.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"60 2","pages":"S225 - S230"},"PeriodicalIF":0.4,"publicationDate":"2026-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148695111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Errors of Artificial Intelligence in Solving Combinatorial Problems","authors":"E. V. Krutenko, B. Y. Steinberg","doi":"10.3103/S0005105526700342","DOIUrl":"10.3103/S0005105526700342","url":null,"abstract":"<p>Several combinatorial exercises have been considered, which artificial intelligence solves with errors. The representatives of artificial intelligence examined are ChatGPT and DeepSeek systems. Questions (prompts) to these systems are provided, and the obtained answers are analyzed. Hypotheses are proposed regarding the reasons for the errors made by artificial intelligence when solving the tasks under consideration. It is suggested that similar errors may occur when using artificial intelligence for software development and other applications. Topics for further research are proposed, which may be of interest for determining the conditions for the continued use of artificial intelligence.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"60 2","pages":"S176 - S180"},"PeriodicalIF":0.4,"publicationDate":"2026-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148695112","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Using Open Archives of Scaled Vertical Radiosondе Ionograms as Labeled Data for Training Machine Learning Models","authors":"A. O. Schiriy","doi":"10.3103/S000510552670038X","DOIUrl":"10.3103/S000510552670038X","url":null,"abstract":"<p>The idea of using the available large arrays of ionogram processing results from vertical radiosonde of the ionosphere as training datasets for building predictive models using machine learning methods is put forward. The most common formats for saving the results of ionogram processing are considered, as well as some internet resources with archives of freely available files of these formats. These datasets are used by us to build predictive models, including time series of critical frequencies of ionospheric layers. It is also possible to use some datasets of ionogram processing results to train models designed for automatic ionogram processing.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"60 2","pages":"S219 - S224"},"PeriodicalIF":0.4,"publicationDate":"2026-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148695113","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"VIT Quantization: CPU-Centric Analysis of the Trade-off between Size and Speed","authors":"A. R. Nigmatullin, R. A. Lukmanov, A. Taha","doi":"10.3103/S0005105526700196","DOIUrl":"10.3103/S0005105526700196","url":null,"abstract":"<p>Using Vision Transformer (ViT) models in real medical practice such as, for example, in hospitals or diagnostic centers, is often difficult because doctors’ work computers usually do not have powerful graphics processors (GPUs), and computing resources are limited. This work investigates a complete practical pipeline for model inference, aimed at reducing computational costs without significant loss of predictive performance. The proposed approach combines several optimization techniques. First, knowledge distillation (KD) is used, where a compact student model learns to mimic the behavior of a larger, more accurate teacher model. Second, an exponential moving average (EMA) of the model weights is determined to stabilize training and improve generalization. Third, posttraining INT8 quantization (PTQ) is explored to reduce model size and accelerate inference. Additionally, a simplified quantization-aware training variant (QAT-lite) is considered, where the effects of quantization are partially incorporated during fine-tuning. Experiments are conducted on the ISIC dataset, which contains dermoscopic images of skin lesions. Model performance is evaluated using standard classification metrics, including accuracy, macroaveraged F1 score, and area under the ROC curve (ROC-AUC). CPU performance is also analyzed, including inference latency, throughput, memory consumption, and the final model size. The results show that posttraining INT8 quantization preserves performance close to the FP32 baseline while substantially reducing memory and computational requirements. In contrast, QAT-lite does not consistently provide reproducible improvements over PTQ.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"60 1","pages":"S102 - S110"},"PeriodicalIF":0.5,"publicationDate":"2026-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148193796","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
E. V. Samokhodkin, A. A. Elzon, E. G. Samokhodkina, D. V. Loshadkin
{"title":"The Role of Artificial Intelligence in Creation, Curation, and Interpretation of Digital Library Collections","authors":"E. V. Samokhodkin, A. A. Elzon, E. G. Samokhodkina, D. V. Loshadkin","doi":"10.3103/S0005105526700214","DOIUrl":"10.3103/S0005105526700214","url":null,"abstract":"<div><p>This study examines the role of artificial intelligence (AI) in reshaping the ecosystem of digital scholarly communication, drawing on evidence from electronic libraries and large-scale knowledge aggregators. On the basis of an integrative review of recent international and Russian-language scholarship, AI is found to be gradually evolving into a system-forming infrastructural mechanism across the life cycle of electronic collections, structuring processes of selection, digitization, metadata creation, storage, and service-oriented resource discovery and access. In parallel, intelligent recommender systems are substantiated as an epistemic mediator influencing the configuration of scholarly reading, the distribution of research attention, and the visibility of peripheral forms of knowledge within the spatial–linguistic architecture of science. It is demonstrated that algorithmic personalization cannot be reduced to improved search convenience; rather, it participates in constructing relevance norms, linguistic and regional hierarchies, and new regimes for interpreting collections. The effects identified make it possible to conceptualize algorithmic mediation at the intersection of the micro level of research identity and the macro level of the global distribution of scholarly knowledge, while also underscoring the need for reflexive governance of recommender loops to preserve epistemic diversity and enhance the transparency of libraries’ digital infrastructure.</p></div>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"60 1","pages":"S117 - S124"},"PeriodicalIF":0.5,"publicationDate":"2026-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148193805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}