We describe a speech-based interface to an information visualization (infoVis) system. Users ask natural-language questions about a given data domain. Our interface then maps the questions into infoVis operations, which result in the display of data visualizations that address the questions. Users can interact with these views via speech or direct manipulation. If users give incomplete information, our interface guides them in clarifying their questions. The intelligence behind our interface is encapsulated in a service logic that embodies domain knowledge about both the data being explored and the infoVis system. This allows users to focus on answering questions, rather than on the mechanics of accessing data and creating views.

A form-based service is one in which the flow of data between service and user is described by a sequence of query/response interactions, or forms. Mawl is a domain-specific language for programming form-based services in a device-independent manner. We focus on Mawl's form abstraction, which is the means for separating service logic from user interface description, and show how this simple abstraction addresses seven issues in service creation, analysis, and maintenance: compile-time guarantees, implementation flexibility, rapid prototyping, testing and validation, support for multiple devices, composition of services, and usage analysis.

In this paper program visualization is defined as a mapping from programs to graphical representations. Simple forms of program visualization are frequently encountered in software engineering. For this reason current advances in program visualization are likely to influence future developments concerning software engineering tools and environments. This paper provides a new taxonomy of program visualization research. The proposed taxonomy becomes the vehicle through which we carry out a systernatic review of current systems, techniques, trends, and ideas in program visualization.

This paper is concerned with the use of program visualization as a means for the understanding, debugging, and monitoring of large-scale concurrent programs.Following an overview of the shared dataspace paradigm and the declarative approach to visualization, the paper discusses:(1) mechanisms for specifying declarative visualization in the shared dataspace paradigm and ways of relating the specifications to program verification; (2) a computational model which provides a unified framework for comparing both visual and nonvisual algorithms; and (3) strategies for implementing declarative visualization on parallel machines.

A methodology is presented for designing detectors which locate specific features in an image. The method is applied to the detection and segmentation of spherical features. A vital part of the detection and segmentation is the use of the gradient angle transform. An analysis of the gradient angle for ideal spheres is presented, with a discussion of how this may be used to locate the boundaries of the sphere. The algorithms used by a program which detects and segments spherical features are then presented. The results of applying the program to images with man-made spherical features are given.>

The authors are concerned with the development of a novel approach to edge-based stereo matching. In the context of an incremental matching strategy the authors have replaced the traditional hierarchical (coarse-fine) matching by an approach called complexity control based matching. The implementation of this method allows the user to select interactively features which (given the context provided by previous matches) are most likely to be matched successfully. The selection is done at the resolution of the original image and utilizes a rich set of feature properties (e.g. edge strength, orientation, length, texture etc.), either alone or in logical combinations. Both feature-selection and feature-matching algorithms execute at real-time rates, and all interactions are via a stereo workstation.>