The Third-Order Singular-Perturbation Expansion of the Planar Cold-Fluid Magnetron Equations

The singular-perturbation expansion of the plasma cold-fluid equations for crossed fields in a planar geometry is presented. The general expansion is carried out to third order. Various instabilities that occur in the first, second, and third orders are discussed.     

Extended Rees algebras and mixed multiplicities

Partially supported by the general research fund at the University of Kansas     

Evaluating the Efficiency of US Air Force Real-Property Maintenance Activities

The objective of this research is to evaluate a new methodology, data envelopment analysis (DEA), as a tool for measuring and evaluating the operational efficiency of US Air Force organizations. This study involves the application of DEA to locate possible inefficiencies in the performance of US Air Force real-property maintenance activities. Dynamic behaviour, as exhibited via window analyses, is reviewed along with static counterparts. The testing was done in close coordination with Air Force officials, who reviewed the results for accuracy, validity and relevance. We conclude that this type of efficiency analysis does have value for the Air Force, where it can serve as a guide to auditors, budget programmers, managers and others in measuring, evaluating and enhancing operational efficiency.     

Exact soliton solutions of spinor Bose-Einstein condensates

We study matter-wave solitons in Bose-Einstein condensates of ultracold gaseous atoms with spin degrees of freedom and present a class of exact solutions based on the inverse scattering method. The one-soliton solutions are classified with respect to the spin states. We analyze collisional effects between solitons in the same or different spin state(s), which reveals a very interesting possibility: we can manipulate the spin dynamics by controlling the parameters of colliding solitons.     

Global fit analysis including the ν9 + ν4 − ν4 hot band of ethane: Evidence of an interaction with the ν12 fundamental

The ν₉ fundamental band of ethane occurs in the 12 μm region. It is the strongest band of ethane in a terrestrial window and is commonly used for the identification of ethane in the Jovian planets. The ν₉ + ν₄ − ν₄ band occurs in the same region; neither can be analysed as an isolated band, since both are embedded in the torsional bath of the ground vibrational state. We report here two global fit models including data from both of these bands as well as the ν₃ fundamental and the ν₄, 2ν₄ − ν₄, and 3ν₄ torsional transitions. The first is restricted to −5 ? KΔK ? 15 in the hot band and gives an excellent fit to the included data. Three resonant interactions are identified in this fit—a Coriolis interaction with two resonant cases between the ν₉ torsional stack and that of the ground vibrational state (gs) and a resonant Fermi interaction between the ν₃ fundamental and the gs. Hot band lines with KΔK < −5 are influenced by a fourth perturbation, with a crossing at −11 < KΔK < −10, which has been attributed to an interaction with the ν₁₂ fundamental. A second fit, demonstrating a promising treatment of this interaction, is also presented.     

Two modifications of the least cost per period heuristic for dynamic lot-sizing

This paper proposes two constructive heuristics for the well-known single-level uncapacitated dynamic lot-sizing problem. The proposed heuristics, called net least period cost (nLPC) and nLPC(i), are developed by modifying the average period cost concept from Silver and Meal's heuristic, commonly known as least period cost (LPC). An improved tie-breaking stopping rule and a locally optimal decision rule are proposed in the second heuristic to enhance performance. We test the effectiveness of the proposed heuristics by using 20 benchmarking test problems frequently used in the literature. Furthermore, we perform a large-scale simulation study involving three factors, 50 experimental conditions, and 100?000 randomly generated problems to evaluate the proposed heuristics against LPC and six other well-known constructive heuristics in the literature. The simulation results show that both nLPC and nLPC(i) produce average holding and setup costs lower than or equal to those of LPC in every one of the 50 experimental conditions. The proposed heuristics also outperform each of the six other heuristics evaluated in all experimental conditions, without an increase in computational requirements. Lastly, considering that both nLPC and nLPC(i) are fairly simple for practitioners to understand and that lot-sizing heuristics have been commonly used in practice, there should be a very good chance for practical applications of the proposed heuristics.     

INFLUENCE OF A LEVELNESS DEFECT IN A THRUST BEARING ON THE DYNAMIC BEHAVIOUR OF AN ELASTIC SHAFT

This paper examines the non-linear dynamic behaviour of a flexible shaft. The shaft is mounted on two journal bearings and the axial load is supported by a defective hydrodynamic thrust bearing at one end. The defect is a levelness defect of the rotor. The thrust bearing behaviour must be considered to be non-linear because of the effects of the defect. The shaft is modelled with typical beam finite elements including effects such as the gyroscopic effects. A modal technique is used to reduce the number of degrees of freedom. Results show that the thrust bearing defects introduce supplementary critical speeds. The linear approach is unable to show the supplementary critical speeds which are obtained only by using non-linear analysis.     

BRST cohomology and highest weight vectors. I

We initiate a program to study certain recent problems in non-compact coset CFT by the BRST approach. We derive a reduction formula for the BRST cohomology by making use of a twisting by highest weight modules. As illustrations, we apply the formula to the bosonic string model and a rank one non-compact coset model [DPL]. Our formula provides a completely new approach to non-compact coset construction.Partially supported by NSF Grant DMS-8703581     

Applying Stochastic Algorithms to a Locomotive Scheduling Problem

This paper addresses a problem common to all railway networks. Given a fixed train timetable and locomotives (or other forms of traction) of various types, each train must be allocated a locomotive. This paper examines the use of stochastic algorithms for such a problem. Two types of algorithm are used—a simple ‘local improvement’ method, performed successively from randomly chosen starting points, and a ‘simulated annealing’ approach. Both are found to give considerably better results than a deterministic method in current use, and the annealing approach is probably the better stochastic method.     

Rehabilitation of the Gauss-Jordan algorithm

Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties.