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.     

时间分辨光子计数系统的研究和应用

对由SPCM-AQR-14和MCS组成的时间分辨光子计数系统进行了研究,分析了SPCM和MCS的工作原理及主要特性.利用该系统对磷光物质和洋葱的延迟发光进行了测量,对它们的光子计数率曲线进行拟合,发现其光强衰减符合双曲线规律.     

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.     

Generalized Longo–Rehren Subfactors and α-Induction

We study the recent construction of subfactors by Rehren which generalizes the Longo–Rehren subfactors. We prove that if we apply this construction to a non-degenerately braided subfactor N⊂M and α^±-induction, then the resulting subfactor is dual to the Longo–Rehren subfactor M⊗M ^opp⊂R arising from the entire system of irreducible endomorphisms of M resulting from α^plusmn;-induction. As a corollary, we solve a problem on existence of braiding raised by Rehren negatively. Furthermore, we generalize our previous study with Longo and Müger on multi-interval subfactors arising from a completely rational conformal net of factors on S ¹ to a net of subfactors and show that the (generalized) Longo–Rehren subfactors and α-induction naturally appear in this context. Received: 11 September 2001 / Accepted: 7 October 2001     

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