January 1989 - Vol. 32 No. 1
Features
The final report of the Task Force on the Core of Computer Science presents a new intellectual framework for the discipline of computing and a new basis for computing…
A simple approach to specifying concurrent systems
Over the past few years, I have developed an approach to the formal specification of concurrent systems that I now call the transition axiom method. The basic formalism…
Can the field of MIS be disciplined?
Preoccupations about the present and future evolution of MIS as a scientific field seem to be gaining popularity among researchers. The authors contend that most models…
Fifth annual UCLA survey of business school computer usage
This year's survey takes a look at where business schools are in terms of computerization, providing useful information for deans and others involved in making computer…
An adaptive dependency source model for data compression
By dynamically recoding data on the basis of current intercharacter probabilities, the entropy of encoded messages can be significantly reduced.
Spreadsheet analysis and design
Although spreadsheet programs and microcomputers have revolutionized information processing in organizations, a significant number of serious errors have been reported…
A definition optimization technique used in a code translation algorithm
Data flow analysis is used to optimize variable definitions in a program that translates microprocessor object code to a higher order language.
Error detecting decimal digits
Decimal-oriented error detection schemes are explored in the context of one particular company project.
Efficient distributed event-driven simulations of multiple-loop networks
Simulating asynchronous multiple-loop networks is commonly considered a difficult task for parallel programming. Two examples of asynchronous multiple-loop networks are…
Fast parallel thinning algorithms: parallel speed and connectivity preservation
A recently published parallel thinning approach [4] is evaluated. An improvement is suggested to enable preservation of certain diagonal lines which are not preserved by…
Concurrent operations on priority queues
Among the fastest priority queue implementations, skew heaps have properties that make them particularly suited to concurrent manipulation of shared queues. A concurrent…