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

Pacific-Asia Workshop on Computational Intelligence and Industrial Application, PACIIA

作者： Wei Zhang Hangjun Zhou Yuxing Peng Sikun Li Min Xi National Laboratory of Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha China Department of Computer Science Xi'an Jiaotong University Xi'an China

distributed Virtual Environment (DVE) systems have become more and more important both in academic communities and the industries. To guarantee the load constrain, the physical world integrity and the virtual world integrity, the virtual environment should be divided into several parts and mapped to multiple servers, which are located in geographically different places. Many centralized algorithms based on regular cutting method are proposed to solve this problem. However, the dynamic property of clients and distributed property of the system make the existing algorithms unable to undertake it. In this paper, we propose a metric to measure the cutting quality and design a distributed mapping algorithm based on an irregular cutting. Simulation results show that our algorithm greatly decreases the costs of DVE systems for migration of clients and effectively improves the satisfaction degree of users.

关键词： Defense industry Virtual environment Computer industry Computer science Algorithm design and analysis Delay Partitioning algorithms Industrial training Computational intelligence Application software

来源：评论

学校读者我要写书评

暂无评论

MEASURING THE INFLUENCE OF SOCIAL NETWORKS ON INFORMATION DIFFUSION ON BLOGSPHERES

MEASURING THE INFLUENCE OF SOCIAL NETWORKS ON INFORMATION DI...

引用

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

来源：评论

学校读者我要写书评

暂无评论

A case study on system-level modeling by aspect-oriented programming

A case study on system-level modeling by aspect-oriented pro...

引用

IEEE International Symposium on Quality Electronic Design

作者： Feng Liu Otmane Ait Mohamed Xiaoyu Song Qingping Tan National Laboratory for Parallel and Distributed Processing Hunan China ECE Department Concordia University Montreal QUE Canada ECE Department Portland State University Portland OR USA

The paper presents a novel and synergistic system-level modeling approach based on aspect-oriented programming (AOP) and SystemC. A case study on a 128-bit binary floating-point adder is performed to demonstrate the modeling strength of the approach. The validation experiment shows the effectiveness of the proposed approach. This work constitutes a first attempt to employ AOP in modeling digital systems.

关键词： Hardware Kernel Computer languages parallel programming Processor scheduling distributed processing Electronic mail Adders Digital systems Design methodology

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Computing Must and May Alias to Detect Null Pointer Dereference

Computing Must and May Alias to Detect Null Pointer Derefere...

引用

3rd International Symposium on Leveraging Applications of Formal Methods, Verification and Validation

作者： Ma, Xiaodong Wang, Ji Dong, Wei National Laboratory for Parallel and Distributed Processing China

ISBN: (纸本)9783540884781

This paper presents a novel algorithm to detect null pointer dereference errors. The algorithm utilizes both of the must and may alias information in a compact way to improve the precision of the detection. Using may alias information obtained by a fast flow- and context- insensitive analysis algorithm, we compute the must alias generated by the assignment statements and the must alias information is also used to improve the precision of the may alias. We can strong update more expressions using the must alias information, which will reduce the false positives of the detection for null pointer dereference. We have implemented our algorithm in the SUIF2 compiler infrastructure and the experiments results are as expected.

关键词： Information use

来源：评论

学校读者我要写书评

暂无评论

Laser-driven inertial ion focusing

引用

Physical Review E 2009年第1期79卷 015401(R)-015401(R)页

作者： H. B. Zhuo Wei Yu M. Y. Yu H. Xu X. Wang B. F. Shen Z. M. Sheng J. Zhang National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China Shanghai Institute of Optics and Fine Mechanics Chinese Academy of Sciences Shanghai 201800 China Institute for Fusion Theory and Simulation Zhejiang University Hangzhou 310027 China Institute for Theoretical Physics I Ruhr University Bochum D-44780 Germany Department of Physics Jiaotong University Shanghai 200240 China

A Hohlraum-like configuration is proposed for realizing a simple compact source for neutrons. A laser pulse enters a tiny thin-shelled hollow-sphere target through a small opening and is self-consistently trapped in the cavity. The electrons in the inner shell-wall region are expelled by the light pressure. The resulting space-charge field compresses the local ions into a thin layer that becomes strongly heated. An inward expansion of ions into the shell cavity then occurs, resulting in the formation at the cavity center of a hot spot of ions at high density and temperature, similar to that in inertial electrostatic confinement.

关键词： Trapped ions

来源：评论

学校读者我要写书评

暂无评论

A New Recursive Approach for Reconstructing Metabolic Networks from KEGG

A New Recursive Approach for Reconstructing Metabolic Networ...

引用

Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST)

作者： Tingting Zhou Samuel K.F. Yung Zhenghua Wang Yunping Zhu National Laboratory of Paralleling and Distributed Processing National University of Defense Technology Changsha Hunan China Department of Computing Hong Kong Polytechnic University Hung Hom Hong Kong China State Key Laboratory of Proteomics Beijing Proteome Research Center Beijing Institute of Radiation Medicine Beijing China

The high-quality network reconstruction from metabolites, enzymes and reactions is the first essential step for the studies on the metabolic networks. Previously the approach based on the KEGG/LIGAND database can only reconstruct the organism-level metabolic networks and the network quality is quite doubtful. In this paper we propose a new recursive approach to reconstruct metabolic networks. The data selection mechanism of KEGG/PATHWAY ensures that metabolic networks are parsimonious but reliable. The KO system makes it possible to generate networks hierarchically. The KEGG web service manages to keep the data up-to-date. Results of comparison with the previous approach show our new approach is practical and reliable.

关键词： Biochemistry Organisms Databases Genomics Bioinformatics Laboratories Web services distributed processing Computer networks Biological systems

来源：评论

学校读者我要写书评

暂无评论

Computing Must and May Alias to Detect Null Pointer Dereference

Computing Must and May Alias to Detect Null Pointer Derefere...

引用

作者： Ma, Xiaodong Wang, Ji Dong, Wei National Laboratory for Parallel and Distributed Processing China

ISBN: (纸本)3540884785

关键词： Information use

来源：评论

学校读者我要写书评

暂无评论

Weakly hard real-time scheduling algorithm for multimedia embedded system on multiprocessor platform

Weakly hard real-time scheduling algorithm for multimedia em...

引用

2008 the 1st IEEE International Conference on Ubi-Media Computing and Workshops, U-Media2008

作者： Wu, Tong Jin, Shiyao National Laboratory of Parallel and Distributed Processing NUDT Changsha Hunan China

ISBN: (纸本)9781424418657

Multiprocessor architectures are becoming more attractive for embedded systems, and also for multimedia embedded systems. In multimedia embedded systems, there exist both hard real-time tasks and multimedia stream with QoS guarantee. In this context, researched on integrated schedule of both hard real-time tasks and streams are urgent affairs. This paper analyzes the shortcomings of the current approach - multimedia server, and then based on the DBF algorithm, proposes an algorithm which also considers the resource constraint. According to the different budget schemes, greedy algorithm and optimistic algorithm are brought up. Results show the performance of the algorithms. © 2008 IEEE.

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：