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

Recent advances on trusted computing in China

Chinese Science Bulletin 2012年第35期57卷 4529-4532页

作者： DONG Wei CHEN LiQian School of Computer National University of Defense TechnologyChangsha 410073China National Laboratory for Parallel and Distributed Processing Changsha 410073China

This article highlights some recent research advances on trusted computing in China,focusing mainly on the methodologies and technologies related to trusted computing module,trusted computing platform,trusted network ... 详细信息

关键词：可信计算平台中国计算模块网络连接软件

来源：评论

学校读者我要写书评

暂无评论

MemHole: An efficient black-box approach to consolidate memory in virtualization platform

MemHole: An efficient black-box approach to consolidate memo...

引用

41st International Conference on parallel processing Workshops, ICPPW 2012

作者： Zhang, Pengfei Chu, Rui Wang, Huaimin National Laboratory for Parallel and Distributed Processing National University of Defense Technology United States

ISBN: (纸本)9780769547954

As an important aspect of the hardware resource consolidation in virtualization environment, memory consolidation and over-commitment has been motivated by the increasing elastic computing cloud platform. The most popular consolidation technology, Memory Balloon, might introduce serious performance penalty with thrashing when guest memory usage changes dramatically. In order to overcome the drawback of Memory Balloon and guarantee the system performance, we propose Mem Hole, which provides more guest physical memory than really allocated and makes the corresponding host physical mapping undetermined until accessed, to reduce the thrashing of guest memory paging. The prototype of Mem Hole has been implemented in Xen platform and the efficiency has been shown in the preliminary evaluation. © 2012 IEEE.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

Exploiting attribute redundancy in extracting open source forge websites

Exploiting attribute redundancy in extracting open source fo...

引用

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

作者： Li, Xiang Zhu, Yanxu Yin, Gang Wang, Tao Wang, Huaimin National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9780769548104

Open Source Forge (OSF) websites provide information on massive open source software projects, extracting these web data is important for open source research. Traditional extraction methods use string matching among pages to detect page template, which is time-consuming. A recent work published in VLDB exploits redundant entities among websites to detect web page coordinates of these entities. The experiment gives good results when these coordinates are used for extracting other entities of the target site. However, OSF websites have few redundant project entities. This paper proposes a modified version of that redundancy-based method tailored for OSF websites, which relies on a similar yet weaker presumption that entity attributes are redundant rather than whole entities. Like the previous work, we also construct a seed database to detect web page coordinates of the redundancies, but all at the attribute-level. In addition, we apply attribute name verification to reduce false positives during extraction. The experiment result indicates that our approach is competent in extracting OSF websites, in which scenario the previous method can not be applied. © 2012 IEEE.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Blocked united algorithm for the all-pairs shortest paths problem on Hybrid CPU-GPU systems

Blocked united algorithm for the all-pairs shortest paths pr...

引用

作者： Matsumoto, Kazuya Nakasato, Naohito Sedukhin, Stanislav G. Distributed Parallel Processing Laboratory University of Aizu Aizu-Wakamatsu-shi 965-8580 Japan

This paper presents a blocked united algorithm for the allpairs shortest paths (APSP) problem. This algorithm simultaneously computes both the shortest-path distance matrix and the shortest-path construction matrix for a graph. It is designed for a high-speed APSP solution on hybrid CPU-GPU systems. In our implementation, two most compute intensive parts of the algorithm are performed on the GPU. The first part is to solve the APSP sub-problem for a block of sub-matrices, and the other part is a matrix-matrix "multiplication" for the APSP problem. Moreover, the amount of data communication between CPU (host) memory and GPU memory is reduced by reusing blocks once sent to the GPU. When a problem size (the number of vertices in a graph) is large enough compared to a block size, our implementation of the blocked algorithm requires CPU GPU exchanging of three blocks during a block computation on the GPU. We measured the performance of the algorithm implementation on two different CPU-GPU systems. A system containing an Intel Sandy Bridge CPU (Core i7 2600K) and an AMD Cayman GPU (Radeon HD 6970) achieves the performance up to 1.1 TFlop/s in a single precision. Copyright © 2012 The Institute of Electronics, Information and Communication Engineers.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Labeled topic detection of open source software from mining mass textual project profiles

Labeled topic detection of open source software from mining ...

引用

1st International Workshop on Software Mining, SoftwareMining-2012 - Held in Conjunction with the 18th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD-2012

作者： Wang, Tao Yin, Gang Li, Xiang Wang, Huaimin National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9781450315609

Nowadays open source software has become an indispensable basis for both individual and industrial software engineering. Various kinds of labeling mechanisms like categories and tags are used in open source communities to annotate projects and facilitate the discovery of certain software However as large amounts of software are attached with no/few labels or the existing labels are from different ontology space, it is still hard to retrieve potentially topic-relevant software. This paper highlights the valuable semantic information of project descriptions and labels, proposes labeled software topic detection LSTD a hybrid approach combining topic models and ranking mechanisms to detect and enrich the topics of software by mining the large amount of textual software profiles, which can be employed to do software categorization and tag recommendation. LSTD makes use of labeled LDA to capture the semantic correlations between labels and descriptions and then construct the label-based topic-word matrix. Based on the generated matrix and the generality of labels, LSTD designs a simple yet eficient algorithm to detect the latent topics of software that expressed as relevant and popular labels. Comprehensive evaluations are conducted on the large-scale datasets of representative open source communities and the results validate the effectiveness of LSTD.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Queueing analysis of the decoding process for intra-session network coding with random linear codes

Queueing analysis of the decoding process for intra-session ...

引用

作者： Yuan, Yuan Huang, Zhen Liu, Shengyun Peng, Yuxing National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9783642277078

Efficient designs for intra-session network coding based practical applications largely rely on a better understanding on its queueing behaviors. However, few work devote on this topics. In this paper, we build a multi-channel batch service queueing system (MN/Dm/1) with control feedbacks to describe the decoding process of intra-session network coding with random linear codes and try to answer several fundamental questions, including for example, how to analyze braking redundancy? Under what condition is the system stable? How's quantitative relationship between the inter-decoding delay and the generation granularity? © 2012 Springer-Verlag GmbH Berlin Heidelberg.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Accurate and simplified prediction of L2 cache vulnerability for cost-efficient soft error protection

Accurate and simplified prediction of L2 cache vulnerability...

引用

作者： Cheng, Yu Ma, Anguo Zhang, Minxuan National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology China

Soft errors caused by energetic particle strikes in on-chip cache memories have become a critical challenge for microprocessor design. Architectural vulnerability factor (AVF), which is defined as the probability that a transient fault in the structure would result in a visible error in the final output of a program, has been widely employed for accurate soft error rate estimation. Recent studies have found that designing soft error protection techniques with the awareness of AVF is greatly helpful to achieve a tradeoff between performance and reliability for several structures (i.e., issue queue, reorder buffer). Considering large on-chip L2 cache, redundancy-based protection techniques (such as ECC) have been widely employed for L2 cache data integrity with high costs. Protecting caches without accurate knowledge of the vulnerability characteristics may lead to the over-protection, thus incurring high overheads. Therefore, designing AVF-aware protection techniques would be attractive for designers to achieve a cost-efficient protection for caches, especially at early design stage. In this paper, we propose an improved AVF estimation framework for conducing comprehensive characterization of dynamic behavior and predictability of L2 cache vulnerability. We propose to employ Bayesian Additive Regression Trees (BART) method to accurately model the variation of L2 cache AVF and to quantitatively explain the important effects of several key performance metrics on L2 cache AVF. Then we employ bump hunting technique to extract some simple selecting rules based on several key performance metrics for a simplified and fast estimation of L2 cache AVF. Using the simplified L2 cache AVF estimator, we develop an AVF-aware ECC technique as an example to demonstrate the cost-efficient advantages of the AVF prediction based dynamic fault tolerant techniques. Experimental results show that compared with traditional full ECC technique, AVF-aware ECC technique reduces the L2 cache acc

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

Modular heap abstractionion-based code clone detection for heap-manipulating programs

Modular heap abstractionion-based code clone detection for h...

引用

12th International Conference on Quality Software, QSIC 2012

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

ISBN: (纸本)9780769548333

Code clone is a prevalent activity during the development of softwares. However, it may be harmful to the maintenance and evolution of softwares. Current techniques for detecting code clones are most syntax-based, and cannot detect all code clones. In this paper, we present a novel semantic-based clone detection technique by obtaining the similarity about the precondition and postcondition of each procedure, which are computed by a context and field sensitive fixpoint iteration algorithm based on modular heap abstraction in heapmanipulating programs. Experimental evaluation about a set of C benchmark programs shows that the proposed approach can be scalable to detect various clones that existing syntax-based clone detectors have missed. © 2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Runtime monitoring for cyber-physical systems: A case study of cooperative adaptive cruise control

Runtime monitoring for cyber-physical systems: A case study ...

引用

2nd International Conference on Intelligent Systems Design and Engineering Applications, ISDEA 2012

作者： Mao, Jianhui Chen, Liqian National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769546087

Cyber-Physical Systems (CPS) involve deep interactions between computation cores, communication networks, and physical environments. These systems are inherently complex and highly nondeterministic. This makes the traditional formal verification technology impractical to verify the complete system behavior, and testing alone is insufficient to guarantee correctness. Runtime monitoring, known as a lightweight verification technique, provides a practical way to monitor and verify such systems at runtime. In this paper, we present a case study for runtime monitoring of the Cooperative Adaptive Cruise Control systems (CACC) in automobile CPS systems. We build a hybrid automaton-based model for the CACC system using the CHARON modeling language and construct an event-based runtime monitoring framework. The synthesized monitor observes the running of CACC and checks whether it works correctly against the temporal logic safety specification. Experimental results obtained through this case study provide evidence for the efficacy of runtime monitoring of CPS systems. © 2012 IEEE.

关键词： Cyber Physical System

来源：评论

学校读者我要写书评

暂无评论

A logistic regression model for Semantic Web service matchmaking

引用

Science China(Information Sciences) 2012年第7期55卷 1715-1720页

作者： WEI DengPing 1 ,WANG Ting 1 & WANG Ji 2 1 School of Computer,National University of Defense Technology,Changsha 410073,China 2 National laboratory for parallel and distributed processing,Changsha 410073,China 1. School of Computer National University of Defense Technology Changsha 410073 China2. National Laboratory for Parallel and Distributed Processing Changsha 410073 China

Semantic Web service matchmaking,as one of the most challenging problems in Semantic Web services (SWS),aims to filter and rank a set of services with respect to a service query by using a certain matching *** this paper,we propose a logistic regression based method to aggregate several matching strategies instead of a fixed integration (e.g.,the weighted sum) for SWS *** logistic regression model is trained on training data derived from binary relevance assessments of existing test collections,and then used to predict the probability of relevance between a new pair of query and service according to their matching values obtained from various matching *** are then ranked according to the probabilities of relevance with respect to each *** method is evaluated on two main test collections,SAWSDL-TC2 and Jena Geography Dataset(JGD).Experimental results show that the logistic regression model can effectively predict the relevance between a query and a service,and hence can improve the effectiveness of service matchmaking.

关键词： Semantic Web service matchmaking logistic regression

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：