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

AsyncSC: An Asynchronous Sidechain for Multi-Domain data Exchange in Internet of Things

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Yang, Lingxiao Dong, Xuewen Wan, Zhiguo Gao, Sheng Tong, Wei Lu, Di Shen, Yulong Du, Xiaojiang The School of Computer Science and Technology Xidian University The Engineering Research Center of Blockchain Technology Application and Evaluation Ministry of Education China The Shaanxi Key Laboratory of Blockchain and Secure Computing Xi'An710071 China The Zhejiang Lab Hangzhou311121 China The School of Information Central University of Finance and Economics Beijing100081 China The School of Information Science and Engineering Zhejiang Sci-Tech University Hangzhou310018 China The School of Computer Science and Technology Xidian University China The Shaanxi Key Laboratory of Network and System Security Xi'An710071 China The School of Engineering and Science Stevens Institute of Technology Hoboken07030 United States

Sidechain techniques improve blockchain scalability and interoperability, providing decentralized exchange and cross-chain collaboration solutions for Internet of Things (IoT) data across various domains. However, current state-of-the-art (SOTA) schemes for IoT multi-domain data exchange are constrained by the need for synchronous networks, hindering efficient cross-chain interactions in discontinuous networks and leading to suboptimal data exchange. In this paper, we propose AsyncSC, a novel asynchronous sidechain construction. It employs a committee to provide Cross-Blockchain as a Service (C-BaaS) for data exchange in multi-domain IoT. To fulfill the need for asynchronous and efficient data exchange, we combine the ideas of aggregate signatures and verifiable delay functions to devise a novel cryptographic primitive called delayed aggregate signature (DAS), which constructs asynchronous cross-chain proofs (ACPs) that ensure the security of cross-chain interactions. To ensure the consistency of asynchronous transactions, we propose a multilevel buffered transaction pool that guarantees the transaction sequencing. We analyze and prove the security of AsyncSC, simulate an asynchronous communication environment, and conduct a comprehensive evaluation. The results show that AsyncSC outperforms SOTA schemes, improving throughput by an average of 1.21 to 3.96 times, reducing transaction latency by 59.76% to 83.61%, and maintaining comparable resource overhead. Copyright © 2024, The Authors. All rights reserved.

关键词：

Snake net and balloon force with a neural network for detecting multiple phases

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Sun, Xiaodong Yang, Huijiong Wu, Nan Scott, T.C. Zhang, Jie Zhang, Wanzhou College of Physics Taiyuan University of Technology Shanxi030024 China College of data science Taiyuan University of Technology Shanxi030024 China Department of Computing The Hong Kong Polytechnic University Hong Kong Institut für Physikalische Chemie RWTH Aachen University Aachen52056 Germany CAS Key Laboratory for Theoretical Physics Institute of Theoretical Physics Chinese Academy of Sciences Beijing100190 China Hefei National Laboratory for Physical Sciences at the Microscale Department of Modern Physics University of Science and Technology of China Hefei230026 China

Unsupervised machine learning applied to the study of phase transitions is an ongoing and interesting research direction. The active contour model, also called the snake model, was initially proposed for target contour extraction in two-dimensional images. In order to obtain a physical phase diagram, the snake model with an artificial neural network is applied in an unsupervised learning way by the authors of [***. 120, 176401(2018)]. It guesses the phase boundary as an initial snake and then drives the snake to convergence with forces estimated by the artificial neural network. In this paper, we extend this unsupervised learning method with one contour to a snake net with multiple contours for the purpose of obtaining several phase boundaries in a phase diagram. For the classical Blume-Capel model, the phase diagram containing three and four phases is obtained. Moreover, to overcome the limitations of the initial position and speed up the movement of the snake, the balloon force decaying with the iteration steps is introduced and applied to the snake net structure. Our method is helpful in determining the phase diagram with multiple phases, using just snapshots of configurations from cold atoms or other experiments without knowledge of the phases. Copyright © 2022, The Authors. All rights reserved.

关键词： Phase diagrams

Automatic detection of lung nodule in CT scan slices using CNN segmentation schemes: A study

学校读者我要写书评

暂无评论

Procedia Computer science 2023年 218卷 2786-2794页

作者： Seifedine Kadry Enrique Herrera-Viedma Rubén González Crespo Sujatha Krishnamoorthy Venkatesan Rajinikanth Faculty of Applied Computing and Technology Noroff University College Kristiansand 94612 Norway Research Institute in Data Science and Computational Intelligence University of Granada Granada Andalusian Spain Computer Science Department School of Engineering and Technology Universidad Internacional de La Rioja 26006 Spain Zhejiang Bioinformatics International Science and Technology Cooperation Center Wenzhou-Kean University Zhejiang Province China Wenzhou Municipal Key Lab of Applied Biomedical and Biopharmaceutical Informatics Wenzhou-Kean University Zhejiang Province China Department of Electronics and Instrumentation Engineering St. Joseph's College of Engineering OMR Chennai 600119 Tamil Nadu India

The lung is one of the prime respiratory organs in human physiology, and its abnormality will severely disrupt the respiratory system. Lung Nodule (LN) is one of the abnormalities, and early screening and treatment are necessary to reduce its harshness. The proposed work aims to implement the Convolutional-Neural-network (CNN) segmentation methodology to extract the LN in various lung CT slices, such as axial, coronal, and sagittal planes. This work consists of the following phases; (i) Image collection and pre-processing, (ii) Ground-truth generation, (iii) CNN-supported segmentation, and (iv) Performance evaluation and validation. In this work, the merit of pre-trained CNN segmentation schemes is verified using (i) One-fold training and (ii) Two-fold training methods. The test images for this study are collected from The Cancer Imaging Archive (TCIA) database. The experimental investigation is executed using Python®, and the outcome of this study confirms that the VGG-SegNet helps to get better values of Jaccard (>88%), Dice (>93%), and Accuracy (>96%) compared to other CNN methods.

关键词： Lung nodule CT scan CNN segmentation VGG-SegNet Accuracy Detection

Quantum communication protocols by quantum walks with two coins

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Shang, Yun Wang, Yu Li, Meng Lu, Ruqian NCMIS Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China MDIS Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China Key Lab of IIP Institute of Computing Technology CAS Beijing100190 China

We introduce some new perfect state transfer and teleportation schemes by quantum walks with two coins. Encoding the transferred information in coin 1 state and alternatively using two coin operators, we can perfectly recover the information on coin 1 state at target position only by at most two times of flipping operation. Based on quantum walks with two coins either on the line or on the N-circle, we can perfectly transfer any qubit state. In addition, using quantum walks with two coins either on complete graphs or regular graphs, we can first implement perfect qudit state transfer by quantum walks. Compared with existing schemes driven by one coin, more general graph structures can be used to perfectly transfer more general state. Moreover, the external control of coin operator during the transmitting process can be decreased greatly. Selecting coin 1 as the sender and coin 2 as the receiver, we also study how to realize generalized teleportation over long steps of walks by the above quantum walk models. Because quantum walks is an universal quantum computation model, our schemes may provide an universal platform for the design of quantum network and quantum computer. Copyright © 2018, The Authors. All rights reserved.

关键词： Qubits

Primitives Generation Policy Learning without Catastrophic Forgetting for Robotic Manipulation

学校读者我要写书评

暂无评论

Primitives Generation Policy Learning without Catastrophic F...

IEEE International Conference on data Mining Workshops (ICDM Workshops)

作者： Fangzhou Xiong Zhiyong Liu Kaizhu Huang Xu Yang Amir Hussain State Key Lab of Management and Control for Complex Systems Institute of Automation Chinese Academy of Science China School of Computer and Control University of Chinese Academy of Sciences (UCAS) China CAS Centre for Excellence in Brain Science and Intelligence Technology Chinese Academy of Sciences China Department of EEE Xi’an Jiaotong-Liverpool University China School of Computing Edinburgh Napier University U.K.

Catastrophic forgetting is a tough challenge when agent attempts to address different tasks sequentially without storing previous information, which gradually hinders the development of continual learning. Except for image classification tasks in continual learning, however, there are little reviews related to robotic manipulation. In this paper, we present a novel hierarchical architecture called Primitives Generation Policy Learning to enable continual learning. More specifically, a generative method by Variational Autoencoder is employed to generate state primitives from task space, then separate policy learning component is designed to learn torque control commands for different tasks sequentially. Furthermore, different task policies could be identified automatically by comparing reconstruction loss in the autoencoder. Experiment on robotic manipulation task shows that the proposed method exhibits substantially improved performance over some other continual learning methods.

关键词： Task analysis Robots Neural networks Learning systems Trajectory Decoding Aerospace electronics

Binary neural networks: A survey

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Qin, Haotong Gong, Ruihao Liu, Xianglong Bai, Xiao Song, Jingkuan Sebe, Nicu State Key Lab of Software Development Environment Beihang University Beijing China Beijing Advanced Innovation Center for Big Data-Based Precision Medicine Beihang University Beijing China Center for Future Media School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China Department of Information Engineering and Computer Science University of Trento Trento Italy School of Computer Science and Engineering Beijing Advanced Innovation Center for Big Data and Brain Computing Jiangxi Research Institute Beihang University Beijing China

The binary neural network, largely saving the storage and computation, serves as a promising technique for deploying deep models on resource-limited devices. However, the binarization inevitably causes severe information loss, and even worse, its discontinuity brings difficulty to the optimization of the deep network. To address these issues, a variety of algorithms have been proposed, and achieved satisfying progress in recent years. In this paper, we present a comprehensive survey of these algorithms, mainly categorized into the native solutions directly conducting binarization, and the optimized ones using techniques like minimizing the quantization error, improving the network loss function, and reducing the gradient error. We also investigate other practical aspects of binary neural networks such as the hardware-friendly design and the training tricks. Then, we give the evaluation and discussions on different tasks, including image classification, object detection and semantic segmentation. Finally, the challenges that may be faced in future research are prospected. Copyright © 2020, The Authors. All rights reserved.

关键词： Surveys

Deterministic realization of collective measurements via photonic quantum walks

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Hou, Zhibo Tang, Jun-Feng Shang, Jiangwei Zhu, Huangjun Li, Jian Yuan, Yuan Wu, Kang-Da Xiang, Guo-Yong Li, Chuan-Feng Guo, Guang-Can Key Laboratory of Quantum Information University of Science and Technology of China CAS Hefei230026 China Synergetic Innovation Center of Quantum Information and Quantum Physics University of Science and Technology of China Hefei230026 China Naturwissenschaftlich-Technische Fakultät Universität Siegen Siegen57068 Germany Beijing Key Laboratory of Nanophotonics Ultrafine Optoelectronic Systems School of Physics Beijing Institute of Technology Beijing100081 China Institute for Theoretical Physics University of Cologne Cologne50937 Germany Department of Physics Center for Field Theory and Particle Physics Fudan University Shanghai200433 China Institute for Nanoelectronic Devices and Quantum Computing Fudan University Shanghai200433 China State Key Laboratory of Surface Physics Fudan University Shanghai200433 China Collaborative Innovation Center of Advanced Microstructures Nanjing210093 China Institute of Signal Processing Transmission Nanjing University of Posts and Telecommunications Nanjing210003 China Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education Nanjing210003 China

Collective measurements on identically prepared quantum systems can extract more information than local measurements, thereby enhancing information-processing efficiency. Although this nonclassical phenomenon has been known for two decades, it has remained a challenging task to demonstrate the advantage of collective measurements in experiments. Here we introduce a general recipe for performing deterministic collective measurements on two identically prepared qubits based on quantum walks. Using photonic quantum walks, we realize experimentally an optimized collective measurement with fidelity 0.9946 without post selection. As an application, we achieve the highest tomographic efficiency in qubit state tomography to date. Our work offers an effective recipe for beating the precision limit of local measurements in quantum state tomography and metrology. In addition, our study opens an avenue for harvesting the power of collective measurements in quantum information processing and for exploring the intriguing physics behind this power. Copyright © 2017, The Authors. All rights reserved.

关键词： Quantum optics

Sequential and adaptive sampling for matrix completion in network monitoring systems

学校读者我要写书评

暂无评论

Sequential and adaptive sampling for matrix completion in ne...

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Kun Xie Lele Wang Xin Wang Gaogang Xie Guangxing Zhang Dongliang Xie Jigang Wen College of Computer Science and Electronics Engineering Hunan University Changsha China State Key Lab of Networking & Switching Tech. Beijing Univ. of Posts and Telecomm. China Department of Electrical and Computer Engineering State University of New York at Stony Brook USA Institute of Computing Technology Chinese Academy of Sciences Beijing China DNSLAB China Internet Network Information Center Beijing China

End-to-end network monitoring is essential to ensure transmission quality for Internet applications. However, in large-scale networks, full-mesh measurement of network performance between all transmission pairs is infeasible. As a newly emerging sparsity representation technique, matrix completion allows the recovery of a low-rank matrix using only a small number of random samples. Existing schemes often fix the number of samples assuming the rank of the matrix is known, while the data features thus the matrix rank vary over time. In this paper, we propose to exploit the matrix completion techniques to derive the end-to-end network performance among all node pairs by only measuring a small subset of end-to-end paths. To address the challenge of rank change in the practical system, we propose a sequential and information-based adaptive sampling scheme, along with a novel sampling stopping condition. Our scheme is based only on the data observed without relying on the reconstruction method or the knowledge on the sparsity of unknown data. We have performed extensive simulations based on real-world trace data, and the results demonstrate that our scheme can significantly reduce the measurement cost while ensuring high accuracy in obtaining the whole network performance data.

关键词： Monitoring Sparse matrices Matrix decomposition Computers Accuracy Conferences Internet

Multi-label Classification with High-rank and High-order label Correlations

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Si, Chongjie Jia, Yuheng Wang, Ran Zhang, Min-Ling Feng, Yanghe Qu, Chongxiao The Chien-Shiung Wu College Southeast University Nanjing210096 China The MoE Key Lab of Artificial Intelligence AI Institute Shanghai Jiao Tong University Shanghai200240 China The School of Computer Science and Engineering Southeast University Nanjing210096 China Ministry of Education China School of Computing & Information Sciences Caritas Institute of Higher Education Hong Kong The Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China The School of Mathematical Science Shenzhen University Shenzhen518060 China Shenzhen Key Laboratory of Advanced Machine Learning and Applications Shenzhen University Shenzhen518060 China The College of Systems Engineering National University of Defense Technology China The 52nd Research Institute of China Electronics Technology Group China

Exploiting label correlations is important to multi-label classification. Previous methods capture the high-order label correlations mainly by transforming the label matrix to a latent label space with low-rank matrix factorization. However, the label matrix is generally a full-rank or approximate full-rank matrix, making the low-rank factorization inappropriate. Besides, in the latent space, the label correlations will become implicit. To this end, we propose a simple yet effective method to depict the high-order label correlations explicitly, and at the same time maintain the high-rank of the label matrix. Moreover, we estimate the label correlations and infer model parameters simultaneously via the local geometric structure of the input to achieve mutual enhancement. Comparative studies over twelve benchmark data sets validate the effectiveness of the proposed algorithm in multi-label classification. The exploited high-order label correlations are consistent with common sense empirically. Our code is publicly available at https://***/Chongjie-Si/HOMI. Copyright © 2022, The Authors. All rights reserved.

关键词： Matrix algebra