The computer-based system for routing school buses in rural areas which is discussed minimizes both transportation costs and the average student ride time. Route generation methodology is described and a flowchart of the algorithm is included. (Author/JJD)

Presents both logical and empirical evidence to illustrate that the conventional scoring algorithm for ranking tasks significantly underestimates the initial level of group ability and that Slevin's alternative scoring algorithm significantly overestimates the initial level of ability. Presents a modification of Slevin's algorithm which authors…

The author promotes an earlier introduction of decimals than is currently standard practice in most elementary mathematics programs. Suggested activities and related skills are reviewed. (MP)

Identifies and describes the differences in the problem-solving methods used by faculty teaching introductory chemistry and students enrolled in an introductory chemistry course. Results indicate that students correctly solve algorithmic-mode problems more frequently. Contains 33 references. (DDR)

Presents a computational framework for modeling cognitive development that provides a language paradigm with which to compare and contrast different facets of children's knowledge. Describes the generative connectionist algorithm "cascade-correlation," the successful use of the algorithm to model cognitive development in various…

Presents a scenario in which two people solve a programming problem by discussing various number sequences and functions. The problem is redefined as one related to number theory and operations research. (DDR)

Provides pathological examples for which graphing calculators sometimes give surprising, misleading, or incorrect results. Investigates some of the more interesting of these examples encountered while using the TI-85 in a variety of undergraduate courses including calculus and matrix theory. (DDR)

Presented is a method where a quadratic equation is solved and from its roots the eigenvalues and corresponding eigenvectors are determined immediately. Included are the proposition, the procedure, and comments. (KR)

Described is computational geometry which used concepts and results from classical geometry, topology, combinatorics, as well as standard algorithmic techniques such as sorting and searching, graph manipulations, and linear programing. Also included are special techniques and paradigms. (KR)

Investigates children's behaviors and conceptual achievements in the transition from informal calculation strategies to a written division algorithm. Describes five different strategies observed in the solution of division problems. Discusses the implications of the children's behavior. (YP)

Described is a computer algorithm for obtaining the coordinates of vertices, chord factors, and dihedral angles for plotting orthographic and axonometric projections, and for tabulating chord lengths and dihedral angles. (Author)

Type I error rates of F. M. Lord's chi square test for differential item functioning were investigated using Monte Carlo simulations with marginal maximum likelihood estimation and marginal Bayesian estimation algorithms. Lord's chi square did not provide useful Type I error control for the three-parameter logistic model at these sample sizes.…

Presents the algorithm to approximate square roots as reproduced from the 1579 edition of an algebra book by Rafael Bombelli. The sequence of activities illustrates that the process of understanding an original source of mathematics, first at the algorithmic level and then with respect to its mathematical validity in modern terms, can be an…

Describes the history and development of the algorithm that was used to produce a union list of monographs for ALEPH (Automated Library Expandable Program Hebrew University), Israel's research library network. The literature on merging online records is reviewed, case studies are examined, and problems with matching and merging online…

Estimating item parameters from a two-parameter normal ogive model is considered using Gibbs sampling to simulate draws from the joint posterior distribution of ability and item parameters. The method gives marginal posterior density estimates for any parameter of interest, as illustrated using data from a 33-item mathematics placement…