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

作者： Wang, Tao Wang, Huaimin Yin, Gang Yang, Cheng Li, Xiang Zou, Peng Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China Department of Computer Science University of Western Ontario London ON N6A 5B7 Canada Academy of Equipment Beijing 100000 China

The large amounts of freely available open source software over the Internet are fundamentally changing the traditional paradigms of software development. Efficient categorization of the massive projects for retrieving relevant software is of vital importance for Internet-based software development such as solution searching, best practices learning and so on. Many previous works have been conducted on software categorization by mining source code or byte code, but were verified on only relatively small collections of projects with coarse-grained categories or clusters. However, Internet-based software development requires finer-grained, more scalable and language-independent categorization approaches. In this paper, we propose a novel approach to hierarchically categorize software projects based on their online profiles. We design a SVMbased categorization framework and adopt a weighted combination strategy to aggregate different types of profile attributes from multiple repositories. Different basic classification algorithms and feature selection techniques are employed and compared. Extensive experiments are carried out on more than 21,000 projects across five repositories. The results show that our approach achieves significant improvements by using weighted combination. Compared to the previous work, our approach presents competitive results with more finer-grained and multi-layered category hierarchy with more than 120 categories. Unlike approaches that use source code or byte code, our approach is more effective for large-scale and languageindependent software categorization. In addition, experiments suggest that hierarchical categorization combined with general keyword-based searching improves the retrieval efficiency and accuracy. Copyright © 2014 The Institute of Electronics, Information and Communication Engineers.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Elastic Allocator: An Adaptive Task Scheduler for Streaming Query in the Cloud

Elastic Allocator: An Adaptive Task Scheduler for Streaming ...

引用

2014 IEEE 8th International Symposium on Service Oriented System Engineering

作者： Zheng Han Rui Chu Haibo Mi Huaimin Wang Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha Hunan China

Many big data applications receive and process data in real time. These data, also known as data streams, are generated continuously and processed online in a low latency manner. Data stream is prone to change dramatically in volume, since its workload may have a variation of several orders between peak and valley periods. Fully provisioning resources for stream processing to handle the peak load is costly, while over-provisioning is wasteful when to deal with lightweight workload. Cloud computing emphasizes that resource should be utilized economically and elastically. An open question is how to allocate query task adaptively to keeping up the input rate of the data stream. Previous work focuses on using either local or global capacity information to improve the cluster CPU resource utilization, while the bandwidth utilization which is also critical to the system throughput is ignored or simplified. In this paper, we formalize the operator placement problem considering both the CPU and bandwidth usage, and introduce the Elastic Allocator. The Elastic Allocator uses a quantitative method to evaluate a node's capacity and bandwidth usage, and exploit both the local and global resource information to allocate the query task in a graceful manner to achieve high resource utilization. The experimental results and a simple prototype built on top of Storm finally demonstrate that Elastic Allocator is adaptive and feasible in cloud computing environment, and has an advantage of improving and balancing system resource utilization.

关键词： Bandwidth Resource management Clustering algorithms Storms Linear programming Cloud computing Computer architecture

来源：评论

学校读者我要写书评

暂无评论

A multi-layered emulation platform to verify the effectiveness of consistency control approaches about message ordering

A multi-layered emulation platform to verify the effectivene...

引用

IEEE International Conference on Communication Software and Networks

作者： Zhou, Hangjun Fu, Sha Department of Information Management Hunan University of Finance and Economics Chang Sha Hu Nan China Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing School of Computer Science National University of Defense Technology Chang Sha Hu Nan China

ISBN: (纸本)9781612844855

It is an important issue to preserve the consistent delivering order of messages at each site in distributed Virtual Environments(DVEs). Currently, the violations of message delivery order are inclined to happen in the large-scale and frequently interactive DVEs running on Wide Area Network(WAN). The inconsistent anomalies are characterized as unpredictable, unrepeatable and uncontrollable, which results in the severe problem for the development of the consistency control approaches. Meanwhile, it is also highly expensive to directly verify the proposed approaches on WAN. Therefore, in this paper, we design and establish an original multi-layered emulation platform in LAN, which can emulate the network latency of WAN and repeat the scenarios of violations. On the platform, the designers of consistency approaches don't have to spend efforts to realize the fundamental functions of the verification, but could pay more attention to the development and optimization of the control algorithms, which is very beneficial for the improvement of message ordering approaches. © 2011 IEEE.

关键词： Wide area networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An unsupervised deep learning framework for gene regulatory network inference from single-cell expression data

An unsupervised deep learning framework for gene regulatory ...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Guo Mao Jie Liu Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China Laboratory of Software Engineering for Complex System National University of Defense Technology Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

Recent advances in single-cell RNA sequencing (scRNA-seq) technology provides unprecedented opportunities for reconstruction gene regulation networks (GRNs). At present, many different models have been proposed to infer GRN from a large number of RNA-seq data, but most deep learning models use a priori gene regulatory network to infer potential GRNs. It is a challenge to reconstruct GRNs from scRNA-seq data due to the noise and sparsity introduced by the dropout effect. Here, we propose GAALink, a novel unsupervised deep learning method. It first constructs the gene similarity matrix and then refines it by threshold value. It then learns feature representations of genes through a graphical attention autoencoder that propagates information across genes with different weights. Finally, we use gene feature expression for matrix completion such that the GRNs are reconstructed. Compared with seven existing GRNs reconstruction methods, GAALink achieves more accurate performance on seven scRNA-seq dataset with four ground truth networks. GAALink can provide a useful tool for inferring GRNs for scRNA-seq expression data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

RaceChecker: Efficient Identification of Harmful Data Races

RaceChecker: Efficient Identification of Harmful Data Races

引用

Euromicro Conference on Parallel, distributed and Network-Based processing

作者： Kai Lu Zhendong Wu Xiaoping Wang Chen Chen Xu Zhou Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha PR China

ISBN: (纸本)9781479984923

Data races hidden in concurrent programs have caused severe failures. To improve the reliability, many race detectors are proposed. However, most of the reported races are not harmful, which consumes manual effort to identify the harmful races. This paper proposes RaceChecker that can detect the potential races and identify the harmful races effectively and efficiently. Unlike previous detectors, RaceChecker combines happens-before relation and ad-hoc synchronization to prune the infeasible races so that fewer potential races are required to be verified. Before verification, RaceChecker groups the remaining potential races, guaranteeing the potential races in one group do not interfere with each other. Therefore, multiple potential races in one group can be verified together in one execution. To our knowledge, this is the first effective technique that groups the potential races to improve the efficiency. Unlike previous detectors that verify one potential race in one execution, RaceChecker dynamically controls thread scheduler to create real race conditions to verify multiple potential races in one execution, identifying the harmful races that cause program failures. We have implemented RaceChecker as a prototype tool and have experimented on a number of real-world concurrent programs. Results show that 66% of the potential races are infeasible and nearly 48% of the executions are reduced by the grouping strategy. The known harmful races are also identified effectively. By pruning and grouping, RaceChecker identifies the harmful races more efficiently. Comparing with RaceMob and RaceFuzzer, the time is reduced significantly, with an average of 45% and 81% respectively.

关键词： Detectors Synchronization Concurrent computing Programming Relays Instruction sets Monitoring

来源：评论

学校读者我要写书评

暂无评论

Transformer in reinforcement learning for decision-making:a survey

引用

Frontiers of Information technology & Electronic Engineering 2024年第6期25卷 763-790页

作者： Weilin YUAN Jiaxing CHEN Shaofei CHEN Dawei FENG Zhenzhen HU Peng LI Weiwei ZHAO College of Information and Communication National University of Defense TechnologyWuhan 430014China College of Intelligence Science and Technology National University of Defense TechnologyChangsha 410072China Laboratory for Parallel and Distributed Processing National University of Defense TechnologyChangsha 410072China

Reinforcement learning(RL)has become a dominant decision-making paradigm and has achieved notable success in many real-world ***,deep neural networks play a crucial role in unlocking RL’s potential in large-scale decision-making *** by current major success of Transformer in natural language processing and computer vision,numerous bottlenecks have been overcome by combining Transformer with RL for *** paper presents a multiangle systematic survey of various Transformer-based RL(TransRL)models applied in decision-making tasks,including basic models,advanced algorithms,representative implementation instances,typical applications,and known *** work aims to provide insights into problems that inherently arise with the current RL approaches,and examines how we can address them with better TransRL *** our knowledge,we are the first to present a comprehensive review of the recent Transformer research developments in RL for *** hope that this survey provides a comprehensive review of TransRL models and inspires the RL community in its pursuit of future *** keep track of the rapid TransRL developments in the decision-making domains,we summarize the latest papers and their open-source implementations at https://***/williamyuanv0/Transformer-in-Reinforcement-Learning-for-Decision-Making-A-Survey.

关键词： Transformer Reinforcement learning(RL) Decision-making(DM) Deep neural network(DNN) Multi-agent reinforcement learning(MARL) Meta-reinforcement learning(Meta-RL)

来源：评论

学校读者我要写书评

暂无评论

UWBSS: Ultra-wideband Spectrum Sensing with Multiple Sub-Nyquist Sampling Rates

UWBSS: Ultra-wideband Spectrum Sensing with Multiple Sub-Nyq...

引用

IEEE International Conference on Computational science and Engineering, CSE

作者： Yong Lu Shaohe Lv Xiaodong Wang Xingming Zhou Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781479979820

In consideration of the continuous increasing demand of wireless data transmission, ultra-wideband spectrum sensing is crucial to support the cognitive communication in a ultra-wide frequency band. However, it is challenging to design ADCs that fulfill the Nyquist rate requirement for a ultra wide band. Spectrum sensing based on the sub-Nyquist sampling maybe the answer. We propose UWBSS: ultra-wideband spectrum sensing. With multiple sub-Nyquist sampling rates, UWBSS can reconstruct the occupied frequencies from the under sampled data directly without complex amplitudes reconstruction. Also We conduct an extensive study to characterize the effect on the accuracy of sub-Nyquist spectrum sensing of sampling rate, bandwidth resolution and the SNR of the original signal. The performance of UWBSS is verified by simulations.

关键词： Sensors Signal to noise ratio Ultra wideband technology Signal resolution Wideband Energy resolution

来源：评论

学校读者我要写书评

暂无评论

Agent-Based Fault Tolerance Mechanism for distributed Key-Value Database

Agent-Based Fault Tolerance Mechanism for Distributed Key-Va...

引用

International Conference on Digital Home (ICDH)

作者： Wu Hui-jun Lu Kai GenLi Gen Jiang Jin-fei Wang Shuang-xi Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha PR China

ISBN: (纸本)9781479942831

distributed key-value database is widely used in Web 2.0 applications and cloud computing environments. It overcomes the weak performance and bad scalability of traditional relational database. But fault in distributed system will lead to errors, then the high performance is useless. So we should build a fault tolerance mechanism. On the other hand, in many application scenarios, transactional operations are inevitable. Some existing key-value databases utilize two-phase commit protocol or optimistic concurrency control in transaction processing. But the problems are sing-node failure and high overhead in protocol processing. Meanwhile, users' programming becomes more error-prone. This paper designs a fault tolerance and recovery mechanism on DStageDB, which is a distributed key-value database. We design an agent-based transaction processing mechanism. The transaction processing speed is improved and less user intervention is needed.

关键词： Servers Fault tolerance Fault tolerant systems distributed databases Protocols Usability

来源：评论

学校读者我要写书评

暂无评论

Adaptive simulations of viscous and inviscid detonations in supersonic combustible mixture 52nd

Adaptive simulations of viscous and inviscid detonations in ...

引用

52nd AIAA/SAE/ASEE Joint Propulsion Conference, 2016

作者： Cai, Xiaodong Liang, Jianhan Deiterding, Ralf Che, Yonggang Science and Technology on Scramjet Laboratory National University of Defense Technology ChangshaHunan410073 China Aerodynamics and Flight Mechanics Research Group University of Southampton Highfield Campus SouthamptonSO17 1BJ United Kingdom Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology ChangshaHunan410073 China

ISBN: (纸本)9781624104060

Two-dimensional high-resolution inviscid and viscous detonations were conducted in the supersonic combustible mixture with the open-source program AMROC. The results show that as the grid resolution increases, more small-scale vortices along the slip lines are generated in the inviscid detonation compared with the viscous one. The physical viscosity plays a major role in the whole diffusion effect, indicating that with the increasing of the grid resolution the viscous detonation can become convergent more easily. The diffusion effect brought by the physical viscosity can enhance the mixing of the unburned mixture with the combusted product, hence accelerating the consumption of the unburned reactant and the chemical heat release, and thus finally generating a stronger detonation than the inviscid one. The transverse wave of the viscous detonation can propagate faster, resulting in a lower periodic of the triple point oscillation than that of the inviscid one, mainly owing to the faster heat release resulting from the stronger diffusion effect. It is suggested that the strong diffusion effect involved in the viscous detonation can make a more significant impact on the suppression of the instability in the detonation front, thus eventually generating less triple points than the inviscid one, even with a larger overdrive degree. © 2016, American Institute of Aeronautics and Astronautics Inc, AIAA. All rights reserved.

关键词： Detonation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：