Human behavior shows a variety of serially ordered action sequences. This paper presents a theory of serial order which describes how sequences of actions might be learned and performed. In this theory, parallel interactions across time (coarticulation) and parallel interactions across space (dual-task interference) are viewed as two aspects of a…

Two optimalization models for the construction of tests with a maximal value of coefficient alpha are given. Both models have a linear form and can be solved by using a branch-and-bound algorithm. The first model assumes an item bank calibrated under the Rasch model and can be used, for instance, when classical test theory has to serve as an…

A model and a computer program for performing conjoint measurement is developed. (AG)

This paper describes the method used by Tracz and Burtnyk for the estimation of future salary schedules in the Ontario secondary school system. The application of the algorithm to the Ontario secondary school system predicts a possible breakdown in the fixed step salary schedule at about 1980. This situation results primarily because of the…

Presents a dynamic model of user behavior when scanning an information storage and retrieval system output list, compares rules for determining the user's optimum stopping point, presents an algorithm for implementing the Bayesian model, and discusses implications for retrieval system design. Provided are 13 figures and 15 references. (Author/RBF)

Student weaknesses on problem-solving portions of the NAEP mathematics assessment are discussed using Polya's heuristics as a framework. Recommendations for classroom instruction are discussed. (MP) Aspect of National Assessment (NAEP) dealt with in this document: Results (Interpretation).

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)

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)

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)

In this paper, algorithms are described for obtaining the maximum likelihood estimates of the parameters in log-linear models. Modified versions of the iterative proportional fitting and Newton-Raphson algorithms are described that work on the minimal sufficient statistics rather than on the usual counts in the full contingency table. This is…

The derivation of several item selection algorithms for use in fitting test items to target information functions is described. These algorithms circumvent iterative solutions by using the criteria of moving averages of the distance to a target information function and simultaneously considering an entire range of ability points used to condition…

This simulation study involved the design of two two-stage tests in which the routing tests and the second-stage measurement testlets took the form of a multidimensional knapsack problem with prespecified target informations and constraints to be enumerated using the algorithm of E. Balas. Two conventional tests of similar length to the two-stage…

This guidebook is designed for data analysts who are working with computer data files that contain records with incomplete data. It indicates choices the analyst must make and the criteria for making those choices in regard to the following questions: (1) What resources are available for performing the imputation? (2) How big is the data file? (3)…