5345896
Properties of academic paper references
We propose a new method to find related papers using an input paper and its hyperlinked citation relationships rather than keywords. Such related papers are especially useful as background reading for researchers new to a research field. In this paper we introduce the background reading paper extractor (BPE), and show various properties of academic paper references.
32943999
A Proposed Curriculum for a Masters in Web Engineering
To address the significant technical demand for trained Web Engineers, and to raise the current state of the practice of Web Engineering, a Master's level degree program in Web Engineering is proposed. The most significant research disciplines for Web Engineering are Network Engineering, Software Engineering, Databases and Storage Systems, and Hypermedia. Important aspects of these disciplines are distilled into key knowledge areas for Web Engineering. A curriculum organization is proposed that consists of coursework that covers the key knowledge areas, along with a multi-semester Web design project that synthesizes and applies this knowledge on a real-world Web application. The aim of the paper is to begin a dialog on the characteristics and aims of graduate-level Web Engineering degree programs.
9755399
Uniform Comparison of Configuration Management Data Models
The data models of a series of 11 configuration management systems--of varying type and complexity--are represented using containment data models. Containment data models are a specialized form of entityrelationship model in which entities may be containers or atoms, and the only permitted form of relationship is inclusion or referential containment. By using entities to represent the native abstractions of each system, and containment relationships to model inclusion and identifier references, systems can be modeled uniformly, permitting consistent cross-comparison of systems.
206854545
Predicting Faults from Cached History
We analyze the version history of 7 software systems to predict the most fault prone entities and files. The basic assumption is that faults do not occur in isolation, but rather in bursts of several related faults. Therefore, we cache locations that are likely to have faults: starting from the location of a known (fixed) fault, we cache the location itself, any locations changed together with the fault, recently added locations, and recently changed locations. By consulting the cache at the moment a fault is fixed, a developer can detect likely fault-prone locations. This is useful for prioritizing verification and validation resources on the most fault prone files or entities. In our evaluation of seven open source projects with more than 200,000 revisions, the cache selects 10% of the source code files; these files account for 73%-95% of faults - a significant advance beyond the state of the art.
9717322
Mining version archives for co-changed lines
Files, classes, or methods have frequently been investigated in recent research on co-change. In this paper, we present a first study at the level of lines. To identify line changes across several versions, we define the annotation graph which captures how lines evolve over time. The annotation graph provides more fine-grained software evolution information such as life cycles of each line and related changes: "Whenever a developer changed line 1 of version.txt she also changed line 25 of Library.java."
21934141
Micro pattern evolution
When analyzing the evolution history of a software project, we wish to develop results that generalize across projects. One approach is to analyze design patterns, permitting characteristics of the evolution to be associated with patterns, instead of source code. Traditional design patterns are generally not amenable to reliable automatic extraction from source code, yet automation is crucial for scalable evolution analysis. Instead, we analyze "micro pattern" evolution; patterns whose abstraction level is closer to source code, and designed to be automatically extractable from Java source code or bytecode. We perform micro-pattern evolution analysis on three open source projects, ArgoUML, Columba, and jEdit to identify micro pattern frequencies, common kinds of pattern evolution, and bug-prone patterns. In all analyzed projects, we found that the micro patterns of Java classes do not change often. Common bug-prone pattern evolution kinds are 'Pool → Pool', 'Implementor → NONE', and 'Sampler → Sampler'. Among all pattern evolution kinds, 'Box', 'CompoundBox', 'Pool', 'CommonState', and 'Outline' micro patterns have high bug rates, but they have low frequencies and a small number of changes. The pattern evolution kinds that are bug-prone are somewhat similar across projects. The bug-prone pattern evolution kinds of two different periods of the same project are almost identical.
205877725
Chromaticity of a family of K4 homeomorphs
Abstract A K 4 homeomorph can be described as a graph on n vertices having 4 vertices of degree 3 and n − 4 vertices of degree 2; each pair of degree 3 vertices is joined by a path. We study the chromatic uniqueness and chromatic equivalence of one family of K 4 homeomorphs. This family has exactly 3 paths of length one. The results of this study leads us to solve 3 of the problems posed by Koh and Teo in their 1990 survey paper which appeared in Graphs and Combinatorics.
31951842
The chromaticity of certain graphs with five triangles
Abstract Let W(n, k) denote the graph of order n obtained from the wheel Wn by deleting all but k consecutive spokes. In this note, we study the chromaticity of graphs which share certain properties of W(n, 6) which can be obtained from the coefficients of the chromatic polynomial of W(n, 6). In particular, we prove that W(n, 6) is chromatically unique for all integers n⩾8. We also obtain two additional families of chromatically unique graphs.