Describes a microcomputer-based string index format generated from concept networks using multiple search terms. Link weighting is highlighted as a method to decide which term appears first so the entry reflects the classification implied by the search specification. The computer software used for this system is briefly described. (Author/LRW)

Describes the simulation of a nearest neighbor searching algorithm for document retrieval using a pool of microprocessors. Three techniques are described which allow parallel searching of a binary search tree as well as a PASCAL-based system, PASSIM, which can simulate these techniques. Fifty-six references are provided. (Author/LRW)

Discussion of graph-drawing algorithms compares and evaluates five algorithms for generated automatic graphic display of sentence dependency structures that have been implemented in the TEXTNET text structure management system. Evaluation criteria are discussed, and a test of the algorithms with a database of newspaper articles is described. (16…

Presents a description and evaluation of a microcomputer-based system designed to diagnose errors in basic algorithmic procedures made by students in a college remedial mathematics class. The paper-and-pencil diagnostic test is described, and results of pretests and posttests for the computer group and control group are discussed. (five…

Students from six fourth-grade classes were paired and randomly assigned to computer or worksheet treatments on multiplication and division. Those using computer-based drill-and-practice programs made greater gains on some tests of basic facts, but had no higher retention of algorithms. (MNS)

Describes experiments in Arabic information retrieval using 29 queries against a base of 355 bibliographic records. Using roots and stems as index terms worked better than words, and the root performed as well as or better than the stem at low recall levels and definitely better at high recall levels. (Contains 30 references.) (KRN)