A unified diode model for circuit simulation

A new commercially available diode model is described. This unified model is capable of simulating the widest range of diode technologies of any presently available. The emphasis of this paper is on describing the model's extensive features and flexibility in the different domains of operation and is of particular interest in power applications     

In times of survival, the right of silence

The purpose of this study was to assess cortical and cancellous bone responses to unilateral limb immobilization and, subsequently, to remobilization with exercise, in a young adult canine model. Right forelimbs of 14 1-2-year old mongrel dogs were immobilized in a non-weight-bearing position by a bandage for 16 weeks. Six control dogs were untreated. At 16 weeks, seven immobilized and three control dogs were euthanized. The remaining seven immobilized dogs began a recovery protocol consisting of 16 weeks of kennel confinement (without the right forelimb bandaged) followed by 16 weeks of treadmill exercise conducted three times per week. These seven dogs and three control dogs were euthanized at 48 weeks. Bone mineral density of the proximal radii was determined with dual-energy X-ray absorptiometry and humeral middiaphyseal cross-sectional areas were determined with computed tomography. Humeri were tested in cranio-caudal three-point bending to failure. Cancellous bone cores from the lateral humeral condyles had wet apparent density determined and were tested to failure in compression. Mechanical properties, bone density, and cross-sectional areas were compared between immobilized (right forelimb), contralateral weight bearing (left forelimb), and control forelimbs with Kruskal-Wallis and post hoc tests. At 16 weeks, bone mineral density, cortical load, yield, and stiffness as well as cancellous bone failure stress, yield stress, and modulus were significantly lower (p < 0.02) for immobilized limbs than control limbs. Immobilized limb cancellous bone mechanical properties were 28%-74% of control values, and cortical bone mechanical properties were 71%-98% of control values. After 32 weeks of remobilization, cortical and cancellous bone mechanical properties were not different from control values except that cortical bone failure stress and modulus were significantly higher (p < 0.01) between remobilized and control limbs. In summary, 16 weeks of forelimb immobilization was associated with significantly lower mechanical properties, and with greater differences in cancellous than cortical bone properties. Mechanical properties were not different from control values after 32 weeks of recovery that included 16 weeks of treadmill exercise.     

Coronary bypass in vascular patients: a relatively high-risk procedure

A premise of cardiac risk stratification is that the added risk of coronary artery bypass grafting (CABG) is offset by the improved safety of subsequent vascular reconstruction (VR). We questioned if elective CABG is patients with severe peripheral vascular disease (PVD) is a relatively high-risk procedure. A cohort study of 680 elective CABG patients from January 1993 to December 1994 was performed using three mutually exclusive outcomes of complication-free survival, morbidity, and mortality. Patient characteristic, operative, and outcome data were prospectively collected. Retrospective review determined that 58 patients had either a standard indication for or a history of VR. Overall CABG mortality was 2.5%, with statistically similar but relatively higher rates for PVD as compared to non-PVD patients. In contrast, major morbidity occurred at rates 3.6-fold higher in PVD patients (39.7%) than in disease-free patients (16.7%) after adjustment for the effects of patient and operative variables (odds ratio [OR] 3.67, 95% confidence interval [CI] 1.93-6.99). CABG morbidity in the PVD patient was most likely in those patients with aortoiliac (OR 9.51, CI 3.20-28.27) and aortic aneurysmal (OR 5.24, CI 1.28-21.41) disease types. CABG in PVD patients is associated with significant major morbidity. Such morbidity may preclude or alter the timing of subsequent VR.     

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.     

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     

Constant-time parallel algorithms for image labeling on areconfigurable network of processors

A constant-time algorithm for labeling the connected components of an N×N image on a reconfigurable network of N³ processors is presented. The main contribution of the algorithm is a novel constant-time technique for determining the minimum-labeled PE in each component. The number of processors used by the algorithm can be reduced to N/sup 2+(1/d/), for any 1⩽d⩽log N, if O(d) time is allowed     

Parallel architecture for fast transforms with trigonometric kernel

We present an unified parallel architecture for four of the most important fast orthogonal transforms with trigonometric kernel: Complex Valued Fourier (CFFT), Real Valued Fourier (RFFT), Hartley (FHT), and Cosine (FCT). Out of these, only the CFFT has a data flow coinciding with the one generated by the successive doubling method, which can be transformed on a constant geometry flow using perfect unshuffle or shuffle permutations. The other three require some type of hardware modification to guarantee the constant geometry of the successive doubling method. We have defined a generalized processing section (PS), based on a circular CORDIC rotator, for the four transforms. This PS section permits the evaluation of the CFFT and FCT transforms in n data recirculations and the RFFT and FHT transforms in n-1 data recirculations, with n being the number of stages of a transform of length N=rⁿ. Also, the efficiency of the partitioned parallel architecture is optimum because there is no cycle loss in the systolic computation of all the butterflies for each of the four transforms     

The classification, fusion, and parallelization of array languageprimitives

We present a classification scheme for array language primitives that quantifies the variation in parallelism and data locality that results from the fusion of any two primitives. We also present an algorithm based on this scheme that efficiently determines when it is beneficial to fuse any two primitives. Experimental results show that five LINPACK routines report 50% performance improvement from the fusion of array operators