Search
Join ACM

Systems and Networking

Advertisement

Research and Advances Nov 1 1986

Schematic pseudocode for program constructs and its computer automation by SCHEMACODE

To achieve program control flow representation that is relatively independent of any given programming language, schematic pseudocode (SPC) uses a perceptual notation system composed of schemata whose syntax rules are described by a grammar. Source code documentation is supported by operational comments, and translation into a target procedural language is fully automatic.
Research and Advances Nov 1 1986

An experimental program investigating color-enhanced and graphical information presentation: an integration of the findings

A series of three laboratory experiments were conducted to assess the influence of graphical and color-enhanced information presentation modes on decision quality, decision making time, use of information, and user perceptions. The experimental design allowed for the unconfounded study of line graphs and color using a variety of information presentation designs for the same decision making task. Based on the findings of these studies, propositions about the impact of graphics and color on individual decision makers are presented. The influence of presentation mode on human performance and the perceived value of information is related to how well it supports the solution approach to a particular task. The benefits of graphics are limited to reducing decision making time but only when the graphical report has been designed to directly assist in solving the task. Multicolor reports aid in decision making, but only in specific circumstances, that is, their benefits are not pervasive. It appears that color is more advantageous when associated with graphical reports, for certain decision maker types, during learning periods, and in time constrained environments.
, , and
Research and Advances Oct 1 1986

Min-max heaps and generalized priority queues

A simple implementation of double-ended priority queues is presented. The proposed structure, called a min-max heap, can be built in linear time; in contrast to conventional heaps, it allows both FindMin and FindMax to be performed in constant time; Insert, DeleteMin, and DeleteMax operations can be performed in logarithmic time. Min-max heaps can be generalized to support other similar order-statistics operations efficiently (e.g., constant time FindMedian and logarithmic time DeleteMedian); furthermore, the notion of min-max ordering can be extended to other heap-ordered structures, such as leftist trees.
, , , and
Research and Advances Oct 1 1986

Accessing bit fields in FORTRAN-77

By incorporating bit-manipulation routines into Fortran-77, it is now possible to manipulate bits or partial word operands without having to write assembly-coded subroutines. Because the routines are now acceptable to Fortran-77 compilers, the accessing code is now portable to other Fortran Machines.

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