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

European Journal of Operational Research 2025年第1期326卷 13-27页

作者： Creemers, Stefan Voie du Roman Pays 34 Louvain-la-NeuveB-1348 Belgium

To find one of the M target entries in an unstructured database that has N entries, Grover's algorithm performs [Formula presented][Formula presented] iterations. In each iteration, a function is called that evaluates whether an entry is a target entry. Compared to a classical procedure, that requires [Formula presented] evaluations, Grover's algorithm achieves a quadratic speedup. This quadratic speedup, combined with its general applicability as a search algorithm, have made Grover's algorithms one of the most important (quantum) algorithms available today. A study to improve its runtime is more than justified. For this purpose, we investigate two speedup strategies: (1) reducing the number of iterations that are performed in each run of Grover's algorithm and (2) partitioning the database. For each of these strategies, we not only execute Grover's algorithm in parallel, but also explore the possibility to execute Grover's algorithm in series on a single Quantum Processing Unit (QPU) as well as on multiple QPUs. For each combination of execution mode (serial, parallel, and serial/parallel) and speedup strategy, we show how to obtain optimal policies using closed-form expressions and a gradient-descent procedure. For a single QPU we obtain a speedup factor of 1.1382 when compared to a textbook implementation of Grover's algorithm. If multiple QPUs are at our disposal, we obtain a speedup factor of at most 1.1382Q, where Q denotes the number of QPUs. In addition, we show that the dominant policies that minimize the expected number of Grover iterations also minimize the expected number of iterations that are performed per qubit. © 2025 Elsevier B.V.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Practical Byzantine improved algorithm based on node-independent validation

引用

COMPUTER NETWORKS 2025年 265卷

作者： Li, Anqi Zhang, Quan Xu, Xin Yao, Yingbiao Hangzhou Dianzi Univ Commun Engn Hangzhou 310000 Zhejiang Peoples R China

The PBFT consensus algorithm solves the Byzantine node tolerance problem of Raft and Paxos consensus algorithms, but the three-stage confirmation leads to its poor scalability and high communication latency. In response to above problems, this paper proposes an improved PBFT algorithm based on node-independent validation, briefly as V-PBFT. V-PBFT divides nodes into a double layer structure with multiple leaders, and sets up global validation nodes, intra-group followers, suspicious nodes and malicious nodes. Firstly, V-PBFT adopts the PBFT protocol to reach consensus among leaders. Validation nodes guarantee the consistency of the state of leaders. Then, leaders broadcast Intra-consensus messages to intra-group followers. Secondly, validation nodes broadcast Verify messages to all nodes except malicious nodes and leaders. The messages from the leader and validation nodes are mutually verified, enabling followers to judge the correctness of client requests. Finally, the credit value is set for followers to reduce the probability on malicious view-changes. Experimental results show that V-PBFT reduces the communication complexity of PBFT from the quadratic level to the linear level and thus its communication latency is significantly reduced.

关键词： Blockchain Byzantine fault tolerance consensus algorithm Credit value election Node validation

来源：评论

学校读者我要写书评

暂无评论

DISTRIBUTED EXTENDED STOCHASTIC GRADIENT algorithm FOR JOINT IDENTIFICATION OF SYSTEM PARAMETERS AND NOISE MODEL PARAMETERS

引用

SIAM Journal on Control and Optimization 2025年第1期63卷 650-675页

作者： Gan, Die Yan, Ren Chen, Shuning Liu, Zhixin College of Artificial Intelligence Nankai University Tianjin China Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Chinese Academy of Sciences School of Mathematical Sciences University of Chinese Academy of Sciences Beijing100190 China

In this paper, we study the distributed identification problem of dynamic systems described by stochastic regression models with colored noise. To deal with challenges brought by the colored noise, we provide estimates for the unknown noise over a previous time period, and incorporate them with observed signals to construct extended regression vectors. Based on this, we develop a distributed extended stochastic gradient algorithm to estimate unknown parameter matrices by integrating the diffusion strategy of extended regression vectors with the consensus strategy of neighbors' estimates. We introduce cooperative nonpersistent excitation conditions to reflect the temporal and spatial union information condition, under which the almost sure convergence of the proposed distributed algorithm is established. Our results are obtained without assuming the independence, stationarity or persistent excitation conditions for the regressors and the Gaussian property for the system noises. Finally, numerical results are provided to verify the effectiveness of our proposed algorithm. © by SIAM.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Decision-making algorithm based on the energy of interval-valued hesitant fuzzy soft sets

引用

Neural Computing and Applications 2025年 1-21页

作者： Stojanović, Nenad Laković, Maja Djurović, Ljubica Faculty of Science University of Kragujevac 34000 Radoja Domanovića 12 Kragujevac Serbia

Interval-valued hesitant fuzzy soft sets, a powerful tool for data modeling, have been the focus of numerous studies. In addition to their various applications, examining the properties and characteristics of these structures from a theoretical mathematical perspective enables more efficient utilization in real-world problems. The primary objective of this research is to define a numerical characteristic of an interval-valued hesitant fuzzy soft set, analogous to the energy of a graph and the energy of a fuzzy soft set. The motivation for introducing this numerical characteristic lies in its potential to develop a decision-making algorithm that outperforms existing approaches addressing the same problem. The energy of a graph, as well as the energy of a fuzzy soft set, is defined as a norm function obtained by summing the singular values of the corresponding representation matrix. In optimization problems, this sum of singular values is known as the nuclear norm, which serves as the basis for introducing the notion of energy in interval-valued hesitant fuzzy soft sets. The results of the proposed algorithm are compared in this paper with those of various existing algorithms designed to solve the same problem. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Memetic algorithm for Maximizing K-coverage and K-Connectivity in Wireless Sensor Network

Informatica (Slovenia)

引用

Informatica (Slovenia) 2025年第1期49卷 7-18页

作者： Thi, Hanh Nguyen Van Duc, Cuong Duc, Chinh Tran Minh, Hieu Ha Van, Son Nguyen Van, Quan La Faculty of Interdisciplinary Digital Technology PHENIKAA University Yen Nghia Ha Dong Hanoi12116 Viet Nam Hanoi University of Science and Technology Hanoi Viet Nam Faculty of Computer Science PHENIKAA University Yen Nghia Ha Dong Hanoi12116 Viet Nam

The rapid growth of IoT has enabled diverse applications using Wireless Sensor Networks across various fields. A significant challenge in Wireless Sensor Networks is the efficient deployment of sensors to ensure coverage and connectivity. Effective coverage allows continuous target tracking and data collection, while connectivity ensures data transmission to the base station. In this paper, we address the challenge of maximizing the number of targets satisfying K-coverage and K-connectivity, where each target is tracked by K sensors and has K transmission paths to the base station. We propose a two-phase methodology to tackle this challenge. The first phase enhances the Greedy algorithm to solve the K-coverage problem. The second phase addresses the K-connectivity problem using Memetic algorithms augmented by an efficient local search mechanism called PMA. We evaluate the algorithm on various datasets and compare it with baseline methods, including Greedy and Prim-based with the withdrawal strategy (PWS). Our results show that the proposed PMA with a robust local search outperforms alternative algorithms, with improvements exceeding 10% to 15% compared to the baseline methods. Additionally, we validate the performance of the proposed method using a real-world dataset and outline plans for further enhancements in the near future. © 2025 Slovene Society Informatika. All rights reserved.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Practical Parallel algorithms for Non-Monotone Submodular Maximization

引用

Journal of Artificial Intelligence Research 2025年 82卷 39-75页

作者： Cui, Shuang Han, Kai Tang, Jing Li, Xueying Zhiyuli, Aakas Li, Hanxiao School of Computer Science and Technology Soochow University Jiangsu Suzhou China The Hong Kong University of Science and Technology China Alibaba Group Zhejiang Hangzhou China Qingdao University of Science and Technology Shandong Qingdao China

Submodular maximization has found extensive applications in various domains within the field of artificial intelligence, including but not limited to machine learning, computer vision, and natural language processing. With the increasing size of datasets in these domains, there is a pressing need to develop efficient and parallelizable algorithms for submodular maximization. One measure of the parallelizability of a submodular maximization algorithm is its adaptive complexity, which indicates the number of sequential rounds where a polynomial number of queries to the objective function can be executed in parallel. In this paper, we study the problem of non-monotone submodular maximization subject to a knapsack constraint, and propose a low-adaptivity algorithm achieving an (1/8 − ϵ)approximation with practical Õ(n) query complexity. Moreover, we also propose the first algorithm with both provable approximation ratio and sublinear adaptive complexity for the problem of non-monotone submodular maximization subject to a k-system constraint. As a by-product, we show that our two algorithms can also be applied to the special case of submodular maximization subject to a cardinality constraint, and achieve performance bounds comparable with those of state-of-the-art algorithms. Finally, the effectiveness of our algorithms is demonstrated by extensive experiments on real-world applications. ©2025 The Authors.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

An efficient collocation algorithm for third order non-linear Emden–Fowler equation

引用

Soft Computing 2025年第3期29卷 1767-1788页

作者： Alam, Mohammad Prawesh Khan, Arshad Department of Mathematics Jaypee Institute of Information Technology Noida62 201319 India Department of Mathematics Jamia Millia Islamia New Delhi110025 India

The study presents a novel algorithm for solving third-order non-linear equations (Emden–Fowler type), which can be applied to various physical models. The algorithm uses a quintic trigonometric B-spline collocation method and a quasilinearization technique to avoid the non-linearity term in the equation. The study established a comprehensive error analysis for the proposed algorithm and proved that it has fourth order, i.e., (O(h4)) convergent. The algorithm’s ability to handle singular behavior at the point x=0 and its faster rate of convergence exhibit a promising approach to solving such problems. The study also validates the theoretical results through numerical experiments and shows that the proposed algorithm has a faster rate of convergence in comparison to the existing methods. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Performance optimization of agricultural traceability blockchain based on sharding technology

引用

QUALITY ASSURANCE AND SAFETY OF CROPS & FOODS 2025年第2期17卷 213-231页

作者： Guo, Xiangdong Zhang, Yuting Yao, Jingfa Teng, Guifa Hebei Agr Univ Coll Mechatron & Elect Engn Baoding 071001 Peoples R China Hebei Agr Univ Coll Informat Sci & Technol Baoding 071001 Peoples R China Hebei Software Inst Software Engn Dept Baoding 071000 Peoples R China Hebei Coll Intelligent Interconnect Equipment & Mu Big Data Applicat Technol Res Dev Ctr Baoding 071000 Peoples R China Hebei Key Lab Agr Big Data Baoding 071001 Peoples R China Hebei Digital Agr Ind Technol Res Inst Shijiazhuang 056400 Peoples R China

With the increasing global concerns over food safety, ensuring the transparency and traceability of agricultural products throughout their entire production-to-consumption process has become a key issue of societal interest. Blockchain technology, due to its decentralized, immutable, and transparent nature, offers a novel solution for the traceability of agricultural products. However, traditional blockchain systems encounter performance bottlenecks when handling large-scale agricultural data, particularly under conditions of high data volume and frequent transactions, where issues such as processing delays and insufficient throughput commonly arise. Sharding technology, a critical approach for improving blockchain performance, has the potential to significantly enhance system throughput and response time by partitioning the blockchain network into multiple independent shards for parallel processing. However, the application of sharding technology in agricultural traceability systems faces several challenges, including shard load imbalance, communication delays between shards, and inefficiencies in consensus algorithms. To address these challenges, two innovative approaches were proposed in this study: firstly, to address the issue of uneven load distribution in sharding, a jump hash sharding algorithm was designed to optimize shard allocation strategies, thereby improving resource utilization and processing efficiency;secondly, to tackle the performance bottleneck of consensus algorithms, an enhanced consensus algorithm was introduced to improve consensus efficiency while maintaining security. Experimental results demonstrated that the proposed method significantly outperformed traditional blockchain-based traceability systems in terms of performance and scalability, providing a more efficient and reliable technological solution for the application of blockchain technology in the agricultural sector. This research not only offers a more efficient technological solu

关键词： agricultural product traceability blockchain consensus algorithm hump hash sharding algorithm performance optimization sharding technology

来源：评论

学校读者我要写书评

暂无评论

Lightweight Blockchain for Data Integrity and Traceability in IoT Networks

引用

IEEE ACCESS 2025年 13卷 81105-81117页

作者： Garcia, Laura Cancimance, Carlos Asorey-Cacheda, Rafael Zuniga-Canon, Claudia-Liliana Garcia-Sanchez, Antonio-Javier Garcia-Haro, Joan Univ Politecn Cartagena Dept Informat & Commun Technol Cartagena 30202 Spain Univ Santiago Cali Res Grp COMBA I D Cali 760035 Colombia

Data integrity and traceability are important challenges to provide security in the Internet of Things (IoT) networks, which are often vulnerable to data manipulation attacks due to their use of low-resource devices and wireless communication technologies. In this regard, blockchain is a promising solution to enhance IoT security, but the implementation of a conventional blockchain requires high computational and network connectivity resources that are not compatible with IoT networks. In this paper, we propose a lightweight blockchain for data integrity and traceability in IoT networks that adapts the Distributed Ledger Technology (DLT) feature of blockchain to the LoRaWAN wireless communication protocol. Our proposal offers data integrity without the need for complex consensus algorithms or cryptographic operations. We also have designed and implemented a logical LoRaWAN P2P topology that enables communication between the IoT nodes which comprise LoRaWAN's characteristic star topology. Finally, we evaluate our proposal and demonstrate its feasibility and performance in terms of data traceability, and network overhead.

关键词： Blockchains Internet of Things LoRaWAN Proposals Performance evaluation Security Distributed ledger Data integrity Wireless communication consensus algorithm Blockchain distributed ledger technology

来源：评论

学校读者我要写书评

暂无评论

Edge connectivity of a neutrosophic graph

引用

Neutrosophic Sets and Systems 2025年 81卷 729-740页

作者： Tripathy, Aparna Panada, Amaresh Chandra Behera, Siva Prasad Mohanty, Bhabani S. Department of Mathematics C.V. Raman Global University Odisha Bhubaneswar752054 India Department of Statistics and Applied Mathematics Central University of Tamil Nadu India

Neutosophic graphs are an extension of fuzzy and intuitionistic fuzzy graphs by including the uncertainty, vagueness, and indeterminacy that are normal in the real world. This paper looks into the edge connectivity of a neutrosophic graph, which is a basic parameter that shows how strong and fault-tolerant networks are that are modelled by these graphs. Edge connectivity, which is the smallest number of edges that need to be taken away from a graph to make it trivial or disconnected, is a key concept in figuring out how strong and resilient networks are in many situations. This paper also addresses computational challenges related to determining edge connectivity in neutrosophic graphs. We develop efficient algorithms that minimize computational overhead and ensure accuracy in identifying the critical edge sets. We analyze the performance of these algorithms through both theoretical complexity assessments and empirical evaluations on benchmark datasets. Some of the most important things that the study found were critical edges that, when removed, have a big effect on how connected the graph is and how indeterminacy affects the strength of networks. The research underscores the importance of incorporating neutrosophic parameters into graph connectivity studies to better model and analyse systems characterized by uncertainty and partial knowledge. © 2025, University of New Mexico. All rights reserved.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：