Discusses XML and information retrieval and describes a query language, ELIXIR (expressive and efficient language for XML information retrieval), with a textual similarity operator that can be used for similarity joins. Explains the algorithm for answering ELIXIR queries to generate intermediate relational data. (Author/LRW)

Discussion of information retrieval focuses on the use of binary trees and how to compact it to use less memory and take less time. Explains retrieval algorithms and describes data structure and hierarchical structure. (LRW)

Presents an algorithm for computation of discrimination values in automatic construction of dictionaries for information retrieval. (Author/PF)

Comments on P. Arabie's article, "Concerning Monte Carlo Evaluations of Nonmetric Multidimensional Scaling Algorithms.", Psychometrika, 1973, 38, 607-8. (RC)

The indirect retrieval method proposed by Goffman is outlined and some similarities to other retrieval methods are indicated. The method is then evaluated and the results are compared with those obtained on the same document collection with cluster-based retrieval using single-link clustering. (Author)

Presented is an empirical confirmation of clustering behavior that has been proposed as a conjecture in the literature; namely, that document ordering is more significant in an algorithm using a full document space search, rather than a search of just unclustered documents, each time a density test is performed. (4 references) (Author)

A formula for the determinant of a partitioned matrix, possibly with singular submatrices, is derived and applied to some psychometric and numerical problems. (Author)

Discusses the problem of enhancing the speed of Huffman decoding of compressed data. Topics addressed include the Huffman decoding tree; multibit decoding; binary string mapping problems; and algorithms for solving mapping problems. (22 references) (LRW)

Describes a new combinatorial algorithm for fitting additive trees to proximity data. This generalized triples method examines all triples of objects of interest in relation to the remaining set of objects to be clustered. The procedure is illustrated, and a simulation study shows its advantages. (SLD)

Provides a comprehensive, nontechnical overview of the three maximum likelihood algorithms available for use with missing data and discusses multiple imputation, frequently used in conjunction with the EM algorithm. (SLD)

The document describes the ALMO programing language. (Author)

An earlier model which proposed to determine the optimum number of shelves to minimize shelving cost of a book collection does not always yield optimal value. Underlying assumptions from this earlier model, which aren't always practical, are discussed, and algorithms providing a better solution for the same problem are presented. (Author)

Historical review of the development and dissemination of ordinary-language algorithms. (STS)

Early analysis sought to identify tasks while recent techniques focus upon analysis of the content of tasks and are more prescriptive. Examples of such analysis appropriate to sequential tasks, one behavior chain task and one algorithm task, are presented to illustrate the prescriptive function of content analysis. (Author)

Investigates techniques for automatic coding of English language strings which involve titles drawn from bibliographic files, but do not require prior knowledge of source. Coding methods (basic, maximum entropy principle), results of test using 6,260 titles from British National Bibliography, and variations in code element ordering are…