Discussion of the failure of individual keywords to identify conceptual content of documents in retrieval systems highlights Metric Similarity Modeling, a method for creating vector space representation of documents based on modeling target interdocument similarity values. Semantic relatedness, latent semantic indexing, an indexing and retrieval…

It is proposed that attributes of automatization depend on the strength of a processing pathway, and that strength increases with training. With the Stroop effect as an example, automatic processes are shown through simulation to be continuous and to emerge gradually with practice. (SLD)

One of a series of research reports examining objective principles successfully used in other fields which can lend integrity and legitimacy to evaluation, this report presents an overview of operations research (OR) as a potential source of evaluation methodology. The nature of the methods common to this discipline are summarized and the…

Proposes a fuzzy multiset model for information clustering with application to information retrieval on the World Wide Web. Highlights include search engines; term clustering; document clustering; algorithms for calculating cluster centers; theoretical properties concerning clustering algorithms; and examples to show how the algorithms work.…

Describes a study with the main objective of constructing models based on strategies students use to solve chemistry problems and to show that these models form sequences of progressive transitions termed "problemshifts" that increase the explanatory/heuristic power of the model. Results implies that the relationship between algorithmic…

A model is proposed in which different sets of linear constraints are imposed on different dimensions in component analysis and classical multidimensional scaling frameworks. An algorithm is presented for fitting the model to the data by least squares. Examples demonstrate the method. (SLD)

Presents a relevance-feedback strategy that improves the effectiveness of information-retrieval systems based on back-propagation of the relevance of retrieved documents using an algorithm developed in a neural approach. Describes a neural information-retrieval model and reports results obtained with the algorithm in three different environments.…

Reports on two types of unsolvability in mathematics. One is an instance of impossibility and the second is a judgment of undecidability. Presents a number of examples of undecidable propositions. (GS)

Criteria were developed for deciding the fraction of course attendance time that students should spend on a computer-assisted instruction (CAI) course in order to maximize the average final achievement of the class, subject to constraints on the probability of individual student failure and on the available console capacity. The major elements of…

Discusses an algorithm for developing problem solving simulations using microcomputers, and describes both the components of the simulation algorithm and the user interface. Examples of simulation and programming methods are presented. (MBR)

Describes an algorithm used at the University of Ottawa to create examination schedules that are not only conflict free and minimize number of consecutive examinations for individual students, but provide for the scheduling of certain proper subsets of examinations into proper time slots and minimal overall number of consecutive examinations. (MBR)

Discussion of hypertext browsing proposes a filtering algorithm which restricts the amount of information made available to the user by calculating the set of most relevant hypertext nodes for the user, utilizing the user profile and data clustering technique. An example is provided of an optimal cluster of relevant data items. (Author/LRW)

Presents a preliminary empirical test of a maximum likelihood approach to using relevance data for training information retrieval parameters. Discusses similarities to language models; the unification of document-oriented and query-oriented views; tests on data sets; algorithms and scalability; and the effectiveness of maximum likelihood…

Problems in selection of optimal designs in item-response theory (IRT) models are resolved through a sequential design procedure that is a modification of the D-optimality procedure proposed by Wynn (1970). This algorithm leads to consistent estimates, and the errors in selecting the abilities generally do not greatly affect optimality. (SLD)

Generalizing Boolean matrix decomposition to a larger class of matrix decomposition models is demonstrated, and probability matrix decomposition (PMD) models are introduced as a probabilistic version of the larger class. An algorithm is presented for the computation of maximum likelihood and maximum a posteriori estimates of the parameters of PMD…