Presents an algorithm for computation of discrimination values in automatic construction of dictionaries for information retrieval. (Author/PF)

The indirect retrieval method proposed by Goffman is outlined and some similarities to other retrieval methods are indicated. The method is then evaluated and the results are compared with those obtained on the same document collection with cluster-based retrieval using single-link clustering. (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)

Presents a class of distortion controlled vector quantizers that are capable of compressing images so they comply with certain distortion requirements. Highlights include tree-structured vector quantizers; multiresolution vector quantization; error coding vector quantizer; error coding multiresolution algorithm; and Huffman coding of the quad-tree…

Analyzes the computational complexity of optimal binary tree pruning for tree-structured vector quantization. Topics discussed include the combinatorial nature of the optimization problem; the complexity of optimal tree pruning; and finding a minimal size pruned tree. (11 references) (LRW)

Describes a string-searching algorithm for multiple patterns in a text string; explains the construction of a pattern-matching machine; presents a theoretical analysis and empirical evidence that supports the sublinearity of the algorithm; and compares this algorithm with the Boyer-Moore algorithm for a single pattern. (Contains 10 references.)…

Reviews what information and software sciences have thus far accomplished in search for empirical regularities and laws and examines what theories have been developed to explain and account for regularities and laws. Specific laws and theories of information highlighted are those of Zipf, Bradford, Lotka, Mandelbrot, and Simon. (Forty references)…

Describes a modified frequency-sensitive self-organization (FSO) algorithm for image data compression and the associated VLSI architecture. Topics discussed include vector quantization; VLSI neural processor architecture; detailed circuit implementation; and a neural network vector quantization prototype chip. Examples of images using the FSO…

Describes a model for a front end query processor to deal with incomplete information in a database. The effectiveness of the processor in restricting the number of objects to be processed in a query and in aiding the interpretation of a query is discussed. (26 references) (Author/CLB)

Describes an algorithm for the calculation of term discrimination values that may be used when the interdocument similarity measure used is the cosine coefficient and when the document representations have been weighted using one particular term weighting scheme. (7 references) (Author/CLB)

Using examples of data from the areas of information retrieval and of multivariate data analysis, six hierarchic clustering algorithms (single link, median, centroid, group average, complete link, Wards's) are examined and evaluated by using three proposed coefficients of hierarchic structure. Nine references are cited. (EJS)

Results of analysis of 1,377 spelling error forms including three categories of spelling errors (consonantal, vowel, and sequential) demonstrate that majority of spelling errors are highly predictable when set of predefined rules based on phonological and sequential considerations are followed algorithmically. Eleven references and equivalent…

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)

Discusses the problem of processing fuzzy queries in databases and information retrieval systems and presents a prototype of a fuzzy query processing system for databases that is based on data clustering and uses Pascal programing language. Clustering schemes are explained, and the system architecture that uses natural language is described. (14…

Proposes and explains a new mechanism for controlling the access requests in information protection systems that is based on Newton's interpolating polynomial. Access control matrices are discussed; single-key-lock systems are described; relevant algorithms are explained; and an example of the new mechanism is included. (10 references) (LRW)