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.
17717719
Design spaces for link and structure versioning
This paper reflects upon existing composite-based hypertext versioning systems, and presents two high-level design spaces that capture the range of potential choices in system data models for versioning links, and versioning hypertext structure. These two design spaces rest upon a foundation consisting of a containment model, describing choices for containment in hypertext systems, and the design space for persistently recording an object's revision history, with applicability to all versioning systems. Two example points in the structure versioning design space are presented, corresponding to most existing composite-based hypertext versioning systems. Using the presented design spaces allows the data models of existing hypertext versioning systems to be decomposed and compared in a principled way, and provides new system designers significant insight into the design tradeoffs between various link and structure versioning approaches.
5221782
WebDAV: A network protocol for remote collaborative authoring on the Web
Collaborative authoring tools generate network effects, where each tool's value depends not just on the tool itself, but on the number of other people who also have compatible tools. We hypothesize that the best way to generate network effects and to add collaborative authoring capability to existing tools is to focus on the network protocol. This paper explores a protocol-centric approach to collaborative authoring by examining the requirements and functionality of the WebDAV protocol. Key features of the protocol are non-connection-oriented concurrency control, providing an upward migration path for existing non-collaborative applications, support for remote manipulation of the namespace of documents, and simultaneous satisfaction of a wide range of functional requirements.
8320820
Identification of software instabilities
As software evolves, maintenance practices require aprocess of accommodating changing requirements whileminimizing the cost of implementing those changes. Overtime, incompatibilities between design assumptions andthe operational environment become more pronounced,requiring some regions of the implementation to requirerepeated modification. These regions are considered tobe "unstable", and may benefit from targetedrestructuring efforts as a means of realigning theseassumptions and the environment.An analysis of these regions that identifies andclassifies these instabilities can be used to prioritize anddirect structural maintenance efforts. To this end, wepresent an identification approach that augments staticdependence graphs with data retrieved fromconfiguration management (CM) systems. This approachavoids the assumption that artifacts changing within thesame CM transaction are related, without requiringsophisticated change management data. We alsodescribe our work-to-date in validating the underlyingassumptions and identifying instabilities.
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.
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.
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.
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.