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

IEEE International Conference on Software Reliability Engineering Workshops (ISSRE Wksp)

作者： Jingwen Zhou Zhenbang Chen Ji Wang Zibin Zheng Wei Dong College of Computer National University of Defense Technology Changsha China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China Shenzhen Research Institute The Chinese University of Hong Kong Shenzhen China

Cloud computing provides a new paradigm for resource utilization and sharing. However, the reliability problems, like system failures, often happen in cloud systems and bring enormous loss. Trace-oriented monitoring is an important runtime method to improve the reliability of cloud systems. In this paper, we propose to bring runtime verification into trace-oriented monitoring, to facilitate the specification of monitoring requirements and to improve the efficiency of monitoring cloud systems. Based on a data set collected from a cloud storage system in a real environment, we validate our approach by monitoring the critical properties of the storage system. The preliminary experimental results indicate the promise of our approach.

关键词： Monitoring Runtime Cloud computing Educational institutions Reliability Google Computers

来源：评论

学校读者我要写书评

暂无评论

Approximate Maximum Common Sub-graph Isomorphism Based on Discrete-Time Quantum Walk

Approximate Maximum Common Sub-graph Isomorphism Based on Di...

引用

International Conference on Pattern Recognition

作者： Kai Lu Yi Zhang Kai Xu Yinghui Gao Richard C. Wilson Science and Technology on Parallel and Distributed Processing Laboratory and College of Computer National University of Defense Technology Changsha P.R. China College of Electronic Science and Engineering National University of Defense Technology Changsha P.R. China Department of Computer Science University of York York UK

Maximum common sub-graph isomorphism (MCS) is a famous NP-hard problem in graph processing. The problem has found application in many areas where the similarity of graphs is important, for example in scene matching, video indexing, chemical similarity and shape analysis. In this paper, a novel algorithm Qwalk is proposed for approximate MCS, utilizing the discrete-time quantum walk. Based on the new observation that isomorphic neighborhood group matches can be detected quickly and conveniently by the destructive interference of a quantum walk, the new algorithm locates an approximate solution via merging neighborhood groups. Experiments show that Qwalk has better accuracy, universality and robustness compared with the state-of-the-art approximate MCS methods. Meanwhile, Qwalk is a general algorithm to solve the MCS problem approximately while having modest time complexity.

关键词： Approximation algorithms Interference Algorithm design and analysis Accuracy Time complexity Quantum computing Noise

来源：评论

学校读者我要写书评

暂无评论

Overlapping community detection via link partition of asymmetric weighted graph

Overlapping community detection via link partition of asymme...

引用

International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)

作者： Wenju Zhang Naiyang Guan Xuhui Huang Zhigang Luo Jianwu Li Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha Hunan P.R. China 410073 National University of Defense Technology Changsha Hunan CN Beijing Institute of Technology Beijing Beijing CN

Link partition clusters edges of a complex network to discover its overlapping communities. Due to Its effectiveness, link partition has attracted much attentions from the network science community. However, since link partition assigns each edge of a network to unique community, it cannot detect the disjoint communities. To overcome this deficiency, this paper proposes a link partition on asymmetric weighted graph (LPAWG) method for detecting overlapping communities. Particularly, LPAWG divides each edge into two parts to distinguish the roles of connected nodes. This strategy biases edges to a specific node and helps assigning each node to its affiliated community. Since LPAWG introduces more edges than those in the original network, it cannot efficiently detect communities from some networks with relative large amount of edges. We therefore aggregate the line graph of LPAWG to shrink its scale. Experimental results of community detection on both synthetic datasets and the realworld networks show the effectiveness of LPAWG comparing with the representative methods.

关键词： Communities Image edge detection Partitioning algorithms Benchmark testing Acceleration Educational institutions Complex networks

来源：评论

学校读者我要写书评

暂无评论

Power and performance analysis of the Graph 500 benchmark on the Single-chip Cloud Computer

Power and performance analysis of the Graph 500 benchmark on...

引用

International Conference on Cloud Computing and Internet of Things (CCIOT)

作者： Zhiquan Lai King Tin Lam Cho-Li Wang Jinshu Su College of Computer National University of Defense Technology Changsha China Department of Computer Science The University of Hong Kong Hong Kong China National Key Laboratory of Parallel and Distributed Processing (PDL) Changsha China

ISBN: (纸本)9781479947638

The concerns of data-intensiveness and energy awareness are actively reshaping the design of high-performance computing (HPC) systems nowadays. The Graph500 is a widely adopted benchmark for evaluating the performance of computing systems for data-intensive workloads. In this paper, we introduce a data-parallel implementation of Graph500 on the Intel Single-chip Cloud Computer (SCC). The SCC features a non-coherent many-core architecture and multi-domain on-chip DVFS support for dynamic power management. With our custom-made shared virtual memory programming library, memory sharing among threads is done efficiently via the shared physical memory (SPM) while the library has taken care of the coherence. We conduct an in-depth study on the power and performance characteristics of the Graph500 workloads running on this system with varying system scales and power states. Our experimental results are insightful for the design of energy-efficient many-core systems for data-intensive applications.

关键词： Kernel Benchmark testing Computer architecture Programming Power measurement Computational modeling Runtime

来源：评论

学校读者我要写书评

暂无评论

RAFlow: Read Ahead Accelerated I/O Flow through Multiple Virtual Layers

RAFlow: Read Ahead Accelerated I/O Flow through Multiple Vir...

引用

International Conference on Networking, Architecture, and Storage (NAS)

作者： Zhaoning Zhang Kui Wu Huiba Li Jinghua Feng Yuxing Peng Xicheng Lu National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology China Computer Science Department University of Victoria B.C. Canada National Super Computing Center Tianjin China

Virtualization is the foundation for cloud computing, and the virtualization can not be achieved without software defined, elastic, flexible and scalable virtual layers. Unfortunately, if multiple virtual storage devices are chained together, the system may be subject to severe performance degradation. While the read-ahead (RA) mechanism in storage devices plays a very important role to improve I/O performance, RA may not be effective as expected for multiple virtualization layers, since it is originally designed for one layer only. When I/O requests are passed through a long I/O path, they may trigger a chain reaction and lead to unnecessary data transmission and thus bandwidth waste. In this paper, we study the dynamic behavior of RA through multiple I/O layers and demonstrate that if controlled well, RA can greatly accelerate I/O speed. We present RAFlow, a RA control mechanism, to effectively improve I/O performance by strategically expanding RA window at each layer. Our real-world experiments show that it can achieve 20% to 50% performance improvement in I/O paths with up to 8 virtualized storage devices.

关键词： Radio access networks Acceleration Distributed databases Performance evaluation Synchronization Benchmark testing Degradation

来源：评论

学校读者我要写书评

暂无评论

Correntropy induced metric based graph regularized non-negative matrix factorization

Correntropy induced metric based graph regularized non-negat...

引用

International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)

作者： Bin Mao Naiyang Guan Dacheng Tao Xuhui Huang Zhigang Luo College of Science National University of Defense Technology Changsha China College of Computer National University of Defense Technology Science and Technology on Parallel and Distributed Processing Laboratory Changsha China Department of Computer Science and Technology College of Computer National University of Defense Technology Changsha China Faculty of Engineering and Information Technology University of Technology Sydney Sydney NSW Australia

Non-negative matrix factorization (NMF) is an efficient dimension reduction method and plays an important role in many pattern recognition and computer vision tasks. However, conventional NMF methods are not robust since the objective functions are sensitive to outliers and do not consider the geometric structure in datasets. In this paper, we proposed a correntropy graph regularized NMF (CGNMF) to overcome the aforementioned problems. CGNMF maximizes the correntropy between data matrix and its reconstruction to filter out the noises of large magnitudes, and expects the coefficients to preserve the intrinsic geometric structure of data. We also proposed a modified version of our CGNMF which construct the adjacent graph by using sparse representation to enhance its reliability. Experimental results on popular image datasets confirm the effectiveness of CGNMF.

关键词： Robustness Vectors Clustering algorithms Mutual information Measurement Computer integrated manufacturing

来源：评论

学校读者我要写书评

暂无评论

TRANSDUCTIVE NONNEGATIVE MATRIX FACTORIZATION FOR SEMI-SUPERVISED HIGH-PERFORMANCE SPEECH SEPARATION

TRANSDUCTIVE NONNEGATIVE MATRIX FACTORIZATION FOR SEMI-SUPER...

引用

IEEE International Conference on Acoustics, Speech and Signal processing

作者： Naiyang Guan Long Lan Dacheng Tao Zhigang Luo Xuejun Yang Science and Technology on Parallel and Distributed Processing Laboratory School of Computer Science National University of Defense Technology Changsha Hunan 410073 China Centre for Quantum Computation and Intelligent Systems FEIT University of Technology Sydney Sydney NSW 2007 Australia State Key Laboratory of High Performance Computing National University of Defense Technology Changsha Hunan 410073 China

ISBN: (纸本)9781479928941

Regarding the non-negativity property of the magnitude spectrogram of speech signals, nonnegative matrix factorization (NMF) has obtained promising performance for speech separation by independently learning a dictionary on the speech signals of each known speaker. However, traditional NM-F fails to represent the mixture signals accurately because the dictionaries for speakers are learned in the absence of mixture signals. In this paper, we propose a new transductive NMF algorithm (TNMF) to jointly learn a dictionary on both speech signals of each speaker and the mixture signals to be separated. Since TNMF learns a more descriptive dictionary by encoding the mixture signals than that learned by NMF, it significantly boosts the separation performance. Experiments results on a popular TIMIT dataset show that the proposed TNMF-based methods outperform traditional NMF-based methods for separating the monophonic mixtures of speech signals of known speakers.

关键词： Speech Dictionaries as Topic Loudspeakers NMF protocol signals mixtures factorization HIGH-PERFORMANCE

来源：评论

学校读者我要写书评

暂无评论

Trace Bench: An Open Data Set for Trace-Oriented Monitoring

Trace Bench: An Open Data Set for Trace-Oriented Monitoring

引用

IEEE International Conference on Cloud Computing technology and science (CloudCom)

作者： Jingwen Zhou Zhenbang Chen Ji Wang Zibin Zheng Michael R. Lyu College of Computer National University of Defense Technology Changsha China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China Shenzhen Research Institute The Chinese University of Hong Kong Shenzhen China Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong China

User request trace-oriented monitoring is an effective method to improve the reliability of cloud systems. However, there are some difficulties in getting traces in practice, which hinder the development of trace-oriented monitoring research. In this paper, we release a fine-grained user request-centric open trace data set, called Trace Bench, collected on a real world cloud storage system deployed in a real environment. During collecting, many aspects are considered to simulate different scenarios, including cluster size, request type, workload speed, etc. Besides recording the traces when the monitored system is running normally, we also collect the traces under the situation with faults injected. With a mature injection tool, 14 faults are introduced, including function faults and performance faults. The traces in Trace Bench are clustered in different files, where each file corresponds to a certain scenario. The whole collection work lasted for more than half a year, resulting in more than 360, 000 traces in 361 files. In addition, we also employ several applications based on Trace Bench, which validate the helpfulness of Trace Bench for the field of trace-oriented monitoring.

关键词： Monitoring Servers Educational institutions Instruments Cloud computing Context Fault diagnosis

来源：评论

学校读者我要写书评

暂无评论

Improved algorithm for reconstructing singular connection in multi-block CFD applications

引用

Transactions of Nanjing University of Aeronautics and Astronautics 2013年第SUPPL.1期30卷 51-57页

作者： Wang, Yongxian Zhang, Lilun Che, Yonggang Xu, Chuanfu Liu, Wei Liu, Huayong Wang, Zhenghua College of Computer 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 State Key Laboratory of Aerodynamics Mianyang 621000 China

An improved algorithm is proposed for the reconstruction of singular connectivity from the available pairwise connections during preprocessing phase. To evaluate the performance of the algorithm, an in-house computational fluid dynamics (CFD) code is used in which high-order finite-difference method for spatial discretization running on the Tianhe-1A supercomputer is employed. Test cases with a varied amount of mesh points are chosen, and the test results indicate that the improved singular connection reconstruction algorithm can achieve a speedup of 2000× at least when compared with the naive search method adopted in the former version of our code. Moreover, the parallel efficiency can benefit from the strategy of local communication based on the algorithm.

关键词： Finite difference method

来源：评论

学校读者我要写书评

暂无评论

HESA: The construction and evaluation of hierarchical software feature repository 25

HESA: The construction and evaluation of hierarchical softwa...

引用

25th International Conference on Software Engineering and Knowledge Engineering, SEKE 2013

作者： Yu, Yue Wang, Huaimin Yin, Gang Li, Xiang Yang, Cheng National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha China

ISBN: (纸本)1891706330

Nowadays, the demand for software resources on different granularity is becoming prominent in software engineering field. However, a large quantity of heterogeneous software resources have not been organized in a reasonable and efficient way. Software features, a kind of important knowledge for software reuse, are ideal materials to characterize software resources. Our preliminary study shows that the effectiveness of feature-related tasks, such as software resource retrieval and feature location, will be greatly improved, if a multi-grained feature repository is available. In this paper, we construct a Hierarchical rEpository of Software feAture (HESA), in which a novel hierarchical clustering approach is proposed. For a given domain, we first aggregate a large number of feature descriptions from multiple online software repositories. Then we cluster these descriptions into a flexible hierarchy by mining their hidden semantic structures. Finally, we implement an online search engine on HESA and conduct a user study to evaluate our approach quantitatively. The results show that HESA can organize software features in a more reasonable way compared to the classic and the state-of-the-art approaches. Copyright © 2013 by Knowledge Systems Institute Graduate School.

关键词： Computer software reusability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：