Several algorithms for computing the greatest lower bound to reliability or the constrained minimum-trace communality solution in factor analysis have been developed. The convergence properties of these methods are examined. A uniqueness proof for the desired solution is offered. (Author/JKS)

Two algorithms based on a latent class model are presented for discovering hierarchical relations that exist among a set of dichotomous items. The algorithms presented, and three competing deterministic algorithms are compared using computer-generated data. (Author/JKS)

A rule is presented to identify the model in structural equation modeling. This rule includes the null B and recursive rules as extreme cases. Proof is given for the theorem. (SLD)

Describes a method for choosing rejection probabilities for the tests of independence that are used in constraint-based algorithms of exploratory path analysis. The method consists of generating a Markov or semi-Markov model from the equivalence class represented by a partial ancestral graph and then testing the d-separation implications. (SLD)

Adapting the principles that have evolved in the development of heraldry to current needs, an algorithm was developed to aid in the description of graphic designs. It provides an efficient method of describing trademarks, logos, and other designs so that they can be found quickly using mechanical searching techniques. (26 references) (EAM)

Defines a random effects diagonal metric multidimensional scaling model, gives its computational algorithms, describes researchers' experiences with these algorithms, and provides an illustration of the use of the model and algorithms. (Author/SLD)

Discusses intelligent tutoring systems and the application of Bayesian networks to student modeling. Considers reasons for not using Bayesian networks, including the computational complexity of the algorithms and the difficulty of knowledge acquisition, and proposes an approach to simplify knowledge acquisition that applies causal independence to…

Discussion of word stemming for text processing and information retrieval focuses on an algorithm for generating stemmers from text stemmer specification files. Highlights include the use of finite state machines for stemming; stemmer specification file format; stemmer generation and driver algorithms; and stemmer timing comparisons. (Author/LRW)

Identifies a general algorithm for orthogonal rotation and shows that when an algorithm parameter alpha is sufficiently large, the algorithm converges monotonically to a stationary point of the rotation criterion from any starting value. Introduces a modification that does not require a large alpha and discusses the use of this modification as a…

All parametric analysis focuses on the "synthetic" variables created by applying weights to "observed" variables, but these synthetic variables are called by different names across methods. This paper explains four ways of computing the synthetic scores in factor analysis: (1) regression scores; (2) M. S. Bartlett's algorithm…

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)