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

7th Asia-Pacific Symposium on Internetware, Internetware 2015

作者： Zhang, Yang Yin, Gang Wang, Tao Yu, Yue Wang, Huaimin Key Lab. of Parallel and Distributed Computing College of Computer National University of Defense Technology Changsha410073 China

ISBN: (纸本)9781450336413

In bug tracking system, the high volume of incoming bug reports poses a serious challenge to project managers. Triaging these bug reports manually consumes time and resources which leads to delaying the resolution of important bugs. StackOverow is the most popular crowdsourcing Q&A community with plenty of bug-related posts. In this paper, we explore the correlation between bug severity and the crowd attributes of linked posts. Two typical types of projects' bug repositories are studied here, e.g. Mozilla (user-centric project) and Eclipse (developer-centric project). Our results show that the bug severity is consistent with the crowd- based knowledge both in Mozilla and Eclipse, i.e. the linked posts of severe bugs have higher score etc. in StackOverow than non-severe bugs. This interesting phenomenon inspires us that we can optimize the existing evaluation methods of bug severity by incorporating the crowd-based knowledge from a third-party in future. © 2015 ACM.

关键词： StackOverflow crowd-based knowledge Bugzilla Bug severity

来源：评论

学校读者我要写书评

暂无评论

Exploring the use of @-mention to assist software development in GitHub 15

Exploring the use of @-mention to assist software developmen...

引用

7th Asia-Pacific Symposium on Internetware, Internetware 2015

作者： Zhang, Yang Wang, Huaimin Yin, Gang Wang, Tao Yu, Yue Key Lab. of Parallel and Distributed Computing College of Computer National University of Defense Technology Changsha410073 China

ISBN: (纸本)9781450336413

Recently, many researches propose that social media tools can promote the collaboration among developers, which are beneficial to the software development. Nevertheless, there is little empirical evidence to confirm that using @-mention has indeed a beneficial impact on the issues in GitHub. In this paper, we analyze the data from GitHub and give some insights on how @-mention is used in the issues (general- issues and pull-requests). Our statistical results indicate that, @-mention attracts more participants and tends to be used in the difficult issues. @-mention favors the solving process of issues by enlarging the visibility of issues and facilitating the developers' collaboration. In addition to this global study, our study also build a @-network based on the @-mention database we extract. Through the @-network, we can mine the relationships and characteristics of developers in GitHub's issues. © 2015 ACM.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

NUMA-aware graph-structured analytics 2015

NUMA-aware graph-structured analytics

引用

20th ACM SIGPLAN Symposium on Principles and Practice of parallel Programming, PPoPP 2015

作者： Zhang, Kaiyuan Chen, Rong Chen, Haibo Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China

ISBN: (纸本)9781450332057

Graph-structured analytics has been widely adopted in a number of big data applications such as social computation, web-search and recommendation systems. Though much prior research focuses on scaling graph-analytics on distributed environments, the strong desire on performance per core, dollar and joule has generated considerable interests of processing large-scale graphs on a single server-class machine, which may have several terabytes of RAM and 80 or more cores. However, prior graph-analytics systems are largely neutral to NUMA characteristics and thus have suboptimal performance. This paper presents a detailed study of NUMA characteristics and their impact on the efficiency of graph-analytics. Our study uncovers two insights: 1) either random or interleaved allocation of graph data will significantly hamper data locality and parallelism;2) sequential inter-node (i.e., remote) memory accesses have much higher bandwidth than both intra- and inter-node random ones. Based on them, this paper describes Polymer, a NUMA-aware graph-analytics system on multicore with two key design decisions. First, Polymer differentially allocates and places topology data, application-defined data and mutable runtime states of a graph system according to their access patterns to minimize remote accesses. Second, for some remaining random accesses, Polymer carefully converts random remote accesses into sequential remote accesses, by using lightweight replication of vertices across NUMA nodes. To improve load balance and vertex convergence, Polymer is further built with a hierarchical barrier to boost parallelism and locality, an edge-oriented balanced partitioning for skewed graphs, and adaptive data structures according to the proportion of active vertices. A detailed evaluation on an 80-core machine shows that Polymer often outperforms the state-of-the-art single-machine graph-analytics systems, including Ligra, X-Stream and Galois, for a set of popular real-world and synthetic grap

关键词： Random access storage

来源：评论

学校读者我要写书评

暂无评论

Continuous probabilistic reverse skyline monitoring over uncertain data streams

Continuous probabilistic reverse skyline monitoring over unc...

引用

2013 International Conference on Vehicle and Mechanical Engineering and Information Technology, VMEIT 2013

作者： Yang, Yong Tao Wang, Yi Jie Guo, Min Li, Xiao Yong National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9783037858202

Reverse skyline is useful for supporting many applications, such as marketing decision, environmental monitoring. Since the uncertainty of data is inherent in many scenarios, there is a need for processing probabilistic reverse skyline queries. In this paper, we study the problem of efficiently processing these queries on uncertain data streams. We first show the formal definitions of reverse skyline probability and probabilistic reverse skyline. Then we propose a new algorithm called CPRS to maintain the most recent N uncertain data elements and to process continuous queries on them. CPRS is based on R-tree, and efficient pruning techniques, one of which is based on a new structure named Characteristic Rectangle, are incorporated into it to handling the extra computing complexity arising from the uncertainty of data. Finally, extensive experiments demonstrate that our techniques are very efficient in handling uncertain data streams. © (2013) Trans Tech Publications, Switzerland.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Media access control protocol based on hybrid antennas in ad hoc networks

Media access control protocol based on hybrid antennas in ad...

引用

International Conference on Autonomic and Trusted computing

作者： Ding, Yanrong Wang, Xiaodong Shen, Hu Guo, Pengyu National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769542720

Nested Circular Directional MAC, a modified medium access control protocol of DMAC protocol, is proposed in this paper to support both directional antennas and omni-directional antennas simultaneously in one Ad Hoc network. Omni-directional antennas follow the RTS/CTS mechanism which is multi-hop and directional antennas follow the DRTS/DCTS mechanism, ensuring the asymmetric communication effectively. In order to resolve new deafness problem and hidden terminal problem, the directional antennas also use circular DRTS and nested antenna circumrotation. Simulation results show that NCDMAC supports hybrid antennas effectively and is better than MMAC and Circular-MAC in terms of increasing throughput, but it also increases the communication delay. © 2010 IEEE.

关键词： Ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

KC-GenRe: A Knowledge-constrained Generative Re-ranking Method Based on Large Language Models for Knowledge Graph Completion 30

KC-GenRe: A Knowledge-constrained Generative Re-ranking Meth...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Wang, Yilin Hu, Minghao Huang, Zhen Li, Dongsheng Yang, Dong Lu, Xicheng Defense Innovation Institute Academy of Military Sciences China Information Research Center of Military Science China National Key Laboratory of Parallel and Distributed Computing China

ISBN: (纸本)9782493814104

The goal of knowledge graph completion (KGC) is to predict missing facts among entities. Previous methods for KGC re-ranking are mostly built on non-generative language models to obtain the probability of each candidate. Recently, generative large language models (LLMs) have shown outstanding performance on several tasks such as information extraction and dialog systems. Leveraging them for KGC re-ranking is beneficial for leveraging the extensive pre-trained knowledge and powerful generative capabilities. However, it may encounter new problems when accomplishing the task, namely mismatch, misordering and omission. To this end, we introduce KC-GenRe, a knowledge-constrained generative re-ranking method based on LLMs for KGC. To overcome the mismatch issue, we formulate the KGC re-ranking task as a candidate identifier sorting generation problem implemented by generative LLMs. To tackle the misordering issue, we develop a knowledge-guided interactive training method that enhances the identification and ranking of candidates. To address the omission issue, we design a knowledge-augmented constrained inference method that enables contextual prompting and controlled generation, so as to obtain valid rankings. Experimental results show that KG-GenRe achieves state-of-the-art performance on four datasets, with gains of up to 6.7% and 7.7% in the MRR and Hits@1 metric compared to previous methods, and 9.0% and 11.1% compared to that without re-ranking. Extensive analysis demonstrates the effectiveness of components in KG-GenRe. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

A technical capability evaluation model based concept and prerequisite relation in computer education 33

A technical capability evaluation model based concept and pr...

引用

33rd International Conference on Software Engineering and Knowledge Engineering, SEKE 2021

作者： Luo, Jiwen Wang, Tao Chang, Junsheng Guo, Xiaoting National Key Laboratory for Parallel and Distributed Processing College of Computer National University of Defense Technology Changsha410073 China

ISBN: (纸本)1891706527

Effectively assessing the results of users' online learning and enhancing social recognition has become a major development direction for online education platforms. For computer education, this article constructs a technical capability assessment model. This model integrates professional concepts in the field of computer science and extracts knowledge concepts from educational resources. The model first extracts candidate concepts, then uses a graph propagation algorithm to quantify candidate concepts and obtains concepts from them, and finally uses prerequisite relationships to further quantify the concepts mastered by students. The model combines the prerequisite relationship among concepts to quantify the skills that students have mastered. It can not only effectively evaluate the user's skill mastery but also lays a foundation for subsequent course recommendations and career recommendations for users. The model is tested in the real learning environment of 250 students. This model has been proved to own certain practicability and reliability by Kendall rank correlation coefficient, which is used as an evaluation index. © 2021 Knowledge Systems Institute Graduate School. All rights reserved.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Property-oriented testing of real-time systems

Property-oriented testing of real-time systems

引用

Proceedings - 11th Asia-Pacific Software Engineering Conference, APSEC 2004

作者： Li, Shuhao Wang, Ji Dong, Wei Qi, Zhi-Chang National Laboratory for Parallel and Distributed Processing Changsha China State Key Laboratory for Software Engineering Wuhan University China

ISBN: (纸本)0769522459

Although Statecharts has gained widespread use as a formalism for modeling reactive real-time systems, testing these systems still confronts some difficulties, of which a major one is the existence of numerous and complex system behaviors. It is extremely difficult to conduct comprehensive and in-depth testing of such real-time systems. This paper presents an approach to property-oriented real-time testing. Necessary real-time extensions are proposed such that the time-enriched Statecharts can describe non-trivial timing constraints. The properties to be tested are characterized by a restricted real-time logic. Then the targeted test sequences are derived from the real-time models according to the user-specified properties. Using this approach, testing efforts can be focused on particular properties of the real-time systems and usually only a small portion of the total behaviors needs to be tested. © 2004 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

HESA: The construction and evaluation of hierarchical software feature repository 25

HESA: The construction and evaluation of hierarchical softwa...

引用

25th International Conference on Software Engineering and Knowledge Engineering, SEKE 2013

作者： Yu, Yue Wang, Huaimin Yin, Gang Li, Xiang Yang, Cheng National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha China

ISBN: (纸本)1891706330

Nowadays, the demand for software resources on different granularity is becoming prominent in software engineering field. However, a large quantity of heterogeneous software resources have not been organized in a reasonable and efficient way. Software features, a kind of important knowledge for software reuse, are ideal materials to characterize software resources. Our preliminary study shows that the effectiveness of feature-related tasks, such as software resource retrieval and feature location, will be greatly improved, if a multi-grained feature repository is available. In this paper, we construct a Hierarchical rEpository of Software feAture (HESA), in which a novel hierarchical clustering approach is proposed. For a given domain, we first aggregate a large number of feature descriptions from multiple online software repositories. Then we cluster these descriptions into a flexible hierarchy by mining their hidden semantic structures. Finally, we implement an online search engine on HESA and conduct a user study to evaluate our approach quantitatively. The results show that HESA can organize software features in a more reasonable way compared to the classic and the state-of-the-art approaches. Copyright © 2013 by Knowledge Systems Institute Graduate School.

关键词： Computer software reusability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：