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

26th International Symposium on Formal Methods (FM)

作者： Baumeister, Tom Eichler, Paul Jacobs, Swen Sakr, Mouhammad Volp, Marcus CISPA Helmholtz Ctr Informat Secur Saarbrucken Germany Luxembourg Univ SnT Esch Sur Alzette Luxembourg

ISBN: (纸本)9783031711619;9783031711626

Threshold automata are a computational model that has proven to be versatile in modeling threshold-based distributed algorithms and enabling their completely automatic parameterized verification. We present novel techniques for the verification of threshold automata, based on well-structured transition systems, that allow us to extend the expressiveness of both the computational model and the specifications that can be verified. In particular, we extend the model to allow decrements and resets of shared variables, possibly on cycles, and the specifications to general coverability. While these extensions of the model in general lead to undecidability, our algorithms provide a semi-decision procedure. We demonstrate the benefit of our extensions by showing that we can model complex round-based algorithms such as the phase king consensus algorithm and the Red Belly Blockchain protocol (published in 2019), and verify them fully automatically for the first time.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A two-layer frequency control method for large-scale distributed energy storage clusters

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2022年 143卷

作者： Lin, Yujun Li, Xing Zhai, Baoyu Yang, Qiufan Zhou, Jianyu Chen, Xia Wen, Jinyu Huazhong Univ Sci & Technol Sch Elect & Elect Engn State Key Lab Adv Electromagnet Engn & Technol Wuhan 430074 Peoples R China State Grid Xinjiang Elect Power Co LTD State Grid Xinjiang Elect Power Res Inst Xinjiang Key Lab Whole Proc Simulat Power Syst Urumqi 830011 Peoples R China

A large number of small-capacity distributed energy storages (ESs) are expected to play an important role in grid frequency regulation. However, without suitable control scheme, it may lead to heavy computational burden and low utilizing efficiency. In this paper, a two-layer frequency control framework is proposed for large-scale distributed ESs that can be separated into several ES clusters. On the upper layer, the frequency regulation is achieved through distributed model predictive control (DMPC) among different ES clusters. The parallel computing of the distributed controllers reduces the optimization problem dimension brought by a large number of ES clusters. In addition, both the frequency deviation and rate of change of frequency are considered to achieve better frequency regulation. On the lower layer, state-of-charge (SoC) balance is considered within each cluster by the leader-follower consensus algorithm in a distributed mode, and it only requires communication between neighboring ESs in a cluster to aggregate for the upper layer. Unlike the conventional SoC balancing strategy, circulating currents are prevented to reduce the transmission losses. Moreover, a detailed small-signal model is established to show the impact of the proposed control strategy on the system stability. The effec-tiveness of the entire control scheme and the small-signal analysis are validated under a variety of scenarios by simulations. (C) 2017 Elsevier Inc. All rights reserved.

关键词： Frequency regulation distributed model predictive control (DMPC) consensus algorithm Energy storage systems

来源：评论

学校读者我要写书评

暂无评论

Controller Hardware-in-the-Loop Testbed of a Distributed consensus Multi-Agent System Control under Deception and Disruption Cyber-Attacks

引用

ENERGIES 2024年第7期17卷 1669页

作者： Kharchouf, Ibtissam Mohammed, Osama A. Florida Int Univ Dept Elect & Comp Engn Energy Syst Res Lab Miami FL 33174 USA

The impact of communication disturbances on microgrids (MGs) needs robust and scalable Information Communication Technology (ICT) infrastructure for efficient MG control. This work builds on advances in the Internet of Things (IoT) to provide a practical platform for testing the impact of various cyber-attacks on a distributed control scheme for a Multi-Agent System (MAS). This paper presents a Controller Hardware-in-the-Loop (CHIL) testbed to investigate the impact of various cyber-attacks and communication disruptions on MGs. A distributed consensus secondary control scheme for a MAS within an MG cyber-physical system (CPS) is proposed. The proposed cyber-physical testbed integrates a real-time islanded AC microgrid on RT-Lab, secondary controllers implemented on single-board computers, and an attacker agent on another single-board computer. Communication occurs via a UDP/IP network between OPAL-RT and controller agents, as well as between the agents. Through meticulous experimentation, the efficacy of the proposed control strategy using the developed platform is validated. Various attacks were modeled and launched including deception attacks on sensors, actuators, and their combinations, as well as disruption attacks. The ramifications of both deception and disruption cyber-attacks on system performance are analyzed.

关键词： microgrids consensus algorithm distributed secondary control real-time simulation deception attack denial-of-service attack (DoS) cyber-physical system (CPS) multi-agent system (MAS) OPAL-RT controller hardware-in-the-loop (CHIL)

来源：评论

学校读者我要写书评

暂无评论

consensus-based secondary frequency control for parallel virtual synchronous generators

引用

SUSTAINABLE ENERGY GRIDS & NETWORKS 2024年 38卷

作者： Wang, Xiaohuan Zhong, Zhiwen Jiang, Wei Zhao, Xiaojun Yanshan Univ Sch Elect Engn Key Lab Power Elect Energy Conservat & Drive Contr Qinhuangdao 066004 Peoples R China Zhangjiakou Power Supply Co State Grid Jibei Elect Power Co Ltd Zhangjiakou 075000 Peoples R China

In off-grid operating modes, microgrids with Virtual Synchronous Generators (VSG) controlled inverters are limited to primary frequency control capabilities. When operating under the primary frequency control, if VSG's output frequency exceeds the safe operational range, it can adversely affect stable operation. Consequently, there is a need to implement a secondary frequency control strategy. This paper presents an analysis of the conventional secondary frequency regulation in VSGs. It reveals that when multiple VSGs in parallel to the Point of Common Coupling (PCC) with varied line impedances, the proportionate distribution of each VSG's active power output, post frequency control, does not align with predetermined ratios. In response to this challenge, the paper introduces a quasi-distributed secondary frequency control approach, tailored for systems with multiple feed-in points. This approach modifies the traditional method of compensating for frequency deviation through average ratio integral compensation, replacing it with a compensation based on a consensus algorithm. This negates the need for global communication and additional impedance measuring equipment. By facilitating information exchange between neighboring converters, it enables global control, effectively resolving the issue of line impedance parameters impacting the distribution of VSG's active power output. This decouples the previously strong correlation between line impedance and VSG's active power. The proposed method is characterized by its strong adaptability, scalability, and swift dynamic adjustments, significantly enhancing the fault tolerance of information exchange and the stability of microgrid operations. Finally, the correctness and effectiveness of the proposed improved control strategy are verified by simulation and HIL-based platform.

关键词： Microgrid inverter Virtual synchronous generator (VSG) Secondary frequency control (SFC) consensus algorithm Multiple VSGs in parallel

来源：评论

学校读者我要写书评

暂无评论

Dynamic Independent Set of Disks (and Hypercubes) Made Easier 8

Dynamic Independent Set of Disks (and Hypercubes) Made Easie...

引用

8th SIAM Symposium on Simplicity of algorithms, SOSA 2025

作者： Bhore, Sujoy Chan, Timothy M. Department of Computer Science & Engineering Indian Institute of Technology Bombay Mumbai India Department of Computer Science University of Illinois Urbana-Champaign United States

ISBN: (纸本)9781611978315

Maintaining an approximate maximum independent set of a dynamic collection of objects has been studied extensively in the past few years. Recently, Bhore, Nöllenburg, Tóth, and Wulms (SoCG 2024) showed that for (unweighted) disks in the plane, it is possible to maintain O(1)-factor approximate solution in polylogarithmic amortized update time. In this work, we provide a much simpler dynamic O(1)-approximation algorithm, which at the same time improves the number of logarithmic factors in the previous update time bound. Along the way, we also obtain simpler and faster algorithms for dynamic independent set for axis-aligned hypercubes as well as static independent set for fat objects in any constant dimension. All the above results also hold for the minimum piercing set problem for the same classes of objects. Copyright © 2025 Copyright for this paper is retained by authors.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

FinBlock: Secure and Fast Transaction Confirmation with High Throughput for FinTech Application 25

FinBlock: Secure and Fast Transaction Confirmation with High...

引用

IEEE Wireless Communications and Networking Conference (IEEE WCNC)

作者： Vishwakarma, Lokendra Kumar, Amritesh Madugunda, Jeevan Das, Debasis IIT Jodhpur Dept CSE Jodhpur Rajasthan India IIT Jodhpur IDRP IoT & Applicat Jodhpur Rajasthan India

ISBN: (纸本)9798350303582;9798350303599

Finance is the backbone of any organization or government. The government's financial health relies heavily on managing its FinTech applications. In the current FinTech system, user financial information is stored centrally. In the centralized system, the information security risks are high. Thus, a decentralized system is required for better security, trust and safety management in the FinTech information system. Blockchain is a decentralized technology that can solve the issues of traditional FinTech applications like banking. In the blockchain, consensus protocols are responsible for maintaining a consistent copy of the blockchain at each node of the blockchain network. However, these protocols are not suitable for regular currency transactions due to high latency and low throughput. Therefore, to achieve reliability, low latency, and high throughput, we have introduced a new protocol called FinBlock. In FinBlock, the pipeline concept is introduced in blockchain to increase the transaction throughput. Additionally, the number of message broadcasts is also reduced, which further improves the latency. Moreover, FinBlock achieves a speedup of 3 with respect to traditional practical byzantine fault tolerance (PBFT) consensus protocol. The result showed that FinBlock achieved better transaction processing time, transaction throughput, and message count than the traditional PBFT, even with hundreds of nodes in the network with reduced message complexity.

关键词： FinTech Application consensus algorithm Fast Transaction Confirmation Pipeline Execution

来源：评论

学校读者我要写书评

暂无评论

Posterior Tracking algorithm for Multi-objective Classification Bandits 37th

Posterior Tracking Algorithm for Multi-objective Classifica...

引用

37th Australasian Joint Conference on Artificial Intelligence, AJCAI 2024

作者： Suzuki, Riku Nakamura, Atsuyoshi Graduate School of Information Science and Technology Hokkaido University Sapporo Japan

ISBN: (纸本)9789819603503

A classification bandit problem is a kind of pure exploration K-armed bandit problems in which a given set of K arms must be judged whether it contains at least L good arms or not with probability at least 1-δ for a given positive integer L(≤K) and δ>0, by drawing as small number of arms as possible, where an arm is good if and only if its expected reward μ is at least a given threshold ξ. To apply algorithms for this problem to more diverse real-world problems, we extend the problem with one dimensional rewards to that with multi-dimensional rewards by defining good arms as arms whose i-th dimensional expected reward μi is at least given threshold ξi for all the dimensions i. We also extend P-Tracking algorithm, which is reported to be a best performer for the original one-dimensional-reward problem, to that for our multi-dimensional-reward problem. Our results using numerical simulations demonstrate the superiority of the extended P-Tracking algorithm in sample efficiency compared to extended other existing algorithms. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

An Interconnected Systems Approach to Convergence Analysis of Discrete-Time Primal-Dual algorithms

An Interconnected Systems Approach to Convergence Analysis o...

引用

American Control Conference (ACC)

作者： Kelly, Spencer Simpson-Porco, John W. Univ Toronto Dept Elect & Comp Engn 10 Kings Coll Rd Toronto ON M5S 3G4 Canada

ISBN: (纸本)9798350382662;9798350382655

We study the geometric convergence rate of discrete-time primal-dual algorithms for solving strongly-convex equality-constrained optimization problems. Our approach separates the primal-dual algorithm into an interconnection of two exponentially stable systems, and a composite Lyapunov approach is used to establish stability of the interconnection and provide new bounds on the geometric rate of convergence. Analogous convergence results are developed for two variations of the primal-dual algorithm: an extrapolated version which accelerates convergence, and an inner-loop version which interpolates between the vanilla primal-dual method and dual ascent. The obtained bounds are compared and contrasted with existing bounds from the literature.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

An Evaluation of Massively Parallel algorithms for DFA Minimization 15

An Evaluation of Massively Parallel Algorithms for DFA Minim...

引用

15th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF)

作者： Martens, Jan Wijs, Anton Leiden Univ Leiden Netherlands Eindhoven Univ Technol Eindhoven Netherlands

We study parallel algorithms for the minimization of Deterministic Finite Automata (DFAs). In particular, we implement four different massively parallel algorithms for DFA minimization on Graphics Processing Units (GPUs). Our results confirm the expectations that the algorithm with the theoretically best time complexity is not practically suitable to run on GPUs due to the large amount of resources needed. We empirically verify that parallel partition refinement algorithms from the literature perform better in practice, even though their time complexity is worse. Lastly, we introduce a novel algorithm based on partition refinement with an extra parallel partial transitive closure step and show that on specific benchmarks it has better run-time complexity and performs better in practice.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Raft Protocol for Fault Tolerance and Self-Recovery in Federated Learning 19

Raft Protocol for Fault Tolerance and Self-Recovery in Feder...

引用

IEEE/ACM 19th Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)

作者： Dautov, Rustem Husom, Erik Johannes SINTEF Digital Oslo Norway

ISBN: (纸本)9798400705854

Federated Learning (FL) has emerged as a decentralised machine learning paradigm for distributed systems, particularly in edge and IoT environments. However, ensuring fault tolerance and self-recovery in such scenarios remains challenging, because of the centralised model aggregation which acts as a single point of failure. A possible solution to this challenge would rely on the continuous replication of the global FL state across participating nodes and the functional suitability of any node to replace the aggregator in case of failures. These functional requirements can be implemented using one of the existing distributed consensus algorithm, such as Raft. Our approach utilises Raft's leader election and log replication mechanisms to enable automatic stateful recovery after failures and thus to improve fault tolerance. The log replication process efficiently maintains consistency and coherence across distributed FL nodes, ensuring uninterrupted training process and model convergence. This enhances the robustness of the overall FL system, especially in dynamic and unreliable cyber-physical conditions. To demonstrate the viability of our approach, we present a proof-of-concept implementation based on the existing FL framework Flower. We conduct a series of experiments to measure the aggregator re-election time and traffic overheads associated with the state replication. Despite the expected traffic overheads growing with the number of FL nodes, the results demonstrate a resilient self-recovering system capable of withstanding node failures while maintaining model consistency.

关键词： Federated Learning Fault Tolerance Self-recovery Flower Raft consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：