发布求助
文献互助 智能选刊 最新文献

Automation and Remote Control最新文献

筛选
英文 中文
On Forced Oscillations in a Relay System with Hysteresis 论带有滞后的继电器系统中的强迫振荡
IF 0.6 4区 计算机科学
Automation and Remote Control Pub Date : 2024-08-23 DOI: 10.1134/S0005117924040088
Zh. T. Zhusubaliyev, U. A. Sopuev, D. A. Bushuev
{"title":"On Forced Oscillations in a Relay System with Hysteresis","authors":"Zh. T. Zhusubaliyev,&nbsp;U. A. Sopuev,&nbsp;D. A. Bushuev","doi":"10.1134/S0005117924040088","DOIUrl":"10.1134/S0005117924040088","url":null,"abstract":"<p>This paper discusses the phenomenon associated with the forced synchronization (“entrainment of a self-sustained oscillator by an external force”) in a relay system with hysteresis, which manifests itself in the occurrence of periodic motions close to the rhythmic activity of neurons, when packets of fast oscillations are interspersed with intervals of the slow dynamics. \u0000To study this phenomenon, we introduce a circle mapping, which, depending on the parameters, can be a circle diffeomorphism or discontinuous map (“gap map”). In both cases, this mapping demonstrates the so-called period-adding bifurcation structure. \u0000It is demonstrated that packets number of fast oscillations in the period of periodic motion is determined by the rotation number, and the length of the intervals between the packets may be found of the boundaries of the absorbing interval. The change in the number of pulses in the packet occurs through the border-collision bifurcation.</p>","PeriodicalId":55411,"journal":{"name":"Automation and Remote Control","volume":"85 4","pages":"377 - 386"},"PeriodicalIF":0.6,"publicationDate":"2024-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142198111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Self-Adjusted Consensus Clustering with Agglomerate Algorithms 利用聚类算法进行自调整共识聚类
IF 0.6 4区 计算机科学
Automation and Remote Control Pub Date : 2024-08-06 DOI: 10.1134/S0005117924030044
B. G. Mirkin, A. A. Parinov
{"title":"Self-Adjusted Consensus Clustering with Agglomerate Algorithms","authors":"B. G. Mirkin,&nbsp;A. A. Parinov","doi":"10.1134/S0005117924030044","DOIUrl":"10.1134/S0005117924030044","url":null,"abstract":"<p>This paper reports of theoretical and computational results related to an original concept of consensus clustering involving what we call the projective distance between partitions. This distance is defined as the squared difference between a partition incidence matrix and its image over the orthogonal projection in the linear space spanning the other partition incidence matrix. It appears, provided that the ensemble clustering is of a sufficient size, agglomerate clustering with the semi-average within-cluster similarity criterion effectively solves the problem of consensus partition and, moreover, of the number of clusters in it.</p>","PeriodicalId":55411,"journal":{"name":"Automation and Remote Control","volume":"85 3","pages":"241 - 251"},"PeriodicalIF":0.6,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141929961","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Plausible Reasoning in an Algorithm for Generation of Good Classification Tests 生成良好分类测试算法中的合理推理
IF 0.6 4区 计算机科学
Automation and Remote Control Pub Date : 2024-08-06 DOI: 10.1134/S0005117924030056
X. A. Naidenova, V. A. Parkhomenko, T. A. Martirova, A. V. Schukin
{"title":"Plausible Reasoning in an Algorithm for Generation of Good Classification Tests","authors":"X. A. Naidenova,&nbsp;V. A. Parkhomenko,&nbsp;T. A. Martirova,&nbsp;A. V. Schukin","doi":"10.1134/S0005117924030056","DOIUrl":"10.1134/S0005117924030056","url":null,"abstract":"<p>The paper is devoted to the application of the plausible reasoning principles to symbolic machine learning. It seems for us that the applications are essential and necessary to improve the efficiency of ML algorithms. Many such algorithms produce and use rules in the form of implication. The generation of these rules with respect to the object classes is discussed. Our classification rules are specific. Their premise part, called good closed tests (GCTs), should cover as many objects as possible. One of the algorithms of GCTs generation called NIAGARA is presented. The algorithm is revisited and new procedures based on plausible reasoning are proposed. Their correctness is proved in propositions. We use the following rules: implication, interdiction, inductive rules of extending current sets of goal-oriented objects, rules of pruning the domain of searching solution. They allow to rise the effectiveness of algorithms.</p>","PeriodicalId":55411,"journal":{"name":"Automation and Remote Control","volume":"85 3","pages":"287 - 296"},"PeriodicalIF":0.6,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141929963","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Introductory Remarks to the Special Issue Devoted to DAMDID/RCDL-2023 DAMDID/RCDL-2023 特刊序言
IF 0.6 4区 计算机科学
Automation and Remote Control Pub Date : 2024-08-06 DOI: 10.1134/S0005117924030020
{"title":"Introductory Remarks to the Special Issue Devoted to DAMDID/RCDL-2023","authors":"","doi":"10.1134/S0005117924030020","DOIUrl":"10.1134/S0005117924030020","url":null,"abstract":"","PeriodicalId":55411,"journal":{"name":"Automation and Remote Control","volume":"85 3","pages":"239 - 240"},"PeriodicalIF":0.6,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142410178","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Interestingness Indices for Building Neural Networks Based on Concept Lattices 基于概念网格构建神经网络的趣味性指数
IF 0.6 4区 计算机科学
Automation and Remote Control Pub Date : 2024-08-06 DOI: 10.1134/S000511792403010X
M. M. Zueva, S. O. Kuznetsov
{"title":"Interestingness Indices for Building Neural Networks Based on Concept Lattices","authors":"M. M. Zueva,&nbsp;S. O. Kuznetsov","doi":"10.1134/S000511792403010X","DOIUrl":"10.1134/S000511792403010X","url":null,"abstract":"<p>The difficulty of interpreting performance of neural networks is a well-known problem, which is attracting a lot of attention. In particular, neural networks based on concept lattices present a promising direction in this area. Selection of formal concepts for building a neural network has a key effect on the quality of its performance. Criteria for selecting formal concepts can be based on interestingness indices, when concepts with the highest values of a certain index are used to build a neural network. This article studies the influence of the choice of an interestingness index on the neural network performance.</p>","PeriodicalId":55411,"journal":{"name":"Automation and Remote Control","volume":"85 3","pages":"272 - 278"},"PeriodicalIF":0.6,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141929996","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Smart Routes: A System for Development and Comparison of Algorithms for Solving Vehicle Routing Problems with Realistic Constraints 智能路线：开发和比较解决具有现实约束条件的车辆路线问题的算法系统
IF 0.6 4区 计算机科学
Automation and Remote Control Pub Date : 2024-08-06 DOI: 10.1134/S0005117924030081
A. G. Soroka, G. V. Mikhelson, A. V. Mescheryakov, S. V. Gerasimov
{"title":"Smart Routes: A System for Development and Comparison of Algorithms for Solving Vehicle Routing Problems with Realistic Constraints","authors":"A. G. Soroka,&nbsp;G. V. Mikhelson,&nbsp;A. V. Mescheryakov,&nbsp;S. V. Gerasimov","doi":"10.1134/S0005117924030081","DOIUrl":"10.1134/S0005117924030081","url":null,"abstract":"<p>The problem of route optimization with realistic constraints is becoming extremely relevant in the face of global urban population growth. While we are aware of approaches that theoretically provide an exact optimal solution, their application becomes challenging as the problem size increases because of exponential complexity. We investigate the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) and compare solutions obtaining by exact solver SCIP [1] with heuristic algorithms such as LKH, 2-OPT, 3-OPT [2], the OR-Tools framework [3], and the deep learning model JAMPR [4]. We demonstrate that for problem of size 50 deep learning and classical heuristic solutions became close to SCIP exact solution but requires less time. Additionally for problems with size 100, SCIP exact methods ~13 times slower that neural and classical heuristics with the same route cost and on ~50% worse for the first feasible solution on the same time. To conduct experiments, we developed the Smart Routes platform for solving route optimization problems, which includes exact, heuristic, and deep learning models, and facilitates convenient integration of custom algorithms and datasets.</p>","PeriodicalId":55411,"journal":{"name":"Automation and Remote Control","volume":"85 3","pages":"309 - 319"},"PeriodicalIF":0.6,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141929885","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the Use of Digital Twin Data in Models Related to Considering the Environment Impact on Enterprises 论数字孪生数据在企业环境影响考量相关模型中的应用
IF 0.6 4区 计算机科学
Automation and Remote Control Pub Date : 2024-08-06 DOI: 10.1134/S0005117924030093
E. D. Viazilov, D. A. Melnikov, O. A. Minkov
{"title":"On the Use of Digital Twin Data in Models Related to Considering the Environment Impact on Enterprises","authors":"E. D. Viazilov,&nbsp;D. A. Melnikov,&nbsp;O. A. Minkov","doi":"10.1134/S0005117924030093","DOIUrl":"10.1134/S0005117924030093","url":null,"abstract":"<p>Digital twins reflect the state of the environment and the activities of enterprises affected by the hydrometeorological conditions. It is proposed to use models to calculate indicators for assessing impacts of natural hazards or of climate change; of forecasts of these impacts; damage estimates; of calculating the cost of actions to protect enterprises; of assessing the feasibility of carrying out preventive actions in order to optimize them. Requirements for impact assessment models working with a digital twin are given. The difficulties in using such models are presented. Proposals for the development of impact models are being considered. A diagram of the use of digital twins in modeling impacts of environmental on enterprises is shown.</p>","PeriodicalId":55411,"journal":{"name":"Automation and Remote Control","volume":"85 3","pages":"279 - 286"},"PeriodicalIF":0.6,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141949448","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Genetic Engineering Algorithm (GEA): An Efficient Metaheuristic Algorithm for Solving Combinatorial Optimization Problems 遗传工程算法（GEA）：解决组合优化问题的高效元启发式算法
IF 0.6 4区 计算机科学
Automation and Remote Control Pub Date : 2024-08-06 DOI: 10.1134/S000511792403007X
Majid Sohrabi, Amir M. Fathollahi-Fard, V. A. Gromov
{"title":"Genetic Engineering Algorithm (GEA): An Efficient Metaheuristic Algorithm for Solving Combinatorial Optimization Problems","authors":"Majid Sohrabi,&nbsp;Amir M. Fathollahi-Fard,&nbsp;V. A. Gromov","doi":"10.1134/S000511792403007X","DOIUrl":"10.1134/S000511792403007X","url":null,"abstract":"<p>Genetic Algorithms (GAs) are known for their efficiency in solving combinatorial optimization problems, thanks to their ability to explore diverse solution spaces, handle various representations, exploit parallelism, preserve good solutions, adapt to changing dynamics, handle combinatorial diversity, and provide heuristic search. However, limitations such as premature convergence, lack of problem-specific knowledge, and randomness of crossover and mutation operators make GAs generally inefficient in finding an optimal solution. To address these limitations, this paper proposes a new metaheuristic algorithm called the Genetic Engineering Algorithm (GEA) that draws inspiration from genetic engineering concepts. GEA redesigns the traditional GA while incorporating new search methods to isolate, purify, insert, and express new genes based on existing ones, leading to the emergence of desired traits and the production of specific chromosomes based on the selected genes. Comparative evaluations against state-of-the-art algorithms on benchmark instances demonstrate the superior performance of GEA, showcasing its potential as an innovative and efficient solution for combinatorial optimization problems.</p>","PeriodicalId":55411,"journal":{"name":"Automation and Remote Control","volume":"85 3","pages":"252 - 262"},"PeriodicalIF":0.6,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141929962","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Transformer-Based Classification of User Queries for Medical Consultancy 基于变压器的医疗咨询用户查询分类
IF 0.6 4区 计算机科学
Automation and Remote Control Pub Date : 2024-08-06 DOI: 10.1134/S0005117924030032
D. A. Lyutkin, D. V. Pozdnyakov, A. A. Soloviev, D. V. Zhukov, M. S. I. Malik, D. I. Ignatov
{"title":"Transformer-Based Classification of User Queries for Medical Consultancy","authors":"D. A. Lyutkin,&nbsp;D. V. Pozdnyakov,&nbsp;A. A. Soloviev,&nbsp;D. V. Zhukov,&nbsp;M. S. I. Malik,&nbsp;D. I. Ignatov","doi":"10.1134/S0005117924030032","DOIUrl":"10.1134/S0005117924030032","url":null,"abstract":"<p>The need for skilled medical support is growing in the era of digital healthcare. This research presents an innovative strategy, utilizing the RuBERT model, for categorizing user inquiries in the field of medical consultation with a focus on expert specialization. By harnessing the capabilities of transformers, we fine-tuned the pretrained RuBERT model on a varied dataset, which facilitates precise correspondence between queries and particular medical specialisms. Using a comprehensive dataset, we have demonstrated our approach’s superior performance with an Fl-score of over 91.8%, calculated through both cross-validation and the traditional split of test and train datasets. Our approach has shown excellent generalization across medical domains such as cardiology, neurology and dermatology. This methodology provides practical benefits by directing users to appropriate specialists for prompt and targeted medical advice. It also enhances healthcare system efficiency, reduces practitioner burden, and improves patient care quality. In summary, our suggested strategy facilitates the attainment of specific medical knowledge, offering prompt and precise advice within the digital healthcare field.</p>","PeriodicalId":55411,"journal":{"name":"Automation and Remote Control","volume":"85 3","pages":"297 - 308"},"PeriodicalIF":0.6,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141929965","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Attacks on Machine Learning Models Based on the PyTorch Framework 对基于 PyTorch 框架的机器学习模型的攻击
IF 0.6 4区 计算机科学
Automation and Remote Control Pub Date : 2024-08-06 DOI: 10.1134/S0005117924030068
D. E. Namiot, T. M. Bidzhiev
{"title":"Attacks on Machine Learning Models Based on the PyTorch Framework","authors":"D. E. Namiot,&nbsp;T. M. Bidzhiev","doi":"10.1134/S0005117924030068","DOIUrl":"10.1134/S0005117924030068","url":null,"abstract":"<p>This research delves into the cybersecurity implications of neural network training in cloud-based services. Despite their recognition for solving IT problems, the resource-intensive nature of neural network training poses challenges, leading to increased reliance on cloud services. However, this dependence introduces new cybersecurity risks. The study focuses on a novel attack method exploiting neural network weights to discreetly distribute hidden malware. It explores seven embedding methods and four trigger types for malware activation. Additionally, the paper introduces an open-source framework automating code injection into neural network weight parameters, allowing researchers to investigate and counteract this emerging attack vector.</p>","PeriodicalId":55411,"journal":{"name":"Automation and Remote Control","volume":"85 3","pages":"263 - 271"},"PeriodicalIF":0.6,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141929964","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信