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

Surveying concurrency bug detectors based on types of detected bugs

science China(Information sciences) 2017年第3期60卷 5-31页

作者： Zhendong WU Kai LU Xiaoping WANG Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology College of Computer National University of Defense Technology

Concurrency bugs widely exist in concurrent programs and have caused severe failures in the real world. Researchers have made significant progress in detecting concurrency bugs, which improves software reliability. In this paper, we survey the most up-to-date and well-known concurrency bug detectors. We categorize the existing detectors based on the types of concurrency bugs. Consequently, we analyze data race detectors, atomicity violation detectors, order violation detectors, and deadlock detectors, respectively. We also discuss some other techniques which are mostly related to concurrency bug detection, including schedule bounding techniques, interleaving optimizing techniques, path expanding techniques, and deterministic replay techniques. Additionally, we statistically analyze the reviewed detectors and get some interesting findings, for instance, nearly 86% of previous detectors focus on data races and atomicity violations, and dynamic approaches are popular(74%). We also discuss the limitations of previous detectors, finding that 91% of previous detectors suffer from false negatives and 64% of previous detectors suffer from runtime overhead. Based on the reviewed detectors and statistical analysis, we conclude some future research directions, including accuracy, performance,applicability, and integrality.

关键词： concurrency bug detection data race atomicity violation order violation deadlock

来源：评论

学校读者我要写书评

暂无评论

Social media in Git Hub: the role of @-mention in assisting software development

引用

science China(Information sciences) 2017年第3期60卷 50-67页

作者： Yang ZHANG Huaimin WANG Gang YIN Tao WANG Yue YU Key Laboratory of Parallel and Distributed Computing College of ComputerNational University of Defense Technology

Recently, many researches propose that social media tools can promote the collaboration among developers, which are beneficial to the software development. Nevertheless, there is little empirical evidence to confirm that using @-mention has indeed a beneficial impact on the issues in Git Hub. In order to begin investigating such claim, we examine data from two large and successful projects hosted on Git Hub, the Ruby on Rails and the Angular JS. By using qualitative and quantitative analysis, we give an in-depth understanding on how @-mention is used in the issues and the role of @-mention in assisting software development. Our statistical results indicate that, @-mention attracts more participants and tends to be used in the difficult issues. @-mention favors the solving process of issues by enlarging the visibility of issues and facilitating the developers' collaboration. Our study also build an @-network based on the @-mention database we *** the @-network, we investigate its evolution over time and prove that we certainly have the potential to mine the relationships and characteristics of developers by exploiting the knowledge from the @-network.

关键词： issues social media @-mention Git Hub software development

来源：评论

学校读者我要写书评

暂无评论

QUBIQ: Uncertainty Quantification for Biomedical Image Segmentation Challenge

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Learning-based Depth Estimation aided Visual SLAM Approach

arXiv

引用

arXiv 2019年

作者： Geng, Mingyang Shang, Suning Ding, Bo Wang, Huaimin Zhang, Pengfei Zhang, Lei National Key Laboratory of Parallel and Distributed Processing College of Computer National University of Defense Technology China National Key Laboratory of Integrated Automation of Process Industry Northeastern University China

Existing visual-based SLAM systems mainly utilize the three-dimensional environmental depth information from RGB-D cameras to complete the robotic synchronization localization and map construction task. However, the RGB-D camera maintains a limited range for working and is hard to accurately measure the depth information in a far distance. Besides, the RGB-D camera will easily be influenced by strong lighting and other external factors, which will lead to a poor accuracy on the acquired environmental depth information. Recently, deep learning technologies have achieved great success in the visual SLAM area, which can directly learn high-level features from the visual inputs and improve the estimation accuracy of the depth information. Therefore, deep learning technologies maintain the potential to extend the source of the depth information and improve the performance of the SLAM system. However, the existing deep learning-based methods are mainly supervised and require a large amount of ground-truth depth data, which is hard to acquire because of the realistic constraints. In this paper, we first present an unsupervised learning framework, which not only uses image reconstruction for supervising but also exploits the pose estimation method to enhance the supervised signal and add training constraints for the task of monocular depth and camera motion estimation. Furthermore, we successfully exploit our unsupervised learning framework to assist the traditional ORB-SLAM system when the initialization module of ORB-SLAM method could not match enough features. Qualitative and quantitative experiments have shown that our unsupervised learning framework performs the depth estimation task comparably to the supervised methods and outperforms the previous state-of-the-art approach by 13.5% on KITTI dataset. Besides, our unsupervised learning framework could significantly accelerate the initialization process of ORB-SLAM system and effectively improve the accuracy on environme

关键词： Unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

引用

2018 International Joint Conference on Neural Networks, IJCNN 2018

作者： Yu, Hao Zhang, Zhaoning Zhu, Zijie Wang, Xiong Zhang, Gen Science and Technology on Parallel and Distributed Laboratory National University of Defense Technology Changsha China College of Meteorology and Oceanology National University of Defense Technology Changsha China College of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781509060146

Similarity of nominal data plays fundamental roles in numerous fields of both machine learning and data mining. Unlike the similarity of numerical data, that of nominal data is much more difficult to describe, and few efforts have been done for it. Although existing nominal similarity measures can reveal a part of data properties, they suffer from low accuracy due to ignoring value relationships or integrating multi-view relationships inappropriately. In this paper, we propose a novel hierarchical measure for nominal data similarity (HNS). The HNS leverages the intrinsic data characteristics by considering low-level information both within and between attributes, and hierarchically seizes the value distributions, attribute interactions and attribute to object contributions. Meanwhile, it aggregates multi-view relationships trough a bottom to top framework, remaining consistency as well as complementary details. We theoretically analyzed this measure, and experiments on six UCI data sets demonstrate that the HNS outperforms the state-of-the-art nominal similarity measures in term of target alignment and clustering accuracy. © 2018 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

MixedCache: Enabling Flow Directed Rule-Caching Scheme based on Heterogeneous Cache for OpenFlow

引用

Journal of Physics: Conference Series 2020年第1期1693卷

作者： Jialun Yang Yi Yang Jiahao Liu Rulin Liu Peng Qiao Baosheng Wang College of Computer Science and Technology National University of Defense Technology Changsha 410073 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China

OpenFlow switches in SDN use Multiple Flow Tables (MFTs) for fine-grained flow control. Commodity switches integrate hardware storage resources such as SRAM and TCAM to store flow tables to achieve high-speed lookups. Many increased flow tables are rapidly exhausting these hardware storage resources, which makes the switches have to balance high-speed search and massive storage. The rule-caching scheme is a popular method to solve this problem, which caches the most commonly used rules into hardware storage resources. The existing rule-caching schemes are based on single hardware storage resources, and they cannot flexibly adjust the caching strategy according to the traffic characteristics. Simultaneously, the deployed commodity switches face the problem of difficulty in changing the size of SRAM and TCAM. This paper innovatively proposes the MixedCache scheme, which makes full use of the hardware storage resources in the switch according to the skewed characteristics of network traffic. MixedCache stores the large flows in SRAM by exact match and stores the small flows in the TCAM by wildcard match. MixedCache does not need to change the size of the deployed switch hardware storage resources, but makes full use of existing resources. Compared with the rule-caching scheme based on the exact match, the cache hit rate can increase by up to 15.61%. Compared with the rule-caching scheme based on the wildcard match, the cache hit rate can increase by up to 29.69%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A routing protocol for urban vehicular ad hoc networks to support non-safety applications

引用

Digital Communications and Networks 2018年第3期4卷 189-199页

作者： S.K. Bhoi P.M. Khilar M. Singh R.R. Sahoo R.R. Swain Department of Computer Science and Engineering ParMa Maharaja Engineering College (Govt.) Berharnpur 761003 India Parallel and Distributed Computing Lob Department of Compeer Science and Engineering National Institute of Technology Rourkela 769008 India Department of Computer Science and Engineering VIT University Bhopal 466114 India

The Urban Vehicular Ad Hoc Network （UVANET） provides non-safety applications like media sharing, internet service, file transfer, gaming, and so on. Routing plays an important role in providing better services to the users in UVANET. In this paper, a novel routing protocol is proposed for UVANET to support non-safety applications. We consider a non-safety application wherein the drivers and passengers of different parking lots can play multiplayer games with each other. To play the games smoothly, the game data should reach the destination in a minimum time. Simulation results show that when the vehicle density in the city area is high, the proposed protocol meets the end-to-end delay tolerance of 100 ms. Finally, an experiment is performed to validate the proposed routing protocol by running a simple puzzle game in a UVANET prototype designed in an indoor laboratory environment and in an outdoor environment.

关键词： UVANET Non-safety applications Routing Gaming Slow-paced games

来源：评论

学校读者我要写书评

暂无评论

Correction to: A compressed matrix sequence method for solving normal equations of bundle adjustment

引用

Machine Vision and Applications 2021年第4期32卷 1-1页

作者： Peng, Jiaxin Liu, Jie Wei, Hua Laboratory of Software Engineering for Complex Systems School of Computer Science National University of Defense Technology Changsha China Parallel and Distributed Processing Laboratory School of Computer Science National University of Defense Technology Changsha China Algorithm Lab Changsha Morale Network Technology Co. Ltd. Changsha China Water and Land Resources Research Center of the Middle Reaches of Yangtze River School of Resources Environment Science and Engineering Hubei University of Science and Technology Xianning China

A correction to this paper has been published: https://***/10.1007/s00138-021-01222-5

关键词：

来源：评论

学校读者我要写书评

暂无评论

Density-Attentive Head Detector for Crowd Counting

Density-Attentive Head Detector for Crowd Counting

引用

International Conference on Data science and Business Analytics (ICDSBA)

作者： Ziyu Zhao Xingyu Shen Long Lan Xiaoyao Yin Xiang Zhang Yonggang Che Zhigang Luo College of Computer National University of Defense Technology Changsha China Institute for Quantum Information & State Key Laboratory of High Performance Computing National University of Defense Technology Changsha China Science and Technology on Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (数字)9781728146447

ISBN: (纸本)9781728146454

In crowd counting, regression-based method shows better performance in extreme density scenes by introduces a density map. However, the regression-based method fails to locate the positions of each head, which significantly restricts its applications. Detection-based method counts each head with their accurate locations but works only in middle or low-level density scenes. In this paper, a joint learning method, named Density-attentive Head Detector (DAHD) is developed to overcome their respective shortcomings via a multi-task training procedure. Specifically, to guarantee the sensitivity of the detector to small or partially occluded heads, we carefully equip the detector with a density map which learned from regression module. Moreover, a novel Dilated Feature Pyramid Network (DFPN) is introduced to our method to enlarge the receptive field of convolutional kernel, bringing confirmative additional benefits to identify small heads. Experiments on the popular ShanghaiTech and Mall datasets confirm the improved performance of DAHD compared with the current detection-based approaches, and a comparable performance to regression-based approaches in term of counting.

关键词： Detectors Feature extraction Object detection Faces Kernel Training Task analysis

来源：评论

学校读者我要写书评

暂无评论

Attention-based fault-tolerant approach for multi-agent reinforcement learning systems

arXiv

引用

arXiv 2019年

作者： Geng, Mingyang Xu, Kele Li, Yiying Liu, Shuqi Ding, Bo Wang, Huaimin National Key Laboratory of Parallel and Distributed Processing College of Computer National University of Defense Technology Changsha410073 China National Key Laboratory of Big Data Management and Analysis Northeastern University Shenyang110000 China

The aim of multi-agent reinforcement learning systems is to provide interacting agents with the ability to collaboratively learn and adapt to the behavior of other agents. In many real-world applications, the agents can only acquire a partial view of the world. However, in realistic settings, one or more agents that show arbitrarily faulty or malicious behavior may suffice to let the current coordination mechanisms fail. In this paper, we study a practical scenario considering the security issues in the presence of agents with arbitrarily faulty or malicious behavior. Under these circumstances, learning an optimal policy becomes particularly challenging, even in the unrealistic case that an agent's policy can be made conditional upon all other agents' observations. To overcome these difficulties, we present an Attention-based Fault-Tolerant (FT-Attn) algorithm which selects correct and relevant information for each agent at every time-step. The multi-head attention mechanism enables the agents to learn effective communication policies through experience concurrently to the action policies. Empirical results have shown that FT-Attn beats previous state-of-the-art methods in some complex environments and can adapt to various kinds of noisy environments without tuning the complexity of the algorithm. Furthermore, FT-Attn can effectively deal with the complex situation where an agent needs to reach multiple agents' correct observation at the same time. Copyright © 2019, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：