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

Asia Communications and Photonics Conference, ACPC 2014

作者： Zhang, Luo Kefie, Wang Zhengbin, Pang Liquan, Xiao Weixia, Xu College of Computer National University of Defense Technology Changsha410073 China National Laboratory for Parallel and Distribution Processing National University of Defense Technology Changsha410073 China

The trimming power of on-chip optical networks consisted by 105 microrings is simulated. The total trimming power is no larger than 14W from 20°C to 100°C, if the distribution of these rings is optimized. &#... 详细信息

ISBN: (纸本)9781557528520

关键词： Trimming

来源：评论

学校读者我要写书评

暂无评论

Location-Aware Multi-user Resource Allocation in distributed Clouds

Location-Aware Multi-user Resource Allocation in Distributed...

引用

10th Annual Conference of Advanced computer Architecture, ACA 2014

作者： Li, Jiaxin Li, Dongsheng Zheng, Jing Quan, Yong National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China Information Center of Logistics Department Beijing China School of Computer Science National University of Defense Technology Changsha China

ISBN: (纸本)9783662444900

Resource allocation for multi-user across multiple data centers is an important problem in cloud computing environments. Many geographically-distributed users may request virtualized resources simultaneously. And the distances from users to allocated resources have much impact on the quality of service (QoS) in multiple data centers environment. Most existing methods do not take all these factors into account when allocating resources. They usually result in poor runtime performance of users' virtual computing environment and the remarkable difference of users' QoS. In this paper, we propose RAMD, a resource allocation algorithm based on multi-stage decision in multiple data centers. The RAMD algorithm allocate VMs to users, taking into account the correlation and interaction between multiple users, so as to minimize the sum of all users' service distances (i.e. determined by user location and network distance of virtual machines). Experimental results show that the algorithm can effectively deal with the cloud resource allocation for multi-user across multiple data centers. It can improve the runtime performance of users' virtualized resources and reduce the difference of QoS. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

CLASSIFICATION OF LAND COVER BASED ON DEEP BELIEF NETWORKS USING POLARIMETRIC RADARSAT-2 DATA

CLASSIFICATION OF LAND COVER BASED ON DEEP BELIEF NETWORKS U...

引用

IEEE International Geoscience and Remote Sensing Symposium

作者： Qi Lv Yong Dou Xin Niu Jiaqing Xu Baoliang Li National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology

ISBN: (纸本)9781479953141

Urban land use and land cover (LULC) classification is one of the core applications in Geographic Information System (GIS). In this paper, a novel classification approach based on Deep Belief Network (DBN) for detailed urban mapping is proposed. Deep Belief Network (DBN) is a widely investigated and deployed deep learning model. By applying the DBN model, effective spatio-temporal mapping features can be automatically extracted to improve the classification performance. Six-date RADARSAT-2 Polarimetric SAR (PolSAR) data over the Great Toronto Area were used for evaluation. Experimental results showed that the proposed method can outperform SVM and contextual approaches using adaptive MRF.

关键词： Land cover classification Deep learning Restricted Boltzmann Machines (RBMs) Deep Belief Network (DBN) PolSAR

来源：评论

学校读者我要写书评

暂无评论

IWFR:Exploiting Full-duplex in Wireless Relay Networks

IWFR:Exploiting Full-duplex in Wireless Relay Networks

引用

2014 4th IEEE International Conference on Information Science and Technology

作者： Yong Lu Shaohe Lv Xiaodong Wang Xingming Zhou National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology

Traditional wireless relay networks have large endto-end time delay and low throughput because of the limit that it can't receive and forward at the same *** this paper,we proposed IWFR:Immediate Wireless Full-Duplex Relay which exploits the advantages of full-duplex to shorten the end-to-end time delay and improve the *** the same time,we designed a new implicit acknowledgement mechanism,which can eliminate the ACK overheads and evidently improve the throughput of the *** implement IWFR,we also modified the full-duplex node architecture to make it support for immediate *** shows that IWFR shortens the end-to-end time delay by 60%on average and improves the throughput to 240%of the original relay.

关键词： Relay IWFR:Exploiting Full-duplex in Wireless Relay Networks

来源：评论

学校读者我要写书评

暂无评论

IWFR: Exploiting full-duplex in wireless relay networks

IWFR: Exploiting full-duplex in wireless relay networks

引用

International Conference on Information Science and Technology (ICIST)

作者： Yong Lu Shaohe Lv Xiaodong Wang Xingming Zhou National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha Hunan China

Traditional wireless relay networks have large end-to-end time delay and low throughput because of the limit that it can't receive and forward at the same time. In this paper, we proposed IWFR: Immediate Wireless Full-Duplex Relay which exploits the advantages of full-duplex to shorten the end-to-end time delay and improve the throughput. At the same time, we designed a new implicit acknowledgement mechanism, which can eliminate the ACK overheads and evidently improve the throughput of the relay. To implement IWFR, we also modified the full-duplex node architecture to make it support for immediate relay. Simulation shows that IWFR shortens the end-to-end time delay by 60% on average and improves the throughput to 240% of the original relay.

关键词： Wireless communication Throughput Delay effects Wireless sensor networks Interference Relay networks (telecommunications)

来源：评论

学校读者我要写书评

暂无评论

Synchronization Error Detection of MPI Programs by Symbolic Execution

Synchronization Error Detection of MPI Programs by Symbolic ...

引用

Asia-Pacific Conference on Software Engineering

作者： Xianjin Fu Zhenbang Chen Chun Huang Wei Dong Ji Wang 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

ISBN: (纸本)9781479974276

Asynchrony based overlapping of computation and communication is commonly used in MPI applications. However, this overlapping introduces synchronization errors frequently in asynchronous MPI programming. In this paper, we propose a symbolic execution based method for detecting input-related synchronization errors. The path space of an MPI program is systematically explored, and the related operations of the synchronization errors in the program are checked specifically. In addition, two optimizations are proposed to improve the efficiency. We have implemented our method as a prototype tool based on the symbolic executor Cloud9. The results of the extensive experiments indicate the effectiveness of our method.

关键词： Synchronization Data communication Libraries Optimization Buffer storage Prototypes Schedules

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Assessing the Impact of Cascading Failures on the Interdomain Routing System of the Internet

引用

New Generation Computing 2014年第3期32卷 237-255页

作者： Liu, Yujing Peng, Wei Su, Jinshu Wang, Zhilin College of Computer National University of Defense Technology Hunan Changsha China College of Computer Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Hunan Changsha China Education Department National University of Defense Technology Hunan Changsha China

The Internet is a typical complex network, whose traffic load is controlled by the inter-domain routing system. Due to the co-location of data plane and control plane of Border Gateway Protocol, the survivability of inter-domain routing system is sensitive to severe congestion. Therefore, an initial outage may lead to a cascade of failures in the Internet. But the cascading failures on links are able to be automatically restored when the congestion is mitigated. In this paper, we propose a model - CAFEIN for characterizing this special process. Based on CAFEIN, we assess the difference of impact under intentional attacks and random breakdowns; identify the worst affected part of the Internet; and study the propagation of cascading failures. Through simulations, we find that the cascading failures bring a great deal of added burden to the routing system. However, the cascading effect is amplified globally when the relative capacity of links is very low. Moreover, the difference of impact between intentional attack and random breakdown is not as prominent as previous research due to the unique automatic-restoration process.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Hierarchical categorization of open source software by online profiles

Hierarchical categorization of open source software by onlin...

引用

作者： Wang, Tao Wang, Huaimin Yin, Gang Yang, Cheng Li, Xiang Zou, Peng Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China Department of Computer Science University of Western Ontario London ON N6A 5B7 Canada Academy of Equipment Beijing 100000 China

The large amounts of freely available open source software over the Internet are fundamentally changing the traditional paradigms of software development. Efficient categorization of the massive projects for retrieving relevant software is of vital importance for Internet-based software development such as solution searching, best practices learning and so on. Many previous works have been conducted on software categorization by mining source code or byte code, but were verified on only relatively small collections of projects with coarse-grained categories or clusters. However, Internet-based software development requires finer-grained, more scalable and language-independent categorization approaches. In this paper, we propose a novel approach to hierarchically categorize software projects based on their online profiles. We design a SVMbased categorization framework and adopt a weighted combination strategy to aggregate different types of profile attributes from multiple repositories. Different basic classification algorithms and feature selection techniques are employed and compared. Extensive experiments are carried out on more than 21,000 projects across five repositories. The results show that our approach achieves significant improvements by using weighted combination. Compared to the previous work, our approach presents competitive results with more finer-grained and multi-layered category hierarchy with more than 120 categories. Unlike approaches that use source code or byte code, our approach is more effective for large-scale and languageindependent software categorization. In addition, experiments suggest that hierarchical categorization combined with general keyword-based searching improves the retrieval efficiency and accuracy. Copyright © 2014 The Institute of Electronics, Information and Communication Engineers.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

DKNNS:Scalable and accurate distributed K nearest neighbor search for latency-sensitive applications

引用

Science China(Information Sciences) 2013年第3期56卷 123-139页

作者： FU YongQuan WANG YiJie National Key Laboratory for Parallel and Distributed Processing School of Computer ScienceNational University of Defense Technology

To reduce the access latencies of end hosts,latency-sensitive applications need to choose suitably close service machines to answer the access requests from end *** K nearest neighbor search locates K service machines closest to end hosts,which can efficiently optimize the access latencies for end *** work has weakness in terms of the accuracy and *** to the scalable and accurate K nearest neighbor search problem,we propose a distributed K nearest neighbor search method called DKNNS in this *** machines are organized into a locality-aware multilevel *** first locates a service machine that starts the search process based on a farthest neighbor search scheme,then discovers K nearest service machines based on a backtracking approach within the proximity region containing the target in the latency *** analysis,simulation results and deployment experiments on the PlanetLab show that,DKNNS can determine K approximately optimal service machines,with modest completion time and query ***,DKNNS is also quite stable that can be used for reducing frequent searches by caching found nearest neighbors.

关键词： latency sensitive network applications K nearest neighbor search network coordinate

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：