Describes a prototype system for interactive knowledge-based indexing of the medical literature. Topics covered include current indexing practice; knowledge-based systems using frames; various types of assistance provided by the prototype system; and current research activities and plans for the development of the system. (17 references) (CLB)

L. A. Goodman's loglinear formulation for bi-way contingency tables is extended to tables with or without missing cells and is used for exploratory purposes. Three-way tables and generalizations of correspondence analysis are deduced, and a generalized version of Goodman's algorithm is used to estimate scores in all cases. (Author/TJH)

Describes exploratory experiments in evaluating and improving a thesaurus through studying its effect on retrieval. A formula was developed to measure the conceptual distance between queries and documents encoded as sets of thesaurus terms. Comparison to the performance of people judging conceptual distance shows that the formula accurately…

A Monte Carlo simulation and applications to eight sets of proximity data are presented to support the practical utility of a network scaling algorithm (NETSCAL)--NETwork SCALing. The algorithm determines which vertices within a network are directly connected by an arc and estimates the length of each arc. (TJH)

It is shown that Bayesian algorithms are computationally simpler in frequency formats than in the probability formats used in previous research. Analysis of several thousand solutions to Bayesian problems showed that when information was presented in frequency formats, statistically naive participants derived up to 50% of inferences by Bayesian…

Presents alternative equation-solving procedures that emphasize an examination of the steps or operations necessary to perform a calculation, followed by the inversion of those steps. The approach is especially attractive to students with limited mathematical skills. (Author/MKR)

Attempts to describe a notion parallel to number sense, called symbol sense, incorporating the following components: making friends with symbols, reading through symbols, engineering symbolic expressions, equivalent expressions for non-equivalent meanings, choice of symbols, flexible manipulation skills, symbols in retrospect, and symbols in…

Discussion of index construction for large text collections highlights a new indexing algorithm designed to create large compressed inverted indexes "in situ." Topics include a computational model, inversion, index compression, merging, experimental test results, effect on retrieval performance, memory restrictions, and dynamic…

Discusses the use of chaos, or nonlinear dynamics, for investigating computer-mediated communication. A comparison between real, human-generated data from a computer network and similarly constructed random-generated data is made, and mathematical procedures for determining chaos are described. (seven references) (LRW)

Describes an algorithm for course scheduling that can make the process much less time consuming for chairs and deans. Notes that long-term planning is possible because of the algorithm's two-year cycle. Notes that the algorithm can be programed easily by using a spreadsheet. (RS)

An algorithm for obtaining initial values for the minimization process in covariance structure analysis is developed that is more generally applicable for computing parameters connected to latent variables than the currently existing ones. The algorithm is formulated in terms of the RAM model but can be extended. (SLD)

The current state of multidimensional scaling using the city-block metric is reviewed, with attention to (1) substantive and theoretical issues; (2) recent algorithmic developments and their implications for analysis; (3) isometries with other metrics; (4) links to graph-theoretic models; and (5) prospects for future development. (SLD)

The DEcomposition into DIrectional COMponents (DEDICOM) method for analysis of asymmetric data gives representations that are identified only up to a non-singular transformation. To identify solutions, it is proposed that subspace constraints be imposed on the stimulus coefficients. Procedures are discussed for several cases. (SLD)

Problems in selection of optimal designs in item-response theory (IRT) models are resolved through a sequential design procedure that is a modification of the D-optimality procedure proposed by Wynn (1970). This algorithm leads to consistent estimates, and the errors in selecting the abilities generally do not greatly affect optimality. (SLD)

Reviews Web-search tools available to librarians. Discusses the Clever project, (part of the Computer Science Principles and Methodologies Department at the IBM Almaden Research Center, Silicon Valley, California), an algorithm that finds authoritative sources on the Web; Google technology, based on links between Web pages; Ask Jeeves, a…