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

Frontiers of Information technology & Electronic Engineering 2018年第7期19卷 889-904页

作者： Xiao-long SHEN Yong DOU Steven MILLS David M EYERS Huan FENG Zhiyi HUANG College of Computer National University of Defense Technology Science and Technology on Parallel and Distributed Laboratory National University of Defense Technology Department of Computer Science University of Otago Department of Computer Science Tsinghua University

Sparse bundle adjustment(SBA) is a key but time-and memory-consuming step in three-dimensional(3 D) reconstruction. In this paper, we propose a 3 D point-based distributed SBA algorithm(DSBA) to improve the speed and scalability of SBA. The algorithm uses an asynchronously distributed sparse bundle adjustment(A-DSBA)to overlap data communication with equation computation. Compared with the synchronous DSBA mechanism(SDSBA), A-DSBA reduces the running time by 46%. The experimental results on several 3 D reconstruction datasets reveal that our distributed algorithm running on eight nodes is up to five times faster than that of the stand-alone parallel SBA. Furthermore, the speedup of the proposed algorithm(running on eight nodes with 48 cores) is up to41 times that of the serial SBA(running on a single node).

关键词： Sparse bundle adjustment parallel distributed sparse bundle adjustment Three-dimensional reconstruction Asynchronous

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Ren, Yingying Li, Qiuli Guo, Yangyang Pedrycz, Witold Xing, Lining Liu, Anfeng Song, Yanjie School of Computer Electronics and Information Guangxi University Nanning China Guangxi Key Laboratory of Multimedia Communications and Network Technology China Key Laboratory of Parallel Distributed and Intelligent Computing Guangxi University China School of Systems Science Beijing Jiaotong University Beijing China Department of Electrical and Computer Engineering University of Alberta Edmonton Canada Systems Research Institute Polish Academy of Sciences Poland Faculty of Engineering and Natural Sciences Department of Computer Engineering Sariyer Istanbul Turkey School of Electronic Engineering Xidian University Xian China School of Electronic Engineering Central South University Changsha China National Engineering Research Center of Maritime Navigation System Dalian Maritime University Dalian China

With the rapid development of the satellite industry, the information transmission network based on communication satellites has gradually become a major and important part of the future satellite ground integration network. However, the low transmission efficiency of the satellite data relay back mission has become a problem that is currently constraining the construction of the system and needs to be solved urgently. Effectively planning the task of satellite ground networking by reasonably scheduling resources is crucial for the efficient transmission of task data. In this paper, we hope to provide a task execution scheme that maximizes the profit of the networking task for satellite ground network planning considering feeding mode (SGNPFM). To solve the SGNPFM problem, a mixed-integer planning model with the objective of maximizing the gain of the link-building task is constructed, which considers various constraints of the satellite in the feed-switching mode. Based on the problem characteristics, we propose a distance similarity-based genetic optimization algorithm (DSGA), which considers the state characteristics between the tasks and introduces a weighted Euclidean distance method to determine the similarity between the tasks. To obtain more high-quality solutions, different similarity evaluation methods are designed to assist the algorithm in intelligently screening individuals. The DSGAalso uses an adaptive crossover strategy based on similarity mechanism, which guides the algorithm to achieve efficient population search. In addition, a task scheduling algorithm considering the feed-switching mode is designed for decoding the algorithm to generate a highquality scheme. The results of simulation experiments show that the DSGA can effectively solve the SGNPFM problem. Compared to other algorithms, the proposed algorithm not only obtains higher quality planning schemes but also has faster algorithm convergence speed. The proposed algorithm improves data trans

关键词： Profitability

BCS-Net: Boundary, Context and Semantic for Automatic COVID-19 Lung Infection Segmentation from CT Images

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Cong, Runmin Yang, Haowei Jiang, Qiuping Gao, Wei Li, Haisheng Wang, Cong Zhao, Yao Kwong, Sam The Institute of Information Science Beijing Jiaotong University Beijing100044 China Beijing Key Laboratory of Big Data Technology for Food Safety Beijing Technology and Business University Beijing100048 China The Department of Computer Science City University of Hong Kong Hong Kong The Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing100044 China The School of Information Science and Engineering Ningbo University Ningbo315211 China The School of Electronic and Computer Engineering Peking University Shenzhen Graduate School Shenzhen518055 China Peng Cheng Laboratory Shenzhen518055 China The Distributed and Parallel Software Lab Huawei Technologies Shenzhen518129 China The City University of Hong Kong Shenzhen Research Institute Shenzhen51800 China

The spread of COVID-19 has brought a huge disaster to the world, and the automatic segmentation of infection regions can help doctors to make diagnosis quickly and reduce workload. However, there are several challenges for the accurate and complete segmentation, such as the scattered infection area distribution, complex background noises, and blurred segmentation boundaries. To this end, in this paper, we propose a novel network for automatic COVID-19 lung infection segmentation from CT images, named BCS-Net, which considers the boundary, context, and semantic attributes. The BCS-Net follows an encoder-decoder architecture, and more designs focus on the decoder stage that includes three progressively Boundary-Context-Semantic Reconstruction (BCSR) blocks. In each BCSR block, the attention-guided global context (AGGC) module is designed to learn the most valuable encoder features for decoder by highlighting the important spatial and boundary locations and modeling the global context dependence. Besides, a semantic guidance (SG) unit generates the semantic guidance map to refine the decoder features by aggregating multi-scale high-level features at the intermediate resolution. Extensive experiments demonstrate that our proposed framework outperforms the existing competitors both qualitatively and quantitatively. © 2022, CC BY-NC-SA.

关键词： COVID-19

An Effective Design to Improve the Efficiency of DPUs on FPGA

学校读者我要写书评

暂无评论

An Effective Design to Improve the Efficiency of DPUs on FPG...

International Conference on parallel and distributed Systems (ICPADS)

作者： Yutian Lei Qingyong Deng Saiqin Long Shaohui Liu Sangyoon Oh The Key Laboratory of Hunan Province for Internet of Things and Information Security The School of Computer Science Science and Technology on Parallel and Distributed Processing Laboratory Xiangtan University Xiangtan China The Artificial Intelligence Center PengCheng Laboratory shenzhen China Ajou University Suwon-si Republic of Korea

The following topics are dealt with: cloud computing; learning (artificial intelligence); resource allocation; security of data; mobile computing; neural nets; optimisation; parallel processing; scheduling; and storag... 详细信息

ISBN: (数字)9781728190747

ISBN: (纸本)9781728183824

关键词： Deep learning Schedules Multicore processing Logic gates Throughput Acceleration Field programmable gate arrays

Versionized process based on non-volatile random-access memory for fine-grained fault tolerance

学校读者我要写书评

暂无评论

Frontiers of Information technology & Electronic Engineering 2018年第2期19卷 192-205页

作者： Wen-zhe ZHANG Kai LU Xiao-ping WANG Science and Technology on Parallel and Distributed Processing Laboratory College of ComputerNational University of Defense Technology

Non-volatile random-access memory（NVRAM） technology is maturing rapidly and its byte-persistence feature allows the design of new and efficient fault tolerance mechanisms. In this paper we propose the versionized process（Ver P）, a new process model based on NVRAM that is natively non-volatile and fault tolerant. We introduce an intermediate software layer that allows us to run a process directly on NVRAM and to put all the process states into NVRAM, and then propose a mechanism to versionize all the process data. Each piece of the process data is given a special version number, which increases with the modification of that piece of data. The version number can effectively help us trace the modification of any data and recover it to a consistent state after a system *** with traditional checkpoint methods, our work can achieve fine-grained fault tolerance at very little cost.

关键词： Non-volatile memory Byte-persistence Versionized process Version number

Locality-sensitive sketching for resilient network flow monitoring

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Fu, Yongquan Li, Dongsheng Shen, Siqi Zhang, Yiming Chen, Kai Science and Technology Laboratory of Parallel and Distributed Processing College of Computer Science National University of Defense Technology SING Lab Hong Kong University of Science and Technology

Network monitoring is vital in modern clouds and data center networks for traffic engineering, network diagnosis, network intrusion detection, which need diverse traffic statistics ranging fromflow size distributions to heavy hitters. To cope with increasing network rates and massive traffic volumes, sketch based approximate measurement has been extensively studied to trade the accuracy for memory and computation cost, which unfortunately, is sensitive to hash collisions. In addition, deploying the sketch involves fine-grained performance control and instrumentation. This paper presents a locality-sensitive sketch (LSS) to be resilient to hash collisions. LSS proactively minimizes the estimation error due to hash collisions with an autoencoder based optimization model, and reduces the estimation variance by keeping similar network flows to the same bucket array. To illustrate the feasibility of the sketch, we develop a disaggregatedmonitoring application that supports non-intrusive sketching deployment and native network-wide analysis. Testbed shows that the framework adapts to line rates and provides accurate query results. Real-world trace-driven simulations show that LSS remains stable performance underwide ranges of parameters and dramatically outperforms state-of-the-art sketching structures, with over 103 to 105 times reduction in relative errors for per-flow queries as the ratio of the number of buckets to the number of network flows reduces from 10% to 0.1%. Copyright © 2019, The Authors. All rights reserved.

关键词： Intrusion detection

MIX: A Joint Learning Framework for Detecting Both Clustered and Scattered Outliers in Mixed-Type Data

学校读者我要写书评

暂无评论

MIX: A Joint Learning Framework for Detecting Both Clustered...

IEEE International Conference on Data Mining (ICDM)

作者： Hongzuo Xu Yijie Wang Yongjun Wang Zhiyue Wu National University of Defense Technology Changsha China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

Mixed-type data are pervasive in real life, but very limited outlier detection methods are available for these data. Some existing methods handle mixed-type data by feature converting, whereas their performance is downgraded by information loss and noise caused by the transformation. Another kind of approaches separately evaluates outlierness in numerical and categorical features. However, they fail to adequately consider the behaviours of data objects in different feature spaces, often leading to suboptimal results. As for outlier form, both clustered outliers and scattered outliers are contained in many real-world data, but a number of outlier detectors are inherently restricted by their outlier definitions to simultaneously detect both of them. To address these issues, an unsupervised outlier detection method MIX is proposed. MIX constructs a joint learning framework to establish a cooperation mechanism to make separate outlier scoring constantly communicate and sufficiently grasp the behaviours of data objects in another feature space. Specifically, MIX iteratively performs outlier scoring in numerical and categorical space. Each outlier scoring phase can be iteratively and cooperatively enhanced by the prior knowledge given by another feature space. To target both clustered and scattered outliers, the outlier scoring phases capture the essential characteristic of outliers, i.e., evaluating outlierness via the deviation from the normal model. We show that MIX significantly outperforms eight state-of-the-art outlier detectors on twelve real-world datasets and obtains good scalability.

关键词：

Research on accelerating CEE-DGCNN event extraction algorithm based on multi-CPU platform

学校读者我要写书评

暂无评论

Journal of Physics: Conference Series 2021年第1期1738卷

作者： Yan Li Jinfei Jiang Jinwei Xu Zikai Gao Yong Dou Haifang Zhou Science and Technology on Parallel and Distributed Laboratory National University of Defense Technology Changsha 410005 China Department of Computational Science National University of Defense Technology Changsha 410005 China

With the development of the Internet, the volume of information is expanding rapidly, and the complex information makes it particularly important to extract information quickly and intelligently. Event extraction algorithm is such a kind of fast and accurate information acquisition algorithm. With the development of deep learning in recent years, deep learning also shines in the field of time extraction. CEE-DGCNN network is an efficient and accurate event extraction algorithm for Chinese text. At present, the acceleration research on deep learning in the academic community mainly focuses on GPU, FPGA and other platforms. In fact, compared with these platforms, CPU is more versatile. Considering that the algorithm should have universality and universality in industrial application, this paper makes an in-depth analysis of CEE-DGCNN algorithm to study its acceleration on CPU. Experiments were carried out on x86 and ARM architectures respectively, and good acceleration effects were achieved.

关键词：

QUBIQ: Uncertainty Quantification for Biomedical Image Segmentation Challenge

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Li, Hongwei Bran Navarro, Fernando Ezhov, Ivan Bayat, Amirhossein Das, Dhritiman Kofler, Florian Shit, Suprosanna Waldmannstetter, Diana Paetzold, Johannes C. Hu, Xiaobin Wiestler, Benedikt Zimmer, Lucas Amiranashvili, Tamaz Prabhakar, Chinmay Berger, Christoph Weidner, Jonas Alonso-Basanta, Michelle Rashid, Arif Baid, Ujjwal Adel, Wesam Alis, Deniz Baheti, Bhakti Bai, Yingbin Bhat, Ishaan Cetindag, Sabri Can Chen, Wenting Cheng, Li Dutande, Prasad Dular, Lara Elattar, Mustafa A. Feng, Ming Gao, Shengbo Huisman, Henkjan Hu, Weifeng Innani, Shubham Ji, Wei Karimi, Davood Kuijf, Hugo J. Kwak, Jin Tae Le, Hoang Long Li, Xiang Lin, Huiyan Liu, Tongliang Ma, Jun Ma, Kai Ma, Ting Oksuz, Ilkay Holland, Robbie Oliveira, Arlindo L. Pal, Jimut Bahan Pei, Xuan Qiao, Maoying Saha, Anindo Selvan, Raghavendra Shen, Linlin Silva, Joao Lourenco Spiclin, Ziga Talbar, Sanjay Wang, Dadong Wang, Wei Wang, Xiong Wang, Yin Xi, Ruiling Xu, Kele Yang, Yanwu Yergin, Mert Yu, Shuang Zeng, Lingxi Zhang, YingLin Zhao, Jiachen Zheng, Yefeng Zukovec, Martin Do, Richard Becker, Anton Simpson, Amber Konukoglu, Ender Jakab, Andras Bakas, Spyridon Joskowicz, Leo Menze, Bjoern Department of Informatics Technical University of Munich Germany Athinoula A. Martinos Center for Biomedical Imaging Massachusetts General Hospital Harvard Medical School United States Department of Quantitative Biomedicine University of Zurich Switzerland University Children’s Hospital Zurich University of Zurich Switzerland Department of Radioncology and Radiation Theraphy Klinikum rechts der Isar Technical University of Munich Germany Department of Information Technology and Electrical Engineering ETH-Zurich Switzerland Department of Radiology Memorial Sloan Kettering Cancer Center New York City United States Department of Biomedical and Molecular Sciences Queen’s University Canada TranslaTUM - Central Institute for Translational Cancer Research Technical University of Munich Germany McGovern Institute Massachusetts Institute of Technology United States Institute for Diagnostic and Interventional Radiology Unveristy Zurich Hospital Switzerland BioMedIA Imperial College London United Kingdom Department of Radiation Oncology University of Pennsylvania PA United States University of Pennsylvania PA United States Department of Radiation Oncology Winship Cancer Institute of Emory University Georgia United States Nile University Cairo Egypt Department of Medical Sciences Acibadem University Istanbul Turkey Shri Guru Gobind Singhji Institute of Engineering and Technology Maharashtra Nanded India Trustworthy Machine Learning Lab University of Sydney Australia Image Sciences Institute University Medical Center Utrecht Netherlands Computer Engineering Department Istanbul Technical University Istanbul Turkey School of Computer Science Shenzhen University Shenzhen China University of Alberta United States University of Ljubljana Faculty of Electrical Engineering Ljubljana Slovenia Tongji University Shanghai China OPPO Research Institute Shanghai China School of Biological and Medical Engineering Beihang University Beijing China Harvard Medical School Boston

Uncertainty in medical image segmentation tasks, especially inter-rater variability, arising from differences in interpretations and annotations by various experts, presents a significant challenge in achieving consistent and reliable image segmentation. This variability not only reflects the inherent complexity and subjective nature of medical image interpretation but also directly impacts the development and evaluation of automated segmentation algorithms. Accurately modeling and quantifying this variability is essential for enhancing the robustness and clinical applicability of these algorithms. We report the set-up and summarize the benchmark results of the Quantification of Uncertainties in Biomedical Image Quantification Challenge (QUBIQ), which was organized in conjunction with International Conferences on Medical Image Computing and Computer-Assisted Intervention (MICCAI) 2020 and 2021. The challenge focuses on the uncertainty quantification of medical image segmentation which considers the omnipresence of inter-rater variability in imaging datasets. The large collection of images with multi-rater annotations features various modalities such as MRI and CT;various organs such as the brain, prostate, kidney, and pancreas;and different image dimensions 2D-vs-3D. A total of 24 teams submitted different solutions to the problem, combining various baseline models, Bayesian neural networks, and ensemble model techniques. The obtained results indicate the importance of the ensemble models, as well as the need for further research to develop efficient 3D methods for uncertainty quantification methods in 3D segmentation tasks. © 2024, CC BY-NC-ND.

关键词： Image segmentation

parallel computing for large-scale author name disambiguation in medline 21

学校读者我要写书评

暂无评论

Parallel computing for large-scale author name disambiguatio...

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on Data science and Systems, HPCC/SmartCity/DSS 2019

作者： Tang, Anyao Wu, Chengkun Liu, Jie Wang, Wei Yang, Xi Xing, Yuting Science and Technology on Parallel and Distributed Processing Laboratory Laboratory of Software Engineering for Complex Systems National University of Defense Technology Changsha410073 China State Key Laboratory of High Performance Computing College of Computer National University of Defense Technology Changsha410073 China College of Computer National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9781728120584

Author name disambiguation (AND) is an important task in the field of scientific data mining. It has become a great challenge with the rapid growth of academic digital libraries. The task of AND for a large number of authors is computationally intensive. In particular, an author's name in MEDLINE is represented by full last name and initials, like 'Zhang S', which leads to a lot of identical strings that actually represent different names. In this paper, we proposed an efficient algorithm for parallel AND computation. The proposed algorithm mainly addresses the load balancing issue across many computing nodes. It involves the following strategies:(1) Author-based load balancing, which splits the computation load for each core by author name labels. (2) Matrix-based strategy, which calculates the pairwise similarity between publications and saves them in a matrix globally shared by all processes. Then group them by width-first search. We combine the above two strategies, the second of which is used to calculate authors with a large number of documents, and the other authors apply the first. We constructed a publications database written by Chinese authors from MEDLINE, the biggest public database for biomedical literature (abstracts). For benchmark testing, we experimented our algorithm with a dataset of 1 million publications on the Tianhe-2A supercomputer. Firstly, we trained an AND classifier that can achieve 98.1% of F1. The serial computation time is estimated to be approximately 246 hours, while the parallel execution time is approximately 66 hours in the case of four cores on a single node (with a speedup of 3.7x). Finally, we reduced the total parallel computing time of 1 million documents to about 2 hours and achieved 65.8% of parallelism efficiency using 200 cores on 90 nodes. © 2019 IEEE.

关键词： Matrix algebra