scholarly journals A Weighted PageRank-Based Bug Report Summarization Method Using Bug Report Relationships

2019 ◽  
Vol 9 (24) ◽  
pp. 5427 ◽  
Author(s):  
Beomjun Kim ◽  
Sungwon Kang ◽  
Seonah Lee
Keyword(s):  
Software Maintenance ◽  
State Of The Art ◽  
The State ◽  
Experimental Results ◽  
Pagerank Algorithm ◽  
Bug Reports ◽  
Summarization Method ◽  
Bug Report

For software maintenance, bug reports provide useful information to developers because they can be used for various tasks such as debugging and understanding previous changes. However, as they are typically written in the form of conversations among developers, bug reports tend to be unnecessarily long and verbose, with the consequence that developers often have difficulties reading or understanding bug reports. To mitigate this problem, methods that automatically generate a summary of bug reports have been proposed, and various related studies have been conducted. However, existing bug report summarization methods have not fully exploited the inherent characteristics of bug reports. In this paper, we propose a bug report summarization method that uses the weighted-PageRank algorithm and exploits the 'duplicates’, ‘blocks’, and ‘depends-on’ relationships between bug reports. The experimental results show that our method outperforms the state-of-the-art method in terms of both the quality of the summary and the number of applicable bug reports.

scholarly journals Dialogue Generation: From Imitation Learning to Inverse Reinforcement Learning

2019 ◽  
Vol 33 ◽  
pp. 6722-6729 ◽  
Author(s):  
Ziming Li ◽  
Julia Kiseleva ◽  
Maarten De Rijke
Keyword(s):  
Reinforcement Learning ◽  
State Of The Art ◽  
The State ◽  
Experimental Results ◽  
Imitation Learning ◽  
Local Optimum ◽  
Inverse Reinforcement Learning ◽  
High Quality ◽  
Overall Performance

The performance of adversarial dialogue generation models relies on the quality of the reward signal produced by the discriminator. The reward signal from a poor discriminator can be very sparse and unstable, which may lead the generator to fall into a local optimum or to produce nonsense replies. To alleviate the first problem, we first extend a recently proposed adversarial dialogue generation method to an adversarial imitation learning solution. Then, in the framework of adversarial inverse reinforcement learning, we propose a new reward model for dialogue generation that can provide a more accurate and precise reward signal for generator training. We evaluate the performance of the resulting model with automatic metrics and human evaluations in two annotation settings. Our experimental results demonstrate that our model can generate more high-quality responses and achieve higher overall performance than the state-of-the-art.

Evaluating Top-k Skyline Queries Efficiently

2011 ◽  
pp. 102-117
Author(s):  
Marlene Goncalves ◽  
María Esther Vidal
Keyword(s):  
State Of The Art ◽  
Search Space ◽  
Large Datasets ◽  
The State ◽  
Experimental Results ◽  
High Dimensional ◽  
Skyline Queries ◽  
Speed Up

Criteria that induce a Skyline naturally represent user’s preference conditions useful to discard irrelevant data in large datasets. However, in the presence of high-dimensional Skyline spaces, the size of the Skyline can still be very large. To identify the best k points among the Skyline, the Top-k Skyline approach has been proposed. This chapter describes existing solutions and proposes to use the TKSI algorithm for the Top-k Skyline problem. TKSI reduces the search space by computing only a subset of the Skyline that is required to produce the top-k objects. In addition, the Skyline Frequency Metric is implemented to discriminate among the Skyline objects those that best meet the multidimensional criteria. This chapter’s authors have empirically studied the quality of TKSI, and their experimental results show the TKSI may be able to speed up the computation of the Top-k Skyline in at least 50% percent with regard to the state-of-the-art solutions.

Roller Hemming Simulation: State of the Art and Application Limits

2014 ◽  
Vol 611-612 ◽  
pp. 1062-1070 ◽  
Author(s):  
Reimund Neugebauer ◽  
Welf Guntram Drossel ◽  
Markus Rössinger ◽  
Alexander Eckert ◽  
Benjamin Hecht
Keyword(s):  
State Of The Art ◽  
The State ◽  
Numerical Results ◽  
Experimental Results ◽  
Future Research ◽  
Process Chain ◽  
Car Body

The presented study applied the state of the art in roller hemming simulation on a car body assembly. Corner areas with changing flange lengths are always challenging in case of reaching the quality demands. Thus, the numerical results like e.g. springback, hem thickness, roll-in and hemming geometry are compared to experimental results. It is shown that the quality of prediction depends on the system stiffness of the roller hemming device, the geometrical contour of the car body assembly and the consideration of steps in the process chain like stamping and flanging. Finally, the gained cognitions point out challenges for future research in this topic.

scholarly journals Contour Detection for Fibre of Preserved Szechuan Pickle Based on Dilated Convolution

2019 ◽  
Vol 9 (13) ◽  
pp. 2684 ◽  
Author(s):  
Hongyang Li ◽  
Lizhuang Liu ◽  
Zhenqi Han ◽  
Dan Zhao
Keyword(s):  
Edge Detection ◽  
State Of The Art ◽  
Contour Detection ◽  
Experimental Results ◽  
Contour Method ◽  
Class Differences ◽  
Dilated Convolution ◽  
The Mean ◽  
Art Performance

Peeling fibre is an indispensable process in the production of preserved Szechuan pickle, the accuracy of which can significantly influence the quality of the products, and thus the contour method of fibre detection, as a core algorithm of the automatic peeling device, is studied. The fibre contour is a kind of non-salient contour, characterized by big intra-class differences and small inter-class differences, meaning that the feature of the contour is not discriminative. The method called dilated-holistically-nested edge detection (Dilated-HED) is proposed to detect the fibre contour, which is built based on the HED network and dilated convolution. The experimental results for our dataset show that the Pixel Accuracy (PA) is 99.52% and the Mean Intersection over Union (MIoU) is 49.99%, achieving state-of-the-art performance.

scholarly journals Augmenting Bug Localization with Part-of-Speech and Invocation

2017 ◽  
Vol 27 (06) ◽  
pp. 925-949 ◽  
Author(s):  
Yu Zhou ◽  
Yanxiang Tong ◽  
Taolue Chen ◽  
Jin Han
Keyword(s):  
Software Maintenance ◽  
Large Scale ◽  
Bug Localization ◽  
Bug Reports ◽  
Part Of Speech ◽  
Adaptive Technique ◽  
Bug Report ◽  
Software Maintenance And Evolution ◽  
Speech Features ◽  
Localization Approach

Bug localization represents one of the most expensive, as well as time-consuming, activities during software maintenance and evolution. To alleviate the workload of developers, numerous methods have been proposed to automate this process and narrow down the scope of reviewing buggy files. In this paper, we present a novel buggy source-file localization approach, using the information from both the bug reports and the source files. We leverage the part-of-speech features of bug reports and the invocation relationship among source files. We also integrate an adaptive technique to further optimize the performance of the approach. The adaptive technique discriminates Top 1 and Top N recommendations for a given bug report and consists of two modules. One module is to maximize the accuracy of the first recommended file, and the other one aims at improving the accuracy of the fixed defect file list. We evaluate our approach on six large-scale open source projects, i.e. ASpectJ, Eclipse, SWT, Zxing, Birt and Tomcat. Compared to the previous work, empirical results show that our approach can improve the overall prediction performance in all of these cases. Particularly, in terms of the Top 1 recommendation accuracy, our approach achieves an enhancement from 22.73% to 39.86% for ASpectJ, from 24.36% to 30.76% for Eclipse, from 31.63% to 46.94% for SWT, from 40% to 55% for ZXing, from 7.97% to 21.99% for Birt, and from 33.37% to 38.90% for Tomcat.

Predicting the Severity of Bug Reports Based on Feature Selection

2018 ◽  
Vol 28 (04) ◽  
pp. 537-558 ◽  
Author(s):  
Wenjie Liu ◽  
Shanshan Wang ◽  
Xin Chen ◽  
He Jiang
Keyword(s):  
Feature Selection ◽  
Software Maintenance ◽  
Feature Selection Method ◽  
Selection Methods ◽  
Selection Algorithm ◽  
Feature Selection Algorithm ◽  
Bug Reports ◽  
Single Feature ◽  
Bug Report ◽  
Severity Prediction

In software maintenance process, it is a fairly important activity to predict the severity of bug reports. However, manually identifying the severity of bug reports is a tedious and time-consuming task. So developing automatic judgment methods for predicting the severity of bug reports has become an urgent demand. In general, a bug report contains a lot of descriptive natural language texts, thus resulting in a high-dimensional feature set which poses serious challenges to traditionally automatic methods. Therefore, we attempt to use automatic feature selection methods to improve the performance of the severity prediction of bug reports. In this paper, we introduce a ranking-based strategy to improve existing feature selection algorithms and propose an ensemble feature selection algorithm by combining existing ones. In order to verify the performance of our method, we run experiments over the bug reports of Eclipse and Mozilla and conduct comparisons with eight commonly used feature selection methods. The experiment results show that the ranking-based strategy can effectively improve the performance of the severity prediction of bug reports by up to 54.76% on average in terms of [Formula: see text]-measure, and it also can significantly reduce the dimension of the feature set. Meanwhile, the ensemble feature selection method can get better results than a single feature selection algorithm.

scholarly journals A Multilayer CARU Framework to Obtain Probability Distribution for Paragraph-Based Sentiment Analysis

2021 ◽  
Vol 11 (23) ◽  
pp. 11344
Author(s):  
Wei Ke ◽  
Ka-Hou Chan
Keyword(s):  
Probability Distribution ◽  
Information Extraction ◽  
Sentiment Analysis ◽  
State Of The Art ◽  
Final Analysis ◽  
The State ◽  
Experimental Results ◽  
Content Adaptive

Paragraph-based datasets are hard to analyze by a simple RNN, because a long sequence always contains lengthy problems of long-term dependencies. In this work, we propose a Multilayer Content-Adaptive Recurrent Unit (CARU) network for paragraph information extraction. In addition, we present a type of CNN-based model as an extractor to explore and capture useful features in the hidden state, which represent the content of the entire paragraph. In particular, we introduce the Chebyshev pooling to connect to the end of the CNN-based extractor instead of using the maximum pooling. This can project the features into a probability distribution so as to provide an interpretable evaluation for the final analysis. Experimental results demonstrate the superiority of the proposed approach, being compared to the state-of-the-art models.

scholarly journals A Decentralised Approach to Intersection Traffic Management

2018 ◽  
Author(s):  
Huan Vu ◽  
Samir Aknine ◽  
Sarvapali D. Ramchurn
Keyword(s):  
Quality Of Life ◽  
Waiting Time ◽  
Traffic Congestion ◽  
Traffic Management ◽  
State Of The Art ◽  
The State ◽  
Management Mechanism ◽  
Traffic Conditions

Traffic congestion has a significant impact on quality of life and the economy. This paper presents a decentralised traffic management mechanism for intersections using a distributed constraint optimisation approach (DCOP). Our solution outperforms the state of the art solution both for stable traffic conditions (about 60% reduced waiting time) and robustness to unpredictable events. 

scholarly journals Smoothing vs. sharpening of colour images: Together or separated

2017 ◽  
Vol 2 (1) ◽  
pp. 299-316 ◽  
Author(s):  
Cristina Pérez-Benito ◽  
Samuel Morillas ◽  
Cristina Jordán ◽  
J. Alberto Conejero
Keyword(s):  
Image Denoising ◽  
Gaussian Distribution ◽  
State Of The Art ◽  
Visual Quality ◽  
The State ◽  
Art Methods ◽  
Efficiency And Effectiveness

AbstractIt is still a challenge to improve the efficiency and effectiveness of image denoising and enhancement methods. There exists denoising and enhancement methods that are able to improve visual quality of images. This is usually obtained by removing noise while sharpening details and improving edges contrast. Smoothing refers to the case of denoising when noise follows a Gaussian distribution.Both operations, smoothing noise and sharpening, have an opposite nature. Therefore, there are few approaches that simultaneously respond to both goals. We will review these methods and we will also provide a detailed study of the state-of-the-art methods that attack both problems in colour images, separately.

Sign in / Sign up

Export Citation Format

Share Document