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

4th International Conference on Cyber-Enabled distributed Computing and Knowledge Discovery, CyberC 2012

作者： Liu, Lixia Hu, Gang Xu, Ming Peng, Yuxing National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China Department of Networks Engineering School of Computer National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769548104

In the relay-trading mode of wireless cognitive radio networks the secondary user (SU) can achieve a promised spectrum access opportunity by relaying for the primary user (PU). How to utilize the exchanged resource efficiently and fairly is an interesting and practical problem. In this paper we proposed a cooperative spectrum sharing strategy (RT-CSS) for the relay-trading mode from the fairness view. The cooperative SUs are gathered in a cooperative sharing group (CSG), and contribution metric (CM) is proposed to measure each CSG member's contribution to CSG as well as benefit from CSG. The adjustment of CM can guarantee the fairness and efficiency of spectrum sharing. The numerical simulation shows that RT-CSS can achieve better performance than the sense-uncooperative mode. © 2012 IEEE.

关键词： Cognitive radio

来源：评论

学校读者我要写书评

暂无评论

Support efficient and fault-tolerant multicast in bufferless network-on-chip

Support efficient and fault-tolerant multicast in bufferless...

引用

作者： Feng, Chaochao Lu, Zhonghai Jantsch, Axel Zhang, Minxuan Yang, Xianju National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology China Department of Electronic Systems Royal Institute of Technology Sweden

SUMMARY In this paper, we propose three Deflection-Routing-based Multicast (DRM) schemes for a bufferless NoC. The DRM scheme without packets replication (DRM-noPR) sends multicast packet through a non deterministic path. The DRM schemes with adaptive packets replication (DRM-PR-src and DRMYR-all) replicate multicast packets at the source or intermediate node according to the destination position and the state of output ports to reduce the average multicast latency. We also provide fault tolerant supporting in these schemes through a reinforcement learning based method to reconfigure the routing table to tolerate permanent faulty links in the network. Simulation results illustrate that the DRM-PR-all scheme achieves 4l6o, 43cc and 37% less latency on average than that of the DRM-noPR scheme and 27cc, 29cc and 2S6o less latency on average than that of the DRM-PR-src scheme under three synthetic traffic patterns respectively. In addition, all three fault tolerant DRM schemes achieve acceptable performance degradation at various link fault rates without any packet lost. Copyright © 2012 The Institute of Electronics, Information and Communication Engineers.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

Topology awareness algorithm for virtual network mapping

引用

Journal of Zhejiang University-Science C(computers and Electronics) 2012年第3期13卷 178-186页

作者： Xiao-ling LI Huai-min WANG Chang-guo GUO Bo DING Xiao-yong LI Wen-qi BI Shuang TAN National Key Laboratory of Parallel and Distributed Processing National University of Defense Technology.Changsha 410073China School of Computer National University of Defense TechnologyChangsha 410073China China Electronic Systems Engineering Corporation Beijing 100039China The Northern Institute of Electronic Equipment of China Beijing 100083China

Network virtualization is recognized as an effective way to overcome the ossification of the Internet. However, the virtual network mapping problem (VNMP) is a critical challenge, focusing on how to map the virtual networks to the substrate network with efficient utilization of infrastructure resources. The problem can be divided into two phases: node mapping phase and link mapping phase. In the node mapping phase, the existing algorithms usually map those virtual nodes with a complete greedy strategy, without considering the topology among these virtual nodes, resulting in too long substrate paths (with multiple hops). Addressing this problem, we propose a topology awareness mapping algorithm, which considers the topology among these virtual nodes. In the link mapping phase, the new algorithm adopts the k-shortest path algorithm. Simulation results show that the new algorithm greatly increases the long-term average revenue, the acceptance ratio, and the long-term revenue-to-cost ratio (R/C).

关键词： Network virtualization Ossification Virtual network （VN） mapping Substrate network （SN） Topology awareness Acceptance ratio

来源：评论

学校读者我要写书评

暂无评论

Inducing taxonomy from tags: An agglomerative hierarchical clustering framework

Inducing taxonomy from tags: An agglomerative hierarchical c...

引用

8th International Conference on Advanced Data Mining and Applications, ADMA 2012

作者： Li, Xiang Wang, Huaimin Yin, Gang Wang, Tao Yang, Cheng Yu, Yue Tang, Dengqing National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha China College of Mechatronics Engineering and Automation National University of Defense Technology Changsha China

ISBN: (纸本)9783642355264

By amassing 'wisdom of the crowd', social tagging systems draw more and more academic attention in interpreting Internet folk knowledge. In order to uncover their hidden semantics, several researches have attempted to induce an ontology-like taxonomy from tags. As far as we know, these methods all need to compute an overall or relative generality for each tag, which is difficult and error-prone. In this paper, we propose an agglomerative hierarchical clustering framework which relies only on how similar every two tags are. We enhance our framework by integrating it with a topic model to capture thematic correlations among tags. By experimenting on a designated online tagging system, we show that our method can disclose new semantic structures that supplement the output of previous approaches. Finally, we demonstrate the effectiveness of our method with quantitative evaluations. © Springer-Verlag Berlin Heidelberg 2012.

关键词： Taxonomies

来源：评论

学校读者我要写书评

暂无评论

A malicious code detection method based on statistical analysis

A malicious code detection method based on statistical analy...

引用

2012 9th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2012

作者： Wu, Yunlong Chen, Chen Wang, Huiquan Zhou, Jie Xu, Xinhai National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan 410073 China School of Computer National University of Defense Technology Changsha Hunan 410073 China

ISBN: (纸本)9781467300223

The malicious code detection based on behaviors has proved effective. But there are high false positives and high false negatives when using this method. Because the behaviors are always out-of-order and redundant. To solve these problems, this paper proposes a detection method based on statistical analysis. Firstly, this method uses association rules to sort out the behaviors, and then we can get the integrated and accurate behavior sequences. Secondly, by using the association algorithm we can pick up the signatures of behavior sequences. In addition, this method can detect the signatures to judge the threat based on statistical analysis. Experimental results indicate that it can reduce both the false positives and the false negatives effectively. © 2012 IEEE.

关键词： Statistical methods

来源：评论

学校读者我要写书评

暂无评论

Research on malicious code detection based on least-squares estimation

Research on malicious code detection based on least-squares ...

引用

2012 International Conference on computer Science and Electronics engineering, ICCSEE 2012

作者： Wu, Yunlong Chen, Chen Wang, Huiquan Xu, Xinhai Zhou, Jie National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan 410073 China School of Computer National University of Defense Technology Changsha Hunan 410073 China

ISBN: (纸本)9780769546476

Malicious code detection based on behaviors is the development direction of anti-virus techniques. However, the current detection methods based on this theory expose several problems such as the unclearness of behavior sequence analysis and the high false negatives. For this situation, this paper proposes a malicious code detection method based on least-squares estimation. In this method, it correlates program behaviors with time and subject-object, and then constitutes an accurate and complete behavior sequence. It can provide a preprocessing method for the subsequent detection. In order to improve the accuracy and intelligence of malicious code detection, we introduce the concept of expert subjective degree. By modeling malicious samples based on least-squares estimation we can train the Expert Subjective Degree Vector (ESDV) and simulate experts to judge the threat values of malicious codes. Experiments show that this method is more accurate than the current ways to detect the malicious codes which execute themselves in sub-period and sub-process ways, so it can be used as an effective complement of the current anti-virus software. © 2012 IEEE.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

Topology-aware deployment of scientific applications in cloud computing

Topology-aware deployment of scientific applications in clou...

引用

2012 IEEE 5th International Conference on Cloud Computing, CLOUD 2012

作者： Fan, Pei Chen, Zhenbang Wang, Ji Zheng, Zibin Lyu, Michael R. National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China Dept. of Computer Science and Engineering Chinese University of Hong Kong Hong Kong Hong Kong

ISBN: (纸本)9780769547558

Nowadays, more and more scientific applications are moving to cloud computing. The optimal deployment of scientific applications is critical for providing good services to users. Scientific applications are usually topology-aware applications. Therefore, considering the topology of a scientific application during the development will benefit the performance of the application. However, it is challenging to automatically discover and make use of the communication pattern of a scientific application while deploying the application on cloud. To attack this challenge, in this paper, we propose a framework to discover the communication topology of a scientific application by pre-execution and multi-scale graph clustering, based on which the deployment can be optimized. Comprehensive experiments are conducted by employing a well-known MPI benchmark and comparing the performance of our method with those of other methods. The experimental results show the effectiveness of our topology-aware deployment method. © 2012 IEEE.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Game-based software errors detection

引用

Advances in Information Sciences and Service Sciences 2012年第15期4卷 426-433页

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

Software security is one of the most important aspects of software quality, but errors in programs are still inevitable. Despite the development of static and dynamic analysis, the useful but costly manual analysis is still heavily used. In this paper, we propose a human computation game based software error detection mechanism. The purpose of our mechanism is to improve the effectiveness and efficiency of manual error detection. The framework includes four main steps: 1) get all suspicious error locations by static tools according to different security properties;2) slice the programs from each error location;3) construct games for each slice and show them to players;4) collect game information and generate the final error report. We evaluate our approach by instantiating it for detecting errors of buffer overflow. The results show that our technique is successful in practice.

关键词： Error detection

来源：评论

学校读者我要写书评

暂无评论

Simulation-based evaluation of the Imagine stream processor with scientific programs

引用

International Journal of High Performance Computing and Networking 2012年第2期7卷 99-110页

作者： Che, Yonggang Xu, Chuanfu Lu, Pingjing Wang, Zhenghua National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 Hunan China

This paper evaluates the performance and efficiency of Imagine stream processor for scientific programs. It classifies scientific programs into three classes based on their computation to memory access ratios. Typical programs are selected and measured on a simulated Imagine and two general-purpose processors. Comparative analysis is made with special attentions on the computational efficiency, power efficiency and performance bottleneck. The results show that programs in Class 1 attain high performance and high computational efficiency on Imagine. Their performance is only restricted by limited ILP and load imbalance across ALUs. Programs in Class 2 attain moderate performance but non-satisfactory computational efficiency on Imagine due to limited LRF and SRF reuse. Programs in Class 3 attain extremely low performance on Imagine because most of the execution time is spent on DRAM accesses. The estimated power efficiency on Imagine is excellent except for programs in Class 3. Copyright © 2012 Inderscience Enterprises Ltd.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

UCBench: A user-centric benchmark suite for C code static analyzers

UCBench: A user-centric benchmark suite for C code static an...

引用

International Conference on Information Science and Technology (ICIST)

作者： Jiangchao Liu Liqian Chen Longming Dong Ji Wang National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

In recent years, many C code static analyzers, with different abilities of bug detection, have appeared and been applied in various domains. There are so many choices that it becomes hard for programmers to know in detail the strengths as well as limitations of all these analyzers and to find the most suitable ones for their code. In this paper, we propose a benchmark for C code static analyzers, named UCBench, to provide quantitative and qualitative measurements for evaluating analyzers. Being different from other benchmarks, UCBench concentrates more on users' requirements rather than the improvements of bug detecting technique itself. The major components of UCBench include test case database, evaluation metrics and harness. We classify test cases into several groups according to their attributes and design various user-centric evaluation metrics. Besides, we develop some harness to automate the evaluation process. Finally, we demonstrate our benchmark suite over four C code static analyzers: Flawfinder, Cppcheck, Uno and Splint.

关键词： Benchmark testing Libraries Measurement computer bugs Databases Standards Monitoring

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：