NotesFAQContact Us
Collection
Advanced
Search Tips
Laws, Policies, & Programs
What Works Clearinghouse Rating
Showing 91 to 105 of 220 results Save | Export
Peer reviewed Peer reviewed
And Others; Takane, Yoshio – Psychometrika, 1980
An individual differences additive model is discussed which represents individual differences in additivity by differential weighting or additive factors. A procedure for estimating model parameters for various data measurement characteristics is developed. The method is found to be very useful in describing certain types of developmental change…
Descriptors: Algorithms, Data Analysis, Least Squares Statistics, Mathematical Models
Peer reviewed Peer reviewed
Hayden, F. Gregory – Journal of Education Finance, 1980
By algebraically defining a school finance structure as a total budget system, partial derivatives can be used to find the kinds of rewards, incentives, and distributions the structure defines for individual districts and among districts. Equity concerns can also be answered. (Author/IRT)
Descriptors: Algorithms, Elementary Secondary Education, Equalization Aid, Mathematical Formulas
Peer reviewed Peer reviewed
Book, Ronald V. – American Mathematical Monthly, 1988
The "word problem" is stated for a given collection. Facts regarding Dehn's Algorithm, definition of Thue systems, a rewriting system, lemmas and corollaries are provided. The situation is examined where the monoid presented by a finite Thue system is a group. (DC)
Descriptors: Abstract Reasoning, Algebra, Algorithms, College Mathematics
Peer reviewed Peer reviewed
Jedidi, Kamel; DeSarbo, Wayne S. – Psychometrika, 1991
A stochastic multidimensional scaling procedure is presented for analysis of three-mode, three-way pick any/"J" data. The procedure fits both vector and ideal-point models and characterizes the effect of situations by a set of dimension weights. An application in the area of consumer psychology is discussed. (SLD)
Descriptors: Algorithms, Consumer Economics, Equations (Mathematics), Estimation (Mathematics)
Peer reviewed Peer reviewed
Muraki, Eiji – Applied Psychological Measurement, 1992
The partial credit model with a varying slope parameter is developed and called the generalized partial credit model (GPCM). Analysis results for simulated data by this and other polytomous item-response models demonstrate that the rating formulation of the GPCM is adaptable to the analysis of polytomous item responses. (SLD)
Descriptors: Algorithms, Equations (Mathematics), Generalization, Item Response Theory
Gross, Alan L.; And Others – 1993
A statistical model for investigating predictive validity at highly selective institutions is described. When the selection ratio is small, one must typically deal with a data set containing relatively large amounts of missing data on both criterion and predictor variables. Standard statistical approaches are based on the strong assumption that…
Descriptors: Admission (School), Algorithms, Competitive Selection, Higher Education
Tsutakawa, Robert K.; Lin, Hsin Ying – 1984
Item response curves for a set of binary responses are studied from a Bayesian viewpoint of estimating the item parameters. For the two-parameter logistic model with normally distributed ability, restricted bivariate beta priors are used to illustrate the computation of the posterior mode via the EM algorithm. The procedure is illustrated by data…
Descriptors: Algorithms, Bayesian Statistics, College Entrance Examinations, Estimation (Mathematics)
Peer reviewed Peer reviewed
Schonemann, Peter H.; And Others – Multivariate Behavioral Research, 1975
Descriptors: Algorithms, Data Analysis, Dimensional Preference, Individual Differences
BOYER, ROSCOE A. – 1961
A PROGRAM THAT WOULD DEVISE OPTIMAL ROUTES FOR SCHOOL BUSES WAS DEVELOPED. ONE OF THE TWO MODELS DEVELOPED FOR THIS STUDY, CALLED THE HEURISTIC MODEL, WAS A HAND PROCEDURE BASED ON THE ASSUMPTION THAT, IN AN EFFICIENT SCHOOL BUS SYSTEM, STUDENT MILES SHOULD BE MINIMIZED RATHER THAN BUS MILES. THE OTHER MODEL WAS DESIGNED TO BE USED WITH HIGH SPEED…
Descriptors: Algorithms, Bus Transportation, Mathematical Applications, Mathematical Models
Hayes-Roth, Frederick – 1977
This paper is a theoretical discussion of several functions of knowledge systems based on the idea of partial matching, that is, comparison of two or more descriptions by identification of their similarities. Several knowledge system functions are described in terms of partial or best matchings including analogical reasoning, inductive inference,…
Descriptors: Abstract Reasoning, Algorithms, Educational Research, Learning
Belgard, Maria R.; Min, Leo Yoon-Gee – 1971
An operations research method to optimize the teaching-learning process is introduced in this paper. In particular, a linear programing model is proposed which, unlike dynamic or control theory models, allows the computer to react to the responses of a learner in seconds or less. To satisfy the assumptions of linearity, the seemingly complicated…
Descriptors: Algorithms, Decision Making, Digital Computers, Education
Woods, W. A. – 1969
The augmented transition network described in this report was developed in the course of work in semantic interpretation in the context of a computer system which answers English questions. In order to provide mechanical input for the semantic interpreter, a parsing program based on the notion of a "recursive transition network grammar" was…
Descriptors: Algorithms, Computational Linguistics, Context Free Grammar, Grammar
Stanford Univ., CA. School Mathematics Study Group. – 1971
This is the second unit in a series of 14 SMSG texts designed to cover mathematical concepts which the general population should know. One chapter of the unit discusses algorithms, flow charts, and computers; the second chapter tackles problem formulation procedures (not actual problem solving) and briefly covers mathematical models. For a special…
Descriptors: Algorithms, Curriculum, Flow Charts, Instruction
Peer reviewed Peer reviewed
Crouch, Carolyn J. – Information Processing and Management, 1988
Describes the two basic approaches to the calculation of term discrimination values for automatic indexing. The results of an experiment that investigated the differences between algorithms of these two approaches in terms of their impact on the discrimination value model are reported and discussed. (13 references) (Author/CLB)
Descriptors: Algorithms, Automatic Indexing, Comparative Analysis, Computational Linguistics
Peer reviewed Peer reviewed
de Leeuw, Jan; Verhelst, Norman – Journal of Educational Statistics, 1986
Maximum likelihood procedures are presented for a general model to unify the various models and techniques that have been proposed for item analysis. Unconditional maximum likelihood estimation, proposed by Wright and Haberman, and conditional maximum likelihood estimation, proposed by Rasch and Andersen, are shown as important special cases. (JAZ)
Descriptors: Algorithms, Estimation (Mathematics), Item Analysis, Latent Trait Theory
Pages: 1  |  2  |  3  |  4  |  5  |  6  |  7  |  8  |  9  |  10  |  11  |  ...  |  15