Applications of coupled LC-GC: A review

Although coupled liquid chromatographygas chromatography (LC-GC) was first demonstrated ten years ago, only in the last few years has there been a sudden surge of interest in the technique. Approximately 70% of the total number of LC-GC applications have been published in the last two years (1987–88) alone. This review categorizes LC-GC publications into four main application areas: fossil fuels, foods, environmental samples, biologiical/pharmaceutical samples, and miscellaneous samples. Multidimensional separations carried out using other coupled-column chromatographic techniques (such as supercritical fluid chromatography (SFC) with GC, and on-line trace enrichment-GC) have also been included in this review.     

A Language for Teaching Discrete-event Simulation

Courses which teach discrete-event simulation are based on many different simulation languages. The requirements for a language to support teaching simulation are discussed. In particular, it is recommended that such languages separate into distinct modules those aspects of simulation which are taught as separate topics. Implementation of the separation is discussed. The SEESIM language, developed as a teaching aid, is described, and examples of its use are given. Straightforward use of SEESIM can be learned quickly, yet the language provides facilities for a staged introduction to advanced concepts of simulation.     

Hybrid reordering strategies for ILU preconditioning of indefinite sparse matrices

Incomplete LU factorization preconditioning techniques often have difficulty on indefinite sparse matrices. We present hybrid reordering strategies to deal with such matrices, which include new diagonal reorderings that are in conjunction with a symmetric nondecreasing degree algorithm. We first use the diagonal reorderings to efficiently search for entries of single element rows and columns and/or the maximum absolute value to be placed on the diagonal for computing a nonsymmetric permutation. To augment the effectiveness of the diagonal reorderings, a nondecreasing degree algorithm is applied to reduce the amount of fill-in during the ILU factorization. With the reordered matrices, we achieve a noticeable improvement in enhancing the stability of incomplete LU factorizations. Consequently, we reduce the convergence cost of the preconditioned Krylov subspace methods on solving the reordered indefinite matrices.     

The operational performance of the Yale ESTU

The ESTU began operation in 1988 and achieved the design voltage of 20 MV in 1990. Since that time, improvements to the gas handling system, negative ion injector, accelerator terminal and control system have greatly increased its capability and reliability. Today, the ESTU can efficiently produce an extensive assortment of stable ions at wide-ranging energies in support of low-energy nuclear physics.     

Application of pressure sensitive paint measurement to a low-solidity cascade diffuser of a transonic centrifugal compressor

A pressure sensitive paint (PSP) measurement has been known as a pressure field measurement technique based on the oxygen quenching phenomenon of luminescence of specific luminophores. A PSP measurement was applied for pressure field measurement in a low-solidity circular cascade diffuser of a single-stage transonic centrifugal compressor with 5 in pressure ratio for HFC134a gas. The oxygen concentration was about 500 ppm. Ru (bath-phen) was adsorbed on a silica-gel thinlayer chromatography sheet, and the sheet was pasted onto the side-wall between the cascade vanes. A drastic change in luminescent intensity was recognized during a surge condition. Also the pressure variations based on luminescent intensity agreed well with the pressure fluctuations measured using a semiconductor pressure sensor with high-frequency-response. It was shown that a PSP measurement worked well to investigate the unsteady pressure fields in a circular cascade diffuser of a transonic centrifugal compressor. Moreover, the time response of PSP becomes clear as a problem to be overcome for the present.     

The Lefschetz number of an involution on the space of harmonic cusp forms ofSL 3

Inventiones mathematicae -     

Pediatric Laryngotracheal Stenosis and Airway Reconstruction: A Review of Voice Outcomes, Assessment, and Treatment Issues

Laryngotracheal stenosis is defined as a congenital or acquired narrowing of the airway. Congenital causes may include subglottic membranous or cartilaginous narrowing. Acquired causes may include trauma due to prolonged endotracheal or tracheal intubation or laryngotracheal injury. Although advances have been made over the past 30 years in reconstructive surgeries to improve airway patency in these patients, long-term laryngeal function for voice production is not well defined in this population. This review examines causes, symptoms and signs, and methods for diagnosing laryngotracheal stenosis. Surgical management procedures are briefly summarized. The current literature on voice outcomes is summarized. The predominant voice characteristics in the population are presented, although results are challenged by the heterogeneity of voice presentation and paucity of data from instrumental measures. Considerations for subjective and instrumental assessment, measures of quality of life, instrumental methods, and treatment options specific to the needs of this population are discussed. Research strategies to identify long-term outcomes of surgical and behavioral treatments in this population are posed.     

Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.