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

SNARK and account-model based verifiable sharding scheme

学校读者我要写书评

暂无评论

SNARK and account-model based verifiable sharding scheme

Computer and Information Processing Technology (ISCIPT), International Symposium on

作者： Minghan Lian Jiangfeng Xu Yannian Wang School of Computer and Artificial Intelligence Zhengzhou University Zhengzhou China

ISBN: (数字)9798350388404

ISBN: (纸本)9798350388411

Sharding is the core technology to address scalability issues in blockchain, and resolving the external consensus problem is one of the major challenges in sharding technologies. At present, all account-model based sharding schemes are solved by extending consensus algorithms to address external consensus issues. This approach increases the complexity of consensus and makes the scheme dependent on consensus algorithms. The introduction of overly complex logic in consensus may make it difficult to prove correctness, leading to increased security risks. Schemes dependent on consensus algorithms also limit the usage scope. Therefore, SNARK and account-model based verifiable sharding scheme, SVSS, has been proposed. This scheme decouples from consensus algorithms and partitions state base on account-model. It provides proofs for the state changes of in-shard accounts using KZG state trees and SNARK, achieves consistency across the blockchain network using the sequencer- aggregator model. Theoretical and experimental analysis demonstrates that SVSS can achieve cross-shard transaction regulation and block verification without state, improving the flexibility of consensus algorithm selection and applicability to sidechains and smaller-scale blockchain networks that require node with light weight validation and consensus algorithm choice.

关键词： Sharding Systems operation Scalability Smart contracts consensus algorithm Throughput Regulation

Revolutionizing Healthcare 4.0: The Fusion of Blockchain and IoT in Medicine

学校读者我要写书评

暂无评论

Revolutionizing Healthcare 4.0: The Fusion of Blockchain and...

International Conference on Reliability, Infocom Technologies and Optimization (ICRITO) (Trends and Future Directions)

作者： Vijaita Kashyap Rakesh Ahuja Shivani Gautam Ashok Kumar Chitkara University Institute of Engineering and Technology Chitkara University Punjab India Chitkara University School of Engineering & Technology Chitkara University Himachal Pradesh India School of Computer Application Lovely Professional University Phagwara Punjab India

ISBN: (数字)9798350350357

ISBN: (纸本)9798350350364

The use of Blockchain technology (BCT) has become widespread across several scientific fields and is projected to see substantial growth in the near future. Blockchain (BC) functions as a digital record-keeping system, enabling transactions to occur in a decentralized manner. BC applications are being developed in a variety of areas, including agriculture, healthcare, and the Internet of Things. BCT has recently sparked significant interest in the healthcare industry. It provides trustworthy and convenient services, and the utmost importance to recognise and address the security issues and obstacles that are linked to this innovative approach. This study introduces the Proof-of-Health (PoH) consensus method, which improves the security and efficiency of the integrated system. It also provides a contemporary analysis and overview of the numerous challenges and unresolved issues that conventional security methods have introduced to smart healthcare. Here, the analysis of loT and BC implementation with some different factors is shown. This study also explores the many components used in BC methodologies and incorporates BCT as a feasible security measure. It evaluates possible obstacles in sectors such as healthcare, agriculture, and numerous other domains.

关键词： Reviews Medical services consensus algorithm Market research Agriculture Blockchains Security

Distributed Nonlinear Filtering using Triangular Transport Maps

学校读者我要写书评

暂无评论

Distributed Nonlinear Filtering using Triangular Transport M...

American Control Conference (ACC)

作者： Daniel Grange Ricardo Baptisa Amirhossein Taghvaei Allen Tannenbaum Sean Phillips Department of Computer Science Stony Brook University NY Department of Computing and Mathematical Sciences California Insitute of Technology Pasadena CA Department of Aeronautics and Astronautics University of Washington Seattle WA Space Vehicles Directorate Air Force Research Laboratory Kirtland AFB NM

ISBN: (数字)9798350382655

ISBN: (纸本)9798350382662

The distributed filtering problem sequentially estimates a global state variable using observations from a network of local sensors with different measurement models. In this work, we introduce a novel methodology for distributed nonlinear filtering by combining techniques from transportation of measures, dimensionality reduction, and consensus algorithms. We illustrate our methodology on a satellite pose estimation problem from a network of direct and indirect observers. The numerical results serve as a proof of concept, offering new venues for theoretical and applied research in the domain of distributed filtering.

关键词： Dimensionality reduction Satellites Filtering Pose estimation Transportation consensus algorithm Observers

Fast Reroute with Highly Connected Routes Based on Maximum Flow Evaluation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Okida, Leon Rosa, Maverson E.S. Duarte, Elias P. Curitiba Brazil

Fault-tolerant routing allows the selection of alternative routes to the destination after the route being used fails. Fast Reroute (FRR) is a proactive strategy through which the protocol pre-configures backup routes that are activated when needed. In this work, we propose the MaxFlowRouting algorithm that employs maximum flow evaluation as well as the route size to select routes that are highly connected. The main advantage of the proposed algorithm is that if any component of such a route fails, there are more alternative paths to the destination in comparison with the route computed with Dijkstra’s shortest path algorithm. Simulation results are presented in which we compare the two algorithms (Dijkstra’s and MaxFlowRouting) for multiple different random graphs (including Erdos-Renyi, Barábasi-Albert, and Watts-Strogatz) and also for the topologies of some of the most important Internet backbones of the U.S.A., Europe, Brazil, and Japan: Internet2, Géant, RNP, and Wide. © 2024, CC BY.

关键词： consensus algorithm

CURVES WITH PRESCRIBED RATIONAL POINTS

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Santicola, Katerina Mathematics Institute University of Warwick CV4 7AL United Kingdom

Given a smooth curve C-Q with genus ≥ 2, we know by Faltings' Theorem that C(Q) is finite. Here we ask the reverse question: given a finite set of rational points S ⊆ Pn(Q), does there exist a smooth curve C-Q contained in Pn such that C(Q) = S? We answer this question in the affirmative by providing an effective algorithm for constructing such a curve. © 2024, CC BY.

关键词： consensus algorithm

UNIFORM-IN-TIME ESTIMATES FOR MEAN-FIELD TYPE SDES AND APPLICATIONS

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Bao, Jianhai Hao, Jiaqing Center for Applied Mathematics Tianjin University Tianjin300072 China

Via constructing an asymptotic coupling by reflection, in this paper we establish uniform-in-time estimates on probability distances for mean-field type SDEs, where the drift terms under consideration are dissipative merely in the long distance. As applications, we (i) explore the long time probability distance estimate between an SDE and its delay version;(ii) investigate the issue on uniform-in-time propagation of chaos for McKean-Vlasov SDEs, where the drifts might be singular with respect to the spatial variables;(iii) tackle the discretization error bounds in an infinite-time horizon for stochastic algorithms (e.g. backward/tamed/adaptive Euler-Maruyama schemes as three typical candidates) associated with McKean-Vlasov SDEs. Copyright © 2024, The Authors. All rights reserved.

关键词： consensus algorithm

Engineering Hypergraph b-Matching algorithms

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Großmann, Ernestine Joos, Felix Reinstädtler, Henrik Schulz, Christian Heidelberg University Germany

Recently, researchers have extended the concept of matchings to the more general problem of finding b-matchings in hypergraphs broadening the scope of potential applications and challenges. The concept of b-matchings, where b is a function that assigns positive integers to the vertices of the graph, is a natural extension of matchings in graphs, where each vertex v is allowed to be matched to up to b(v) edges, rather than just one. The weighted b-matching problem then seeks to select a subset of the hyperedges that fulfills the constraint and maximizes the weight. In this work, we engineer novel algorithms for this generalized problem. More precisely, we introduce exact data reductions for the problem as well as a novel greedy initial solution and local search algorithms. These data reductions allow us to significantly shrink the input size. This is done by either determining if a hyperedge is guaranteed to be in an optimum b-matching and thus can be added to our solution or if it can be safely ignored. Our iterated local search algorithm provides a framework for finding suitable improvement swaps of edges. Experiments on a wide range of real-world hypergraphs show that our new set of data reductions are highly practical, and our initial solutions are competitive for graphs and hypergraphs as well. Copyright © 2024, The Authors. All rights reserved.

关键词： consensus algorithm

Optimizing Genetic algorithms Using the Binomial Distribution

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Cicirello, Vincent A. Computer Science School of Business Stockton University 101 Vera King Farris Dr GallowayNJ United States

Evolutionary algorithms rely very heavily on randomized behavior. Execution speed, therefore, depends strongly on how we implement randomness, such as our choice of pseudorandom number generator, or the algorithms used to map pseudorandom values to specific intervals or distributions. In this paper, we observe that the standard bit-flip mutation of a genetic algorithm (GA), uniform crossover, and the GA control loop that determines which pairs of parents to cross are all in essence binomial experiments. We then show how to optimize each of these by utilizing a binomial distribution and sampling algorithms to dramatically speed the runtime of a GA relative to the common implementation. We implement our approach in the open-source Java library Chips-n-Salsa. Our experiments validate that the approach is orders of magnitude faster than the common GA implementation, yet produces solutions that are statistically equivalent in solution *** Codes 68W50, 68T05, 68T20, 68W20 Copyright © 2024, The Authors. All rights reserved.

关键词： consensus algorithm

Convergence Rates of Decentralized Gradient Dynamics over Cluster Networks: Multiple-Time-Scale Lyapunov Approach

学校读者我要写书评

暂无评论

Convergence Rates of Decentralized Gradient Dynamics over Cl...

IEEE Conference on Decision and Control

作者： Amit Dutta Nila Masrourisaadat Thinh T. Doan Bradley Department of Electrical and Computer Engineering Virginia Tech Blacksburg VA

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

We present a new analysis for the performance of decentralized consensus-based gradient (DCG) dynamics for solving optimization problems over a cluster network of nodes. This type of network is composed of a number of densely connected clusters with sparse connections between them. Decentralized consensus algorithms over cluster networks have been observed to constitute two-time-scale dynamics, where information within any cluster is mixed much faster than the one across clusters. In this paper, we present a novel analysis to study the convergence rates of the DCG methods over cluster networks. In particular, we show that these methods converge at a rate ln(T)/T and only scale with the number of clusters, which is relatively small to the size of the network. Our result improves the existing analysis when applied to study the rates of DCG over cluster networks, where these rates are shown to scale with the size of the network. The key technique in our analysis is to consider a novel Lyapunov function that captures the multiple time-scale dynamics of DCG in cluster networks. We also illustrate our theoretical results by a number of numerical simulations using DCG dynamics over different cluster networks.

关键词： Heuristic algorithms consensus algorithm Numerical simulation Optimization Convergence Lyapunov methods