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

Robust distributed Diffusion Recursive Least Squares algorithms With Side Information for Adaptive Networks

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2019年第6期67卷 1566-1581页

作者： Yu, Yi Zhao, Haiquan de Lamare, Rodrigo C. Zakharov, Yuriy Lu, Lu Southwest Univ Sci & Technol Sch Informat Engn Mianyang 621010 Peoples R China Southwest Jiaotong Univ Sch Elect Engn Chengdu 610031 Sichuan Peoples R China Pontificia Univ Catolica Rio de Janeiro CETUC BR-22451900 Rio de Janeiro Brazil Univ York Dept Elect Engn York YO10 5DD N Yorkshire England Sichuan Univ Sch Elect & Informat Engn Chengdu 610017 Sichuan Peoples R China

This work develops robust diffusion recursive least-squares algorithms to mitigate the performance degradation often experienced in networks of agents in the presence of impulsive noise. The first algorithm minimizes an exponentially weighted least-squares cost function subject to a time-dependent constraint on the squared norm of the intermediate update at each node. A recursive strategy for computing the constraint is proposed using side information from the neighboring nodes to further improve the robustness. We also analyze the mean-square convergence behavior of the proposed algorithm. The second proposed algorithm is a modification of the first one based on the dichotomous coordinate descent iterations. It has a performance similar to that of the former, however, its complexity is significantly lower especially when input regressors of agents have a shift structure and it is well suited to practical implementation. Simulations show the superiority of the proposed algorithms over previously reported techniques in various impulsive noise scenarios.

关键词： distributed algorithms diffusion cooperation dichotomous coordinate-descent impulsive noises recursive least squares algorithms

来源：评论

学校读者我要写书评

暂无评论

Local Mending 1

引用

29th International Colloquium on Structural Information and Communication Complexity (SIROCCO)

作者： Balliu, Alkida Hirvonen, Juho Melnyk, Darya Olivetti, Dennis Rybicki, Joel Suomela, Jukka Gran Sasso Sci Inst Laquila Italy Aalto Univ Espoo Finland IST Austria Klosterneuburg Austria

ISBN: (数字)9783031099939

ISBN: (纸本)9783031099939;9783031099922

In this work we introduce the graph-theoretic notion of mendability: for each locally checkable graph problem we can define its mending radius, which captures the idea of how far one needs to modify a partial solution in order to "patch a hole." We explore how mendability is connected to the existence of efficient algorithms, especially in distributed, parallel, and fault-tolerant settings. It is easy to see that O(1)-mendable problems are also solvable in O(log* n) rounds in the LOCAL model of distributed computing. One of the surprises is that in paths and cycles, a converse also holds in the following sense: if a problem Pi can be solved in O(log* n), there is always a restriction. Pi' subset of Pi that is still efficiently solvable but that is also O(1)-mendable. We also explore the structure of the landscape of mendability. For example, we show that in trees, the mending radius of any locally checkable problem is O(1), Theta(log n), or Theta(n), while in general graphs the structure is much more diverse.

关键词： Mendability Fault tolerance LCL problems distributed algorithms Parallel algorithms Dynamic algorithms

来源：评论

学校读者我要写书评

暂无评论

Resilient Constrained Consensus over Complete Graphs via Feasibility Redundancy

Resilient Constrained Consensus over Complete Graphs via Fea...

引用

American Control Conference (ACC)

作者： Zhu, Jingxuan Lin, Yixuan Velasquez, Alvaro Liu, Ji SUNY Stony Brook Dept Appl Math & Stat Stony Brook NY 11794 USA SUNY Stony Brook Dept Elect & Comp Engn Stony Brook NY USA Air Force Res Lab Informat Directorate Wright Patterson AFB OH USA

ISBN: (数字)9781665451963

ISBN: (纸本)9781665451963

This paper considers a resilient high-dimensional constrained consensus problem and studies a resilient distributed algorithm for complete graphs. For convex constrained sets with a singleton intersection, a sufficient condition on feasibility redundancy and set regularity for reaching a desired consensus exponentially fast in the presence of Byzantine agents is derived, which can be directly applied to polyhedral sets. A necessary condition on feasibility redundancy for the resilient constrained consensus problem to be solvable is also provided.

关键词： Sufficient conditions Autonomous systems Redundancy Control systems distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Gathering despite a linear number of weakly Byzantine agents 10

Gathering despite a linear number of weakly Byzantine agents

引用

10th International Symposium on Computing and Networking (CANDAR)

作者： Hirose, Jion Nakamura, Junya Ooshita, Fukuhito Inoue, Michiko Nara Inst Sci & Technol Ikoma Japan Toyohashi Univ Technol Toyohashi Aichi Japan Fukui Univ Technol Fukui Japan

ISBN: (纸本)9781665475327

We study the gathering problem to make multiple agents initially scattered in arbitrary networks gather at a single node. There exist k agents with unique identifiers (IDs) in the network, and f of them are weakly Byzantine agents, which behave arbitrarily except falsifying their identifiers. The agents behave in synchronous rounds, and each node does not have any memory like a whiteboard. In the literature, two algorithms for solving the gathering problem have been proposed. The first algorithm assumes that the number n of nodes is given to agents and achieves the gathering in O(n(4) center dot vertical bar Lambda(good)vertical bar center dot X(n)) rounds, where vertical bar Lambda(good)vertical bar is the length of the largest ID among non-Byzantine agents, and X(n) is the number of rounds required to explore any network composed of n nodes. The second algorithm assumes that the upper bound N of n is given to agents and at least 4f(2) + 8f + 4 non-Byzantine agents exist, and achieves the gathering in O((f + vertical bar Lambda(good)vertical bar ) center dot X(N)) rounds. Both the algorithms allow agents to start gathering at different times. The first algorithm can terminate agents simultaneously, while the second one not. In this paper, we seek an algorithm that solves the gathering problem efficiently with the intermediate number of non-Byzantine agents since there is a large gap between the numbers of non-Byzantine agents in the previous works. The resultant gathering algorithm works with at least 8f + 8 non-Byzantine agents when agents start the algorithm at the same time, agents may terminate at different times, and N is given to agents. To reduce the number of agents, we propose a new technique to simulate a Byzantine consensus algorithm for synchronous message-passing systems on agent systems. The proposed algorithm achieves the gathering in O(f center dot vertical bar Lambda(good)vertical bar center dot X(N)) rounds. This algorithm is faster than the first

关键词： distributed algorithms Byzantine environments Gathering

来源：评论

学校读者我要写书评

暂无评论

Cooperative Estimation of Local Atmospheric Delay in Precise Point Positioning with GNSS

Cooperative Estimation of Local Atmospheric Delay in Precise...

引用

IEEE Conference on Control Technology and Applications (CCTA)

作者： Uwineza, Jean-Bernard Farrell, Jay A. Univ Calif Riverside Dept Elect & Comp Engn Riverside CA 92521 USA

ISBN: (数字)9781665473385

ISBN: (纸本)9781665473385

In standard PPP GNSS, residual atmospheric delay (RAD) is estimated independently at each agent by filtering through time, resulting in estimation periods that are too long for vehicular applications. This paper explores cooperative estimation of local vertical RAD within a network of interacting agents. After formulating the problem, the paper formulates and compares: the individual solution when there is no inter-agent interactions, the centralized solution when all agents interact with a central node, and four distributed algorithms (i.e., information-weighted consensus (IWC), covariance intersection (CI), Inverse covariance intersection (ICI), and ellipsoidal intersection (EI)). The role of information shared between agents (i.e., cross-correlation) is specifically considered. The article shows that the distributed methods estimate the common RAD faster than independent agents. This increased accuracy enables faster and more accurate estimation of the unique portion of each agent's state (e.g., horizontal position).

关键词： Global navigation satellite system Filtering Estimation Collaboration Delays distributed algorithms Standards

来源：评论

学校读者我要写书评

暂无评论

Collaborative Learning for Large-Scale Discrete Optimal Transport under Incomplete Populational Information

Collaborative Learning for Large-Scale Discrete Optimal Tran...

引用

IEEE Conference on Computer Communications (IEEE INFOCOM)

作者： Kaur, Navpreet Chen, Juntao Fordham Univ Dept Comp & Informat Sci New York NY 10023 USA

ISBN: (纸本)9781665409261

Optimal transport (OT) is a framework that allows for optimal allocation of limited resources in a network consisting of sources and targets. The standard OT paradigm does not extend over a large population of different types. In this paper, we establish a new OT framework with a large and heterogeneous population of target nodes. The heterogeneity of targets is described by a type distribution function. We consider two instances in which the distribution is known and unknown to the sources, i.e., transport designer. For the former case, we propose a fully distributed algorithm to obtain the solution. For the latter case in which the targets' type distribution is not available to the sources, we develop a collaborative learning algorithm to compute the OT scheme efficiently. We evaluate the performance of the proposed learning algorithm using a case study.

关键词： Conferences Sociology Collaborative work Resource management Statistics distributed algorithms Standards

来源：评论

学校读者我要写书评

暂无评论

Application of Association Rule Algorithm in distributed New SQL Database Design

Application of Association Rule Algorithm in Distributed New...

引用

Integrated Circuits and Communication Systems (ICICACS), IEEE International Conference on

作者： Hui Cai Zhenghao Qian Jiang Jiang Digital Department of Guangdong Power Grid Co. Ltd. Guangdong China Digital Department of China Southern Power Grid Co. Ltd. Guangdong China

In recent years, with the increasingly widespread application of digital technology in various enterprises, the role of databases in various enterprises will also become increasingly important. A lot of useful and critical information is often hidden in a large amount of information stored in the database system. How to obtain this information efficiently and accurately has always been a problem, so data mining technology came into being. This paper aims to study the application of association rule algorithm in distributed NewSQL database design. On the basis of analyzing the classical association rule algorithm, the advantages of NewSQL database and the processing process of SQL, the traditional association rule algorithm is improved and a distributed algorithm is designed. NewSQL database, in order to improve the performance of the algorithm for testing, this paper uses multiple computers to form a local area network to simulate the NewSQL database system. The test results show that when the minimum support is low, the execution efficiency of the improved association rule algorithm is slightly better than that of the traditional association rule algorithm

关键词： Integrated circuits Operating systems distributed databases Systems architecture Database systems Data mining distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Average Awake Complexity of MIS and Matching 22

Average Awake Complexity of MIS and Matching

引用

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

作者： Ghaffari, Mohsen Portmann, Julian Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781450391467

Chatterjee, Gmyr, and Pandurangan [PODC 2020] recently introduced the notion of awake complexity for distributed algorithms, which measures the number of rounds in which a node is awake. In the other rounds, the node is sleeping and performs no computation or communication. Measuring the number of awake rounds can be of significance in many settings of distributed computing, e.g., in sensor networks where energy consumption is of concern. In that paper, Chatterjee et al. provide an elegant randomized algorithm for the Maximal Independent Set (MIS) problem that achieves an O(1) node-averaged awake complexity. That is, the average awake time among the nodes is O(1) rounds. However, to achieve that, the algorithm sacrifices the more standard round complexity measure from the well-known O(log n) bound of MIS, due to Luby [STOC'85], to O(log(3.41)n) rounds. Our first contribution is to present a simple randomized distributed MIS algorithm that, with high probability, has O( 1) nodeaveraged awake complexity and O (log n) worst-case round complexity. Our second, and more technical contribution, is to show algorithms with the same O(1) node-averaged awake complexity and O(log n) worst-case round complexity for 1 +epsilon approximation of maximum matching and 2 +epsilon approximation of minimum vertex cover, where.. denotes an arbitrary small positive constant.

关键词： Maximal Independent Set Maximum Matching Approximation sleeping model node-averaged round complexity awake complexity MIS MM energy-efficiency distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Achieving Sublinear Complexity under Constant T in T-interval Dynamic Networks 22

Achieving Sublinear Complexity under Constant T in T-interva...

引用

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

作者： Hou, Ruomu Jahja, Irvan Sun, Yucheng Wu, Jiyan Yu, Haifeng Natl Univ Singapore Singapore Singapore

ISBN: (纸本)9781450391467

This paper considers standard T-interval dynamic networks, where the N nodes in the network proceed in lock-step rounds, and where the topology of the network can change arbitrarily from round to round, as determined by an adversary. The adversary promises that in every T consecutive rounds, the T (potentially different) topologies in those.. rounds contain a common connected subgraph that spans all nodes. Within such a context, we propose novel algorithms for solving some fundamental distributed computing problems such as Count/Consensus/Max. Our algorithms are the first algorithms whose complexities do not contain an Omega(N) term, under constant T values. Previous sublinear algorithms require significantly larger T values.

关键词： distributed algorithms T-interval dynamic networks sublinear algorithms

来源：评论

学校读者我要写书评

暂无评论

Solving the Pattern Formation by Mobile Robots With Chirality

引用

IEEE ACCESS 2021年 9卷 88177-88204页

作者： Cicerone, Serafino Di Stefano, Gabriele Navarra, Alfredo Univ Aquila Dept Informat Engn Comp Sci & Math I-67100 Laquila Italy Univ Perugia Dept Math & Comp Sci I-06123 Perugia Italy

Among fundamental problems in the context of distributed computing by mobile robots, the Pattern Formation (PF) is certainly the most representative. Given a multi-set F of points in the Euclidean plane and a set R of robots such that vertical bar R vertical bar=vertical bar F vertical bar , PF asks for a distributed algorithm that moves robots so as to reach a configuration similar to F . Similarity means that robots must be disposed as F regardless of translations, rotations, reflections, uniform scalings. In the literature, PF has been approached by assuming asynchronous robots endowed with chirality, i.e. a common handedness. The proposed algorithm along with its correctness proof turned out to be flawed. In this paper, we propose a new algorithm on the basis of a recent methodology studied for approaching problems in the context of distributed computing by mobile robots. According to this methodology, the correctness proof results to be well-structured and less prone to faulty arguments. We then ultimately characterize PF when chirality is assumed.

关键词： distributed algorithms mobile robots asynchrony pattern formation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：