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

Graph-Based Self-Regulation for Different Types of Networks with Adaptive Topology 针对具有自适应拓扑的不同类型网络的基于图的自调节功能

IF 0.6

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2024-02-29 DOI: 10.3103/S0146411623080217

E. Yu. Pavlenko, M. A. Pakhomov

引用次数: 0

Features of Detecting Malicious Installation Files Using Machine Learning Algorithms 使用机器学习算法检测恶意安装文件的特点

IF 0.6

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2024-02-29 DOI: 10.3103/S0146411623080333

P. E. Yugai, E. V. Zhukovskii, P. O. Semenov

引用次数: 0

A Method of Network Access Control for Ensuring Network Infrastructure Security Based on Severing Superfluous Network Connectivity 一种基于切断多余网络连接确保网络基础设施安全的网络访问控制方法

IF 0.6

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2024-02-29 DOI: 10.3103/S0146411623080308

A. D. Shilova, A. A. Vorob’eva

引用次数: 0

Protection of Computational Machine Learning Models against Extraction Threat 保护计算机器学习模型免受提取威胁

IF 0.6

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2024-02-29 DOI: 10.3103/S0146411623080084

M. O. Kalinin, M. D. Soshnev, A. S. Konoplev

引用次数: 0

Stability Analysis of the Architecture of Messaging Systems with a Decentralized Node Structure 具有分散节点结构的信息传递系统架构的稳定性分析

IF 0.6

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2024-02-29 DOI: 10.3103/S0146411623080205

E. M. Orel, D. A. Moskvin, I. A. Anoshkin

引用次数: 0

Improving the Quality of the Identification of the Information Security State Based on Sample Segmentation 基于样本细分提高信息安全状态识别质量

IF 0.6

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2024-02-29 DOI: 10.3103/S0146411623080321

M. E. Sukhoparov, I. S. Lebedev

引用次数: 0

Investigation of the Structure of the Isogeny Graph for Postquantum Cryptography Protocols 后量子密码学协议同源图结构研究

IF 0.6

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2024-02-29 DOI: 10.3103/S0146411623080102

S. O. Kostin, E. B. Aleksandrova

引用次数: 0

Improving the Efficiency of Multiagent Information Security Systems by Post-Quantum Cryptography Methods 用后量子密码学方法提高多代理信息安全系统的效率

IF 0.6

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2024-02-29 DOI: 10.3103/S0146411623080035

S. V. Bezzateev, S. G. Fomicheva, A. F. Suprun

引用次数: 0

Recursive-Parallel Algorithm for Solving the Graph-Subgraph Isomorphism Problem 解决图-子图同构问题的递归-并行算法

IF 0.6

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2024-02-27 DOI: 10.3103/S0146411623070155

V. V. Vasilchikov

{"title":"Recursive-Parallel Algorithm for Solving the Graph-Subgraph Isomorphism Problem","authors":"V. V. Vasilchikov","doi":"10.3103/S0146411623070155","DOIUrl":"10.3103/S0146411623070155","url":null,"abstract":"The paper proposes a parallel algorithm for solving the graph-subgraph isomorphism problem and makes an experimental study of its efficiency. The problem is one of the most well-known NP-complete problems. Its solution may be required when solving many practical problems associated with the study of complex structures. We solve the problem in a formulation that requires finding all the existing isomorphic substitutions or proving their absence. Due to the complexity of the problem, it is natural to want to speed up its solution by parallelizing the algorithm. We use the RPM_ParLib library, developed by the author, as the main tool to program the algorithm. This library allows us to develop effective applications for parallel computing on a local network under the control of the runtime environment .NET Framework. Due to this library, the applications have the ability to generate parallel branches of computation directly during program execution and dynamically redistribute work between computing modules. Any language with support of the .NET Framework can be used as a programming language in conjunction with this library. For the numerical experiment, an open database from the Internet was used, which was specially developed to study algorithms for searching for isomorphic substitutions. The author has also developed a special application in C# for generating additional sets of initial data with the specified characteristics. The aim of the experiment is to study the speedup achieved due to the recursively parallel organization of computations. This paper provides a detailed description of the proposed algorithm and the results obtained during the experiment.","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"57 7","pages":"672 - 682"},"PeriodicalIF":0.6,"publicationDate":"2024-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140001450","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

The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph 在可分割多重图中寻找最短路径的多项式算法

IF 0.6

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2024-02-27 DOI: 10.3103/S0146411623070143

A. V. Smirnov

{"title":"The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph","authors":"A. V. Smirnov","doi":"10.3103/S0146411623070143","DOIUrl":"10.3103/S0146411623070143","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 multiedges. 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 also be incident to other multiple edges and it can be the common end of k linked edges of some multiedge. If a vertex is the common end of some multiedge, it cannot be the common end of another multiedge. Divisible multiple graphs are characterized by the possibility to divide the graph into k parts, which are adjusted on the linked edges and which have no common edges. Each part is an ordinary graph. As for an ordinary graph, we can define the integer function of the length of an edge for a multiple graph and set the problem of the shortest path joining two vertices. Any multiple path is a union of k ordinary paths, which are adjusted on the linked edges of all multiple and multiedges. In this article, we show that the problem of the shortest path is polynomial for a divisible multiple graph. The corresponding polynomial algorithm is formulated. We also propose the modification of the algorithm for the case of an arbitrary multiple graph. This modification has an exponential complexity in the parameter k.","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"57 7","pages":"841 - 853"},"PeriodicalIF":0.6,"publicationDate":"2024-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140001808","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