Describes strategies for teaching elementary students to solve a multiplication problem using the lattice method. (JOW)

"The Handbook of Latent Semantic Analysis" is the authoritative reference for the theory behind Latent Semantic Analysis (LSA), a burgeoning mathematical method used to analyze how words make meaning, with the desired outcome to program machines to understand human commands via natural language rather than strict programming protocols.…

An approximation to the likelihood for the generalized linear models with random coefficients is derived and is the basis for an approximate Fisher scoring algorithm. The method is illustrated on the logistic regression model for one-way classification, but it has an extension to the class of generalized linear models and to more complex data…

Among the computer-based methods used for the construction of trees such as AID, THAID, CART, and FACT, the only one that uses an algorithm that first grows a tree and then prunes the tree is CART. The pruning component of CART is analogous in spirit to the backward elimination approach in regression analysis. This idea provides a tool in…

A modified technique of separable programming was used to maximize the squared correlation ratio of weighted responses to partially ordered categories. The technique employs a polygonal approximation to each single-variable function by choosing mesh points around the initial approximation supplied by Nishisato's method. Numerical examples were…

A generalized matrix procedure is developed for computing the proportionate contribution of a factor, either orthogonal or oblique, to the total common variance of a factor solution. (Author)

In analyzing exploratory repeated measures data with more than two measures, two competing tests must be administered simultaneously if one is to make an efficient and effective decision regarding the tenability of the null hypothesis of no differences among measurement means. Obviously, such a procedure is not without a cost vis-a-vis Type I…

A clustering algorithm which is tree-like in structure, and is based on user queries, is presented. It is compared to some existing algorithms and is found to be superior. (Author)

An algorithmic language (ALGAMS) was proposed by the group on programing automation for medium type machines. The language is a subset of ALGOL-60. The paper discusses the syntax and semantics of ALGAMS. (Author/GO)

Most optimization problems of any degree of complexity must be solved using a computer. In the teaching of dynamic programing courses, it is often desirable to use a computer in problem solution. The solution process involves conceptual formulation and computational Solution. Generalized computer codes for dynamic programing problem solution…

Pitch-synchronous, time-domain operation on digitized waveforms of human speech produces artificial changes in prosodic parameters, especially fundamental frequency and rhythm. Pitch of voiced segments is raised or lowered by an algorithm which truncates or "pads," respectively, each pitch period in the stored vector by an appropriate…

This study has investigated some pattern recognition capabilities of devices consisting of arrays of cooperating elements acting in parallel. The problem of recognizing straight lines in general position on the quadratic lattice has been completely solved by applying parallel acting algorithms to a special code for lines on the lattice. The…

Six control structures are used in teaching a college Fortran programing course: (1) simple sequences of instruction without any control statement, (2) IF-THEN selection, (3) IF-THEN-ELSE selection, (4) definite loop, (5) indefinite loop, and (6) generalized IF-THEN-ELSE case structure. Outlines, instead of flowcharts, are employed for algorithm…