Results 1 -
6 of
6
On computing the canonical features of software systems
- IN 13TH IEEE WORKING CONFERENCE ON REVERSE ENGINEERING (WCRE
, 2006
"... Software applications typically have many features that vary in their similarity. We define a measurement of similarity between pairs of features based on their underlying implementations and use this measurement to compute a set of canonical features. The Canonical Features Set (CFS) consists of a ..."
Abstract
-
Cited by 20 (2 self)
- Add to MetaCart
(Show Context)
Software applications typically have many features that vary in their similarity. We define a measurement of similarity between pairs of features based on their underlying implementations and use this measurement to compute a set of canonical features. The Canonical Features Set (CFS) consists of a small number of features that are as dissimilar as possible to each other, yet are most representative of the features that are not in the CFS. The members of the CFS are distinguishing features and understanding their implementation provides the engineer with an overview of the system undergoing scrutiny. The members of the CFS can also be used as cluster centroids to partition the entire set of features. Partitioning the set of features can simplify the understanding of large and complex software systems. Additionally, when a specific feature must undergo maintenance, it is helpful to know which features are most closely related to it. We demonstrate the utility of our method through the analysis of the Jext, Firefox, and Gaim software systems.
Studying the evolution of software systems using change clusters
- Proceedings of the 14th IEEE International Conference on Program Comprehension
"... In this paper, we present an approach that examines the evolution of code stored in source control repositories. The technique identifies Change Clusters, which can help managers to classify different code change activities as either a software maintenance or a new development. Furthermore, identify ..."
Abstract
-
Cited by 5 (1 self)
- Add to MetaCart
(Show Context)
In this paper, we present an approach that examines the evolution of code stored in source control repositories. The technique identifies Change Clusters, which can help managers to classify different code change activities as either a software maintenance or a new development. Furthermore, identifying the variations in Change Clusters over time exposes trends in the development of a software system. We present a case study that uses a sequence of Change Clusters to track the evolution of the PostgreSQL software project. Our case study demonstrates that our technique reveals interesting patterns about the progress of code development within each release of PostgreSQL. We show that the increase in the number of clusters not only identifies the areas where development has occurred, but also reflects the amount of structural change in code. We also compare how the Change Clusters vary over time in order to make generalizations about the focus of development. 1
Reducing Program Comprehension Effort in Evolving Software by Recognizing Feature Implementation Convergence
- ICPC'07
, 2007
"... ..."
(Show Context)
Combining Different Types of Scale Space Interest Points Using Canonical Sets
, 2007
"... Scale space interest points capture important photometric and deep structure information of an image. The information content of such points can be made explicit using image reconstruction. In this paper we will consider the problem of combining multiple types of interest points used for image rec ..."
Abstract
- Add to MetaCart
Scale space interest points capture important photometric and deep structure information of an image. The information content of such points can be made explicit using image reconstruction. In this paper we will consider the problem of combining multiple types of interest points used for image reconstruction. It is shown that ordering the complete set of points by differential (quadratic) TV-norm (which works for single feature types) does not yield optimal results for combined point sets. The paper presents a method to solve this problem using canonical sets of scale space features. Qualitative and quantitative analysis show improved performance over simple ordering of points using the TV-norm.
On Computing Canonical Subsets of Graph-Based Behavioral Representations
, 2009
"... The collection of behavior protocols is a common practice in human factors research, but the analysis of these large data sets has always been a tedious and time-consuming process. We are interested in automatically finding canonical behaviors: a small subset of behavioral protocols that is most r ..."
Abstract
- Add to MetaCart
(Show Context)
The collection of behavior protocols is a common practice in human factors research, but the analysis of these large data sets has always been a tedious and time-consuming process. We are interested in automatically finding canonical behaviors: a small subset of behavioral protocols that is most representative of the full data set, providing a view of the data with as few protocols as possible. Behavior protocols often have a natural graph-based representation, yet there has been little work applying graph theory to their study. In this paper we extend our recent algorithm by taking into account the graph topology induced by the paths taken through the space of possible behaviors. We applied this technique to find canonical web-browsing behaviors for computer users. By comparing identified canonical sets to a ground truth determined by expert human coders, we found that this graph-based metric outperforms our previous metric based on edit distance.
1 Drexel Object Occlusion Repository (DOOR)
, 2005
"... The Drexel Object Occlusion Repository is a reference set of images for computer vision and object recognition researchers. The images are constructed by overlapping input objects from the COIL-20 database [1] and occluding them by various amounts. The amount of occlusion for each image is measured ..."
Abstract
- Add to MetaCart
(Show Context)
The Drexel Object Occlusion Repository is a reference set of images for computer vision and object recognition researchers. The images are constructed by overlapping input objects from the COIL-20 database [1] and occluding them by various amounts. The amount of occlusion for each image is measured at the pixel level. An accompanying text file for each occlusion image describes the input files, occlusion rates etc. Figure 1. Occlusion example door 4 41.png 1. Overview The Drexel Object Occlusion Repository is a syntactic set of images constructed from the COIL-20 database from Columbia University [1]. In a previous work [2] our tests with the COIL-20 database indicated a need for a set of reference scenes where we could test the ability of our algorithm to locate objects in scenes where the objects are partially occluded. In particular we required a precise measurement of the occlusion rates in addition to non-trivial occlusions. To accomplish these goals we have constructed the Drexel Object Occlusion Repository. The repository contains objects deterministically placed in groupings with varying amounts of occlusion. The repository
