11670082
Managerial Issues for the Consideration and Use of Formal Methods
The introduction of formal methods into the commercial community has been slow. This might, in part, be due to lack of guidance for program managers responsible for execution of a program, who must justify added expense or time to delivery. This paper first provides managers with guidance in deciding if a particular project is a good candidate for the use of formal methods. After the go/no go conditions are considered, the paper describes some of the management and reporting issues that may arise if the decision is made to use formal methods on a program.
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.
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.
45780832
Collaborative Work: Distributed Authoring and Versioning
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.
17288174
The Tutte polynomial for homeomorphism classes of graphs
We study a polynomial which contains, as special cases, the Tutte polynomials of all members of a given homeomorphism class of graphs. We further show that this polynomial can be directly derived from the chain polynomial introduced in [1].
6916623
Chromatic polynomials of generalized trees
Abstract This paper is a survey of results on chromatic polynomials of graphs which are generalizations of trees. In particular, chromatic polynomials of q -trees will be discussed. The smallest q -tree ( q ≥1) is the complete graph K q on q vertices. A q -tree on n +1 vertices where n ≥ q , is obtained by adding a new vertex adjacent to each of q arbitrarily selected, mutually adjacent vertices in a q -tree on n vertices. Another generalization of trees is the n -gon-trees. The smallest n -gon-tree ( n ≥3) is the n -gon which is a cycle of n vertices. A n -gon-tree with k +1 n -gons is obtained from a n -gon-tree with k n -gons by adding a new n -gon which has exactly one edge in common with any n -gon of a n -gon-tree with k n -gons.