This study assessed the extent to which procedurally proficient children (N=34) construct the part/whole logical structure that underlies the borrowing algorithm in subtraction. Results indicate that an understanding of the part/whole logic of number may be necessary to understand place value and borrowing. (TJH)

Covariance structures associated with linear structural equation models are discussed. Algorithms for computing maximum likelihood estimates (namely, the EM algorithm) are reviewed. An example of using likelihood ratio tests based on complete and incomplete data to improve the fit of a model is given. (SLD)

Discusses problems associated with teaching non-recursive binary searching in computer language classes, and describes a teacher-directed dialog based on dictionary use that helps students use their previous searching experiences to conceptualize the binary search process. Algorithmic development is discussed and appropriate classroom discussion…

Describes an algorithm for computer generation of hierarchical indexes for document collections. The resulting index, when presented with a graphical interface, provides users with a view of a document collection that permits general browsing and informal search activities via an access method that requires no keyboard entry or prior knowledge of…

Presents cooperative computing activities in which each student plays the role of a switch or processor and acts out algorithms. Includes binary counting, finding the smallest card in a deck, sorting by selection and merging, adding and multiplying large numbers, and sieving for primes. (16 references) (Author/MKR)

Discusses using what students already know about taking away objects when teaching subtraction and gives six lessons to develop language for discussing and recording subtraction situations that give meaning to the subtraction algorithm. (MKR)

This paper addresses the problem of data management techniques for efficiently retrieving requested subsets of large data sets from mass storage devices. Describes the development of algorithms and software that facilitate the partitioning of a large data set into multiple "clusters" that reflect their expected access. (Author/JKP)

An extension is proposed for the network algorithm introduced by C.R. Mehta and N.R. Patel to construct exact tail probabilities for testing the general hypothesis that item responses are distributed according to the Rasch model. A simulation study indicates the efficiency of the algorithm. (SLD)

Derivations of several item selection algorithms for use in fitting test items to target information functions (IFs) are described. These algorithms, which use an average growth approximation of target IFs, were tested by generating six test forms and were found to provide reliable fit. (SLD)

To assess whether movement artifacts reported in visual inspection time (IT) tasks were under metacognitive control, 29 young adults in Edinburgh (Scotland) were tested on a dual-task paradigm in which IT was conducted along with a concurrent task. Reports of movement artifacts are not usually examples of metacognitive processing. (SLD)

Describes animation algorithms for creating smooth functions of time- and space-varying phenomenon. The incidence of the disease mumps from 1968-88 in the United States is used to demonstrate the algorithms. Figures that illustrate the findings are included. (14 references) (KRN)

It is proposed that algorithms and heuristics are useful in improving professional problem-solving abilities when contextualized within the academic discipline. A basic algorithm applied to problem solving in undergraduate engineering education and a similar algorithm applicable to legal problems are used as examples. Problem complexity and…

The four-color theorem stating that any map in a plane can be colored using no more than four colors represents a problem suitable for the liberal arts student. Presented is an algorithm for coloring familiar maps through the temporary removal of states bordering three or fewer states. (MDH)

Combining Rasch and latent class models is presented as a way to overcome deficiencies and retain the positive features of both. An estimation algorithm is outlined, providing conditional maximum likelihood estimates of item parameters for each class. The model is illustrated with simulated data and real data (n=869 adults). (SLD)

This study examined the application of the marginal maximum likelihood-EM algorithm to the parameter estimation problems of the normal ogive and logistic polytomous response models for Likert-type items. A rating scale model, based on F. Samejima's (1969) graded response model, was developed. (TJH)