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

A sharp lower bound on the independence number of k-regular connected hypergraphs with rank R

ACTA INFORMATICA 2025年第1期62卷 1-14页

作者： Tang, Zhongzheng Zou, Haoyang Diao, Zhuo Beijing Univ Posts & Telecommun Sch Sci Beijing 100876 Peoples R China Cent Univ Finance & Econ Sch Stat & Math Beijing 100081 Peoples R China

Let H(V, E) be a k-regular connected hypergraph with rank R on n vertices and m edges. A set of vertices S subset of V\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S\subseteq V$$\end{document} is an independent set if every two vertices in S are not adjacent. The independence number is the maximum cardinality of an independent set, denoted by alpha(H)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha (H)$$\end{document}. In this paper, we prove the following inequality: alpha(H)>= m-(k-2)n-1R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha (H)\ge \frac{m-(k-2)n-1}{R}$$\end{document}, and the equality holds if and only if H is a hypertree with R-perfect matching. Based on the proofs, some combinatorial algorithms on the independence number are designed.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A Geometric Approach to Resilient Distributed consensus Accounting for State Imprecision and Adversarial Agents

A Geometric Approach to Resilient Distributed Consensus Acco...

引用

American Control Conference (ACC)

作者： Lee, Christopher A. Abbas, Waseem Univ Texas Dallas Dept Elect Engn Richardson TX 75083 USA Univ Texas Dallas Dept Syst Engn Richardson TX 75083 USA

ISBN: (纸本)9798350382662;9798350382655

This paper presents a novel approach for resilient distributed consensus in multiagent networks when dealing with adversarial agents and imprecision in states observed by normal agents. Traditional resilient distributed consensus algorithms often presume that agents have exact knowledge of their neighbors' states, which is unrealistic in practical scenarios. We show that such methods are inadequate when agents only have access to imprecise states of their neighbors. To overcome this challenge, we adapt a geometric approach and model an agent's state by an 'imprecision region' rather than a point in R-d. From a given set of imprecision regions, we first present an efficient way to compute a region that is guaranteed to lie in the convex hull of true, albeit unknown, states of agents. We call this region the invariant hull of imprecision regions and provide its geometric characterization. Next, we use these invariant hulls to identify a safe point for each normal agent. The safe point of an agent lies within the convex hull of its normal neighbors' states and hence is used by the agent to update it's state. This leads to the aggregation of normal agents' states to safe points inside the convex hull of their initial states, or an approximation of consensus. We also illustrate our results through simulations.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Multi-UAV Collaborative Target consensus Detection Using Enhanced Particle Swarm Optimization 21

Multi-UAV Collaborative Target Consensus Detection Using Enh...

引用

21st IEEE International Conference on Mechatronics and Automation (IEEE ICMA)

作者： Wang, Xinhua Wei, Mingzhu Xie, Xiaomei Zhang, Hongyu Huang, Qianqian Song, Dongjing Univ Elect Sci & Technol China Sch Aeronaut & Astronaut Chengdu Sichuan Peoples R China

ISBN: (纸本)9798350388084;9798350388077

Multi-UAV collaborative perception with region coverage has important applications in various fields such as post-disaster rescue, agricultural pest control, and enemy rear reconnaissance. The current region coverage algorithms focus on covering an area with the lowest redundancy and smallest coverage gap. However, simple swarm coverage methods cannot obtain accurate perception information for key target reconnaissance tasks. This paper focuses on the multi-UAV cross-coverage method to improve the accuracy of key target recognition. An improved particle swarm optimization algorithm is proposed under sensing and communication load constraints. Three improvements are implemented: particle velocity update strategy, weight update formula, and particle recombination strategy. The simulation results show the advantages of the proposed algorithm over classical methods and its effectiveness in cross-coverage and target consensus.

关键词： Area coverage Multi-UAV Collaboration consensus algorithm PSO

来源：评论

学校读者我要写书评

暂无评论

Distributed coordinated control strategy of the islanded DC microgrid oriented by IGBT operation reliability balance

引用

ELECTRIC POWER SYSTEMS RESEARCH 2025年 246卷

作者： Gao, Yuan Hong, Lucheng Wu, Minghe Gu, Jie Chen, Wu Southeast Univ Sch Elect Engn Nanjing 210096 Peoples R China

Due to differences in the heating characteristics of IGBTs in parallel DC/DC converter circuits and line resistance, varying thermal stresses cause IGBTs with higher stress to fail earlier, reducing the overall power supply reliability. In this regard, this paper proposes the coordinated control strategy of the islanded DC microgrid oriented by IGBT operation reliability balance. By adding the temperature equalization term in traditional droop control, the junction temperature of the IGBT in each parallel DC/DC converter tends to be consistent. Moreover, the IGBT reliability balance control of the islanded DC microgrid based on consensus algorithm is proposed, considering the high communication pressure under centralized control. The effectiveness of the proposed strategy was verified by jointly building the simulation model using MATLAB/Simulink and PLECS/Blockset. Finally, the IGBT lifetime damage is analyzed before and after adopting the proposed control strategy. The specific data shows that the maximum IGBT lifetime damage of traditional droop control is 0.2973, and the average IGBT lifetime damage is 0.1071. In contrast, the IGBT lifetime damage of the proposed control strategy is reduced to 0.0201, with the maximum lifetime damage and average lifetime damage reduced by approximately 93.2 % and 81.2 %.

关键词： DC microgrid IGBT reliability Junction temperature Droop control consensus algorithm Power supply reliability

来源：评论

学校读者我要写书评

暂无评论

Distributed economic operation control in low-voltage resistive hybrid AC/ DC microgrid clusters with interlinking converters

引用

ELECTRIC POWER SYSTEMS RESEARCH 2025年 238卷

作者： Yang, Fan Yan, Yingzhe Cao, Jiuzhou Lin, Shunfu Li, Dongdong Shen, Yunwei Shanghai Univ Elect Power Coll Elect Engn Shanghai 200090 Peoples R China Three Gorges Vocat Coll Elect Power Yichang 443000 Peoples R China

Connecting adjacent and diverse microgrids to form hybrid microgrid clusters improve the economic viability and the reliability of each microgrid in islanded operations. To realize the global economic operation among low-voltage resistive microgrid clusters, a two-level control strategy for subgrid control and microgrid clusters control is proposed in this study. In the case of subgrids, where the line impedance of the low-voltage grid is primarily resistive, we design the AC voltage increment droop (V-ac-IC) and the DC voltage increment droop (V-dc-IC) to effectively distribute power. The V-ac-IC and V-dc-IC droop controls cannot achieve economic power distribution due to the mismatched line impedances. Therefore, a distributed economic operation control based on the consensus algorithm is proposed in this study to eliminate the influence of mismatched line impedances on economic power distribution. In the context of microgrid clusters, the deviation of increment costs serves as an event-driven signal designed for Interlinking Converters (ILCs), aiming to optimize power exchange between adjacent subgrids. The coordination between the subgrid control and microgrid clusters control achieves global economic operation. Finally, Matlab/Simulink simulation verifies that the islanded hybrid microgrid clusters with the proposed strategy realize the economic operation well.

关键词： consensus algorithm Economic droop control Hybrid microgrid clusters Voltage control

来源：评论

学校读者我要写书评

暂无评论

The Least Information Set Needed by Privacy Attackers

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2025年第3期70卷 1652-1666页

作者： Xie, Antai Wang, Xiaofan Yang, Wen Cao, Ming Ren, Xiaoqiang Shanghai Univ Sch Mechatron Engn & Automat Shanghai 200444 Peoples R China East China Univ Sci & Technol Key Lab Adv Control & Optimizat Chem Proc Shanghai 200237 Peoples R China Univ Groningen Fac Sci & Engn NL-9712 CP Groningen Netherlands Shanghai Univ Key Lab Marine Intelligent Unmanned Swarm Technol Minist Educ Shanghai 200444 Peoples R China

This article studies privacy-preserving problems focusing on the information that is available to the attacker. For a class of general linear average consensus algorithms, we identify the least information set required by an attacker to infer the initial value of the target node. We then propose a novel algorithm that protects the initial value effectively if the attacker fails to have this least information. Furthermore, we show that the initial value of nodes may be disclosed even if the attacker does not know any information exchanged between the target node and its neighbors. Finally, we propose a novel eavesdropping algorithm if the least information is available. Several numerical examples are given to verify the validity of our results.

关键词： consensus algorithm Directed graphs Noise Accuracy Vectors Convergence Matrix decomposition Differential privacy Heuristic algorithms Eavesdropping Average consensus information set privacy-preserving

来源：评论

学校读者我要写书评

暂无评论

Practical Byzantine improved algorithm based on node-independent validation

引用

COMPUTER NETWORKS 2025年 265卷

作者： Li, Anqi Zhang, Quan Xu, Xin Yao, Yingbiao Hangzhou Dianzi Univ Commun Engn Hangzhou 310000 Zhejiang Peoples R China

The PBFT consensus algorithm solves the Byzantine node tolerance problem of Raft and Paxos consensus algorithms, but the three-stage confirmation leads to its poor scalability and high communication latency. In response to above problems, this paper proposes an improved PBFT algorithm based on node-independent validation, briefly as V-PBFT. V-PBFT divides nodes into a double layer structure with multiple leaders, and sets up global validation nodes, intra-group followers, suspicious nodes and malicious nodes. Firstly, V-PBFT adopts the PBFT protocol to reach consensus among leaders. Validation nodes guarantee the consistency of the state of leaders. Then, leaders broadcast Intra-consensus messages to intra-group followers. Secondly, validation nodes broadcast Verify messages to all nodes except malicious nodes and leaders. The messages from the leader and validation nodes are mutually verified, enabling followers to judge the correctness of client requests. Finally, the credit value is set for followers to reduce the probability on malicious view-changes. Experimental results show that V-PBFT reduces the communication complexity of PBFT from the quadratic level to the linear level and thus its communication latency is significantly reduced.

关键词： Blockchain Byzantine fault tolerance consensus algorithm Credit value election Node validation

来源：评论

学校读者我要写书评

暂无评论

Distributed and Parallel Blockchain: Towards a Multi-Chain System With Enhanced Security

引用

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 2025年第1期22卷 723-739页

作者： Liu, Weikang Cao, Bin Peng, Mugen Li, Bo Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China Hong Kong Univ Sci & Technol Dept Comp Sci & Engn Kowloon Hong Kong Peoples R China

Isolatability and scalability are two critical issues faced by blockchain. Blockchain interoperability addresses isolatability between heterogeneous blockchains, while sharding-based blockchain achieves scalability by solving isolatability of homogeneous blockchains running in different shards. To ensure atomicity between different blockchains, they both need to overcome two significant problems: 1) how to handle cross-chain transactions without trusting any third parties;2) how to enhance the resistance to double-spending attacks of participating blockchains. To this end, this work presents a two-tier multi-zone architecture, Distributed and Parallel Blockchain (DP-Chain), where consensus Zone in tier-1 features blockchain interoperability and sharding-based blockchain by allowing homogeneous or heterogeneous blockchains run in different zones, while Coordination Layer in tier-2 allows them to interoperate as a Direct Acyclic Graph (DAG) without trusting any third parties. Meanwhile, the coordination scheme between the two tiers is designed to resist potential double-spending attacks. Then, stochastic models are used to capture DP-Chain consensus process and analyze the probability of successful double-spending attacks. These analyses can help understand DP-Chain easily and offer theoretical guidelines for further implementations. Finally, based on the proposed architecture, a practical system is realized with C++ and open in Github for testing. Extensive experiments show correctness and effectiveness of this design.

关键词： Blockchains consensus algorithm Interoperability Security Scalability Resists Resistance Blockchain direct acyclic graph sharding interoperability isolatability scalability

来源：评论

学校读者我要写书评

暂无评论

On f-consensus Problems Solvable via Distributed Convex Optimization Methods 43

On f-Consensus Problems Solvable via Distributed Convex Opti...

引用

43rd Chinese Control Conference, CCC 2024

作者： Yu, Siliang Huang, Chao College of Electronic and Information Engineering Shanghai201804 China

ISBN: (纸本)9789887581581

This paper is concerned with the distributed f-consensus problem in a multi-agent system, the aim of which is to achieve consensus on a particular value relating to function, f, of the labels owned by the agents. The paper utilizes distributed convex optimization as a tool to solve a series of f-consensus problems including network size estimation, k-th smallest value consensus and leader-following consensus (information sharing). The effectiveness of the theoretical results is verified by means of numerical simulations. © 2024 Technical Committee on Control Theory, Chinese Association of Automation.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A map-reduce algorithm to find strongly connected components of directed graphs

引用

Soft Computing 2025年第4期29卷 1947-1966页

作者： Ji, Fujun Jin, Jidong Beijing100070 China

Online social networks have become ubiquitous platforms, comprising intricately linked structures that reflect complex user interactions. Analyzing the interconnected component structure of these large directed graphs is pivotal for critical applications like viral marketing and contagion prediction. This paper presents a parallel algorithm to efficiently discover strongly connected components in massive social graphs by distributing computation across clustered servers. Our proposed distributed approach conducts localized connected component extraction during the Map phase. The merged aggregation in the Reduce phase then uncovers global maximum interconnected sets spanning the fragmented structures. We employ mathematical induction across Map-Reduce stages to demonstrate the algorithm’s correctness for obtaining exhaustive component enumeration across servers. Implementation and complexity analysis on synthetic benchmark graphs highlight significant efficiency gains, with the algorithm demonstrating near-linear speedup for increasing data-set and cluster sizes. The proposed technique advances the state-of-the-art for extracting strongly connected structures from colossal real-world social networks, enabling actionable insights around influence cascades and contagion pathways underlying these intricate linkage patterns. © The Author(s) 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：