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 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…

Analyzes the amount of compression possible when arithmetic coding is used for text compression in conjunction with various input models. Algorithms are analyzed; modeling effects are considered; scaling is discussed; higher order models are examined, including prediction by partial matching; and coding effects are described. (34 references) (LRW)

Describes the logical construction of several Russian hypertext systems, and discusses the navigational algorithms used, nodes selected, and coherence demanded. Several illustrative graphs are included, and an overview of the development of linking structures producing logical-semantic models is given. (20 references) (EA)

Reports an approach to automatic thesaurus construction for Chinese documents. Presents an effective Chinese keyword extraction algorithm. Compared to previous studies, this method speeds up the thesaurus generation process drastically. It also achieves a similar percentage level of term relatedness. Includes three tables and four figures.…

Discusses the problems of compressing a large textual database for storage on CD-ROM. A text-compression algorithm is presented, new algorithms for compression of indices are described, and the ARTFL (American and French Research on the Treasury of the French Language) database is used as an example. (14 references) (LRW)

Describes ways in which algorithms which refer to underlying procedures should be represented in order to improve communication in educational and/or training materials. Representations of linear procedures, decision rule procedures, and complex procedures are provided. (MER)

This paper reports an experiment designed to test theoretical relations among fast problem solving, more complex and slower problem solving, and research concerning fundamental memory processes. Using a cathode ray tube, subjects were presented with propositions of the form "Y is in list X" which they memorized. In later testing they were asked to…

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)

Response time in large, inverted file document retrieval systems is determined by time required to access files of document identifiers on disk and process a Boolean search request. A specialized computer system has been devised that can perform a complicated sample search involving 70 terms and over 60,000 document references 12 to 60 times…

Identifies and describes the differences in the problem-solving methods used by faculty teaching introductory chemistry and students enrolled in an introductory chemistry course. Results indicate that students correctly solve algorithmic-mode problems more frequently. Contains 33 references. (DDR)

Describes preliminary investigation of the use of International Computers Limited's Distributed Array Processor (DAP) for parallel searching of large serial files of documents. DAP hardware and software, test collections, measurement of DAP performance, search algorithms, experimental results, and DAP suitability for interactive searching are…