A conceptually elementary and geometrically based algorithm is presented to indicate how trigonometric functions can be calculated without using calculus. (MN)

Describes GRANT, an expert system for finding sources of funding given research proposals. The architecture of GRANT and the implementation of constrained spreading activation (a modified search algorithm based on semantic memory) are described, and recall and precision rates are analyzed. (Author/LRW)

Develops a division algorithm in terms of familiar manipulations of concrete objects and presents it with a series of questions for diagnosis of students' understanding of the algorithm in terms of the concrete model utilized. Also offers general guidelines for using concrete illustrations to explain algorithms and other mathematical principles.…

A simple probabilistic model for unfolding data collected by a direct response design in which responses were scored dichotomously was applied to the measurement of attitudes toward capital punishment. Responses conformed to the unfolding mechanism. Scale values of the statements were statistically equivalent to those of Thurstone's methods. (SLD)

Describes the two basic approaches to the calculation of term discrimination values for automatic indexing. The results of an experiment that investigated the differences between algorithms of these two approaches in terms of their impact on the discrimination value model are reported and discussed. (13 references) (Author/CLB)

Describes the Training Effectiveness Algorithm, a systematic procedure for identifying the cause of reported training problems which was developed for use in the U.S. Navy. A two-step review by subject matter experts is explained, and applications of the algorithm to other organizations and training systems are discussed. (Author/LRW)

Describes a five-step set of procedures for designing and developing instruction that promotes student-teacher interaction and teacher responsiveness. The steps described address instructional content, objectives, questions, boundaries, and entry behavior. (MBR)

A program for drawing a line segment is developed. (MNS)

Maximum likelihood procedures are presented for a general model to unify the various models and techniques that have been proposed for item analysis. Unconditional maximum likelihood estimation, proposed by Wright and Haberman, and conditional maximum likelihood estimation, proposed by Rasch and Andersen, are shown as important special cases. (JAZ)

Significant differences were found favoring skill-deficient second-graders (N=10) provided with repeated preteaching trials on a selected component skill of a subtraction algorithm before they worked the entire algorithm over students (N=10) who, from the beginning of training, received systematic instruction on working the entire algorithm.…

Reports on the findings of the Algorithms working group at the Ware, England, conference. Examines methods of introducing the algorithmic approach to mathematics via computer programing and using problems arising from content areas. Considers programing language and presents support for programming in mathematics curricula. (JM)

This article describes a Bayesian framework for estimation in item response models, with two-stage distributions on both item and examinee populations. Strategies for point and interval estimation are discussed, and a general procedure based on the EM algorithm is presented. (Author/LMO)

Investigates applicability of inverted file processing in magnetic bubble memories by presenting four magnetic bubble memory models as storage mediums: one based on a major-minor loop configuration; one utilizing a decoder design on a magnetic bubble memory chip; and two based on different structural configurations of the first two. (MBR)

Suggests a moving pictorial tool to help teach principles in the bubble sort algorithm. Develops such a tool applied to an unsorted list of numbers and describes a method to derive the run time of the algorithm. The method can be modified to run the times of various other algorithms. (JN)

An efficient division algorithm is developed, using a computer program, to convert any positive fraction to its decimal representation. The computer program listing is included. (MNS)