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.     

Observation of dielectronic satellites in the K-spectrum of argon ions in plasma produced by femtosecond laser pulses

The satellite structure of 1s2p ^1,3 P ₁-1s ²¹ S ₀ lines of the He-like argon ion in plasma produced by a 45-fs laser pulse in a gas-jet cluster target is measured with a high spectral resolution. Radiation transitions 2p → 1s from autoionizing states (AISs) are detected for ions ranging from Li-like to F-like. The spectrum observed is theoretically simulated with the use of the spectroscopic data for the AISs of multicharged ions obtained within the multiconfiguration relativistic Hartree-Fock method. Good agreement with experimental data is obtained when the main population channels of these states are taken into account for typical values of cluster-target plasma parameters.     

Syntactic characterization of closure under connected limits

Summary We give a syntactic characterization of (finitary) theories whose categories of models are closed under the formation of connected limits (respectively the formation of pullbacks and substructures) in the category of all structures. They are also those theories whose consistent extensions by new atomic facts admit in each component an initial structure (respectively an initial term structure), and also thoseT for whichM(T) is locally finitely multi-presentable in a canonical way. We also show that these two properties of theories are nonuniform.     

Une formule de Landau–Zener pour un croisement non dégénéré et involutif de codimension 3Landau–Zener formula for non-degenerate involutive codimension 3 crossings

In this Note, we study a 2×2 system of evolution equations with some codimension 3 crossing. We derive two conditions of non-degeneracy. We focus on one of them and reduce our system to some Landau–Zener's type system. Using this reduction, we describe the energy transfer at the crossing by Landau–Zener formula for 2-scales semi-classical measures. To cite this article: C. Fermanian Kammerer, P. Gérard, C. R. Acad. Sci. Paris, Ser. I 335 (2002) 915–920.     

Complete ideals and singularities of space curves

We consider complete ideals supported on finite sequences of infinitely near points, in regular local rings with dimensions greater than two. We study properties of factorizations in Lipman special *-simple complete ideals. We relate it to a type of proximity, linear proximity, of the points, and give conditions in order to have unique factorization. Several examples are presented. Received: 2 February 2000 / in final form: 14 March 2001 / Published online: 18 January 2002     

CMS physics overview

The principal physics goals of the Compact Muon Solenoid experiment under construction at the Large Hadron Collider at CERN in Geneva are reviewed. Procedures to search for the Standard Model Higgs boson, supersymmetric Higgses and other supersymmetric particles are described.     

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.     

Studies aimed at the synthesis of morphine V an economic approach to (±)-reticuline from 3,4-dihydropapaverine

Regioselective demethylation of 3,4-dihydropapaveraldine ($\text{2}$a) at 7 and 3' positions affords a properly substituted diphenolic key intermidiate ($\text{2}$d) for the synthesis of reticuline and N-norreticuline.