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

distributed mirror descent method with operator extrapolation for stochastic aggregative games

AUTOMATICA 2024年 159卷

作者： Wang, Tongyu Yi, Peng Chen, Jie Tongji Univ Coll Elect & Informat Engn Dept Control Sci & Engn Shanghai 201804 Peoples R China Shanghai Res Inst Intelligent Autonomous Syst Shanghai 201804 Peoples R China Tongji Univ Frontiers Sci Ctr Intelligent Autonomous Syst Shanghai Peoples R China Tongji Univ Shanghai Inst Intelligent Sci & Technol Shanghai 200092 Peoples R China

In this work, we investigate a class of stochastic aggregative games, where each player has an expectation-valued objective function depending on its local strategy and the aggregate of all players' strategies. We propose a distributed algorithm with operator extrapolation to search for the Nash equilibrium, in which each player maintains an estimate of this aggregate by exchanging this information with its neighbors over a time-varying network, and updates its equilibrium estimate through the mirror descent method. Specially, we embed an operator extrapolation utilizing two step historical gradient samples at the search direction so as to accelerate the convergence. Under the generalized strongly monotone assumption characterized by the Bregman's distance on the pseudo-gradient mapping, we prove that the proposed algorithm can achieve the optimal convergence rate O(1/k) in terms of the expected Bregman distance to the Nash equilibrium. Finally, the algorithm performance is demonstrated via numerical simulations.(c) 2023 Elsevier Ltd. All rights reserved.

关键词： Stochastic aggregative games distributed algorithm Operator extrapolation Optimal convergence rate

来源：评论

学校读者我要写书评

暂无评论

Polynomial graph filters of multiple shifts and distributed implementation of inverse filtering

引用

SAMPLING THEORY SIGNAL PROCESSING AND DATA ANALYSIS 2022年第1期20卷 1-39页

作者： Emirov, Nazar Cheng, Cheng Jiang, Junzheng Sun, Qiyu Boston Coll Dept Comp Sci Chestnut Hill MA 02467 USA Sun Yat Sen Univ Sch Math Guangzhou 510275 Guangdong Peoples R China Guilin Univ Elect Technol Sch Informat & Commun Guilin 541004 Guangxi Peoples R China Univ Cent Florida Dept Math Orlando FL 32816 USA

Polynomial graph filters and their inverses play important roles in graph signal processing. In this paper, we introduce the concept of multiple commutative graph shifts and polynomial graph filters, which could play similar roles in graph signal processing as the one-order delay and finite impulse response filters in classical multi-dimensional signal processing. We implement the filtering procedure associated with a polynomial graph filter of multiple shifts at the vertex level in a distributed network on which each vertex is equipped with a data processing subsystem for limited computation power and data storage, and a communication subsystem for direct data exchange only to its adjacent vertices. In this paper, we also consider the implementation of inverse filtering procedure associated with a polynomial graph filter of multiple shifts, and we propose two iterative approximation algorithms applicable in a distributed network and in a central facility. We also demonstrate the effectiveness of the proposed algorithms to implement the inverse filtering procedure on denoising time-varying graph signals and a dataset of US hourly temperature at 218 locations.

关键词： Graph signal processing Polynomial graph filter Inverse filtering distributed algorithm distributed network Multivariate Chebyshev polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Implementation of Abstract MAC Layer Under Jamming

引用

Tsinghua Science and Technology 2022年第2期27卷 257-269页

作者： Yifei Zou Minghui Xu Dongxiao Yu Liandong Chen Shaoyong Guo Xiaoshuang Xing School of Computer Science and Technology Shandong UniversityQingdao 266237China Information and Telecommunication Branch State Grid Hebei Electric Power Company Ltd.Shijiazhuang 050022China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and TelecommunicationsBeijing 100876China School of Computer Science and Engineering Changshu Institute of TechnologyChangshu 215500China

In the past decades,with the widespread implementation of wireless networks,such as the Internet of Things,an enormous demand for designing relative algorithms for various realistic scenarios has ***,with the widening of scales and deepening of network layers,it has become increasingly challenging to design such algorithms when the issues of message dissemination at high levels and the contention management at the physical layer are ***,the abstract medium access control(absMAC)layer,which was proposed in2009,is designed to solve this ***,the absMAC layer consists of two basic operations for network agents:the acknowledgement operation to broadcast messages to all neighbors and the progress operation to receive messages from *** absMAC layer divides the wireless algorithm design into two independent and manageable components,i.e.,to implement the absMAC layer over a physical network and to solve higher-level problems based on the acknowledgement and progress operations provided by the absMAC layer,which makes the algorithm design easier and *** this study,we consider the implementation of the absMAC layer under *** efficient algorithm is proposed to implement the absMAC layer,attached with rigorous theoretical analyses and extensive simulation *** on the implemented absMAC layer,many high-level algorithms in non-jamming cases can be executed in a jamming network.

关键词： abstract MAC layer distributed algorithm Rayleigh-fading model jamming networks

来源：评论

学校读者我要写书评

暂无评论

Federated Genetic algorithm: Two-Layer Privacy-Preserving Trajectory Data Publishing

Federated Genetic Algorithm: Two-Layer Privacy-Preserving Tr...

引用

Genetic and Evolutionary Computation Conference (GECCO)

作者： Ge, Yong-Feng Wang, Hua Cao, Jinli Zhang, Yanchun Kambourakis, Georgios Victoria Univ Melbourne Vic Australia La Trobe Univ Bundoora Vic Australia Zhejiang Normal Univ Peng Cheng Lab Hangzhou Zhejiang Peoples R China Univ Aegean Mitilini Greece

ISBN: (纸本)9798400704949

Nowadays, trajectory data is widely available and used in various real-world applications such as urban planning, navigation services, and location-based services. However, publishing trajectory data can potentially leak sensitive information about identity, personal profiles, and social relationships, and requires privacy protection. This paper focuses on optimizing Privacy-Preserving Trajectory Data Publishing (PP-TDP) problems, addressing the limitations of existing techniques in the trade-off between privacy protection and information preservation. We propose the Federated Genetic algorithm (FGA) in this paper, aiming to achieve better local privacy protection and global information preservation. FGA consists of multiple local optimizers and a single global optimizer. The parallel local optimizer enables the local data center to retain the original trajectory data and share only the locally anonymized outcomes. The global optimizer collects the local anonymized outcomes and further optimizes the preservation of information while achieving comprehensive privacy protection. To optimize the discrete-domain PP-TDP problems more efficiently, this paper proposes a grouping-based strategy, an intersection-based crossover operation, and a complement-based mutation operation. Experimental results demonstrate that FGA outperforms its competitors in terms of solution accuracy and search ***, trajectory data is widely available and used in various real-world applications such as urban planning, navigation services, and location-based services. However, publishing trajectory data can potentially leak sensitive information about identity, personal profiles, and social relationships, and requires privacy protection. This paper focuses on optimizing Privacy-Preserving Trajectory Data Publishing (PP-TDP) problems, addressing the limitations of existing techniques in the trade-off between privacy protection and information preservation. We propose the Federated Ge

关键词： Genetic algorithm trajectory data anonymization distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Distance-2-Dispersion with Termination by a Strong Team 10th

Distance-2-Dispersion with Termination by a Strong Team

引用

10th International Conference on algorithms and Discrete Applied Mathematics (CALDAM)

作者： Gorain, Barun Kaur, Tanvir Mondal, Kaushik Indian Inst Technol Bhilai Bhilai India Indian Inst Technol Ropar Rupnagar India

ISBN: (纸本)9783031522123;9783031522130

Distance-2-Dispersion (D-2-D) problem aims to disperse k mobile robots starting from an arbitrary initial configuration on an anonymous port-labeled graph G with n nodes such that no two robots occupy adjacent nodes in the final configuration, though multiple robots may occupy a single node if there is no other empty node whose all adjacent nodes are also empty. In the existing literature, this problem is solved starting from a rooted configuration for k(>= 1) robots using O(m Delta) synchronous rounds with a total of O(log n) memory per robot, where m is the number of edges and Delta is the maximum degree of the graph. In this work, we start with k > n mobile robots and improve the run time to O(m) starting from a rooted configuration using the same amount of memory per robot. Further, we achieve D-2-D for an arbitrary initial configuration in O(pm) rounds using O(log n) memory per robot, where p is the number of nodes containing robots in the initial configuration. Both the algorithms terminate without any global knowledge of m, n, Delta, k, p. As we start with k > n robots, the nodes occupied by robots in the final configuration form a maximal independent set of the graph.

关键词： Mobile robots Dispersion Distance-2-Dispersion Deterministic algorithm distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Process-commutative distributed objects: From cryptocurrencies to Byzantine-Fault-Tolerant CRDTs

引用

THEORETICAL COMPUTER SCIENCE 2024年 1017卷

作者： Frey, Davide Guillou, Lucie Raynal, Michel Taiani, Francois Univ Rennes INRIA CNRS IRISA Rennes France Univ Paris Cite IRIF CNRS Paris France

This paper explores the territory that lies between best-effort Byzantine-Fault-Tolerant Conflict free Replicated Data Types (BFT CRDTs) and totally ordered distributed ledgers, such as those implemented by Blockchains. It formally characterizes a novel class of distributed objects that only requires a First In First Out (FIFO) order on the object operations from each process (taken individually). The formalization leverages Mazurkiewicz traces to define legal sequences of operations and ensure both Strong Eventual Consistency (SEC) and Pipleline Consistency (PC). The paper presents a generic algorithm that implements this novel class of distributed objects both in a crash and Byzantine setting. It also illustrates the practical interest of the proposed approach using four instances of this class of objects, namely money transfer, Petri nets, multi-sets, and concurrent work stealing dequeues.

关键词： distributed algorithm Byzantine fault tolerance Conflict-free replicated data types Mazurkiewicz traces

来源：评论

学校读者我要写书评

暂无评论

Federated Learning for distributed Spectrum Sensing in NextG Communication Networks 4

Federated Learning for Distributed Spectrum Sensing in NextG...

引用

Conference on Artificial Intelligence and Machine Learning for Multi-Domain Operations Applications IV

作者： Shi, Yi Sagduyu, Yalin E. Erpek, Tugba Virginia Tech Commonwealth Cyber Initiat Arlington VA 22203 USA Virginia Tech Natl Secur Inst Arlington VA USA

ISBN: (纸本)9781510651036;9781510651029

NextG networks are intended to provide the flexibility of sharing the spectrum with incumbent users and support various spectrum monitoring tasks such as anomaly detection, fault diagnostics, user equipment identification, and authentication. For that purpose, a network of wireless sensors is needed to monitor the spectrum for signal transmissions of interest over a large deployment area. Each sensor receives signals under a specific channel condition depending on its location and trains an individual model of a deep neural network accordingly to classify signals. To improve the accuracy, individual sensors may exchange sensing data or sensor results with each other or with a fusion center (such as in cooperative spectrum sensing). In this paper, distributed federated learning over a multi-hop wireless network is considered to collectively train a deep neural network for signal identification. In distributed federated learning, each sensor broadcasts its trained model to its neighbors, collects the deep neural network models from its neighbors, and aggregates them to initialize its own model for the next round of training. Without exchanging any spectrum data, this process is repeated over time such that a common deep neural network is built across the network while preserving the privacy associated with signals collected at different locations. Signal classification accuracy and convergence time are evaluated for different network topologies (including line, star, ring, grid, and random networks) and packet loss events. In addition, the reduction of communication overhead and energy consumption is considered with random participation of sensors in model updates. The results show the feasibility of extending cooperative spectrum sensing over a general multi-hop wireless network through federated learning and indicate the robustness of federated learning to wireless network effects, thereby sustaining high accuracy with low communication overhead and energy consumpti

关键词： Federated learning spectrum monitoring cooperative spectrum sensing signal classification distributed algorithm wireless network

来源：评论

学校读者我要写书评

暂无评论

Secure Conflicts Avoidance in Multidomain Environments: A distributed Approach

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2021年第9期51卷 5478-5489页

作者： Yang, Benyuan Hu, Hesuan Xidian Univ Sch Electromech Engn Xian 710071 Peoples R China Nanyang Technol Univ Coll Engn Sch Comp Sci & Engn Singapore 639798 Singapore Xi An Jiao Tong Univ State Key Lab Mfg Syst Engn Xian 710054 Peoples R China

In a multidomain application environment, it is of paramount importance for different organizations to collaborate with each other to facilitate secure interoperation. However, various types of conflicts related to access control constraints may arise as a result of integrating access control policies for individual domains, such as role inheritance violations (RIVs) and separation of duty violations (SoDVs). Current methods solve the conflicts in a centralized way by withdrawing or removing all crossdomain relationships resulting in the violations with the knowledge of all domains. However, these methods are inappropriate for large-scale systems due to their high computational complexity. In this article, we propose a distributed approach to avoid secure conflicts in a multidomain environment. We first model the role inheritance hierarchies of multiple domains as an interoperation graph. We then develop RIVs and SoDVs avoidance algorithms based on the interoperation graph and the communications among different domains. Each domain can execute the algorithms autonomously and in real time by evaluating whether its succeeding activated role can result in RIVs and SoDVs. We show that the new algorithms perform well in contrast to the existing algorithms.

关键词： IP networks Organizations Real-time systems Blacklisting Computational modeling distributed algorithm multidomain role inheritance violation (RIV) secure conflict resolution separation of duty

来源：评论

学校读者我要写书评

暂无评论

Fully Polynomial-Time distributed Computation in Low-Treewidth Graphs 22

Fully Polynomial-Time Distributed Computation in Low-Treewid...

引用

34th ACM Symposium on Parallelism in algorithms and Architectures (SPAA)

作者： Izumi, Taisuke Kitamura, Naoki Naruse, Takamasa Schwartzman, Gregory Osaka Univ Grad Sch Informat Sci & Technol Osaka Japan Nagoya Inst Technol Grad Sch Engn Nagoya Aichi Japan Japan Adv Inst Sci & Technol JAIST Nomi Ishikawa Japan

ISBN: (纸本)9781450391467

We consider global problems, i.e. problems that take at least diameter time, even when the bandwidth is not restricted. We show that all problems considered admit efficient solutions in low-treewidth graphs. By "efficient" we mean that the running time has polynomial dependence on the treewidth, a linear dependence on the diameter (which is unavoidable), and only a polylogarithmic dependence on n, the number of nodes in the graph. We present the following results in the CONGEST model (where tau and D denote the treewidth and diameter of the graph, respectively): circle Exact single-source shortest paths (Actually, the more general problem of computing a distance labeling scheme) for weighted and directed graphs can be computed in (O) over tilde (tau D-2 +tau(5)) rounds(1). This is the first exact algorithm for the directed single-source shortest paths problem in low-treewidth graphs attaining a (O) over tilde (tau D-O(1))-round running time. circle Exact bipartite unweighted maximum matching can be computed in (O) over tilde (tau D-4 +tau(7)) rounds. This is the first algorithm for a non-trivial graph class that achieves a worst case running time sublinear in the input size. circle The weighted girth can be computed in (O) over tilde (tau D-2 +tau(5)) rounds for both directed and undirected graphs. Our results are the first to imply an exponential separation between the complexity of computing girth and diameter for a non-trivial graph class.

关键词： distributed algorithm treewidth shortest path matching

来源：评论

学校读者我要写书评

暂无评论

distributed Formation Control: Asymptotic Stabilization Results Under Local Noisy Information

引用

IEEE TRANSACTIONS ON CYBERNETICS 2021年第1期51卷 16-27页

作者： Wang, Bo Tian, Yu-Ping Hangzhou Dianzi Univ Sch Automat Hangzhou 310018 Peoples R China

This paper studies the relative-position-based reference-frame-free formation control in the plane for discrete-time multiagent systems under both measurement and communication noises. To achieve the desired formation, a robust distributed orientation estimate algorithm and a robust distributed formation control law are designed. The main idea of our method is to use the historical measurement information to get unbiased estimates and use the stochastic approximation method to inhibit the noise. Under mild assumptions on the measurement/communication noises and agents' initial orientation angles, we show that a common reference frame can be asymptotically shared by all agents and the desired formation can be asymptotically stabilized almost surely under the designed distributed control law, if and only if the magnitude of the bearing measurement noise is less than (pi/4), the communication and distance sensing topology is rooted and the corresponding bearing sensing topology is connected. Simulations are conducted to verify the correctness and effectiveness of our orientation estimate algorithm and formation control law.

关键词： Communication noise distributed algorithm formation control measurement noise stochastic approximation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：