6273632
Uniform comparison of data models using containment modeling
Containment data models are a subset of entity relationship models in which the allowed relationships are either a type of containment, storage, or inheritance. This paper describes containment relationships, and containment data models, applying them to model a broad range of monolithic, link server, and hyperbase systems, as well as the Dexter reference model, and the WWW with WebDAV extensions. A key quality of containment data models is their ability to model systems uniformly, allowing a broad range of systems to be compared consistently.
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."
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.
6175342
Hypertext versioning for embedded link models
In this paper, we describe Chrysant, a hypertext version control system for embedded link models. Chrysant provides general-purpose versioning capability to hypertext systems with an embedded link model. To apply Chrysant for a specific hypertext system, we require the containment model for this system's data model, the containment model of the version repository for this system, the hypertext role definition, the versioning role definition, and the filesystem mapping definition. Additionally, a specific parser that retrieves the link targets from the hypertext resources is needed. Hypertext versioning is different from versioning an individual resource in the traditional way, in that both the content of a hypertext resource and the relationships between it and other resources related by hypertext links are versioned. In Chrysant, the structure container and the content of a hypertext resource are versioned separately. We describe the architecture of Chrysant, and explain the procedure of the check-in and check-out functions. An AF-BTU algorithm is introduced in the paper to check in the hypertext network of a hypertext resource. As a case study, the application of Chrysant for HTML content is introduced. We create necessary definition specifications for the HTML system and a parser to retrieve link targets from a HTML document. Some examples of HTML versioning with Chrysant are shown.
45780832
Collaborative Work: Distributed Authoring and Versioning
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.
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.
20403548
The chromatic uniqueness of W10
Abstract Xu and Li proved the chromatic uniqueness of wheels on an odd number of vertices. It is known that the wheels on six vertices and eight vertices are not chromatically unique. Read found that the wheel on ten vertices is chromatically unique by computer computations. Here, we sketch a mathematical proof of the chromatic uniqueness of the wheel on ten vertices.
911709
Homeomorphs and amallamorphs of the Petersen graph
Let P be the Petersen graph. The main results of this paper are the discovery of infinite families of chromatically equivalent pairs of P homeomorphs and the discovery of infinite families of flow equivalent pairs of P amallamorphs. In particular, three families of P homeomorphs with 8 parameters, five families with 7 parameters and many families with fewer parameters are obtained. Also one family of P amallamorphs with 9 parameters, three families with 7 parameters, seven families with 6 parameters and many families with fewer parameters are obtained.