Studies the relationship between Eulerian and Lagrangian coordinate systems with the help of computer plots of variables such as density and particle displacement. Gives examples which illustrate the differences in the shape of a traveling wave as seen by observers in the two systems. (Author/GA)

Topics covered include alternate methods for finding LCM and GCF, imaginative word problems, and a primes-breakdown method of factoring quadratics. (MP)

The focus is upon the introduction of multiplication within the framework of an algorithm program. Analysis of some observations of student solutions to multiplication problems is included. (MN)

Upper elementary school students created their own algorithms for finding products of whole numbers. The algorithms were similar to familiar ones for finding products involving 9 and 11. (SD)

An algorithm and sequence which utilizes arrays of entities is proposed for explaining the division of two fractions. (MN)

An asymptotic theory is developed for a new time series model introduced in TM 502 289. An algorithm for computing estimates of the parameters of this time series model is given, and it is shown that these estimators are asymptotically efficient in that they have the same asymptotic distribution as the maximum likelihood estimators. (Author/RC)

This paper presents an algorithm for determining the number of items to measure each objective in a criterion-referenced test when testing time is fixed and when the objectives vary in their levels of importance, reliability, and validity. Results of four special applications of the algorithm are presented. (BS)

Discusses various strategies for assessing importance of journals for acquisition; describes a discipline-specific selection algorithm which uses journal citation data to identify journals that contribute to a discipline's research foundation as well as those used for professional practice; and reports on two studies which demonstrated the…

Explains an algorithm which details procedures for solving a broad class of genetics problems common to pre-college biology. Several flow charts (developed from the algorithm) are given with sample questions and suggestions for student use. Conclusions are based on the authors' research (which includes student interviews and textbook analyses).…

Renaming fractions with the dot method is described with illustrations. It can be used to introduce renaming at the manipulative level in a meaningful way prior to moving to a more abstract level where prime factorization will be involved. (MNS)

This personal reaction to Cummings'"Comparison of Three Algorithms for Analyzing Questionnaire-Type Needs Assessment Data to Establish Need Priorities" specifically questions Cummings' use of the Mean Difference Analysis for comparison with Weighted Needs Index, and his focus on characteristics of the statistic that are of secondary…

Presents algorithms for the simulation and motion display of the three basic kinematic devices: (1) four bar linkages; (2) the slider crank; and (3) the inverted slider crank mechanisms. The algorithms were implemented on a Commodore-VIC 20 microcomputer system with 6500 bytes of available memory. (Author/JN)

Sex differences in speed of solving mental rotation problems were replicated but college men and women were alike in frequency of use of algorithms to solve problems. The most frequent algorithm involved encoding stimuli in working memory, mental rotation of one to orientation of the other, comparison, and response. (Author/RD)

This article presents a new method of inferring students' cognitive structures and their development. A modification of Reitman and Rueter's "ordered tree technique," the method generates a structure that displays important relationships assumed to be in a student's memory about concepts taken from a specific field of study. (Author/LMO)

A latent class model for handling the items in Birenbaum and Tatsuoka's study is described. A method to derive the optimal scoring rule when multiple choice test items are used is illustrated. Remedial training begins after a determination is made as to which of several erroneous algorithms is being used. (Author/DWH)