NotesFAQContact Us
Collection
Advanced
Search Tips
What Works Clearinghouse Rating
Showing 2,041 to 2,055 of 2,728 results Save | Export
Morris, John D. – 1986
An empirical method called Predicted Error Sum of Squares (PRESS) is advanced and studied. This method is used to examine the cross-validated prediction accuracies of some popular algorithms for weighted predictor variables. The weighting methods that were considered were ordinary least squares, ridge regression, regression on principal…
Descriptors: Algorithms, Least Squares Statistics, Measurement Techniques, Minicomputers
Butler, Ronald W. – 1985
The dynamic linear model or Kalman filtering model provides a useful methodology for predicting the past, present, and future states of a dynamic system, such as an object in motion or an economic or social indicator that is changing systematically with time. Recursive likelihood methods for adaptive Kalman filtering and smoothing are developed.…
Descriptors: Algorithms, Estimation (Mathematics), Mathematical Models, Maximum Likelihood Statistics
Urry, Vern W. – 1983
In this report, selection theory is used as a theoretical framework from which mathematical algorithms for tailored testing are derived. The process of tailored, or adaptive, testing is presented as analogous to personnel selection and rejection on a series of continuous variables that are related to ability. Proceeding from a single common-factor…
Descriptors: Adaptive Testing, Algorithms, Computer Assisted Testing, Latent Trait Theory
van der Burg, Eeke; de Leeuw, Jan – 1988
A non-linear version of redundancy analysis is introduced. The technique is called REDUNDALS. It is implemented within the computer program for canonical correlation analysis called CANALS. The REDUNDALS algorithm is of an alternating least square (ALS) type. The technique is defined as minimization of a squared distance between criterion…
Descriptors: Algorithms, Attitude Measures, Computer Oriented Programs, Correlation
van der Linden, Wim J.; Boekkooi-Timminga, Ellen – 1987
A "maximin" model for item response theory based test design is proposed. In this model only the relative shape of the target test information function is specified. It serves as a constraint subject to which a linear programming algorithm maximizes the information in the test. In the practice of test construction there may be several…
Descriptors: Algorithms, Foreign Countries, Item Banks, Latent Trait Theory
Knol, Dirk L. – 1989
Two iterative procedures for constructing Rasch scales are presented. A log-likelihood ratio test based on a quasi-loglinear formulation of the Rasch model is given by which one item at a time can be deleted from or added to an initial item set. In the so-called "top-down" algorithm, items are stepwise deleted from a relatively large…
Descriptors: Algorithms, Item Banks, Latent Trait Theory, Mathematical Models
Dennis, Sue Shirah – 1984
Use of low-stress algorithms to reduce the cognitive load on students is advocated. The low-stress algorithm for addition developed by Hutchings is detailed first. Then a variation on the usual algorithm is proposed: adding from left to right, writing the partial sum for each stage. Next, a "quick addition" method for adding fractions proposed by…
Descriptors: Addition, Algorithms, Cognitive Processes, Computation
Peer reviewed Peer reviewed
Folsom, Mary – National Council of Teachers of Mathematics Yearbook, 1975
Instruction on properties of whole numbers, the meanings of operations on whole numbers, symbolic representation and algorithms for completing these operations is discussed. Many activities appropriate to each of these topics, and suitable for primary school children, are presented. (SD)
Descriptors: Algorithms, Curriculum, Elementary Education, Elementary School Mathematics
Holland, V. Melissa; Rose, Andrew – 1981
Complex conditional instructions ("if X, then do Y") are prevalent in public documents, where they typically appear in prose form. Results of two previous studies have shown that conditional instructions become very difficult to process as the structure becomes more complex. A study was designed to investigate whether this difficulty can…
Descriptors: Algorithms, College Students, Comparative Analysis, Government Publications
Grimm, C. A. – 1978
This document contains two units that examine integral transforms and series expansions. In the first module, the user is expected to learn how to use the unified method presented to obtain Laplace transforms, Fourier transforms, complex Fourier series, real Fourier series, and half-range sine series for given piecewise continuous functions. In…
Descriptors: Algorithms, Answer Keys, College Mathematics, Higher Education
Dugdale, Sharon – 1981
This paper outlines the development of an activity that uses the computer's unique capabilities to provide students with a meaningful and highly motivating experience with the graphing of equations. The basic design of the game calls for the computer to display a coordinate grid on which it graphs any equations that are typed in by the student.…
Descriptors: Algebra, Algorithms, Computer Assisted Instruction, Computer Graphics
Birenbaum, Menucha; Tatsuoka, Kikumi K. – 1981
Error analysis performed on data sets revealed that seventh grade students used a variety of rules of operation for solving the signed-number arithmetic problems. The data sets were obtained from an experimental study in which students were randomly assigned to study either of two lessons written on a computer based education system. The two…
Descriptors: Algorithms, Arithmetic, Cognitive Processes, Computer Assisted Instruction
Bliss, Leonard B. – 1981
The aim of this study was to show that the superiority of corrected-for-guessing scores over number right scores as true score estimates depends on the ability of examinees to recognize situations where they can eliminate one or more alternatives as incorrect and to omit items where they would only be guessing randomly. Previous investigations…
Descriptors: Algorithms, Guessing (Tests), Intermediate Grades, Multiple Choice Tests
Weaver, J. F. – 1977
The calculator is used to investigate properties and characteristics of certain unary operations. These include how a number is related to the number resulting from a unary operation and the result of two unary operations. A discussion of the calculator algorithm to accomplish a series of unary operations is given. Record sheets to summarize…
Descriptors: Algorithms, Calculators, Computation, Discovery Learning
Hayworth, Don – 1978
The total system capability, including all the special purpose and general purpose hardware comprising the Airborne Electro-Optical Sensor Simulation (AEOSS) System, is described. The functional relationship between hardware portions is described together with interface to the software portion of the computer image generation. Supporting rationale…
Descriptors: Algorithms, Computer Assisted Instruction, Computer Programs, Databases
Pages: 1  |  ...  |  133  |  134  |  135  |  136  |  137  |  138  |  139  |  140  |  141  |  ...  |  182