Discussion of connectionist views for adaptive clustering in information retrieval focuses on a connectionist clustering technique and activation spreading-based information retrieval model using the interaction information retrieval method. Presents theoretical as well as simulation results as regards computational complexity and includes…

Explains the use of genetic algorithms to combine results from multiple query evaluations to improve relevance in information retrieval. Discusses niching techniques, relevance feedback techniques, and evolution heuristics, and compares retrieval results obtained by both genetic multiple query evaluation and classical single query evaluation…

Describes a study that investigated document retrieval relevance based on document length in an experimental text collection. Topics include term weighting and document ranking, retrieval strategies such as the vector-space cosine match, and a modified technique called the pivoted cosine normalization. (LRW)

Proposes a model for digital library and hypermedia organizations that is adaptive, providing different conceptual orderings to support browsing for different individuals' or groups' needs. Highlights include types of links, document ordering and the Gray code (a binary programming code), adaptive classification, and an economic model for document…

Suggests use of the quadratic formula to build understanding that connections between factors and solutions to equations work both ways. Making use of natural connections among concepts allows students to work more efficiently. Presents four sample problems showing the roots of equations. Messy quadratic equations with rational roots can be solved…

Provides an overview of journal evaluation indicators, highlighting strengths and weaknesses and their range of applicability. Topics include the definition of a quality journal; different notions of impact factors; citation models; electronic journals; ranking journals; possible biases in citation databases; and using the journal impact in…

Discusses how to improve the quality of Internet search systems and introduces the Ghosts Consensus Method which is free from the drawbacks of digital democracy algorithms and is based on linear programming tasks. Highlights include vector space models; determining relevant documents; and enriching query terms. (LRW)

Illustrated is the use of isometric graph paper in the discovery of nonstandard area formulas. The use of definitions, geometric construction, record keeping, and conjectures about triangles, rhombuses, hexagons, parallelograms, isosceles trapezoids, rectangles, and trapezoids are described. (YP)

Illustrates how Lagrange's approach applies to the differential calculus of polynomial functions when approximations are obtained. Discusses how to obtain polynomial approximations in other cases. (YP)

Presents a theorem and its converse to generate all of the primitive Pythagorean quadruples. Provides a BASIC program generating them. (YP)

Discusses numerical methods to compute approximate solutions of a differential equation. Provides a Pascal program for the extended Euler-Heun method. (YP)

Discusses a numerical technique called the method of adjoints, turning a linear two-point boundary value problem into an initial value problem. Described are steps for using the method in linear or nonlinear systems. Applies the technique to solve a simple pendulum problem. Lists 15 references. (YP)

Discusses end-user searching in Boolean information retrieval systems considers the role of search intermediaries and proposes a model of user preferences that incorporates a user's profile. Highlights include document representation; information queries; document output ranking; calculating user profiles; and selecting documents for a local…

Presents an improved inverted region quadtree variation called Dynamic Inverted Quadtree that is able to support and index a pictorial database. Pattern-searching algorithms are described, and the space needs of Fully Inverted and Dynamic Inverted Quadtrees are analytically compared based on a model of image randomness expressed as a branching…

Discusses the PRECALL, PRR (probability of relevance given retrieval), and EP (expected precision) approaches for dealing with the problem of weak ordering in information retrieval systems. Findings of two experiments comparing evaluation results obtained by PRR and EP are reported. Several mathematical formulas and proofs are included. (20…