Vascular morphology by three-dimensional magnetic resonance imaging

A three-dimensional examination of blood vessels is provided using MR data from seven cases. The vascular surfaces are constructed with an algorithm that automatically follows the selected artery or vein and generates a projected three-dimensional gradient shaded image. Fast 3DFT pulse sequences were optimized to enhance the time-of-flight contrast of the intravascular region. By increasing the surface threshold value in a three-dimensional head study, the flesh of a patient's face was peeled away to demonstrate the superfacial temporal artery. Gated cardiac images show the great vessels and cardiac chambers. A three-dimensional view of the aorta shows an irregular surface in the vicinity of an adrenal tumor. 3D MR exams provide a non-invasive technique for assessing vascular morphology in a clinical setting.     

On the feasibility of antideuteron production and storage at CERN

The new Antiproton Accumulator Complex is now in operation at CERN. We consider the possibility of using this facility to create and store antideuterons and conclude that we could achieve an accumulation rate of about 2·10⁶ particles/day. No major rebuild of the rings is envisaged, but it is thought that modification to existing components and becoming operational would take about 5 to 6 months. We stress, however, that the operation of such a facility and the use of any stack of antideuterons for particle physics would be extremely taxing.     

Isolation and On‐Line LC/CD Analysis of 3,8″‐Linked Biflavonoids from Gnidia involucrata

Investigation of the methanol extract of the roots of Gnidia involucrata (Thymelaeaceae) led to the isolation and characterization of two new 3,8″‐biflavonoid diastereoisomers, named GB‐4 ( 6a ) and GB‐4a ( 6b ). Their absolute configurations were determined in mixture by on‐line LC/CD measurements, which also allowed the revision of absolute configurations of the biflavanoids GB‐1 and GB‐2, and the configurational assignment of GB‐3.     

Fractional Brownian Heavy Traffic Approximations of Multiclass Feedforward Queueing Networks

We consider multiclass feedforward queueing networks under first in first out and priority service disciplines driven by long-range dependent arrival and service time processes. We show that in critical loading the normalized workload, queue length and sojourn time processes can converge to a multi-dimensional reflected fractional Brownian motion. This weak heavy traffic approximation is deduced from a deterministic pathwise approximation of the network behavior close to constant critical load in terms of the solution of a Skorokhod problem. Since we model the doubly infinite time interval, our results directly cover the stationary case.AMS subject classification: primary 90B15, secondary 60K25, 68M20     

Negative luminescence from mid-wave infrared HgCdTe diode arrays

A self-referencing, optical modulation technique was used to measure the negative luminescence efficiencies of an array of mid-wave infrared HgCdTe photodiodes with cutoff wavelength 4.6 μm as a function of sample temperature. The internal efficiency at a wavelength of 4 μm was 93% at 295 K, and nearly independent of temperature in the 240–300 K range. This corresponds to an apparent temperature reduction >50 K at room temperature and >30 K at 240 K. Moreover, the reverse-bias saturation current density was only 0.13 A/cm². The measured transmission and emission spectra were simulated using empirical HgCdTe absorption formulas from the literature.     

Explicit 2-Factorisations of the Odd Graph

In this note we show how 1-factors in the middle two layers of the discrete cube can be used to construct 2-factors in the Odd graph (the Kneser graph of (k − 1)-sets from a (2k − 1)-set). In particular, we use the lexical matchings of Kierstead and Trotter, and the modular matchings of Duffus, Kierstead and Snevily, to give explicit constructions of two different 2-factorisations of the Odd graph. This revised version was published online in September 2006 with corrections to the Cover Date.     

Structural reliability and stochastic structural optimization

Mathematical Methods of Operations Research -     

Volumetric path following algorithms for linear programming

We consider the construction of small step path following algorithms using volumetric, and mixed volumetric-logarithmic, barriers. We establish quadratic convergence of a volumetric centering measure using pure Newton steps, enabling us to use relatively standard proof techniques for several subsequently needed results. Using a mixed volumetric-logarithmic barrier we obtain an O(n ^1/4 m ^1/4 L) iteration algorithm for linear programs withn variables andm inequality constraints, providing an alternative derivation for results first obtained by Vaidya and Atkinson. In addition, we show that the same iteration complexity can be attained while holding the work per iteration to O(n ² m), as opposed to O(nm ²), operations, by avoiding use of the true Hessian of the volumetric barrier. Our analysis also provides a simplified proof of self-concordancy of the volumetric and mixed volumetric-logarithmic barriers, originally due to Nesterov and Nemirovskii. This paper was first presented at the 1994 Faculty Research Seminar “Optimization in Theory and Practice”, at the University of Iowa Center for Advanced Studies.