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

Distributed Path Compression for Piecewise Linear Morse-Smale Segmentations and Connected Components

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Will, Michael Lukasczyk, Jonas Tierny, Julien Garth, Christoph RPTU Kaiserslautern-Landau Germany CNRS Sorbonne Université France

This paper describes the adaptation to a distributed computational setting of a well-scaling parallel algorithm for computing Morse-Smale segmentations based on path compression. Additionally, we extend the algorithm to efficiently compute connected components in distributed structured and unstructured grids, based either on the connectivity of the underlying mesh or a feature mask. Our implementation is seamlessly integrated with the distributed extension of the Topology ToolKit (TTK), ensuring robust performance and scalability. To demonstrate the practicality and efficiency of our algorithms, we conducted a series of scaling experiments on large-scale datasets, with sizes of up to 40963 vertices on up to 64 nodes and 768 cores. Copyright © 2024, The Authors. All rights reserved.

关键词： consensus algorithm

A computational method for left-adjointness

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Forest, Simon Aix–Marseille Univ CNRS LIS Marseille France

In this work, we investigate an effective method for showing that functors between categories are left adjoints. The method applies to a large class of categories, namely locally finitely presentable categories, which are ubiquitous in practice and include standard examples like Set, Grp, etc. Our method relies on a known description of these categories as orthogonal subclasses of presheaf categories. The functors on which our method applies are the ones that can be presented as particular profunctors, called Kan models in this context. The method for left-adjointness then relies on computing that a particular criterion is satisfied. From this method, we also derive another method for showing that a category is cartesian closed. As proofs of concept and effectivity, we give a concrete implementation of the structures and of the left-adjointness criterion in OCaml and apply it on several *** Codes 18C35 © 2024, CC BY.

关键词： consensus algorithm

Replicable Uniformity Testing

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Liu, Sihan Ye, Christopher University of California La Jolla San DiegoCA United States

Uniformity testing is arguably one of the most fundamental distribution testing problems. Given sample access to an unknown distribution p on [n], one must decide if p is uniform or Ε-far from uniform (in total variation distance). A long line of work established that uniformity testing has sample complexity Θ(√nΕ−2). However, when the input distribution is neither uniform nor far from uniform, known algorithms may have highly non-replicable behavior. Consequently, if these algorithms are applied in scientific studies, they may lead to contradictory results that erode public trust in science. In this work, we revisit uniformity testing under the framework of algorithmic replicability [STOC’22], requiring the algorithm to be replicable under arbitrary distributions. While replicability typically incurs a ρ−2 factor overhead in sample complexity, we obtain a replicable uniformity tester using only Õ(√nΕ−2ρ−1) samples. To our knowledge, this is the first replicable learning algorithm with (nearly) linear dependence on ρ. Lastly, we consider a class of "symmetric" algorithms [FOCS’00] whose outputs are invariant under relabeling of the domain [n], which includes all existing uniformity testers (including ours). For this natural class of algorithms, we prove a nearly matching sample complexity lower bound for replicable uniformity testing. © 2024, CC BY.

关键词： consensus algorithm

Comparative Analysis of Blockchain Platforms for Adapting Proof of Authentication in IoT

学校读者我要写书评

暂无评论

Comparative Analysis of Blockchain Platforms for Adapting Pr...

International Conference on Advanced Communication Technologies and Networking (CommNet)

作者： Mohamed Aghroud Yassin Elgountery Mohamed Oualla Lahcen El Bermi Abdelalim Sadiq Department Computer Science GLISI Team FST Errachidia My Ismail University Errachidia Morocco Department of Computer Science Faculty of Science LaRI Laboratory Ibn Tofail University Kenitra Morocco

ISBN: (数字)9798350367027

ISBN: (纸本)9798350367034

Blockchain technology, a decentralized and tamper-resistant framework, has gained significant attention for its potential to enhance trust, transparency, and security in digital interactions. When integrated with the Internet of Things (IoT)—a network of interconnected devices that exchange data autonomously—it unlocks new opportunities for secure, scalable, and efficient systems. Selecting the right blockchain platform is crucial to developing robust blockchain-based applications tailored to IoT’s unique demands. This paper provides a comparative study of five leading blockchain platforms: Multichain, Hyperledger Besu, Open Ethereum, Go Ethereum, and Substrate. The evaluation focuses on their adaptability to IoT environments and their ability to implement proof of authentication (PoAh) as a consensus algorithm. By examining key aspects such as scalability, flexibility, interoperability, resource efficiency, and ease of integration, this study aims to identify the most suitable platform for IoT-centric blockchain solutions. The findings highlight the strengths and limitations of each platform, offering practical insights to guide the selection of a blockchain platform optimized for IoT applications and consensus algorithm proof of authentication.

关键词： Distributed ledger Scalability Authentication consensus algorithm Blockchains consensus protocol Internet of Things Security Substrates Interoperability

Bregman-divergence-based Arimoto-Blahut algorithm

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Hayashi, Masahito School of Data Science The Chinese University of Hong Kong Longgang District Shenzhen518172 China Futian District Shenzhen518048 China Graduate School of Mathematics Nagoya University Chikusa-ku Nagoya464-8602 Japan

We generalize the generalized Arimoto-Blahut algorithm to a general function defined over Bregman-divergence system. In existing methods, when linear constraints are imposed, each iteration needs to solve a convex minimization. Exploiting our obtained algorithm, we propose a minimization-free-iteration algorithm. This algorithm can be applied to classical and quantum rate-distortion theory. We numerically apply our method to the derivation of the optimal conditional distribution in the rate-distortion theory. © 2024, CC BY.

关键词： consensus algorithm

Leveraging Blockchain for Secure IoT Device Communication in Smart Cities

学校读者我要写书评

暂无评论

Leveraging Blockchain for Secure IoT Device Communication in...

IoT, Communication and Automation Technology (ICICAT), International Conference on

作者： Saif Obaid Ashish Sharma S. Muthu Balaji V. Mangaiyarkarasi Nagaraju Krishna Chythanya Praveenkumar C Department of Computers Techniques Engineering College of Technical Engineering The Islamic University Najaf Iraq Department of Computer Engineering & Applications GLA University Mathura Department of ECE CMR College of Engineering & Technology Department of ECE New Prince Shri Bhavani College of Engineering and Technology Chennai Tamil Nadu India Department of CSE GRIET Hyderabad Telangana India Department of EEE Sri Ramakrishna Engineering College Coimbatore

ISBN: (数字)9798350368109

ISBN: (纸本)9798350368116

In this paper we focus on utilising blockchain for IoT devices in smart cities to meet the major issues including security, scalability and energy consumption. A permissioned blockchain architecture with a light-weight consensus model is discussed for implementing a Decentralized and Secure IoT Internet. It encompasses data gathering from different IoT devices, design of the blockchain network and assessment of its performance in a simulated smart city context. Static analysis show that the proposed solution provides protection against various types of IoT attacks and has a similar performance to the traditional networks, with latencies and energy consumption only slightly increased. From the works done, the proposal that blockchain has the potential to offer security and efficiency in the IoT communications in future smart city applications emerges.

关键词： Performance evaluation Energy consumption Smart cities Scalability Switched mode power supplies consensus algorithm Static analysis Blockchains Internet of Things Security

学校读者我要写书评

暂无评论

Isometry pursuit

arXiv 2024年

作者： Koelle, Samson Meila, Marina Amazon United States Department of Statistics University of Washington United States

Isometry pursuit is a convex algorithm for identifying orthonormal column-submatrices of wide matrices. It consists of a novel normalization method followed by multitask basis pursuit. Applied to Jacobians of putative coordinate functions, it helps identity isometric embeddings from within interpretable dictionaries. We provide theoretical and experimental results justifying this method. For problems involving coordinate selection and diversification, it offers a synergistic alternative to greedy and brute force search. © 2024, CC BY.

关键词： consensus algorithm

Tilt correction method of pointer instrument

学校读者我要写书评

暂无评论

Tilt correction method of pointer instrument

Chinese Automation Congress (CAC)

作者： Zhuocheng Hou Hua Ouyang Xin Hu College of Electrical Engineering Naval University of Engineering Wuhan China

ISBN: (纸本)9781665426480

In the process of robot inspection of pointer instrument in substation, the image acquired by camera will bring reading error due to the tilt of dial. This paper proposes an instrument correction method based on feature registration. Firstly, the contour feature of instrument image is extracted by edge detection, and then corners are drawn on the contour feature map of instrument, and the image of instrument to be corrected is compared with the template instrument image At the same time, by using random sampling consensus algorithm (RANSAC) to remove the mismatched points, the corners are accurately matched, and the projection transformation matrix between the instrument image block to be registered and the template instrument image is solved. The projection transformation matrix is applied to the instrument image to be corrected for tilt correction. The experimental results show that the proposed method can better realize the tilt correction of pointer instrument in the process of patrol inspection.

关键词： Substations Automation Instruments Image edge detection Robot vision systems consensus algorithm Inspection

Implementation of Energy efficient Blockchain using RUST

学校读者我要写书评

暂无评论

Implementation of Energy efficient Blockchain using RUST

International Conference on Parallel Distributed and Grid Computing (PDGC)

作者： Amit Chaurasia Dhruv Rajesh Krishnamachari Department of Computer & Communication Engineering Manipal University Jaipur Jaipur Rajasthan India

ISBN: (纸本)9781665454025

Blockchain technology has become a popular technology since the introduction of WWW. With the introduction of Blockchain 2.0 and Blockchain 3.0 the limited applications of Blockchain increased exponentially. The efficient implementation of blockchain requires a lot of energy and computational resources, wherein the backend of the consensus algorithm implementation makes it power hungry. In this paper, we have introduced a new programming environment for the implementation of a consensus algorithm with requires less power and computational devices. The RUST-based implementation of the consensus algorithm makes it more power efficient

关键词： Computer languages consensus algorithm Programming Grid computing Energy efficiency Blockchains Computational efficiency