NotesFAQContact Us
Collection
Advanced
Search Tips
What Works Clearinghouse Rating
Showing 1,111 to 1,125 of 2,736 results Save | Export
Peer reviewed Peer reviewed
Millman, Jason; Westman, Ronald S. – Journal of Educational Measurement, 1989
Five approaches to writing test items with computer assistance are described. A model of knowledge using a set of structures and a system for implementing the scheme are outlined. The approaches include the author-supplied approach, replacement-set procedures, computer-supplied prototype items, subject-matter mapping, and discourse analysis. (TJH)
Descriptors: Achievement Tests, Algorithms, Computer Assisted Testing, Test Construction
Peer reviewed Peer reviewed
Grotophorst, Clyde W. – Library Software Review, 1988
Describes a system that provides online access to holdings information for more than 4,500 journals on a single self-executing diskette. A brief discussion of data compression is offered, along with program listings in both BASIC and C. (MES)
Descriptors: Algorithms, Computer Software, Information Storage, Library Automation
Peer reviewed Peer reviewed
Kotamarti, Usha; Tharp, Alan L. – Journal of the American Society for Information Science, 1990
Reviews the use of signatures to improve the performance of text searching and considers the use of signature trees to further accelerate text searching. Based on the analysis of experimental results, it is concluded that the improvement in text searching performance using signature trees outweighs the increase in required storage. (12 references)…
Descriptors: Algorithms, Automation, Computer Storage Devices, Cost Effectiveness
Peer reviewed Peer reviewed
Lu, Xin – Information Processing and Management, 1990
Describes the development of a structural model of document retrieval based on lexical-semantic relationships between index terms. An algorithm that uses tree-to-tree distance to measure structural closeness between a document and a query statement is explained, and the proposed model is compared to a vector retrieval model. (18 references) (LRW)
Descriptors: Algorithms, Databases, Distance, Documentation
Peer reviewed Peer reviewed
Adema, Jos J.; van der Linden, Wim J. – Journal of Educational Statistics, 1989
Two zero-one linear programing models for constructing tests using classical item and test parameters are given. These models are useful, for instance, when classical test theory must serve as an interface between an item response theory-based item banking system and a test constructor unfamiliar with the underlying theory. (TJH)
Descriptors: Algorithms, Computer Assisted Testing, Item Banks, Linear Programing
Peer reviewed Peer reviewed
Watters, C. R. – Journal of the American Society for Information Science, 1989
Reviews models currently used to describe the retrieval process and questions whether extensions of traditional approaches can provide mechanisms for expert retrieval systems. An alternative view in which retrieval is based on concept space is presented. A logic framework is used to define a semantic model for using knowledge contained in concept…
Descriptors: Algorithms, Bibliographic Databases, Expert Systems, Information Retrieval
Peer reviewed Peer reviewed
Lee, Sik-Yum; And Others – Psychometrika, 1989
The frequencies of "m" independent "p-way" contingency tables are analyzed by a model that assumes that the ordinal category data in each of "m" groups are generated from a latent continuous multivariate normal distribution. The model permits analysis of several groups of individuals simultaneously. (TJH)
Descriptors: Algorithms, Equations (Mathematics), Mathematical Models, Multivariate Analysis
Peer reviewed Peer reviewed
van der Linden, Wim J.; Boekkooi-Timminga, Ellen – Psychometrika, 1989
A maximin model for test design based on item response theory is proposed. Only the relative shape of target test information function is specified. It serves as a constraint subject to which a linear programing algorithm maximizes the test information. The model is illustrated, and alternative models are discussed. (TJH)
Descriptors: Algorithms, Latent Trait Theory, Linear Programing, Mathematical Models
Peer reviewed Peer reviewed
Tisak, John; Meredith, William – Psychometrika, 1989
A longitudinal factor analysis model that is entirely exploratory is proposed for use with multiple populations. Factorial collapse, period/practice effects, and an invariant and/or stationary factor pattern are allowed. The model is formulated stochastically and implemented via a stage-wise EM algorithm. (TJH)
Descriptors: Algorithms, Factor Analysis, Longitudinal Studies, Maximum Likelihood Statistics
Peer reviewed Peer reviewed
ten Berge, Jos M. F.; Kiers, Henk A. L. – Psychometrika, 1989
The DEDICOM (decomposition into directional components) model provides a framework for analyzing square but asymmetric matrices of directional relationships among "n" objects or persons in terms of a small number of components. One version of DEDICOM ignores the diagonal entries of the matrices. A straightforward computational solution…
Descriptors: Algorithms, Factor Analysis, Goodness of Fit, Least Squares Statistics
Peer reviewed Peer reviewed
Rasmussen, Edie M. – Annual Review of Information Science and Technology (ARIST), 1992
Examines parallel computer architecture and the use of parallel processors for text. Topics discussed include parallel algorithms; performance evaluation; parallel information processing; parallel access methods for text; parallel and distributed information retrieval systems; parallel hardware for text; and network models for information…
Descriptors: Algorithms, Computer Networks, Evaluation Methods, Information Processing
Peer reviewed Peer reviewed
Bartell, Brian T.; And Others – Journal of the American Society for Information Science, 1995
Discussion of the failure of individual keywords to identify conceptual content of documents in retrieval systems highlights Metric Similarity Modeling, a method for creating vector space representation of documents based on modeling target interdocument similarity values. Semantic relatedness, latent semantic indexing, an indexing and retrieval…
Descriptors: Algorithms, Databases, Documentation, Indexing
Peer reviewed Peer reviewed
Akman, K. Ibhrahim – Journal of Information Science, 1995
Describes a new data compression technique that utilizes the common morphological structure of languages. Topics include classification of languages and their morphological structure; structured text compression; the algorithm and an example using Turkish; theoretical implications; and implementation. (LRW)
Descriptors: Algorithms, Language Classification, Mathematical Formulas, Morphology (Languages)
Peer reviewed Peer reviewed
Cohen, Jonathan D.; And Others – Psychological Review, 1990
It is proposed that attributes of automatization depend on the strength of a processing pathway, and that strength increases with training. With the Stroop effect as an example, automatic processes are shown through simulation to be continuous and to emerge gradually with practice. (SLD)
Descriptors: Algorithms, Attention, Cognitive Processes, Learning
Peer reviewed Peer reviewed
Burgin, Robert – Journal of the American Society for Information Science, 1995
Examines the retrieval effectiveness of five hierarchical clustering methods (single link, complete link, group average, Ward's method, and weighted average) as a function of indexing exhaustivity with four test collections. Evaluations of retrieval effectiveness are based on three measures of optimal retrieval performance. (Author/LRW)
Descriptors: Algorithms, Evaluation Methods, Indexing, Information Retrieval
Pages: 1  |  ...  |  71  |  72  |  73  |  74  |  75  |  76  |  77  |  78  |  79  |  ...  |  183