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

4th International Conference on Computational Intelligence and Communication Networks, CICN 2012

作者： Xu, Xinhai Lin, Yufei National Laboratory for Parallel and Distributed Processing Computer School National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781467329811

Nowadays, with the growth of the performance, the reliability problem of supercomputers becomes more and more serious. In order to complete an application with small fault recovery overhead, Checkpoint/Restart(C/R) methods are widely used. So far, the mainstream C/R methods are either based on Fail-Stop fault model or making the system(or program) do error detection before storing checkpoints, so they can ensure the correctness of every checkpoint. However, the faults occurring in the systems in real world are more accordant with the Byzantine fault model, and in order to pursue the higher practical performance, neither the system nor the program implements any fault detection mechanism. Consequently, there may be errors in the checkpoints. This paper studies the checkpoint selection problem that which checkpoint should be selected as the object of rolling back after system occurring failure, based on Byzantine fault model. We design a framework of checkpoint selection, and then, based on it, propose three checkpoint selection strategies: conservative strategy, aggressive strategy and statistical strategy. The simulation results show that: the conservative strategy shows its superiority when the error latent period is long, while the aggressive strategy behaves oppositely, the statistical strategy has a stable efficiency, only 50% more overhead compared to the ideal checkpoint selection when the checkpoint period is the half of mean time between faults. © 2012 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Invalid pointer dereferences detection for CPS software based on extended pointer structures

Invalid pointer dereferences detection for CPS software base...

引用

2012 IEEE 6th International Conference on Software Security and Reliability Companion, SERE-C 2012

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

ISBN: (纸本)9780769547435

Invalid pointer dereferences, such as null pointer dereferences, dangling pointer dereferences and double frees, are a prevalent source of software bugs in CPS software, due to flexible dereferencing pointers along various pointer fields. Existing tools have high overhead or are incomplete, thereby limiting their efficiency in checking the kind of CPS software with shared and mutable memory. In this paper, we present a novel extended pointer structure for detecting all invalid pointer dereferences in this kind of CPS software. We propose an invalid pointer dereferences detection algorithm based on the uniform transformation of abstract heap states. Experimental evaluation about a set of large C benchmark programs shows that the proposed approach is sufficiently efficient in detecting invalid pointer dereferences of CPS software with shared and mutable memory. © 2012 IEEE.

关键词： Program debugging

来源：评论

学校读者我要写书评

暂无评论

Precise pointer analysis for list-manipulating programs based on quantitative separation logic

Precise pointer analysis for list-manipulating programs base...

引用

2012 IEEE International Conference on Information Science and Technology, ICIST 2012

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

ISBN: (纸本)9781457703454

Full precise pointer analysis has been a challenging problem, especially when dealing with dynamically-allocated memory. Separation logic can describe pointer alias formally, but cannot describe the quantitative reachability between pointers. In this paper, we present a symbolic framework for analyzing the reachability between pointers in list-manipulating programs. The precise points-to relations of pointers in lists are described by formulae of quantitative separation logic (QSL), and the analysis framework is based on the operational and rearrangement rules about the assignments of pointers. The fixpoint calculus and the counter symbolic abstraction are used to find loop invariants. We can get precise relations between pointers at each point of list-manipulating programs. In the end, several initial examples about list-manipulating programs are given to show that the approach can get precise pointer analysis for list-manipulating programs. © 2012 IEEE.

关键词： computer circuits

来源：评论

学校读者我要写书评

暂无评论

Bodhi: Detecting buffer overflows with a game

Bodhi: Detecting buffer overflows with a game

引用

2012 IEEE 6th International Conference on Software Security and Reliability Companion, SERE-C 2012

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

ISBN: (纸本)9780769547435

Buffer overflow is one of the most dangerous and common vulnerabilities in CPS software. Despite static and dynamic analysis, manual analysis is still heavily used which is useful but costly. Human computation harness humans' time and energy in a way of playing games to solve computational problems. In this paper we propose a human computation method to detect buffer overflows that does not ask a person whether there is a potential vulnerability, but rather a random person's idea. We implement this method as a game called Bodhi in which each player is shown a piece of code snippet and asked to choose whether their partner would think there is a buffer overflow vulnerability at a given position in the code. The purpose of the game is to make use of the rich distributed human resource to increase effectiveness of manual detection for buffer overflows. The game has been proven to be efficient and enjoyable in practice. © 2012 IEEE.

关键词： Buffer storage

来源：评论

学校读者我要写书评

暂无评论

Providing information services for wireless sensor networks through cloud computing

Providing information services for wireless sensor networks ...

引用

2012 7th IEEE Asia-Pacific Services Computing Conference, APSCC 2012

作者： You, Pengfei Peng, Yuxing Gao, Hang National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha China

ISBN: (纸本)9780769548975

Wireless sensor networks (WSN) is a critical technology for information gathering covering many areas, including health-care, transportation, air traffic control and environment monitoring. Despite wide use, the fast increasing data emanating from WSN is not fully utilized due to the limitation for structure of WSN itself. Along with the further development of WSN, the data form which is not be efficiently managed and applied to supply information services for users. As the emerging IT technology, cloud computing supplies powerful utilization ability for IT resources, which makes many traditional applications migrate to cloud computing. In this paper, we propose a framework integrating cloud computing paradigm and WSN, which fully uses data process ability and service model for cloud computing. In the framework, data form WSN are efficiently utilized and managed, depending on which, information services for WSN are well provided to users. © 2012 IEEE.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

Research of context situation awareness technology

Research of context situation awareness technology

引用

作者： Shi, Dianxi Wu, Zhendong Ding, Bo Yan, Huining National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769546698

Context situation, which means a snapshot of the status of the real world, is formed by integrating a large amount of contexts collected from various resources. How to get the context situation and use the situation to provide better services is a challenging issue. In this paper, we focused on this challenge on the basis of the mobile cloud computing architecture. An abstract model is proposed in this paper to uniformly collect the context and send them to cloud. A rule-based large-scale context aggregation algorithm is also proposed which utilizes the MapReduce computing paradigm. Finally, a large-scale context management framework based on the abstract model and the context aggregation algorithm is proposed, and a real-time traffic demo is implemented to verify the validity of the framework. © 2012 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Structure and method for hardware acceleration of variable data set management

引用

Hunan Daxue Xuebao/Journal of Hunan University Natural Sciences 2013年第11 SUPPL.期40卷 68-73页

作者： Xu, Jin-Bo Dou, Yong Sun, Cai-Xia Dong, Ya-Zhuo Wang, Shao-Gang Lu, Ping-Jing Zhang, Jun College of Computer National Univ of Defense Technology Changsha Hunan 410073 China National Laboratory for Parallel and Distributed Processing National Univ of Defense Technology Changsha Hunan 410073 China Unit 91655 People's Liberation Army Beijing 100036 China

A general hardware structure was proposed to accelerate variable data set management, which was designed to accept instructions flexibly and accomplish the commonly used functions and some more complicated functions of the linked-list data structure .The structure can access the data based on both pointer and address mechanism. In order to fully utilize the limited memory resources, we proposed a memory recycle scheme to reuse the memory space where the data have been deleted. Experimental results on FPGA show that our proposal can accelerate the variable data set management. Only few hardware resources were used and it consumed pretty low power. Compared with the software linked-list structure in PC, our proposal in FPGA achieved high speedups.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

An efficient packing algorithm for spatial keyword queries

An efficient packing algorithm for spatial keyword queries

引用

6th International Conference on Convergence and Hybrid Information Technology, ICHIT 2012

作者： Pan, Jinkun Li, Dongsheng Li, Liming National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology 410073 Changsha China Shanghai Garrision 200040 Shanghai China

ISBN: (纸本)9783642326448

With the increase of location-based services, Web contents are being geo-tagged, and spatial keyword queries that retrieve objects satisfying both spatial and keyword conditions are gaining in prevalence. Unfortunately, the state-of-the-art packing algorithms only focus on spatial relationship, and they are not fit for the spatial keyword queries. In this paper, we propose a new packing algorithm named KBS which takes both location and keyword information into consideration, thus optimizing R-tree for spatial keyword queries. Experimental results on both real and synthetic datasets show that our method achieves high performance and space utilization. © 2012 Springer-Verlag.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：