With the rapid development of big data, cloud computing, artificial intelligence and other technologies, the expansion of database application requirements and the change of computer hardware environment, especially t...
详细信息
Due to the introduction of a large number of distributed resources and other new elements, the distribution network presents new characteristics that are different from traditional power grids, thus posing new require...
详细信息
distributed architectures are used to improve performance and reliability of various systems. Examples include drone swarms and load-balancing servers. An important capability of a distributed architecture is the abil...
详细信息
ISBN:
(纸本)9783031572456;9783031572463
distributed architectures are used to improve performance and reliability of various systems. Examples include drone swarms and load-balancing servers. An important capability of a distributed architecture is the ability to reach consensus among all its nodes. Several consensus algorithms have been proposed, and many of these algorithms come with intricate proofs of correctness, that are not mechanically checked. In the controls community, algorithms often achieve consensus asymptotically, e.g., for problems such as the design of human control systems, or the analysis of natural systems like bird flocking. This is in contrast to exact consensus algorithm such as Paxos, which have received much more recent attention in the formal methods community. This paper presents the first formal proof of an asymptotic consensus algorithm, and addresses various challenges in its formalization. Using the Coq proof assistant, we verify the correctness of a widely used consensus algorithm in the distributed controls community, the Weighted-Mean Subsequence Reduced (W-MSR) algorithm. We formalize the necessary and sufficient conditions required to achieve resilient asymptotic consensus under the assumed attacker model. During the formalization, we clarify several imprecisions in the paper proof, including an imprecision on quantifiers in the main theorem.
Overlay networks, where connections are made over logical links composed of zero or more physical links, are a popular paradigm in modern distributed computing. The use of logical links allows the creation of a variet...
详细信息
In the context of smart grid and new power system, distributed generations, energy storage systems, electric vehicles and other new power equipment are connected to the distribution network on a large scale, which mak...
详细信息
An increasing number of Advanced Persistent Threat (APT) organizations are utilizing DNS (Domain Name System) covert channels to evade network intrusion detection systems and establish private authoritative servers fo...
详细信息
Examining the cyber security risks faced by companies and e-commerce platforms is the focus of this research. People in the corporate world and those in academia are curious about the technology applications of e-comm...
详细信息
We generalize the DeGroot model for opinion dynamics to better capture realistic social scenarios. We introduce a model where each agent has their own individual cognitive biases. Society is represented as a directed ...
详细信息
ISBN:
(纸本)9783031626449;9783031626456
We generalize the DeGroot model for opinion dynamics to better capture realistic social scenarios. We introduce a model where each agent has their own individual cognitive biases. Society is represented as a directed graph whose edges indicate how much agents influence one another. Biases are represented as the functions in the square region [-1, 1](2) and categorized into four sub-regions based on the potential reactions they may elicit in an agent during instances of opinion disagreement. Under the assumption that each bias of every agent is a continuous function within the region of receptive but resistant reactions (R), we show that the society converges to a consensus if the graph is strongly connected. Under the same assumption, we also establish that the entire society converges to a unanimous opinion if and only if the source components of the graph-namely, strongly connected components with no external influence-converge to that opinion. We illustrate that convergence is not guaranteed for strongly connected graphs when biases are either discontinuous functions in R or not included in R. We showcase our model through a series of examples and simulations, offering insights into how opinions form in social networks under cognitive biases.
It has become a great challenge to balance accuracy and diversity in recommendation systems. Graph Neural networks (GNNs), while powerful, can lead to node representation homogeneity and information redundancy due to ...
详细信息
This study introduces a secure and scalable hybrid trust management system for Vehicular Ad Hoc networks (VANETs), designed to detect and mitigate diverse malicious activities, including Sybil attacks, Denial of Servi...
详细信息
暂无评论