Publication Date
| In 2026 | 0 |
| Since 2025 | 178 |
| Since 2022 (last 5 years) | 858 |
| Since 2017 (last 10 years) | 905 |
| Since 2007 (last 20 years) | 911 |
Descriptor
Source
Author
| van der Linden, Wim J. | 17 |
| Kiers, Henk A. L. | 13 |
| ten Berge, Jos M. F. | 10 |
| Gongjun Xu | 9 |
| Gerlach, Vernon S. | 8 |
| Willett, Peter | 8 |
| Chun Wang | 7 |
| Stocking, Martha L. | 7 |
| Charp, Sylvia | 6 |
| Chen, Hsinchun | 6 |
| Craven, Timothy C. | 6 |
| More ▼ | |
Publication Type
Education Level
Audience
| Practitioners | 256 |
| Teachers | 128 |
| Researchers | 116 |
| Policymakers | 7 |
| Administrators | 5 |
| Students | 5 |
| Counselors | 1 |
| Media Staff | 1 |
| Support Staff | 1 |
Location
| China | 23 |
| Australia | 18 |
| Turkey | 16 |
| Netherlands | 14 |
| United States | 11 |
| USSR | 10 |
| California | 8 |
| Canada | 8 |
| Europe | 8 |
| Germany | 7 |
| South Korea | 7 |
| More ▼ | |
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Peer reviewedSpiegler, Israel; Elata, Smadar – Information Processing and Management, 1988
Presents a model for the a priori analysis of natural language queries which uses an algorithm to transform the query into a logical pattern that is used to determine the answerability of the query. The results of testing by a prototype system implemented in PROLOG are discussed. (20 references) (CLB)
Descriptors: Algorithms, Computational Linguistics, Databases, Information Retrieval
Peer reviewedNakkouzi, Ziad S.; Eastman, Caroline M. – Journal of the American Society for Information Science, 1990
Discusses the problems caused for both users and systems by queries containing negation, and presents an algorithm for transforming Boolean queries with negated terms into queries without negation using a hierarchical thesaurus. A set of user requests submitted to an academic library are also examined to determine the pattern and frequency of use…
Descriptors: Academic Libraries, Algorithms, Behavior Patterns, Higher Education
Peer reviewedBook, 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 reviewedPollak, Henry – Australian Mathematics Teacher, 1989
Possible ways of mechanization for counting using a binary system are discussed. Shows a binary representation of the numbers and geometric models having eight triples of lamps. Provides three problem sets. (YP)
Descriptors: Algorithms, Computation, Geometric Constructions, Geometry
Peer reviewedBurge, Cecil D. – Electronic Library, 1989
Describes the software architecture and application of SABRE (Semi-Automated Bibliographic Environment), which is one of the first products to provide a semi-automatic environment for relevancy ranking of citations obtained from searches of bibliographic databases. Features designed to meet the review, categorization, culling, and reporting needs…
Descriptors: Algorithms, Automation, Bibliographic Databases, Bibliographic Records
Peer reviewedvan der Burg, Eeke; de Leeuw, Jan – Psychometrika, 1988
Homogeneity analysis (multiple correspondence analysis), which is usually applied to "k" separate variables, was applied to sets of variables by using sums within sets. The resulting technique, OVERALS, uses optimal scaling. The corresponding OVERALS computer program minimizes a least squares loss function via an alternating least…
Descriptors: Algorithms, Factor Analysis, Least Squares Statistics, Multidimensional Scaling
Peer reviewedYannakoudakis, Emmanuel J.; Attar-Bashi, Hussain A. – Journal of Documentation, 1989
Describes a model that displays structures necessary to map between the conceptual and external levels in database management systems, using an algorithm that maps the syntactic representations of tuples onto semantic representations. A technique for translating tuples into natural language sentences is introduced, and a system implemented in…
Descriptors: Algorithms, Computational Linguistics, Connected Discourse, Database Management Systems
Peer reviewedHarwell, Michael R.; And Others – Journal of Educational Statistics, 1988
The Bock and Aitkin Marginal Maximum Likelihood/EM (MML/EM) approach to item parameter estimation is an alternative to the classical joint maximum likelihood procedure of item response theory. This paper provides the essential mathematical details of a MML/EM solution and shows its use in obtaining consistent item parameter estimates. (TJH)
Descriptors: Algorithms, Computer Software, Equations (Mathematics), Estimation (Mathematics)
Peer reviewedGutstein, Eric; Romberg, Thomas A. – Journal of Mathematical Behavior, 1995
Reviews research using diagrams, number sentences, and algorithms to help students learn to add and subtract; poses questions on the relationship of instruction to children's knowledge construction; and proposes a research agenda in this area. (86 references) (MKR)
Descriptors: Addition, Algorithms, Arithmetic, Cognitive Processes
Peer reviewedYoung, Martin R.; DeSarbo, Wayne S. – Psychometrika, 1995
A new parametric maximum likelihood procedure is proposed for estimating ultrametric trees for the analysis of conditional rank order proximity data. Technical aspects of the model and the estimation algorithm are discussed, and Monte Carlo results illustrate its application. A consumer psychology application is also examined. (SLD)
Descriptors: Algorithms, Consumer Economics, Estimation (Mathematics), Maximum Likelihood Statistics
Yelon, Stephen – Performance and Instruction, 1992
Guidelines for the integration of effective and efficient practice into the lecture format of higher education curricula are outlined and discussed. An algorithm for incorporating active learning into lecture courses is provided, with examples and discussion of possible constraints. (four references) (EA)
Descriptors: Algorithms, Experiential Learning, Flow Charts, Guidelines
Peer reviewedBookstein, Abraham; And Others – Information Processing and Management, 1992
Discusses the problems of compressing a large textual database for storage on CD-ROM. A text-compression algorithm is presented, new algorithms for compression of indices are described, and the ARTFL (American and French Research on the Treasury of the French Language) database is used as an example. (14 references) (LRW)
Descriptors: Algorithms, Coding, Full Text Databases, Indexes
Peer reviewedLeinonen, Lea; And Others – Journal of Speech and Hearing Research, 1992
This study analyzed production of a long vowel sound within Finnish words by normal or dysphonic voices, using the Self-Organizing Map, the artificial neural network algorithm of T. Kohonen which produces two-dimensional representations of speech. The method was found to be both sensitive and specific in the detection of dysphonia. (Author/JDD)
Descriptors: Algorithms, Evaluation Methods, Finnish, Maps
Peer reviewedBroekman, Huib J. D. – Information Services and Use, 1993
Discusses effective communication with interactive video and suggests possible barriers. Topics addressed include identifying the user; the need for standards; algorithms; the rapid development of hardware; navigation in interactive media; and interactivity with the user. (LRW)
Descriptors: Algorithms, Communication (Thought Transfer), Hypermedia, Interactive Video
Peer reviewedJedidi, 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)


