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

9th Asia-Pacific Symposium on Internetware, Internetware 2017

作者： Yang, Cheng Zhang, Xunhui Zeng, Lingbin Fan, Qiang Yin, Gang Wang, Huaimin National Laboratory for Parallel and Distributed Processing College of Computer Changsha Hunan410073 China

ISBN: (纸本)1595930361

Code review is an important process to reduce code defects and improve software quality. However, in social coding communities using the pull-based model, everyone can submit code changes, which increases the required code review efforts. Therefore, there is a great need of knowing the process of code review and analyzing the pre-existing reviewer recommendation algorithms. In this paper, we do an empirical study about the PRs and their reviewers in Rails project. Moreover, we reproduce a popular and effective IR-based code reviewer recommendation algorithm and validate it on our dataset which contains 16,049 *** find that the inactive reviewers are very important to code reviewing process, however, the pre-existing method's recommendation result strongly depends on the activeness of reviewers. © 2017 Association for Computing Machinery.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

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

关键词：

来源：评论

学校读者我要写书评

暂无评论

High Performance Graph Analytics with Productivity on Hybrid CPU-GPU Platforms

High Performance Graph Analytics with Productivity on Hybrid...

引用

2018年第二届高性能编译、计算和通信国际会议

作者： Haoduo Yang Huayou Su Qiang Lan Mei Wen Chunyuan Zhang Department of Computer National University of Defense Technology National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology

In recent years, the rapid-growing scales of graphs have sparked a lot of parallel graph analysis frameworks to leverage the massive hardware resources on CPUs or GPUs. Existing CPU implementations are time-consuming, while GPU implementations are restricted by the memory space and the complexity of programming. In this paper, we present a high performance hybrid CPU-GPU parallel graph analytics framework with good productivity based on GraphMat. We map vertex programs to generalized sparse matrix vector multiplication on GPUs to deliver high performance, and propose a high-level abstraction for developers to implement various graph algorithms with relatively little efforts. Meanwhile, several optimizations have been adopted for reducing the communication cost and leveraging hardware resources, especially the memory hierarchy. We evaluate the proposed framework on three graph primitives(PageRank, BFS and SSSP) with large-scale graphs. The experimental results show that, our implementation achieves an average speedup of 7.0 X than GraphMat on two 6-core Intel Xeon CPUs. It also has the capability to process larger datasets but achieves comparable performance than MapGraph, a state-of-theart GPU-based framework.

关键词： parallel Computing Graph Analytics Hybrid CPU-GPU

来源：评论

学校读者我要写书评

暂无评论

Learning from internet: Handling uncertainty in robotic environment modeling 17

Learning from internet: Handling uncertainty in robotic envi...

引用

9th Asia-Pacific Symposium on Internetware, Internetware 2017

作者： Li, Yiying Wang, Huaimin Ding, Bo Che, Huimin National Key Laboratory of Parallel and Distributed Processing College of Computer National University of Defense Technology ChangSha China

ISBN: (纸本)1595930361

Uncertainty is a great challenge for environment perception of autonomous robots. For instance, while building semantic maps (i.e., maps with semantic labels such as object names), the robot may encounter unexpected objects of which it has no knowledge. It will lead to inevitable failures in traditional environment modeling software. The abundant knowledge being accumulated on the Internet has the potential to assist robots to handle such kind of uncertainty. However, existing researches have not touched this issue yet. This paper proposes a cloud-based semantic mapping engine named SemaCloud, which can not only augment robot's environment modeling capability by the rich cloud resources but also cope with uncertainty by utilizing the Internet knowledge on necessary. It adopts a state-of-art Deep Neural Network (DNN) for real-time and accurate recognition of pre-trained objects. If an object is beyond the knowledge of this DNN, a special mechanism named QoS-aware cloud phase transition is triggered to seek help from existing recognition services on the Internet. By a set of carefullydesigned algorithms, it can maximize benefits and minimize the negative impacts on the Quality of Service (QoS) properties of robotic applications, which is essential to many robot scenarios. The experiments on both open datasets and real robots show that our work can handle uncertainty successfully in robotic semantic mapping without sacrificing critical real-time constraints. © 2017 Association for Computing Machinery.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Detecting duplicate pull-requests in GitHub 17

Detecting duplicate pull-requests in GitHub

引用

9th Asia-Pacific Symposium on Internetware, Internetware 2017

作者： Li, Zhixing Yin, Gang Yu, Yue Wang, Tao Wang, Huaimin National Laboratory for Parallel and Distributed Processing College of Computer National University of Defense Technology Changsha410073 China

ISBN: (纸本)1595930361

The widespread use of pull-requests boosts the development and evolution for many open source software projects. However, due to the parallel and uncoordinated nature of development process in GitHub, duplicate pull-requests may be submitted by different contributors to solve the same problem. Duplicate pull-requests increase the maintenance cost of GitHub, result in the waste of time spent on the redundant effort of code review, and even frustrate developers' willing to offer continuous contribution. In this paper, we investigate using text information to automatically detect duplicate pull-requests in GitHub. For a new-arriving pull-request, we compare the textual similarity between it and other existing pull-requests, and then return a candidate list of the most similar *** evaluate our approach on three popular projects hosted in GitHub, namely Rails, Elasticsearch and ***. The evaluation shows that about 55.3% - 71.0% of the duplicates can be found when we use the combination of title similarity and description similarity. © 2017 Association for Computing Machinery.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

RZKPB: A Privacy-Preserving Blockchain-Based Fair Transaction Method for Sharing Economy

RZKPB: A Privacy-Preserving Blockchain-Based Fair Transactio...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Bin Li Yijie Wang Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Hunan Changsha P.R. China

Emerging blockchain systems have been widely adopted in sharing economy, such as e-commerce, to allow mutually distrustful parties to transact fairly without trusted parties. Most blockchain systems, however, lack transactional privacy protection. All transactions, including trading relationship between pseudonyms and content transacted, are exposed on the blockchain. Although many existing privacy protection methods on the blockchain have been proposed, it is difficult to find a trade-off between keeping speed and protecting privacy of transactions. To address this limitation, we propose a novel privacy-preserving method RZKPB that does not store financial transactions in clear on the blockchain, thus retaining transactional privacy from the public's view. Meanwhile, these transactions are as proofs to solve disputes between trading partners. RZKPB ensures fairness and privacy of transactions between participants without adding a new trusted party and breaking the verifying protocol on the blockchain. We take the e-commerce as an example in sharing economy to introduce RZKPB in our paper. Our experimental results show that compared with existing privacy-preserving methods based on the blockchain, RZKPB is more efficient under different settings.

关键词： Privacy Protocols Encryption Distortion

来源：评论

学校读者我要写书评

暂无评论

FPPB: A Fast and Privacy-Preserving Method Based on the Permissioned Blockchain for Fair Transactions in Sharing Economy

FPPB: A Fast and Privacy-Preserving Method Based on the Perm...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Bin Li Yijie Wang Peichang Shi Huan Chen Li Cheng Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha Hunan P.R. China

Blockchain is a distributed system with efficient transaction recording and has been widely adopted in sharing economy. Although many existing privacy-preserving methods on the blockchain have been proposed, finding a trade-off between keeping speed and preserving privacy of transactions remain challenging. To address this limitation, we propose a novel Fast and Privacy-preserving method based on the Permissioned Blockchain (FPPB) for fair transactions in sharing economy. Without breaking the verifying protocol and bringing additional off-blockchain interactive communication, FPPB protects the privacy and fairness of transactions. Additionally, experiments are implemented in EthereumJ (a Java implementation of the Ethereum protocol) to measure the performance of FPPB. Compared with normal transactions without cryptographic primitives, FPPB only slows down transactions slightly.

关键词： Privacy Cloud computing Encryption Registers Protocols

来源：评论

学校读者我要写书评

暂无评论

Towards a multi-array architecture for accelerating large-scale matrix multiplication on FPGAs

arXiv

引用

arXiv 2018年

作者： Shen, Junzhong Qiao, Yuran Huang, You Wen, Mei Zhang, Chunyuan College of Computer National University of Defense Technology Changsha410073 China National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha410073 China

Large-scale floating-point matrix multiplication is a fundamental kernel in many scientific and engineering applications. Most existing work only focus on accelerating matrix multiplication on FPGA by adopting a linear systolic array. This paper towards the extension of this architecture by proposing a scalable and highly configurable multi-array architecture. In addition, we propose a work-stealing scheme to ensure the equality in the workload partition among multiple linear arrays. Furthermore, an analytical model is developed to determine the optimal design parameters. Experiments on a real-life convolutional neural network (CNN) show that we can obtain the optimal extension of the linear array architecture. Copyright © 2018, The Authors. All rights reserved.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

DSDR: Dynamic Semantic Discard Reader for Open-Domain Question Answering

DSDR: Dynamic Semantic Discard Reader for Open-Domain Questi...

引用

International Joint Conference on Neural Networks

作者： Xu Wang Zhen Huang Yiming Zhang Ludan Tan Yang Liu Science and Technology on Parallel and Distributed Laboratory College of Computer National University of Defense Technology Changsha China

Open-domain question answering (QA) is an important problem in natural language processing. A QA system usually consists of an information retrieve (IR) model for finding the relevant passages that may have answers and a read comprehension (RC) model for generating answers from the selected passages. The state-of-the-art RC model uses all the passages for feature extraction when matching semantic information of text pairs. In this paper, however, we argue that the texts of passages often have different importance for specific questions and some even provide negative information that might affect the correctness of final prediction. To address this problem, we design dynamic semantic discard reader (DSDR), a deep model that tries to drop negative information irrelevant to the questions. The result of our experiment shows that DSDR outperforms existing methods in the exact-match and F1 scores on open-domain QA datasets.

关键词： Semantics Feature extraction Neural networks Encoding TV Task analysis Numerical models

来源：评论

学校读者我要写书评

暂无评论

DEEP IMAGE CLUSTERING USING CONVOLUTIONAL AUTOENCODER EMBEDDING WITH INCEPTION-LIKE BLOCK

DEEP IMAGE CLUSTERING USING CONVOLUTIONAL AUTOENCODER EMBEDD...

引用

IEEE International Conference on Image processing

作者： Qiang Wang Jiaqing Xu Rongchun Li Peng Qiao Ke Yang Shijie Li Yong Dou National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China School of Computer National University of Defense Technology Changsha China

Image clustering is one of the challenging tasks in machine learning, and has been extensively used in various applications. Recently, various deep clustering methods has been proposed. These methods take a two-stage approach, feature learning and clustering, sequentially or jointly. We observe that these works usually focus on the combination of reconstruction loss and clustering loss, relatively little work has focused on improving the learning representation of the neural network for clustering. In this paper, we propose a deep convolutional embedded clustering algorithm with inception-like block (DCECI). Specifically, an inception-like block with different type of convolution filters are introduced in the symmetric deep convolutional network to preserve the local structure of convolution layers. We simultaneously minimize the reconstruction loss of the convolutional autoencoders with inception-like block and the clustering loss. Experimental results on multiple image datasets exhibit the promising performance of our proposed algorithm compared with other competitive methods.

关键词： Convolutional codes Convolution Clustering algorithms Image reconstruction Decoding Clustering methods Task analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：