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     

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.     

甲基紫掺杂聚乙烯醇薄膜材料红光多重全息存储

甲基紫掺杂聚乙烯醇薄膜材料在两束相干光照射下生成相位光栅.当改变一束相干光光程,通过监测相位光栅的一级衍射信号强度的变化,可以检测相位光栅的生长和擦除过程.在此实验基础上,讨论了甲基紫掺杂聚乙烯醇薄膜材料多重全息存储的原理与结果.     

利用微悬臂梁表面应力研究聚N-异丙基丙烯酰胺分子的构象转变

提出了一种基于微悬臂梁传感技术研究大分子折叠/构象转变的新方法.通过分子自组装的方法将热敏性的聚N-异丙基丙烯酰胺(PNIPAM)分子链修饰到微悬臂梁的单侧表面,用光杠杆技术检测温度在20-40 ℃之间变化时由于微悬臂梁上的PNIPAM分子在水中的构象转变所引起的微悬臂梁变形.实验结果显示:在升温过程中,微悬臂梁的表面应力发生了变化并且导致微悬臂梁产生了弯曲变形,这个过程对应着微悬臂梁上的PNIPAM分子从无规线团构象到塌缩小球构象的构象转变.在降温过程中,微悬臂梁发生了反方向的弯曲变形,这对应着PNIPAM分子从塌缩小球构象向无规线团构象的构象转变.整个温度变化过程中构象转变是连续进行的,而在低临界溶解温度(约32 ℃)附近转变幅度较大,这与自由水溶液中PNIPAM分子的无规线团-塌缩小球构象转变相对应.实验结果还显示:由于PNIPAM分子在塌缩过程中氢键的形成和链段间可能的缠结效应,整个温度循环过程中微悬臂梁的变形是不可逆的且有明显的迟滞效应.     

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.