AUTOMATIC CONTROL AND COMPUTER SCIENCES最新文献

{"title":"NP-Completeness of the Eulerian Walk Problem for a Multiple Graph","authors":"A. V. Smirnov","doi":"10.3103/S0146411624700470","DOIUrl":"10.3103/S0146411624700470","url":null,"abstract":"<p>In this article, we consider undirected multiple graphs of any natural multiplicity <i>k</i> &gt; 1. A multiple graph contains edges of three types: ordinary edges, multiple edges, and multiedges. Each edge of the last two types is the union of linked edges that connect 2 or (<i>k</i> + 1) vertices, correspondingly. The linked edges should be used simultaneously. If a vertex is incident to a multiple edge, then it can be incident to other multiple edges, and it can also be the common end of <i>k</i> linked edges of a multiedge. If a vertex is the common end of a multiedge, then it cannot be the common end of another multiedge. We study the problem of the Eulerian walk (cycle or trail) in a multiple graph, which generalizes the classical problem for an ordinary graph. We prove that the recognition variant of the multiple Eulerian walk problem is NP-complete. To do this, we first prove NP-completeness of the auxiliary problem of covering trails with the given endpoints in an ordinary graph.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 7","pages":"1082 - 1091"},"PeriodicalIF":0.6,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143396718","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":"Minimal Covering of Generalized Typed Inclusion Dependencies in Databases","authors":"S. V. Zykin","doi":"10.3103/S0146411624700457","DOIUrl":"10.3103/S0146411624700457","url":null,"abstract":"<p>The theory and algorithms required to construct the minimal covering of generalized typed inclusion dependencies are discussed. Traditionally, the construction of the minimal covering is used for all types of dependencies in order to obtain a nonredundant and consistent database design. Generalized inclusion dependencies correspond to referential integrity constraints, when several main relations and several external relations are involved in one constraint, which corresponds to an ultragraph edge. A system of axioms with proof of consistency and completeness based on the study of dependency properties is presented in the previous study. In this study, closures for generalized typed inclusion dependencies are studied. An algorithm for constructing closures is developed. The correctness of the algorithm is proved. The results are further used to develop an algorithm for constructing the minimum covering. Examples that demonstrate the operation of the algorithms are presented at the end of the article.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 7","pages":"1063 - 1072"},"PeriodicalIF":0.6,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143396471","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":"Extracting Named Entities from Russian-Language Documents with Varying Degrees of Structural Clarity","authors":"M. D. Averina,&nbsp;O. A. Levanova","doi":"10.3103/S0146411624700391","DOIUrl":"10.3103/S0146411624700391","url":null,"abstract":"<p>This study addresses the task of recognizing named entities in Russian texts using the CRF model. We analyze two datasets: well-structured refinancing documents and loosely structured court transcripts. We test the model with various text features and CRF parameters (optimization algorithms). On average, the best F-measure for well-structured documents is 0.99, while for loosely structured ones, it is 0.86.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 7","pages":"969 - 976"},"PeriodicalIF":0.6,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143396650","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":"Generalization of Typed Inclusion Dependencies with Null Values in Databases","authors":"S. V. Zykin","doi":"10.3103/S0146411624700317","DOIUrl":"10.3103/S0146411624700317","url":null,"abstract":"<p>A new type of dependency in databases, which is a generalization of inclusion dependencies, is considered. Traditionally, such dependencies are used in practice to ensure referential integrity. In this case, the constraint is established only between a pair of relations, the first of which is called the main relation, and the second one is the external relation. In practice, referential integrity often needs to be established for a larger number of relations, where several main relations and several external relations participate in the same constraint. This structure corresponds to an ultragraph. Generalized inclusion dependencies that take into account the presence of null values in external relations are justified. The system of axioms is obtained based on a study of the properties of typed dependencies. The consistency (soundness) and completeness of the system are proved.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 7","pages":"861 - 868"},"PeriodicalIF":0.6,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143396651","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":"Algorithm for Link Prediction in a Self-Regulating Network with Adaptive Topology Based on Graph Theory and Machine Learning","authors":"E. Yu. Pavlenko","doi":"10.3103/S0146411624700354","DOIUrl":"10.3103/S0146411624700354","url":null,"abstract":"<p>This article presents a functional graph model of a network with adaptive topology, where the network nodes represent the graph vertices, and data exchange between the nodes is represented as edges. The dynamic nature of network interaction complicates the solution of the problem of monitoring and controlling the operation of a network with adaptive topology, which should be done in order to ensure a guaranteed correct network interaction. The importance of solving such a problem is justified by the creation of modern information and cyber-physical systems, which are based on networks with adaptive topology. The dynamic nature of links between nodes, on the one hand, makes it possible to provide self-regulation of the network and, on the other hand, significantly complicates the control over the network operation, because it is impossible to identify a single pattern of network interaction. On the basis of the developed model of the network with adaptive topology, a graph algorithm for link prediction is proposed, which is extended to the case of peer-to-peer networks. The algorithm is based on the significant parameters of network nodes characterizing both their physical characteristics (signal level and battery charge) and their characteristics as objects of network interaction (characteristics of the centrality of graph nodes). The correctness and adequacy of the developed algorithm is confirmed by the experimental results on modeling a peer-to-peer network with adaptive topology and its self-regulation when different nodes are removed.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 7","pages":"904 - 919"},"PeriodicalIF":0.6,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143396500","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":"Zhegalkin Polynomial of a Multiary Sole Sufficient Operator","authors":"L. Y. Bystrov,&nbsp;E. V. Kuzmin","doi":"10.3103/S0146411624700275","DOIUrl":"10.3103/S0146411624700275","url":null,"abstract":"<p>Sole sufficient operators are of particular interest among functionally complete sets of Boolean functions. They have a wide range of applicability and are not limited to the binarity case. In this paper, we formulate conditions imposed on the Zhegalkin polynomial coefficients that are necessary and sufficient for the polynomial to correspond to a sole sufficient operator. The polynomial representation of constant-preserving Boolean functions is considered. It is shown that the properties of monotonicity and linearity do not need to be specifically considered when describing a sole sufficient operator. The concept of a dual remainder polynomial is introduced; the value of it allows one to determine the self-duality of a Boolean function. It is proven that a Boolean function preserving 0 and 1 or preserving neither 0 nor 1 is self-dual if and only if the dual remainder of the corresponding Zhegalkin polynomial is 0 for any sets of values of the function variables. The system of leading coefficients is obtained based on this fact. The solution of the system makes it possible to formulate a criterion for the self-duality of a Boolean function represented by a Zhegalkin polynomial, which imposes necessary and sufficient conditions on the polynomial coefficients. Thus, it is shown that Zhegalkin polynomials are a rather convenient tool for studying precomplete classes of Boolean functions.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 7","pages":"808 - 826"},"PeriodicalIF":0.6,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143396705","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":"C Language Extension to Support Procedural-Parametric Polymorphism","authors":"A. I. Legalov,&nbsp;P. V. Kosov","doi":"10.3103/S014641162470024X","DOIUrl":"10.3103/S014641162470024X","url":null,"abstract":"<p>Software development is often related to expanding functionality. To improve reliability in this case, it is necessary to minimize the change in the previously written code. For instrumental support of the evolutionary development of programs, a procedural-parametric programming paradigm is proposed, which makes it possible to increase the capabilities of the procedural approach. This allows extending both data and functions effortlessly. This paper considers the inclusion of procedural-parametric programming in the C language. Additional syntactic constructions are proposed to support the proposed approach. These constructions include: parametric generalizations, specializations of generalizations, generalizing functions, and specialization handlers. Their semantics, possibilities, and features of technical implementation are described. To check the possibilities of using this approach, models of procedural-parametric constructions in the C programming language are built. The example in this article demonstrates the flexible extension of the program and support of multiple polymorphism.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 7","pages":"762 - 778"},"PeriodicalIF":0.6,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143396685","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":"On Simplifying Mixed Boolean-Arithmetic Expressions","authors":"Yu. V. Kosolapov","doi":"10.3103/S0146411624700299","DOIUrl":"10.3103/S0146411624700299","url":null,"abstract":"<p>Mixed Boolean-arithmetic expressions (MBA expressions) with <i>t</i> integer <i>n</i>-bit variables are often used for program obfuscations. Obfuscation consists of replacing short expressions with longer equivalent expressions that seem to take the analyst more time to explore. This paper shows that to simplify linear MBA expressions (reduce the number of terms), a technique similar to the technique of decoding linear codes by information sets can be applied. Based on this technique, algorithms for simplifying linear MBA expressions are constructed: an algorithm for finding an expression of minimum length and an algorithm for reducing the length of an expression. Based on the length reduction algorithm, an algorithm is constructed that allows us to estimate the resistance of an MBA expression to simplification. We experimentally estimate the dependence of the average number of terms in a linear MBA expression returned by simplification algorithms on <i>n</i>, the number of decoding iterations, and the power of the set of Boolean functions, by which a linear combination with a minimum number of nonzero coefficients is sought. The results of the experiments for all considered <i>t</i> and <i>n</i> show that if before obfuscation the linear MBA expression contained <i>r</i> = 1, 2, 3 terms, then the developed simplification algorithms with a probability close to one allow using the obfuscated version of this expression find an equivalent one with no more than <i>r</i> terms. This is the main difference between the information set decoding technique and the well-known techniques for simplifying linear MBA expressions, where the goal is to reduce the number of terms to no more than <i>2</i>^<i>t</i>. We also found that for randomly generated linear MBA expressions with increasing <i>n</i>, the average number of terms in the returned expression tends to <i>2</i>^<i>t</i> and does not differ from the average number of terms in the linear expression returned by known simplification algorithms. The results obtained, in particular, make it possible to determine <i>t</i> and <i>n</i> for which the number of terms in the simplified linear MBA expression on average will not be less than the given one.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 7","pages":"836 - 852"},"PeriodicalIF":0.6,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143396707","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":"Keyword Generation for Russian-Language Scientific Texts Using the mT5 Model","authors":"A. V. Glazkova,&nbsp;D. A. Morozov,&nbsp;M. S. Vorobeva,&nbsp;A. A. Stupnikov","doi":"10.3103/S014641162470041X","DOIUrl":"10.3103/S014641162470041X","url":null,"abstract":"<p>The authors propose an approach to generate keywords for Russian-language scientific texts using the mT5 (multilingual text-to-text transformer) model, fine-tuned on the Keyphrases CS&amp;Math Russian text corpus. Automatic keyword selection is an urgent task in natural language processing, since keywords help readers search for articles and facilitate the systematization of scientific texts. In this paper, the task of selecting keywords is considered as a task of automatic text abstracting. Additional training of mT5 is carried out on the texts of abstracts of Russian-language scientific articles. The input and output data are abstracts and comma-separated lists of keywords, respectively. The results obtained using mT5 are compared with the results of several basic methods: TopicRank, YAKE!, RuTermExtract, and KeyBERT. The following metrics are used to present the results: F‑measure, ROUGE-1, and BERTScore. The best results on the test sample are obtained using mT5 and RuTermExtract. The highest F-measure is demonstrated by the mT5 model (11.24%), surpassing RuTermExtract by 0.22%. RuTermExtract shows the best result according to the ROUGE-1 metric (15.12%). The best results for BERTScore are also achieved by these two methods: mT5, 76.89% (BERTScore using the mBERT model); RuTermExtract, 75.8% (BERTScore based on ruSciBERT). The authors also assess the ability of mT5 to generate keywords that are not in the source text. The limitations of the proposed approach include the need to form a training sample for additional model training and probably the limited applicability of the additional trained model for texts in other subject areas. The advantages of keyword generation using mT5 are the absence of the need to set fixed values for the length and number of keywords, the need for normalization, which is especially important for inflected languages, and the ability to generate keywords that are not explicitly present in the text.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 7","pages":"995 - 1002"},"PeriodicalIF":0.6,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143396719","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":"Motion Control of Manipulator Robots via Two PD-Based Nonlinear Controllers: Design and Comparative Analysis","authors":"Hassène Gritli,&nbsp;Sahar Jenhani,&nbsp;Jyotindra Narayan","doi":"10.3103/S0146411624701086","DOIUrl":"10.3103/S0146411624701086","url":null,"abstract":"<p>The motion control or trajectory tracking is a fundamental and benchmark problem while controlling the manipulator robots to move along a predefined trajectory. Extensive research in the literature has addressed the motion control problem for robotic manipulators. To address this challenge effectively, it becomes imperative to design suitable controllers and make adequate choices regarding the appropriate feedback gain values. In this study, we consider and investigate two PD-based nonlinear control laws for controlling the motion of manipulator robots, namely the PD-plus-compensation controller and the augmented one. We establish conditions for determining the feedback gains of these two controllers, ensuring tracking error stability. Moreover, conditions guaranteeing the uniqueness of the zero error of the closed-loop robotic system are developed. Finally, we consider a two-degree-of-freedom manipulator robot to reveal the effectiveness of the two proposed controllers in tracking a desired trajectory and hence evaluating their performance in addressing the motion control problem.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 6","pages":"603 - 616"},"PeriodicalIF":0.6,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142995230","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}