The author proposes a system using the HUC to identify all information and knowledge which can be reduced to a written, pictorial, oral, or machine readable record. The code designations, which may consist of letters, numerals, and other symbols and which average 12 to 18 characters in length, provide information in 12 fields: type of material,…

Rooted binary trees with weighted nodes are structures encountered in many areas, such as coding theory, searching and sorting, information storage and retrieval. The path length is a meaningful quantity which gives indications about the expected time of a search or the length of a code, for example. In this paper, two sharp bounds for the total…

Of the problems discussed, those posing the greatest obstacle for the full utilization of microform systems are: (1) the problem of identifying the material on microforms when it is associated with key words in computerized digitalized systems; (2) the problem of copyright in converting collections of material into microform stores; and (3) the…

The design of codes and formats for information storage must be guided by the requirements of the processes in which the stored information is to be used. In the case of medical data, a code must be designed to facilitate several different processes, including case management, administration, evaluation and research. Design of such a system can be…

This book deals with properties of vocabularies for indexing and searching document collections; the construction, organization, display, and maintenance of these vocabularies; and the vocabulary as a factor affecting the performance of retrieval systems. Most of the text is concerned with vocabularies for post-coordinate retrieval systems, with…