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

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

来源：评论

学校读者我要写书评

暂无评论

A Dynamic algorithm for Weighted Submodular Cover Problem 41

A Dynamic Algorithm for Weighted Submodular Cover Problem

引用

41st International Conference on Machine Learning (ICML)

作者： Banihashem, Kiarash Goudarzi, Samira Hajiaghayi, MohammadTaghi Jabbarzade, Peyman Monemizadeh, Morteza Univ Maryland Dept Comp Sci College Pk MD 20742 USA TU Eindhoven Dept Math & Comp Sci Eindhoven Netherlands

We initiate the study of the submodular cover problem in dynamic setting where the elements of the ground set are inserted and deleted. In the classical submodular cover problem, we are given a monotone submodular function f : 2(V) -> R->0 and the goal is to obtain a set S subset of V that minimizes the cost subject to the constraint f(S) = f(V). This is a classical problem in computer science and generalizes the Set Cover problem, 2-Set Cover, and dominating set problem among others. We consider this problem in a dynamic setting where there are updates to our set V, in the form of insertions and deletions of elements from a ground set V, and the goal is to maintain an approximately optimal solution with low query complexity per update. For this problem, we propose a randomized algorithm that, in expectation, obtains a (1 - O(epsilon), O(epsilon(-1)))-bicriteria approximation using polylogarithmic query complexity per update.

关键词： 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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

3SUM in Preprocessed Universes: Faster and Simpler 8

3SUM in Preprocessed Universes: Faster and Simpler

引用

8th SIAM Symposium on Simplicity of algorithms, SOSA 2025

作者： Kasliwal, Shashwat Polak, Adam Sharma, Pratyush IIT Delhi India Bocconi University Italy

ISBN: (纸本)9781611978315

We revisit the 3SUM problem in the preprocessed universes setting. We present an algorithm that, given three sets A, B, C of n integers, preprocesses them in quadratic time, so that given any subsets A′ ⊆ A, B′ ⊆ B, C′ ⊆ C, it can decide if there exist a ∈ A′, b ∈ B′, c ∈ C′ with a + b = c in time O(n1.5 log n). In contrast to both the first subquadratic Oe(n13/7)-time algorithm by Chan and Lewenstein (STOC 2015) and the current fastest Oe(n11/6)-time algorithm by Chan, Vassilevska Williams, and Xu (STOC 2023), which are based on the Balog-Szemerédi-Gowers theorem from additive combinatorics, our algorithm uses only standard 3SUM-related techniques, namely FFT and linear hashing modulo a prime. It is therefore not only faster but also simpler. Just as the two previous algorithms, ours not only decides if there is a single 3SUM solution but it actually determines for each c ∈ C′ if there is a solution containing it. We also modify the algorithm to still work in the scenario where the set C is unknown at the time of preprocessing. Finally, even though the simplest version of our algorithm is randomized, we show how to make it deterministic losing only polylogarithmic factors in the running time. Copyright © 2025 Copyright for this paper is retained by authors.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A Privacy-Preserving Distributed Control Strategy in Islanded AC Microgrids

引用

IEEE TRANSACTIONS ON SMART GRID 2022年第5期13卷 3369-3382页

作者： Wang, Ziqiang Ma, Meiling Zhou, Quan Xiong, Linyun Wang, Lingling Wang, Jinming Wang, Jie Shanghai Jiao Tong Univ Sch Elect Informat & Elect Engn Minist Educ Shanghai 200240 Peoples R China Shanghai Jiao Tong Univ Key Lab Control Power Transmiss & Convers Minist Educ Shanghai 200240 Peoples R China Univ Shanghai Sci & Technol Dept Elect Engn Shanghai 200093 Peoples R China Hunan Univ Sch Elect & Informat Engn Changsha 410000 Peoples R China Chongqing Univ Sch Elect Engn Chongqing 400044 Peoples R China Zhejiang Shuren Univ Coll Informat Sci & Technol Hangzhou 310015 Peoples R China

As an effective method to improve the reliability, the advanced communication infrastructure also exposes the islanded AC microgrid (MG) to potential privacy threats. Although the existing differential-privacy based secondary controls provide the privacy protection through adding noise, the noise would bring about large harmonic components thereby degrading the power quality. To tackle with this problem, a novel integrated privacy-preserving distributed fixed-time (PDF) secondary control of the islanded AC MG is proposed for the accurate frequency restoration and active power sharing. The state decomposition strategy and the additional virtual proportional (AVP) coefficient are innovatively designed to achieve the privacy preservation, where the active power ratio of each DG is decomposed into several sub-states. The integrated PDF secondary control only requires each DG to transmit the first sub-state of active power ratio through communication network, which would not increase the communication burden. The designed privacy-preserving mechanism can protect the initial value and real-time running values simultaneously when the AVP coefficient is not disclosed to the external eavesdropper. The real-time simulations based on the NI-PXI real-time simulator are conducted to validate the effectiveness and advantages of the integrated PDF secondary control.

关键词： Privacy Real-time systems Frequency control Power quality Graph theory Convergence consensus algorithm Privacy-preserving distributed control islanded AC MG state decomposition

来源：评论

学校读者我要写书评

暂无评论

A simplified consensus-based distributed secondary control for battery in DC

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2024年第PartB期155卷

作者： Su, Jialei Li, Kang Xing, Chen Li, Yihuan Yu, James Univ Leeds Sch Elect & Elect Engn Leeds LS2 9JT England North China Elect Power Univ Sch Control & Comp Engn Beijing 102206 Peoples R China SP Energy Networks Glasgow G25AD Scotland

DC microgrids have become a promising solution for efficient and reliable integration of renewable energy sources (RESs), battery energy storage systems (BESSs) and loads. To simultaneously achieve average voltage regulation, accurate current-sharing and state-of-charge (SoC) balance, at least two state variables need to be transmitted between neighboring BESS nodes in conventional distributed secondary control. In this paper, a simplified consensus-based distributed secondary control for BESSs in DC microgrids is proposed with only one virtually defined state variable being transmitted, where a cascaded control framework consisting of an SoC controller and a voltage controller is used to regulate DC bus voltages. This virtual state variable combines BESS SoC and its converter output current, there is no need to change the control law when BESSs switch between charging/discharging modes. Once SoCs are balanced, SoC controller works as a current controller. With the proposed control strategy, the number of transmitted state variables and the complexity of controller design are significantly reduced. Stability and steady-state analysis are also conducted to confirm the effectiveness of the proposed control strategy. Finally, Simulink simulation and hardware-in-loop tests are presented to validate the proposed control strategy.

关键词： Distributed secondary control SoC balance Battery energy storage system DC microgrids consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Distributed algorithms for Average consensus of Input Data With Fast Convergence

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2021年第5期51卷 2653-2664页

作者： Xie, Kan Cai, Qianqian Zhang, Zhaorong Fu, Minyue Guangdong Univ Technol Sch Automat Guangzhou 510006 Peoples R China Guangdong Univ Technol Guangdong Key Lab Intelligent Decis & Cooperat Co Guangzhou 510006 Peoples R China Univ Newcastle Sch Elect Engn & Comp Sci Callaghan NSW 2308 Australia

This paper proposes fast convergent distributed algorithms for weighted average consensus of input data. For acyclic graphs, we give an algorithm that converges to the exact weighted average consensus in a finite number of iterations, equal to the graph diameter. For loopy (cyclic) graphs, we offer two remedies. In the first one, we give another distributed algorithm to enable our average consensus algorithm applicable to a loopy graph by converting it into a spanning tree. In the second one, we consider a slightly modified average consensus problem whose optimal solution approximates the consensus solution with arbitrary precision, and give a modified average consensus algorithm with guaranteed exponential convergence to the optimal solution. The proposed average consensus algorithms enjoy low complexities, robustness to transmission adversaries, and asynchronous implementation. Our algorithms are conceptually different from the popular graph Laplacian approach, and converge much faster than the latter approach.

关键词： Distributed algorithms Convergence consensus algorithm Nickel Distributed databases Complexity theory Approximation algorithms Average consensus distributed algorithms distributed estimation networked control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：