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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

Security issues and solutions in cloud computing

Security issues and solutions in cloud computing

引用

32nd IEEE International Conference on distributed Computing Systems Workshops, ICDCSW 2012

作者： You, Pengfei Peng, Yuxing Liu, Weidong Xue, Shoufu National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha China Jiangsu Automation Research Institute Jiangsu China Air Defense Forces Academy CPLA Zhengzhou Henan China

ISBN: (纸本)9781467314237

Recently, Cloud computing, as one of the hottest words in IT world, has drawn great attention. Many IT companies such as IBM, Google, Amazon, Microsoft, Yahoo and others vigorously develop cloud computing systems and related products to customers. However, there are still some difficulties for customers to adopt cloud computing, in which many security issues exist, because data for a customer is stored and processed in cloud, not in a local machine. This paper briefly introduces cloud computing and its key concepts. In particularly, we intend to discuss security requirements and security issues involving data, application and virtualization in cloud computing, as well as current solutions to these issues. © 2012 IEEE.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Some critical problems of botnets

引用

Jisuanji Xuebao/Chinese Journal of computers 2012年第6期35卷 1192-1208页

作者： Wang, Tian-Zuo Wang, Huai-Min Liu, Bo Shi, Pei-Chang Institute of Network and Information Security School of Computer Science National University of Defense Technology Changsha 410073 China National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China

As a complex, flexible and effective platform for network attacking, the botnet spreads widely in the Internet. Botnets can provide the botmasters with the ability to launch large-scale malicious activities such as spamming and DDoS (distributed Denial of Service) attacks. Botnets are continuously bringing more and more severe threats, so that the study on botnets has already become one of the focuses in the field of network security. However, in recent years, some new developments of botnets are challenging the existing understanding on botnets. In this paper, according to the new conditions of botnets and the researches in existence, a definition of botnet is proposed based on the works of other researchers, taxonomies of botnets are introduced respectively from the views of network structure, dependency and delivery pattern of C&C (Command and Control) information. Then the techniques on detecting, measuring and restraining botnets are analyzed systematically. In the end, we give the evolution trends of botnets and the future research trends in this area.

关键词： Botnet

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：