Describes a project at the University of Sheffield that is investigating the use of nearest-neighbor retrieval algorithms for full-text searching. Nearest-neighbor searching is compared with Boolean retrieval and hypertext, and an experimental text retrieval system called INSTRUCT (Interactive System for Teaching Retrieval Using Computational…

Describes the development of a computer-aided decision-making system to assist educational practitioners in curriculum decision making about innovative program features and implementation requirements. Topics discussed include the identification of variables; database generation; mathematical modeling; compromising between effectiveness and…

Explains how a simple three-step algorithm can aid college students in solving synapse transmission problems. Reports that all of the students did not completely understand the algorithm. However, many learn a simple working model of synaptic transmission and understand why an impulse will pass across a synapse quantitatively. Students also see…

Presents a public-key cryptosystem application to introduce students to several topics in discrete mathematics. A computer algorithms using recursive methods is presented to solve a problem in which one person wants to send a coded message to a second person while keeping the message secret from a third person. (MDH)

The discrete mathematics topics of trees and computational complexity are implemented in a simple reliability program which illustrates the process advantages of the PASCAL programing language. The discussion focuses on the impact that reliability research can provide in assessment of the risks found in complex technological ventures. (Author/JJK)

Proposes that topic representations should consist of excerpts from domain thesaurus, generated by spreading activation technique. Algorithm for generating excerpts is outlined and exemplified, and problem of assessing resemblance between two excerpts is discussed. Whether existing thesauri are adequate for this purpose is questioned, and ideas…

Discussion of the problem of control in documentary information retrieval (IR) systems focuses on feedback mechanisms. Information needs are discussed, particularly the Problem Oriented Information Need (POIN); the structure of an adaptive IR system is described; and the design of algorithms for automated IR systems is explained. (33 references)…

Discussion of user queries in information retrieval highlights the experimental evaluation of an adaptive linear model that constructs improved query vectors from user preference judgments on a sample set of documents. The performance of this method is compared with that of standard relevance feedback techniques. (28 references) (LRW)

Reviews the development and the principal elements of total quality management (TQM) and demonstrates methods for introducing some of the key elements into a strategy-oriented business simulation game that can be used to teach future managers. Topics discussed include increased focus on the customer; continuous improvement; and competitive…

Describes a new effectiveness measure as an alternative to the traditional evaluation measures of recall and precision in information retrieval systems. The statistical approach--which compares two retrieval algorithms--is explained, the information needs of the user are considered, and an experiment with a test collection of abstracts is…

A network-flow model is formulated for constructing parallel tests based on classical test theory while using test reliability as the criterion. Practitioners can specify a test-difficulty distribution for values of item difficulties as well as test-composition requirements. An empirical study illustrates the reliability of generated tests. (SLD)

A method is presented for incorporating a large number of constraints on adaptive item selection in the construction of computerized adaptive tests. The method, which emulates practices of expert test specialists, is illustrated for verbal and quantitative measures. Its foundation is application of a weighted deviations model and algorithm. (SLD)

A marginal maximum likelihood estimation algorithm is presented for the ordered partition model of M. Wilson that does not require the set of available responses to be fully ordered. The model and its estimation algorithm are illustrated in a comparison of alternative scoring schemes for open-ended science items. (SLD)

This study found that a Kohonen self-organizing map (SOM) algorithm for browsing can categorize a large and eclectic Internet-information space into manageable sub-spaces that users can navigate to find relevant home pages. An automatically generated concept-space algorithm for searching was shown to enhance keyword-based Internet searching.…

Presents a probabilistic technique to retrieve passages from texts having a large size or heterogeneous semantic content. Results of experiments comparing the probabilistic technique to one based on a text segmentation algorithm revealed that the passage size affects passage retrieval performance; text organization and query generality may have an…