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     

曲面平滑的自适应几何扩散

1.引 言 本文的目的是用求解偏微分方程（PDE）的方法来消除离散三角形曲面的噪声,所使用的方程是热传导方程到曲面的推广.热传导方程应用于图像处理已有二十余年的历史,有关参考文献相当丰富（见[1,11,12,19]）.众所周知,对于给定的初始图像ρ0,热传导方程　　在τ时刻的解与用Gauss滤波器Gσ（x）=　（当标准差σ=2τ,时）和ρ0作卷积的结果相同.容易看出Gρ和ρ0的卷积运算相当于对ρ0做加权平均,当标准离差σ变大时,该加权平均在一个较大的范围实现,这解释了热传导方程的滤波作用.近来热传导方程已推广到空间曲面[4,5]以及高维空间中的二维流形（见[3]）,对     

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.     

Ar?NO团簇的同步辐射光电离研究

利用国家同步辐射实验室合肥光源的真空紫外同步辐射，使NO分子和Ar原子混合物的超声分子束发生光电离，测量了Ar，NO和异类团簇Ar·NO的光电离效率谱. 在谱中，在与Ar原子的共振线对应的能量区域(11.5—12.0 eV)观察到一个强的类共振结构. 这个结果表明，在异类团簇Ar·NO的内部，稀有气体Ar原子的激发能转移到与它接触的分子NO上，使分子NO发生电离. 关键词： Ar·NO团簇 同步辐射 光电离 能量转移