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

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

关键词：

来源：评论

学校读者我要写书评

暂无评论

Kraken: A continuous incremental data acquisition system for GitHub and git repositories 7

Kraken: A continuous incremental data acquisition system for...

引用

2017 7th International Workshop on Computer Science and Engineering, WCSE 2017

作者： Zeng, Lingbin Yin, Gang Wang, Tao Yu, Yue Fan, Qiang Li, Zhi-Xing Yu, Jie Wang, H.M. National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha410073 China

ISBN: (纸本)9789811136719

With the quick development of open source software, quantity of software is produced in the open source community (OSC) [1]. Lots of researches are launched to study the internal regular patterns of OSC [2], [3]. GitHub is one of the most famous open source community which owns thousands software projects. As a result, there are massive and abundant data of software development activities in GitHub. With the purpose to offer an accuracy and efficient dataset of GitHub, this paper proposes Kraken which is a continuous incremental data acquisition system for GitHub. Kraken contains three main modules which are independent with each other. Kraken gets the data of GitHub from two ways: git repositories and rest API. The final result shows that Kraken could extract the commits information of git repositories and get pull requests(PRs) and issues through rest API. The commits information contains the detail development history of software and the feedbacks and wisdom of software engineers are showed through PRs and issues.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Adaptive Linearized Alternating Direction Method of Multipliers for Non-Convex Compositely Regularized Optimization Problems

引用

Tsinghua Science and Technology 2017年第3期22卷 328-341页

作者： Linbo Qiao Bofeng Zhang Xicheng Lu Jinshu Su College of Computer National University of Defense Technologyand National Laboratory for Parallel and Distributed ProcessingNational University of Defense TechnologyChangsha 410073China College of Computer National University of Defense TechnologyChangsha 410073China

We consider a wide range of non-convex regularized minimization problems, where the non-convex regularization term is composite with a linear function engaged in sparse learning. Recent theoretical investigations have demonstrated their superiority over their convex counterparts. The computational challenge lies in the fact that the proximal mapping associated with non-convex regularization is not easily obtained due to the imposed linear composition. Fortunately, the problem structure allows one to introduce an auxiliary variable and reformulate it as an optimization problem with linear constraints, which can be solved using the Linearized Alternating Direction Method of Multipliers （LADMM）. Despite the success of LADMM in practice, it remains unknown whether LADMM is convergent in solving such non-convex compositely regularized optimizations. In this research, we first present a detailed convergence analysis of the LADMM algorithm for solving a non-convex compositely regularized optimization problem with a large class of non-convex penalties. Furthermore, we propose an Adaptive LADMM （AdaLADMM） algorithm with a line-search criterion. Experimental results on different genres of datasets validate the efficacy of the proposed algorithm.

关键词： adaptive linearized alternating direction method of multipliers non-convex compositely regularizedoptimization cappled-ll regularized logistic regression

来源：评论

学校读者我要写书评

暂无评论

A GPU-based parallel WFST decoder on nnet3

引用

AIP Conference Proceedings 2019年第1期2073卷

作者： Yong Wang Jie Liu Chen Zhou Zhengbin Pang Shengguo Li Chunye Gong Xinbiao Gan Yurong Li 1Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China

One performance-intensive part of automatic speech recognition is the weighted finite-state transducer (WFST) decoding. To solve the problem, we expand parallel Graphics processing Units (GPU) computing to the decoding period. We describe extension work based on Kaldi toolkit for speech recognition research. Our work can support weighted finite-state transducer decoding on Kaldi neural nets with CUDA toolkit. Our paper also expands an efficient parallel Viterbi beam decoding algorithm to decrease the speech recognition Real Time Factor (RTF) value. Together with our optimization algorithm, we have reached 2.3x speed up on the AISHELL corpus decoding. We also implement nnet3 decoder that improves real-time speed up with no word error rate raise.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

HPGA: A High-Performance Graph Analytics Framework on the GPU

HPGA: A High-Performance Graph Analytics Framework on the GP...

引用

International Conference on Information Systems and Computer Aided Education (ICISCAE)

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

ISBN: (纸本)9781538657393;9781538657386

In recent years, the rapidly growing use of graphs has sparked parallel graph analytics frameworks for leveraging the massive hardware resources, specifically graphics processing units (GPUs). However, the issues of the unpredictable control flows, memory divergence, and the complexity of programming have restricted high-level GPU graph libraries. In this work, we present HPGA, a high performance parallel graph analytics framework targeting the GPU. HPGA implements an abstraction which maps vertex programs to generalized sparse matrix operations on GPUs for delivering high performance. HPGA incorporates high-performance GPU computing primitives and optimization strategies with a high-level programming model. We evaluate the performance of HPGA for three graph primitives (BFS, SSSP, PageRank) with large-scale datasets. The experimental results show that HPGA matches or even exceeds the performance of MapGraph and nvGRAPH, two state-of-the-art GPU graph libraries.

关键词： Graphics processing units Sparse matrices Programming Computational modeling Arrays Optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：