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)

Guidelines for the integration of effective and efficient practice into the lecture format of higher education curricula are outlined and discussed. An algorithm for incorporating active learning into lecture courses is provided, with examples and discussion of possible constraints. (four references) (EA)

Discusses the problems of compressing a large textual database for storage on CD-ROM. A text-compression algorithm is presented, new algorithms for compression of indices are described, and the ARTFL (American and French Research on the Treasury of the French Language) database is used as an example. (14 references) (LRW)

This study analyzed production of a long vowel sound within Finnish words by normal or dysphonic voices, using the Self-Organizing Map, the artificial neural network algorithm of T. Kohonen which produces two-dimensional representations of speech. The method was found to be both sensitive and specific in the detection of dysphonia. (Author/JDD)

Discusses effective communication with interactive video and suggests possible barriers. Topics addressed include identifying the user; the need for standards; algorithms; the rapid development of hardware; navigation in interactive media; and interactivity with the user. (LRW)

A stochastic multidimensional scaling procedure is presented for analysis of three-mode, three-way pick any/"J" data. The procedure fits both vector and ideal-point models and characterizes the effect of situations by a set of dimension weights. An application in the area of consumer psychology is discussed. (SLD)

Presents a theoretical rationale for employing a form of information retrieval algorithm that helps searchers better navigate through large document collections by continually revising probability estimates for document subsets. The algorithm avoids assumptions of index term independence and predicts relevance more accurately with increasing…

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…

The partial credit model with a varying slope parameter is developed and called the generalized partial credit model (GPCM). Analysis results for simulated data by this and other polytomous item-response models demonstrate that the rating formulation of the GPCM is adaptable to the analysis of polytomous item responses. (SLD)

Investigates document ranking methods in thesaurus-based Boolean information retrieval systems and proposes a new thesaurus-based ranking algorithm called the Extended Relevance algorithm. Performance comparisons are made between the Extended Relevance algorithm and previous thesaurus-based ranking algorithms. (Contains 20 references.) (LRW)

Based on a computer-science course, this article outlines an alternative ordering of programming concepts that aims to develop a reuse habit before other styles of programming are developed. Although the discussion is based on transition from Modula-2 to C++, the issues raised apply to transition from any procedural to any object-oriented…

Discusses structural components of databases that require data-mining algorithms and describes the SUBDUE system that is designed to discover knowledge in structural databases. Analyses the ability of SUBDUE to scale to large databases and describes parallel and distributed implementations to investigate methods for improving the scalability of…

Proposes an algorithm that minimizes the asymptotic variance of the maximum-likelihood (ML) estimator of a linear combination of abilities of interest. The criterion results in a closed-form expression that is easy to evaluate. Also shows how the algorithm can be modified if the interest is in a test with a "simple ability structure."…

Studied item exposure in a computerized adaptive test when the item selection algorithm presents examinees with questions they were asked in a previous test administration. Results with 178 repeat examinees on a medical technologists' test indicate that the combined use of an adaptive algorithm to select items and latent trait theory to estimate…