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

Total variation distance for product distributions is #P-complete

INFORMATION PROCESSING LETTERS 2025年 189卷

作者： Bhattacharyya, Arnab Gayen, Sutanu Meel, Kuldeep S. Myrisiotis, Dimitrios Pavan, A. Vinodchandran, N. V. Univ Warwick Coventry England IIT Kanpur Kanpur India Univ Toronto Toronto ON Canada Georgia Inst Technol Atlanta GA USA CNRS CREATE LTD Singapore Singapore Iowa State Univ Ames IA USA Univ Nebraska Lincoln Lincoln NE USA Natl Univ Singapore Singapore Singapore

We show that computing the total variation distance between two product distributions is #P-complete. This is in stark contrast with other distance measures such as Kullback-Leibler, Chi-square, and Hellinger, which t... 详细信息

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

ON THE GEOMETRIC CONVERGENCE OF BYZANTINE-RESILIENT DISTRIBUTED OPTIMIZATION algorithmS

引用

SIAM JOURNAL ON OPTIMIZATION 2025年第1期35卷 210-239页

作者： Kuwaranancharoen, Kananart Sundaram, Shreyas Purdue Univ Elmore Family Sch Elect & Comp Engn W Lafayette IN 47907 USA

The problem of designing distributed optimization algorithms that are resilient to Byzantine adversaries has received significant attention. For the Byzantine-resilient distributed optimization problem, the goal is to (approximately) minimize the average of the local cost functions held by the regular (nonadversarial) agents in the network. In this paper, we provide a general algorithmic framework for Byzantine-resilient distributed optimization which includes some state-of-the-art algorithms as special cases. We analyze the convergence of algorithms within the framework, and derive a geometric rate of convergence of all regular agents to a ball around the optimal solution (whose size we characterize). Furthermore, we show that approximate consensus can be achieved geometrically fast under some minimal conditions. Our analysis provides insights into the relationship among the convergence region, distance between regular agents' values, step size, and properties of the agents' functions for Byzantine-resilient distributed optimization.

关键词： consensus algorithm convex optimization distributed algorithms distributed optimization fault tolerant systems linear convergence multiagent systems network security

来源：评论

学校读者我要写书评

暂无评论

Fast and simple (1+E)Δ-edge-coloring of dense graphs

引用

THEORETICAL COMPUTER SCIENCE 2025年 1034卷

作者： Dhawan, Abhishek Univ Illinois Dept Math Champaign IL 61820 USA

({ ( 1 )2}) Let E is an element of(0,1)and , Delta is an element of N be such that Delta=Omega maxlog E , E log1E . Given an -vertex -edge simple graph of maximum degree Delta, we present a randomized ( log3 Delta /E2)-time algorithm that computes a proper (1 + E)Delta-edge-coloring of with high probability. This improves upon the best known results for a wide range of the parameters E, , and Delta. Our approach combines a flagging strategy from earlier work of the author with a shifting procedure employed by Duan, He, and Zhang for dynamic edge-coloring. The resulting algorithm is simple to implement and may be of practical interest.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A multi-center federated learning mechanism based on consortium blockchain for data secure sharing

引用

KNOWLEDGE-BASED SYSTEMS 2025年 310卷

作者： Wang, Bin Tian, Zhao Liu, Xinrui Xia, Yujie She, Wei Liu, Wei Zhengzhou Univ Sch Comp & Artificial Intelligence Zhengzhou 450000 Peoples R China Zhengzhou Univ Sch Cyber Sci & Engn Zhengzhou 450000 Peoples R China Henan Key Lab Network Cryptog Technol Zhengzhou 450000 Peoples R China Zhengzhou Key Lab Blockchain & Data Intelligence Zhengzhou 450000 Peoples R China SongShan Lab Zhengzhou 450000 Peoples R China Henan Childrens Hosp Zhengzhou 450018 Peoples R China

Currently, federated learning enables hospitals to collaborate on model training without disclosing patient privacy data. However, it still faces challenges such as single point of failure and communication inefficiency. For this reason, this study innovatively combines consortium blockchain and federated learning. A multicenter federated learning mechanism based on consortium blockchain (MCFLM-CB) is proposed to optimize the security and efficiency of data collaboration and sharing. Firstly, the MCFLM-CB model uses the multi-party co-management feature of the consortium blockchain to replace the central server of federated learning, so that the system performs the training of the federated learning model in multiple centers. It also achieves the elimination of the disadvantages that a single centralized server controls the data model. Secondly, we propose a Dynamic Grouping-based Practical Byzantine Fault Tolerant (DG-PBFT) consensus algorithm. The algorithm performs regrouping and center node selection based on node state changes. It improves the consensus algorithm in blockchain system adaptive ability. Finally, we propose a reputation value-based weighted federal average algorithm. By synthesizing multiple reputation attributes to evaluate the reputation of participants, it comprehensively reflects the node performance. The accuracy and reliability of reputation values are improved. To prove the effectiveness of the method, we validated it on 12 large-scale standardized biomedical image sets MedMNIST. The results show that the model achieves 93.2% accuracy and significantly improves the efficiency of the blockchain.

关键词： Consortium blockchain Privacy protection Federated learning consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

The Coherence and Robustness Analysis for a Family of Unbalanced Networks

引用

IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS 2025年 11卷 378-387页

作者： Liu, Jia-Bao Wang, Xu Hua, Liang Cao, Jinde Chen, Liping Anhui Jianzhu Univ Sch Math & Phys Hefei 230601 Peoples R China Anhui Jianzhu Univ Sch Elect & Informat Engn Hefei 230601 Peoples R China Nantong Univ Sch Elect Engn Nantong 226019 Jiangsu Peoples R China Southeast Univ Sch Math Nanjing 211189 Peoples R China Purple Mt Labs Nanjing 211111 Peoples R China Hefei Univ Technol Sch Elect Engn & Automat Hefei 230009 Peoples R China

This study focuses on the coherence in a class of unbalanced networks, emphasizing the investigation of the impact of leader selection and network parameters on coherence. We discuss three different categories of consensus algorithms: leaderless algorithms of first and second orders, and first-order leader-follower algorithm. Firstly, we derive exact solutions for leaderless network coherence in the first and second orders. Secondly, we design various leader allocation schemes for the first-order leader-follower networks, obtaining expressions correlated with the network scale N, the double-ring cardinalities p and q, and the number of leaders k. Thirdly, we conduct numerical simulations and robustness analyses to explore the impact of leader quantity and topology structure on network coherence. Specifically, the conclusions are as follows: (1) When N decreases, an increase in k demonstrates improved network coherence. (2) The smaller the difference between p and q, the better the coherence. (3) The smaller the sum of p and q, the stronger the robustness. (4) Uniform distribution of k1 and k2 leads to optimal coherence. Finally, the Laplacian energy and Kirchhoff index of the network are analyzed.

关键词： Coherence Robustness Laplace equations Topology Eigenvalues and eigenfunctions Symmetric matrices Numerical simulation consensus algorithm Vectors Stability analysis Unbalanced networks coherence leader selection robustness

来源：评论

学校读者我要写书评

暂无评论

A Probably Approximately Correct Analysis of Group Testing algorithms

引用

IEEE Transactions on Information Theory 2025年第6期71卷 4872-4894页

作者： Sameera Bharadwaja, H. Murthy, Chandra R. Indian Institute of Science Dept. of ECE Bangalore2022 India

We consider the problem of identifying the defectives from a population of items via a non-adaptive group testing framework with a random pooling-matrix design. We analyze the sufficient number of tests needed for approximate set identification, i.e., for identifying almost all the defective and non-defective items with high confidence. To this end, we view the group testing problem as a function learning problem in the probably approximately correct (PAC) framework. We derive sufficiency bounds on the number of tests for popular binary group testing recovery algorithms, namely, combinatorial orthogonal matching pursuit under Bernoulli and near-constant row-weight test designs, and definite defectives under a Bernoulli test design. We compare the derived bounds with the existing ones in the literature for exact recovery both theoretically and using simulations. Finally, we contrast the three cases under consideration in terms of the sufficient testing rate surface and the sufficient number of tests contours across the range of the approximation and confidence levels. © 1963-2012 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Current-to-Best Crossover for Modified Jaya algorithm

International Journal of Mathematical, Engineering and Manag...

引用

International Journal of Mathematical, Engineering and Management Sciences 2025年第4期10卷 1055-1079页

作者： Mogha, Sandeep Kumar Deshwal, Sonal Kumar, Pravesh Department of Mathematics Chandigarh University Punjab Mohali India Department of Mathematics Rajkiya Engineering College Uttar Pradesh Bijnor India

The Jaya algorithm is a recently designed metaheuristics and has been verified for its good performance in solving various engineering and scientific optimization applications. In this paper, an enhanced variant named ‘MCrJaya’ has been developed by incorporating the DE/current-to-best approach-based crossover operation at the creation phase and the DE/αbest/1 mutation operation at the selection phase. The newly designed crossover operation manages the population diversity, while the second approach helps to amplify the convergence rapidity of the algorithm. The proposed MCrJaya is verified on 54 benchmark problems from different test suits and three real-life applications of IEEE CEC 2011. The performance was evaluated using three metrics: mean, standard deviation, and rank. Additionally, statistical analysis was performed using the Wilcoxon rank-sum test to assess the significance of the results, further validating the robustness of the proposed approach. The experimental results confirm the superiority of the MCrJaya over enhanced variants of Jaya, DE, and other metaheuristics algorithms. Copyright © Ram Arti Publishers.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A novel lottery protocol based on quantum blockchain

引用

QUANTUM INFORMATION PROCESSING 2025年第2期24卷 1-24页

作者： Yang, Yu-Guang Qiu, Shi Wang, Yue-Chao Xu, Guang-Bao Jiang, Dong-Huan Beijing Univ Technol Coll Comp Sci & Technol Beijing 100124 Peoples R China Shandong Univ Sci & Technol Coll Comp Sci & Engn Qingdao 266590 Peoples R China Shandong Univ Sci & Technol Coll Math & Syst Sci Qingdao 266590 Peoples R China

The lottery business is a form of gambling activity operated by authority agencies. Due to the substantial economic interests, its security and fairness become the core elements of industry development. To maintain the trust of participants and ensure fair competition, blockchain technology has been widely applied in the lottery field due to the characteristics of decentralization, transparency, and immutability. However, with the rapid advancement of quantum computing, the security of traditional blockchain technology is challenged largely. To tackle this issue, a novel consensus mechanism which can resist quantum attacks is first proposed, based on a self-tallying quantum voting protocol. Then, a quantum circuit is designed, which can encode n-bit binary information into the relative phase of a quantum state and entangle the blocks by means of controlled-Z (CZ) gate, forming a quantum blockchain structure with timestamps. Finally, utilizing the designed quantum blockchain, a new type of lottery protocol is constructed. The proposed protocol meets the requirements of decentralization, unforgeability, verifiability, and quantum attack resistance. Compared to existing lottery protocols, it can support an arbitrary number of players, and only one communication is required for the ticket purchase process of each player, making it suitable for most of lottery game scenarios.

关键词： consensus algorithm Quantum blockchain Quantum coding Lottery protocol

来源：评论

学校读者我要写书评

暂无评论

A Gain Scheduling Control Framework for Mitigation of Time Varying Network Latency in Autonomous AC Microgrids

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2025年第1期21卷 347-356页

作者： Mallick, Amit Pradhan, Jatin Kumar Pradhan, Rosy Achary, K. Sujita Kumar Rath, Suman Guha, Arijit Veer Surendra Sai Univ Technol Burla Dept Elect Engn Sambalpur 768018 India Natl Inst Technol Rourkela Dept Elect Engn Sundargarh 769008 India Univ Nevada Reno NV 89512 USA

AC microgrids, being cyber-physical systems, rely heavily on communication networks to achieve their control objectives. However, the possibility of communication delays due to protocol-based errors, external noise addition, etc., raises suspicion on the reliability of communication infrastructure. This, in turn, makes the control architecture of the microgrid look complex and vulnerable. To address this problem, this work designs a consensus-based distributed secondary controller within the hierarchical control structure to achieve improved voltage and frequency regulation along with active and reactive power sharing while accounting for time-varying communication delays. Also, this work proposes a gain scheduling control in the secondary control that can effectively reduce the effects of communication delay over the performance of the hierarchical control structure. Our results show that this can efficiently eliminate system vulnerability to large values of time-varying delays. The efficacy of the proposed controller is also investigated in real-time with the help of a hardware-in-loop (HIL) setup.

关键词： Delays Voltage control Microgrids Reactive power Topology Robustness Network topology Mathematical models Frequency control Stability analysis consensus algorithm gain scheduling control graph theory microgrid proportional integral control secondary control

来源：评论

学校读者我要写书评

暂无评论

IDHG-ECC-integrated Diffie Hellman Galois-elliptic-curve cryptography for enhancing EHR data security

引用

JOURNAL OF INFORMATION SECURITY AND APPLICATIONS 2025年 90卷

作者： Jyothy, S. T. Sarvagya, Mrinal REVA Univ Sch Elect & Commun Engn Bangalore 560064 Karnataka India

Electronic Health Records (EHRs), which are used in modern healthcare systems, store private medical histories for a large number of people. A strong security architecture is required to guarantee patient privacy within EHR databases due to the importance of preserving this personal data. Improving data security and patient privacy during the transfer of sensitive information across healthcare providers for diagnostic purposes is the main emphasis of this work. To enhance the security of electronic health record data, this article proposes a new approach that combines a decentralized, secure blockchain paradigm with a lightweight cryptosystem. The proposed workflow starts with gathering electronic health record data from databases and initializing user transaction information to facilitate communication across various nodes. Public and private keys are produced via an elliptic scheme to enhance the security of health data. Then, medical data is encrypted and decrypted using Integrated Diffie-Hellman Galois-Elliptic-curve Cryptography (IDHG-ECC). The encrypted data is further strengthened by using a consensus process known as Affinity-Propagation encased Practical Byzantine Fault Tolerance (AP-PBFT). Extra security is provided by storing the encrypted data on the off-chain Inter Planetary File System (OIPFS) blockchain. In the evaluation, the proposed model attains efficient encryption and decryption times of 7.88 s and 1.80 s, respectively, with a quick uploading time of 0 .09s. It achieves high transaction throughput (78,288 TPS) with low latency (0.71 s), while read throughput is 137.54 MB/s with minimal latency (0.01 s). CPU utilization is moderate at 20.70%, and memory utilization is 54.00%, ensuring balanced resource management for optimal performance.

关键词： Diffie-Hellman Elliptic-curve cryptography consensus algorithm Electronic health records Off-chain inter planetary File system Affinity-propagation approach

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：