An evaluation of space time cube representation of spatiotemporal patterns.

Space time cube representation is an information visualization technique where spatiotemporal data points are mapped into a cube. Information visualization researchers have previously argued that space time cube representation is beneficial in revealing complex spatiotemporal patterns in a data set to users. The argument is based on the fact that both time and spatial information are displayed simultaneously to users, an effect difficult to achieve in other representations. However, to our knowledge the actual usefulness of space time cube representation in conveying complex spatiotemporal patterns to users has not been empirically validated. To fill this gap, we report on a between-subjects experiment comparing novice users' error rates and response times when answering a set of questions using either space time cube or a baseline 2D representation. For some simple questions, the error rates were lower when using the baseline representation. For complex questions where the participants needed an overall understanding of the spatiotemporal structure of the data set, the space time cube representation resulted in on average twice as fast response times with no difference in error rates compared to the baseline. These results provide an empirical foundation for the hypothesis that space time cube representation benefits users analyzing complex spatiotemporal patterns.

The Trade-offs with Space Time Cube Representation of Spatiotemporal Patterns

Space time cube representation is an information visualization technique where spatiotemporal data points are mapped into a cube. Fast and correct analysis of such information is important in for instance geospatial and social visualization applications. Information visualization researchers have previously argued that space time cube representation is beneficial in revealing complex spatiotemporal patterns in a dataset to users. The argument is based on the fact that both time and spatial information are displayed simultaneously to users, an effect difficult to achieve in other representations. However, to our knowledge the actual usefulness of space time cube representation in conveying complex spatiotemporal patterns to users has not been empirically validated. To fill this gap we report on a between-subjects experiment comparing novice users error rates and response times when answering a set of questions using either space time cube or a baseline 2D representation. For some simple questions the error rates were lower when using the baseline representation. For complex questions where the participants needed an overall understanding of the spatiotemporal structure of the dataset, the space time cube representation resulted in on average twice as fast response times with no difference in error rates compared to the baseline. These results provide an empirical foundation for the hypothesis that space time cube representation benefits users when analyzing complex spatiotemporal patterns.

Transient natural ventilation of a space with localised heating

The natural ventilation of a well-mixed, pre-heated room with a point source of heating, and openings at the base and roof is investigated. The transient draining associated with the room being warmer than the exterior combined with the convective ow produced by the point source of heat leads to a fascinating series of transient ow regimes as the system evolves to the two-layer steady-state regime described by Linden, Lane-Ser_ and Smeed [1]. As the room begins to ventilate, a turbulent plume rises from the point source of heat to the ceiling, and typically forms a deepening layer of hot air. However, with a weak heat source, then at some point the ascending plume will intrude beneath the layer of original uid. Otherwise, the ascending plume always reaches the top of the room as the system evolves to a steady state. We develop a simpli_ed model of the transient evolution and test this with some new laboratory experiments. We conclude with a discussion of the implications of our results for real buildings.

Computer generated hologram with geometric occlusion using GPU-accelerated depth buffer rasterization for three-dimensional display

We present a method of rapidly producing computer-generated holograms that exhibit geometric occlusion in the reconstructed image. Conceptually, a bundle of rays is shot from every hologram sample into the object volume.We use z buffering to find the nearest intersecting object point for every ray and add its complex field contribution to the corresponding hologram sample. Each hologram sample belongs to an independent operation, allowing us to exploit the parallel computing capability of modern programmable graphics processing units (GPUs). Unlike algorithms that use points or planar segments as the basis for constructing the hologram, our algorithm's complexity is dependent on fixed system parameters, such as the number of ray-casting operations, and can therefore handle complicated models more efficiently. The finite number of hologram pixels is, in effect, a windowing function, and from analyzing the Wigner distribution function of windowed free-space transfer function we find an upper limit on the cone angle of the ray bundle. Experimentally, we found that an angular sampling distance of 0:01' for a 2:66' cone angle produces acceptable reconstruction quality. © 2009 Optical Society of America.

Reconfigurable free-space optical switching technologies for storage area networks

Reconfigurable shutter-based free-space optical switching technologies using fiber ribbon and multiple wavelengths per fiber for Storage Area Networks (SANs) application are presented and demonstrated. ©2009 SPIE-OSA-IEEE.

Reconfigurable free-space optical switching technologies for storage area networks

Reconfigurable shutter-based free-space optical switching technologies using fiber ribbon and multiple wavelengths per fiber for Storage Area Networks (SANs) application are presented and demonstrated. ©2009 Optical Society of America.

Free-Space Interconnect for Optical Switch and Analogue Neural Network

In this paper, the architecture of a vector-matrix multiplier (MVM) is simulated. The optical design can be made compact by the use of GRIN lenses for the optical fan-in. The intended application area was in storage area networks (SANs) but the concept can be applied to a neural network. © 2011 Allerton Press, Inc.