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     

完全非线性偏微分方程解的Gevrey微局部正则性

本文中，我们首先简要回顾了Gevrey类中的仿微分运算，然后考察了相关的完全非线性偏微分方程的象征的一些性质。作为应用，我们得到解在椭圆点附近的Gevrey微局部正则性。     

On a bifurcation governed by hysteresis nonlinearity

We consider autonomous systems with a nonlinear part depending on a parameter and study Hopf bifurcations at infinity. The nonlinear part consists of the nonlinear functional term and the Prandtl--Ishlinskii hysteresis term. The linear part of the system has a special form such that the close-loop system can be considered as a hysteresis perturbation of a quasilinear Hamiltonian system. The Hamiltonian system has a continuum of arbitrarily large cycles for each value of the parameter. We present sufficient conditions for the existence of bifurcation points for the non-Hamiltonian system with hysteresis. These bifurcation points are determined by simple characteristics of the hysteresis nonlinearity.     

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.     

光纤面板传输机理研究(Ⅱ)

本文在文献[1]研究的基础上,建立了光纤面板的结构模型。利用光学信息理论,研究了光纤面板的传输机理。通过分析、计算光纤面板传输的光学信息量,给出了光纤面板传递最大信息量时的最佳结构参数和扩散参量。     

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.     

Intended Treatments of Arithmetic Average in U.S. and Asian School Mathematics Textbooks

This study examined how selected U.S. and Asian mathematics curricula are designed to facilitate students' understanding of the arithmetic average. There is a consistency regarding the learning goals among these curriculum series, but the focuses are different between the Asian series and the U.S. reform series. The Asian series and the U.S. commercial series focus the arithmetic average more on conceptual and procedural understanding of the concept as a computational algorithm than on understanding the concept as a representative of a data set; however, the two U.S. reform series focus the concept more on the latter. Because of the different focuses, the Asian and the U.S. curriculum series treat the concept differently. In the Asian series, the concept is first introduced in the context of “equal‐sharing” or “per‐unit‐quantity,” and the averaging formula is formally introduced at a very early stage. In the U.S. reform series, the concept is discussed as a measure of central tendency, and after students have some intuitive ideas of the statistical aspect of the concept, the averaging algorithm is briefly introduced.