Discussion of information retrieval, query optimization techniques, and relevance feedback focuses on genetic algorithms, which are derived from artificial intelligence techniques. Describes an evaluation of different genetic algorithms using a residual collection method and compares results with the Ide dec-hi method (Salton and Buckley, 1990…

Discusses the use of link structure analysis in World Wide Web information retrieval and in retrieval and ranking algorithms of search engines. Presents two techniques which bias co-citation based link analyses towards favorable Web pages and away from undesired pages, and are then integrated into existing link-analyzing algorithms. (Author/LRW)

Reports an approach to automatic thesaurus construction for Chinese documents. Presents an effective Chinese keyword extraction algorithm. Compared to previous studies, this method speeds up the thesaurus generation process drastically. It also achieves a similar percentage level of term relatedness. Includes three tables and four figures.…

A method is presented that simultaneously estimates cluster membership and corresponding regression functions for a sample of observations or subjects. This methodology is presented with the simulated annealing-based algorithm. A set of Monte Carlo analyses is included to demonstrate the performance of the algorithm. (SLD)

Presents two methods for replacing a series by one converging more rapidly: regrouping the terms of a series and manipulations of power series. Describes a general algorithm for approximating the natural logarithm of any number. (YP)

Presents a model for the a priori analysis of natural language queries which uses an algorithm to transform the query into a logical pattern that is used to determine the answerability of the query. The results of testing by a prototype system implemented in PROLOG are discussed. (20 references) (CLB)

Discusses the problems caused for both users and systems by queries containing negation, and presents an algorithm for transforming Boolean queries with negated terms into queries without negation using a hierarchical thesaurus. A set of user requests submitted to an academic library are also examined to determine the pattern and frequency of use…

The "word problem" is stated for a given collection. Facts regarding Dehn's Algorithm, definition of Thue systems, a rewriting system, lemmas and corollaries are provided. The situation is examined where the monoid presented by a finite Thue system is a group. (DC)

Possible ways of mechanization for counting using a binary system are discussed. Shows a binary representation of the numbers and geometric models having eight triples of lamps. Provides three problem sets. (YP)

Describes the software architecture and application of SABRE (Semi-Automated Bibliographic Environment), which is one of the first products to provide a semi-automatic environment for relevancy ranking of citations obtained from searches of bibliographic databases. Features designed to meet the review, categorization, culling, and reporting needs…

Homogeneity analysis (multiple correspondence analysis), which is usually applied to "k" separate variables, was applied to sets of variables by using sums within sets. The resulting technique, OVERALS, uses optimal scaling. The corresponding OVERALS computer program minimizes a least squares loss function via an alternating least…

Describes a model that displays structures necessary to map between the conceptual and external levels in database management systems, using an algorithm that maps the syntactic representations of tuples onto semantic representations. A technique for translating tuples into natural language sentences is introduced, and a system implemented in…

The Bock and Aitkin Marginal Maximum Likelihood/EM (MML/EM) approach to item parameter estimation is an alternative to the classical joint maximum likelihood procedure of item response theory. This paper provides the essential mathematical details of a MML/EM solution and shows its use in obtaining consistent item parameter estimates. (TJH)

Reviews research using diagrams, number sentences, and algorithms to help students learn to add and subtract; poses questions on the relationship of instruction to children's knowledge construction; and proposes a research agenda in this area. (86 references) (MKR)

A new parametric maximum likelihood procedure is proposed for estimating ultrametric trees for the analysis of conditional rank order proximity data. Technical aspects of the model and the estimation algorithm are discussed, and Monte Carlo results illustrate its application. A consumer psychology application is also examined. (SLD)