A new method to estimate the parameters of Tucker's three mode principal component model is discussed, and the convergence properties of the alternating least squares algorithm to solve the estimation problem are considered. An example is presented. (Author/JKS)

A new computing algorithm, MAPCLUS (Mathematical Programming Clustering), for fitting the Shephard-Arabie ADCLUS (Additive Clustering) model is presented. Details and benefits of the algorithm are discussed. (Author/JKS)

A generalized method of synthetic division where the divisor polynomial may be of any degree equal to or larger than 1, and the dividend polynomial may be of equal or larger degree than the divisor polynomial and a generalization of the familiar remainder theorem, are presented. (Author/MK)

Surveys the current state of minicomputer-operated information systems capable of incorporating linguistic features, focusing on the Minicomputer Operated Retrieval (Partially Heuristic) System. Consideration is given to the automation of the indexing process and to available search strategies. (FM)

Two algorithms are developed for finding the square roots of numbers. One is based on the rule that x square is the sum of the first x odd numbers; the other is algebraic. (MP)

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)