AUTOMATIC CONTROL AND COMPUTER SCIENCES最新文献_第8页

Reconfiguration of the Development Model of an Information Security Management System: Interaction between Core Modules and the Operator 信息安全管理系统开发模式的重构：核心模块与操作者的交互

IF 0.5

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2026-02-24 DOI: 10.3103/S0146411625700701

A. F. Suprun, Yu. V. Vedernikov, A. Yu. Gar’kushev, A. V. Lipis

引用次数: 0

From Exploitation to Protection: Analysis of Attacks on Large Language Models 从利用到保护：对大型语言模型的攻击分析

IF 0.5

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2026-02-24 DOI: 10.3103/S0146411625700750

S. V. Bezzateev, I. S. Velichko

引用次数: 0

Intelligent Data Analysis and Processing for Detecting Insider Data Confidentiality Breaches in a DBMS 智能数据分析和处理检测内部数据保密违规在一个数据库管理系统

IF 0.5

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2026-02-24 DOI: 10.3103/S0146411625701007

M. A. Poltavtseva, E. S. Lavrenko

引用次数: 0

Network Traffic Anonymization in Blockchain Systems Based on Garlic Routing 基于大蒜路由的区块链系统网络流量匿名化

IF 0.5

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2026-02-24 DOI: 10.3103/S0146411625700737

V. M. Krundyshev, A. K. Skrypnikov, M. O. Kalinin

引用次数: 0

Application of a Genetic Algorithm for Selecting Neural Network Hyperparameters 遗传算法在神经网络超参数选择中的应用

IF 0.5

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2026-02-24 DOI: 10.3103/S0146411625700907

V. V. Platonov, A. F. Suprun, Ya. E. Yanbarisova, V. G. Anisimov

引用次数: 0

Optimization of a Search Information System in a Database of Directive Documents 指令文件数据库检索信息系统的优化

IF 0.5

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2026-02-24 DOI: 10.3103/S0146411625701068

F. G. Pashaev, S. E. Pashaeva, N. A. Maksudova

{"title":"Optimization of a Search Information System in a Database of Directive Documents","authors":"F. G. Pashaev, S. E. Pashaeva, N. A. Maksudova","doi":"10.3103/S0146411625701068","DOIUrl":"10.3103/S0146411625701068","url":null,"abstract":"To set optimization tasks in an electronic directive document management system, an enterprise can be represented as a set of functional units performing specific functions. In large enterprises, there is a constant exchange between individual divisions of the enterprise and the documentation bases of the divisions. Solutions to several problems related to document databases are analyzed. Here, the primary concern is the selection of a model that can define the relationship between the query execution time and document volumes. The model of this relationship is close to a linear dependence, which is used when assessing the benefits of dividing the database into natural groups. As a method for optimizing the work of the search information system in the database of directive documents, the partitioning of the database into groups according to the sources of document creation is given. Some advantages of such a grouping are explored. To solve the problem, an experimental Table 1 is provided showing the relationship between the volume of data and the execution time of queries. Ordinary least squares fitting is used to select the linear or hyperbolic models used in this Table 1. It is known that databases of directive documents store documents of local or international significance that are created and recommended for implementation by local or international organizations. To improve performance, documents in a database can be grouped by their importance, by the date they are entered into the system, and by the organization that creates the document. A method for grouping directive documents according to the sources of their creation is presented, as well as some numerical characteristics indicating the advantages of this grouping.","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"59 8","pages":"1497 - 1503"},"PeriodicalIF":0.5,"publicationDate":"2026-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147341633","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}

引用次数: 0

Keywords, Morpheme Parsing, and Syntactic Trees: Features for Text Complexity Assessment 关键词，语素解析和句法树：文本复杂性评估的特征

IF 0.5

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2026-02-19 DOI: 10.3103/S0146411625700294

D. A. Morozov, I. A. Smal, T. A. Garipov, A. V. Glazkova

{"title":"Keywords, Morpheme Parsing, and Syntactic Trees: Features for Text Complexity Assessment","authors":"D. A. Morozov, I. A. Smal, T. A. Garipov, A. V. Glazkova","doi":"10.3103/S0146411625700294","DOIUrl":"10.3103/S0146411625700294","url":null,"abstract":"The task of assessing the complexity of a text is a relevant applied problem with potential application in drafting legal documents, editing textbooks, and selecting books for extracurricular reading. The methods for generating a feature vector when automatically assessing the text’s complexity are quite diverse. Early approaches relied on easily calculable quantities, such as the average length of a sentence or the average number of syllables per word. With the development of natural language processing algorithms, the space of used features is expanding. In this study, we examine three groups of features: (1) automatically generated keywords, (2) information about the features of morphemic word parsing, and (3) information about the diversity, branching, and depth of syntactic trees. The RuTermExtract algorithm is utilized to generate keywords, a convolutional neural network model is used to generate morphemic parses, and the Stanza model, trained on the SynTagRus corpus, is used to generate syntax trees. We conduct a comparison using four different machine learning algorithms and four annotated Russian-language text corpora. The corpora used differ both in the domain and annotation paradigm, due to which the results obtained more objectively reflect the real relationship between the characteristics and the text’s complexity. The use of keywords perform worse on average than the use of topic markers obtained using the latent Dirichlet allocation (LDA). In most situations, morphemic characteristics turn out to be more effective than previously described methods for assessing the lexical complexity of a text: the frequency of words and the occurrence of word-formation patterns. The use of an extensive set of syntactic features allows, in most cases, improving the quality of the work of neural network models in comparison with the previously described set.","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"59 7","pages":"929 - 940"},"PeriodicalIF":0.5,"publicationDate":"2026-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147340171","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}

引用次数: 0

Some Polynomial Subclasses of the Eulerian Walk Problem for a Multiple Graph 多图欧拉行走问题的若干多项式子类

IF 0.5

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2026-02-19 DOI: 10.3103/S0146411625700348

A. V. Smirnov

{"title":"Some Polynomial Subclasses of the Eulerian Walk Problem for a Multiple Graph","authors":"A. V. Smirnov","doi":"10.3103/S0146411625700348","DOIUrl":"10.3103/S0146411625700348","url":null,"abstract":"In this paper, we study undirected multiple graphs of any natural multiplicity (k > 1). There are edges of three types: ordinary edges, multiple edges, and multi-edges. Each edge of the last two types is a union of (k) linked edges, which connect 2 or ((k + 1)) vertices, correspondingly. The linked edges should be used simultaneously. If a vertex is incident to a multiple edge, it can be also incident to other multiple edges and it can be the common end of (k) linked edges of some multi-edge. If a vertex is the common end of some multi-edge, it cannot be the common end of another multi-edge. We study the problem of finding the Eulerian walk (the cycle or the trail) in a multiple graph, which generalizes the classical problem for an ordinary graph. The multiple Eulerian walk problem is NP-hard. We prove the polynomiality of two subclasses of the multiple Eulerian walk problem and elaborate the polynomial algorithms. In the first subclass, we set a constraint on the ordinary edges reachability sets, which are the subsets of vertices joined by ordinary edges only. In the second subclass, we set a constraint on the quasi-vertices degrees in a graph with quasi-vertices. The structure of this ordinary graph reflects the structure of the multiple graph, and each quasi-vertex is determined by (k) indices of the ordinary edges reachability sets, which are incident to some multi-edge.","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"59 7","pages":"1015 - 1031"},"PeriodicalIF":0.5,"publicationDate":"2026-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147340307","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}

引用次数: 0

Mathematical Properties of the Agent-Based Model of Extinction–Recolonization for Population Genetics 种群遗传学中基于agent的灭绝-再定居模型的数学性质

IF 0.5

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2026-02-19 DOI: 10.3103/S0146411625700245

N. V. Gaianov

引用次数: 0

Automatic Determination of Semantic Similarity of Student Answers with the Reference Answer Using Modern Models 利用现代模型自动确定学生答案与参考答案的语义相似度

IF 0.5

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2026-02-19 DOI: 10.3103/S0146411625700282

N. S. Lagutina, K. V. Lagutina, V. N. Kopnin

{"title":"Automatic Determination of Semantic Similarity of Student Answers with the Reference Answer Using Modern Models","authors":"N. S. Lagutina, K. V. Lagutina, V. N. Kopnin","doi":"10.3103/S0146411625700282","DOIUrl":"10.3103/S0146411625700282","url":null,"abstract":"This paper presents the results of a study of modern text models in order to identify, on their basis, the semantic similarity of English-language texts. The task of determining semantic similarity of texts is an important component of many areas of natural language processing: machine translation, information retrieval, question and answer systems, and artificial intelligence in education. The authors solve the problem of classifying the similarity of student answers to the teacher’s reference answer. The neural network language models BERT and GPT, previously used to determine the semantic similarity of texts, the new neural network model Mamba, as well as the stylometric features of the text are chosen for the study. Experiments are carried out with two text corpora: the Text Similarity corpus from open sources and the custom corpus, collected with the help of philologists. The quality of the problem solution is assessed by precision, recall, and the F-measure. All neural network language models show a similar F-measure quality of about 86% for the larger Text Similarity corpus and 50–56% for the custom corpus. The successful application of the Mamba model A gives a completely new result. However, the most interesting achievement concerns the use of vectors of the stylometric features of the text, which show an 80% F-measure for the custom corpus and the same quality of problem solving as neural network models for another corpus.","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"59 7","pages":"920 - 928"},"PeriodicalIF":0.5,"publicationDate":"2026-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147340617","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}

引用次数: 0