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

Algorithm for distributed Constraint Optimization Problems with low constraint density

Ruan Jian Xue Bao/Journal of Software 2011年第4期22卷 625-639页

作者： Ding, Bo Wang, Huai-Min Shi, Dian-Xi Tang, Yang-Bin School of Computer National University of Defense Technology Changsha 410073 China National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

Many challenges in multi-agent coordination can be modeled as distributed Constraint Optimization Problems (DCOPs). Aiming at DCOPs with low constraint density, this paper proposes a distributed algorithm based on the idea of greed and backjumping. In this algorithm, each agent makes decisions according to the greedy principle that the most assignment combinations in the problems with low constraint density occur at a zero cost, and the backjumping mechanism among the agents ensures the success of this algorithm, even when this greedy principle leads to a local optimum. In contrast with the existing mainstream DCOP algorithms, this algorithm can solve problems with low constraint density with fewer messages while keeping the polynomial message length and space complexity. The correctness of the key mechanisms in this algorithm has been proved, and those advantages in performance have been verified by experiments. © 2011 ISCAS.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

A causality based dynamic message ordering for DVEs on Wide Area Network

A causality based dynamic message ordering for DVEs on Wide ...

引用

IEEE International Conference on Communication Software and Networks

作者： Zhou, Hangjun Fu, Sha Department of Information Management Hunan University of Finance and Economics Chang Sha Hu Nan China Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing School of Computer Science National University of Defense Technology Chang Sha Hu Nan China

ISBN: (纸本)9781612844855

Due to the large message transmission latency in distributed Virtual Environments(DVEs) on Wide Area Net-work(WAN), the effectiveness of causality consistency control of message ordering is determined by not only causal order of messages but also the real-timeness. If merely causal order is considered, the real-time property of DVEs may not be ensured because of the unlimited waiting time for the delayed messages. While if only real-timeness is emphasized, there may be too many delayed messages, which have to be discarded, to maintain the quality of causal message ordering. Therefore, a trade-off between the quality of causal order delivery and real-timeness is necessary for DVEs. In this article, a novel causality based message ordering approach is presented. In general, this new approach dynamically balances the demands of causal order delivery and real-timeness. Experiment results demonstrate the approach can enhance the quality of causality, while simultaneously keep the real-time property of DVEs. © 2011 IEEE.

关键词： Wide area networks

来源：评论

学校读者我要写书评

暂无评论

A unique vertex deleting algorithm for graph isomorphism

A unique vertex deleting algorithm for graph isomorphism

引用

2011 International Symposium on Image and Data Fusion, ISIDF 2011

作者： Zhang, Baida Tang, Yuhua Wu, Junjie Huang, Linqi National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan 410073 China School of Resources and Safety Engineering Central South University Changsha 410083 China

ISBN: (纸本)9781457709692

Graph isomorphism problem has applications in many fields, such as chemistry, computer science, electronics, and network theory. But the exponential complexity of the algorithm makes the testing is time consuming. In this paper, a new algorithm named Unique Vertex Delete (UVD for short) is presented to speed up the process of isomorphic testing. The main idea of UVD algorithm is deleting vertex continuously to reduce the scale of the problem, and new field is added for each vertex to indicate the information of deleted neighbor vertices. Theoretical analysis and experiments show that the UVD algorithm consistently and significantly outperforms existing state-of-the-art approaches. © 2011 IEEE.

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

A multi-layered emulation platform to verify the effectiveness of consistency control approaches about message ordering

A multi-layered emulation platform to verify the effectivene...

引用

IEEE International Conference on Communication Software and Networks

ISBN: (纸本)9781612844855

It is an important issue to preserve the consistent delivering order of messages at each site in distributed Virtual Environments(DVEs). Currently, the violations of message delivery order are inclined to happen in the large-scale and frequently interactive DVEs running on Wide Area Network(WAN). The inconsistent anomalies are characterized as unpredictable, unrepeatable and uncontrollable, which results in the severe problem for the development of the consistency control approaches. Meanwhile, it is also highly expensive to directly verify the proposed approaches on WAN. Therefore, in this paper, we design and establish an original multi-layered emulation platform in LAN, which can emulate the network latency of WAN and repeat the scenarios of violations. On the platform, the designers of consistency approaches don't have to spend efforts to realize the fundamental functions of the verification, but could pay more attention to the development and optimization of the control algorithms, which is very beneficial for the improvement of message ordering approaches. © 2011 IEEE.

关键词： Wide area networks

来源：评论

学校读者我要写书评

暂无评论

不确定数据流上的并行Skyline查询算法

不确定数据流上的并行Skyline查询算法

引用

第29届中国数据库学术会议

作者： WANG Guangdong 王广东 WANG Yijie 王意洁 LI Xiaoyong 李小勇 WANG Yuan 王媛 National Key Laboratory for Parallel and Distributed Processing College of Computer Science Nation 国防科技大学计算机学院并行与分布处理国家重点实验室长沙410073

不确定数据流上的Skyline查询技术逐步引起研究者的关注，传统的集中式流处理算法难以满足海量数据的查询需求，并且云计算所提供的海量计算资源和有效的存储管理模式，为研究并行Skyline查询技术提供了充足的条件。基于上述事实，提出... 详细信息

不确定数据流上的Skyline查询技术逐步引起研究者的关注，传统的集中式流处理算法难以满足海量数据的查询需求，并且云计算所提供的海量计算资源和有效的存储管理模式，为研究并行Skyline查询技术提供了充足的条件。基于上述事实，提出了一种不确定数据流上的并行Skyline查询算法(PSUDS)。该算法通过交叉划分滑动窗口的方式，将集中式流查询转化为并行处理，以并行执行的方式来解决集中式算法处理性能不足的问题。大量实验结果表明，该算法具有较好的并行可扩展性。

关键词：不确定数据流云计算并行处理查询算法性能测试

来源：评论

学校读者我要写书评

暂无评论

Efficient approach for repeated patterns mining based on indent shape of HTML documents

Efficient approach for repeated patterns mining based on ind...

引用

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

作者： Zhu, Yanxu Yin, Gang Wang, Huaimin Shi, Dianxi Rao, Xiang Yuan, Lin School of Computer National Laboratory for Parallel and Distributed Processing National University of Defense Technology 410073 Changsha Hunan China College of Electronic Technology Information Engineering University 450004 Zhengzhou Henan China

ISBN: (纸本)9780769545578

Mining of repeated patterns from HTML documents is the key step towards Web-based data mining and knowledge extraction. Many web crawling applications need efficient repeated patterns mining techniques to generate their wrapper automatically. Existing approaches such as tree matching and string matching can detect repeated patterns with high precision, but their performance is still a challenge for practical web crawling applications. In this paper, we propose an efficient approach for mining repeated patterns based on indent shape of HTML document. Indent shape is a novel and simple model of HTML document, in which tandem repeated waves have strong association with the repeated patterns to be detected. By scanning an indent shape with a horizontal indent-line from bottom to top, the tandem repeated waves are identified by filtering the wave segments with low self-similarities. After that the boundary of HTML code corresponding to repeated patterns can be identified, which could be transformed to regular expressions formal-defined easily. Extensive experiments on two practical data sets retrieved from Internet show that our approach achieves high efficiency significantly, and its precision performance is also generally better than the existing approaches. © 2011 IEEE.

关键词： HTML

来源：评论

学校读者我要写书评

暂无评论

BIIP:Application Behavior-Aware Insertion Policies for Managing Shared Cache in CMPs

BIIP:Application Behavior-Aware Insertion Policies for Manag...

引用

2011 International Conference on computers, Communications, Control and Automation

作者： Xiaomin Jia Ping Huang Tianlei Zhao Shubo Qi Guitao Fu Minxuan Zhang National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology

Conventional replacement policy LRU(Least Recently Used) can significantly degrade the overall performance of shared cache of Chip Multi-Processors(CMPs), when the aggregate working set of multiple co-scheduled applications can not fit in cache. Different applications have different inherent cache access behavior characteristics. Replacement policy should take into account that fact so as to derive more performance benefit. This paper proposes application cache Behavior Identification based Insertion Policy(BIIP)replacement policies for managing shared cache in CMPs. BIIP seeks to make use of the cache access behavior characteristics of each co-scheduled application to smartly choose replacement policy. Our evaluation using a full system CMP simulator shows that BIIP improves the overall throughput by 14.8%,11.2%, 5.6% and 7.2% on average over baseline LRU policy,the prevailing cache partitioning scheme UCP and two other shared cache replacement policies PIPP, TADIP, respectively on a 4-core CMP with 16 SPEC CPU2006 workloads. Moreover,BIIP requires a total storage overhead of no more than several counters per core, and does not require changes to the current cache structure.

关键词： chip multi-processors(CMPs),application cache behaviors,last-level caches(LLC),insertion,replacement

来源：评论

学校读者我要写书评

暂无评论

parallelization of the Training for Face Detection with Transactional Memory

Parallelization of the Training for Face Detection with Tran...

引用

The International Conference on Automation and Robotics(ICAR 2011)

作者： Kun Zeng Key Laboratory and technology for National Defence of Parallel and Distributed Processing School of Computer National Univiersity of Defense Technology

The development of multi-core processor makes the parallelization of traditional sequential algorithms increasingly important. Meanwhile, transactional memory serves a good parallel programming model. This paper takes the advantage of software transactional memory to parallelize the Multi-Exit Asymmetric Adaboost algorithm for face detection. The parallel version is evaluated on three different implementations of software transactional memory. The experiment results show that the transactional memory based parallelization outperforms the traditional lock based approach. A speedup of nearly seven is achieved on a eight-core machine on an eight-core system.

关键词： Transactional Memory Face Detection Machine Learning Optimistic Algorithm Pessimistic Algorithm

来源：评论

学校读者我要写书评

暂无评论

Fault Recovery Based on parallel Recomputing in Transactional Memory System

Fault Recovery Based on Parallel Recomputing in Transactiona...

引用

The 2011 International Conference on Electric and Electronics(EEIC 2011)

作者： Wei Song Jia Jia National Laboratory for Parallel and Distributed Processing School of ComputerNational University of Defense Technology

This paper addresses the issue of fault recovery in transactional memory,and proposes a method of fault recovery based on parallel recomputing in transactional memory *** method utilizes the dataversioning mechanism of transactional memory system to avoid the extra cost of state saving,rolls back a single transaction to avoid wasting the computing time of the fault-free transactions,and adopts the parallel recomputing method to reduce the cost of fault *** paper applies this method to Open TM programs,and proposes the implementation method of parallel recomputing in Open *** last,this paper tests the performance of this method through a test *** experimental results show that,compared with the fault recovery method of rolling back a single transaction,the parallel recomputing method in transactional memory system can execute the fault recovery quickly and accurately and the method has a well scalability.

关键词： Fault tolerance parallel recomputing Fault Recovery Transactional memory

来源：评论

学校读者我要写书评

暂无评论

TRUSTIE: Design of a Trustworthy Software Production Environment

TRUSTIE: Design of a Trustworthy Software Production Environ...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Huaimin Wang National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

Internet fundamentally changes the model of software development, the demands of software quality, and the process of software resource sharing. Internet- based environment for trustworthy software production is recognized as a key topic of software engineering in both academic and software industry. In this paper, the concepts and models of trustworthy software are introduced which dominate the design of Trustie environment. Trustie provides trustworthy software components sharing by an evolving software repository, and provides collaborative software development in a customizable development platform powered by a software production line framework. Finally the layered practices of research and application based on Trustie preliminarily demonstrate the effectiveness as well as the promising future of this environment.

关键词： Software Production Collaboration Internet Resource management Software engineering Programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：