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

Effective hierarchical routing algorithm for large-scale wireless mobile networks

Journal of Networks 2014年第2期9卷 344-352页

作者： Yan, Guofeng Peng, Yuxing Hu, Ying Liu, Junyi School of Computer and Communication Hunan Institute of Engineering Hunan 411104 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China School of Computer National University of Defense Technology Changsha 410073 China

The growing interest in wireless mobile network techniques has resulted in many routing protocol proposals. The unpredictable motion and the unreliable behavior of mobile nodes is one of the key issues in wireless mobile network. Virtual mobile node (VMN) consists of robust virtual nodes that are both predictable and reliable. Based on VMN, in this paper, we present a hierarchical routing algorithm, i.e., EHRA-WAVE, for large-scale wireless mobile networks. By using mobile WAVE technology, a routing path can be found rapidly between VMNs without accurate topology information. We introduce the routing algorithm and the implementation issues of the proposed EHRA-WAVE routing algorithm. Finally, we evaluate the performance of EHRA-WAVE through experiments, and compare the performance on VMN failure and message delivery ratio using hierarchical and non-hierarchical routing methods. However, due to the large amounts WAVE flooding, EHRA-WAVE results in too large load which would impede the application of the EHRA-WAVE algorithm. Therefore, the further routing protocol focuses on minimizing the number of WAVE using hierarchical structures in large-scale wireless mobile networks. © 2014 Academy Publisher.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Who Should Review this Pull-Request: Reviewer Recommendation to Expedite Crowd Collaboration

Who Should Review this Pull-Request: Reviewer Recommendation...

引用

Asia-Pacific Conference on Software Engineering

作者： Yue Yu Huaimin Wang Gang Yin Charles X. Ling National Laboratory for Parallel and Distributed Processing College of Computer National University of Defense Technology Changsha China Department of Computer Science The University of Western Ontario London Ontario Canada

Github facilitates the pull-request mechanism as an outstanding social coding paradigm by integrating with social media. The review process of pull-requests is a typical crowd sourcing job which needs to solicit opinions of the community. Recommending appropriate reviewers can reduce the time between the submission of a pull-request and the actual review of it. In this paper, we firstly extend the traditional Machine Learning (ML) based approach of bug triaging to reviewer recommendation. Furthermore, we analyze social relations between contributors and reviewers, and propose a novel approach to recommend highly relevant reviewers by mining comment networks (CN) of given projects. Finally, we demonstrate the effectiveness of these two approaches with quantitative evaluations. The results show that CN-based approach achieves a significant improvement over the ML-based approach, and on average it reaches a precision of 78% and 67% for top-1 and top-2 recommendation respectively, and a recall of 77% for top-10 recommendation.

关键词： Communities Rails Training Software Encoding Mathematical model Social network services

来源：评论

学校读者我要写书评

暂无评论

Distributed Relation Discovery in Internet of Things

Distributed Relation Discovery in Internet of Things

引用

International Conference on Cloud Computing and Big Data (CCBD)

作者： Weiping Zhu Hongliang Lu Xiaohui Cui International School of Software Wuhan University China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology China Department of Computing Hong Kong Polytechnic University Hong Kong

ISBN: (纸本)9781479966226

Internet of things is an emerging technology that aims to connect various smart objects in our daily life. It facilitates the information exchange and control among objects. In the Internet of things, it is important to discover various relations among objects for analyzing and mining useful knowledge. Existing works on relation discovery mainly focus on centralized processing. It is not suitable for Internet of things due to unavailable of server, one-point failure, computation bottleneck, and security and business concerns. In this paper, we propose a distributed approach to discover the relations among objects in Internet of things. We first build the distritbuted system model which may include multiple relation discovery tasks. Based on that, we design an approach utilizing distributed spanning tree to extract the relations. Rather than sending all the information to the server, the objects only need to send the information to a local leader object in our algorithm. We also discuss more about how to improve the performance of the proposed approach and how to relax the system constraints. Extensive simulation have been done and the results show that the proposed approach outperforms existing approaches in terms of the data amount of transmission.

关键词： Internet of things Synchronization Buildings Servers Algorithm design and analysis Delays

来源：评论

学校读者我要写书评

暂无评论

Array receiving scheme for ultra-wideband WSN OFDM signals

引用

Ruan Jian Xue Bao/Journal of Software 2014年 25卷 30-38页

作者： Du, Xiao-Li Lü, Shao-He Wang, Xiao-Dong Zhou, Xing-Ming Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China

This paper proposes an array receiving scheme for ultra-wideband (UWB) OFDM signals in WSN networks. The major feature of the proposed scheme is recovering the UWB OFDM signal by frequency stitching. Firstly, the UWB OFDM signal is divided into multiple sub-bands. Every two adjacent sub-bands share at least one overlapped subcarrier(s), which is used for time alignment later. A sub-signal of the UWB OFDM signal is received on each sub-band by a narrow-band receiver. The received data sets of narrow-band receivers are time aligned by performing peak value alignment retrieval (PVAR) on the shared subcarriers. Then the UWB OFDM signal is recovered by fusing the received data sets according to the result of PVAR. As the implementation of narrow-band receivers only needs low-speed ADCs, the challenge of high-speed ADC in traditional UWB OFDM receiver is addressed. Extensive simulations are performed to demonstrate the validity of the proposed scheme and further look into three performance metrics: (1) synchronization error-tolerance, (2) extensibility, (3) performance under different SNR values. ©2014 ISCAS.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Single image defogging with single and multiple hybrid scattering model

Single image defogging with single and multiple hybrid scatt...

引用

International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)

作者： Weijiang Feng Naiyang Guan Xiang Zhang Xuhui Huang Zhigang Luo Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha Hunan P.R. China Department of Computer Science and Technology College of Computer National University of Defense Technology Changsha Hunan P.R. China

Image defogging (IDF) removes influences of fogs from an image to improve its quality. Since defogged images can significantly boost the performance of subsequent processing, IDF has attracted many attentions from the computer vision community. However, existing IDF algorithms are built on the assumption that light is scattered once by a grain. Since such assumption is violated if images are contaminated by dense haze or heavy fog, traditional IDF algorithms often fail in this situation. In this paper, we propose a hybrid image defogging (HIDF) algorithm to overcome this deficiency. In particular, HIDF applies the single scattering physics model (SSPM) to pixels dominated by single scattering of light, and applies the multiple scattering physics model (MSPM) to remaining pixels. To distinguish two types of pixels, HIDF utilizes the optical thickness of corresponding pixels. If optical thickness is smaller than a threshold that determines whether the single scattering or the multiple scattering dominates, HIDF applies the SSPM, and HIDF applies the MSPM otherwise. Experimental results on several popular foggy images demonstrate that HIDF competes with the state-of-the-art algorithms, and show the promise of HIDF for defogging heavily foggy images.

关键词： Meteorology Optical imaging Optical scattering Atmospheric modeling Image color analysis

来源：评论

学校读者我要写书评

暂无评论

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 µ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. (2016a), covering the portion of Galactic plane −71.0◦ 67.0◦. The band-merged catalogue contains 100922 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 © 2017, The Authors. All rights reserved.

关键词： Galaxies

来源：评论

学校读者我要写书评

暂无评论

parallel 3D deterministic particle transport on Intel MIC architecture

Parallel 3D deterministic particle transport on Intel MIC ar...

引用

International Conference on High Performance Computing & Simulation (HPCS)

作者： Qinglin Wang Zuocheng Xing Jie Liu Xiaogang Qiang Chunye Gong Jiang Jiang Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China H.H. Wills Physics Laboratory University of Bristol Bristol UK Science and Technology on Space Physics Libratory Beijing China School of Microelectronics Shanghai Jiao Tong University Shanghai China

Single-node computation speed is essential in large-scale parallel solutions of particle transport problems. The Intel Many Integrated Core (MIC) architecture supports more than 200 hardware threads as well as 512-bit double precision float-point vector operations. In this paper, we use the native model of MIC in the parallelization of the simulation of one energy group time-independent deterministic discrete ordinates particle transport in 3D Cartesian geometry (Sweep3D). The implementation adopts both hardware threads and vector units in MIC to efficiently exploit multi-level parallelism in the discrete ordinates method when keeping good data locality. Our optimized implementation is verified on target MIC and can provide up to 1.99 times speedup based on the original MPI code on Intel Xeon E5-2660 CPU when flux fixup is off. Compared with the prior on NVIDIA Tesla M2050 GPU, the speedup of up to 1.23 times is obtained. In addition, the difference between the implementations on MIC and GPU is discussed as well.

关键词： Computer architecture Microwave integrated circuits Graphics processing units Tin Computational modeling Legged locomotion Equations

来源：评论

学校读者我要写书评

暂无评论

A Runtime Verification Based Trace-Oriented Monitoring Framework for Cloud Systems

A Runtime Verification Based Trace-Oriented Monitoring Frame...

引用

IEEE International Conference on Software Reliability Engineering Workshops (ISSRE Wksp)

作者： Jingwen Zhou Zhenbang Chen Ji Wang Zibin Zheng Wei Dong College of Computer National University of Defense Technology Changsha China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China Shenzhen Research Institute The Chinese University of Hong Kong Shenzhen China

Cloud computing provides a new paradigm for resource utilization and sharing. However, the reliability problems, like system failures, often happen in cloud systems and bring enormous loss. Trace-oriented monitoring is an important runtime method to improve the reliability of cloud systems. In this paper, we propose to bring runtime verification into trace-oriented monitoring, to facilitate the specification of monitoring requirements and to improve the efficiency of monitoring cloud systems. Based on a data set collected from a cloud storage system in a real environment, we validate our approach by monitoring the critical properties of the storage system. The preliminary experimental results indicate the promise of our approach.

关键词： Monitoring Runtime Cloud computing Educational institutions Reliability Google Computers

来源：评论

学校读者我要写书评

暂无评论

Approximate Maximum Common Sub-graph Isomorphism Based on Discrete-Time Quantum Walk

Approximate Maximum Common Sub-graph Isomorphism Based on Di...

引用

International Conference on Pattern Recognition

作者： Kai Lu Yi Zhang Kai Xu Yinghui Gao Richard C. Wilson Science and Technology on Parallel and Distributed Processing Laboratory and College of Computer National University of Defense Technology Changsha P.R. China College of Electronic Science and Engineering National University of Defense Technology Changsha P.R. China Department of Computer Science University of York York UK

Maximum common sub-graph isomorphism (MCS) is a famous NP-hard problem in graph processing. The problem has found application in many areas where the similarity of graphs is important, for example in scene matching, video indexing, chemical similarity and shape analysis. In this paper, a novel algorithm Qwalk is proposed for approximate MCS, utilizing the discrete-time quantum walk. Based on the new observation that isomorphic neighborhood group matches can be detected quickly and conveniently by the destructive interference of a quantum walk, the new algorithm locates an approximate solution via merging neighborhood groups. Experiments show that Qwalk has better accuracy, universality and robustness compared with the state-of-the-art approximate MCS methods. Meanwhile, Qwalk is a general algorithm to solve the MCS problem approximately while having modest time complexity.

关键词： Approximation algorithms Interference Algorithm design and analysis Accuracy Time complexity Quantum computing Noise

来源：评论

学校读者我要写书评

暂无评论

Overlapping community detection via link partition of asymmetric weighted graph

Overlapping community detection via link partition of asymme...

引用

International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)

作者： Wenju Zhang Naiyang Guan Xuhui Huang Zhigang Luo Jianwu Li Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha Hunan P.R. China 410073 National University of Defense Technology Changsha Hunan CN Beijing Institute of Technology Beijing Beijing CN

Link partition clusters edges of a complex network to discover its overlapping communities. Due to Its effectiveness, link partition has attracted much attentions from the network science community. However, since link partition assigns each edge of a network to unique community, it cannot detect the disjoint communities. To overcome this deficiency, this paper proposes a link partition on asymmetric weighted graph (LPAWG) method for detecting overlapping communities. Particularly, LPAWG divides each edge into two parts to distinguish the roles of connected nodes. This strategy biases edges to a specific node and helps assigning each node to its affiliated community. Since LPAWG introduces more edges than those in the original network, it cannot efficiently detect communities from some networks with relative large amount of edges. We therefore aggregate the line graph of LPAWG to shrink its scale. Experimental results of community detection on both synthetic datasets and the realworld networks show the effectiveness of LPAWG comparing with the representative methods.

关键词： Communities Image edge detection Partitioning algorithms Benchmark testing Acceleration Educational institutions Complex networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：