Discusses indexes for text databases and presents an efficient implementation of an index for text searching called PAT array, or suffix array, where the database is stored on secondary storage devices such as magnetic or optical disks. Additional hierarchical index structures and searching algorithms are proposed that improve searching time, and…

When the network-flow algorithm (NFA) and the average growth approximation algorithm (AGAA) were used for automated test assembly with American College Test and Armed Services Vocational Aptitude Battery item banks, results indicate that reasonable error in item parameters is not harmful for test assembly using NFA or AGAA. (SLD)

Presents an overview of machine learning research and reviews methods used for evaluating machine learning systems. Ways that machine-learning algorithms were used in traditional information retrieval systems in the "pre-Web" era are described, and the field of Web mining and how machine learning has been used in different Web mining…

Describes the use of Moe's Mall, a locational device designed to be used by learners, as a simple algorithm for solving mole-based exercises efficiently and accurately using dimensional analysis. (DDR)

Discussion of mapping and visualizing in scholarly literature focuses on the development of software called HistCite for generating chronological maps of collections, where all cited references for source documents are captured, using scientific literature as an example. Generates tables of the most-cited works to help searchers identify the most…

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)