Describes Newton's method to locate roots of an equation using the Newton-Raphson iteration formula. Develops an adaptive method overcoming limitations of the iteration method. Provides the algorithm and computer program of the adaptive Newton-Raphson method. (YP)

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)

Studied children's transitive inference where representation of premises provided contradictory information depending on position of two elements in a A, B, C series. Eight-year olds did significantly better on the more complex problems than did six-year olds, suggesting the presence of a developmental sequence of algorithms that enable children…

Describes an experiment that was designed to compare three different map displays used as a visual display for information retrieval by either a self-organizing algorithm or human subjects. Results indicate that the organization and visual appearance of map displays had a significant effect on subjects' searching and browsing on the map displays.…

Coordinates anthropological and cognitive perspectives on one child's learning of the standard addition algorithm in second and third grade. Analysis showed that the student abandoned his self-generated computational algorithms in favor of less understood conventional procedures. (25 references) (Author/MKR)

Discusses suffix stripping algorithms used in information retrieval to cluster words derived from a common root under the same stem, and proposes a suffixing algorithm for French which uses grammatical categories to enhance the stemming process. An evaluation of the algorithm is discussed, and an analysis of errors is described. (17 references)…

Reports on the use of stemming for Slovene language documents and queries in free-text retrieval systems and demonstrates that an appropriate stemming algorithm results in an increase in retrieval effectiveness when compared with nonstemming processing. A comparison is made with stemming of English versions of the same documents and queries. (24…

Raises and responds to questions about what and how to teach mathematics with the availability of calculators to all students. Discusses whether students need basic facts, mechanical skills, and knowledge of computational algorithms. Argues that students need to develop number sense and analytical skills using simple, symbolic, and graphing…

One college writing teacher engaged his class in the revision of a computer program to check grammar, focusing on improvement of the algorithms for identifying inappropriate uses of the passive voice. Process and problems of constructing new algorithms, effects on student writing, and other algorithm applications are discussed. (MSE)

Attempted to establish the incidence of using taught algorithms versus invented methods of subtraction in (n=1,370) male secondary school students and to relate the use of invented methods to age, mathematical achievement, and lateral thinking ability. Use of invented algorithms increased with age. (23 references) (MKR)

Describes the design of an automatic indexing system that is based on statistical techniques and expert system technology. Highlights include system architecture; the derivation of topic indicators, including word frequency; experimental results using documents from ERIC; the effects of stemming; and the identification of characteristic…

Considers the possibility of applying instance theory to the study of second language. Instance theory emphasizes the storage and subsequent use of individual experiences over the creation of abstract principles. Suggests that the theory can be applied to the study of second languages, only if it is used in conjunction with a theory of universal…

Discusses the evaluation of search engines and uses neural networks in stochastic simulation of the number of rejected Web pages per search query. Topics include the iterative radial basis functions (RBF) neural network; precision; response time; coverage; Boolean logic; regression models; crawling algorithms; and implications for search engine…

Describes the academic context in which the "French CAT" was created and trialed and gives a detailed consideration of the test presentation platform and operating algorithms. Finally, the article evaluates the first administration of the test and discusses its reliability and validity as a placement instrument for first-year Australian…

This study demonstrates the advantages of using a constrained optimization algorithm to explore the optimal number of prompts, modes of discourse, and raters for achieving an acceptable level of reliability during a direct writing assessment. Writing samples elicited from 50 college students were rated by 3 graduate students and the scores…