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

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

作者： Yarong Zeng Xunhui Zhang Yaozong Li Tao Wang Gang Yin Huaimin Wang National Laboratory for Parallel and Distributed Processing National University of Defence Technology Changsha China

ISBN: (纸本)9781538665664;9781538665657

With the popularity of the open source, the open source community has accumulated a large number of open source project. While these massive projects provide developers with rich reusable resource, they also bring difficulties for users to choose the appropriate software. Therefore, it is very meaningful to rank the software and tell users which is better. In this paper, we propose a novel approach that ranks software based on a global perspective different from traditional software evaluation and ranking methods. We evaluate the software from four dimensions, namely community popularity, development activity, software health and team health. Each dimension contains some metrics. We demonstrate the effectiveness of our method through comparative experiments. This method has been integrated into to the OSSEAN platform to form a software leaderboard.

关键词： Mathematical model Open source software Tools Software quality Software measurement

来源：评论

学校读者我要写书评

暂无评论

A Research on Area Coverage Algorithm for Robotics

A Research on Area Coverage Algorithm for Robotics

引用

IEEE International Conference of Intelligent Robotic and Control Engineering (IRCE)

作者： Yaru Kang Dianxi Shi National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9781538674178

Area coverage path planning is a special path planning method, which requires the robot to go through every point except obstacles in workspace. It has been used in many fields, such as lawn mowing, snow removal, search and rescue task, pesticide spraying, demining robots, cleaning robots and so on. This paper presents the achievements of the last two decades on area coverage. We propose a new Classification based on method of Choset. We analyze and summarize the recently research results by the new classification method and list the advantages and disadvantages. Finally, we give a summary of the classification methods and propose future research directions.

关键词： Path planning Task analysis Robot sensing systems Classification algorithms Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

A novel hybrid architecture for high speed regular expression matching 1

引用

1st International Symposium on Mobile Internet Security, MobiSec 2016

作者： Xu, Chengcheng Zhao, Baokang Chen, Shuhui Su, Jinshu College of Computer National University of Defense Technology No. 137 Yanwachi Street ChangshaHunan410073 China National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha410073 China

ISBN: (数字)9789811078507

ISBN: (纸本)9789811078491

Mobile devices play an important role in our everyday lives, but they also bring great security threats. Deep packet inspection (DPI) is one of the most efficient methods to detect the malicious information hidden in the mobile traffic, and regular expression matching is widely used in DPI for its powerful expressive ability. However, with the increasing complexity of regular expressions, traditional solutions cannot meet the requirements of both storage and high performance. In this paper, we propose a novel hybrid matching architecture and two-stage memory architecture for the state of the art hybrid FA to solve this problem. Experiment results confirm that our architecture is scalable to complex rule sets, and the matching performance outperforms state of the art memory centric solution by up to 15x. © Springer Nature Singapore Pte Ltd. 2018.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Using Document Embedding Techniques for Similar Bug Reports Recommendation

Using Document Embedding Techniques for Similar Bug Reports ...

引用

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

作者： Ming Chen Dongyang Hu Tao Wang Jun Long Gang Yin Yue Yu Yang Zhang Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

ISBN: (纸本)9781538665664;9781538665657

In the software development, it is common to find that several bug reports are related to many common code files, i.e., similar bugs. Similar bug recommendation is a meaningful task that could assist developers in bug triaging and fixing. If developers can focus on fewer code files, they can fix similar bugs in less time with higher quality. Therefore, building a similar bug recommendation system is a meaningful task that can improve development efficiency. As the state of the art, Yang et al.'s work presented an approach that combines TF-IDF method with Word Embedding model and achieved a good result. To further improve the performance of their approach, in this paper, we propose a novel approach using Document Embedding model. In our preliminary evaluation, we conduct the experiment on the datasets of J dt, Birt and Eclipse platform. And the results show that our approach outperforms Yang et ale `s, with 2.67-9.50% of improvement.

关键词： Computer bugs Task analysis Predictive models Measurement Context modeling Training Software

来源：评论

学校读者我要写书评

暂无评论

引用

Asia-Pacific Conference on Software Engineering

作者： Dongyang Hu Ming Chen Tao Wang Junsheng Chang Gang Yin Yue Yu Yang Zhang Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

ISBN: (纸本)9781728119717;9781728119700

In the software development, it is not uncommon to find that several bug reports are related to many common code files, i.e., similar bugs. Similar bug recommendation is a meaningful task which can assist developers in bug triaging and fixing. As the state of the art, Yang et al.'s work presented an approach that combines TF-IDF method with word embedding model and achieved a good result. To further improve the performance of their approach, in this paper, we propose a novel approach using Document Embedding model. In our preliminary evaluation, we conduct the experiment on 13,090 bug reports from the Eclipse platform and the results show that our approach outperforms Yang et al.'s, with 7.89-8.96% of improvement.

关键词： Computer bugs Software engineering Task analysis Measurement Software Information retrieval Natural language processing

来源：评论

学校读者我要写书评

暂无评论

Fisher Discriminant Analysis Random Forest for Online Class Incremental Learning

Fisher Discriminant Analysis Random Forest for Online Class ...

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Wang Xiong Yijie Wang Li Cheng Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

ISBN: (纸本)9781728111421;9781728111414

Class incremental learning needs to deal with a dynamic environment where data class appears incrementally, it is a challenge to learn new knowledge while preserving what has already been learned. On the other hand, due to the limited storage of the online scenario, algorithm is usually obstructed to frequently scan or simply store all historical data, it is another challenge to reduce the historical data storage for algorithm. Few existing work have addressed above challenges simultaneously. In this paper, we propose Fisher Discriminant Analysis Random Forest (FDARF), which consists of two parts, GHS (Generate Hierarchical Split) and RRS (Random Reform Subtree), that cooperatively operate. GHS combines FDA (Fisher Discriminant Analysis) with tree hierarchy to learn a hierarchical split of data space that provides strong ability for classification. The statistics in leaves (i.e. historical data) can be described by covariance matrix and further optimized by matrix sketching algorithm to reduce storage; for every tree initialized by GHS, RRS randomly reforms certain state subtree, which creates diversity that can be ensemble for ensuring effectiveness of class incremental learning. Extensive experiments on diverse datasets validate that FDARF can well adapt to the online class incremental learning.

关键词： Vegetation Training Covariance matrices Memory Forestry Learning systems

来源：评论

学校读者我要写书评

暂无评论

Multi-Discussing across Issues in GitHub: A Preliminary Study

Multi-Discussing across Issues in GitHub: A Preliminary Stud...

引用

Asia-Pacific Conference on Software Engineering

作者： Dongyang Hu Tao Wang Junsheng Chang Gang Yin Yang Zhang Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

ISBN: (纸本)9781728119717;9781728119700

Social coding sites like GitHub has enabled developers to easily contribute their comments on multiple issues and switch their discussion between issues, i.e., multi-discussing. Discussing multiple issues simultaneously may enhance the work efficiency of developers. However, multi-discussing also relies on developers' rationally allocating their time and focus, which may bring different influence to the resolution of issues. Therefore, investigating how multi-discussing affects the issue resolution is a meaningful research question which can help developers understand the benefits and limitations when they switch their discussion between issues. In this paper, we present a preliminary study of the impact of multi-discussing on issue resolution in GitHub projects, by using quantitative methods. First, we collect and analyzed data from 631 GitHub projects to explore how multi-discussing affects the average resolution latency of project issues. Further, we develop method for measuring the rate and breadth of a developers' discussion switching behavior, and we use regression modeling to study how discussion-switching affects the single issue resolution latency. We find that multi-discussing is a common behavior of developers in GitHub projects. Also, multi-discussing is associated with shorter average issue resolution latency of project. However, during a single issue resolution, more participants' discussion-switching tend to bring longer issue resolution latency. Our study motivates the need for further research on the multi-discussing.

关键词： Switches Multitasking Collaboration Task analysis Encoding Rails Tools

来源：评论

学校读者我要写书评

暂无评论

Understanding User Interests Acquisition in Personalized Online Course Recommendation

引用

Asia Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint Conference on Web and Big Data, APWeb-WAIM 2018

作者： Li, Xiao Wang, Ting Wang, Huaimin Tang, Jintao Information Center National University of Defense Technology Changsha China College of Computer National University of Defense Technology Changsha China National Key Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9783030012977

MOOCs have attracted a large number of learners with different education background all over the world. Despite its increasing popularity, MOOCs still suffer from the problem of high drop-out rate. One important reason may be due to the difficulty in understanding learning demand and user interests. To helper users find the most suitable courses, personalized course recommendation technology has become a hot research topic in e-learning and data mining community. One of the keys to the success of personalized course recommendation is a good user modeling method. Previous works in course recommendation often focus on developing user modeling methodology which learns latent user interests from historic learning data. Recently, interactive course recommendation has become more and more popular. In this paradigm, recommender systems can directly query user interests through survey tables or questionnaires and thus the learned interests may be more accurate. In this paper, we study the user interest acquisition problem based on the interactive course recommendation framework (ICRF). Under this framework, we systematically discuss different settings on querying user interests. To reduce performance-cost score, we propose the ICRF user interest acquisition algorithm that combines representative sampling and interest propagation algorithm to acquire user interests in a cost-effective way. With extensive experiments on real-world MOOC course enrollment datasets, we empirically demonstrate that our selective acquisition strategy is very effective and it can reduce the performance-cost score by 30.25% compared to the traditional aggressive acquisition strategies. © 2018, Springer Nature Switzerland AG.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

MixedCache: Enabling Flow Directed Rule-Caching Scheme based on Heterogeneous Cache for OpenFlow

引用

Journal of Physics: Conference Series 2020年第1期1693卷

作者： Jialun Yang Yi Yang Jiahao Liu Rulin Liu Peng Qiao Baosheng Wang College of Computer Science and Technology 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

OpenFlow switches in SDN use Multiple Flow Tables (MFTs) for fine-grained flow control. Commodity switches integrate hardware storage resources such as SRAM and TCAM to store flow tables to achieve high-speed lookups. Many increased flow tables are rapidly exhausting these hardware storage resources, which makes the switches have to balance high-speed search and massive storage. The rule-caching scheme is a popular method to solve this problem, which caches the most commonly used rules into hardware storage resources. The existing rule-caching schemes are based on single hardware storage resources, and they cannot flexibly adjust the caching strategy according to the traffic characteristics. Simultaneously, the deployed commodity switches face the problem of difficulty in changing the size of SRAM and TCAM. This paper innovatively proposes the MixedCache scheme, which makes full use of the hardware storage resources in the switch according to the skewed characteristics of network traffic. MixedCache stores the large flows in SRAM by exact match and stores the small flows in the TCAM by wildcard match. MixedCache does not need to change the size of the deployed switch hardware storage resources, but makes full use of existing resources. Compared with the rule-caching scheme based on the exact match, the cache hit rate can increase by up to 15.61%. Compared with the rule-caching scheme based on the wildcard match, the cache hit rate can increase by up to 29.69%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Enhancing 2D Representation via Adjacent Views for 3D Shape Retrieval

Enhancing 2D Representation via Adjacent Views for 3D Shape ...

引用

International Conference on Computer Vision (ICCV)

作者： Cheng Xu Zhaoqun Li Qiang Qiu Biao Leng Jingfei Jiang School of Computer Science & Engineering Beihang University Duke University Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University State Key Laboratory of Virtual Reality Technology and Systems Beihang University National Laboratory for Parallel and Distributed Processing National University of Defense Technology

ISBN: (数字)9781728148038

ISBN: (纸本)9781728148045

Multi-view shape descriptors obtained from various 2D images are commonly adopted in 3D shape retrieval. One major challenge is that significant shape information are discarded during 2D view rendering through projection. In this paper, we propose a convolutional neural network based method, CenterNet, to enhance each individual 2D view using its neighboring ones. By exploiting cross-view correlations, CenterNet learns how adjacent views can be maximally incorporated for an enhanced 2D representation to effectively describe shapes. We observe that a very small amount of, e.g., six, enhanced 2D views, are already sufficient for a panoramic shape description. Thus, by simply aggregating features from six enhanced 2D views, we arrive at a highly compact yet discriminative shape descriptor. The proposed shape descriptor significantly outperforms state-of-the-art 3D shape retrieval methods on the ModelNet and ShapeNetCore55 benchmarks, and also exhibits robustness against object occlusion.

关键词： Shape Three-dimensional displays Correlation Two dimensional displays Feature extraction Solid modeling Computational modeling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：