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

2009 International Conference on Machine Learning and Cybernetics(2009机器学习与控制论国际会议)

作者： TING WANG JIN-TAO TANG JI WANG School of Computer National University of Defense Technology.Changsha Hunan 410073 P.R.China National Laboratory for Parallel and Distributed Processing ChangSha Hunan 410073 China

As a typical social media in web2.0 era, blogs have become more and more important to information diffusion. Different from the traditional news, the information spread on blogs is primarily driven by users and their relations. According to this phenomenon, this paper addresses the novel problem of measuring the influence of social structures on information diffusion. This paper extracts the hidden communities and information diffusion networks on blogs, and proposes a novel quantitative measurement to investigate the influence of social networks structure on diffusion networks. The proposed methods measure the influence by utilizing a simple but effective graph similarity measuring method. The experiments demonstrate the effectiveness of the proposed algorithms and measurements, and discover the correlation between social networks and the diffusion of the "interest" topics, which indicates the necessity of using social structures for information detection and tracking on blogs.

关键词： Blogs information diffusion social networks graph similarity correlation measurement

来源：评论

学校读者我要写书评

暂无评论

Scheduling algorithm for long duration transaction based on cost of compensation

引用

Ruan Jian Xue Bao/Journal of Software 2009年第3期20卷 744-753页

作者： Zhu, Rui Guo, Chang-Guo Wang, Huai-Min School of Computer National University of Defense Technology Changsha 410073 China National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

Transaction of service composition has long-lived feature which a global-transaction is divided into several distributed sub-transactions. Atomicity property is preserved by using compensating transactions, which semantically undo the effects of the completed sub-transactions, in case of global-transaction abort. However, the cost of compensation may be expensive and methods may be complex. To overcome this limitation, a novel scheduling algorithm named STCD (SubTransaction committing delay) is presented based on analysis of compensation. Different from traditional methods, sub-transactions determine the time of committing according to both the cost of compensation and the state of execution dynamically. The correctness of proposed algorithm is proved. Simulations show that STCD algorithm can confine the compensation sphere and reduce the cost of compensation. © by Institute of Software, the Chinese Academy of sciences. All rights reserved.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Scalable unbiased sampling method based on multi-peer adaptive random walk

引用

Ruan Jian Xue Bao/Journal of Software 2009年第3期20卷 630-643页

作者： Fu, Yong-Quan Wang, Yi-Jie Zhou, Jing National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China Staff Room of Computer Command Academy of the Corps of Engineers Xuzhou 221000 China

To deal with the scalable and fast unbiased sampling problems in unstructured P2P systems, a sampling method based on multi-peer adaptive random walk (SMARW) is proposed. In the method, based on the multi-peer random walk process, a set of provisional peers are selected as agents which start the sampling processes, by which the sampling process is speeded up with receiving a set of tunable number samples each time;Meanwhile, after receiving new samples earlier agents are replaced with these new samples which repeat the sampling process. With this simple replacement, it can be guaranteed with high probability that the system can reach the optimal load balance;furthermore, SMARW adopts an adaptive distributed random walk adjustment process to increase the convergence rate of the sampling process. A detailed theorical analysis and performance evaluation confirm that SMARW has a high level of unbiased sampling and near-optimal load balancing capability. © by Institute of Software, the Chinese Academy of sciences. All rights reserved.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

An example-based decoder for spoken language machine translation 6

An example-based decoder for spoken language machine transla...

引用

6th SIGHAN Workshop on Chinese Language processing, SIGHAN 2008

作者： Li, Zhou-Jun Chao, Wen-Han Chen, Yue-Xin National Laboratory for Parallel and Distributed Processing Changsha China School of Computer Science and Engineering Beihang University China

In this paper, we propose an example-based decoder for a statistical machine translation (SMT) system, which is used for spoken language machine translation. In this way, it will help to solve the re-ordering problem and other problems for spoken language MT, such as lots of omissions, idioms etc. Through experiments, we show that this approach obtains improvements over the baseline on a Chinese-English spoken language translation task. © IJCNLP 2008. All rights reserved.

关键词： Machine translation

来源：评论

学校读者我要写书评

暂无评论

Automating software FMEA via formal analysis of dependence relations

Automating software FMEA via formal analysis of dependence r...

引用

32nd Annual IEEE International computer Software and Applications Conference, COMPSAC 2008

作者： Dong, Wei Wang, Ji Zhao, Changzhi Zhang, Xian Tian, Jie School of Computer National University of Defense Technology China National Laboratory for Parallel and Distributed Processing China

ISBN: (纸本)9780769532622

The paper presents the ongoing work of studying FMEA method for embedded safety critical software via formal analysis of various dependence relations among software elements, which can fairly improve the automation and precision of both system level and detailed level FMEA. These dependence relations are depicted by the formal models abstracted from software design and implementation, and the FMEA processes for both structural and object-oriented software are proposed respectively. The initial result of case study shows the effectiveness of the approach. I 2008 IEEE.

关键词： Safety engineering

来源：评论

学校读者我要写书评

暂无评论

Effective runtime scalability metric to measure productivity in high performance computing systems 08

Effective runtime scalability metric to measure productivity...

引用

2008 Conference on Computing Frontiers, CF'08

作者： Du, Jing Yang, Xuejun Wang, Zhiyuan National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan 410073 China

ISBN: (纸本)9781605580777

Current high performance computing systems all rely on parallel processing techniques to achieve high performance. With the parallel computer systems scaling up, the new generation of high performance computers puts more emphasis on "high productivity" [1], rather than "high performance" as in the past. These new systems will not only meet the traditional requirements of computing performance, but also address the ongoing technical challenges in the current high-end computing domain regarding energy consumption, reliability, etc. For energy consumption, with the computer system scaling up, it increases dramatically [2]. High energy consumption means high maintenance cost and low system stability. For example, the peak energy consumption of the Earth Simulator and BlueGene/L is 18MW and 1.6MW respectively. For reliability, with the complexity of a computer system increasing, its meantimebetween-failure (MTBF) is becoming significantly shorter than what is required by many current high performance computing applications [3], such as BlueGene/L. Therefore, energy optimization techniques and fault tolerance techniques should be introduced to computer systems to achieve low energy consumption and high reliability. To improve the productivity of high performance computing systems, we need to find a proper way to measure it. Unfortunately, traditional measurement models can not evaluate the system productivity comprehensively and effectively [4]. To address this issue, this paper proposes an effective scalability metric for high performance computing systems based on Gustafson speedup law. The metric makes a good balance among runtime productivity factors including computing performance, energy consumption and reliability. The contribution of our work lies in the following three aspects. First, in order to measure the scalability of an energyconsumption optimized parallel program, we should consider not only whether the program computing performance is scalable, but also w

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

A distributed topology-aware overlays construction algorithm 08

A distributed topology-aware overlays construction algorithm

引用

15th ACM Mardi Gras Conference, MG '08

作者： Zhang, Xiaoming Li, Zhoujun Wang, Yijie School of Computer Science and Engineering Beihang University Beijing 100083 China National Laboratory for Parallel and Distributed Processing NUDT Changsha 410073 China

ISBN: (纸本)9781595938350

Peer-to-Peer (P2P) computing systems are rapidly growing in importance as the medium of choice for the mass storage. Peers in the most P2P systems randomly choose logical neighbors without any knowledge about underlying physical topology. This mechanism can cause a serious topology mismatch between the P2P overlay network and the underlying network. It greatly limits the performance gain from various search or routing techniques. In this paper, a distributed topology-aware overlays construction algorithm Taonet is proposed, in which the overlay network construction is based on the location information of underlying topology. The nodes that are close in the logical network are also close in terms of network latency. This leads to low latency stretch of the overlay network. This algorithm is scalable and distributed. Simulation results indicate that the latency of data location in these topology-aware P2P systems that are constructed with Taonet can be significantly decreased. Copyright © 2008 ACM.

关键词： Overlay networks

来源：评论

学校读者我要写书评

暂无评论

Optimistic data consistency maintenance method based on data dependence

引用

Jisuanji Xuebao/Chinese Journal of computers 2008年第5期31卷 741-753页

作者： Zhou, Jing Wang, Yi-Jie Li, Si-Kun National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

This paper proposes an optimistic data consistency method according to the question about data dependence in data consistency. In the method, data object is partitioned into data blocks by fixed size as the basic unit of data management. Updates are compressed by Bloom filter technique and propagated in double-path. Negotiation algorithms detect and reconcile update conflicts, and dynamic data management algorithms accommodate dynamic data processing. The results of the performance evaluation show that it is an efficient method to achieve consistency, good dynamic property, and strong robustness when choosing the size of data block appropriately. At the same time, a feasible way is put forward on how to choose appropriate data block size.

关键词： Data processing

来源：评论

学校读者我要写书评

暂无评论

Symbolic Model Checking APSL

Symbolic Model Checking APSL

引用

第二届IFIP/IEEE软件工程理论基础国际研讨会(TASE 2008)(Second IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering)

作者： Wanwei Liu Ji Wang Huowang Chen Xiaodong Ma National Laboratory for Parallel and Distributed Processing School of computer National University of Defense Technology China

PSL is a kind of temporal logic which uses SEREs as additional formula constructs. We present a variant of PSL, namely APSL, which replaces SEREs with finite automata. APSL and PSL are of the exactly same expressiveness. In this paper, we extend the LTL symbolic model checking algorithm to that of APSL, and present a tableau based APSL verification approach. Moreover, we show how to implement this algorithm via the BDD based symbolic approach.

关键词： Automata Logic Data structures Boolean functions Binary decision diagrams Software engineering Laboratories distributed processing Concurrent computing distributed computing

来源：评论

学校读者我要写书评

暂无评论

Modelling with relational calculus of object and component systems - RCOS

Modelling with relational calculus of object and component s...

引用

作者： Chen, Zhenbang Hannousse, Abdel Hakim Van Hung, Dang Knoll, Istvan Li, Xiaoshan Liu, Zhiming Liu, Yang Nan, Qu Okika, Joseph C. Ravn, Anders P. Stolz, Volker Yang, Lu Zhan, Naijun International Institute for Software Technology United Nations University China Faculty of Science and Technology University of Macau Department of Computer Science Aalborg University Denmark Lab. of Computer Science Institute of Software CAS China National Laboratory for Parallel and Distributed Processing China

ISBN: (纸本)3540852883

This chapter presents a formalization of functional and behavioural requirements, and a refinement of requirements to a design for CoCoME using the Relational Calculus of Object and Component Systems (rCOS). We give a model of requirements based on an abstraction of the use cases described in Chapter 3.2. Then the refinement calculus of rCOS is used to derive design models corresponding to the top level designs of Chapter 3.4. We demonstrate how rCOS supports modelling different views and their relationships of the system and the separation of concerns in the development. © 2008 Springer-Verlag Berlin Heidelberg.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：