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

A survey on active noise control in the past decade-Part I: Linear systems

SIGNAL PROCESSING 2021年 183卷 108039-108039页

作者： Lu, Lu Yin, Kai-Li de Lamare, Rodrigo C. Zheng, Zongsheng Yu, Yi Yang, Xiaomin Chen, Badong Sichuan Univ Sch Elect & Informat Engn Chengdu 610065 Sichuan Peoples R China Sichuan Univ Sch Comp Sci Chengdu 610065 Sichuan Peoples R China Pontificia Univ Catolica Rio de Janeiro CETUC BR-22451900 Rio de Janeiro Brazil Sichuan Univ Sch Elect Engn Chengdu 610065 Peoples R China Southwest Univ Sci & Technol Sch Informat Engn Robot Technol Used Special Environm Key Lab Sichu Mianyang 621010 Sichuan Peoples R China Xi An Jiao Tong Univ Sch Elect & Informat Engn Xian 710049 Peoples R China

Active noise control (ANC) is an effective way for reducing the noise level in electroacoustic or electromechanical systems. Since its first introduction in 1936, this approach has been greatly developed. This paper focuses on discussing the development of ANC techniques over the past decade. Linear ANC algorithms, including the celebrated filtered-x least-mean-square (FxLMS)-based algorithms and distributed ANC algorithms, are investigated and evaluated. Nonlinear ANC (NLANC) techniques, such as functional link artificial neural network (FLANN)-based algorithms, are pursued in Part II. Furthermore, some novel methods and applications of ANC emerging in the past decade are summarized. Finally, future research challenges regarding the ANC technique are discussed. (C) 2021 Elsevier B.V. All rights reserved.

关键词： Active noise control Adaptive filtering FxLMS-based algorithms distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed Nesterov Gradient Methods Over Arbitrary Graphs

引用

IEEE SIGNAL PROCESSING LETTERS 2019年第8期26卷 1247-1251页

作者： Xin, Ran Jakovetic, Dusan Khan, Usman A. Tufts Univ Dept Elect & Comp Engn Medford MA 02155 USA Univ Novi Sad Dept Math & Informat Fac Sci Novi Sad 21101 Serbia

In this letter, we introduce a distributed Nesterov gradient method, ABN, that does not require doubly stochastic weights. Instead, the implementation is based on a simultaneous application of both row- and column-stochastic weights that makes ABN applicable to arbitrary (strongly-connected) graphs. Since constructing column-stochastic weights needs additional information (the number of outgoing neighbors), not available in certain communication protocols, we derive a variation, FROZEN, that only requires row-stochastic weights, but at the expense of additional iterations for eigenvector estimation. We numerically study these algorithms for various objective functions and network parameters and show that the proposed distributed Nesterov gradient methods achieve acceleration compared to the current state-of-the-art methods for distributed optimization.

关键词： Directed graphs distributed algorithms machine learning optimization methods

来源：评论

学校读者我要写书评

暂无评论

distributed Best Response algorithms for Potential Games 16

Distributed Best Response Algorithms for Potential Games

引用

17th Annual European Control Conference (ECC)

作者： Durand, Stephane Garin, Federica Gaujal, Bruno Univ Grenoble Alpes INRIA CNRS Grenoble INPLIGGIPSA Lab F-38000 Grenoble France

ISBN: (纸本)9783952426982

In this paper we design and analyze distributed algorithms to compute a Nash equilibrium in potential games. Our algorithms are based on best-response dynamics, with suitable revision sequences (orders of play). We compute the average complexity over all potential games of best response dynamics under a random i. i. d. revision sequence, since it can be implemented in a distributed way using Poisson clocks. We obtain a distributed algorithm whose execution time is within a constant factor of the optimal centralized one. We then show how to take advantage of the structure of the interactions between players in a network game: non-interacting players can play simultaneously. This improves best response algorithm, both in the centralized and in the distributed case.

关键词： Games Nash equilibrium Clocks Round robin Heuristic algorithms distributed algorithms Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Iterative algorithms for distributed leader-follower model predictive control

Iterative algorithms for distributed leader-follower model p...

引用

IEEE Annual Conference on Decision and Control

作者： Henrique Ferraz Joao P. Hespanha Center for Control Dynamical-systems and Computation (CCDC) University of California Santa Barbara CA

ISBN: (数字)9781728113982

ISBN: (纸本)9781728113999

Two distributed algorithms to estimate the optimal control input sequence that solves a finite horizon quadratic optimization are proposed. The first algorithm utilizes information from 2-hop neighbors, whereas the second only considers 1-hop neighbors. The estimates obtained from both algorithms converge asymptotically, under appropriate assumptions, for any initialization of the algorithm. For the 2-hop algorithm, we show that the converged estimate is the optimal solution to the original optimization problem, while for the 1-hop algorithm the result is generally a suboptimal solution. We evaluate the methods with simulations for a leader-follower model predictive control problem with unstable linear agents dynamics.

关键词： Prediction algorithms Predictive control Heuristic algorithms Optimal control Cost function distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

DIAMOND: a distributed algorithm for vertex coloring problems and resource allocation

引用

IET NETWORKS 2019年第6期8卷 381-389页

作者： Miri, Mohammadhasan Mohamedpour, Kamal Darmani, Yousef Sarkar, Mahasweta KN Toosi Univ Technol Dept ECE Tehran Iran San Diego State Univ Dept ECE San Diego CA 92182 USA

The vertex colouring problem (VCP) and its generalisations have myriad applications in computer networks. To solve the VCP with $\Delta + 1$Delta+1 colours, numerous distributed algorithms based on LOCAL model have been proposed to reduce time complexity (the number of rounds), where $\Delta $Delta is the maximum vertex degree in the graph. In this paper, the authors present a distributed algorithm based on modified LOCAL model (DIAMOND) that reduces the number of rounds to one. It greedily solves the VCP with at most $\Delta + 1$Delta+1 colours. Computational results on Geometry (GEOM) graphs show that the number of used colours to colour each instance using DIAMOND is about $\left({\Delta + 1} \right)/2$mml:mfenced close=")" open="("Delta+1/2. DIAMOND is easily extended to solve greedily generalised VCPs in only one round. Moreover, they present two efficient resource allocation algorithms using DIAMOND. They allocate more resource to the graph compared with $\lpar \Delta + 1\rpar $(Delta+1)-colouring and even to $\lpar \bar d + 1\rpar $(d over bar +1)-colouring algorithms, where $\bar d$d over bar is the average vertex degree of the graph. They run in two and $\Delta $Delta rounds.

关键词： graph colouring resource allocation distributed algorithms modified LOCAL model DIAMOND GEOM graphs vertex colouring problem myriad applications computer networks maximum vertex degree distributed algorithm resource allocation algorithms distributed algorithms greedily generalised VCP

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Protocol to Solve Authenticated Byzantine Consensus

引用

FUNDAMENTA INFORMATICAE 2020年第1期173卷 73-89页

作者： Tioura, Abdelhamid Moumen, Hamouma Kalla, Hamoudi Saidi, Ahmed Ait Univ Bejaia Dept Comp Sci Bejaia 06000 Algeria Univ Batna 2 Dept Comp Sci Batna Algeria Univ Bejaia Dept Math Bejaia 06000 Algeria

The consensus is a central problem of fault-tolerant distributed computing. Unfortunately, solving such a problem is impossible in asynchronous distributed systems prone to process failures. To circumvent this impossibility (known as FLP impossibility result) in a deterministic way, on top of asynchronous distributed systems enriched with additional assumptions, several protocols have been proposed. Actually, to solve the Byzantine Consensus problem, with a deterministic manner, in systems where at most t processes may exhibit a Byzantine behavior, two approaches have been investigated. The first relies on the addition of synchrony, called TimerBased, while the second, called Time-Free, is based on the pattern of message exchange. This paper shows that both types of assumptions are not antagonist and can be combined to solve authenticated Byzantine consensus. The combined assumption considers a correct process p(i), called lozenge < t+1 >-BW, and a set X of t+1 correct processes (including pi itself) such that, eventually, for each query broadcasted by a correct process p(j) of X, p(j) receives a response from p(i) is an element of X among the (n - t) first responses to that query or both links connecting p(i) and p(j) are timely. Based on this combination, a simple hybrid authenticated Byzantine consensus protocol benefiting from the best of both worlds is proposed. As a matter of fact, although numerous hybrid protocols have been designed for the consensus problem in the crash model, this is, to our knowledge, the first hybrid deterministic solution to the Byzantine consensus problem.

关键词： Asynchronous distributed systems Byzantine process Consensus distributed algorithms Hybrid protocol Time-free assumption Timer-based assumption Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Engineering efficient and massively parallel 3D self-reconfiguration using sandboxing, scaffolding and coating

引用

ROBOTICS AND AUTONOMOUS SYSTEMS 2021年 146卷 103875-103875页

作者： Thalamy, Pierre Piranda, Benoit Bourgeois, Julien Univ Bourgogne Franche Comte UBFC CNRS FFMTO ST Inst 1 Cours Leprince Ringuet F-25200 Montbeliard France

Programmable matter based on modular self-reconfigurable robots could stand as the ultimate form of display system, through which humans could not only see the virtual world in 3D, but manipulate it and interact with it through touch. These systems rely on self-reconfiguration processes to reshape themselves and update their representation, using methods that we argue, are currently too slow for such applications due to a lack of parallelism in the motion of the robotic modules. Therefore, we propose a novel approach to the problem, promising faster and more efficient self-reconfigurations in programmable matter display systems. We contend that this can be achieved by using a dedicated platform supporting self-reconfiguration named a sandbox, acting as a reserve of modules, and by engineering the representation of objects using an internal scaffolding covered by a coating. This paper introduces a complete view of our framework for realizing this approach on quasi-spherical modules arranged in a face-centered cubic lattice. After thoroughly discussing the model, motivations, and making a case for our method, we synthesize results from published research highlighting its benefits and engage in an honest and critical discussion of its current state of implementation and perspectives. (C) 2021 Elsevier B.V. All rights reserved.

关键词： Programmable matter distributed algorithms Modular robotics Self-reconfiguration Multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

A survey on applications of Alternating Direction Method of Multipliers in smart power grids

引用

RENEWABLE & SUSTAINABLE ENERGY REVIEWS 2021年 152卷

作者： Maneesha, Ampolu Swarup, K. Shanti Indian Inst Technol Dept Elect Engn Chennai Tamil Nadu India

Optimization algorithms play a significant role in the optimal solution of various problems in Smart Grid. distributed algorithms are of considerable research interest as these algorithms replace the centrally computed algorithms. This paper surveys the literature on the Alternating Direction Method of Multipliers (ADMM) algorithm, its versions and their applications in Smart grid operation and control, particularly in Optimal Power Flow (OPF), Economic Dispatch (ED), Demand Response (DR), pricing mechanism, Electric Vehicles (EVs), Cyber-Physical Systems (CPS), Multi Energy Systems (MES), Peer to Peer (P2P) trading, resilience, forecast techniques, State Estimation (SE), and some miscellaneous topics. This paper presented research gaps and future directions on all these applications in smart grids. Furthermore, it provided a joint research gap on all these applications, such as the impact of communication failures or communication delays, effect of uncertainties, incorporating the fraudulent behaviour of participants, usage of Blockchain technology, implementation of smart contract on the performance of these algorithms. Furthermore, the work has developed a decentralized and distributed automatic electricity trading mechanism for the independent microgrid without needing a central aggregator.

关键词： ADMM distributed algorithms Electricity market P2P trading Blockchain Smart contract MES OPF

来源：评论

学校读者我要写书评

暂无评论

Complexity of Verification and Synthesis of Threshold Automata 1

引用

18th International Symposium on Automated Technology for Verification and Analysis (ATVA)

作者： Balasubramanian, A. R. Esparza, Javier Lazic, Marijana Tech Univ Munich Munich Germany

ISBN: (数字)9783030591526

ISBN: (纸本)9783030591526;9783030591519

Threshold automata are a formalism for modeling and analyzing fault-tolerant distributed algorithms, recently introduced by Konnov, Veith, and Widder, describing protocols executed by a fixed but arbitrary number of processes. We conduct the first systematic study of the complexity of verification and synthesis problems for threshold automata. We prove that the coverability, reachability, safety, and liveness problems are NP-complete, and that the bounded synthesis problem is Sigma(2)(p) complete. A key to our results is a novel characterization of the reachability relation of a threshold automaton as an existential Presburger formula. The characterization also leads to novel verification and synthesis algorithms. We report on an implementation, and provide experimental results.

关键词： Threshold automata distributed algorithms Parameterized verification

来源：评论

学校读者我要写书评

暂无评论

Breadth-first search tree integrated vertex cover algorithms for link monitoring and routing in wireless sensor networks

引用

COMPUTER NETWORKS 2021年 194卷 108144-108144页

作者： Yigit, Yasin Akram, Vahid Khalilpour Dagdeviren, Orhan Ege Univ Int Comp Inst TR-35100 Izmir Turkey

Wireless sensor networks (WSNs) are infrastructureless networks of tiny sensor motes which can sense from the environment and can transmit the sensed data through wireless communication. Generally, the transmission ranges of sensor nodes are limited and obstacles are present in the sensing area, so multi-hop communication by utilizing routing protocols is of utmost importance. Since the wireless transmission is prone to vulnerabilities such as eavesdropping and spoofing, monitoring the network traffic by secure points is a critical mission. In this paper, we propose breadth-first search tree (BFST) based vertex cover (VC) algorithms for routing and link monitoring in WSNs. BFST provides a shortest hop routing tree for WSNs and VC is a set of nodes for covering edges (communication links) of the network where it perfectly fits for network traffic monitoring. Unlike most existing algorithms which find minimal VC in a separate procedure, the proposed algorithms construct VC during the BFST establishment phase which leads to lower energy consumption for routing and link monitoring operations. We analyze the correctness proof of the algorithms along with the time, message, space, and bit complexities. We implement the proposed algorithms with their counterparts on a testbed of IRIS motes to evaluate their performances. We find through extensive evaluations from the IRIS testbed experiments and TinyOS simulations that the proposed algorithms find smaller VC sets with up to 3.1 times lower energy consumption than the existing distributed algorithms.

关键词： Wireless sensor networks Link monitoring Vertex cover Breadth-first search tree distributed algorithms Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：