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

5th International Conference on Data Science, Machine Learning and Applications

作者： Hizam, Nuras Naser Saeed Shelar, Madhukar Commerce Management & Comp Sci CMCS Coll Nasik 422013 India

ISBN: (纸本)9789819780334;9789819780310;9789819780303

People are enamoured with the Cryptocurrencies Bitcoin and Ethereum, which have recently gained enormous popularity. The success of various Cryptocurrencies is due to blockchain. Every sector is aware of and using the advantages of blockchain. Because of the daily expansion of the technological revolution, practically everything is now done digitally. As a result, security, the most important factor, is required. Blockchain acts as a super hero by offering a protected conduit for transactions. It is a chain of blocks, as the namewould imply. Digital data is referred to as a block, and the public database is referred to as a chain. It is utilized in supply chains, healthcare, property records, and other areas. The purpose of this paper to expose the implementation of the blockchain in IoT Platforms and provides an in-depth analysis of several categories of consensus protocols implemented in different blockchain systems, as well as the advantages and disadvantages of every algorithm. We additionally present an underlying comparison of several algorithms to help in better comprehend consensus protocol choosing. We elicit the IoT issues being taken into account as well as the specifics of the blockchain-based solutions.

关键词： Cryptocurrencies Bitcoin Ethereum Block chain consensus algorithms IoT

来源：评论

学校读者我要写书评

暂无评论

Majoritarianism and Monoculture (M&M)

引用

DATA & POLICY 2025年 7卷 e101-e108页

作者： Ahmed, Mansoor (Manny) Toliver, Dann R. Nakib, Hazem Danny Univ Cambridge OpenOrigins Ltd Cambridge England Univ Cambridge Dept Comp Sci & Technol Cambridge England Univ Cambridge Ctr Redecentralisat CRDC Dept Comp Sci & Technol Cambridge England

Research in decentralized computing, specifically in consensus algorithms, has focused on providing resistance to an adversary with a minority stake. This has resulted in systems that are majoritarian in the extreme, ignoring valuable lessons learned in law and politics over centuries. In this article, we first detail this phenomenon of majoritarianism and point out how minority protections in the nondigital world have been implemented. We motivate adding minority protections to collaborative systems with examples. We also show how current software deployment models exacerbate majoritarianism, highlighting the problem of monoculture in client software in particular. We conclude by giving some suggestions on how to make decentralized computing less hostile to those in the minority.

关键词： consensus algorithms digital collaboration decentralisation majoritarianism minority rights

来源：评论

学校读者我要写书评

暂无评论

Adaptive Filter algorithms for Accelerated Discrete-Time consensus

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2010年第3期58卷 1049-1058页

作者： Cavalcante, Renato L. G. Mulgrew, Bernard Univ Edinburgh Digital Commun Res Inst Joint Res Inst Signal & Image Proc Edinburgh EH9 3JL Midlothian Scotland

In many distributed systems, the objective is to reach agreement on values acquired by the nodes in a network. A common approach to solve such problems is the iterative, weighted linear combination of those values to which each node has access. Methods to compute appropriate weights have been extensively studied, but the resulting iterative algorithms still require many iterations to provide a fairly good estimate of the consensus value. In this study we show that a good estimate of the consensus value can be obtained with few iterations of conventional consensus algorithms by filtering the output of each node with set-theoretic adaptive filters. We use the adaptive projected subgradient method to derive a set-theoretic filter requiring only local information available to each node and being robust to topology changes and erroneous information about the network. Numerical simulations show the good performance of the proposed method.

关键词： Adaptive filters consensus algorithms distributed estimation

来源：评论

学校读者我要写书评

暂无评论

Lightweight blockchain mechanism for secure data transmission in healthcare system

引用

BIOMEDICAL SIGNAL PROCESSING AND CONTROL 2025年 102卷

作者： Singh, Murari Kumar Pippal, Sanjeev Kumar Sharma, Vishnu Dr APJ Abdul Kalam Tech Univ Dept CSE Lucknow UP India Sharda Univ SET Greater Noida UP India GL Bajaj Inst Technol & Management Greater Noida UP India ITS Coll Engn Dept CSE Greater Noida UP India

Healthcare Network refers to the interconnected IoT devices that are involved in exchanging medical information through different entities, like providers, patients, and devices. Medical information is significantly important, as it describes the person's medical conditions. However, storing and retrieving the medical-related information in the network system results ina complex task. Different existing models are introduced to provide security in the network system, but yet it faces different issues, like data security and privacy, interoperability issues, data integrity concerns, scalability limitations, regulatory compliance requirements, and difficulties in managing data access and control. To overcome these issues, and to securely store data in the provider, a lightweight proof of hybrid security-based minor solution is designed for Healthcare Networking Systems in which an optimized consensus algorithm is designed for data management in healthcare systems. The proposed model is designed in a blockchain framework, where the security protocol is adopted to transfer the information securely by preventing the threads from stealing the data. This algorithm integrates elements of both Proof of Work (PoW) and Proof of Stake (PoS) to achieve a balance between computational efficiency, security, and decentralization. The proposed solution provides seamless communication and efficient access to medical data across diverse healthcare entities, ultimately enhancing patient care outcomes and healthcare system efficiency. The proposed model achieved higher performance by considering the metrics, like gas usage, memory usage, receiving time, sending time, and transaction latency with the value of 0.69, 712.92Kbps, 0.56 ms, 0.61 ms, and 0.50msrespectively.

关键词： Blockchain Healthcare networks Lightweight proof of hybrid security-based minor solutions consensus algorithms Remote healthcare monitoring

来源：评论

学校读者我要写书评

暂无评论

The Blockchain Trilemma: A Formal Proof of the Inherent Trade-Offs Among Decentralization, Security, and Scalability

引用

APPLIED SCIENCES-BASEL 2025年第1期15卷 19-19页

作者： Mssassi, Souhail Abou El Kalam, Anas Cadi Ayyad Univ Natl Sch Appl Sci Marrakech 40160 Morocco

Blockchain technology has emerged as a transformative force with the potential to disrupt traditional industries by providing decentralized, secure, and transparent systems. However, blockchain systems face a fundamental challenge known as the Blockchain Trilemma, which posits that a blockchain cannot simultaneously achieve optimal levels of decentralization, security, and scalability. This paper addresses the Blockchain Trilemma through rigorous mathematical proof, demonstrating that achieving maximum levels of all three properties concurrently leads to inherent contradictions. By formalizing the definitions of decentralization, security, and scalability, we provide a foundational framework to understand these trade-offs. Our analysis includes a proof by contradiction and computational complexity analysis. This work aims to deepen the understanding of the fundamental limitations of blockchain technology, offering insights for future innovations and helping navigate the inevitable trade-offs.

关键词： Blockchain Trilemma decentralization scalability security computational complexity consensus algorithms blockchain scalability limits distributed systems blockchain security

来源：评论

学校读者我要写书评

暂无评论

A High-throughput and Secure Coded Blockchain for IoT

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Taherpour, Amirhossein Wang, Xiaodong Columbia University Electrical Engineering Department United States

We propose a new coded blockchain scheme suitable for the Internet-of-Things (IoT) network. In contrast to existing works for coded blockchains, especially blockchain-of-things, the proposed scheme is more realistic, practical, and secure while achieving high throughput. This is accomplished by: 1) modeling the variety of transactions using a reward model, based on which an optimization problem is solved to select transactions that are more accessible and cheaper computational-wise to be processed together;2) a transaction-based and lightweight consensus algorithm that emphasizes on using the minimum possible number of miners for processing the transactions;and 3) employing the raptor codes with linear-time encoding and decoding which results in requiring lower storage to maintain the blockchain and having a higher throughput. We provide detailed analysis and simulation results on the proposed scheme and compare it with the state-of-the-art coded IoT blockchain schemes including Polyshard and LCB, to show the advantages of our proposed scheme in terms of security, storage, decentralization, and throughput. © 2004-2012 IEEE.

关键词： Blockchain coded blockchain consensus algorithms decentralization throughput Internet of Things (IoT) optimization decentralization rateless codes scalability security storage

来源：评论

学校读者我要写书评

暂无评论

Port-Hamiltonian Dynamics on Graphs: consensus and Coordination Control algorithms

引用

IFAC Proceedings Volumes 2010年第19期43卷 175-178页

作者： A.J. van der Schaft B.M. Maschke Johann Bernoulli Institute for Mathematics and Computer Science University of Groningen PO Box 407 9700 AK the Netherlands Laboratoire d'Automatique et de Genie des Procédés Université Claude Bernard Lyon-1 F-69622 Villeurbanne Cedex France

Directed graphs are shown to be endowed with a canonical Dirac structure, which is used for formulating standard consensus and coordination control algorithms as port-Hamiltonian systems.

关键词： Directed graphs Dirac structure port-Hamiltonian systems Laplacian matrix consensus algorithms coordination control

来源：评论

学校读者我要写书评

暂无评论

Optimal Topology Control and Power Allocation for Minimum Energy Consumption in consensus Networks

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2012年第1期60卷 383-399页

作者： Sardellitti, Stefania Barbarossa, Sergio Swami, Ananthram Univ Roma La Sapienza DIET I-00184 Rome Italy ARL Adelphi MD 20783 USA

consensus algorithms have generated a lot of interest due to their ability to compute globally relevant statistics by only exploiting local communications among sensors. However, when implemented over wireless sensor networks, the inherent iterative nature of consensus algorithms may cause a large energy consumption. Hence, to make consensus algorithms really appealing in sensor networks, it is necessary to minimize the energy necessary to reach a consensus, within a given accuracy. We propose a method to optimize the network topology and the power allocation over each active link in order to minimize the energy consumption. We consider two network models: a deterministic model, where the nodes are located arbitrarily but their positions are known, and a random model, where the network topology is modeled as a random geometric graph (RGG). In the first case, we show how to convert the topology optimization problem, which is inherently combinatorial, into a parametric convex problem, solvable with efficient algorithms. In the second case, we optimize the power transmitted by each node, exploiting the asymptotic distributions of the eigenvalues of the adjacency matrix of an RGG. We further show that the optimal power can be found as the solution of a convex problem. The theoretical findings are corroborated with extensive simulation results.

关键词： consensus algorithms minimum energy consumption random graphs sensor networks topology control

来源：评论

学校读者我要写书评

暂无评论

Impact of consensus contours from multiple PET segmentation methods on the accuracy of functional volume delineation

引用

EUROPEAN JOURNAL OF NUCLEAR MEDICINE AND MOLECULAR IMAGING 2016年第5期43卷 911-924页

作者： Schaefer, A. Vermandel, M. Baillet, C. Dewalle-Vignion, A. S. Modzelewski, R. Vera, P. Massoptier, L. Parcq, C. Gibon, D. Fechter, T. Nemer, U. Gardin, I. Nestle, U. Univ Saarland Dept Nucl Med Med Ctr D-66421 Homburg Germany Univ Lille INSERM CHU Lille U1189ONCO THAI Image Assisted Laser Therapy Onco F-59000 Lille France CHU Lille Dept Nucl Med F-59000 Lille France Ctr Henri Becquerel F-76000 Rouen France LITIS EA4108 F-76000 Rouen France AQUILAB Res & Innovat Dept F-59120 Loos Les Lille France Univ Med Ctr Freiburg Dept Radiat Oncol Freiburg Germany German Canc Consortium DKTK Freiburg Heidelberg Germany German Canc Res Ctr Freiburg Germany Univ Med Ctr Freiburg Dept Nucl Med Freiburg Germany

Purpose The aim of this study was to evaluate the impact of consensus algorithms on segmentation results when applied to clinical PET images. In particular, whether the use of the majority vote or STAPLE algorithm could improve the accuracy and reproducibility of the segmentation provided by the combination of three semiautomatic segmentation algorithms was investigated. Methods Three published segmentation methods (contrast-oriented, possibility theory and adaptive thresholding) and two consensus algorithms (majority vote and STAPLE) were implemented in a single software platform (ArtiviewA (R)). Four clinical datasets including different locations (thorax, breast, abdomen) or pathologies (primary NSCLC tumours, metastasis, lymphoma) were used to evaluate accuracy and reproducibility of the consensus approach in comparison with pathology as the ground truth or CT as a ground truth surrogate. Results Variability in the performance of the individual segmentation algorithms for lesions of different tumour entities reflected the variability in PET images in terms of resolution, contrast and noise. Independent of location and pathology of the lesion, however, the consensus method resulted in improved accuracy in volume segmentation compared with the worst-performing individual method in the majority of cases and was close to the best-performing method in many cases. In addition, the implementation revealed high reproducibility in the segmentation results with small changes in the respective starting conditions. There were no significant differences in the results with the STAPLE algorithm and the majority vote algorithm. Conclusion This study showed that combining different PET segmentation methods by the use of a consensus algorithm offers robustness against the variable performance of individual segmentation methods and this approach would therefore be useful in radiation oncology. It might also be relevant for other scenarios such as the merging of expert recommendat

关键词： PET image segmentation consensus algorithms STAPLE Radiation oncology F-18-FDG PET Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Convergence Speed in Distributed consensus and Averaging

引用

SIAM REVIEW 2011年第4期53卷 747-772页

作者： Olshevsky, Alex Tsitsiklis, John N. Princeton Univ Dept Mech & Aerosp Engn Princeton NJ 08544 USA MIT Informat & Decis Syst Lab Cambridge MA 02139 USA

We study the convergence speed of distributed iterative algorithms for the consensus and averaging problems, with emphasis on the latter. We first consider the case of a fixed communication topology. We show that a simple adaptation of a consensus algorithm leads to an averaging algorithm. We prove lower bounds on the worst-case convergence time for various classes of linear, time-invariant, distributed consensus methods, and provide an algorithm that essentially matches those lower bounds. We then consider the case of a time-varying topology, and provide a polynomial-time averaging algorithm.

关键词： consensus algorithms distributed averaging cooperative control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：