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

12th IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)

作者： Sanlioz, Gani Kara, Mustafa Aydin, Muhammed Ali Istanbul Univ Cerrahpasa Dept Comp Engn Istanbul Turkiye Natl Def Univ Air Force Acad Dept Comp Engn Istanbul Turkiye

ISBN: (纸本)9798350351866;9798350351859

The impact of virtual collaborations and digital transformation has led to a significant increase in the use of VoIP technologies. VoIP, which works on a hierarchical client-server architecture in order to adapt to the old circuit-switched technology, has gradually started to use a P2P architecture over time in parallel with the developments in this architecture. The lack of " peer admission" and "control in call flow" features in pure P2P architecture has resulted in vulnerabilities against some attacks, such as modifying, termination, eavesdropping, and SPIT. Although various studies have been conducted to mitigate these vulnerabilities in P2P systems on other platforms, the literature on P2P VoIP is limited. Studies using distributed blockchains were limited to authentication and could not eliminate the system's centralization by keeping SIP servers in their architecture. In this study, we proposed a P2P VoIP system and assessed the feasibility of managing user data via distributed blockchain technology. Our findings reveals that this approach can enhance security and decentralization in P2P VoIP. Furthermore, a thorough performance and security evaluation is conducted on the blockchain type, consensus algorithm, and several blockchain architectures that will be used to manage this data, offering a promising outlook for the future of P2P VoIP.

关键词： VoIP P2P Communication Blockchain consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Distributed Multi-Task Assignment for Multi-Agent Systems 24

Distributed Multi-Task Assignment for Multi-Agent Systems

引用

24th International Conference on Control, Automation and Systems

作者： Takamizawa, Soya Namerikawa, Toru Tsuge, Shunsuke Keio Univ Grad Sch Sci & Technol Yokohama Kanagawa 2238522 Japan Kawasaki Heavy Ind Co Ltd AI & Flight Control Engn Sect Kakamigahara Gifu 5048710 Japan

ISBN: (纸本)9798331517939;9788993215380

In this research, we solve the task assignment problem of multiple agents to multiple tasks in a multi-agent system. Regarding the problem of one agent versus multiple tasks, we use the concept of "grouping," in which each agent seeks a set of tasks that it can handle at once. On the other hand, for the problem of multiple agents versus one task, we use the concept of the "Timetable" with the goal of synchronizing the start time of each agent's task. By combining the two concepts, it is possible to deal with complex assignment problems, such as each agent executing multiple tasks at the same time, or multiple agents executing one task at the same time. Furthermore, we show that this solution can respond if circumstances changes, such as when the number of agents decreases or the number of tasks increases.

关键词： Task Assignment Multi-agent System consensus algorithm Grouping

来源：评论

学校读者我要写书评

暂无评论

In-Flight Testing Verification of an Adaptive Distributed Fault-Tolerant Control Architecture

In-Flight Testing Verification of an Adaptive Distributed Fa...

引用

AIAA SciTech Forum

作者： Budihartono, Michael Moncayo, Hever Embry Riddle Aeronaut Univ Dept Aerosp Engn 1 Aerosp Blvd Daytona Beach FL 32114 USA Embry Riddle Aeronaut Univ Aerosp Engn 1 Aerosp Blvd Daytona Beach FL 32114 USA

ISBN: (数字)9781624107115

ISBN: (纸本)9781624107115

Multi-agent systems are vulnerable to cyber-attacks, environmental disturbances, and hardware failures. A robust distributed control architecture is required to ensure that these systems can perform their mission successfully and minimize the detrimental impacts of previously stated conditions. This paper proposes a control algorithm comprising a bio-inspired adaptive consensus algorithm and a bio-inspired machine learning-based health management system. The adaptive consensus algorithm is implemented on a multi-agent system consisting of four Crazyflie quadcopters. Flight test data are used to train the health management system and then tested with both nominal and faulty flight test data. Results presented in this paper show that the adaptive distributed algorithm can drive the agents to a consensus, minimize the effects of disturbances, and accurately differentiate nominal and faulty conditions.

关键词： Flight Testing consensus algorithm Support Vector Machine Multi Agent System Quadcopter Flight Data Artificial Immune System Closed Loop System Yaw Fault Detection Techniques

来源：评论

学校读者我要写书评

暂无评论

Resilient Average consensus of Second-Order Multi-Agent Systems

Resilient Average Consensus of Second-Order Multi-Agent Syst...

引用

American Control Conference (ACC)

作者： Zheng, Wenzhe Fang, Chongrong He, Jianping Peng, Yunfeng Shanghai Jiao Tong Univ Dept Automat Key Lab Syst Control & Informat Proc Minist Educ China Shanghai 200240 Peoples R China Shanghai Engn Res Ctr Intelligent Control & Manag Shanghai 200240 Peoples R China

ISBN: (数字)9781665451963

ISBN: (纸本)9781665451963

In this paper, we study the problem of resilient average consensus for second-order multi-agent systems with misbehaving agents. General types of misbehaviors are considered, including false data injection attacks and accidental faults. The difficulties of this problem are to detect errors in a distributed way and accurately compensate two-dimension state errors by one-dimension acceleration input. We first provide sufficient conditions for second-order average consensus. Then, we design detection methods via two-hop communication information and propose schemes to compensate errors accurately in a distributed way inspired by sufficient conditions. Hence, we propose a finite input-errors detection-compensation-based consensus algorithm (FIDC). Considering infinite attacks on input, velocity and position, an extension named IADC is proposed with a fault-tolerance mechanism. We prove that the proposed algorithms allow agents to asymptotically achieve second-order average consensus. Finally, extensive simulations are conducted to verify the effectiveness of the algorithms.

关键词： Sufficient conditions Fault tolerance Design methodology Fault tolerant systems consensus algorithm Multi-agent systems Convergence

来源：评论

学校读者我要写书评

暂无评论

Application of blockchain technology in copyright protection of digital music information

引用

INTERNATIONAL JOURNAL OF GRID AND UTILITY COMPUTING 2023年第2-3期14卷 136-145页

作者： Wen, Xinglin Yanan Univ Luxun Sch Arts Yanan Shaanxi Peoples R China

Currently, a large amount of information is stored in digital form. There have been many information security problems, leading to the emergence of a large number of pirated digital products. Although there have been many protection measures for digital information copyright, the research content on copyright protection for digital music information is still very little. Aiming at the problems of low data storage security, long confirmation period and vulnerability to attacks in the confirmation system of digital music copyright, combined with Blockchain Technology (BT), a scheme for credible confirmation of digital music copyright is proposed. The experimental results reveal that the DPBFT algorithm can accommodate up to two faulty nodes, which has a higher fault tolerance rate than the traditional PBFT algorithm. The average throughput can reach 1249, which can meet the needs of the music copyright management system and has practical application value.

关键词： blockchain technology digital music copyright protection consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

One-third Hybrid algorithm for Numerical solution of First-order Models Problems with Initial Condition

One-third Hybrid Algorithm for Numerical solution of First-o...

引用

2024 International Conference on Science, Engineering and Business for Driving Sustainable Development Goals, SEB4SDG 2024

作者： Omole, Ezekiel Olaoluwa Kehinde Uwaifor, John Oboni, Atabo Victor Obarhua, Friday O. Ajewole, Kehinde Peter Onu, Peter Folaranmi, Rotimi Oluwafemi Oluwayemi, Mathew O. Amoyedo, Femi Emmanuel Idowu Olaleru, Grace Landmark University Mathematics Programme Department of Physical Sciences Omu-Aran Nigeria University of Abuja Department of Mathematics Abuja Nigeria Confluence University of Science and Technology Department of Mathematics and Statistic Kogi State Osara Nigeria Federal University of Technology Department of Mathematical Sciences Akure Nigeria Landmark University Mathematics Programme Department of Physical Sciences Kwara State Omu-Aran Nigeria Omu-Aran Nigeria ThomasAdewumi University Department of Mathematical and Computing Scineces Kwara State Oko Nigeria Margaret Lawrence University Department of Mathematics and Statistics Galilee Delta State Nigeria Landmark University Department of Electrical and Information Engineering Kwara State Omuaran Nigeria

ISBN: (纸本)9798350358155

The collocation and interpolation technique on the power series approximate solution was used to develop a new continuous implicit hybrid one-third step method capable of solving first-order stiff initial value problems. This method has the advantage of allowing for easy step length changes and function evaluation at off-step points. The block method used to implement the main method ensures that each discrete method resulting from the block's simultaneous solution has the same order of accuracy as the main method. The method provides large intervals of absolute stability;it is consistent, zero stable, and thus converges. Sample examples of linear and nonlinear stiff problems were used to evaluate the method's performance. When compared to other existing methods, our developed method has been shown to be more accurate. © 2024 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A distributed convergecast algorithm for dynamic mobile networks 30

A distributed convergecast algorithm for dynamic mobile netw...

引用

30th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2024

作者： Agon-Rambosson, Aymeric Lejeune, Jonathan Sopena, Julien Sens, Pierre Sorbonne Université Cnrs LIP6 Delys ParisF-75005 France

ISBN: (纸本)9798331515966

Some applications, like round-based consensus algorithms, require all the nodes from a system to send a message to the same node (the leader) at the same time. In a Mobile Ad-Hoc Network (MANET), this situation is likely to cause collisions and the loss of the messages converging to the leader. The loss of messages is critical in such a situation, since the leader needs to receive a quorum of messages to make a decision. This pattern of communications, called convergecast, can be trivially implemented with a unicast primitive. However, we show that a popular MANET unicast algorithm like Optimized Link State Routing (OLSR) loses a lot of messages, even in the presence of MAC-level collision avoidance mechanisms like CSMA/CA. We propose a new convergecast algorithm that locally schedules answers to a query in a fully distributed manner, in order to avoid their colliding with each other, and that aggregates these answers in order to further decrease the probability of collisions. We show that our algorithm creates far fewer collisions and retries than OLSR, allowing applications like consensus algorithms to reach their quorum sooner. © 2024 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Distributed fuzzy adaptive consensus for high-order multi-agent systems with an imprecise communication topology structure

引用

FUZZY SETS AND SYSTEMS 2021年 402卷 1-15页

作者： Chen, Jiaxi Li, Junmin Yuan, Xinxin Xidian Univ Sch Math & Stat Xian 710126 Peoples R China

In this study, we consider the consensus problem for a high-order multi-agent systems (MASs) with an imprecise communica-tion topology structure described by the Takagi-Sugeno fuzzy model. A distributed adaptive control protocol is proposed for the consensus problem comprising MASs with unknown parameters and input disturbances. The proposed protocol can guarantee that the consensus errors asymptotically approach zero under the conditions that the communication topology is fuzzy union connected and the dynamics of the leader are unknown to any agent among the followers. Furthermore, the proposed algorithm is extended to solve the formation control problem for MASs. Sufficient conditions are provided for the consensus and formation problems for MASs based on Lyapunov stability theory. Finally, three simulation examples are presented to illustrate the effectiveness of the proposed control protocol. (C) 2020 Elsevier B.V. All rights reserved.

关键词： Adaptive control consensus algorithm Formation control Imprecise communication topology Multi-agent system Takagi-Sugeno fuzzy model

来源：评论

学校读者我要写书评

暂无评论

Online bipartite matching with imperfect advice 41

Online bipartite matching with imperfect advice

引用

41st International Conference on Machine Learning (ICML)

作者： Choo, Davin Gouleakis, Themis Ling, Chun Kai Bhattacharyya, Arnab Natl Univ Singapore Sch Comp Singapore Singapore Columbia Univ Ind Engn & Operat Res New York NY USA

We study the problem of online unweighted bipartite matching with n offline vertices and n online vertices where one wishes to be competitive against the optimal offline algorithm. While the classic RANKING algorithm of (Karp et al., 1990) provably attains competitive ratio of 1 - 1/e > 1/2, we show that no learning-augmented method can be both 1-consistent and strictly better than 1/2-robust under the adversarial arrival model. Meanwhile, under the random arrival model, we show how one can utilize methods from distribution testing to design an algorithm that takes in external advice about the online vertices and provably achieves competitive ratio interpolating between any ratio attainable by advice-free methods and the optimal ratio of 1, depending on the advice quality.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Complexity Aspects of the Extension of Wagner's Hierarchy to k-Partitions 14

Complexity Aspects of the Extension of Wagner's Hierarchy to...

引用

14th International Workshop on Non-Classical Models of Automata and Applications (NCMA)

作者： Podolskii, Vladimir Selivanov, Victor Tufts Univ Medford MA 02155 USA St Petersburg Univ Dept Math & Comp Sci St Petersburg Russia AP Erhov Inst Informat Syst Novosibirsk Russia

It is known that the Wadge reducibility of regular co-languages is efficiently decidable (Krishnan et al., 1995), (Wilke, Yoo, 1995). In this paper we study analogous problem for regular k-partitions of co-languages. In the series of previous papers (Selivanov, 2011), (Alaev, Selivanov, 2021), (Selivanov, 2012) there was a partial progress towards obtaining an efficient algorithm for deciding the Wadge reducibility in this setting as well. In this paper we finalize this line of research providing a quadratic algorithm (in RAM model). For this we construct a quadratic algorithm to decide a preorder relation on iterated posets. Additionally, we discuss the size of the representation of regular co-languages and suggest a more compact way to represent them. The algorithm we provide is efficient for the more compact representation as well.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：