Knowledge based proximal support vector machines

We propose a proximal version of the knowledge based support vector machine formulation, termed as knowledge based proximal support vector machines (KBPSVMs) in the sequel, for binary data classification. The KBPSVM classifier incorporates prior knowledge in the form of multiple polyhedral sets, and determines two parallel planes that are kept as distant from each other as possible. The proposed algorithm is simple and fast as no quadratic programming solver needs to be employed. Effectively, only the solution of a structured system of linear equations is needed.     

Deformation Techniques for Sparse Systems

We exhibit a probabilistic symbolic algorithm for solving zero-dimensional sparse systems. Our algorithm combines a symbolic homotopy procedure, based on a flat deformation of a certain morphism of affine varieties, with the polyhedral deformation of Huber and Sturmfels. The complexity of our algorithm is cubic in the size of the combinatorial structure of the input system. This size is mainly represented by the cardinality and mixed volume of Newton polytopes of the input polynomials and an arithmetic analogue of the mixed volume associated to the deformations under consideration. Research was partially supported by the following grants: UBACyT X112 (2004–2007), UBACyT X847 (2006–2009), PIP CONICET 2461, PIP CONICET 5852/05, ANPCyT PICT 2005 17-33018, UNGS 30/3005, MTM2004-01167 (2004–2007), MTM2007-62799 and CIC 2007–2008.     

Testing the structure of multistage stochastic programs

A fixed topology of stages and/or a fixed branching scheme are common assumptions for applications and numerical solution of scenario based multistage stochastic programs. Using contamination technique to test this structure, we extend the results of Dupačová (Contamination for multistage stochastic programs. In: Hušková M, Janžura M (eds) Prague stochastics. Matfyzpress, Praha, pp 91–101, 2006a) to stochastic programs with multistage polyhedral risk objectives. The ideas are exemplified by bond portfolio management problems and complemented by illustrative numerical results.     

A method for classifying orbits near asteroids

A method for classifying orbits near asteroids under a polyhedral gravitational field is presented, and may serve as a valuable reference for spacecraft orbit design for asteroid exploration. The orbital dynamics near aster- oids are very complex. According to the variation in orbit characteristics after being affected by gravitational perturbation during the periapsis passage, orbits near an as- teroid can be classified into 9 categories： （1） surrounding- to-surrounding, （2） surrounding-to-surface, （3） surrounding- to-infinity, （4） infinity-to-infinity, （5） infinity-to-surface, （6） infinity-to-surrounding, （7） surface-to-surface, （8） surface- to-surrounding, and （9） surface-to- infinity. Assume that the orbital elements are constant near the periapsis, the gravitation potential is expanded into a harmonic series. Then, the influence of the gravitational perturbation on the orbit is studied analytically. The styles of orbits are dependent on the argument of periapsis, the periapsis radius, and the periapsis velocity. Given the argument of periapsis, the orbital energy before and after perturbation can be derived according to the periapsis radius and the periapsis velocity. Simulations have been performed for orbits in the gravitational field of 216 Kleopatra. The numerical results are well consistent with analytic predictions.     

Bridged polyhedral oligomeric silsesquioxane (POSS): A potential member of silsequioxanes

Two novel and well-defined polyhedral oligomeric silsesquioxanes（POSS） with two same Si₈O₁₂ cores and a reactive NH group, namely bridged-POSS（2a and 2b）,have been prepared by the traditional ’corner-capping’ reaction.X-ray diffraction demonstrates that those two POSS have the similar T₈ structure.From the thermo-gravimetric analysis,bridged-POSS shows the belter thermal degradation stability than the contrastive POSS.     

Avoiding abelian squares in partial words

Erd?s raised the question whether there exist infinite abelian square-free words over a given alphabet, that is, words in which no two adjacent subwords are permutations of each other. It can easily be checked that no such word exists over a three-letter alphabet. However, infinite abelian square-free words have been constructed over alphabets of sizes as small as four. In this paper, we investigate the problem of avoiding abelian squares in partial words, or sequences that may contain some holes. In particular, we give lower and upper bounds for the number of letters needed to construct infinite abelian square-free partial words with finitely or infinitely many holes. Several of our constructions are based on iterating morphisms. In the case of one hole, we prove that the minimal alphabet size is four, while in the case of more than one hole, we prove that it is five. We also investigate the number of partial words of length n with a fixed number of holes over a five-letter alphabet that avoid abelian squares and show that this number grows exponentially with n.     

铌团簇和配合物的多面体分子轨道理论研究

应用多面体理论方法研究铌纯金属团簇和配合物的电子结构成键性质,并将理论预测结果用密度泛函方法验证.证实多面体理论是简便预测过渡金属簇,尤其是簇骨架电子结构的有效方法.铌的小团簇总是以低自旋密堆积结构为稳定构型,当体系的价电子数满足轨道成键数时,用该方法可较准确地推断成键性质(如Nb₄和[Nb₆Cl₁₂]⁺⁴);而对于不满足成键数的体系(如Nb₅和Nb₆),则可利用该理论分析畸变趋势.     

Synthesis of macrocyclic tris-cis-tris-trans- dodeca[(phenyl)(hydroxy)]cyclododecasiloxane in carbonic acid solution

The possibility to synthesize stereoregular tris-cis-tris-trans- dodeca[(phenyl)(hydroxy)]cyclododecasiloxane (tris-cis-tris-trans-[PhSi(O)OH]12) in an inorganic liquid medium – aqueous carbonic acid solution – was shown. The interaction of polyhedral phenylcoppersodiumsiloxane, {[(C₆H₅Si(O)O^?]₁₂(Cu₂⁺)₄(Na⁺)₄}*(L)_m (L?=?Buⁿ OH, H₂O), with carbonic acid can be considered as a new ‘green’ method to obtain functional organosiloxane macrocycles. In contrast to the known methods, no organic solvents were used during the reaction. The identification of the structure of the end compound was performed by means of NMR and Infrared spectroscopy as well as X-ray crystallography.     

Worst-case comparison of valid inequalities for the TSP

We consider most of the known classes of valid inequalities for the graphical travelling salesman polyhedron and compute the worst-case improvement resulting from their addition to the subtour polyhedron. For example, we show that the comb inequalities cannot improve the subtour bound by a factor greater than 10/9. The corresponding factor for the class of clique tree inequalities is 8/7, while it is 4/3 for the path configuration inequalities.Research supported in part by Air Force contract F49620-92-J-0125, DARPA contract N00014-92-J-1799 and NSF contract 9302476-CCR.