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

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

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

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.

关键词： Redundancy HTML Databases Licenses Data mining Measurement

来源：评论

学校读者我要写书评

暂无评论

Research of Context Situation Awareness Technology

Research of Context Situation Awareness Technology

引用

IEEE International Symposium on Object/Component/Service-Oriented Real-Time distributed Computing Workshops (ISORCW)

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

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.

关键词： Context Mobile handsets Real time systems Sensors Servers Mobile communication Context modeling

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Reduced complexity tree-structured conditional random field for all-words word sense disambiguation

引用

Journal of Computational Information Systems 2012年第3期8卷 1177-1186页

作者： Zhou, Yun Wang, Ting Wang, Zhiyuan Xie, Songxian Computer School National University of Defense Technology Changsha 410073 China National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

In this paper, we apply tree-structured conditional random field (TCRF) to all-words word sense disambiguation (WSD), where the graphical structure of TCRF is the dependency syntax tree produced by Minipar. The extremely large label space and high time complexity of TCRF hinders its application in semantic parsing, especially in all-words WSD, and we focus on reducing the time complexity of TCRF in this paper. The running time of TCRF is reduced significantly by edge feature selection and parallelization in training phase and beam search strategy in decoding phase. We evaluate the TCRF method on the English all-words task of Senseval-3, and the F1 value of TCRF method is 0.668, which outperforms the best result 0.652 in Senseval-3. For convenience of comparison, our training set only includes a part of Semcor, which reserves the space for improvement. Furthermore, the practical problem in the fields of information retrieval and natural language processing, often has a large label space and tree-structured information, which can also be solved by the TCRF method proposed in this paper. 1553-9105/Copyright © 2012 Binary Information Press.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

International Conference on Information Science and Technology (ICIST)

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

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.

关键词： Radiation detectors Shape Instruments Calculus Semantics Data structures Argon

来源：评论

学校读者我要写书评

暂无评论

Invalid Pointer Dereferences Detection for CPS Software Based on Extended Pointer Structures

Invalid Pointer Dereferences Detection for CPS Software Base...

引用

International Conference on Secure Software Integration and Reliability Improvement Companion (SSIRI-C)

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

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.

关键词： Abstracts Software Frequency modulation Semantics Switches Detection algorithms Runtime

来源：评论

学校读者我要写书评

暂无评论

Skyline Query processing on Interval Uncertain Data

Skyline Query Processing on Interval Uncertain Data

引用

IEEE International Symposium on Object/Component/Service-Oriented Real-Time distributed Computing Workshops (ISORCW)

作者： Xiaoyong Li Yijie Wang Xiaoling Li Guangdong Wang National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha China

Many recent applications involve processing and analyzing uncertain data. Recently, several research efforts have addressed answering skyline queries efficiently on massive uncertain datasets. However, the research lacks methods to compute these queries on uncertain data, where each dimension of the uncertain object is represented as an interval or an exact value. In this paper, we extensively study the problem of skyline query on these interval based uncertain objects, which has never been studied before. We first model the problem of querying the skylines on interval datasets. Typically, we address two efficient algorithms with I/O optimal for the conventional interval skyline queries and constrained interval skyline queries, respectively. Extensive experiments demonstrate the efficiency of all our proposed algorithms.

关键词： Probability density function Distribution functions Probability distribution Random variables Computational modeling Uncertainty distributed databases

来源：评论

学校读者我要写书评

暂无评论

A study of strategies to restrain the C&C activities of structured P2P botnets

A study of strategies to restrain the C&C activities of stru...

引用

International Conference on Computer Sciences and Convergence Information Technology (ICCIT)

作者： Tianzuo Wang Bo Liu Huaimin Wang Hao Ren Xiaolong Ma School of Computer Science National Laboratory for Parallel and Distributed Processing National University of Defense and Technology Changsha China

Botnets are threatening the Internet heavily, and more and more botnets are utilizing the P2P technology to build their C&C (Command and Control) mechanisms. Some research have been made to compare the resilience of structured P2P botnets and unstructured ones, against elimination of nodes, but the problem that which eliminating strategy is the best is rarely studied. In this paper, we proposed a new metric called the half point, to measure the effectiveness of different strategies. We also selected seven different eliminating strategies and compared them. Through extensive simulations, we find that RBC is the best eliminating strategy. Further analysis shows that for the strategy RBC, the average degree of nodes in the botnet have the most significant influence. The bigger the average degree is, the bigger the half point of RBC is, which implies that node eliminating may not be a reasonable choice for mitigating botnets with big average degree. Results of this paper can provide guidance for restraining structured P2P botnets.

关键词： C&C mechanism betweenness centrality coreness eliminating strategy half point restrain structured P2P botnets

来源：评论

学校读者我要写书评

暂无评论

SMP-SIM: An event-driven performance simulator for SMP

SMP-SIM: An event-driven performance simulator for SMP

引用

International Conference on Systems and Informatics (ICSAI)

作者： Xin Zhang Yuhua Tang Yufei Lin Xinhai Xu Xiaowei Guo Xiaoguang Ren National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan China

Performance prediction for the high performance computer system is of great importance for designing, implementing, and optimizing system. As a widely used technique for predicting performance, simulation method attracts more and more attention from the research community. Based on analyzing the problems in the current performance simulation techniques, we present a key idea of the performance simulator for SMP system based on event-driven. We propose the framework of SMP-SIM and implement it based on MPICH2. The simulation results show that, our simulation technique has the advantages of high accuracy and simulation performance.

关键词： Computational modeling Switches Clocks Educational institutions Computers Predictive models Analytical models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：