Time dependent processing in a parallel pipeline architecture

Pipeline architectures provide a versatile and efficient mechanism for constructing visualizations, and they have been implemented in numerous libraries and applications over the past two decades. In addition to allowing developers and users to freely combine algorithms, visualization pipelines have proven to work well when streaming data and scale well on parallel distributed-memory computers. However, current pipeline visualization frameworks have a critical flaw: they are unable to manage time varying data. As data flows through the pipeline, each algorithm has access to only a single snapshot in time of the data. This prevents the implementation of algorithms that do any temporal processing such as particle tracing; plotting over time; or interpolation, fitting, or smoothing of time series data. As data acquisition technology improves, as simulation time-integration techniques become more complex, and as simulations save less frequently and regularly, the ability to analyze the time-behavior of data becomes more important. This paper describes a modification to the traditional pipeline architecture that allows it to accommodate temporal algorithms. Furthermore, the architecture allows temporal algorithms to be used in conjunction with algorithms expecting a single time snapshot, thus simplifying software design and allowing adoption into existing pipeline frameworks. Our architecture also continues to work well in parallel distributed-memory environments. We demonstrate our architecture by modifying the popular VTK framework and exposing the functionality to the ParaView application. We use this framework to apply time-dependent algorithms on large data with a parallel cluster computer and thereby exercise a functionality that previously did not exist.     

Compositional pattern producing networks: A novel abstraction of development

Natural DNA can encode complexity on an enormous scale. Researchers are attempting to achieve the same representational efficiency in computers by implementing developmental encodings, i.e. encodings that map the genotype to the phenotype through a process of growth from a small starting point to a mature form. A major challenge in in this effort is to find the right level of abstraction of biological development to capture its essential properties without introducing unnecessary inefficiencies. In this paper, a novel abstraction of natural development, called Compositional Pattern Producing Networks (CPPNs), is proposed. Unlike currently accepted abstractions such as iterative rewrite systems and cellular growth simulations, CPPNs map to the phenotype without local interaction, that is, each individual component of the phenotype is determined independently of every other component. Results produced with CPPNs through interactive evolution of two-dimensional images show that such an encoding can nevertheless produce structural motifs often attributed to more conventional developmental abstractions, suggesting that local interaction may not be essential to the desirable properties of natural encoding in the way that is usually assumed.

Using difference intervals for time-varying isosurface visualization

We present a novel approach to out-of-core time-varying isosurface visualization. We attempt to interactively visualize time-varying datasets which are too large to fit into main memory using a technique which is dramatically different from existing algorithms. Inspired by video encoding techniques, we examine the data differences between time steps to extract isosurface information. We exploit span space extraction techniques to retrieve operations necessary to update isosurface geometry from neighboring time steps. Because only the changes between time steps need to be retrieved from disk, I/O bandwidth requirements are minimized. We apply temporal compression to further reduce disk access and employ a point-based previewing technique that is refined in idle interaction cycles. Our experiments on computational simulation data indicate that this method is an extremely viable solution to large time-varying isosurface visualization. Our work advances the state-of-the-art by enabling all isosurfaces to be represented by a compact set of operations.     

Self-improving process control for molecular beam epitaxy

This paper addresses manufacturing research involving advances in material process control. The research objective has been to develop intelligent, self-directed and self-improving control systems which enablein situ (real-time) control path generation based on both product (material behaviour) and processing (control agent) feedback. A product-process control philosophy which emphasises product quality is described together with a generic architecture for representing product and process knowledge.Specific details are presented involving the development and application of a self-directed and self-improving material processing system for molecular beam epitaxy of gallium arsenide wafers. Special emphasis is given to the development of a neural model for self-improving control as well as future research directions.     

Tradeoffs in Motor Branch Circuit Protection

Under the National Electrical Code, an engineer designing a motor branch circuit has the option of selecting motor short circuit protectors (MSCP's), one of two kinds of circuit breakers, or one of several classes of fuses for his short circuit protection means. In making his decision, he evaluates initial cost, convenience, degree of protection, replacement cost, etc. This paper outlines these tradeoffs in a concise manner so that an individual selecting short circuit protection for a motor branch circuit can be aware of them and select the protective device which optimizes the concerns he feels are most important.     

Determination of the Superconducting Penetration Depth From Coplanar-Waveguide Measurements

We introduce a novel transmission-line method for determining the penetration depth in thin high-temperature superconducting (HTS) films. The method is based on the accurate measurement of the inductance per unit length of a superconducting coplanar-waveguide (CPW) transmission line fabricated on the HTS sample. Using the experimentally obtained inductance per unit length, we interpolate the penetration depth from a table of numerically determined values of inductance (per unit length) as a function of penetration depth, calculated from a coupled transmission-line model. A novelty of our procedure is the utilization of the multiline thru-reflect-line (TRL) method and the calibration-comparison method to accurately determine the inductance per unit length of the superconducting transmission line. By measuring different CPW geometries patterned onto the same thin-film sample, we can verify our penetration depth values. We demonstrate this technique by extracting the penetration depth for several different HTS films at 76 K. Estimated uncertainties in the extracted penetration depth are also provided. Contribution of an agency of the US government not subject to copyright.     

A study of Cu/Low-k stress-induced voiding at via bottom and its microstructure effect

Microstructure effect of Cu/low-k interconnect, which is substantially affected by process condition or manufacturing deviation, is a dominated factors for copper stress and critical to the formation of stress-induced voiding (SIV). In this work, SIV at via bottom is studied in the aspects of thickness variation of copper interconnect and low-k dielectric. Besides, via-related factors consist of via profile and dimension are also involved in SIV sensitivity studies. With the assistance of finite element analysis (FEA), Cu stress in terms of different Cu/low-k microstructure scenarios are modelled to understand the voiding evolution and explore the their dependence with SIV susceptibility. Meanwhile, microstructure effects with and without redundant via are also simulated to evaluate their impacts on SIV immunity.     

Efficient surface reconstruction from contours based on two‐dimensional Delaunay triangulation

This paper introduces an efficient method for surface reconstruction from sectional contours. The surface between neighbouring sections is reconstructed based on the consistent utilization of the two‐dimensional constrained Delaunay triangulation. The triangulation is used to extract the parametric domain and to solve the problems associated with correspondence, tiling and branching in a general framework. Natural distance interpolations are performed in order to complete the mapping of the added intermediate points. Surface smoothing and remeshing are conducted to optimize the initial surface triangulations. Several examples are presented to demonstrate the effectiveness and efficiency of the proposed approach. Copyright © 2005 John Wiley & Sons, Ltd.