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

30th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2024

作者： Agon-Rambosson, Aymeric Lejeune, Jonathan Sopena, Julien Sens, Pierre Sorbonne Université Cnrs LIP6 Delys ParisF-75005 France

ISBN: (纸本)9798331515966

Some applications, like round-based consensus algorithms, require all the nodes from a system to send a message to the same node (the leader) at the same time. In a Mobile Ad-Hoc Network (MANET), this situation is likely to cause collisions and the loss of the messages converging to the leader. The loss of messages is critical in such a situation, since the leader needs to receive a quorum of messages to make a decision. This pattern of communications, called convergecast, can be trivially implemented with a unicast primitive. However, we show that a popular MANET unicast algorithm like Optimized Link State Routing (OLSR) loses a lot of messages, even in the presence of MAC-level collision avoidance mechanisms like CSMA/CA. We propose a new convergecast algorithm that locally schedules answers to a query in a fully distributed manner, in order to avoid their colliding with each other, and that aggregates these answers in order to further decrease the probability of collisions. We show that our algorithm creates far fewer collisions and retries than OLSR, allowing applications like consensus algorithms to reach their quorum sooner. © 2024 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

One-third Hybrid algorithm for Numerical solution of First-order Models Problems with Initial Condition

One-third Hybrid Algorithm for Numerical solution of First-o...

引用

2024 International Conference on Science, Engineering and Business for Driving Sustainable Development Goals, SEB4SDG 2024

作者： Omole, Ezekiel Olaoluwa Kehinde Uwaifor, John Oboni, Atabo Victor Obarhua, Friday O. Ajewole, Kehinde Peter Onu, Peter Folaranmi, Rotimi Oluwafemi Oluwayemi, Mathew O. Amoyedo, Femi Emmanuel Idowu Olaleru, Grace Landmark University Mathematics Programme Department of Physical Sciences Omu-Aran Nigeria University of Abuja Department of Mathematics Abuja Nigeria Confluence University of Science and Technology Department of Mathematics and Statistic Kogi State Osara Nigeria Federal University of Technology Department of Mathematical Sciences Akure Nigeria Landmark University Mathematics Programme Department of Physical Sciences Kwara State Omu-Aran Nigeria Omu-Aran Nigeria ThomasAdewumi University Department of Mathematical and Computing Scineces Kwara State Oko Nigeria Margaret Lawrence University Department of Mathematics and Statistics Galilee Delta State Nigeria Landmark University Department of Electrical and Information Engineering Kwara State Omuaran Nigeria

ISBN: (纸本)9798350358155

The collocation and interpolation technique on the power series approximate solution was used to develop a new continuous implicit hybrid one-third step method capable of solving first-order stiff initial value problems. This method has the advantage of allowing for easy step length changes and function evaluation at off-step points. The block method used to implement the main method ensures that each discrete method resulting from the block's simultaneous solution has the same order of accuracy as the main method. The method provides large intervals of absolute stability;it is consistent, zero stable, and thus converges. Sample examples of linear and nonlinear stiff problems were used to evaluate the method's performance. When compared to other existing methods, our developed method has been shown to be more accurate. © 2024 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Distributed fuzzy adaptive consensus for high-order multi-agent systems with an imprecise communication topology structure

引用

FUZZY SETS AND SYSTEMS 2021年 402卷 1-15页

作者： Chen, Jiaxi Li, Junmin Yuan, Xinxin Xidian Univ Sch Math & Stat Xian 710126 Peoples R China

In this study, we consider the consensus problem for a high-order multi-agent systems (MASs) with an imprecise communica-tion topology structure described by the Takagi-Sugeno fuzzy model. A distributed adaptive control protocol is proposed for the consensus problem comprising MASs with unknown parameters and input disturbances. The proposed protocol can guarantee that the consensus errors asymptotically approach zero under the conditions that the communication topology is fuzzy union connected and the dynamics of the leader are unknown to any agent among the followers. Furthermore, the proposed algorithm is extended to solve the formation control problem for MASs. Sufficient conditions are provided for the consensus and formation problems for MASs based on Lyapunov stability theory. Finally, three simulation examples are presented to illustrate the effectiveness of the proposed control protocol. (C) 2020 Elsevier B.V. All rights reserved.

关键词： Adaptive control consensus algorithm Formation control Imprecise communication topology Multi-agent system Takagi-Sugeno fuzzy model

来源：评论

学校读者我要写书评

暂无评论

Complexity Aspects of the Extension of Wagner's Hierarchy to k-Partitions 14

Complexity Aspects of the Extension of Wagner's Hierarchy to...

引用

14th International Workshop on Non-Classical Models of Automata and Applications (NCMA)

作者： Podolskii, Vladimir Selivanov, Victor Tufts Univ Medford MA 02155 USA St Petersburg Univ Dept Math & Comp Sci St Petersburg Russia AP Erhov Inst Informat Syst Novosibirsk Russia

It is known that the Wadge reducibility of regular co-languages is efficiently decidable (Krishnan et al., 1995), (Wilke, Yoo, 1995). In this paper we study analogous problem for regular k-partitions of co-languages. In the series of previous papers (Selivanov, 2011), (Alaev, Selivanov, 2021), (Selivanov, 2012) there was a partial progress towards obtaining an efficient algorithm for deciding the Wadge reducibility in this setting as well. In this paper we finalize this line of research providing a quadratic algorithm (in RAM model). For this we construct a quadratic algorithm to decide a preorder relation on iterated posets. Additionally, we discuss the size of the representation of regular co-languages and suggest a more compact way to represent them. The algorithm we provide is efficient for the more compact representation as well.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Metropolis-Adjusted Langevin algorithm with SPSA-Approximated Gradients

Metropolis-Adjusted Langevin Algorithm with SPSA-Approximate...

引用

American Control Conference (ACC)

作者： Sun, Shiqing Spall, James C. IMC Chicago LLC Chicago IL 60606 USA Johns Hopkins Univ Dept Appl Math & Stat Baltimore MD 21218 USA

ISBN: (纸本)9798350382662;9798350382655

In Metropolis Hastings methods, gradient-based proposals, such as Metropolis-Adjusted Langevin algorithm (MALA), are widely used due to the fast convergence in distribution compared with non-gradient-based sampling methods like random walk proposals. On the other hand, the application of MALA is constrained by the accessibility of gradients. To extend the application scenario of MALA, we propose to use SPSA-based approximated gradients in MALA and name the algorithm MALA-SPSA. We prove the mixing time of MALA-SPSA to prove its efficiency in theory. Numerical experiments are conducted to verify the performance of MALA-SPSA.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

An In-Label Prioritizing Variable Branching Strategy of SAT Solvers for a Preferred Extension of Argumentation Frameworks 21st

An In-Label Prioritizing Variable Branching Strategy of SAT...

引用

21st Pacific Rim International Conference on Artificial Intelligence, PRICAI 2024

作者： Luo, Mao Xiong, Jiao He, Ningning Xiong, Caiquan Wu, Xinyun Wu, Jun Hubei University of Technology Wuhan430068 China Nanjing University of Information Science and Technology Nanjing210044 China

ISBN: (纸本)9789819601271

The SAT-based reduction methods have shown significant effectiveness in solving preferred extensions problem in argumentation frameworks. As a general-purpose solver, SAT solvers does not fully utilize the inherent properties of argumentation framework problems for customized design, resulting in suboptimal performance. Therefore, this paper proposes an in-label prioritizing variable branching strategy to improve the SAT solver from two aspects: the initialization of the polarity values of decision variables and the evaluation criteria for variable’s activity, enabling efficient solving of a preferred extension of argumentation frameworks. We implement this method in the state-of-the-art argumentation algorithm ArgSemSAT and conducted experimental analysis using the internationally recognized benchmarks ICCMA 2023 and ICCMA 2021. The experimental results show that the proposed method significantly enhances the performance of the original algorithm in solving a preferred extension, increasing the proportion of instances solved by the original algorithm by 6.96% for ICCMA 2023 and 37.5% for ICCMA 2021. Furthermore, the optimized algorithm outperforms μ-toksia (cmsat) which ranks the third-place in the competition ICCMA 2023. Notably, the proposed algorithm demonstrates very efficient performance on the AFGen instances, reducing the average solving time of the original algorithm from 350.88 s to 5.75 s. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A Simple Parallel algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Path 8

A Simple Parallel Algorithm with Near-Linear Work for Negati...

引用

8th SIAM Symposium on Simplicity of algorithms, SOSA 2025

作者： Fischer, Nick Haeupler, Bernhard Latypov, Rustam Roeyskoe, Antti Sulser, Aurelio L. INSAIT Sofia University "St. Kliment Ohridski" Bulgaria ETH Zurich Switzerland Aalto University Finland ETH Zurich Switzerland

ISBN: (纸本)9781611978315

We give the first parallel algorithm with optimal Õ(m) work for the classical problem of computing Single-Source Shortest Paths in general graphs with negative-weight edges. In graphs without negative edges, Dijkstra's algorithm solves the Single-Source Shortest Paths (SSSP) problem with optimal Õ(m) work, but is inherently sequential. A recent breakthrough by [Bernstein, Nanongkai, Wulff-Nilsen;FOCS'22] achieves the same for general graphs. Parallel shortest path algorithms are more difficult and have been intensely studied for decades. Only very recently, multiple lines of research culminated in parallel algorithms with optimal work Õ(m) for various restricted settings, such as approximate or exact algorithms for directed or undirected graphs without negative edges. For general graphs, the best known algorithm by [Ashvinkumar, Bernstein, Cao, Grunau, Haeupler, Jiang, Nanongkai, Su;ESA'24] still requires m1+o(1) work. This paper presents a randomized parallel algorithm for SSSP in general graphs with near-linear work Õ(m) and state-of-the-art span n1/2+o(1). We follow a novel bottom-up approach leading to a particularly clean and simple algorithm. Our algorithm can be seen as a near-optimal parallel black-box reduction from SSSP in general graphs to graphs without negative edges. In contrast to prior works, the reduction in this paper is both parallel and essentially without overhead, only affecting work and span by polylogarithmic factors. Copyright © 2025 Copyright for this paper is retained by authors.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Decentralized Target Localization in Distributed MIMO Radars 16

Decentralized Target Localization in Distributed MIMO Radars

引用

16th International Conference on Signal Processing Systems, ICSPS 2024

作者： Qiu, Qinhui Li, Jie Xi, Feng School of Electronic and Optical Engineering Nanjing University of Science and Technology China

ISBN: (纸本)9781510689251

This paper addresses the problem of target estimation in distributed MIMO radars, focusing on the challenge of requiring a robust fusion center to process all the collected data. To overcome this limitation, we propose a solution based on the Alternating Direction Method of Multipliers (ADMM) that eliminates the need for a centralized fusion center. By leveraging the sparsity of target location information within the detection range, the target localization problem is reformulated as a sparse recovery problem, which is then efficiently solved using ADMM. The key innovation of the proposed approach is the transformation of the average value computation, typically required in centralized methods, into a consensus averaging problem, and subsequently into a consensus optimization problem. This transformation allows for fully decentralized processing, where each node only communicates with its neighboring nodes to reach a consensus on the estimation of target location. Simulation results demonstrate that the proposed distributed algorithm achieves performance comparable to that of semi-distributed algorithms while fully exploiting the advantages of decentralization. © 2025 SPIE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Secondary control fusion in inverter intensive dynamic microgrids for distribution system resiliency enhancement

引用

iEnergy 2023年第1期2卷 9-13页

作者： Yuxi Men Lizhi Ding Junhui Zhang Xiaonan Lu School of Engineering Technology Purdue UniversityWest LafayetteIN 47907USA

Microgrids(MGs)dominated by power electronics interface inverters can augment distribution system *** interactions among neighboring MGs and the requirements for flexible system network reconfiguration motivate the development of dynamic *** improve the distribution system resiliency in the context of dynamic MGs,this paper proposes the concept of functional fusion of secondary control levels across neighboring dynamic MGs with the integration of multiple compensation terms into the secondary controller in each distributed generator(DG).Moreover,two kinds of consensus-based algorithms with the consideration of communication delays are encompassed to calculate the average values of static and dynamic variables and thereby build an effective communications network among DGs in dynamic ***,the effectiveness of the proposed secondary controller is validated using a 9-bus test distribution feeder.

关键词： Communication delay consensus algorithm dynamic microgrids(MGs) secondary control

来源：评论

学校读者我要写书评

暂无评论

Cost-Free Fairness in Online Correlation Clustering 36

Cost-Free Fairness in Online Correlation Clustering

引用

36th International Conference on algorithmic Learning Theory, ALT 2025

作者： Balkanski, Eric Chatzitheodorou, Jason Maggiori, Andreas Columbia University United States

In the correlation clustering problem, the input is a signed graph where the sign indicates whether pairs of nodes should be placed in the same cluster or not. The goal is to create a clustering that minimizes the number of disagreements with these signs. Correlation clustering is a key unsupervised learning problem with many practical applications. It has been widely studied in various settings, including versions with fairness constraints and cases where nodes arrive online. In this paper, we explore a problem that combines these two settings: nodes arrive online and reveal their membership in protected groups upon arrival. We are only allowed to output fair clusters, i.e., clusters where the representation of each protected group is upper bounded by a user-specified constant at the beginning of the arrival sequence. Our aim is to maintain approximately optimal fair clustering while minimizing a node's worst-case recourse, i.e., the number of times it changes clusters. We present an algorithm that achieves worst-case logarithmic recourse per node while maintaining a constant-factor fair approximate clustering. Additionally, our approach simplifies the algorithm and analysis used in prior work by Cohen-Addad et al. (2022) in the online setting with recourse. © 2025 E. Balkanski, J. Chatzitheodorou & A. Maggiori.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：