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

Journal of Software 2009年第3期4卷 240-246页

作者： Lu, Pingjing Che, Yonggang Wang, Zhenghua National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

The performance gap for high performance applications has been widening over time. High level program transformations are critical to improve applications' performance, many of which concern the determination of optimal values for transformation parameters, such as loop unrolling and blocking. Static approaches achieve these values based on analytical models that are hard to achieve because of increasing architecture complexity and code structures. Recent iterative compilation approaches achieve it by executing different versions of the program on actual platforms and select the one that renders best performance, outperforming static compilation approaches significantly. But the expensive compilation cost has limited their application scope to embedded applications and a small group of math kernels. This paper proposes a combinative approach--Combining Model and Iterative Compilation for Program Performance Optimization (CMIC). Such an approach first constructs a program optimization transformation model based on hardware performance counters to decide how and when to apply transformations, and then selects the optimal transformation parameters using Nelder-Mead simplex algorithm. Experimental results show that our approach can effectively improve programs' floating-point performance, reducing programs' runtime, therefore, lessening the performance gap for high-performance applications. © 2009 ACADEMY PUBLISHER.

关键词： Digital arithmetic

来源：评论

学校读者我要写书评

暂无评论

UML based statistical testing acceleration of distributed safety-critical software 04

引用

Proceedings of the Second international conference on parallel and distributed processing and Applications

作者： Jiong Yan Ji Wang Huo-wang Chen National Laboratory for Parallel and Distributed Processing Changsha P.R. China

ISBN: (纸本)9783540241287

It is necessary to assess the reliability of distributed safety-critical systems to a high degree of confidence before they are deployed in the field. However, distributed safety-critical software systems often include some rarely executed critical functions that are often inadequately tested in statistical testing based reliability estimation. This paper presents a method that can accelerate statistical testing of distributed safety-critical software. The method starts with the derivation of scenario usage diagram model (SUD) from UML diagrams annotated with usage related attributes and reliability attributes. Then the statistical testing accelerating method based on importance sampling is presented. When both the critical scenarios and the entire software are adequately tested, the method can still compute the unbiased software reliability from the test results with much less test cases. Thus, the statistical testing cost of distributed safety-critical software can be reduced effectively.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Software Effective Evaluating Technology: SWEET

Software Effective Evaluating Technology: SWEET

引用

IEEE International Conference on Software Engineering and Service Sciences (ICSESS)

作者： Yaozong Li Tao Wang Yue Yu Dongyang Hu National Laboratory for Parallel and Distributed Processing National University of Defence Technology Changsha China

ISBN: (数字)9781728109459

ISBN: (纸本)9781728109466

In open source community, there are a large number of software resources existing. Such software resources distribute in different societies or storehouses, which require different software characteristic. This phenomenon results in difficult to evaluate software quality using traditional methods. In this case, a novel open-source software sorting algorithm may be an effective solution. Considering both subjective and objective levels, we propose a new method on software sorting and retrieving. In the subjective level, metrics are selected from the corresponding collaborative development community based on software topic. In the objective level, metrics are obtained from the group emotional evaluation value of the knowledge sharing community. We have proved the effectiveness of the method through comparison experiments. Combining with the Solrcloud tool, this method has been integrated into the OSSEAN platform.

关键词： Open source software Sorting Collaboration Software algorithms Measurement Tools

来源：评论

学校读者我要写书评

暂无评论

Enhanced streamline texture synthesis for vector field visualization

Enhanced streamline texture synthesis for vector field visua...

引用

International Conference on High Performance Computing in the Asia-Pacific Region

作者： Wen Zhang Xiaomei Li National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)0769505892

The Streamline Texture Synthesis (STS) method uses a different 1D texture to texture map each streamline and streamline textures are synthesized. The Enhanced STS (ESTS) adjusts the width of a streamline based on the critical point and maps several 1D textures to a streamline in order to accelerate computing. ESTS can also simulate animations and visualize 2D unsteady or 3D surface flows. The analyzed result proves that ESTS produces substantially better visual results and ESTS is fast enough to visualize vector field interactively.

关键词： Visualization Streaming media Pixel Sociotechnical systems Animation Convolution Image sampling Acceleration Computational modeling Filters

来源：评论

学校读者我要写书评

暂无评论

VISUAL CONFUSION LABEL TREE FOR IMAGE CLASSIFICATION

VISUAL CONFUSION LABEL TREE FOR IMAGE CLASSIFICATION

引用

IEEE International Conference on Multimedia and Expo

作者： Yuntao Liu Yong Dou Ruochun Jin Rongchun Li National University of Defense Technology National Laboratory for Parallel and Distributed Processing Changsha China

Convolution neural network models are widely used in image classification tasks. However, the running time of such models is so long that it is not the conforming to the strict real-time requirement of mobile devices. In order to optimize models and meet the requirement mentioned above, we propose a method that replaces the fully-connected layers of convolution neural network models with a tree classifier. Specifically, we construct a Visual Confusion Label Tree based on the output of the convolution neural network models, and use a multi-kernel SVM plus classifier with hierarchical constraints to train the tree classifier. Focusing on those confusion subsets instead of the entire set of categories makes the tree classifier more discriminative and the replacement of the fully-connected layers reduces the original running time. Experiments show that our tree classifier obtains a significant improvement over the state-of-the-art tree classifier by 4.3% and 2.4% in terms of top-1 accuracy on CIFAR-100 and ImageNet datasets respectively. Additionally, our method achieves 124× and 115× speedup ratio compared with fully-connected layers on AlexNet and VGG16 without accuracy decline.

关键词： Image classification Convolution neural network Confusion graph Label tree

来源：评论

学校读者我要写书评

暂无评论

BIIP:Application Behavior-Aware Insertion Policies for Managing Shared Cache in CMPs

BIIP:Application Behavior-Aware Insertion Policies for Manag...

引用

2011 International Conference on Computers, Communications, Control and Automation

作者： Xiaomin Jia Ping Huang Tianlei Zhao Shubo Qi Guitao Fu Minxuan Zhang National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology

Conventional replacement policy LRU(Least Recently Used) can significantly degrade the overall performance of shared cache of Chip Multi-Processors(CMPs), when the aggregate working set of multiple co-scheduled applications can not fit in cache. Different applications have different inherent cache access behavior characteristics. Replacement policy should take into account that fact so as to derive more performance benefit. This paper proposes application cache Behavior Identification based Insertion Policy(BIIP)replacement policies for managing shared cache in CMPs. BIIP seeks to make use of the cache access behavior characteristics of each co-scheduled application to smartly choose replacement policy. Our evaluation using a full system CMP simulator shows that BIIP improves the overall throughput by 14.8%,11.2%, 5.6% and 7.2% on average over baseline LRU policy,the prevailing cache partitioning scheme UCP and two other shared cache replacement policies PIPP, TADIP, respectively on a 4-core CMP with 16 SPEC CPU2006 workloads. Moreover,BIIP requires a total storage overhead of no more than several counters per core, and does not require changes to the current cache structure.

关键词： chip multi-processors(CMPs),application cache behaviors,last-level caches(LLC),insertion,replacement

来源：评论

学校读者我要写书评

暂无评论

A Review of Indoor-Outdoor Scene Classification

A Review of Indoor-Outdoor Scene Classification

引用

2017 2nd International Conference on Control, Automation and Artificial Intelligence(CAAI2017)

作者： Zhehang Tong Dianxi Shi Bingzheng Yan Jing Wei National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology

ISBN: (纸本)9781510845541

Indoor-Outdoor scene classification problem have been proposed for almost 20 years and widely applied to general scene classification, image retrieval, image processing and robot application. But there is no consensus on one particular scene classification technique that can solve the Indoor-Outdoor scene classification problem perfectly. As larger image dataset has been developed and machine learning technology especially deep learning based methods achieve remarkable performance in computer vision, we aim to provide guidance and direction for researchers to tackle the Indoor-Outdoor scene classification problem with more powerful and robust solution through concluding the Indoor-Outdoor scene classification approaches which have been proposed in last 20 years. In this paper, we review the Indoor-Outdoor scene classification including feature extraction, classifier and related dataset. Their advantages and disadvantages are discussed. At last we conclude some challenging problems remain unsolved and propose some potential solutions.

关键词： indoor-outdoor scene classification computer vision

来源：评论

学校读者我要写书评

暂无评论

Cloud-Based Framework for Scalable and Real-Time Multi-Robot SLAM

Cloud-Based Framework for Scalable and Real-Time Multi-Robot...

引用

IEEE International Conference on Web Services (ICWS)

作者： Pengfei Zhang Huaimin Wang Bo Ding Suning Shang National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

In the past decade, multi-robot simultaneous localization and mapping (SLAM) has been widely studied. However, the problem of collaborative SLAM with a large number of robots, such as dozens of robots, is far from being well solved. The challenges stem from not only the computation complexity in large-scale map merging but also the inefficiency to enable the parallel computing in this process, which is indispensable for us to make avail of the frontier of computing technology such as powerful cloud infrastructure. To effectively address these challenges, especially the latter one, we propose a scalable and real-time multi-robot visual SLAM framework based on the cloud robotic paradigm. The prominent feature of our framework is that it can distribute the SLAM process to multiple computing hosts in a cluster, which enables map building in parallel. To eliminate the bottleneck from data sharing between different sub-tasks, we also introduce diversified messaging pattern for various messaging scenarios, as well as the consistency policies for map data. The evaluations on the prototype of our framework, have shown that our method can do support as many as 256 robot entities simultaneously, without any compromising on the precision of poses estimation and map building.

关键词： Simultaneous localization and mapping Cloud computing Robot kinematics Task analysis Instruction sets Feature extraction

来源：评论

学校读者我要写书评

暂无评论

A Exploratory Study of @-Mention in GitHub's Pull-Requests

A Exploratory Study of @-Mention in GitHub's Pull-Requests

引用

Asia-Pacific Conference on Software Engineering

作者： Yang Zhang Gang Yin Yue Yu Huaimin Wang National laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9781479974276

Pull-request mechanism is an outstanding social development method in Git Hub. @-mention is a social media tool that deeply integrated with pull-request mechanism. Recently, many research results show that social media tools can promote the collaborative software development, but few work focuses on the impacts of @-mention. In this paper, we conduct an exploratory study of @-mention in pull-request based software development, including its current situation and benefits. We obtain some interesting findings which indicate that @-mention is beneficial to the processing of pull-request. Our work also proposes some possible research directions and problems of the @-mention. It helps the developers and researchers notice the significance of @-mention in the pull-request based software development.

关键词： Media Software Collaboration Software engineering Correlation Information services Electronic publishing

来源：评论

学校读者我要写书评

暂无评论

A Multi-Hash Based Signature Allocation Method in Wireless Network

A Multi-Hash Based Signature Allocation Method in Wireless N...

引用

International Conference on Wireless Communications, Networking and Mobile Computing (WiCom)

作者： Xuan Dong Xiaodong Wang Shaohe Lv Quan Liu Hu Shen Wenping Liu Xingming Zhou National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9781612846842

Wireless interference does not necessarily result in the lost of all the information of the desired signal. In this paper, we study the signature allocation in wireless networks by exploiting the retained signal feature under interference. The commonly used node signature includes MAC address and PN sequence. However, both of them take a lot of time to identify the signature when the network scale is large. We propose a novel signature allocation method based on a multi-hash policy, using a set of hash functions and a mapping-table to identify the signature. The proposed method decreases significantly both the signature identification complexity and the signature conflict probability. We implement the algorithm in GNU Radio and evaluate the performance in a testbed of three USRP nodes. The result shows that, under typical settings,

关键词： Wireless networks Interference Media Access Protocol Resource management Heuristic algorithms Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：