The performance of four rules for determining the number of components (factors) to retain (Kaiser's eigenvalue greater than one, Cattell's scree, Bartlett's test, and Velicer's Map) was investigated across four systematically varied factors (sample size, number of variables, number of components, and component saturation). (Author/JKS)

Two algorithms for marginal maximum likelihood estimation for the Rasch model are provided. The more efficient of the two algorithms is extended to estimation for the linear logistic model. Numerical examples of both procedures are presented. (Author/JKS)

Eighteen college students solved addition problems using the Hutchings Low Fatigue Addition Algorithm, which requires a written record of running sums, and the standard algorithm, which does not. Students using the Hutchings algorithm had significantly higher reaction times to a tone, indicating that the Hutchings method requires less cognitive…

Student performance on division exercises in the recent National Assessment of Educational Progress (NAEP) is reviewed. Pupil performance on selected exercises is reported and followed by some suggestions for improvement in the teaching of this skill. (MP) Aspect of National Assessment (NAEP) dealt with in this document: Results (Utilization).

A review of existing techniques for the analysis of three-way data revealed that none were appropriate to the wide variety of data usually encountered in psychological research, and few were capable of both isolating common information and systematically describing individual differences. Such a model is developed and evaluated. (Author/JKS)

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)