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

4th International Conference on Data, Engineering, and Applications, IDEA 2022

作者： Bhonsle, Tushar Maheshwari, Manish Research Scholars MCNUJC University Bhopal India

ISBN: (纸本)9789819724505

Data mining is a popular and promising field. Therefore, in view of the importance of data mining, nowadays many types of research work are being done on data mining. Among the many popular techniques of data mining, one of the important and popular techniques is Association Rule Mining. There are many types of research work going on continuously in the field of association rule mining and for this many types of algorithms are used. Some of these important algorithms are the Apriori algorithm, ECLAT algorithm, and FP-Growth algorithm. An attempt has been made to understand the workings of the Apriori algorithm, ECLAT algorithm, and FP-Growth algorithm by continuous study. This attempt is to understand the capabilities and limitations of the Apriori algorithm, ECLAT algorithm, and FP-Growth algorithm through the study. To minimize their drawbacks and to give a new direction to research, a new algorithm is proposed. The proposed algorithm works on a new type of technology. This new technology is based on the principles of Geometric Progression and works accordingly which may prove to be more suitable for Association Rule Mining. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Structural Parameters for Dense Temporal Graphs 49

Structural Parameters for Dense Temporal Graphs

引用

49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024

作者： Enright, Jessica Hand, Samuel D. Larios-Jones, Laura Meeks, Kitty School of Computing Science University of Glasgow United Kingdom

ISBN: (纸本)9783959773355

Temporal graphs provide a useful model for many real-world networks. Unfortunately, the majority of algorithmic problems we might consider on such graphs are intractable. There has been recent progress in defining structural parameters which describe tractable cases by simultaneously restricting the underlying structure and the times at which edges appear in the graph. These all rely on the temporal graph being sparse in some sense. We introduce temporal analogues of three increasingly restrictive static graph parameters – cliquewidth, modular-width and neighbourhood diversity – which take small values for highly structured temporal graphs, even if a large number of edges are active at each timestep. The computational problems solvable efficiently when the temporal cliquewidth of the input graph is bounded form a subset of those solvable efficiently when the temporal modular-width is bounded, which is in turn a subset of problems efficiently solvable when the temporal neighbourhood diversity is bounded. By considering specific temporal graph problems, we demonstrate that (up to standard complexity theoretic assumptions) these inclusions are strict. © Jessica Enright, Samuel D. Hand, Laura Larios-Jones, and Kitty Meeks.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Multi-agent consensus for distributed power dispatch with load balancing

引用

ASIAN JOURNAL OF CONTROL 2021年第2期23卷 611-619页

作者： Hanada, Kenta Wada, Takayuki Masubuchi, Izumi Asai, Toru Fujisaki, Yasumasa Osaka Univ Grad Sch Informat Sci & Technol 1-5 Yamadaoka Suita Osaka 5650871 Japan Kobe Univ Grad Sch Syst Informat Nada Ku 1-1 Rokkodai Kobe Hyogo 6578501 Japan Nagoya Univ Grad Sch Engn Chikusa Ku Nagoya Aichi 4648603 Japan

A weighted averaging consensus algorithm over a noisy network is considered for a distributed power dispatch with load balancing. The availability of the communication among dispatching agents is represented as a network that is assumed to be a directed, balanced, and a weakly connected graph with no self loop. A simple representation of the consensus algorithm is given by using its graph Laplacian. The convergence analysis of the algorithm reveals an explicit relation between the number of iterations and the closeness of the agreement in terms of the characteristic values of the graph Laplacian, which gives a stopping rule for the consensus algorithms.

关键词： consensus algorithm distributed algorithm load balancing multi‐ agent system power dispatch

来源：评论

学校读者我要写书评

暂无评论

Blockchain consensus Mechanisms: A Bibliometric Analysis (2014-2024) Using VOSviewer and R Bibliometrix

引用

INFORMATION 2024年第10期15卷 644-644页

作者： Ahn, Joongho Yi, Eojin Kim, Moonsoo aSSIST Univ Seoul Business Sch Seoul 03767 South Korea Natl Assembly Republ Korea Seoul 07233 South Korea CEO Business Sch Seoul 04520 South Korea

Blockchain consensus mechanisms play a critical role in ensuring the security, decentralization, and integrity of distributed networks. As blockchain technology expands beyond cryptocurrencies into broader applications such as supply chain management and healthcare, the importance of efficient and scalable consensus algorithms has grown significantly. This study provides a comprehensive bibliometric analysis of blockchain and consensus mechanism research from 2014 to 2024, using tools such as VOSviewer and R's Bibliometrix package. The analysis traces the evolution from foundational mechanisms like Proof of ork (PoW) to more advanced models such as Proof of Stake (PoS) and Byzantine Fault Tolerance (BFT), with particular emphasis on Ethereum's "The Merge" in 2022, which marked the historic shift from PoW to PoS. Key findings highlight emerging themes, including scalability, security, and the integration of blockchain with state-of-the-art technologies like artificial intelligence (AI), the Internet of Things (IoT), and energy trading. The study also identifies influential authors, institutions, and countries, emphasizing the collaborative and interdisciplinary nature of blockchain research. Through thematic analysis, this review uncovers the challenges and opportunities in decentralized systems, underscoring the need for continued innovation in consensus mechanisms to address efficiency, sustainability, scalability, and privacy concerns. These insights offer a valuable foundation for future research aimed at advancing blockchain technology across various industries.

关键词： blockchain artificial intelligence AI Ethereum consensus algorithm bibliometrics

来源：评论

学校读者我要写书评

暂无评论

Amaurotic-Entity-Based consensus Selection in Blockchain-Enabled Industrial IoT

引用

IEEE INTERNET OF THINGS JOURNAL 2021年第14期9卷 11648-11655页

作者： Tapwal, Riya Deb, Pallav Kumar Misra, Sudip Pal, Surjya Kanta Indian Inst Technol Kharagpur Dept Comp Sci & Engn Kharagpur 721302 W Bengal India Indian Inst Technol Kharagpur Ctr Excellence Adv Mfg Technol Kharagpur 721302 W Bengal India

In this article, we propose a dynamic-consensus-based blockchain system-A-Blocks-for efficiently managing the data produced by the sensors in an Industrial Internet of Things (IIoT) environment. Typically, industries deal with a heterogeneous set of data from a diverse range of sensors. Conventional blockchain adoptions are a popular choice in such scenarios for data security while satisfying both transparency and immutability. However, stringent consensus algorithms are inadequate for managing heterogeneous data, especially due to its implicit constraints. For instance, while PoW provides inevitable security and is highly distributive, it is not scalable and requires more energy. In contrast, PoS is energy efficient but has reduced scalability and PBFT is suitable for faster processing. A-Blocks exploits the features of the available consensus algorithms and dynamically selects the best one in real time. It operates in two phases: 1) categorizing the data into groups based on their traits and then 2) selecting the appropriate consensus algorithm. Extensive experimental results using open industrial data sets demonstrate the effectiveness of A-Blocks with 8% CPU and 78% memory consumptions on resource-constrained devices. Furthermore, compared to the existing methods, although A-Blocks increases energy consumption by 11%, it also reduces mining time by 7%.

关键词： Blockchains consensus algorithm Industrial Internet of Things Sensors Security Scalability Middleware Agglomerative clustering blockchain consensus algorithms Industrial Internet of Things (IIoT)

来源：评论

学校读者我要写书评

暂无评论

consensus of High-Order Multi-Agent Systems with Binary-Valued Communications and Switching Topologies

引用

IEEE Transactions on Control of Network Systems 2024年

作者： An, Ru Wang, Ying Zhao, Yanlong Zhang, Ji-Feng Chinese Academy of Sciences Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing100190 China KTH Royal Institute of Technology Division of Decision and Control Systems Stockholm Sweden Zhongyuan University of Technology School of Automation and Electrical Engineering Henan Province Zhengzhou450007 China

This paper studies the consensus problem of high-order multi-agent systems (MASs) with binary-valued communications and switching topologies. To tackle the challenge of unknown states caused by binary-valued communications, this paper constructs an estimation-based consensus algorithm. First, a recursive projection identification algorithm is presented to estimate the neighbors' states dynamically. Then, based on these estimates, a consensus law is designed. By constructing and analyzing two combined Lyapunov functions about estimation error and state error, this paper establishes their relation, to overcome the difficulty resulting from the coupling of the estimation and control and less information due to switching topologies. Under the condition of jointly connected topologies, it is proven that by properly selecting the step coefficient, the estimates of states can converge to the true states with a convergence rate as the reciprocal of the recursion times. Besides, the MAS is proved to achieve weak consensus and the consensus rate is also established as the reciprocal of the recursion times. Finally, a simulation example is given to validate the algorithm. © 2024 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A Trust-Centric Privacy-Preserving Blockchain for Dynamic Spectrum Management in IoT Networks

引用

IEEE INTERNET OF THINGS JOURNAL 2022年第15期9卷 13263-13278页

作者： Ye, Jingwei Kang, Xin Liang, Ying-Chang Sun, Sumei Univ Elect Sci & Technol China Ctr Intelligent Networking & Commun Chengdu 611731 Peoples R China Agcy Sci Technol & Res Inst Infocomm Res Singapore Singapore

Blockchain is a promising technology for future dynamic spectrum access (DSA) management due to its decentralization, immutability, and traceability. However, many challenges need to be addressed to integrate the blockchain to DSA, such as the trustworthiness of participating nodes' spectrum sensing results, privacy protection of sensing nodes' identities, and affordable lightweight consensus algorithms for IoT devices. In this article, we propose a trust-centric privacy-preserving blockchain for DSA in IoT networks. To be specific, we propose a trust evaluation mechanism to evaluate the trustworthiness of sensing nodes and design a Proof-of-Trust (PoT) consensus mechanism to build a scalable blockchain with high transaction-per-second (TPS). Moreover, a privacy protection scheme is proposed to protect sensors' real-time geolocation information when they upload sensing data to the blockchain. Two smart contracts are designed to make the whole procedure (spectrum sensing, spectrum auction, and spectrum allocation) run automatically. Simulation results demonstrate the expected computation cost of the PoT consensus algorithm for reliable nodes is low, and the cooperative sensing performance is improved with the help of the trust evaluation mechanism. In addition, incentivization and security are also analyzed, which show that our system can not only encourage nodes' participation, but also resist many kinds of attacks which are frequently arise in the trust management mechanism and blockchain-based IoT systems.

关键词： Blockchains Sensors Smart contracts consensus algorithm Privacy Protocols Radio spectrum management Blockchain consensus algorithm cooperative spectrum sensing dynamic spectrum access (DSA) trust model

来源：评论

学校读者我要写书评

暂无评论

TOWARD A FAILURES MODEL FOR COMMUNICATION OF DECENTRALIZED APPLICATIONS WITH BLOCKCHAIN NETWORKS APPLIED IN THE INDUSTRIAL ENVIRONMENT

引用

IEEE WIRELESS COMMUNICATIONS 2022年第3期29卷 40-46页

作者： Batista Garrocho, Charles Tim Oliveira, Karine Nogueira dos Santos, Aldri Luiz Marcelo da Cunha Cavalcanti, Carlos Frederico Rabelo Oliveira, Ricardo Augusto Minas Gerais Fed Inst Educ Sci & Technol Belo Horizonte MG Brazil Vale Co Rio De Janeiro Brazil Univ Fed Minas Gerais Belo Horizonte MG Brazil Univ Fed Ouro Preto Ouro Preto Brazil

consensus algorithms seek to solve communication failures between nodes in a blockchain network. However, the communication failures that involve decentralized applications running on Industrial Internet of Things devices have not yet been addressed. Thus, this work aims to fill this research gap, presenting a failure model for communication between decentralized applications and the blockchain network. Initially, the failures are defined and classified;then countermeasures are presented to circumvent the failures;and at the end, the impact of the countermeasures on the performance of decentralized applications, smart contract, and the blockchain network is evaluated. Therefore, this work provides an analysis of the effects of failures and assists in the design of blockchain applications capable of tolerating certain failures and continuing to function.

关键词： Smart contracts consensus algorithm Decentralized applications Blockchains Industrial Internet of Things Failure analysis

来源：评论

学校读者我要写书评

暂无评论

Local Non-Bayes an Social Learning With Stubborn Agents

引用

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2022年第3期9卷 1178-1188页

作者： Vial, Daniel Subramanian, Vijay Univ Texas Austin Austin TX 78712 USA Univ Michigan Ann Arbor MI 48109 USA

In this article, we study a social learning model in which agents iteratively update their beliefs about the true state of the world using private signals and the beliefs of other agents in a non-Bayesian manner. Some agents are stubborn, meaning they attempt to convince others of an erroneous true state (modeling fake news). We show that while agents learn the true state on short timescales, they "forget" it and believe the erroneous state to be true on longer timescales. Using these results, we devise strategies for seeding stubborn agents so as to disrupt learning, which outperforms intuitive heuristics and gives novel insights regarding vulnerabilities in social learning.

关键词： Complex networks consensus algorithm social network theory

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Average consensus With Beaver Triple and Communication Obfuscation

引用

IEEE Transactions on Automatic Control 2025年

作者： Wang, Peng Lu, Yang Lian, Jianming Pan, Lulu Shao, Haibin Li, Ning Shanghai Jiao Tong University Department of Automation Shanghai200240 China Lancaster University School of Computing and Communications United Kingdom Oak Ridge National Laboratory Oak RidgeTN37830 United States

A privacy-preserving average consensus algorithm is proposed that synergizes the Beaver triple in secret sharing theory and noise obfuscation. The algorithm safeguards the initial values of agents against passive adversaries in a multi-agent system. It is proved that the proposed algorithm can concurrently ensure average consensus and privacy, while also reducing the online computation and communication overhead compared to encryption-based ones. Additionally, it imposes a less stringent condition for privacy preservation compared to certain noise-obfuscation techniques. © 2025 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：