Describes the advantages of using variable length equifrequent fragments as the language elements for compression coding of large data bases. (Author)

Proof is given of the equivalence of Boolean and weighted search methods. (Author)

An order-analysis procedure, which uses graph theory to extract efficiently nonredundant, unidimensional chains of items from multidimensional data sets and chain consistency as a criterion for chain membership is outlined in this paper. The procedure is intended as an alternative to the Reynolds (1976) procedure which is described as being…

The design and development of a program of computer-assisted instruction (CAI) which assists the student in learning elementary algorithms of an undergraduate numerical methods course is presented, along with special programing features such as partial precision arithmetic, computer-generated problems, and approximate matching of mathematical…

Described here is an efficient encoding procedure for Algorithmic Wiswesser Notation (ALWIN), using the Morgan labelling algorithm and the neighborhood relationship in a chemical graph. This procedure introduces a hierarchy to bring an order for the unique description of the chemical structure with a minimal computational effect. (Author)

A BASIC computer program is described which computes the Stuart-Maxwell test with its chi-square value and associate probability level. Following a significant chi-square test, the user has the option of performing multiple comparisons using McNemar's test for the significance of change. (Author)

This paper describes a set of four BASIC computer programs for computing the Rand index of cluster similarity. The routines calculate the unadjusted Rand Index; the separate routines are designed to handle problems of different sizes and alternate methods of data storage. (Author)

The polyserial and point polyserial correlations are discussed as generalizations of the biserial and point biserial correlations. The relationship between the polyserial and point polyserial correlation is derived. Some practical applications of the polyserial correlation are described. (Author/JKS)

Miller and Farr's algorithm for the index of redundancy is shown to be incorrect by means of a counterexample. The consequences of this error for other conclusions drawn by the authors are discussed. (Author/JKS)

Johnson has shown that the single linkage and complete linkage hierarchical clustering algorithms induce a metric on the data known as the ultrametric. Johnson's proof is extended to four other common clustering algorithms. Two additional methods also produce hierarchical structures which can violate the ultrametric inequality. (Author/CTM)

Six different algorithms to generate widely different non-normal distributions are reviewed. These algorithms are compared in terms of speed, simplicity, and generality of the technique. The advantages and disadvantages of using these algorithms are briefly discussed. (Author)

Discusses the use of inverted files in information retrieval systems and proposes a document identifier reassignment method to reduce the average gap values in an inverted file. Highlights include the d-gap technique; document similarity; heuristic algorithms; file compression; and performance evaluation from a simulation environment. (LRW)

Discusses sequential patterns, data mining, knowledge acquisition, and fuzzy sequential patterns described by natural language. Proposes a fuzzy data mining technique to discover fuzzy sequential patterns by using the simple partition method which allows the linguistic interpretation of each fuzzy set to be easily obtained. (Author/LRW)

Concepts of ordinal network representation are discussed. Notation (the type of data that can be represented) and the type of representation given are reviewed. The idea of reduced ordinal networks is explored; and the algorithm, uniqueness results, and error handling problems are presented. Examples of data analysis are included. (SLD)