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     

An interior–exterior Schwarz algorithm and its convergenceUn algorithme de Schwarz intérieur–extérieur et sa convergence

In this work we study the solution of Laplace's equation in a domain with holes by an iteration consisting of splitting the problem in an exterior one, around the holes, plus an interior problem in the unholed domain. We show the existence of a decomposition of the solution when the exterior problem is represented by means of a single-layer protential. Also, for the three-dimensional case and with some adjustments for the two-dimensional case, we prove convergence of the method by writing the iteration as a Jacobi iteration for an operator equation and studying the spectrum of the iteration operator. To cite this article: R. Celorrio et al., C. R. Acad. Sci. Paris, Ser. I 334 (2002) 923–926.     

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.     

Capillary Electrophoresis Chiral Separation for Enantiomeric Purity Determination of a Basic Drug in Pharmaceutical Formulations

Capillary electrophoresis using a running buffer composed of β-cyclodextrin as the chiral selector and ethanolamine mesylate at pH 9.6 is being used to monitor the stereochemical stability of a hydrophobic drug, containing two chiral centers, in two different formulated self-emulsifying drug delivery system (SEDDS) products. The separation takes place in less than 25 min. Strategies for enhancing the method reproducibility and detection sensitivity in the lower potency formulation are presented. The results demonstrating the specificity, assay precision, recovery, linearity and range achieved during the method validation experiments are presented in this paper.Presented at: CE in the Biotechnology and Pharmaceutical Industries: 7th Symposium on the Practical Applications for the Analysis of Proteins, Nucleotides and Small Molecules, Montreal, Canada, August 12–16, 2005.