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

arXiv 2025年

作者： Shakournia, Mohammad R. Jamshidi, Pooya Faragardi, Hamid Reza Yazdani, Nasser School of Electrical and Computer Engineering University of Tehran Tehran Iran Research Institute of Sweden Stockholm Sweden

Blockchain technology offers a decentralized and secure method for storing and authenticating data, rendering it well-suited for various applications such as digital currencies, supply chain management, and voting systems. However, the decentralized nature of blockchain also exposes it to vulnerabilities, particularly Byzantine faults, which arise when nodes in the network behave maliciously or encounter unexpected failures. Such incidents can result in inconsistencies within the blockchain and, in extreme scenarios, lead to a breakdown in consensus. Byzantine fault-tolerant consensus algorithms are crafted to tackle this challenge by ensuring that network nodes can agree on the blockchain’s state even in the presence of faulty or malicious nodes. To bolster the system’s resilience against these faults, it is imperative to detect them within the system. However, our examination of existing literature reveals a prevalent assumption: solutions typically operate under constraints regarding the number of faulty nodes. Such constraints confine the proposed solutions to ideal environments, limiting their practical applicability. In response, we propose a novel approach inspired by social paradigms, employing a trusted and fully monitored communication sub-process to detect Byzantine nodes. Upon detection, these nodes can be either disregarded in the consensus-building process, subjected to penalties, or undergo modifications as per the system’s policy. Finally, we statistically demonstrate that our approach achieves a detection probability that exceeds 95% for Byzantine nodes. In essence, our methodology ensures that if Byzantine nodes exhibit malicious behavior, healthy nodes can identify them with a confidence level of 95%. Copyright © 2025, The Authors. All rights reserved.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Coordination of Networked Microgrids for Supporting Voltages of Bulk Power Systems

Coordination of Networked Microgrids for Supporting Voltages...

引用

IEEE-Power-and-Energy-Society General Meeting (PESGM)

作者： Vu, T. L. Marinovici, L. Schneider, K. Xie, J. Klauber, C. Dubey, A. Pacif Northwest Natl Lab Richland WA 99352 USA Lawrence Livermore Natl Lab Livermore CA 94551 USA Washington State Univ Pullman WA 99164 USA

ISBN: (纸本)9781665464413

Active distribution system resources have the potential to support the bulk power system (BPS) during abnormal conditions, increasing reliability and resilience of power systems and end-use customers. This paper investigates for the first time the BPS voltage support provided by networked microgrids at the feeder level. A peer-to-peer (P2P) communication control framework is introduced to enable the coordination of multiple microgrids in a mixed ownership environment. This allows the microgrids to collectively implement a consensus algorithm (CA) to distributedly determine their own reactive power injections. Thus, their reactive power injection contributions are realized in a fair manner, having the same ratio of reactive power injection to reactive power headroom for all microgrids. The CA implementation and performance within the P2P communication framework are demonstrated on the IEEE 39-bus system with 10 microgrids contained in the distribution feeder assumed to be connected to one of the BPS buses.

关键词： Microgrids volt/var consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Separating the Yes- from the No-Instances in the Number Partitioning Problem 16th

Separating the Yes- from the No-Instances in the Number Part...

引用

16th International Joint Conference on Computational Intelligence, IJCCI 2024

作者： Horn, Ruben Jansen, Reitze van Eck, Okke van Den Berg, Daan Helmut-Schmidt-University Hamburg Germany Department of Computer Science University of Amsterdam Netherlands Department of Computer Science VU Amsterdam Netherlands

ISBN: (纸本)9789897587214

The (two-way) number partitioning problem (NPP) is a well known NP-complete decision problem in which a set of (positive) integers must be split in such a way that the sum of both resulting subsets is equal. However, its optimization problem variant is even harder, since the verification of partitions is only possible in polynomial time for instances which have a perfect partition. We investigate the distribution of instances that have and that do not have a perfect partition, and find that they are not randomly distributed in the instance space. Thus, the hardness of any given instance might be predictable to some extent. We demonstrate that it is possible to separate these two instance types visually using a linear time embedding into R 2 for instances of the same template. Furthermore, we compare three greedy heuristic algorithms (greedy captains, greedy coach, and greedy tyrant) and their difference to the solution from an exact branch-and-bound (BB) algorithm. © 2024 by Paper published under CC license (CC BY-NC-ND 4.0)

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Path Planning algorithm and ID3 Decision Tree Model Application of Scenic Intelligent Navigation System 11th

Path Planning Algorithm and ID3 Decision Tree Model Applicat...

引用

11th International Conference on Applications and Techniques in Cyber Intelligence, ATCI 2023

作者： Qiu, Ming Collegeof Tourism Bohai University Jinzhou China

The assumption space of ID3 algorithm contains all decision trees, and the search space is also a complete assumption space. The current assumptions based on the information gain standard, and uses the information gain to reduce the sensitivity to individual training sample errors. Based on ID3 decision tree algorithm, this paper provides new ideas and methods for the quality optimization of tourist attractions. Firstly, ID3 decision tree algorithm model is constructed based on information entropy theory;Then, based on the literature research and system research methods, the quality evaluation indicator system of tourist attractions is constructed;Finally, based on the mathematical model and evaluation indicator system, the empirical research was carried out, and the data of 17 tourist attractions were collected. The expected research results were obtained according to the data preprocessing, data calculation process, decision tree construction and rule generation process. The research finds that the quality evaluation process of tourist attractions based on ID3 decision tree model, through data preprocessing, data calculation, decision tree construction and decision rules generation, etc. it can be concluded that the "Tourism environment quality" attribute is the most important in this evaluation system, and "Tourism landscape quality" is relatively important. Tourist attractions can improve the work and quality of tourist attractions according to the research results. © 2024 The Authors. Published by Elsevier B.V.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Fault location of DG distribution network based on improved NGO algorithm 4

Fault location of DG distribution network based on improved ...

引用

4th International Conference on Electronics, Circuits and Information Engineering, ECIE 2024

作者： Bai, Xiangxv Liaoning Technical University Faculty of Electrical and Control Engineering Liaoning Province Huludao City China

ISBN: (纸本)9798350388312

In order to solve the problems of difficult fault location and low positioning accuracy of DG distribution network, a fault location model of DG distribution network based on improved NGO algorithm was proposed. Firstly, a suitable fault location model was established. Secondly, chaos mapping is used to improve the population quality of NGO algorithms, and adaptive weights are introduced to improve the global development ability of the algorithms. Finally, through simulation analysis, the experimental results show that the localization model is practical and feasible, and the INGO algorithm can solve the problem of fault location well. © 2024 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

On Connected Strongly-Proportional Cake-Cutting 27

On Connected Strongly-Proportional Cake-Cutting

引用

27th European Conference on Artificial Intelligence, ECAI 2024

作者： Jankó, Zsuzsanna Joó, Attila Segal-Halevi, Erel Yuen, Sheung Man Corvinus University of Budapest HUN-REN Centre for Economic and Regional Studies Hungary University of Hamburg Germany Ariel University Israel National University of Singapore Singapore

ISBN: (纸本)9781643685489

We investigate the problem of fairly dividing a divisible heterogeneous resource, also known as a cake, among a set of agents who may have different entitlements. We characterize the existence of a connected strongly-proportional allocation—one in which every agent receives a contiguous piece worth strictly more than their proportional share. The characterization is supplemented with an algorithm that determines its existence using O(n·2n) queries. We devise a simpler characterization for agents with strictly positive valuations and with equal entitlements, and present an algorithm to determine the existence of such an allocation using O(n2) queries. We provide matching lower bounds in the number of queries for both algorithms. When a connected strongly-proportional allocation exists, we show that it can also be computed using a similar number of queries. © 2024 The Authors.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Almost Optimal algorithms for Token Collision in Anonymous Networks 38

Almost Optimal Algorithms for Token Collision in Anonymous N...

引用

38th International Symposium on Distributed Computing, DISC 2024

作者： Bai, Sirui Fu, Xinyu Wu, Xudong Yao, Penghui Zheng, Chaodong State Key Laboratory for Novel Software Technology Nanjing University China Hefei National Laboratory China

ISBN: (纸本)9783959773522

In distributed systems, situations often arise where some nodes each holds a collection of tokens, and all nodes collectively need to determine whether all tokens are distinct. For example, if each token represents a logged-in user, the problem corresponds to checking whether there are duplicate logins. Similarly, if each token represents a data object or a timestamp, the problem corresponds to checking whether there are conflicting operations in distributed databases. In distributed computing theory, unique identifiers generation is also related to this problem: each node generates one token, which is its identifier, then a verification phase is needed to ensure that all identifiers are unique. In this paper, we formalize and initiate the study of token collision. In this problem, a collection of k tokens, each represented by some length-L bit string, are distributed to n nodes of an anonymous CONGEST network in an arbitrary manner. The nodes need to determine whether there are tokens with an identical value. We present near optimal deterministic algorithms for the token collision problem with Õ(D + k · L/log n) round complexity, where D denotes the network diameter. Besides high efficiency, the prior knowledge required by our algorithms is also limited. For completeness, we further present a near optimal randomized algorithm for token collision. © Sirui Bai, Xinyu Fu, Xudong Wu, Penghui Yao, and Chaodong Zheng.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Intelligent Test Paper Generation algorithm Integrating Normal Distribution and Parallel Genetic algorithm 5

Intelligent Test Paper Generation Algorithm Integrating Norm...

引用

5th International Conference on Intelligent Computing and Human-Computer Interaction, ICHCI 2024

作者： Liu, Chuangye Huang, Guimin School of Computer Science and Information Security Guilin University of Electronic Technology Guangxi Key Laboratory of Image and Graphic Intelligent Processing Guilin541004 China

ISBN: (纸本)9798350368284

Genetic algorithms have been widely used in intelligent test paper generation systems. However, traditional genetic algorithms cannot ensure that the difficulty of test questions is normally distributed, and are prone to falling into local optimal solutions. To address the above problems, we proposed an intelligent test paper generation algorithm that combines normal distribution and parallel genetic algorithms. In the population initialization stage, we use the cumulative distribution function (CDF) of the normal distribution to initialize the population. In the subsequent genetic operations, we designed a directed mutation mechanism and added KL divergence as a penalty number in the design of the fitness function to ensure that the difficulty of the test questions is normally distributed. At the same time, in order to speed up the efficiency of the algorithm and escape from the local optimal solution, an adaptive migration strategy was introduced. Experimental results show that the difficulty of the test questions generated by this algorithm is normally distributed, and the algorithm performance is better than other algorithms. © 2024 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A Full DAG Score-Based algorithm for Learning Causal Bayesian Networks with Latent Confounders 27

A Full DAG Score-Based Algorithm for Learning Causal Bayesia...

引用

27th European Conference on Artificial Intelligence, ECAI 2024

作者： Gonzales, Christophe Valizadeh, Amir-Hosein Aix Marseille Univ CNRS LIS Marseille France

ISBN: (纸本)9781643685489

Causal Bayesian networks (CBN) are popular graphical probabilistic models that encode causal relations among *** their graphical structure from observational data has received a lot of attention in the *** there exists no latent (unobserved) confounder, i.e., no unobserved direct common cause of some observed variables, learning algorithms can be divided essentially into two classes: constraint-based and score-based *** latter are often thought to be more robust than the former and to produce better ***, to the best of our knowledge, when variables are discrete, no score-based algorithm is capable of dealing with latent *** paper introduces the first fully score-based structure learning algorithm searching the space of DAGs (directed acyclic graphs) that is capable of identifying the presence of some latent *** is justified mathematically and experiments highlight its effectiveness. © 2024 The Authors.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Lower Bounds for Adaptive Relaxation-Based algorithms for Single-Source Shortest Paths 35

Lower Bounds for Adaptive Relaxation-Based Algorithms for Si...

引用

35th International Symposium on algorithms and Computation, ISAAC 2024

作者： Atalig, Sunny Hickerson, Alexander Srivastav, Arrdya Zheng, Tingting Chrobak, Marek University of California RiversideCA United States Guangdong University of Technology Guangzhou China

ISBN: (纸本)9783959773546

We consider the classical single-source shortest path problem in directed weighted graphs. D. Eppstein proved recently an Ω(n3) lower bound for oblivious algorithms that use relaxation operations to update the tentative distances from the source vertex. We generalize this result by extending this Ω(n3) lower bound to adaptive algorithms that, in addition to relaxations, can perform queries involving some simple types of linear inequalities between edge weights and tentative distances. Our model captures as a special case the operations on tentative distances used by Dijkstra’s algorithm. © Sunny Atalig, Alexander Hickerson, Arrdya Srivastav, Tingting Zheng, and Marek Chrobak.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：