Advertisement

Research and Advances

A locally adaptive data compression scheme

A data compression scheme that exploits locality of reference, such as occurs when words are used frequently over short intervals and then fall into long periods of disuse, is described. The scheme is based on a simple heuristic for self-organizing sequential search and on variable-length encodings of integers. We prove that it never performs much worse than Huffman coding and can perform substantially better; experiments on real files show that its performance is usually quite close to that of Huffman coding. Our scheme has many implementation advantages: it is simple, allows fast encoding and decoding, and requires only one pass over the data to be compressed (static Huffman coding takes two passes).
Research and Advances

Andrew: a distributed personal computing environment

The Information Technology Center (ITC), a collaborative effort between IBM and Carnegie-Mellon University, is in the process of creating Andrew, a prototype computing and communication system for universities. This article traces the origins of Andrew, discusses its goals and strategies, and gives an overview of the current status of its implementation and usage.
Research and Advances

An empirical study of the impact of user involvement on system usage and information satisfaction

"User involvement" in information system development is generally considered an important mechanism for improving system quality and ensuring successful system implementation. The common assumption that user involvement leads to system usage and/or information satisfaction is examined in a survey of 200 production managers. Alternative models exploring the causal ordering of the three variables are developed and tested via path analysis. The results demonstrate that user involvement in the development of information systems will enhance both system usage and the user's satisfaction with the system. Further, the study provides evidence that the user's satisfaction with the system will lead to greater system usage.
Research and Advances

A comment on “a fast parallel algorithm for thinning digital patterns”

A fast parallel thinning algorithm for digital patterns is presented. This algorithm is an improved version of the algorithms introduced by Zhang and Suen [5] and Stefanelli and Rosenfeld [3]. An experiment using an Apple II and an Epson printer was conducted. The results show that the improved algorithm overcomes some of the disadvantages found in [5] by preserving necessary and essential structures for certain patterns which should not be deleted and maintains very fast speed, from about 1.5 to 2.3 times faster than the four-step and two-step methods described in [3] although the resulting skeletons look basically the same.

Shape the Future of Computing

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.

Get Involved

Communications of the ACM (CACM) is now a fully Open Access publication.

By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.

Learn More