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

The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph

IF 0.6

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2025-02-12 DOI: 10.3103/S0146411624700226

A. V. Smirnov

引用次数: 0

Construction of the Optimal Information Exchange Scheme of an Adaptive Motion Control System for a Group of Unmanned Aerial Vehicles 构建无人飞行器群自适应运动控制系统的最佳信息交换方案

IF 0.6

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2025-02-12 DOI: 10.3103/S0146411624700238

L. N. Kazakov, E. P. Kubyshkin, D. E. Paley

引用次数: 0

Semantic Rule-Based Sentiment Detection Algorithm for Russian Publicism Sentences

IF 0.6

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2025-02-12 DOI: 10.3103/S0146411624700408

A. Y. Poletaev, I. V. Paramonov, E. I. Boychuk

引用次数: 0

The Algorithms for the Eulerian Cycle and Eulerian Trail Problems for a Multiple Graph

IF 0.6

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2025-02-12 DOI: 10.3103/S0146411624700342

A. V. Smirnov

{"title":"The Algorithms for the Eulerian Cycle and Eulerian Trail Problems for a Multiple Graph","authors":"A. V. Smirnov","doi":"10.3103/S0146411624700342","DOIUrl":"10.3103/S0146411624700342","url":null,"abstract":"In this article, we consider undirected multiple graphs of any natural multiplicity k > 1. A multiple graph contains edges of three types: ordinary edges, multiple edges, and multiedges. Each edge of the last two types is a union of k linked edges that connect 2 or (k + 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 k 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 set 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 necessary conditions of existence of an Eulerian walk in a multiple graph are formulated; it is shown that these conditions are not sufficient. In addition, it is shown that the necessary conditions of existence of an Eulerian cycle and an Eulerian trail are not mutually exclusive for an arbitrary multiple graph; therefore, it is possible to construct a multiple graph in which two types of Eulerian walks exist simultaneously. Any multiple graph can be juxtaposed to the ordinary graph with quasi-vertices, which represents the structure of the initial graph in a simpler form. In particular, each Eulerian walk in the multiple graph corresponds to the Eulerian walk in the graph with quasi-vertices. The algorithm for constructing such a graph is formulated. The auxiliary problem of finding the covering trails with the given endpoints in an ordinary graph is also considered, and two algorithms for solving it are obtained. We elaborate the algorithm for finding the Eulerian walk in a multiple graph, which has exponential complexity. For the special case of a multiple graph, a polynomial algorithm is proposed; it is shown that in this special case the necessary conditions of existence of an Eulerian walk are sufficient.","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 7","pages":"889 - 903"},"PeriodicalIF":0.6,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143396504","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

Requirement Patterns in Deductive Verification of poST Programs

IF 0.6

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2025-02-12 DOI: 10.3103/S0146411624700421

I. M. Chernenko, I. S. Anureev, N. O. Garanina

{"title":"Requirement Patterns in Deductive Verification of poST Programs","authors":"I. M. Chernenko, I. S. Anureev, N. O. Garanina","doi":"10.3103/S0146411624700421","DOIUrl":"10.3103/S0146411624700421","url":null,"abstract":"Process-oriented programming is one of the approaches used to develop control software. A process-oriented program is defined as a sequence of processes. Each process is represented by a set of named states containing a program code that define the logic of the process’ behavior. Program execution is a sequential execution of each of these processes in their current states at each iteration of the control loop. Processes can interact through changing the states of each other and shared variables. This paper develops a method for classifying temporal requirements for process-oriented programs in order to simplify and automate the deductive verification of such programs. The method consists of the following steps. At the first step, the requirements are formalized in a specialized language DV-TRL, a variant of the typed first-order predicate logic with a set of interpreted types and predicate and functional symbols that reflects specific concepts of the control systems in the process-oriented paradigm. At the second step, the formalized requirements are divided into classes, each of which is defined by a pattern—a parametric formula of the DV-TRL language. The verification conditions generated for process-oriented programs with respect to the requirements satisfying the same pattern have the same proof scheme. At the third step, appropriate proof schemes are developed. In our paper, we first give a brief introduction to the poST language, a process-oriented extension to the ST language of the IEC 61131-3 standard. Next, the DV-TRL language is defined. We also provide a collection of natural language requirements for several control systems. Then we define the patterns that fully cover all the requirements of this collection. For each of these patterns, we give an example of a formalized requirement from the collection and describe a scheme for proving the verification conditions for this pattern. St-atistics on the distribution of requirements from the collection over patterns reveals the most popular patterns. We also analyze related works.","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 7","pages":"1003 - 1024"},"PeriodicalIF":0.6,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143396470","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

Modeling the Effect of External Actions on the Process of Automated Landing of a Quadcopter UAV on a Moving Platform Using Technical Vision

IF 0.6

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2025-02-12 DOI: 10.3103/S014641162470038X

A. V. Ryabinov, A. I. Saveliev, D. A. Anikin

{"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, A. I. Saveliev, D. A. Anikin","doi":"10.3103/S014641162470038X","DOIUrl":"10.3103/S014641162470038X","url":null,"abstract":"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.","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}

引用次数: 0

On a Geometric Approach to the Estimation of Interpolation Projectors

IF 0.6

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2025-02-12 DOI: 10.3103/S0146411624700330

M. V. Nevskii, A. Yu. Ukhalov

{"title":"On a Geometric Approach to the Estimation of Interpolation Projectors","authors":"M. V. Nevskii, A. Yu. Ukhalov","doi":"10.3103/S0146411624700330","DOIUrl":"10.3103/S0146411624700330","url":null,"abstract":"Suppose (Omega ) is a closed bounded subset of ({{mathbb{R}}^{n}},) (S) is an (n)-dimensional nondegenerate simplex, (xi (Omega ;S): = min left{ {sigma geqslant 1:Omega subset sigma S} right}). Here (sigma S) is the result of homothety of (S) with respect to the center of gravity with coefficient (sigma ). Let (d geqslant n + 1,) ({{varphi }_{1}}(x), ldots ,{{varphi }_{d}}(x)) be linearly independent monomials in (n) variables, ({{varphi }_{1}}(x) equiv 1,) ({{varphi }_{2}}(x) = {{x}_{1}}, ldots ,;{{varphi }_{{n + 1}}}(x) = {{x}_{n}}.) Put (Pi : = {text{lin}}({{varphi }_{1}}, ldots ,{{varphi }_{d}}).) The interpolation projector (P:C(Omega ) to Pi ) with a set of nodes ({{x}^{{(1)}}}, ldots ,{{x}^{{(d)}}}) ( in Omega ) is defined by the equalities (Pfleft( {{{x}^{{(j)}}}} right) = fleft( {{{x}^{{(j)}}}} right).) Denote by ({{left| P right|}_{Omega }}) the norm of (P) as an operator from (C(Omega )) to (C(Omega )). Consider the mapping (T:{{mathbb{R}}^{n}} to {{mathbb{R}}^{{d - 1}}}) of the form (T(x): = ({{varphi }_{2}}(x), ldots ,{{varphi }_{d}}(x)).) We have the following inequalities: (frac{1}{2}left( {1 + frac{1}{{d - 1}}} right)left( {{{{left| P right|}}_{Omega }} - 1} right) + 1) ( leqslant xi (T(Omega );S) leqslant frac{d}{2}left( {{{{left| P right|}}_{Omega }} - 1} right) + 1.) Here (S) is the ((d - 1))-dimensional simplex with vertices (T({{x}^{{(j)}}}).) We discuss this and other relations for polynomial interpolation of functions continuous on a segment. The results of numerical analysis are presented.","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}

引用次数: 0

Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem

IF 0.6

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2025-02-12 DOI: 10.3103/S0146411624700287

V. V. Vasilchikov

{"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":"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.","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}

引用次数: 0

Annotation of Text Corpora by Sentiment and Irony in a Project of Citizen Science 在公民科学项目中通过情感和反讽对文本语料库进行注释

IF 0.6

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2025-02-12 DOI: 10.3103/S0146411624700263

I. V. Paramonov, A. Y. Poletaev

{"title":"Annotation of Text Corpora by Sentiment and Irony in a Project of Citizen Science","authors":"I. V. Paramonov, A. Y. Poletaev","doi":"10.3103/S0146411624700263","DOIUrl":"10.3103/S0146411624700263","url":null,"abstract":"This paper studies the construction of a corpus of sentences annotated by general sentiment into four classes (positive, negative, neutral, and mixed), a corpus of phrasemes annotated by sentiment into three classes (positive, negative, and neutral), and a corpus of sentences annotated by the presence or absence of irony. The annotation is conducted by volunteers within the project Preparing Texts for Algorithms on the People of Science website. Based on the available knowledge of the subject area for each of the problems, guidelines for the annotators are compiled. A methodology for the statistical processing of the annotation results is also developed based on analyzing the distributions and agreement measures of the annotations of different annotators. For annotating sentences by irony and phrasemes by sentiment, the agreement measures are quite high (the full agreement rate is 0.60–0.99), while for annotating sentences by general sentiment, the agreement is low (the full agreement rate is 0.40), apparently due to the higher complexity of the problem. It is also shown that the performance of automatic algorithms for sentence sentiment analysis improves by 12–13% when using a corpus on whose sentences all annotators (3–5 people) agree compared with a corpus annotated by only one volunteer.","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 7","pages":"797 - 807"},"PeriodicalIF":0.6,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143396704","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

NP-Completeness of the Eulerian Walk Problem for a Multiple Graph 多图欧拉行走问题的 NP 完备性

IF 0.6

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2025-02-12 DOI: 10.3103/S0146411624700470

A. V. Smirnov

引用次数: 0