A straightforward procedure for performing weighted-term searches can be programmed quickly and easily, and the same general algorithm can be used for either on-line or batch mode searching. The method can be used to do whole text searches as well as conventional searches for index terms or other descriptors. (5 references) (Author/NH)

Using negative digits in writing numerals and in calculation is explained. This is the second article in the series; for the first, see Vol. 1, No. 7, Nov., 1972, pp. 8-9. (DT)

The present paper discusses two rather different types of partitioning techniques that still have the same property of monotone invariance. (Author)

The intent of this paper is to generalize the min and max clustering procedures in such a way that the assumption of a symmetric similarity measure is unnecessary. (Author)

Paper is an attempt to extend the hierarchical partitioning algorithms and to emphasize a general connection between these clustering procedures and the mathematical theory of lattices. (Author)

A discussion of the various algorithms used for multiplication. Repeated addition, arrays, the distributive law, Egyptian and Russian Peasant Multiplication, Gelosia, Napier's Rods and Genaille's Rods are all described, and examples of multiplying using each method are explained. (DT)

An analysis is made of the extent to which specific division skills are retained from fourth to fifth grade, with results showing a significant loss in ability during the summer. Implications for instruction are included. (DT)

Special issue on translation. (VM)

Reviews current applications and future plans for instructional technology in Hungary, focussing on programed learning--the area which has gotten the greatest attention in that country to date. (LS)

Proper name matching schemes are reviewed and an updated version of these schemes is tested on a suburban telephone book. (Author/AB)

Considers problem of optimal scheduling of Boolean expression (each Boolean variable represents binary outcome of program module) on single-processor system. Optimization discussed consists of finding operand arrangement that minimizes average execution costs representing consumption of resources (elapsed time, main memory, number of…

Results of study investigating human memory organization in processing of computer programming languages indicate that algorithmic logic segments form a cognitive organizational structure in memory for programs. Statement indentation and internal program documentation did not enhance organizational process of recall of statements in five Fortran…

Issues related to the decision of the number of factors to retain in factor analyses are identified. Three widely used decision rules--the Kaiser-Guttman (eigenvalue greater than one), scree, and likelihood ratio tests--are investigated using simulated data. Recommendations for use are made. (Author/JKS)