Describes a project that improved the quality of BCIN, the bibliographic database of the Conservation Information Network, by correcting data fields and removing duplicate records. The database is described, deduplication theory is discussed and relevant literature is reviewed, algorithm development and testing is described, and results of…

Describes a detailed algorithm for fast text compression. Related to the PPM (prediction by partial matching) method, it simplifies the modeling phase by eliminating the escape mechanism and speeds up coding by using a combination of quasi-arithmetic coding and Rice coding. Details of the use of quasi-arithmetic code tables are given, and their…

Describes the design of optimal tree-structured vector quantizers that minimize the expected distortion subject to cost functions related to storage cost, encoding rate, or quantization time. Since the optimal design problem is intractable in most cases, the performance of a general design heuristic based on successive partitioning is analyzed.…

A real world sample of actual data that students can use to see the application of the Hardy-Weinberg law to a real population is provided. The directions for using a six-step algorithmic procedure to determine Hardy-Weinberg percentages on the data given are described. (KR)

Teaching which does not in any significant way address the genesis of mathematical ideas hides the fact that mathematics is created by people; that it involves intuition, exploring, conjecturing, and reasoning; and that it is purposeful. Such teaching can give students appearance that much of mathematics is very arbitrary; it just falls from the…

Describes the logical construction of several Russian hypertext systems, and discusses the navigational algorithms used, nodes selected, and coherence demanded. Several illustrative graphs are included, and an overview of the development of linking structures producing logical-semantic models is given. (20 references) (EA)

R. A. Bailey and J. C. Gower explored approximating a symmetric matrix "B" by another, "C," in the least squares sense when the squared discrepancies for diagonal elements receive specific nonunit weights. A solution is proposed where "C" is constrained to be positive semidefinite and of a fixed rank. (SLD)

Presents an interpolation methodology that duplicates and improves the results of mathematical functional relationships useful for designing business enterprise simulations and argues that interpolation is effective over the entire range of production and sales activity. (six references) (EA)

Discusses term position as a search tactic in Boolean retrieval systems and describes ranked output systems that have used term weighting. The use of term proximity devices in ranked output systems is proposed, the algorithms used are explained, and a search experiment with a test collection is described. (19 references) (LRW)

An algorithm presenting questions allowing prediction of the major type of biological activity elicited by a steroid hormone structure is designed to help students organize their approach to the interpretation of the complex structures and permit independent application of logical thought processes in pharmacological identification of other drug…

Examines 250 sixth-grade students' understanding of arithmetic average by assessing their understanding of the computational algorithm. Results indicate that the majority of the students knew the "add-them-all-up-and-divide" averaging algorithm, but only half of the students were able to correctly apply the algorithm to solve a…

Discusses information retrieval and the use of binary trees as a fast access method for search strategies such as hashing. Proposes new methods based on compact binary trees that provide faster access and more compact storage, explains the theoretical basis, and confirms the validity of the methods through empirical observations. (LRW)

Presents a heuristic, attribute-based, noise-tolerant data mining program, HCV (Version 2.0) based on the newly-developed extension matrix approach. Outlines some techniques implemented in the HCV program for noise handling and discretization of continuous domains; an empirical comparison shows that rules generated by HCV are more compact than the…

Analyzes a didactical sequence for the teaching of addition and subtraction procedures and algorithms. Uses didactical procedures by children in problem solving activities in order to gain a better understanding of the interaction between numbers, numeration, and operations knowledge which are involved in the construction of addition and…

Sixteen middle school students ranked the lengths of various paths in problem-solving interviews. Every student invoked at least one of four intuitions that originated from their everyday experiences: compression, detour, complexity, and straightness. Students continued to use their inadequate intuitions in the posttest before applying learned…