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)

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)

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…

Presents uniform and efficient approach for processing all truncated query terms in information retrieval which requires one disk access to obtain from the permuted dictionary all strings represented by truncated term. The problem of the overhead storage required to implement the permuted dictionary is discussed. Fifteen references are provided.…

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)

Examines through a series of mathematical models (theorems, descriptions, and examples), properties and operations on inverted files, which are used in an information retrieval system based on thesaurus with weighted descriptors. (CWM)

Analyzes the use of weights to denote a query representation and/or the indexing of a document as a generalization of a Boolean retrieval system. Criteria are given for the functions used to evaluate the relevance of the records to a specific query and a new evaluation approach is suggested. (CWM)

Presents a new method of document retrieval based on the fundamental operations of fuzzy set theory. Basic notions are introduced. Then the syntax and semantics of the proposed language for document retrieval is given, and an algorithm allocating documents to particular queries is described and its properties are discussed. (Author/CWM)

Describes a fast algorithm for comparing the lists of terms representing documents in automatic classification experiments. Complexity and running time for the algorithm are compared to other procedures, and a short algol-like routine is presented in the appendix. Eight references are included. (Author/BK)

Zipfian laws for frequency distributions of word pairs and longer phrases are derived from text sample analysis. From crossing of Zipfian curves, it is deduced that number of multi-word phrases that occur frequently in text is surprisingly small, of same order of magnitude as number of individual word-types. (8 references) (EJS)