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.     

Low-truncation-error finite difference equations for photonicssimulation. II. Vertical-cavity surface-emitting lasers

For part I see, ibid., p. 134, 1998. The basic approach outlined in the previous article is applied to the difficult problem of computing the optical modes of a vertical-cavity surface-emitting laser. The formulation utilizes a finite difference equation based upon the lowest order term of an infinite series solution of the scalar Helmholtz equation in a local region. This difference equation becomes exact in the one-dimensional (1-D) limit, and is thus ideally suited for nearly 1-D devices such as vertical-cavity lasers. The performance of the resulting code is tested on both a simple cylindrical cavity with known solutions and an oxide-confined vertical-cavity laser structure, and the results compared against second-order-accurate code based upon Crank-Nicolson differencing     

On the reliability of Landsat TM for estimating forest variables byregression techniques: a methodological analysis

In order to build models that relate thematic mapper (TM) imagery to field forest variables, several regression techniques, such as the ones based on the Mallows' C_p and the adjusted R² statistics, were applied. Nevertheless, although the best created models had good fittings (R²>0.65) apparently supported by a clear statistical significance (p<0.0001), later trials tested with additional plots showed that these models were, in fact, nonrobust models (models with very low-predictive capabilities). Two factors were pointed out as causes of these inconsistencies between predicted and observed values: a relatively small number of available field plots and a relatively high number of possible independent variables. Actually, different trials suggested much lower fittings for the expected “really” predictive models. Some restrictions of TM satellite data, such as its radiometric, spectral, and spatial limitations, together with restrictions arising from gathering and processing of field data, might have led to these poor relations. This study shows the need for guarantees stronger than the usual ones before concluding that there is a clear possibility of using satellite information to estimate forest parameters by means of regression techniques     

Partial indexing for nonuniform data distributions in relationalDBMS's

It is well known that the effectiveness of relational database systems is greatly dependent on the efficiency of the data access strategies. For this reason, much work has been devoted to the development of new access techniques, supported by adequate access structures such as the B⁺trees. The effectiveness of the B ⁺tree also depends on the data distribution characteristics; in particular, poor performance results when the data show strong key value distribution unbalancing. The aim of this paper is to present the partial index: a new access structure that is useful in such cases of unbalancing, as an alternative to the B⁺tree unclustered indexes. The access structures are built in the physical design phase, and at execution (or compilation) time, the optimizer chooses the most efficient access path. Thus, integration of the partial indexing technique in the design and in the optimization process are also described     

Evaluation of a parallel branch-and-bound algorithm on a class ofmultiprocessors

We propose and evaluate a parallel “decomposite best-first” search branch-and-bound algorithm (dbs) for MIN-based multiprocessor systems. We start with a new probabilistic model to estimate the number of evaluated nodes for a serial best-first search branch-and-bound algorithm. This analysis is used in predicting the parallel algorithm speed-up. The proposed algorithm initially decomposes a problem into N subproblems, where N is the number of processors available in a multiprocessor. Afterwards, each processor executes the serial best-first search to find a local feasible solution. Local solutions are broadcasted through the network to compute the final solution. A conflict-free mapping scheme, known as the step-by-step spread, is used for subproblem distribution on the MIN. A speedup expression for the parallel algorithm is then derived using the serial best-first search node evaluation model. Our analysis considers both computation and communication overheads for providing realistic speed-up. Communication modeling is also extended for the parallel global best-first search technique. All the analytical results are validated via simulation. For large systems, when communication overhead is taken into consideration, it is observed that the parallel decomposite best-first search algorithm provides better speed-up compared to other reported schemes     

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     

The fault-tolerant extension problem for complete multipartitenetworks

We develop a characterization for m-fault-tolerant extensions, and for optimal m-fault-tolerant extensions, of a complete multipartite graph. Our formulation shows that this problem is equivalent to an interesting combinatorial problem on the partitioning of integers. This characterization leads to a new procedure for constructing an optimal m-fault-tolerant extension of any complete multipartite graph, for any m⩾0. The proposed procedure is mainly useful when the size of the graph is relatively small, because the search time required is exponential. This exponential search, however, is not always necessary. We prove several necessary conditions that help us, in several cases, to identify some optimal m-fault-tolerant extensions without performing any search