Proposes that error rates in indexing using string index languages such as NEPHIS might be reduced at relatively low cost by having the indexer enter strings via a microcomputer system which could provide simple validation and feedback in the form of graphic displays of concept links. (Author/FM)

Describes the theoretical framework of a retrieval system that uses data structures called bitmaps to improve search algorithms for medium-sized systems. Information retrieval systems that contain the full text of the documents are discussed, and the use of inverted files such as concordances for small texts is explained. (24 references) (LRW)

Proposes a single underlying structure for the production of a variety of computer index displays, using a networking system which represents both concepts and links by nodes. Desirable characteristics of index displays are outlined, and algorithmic extraction of subnetworks for local use is discussed. References are included. (Author/BK)

Describes the development and use of a policy model and algorithm for allocating continuing education (CE) resources in a large national health system. The algorithm uses a two-factor model, basing facility CE allocations on the amount of CE need and price differences in accessing CE sources. (Author/JOW)