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

Corrigendum to "A Composite Model of Wound Segmentation Based on Traditional Methods and Deep Neural Networks"

学校读者我要写书评

暂无评论

Computational intelligence and neuroscience 2018年第1期2018卷 4967290页

作者： Fangzhao Li Changjian Wang Xiaohui Liu Yuxing Peng Shiyao Jin Science and Technology on Parallel and Distributed Laboratory National University of Defense Technology Changsha China. College of Computer National University of Defense Technology Changsha China.

[This corrects the article DOI: 10.1155/2018/4149103.].

关键词：

Detailed and clock-driven simulation for HPC interconnection network

学校读者我要写书评

暂无评论

Frontiers of computer science 2016年第5期10卷 797-811页

作者： Wenhao ZHOU Juan CHEN Chen CUI Qian WANG Dezun DONG Yuhua TANG State Key Laboratory of High Performance Computing School of Computer National University of Defense Technology Changsha 410073 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China

Performance and energy consumption of high performance computing （HPC） interconnection networks have a great significance in the whole supercomputer, and building up HPC interconnection network simulation plat- form is very important for the research on HPC software and hardware technologies. To effectively evaluate the per- formance and energy consumption of HPC interconnection networks, this article designs and implements a detailed and clock-driven HPC interconnection network simulation plat- form, called HPC-NetSim. HPC-NetSim uses application- driven workloads and inherits the characteristics of the de- tailed and flexible cycle-accurate network simulator. Besides, it offers a large set of configurable network parameters in terms of topology and routing, and supports router＇s on/off states. We compare the simulated execution time with the real execution time of Tianhe-2 subsystem and the mean error is only 2.7%. In addition, we simulate the network behaviors with different network structures and low-power modes. The results are also consistent with the theoretical analyses.

关键词： high performance computing clock-driven sim-ulation interconnection network BookSim

Large-scale virtual machines provisioning in clouds： challenges and approaches

学校读者我要写书评

暂无评论

Frontiers of computer science 2016年第1期10卷 2-18页

作者： Zhaoning ZHANG Dongsheng LI Kui WU National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China Computer Science Department University of Victoria Victoria V8W 2Y2 Canada

The scale of global data center market has been explosive in recent years. As the market grows, the demand for fast provisioning of the virtual resources to support elas- tic, manageable, and economical computing over the cloud becomes high. Fast provisioning of large-scale virtual ma- chines （VMs）, in particular, is critical to guarantee quality of service （QoS）. In this paper, we systematically review the existing VM provisioning schemes and classify them in three main categories. We discuss the features and research status of each category, and introduce two recent solutions, VMThunder and VMThunder＋, both of which can provision hundreds of VMs in seconds.

关键词： cloud computing IaaS large scale virtual ma-chine provisioning

An improved algorithm for reconstructing singular connection in the multi-block cfd applications

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Yong-Xian, Wang Li-Lun, Zhang Yong-Gang, Che Chuan-Fu, Xu Wei, Liu Hua-Yong, Liu Zheng-Hua, Wang College of Computer National University of Defense Technology Changsha410073 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China State Key Laboratory of Aerodynamics Mianyang621000 China

In this paper, an improved algorithm is proposed for the reconstruction of singularity connectivity from the available pairwise connections during preprocessing phase. To evaluate the performance of our algorithm, an in-house CFD code, in which high-order finite-difference method for spatial discretization, running on the Tianhe-1A supercomputer is employed. Test cases with a varied amount of mesh points are chosen, and the test results indicate that the improved singular connection reconstruction algorithm can achieve a 2000× speedup at least compared with the naive search method adopt in the former version of our code. Moreover, the parallel efficiency can be benefited from the strategy of local communication based on the new algorithm. Copyright © 2017, The Authors. All rights reserved.

关键词： Finite difference method

False-positive probability and compression optimization for tree-structured bloom filters

学校读者我要写书评

暂无评论

ACM Transactions on Modeling and Performance Evaluation of Computing Systems 2016年第4期1卷 1–39页

作者： Fu, Yongquan Biersack, Ernst National Key Laboratory for Parallel and Distributed Processing College of Computer Science National University of Defense Technology Sanyi Road Changsha Hunan Province410073 China CAIPY Valbonne06560 France

Bloom filters are frequently used to to check the membership of an item in a set. However, Bloom filters face a dilemma: the transmission bandwidth and the accuracy cannot be optimized simultaneously. This dilemma is particularly severe for transmitting Bloom filters to remote nodes when the network bandwidth is limited. We propose a novel Bloom filter called BloomTree that consists of a tree-structured organization of smaller Bloom filters, each using a set of independent hash functions. BloomTree spreads items across levels that are compressed to reduce the transmission bandwidth need. We show how to find optimal configurations for BloomTree and investigate in detail by how much BloomTree outperforms the standard Bloom filter or the compressed Bloom filter. Finally, we use the intersection of BloomTrees to predict the set intersection, decreasing the false-positive probabilities by several orders of magnitude compared to both the compressed Bloom filter and the standard Bloom filter. © 2016 ACM 2376-3639/2016/09-ART19 $15.00

关键词： Genetic algorithms

Improving stock market prediction via heterogeneous information fusion

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Zhang, Xi Zhang, Yunjia Wang, Senzhang Yao, Yuntao Fang, Binxing Yu, Philip S. Key Laboratory of Trustworthy Distributed Computing and Service Ministry of Education Beijing University of Posts and Telecommunications Beijing100876 China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing210016 China Department of Computer Science University of Illinois at ChicagoIL60607 United States Institute for Data Science Tsinghua University Beijing100084 China Institute of Electronic and Information Engineering of UESTC in Guangdong Dongguan Guangdong523808 China

Traditional stock market prediction approaches commonly utilize the historical price-related data of the stocks to forecast their future trends. As the Web information grows, recently some works try to explore financial news to improve the prediction. Effective indicators, e.g., the events related to the stocks and the people’s sentiments towards the market and stocks, have been proved to play important roles in the stocks’ volatility, and are extracted to feed into the prediction models for improving the prediction accuracy. However, a major limitation of previous methods is that the indicators are obtained from only a single source whose reliability might be low, or from several data sources but their interactions and correlations among the multi-sourced data are largely ignored. In this work, we extract the events from Web news and the users’ sentiments from social media, and investigate their joint impacts on the stock price movements via a coupled matrix and tensor factorization framework. Specifically, a tensor is firstly constructed to fuse heterogeneous data and capture the intrinsicrelations among the events and the investors’ sentiments. Due to the sparsity of the tensor, two auxiliary matrices, the stock quantitative feature matrix and the stock correlation matrix, are constructed and incorporated to assist the tensor decomposition. The intuition behind is that stocks that are highly correlated with each other tend to be affected by the same event. Thus, instead of conducting each stock prediction task separately and independently, we predict multiple correlated stocks simultaneously through their commonalities, which are enabled via sharing the collaboratively factorized low rank matrices between matrices and the tensor. Evaluations on the China A-share stock data and the HK stock data in the year 2015 demonstrate the effectiveness of the proposed model. Copyright © 2018, The Authors. All rights reserved.

关键词： Tensors

A novel open source software ecosystem: From a graphic point of view and its application 28

学校读者我要写书评

暂无评论

A novel open source software ecosystem: From a graphic point...

28th International Conference on Software Engineering and Knowledge Engineering, SEKE 2016

作者： Song, Chenxi Wang, Tao Yin, Gang Zhang, Xunhui Yang, Cheng National Laboratory for Parallel and Distributed Processing College of Computer National University of Defense Technology Changsha China

ISBN: (纸本)189170639X

With the rapid development of open source software, various elements such as OSS, developers, users and online posts, across different communities and their interactions constitute a novel software ecosystem. Most of the current researches about software ecosystems care the connections between software, and few of them consider the relationship across communities from an overall perspective, and fail to cover the users and their activities which should be an indispensable part of the OSS ecosystem. This paper model the OSS ecosystem as a graph, which combines different types of OSS communities as a whole. Based on this graph model, we analyze the characteristics of ecosystem, like the evolution, competition and symbiosis. In addition, we build a recommendation system as well, and the experiment results suggest the validation of our approach. Copyright © 2016 by KSI Research Inc. and Knowledge Systems Institute Graduate School.

关键词： Ecosystems

Learning non-local image diffusion for image denoising

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Qiao, Peng Dou, Yong Feng, Wensen Chen, Yunjin National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha410073 China School of Automation and Electrical Engineering University of Science and Technology Beijing Beijing

Image diffusion plays a fundamental role for the task of image denoising. Recently proposed trainable nonlinear reaction diffusion (TNRD) model defines a simple but very effective framework for image denoising. However, as the TNRD model is a local model, the diffusion behavior of which is purely controlled by information of local patches, it is prone to create artifacts in the homogenous regions and over-smooth highly textured regions, especially in the case of strong noise levels. Meanwhile, it is widely known that the non-local selfsimilarity (NSS) prior stands as an effective image prior for image denoising, which has been widely exploited in many nonlocal methods. In this work, we are highly motivated to embed the NSS prior into the TNRD model to tackle its weaknesses. In order to preserve the expected property that end-to-end training is available, we exploit the NSS prior by a set of non-local filters, and derive our proposed trainable non-local reaction diffusion (TNLRD) model for image denoising. Together with the local filters and influence functions, the non-local filters are learned by employing loss-specific training. The experimental results show that the trained TNLRD model produces visually plausible recovered images with more textures and less artifacts, compared to its local versions. Moreover, the trained TNLRD model can achieve strongly competitive performance to recent state-of-theart image denoising methods in terms of peak signal-to-noise ratio (PSNR) and structural similarity index (SSIM). Copyright © 2017, The Authors. All rights reserved.

关键词： Image denoising

SPECTRE: Supporting consumption policies in window-based parallel complex event processing

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Mayer, Ruben Slo, Ahmad Tariq, Muhammad Adnan Rothermel, Kurt Gräber, Manuel Ramachandran, Umakishore Institute of Parallel and Distributed Systems University of Stuttgart Department of Computer Science Fast - National University of Computer and Emerging Sciences Islamabad Pakistan College of Computing Georgia Institute of Technology United States

distributed Complex Event Processing (DCEP) is a paradigm to infer the occurrence of complex situations in the surrounding world from basic events like sensor readings. In doing so, DCEP operators detect event patterns on their incoming event streams. To yield high operator throughput, data parallelization frameworks divide the incoming event streams of an operator into overlapping windows that are processed in parallel by a number of operator instances. In doing so, the basic assumption is that the different windows can be processed independently from each other. However, consumption policies enforce that events can only be part of one pattern instance;then, they are consumed, i.e., removed from further pattern detection. That implies that the constituent events of a pattern instance detected in one window are excluded from all other windows as well, which breaks the data parallelism between different windows. In this paper, we tackle this problem by means of speculation: Based on the likelihood of an event's consumption in a window, subsequent windows may speculatively suppress that event. We propose the SPECTRE framework for speculative processing of multiple dependent windows in parallel. Our evaluations show an up to linear scalability of SPECTRE with the number of CPU cores. Copyright © 2017, The Authors. All rights reserved.

关键词： Data handling