Effect of race on outcome after kidney and kidney-pancreas transplantation in type 1 diabetic patients

OBJECTIVE: The racial impact on graft outcome is not well defined in diabetic recipients. The purpose of this study is to analyze our experience with kidney-alone (A) and kidney-pancreas (KP) transplantation in type 1 diabetic recipients and evaluate the impact of racial disparity on outcome. RESEARCH DESIGN AND METHODS: The records of 217 kidney transplants (118 KA, 99 KP) performed on type 1 diabetic patients between 1985 and 1995 at the Medical University of South Carolina and the University of Texas Medical Branch were reviewed. RESULTS: A total of 53 (31%) white patients and 15 (33%) black patients experienced at least one episode of biopsy-proven acute rejection of the renal graft (NS). Patient survival at 1, 2, and 5 years was similar in white (92, 87, 69%) and black (91, 91, 69%) patients (NS). Kidney graft survival at 1, 2, and 5 years in the KA group was 72, 62, and 42% in blacks, compared with 79, 76, and 53% in whites (NS). Kidney graft survival at 1, 2, and 5 years in the KP group was 92, 92, and 74% in blacks, compared with 83, 77, and 58% in whites (NS). Pancreas graft survival at 1, 2, and 5 years was 81, 81, and 81% in blacks, compared with 81, 75, and 62% in whites (NS). Cox regression analysis revealed that donor age > or = 40 years increased the risk of renal graft failure 6.2-fold (P = 0.0001), whereas the addition of a pancreas transplant to a kidney and a living-related transplant decreased the risk of failure of the kidney graft 0.2 (P = 0.005) and 0.1 times (P = 0.005). CONCLUSIONS: Our results suggest that when compared with whites, there may be a trend toward an improved kidney and pancreas graft outcome in blacks undergoing KP transplants. These findings suggest that diabetes may override the risk factors that account for the pronounced disparity in outcome observed between nondiabetic white and black recipients.     

Periodic discrete-time systems: stability analysis and robustcontrol using zero placement

A simple method (based on Floquet theory) for obtaining the characteristic equation (and hence stability) of periodic discrete-time systems is presented. Using this method it is shown that 2-periodic controllers can be used to relocate the zeros of SISO plants. Some examples are considered to illustrate the use of 2-periodic controllers for robust control of finite gain margin problems     

Superconductivity in hcp Li at high pressure

Recent experimental observations show that metallic lithium becomes a superconductor at high pressure. Here the theoretically calculated band structure as well as the superconducting transition temperature for this metal at 247 kbar pressure are reported. The band structure was obtained using the APW method. The superconducting transition temperature determined using the band structure results agrees fairly well with that measured experimentally.     

Support vector regression for determining the minimum zone sphericity

Several methods have been investigated to determine the deviation of manufactured spherical parts from ideal geometry. One of the most popular is the least squares technique, which is still widely employed in coordinate measuring machines used by industries. The least squares algorithm is optimal under the assumption that the data set is very large and has the inherent disadvantage of overestimating the minimum tolerance zone, resulting sometimes in the rejection of good parts. In addition, it requires that the data be distributed normally. The support vector regression approach alleviates the necessity for these assumptions. While most fitting algorithms in practice today require that the sampled data accurately represent the surface being inspected, support vector regression provides a generalization over the surface. We describe how the concepts of support vector regression can be applied to the determination of tolerance zones of nonlinear surfaces; to demonstrate the unique potential of support vector machine algorithms in the area of coordinate metrology. In specific, we address part quality inspection of spherical geometries.     

High-utility and diverse itemset mining

High-utility Itemset Mining (HUIM) finds patterns from a transaction database with their utility no less than a user-defined threshold. The utility of an itemset is defined as the sum of the utilities of its items. The utility notion enables a data analyst to associate a profit score with each item and thereof to a pattern. We extend the notion of high-utility with diversity to define a new pattern type called High-utility and Diverse pattern (HUD). The notion of diversity of a pattern captures the extent of the different categories covered by the selected items in the pattern. An application of diverse-pattern lies in the recommendation task where a system can recommend to a customer a set of items from a new class based on her previously bought items. Our notion of diversity is easy to compute and also captures the basic essence of a previously proposed diversity notion. The existing algorithm to compute frequent-diverse patterns is 2-phase, i.e., in the first phase, frequent patterns are computed, out of which diverse patterns are filtered out in the second phase. We, in this paper, give an integrated algorithm that efficiently computes high-utility and diverse patterns in a single phase. Our experimental study shows that our proposed algorithm is very efficient as compared to a 2-phase algorithm that extracts high-utility itemsets in the first phase and filters out the diverse itemsets in the second phase.

     

Valency of copper in 123 oxides

The valency of copper in freshly prepared as well asin situ high-temperature oxygen-treated 123 oxides was analysed by X-ray photoelectron spectroscopy. The results suggest the presence of Cu²⁺ and Cu³⁺ along with Cu⁺. This observation is supported by cyclic voltammograms of 123 oxides recorded in a formamide medium. The valence band of 1 23 oxides was probed using X-ray (MgK ) and ultraviolet (He-I) sources. It was observed that the Cu-O hybridized orbital in YBa₂Cu₃O_7–x responsible for conduction decreases with time in an ultrahigh vacuum and increases with oxygen treatment temperature.     

Orthogonal and fine lithographic structures attained from the next generation proton beam writing facility

A second generation proton beam writing (PBW) system has been built at the Centre for Ion Beam Applications at the National University of Singapore for fabrication of high aspect ratio 3D nano lithographic structures. System improvements and a few lithographic structures obtained with this facility are presented in this paper. Through accurate alignment of the magnetic quadrupole lenses and the electrostatic scanning system, orthogonal beam scanning has been achieved. The earlier constrain of limited beam scan area has been overcome by adopting a combination of beam and stage scanning as well as stitching. With these improvements smallest ever Ni structure of 65 nm in width has been fabricated using nickel electroplating on a proton beam written PMMA sample in the second generation PBW facility. Using this improved PBW facility, we have also demonstrated the fabrication of fine lithographic patterns with 19 nm line width and 60 nm spacing in 100 nm thick negative high resolution hydrogen silsesquioxane resist. Future possible system improvements leading to finer resolution will be discussed briefly.     

An SDP Primal-Dual Algorithm for Approximating the Lovász-Theta Function

The Lovász ?-function (Lovász in IEEE Trans. Inf. Theory, 25:1–7, 1979) of a graph G=(V,E) can be defined as the maximum of the sum of the entries of a positive semidefinite matrix X, whose trace Tr(X) equals 1, and X _ij =0 whenever {i,j}∈E. This function appears as a subroutine for many algorithms for graph problems such as maximum independent set and maximum clique. We apply Arora and Kale’s primal-dual method for SDP to design an algorithm to approximate the ?-function within an additive error of δ>0, which runs in time $O(\frac{\vartheta ^{2} n^{2}}{\delta^{2}} \log n \cdot M_{e})$ , where ?=?(G) and M _e =O(n ³) is the time for a matrix exponentiation operation. It follows that for perfect graphs G, our primal-dual method computes ?(G) exactly in time O(? ² n ⁵logn). Moreover, our techniques generalize to the weighted Lovász ?-function, and both the maximum independent set weight and the maximum clique weight for vertex weighted perfect graphs can be approximated within a factor of (1+?) in time O(? ^?2 n ⁵logn).     

Shape from Sharp and Motion-Blurred Image Pair

Motion blur due to camera shake is a common occurrence. During image capture, the apparent motion of a scene point in the image plane varies according to both camera motion and scene structure. Our objective is to infer the camera motion and the depth map of static scenes using motion blur as a cue. To this end, we use an unblurred–blurred image pair. Initially, we develop a technique to estimate the transformation spread function (TSF) which symbolizes the camera shake. This technique uses blur kernels estimated at different points across the image. Based on the estimated TSF, we recover the complete depth map of the scene within a regularization framework.