A branch-and-bound method for the minimum k−enclosing ball problem

The minimum k-enclosing ball problem seeks the ball with smallest radius that contains at least k of m given points. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of k points to solve this problem. Our method is able to solve the problem exactly in a short amount of time for small and medium sized datasets.     

砂土串囊式充气锚杆承载力的研究

在砂土地层中,串囊式充气锚杆的研究还比较少,其承载特性及受力机理尚不明确。本文基于莫尔-库仑模型和Vesic圆孔扩张理论法,分别对圆柱体、球体、组合体、椭球体假设下的串囊式充气锚杆的扩大段进行计算分析。并将计算结果与试验得到的实测值进行对比。结果表明:四种形状假设中椭球体的形状假设理论值与实测值的误差最小,仅为8.35%。通过拟合试验数据,并引入与端阻力和侧摩阻力有关的两个系数对承载力公式进行修正,得到了抗拔承载力的经验公式。     

Thermally induced solid-state transformation of cimetidine. A multi-spectroscopic/chemometrics determination of the kinetics of the process and structural elucidation of one of the products as a stable N3-enamino tautomer

Exposure of cimetidine (CIM) to dry heat (160–180 °C) afforded, upon cooling, a glassy solid containing new and hitherto unknown products. The kinetics of this process was studied by a second order chemometrics-assisted multi-spectroscopic approach. Proton and carbon-13 nuclear magnetic resonance (NMR), as well as ultraviolet and infrared spectroscopic data were jointly used, whereas multivariate curve resolution with alternating least squares (MCR-ALS) was employed as the chemometrics method to extract process information. It was established that drug degradation follows a first order kinetics.     

Potts models with magnetic field: Arithmetic,geometry, and computation

We give a sheaf theoretic interpretation of Potts models with external magnetic field, in terms of constructible sheaves and their Euler characteristics. We show that the polynomial countability question for the hypersurfaces defined by the vanishing of the partition function is affected by changes in the magnetic field: elementary examples suffice to see non-polynomially countable cases that become polynomially countable after a perturbation of the magnetic field. The same recursive formula for the Grothendieck classes, under edge-doubling operations, holds as in the case without magnetic field, but the closed formulae for specific examples like banana graphs differ in the presence of magnetic field. We give examples of computation of the Euler characteristic with compact support, for the set of real zeros, and find a similar exponential growth with the size of the graph. This can be viewed as a measure of topological and algorithmic complexity. We also consider the computational complexity question for evaluations of the polynomial, and show both tractable and NP-hard examples, using dynamic programming.