Reviews criticisms of the use of drill and practice programs in educational computing and describes potentials for its use in instruction. Topics discussed include guidelines for developing computer-based drill and practice; scripted training courseware; item format design; item bank design; and a performance-responsive algorithm for item…

Describes two computer programs--INDEX and INDEXD--that use statistical information about repeated phrases in documents to automatically index documents at the conceptual level. Sample output of the programs is provided, and plans to combine this method with linguistic and artificial intelligence techniques to provide a general conceptual…

Investigates the value of applying principles derived from simulated annealing to clustering tuples in database design, and compares this technique with a graph-collapsing clustering method. It is concluded that, while the new method does give superior results, the expense involved in algorithm run time is prohibitive. (24 references) (CLB)

Describes examples of rational representation as a guide for translating terminology and information encountered in manuals for computers. Discusses four limitations of the representation. (YP)

Discusses the interpretation of nominal compounds in the context of natural language processing for information retrieval. Knowledge-intensive algorithms that can successfully interpret compounds found in technical documents are described, and experiments are reported that indicate these algorithms may be unnecessary for improving retrieval…

Describes the development and use of a policy model and algorithm for allocating continuing education (CE) resources in a large national health system. The algorithm uses a two-factor model, basing facility CE allocations on the amount of CE need and price differences in accessing CE sources. (Author/JOW)

Presents an example from the combinatorial theory of partially ordered sets. Discusses algorithms of on-line antichain partitioning problems, a topic in discrete optimization. (YP)

Describes the algorithm used to select a simple random sample of certain size without having to list all possible samples and a justification based on Pascal's triangle. Provides testing results by various computers. (YP)

Demonstrates how spreadsheets can be used to implement linear system solving algorithms in college mathematics classes. Lotus 1-2-3 is described, a linear system of equations is illustrated using spreadsheets, and the interplay between applications, computations, and theory is discussed. (four references) (LRW)

Explores the use of computers for teaching mathematical models of transposition ciphers. Illustrates the ideas, includes activities and extensions, provides a mathematical model and includes computer programs to implement these topics. (MVL)

The grammars of natural languages may be learned by using genetic algorithm systems such as LUST (Linguistics Using Sexual Techniques) that reproduce and mutate grammatical rules and parts-of-speech tags. In document retrieval or filtering systems, applying tags to the list of terms representing a document provides additional information about…

Discusses computational studies of learning in artificial neural networks and findings that may provide insights into the learning abilities of the human brain. Describes efforts to test theories about brain information processing, using artificial neural networks. Vignettes include information concerning how a neural network represents…

Describes a computer algorithm used in South Carolina public schools that links year-to-year student test records. The process of matching data files is explained, computer matches are compared with matches based on numeric student identification numbers to determine accuracy, and other applications in support of educational research are…

Discussion of clustering of documents and queries in information retrieval systems focuses on the use of a genetic algorithm to adapt subject descriptions so that documents become more effective in matching relevant queries. Various types of clustering are explained, and simulation experiments used to test the genetic algorithm are described. (27…

A method is presented and illustrated for simultaneously generating multiple tests with similar characteristics from the item bank by using binary programing techniques. The parallel tests are created to match an existing seed test item for item and to match user-supplied taxonomic specifications. (SLD)