Discusses the adaptive compression of computer files of numerical data whose statistical properties are not given in advance. A new lossless coding method for this purpose, which utilizes Adelson-Velskii and Landis (AVL) trees, is proposed. The method is effective to any word length. Its application to the lossless compression of gray-scale images…

Proposes a cost/benefit model coupled with a decision tree for determining normal forms, which are used in information systems development processes to group data into well-refined structures. The three primary variables that impact the benefits and costs of normalization (reduced anomalies, storage requirements, and transaction response times)…

Examines two models to study the consequences for coding efficiency of sample fluctuations, a specific type of error in the statistics on which data compression codes are based. The possibility that random fluctuation can be exploited for data compression is discussed. (six references) (KRN)

Proposes a mathematical model using the probability formalism to explain why a geometrical law is observed in distributions related to library circulation data. Highlights include techniques based on convolution theory; Lotka's law; and Bradford's law. (Author/LRW)

Describes a method for compressing tomographic images obtained using Positron Emission Tomography (PET) and Magnetic Resonance (MR) by applying transform compression using all available dimensions. This takes maximum advantage of redundancy of the data, allowing significant increases in compression efficiency and performance. (13 references) (KRN)

Discusses a flexible, high performance subband coding system. Residual vector quantization is discussed as a basis for coding subbands, and subband decomposition and bit allocation issues are covered. Experimental results showing the quality achievable at low bit rates are presented. (13 references) (KRN)

Describes two mathematical models of the periodical publishing process based on a theoretical analysis. Discusses the publishing process for periodical literature, explains the continuous model and the discrete model, presents partial differential equations, and demonstrates the adaptability and the validity of the models. (LRW)

Proposes a scheme of hierarchical piecewise linear approximation as an adaptive image pyramid. A progressive image coder comes naturally from the proposed image pyramid. The new pyramid is semantically more powerful than regular tessellation but syntactically simpler than free segmentation. This compromise between adaptability and complexity…

Proves a theorem about the invariance of the Lotka function under a transformation that maps numbers of authors as variables to number of collaborators as variables. A general approach to incorporate the average number of collaborators in a production function is discussed, leading to a general framework to model multirelational data. (Author/LRW)

Highlights semantic links and shows how the semantic content of hypertext links can be used for information retrieval. Discussion includes indexing and retrieval algorithms that exploit link content and node content; retrieval strategies exploiting semantic links, including conventional retrieval and constrained spreading activation techniques;…

A statistical model for citation processes is presented as a particular version of a nonhomogenous birth process. The mean value function and special transition probabilities, which can readily be calculated on the basis of known and estimated parameters, give essential information on the change of citation impact in time. (10 references) (KRN)

Describes a detailed algorithm for fast text compression. Related to the PPM (prediction by partial matching) method, it simplifies the modeling phase by eliminating the escape mechanism and speeds up coding by using a combination of quasi-arithmetic coding and Rice coding. Details of the use of quasi-arithmetic code tables are given, and their…

Describes the design of optimal tree-structured vector quantizers that minimize the expected distortion subject to cost functions related to storage cost, encoding rate, or quantization time. Since the optimal design problem is intractable in most cases, the performance of a general design heuristic based on successive partitioning is analyzed.…

Presents a new image compression algorithm that employs some of the most successful approaches to adaptive lossless compression to perform adaptive online (single pass) vector quantization with variable size codebook entries. Results of tests of the algorithm's effectiveness on standard test images are given. (12 references) (KRN)

Evaluates the performance of different methods of data compression coding in several situations. Huffman's code, arithmetic coding, fixed codes, fast approximations to arithmetic coding, and splay coding are discussed in terms of their speed, memory requirements, and proximity to optimal performance. Recommendations for the best methods of…