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

IEEE International Conference on systems, Man, and Cybernetics

作者： Yuanyuan Wang Naiyang Guan Bin Mao Xuhui Huang Zhigang Luo Department of Basic Courses Army Officer Academy Science and Technology on Parallel and Distributed Processing Laboratory College of Computer Science National University of Defense Technology College of Science National University of Defense Technology College of Computer Science National University of Defense Technology

ISBN: (纸本)9781479938414

Non-negative matrix factorization (NMF) reconstructs the original samples in a lower dimensional space and has been widely used in pattern recognition and data mining because it usually yields sparse representation. Since NMF leads to unsatisfactory reconstruction for the datasets that contain translations of large magnitude, it is required to develop translation NMF (TNMF) to first remove the translation and then conduct a decomposition. However, existing multiplicative update rule based algorithm for TNMF is not efficient enough. In this paper, we reformulate TNMF and show that it can be efficiently solved by using the state-of-the-art solvers such as NeNMF. Experimental results on face image datasets confirm both efficiency and effectiveness of the reformulated TNMF.

关键词： Non-negative matrix factorization (NMF) Translation transformation NeNMF

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

RAFlow: Read Ahead Accelerated I/O Flow through Multiple Virtual Layers

RAFlow: Read Ahead Accelerated I/O Flow through Multiple Vir...

引用

International Conference on Networking, Architecture, and Storage (NAS)

作者： Zhaoning Zhang Kui Wu Huiba Li Jinghua Feng Yuxing Peng Xicheng Lu National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology China Computer Science Department University of Victoria B.C. Canada National Super Computing Center Tianjin China

Virtualization is the foundation for cloud computing, and the virtualization can not be achieved without software defined, elastic, flexible and scalable virtual layers. Unfortunately, if multiple virtual storage devices are chained together, the system may be subject to severe performance degradation. While the read-ahead (RA) mechanism in storage devices plays a very important role to improve I/O performance, RA may not be effective as expected for multiple virtualization layers, since it is originally designed for one layer only. When I/O requests are passed through a long I/O path, they may trigger a chain reaction and lead to unnecessary data transmission and thus bandwidth waste. In this paper, we study the dynamic behavior of RA through multiple I/O layers and demonstrate that if controlled well, RA can greatly accelerate I/O speed. We present RAFlow, a RA control mechanism, to effectively improve I/O performance by strategically expanding RA window at each layer. Our real-world experiments show that it can achieve 20% to 50% performance improvement in I/O paths with up to 8 virtualized storage devices.

关键词： Radio access networks Acceleration distributed databases Performance evaluation Synchronization Benchmark testing Degradation

来源：评论

学校读者我要写书评

暂无评论

Profiling Patterns of Bit Flipping for Software Transactional Memories

Profiling Patterns of Bit Flipping for Software Transactiona...

引用

International Symposium on computer Architecture and High Performance Computing (SBAC-PAD)

作者： Felipe L. Teixeira Maurício L. Pilla André R. Du Bois Daniel Mossé Laboratory of Ubiquitous and Parallel Systems PPGC - CDTec - UFPEL Pelotas Brazil Lab. of Ubiquitous & Parallel Syst. PPGC - CDTec UFPEL Pelotas Pelotas Brazil Department of Computer Science University of Pittsburgh Pittsburgh USA

Software Transactional Memory (STM) is a synchronization method proposed as an alternative to lockbased synchronization. It provides a higher-level abstraction that is easier to program, and that enables software composition. Transactions are defined by programmers, but the runtime system is responsible for detecting conflicts and avoiding race conditions. Phase Change Memory (PCM) is a new technology that is being developed to replace Dynamic Random Access Memories (DRAMs) in large datacenters. PCM write operations are much more expensive than reads in both energy and time. In this paper, we analyze performance, energy consumption, and write patterns in software transactional memories (STMs) to determine the potential of optimization for PCM scenarios. As the write operations are more expensive both in time and energy in PCMs, benchmarks from the STAMP suite were instrumented to count bits swapped due to store instructions, and experiments were executed using TinySTM. Our results showed a pattern of few bits being flipped for each memory write, and performance was inversely proportional to the number of writes. For most benchmarks, there was a small increase in energy consumption with more threads, which may be explained by the timid contention manager used by TinySTM.

关键词： Benchmark testing Phase change materials Instruction sets Genomics Bioinformatics Random access memory

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Correntropy induced metric based graph regularized non-negative matrix factorization

Correntropy induced metric based graph regularized non-negat...

引用

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

作者： Bin Mao Naiyang Guan Dacheng Tao Xuhui Huang Zhigang Luo College of Science National University of Defense Technology Changsha China College of Computer National University of Defense Technology Science and Technology on Parallel and Distributed Processing Laboratory Changsha China Department of Computer Science and Technology College of Computer National University of Defense Technology Changsha China Faculty of Engineering and Information Technology University of Technology Sydney Sydney NSW Australia

Non-negative matrix factorization (NMF) is an efficient dimension reduction method and plays an important role in many pattern recognition and computer vision tasks. However, conventional NMF methods are not robust since the objective functions are sensitive to outliers and do not consider the geometric structure in datasets. In this paper, we proposed a correntropy graph regularized NMF (CGNMF) to overcome the aforementioned problems. CGNMF maximizes the correntropy between data matrix and its reconstruction to filter out the noises of large magnitudes, and expects the coefficients to preserve the intrinsic geometric structure of data. We also proposed a modified version of our CGNMF which construct the adjacent graph by using sparse representation to enhance its reliability. Experimental results on popular image datasets confirm the effectiveness of CGNMF.

关键词： Robustness Vectors Clustering algorithms Mutual information Measurement computer integrated manufacturing

来源：评论

学校读者我要写书评

暂无评论

Flexible triangular formation keeping of marine robotic vehicles using range measurements 19

Flexible triangular formation keeping of marine robotic vehi...

引用

19th IFAC World Congress on International Federation of Automatic Control, IFAC 2014

作者： Rego, Francisco Soares, Jorge M. Pascoal, António Aguiar, A. Pedro Jones, Colin Laboratory of Robotics and Systems in Engineering and Science Instituto Superior Técnico University of Lisbon Lisbon Portugal Department of Electrical and Computer Engineering Faculty of Engineering University of Porto Porto Portugal Institute of Mechanical Engineering School of Engineering École Polytechnique Fédérale de Lausanne Lausanne Switzerland Distributed Intelligent Systems and Algorithms Laboratory School of Architecture Civil and Environmental Engineering École Polytechnique Fédérale de Lausanne Lausanne Switzerland National Institute of Oceanography Dona Paula Goa India

ISBN: (纸本)9783902823625

This paper addresses the problem of keeping an autonomous marine vehicle in a moving triangular formation by regulating its position with respect to two leader vehicles. The follower vehicle has no prior knowledge of the path described by the leaders but has access to their heading angle and is able to measure inter-vehicle ranges. It is assumed that the distance between the leaders is constant and known. A control strategy is adopted that generates speed and heading commands so as to drive suitably defined along track and cross track errors to zero. The commands are used as input to local inner loops for yaw and speed control. The paper describes the algorithms derived for range-based control and assesses their performance in simulations using realistic models of the vehicles involved. Tests with three autonomous marine vehicles equipped with acoustic modems and ranging devices allow for the evaluation of the performance of the algorithms in a real-world situation. © IFAC.

关键词： Vehicle performance

来源：评论

学校读者我要写书评

暂无评论

Human aware UAS path planning in urban environments using nonstationary MDPs

Human aware UAS path planning in urban environments using no...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Rakshit Allamaraju Hassan Kingravi Allan Axelrod Girish Chowdhary Robert Grande Jonathan P. How Christopher Crick Weihua Sheng Distributed Autonomous Systems Laboratory of Mechanical and Aerospace Eningeering Stillwater OK LIDS at MIT Stillwater OK Department of computer science Stillwater OK Electrical Engineering at Oklahoma State University Stillwater OK

A growing concern with deploying Unmanned Aerial Vehicles (UAVs) in urban environments is the potential violation of human privacy, and the backlash this could entail. Therefore, there is a need for UAV path planning algorithms that minimize the likelihood of invading human privacy. We formulate the problem of human-aware path planning as a nonstationary Markov Decision Process, and provide a novel model-based reinforcement learning solution that leverages Gaussian process clustering. Our algorithm is flexible enough to accommodate changes in human population densities by employing Bayesian nonparametrics, and is real-time computable. The approach is validated experimentally on a large-scale long duration experiment with both simulated and real UAVs.

关键词： Clustering algorithms Data models Computational modeling Sociology Statistics Path planning Kernel

来源：评论

学校读者我要写书评

暂无评论

Trace Bench: An Open Data Set for Trace-Oriented Monitoring

Trace Bench: An Open Data Set for Trace-Oriented Monitoring

引用

IEEE International Conference on Cloud Computing Technology and science (CloudCom)

作者： Jingwen Zhou Zhenbang Chen Ji Wang Zibin Zheng Michael R. Lyu 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 Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong China

User request trace-oriented monitoring is an effective method to improve the reliability of cloud systems. However, there are some difficulties in getting traces in practice, which hinder the development of trace-oriented monitoring research. In this paper, we release a fine-grained user request-centric open trace data set, called Trace Bench, collected on a real world cloud storage system deployed in a real environment. During collecting, many aspects are considered to simulate different scenarios, including cluster size, request type, workload speed, etc. Besides recording the traces when the monitored system is running normally, we also collect the traces under the situation with faults injected. With a mature injection tool, 14 faults are introduced, including function faults and performance faults. The traces in Trace Bench are clustered in different files, where each file corresponds to a certain scenario. The whole collection work lasted for more than half a year, resulting in more than 360, 000 traces in 361 files. In addition, we also employ several applications based on Trace Bench, which validate the helpfulness of Trace Bench for the field of trace-oriented monitoring.

关键词： Monitoring Servers Educational institutions Instruments Cloud computing Context Fault diagnosis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：