Arguments by J. Levin (1988) challenging the convergence properties of the Harman and Jones (1966) method of Minres factor analysis are shown to be invalid. Claims about the invalidity of a rank-one version of the Harman and Jones method are also refuted. (TJH)

A nonspatial operationalization of the Krumhansl distance-density model of similarity is presented. The conceptual model and empirical evidence are reviewed. A nonspatial, tree-fitting methodology is described, which is sufficiently flexible to fit several competing hypotheses of similarity formation. Extensions to spatial models, three-way…

Presents a model for resource allocation of state-prevention funds based on the relative need for prevention services measured in terms of composite risk-factor index scores computed for each county. Suggests that funding be based on the resource-allocation algorithms rather than the suggested amount of funding computed for each county.…

Presents a domain-specific thesaurus for linguistic support of an information broker that employs an adaptive semantic-distance function based on pathfinder networks and algorithms for automated population by nominal compound interpretation and relational inheritance. Mathematical structure of thesauri and issues for further research are also…

Explains genetic algorithms, a means of generating logical rules that predict one variable by relating it to others. Describes how they can be applied to analysis of survey data. (SK)

Considers the need for keyphrase-extraction techniques in intelligent Chinese information retrieval and presents a PAT-tree-based adaptive approach, developed from the PATRICIA Algorithm (Practical Algorithm to Retrieve Information Coded in Alphanumeric). Discusses Internet utilization, automatic term suggestion, domain-specific lexicon…

Presents a document-clustering algorithm that uses a term frequency vector for each document in a Japanese collection to produce a hierarchy in the form of a document classification tree. Introduces an application of this algorithm to a Japanese-to-English translation-aid system. (Author/LRW)

Proposes a novel approach to automatically retrieve keywords and then uses genetic algorithms to adapt the keyword weights. Discusses Chinese text retrieval, term frequency rating formulas, vector space models, bigrams, the PAT-tree structure for information retrieval, query vectors, and relevance feedback. (Author/LRW)

Discusses an algorithm that converts a fraction in simplest form into a terminating decimal and allows students to explore the efficacy and conceptual bases of a mathematical algorithm. (ASK)

Develops and analyzes four algorithms for feature selection in the context of rough set methodology. Experimental results confirm the expected relationship between the time complexity of these algorithms and the classification accuracy of the resulting upper classifiers. When compared, results of upper classifiers perform better than lower…

Ensuring item and pool security in a continuous testing environment is explored through a new method of controlling exposure rate of items conditional on ability level in computerized testing. Properties of this conditional control on exposure rate, when used in conjunction with a particular adaptive testing algorithm, are explored using simulated…

The Gibbs sampling algorithms presented by M. H. Seltzer (1993) are fully generalized to a broad range of settings in which vectors of random regression parameters in the hierarchical model are assumed multivariate normally or multivariate "t" distributed across groups. The use of a fully Bayesian approach is discussed. (SLD)

Considers traditional ways in which attempts have been made to help students become fluent in mathematics and offers a model for ways in which fluency can be achieved with a more economic use of students' time and effort than through traditional models of exercises based on repetition. (MKR)

Presents a method for solving linear equations involving the use of inverses instead of memorizing rules. (MKR)

Presents a constrained computerized adaptive testing (CAT) algorithm that can be used to equate CAT number-correct scores to a reference test. Used an item bank from the Law School Admission Test to compare results of the algorithm with those for equipercentile observed-score equating. Discusses advantages of the approach. (SLD)