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     

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.     

XY(H,Li,Na)分子基态的结构与势能函数

运用群论及原子分子反应静力学方法,推导了XY(H,Li,Na)分子基态的电子态及相应的离解极限.并采用密度泛函方法(B3LYP)和二次组态相互作用方法(QCISD)优化计算了XY(H,Li,Na)分子基态的平衡结构、振动频率和离解能.使用QCISD/6-311++G(3df,3pd)方法,对XY(H,Li,Na)分子基态进行了单点能扫描计算,采用最小二乘法拟合Murrell-Sorbie函数得到了相应的势能函数和与该基态相对应的光谱常数(Be,αe,ωe和ωexe),计算结果与实验数据符合得相当好.     

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.     

提高微晶硅薄膜太阳电池效率的研究

采用甚高频等离子体增强化学气相沉积技术制备了系列微晶硅薄膜太阳电池，指出了气体总流量和背反射电极的类型对电池性能参数的影响.电池的I-V测试结果表明：随反应气体总流量的增加，对应电池的短路电流密度、开路电压和填充因子都有很大程度的提高，结果使得电池的光电转换效率得以提高.另外，ZnO/Ag/Al背反射电极能明显提高电池的短路电流密度，进而也提高了电池的光电转换效率.对气体总流量和背反射电极类型影响电池效率的原因进行了分析. 关键词： 微晶硅薄膜太阳电池 气体流量 ZnO/Ag/Al背反射电极