Considers problem of optimal scheduling of Boolean expression (each Boolean variable represents binary outcome of program module) on single-processor system. Optimization discussed consists of finding operand arrangement that minimizes average execution costs representing consumption of resources (elapsed time, main memory, number of…

This article shows how MAGIC, a computer language formulated by a major supplier of business-oriented numeric data which works in conjunction with the APL programing language, provides an effective management tool for analysis and presentation of business-oriented data (private or public) by nonprogrammers. Illustrative material is presented. (EJS)

Discusses background and theory underlying a design study for an interactive information retrieval system funded by the British Library Research and Development Department which will determine structural representations of anomalous states of knowledge (ASKs) underlying information needs. References are cited. (EJS)

This bibliography provides citations to 74 articles which compare either single databases across different systems or different databases to each other. All articles included were published after 1976 in Database, Online, Online Review, or the Bulletin of the Medical Library Association. A subject index is provided. (EJS)

Available databases of potential interest to researchers in education are described. The advantages of online access, basic access modes, and guidelines for computer literature searches are presented, with alternative strategies for structuring literature searches. (Author/CM)

Discusses paragraph qualification, a search strategy used to retrieve information from computerized databases. Positive and negative paragraph qualification, after-the-fact qualification, multifile searching, and free text searching are described, using examples from the Bibliographic Retrieval Services (BRS)/Search System. (EJS)

Analyzes recent developments in the problem of processing queries expressed as Boolean expressions, shows that the concept of threshold values resolves the problems inherent with relevance weights, and explores possible evaluation mechanisms for document retrieval based on fuzzy set theory. Sixteen references are listed. (FM)

Examines the effectiveness of online searching for embedded stories, poems, essays, and other literary works in the Magazine Index and Modern Language Association Bibliography databases. Strategies and results of 16 test searches set up to test the access capabilities of the two databases are profiled. (SW)

Describes a technique for editing and formatting online database searches which provides the requestor/user with a clean finished and more readily understandable product. (CWM)

Surveys the literature on the teaching of bibliographic search strategies to college students, emphasizing the areas of instructional content and teaching methods. (FM)

Urges librarians involved in library user instruction to meet the challenges preented by the growing role of computers in bibliographic systems. (FM)

Presents a review, an analysis, and a projection of the use of machine-readable databases, including online search and support services, and emphasizes the application of bibliographic databases for special libraries. More than 40 references are cited. (FM)

Describes ways of using Boolean questions with a clustered information file, and reviews an experiment studying the effect of such a retrieval method. (FM)

The effects of trust (defined as belief that the other negotiator is cooperatively motivated), aspirations, and gender were investigated in a study of the conditions and processes leading to outcomes that jointly benefit both parties. Subjects were college students. (Author/MP)

Presents user orientation and instruction guidelines for online search systems, including a sample reference manual outline in five parts: (1) introduction, (2) summary of services, (3) system descriptions, (4) principles of searching, and (5) operating instructions. Harmonization of search instructions is advocated, in order to eliminate user…