Examines the philosophy behind the issue of computational fluency in "Principles and Standards." (Author)

Describes the advantages of a prototype retrieval system that uses statistically based ranked retrieval of records rather than traditional boolean methods, especially for end users. Several new techniques are also discussed including bit mapping, pruning, methods of building inverted files, and types of search engine. (26 references) (EAM)

Presents an approach to automatic matching and linkage of citations between databases which applied 14 coding techniques and measured their effectiveness in terms of efficiency of retrieval of duplicates with minimal false hits, reliability, and performance. (EAM)

Describes a pattern which emerged from an examination of the digits of the squares of numbers. Provides eight examples having the pattern at the units or tens digit of the number. (YP)

Provides four examples for testing the validity of logical arguments by using the method of truth trees. (YP)

Outlines various subtraction methods, such as the decomposition method, equal-addends method, and low-stress algorithm. Describes a subtraction method by addition of complements. Discusses the advantages and disadvantages of the method. (YP)

The application of operations research and computers is providing school bus routing and scheduling to five California counties. Illustrates the system requirements, steps for computerized calculations, a sample bus assignment report, and three data files. (MLF)

Develops a general computer algorithm to obtain a magic square having a number of rows that is a multiple of four. Presents a BASIC program and sample runs. (YP)

An extension of component analysis to longitudinal or cross-sectional data is presented. Components are derived under the restriction of invariant and/or stationary compositing weights. Multiple occasion and multiple group analyses, the computing algorithm, component pattern and structure matrices, and an example are discussed. (TJH)

Discusses the effect of including relevance data on the calculation of term discrimination values in bibliographic databases. Algorithms that calculate the ability of index terms to discriminate between relevant and non-relevant documents are described and tested. The results are discussed in terms of the relationship between term frequency and…

Reviews recent research into the use of hierarchic agglomerative clustering methods for document retrieval. The topics discussed include the calculation of interdocument similarities, algorithms used to implement clustering methods on large databases, validity testing of document hierarchies, appropriate search strategies, and other applications…

Describes the use of a highly parallel array processor for pattern matching operations in a bibliographic retrieval system. The discussion covers the hardware and software features of the processor, the pattern matching algorithm used, and the results of experimental tests of the system. (37 references) (Author/CLB)

Discussion of how to teach programming skills to novice programmers focuses on the use of a program animator that uses a copies model of recursion to teach the recursive function. Various mental models are reviewed; testing the recursion animator is described; and possibilities for further research are suggested. (12 references) (LRW)

Discusses the feasibility of building intelligent rule- or weight-based algorithms into general-purpose software for interactive thesaurus navigation. Previous research is surveyed; practical investigations in thesaurus navigation and query enhancement are described; and implications for automatic or intelligent thesaurus navigation are…

Call for reforming mathematics teaching has been sounded loudly and strongly. Change from teaching standard algorithms to having children invent their own methods requires major pedagogical shift. Teachers must trust students' inventiveness and ability to make sense of numerical situations, be committed to thinking and reasoning as cornerstone of…