Presents new least-squares algorithms that update a fit after each point is entered so trends can be detected promptly as an experiment proceeds. (MLH)

Examines problem-solving results among second-grade students in three schools that were all using a reformed mathematics curriculum. Except for one problem, more students used a mental procedure than the standard written algorithms, and both methods were used with approximately the same degree of accuracy. (AIM)

Describes two experiments that investigate how "buggy algorithms" in multi-digit subtraction are used. The first experiment tested third grade students (N=110) and repeated the test two years later. The second experiment tested students in grades 3-6 (N=301). Contains 21 references. (DDR)

Discussion of hypertext browsing proposes a filtering algorithm which restricts the amount of information made available to the user by calculating the set of most relevant hypertext nodes for the user, utilizing the user profile and data clustering technique. An example is provided of an optimal cluster of relevant data items. (Author/LRW)

Describes a calculator exercise that can help students develop a better visual and numeric feel for Newton's method. (KHR)

Discusses imprecision in multimedia data on the Web and proposes a formal framework in which to formulate powerful queries and presentations of the answers. Introduces a fuzzy-based algebra which allows user preferences, in the form of weights, to alter query expression, and presents algorithms for the evaluation of similarity-based queries.…

Presents a preliminary empirical test of a maximum likelihood approach to using relevance data for training information retrieval parameters. Discusses similarities to language models; the unification of document-oriented and query-oriented views; tests on data sets; algorithms and scalability; and the effectiveness of maximum likelihood…

Discusses genetic algorithms in information retrieval, especially for relevance feedback, and evaluates the efficacy of a genetic algorithm with various order-based fitness functions for relevance feedback in a test database. Compares results with the Ide dec-hi method, one of the best traditional methods. (Contains 56 references.) (Author/LRW)

Presents several alternatives to customary algorithms for whole number arithmetic. Includes a brief history of each algorithm and discusses why each might be useful for particular kinds of children. (KHR)

Compares the performance of inverted and signature file organizations in handling incrementally specified Boolean queries to an information retrieval system. The discussion covers the impact of more sophisticated signature file organizations, related problems, and possible future work. (65 references) (CLB)

Describes a prototype system for interactive knowledge-based indexing of the medical literature. Topics covered include current indexing practice; knowledge-based systems using frames; various types of assistance provided by the prototype system; and current research activities and plans for the development of the system. (17 references) (CLB)

L. A. Goodman's loglinear formulation for bi-way contingency tables is extended to tables with or without missing cells and is used for exploratory purposes. Three-way tables and generalizations of correspondence analysis are deduced, and a generalized version of Goodman's algorithm is used to estimate scores in all cases. (Author/TJH)

Describes exploratory experiments in evaluating and improving a thesaurus through studying its effect on retrieval. A formula was developed to measure the conceptual distance between queries and documents encoded as sets of thesaurus terms. Comparison to the performance of people judging conceptual distance shows that the formula accurately…

A Monte Carlo simulation and applications to eight sets of proximity data are presented to support the practical utility of a network scaling algorithm (NETSCAL)--NETwork SCALing. The algorithm determines which vertices within a network are directly connected by an arc and estimates the length of each arc. (TJH)

It is shown that Bayesian algorithms are computationally simpler in frequency formats than in the probability formats used in previous research. Analysis of several thousand solutions to Bayesian problems showed that when information was presented in frequency formats, statistically naive participants derived up to 50% of inferences by Bayesian…