检索结果-内蒙古大学图书馆

5th International Conference on Computing Science, Communication and Security

作者： Gupta, Anushka Dubey, Aayush Hiremath, Abhay Anirruth, V. Jijo, Jeny PES Univ Bangalore India

ISBN: (纸本)9783031751691;9783031751707

Distributed systems, which have become an integral and inseparable component of the modern technology infrastructure, hold data protection in the highest regard. It is of utmost importance to safeguard the constantly expanding and growing amount of data that is present within these distributed systems, as the methods employed by malicious attackers are continuously evolving. This evolution necessitates a forward-thinking and proactive approach to the detection and containment of these attacks. In line with this, this scholarly article introduces a highly robust containment system that has been specifically designed to minimize the time required for recovery and to mitigate the impact of cyberattacks on distributed systems. The proposed system makes use of a comprehensive and all-encompassing set of techniques in order to accurately identify and effectively isolate compromised nodes within the distributed environment that has been targeted by an attack. By implementing this isolation process, the containment system successfully prevents any further damage from occurring and effectively halts any potential data breaches, all while ensuring the preservation and integrity of the existing files that reside within the compromised node. Ultimately, the true effectiveness and power of this system lies within its unique ability to automate the containment process, thereby enabling a rapid and efficient response to any cyberattack that may occur, resulting in minimal downtime and disruption.

关键词： Distributed Systems Network Security Docker RAFT consensus algorithm Intrusion Detection System

来源：评论

学校读者我要写书评

暂无评论

Distributed Average consensus and Abstract Control

Distributed Average Consensus and Abstract Control

引用

IEEE Conference on Control Technology and Applications (CCTA)

作者： Sorge, James Crandall, Kyle L. Yates, Connor Wilhelmi, Corbin Brigham Young Univ Provo UT 84602 USA US Naval Res Lab 4555 Overlook Ave SW Washington DC 20375 USA

ISBN: (数字)9781665473385

ISBN: (纸本)9781665473385

There are multiple challenges to swarm control, including controller complexity, scalability, and the need for shared information in a coordinated fashion. One key solution to moving swarms of robots is abstract control, where an abstract state is chosen to represent the swarm and determine how it interacts with its objectives. Knowledge of the current abstract state of the swarm is necessary to control said state. In previous work, this has largely been calculated using an external global observer, however this presents a severe limitation in scalability and practicality. This paper proposes a method for calculating the swarm's abstract state utilizing a simple distributed average consensus algorithm that allows for time varying communication graphs with limited connectivity. We discuss our consensus driven abstract control framework and discuss how it works per several metrics including convergence speed, and stability. We present simulated results demonstrating this framework on a toy problem with a time-varying, stochastic communications graph.

关键词： Measurement Scalability Robot kinematics Toy manufacturing industry Decentralized control consensus algorithm Observers

来源：评论

学校读者我要写书评

暂无评论

Reaching consensus in the Presence of Contention-Related Crash Failures 24th

Reaching Consensus in the Presence of Contention-Related Cra...

引用

24th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)

作者： Durand, Anais Raynal, Michel Taubenfeld, Gadi Univ Clermont Auvergne LIMOS CNRS UMR 6158 Aubiere France Univ Rennes IRISA CNRS INRIA F-35042 Rennes France Reichman Univ IL-4610101 Herzliyya Israel

ISBN: (纸本)9783031210167;9783031210174

While consensus is at the heart of many coordination problems in asynchronous distributed systems prone to process crashes, it has been shown to be impossible to solve in such systems where processes communicate by message-passing or by reading and writing a shared memory. Hence, these systems must be enriched with additional computational power for consensus to be solved on top of them. This article presents a new restriction of the classical basic computational model that combines process participation and a constraint on failure occurrences that can happen only while a predefined contention threshold has not yet been bypassed. This type of failure is called lambda-constrained crashes, where lambda defines the considered contention threshold. It appears that when assuming such contention-related crash failures and enriching the system with objects whose consensus number is k >= 1, consensus for n processes can be solved for any n >= k assuming up to k failures. The article proceeds incrementally. It first presents an algorithm that solves consensus on top of read/write registers if at most one crash occurs before the contention threshold lambda = n - 1 has been bypassed. Then, it shows that if the system is enriched with objects whose consensus number is k >= 1, then - when lambda = n - k, consensus can be solved despite up to k lambda-constrained crashes, for any n >= k, and - when lambda = n - 2k + 1, consensus can be solved despite up to 2k - 1 lambda-constrained crashes, assuming k divides n. Finally, impossibility results are presented for the number of lambda-constrained failures that can be tolerated.

关键词： consensus algorithm Asynchronous system Atomic register Concurrency consensus number Contention lambda-constrained failure Participating process Process crash failure Read/write register

来源：评论

学校读者我要写书评

暂无评论

Quantitative Group Testing with Tunable Adaptation

Quantitative Group Testing with Tunable Adaptation

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Soleymani, Mahdi Javidi, Tara Univ Calif San Diego Halicioglu Data Sci Inst San Diego CA 92103 USA Univ Calif San Diego Dept Elect & Comp Engn San Diego CA USA

ISBN: (纸本)9798350382853;9798350382846

The aim of quantitative group testing problem is to recover k defective items from a set of n items using minimal number of quantitative/additive group tests, where each test reveals the number of defective items present in the group. Fully adaptive strategies have been proposed and shown to, in general, require significantly fewer measurements. In the sublinear regime, where k = n(alpha) for 0 < alpha < 1, for instance, this means a gain proportional to alpha log n. However, this gain is obtained at the cost of significant complexity associated with adapting tests to previous outcomes. This paper introduces a family of low-complexity strategies with efficient construction and decoding. These strategies adapt tests only in stages, allowing for a flexible trade-off between the number of stages, i.e., the complexity cost of adaptation, and the overall number of tests i.e., the adaptivity gain. Specifically, our algorithm matches the state-of-the-art adaptive algorithm in terms of the number of measurements while reducing the required number of stages by a multiplicative factor of 1 - alpha. Our results demonstrates that a small number of stages can lead to substantial improvements over non-adaptive strategies. Furthermore, in comparison to existing non-adaptive algorithms, our algorithm achieves a 47% improvement in the overall number of tests, with the addition of just one stage.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Improved Variation Genetic algorithm for Travelling Salesman Problem 10

Improved Variation Genetic Algorithm for Travelling Salesman...

引用

10th International Conference on Control, Decision and Information Technologies (CoDIT)

作者： Diveev, Askhat Shmalko, Elizaveta Russian Acad Sci Fed Res Ctr Comp Sci & Control Vavilova Str 44 Moscow 119333 Russia

ISBN: (纸本)9798350373981;9798350373974

The work presents original approach for solving the most popular computational traveling salesman problem. This is a modified genetic algorithm built on the basis of the principle of small variations of the basic solution. Its advantage is that the time of its operation does not depend on the complexity of the problem in this case on the number of cities, but only depends on the parameters of the algorithm. In this algorithm, a possible solution is not an ordered set of visited cities but a set of small variations of some one possible solution. This solution is called basic. It is determined by the researcher as the closest to the optimal solution. In this case, the basic solution is made by a greedy algorithm. During the search process, the basic solution changes to the best current solution found. Together with the genetic algorithm, an accurate overlap algorithm is used, which has polynomial complexity and improves solutions by eliminating the self-intersections of the path.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Formation Control of Uncertain Multi-agent Systems with Non-Identical Actuation Capacities

Formation Control of Uncertain Multi-agent Systems with Non-...

引用

AIAA SciTech Forum

作者： Kurttisi, Atahan Sarioglu, Eren Dogan, K. Merve Embry Riddle Aeronaut Univ Dept Aerosp Engn Daytona Beach FL 32114 USA Embry Riddle Aeronaut Univ Fdn Autonomous Syst & Technol Lab Daytona Beach FL 32114 USA

ISBN: (数字)9781624107115

ISBN: (纸本)9781624107115

Multi-agent systems offer low-cost and flexible solutions for complex tasks thanks to their advantages and efficient algorithms. One of the most important features of multi-agent systems is operating in a formation for example, carrying a slung-load by using several multi-copters or platooning autonomous trucks. However, building control algorithms to provide formation control is not straightforward as real physical systems are affected by non-linear uncertainties and non-identical actuator-related issues. Being inspired by the nature of the real physical systems, in this research, we focus on designing distributed adaptive control algorithms to obtain formation control for multi-agent systems with uncertainties, unknown actuation efficiency, and actuator dynamics. Specifically, we utilize a leader-follower distance-based consensus algorithm together with adaptive terms to cancel out unknown and undesired effects. To do this, we use hedging-based reference models to decouple adaptation from the actuator dynamics. We analyze the stability of the multi-agent system by using the Lyapunov Stability Theory, and investigate feasible actuator bandwidth limits with the Linear Matrix Inequalities (LMI) method. Finally, we show the efficacy of the designed control law on a multi-agent system with both on undirected line graph and a fully connected graph. In addition, the results of this paper is compared with the previous results given in [1].

关键词： Multi Agent System Actuators Model Reference Adaptive Control consensus algorithm Adaptive Control algorithm American Institute of Aeronautics and Astronautics Feedback Control System

来源：评论

学校读者我要写书评

暂无评论

Avoiding Distractions in Parity Games 12th

Avoiding Distractions in Parity Games

引用

12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation

作者： van Dijk, Tom Univ Twente Formal Methods & Tools Enschede Netherlands

ISBN: (纸本)9783031753794;9783031753800

We consider algorithms for parity games that use attractor decomposition, such as Zielonka's recursive algorithm, priority promotion, and tangle learning. In earlier work, we identified the Two Counters parity game family that requires exponential time for many algorithms, including attractor decomposition algorithms, and we identified the main mechanism that slows down parity game algorithms as so-called distractions. We observe a fundamentally different approach in avoiding distractions between algorithms that use attractor decomposition and algorithms that compute progress measures. We now propose an alternative attractor-based method to avoid distractions by applying the attractor decomposition recursively. We demonstrate that this algorithm solves the Two Counters games efficiently, but that a modification of the Two Counters method can also delay the recursive algorithm exponentially.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

The Proximal ID algorithm

引用

Journal of Machine Learning Research 2023年第1期24卷 1-46页

作者： Shpitser, Ilya Wood-Doughty, Zach Tchetgen Tchetgen, Eric J. Department of Computer Science Johns Hopkins University BaltimoreMD21218 United States Department of Computer Science Northwestern University EvanstonIL60208 United States Department of Statistics The Wharton School 3620 Locust Walk PhiladelphiaPA19104 United States

Unobserved confounding is a fundamental obstacle to establishing valid causal conclusions from observational data. Two complementary types of approaches have been developed to address this obstacle: obtaining identification using fortuitous external aids, such as instrumental variables or proxies, or by means of the ID algorithm, using Markov restrictions on the full data distribution encoded in graphical causal models. In this paper we aim to develop a synthesis of the former and latter approaches to identification in causal inference to yield the most general identification algorithm in multivariate systems currently known – the proximal ID algorithm. In addition to being able to obtain nonparametric identification in all cases where the ID algorithm succeeds, our approach allows us to systematically exploit proxies to adjust for the presence of unobserved confounders that would have otherwise prevented identification. In addition, we outline a class of estimation strategies for causal parameters identified by our method in an important special case. We illustrate our approach by simulation studies and a data application. ©2023 Ilya Shpitser, Zach Wood-Doughty and Eric Tchetgen Tchetgen.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Next-Gen Healthcare: Blockchain-Fuelled Federated Learning for IoMT Security 4

Next-Gen Healthcare: Blockchain-Fuelled Federated Learning f...

引用

4th International Conference on Artificial Intelligence and Signal Processing

作者： Mohapatra, Subasish Mishra, Ayashkant Mohanty, Subhadarshini OUTR Sch Comp Sci Bhubaneswar Odisha India

ISBN: (纸本)9798350350661;9798350350654

The Internet of Medical Things (IoMT) is revolutionising the healthcare landscape by seamlessly integrating medical devices, sensors, and healthcare information systems. This interconnected network of devices is designed to improve patient outcomes, enhance healthcare delivery, and streamline medical processes. However, as IoMT continues to evolve, it introduces new challenges related to data security, privacy, and interoperability. Blockchain technology has emerged as a promising solution to address these challenges, offering a decentralised and secure framework for managing health-related data in IoMT applications. This research aims to implement a blockchain-enabled network within a Federated Learning-based Internet of Medical Things (IoMT) environment. The proposed framework features a centralized server hosting a global machine learning model. IoMT devices operate with local models that run concurrently with the global model, incorporating device-specific data. Simulations and comparisons have been conducted on the predominant consensus models, namely Proof of Stake and Proof of Work. These ongoing initiatives aspire to play a role in enhancing the security and privacy aspects of the latest developments in the Internet of Medical Things.

关键词： Blockchain Decentralisation Federated Learning consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Distributed algorithm for Edge Agreement Over Nonlinear Constraints

Distributed Algorithm for Edge Agreement Over Nonlinear Cons...

引用

American Control Conference (ACC)

作者： Rai, Ayush Mou, Shaoshuai Purdue Univ Sch Aeronaut & Astronaut W Lafayette IN 47906 USA

ISBN: (纸本)9798350382662;9798350382655

In this paper, we introduce a comprehensive framework called edge agreement, where agents collaboratively strive to reach an agreement on non-linear edge constraints defined for each of their neighbors on every edge. This provides a novel perspective on the traditional 'global consensus' problem, extending the goal beyond reaching the same value to achieving agreement over the whole multi-agent team. We present a distributed algorithm for achieving edge agreement, along with a convergence guarantee based on certain assumptions. Additionally, we illustrate how this framework encompasses a variety of cooperation problems, including global consensus, recent results on edge agreement with linear constraints, distributed solutions to linear algebraic equations, and formation control (distance and displacement-based) as special cases. Finally, to validate and demonstrate the significance of this framework, we provide numerical simulations for all the mentioned applications.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：