Discussion of student modeling and intelligent tutoring systems focuses on the development of the ASSERT algorithm (Acquiring Stereotypical Student Errors by Refining Theories). Topics include overlay modeling; bug libraries (databases of student misconceptions); dynamic modeling; refinement-based modeling; and experimental results from tests at…

Proposes a fuzzy multiset model for information clustering with application to information retrieval on the World Wide Web. Highlights include search engines; term clustering; document clustering; algorithms for calculating cluster centers; theoretical properties concerning clustering algorithms; and examples to show how the algorithms work.…

In environments where the state of the system changes rapidly, such as stock trading, air traffic control, network management, and process control, databases have been proposed as the platform to develop automated control systems. Information in such systems consists of "updates," reporting on the state of the environment and…

Discusses an algorithm from Vedic mathematics that has similarities to FOIL and the standard algorithm for multiplication. (Author/NB)

The article identifies five incorrect beliefs about mathematics often held by students who have difficulty with mathematics. They include: the relative size of numbers is more important than the relationships between quantities; computation problems must be solved by using a step-by-step algorithm; mathematics problems have only one correct…

Introduces two distribution schemes that partition documents over multiple processors and the corresponding multiprocessor retrieval algorithms that match relevant documents to user queries. The suggested framework is based on a general purpose hypercube multicomputer architecture with a dedicated disk for each node. A timing analysis for the…

Describes a project that developed two expert systems for library cataloging using the second edition of the Anglo American Cataloging Rules (AACR2) as a knowledge base. The discussion covers cataloging as interpretation, the structure of AACR2, and the feasibility of using expert systems for cataloging in traditional library settings. (26…

This paper shows that redundancy maximization with J. K. Johansson's extension can be accomplished via a simple iterative algorithm based on H. Wold's Partial Least Squares. The model and the iterative algorithm for the least squares approach to redundancy maximization are presented. (TJH)

An algorithm, based on a solution for C. I. Mosier's oblique Procrustes rotation problem, is presented for the best least-squares fitting correlation matrix approximating a given missing value or improper correlation matrix. Results are of interest for missing value and tetrachoric correlation, indefinite matrix correlation, and constrained…

Analysis of (n=92) university students' construction of visual representations (Venn diagrams) of eight set expressions found competent and error-prone students constructed and used procedures to complete set translation tasks, and two-thirds of observed errors arose from consistent implementation of ill-formed procedures. (Author/MKR)

Describes a study with the main objective of constructing models based on strategies students use to solve chemistry problems and to show that these models form sequences of progressive transitions termed "problemshifts" that increase the explanatory/heuristic power of the model. Results implies that the relationship between algorithmic…

J. P. Shaffer has presented two tests to improve the power of multiple comparison procedures. This article described an algorithm to carry out the tests. The logic of the algorithm and an application to a data set are given. (SLD)

Presents results of a project with second and third graders to establish concepts of equality that led to the realization that teachers often help students too much and may push them algorithmically beyond their ability without the development of proper referents. (Author/MKR)

A method for robust canonical discriminant analysis via two robust objective loss functions is discussed. Majorization is used at several stages in the minimization procedure to obtain a monotonically convergent algorithm. A simulation study and empirical data illustrate the procedure. (SLD)

High impact astronomy journals were identified by using a methodology called Discipline-Contribution Score (DCS). The DCS algorithm was used to track citations of 33 nonrecognized astronomy journals, as well as to measure contributions to astronomy by multisubfield physics and multidisciplinary journals. (JKP)