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

CEV Framework: A Central Bank Digital Currency Evaluation and Verification Framework With a Focus on consensus algorithms and Operating Architectures

引用

IEEE ACCESS 2022年 10卷 63698-63714页

作者： Jin, Si Yuan Xia, Yong HSBC Lab Guangzhou 510440 Peoples R China

We propose a Central Bank Digital Currency Evaluation and Verification (CEV) Framework for recommending and verifying technical solutions in the central bank digital currency (CBDC) system. We demonstrate two sub-frameworks: an evaluation sub-framework that provides consensus algorithm and operating architecture solutions and a verification sub-framework that validates the proposed solutions. Our framework offers a universal CBDC solution that is compatible with different national economic and regulatory regimes. The evaluation sub-framework generates customized solutions by splitting the consensus algorithms into several components and analyzing their impacts on CBDC systems. CBDC design involves a trade-off between system features - the consensus algorithm cannot achieve all system features simultaneously. However, we also improve the operating architectures to compensate for the weak system features. The verification sub-framework helps verify our proposed solution through empirical experiments and formal proof. Our framework offers CBDC designers the flexibility to iteratively tune the trade-off between CBDC system features for the desired solution. To the best of our knowledge, we are the first to propose a framework to recommend and verify CBDC technical solutions.

关键词： consensus algorithm Business Blockchains Privacy Online banking Scalability Licenses Central bank digital currency evaluation sub-framework consensus algorithm operating architectures verification sub-framework

来源：评论

学校读者我要写书评

暂无评论

Evaluating Network Structures in Byzantine-based consensus algorithms for Sarawak's Digitalized Pepper Value Chain

引用

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2024年第5期40卷 943-955页

作者： Kueh, Feng-Yi Tang, Fu-Ee Ling, Huo-Chong Tan, Yee-Yong Ho, Carrie Lee-Ing Curtin Univ Dept Elect & Comp Engn Miri 98009 Malaysia Curtin Univ Dept Civil & Construct Engn Miri 98009 Malaysia RMIT Univ Sch Sci Engn & Technol Ho Chi Minh City 70000 Vietnam

Known as the "King of Spice", pepper (Piper nigrum) is the most widely used and traded agricultural product in the world. In Sarawak, pepper is listed as the few industrial crops in producing and contributing the most to the gross domestic product (GDP) of the country, Malaysia. However, the recent price fluctuation in the global pepper market has caused some farmers to abandon pepper farms due to the lower pepper prices against the high cost of input materials and farm maintenance, in addition to limited marketing choices and bargaining power when dealing with buyers due to their geographic remoteness, small production quantity, and variable product. To improve the circumstances, the use of block- chain technology with Byzantine-based consensus algorithm is proposed in this paper to minimize some of the constraints faced by the smallholder farmers. With the PBFT consensus algorithm on-board, the blockchain network (BCN) operates without miners as it relies on the message-transfer mechanism to achieve the total consensus. Besides, the PBFT consensus algorithm with varying network structures were evaluated. Upon comparison between network structures, the group network structure dominated the entirety of the experiment and presented as the proposed network structure, with the addition of specific nodes such as relay, storage, administer and brackets: bench and penalty to facilitate and maintain the longevity of the BCN. The implementation of blockchain technology in Sarawak's pepper industry has the potential to improve the linkages and cohesion between pepper stakeholders but its overall integration would have to be further explored.

关键词： blockchain technology consensus algorithm linkages network structures pe- pper Sarawak stakeholders

来源：评论

学校读者我要写书评

暂无评论

Experimental validation of consensus algorithms for multivehicle cooperative control

引用

IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY 2008年第4期16卷 745-752页

作者： Ren, Wei Chao, Haiyang Bourgeous, William Sorensen, Nathan Chen, YangQuan Utah State Univ Dept Elect & Comp Engn Logan UT 84322 USA

In this brief, consensus algorithms are experimentally implemented and validated on a mobile actuator and sensor network platform under directed, possibly switching interaction topologies to explore issues and challenges in distributed multivehicle cooperative control. Distributed consensus algorithms are applied to two target applications including rendezvous and axial alignment. In the rendezvous application, multiple mobile robots simultaneously arrive at a common a priori unknown target location determined through team negotiation. In the axial alignment application, multiple mobile robots collectively align their final positions along a line. The experimental results show the effectiveness and robustness of the consensus algorithms even in the presence of platform physical limitations, packet loss, information delay, etc. These experimental results validate the corresponding theoretical results.

关键词： axial alignment cooperative control consensus algorithm mobile actuator and sensor network multivehicle systems rendezvous

来源：评论

学校读者我要写书评

暂无评论

Cluster-Based Classification of Blockchain consensus algorithms

引用

IEEE LATIN AMERICA TRANSACTIONS 2021年第4期19卷 688-696页

作者： Aponte, Fredy Gutierrez, Luz Pineda, Magda Merino, Ines Salazar, Augusto Wightman, Pedro Univ Santo Tomas Barranquilla Colombia Univ Norte Barranquilla Atlantico Colombia Univ Magdalena Santa Marta Colombia

In recent years, Blockchain has become a disruptivetechnology to protect the integrity of information, especially inopen and collaborative information systems. Its main advantageis the possibility to reach consensus on the new data blocks tobe added to the chain, even with anonymous actors. The mostcommon consensus mechanism is Proof of Work, but it has beenproven to be very inefficient in terms of energy spent by themembers of the blockchain. In the literature there are many othertechniques that pretend to become the new popular ***, the number of this techniques is growing too fast toreally be able to differentiate among all the options. In this work,a new characterization of consensus algorithm is proposed, thatcan be used to find families of mechanism using cluster-basedclassification. Using the Ward Method and Spearmans RankCorrelation analysis, new clusters of consensus mechanisms wereidentified. The results describe the behavioral patterns not seenbefore in the literature. In addition, some open problems ofcurrent consensus algorithms are discussed.

关键词： Blockchain Proof of Work Fault tolerant systems Fault tolerance Distributed ledger Scalability consensus algorithm Blockchain Cluster-based classification consensus algorithms Proof of Work Spearman Rank Correlation Ward Method

来源：评论

学校读者我要写书评

暂无评论

What Constitutes a Less Discriminatory algorithm? 25

What Constitutes a Less Discriminatory Algorithm?

引用

4th ACM Symposium on Computer Science and Law, CS and LAW 2025

作者： Laufer, Benjamin Raghavan, Manish Barocas, Solon Cornell University New YorkNY United States MIT CambridgeMA United States Microsoft Research New YorkNY United States

ISBN: (纸本)9798400714214

Disparate impact doctrine offers an important legal apparatus for targeting discriminatory data-driven algorithmic decisions. A recent body of work has focused on conceptualizing one particular construct from this doctrine: the less discriminatory alternative, an alternative policy that reduces disparities while meeting the same business needs of a status quo or baseline policy. However, attempts to operationalize this construct in the algorithmic setting must grapple with some thorny challenges and ambiguities. In this paper, we attempt raise and resolve important questions about less discriminatory algorithms (LDAs). How should we formally define LDAs, and how does this interact with different societal goals they might serve? And how feasible is it for firms or plaintiffs to computationally search for candidate LDAs? We find that formal LDA definitions face fundamental challenges when they attempt to evaluate and compare predictive models in the absence of held-out data. As a result, we argue that LDA definitions cannot be purely quantitative, and must rely on standards of "reasonableness." We then raise both mathematical and computational constraints on firms’ ability to efficiently conduct a proactive search for LDAs, but we provide evidence that these limits are "weak" in a formal sense. By defining LDAs formally, we put forward a framework in which both firms and plaintiffs can search for alternative models that comport with societal goals. © 2025 Copyright held by the owner/author(s).

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Regulation of algorithmic Collusion, Refined: Testing Pessimistic Calibrated Regret 25

Regulation of Algorithmic Collusion, Refined: Testing Pessim...

引用

4th ACM Symposium on Computer Science and Law, CS and LAW 2025

作者： Hartline, Jason D. Wang, Chang Zhang, Chenhao Northwestern University EvanstonIL United States

ISBN: (纸本)9798400714214

We study the regulation of algorithmic (non-)collusion amongst sellers in dynamic imperfect price competition by auditing their data as introduced by Hartline et al. [23]. We develop an auditing method that tests whether a seller’s pessimistic calibrated regret is low. The pessimistic calibrated regret is the highest calibrated regret of outcomes compatible with the observed data. This method relaxes the previous requirement that a pricing algorithm must use fully-supported price distributions to be auditable. This method is at least as permissive as any auditing method that has a high probability of failing algorithmic outcomes with non-vanishing calibrated regret. Additionally, we strengthen the justification for using vanishing calibrated regret, versus vanishing best-in-hindsight regret, as the non-collusion definition, by showing that even without any side information, the pricing algorithms that only satisfy weaker vanishing best-in-hindsight regret allow an opponent to manipulate them into posting supra-competitive prices. This manipulation cannot be excluded with a non-collusion definition of vanishing best-in-hindsight regret. We motivate and interpret the approach of auditing algorithms from their data as suggesting a per se rule. However, we demonstrate that it is possible for algorithms to pass the audit by pretending to have higher costs than they actually do. For such scenarios, the rule of reason can be applied to bound the range of costs to those that are reasonable for the domain. © 2025 Copyright held by the owner/author(s).

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Towards Scalable and Practical Batch-Dynamic Connectivity 51st

Towards Scalable and Practical Batch-Dynamic Connectivity

引用

51st International Conference on Very Large Data Bases, VLDB 2025

作者： De Man, Quinten Dhulipala, Laxman Karczmarz, Adam Lącki, Jakub Shun, Julian Wang, Zhongqi University of Maryland United States University of Warsaw IDEAS NCBR Poland Google Research United States MIT CSAIL United States

We study the problem of dynamically maintaining the connected components of an undirected graph subject to edge insertions and deletions. We give the first parallel algorithm for the problem that is work-efficient, supports batches of updates, runs in poly logarithmic depth, and uses only linear total space. The existing algorithms for the problem either use super-linear space, do not come with strong theoretical bounds, or are not parallel. On the empirical side, we provide the first implementation of the cluster forest algorithm, the first linear-space and poly logarithmic update time algorithm for dynamic connectivity. Experimentally, we find that our algorithm uses up to 19.7× less space and is upto 6.2× faster than the level-set algorithm of Holm, de Lichtenberg, and Thor up, arguably the most widely-implemented dynamic connectivity algorithm with strong theoretical guarantees. © 2025, VLDB Endowment, All rights reserved.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

The Study of a Distributed Networking Method Based on an Improved Raft Protocol 24

The Study of a Distributed Networking Method Based on an Imp...

引用

2nd International Conference on Communication Networks and Machine Learning, CNML 2024

作者： Wu, Rui Wuhan marine electric propulsion research institute Hubei wuhan China

ISBN: (纸本)9798400711688

To address issues such as central server dependency, harsh environments, and network instability during the networked upgrade of industrial control devices, this paper proposes a distributed self-organizing network system based on the Raft consensus algorithm. By comparing and analyzing the feasibility, advantages, and disadvantages of the Paxos and Raft protocols, the Raft protocol was selected for constructing the distributed system. To overcome the limitations of the Raft algorithm in the leader election process, a leader election algorithm based on node priority was proposed and implemented to enhance the performance of the distributed system under high load and unstable network conditions. Simulation experiments were conducted, and the results demonstrate that the optimized algorithm proposed in this paper reduces the average write latency by 18.3%, increases the number of logs processed per unit of time by 27.2%, and improves the system throughput per unit of time by 39.9%, compared to the original Raft algorithm. © 2024 Copyright held by the owner/author(s).

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Analysis of Short Video Platform algorithms Based on Causal Inference: The Formation and Decoupling of the Information Cocoon Effect

Analysis of Short Video Platform Algorithms Based on Causal ...

引用

2025 Asia-Europe Conference on Cybersecurity, Internet of Things and Soft Computing, CITSC 2025

作者： Cheng, Jingya School of Culture and Communication Guangdong Business and Technology University Zhaoqing China

ISBN: (纸本)9798331504205

Short video platforms push content to users through recommendation algorithms, which greatly improves user experience, but also triggers the information cocoon effect. This paper explores the impact of the recommendation algorithm of short video platforms on the information cocoon effect based on the theory of causal inference, and proposes algorithm design and model simulation methods to decouple the relationship between the information cocoon effect and content diversity. First, this paper constructs a causal inference model to identify the formation mechanism of the information cocoon effect in the recommendation algorithm. Then, by introducing a diversity constraint factor, adjustments are made in the recommendation algorithm to increase the probability that users receive different types of content, thereby reducing the generation of the information cocoon effect. The model simulation results show that without affecting the user experience, the optimized recommendation algorithm improves the information diversity index by 15.7%, while the intensity of the information cocoon effect is reduced by 22.4%. This study shows that the optimization of the recommendation algorithm based on causal inference can effectively alleviate the information cocoon effect in the short video platform, improve the breadth of user information acquisition, and has high practical value. © 2025 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Software Crowdsourcing Allocation algorithm Based on Task Priority 24th

Software Crowdsourcing Allocation Algorithm Based on Task Pr...

引用

24th International Conference on algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Mei, Ao Yu, Dunhui School of Computer Science and Information Engineering Hubei University Wuhan430062 China Engineering and Technical Research Center of Hubei Province in Educational Informatization Wuhan430062 China

ISBN: (纸本)9789819615278

Aiming at the problem of insufficient consideration of skill rarity and worker skill coverage in the task allocation decision of the current software crowdsourcing platform, this paper proposes a task priority-based software crowdsourcing allocation algorithm. First, the skill rarity is calculated based on the tasks to be assigned and the development skills of workers, and the task priority is determined accordingly. Then, the pre-allocation scheme based on the priority is used as the initial input of the allocation algorithm. Finally, the parameters of the algorithm are set based on the global optimization objectives of maximizing the number of tasks to be assigned and minimizing the number of workers to complete the crowdsourcing task allocation. The experimental results show that compared with allocation algorithms such as candidate task worker group algorithm based on allocation utility and preference matching satisfaction maximization, The algorithms in this paper improves the number of successful task allocations and average worker overhead by 15.23% and 12.76% on average. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：