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)…

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)

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…

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…

The typical introductory programming course is not an appropriate first computer science course for many students. Initial experiences with programming are often frustrating, resulting in a low rate of successful completion, and focus on syntax rather than providing a representative picture of computer science as a discipline. The paper discusses…

In spite of current sentiment to the contrary, the wellsprings of mathematics are not utility and relevance, but creativity, imagination, and an appreciation of the beauty of the subject. This has implications for the teaching of mathematics. (PK)

Describes an algorithm that provides more rapid convergence for more complicated forms of phase separation requiring the use of a digital computer. Demonstrates that this "inside-out" algorithm remains efficient for determination of the equilibrium states for any type of phase transition for a binary system. (CW)

Presents an easy method for constructing magic squares from three-by-three to general squares. Provides a computer program generating odd-order magic squares. Six references are listed. (YP)

Describes an algorithm for computer generation of hierarchical indexes for document collections. The resulting index, when presented with a graphical interface, provides users with a view of a document collection that permits general browsing and informal search activities via an access method that requires no keyboard entry or prior knowledge of…

Describes animation algorithms for creating smooth functions of time- and space-varying phenomenon. The incidence of the disease mumps from 1968-88 in the United States is used to demonstrate the algorithms. Figures that illustrate the findings are included. (14 references) (KRN)

Discusses the differences between problems and exercises in chemistry, and some of the difficulties that arise when the same methods are used to solve both. Proposes that algorithms are excellent models for solving exercises. Argues that algorithms not be used for solving problems. (TW)

Discusses the difference between a generic chemistry problem (one which can be solved using an algorithm) and a harder chemistry problem (one for which there is no algorithm). Encourages teachers to help students recognize these categories of problems so they will be better able to find solutions. (TW)

Discusses the differences between problems and exercises, the levels of thinking required to solve them, and the roles that algorithms can play in helping chemistry students perform these tasks. Proposes that students be taught the logic of algorithms, their characteristics, and how to invent their own algorithms. (TW)

Explains the use of the 3-dimensional analytic geometry method to find values for a field geology problem. Gives a description of the mathematical theory for this method which can be applied to data obtained by drilling as well as open surfaces, and a computer program. (RT)