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

Embedded DHT overlays in virtual computing environments

Science China(Information Sciences) 2010年第3期53卷 483-493页

作者： ZHANG YiMing, LU XiCheng & LI DongSheng 1.0} {1. for parallel and distributed processing (PDL), Changsha 41.073, China 2School of Computer, national University of Defense Technology, Changsha 41.073, China 1. National Laboratory for Parallel and Distributed Processing (PDL) Changsha 410073 China

With the rapid development of computing and networking technologies, people propose to build harmonious, trusted and transparent Internet-based virtual computing environments (iVCE). The overlay-based organization of dynamic Internet resources is an important approach for iVCE to realizing efficient resource sharing. DHT-based overlays are scalable, low-latency and highly available; however, the current DHT overlay (SKY) in iVCE cannot satisfy the "trust" requirements of Internet applications. To address this problem, in this paper we modify SKY and propose TrustedSKY, an embedded DHT overlay technique in iVCE which supports applications to select trusted nodes to form a "trusted subgroup" in the base overlay and realize secure and trusted DHT routing.

关键词： Internet-based virtual computing environment (iVCE) DHT overlay TrustedSKY

来源：评论

学校读者我要写书评

暂无评论

A fast successive over-relaxation algorithm for force-directed network graph drawing

引用

Science China(Information Sciences) 2012年第3期55卷 677-688页

作者： WANG YongXian & WANG ZhengHua national {1. laboratory for parallel and distributed processing, national University of Defense Technology, Changsha 41.073, China 1. National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

Force-directed approach is one of the most widely used methods in graph drawing research. There are two main problems with the traditional force-directed algorithms. First, there is no mature theory to ensure the convergence of iteration sequence used in the algorithm and further, it is hard to estimate the rate of convergence even if the convergence is satisfied. Second, the running time cost is increased intolerablely in drawing largescale graphs, and therefore the advantages of the force-directed approach are limited in practice. This paper is focused on these problems and presents a sufficient condition for ensuring the convergence of iterations. We then develop a practical heuristic algorithm for speeding up the iteration in force-directed approach using a successive over-relaxation (SOR) strategy. The results of computational tests on the several benchmark graph datasets used widely in graph drawing research show that our algorithm can dramatically improve the performance of force-directed approach by decreasing both the number of iterations and running time, and is 1.5 times faster than the latter on average.

关键词： graph drawing graph layout successive over-relaxation force-directed algorithm

来源：评论

学校读者我要写书评

暂无评论

Towards estimating expected sizes of probabilistic skylines

引用

Science China(Information Sciences) 2011年第12期54卷 2574-2584页

作者： YANG YongTao & WANG YiJie national {1. laboratory for parallel and distributed processing, School of Computer, national University of Defense Technology, Changsha 41.073, China 1. National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

We consider the maximal vector problem on uncertain data, which has been recently posed by the study on processing skyline queries over a probabilistic data stream in the database context. Let D n be a set of n points in a d-dimensional space and q (0 < q 1. be a probability threshold; each point in D n has a probability to occur. Our problem is concerned with how to estimate the expected size of the probabilistic skyline, which consists of all the points that are not dominated by any other point in D n with a probability not less than q. We prove that the upper bound of the expected size is O(min{n, (- ln q)(ln n) d-1.}) under the assumptions that the value distribution on each dimension is independent and the values of the points along each dimension are distinct. The main idea of our proof is to find a recurrence about the expected size and solve it. Our results reveal the relationship between the probability threshold q and the expected size of the probabilistic skyline, and show that the upper bound is poly-logarithmic when q is not extremely small.

关键词： probabilistic skyline probabilistic data streams expected size

来源：评论

学校读者我要写书评

暂无评论

Superscalar communication: A runtime optimization for distributed applications

引用

Science China(Information Sciences) 2010年第10期53卷 1931-1946页

作者： LI HuiBa , LIU ShengYun, PENG YuXing, LI DongSheng, ZHOU HangJun & LU XiCheng national {1. for parallel and distributed processing, national University of Defense Technology, Changsha 41.073, China 1. National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

Building distributed applications is difficult mostly because of concurrency management. Existing approaches primarily include events and threads. Researchers and developers have been debating for decades to prove which is superior. Although the conclusion is far from obvious, this long debate clearly shows that neither of them is perfect. One of the problems is that they are both complex and error-prone. Both events and threads need the programmers to explicitly manage concurrencies, and we believe it is just the source of difficulties. In this paper, we propose a novel approach—superscalar communication, in which concurrencies are automatically managed by the runtime system. It dynamically analyzes the programs to discover potential concurrency opportunities; and it dynamically schedules the communication and the computation tasks, resulting in automatic concurrent execution. This approach is inspired by the idea of superscalar technology in modern microprocessors, which dynamically exploits instruction-level {1.ism. However, hardware superscalar algorithms do not fit software in many aspects, thus we have to design a new scheme completely from scratch. Superscalar communication is a runtime extension with no modification to the language, compiler or byte code, so it is good at backward compatibility. Superscalar communication is likely to begin a brand new research area in systems software, which is characterized by dynamic optimization for networking programs.

关键词： network programming concurrency event thread superscalar

来源：评论

学校读者我要写书评

暂无评论

MPtostream:an OpenMP compiler for CPU-GPU heterogeneous parallel systems

引用

Science China(Information Sciences) 2012年第9期55卷 1961-1971页

作者： YANG XueJun,TANG Tao ,WANG GuiBin,JIA Jia & XU XinHai national {1. for parallel and distributed processing,national University of Defense Technology,Changsha 41.073,China 1. National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

In light of GPUs’ powerful floating-point operation capacity,heterogeneous parallel systems incorporating general purpose CPUs and GPUs have become a highlight in the research field of high performance computing(HPC).However,due to the complexity of programming on GPUs,porting a large number of existing scientific computing applications to the heterogeneous parallel systems remains a big *** OpenMP programming interface is widely adopted on multi-core CPUs in the field of scientific *** effectively inherit existing OpenMP applications and reduce the transplant cost,we extend OpenMP with a group of compiler directives,which explicitly divide tasks among the CPU and the GPU,and map time-consuming computing fragments to run on the GPU,thus dramatically simplifying the *** have designed and implemented MPtoStream,a compiler of the extended OpenMP for AMD’s stream processing *** experimental results show that programming with the extended directives deviates from programming with OpenMP by less than 1.% modification and achieves significant speedup ranging from 3.1.to 1..3 on a heterogeneous system,incorporating an Intel Xeon E5405 CPU and an AMD FireStream 9250 GPU,over the execution on the Xeon CPU alone.

关键词： GPGPU stream OpenMP compiler

来源：评论

学校读者我要写书评

暂无评论

A logistic regression model for Semantic Web service matchmaking

引用

Science China(Information Sciences) 2012年第7期55卷 1715-1720页

作者： WEI DengPing 1.,WANG Ting 1.& WANG Ji 2 1.School of Computer,national University of Defense Technology,Changsha 41.073,China 2 national laboratory for parallel and distributed processing,Changsha 41.073,China 1. School of Computer National University of Defense Technology Changsha 410073 China2. National Laboratory for Parallel and Distributed Processing Changsha 410073 China

Semantic Web service matchmaking,as one of the most challenging problems in Semantic Web services (SWS),aims to filter and rank a set of services with respect to a service query by using a certain matching *** this paper,we propose a logistic regression based method to aggregate several matching strategies instead of a fixed integration (e.g.,the weighted sum) for SWS *** logistic regression model is trained on training data derived from binary relevance assessments of existing test collections,and then used to predict the probability of relevance between a new pair of query and service according to their matching values obtained from various matching *** are then ranked according to the probabilities of relevance with respect to each *** method is evaluated on two main test collections,SAWSDL-TC2 and Jena Geography Dataset(JGD).Experimental results show that the logistic regression model can effectively predict the relevance between a query and a service,and hence can improve the effectiveness of service matchmaking.

关键词： Semantic Web service matchmaking logistic regression

来源：评论

学校读者我要写书评

暂无评论

Survey of DHT topology construction techniques in virtual computing environments

引用

Science China(Information Sciences) 2011年第11期54卷 2221-2235页

作者： ZHANG YiMing 1.2,LU XiCheng 1.2 & LI DongSheng 1.21.national {1. for parallel and distributed processing (PDL),Changsha 41.073,China 2 School of Computer,national University of Defense Technology,Changsha 41.073,China 1. National Laboratory for Parallel and Distributed Processing (PDL) Changsha 410073 China2. School of Computer National University of Defense Technology Changsha 410073 China

The Internet-based virtual computing environment (iVCE) is a novel network computing *** characteristics of growth,autonomy,and diversity of Internet resources present great challenges to resource sharing in *** DHT overlay (DHT for short) technique has various advantages such as high scalability,low latency,and desirable availability,and is thus an important approach to realizing efficient resource *** construction is a key technique for structured overlays that realizes basic overlay functions including dynamic maintenance and message *** this paper,we first introduce the traditional techniques of DHT topology construction,focusing mainly on dynamic maintenance and message routing of typical DHTs,DHT indexing techniques for complex queries,and DHT grouping techniques for matching domain *** then present recent advances in DHT topology construction techniques in iVCE taking advantage of the characteristics of Internet ***,we discuss the future of DHT topology construction techniques.

关键词： virtual computing environments DHT overlays topology construction distributed indexing flexible routing

来源：评论

学校读者我要写书评

暂无评论

Merge-Weighted Dynamic Time Warping for Speech Recognition

引用

Journal of Computer Science & Technology 2014年第6期29卷 1072-1082页

作者：张湘莉兰骆志刚李明 State Key Laboratory of Pathogen and Biosecurity Beijing Institute of Microbiology and Epidemiology Science and Technology on Parallel and Distributed Processing Laboratory School of Computer Science National University of Defense Technology David R.Cheriton School of Computer Science University of WaterlooWaterlooOntario N2L 3G1Canada ACM IEEE

Obtaining training material for rarely used English words and common given names from countries where English is not spoken is difficult due to excessive time, storage and cost factors. By considering personal privacy, language- independent （LI） with lightweight speaker-dependent （SD） automatic speech recognition （ASR） is a convenient option to solve tile problem. The dynamic time warping （DTW） algorithm is the state-of-the-art algorithm for small-footprint SD ASR for real-time applications with limited storage and small vocabularies. These applications include voice dialing on mobile devices, menu-driven recognition, and voice control on vehicles and robotics. However, traditional DTW has several lhnitations, such as high computational complexity, constraint induced coarse approximation, and inaccuracy problems. In this paper, we introduce the merge-weighted dynamic time warping （MWDTW） algorithm. This method defines a template confidence index for measuring the similarity between merged training data and testing data, while following the core DTW process. MWDTW is simple, efficient, and easy to implement. With extensive experiments on three representative SD speech recognition datasets, we demonstrate that our method outperforms DTW, DTW on merged speech data, the hidden Markov model （HMM） significantly, and is also six times faster than DTW overall.

关键词： merge-weighted dynamic time warping natural language processing speech recognition and synthesis tem-plate confidence index

来源：评论

学校读者我要写书评

暂无评论

High-energy-density electron beam from interaction of two successive laser pulses with subcritical-density plasma

引用

Physical Review Accelerators and Beams 2016年第2期19卷 021301-021301页

作者： J. W. Wang W. Yu M. Y. Yu H. Xu J. J. Ju S. X. Luan M. Murakami M. Zepf S. Rykovanov Helmholtz Institute Jena Jena 07743 Germany State Key Laboratory of High Field Laser Physics Shanghai Institute of Optics and Fine Mechanics Chinese Academy of Sciences Shanghai 201800 China Institute for Fusion Theory and Simulation and the Department of Physics Zhejiang University Hangzhou 310027 China Institute for Theoretical Physics I Ruhr University Bochum D-44780 Germany National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China Institute of Laser Engineering Osaka University Osaka 565-0871 Japan Centre for Plasma Physics School of Mathematics and Physics Queen’s University Belfast Belfast BT7 1NN United Kingdom

It is shown by particle-in-cell simulations that a narrow electron beam with high energy and charge density can be generated in a subcritical-density plasma by two consecutive laser pulses. Although the first laser pulse dissipates rapidly, the second pulse can propagate for a long distance in the thin wake channel created by the first pulse and can further accelerate the preaccelerated electrons therein. Given that the second pulse also self-focuses, the resulting electron beam has a narrow waist and high charge and energy densities. Such beams are useful for enhancing the target-back space-charge field in target normal sheath acceleration of ions and bremsstrahlung sources, among others.

关键词： Plasma acceleration & new acceleration techniques

来源：评论

学校读者我要写书评

暂无评论

The Hi-GAL compact source catalogue. I : The physical properties of the clumps in the inner Galaxy (−71.0◦ 67.0◦)

arXiv

引用

arXiv 2017年

作者： Elia, Davide Molinari, S. Schisano, E. Pestalozzi, M. Pezzuto, S. Merello, M. Noriega-Crespo, A. Moore, T.J.T. Russeil, D. Mottram, J.C. Paladini, R. Strafella, F. Benedettini, M. Bernard, J.P. Di Giorgio, A. Eden, D.J. Fukui, Y. Plume, R. Bally, J. Martin, P.G. Ragan, S.E. Jaffa, S.E. Motte, F. Olmi, L. Schneider, N. Testi, L. Wyrowski, F. Zavagno, A. Calzoletti, L. Faustini, F. Natoli, P. Palmerim, P. Piacentini, F. Piazzo, L. Pilbratt, G.L. Polychroni, D. Baldeschi, A. Beltrán, M.T. Billot, N. Cambrésy, L. Cesaroni, R. García-Lario, P. Hoare, M.G. Huang, M. Joncas, G. Liu, S.J. Maiolo, B.M.T. Marsh, K.A. Maruccia, Y. Mège, P. Peretto, N. Rygl, K.L.J. Schilke, P. Thompson, M.A. Traficante, A. Umana, G. Veneziani, M. Ward-Thompson, D. Whitworth, A.P. Arab, H. Bandieramonte, M. Becciani, U. Brescia, M. Buemi, C. Bufano, F. Butora, R. Cavuoti, S. Costa, A. Fiorellino, E. Hajnal, A. Hayakawa, T. Kacsuk, P. Leto, P. Li Causi, G. Marchili, N. Martinavarro-Armengol, S. Mercurio, A. Molinaro, M. Riccio, G. Sano, H. Sciacca, E. Tachihara, K. Torii, K. Trigilio, C. Vitello, F. Yamamoto, H. INAF-IAPS via del Fosso del Cavaliere 100 Roma00133 Italy Space Telescope Science Institute 3700 San Martin Dr. BaltimoreMD21218 United States Astrophysics Research Institute Liverpool John Moores University Liverpool Science Park Ic2 146 Brownlow Hill LiverpoolL3 5RF United Kingdom Aix Marseille Univ. CNRS LAM Laboratoire d’Astrophysique de Marseille Marseille France Max-Planck Institute for Astronomy Königstuhl 17 HeidelbergD-69117 Germany Infrared Processing Analysis Center California Institute of Technology 770 South Wilson Ave. PasadenaCA91125 United States Dipartimento di Matematica e Fisica Università del Salento Lecce73100 Italy CNRS IRAP 9 Av. colonel Roche BP 44346 Toulouse cedex 4F-31028 France Université de Toulouse UPS-OMP IRAP Toulouse cedex 4F-31028 France Department of Physics Nagoya University Chikusa-ku Nagoya Aichi464-8601 Japan Department of Physics & Astronomy University of Calgary ABT2N 1N4 Canada Center for Astrophysics and Space Astronomy University of Colorado BoulderCO80309 United States Canadian Institute for Theoretical Astrophysics University of Toronto McLennan Physical Laboratories 60 St. George Street TorontoON Canada School of Physics and Astronomy University of Leeds LeedsLS2 9JT United Kingdom School of Physics and Astronomy Cardiff University Cardiff WalesCF24 3AA United Kingdom IPAG University Grenoble Alpes Grenoble38000 France AIM Paris-Saclay CEA/IRFU - CNRS INSU - Univ. Paris Diderot Service d’Astrophysique CEA-Saclay Gif-surYvette Cedex91191 France INAF Osservatorio Astrofisico di Arcetri Largo E. Fermi 5 Firenze50125 Italy I. Physik. Institut University of Cologne Zülpicher Strasse Köln50937 Germany European Southern Observatory Karl Schwarzschild str. 2 Garching85748 Germany Max-Planck-Institut für Radioastronomie Auf dem Hügel 69 Bonn53121 Germany ASI Science Data centre 00044 Frascati Roma Italy ESA/ESAC PO Box 78 Villanueva de la Cañada Madrid28691 Spain

Hi-GAL is a large-scale survey of the Galactic plane, performed with Herschel in five infrared continuum bands between 70 and 500 &#1.1.m. We present a band-merged catalogue of spatially matched sources and their prop... 详细信息

Hi-GAL is a large-scale survey of the Galactic plane, performed with Herschel in five infrared continuum bands between 70 and 500 µm. We present a band-merged catalogue of spatially matched sources and their properties derived from fits to the spectral energy distributions (SEDs) and heliocentric distances, based on the photometric catalogs presented in Molinari et al. (201.a), covering the portion of Galactic plane −71.0◦ 67.0◦. The band-merged catalogue contains 1.0922 sources with a regular SED, 24584 of which show a 70 µm counterpart and are thus considered proto-stellar, while the remainder are considered starless. Thanks to this huge number of sources, we are able to carry out a preliminary analysis of early stages of star formation, identifying the conditions that characterise different evolutionary phases on a statistically significant basis. We calculate surface densities to investigate the gravitational stability of clumps and their potential to form massive stars. We also explore evolutionary status metrics such as the dust temperature, luminosity and bolometric temperature, finding that these are higher in proto-stellar sources compared to pre-stellar ones. The surface density of sources follows an increasing trend as they evolve from pre-stellar to proto-stellar, but then it is found to decrease again in the majority of the most evolved clumps. Finally, we study the physical parameters of sources with respect to Galactic longitude and the association with spiral arms, finding only minor or no differences between the average evolutionary status of sources in the fourth and first Galactic quadrants, or between "on-arm" and "inter-arm" positions. Copyright © 201., The Authors. All rights reserved.

关键词： Galaxies

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：