Soft commutation in capacitive idling converters

The capacitive idling converters derived from the Cuk, SEPIC, Zeta, and flyback topologies allow soft commutation of power switches without the need for additional circuitry, making it possible to increase the switching frequency while maintaining high efficiency     

Low temperature delamination of plastic encapsulated microcircuits

Plastic encapsulated microcircuits (PEMs) are increasingly being used in applications requiring operation at temperatures lower than the manufacturer’s recommended minimum temperature, which is 0°C for commercial grade components and −40°C for industrial and automotive grade components. To characterize the susceptibility of PEMs to delamination at these extreme low temperatures, packages with different geometries, encapsulated in both biphenyl and novolac molding compounds, were subjected to up to 500 thermal cycles with minimum temperatures in the range −40 to −65°C in both the moisture saturated and baked conditions. Scanning acoustic microscopy revealed there was a negligible increase in delamination at the die-to-encapsulant interface after thermal cycling for the 84 lead PQFPs encapsulated in novolac and for both 84 lead PQFPs and 14 lead PDIPs encapsulated in biphenyl molding compound. Only the 14 lead novolac PDIPs exhibited increased delamination. Moisture exposure had a significant effect on the creation of additional delamination.     

Scientific and artistic investigation of multi-dimensional fractals on the AT & T pixel machine

The pipelined architecture and parallel organization of the AT&T Pixel Machine image computer are described and demonstrated with applications for the visualization of multidimensional fractals, particularly linear fractals and quaternion/ stacked Julia sets. Techniques for pushing the Pixel Machine to its peak abilities are described and apply to more recent parallel image computers as well.     

Analysis of volatiles evolved during high-temperature treatment of thermally stable polymers. I. Nitrogen-containing acetylene-terminated resin

Cured samples of a nitrogen-containing acetylene-terminated resin, N,N′-(1,3-phenylene-dimethylidene)bis(3-ethynylaniline), have been heated at 10°C/min up to 900°C in a pyroprobe attached to a gas chromatograph/mass spectrometer (GC/MS). Analysis of the volatiles evolved during heating identified both gases and higher boiling compounds. The major higher boiling compounds are benzene, toluene, xylene, aniline, benzonitrile, m-methylaniline, and m-methylbenzonitrile; the gases include ammonia, methane, and traces of carbon dioxide. Correlations between sample temperature and the evolution of each of these compounds have been made. The onset of all volatile formation occurs between 450 and 500°C. The higher boiling volatiles peak, then end by approximately 700°C, while the gases peak then fall off but are still being evolved at 900°C. Average weight loss measurements of 13.6% at 700°C and 15.7% at 900°C agree with previously published thermogravimetric analysis (TGA) data. © 1993 John Wiley & Sons, Inc.     

Function materialization in object bases: design, realization, andevaluation

View materialization is a well-known optimization technique of relational database systems. We present a similar, yet more powerful, optimization concept for object-oriented data models: function materialization. Exploiting the object-oriented paradigm-namely, classification, object identity, and encapsulation-facilitates a rather easy incorporation of function materialization into (existing) object-oriented systems. Only those types (classes) whose instances are involved in some materialization are appropriately modified and recompiled, thus leaving the remainder of the object system invariant. Furthermore, the exploitation of encapsulation (information hiding) and object identity provides for additional performance tuning measures that drastically decrease the invalidation and rematerialization overhead incurred by updates in the object base. First, it allows us to cleanly separate the object instances that are irrelevant for the materialized functions from those that are involved in the materialization of some function result, and this to penalize only those involved objects upon update. Second, the principle of information hiding facilitates fine-grained control over the invalidation of precomputed results. Based on specifications given by the data type implementor, the system can exploit operational semantics to better distinguish between update operations that invalidate a materialized result and those that require no rematerialization. The paper concludes with a quantitative analysis of function materialization based on two sample performance benchmarks obtained from our experimental object base system GOM     

RAPS: a rule-based language for specifying resource allocation andtime-tabling problems

A general language for specifying resource allocation and time-tabling problems is presented. The language is based on an expert system paradigm that was developed previously by the authors and that enables the solution of resource allocation problems by using experts' knowledge and heuristics. The language enables the specification of a problem in terms of resources, activities, allocation rules, and constraints, and thus provides a convenient knowledge acquisition tool. The language syntax is powerful and allows the specification of rules and constraints that are very difficult to formulate with traditional approaches, and it also supports the specification of various control and backtracking strategies. We constructed a generalized inference engine that runs compiled resource allocation problem specification language (RAPS) programs and provides all necessary control structures. This engine acts as an expert system shell and is called expert system for resource allocation (ESRA). The performance of RAPS combined with ESRA is demonstrated by analyzing its solution of a typical resource allocation problem     

Sort vs. hash revisited

Efficient algorithms for processing large volumes of data are very important both for relational and new object-oriented database systems. Many query-processing operations can be implemented using sort- or hash-based algorithms, e.g. intersections, joins, and duplicate elimination. In the early relational database systems, only sort-based algorithms were employed. In the last decade, hash-based algorithms have gained acceptance and popularity, and are often considered generally superior to sort-based algorithms such as merge-join. In this article, we compare the concepts behind sort- and hash-based query-processing algorithms and conclude that (1) many dualities exist between the two types of algorithms, (2) their costs differ mostly by percentages rather than by factors, (3) several special cases exist that favor one or the other choice, and (4) there is a strong reason why both hash- and sort-based algorithms should be available in a query-processing system. Our conclusions are supported by experiments performed using the Volcano query execution engine