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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Data storage optimization of application-level checkpointing on heterogeneous systems

Data storage optimization of application-level checkpointing...

引用

2013 IEEE Conference Anthology, ANTHOLOGY 2013

作者： Jia, Jia Song, Wei National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781479916603

General purpose GPU's (GPGPU) appearance made it possible that heterogeneous computing can be used by human beings. And it's also produce a reform for GPU's general purpose computing and parallel computing. Heterogeneous Systems has been adopted by large-scale of high-performance computers. Nowadays, fault tolerance technique is necessary among these large-scale kinds of scientific computing, but in a few years of GPGPU and heterogeneous system appearance, there is not an effective fault tolerance method come out, therefore, towards this situation, this paper will apply the traditional fault tolerance technique - application-level checkpointing to heterogeneous system. Cause the main solution of reducing overhead of the application-level checkpointing is reducing checkpoint data size, so after analyzing the heterogeneous system and GPGPU program, we propose a method to optimize the data storage of application-level checkpointing technique and validate its optimization by experiments. © 2013 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Realization and optimization DGEMM on ARMv8 64-bit multi-core processor

引用

Dongbei Daxue Xuebao/Journal of Northeastern University 2014年 35卷 37-43页

作者： Jiang, Hao Wang, Feng Zuo, Ke Li, Kuan Yang, Can-Qun College of Computer Science National University of Defense Technology Changsha410073 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China

The double-precision matrix-matrix multiplication (DGEMM) on ARMv8 64-bit multi-core processor architecture was realized and optimized, and the optimal model for the purpose of maximizing the compute-to-memory access ratio was built to design DGEMM kernel. The ARM 64-bit memory accessing instruction, Cache pre-fetching instruction and NEON vector FMA instruction were utilized through instruction reordering and loop unrolling to construct the kernel assembly codes. The blocking and packing algorithms and parallel methods from GotoBLAS (OpenBLAS) were chosen, and the results showed that the floating-point peak efficiency can achieve 82% with one thread and 80% with eight threads, respectively. As the fastest DGEMM implementation on ARMv8 64-bit processor, it improves the peak performance by 8.3% and 16.7% compared to ATLAS. ©, 2014, Northeastern University. All right reserved.

关键词： Digital arithmetic

来源：评论

学校读者我要写书评

暂无评论

Detecting null dereference with a game

引用

2012 International Conference on Information Technology and Software Engineering, ITSE 2012

作者： Chen, Jie National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology 410073 Changsha China

ISBN: (纸本)9783642345302

As one of the most dangerous and common software vulnerabilities, null dereference often leads to program crashes. In this chapter we propose a human computation method to detect null dereference in a "frog and bug" game. The purpose of the game is to utilize the rich distributed human resource to do the complex science work in a simple and pleasant way. Programs are transformed into visual puzzles first, and then the server collects information from the people playing the game. Finally the recorded metadata is translated back into the positions in the programs where null dereference may happen. The game has shown to be effective. © 2013 Springer-Verlag.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

Fault tolerant Lu factorization in transactional memory system

Fault tolerant Lu factorization in transactional memory syst...

引用

2013 IEEE Conference Anthology, ANTHOLOGY 2013

作者： Song, Wei Jia, Jia National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9781479916603

With the popularization of multi-core processors, transaction memory, as a concurrent control mechanism with easy programing and high scalability, has attracted more and more attention. As a result, the reliability problems of transactional memory become a concerning issue. This paper addresses a transactional implementation of the Lu benchmark of SPLASH-2, and proposes a fault-tolerant Lu algorithm for this transactionalize Lu algorithm. The fault-tolerant Lu uses the data-versioning mechanism of the transactional memory system, detects errors based on transactions and recovers the error by rolling back the error transaction. The experiments show that the fault-tolerant Lu can get a better fault tolerance effect under a smaller cost. © 2013 IEEE.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

Continuous probabilistic reverse skyline monitoring over uncertain data streams

Continuous probabilistic reverse skyline monitoring over unc...

引用

2013 International Conference on Vehicle and Mechanical Engineering and Information Technology, VMEIT 2013

作者： Yang, Yong Tao Wang, Yi Jie Guo, Min Li, Xiao Yong National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9783037858202

Reverse skyline is useful for supporting many applications, such as marketing decision, environmental monitoring. Since the uncertainty of data is inherent in many scenarios, there is a need for processing probabilistic reverse skyline queries. In this paper, we study the problem of efficiently processing these queries on uncertain data streams. We first show the formal definitions of reverse skyline probability and probabilistic reverse skyline. Then we propose a new algorithm called CPRS to maintain the most recent N uncertain data elements and to process continuous queries on them. CPRS is based on R-tree, and efficient pruning techniques, one of which is based on a new structure named Characteristic Rectangle, are incorporated into it to handling the extra computing complexity arising from the uncertainty of data. Finally, extensive experiments demonstrate that our techniques are very efficient in handling uncertain data streams. © (2013) Trans Tech Publications, Switzerland.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

A novel secure inter-domain routing for identifier/locator split network

A novel secure inter-domain routing for identifier/locator s...

引用

2nd International Conference on Information Technology and Management Innovation, ICITMI 2013

作者： Liu, Ya Ping Liu, Zhi Hong Ma, Shi Cong Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology China College of Computer National University of Defense Technology China

ISBN: (纸本)9783037858646

With the rapid development of the Internet, the de facto inter-domain routing protocol, Border Gateway Protocol (BGP), has become very vulnerable to many attacks. For this, several secure inter-domain protocols have been proposed, most of which are focus on addressing the issue of faking AS path, but cannot address other issues, such as violating routing policies, reachability attacks and so on. Based on the concept of identifier/locator split and routing isolation, we have proposed a secure identifier-based inter-domain Routing, SIR [1], which can provide control plane security without using the high overhead mechanism. Then, we here optimize SIR and propose another secure inter-domain routing, Optimized SIR (O-SIR), which introduces a checked path table and records the path which has been checked before in each AS. We present the simulations based on the real world datasets CAIDA and compare the performance between SIR and O-SIR by different deployments and different position of attacks. The results show that O-SIR can reduce 18%-45% communication cost of verifying paths with additional below 0.1% routing table size. © (2013) Trans Tech Publications, Switzerland.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

Mining and recommending software features across multiple web repositories 13

Mining and recommending software features across multiple we...

引用

5th Asia-Pacific Symposium on Internetware, Internetware 2013

作者： Yu, Yue Wang, Huaimin Yin, Gang Liu, Bo School of Computer Science National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9781450323697

The Internetware" paradigm is fundamentally changing the traditional way of software development. More and more software projects are developed, maintained and shared on the Internet. However, a large quantity of heterogeneous software resources have not been organized in a reasonable and efficient way. Software feature is an ideal material to characterize software resources. The effectiveness of feature- related tasks will be greatly improved, if a multi-grained feature repository is available. In this paper, we propose a novel approach for organizing, analyzing and recommend- ing software features. Firstly, we construct a Hierarchical rEpository of Software feAture (HESA). Then, we mine the hidden affnities among the features and recommend relevant and high-quality features to stakeholders based on HESA. Finally, we 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 traditional and the state-of-the-art approaches. The result of feature recommendation is effective and interesting. Categories and Subject Descriptors D.2.9 [Software Engineering]: Mining Software Reposi- tory;H.3.3 [Information Storage and retrieval]: Fea- ture Model, Clustering, Query formulation General Terms Algorithms, Human Factors.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：