Dynamic memory allocation has been a fundamental part of most computer systems since roughly 1960, and memory allocation is widely considered to be either a solved problem or an insoluble one. In this survey, we describe a variety of memory allocator designs and point out issues relevant to their design and evaluation. We then chronologically survey most of the literature on allocators between 1961 and 1995. (Scores of papers are discussed, in varying detail, and over 150 references are given.)

/pdf/dynamic-storage-allocation-a-survey-and-critical-review-2mi0efvca4.pdf

Dynamic Storage Allocation: A Survey and Critical Review

The global land 1 km data set project represents an international effort to acquire, archive, process, and distribute 1 km AVHRR data of the entire global land surface in order to meet the needs of the international science community. A network of 26 high resolution picture transmission (HRPT) stations, along with data recorded by the National Oceanic and Atmospheric Administration (NOAA), has been acquiring daily global land coverage since 1 April 1992. A data set of over 30000 AVHRR images has been archived and made available for distribution by the United States Geological Survey, EROS Data Center and the European Space Agency Under the guidance of the International Geosphere Biosphere programme, processing standards for the AVHRR data have been developed for calibration, atmospheric correction, geometric registration, and the production of global 10-day maximum normalized difference vegetation index (NDVI) composites. The major uses of the composites are related to the study of surface vegeta...

The 1 km AVHRR global land data set: first stages in implementation

Transcoding proxies are used as intermediaries between generic World Wide Web servers and a variety of client devices in order to adapt to the greatly varying bandwidths of different client communication links and to handle the heterogeneity of possibly small-screened client devices. Such transcoding proxies can adaptively adjust the amount by which a data stream is reduced, using an aggressive lossy compression method (e.g., an image becomes less clear, text is summarized). We present an analytical framework for determining whether to transcode and how much to transcode an image for the two cases of store-and-forward transcoding as well as streamed transcoding. These methods require prediction of transcoding delay, prediction of transcoded image size (in bytes), and estimation of network bandwidth. We discuss methods of adaptation based on fixed quality as well as fixed delay (automated/dynamic transcoding). We conclude with a description of the practical adaptation policies that have been implemented in our adaptive image transcoding proxy.

Dynamic adaptation in an image transcoding proxy for mobile Web browsing

A DCT-based image watermarking algorithm is described, where the original image is not required for watermark recovery, and is achieved by inserting the watermark in subimages obtained through subsampling.

DCT-based image watermarking using subsampling

Universal data compression algorithms fail to compress genetic sequences. It is due to the specificity of this particular kind of “text.” We analyze in some detail the properties of the sequences, which cause the failure of classical algorithms. We then present a lossless algorithm, biocompress-2, to compress the information contained in DNA and RNA sequences, based on the detection of regularities, such as the presence of palindromes. The algorithm combines substitutional and statistical methods, and to the best of our knowledge, leads to the highest compression of DNA. The results, although not satisfactory, give insight to the necessary correlation between compression and comprehension of genetic sequences.

/pdf/a-new-challenge-for-compression-algorithms-genetic-sequences-16h1avr38u.pdf

A new challenge for compression algorithms: genetic sequences

From the Publisher:
Topics in this guide to data compression techniques include the Shannon-Fano and Huffman coding techniques, Lossy compression, the JPEG compression algorithm, and fractal compression. Readers also study adaptive Huffman coding, arithmetic coding, dictionary compression methods, and learn to write C programs for nearly any environment. The disk illustrates each learned technique and demonstrates how data compression works.

Mark Nelson

Papers

The Data Compression Book