Defines a hash coding model for non-unique search keys and derives the expected number of accesses needed to retrieve all desired records from a computer storage device. (Author)

GENERAL CONSIDERATIONS INVOLVED IN THE DESIGN OF FILE ORGANIZATIONS FOR INFORMATION RETRIEVAL SYSTEMS ARE DISCUSSED. THE QUESTION OF INVERTED FILE AND SERIAL FILE SEARCHING ON MAGNETIC TAPE IS REVIEWED. BASED ON FORMULAS CONCERNING INDEX TERM USAGE, IT IS SHOWN FOR A SPECIFIC COLLECTION THAT SEARCHING THE SERIAL FILE IS MORE EFFICIENT THAN…

Describes a dialog-program which uses basic statements available on a WANG 2200T version connected to a floppy-diskette to cross-reference a given set of keywords, author names, journal names, and specified reference numbers. Special program features are described and two references are listed. (Author/RBF)

A wide range of computer crimes and the need for computer security are discussed. (MK)

Interactive computers are providing more services to greater numbers of users. However, before such systems can be economically applied to public education, the cost of high performance memory must be reduced. By using massive amounts of serial memory in conjunction with a highly sophisticated memory controller, a system was constructed which…

Reviews computer storage devices designed to provide additional memory for microcomputers--chips, floppy disks, hard disks, optical disks--and describes how secondary storage is used (file transfer, formatting, ingredients of incompatibility); disk/controller/software triplet; magnetic tape backup; storage volatility; disk emulator; and…

Introduces some algorithmic methods, for which no pre-editing is necessary, for automatically "lemmatising" raw text (changing raw text to an equivalent version in which all inflected words are artificially transformed to their dictionary look-up form). The results of a study of these methods, which used a German Text, are also given. (KM)

Two different directory structuring techniques--division hash technique and a hydrid technique--are compared for the same set of keys with directories of from 10,000 to 100,000 unique keys. Retrieval costs, in terms of the number of accesses of secondary storage required to retrieve the keys, are considered in detail. (Author)

This report describes Phase 1 of a research project with the over-all objective of exploring the applicability of automatic methods in the indexing of drug information appearing in English natural language text. Two major phases of the research have been completed: (1) development of the automatic indexing method and its implementation on the test…

This report describes the searching methods and the search program for the automatic indexing method which was developed and implemented in an earlie r phase of the project. The indexing method generates index tags automatically from English language text and creates a machine searchable file of index records for the document being processed.…

Described are types of programs used for processing text (editors, print formatters, and word processors), followed by the comparison of four word-processing packages: Auto Scribe, Electric Pencil, Magic Want and Word Star. With the exception of Auto Scribe, all programs reviewed are CP/M versions. (KC)

The program, STORY-LIST, generates alphabetized cumulative word lists by story number within a school grade. It is designed to read a group of cards until it finds a new grade/story number. Each word read is stored in an array, sorted, and an asterisk is added to each word in the array. This array is then merged with the old sorted word list and…

Indicates how a college, with an IBM 1130 computer, can facilitate information storage and retrieval by using magnetic disc storage in conjunction with ACT Program, 80-column Hollerith-type card format especially designed for the college. (JF)

This report delineates the theory and terminology of data compression. It surveys four data compression methods--null suppression, pattern substitution, statistical encoding, and telemetry compression--and relates them to a standard statistical coding problem, i.e., the noiseless coding problem. The well defined solution to that problem can serve…

Traditional and table-driven methods of editing input data for a data-storage system are compared. An application of table-driven input editing is described for a high-volume, multiple-format, clinical data-base. (Author)