AUTOMATIC CONTROL AND COMPUTER SCIENCES最新文献

{"title":"Modeling the Effect of External Actions on the Process of Automated Landing of a Quadcopter UAV on a Moving Platform Using Technical Vision","authors":"A. V. Ryabinov,&nbsp;A. I. Saveliev,&nbsp;D. A. Anikin","doi":"10.3103/S014641162470038X","DOIUrl":"10.3103/S014641162470038X","url":null,"abstract":"<p>This article describes a series of experiments in the Gazebo simulation environment aimed at studying the effect of external weather conditions on the automatic landing of an unmanned aerial vehicle (UAV) on a moving platform using computer vision and a previously developed control system based on PID and polynomial controllers. As part of the research, methods for modeling external weather conditions are developed and landing tests are carried out simulating weather conditions such as wind, light conditions, fog, and precipitation, as well as their combinations. All the experiments show a successful platform landing. During the experiments, the landing time and its accuracy are measured. The graphical and statistical analysis of the obtained results reveals the effect of light conditions, precipitation, and wind on the UAV landing time, and the introduction of wind in the simulation under any other external conditions leads to the most significant increase in the landing time. At the same time, the study fails to identify the systemic negative effect of external conditions on the accuracy of the landing. The results obtained provide valuable information for further improvement of autonomous automatic landing systems for UAVs without the use of satellite navigation systems.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 7","pages":"957 - 968"},"PeriodicalIF":0.6,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143396503","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 a Geometric Approach to the Estimation of Interpolation Projectors","authors":"M. V. Nevskii,&nbsp;A. Yu. Ukhalov","doi":"10.3103/S0146411624700330","DOIUrl":"10.3103/S0146411624700330","url":null,"abstract":"<p>Suppose <span>(Omega )</span> is a closed bounded subset of <span>({{mathbb{R}}^{n}},)</span> <span>(S)</span> is an <span>(n)</span>-dimensional nondegenerate simplex, <span>(xi (Omega ;S): = min left{ {sigma geqslant 1:Omega subset sigma S} right})</span>. Here <span>(sigma S)</span> is the result of homothety of <span>(S)</span> with respect to the center of gravity with coefficient <span>(sigma )</span>. Let <span>(d geqslant n + 1,)</span> <span>({{varphi }_{1}}(x), ldots ,{{varphi }_{d}}(x))</span> be linearly independent monomials in <span>(n)</span> variables, <span>({{varphi }_{1}}(x) equiv 1,)</span> <span>({{varphi }_{2}}(x) = {{x}_{1}}, ldots ,;{{varphi }_{{n + 1}}}(x) = {{x}_{n}}.)</span> Put <span>(Pi : = {text{lin}}({{varphi }_{1}}, ldots ,{{varphi }_{d}}).)</span> The interpolation projector <span>(P:C(Omega ) to Pi )</span> with a set of nodes <span>({{x}^{{(1)}}}, ldots ,{{x}^{{(d)}}})</span> <span>( in Omega )</span> is defined by the equalities <span>(Pfleft( {{{x}^{{(j)}}}} right) = fleft( {{{x}^{{(j)}}}} right).)</span> Denote by <span>({{left| P right|}_{Omega }})</span> the norm of <span>(P)</span> as an operator from <span>(C(Omega ))</span> to <span>(C(Omega ))</span>. Consider the mapping <span>(T:{{mathbb{R}}^{n}} to {{mathbb{R}}^{{d - 1}}})</span> of the form <span>(T(x): = ({{varphi }_{2}}(x), ldots ,{{varphi }_{d}}(x)).)</span> We have the following inequalities: <span>(frac{1}{2}left( {1 + frac{1}{{d - 1}}} right)left( {{{{left| P right|}}_{Omega }} - 1} right) + 1)</span> <span>( leqslant xi (T(Omega );S) leqslant frac{d}{2}left( {{{{left| P right|}}_{Omega }} - 1} right) + 1.)</span> Here <span>(S)</span> is the <span>((d - 1))</span>-dimensional simplex with vertices <span>(T({{x}^{{(j)}}}).)</span> We discuss this and other relations for polynomial interpolation of functions continuous on a segment. The results of numerical analysis are presented.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 7","pages":"879 - 888"},"PeriodicalIF":0.6,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143396548","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":"Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem","authors":"V. V. Vasilchikov","doi":"10.3103/S0146411624700287","DOIUrl":"10.3103/S0146411624700287","url":null,"abstract":"<p>In this paper, we propose an algorithm for solving the maximum common subgraph problem. The sequential and parallel versions of the algorithm and their software implementation are described, and their effectiveness is experimentally studied. This problem is one of the most famous NP-complete problems. Its solution may be required when solving many practical problems related to the study of complex structures. We solve it in a formulation in which we need to find all possible isomorphisms of the found common subgraph. Due to the extremely high complexity of the problem, the desire to speed up its solution by parallelizing the algorithm is quite natural. To organize parallel computing, the RPM_ParLib library is used, which makes it possible to create parallel applications running on a local computer network under the control of the .NET Framework runtime environment. The library supports a recursive-parallel programming style and ensures efficient distribution of work and dynamic load balancing of computing modules during program execution. It can be used for applications written in any programming language supported by the .NET Framework. The purpose of the numerical experiment is to study the acceleration achieved through the recursive-parallel organization of calculations. For the experiment, a special application in C# that is designed to generate various sets of initial data with specified parameters is developed. Here, we describe the characteristics of the generated initial graph pairs and the results obtained during the experiment.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 7","pages":"827 - 835"},"PeriodicalIF":0.6,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143396706","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":"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":"Model Checking Programs in Process-Oriented IEC 61131-3 Structured Text","authors":"N. O. Garanina,&nbsp;S. M. Staroletov,&nbsp;V. E. Zyubin,&nbsp;I. S. Anureev","doi":"10.3103/S0146411624700433","DOIUrl":"10.3103/S0146411624700433","url":null,"abstract":"<p>Process-oriented programming is a paradigm based on the concept of a process. Each process is a finite-state machine (FSM). This paradigm is intended for programmable logic controller (PLC) developers to write software that supports Industry 4.0. The poST language is a promising process-oriented extension of the IEC61131-3 Structured Text (ST) language designed to provide conceptual consistency between the PLC source code and the process description of the controlled process. This language combines the advantages of FSM programming with the standard syntax of the ST language. We propose a transformational semantics of poST given by rules for translating poST language statements into Promela, the input language of the SPIN model checker. Following these rules, our Xtext-based translator builds a Promela model for the poST program. The main contribution of our article is the transformational semantics of poST and a method to automatically generate Promela code from poST control programs. The resulting Promela model is ready to be verified using the SPIN model checker against the requirements for the initial poST program expressed in terms of the linear temporal logic (LTL). In this article, we give an overview of related works as well as a brief description of the poST and Promela languages. The rules presented below for translating from poST to Promela cover control flow statements, constructs for creating processes and managing their states, as well as timeout statements. Service processes for modeling the external environment and specifying high-level LTL specifications are defined separately. Then we dwell on the main ideas of implementing the poST translator in Promela and further illustrate our approach using a system for managing the consumption and production of electricity, including renewable sources.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 7","pages":"1025 - 1041"},"PeriodicalIF":0.6,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143396468","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":"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}