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

1st International Particle Accelerator Conference, IPAC 2010

作者： Yang, X.H. Ma, Y.Y. Shao, F.Q. Yu, T.P. Yin, Y. Tian, C.L. Kawata, S. Yu, M.Y. Gu, Y.Q. Xu, H. Department of Physics National University of Defense Technology Changsha 410073 China Center for Optical Research and Education Graduate School of Engineering Utsunomiya University 7-1-2 Yohtoh Utsunomiya 321-8585 Japan Department of Physics Institute for Fusion Theory and Simulation Zhejiang University Hangzhou 310027 China Laser Fusion Research Center China Academy of Engineering Physics Mianyang 621000 China National Laboratory Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9789290833529

Collimated electron and proton beams from the interaction of an ultra-intense laser pulse with a rear hole target are studied by particle-in-cell (PIC) simulation. When an ultra-intense laser pulse irradiates on such a target, the hot electrons from the inner surfaces of the hole expand fast into the hole. However, the electrons at the corners expand slower and are compressed strongly. Then two intense electron jets as well as proton jets are sprayed out from the corners. The jets extend into the hole and focus along the laser propagation axis. The effects of the corner angle on the collimated proton beam are also investigated.

关键词： Hot electrons

来源：评论

学校读者我要写书评

暂无评论

Providing responsiveness requirement based consistency in DVE

Providing responsiveness requirement based consistency in DV...

引用

15th International Conference on parallel and distributed Systems, ICPADS '09

作者： Zhang, Wei Zhou, Hangjun Peng, Yuxing Li, Sikun National Laboratory for Parallel and Distributed Processing School of Computer Science ChangSha 410073 China

ISBN: (纸本)9780769539003

Consistency and responsiveness are two important factors in providing the sense of reality in distributed Virtual Environment (DVE). However, it is not easy to optimize both aspects because of the trade-off between these two factors. As a result, most existing consistency maintenance methods ignored the responsiveness requirements, or just assumed a simple responsiveness requirement model which cannot meet the real need of DVE systems. In this paper, we first present a new responsiveness requirement model. The model can describe requirement satisfaction situation of each node. Base on this model, we propose a responsiveness requirement based consistency method. The method can adjust the utilization of time resource according to the requirements of different nodes and improve the overall responsiveness performance by at least 20%. Therefore, it provides a good support to increase the applicability of DVE systems. © 2009 IEEE.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

A two-phase mapping method for parallel applications simulation

A two-phase mapping method for parallel applications simulat...

引用

2009 International Conference on Computational Intelligence and Software engineering, CiSE 2009

作者： Fang, Jianbin Xu, Chuanfu Che, Yonggang Weng, Yufen Wang, Zhenghua National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781424445073

Efficient mapping of logical processes to physical processes is one of key technologies to accelerate parallel performance simulation. Aiming at minimizing the communications between SMP nodes and between host physical processes, this paper presents a novel method named TPsmp-LP3M. It automatically extracts communication pattern of logical processes from trace and then generates a two-phase mapping from logical processes to SMP clusters. Experimental results show that TPsmp-LP3M can outperform the regular mapping method by up to 20.2%. ©2009 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

HyperSpring: Accurate and stable latency estimation in the hyperbolic space

HyperSpring: Accurate and stable latency estimation in the h...

引用

15th International Conference on parallel and distributed Systems, ICPADS '09

作者： Fu, Yongquan Wang, Yijie National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology China

ISBN: (纸本)9780769539003

Predicting network latencies between Internet hosts can efficiently support large-scale Internet applications, e.g., file sharing service and the overlay construction. Several study use the Hyperbolic space to model the Internet densecore and many-tendril structure. However, existing Hyperbolic space based embedding approaches are not designed for accurate latency estimation in the distributed context. We present HyperSpring, which estimates latency by modelling a mass spring system in the Hyperbolic similar with Vivaldi. HyperSpring adopts coordinate initialization to speed up the convergence of coordinate computation, uses multiple-round symmetric updates to escape from bad local minima, and stabilizes coordinates by compensating RTT measurements to reduce the coordinate drifts. Evaluation results based on a network trace of 226 PlanetLab nodes indicate that, compared to Euclidean-space based Vivaldi, HyperSpring provides performance improvements for most nodes, and incurs slightly higher distortions for a small number of nodes. © 2009 IEEE.

关键词： Hyperbolic space Latency estimation Mass spring field

来源：评论

学校读者我要写书评

暂无评论

iRank: Supporting proximity ranking for peer-to-peer applications

iRank: Supporting proximity ranking for peer-to-peer applica...

引用

15th International Conference on parallel and distributed Systems, ICPADS '09

作者： Fu, Yongquan Wang, Yijie National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology China

ISBN: (纸本)9780769539003

Proximity ranking according to end-to-end network distances (e.g., Round-Trip Time, RTT) can reveal detailed proximity information, which is important in network management and performance diagnosis in distributed systems. However, to the best of our knowledge, there has been no similar work on this subject in the P2P computing field. We present a distributed rating method iRank, that enables proximity rankings by providing discrete ratings in a distributed manner. It formulates the proximity ranking as a rating problem that faithfully captures the proximity based on noisy distance measurements scalably and practically. The primary challenge in inferring proximity rankings is enforcing distributed ratings with complex rating policies. Our solution is based on reconstructing ratings by decomposing a centralized rating method Maximum Margin Matrix Factorization (MMMF) into independent sub-problems, that can be efficiently solved in a decentralized manner. By relaxing the dependence on infrastructure nodes that are a single point of failure and limit scalability, iRank can gracefully handle network churns. Through real network latency data sets, we demonstrate that iRank can predict ratings with low distortion, which are smaller than 20 percentage worse than the centralized method, in the context of synthetic complex rating policies. © 2009 IEEE.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Anadem: A hybrid overlay network for content-based data distribution

Anadem: A hybrid overlay network for content-based data dist...

引用

15th International Conference on parallel and distributed Systems, ICPADS '09

作者： Zheng, Zhong Wang, Yi-Jie National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9780769539003

As an infrastructure for data distribution, overlay networks have to feature efficient routing and adequate robustness to achieve fast and accurate data distribution in the environment with node churn. Considering that the existing overlay networks mostly focus on single optimization objective and fail to ensure routing efficiency and robustness simultaneously, a hybrid overlay network for content-based data distribution - Anadem is proposed in this paper. Anadem achieves a better compromise between routing efficiency and robustness by combining the intercluster multiple structured topologies with the intra-cluster unstructured topologies. Anadem also provides mechanisms for dynamic concurrent cluster creation, cluster departure and load balance to make data distribution more adaptive to the dynamic network environment. Experimental results reveal that compared with existing overlay networks, Anadem can support fast and accurate content-based data distribution even when large amount of nodes fail in the system. © 2009 IEEE.

关键词： Overlay networks

来源：评论

学校读者我要写书评

暂无评论

Program optimization of array-intensive SPEC2k benchmarks on multithreaded GPU using CUDA and brook+

Program optimization of array-intensive SPEC2k benchmarks on...

引用

15th International Conference on parallel and distributed Systems, ICPADS '09

作者： Wang, Guibin Tang, Tao Fang, Xudong Ren, Xiaoguang National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9780769539003

Graphic processing Unit (GPU), with many lightweight data-parallel cores, can provide substantial parallel computing power to accelerate several general purpose applications. Both the AMD and NVIDIA corps provide their specific high performance GPUs and software platforms. As the floating-point computing capacity increases continually, the problem of "memory-wall" becomes more serious, especially for array-intensive applications. In this paper, we optimize and implement two SPEC2k benchmarks mgrid and swim on multithreaded GPU using CUDA and Brook+. In order to reduce the pressure on off-hip memory, we make use of data locality in multi-level memory hierarchies and hide long memory access latency via double-buffers. To balance inter-thread parallelism and intra-hread locality, we further tune thread granularity for each kernel and empirically study the best equilibrium point for this problem. Flow control instruction can significantly impact the effective instruction throughput. Oriented to this problem, we introduce a diverge elimination technology to convert condition expression into computing operation. Through all the optimizations, we gain the speedup of 10x-34x to the CPU implementation on the GPUs of AMD and NVIDIA respectively. Finally, we summarize and compares the GPUs from AMD and NVIDIA in hardware and software. © 2009 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Quasimonoenergetic Proton Bunch Generation by Dual-Peaked Electrostatic-Field Acceleration in Foils Irradiated by an Intense Linearly Polarized Laser

引用

Physical Review Letters 2010年第6期105卷 065003-065003页

作者： H. B. Zhuo (卓红斌) Z. L. Chen (陈正林) W. Yu (余玮) Z. M. Sheng (盛政明) M. Y. Yu (郁明阳) Z. Jin (金展) R. Kodama (兒玉了祐) Graduate School of Engineering Osaka University 2-1 Yamada-oka Suita Osaka 565-0871 Japan National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 People’s Republic of China Shanghai Institute of Optics and Fine Mechanics Chinese Academy of Sciences Shanghai 201800 People’s Republic of China Department of Physics Shanghai Jiao Tong University Shanghai 200240 People’s Republic of China Beijing National Laboratory for Condensed Matter Physics Institute of Physics CAS Beijing 100080 People’s Republic of China Institute for Fusion Theory and Simulation Zhejiang University Hangzhou 310027 People’s Republic of China Institute for Theoretical Physics I Ruhr University Bochum D-44780 Germany Institute of Laser Engineering Osaka University 2-6 Yamada-oka Suita Osaka 565-0871 Japan

It is found that stable proton acceleration from a thin foil irradiated by a linearly polarized ultraintense laser can be realized for appropriate foil thickness and laser intensity. A dual-peaked electrostatic field, originating from the oscillating and nonoscillating components of the laser ponderomotive force, is formed around the foil surfaces. This field combines radiation-pressure acceleration and target normal sheath acceleration to produce a single quasimonoenergetic ion bunch. A criterion for this mechanism to be operative is obtained and verified by two-dimensional particle-in-cell simulation. At a laser intensity of ∼5.5×1022 W/cm2, quasimonoenergetic GeV proton bunches are obtained with ∼100 MeV energy spread, less than 4° spatial divergence, and ∼50% energy conversion efficiency from the laser.

关键词： Germanium compounds

来源：评论

学校读者我要写书评

暂无评论

Efficient social network approximate analysis on blogosphere based on network structure characteristics

Efficient social network approximate analysis on blogosphere...

引用

3rd Workshop on Social Network Mining and Analysis, SNA-KDD '09

作者： Tang, Jintao Wang, Ting Wang, Ji Wei, Dengping School of Computer National University of Defense Technology ChangSha Hunan 410073 China National Laboratory for Parallel and Distributed Processing ChangSha Hunan 410073 China

ISBN: (纸本)9781605586762

As a typical social media in Web 2.0, blogs have attracted a surge of researches. Unlike the traditional studies, the social networks mined from Internet are very large, which makes a lot of social network analyzing algorithms to be intractable. According to this phenomenon, this paper addresses the novel problem of efficient social networks analyzing on blogs. This paper turns to account the structural characteristics of real large-scale complex networks, and proposes a novel shortest path approximate algorithm to calculate the distance and shortest path between nodes efficiently. The approximate algorithm then is incorporated with social network analysis algorithms and measurements for large-scale social networks analysis. We illustrate the advantages of the approximate analysis through the centrality measurements and community mining algorithms. The experiments demonstrate the effectiveness of the proposed algorithms on blogs, which indicates the necessity of taking account of the structural characteristics of complex networks when optimizing the analysis algorithms on large-scale social networks. Copyright 2009 ACM.

关键词： Blogs

来源：评论

学校读者我要写书评

暂无评论

An irregular cutting based distributed mapping algorithm for DVE systems

An irregular cutting based distributed mapping algorithm for...

引用

2009 2nd Asia-Pacific Conference on Computational Intelligence and Industrial Applications, PACIIA 2009

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

ISBN: (纸本)9781424446070

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. ©2009 IEEE.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：