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…

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…

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…

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)

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…

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…

Describes EquiX, a search language for XML that combines querying with searching to query the data and the meta-data content of Web pages. Topics include search engines; a data model for XML documents; search query syntax; search query semantics; an algorithm for evaluating a query on a document; and indexing EquiX queries. (LRW)

The illustrative method of teaching employed in most undergraduate accounting courses is becoming increasingly burdensome to professors and students due to the rapid proliferation of accounting and auditing professional standards and the increased complexity of the tax law. This teaching method may be near the breaking point in upper division…

This paper describes the Structure-Mapping Engine (SME), a cognitive simulation program for studying human analogical processing. SME is based on Gentner's Structure-Mapping theory of analogy, and provides a "tool kit" for constructing matching algorithms consistent with this theory. This flexibility enhances cognitive simulation studies by…

Discussion of a new method of index term dictionary compression in an inverted-file-oriented database highlights a technique of word coding, which generates short fixed-length codes obtained from the index terms themselves by analysis of monogram and bigram statistical distributions. Substantial savings in communication channel utilization are…

When problems defy solution, mathematicians can settle for "almost." This branch of mathematics (called computational complexity) encompasses both the number of parts involved in a problem and the intricacy of their interrelatedness. Current research in this area is discussed, considering various computer applications involved. (JN)