Investigates the value of applying principles derived from simulated annealing to clustering tuples in database design, and compares this technique with a graph-collapsing clustering method. It is concluded that, while the new method does give superior results, the expense involved in algorithm run time is prohibitive. (24 references) (CLB)

Discusses the results of modeling the performance of searching large text databases via various parallel hardware architectures and search algorithms. The performance under load and the cost of each configuration are compared, and a common search workload used in the modeling is described. (Contains 26 references.) (LRW)

Discussion of relevancy in information retrieval systems focuses on an analysis of the efficiency of various cluster-based retrieval (CBR) strategies. A method for combining CBR and inverted index search is proposed that is cost effective in terms of time efficiency; and results of experiments are reported. (Contains 32 references.) (LRW)

THE EFFECTIVE AND ECONOMICAL USE OF COMPUTER FACILITIES AS AN AID IN TEACHING SECONDARY SCHOOL MATHEMATICS DEPENDS ON (1) ACCESS TO A TYPE OF FACILITY WHICH PERMITS PROBLEM-SOLVING PROCEDURES (I.E., ALGORITHMS DESIGNED BY A STUDENT) TO BE TESTED BY THE STUDENT AND (2) FACILITY RESPONSE TIME PER PROBLEM. THIS UNIT TIME VARIES WITH THE SIZE, TYPE,…