Discusses form subdivisions as part of Library of Congress Subject Headings (LCSH) and the MARC format, which did not have a separate subfield code to identify form subdivisions. Describes the development of an algorithm to identify form subdivisions and reports results of an evaluation of the algorithm. (LRW)

Presents an algorithm to compute the critical path in a graph representing a project evaluation research task. Once the algorithm is executed, the last matrix obtained permits the visualization of some important information which leads to the determination of the weight of the critical path. (Author/MM)

Discussion of query processing focuses on techniques developed by LEXIS-NEXIS for identifying key concepts, selecting synonyms and related terms, and detecting phrases that can be combined to increase recall and precision. Describes experiments in the ad hoc track of the sixth TREC (Text Retrieval Conference), including the use of ranking…

Evaluates a method for item selection in adaptive testing that is based on Kullback-Leibler information (KLI) (T. Cover and J. Thomas, 1991). Simulation study results show that testing algorithms using KLI-based item selection perform better than or as well as those using Fisher information item selection. (SLD)

Evaluated the performance of several alternative cluster analytic approaches to initial model specification using population parameter analyses and a Monte Carlo simulation. Of the six cluster approaches evaluated, the one using the correlations of item correlations as a proximity metric and average linking as a clustering algorithm performed the…

A probabilistic model of keyword indexing is outlined, and some of the consequences of the model are examined. An algorithm defining a measure of indexability is developed--a measure intended to reflect the relative significance of words in documents. (Author)

The author taught one group using the traditional subtraction algorithm and one using an equal additions algorithm. Students in the latter group showed greater success than the former. (SD)

The importance of using a theory of characters in the designing of automatic computer character recognition algorithms for hand-printed letters is demonstrated. (Author)

In his early exposition of path analysis, Duncan (1966) noted that the method "provides a calculus for indirect effects." Despite the interest in indirect causal effects, most users treat them as if they are population parameters and do not test whether they are statistically significant. Sobel (1982) has recently derived the asymptotic…

An algorithm is presented for the best least-squares fitting correlation matrix approximating a given missing value or improper correlation matrix. The proposed algorithm is based on a solution for C. I. Mosier's oblique Procrustes rotation problem offered by J. M. F. ten Berge and K. Nevels (1977). It is shown that the minimization problem…

Homogeneity analysis, or multiple correspondence analysis, is usually applied to k separate variables. In this paper, it is applied to sets of variables by using sums within sets. The resulting technique is referred to as OVERALS. It uses the notion of optimal scaling, with transformations that can be multiple or single. The single transformations…

Estimation of ability and item parameters in latent trait models is discussed. When both ability and item parameters are considered fixed but unknown, the method of maximum likelihood for the logistic or probit models is well known. Discussed are techniques for estimating ability and item parameters when the ability parameters or item parameters…