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)

Explores the new storage technology of optical data disks and introduces a data structure, the inverted signature tree, for storing data on optical data disks for efficient text searching. The inverted signature tree approach is compared to the use of text signatures and the B+ tree. (22 references) (Author/CLB)

Investigates applicability of inverted file processing in magnetic bubble memories by presenting four magnetic bubble memory models as storage mediums: one based on a major-minor loop configuration; one utilizing a decoder design on a magnetic bubble memory chip; and two based on different structural configurations of the first two. (MBR)

The structure of a retrospective information retrieval system that uses equifrequent word or text fragments is described, and its advantages over word oriented systems are mentioned briefly. (Author)

Described here is an efficient encoding procedure for Algorithmic Wiswesser Notation (ALWIN), using the Morgan labelling algorithm and the neighborhood relationship in a chemical graph. This procedure introduces a hierarchy to bring an order for the unique description of the chemical structure with a minimal computational effect. (Author)

Analyzes computer terminal memory performance in terms of overflow probability and average queueing delay, and presents new method to derive a closed expression for data arrivals with Erlangly distributed interarrival times and an approach to derive steady state probability expressions of the terminal memory content process. Twenty references are…

Presents a system model for transmission of input data that is coming from terminals of users in a limited user resource-sharing environment. Performance of a mini/microcomputer receiving mixture of picture-phone terminal data is analyzed with constant service times, synchronous transmission, and single-server interruptions through first-order…

Four advantages of storing and retrieving geometric figures and chromosome images through the use of shape-oriented similarity measures are presented. (Author)

Introduces this issue, which contains papers from the 1991 Data Compression Conference, and defines data compression. The two primary functions of data compression are described, i.e., storage and communications; types of data using compression technology are discussed; compression methods are explained; and current areas of research are…

Presents three text compression methods of increasing power and evaluates each based on the trade-off between compression gain and processing time. The advantages of using hash coding for speed and optimal arithmetic coding to successor information for compression gain are discussed. (26 references) (Author/CLB)

False drops occur in a system of random superimposed coding for edge-notched, punched, and feature cards. Formulae for the false dropping fraction are derived, and figures and tables are given for the calculated values in the most popular scheme. (Author/LS)

A new method for concentrating keywords of a thesaurus, based on a mathematical study of the distribution of characters in a defined natural language. (Author/KP)

Uses collection and storage of data in an environmental chemicals data bank to develop an exchange format of hierarchical tree structure between network partners. Rules identify and process the nodes in the tree in such a way that information is neither lost nor degraded upon transfer between network partners. (CWM)

Introduces two distribution schemes that partition documents over multiple processors and the corresponding multiprocessor retrieval algorithms that match relevant documents to user queries. The suggested framework is based on a general purpose hypercube multicomputer architecture with a dedicated disk for each node. A timing analysis for the…

Demonstrates that hierarchical naming schemes--one with a single namespace and fixed root spread over all machines in a distributed system, and a second with total namespace composed of some aggregation of individual namespaces of each component system's filestores--can coexist in distributed computer systems. Combined system's design is…