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

Finite-Time consensus-Based Clock Synchronization Under Deception Attacks

IEEE ACCESS 2020年 8卷 110748-110758页

作者： Wu, Yiming He, Xiongxiong Hangzhou Dianzi Univ Sch Cyberspace Hangzhou 310018 Peoples R China Zhejiang Univ Technol Coll Informat Engn Hangzhou 310023 Peoples R China

This paper concentrates on the finite-time clock synchronization problem for wireless sensor networks (WSNs) under deception attacks. Compared with adding additional communication links to a network, we introduce a new mechanism termed as "trusted link" to improve the resilience of the network, and show that with small changes (set a fraction of links as the trusted links) in the network structure the network robustness for deception attacks can be improved significantly. Then, an iterative learning control based consensus control methodology with built-in attack mitigation mechanism is proposed. Not only the security and robustness are guaranteed by the proposed controller, but also the convergence time is fixed, which makes the synchronization algorithm more suitable for practical WSNs. Finally, simulation results are provided to demonstrate the effectiveness of the theoretical results.

关键词： Synchronization Wireless sensor networks Robustness Protocols consensus algorithm Security Convergence Wireless sensor networks consensus robustness finite-time clock synchronization

来源：评论

学校读者我要写书评

暂无评论

Fast algorithm for sparse least trimmed squares via trimmed-regularized reformulation

arXiv

引用

arXiv 2024年

作者： Yagishita, Shotaro The Institute of Statistical Mathematics Japan

The least trimmed squares (LTS) is a reasonable formulation of robust regression whereas it suffers from high computational cost due to the nonconvexity and nonsmoothness of its objective function. The most frequently used FAST-LTS algorithm is particularly slow when a sparsity-inducing penalty such as the 1 norm is added. This paper proposes a computationally inexpensive algorithm for the sparse LTS, which is based on the proximal gradient method with a reformulation technique. Proposed method is equipped with theoretical convergence preferred over existing methods. Numerical experiments show that our method efficiently yields small objective value. Copyright © 2024, The Authors. All rights reserved.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Sample-Efficient Agnostic Boosting

arXiv

引用

arXiv 2024年

作者： Ghai, Udaya Singh, Karan Amazon United States Tepper School of Business Carnegie Mellon University United States

The theory of boosting provides a computational framework for aggregating approximate weak learning algorithms, which perform marginally better than a random predictor, into an accurate strong learner. In the realizable case, the success of the boosting approach is underscored by a remarkable fact that the resultant sample complexity matches that of a computationally demanding alternative, namely Empirical Risk Minimization (ERM). This in particular implies that the realizable boosting methodology has the potential to offer computational relief without compromising on sample efficiency. Despite recent progress, in agnostic boosting, where assumptions on the conditional distribution of labels given feature descriptions are absent, ERM outstrips the agnostic boosting methodology in being quadratically more sample efficient than all known agnostic boosting algorithms. In this paper, we make progress on closing this gap, and give a substantially more sample efficient agnostic boosting algorithm than those known, without compromising on the computational (or oracle) complexity. A key feature of our algorithm is that it leverages the ability to reuse samples across multiple rounds of boosting, while guaranteeing a generalization error strictly better than those obtained by blackbox applications of uniform convergence arguments. We also apply our approach to other previously studied learning problems, including boosting for reinforcement learning, and demonstrate improved results. © 2024, CC BY-NC-ND.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Influence of the automorphism group of a graph on its PageRank scores of vertices

引用

Advances in Applied Mathematics 2025年 168卷

作者： Wong, Dein Zhou, Qi Wang, Xinlei School of Mathematics China University of Mining and Technology Xuzhou China School of Mathematics Sciences Anhui University Hefei China School of Mathematics and Big Data Anhui University of Science & Technology Huainan China

Google's success derives in large part from its PageRank algorithm, which assign a score to every web page according to its importance. Recently, G. Modjtaba et al. (2021) [19] proved that similar vertices in a graph have the same PageRank score and they proposed a conjecture, suspecting that two graphs are completely non-Co-PR if they are non-Co-PR graphs. The investigation of this paper mainly concerns the influence of the automorphism group of a graph on its PageRank scores of vertices. The main results of this article are as follows. 1. Based on matrix analysis, two conditions on what kinds of vertices have the same PageRank score are obtained. 2. Four techniques for constructing Co-PR graphs are established. 3. A non-regular connected graph of order n, with [Formula presented] as PR scores of most of its vertices, is constructed, which provides a negative answer to Modjtaba's conjecture above. © 2025 Elsevier Inc.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Effective Formation Tracking of Quadrotors with Intelligent Disturbance Observer-Based Control

引用

IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY-TRANSACTIONS OF ELECTRICAL ENGINEERING 2021年第3期45卷 761-776页

作者： Mat Lazim, Izzuddin Husain, Abdul Rashid Mohamed, Zaharuddin Mohd Basri, Mohd Ariffanan Mohd Subha, Nurul Adilla Ramli, Liyana Univ Sains Islam Malaysia Fac Engn & Built Environm Dept Elect & Elect Engn Nilai 71800 N Sembilan Malaysia Univ Teknol Malaysia Fac Engn Sch Elect Engn Johor Baharu 81310 Johor Malaysia

This study addresses the design and analysis of distributed formation tracking control with disturbance rejection capability for a group of quadrotors that are perturbed by time-varying external disturbances. The proposed approach consists of two control loops: inner-loop and outer-loop control. In the inner-loop control, feedback linearization (FL) of the quadrotor system in the presence of disturbance yields linear equations with unknown disturbance parts. The unknown disturbance parts are estimated in the outer-loop control by using a disturbance observer (DO). Since the DO produces an estimation error or called residual error when estimating time-varying disturbance, this study introduces a radial basis function neural network (RBFNN) with adaptive weight to effectively approximate and eliminate the residual error. Then, to complete the formation mission, a consensus-based algorithm is implemented in the outer-loop control to enable the distributed formation tracking. The capabilities of formation tracking and online approximating are proved via the Lyapunov approach. Simulation of the quadrotor formation in the presence of time-varying wind disturbance was conducted to evaluate the effectiveness of the approach where the results obtained illustrate the robustness of the quadrotor formation towards the disturbances.

关键词： Formation control Neural network consensus algorithm Multi-agent Disturbance observer

来源：评论

学校读者我要写书评

暂无评论

A Survey on Emerging Blockchain Technology Platforms for Securing the Internet of Things

引用

FUTURE INTERNET 2024年第8期16卷 285页

作者： Kareem, Yunus Djenouri, Djamel Ghadafi, Essam Univ West England Dept Comp Sci & Creat Technol Bristol BS16 1QY England Newcastle Univ Sch Comp Newcastle Upon Tyne NE1 7RU England

The adoption of blockchain platforms to bolster the security of Internet of Things (IoT) systems has attracted significant attention in recent years. Currently, there is a lack of comprehensive and systematic survey papers in the literature addressing these platforms. This paper discusses six of the most popular emerging blockchain platforms adopted by IoT systems and analyses their usage in state-of-the-art works to solve security problems. The platform was compared in terms of security features and other requirements. Findings from the study reveal that most blockchain components contribute directly or indirectly to IoT security. Blockchain platform components such as cryptography, consensus mechanism, and hashing are common ways that security is achieved in all blockchain platform for IoT. Technologies like Interplanetary File System (IPFS) and Transport Layer Security (TLS) can further enhance data and communication security when used alongside blockchain. To enhance the applicability of blockchain in resource-constrained IoT environments, future research should focus on refining cryptographic algorithms and consensus mechanisms to optimise performance and security.

关键词： blockchain Internet of Things (IoT) cryptography consensus algorithm ethereum algorand IoTeX IoTA multichain

来源：评论

学校读者我要写书评

暂无评论

Analysis of Students’ Ideological Education Content Identification Based on Intelligent algorithm Empowerment

引用

International Journal of High Speed Electronics and Systems 2024年第0期

作者： Zhou, Dandan The Department of Education Guangxi Normal University Guilin 541004 P. R. China

Intelligent algorithm recommendation technology, which is starting a new era of information dissemination, gradually diffuses in the network, constructing social thoughts, behaviors and values. In the era of intelligent algorithm recommendation, algorithm recommendation is based on the accurate "portrait" of users, which realizes the accurate distribution of users’ information needs. This technology also makes ideological and theoretical courses in colleges and universities face many opportunities and challenges. On one hand, intelligent algorithms promote the accuracy of education and teaching;On the other hand, it has a strong impact on the teaching of ideological and theoretical courses. Personalized recommendation system based on intelligent algorithm empowerment came into being. This paper analyzes the influence of intelligent algorithm empowerment on boosting students’ ideological education content identification, and constructs a model of boosting students’ ideological education content identification based on intelligent algorithm empowerment. The experimental results show that the intelligent algorithm has a high accuracy rate of 90.5% and a recall rate of 91.2%. © World Scientific Publishing Company.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

SharpEdge: A QoS-driven task scheduling scheme with blockchain in mobile edge computing

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2024年第19期36卷 e8161-e8161页

作者： Gu, Ji Liu, Yushi Xu, Xiaolong Nanjing Univ Informat Sci & Technol Sch Software Nanjing 210044 Peoples R China Beijing Inst Technol Sch Mech Engn Beijing Peoples R China Nanjing Univ Informat Sci & Technol Jiangsu Collaborat Innovat Ctr Atmospher Environm Dept Jiangsu Collaborat Innovat Nanjing Peoples R China

Mobile edge computing (MEC) promotes the development and popularity of Internet of Things (IoT) devices with higher connectivity and ultra-low latency through network topology optimization and real-time data analysis. With the exponential growth of data traffic generated by IoT devices, it is essential to prevent edge servers (ESs) from overloading through efficient task scheduling to ensure the quality of service (QoS). However, the lack of trust and incentive mechanisms between ESs deployed and managed by different infrastructure providers makes it challenging to perform peer-offloaded tasks. Moreover, to meet the low-latency requirement of many IoT applications, the execution efficiency of the task scheduling scheme in MEC needs to be improved. To address the above challenges systematically, a QoS-driven task scheduling scheme with blockchain in MEC named SharpEdge is proposed. In SharpEdge, ESs publish tasks with rewards and then select the most reliable executors through a historical performance-based reputation mechanism to perform peer offloading. The performance of the executor will be recorded into the blockchain after the task is completed. In addition, a concurrent consensus mechanism using sharding technology is designed, improving task scheduling efficiency. We implement SharpEdge based on Hyperledger Fabric and verify its performance in a simulated MEC environment.

关键词： blockchain consensus algorithm mobile edge computing reputation mechanism

来源：评论

学校读者我要写书评

暂无评论

ON A CONJECTURE OF ERDŐS AND GRAHAM ABOUT THE SYLVESTER’S SEQUENCE

arXiv

引用

arXiv 2025年

作者： Li, Zheng Tang, Quanyu School of Mathematics and Statistics Xi’an Jiaotong University Xi’an710049 China

Let {un}∞n=1 be the Sylvester’s sequence (sequence A000058 in the OEIS), and let a1 ∞i=1 a1i = 1. In this paper, we solve a conjecture of Erdős and Graham, which asks whether (formula presented) We prove this conjecture using a constructive approach. Furthermore, assuming that the unproven claim of Erdős and Graham that "all rationals have eventually greedy best Egyptian underapproximations" holds, we establish a generalization of this conjecture using a nonconstructive *** Codes Primary 11D68, Secondary 11D75, 11P99 Copyright © 2025, The Authors. All rights reserved.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

AI Meets Blockchain: A Secure Privacy Preserved Framework for IoT Devices Using Blockchain

AI Meets Blockchain: A Secure Privacy Preserved Framework fo...

引用

Artificial Intelligence, Applications, Innovation and Ethics (AI2E), International Conference for

作者： Muhammad Kashif Sohail Sarwar Muhammad Safyan College of Advance and Computing Technology National University of Science and Technology Muscat Oman Department of Computer Science Bahria University Islamabad Pakistan Department of Computer Science Government College University Lahore Pakistan

ISBN: (数字)9798331513733

ISBN: (纸本)9798331513740

The recent integration of blockchain technology with the Internet of Things (IoT) has created a new platform for secure and decentralized communication among IoT devices. However, this integration has raised concerns about privacy preservation due to the inherent transparency and immutability of the blockchain. To address these challenges, our paper presents a comprehensive framework for privacy preservation in IoT-based blockchain systems. We propose a privacy-preserving blockchain-based framework that classifies transactions as public or private at the IoT level, using a combination of low-computation cryptographic techniques and a low-complexity consensus protocol to ensure data confidentiality and privacy. Additionally, we integrate an anomaly-based intrusion detection system (IDS) to monitor and address threats in real time, making IoT networks resilient against evolving cyber threats. We evaluated our proposed system model through comprehensive simulations and experiments, demonstrating the practicality and effectiveness of our approach in real-world IoT scenarios. Our findings show that our proposed protocol can comprehensively safeguard the privacy of IoT data while maintaining the security and transparency inherent in blockchain-based systems. This private-by-design model provides a real-world solution to privacy concerns in IoT-based blockchain systems, contributing to the development of secure, decentralized IoT communication.

关键词： Privacy Data privacy Smart contracts Intrusion detection Authentication consensus algorithm Proof of Work consensus protocol Internet of Things Monitoring

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：