Presents a coordination level matching algorithm to be used in document retrieval systems that incorporate relevance feedback strategies. It is argued that this algorithm may eliminate the need for the frequent reevaluation of documents that is currently found in such systems, and conditions under which reranking is unnecessary are given.…

Ways to combine the strengths of teacher and computer are suggested. Multiplication concepts and an algorithm for multiplication are taught in the same lessons. The computer is used as an electronic chalkboard to teach at a semiconcrete level. The computer program is included. (MNS)

Describes the three subsystems of an information retrieval system (document descriptions, queries, and matching algorithms) and argues that the interdependency of these subsystems requires adaptation for the system to perform when any component changes. An algorithm for redescribing documents, in response to changes in queries and retrieval rules,…

Defines one approach to problem solving in terms of student use of algorithms to find their solutions and gives examples. Discusses how problems and algorithms relate to each other. Describes strategies for teaching problem solving using algorithms. (CW)

In a large-scale field experiment aimed at improving spelling instruction in Dutch schools, the effectiveness of a newly developed algorithmic teaching method was compared with the conventionally and commonly used analogy approach. The analogy group showed comparatively little progress in learning results. (Seventy-five test items are appended).…

Describes a research project designed to monitor the transition from work based on concrete materials to the more formalized aspect of mathematics found in secondary schools. The topic of subtraction was chosen by three teachers who were involved in the investigation. (PK)

The development of computer-assisted and computer-managed instruction for handicapped students involves a number of instructional design issues requiring research. Discussed are algorithmic and heuristic procedures, individual rate of learning, feedback, and instructional task hierarchies.(Author/DB)

A modern adaptation of the historic lattice algorithm which can be used for multiplication and division is discussed. How it works is clearly illustrated. (MNS)

A serious drawback in introducing sound into computer programs for teaching foreign language speech has been the lack of an algorithm to turn off the cassette recorder immediately to keep screen text and audio in synchronization. This article describes a program which solves that problem. (SED)

Considers possibility of developing a computer tutor around an explicit concept-learning theory derived from machine learning techniques. Some problems with using the focusing (and similar) algorithms in this role are discussed and possible solutions are developed. Design for a guided discovery learning system for tutoring concepts is proposed.…

Describes basic structure of a framegame, Chain Gang, in which self-instructional modules teach a cognitive skill. Procedures are presented for loading new content into the game's basic framework to teach algorithms or heuristics and for game modification to suit different situations. Handouts used in the basic game are appended. (MBR)

Discusses ways to integrate computers into mathematically oriented classes effectively so that advantages are obtained without increasing detrimental effects. Three sections detail use of computers as experimental tools, to implement and understand algorithms, and to solve realistic size problems. These ideas are illustrated with examples from a…

Analytical methods for facilitating comparison of multiple sets during online searching are illustrated by description of specific searching methods that eliminate duplicate citations and a factoring procedure based on syntactic relationships that establishes ranked sets. Searches executed in National Center for Mental Health database on…

Describes eight increasingly sophisticated and efficient sorting algorithms including linear insertion, binary insertion, shellsort, bubble exchange, shakersort, quick sort, straight selection, and tree selection. Provides challenges for the reader and the student to program these efficiently. (JM)

Presents a computational method based on a Monte Carlo generation of a large number of chemical reactions. The reactions are allowed to proceed on the basis of relative probabilities. (MLH)