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

Estimate the States of Multiagent Systems Under Homologous Attacks by Optimization Approaches

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2023年第1期10卷 430-440页

作者： Shi, Mingming Wan, Neng Sichuan Univ Sch Aeronaut & Astronaut Chengdu 610065 Peoples R China Univ Illinois Dept Mech Sci & Engn Urbana IL 61801 USA Univ Illinois Coordinated Sci Lab Urbana IL 61801 USA

This article revisits the problem of secure state estimation of multiagent systems under homologous attacks in [1]. We first characterize the condition on agents dynamics such that agents states can be uniquely solved from the attacked measurements of agents outputs. This condition implies that the conclusion in [1] that the attack signal and agents states can be uniquely reconstructed by adding longer time-windowed measurements is incomplete. Based on this condition, when the communication graph of agents is undirected, we propose two different distributed secure state estimators by reformulating the state reconstruction as optimization problems. The first estimator does not need agents to exchange with others their dynamics information, which is used by the second, but requires updating and exchanging more variables. Both estimators are much simpler and easier to understand than that proposed in [1]. Moreover, when the communication graph is directed and strongly connected, we also proposed two distributed state estimators, adjusted from the estimators for undirected graphs. Both of them require no global information of communication graphs but the network size. At last, we verify all the theoretical results with simulation examples.

关键词： Sensors Optimization Extraterrestrial measurements Sensor systems Observability Network systems Multi-agent systems distributed algorithms homologous attacks multi-agent systems state estimation

来源：评论

学校读者我要写书评

暂无评论

Memory optimal dispersion by anonymous mobile robots

引用

DISCRETE APPLIED MATHEMATICS 2023年第1期340卷 171-182页

作者： Das, Archak Bose, Kaustav Sau, Buddhadeb Jadavpur Univ Dept Math 188 Raja SC Mallick Rd Kolkata 700032 W Bengal India Indian Stat Inst Adv Comp & Microelect Unit 203 B T Rd Kolkata 700108 W Bengal India

Consider a team of kappa <= n autonomous mobile robots initially placed at a node of an arbitrary graph G with n nodes. The dispersion problem asks for a distributed algorithm that allows the robots to reach a configuration in which each robot is at a distinct node of the graph. If the robots are anonymous, i.e., they do not have any unique identifiers, then the problem is not solvable by any deterministic algorithm. However, the problem can be solved even by anonymous robots if each robot is given access to a fair coin which they can use to generate random bits. In this setting, it is known that the robots require O(log.) bits of memory to achieve dispersion, where. is the maximum degree of G. On the other hand, the best known memory upper bound is min{Delta,max{log Delta, log D}} (D = diameter of G), which can be omega(log Delta), depending on the values of Delta and D. In this paper, we close this gap by presenting an optimal algorithm requiring O(log Delta) bits of memory. (c) 2023 Elsevier B.V. All rights reserved.

关键词： Mobile robots Dispersion Depth first search distributed algorithms Randomized algorithm

来源：评论

学校读者我要写书评

暂无评论

Molecular Oblivious Robots: A New Model for Robots With Assembling Capabilities

引用

IEEE ACCESS 2023年 11卷 15701-15724页

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

Research in theoretical swarm robotics focuses on models that assign to robots a minimal set of capabilities. One of the models well investigated is certainly OBLOT, addressing the case of distributed robots that are, anonymous, without means of communication, and oblivious. Here we propose MOBLOT, an extension of OBLOT that allows to resolve a larger spectrum of cases. MOBLOT stands for molecular oblivious robots: like atoms combine themselves to form molecules, in MOBLOT simple robots can bond with each other in order to create possibly bigger computational units with more intrinsic capabilities with respect to robots (called molecules also in the model);like in nature, molecules can further bond to create more complex structures (e.g., the matter), the MOBLOT version of molecules can exploit their own capabilities to accomplish new tasks or simply to arrange themselves to form any shape defined according to some compositional properties. In order to better understand the potentials of MOBLOT, we introduce a new problem called matter formation (MF). We do provide a necessary condition for the solvability of MF, in general. This relies on the "amount of symmetries' arising by the disposal of the robots. In practice, we show how molecules can break certain symmetries that cannot be broken in OBLOT. Finally, as a case study of MOBLOT, we consider a representative problem derived from the general MF problem along with a distributed resolution algorithm and show its correctness.

关键词： distributed algorithms swarm and modular robotics self-organizing systems oblivious robots pattern formation

来源：评论

学校读者我要写书评

暂无评论

An optimisation for a two-round good-case latency protocol

引用

IET INFORMATION SECURITY 2023年第4期17卷 664-680页

作者： Hu, Kexin Zhang, Zhenfeng Guo, Kaiwen Jiang, Weiyu Li, Xiaoman Han, Jiang Chinese Acad Sci Inst Software Beijing Peoples R China Univ Chinese Acad Sci Beijing Peoples R China Huawei Technol Beijing Peoples R China Henan Univ Technol Sch Management Dept Ecommerce Zhengzhou Peoples R China

Byzantine broadcast is a fundamental primitive in distributed computing. A highly efficient Byzantine broadcast protocol, motivated by the real-world performance of practical state machine replication protocols, is increasingly needed. This article focuses on the state-of-the-art partially synchronous Byzantine broadcast protocol proposed by Abraham et al. (PODC'21), which achieves optimal good-case latency of two rounds and optimal resilience of n & GE;5f - 1 in this setting. Each step of the protocol is analysed, and then improved by cutting down the number of messages required to be collected and transmitted in the heaviest step of the protocol by about half, without adding any extra cost. This benefits from a new property, named "spread", that we identify and extract from the original protocol. It helps us to eliminate non-essential work in its view-change procedure. The authors also show that no further reduction is possible without violating security. A prototype is implemented and the performances of improved and original protocols are evaluated in the same environment. The results show that our improvement can achieve about 50% lower communication cost and 40% shorter latency at a scale of 100 replicas. The latency gap becomes wider as the scale further increases.

关键词： distributed algorithms fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Best Effort Workload Disparity Minimization in Multi-Agent Systems With Capacity Constraints

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2023年第8期68卷 4998-5005页

作者： Oliva, Gabriele Charalambous, Themistoklis Faramondi, Luca Setola, Roberto Gasparri, Andrea Univ Campus Biomed Roma Dept Engn Unit Automatic Control Rome Italy Univ Cyprus Sch Engn Dept Elect & Comp Engn Nicosia Cyprus Univ Campus Biomed Roma Dept Engn Unit Automatic Control Rome Italy Roma Tre Univ Dept Engn Rome Italy

In this article, we propose a load balancing problem formulation where agents cooperate with the aim of simultaneously minimizing both the workload disparity among the agents and the overall workload transfer, under network capacity constraints. Notably, in our computational setting, the network is not just a device for the distributed solution of an optimization problem;on the contrary, the problem shares the same sparsity pattern as the network, and this aspect allows us to solve it without the need for the agents to store large amount of data. In particular, while the load balancing process occurs over directed links, agents' communication is assumed to be bidirectional. For this optimization setting, first, an optimality condition is derived;then, a provably convergent distributed algorithm to compute the optimal solution is developed, and an upper bound on the convergence rate is characterized. Simulation results are provided to corroborate the validity and performance of our theoretical findings.

关键词： Cooperative multi-agent systems distributed algorithms load balancing

来源：评论

学校读者我要写书评

暂无评论

The Impact of Measurement Passing in Sensor Network Measurement Selection

引用

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2023年第1期10卷 112-123页

作者： Grimsman, David Kirchner, Matthew R. Hespanha, Joao P. Marden, Jason R. Brigham Young Univ Comp Sci Dept Provo UT 84602 USA Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA

This article considers a set of sensors, which, as a group, are tasked with taking measurements of the environment and sending a small subset of the measurements to a centralized data fusion center, where the measurements will be used to estimate the overall state of the environment. The sensors' goal is to send the most informative set of measurements so that the estimate is as accurate as possible. This problem is formulated as a submodular maximization problem, for which there exists a well-studied greedy algorithm, where each sensor sequentially chooses a set of measurements from its own local set and communicates its decision to the future sensors in the sequence. In this work, sensors can additionally share measurements with one another, in order to augment the decision set of each sensor. We explore how this increase in communication can be exploited to improve the results of the nominal greedy algorithm. Specifically, we show that this measurement passing can improve the quality of the resulting measurement set by up to a factor of n+1, where n is the number of sensors.

关键词： Greedy algorithms Robot sensing systems Current measurement Network systems Loss measurement Control systems Satellites Agent-based modeling distributed algorithms intelligent agents multiagent systems

来源：评论

学校读者我要写书评

暂无评论

State-of-the-art in Large-Scale Volume Visualization Beyond Structured Data

引用

COMPUTER GRAPHICS FORUM 2023年第3期42卷 491-515页

作者： Sarton, J. Zellmann, S. Demirci, S. Gudukbay, U. Alexandre-Barff, W. Lucas, L. Dischler, J. M. Wesner, S. Wald, I. Univ Strasbourg Strasbourg France Univ Cologne Cologne Germany Bilkent Univ Ankara Turkiye Univ Reims Reims France NVIDIA Santa Clara CA USA

Volume data these days is usually massive in terms of its topology, multiple fields, or temporal component. With the gap between compute and memory performance widening, the memory subsystem becomes the primary bottleneck for scientific volume visualization. Simple, structured, regular representations are often infeasible because the buses and interconnects involved need to accommodate the data required for interactive rendering. In this state-of-the-art report, we review works focusing on large-scale volume rendering beyond those typical structured and regular grid representations. We focus primarily on hierarchical and adaptive mesh refinement representations, unstructured meshes, and compressed representations that gained recent popularity. We review works that approach this kind of data using strategies such as out-of-core rendering, massive parallelism, and other strategies to cope with the sheer size of the ever-increasing volume of data produced by today's supercomputers and acquisition devices. We emphasize the data management side of large-scale volume rendering systems and also include a review of tools that support the various volume data types discussed.

关键词： CCS Concepts • Computing methodologies → Rendering Volumetric models Ray tracing Graphics processors Massively parallel algorithms distributed algorithms • Human-centered computing → Visualization toolkits Scientific visualization

来源：评论

学校读者我要写书评

暂无评论

distributed Algorithm on the Layout Planning of New Energy Vehicle Charging Post 3

Distributed Algorithm on the Layout Planning of New Energy V...

引用

3rd IEEE International Conference on Mobile Networks and Wireless Communications, ICMNWC 2023

作者： Jia, Taihua College of Mechanical and Electrical Engineering Guangdong University of Science and Technology Dongguan China

ISBN: (纸本)9798350317022

Traditional digital mining algorithms face difficulties in the face of large-scale charging demand and limited charging pile resources, so new methods are needed to optimize the arrangement of charging post. Aiming at the layout planning of charging post for new energy vehicles, this paper proposes a solution based on distributed algorithm. Based on distributed algorithm, the layout planning scheme of charging post for new energy vehicles can realize the reasonable arrangement of charging post, improve the quality of charging services, and optimize the utilization efficiency of charging pile resources under the premise of considering charging needs and resource constraints. Through the analysis of experimental and simulation results, the scheme shows good performance in charge coverage and service quality, and has high practicability and feasibility. The research results of this paper provide a new solution for the layout and planning of charging post for new energy vehicles, especially in the case of large-scale charging demand and resource constraints. © 2023 IEEE.

关键词： Charging Post Charging Service Quality distributed algorithms Layout Planning New Energy Vehicles

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for k-truss decomposition

Distributed algorithms for k-truss decomposition

引用

IEEE International Conference on Big Data

作者： Pei-Ling Chen Chung-Kuang Chou Ming-Syan Chen Department of Electrical Engineering National Taiwan University Taipei Taiwan Research Center of Information Technology Innovation Academia Sinica Taipei Taiwan

ISBN: (纸本)9781479956678

k-truss, a type of cohesive subgraphs of a network, is an important measure for a social network graph. However, with the emergence of large online social networks, the running time of the traditional batch algorithms for k-truss decomposition is usually prohibitively long on such a graph with billions of edges and millions of vertices. Moreover, the size of a graph becomes too large to load into the main memory of a single machine. Currently, cloud computing has become an imperative way to process the big data. Thus, our aim is to design a scalable algorithm of k-truss decomposition in the scenario of cloud computing. In this paper, we first improve the existing distributed k-truss decomposition in the MapReduce framework. We then propose a theoretical basis for k-truss and use it to design an algorithm based on graph-parallel abstractions. Our experiment results show that our method in the graph-parallel abstraction significantly outperforms the methods based on MapReduce in terms of running time and disk usage.

关键词： Algorithm design and analysis Computational modeling distributed algorithms Social network services Cloud computing Google Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Signal Processing Architecture for a Trustworthy 77-GHz MIMO Radar

IEEE TRANSACTIONS ON RADAR SYSTEMS

引用

IEEE TRANSACTIONS ON RADAR SYSTEMS 2024年 2卷 1112-1122页

作者： Kishore Arumugam, Ram Froehly, Andre Wallrath, Patrick Herschel, Reinhold Pohl, Nils Fraunhofer Inst High Frequency Phys & Radar Tech Dept Signal Proc & Algorithms D-53343 Wachtberg Germany Ruhr Univ Bochum Inst Integrated Syst D-44801 Bochum Germany Wavesense Dresden GmbH D-01069 Dresden Germany Ruhr Univ Bochum Inst Integrated Syst D-44801 Bochum Germany

Radar systems are used in safety-critical applications in vehicles, so it is necessary to ensure their functioning is reliable and trustworthy. System-on-chip (SoC) radars, which are commonly used now-a-days, are inherently vulnerable to data manipulation and attacks to gain intellectual property (IP) of the system. This article outlines the vulnerabilities of the SoC radars and proposes a distributed signal processing to improve the resilience of the system. The trustworthiness of the system is improved by partitioning the signal processing into smaller modules. We propose to implement these modules on separate processors such that it is made up of multiple application-specific integrated circuits (ASICs). Furthermore, a sparse antenna topology is proposed to limit the information stored in these modules. Therefore, it is difficult to execute a successful attack or gain any knowledge of the targets or system design based on the compromised data in one ASIC. This article introduces the generic structure for partitioning the signal processing steps involved in target detection and the sparse array topology used by the 77-GHz radar. A method for estimating the azimuth and elevation angles for the considered sparse array is also introduced.

关键词： Radar Radar signal processing Signal processing Chiplets Trojan horses Automotive engineering Topology Fast Fourier transforms Estimation Arrays Autonomous vehicles compressed sensing direction-of-arrival estimation distributed algorithms matching pursuit algorithms millimetre-wave radar radar detection radar signal processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：