Abstract
This paper presents a new analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutativity analysis views the computation as composed of operations on objects. It then analyzes the program at this granularity to discover when operations commute (i.e. generate the same final result regardless of the order in which they execute). If all of the operations required to perform a given computation commute, the compiler can automatically generate parallel code. We have implemented a prototype compilation system that uses commutativity analysis as its primary analysis framework. We have used this system to automatically parallelize two complete scientific computations: the Barnes-Hut N-body solver and the Water code. This paper presents performance results for the generated parallel code running on the Stanford DASH machine. These results provide encouraging evidence that commutativity analysis can serve as the basis for a successful parallelizing compiler.

Abstract
This paper presents a reference position on the relation between manufacturing systems and work organisation strategies, It raises some issues and advances a methodological framework in the development of information/manufacturing systems and work organisation design methods. as to reach a balanced influence of the technology, organisation and people aspects in Complex Manufacturing Environments (CME). In this sense it is not presenting research results but, with the underlying goal of implementing a laboratory environment for the study of technical and or organisational developmental aspects of CMEs, there are overviewed the R&D requirements for an interdisciplinary approach involving Computer and Social Sciences. The main scientific areas analysed are Enterprise Integration and Work Organisation, focusing on the methodological aspects of each one.

Abstract
This paper presents a new analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutativity analysis views the computation as composed of operations on objects. It then analyzes the program at this granularity to discover when operations commute (i.e. generate the same final result regardless of the order in which they execute). If all of the operations required to perform a given computation commute, the compiler can automatically generate parallel code. We have implemented a prototype compilation system that uses commutativity analysis as its primary analysis framework. We have used this system to automatically parallelize two complete scientific computations: the Barnes-Hut N-body solver and the Water code. This paper presents performance results for the generated parallel code running on the Stanford DASH machine. These results provide encouraging evidence that commutativity analysis can serve as the basis for a successful parallelizing compiler. © 1996 ACM.

Abstract
An optical sensor capable of simultaneously measuring displacement and temperature is presented. It incorporates a fiber Bragg grating temperature sensor and a low-finesse extrinsic Fabry-Perot cavity. A white light tandem interferometric technique is used to recover signal from the low finesse cavity. Signals obtained from the interferometer and the Bragg grating provide required information to simultaneously determine temperature and displacement. Experimental results are presented which demonstrate the feasibility of this sensor topology in practical applications.

Abstract
A 3-D data acquisition and scene segmentation system is described. For 3-D data acquisition a structured light technique based on the ratio of two intensity images is used. This technique avoids the correspondence problem, that appears in other structured light techniques, and allows the acquisition of dense range images. The calibration steps of the system are described. Measurement results with different scenes are presented and system accuracy is evaluated. Taking into account that this system allows the acquisition of a dense range image and an intensity image, registered with it, a new approach to the segmentation of 3-D scenes using both range and intensity information is proposed. The two images are segmented separately and iteratively. At each iteration, the segmentation results are combined. The segmentation proceeds until all segments are planar or no more splits are possible. A two-step merging procedure follows: first, planar surfaces that may have been split are "reconstructed", by merging adjacent planar regions that satisfy some constraints; then, regions belonging to curved surfaces are identified and merged, using a curvature analysis along line segments delimited by edge points, combined from both images. Finally, the resulting surfaces are described, using adequate functions. © 1996 IEEE.

Abstract
Ray-Tracing is a well known algorithm that simulates the reflection and refraction of light rays in the objects surfaces, beginning with rays sent from the view point. Each ray has to be tested against objects in the 3D scene and this is very time consuming. This paper describes one parallel solution. It is oriented to a general network, where each processor manages data and tasks and shares them with the others to optimise common resources utilisation. In this context, a Virtual Sharing Memory (VSM) is used and an efficient load balancing strategy can be implemented. With this approach, the amount of messages in the network tends to increase and strategies to reduce them are needed. Schemes to optimise remote accesses to data have been developed, namely a special type of multicast message addressing named InPathTo. © Springer-Verlag Berlin Heidelberg 1997.