Self-consistent-field – Hartree–Fock method with finite nuclear mass corrections

We have upgraded a Self-consistent-field – Hartree–Fock routine to include a finite nuclear mass correction for molecules developed in our laboratory. The new routine can handle isotopomers without calculating any nuclear kinetic energy matrix element. Tests on H₂, LiH, HF, F₂, and H₂O isotopomers indicate the equivalence of our correction to the standard diagonal adiabatic correction. A further original application to C₂H₆ illustrates the usefulness of the method for polyatomic molecules. The resulting molecular orbitals carry the nuclear mass signature, exemplified with Koopmans ionization potentials.From the Proceedings of the 28th Congreso de Químicos Teóricos de Expresión Latina (QUITEL 2002)     

On solving a D.C. programming problem by a sequence of linear programs

We are dealing with a numerical method for solving the problem of minimizing a difference of two convex functions (a d.c. function) over a closed convex set in ⁿ . This algorithm combines a new prismatic branch and bound technique with polyhedral outer approximation in such a way that only linear programming problems have to be solved.Parts of this research were accomplished while the third author was visiting the University of Trier, Germany, as a fellow of the Alexander von Humboldt foundation.     

Generalizations of Slater's constraint qualification for infinite convex programs

In this paper we study constraint qualifications and duality results for infinite convex programs (P) = inf{f(x): g(x) – S, x C}, whereg = (g ₁,g ₂) andS = S ₁ ×S ₂,S _i are convex cones,i = 1, 2,C is a convex subset of a vector spaceX, andf andg _i are, respectively, convex andS _i -convex,i = 1, 2. In particular, we consider the special case whenS ₂ is in afinite dimensional space,g ₂ is affine andS ₂ is polyhedral. We show that a recently introduced simple constraint qualification, and the so-called quasi relative interior constraint qualification both extend to (P), from the special case thatg = g ₂ is affine andS = S ₂ is polyhedral in a finite dimensional space (the so-called partially finite program). This provides generalized Slater type conditions for (P) which are much weaker than the standard Slater condition. We exhibit the relationship between these two constraint qualifications and show how to replace the affine assumption ong ₂ and the finite dimensionality assumption onS ₂, by a local compactness assumption. We then introduce the notion of strong quasi relative interior to get parallel results for more general infinite dimensional programs without the local compactness assumption. Our basic tool reduces to guaranteeing the closure of the sum of two closed convex cones.     

On laplace continued fraction for the normal integral

The Laplace continued fraction is derived through a power series. It provides both upper bounds and lower bounds of the normal tail probability % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaiqbfA6agzaaraaaaa!3DC0!\[\bar \Phi\](x), it is simple, it converges for x>0, and it is by far the best approximation for x3. The Laplace continued fraction is rederived as an extreme case of admissible bounds of the Mills' ratio, % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaiqbfA6agzaaraaaaa!3DC0!\[\bar \Phi\](x)/(x), in the family of ratios of two polynomials subject to a monotone decreasing absolute error. However, it is not optimal at any finite x. Convergence at the origin and local optimality of a subclass of admissible bounds are investigated. A modified continued fraction is proposed. It is the sharpest tail bound of the Mills' ratio, it has a satisfactory convergence rate for x1 and it is recommended for the entire range of x if a maximum absolute error of 10^-4 is required.The efforts of the author were supported by the NSERC of Canada.     

Modified AutoDock for accurate docking of protein kinase inhibitors

Protein kinases are an important class of enzymes controlling virtually all cellular signaling pathways. Consequently, selective inhibitors of protein kinases have attracted significant interest as potential new drugs for many diseases. Computational methods, including molecular docking, have increasingly been used in the inhibitor design process [1]. We have considered several docking packages in order to strengthen our kinase inhibitor work with computational capabilities. In our experience, AutoDock offered a reasonable combination of accuracy and speed, as opposed to methods that specialize either in fast database searches or detailed and computationally intensive calculations.However, AutoDock did not perform well in cases where extensive hydrophobic contacts were involved, such as docking of SB203580 to its target protein kinase p38. Another shortcoming was a hydrogen bonding energy function, which underestimated the attraction component and, thus, did not allow for sufficiently accurate modeling of the key hydrogen bonds in the kinase-inhibitor complexes.We have modified the parameter set used to model hydrogen bonds, which increased the accuracy of AutoDock and appeared to be generally applicable to many kinase-inhibitor pairs without customization. Binding to largely hydrophobic sites, such as the active site of p38, was significantly improved by introducing a correction factor selectively affecting only carbon and hydrogen energy grids, thus, providing an effective, although approximate, treatment of solvation.     

张量积型Said-Ball曲面的预处理渐近迭代逼近法

为加快张量积型Said-Ball曲面渐近迭代逼近法的收敛速度,探讨了张量积型Said-Ball曲面渐近迭代逼近法的预处理技术。首先利用对角补偿约化技术构造了预处理子,然后结合矩阵Kronecker积性质,采取预处理渐近迭代逼近法求解张量积型Said-Ball曲面。为进一步降低计算量并提高算法的稳定性,利用广义极小残差法求解预处理方程,得到预处理渐近迭代逼近法的非精确求解方法。分析了预处理渐近迭代逼近法及非精确求解方法的收敛性。最后用数值实例说明预处理子能大大减小迭代矩阵的谱半径,令预处理技术及其非精确求解方法的计算效率明显提高。此外,由于对角补偿预处理子能改善配置矩阵的谱分布,因此也可用于对广义极小残差法的预处理,以改善其收敛性。     

温跃层边界提取的组合算法*

本文提出一种用于海洋温跃层边界提取的组合算法,该算法基于调整判定阈值后的垂直梯度法和一种改进函数模型几何形态后的拟阶梯函数逼近法。为验证该算法对于温跃层边界提取的适应性、客观性,利用中国Argo实时资料中心发布的全球海洋Argo网格资料集（BOA_Argo）,选取2018年夏季0°~30°N,135°E~165°E所在的太平洋区域的温度剖面数据进行处理,结果表明,该算法对低纬度海区温度剖面拟合质量较好,拟合均方根误差普遍低于1.3℃,而且提取到的温跃层上下边界在纬向更加平缓,然而对于中高纬度海区的温度剖面,组合算法的处理效果不佳,更适合直接通过垂直梯度法进行温跃层的提取。     

Quantum Chaos,Random Matrices,and Irreversibility in Interacting Many-Body Quantum Systems

The Pauli master equation describes the statistical equilibration of a closed quantum system. Simplifying and generalizing an approach developed in two previous papers, we present a derivation of that equation using concepts developed in quantum chaos and random-matrix theory. We assume that the system consists of subsystems with strong internal mixing. We can then model the system as an ensemble of random matrices. Equilibration results from averaging over the ensemble. The direction of the arrow of time is determined by an (ever-so-small) coupling to the outside world. The master equation holds for sufficiently large times if the average level densities in all subsystems are sufficiently smooth. These conditions are quantified in the text, and leading-order correction terms are given.     

无界集值上鞅的Riesz逼近

研究了弱紧凸集值上鞅及无界集值上鞅的Ｒｉｅｓｚ逼近，以及鞅型集序列的若干收敛定理．     

The effects of cubic potentials on discrete breathers in a mixed Klein－Gordon /Fermi－Pasta－Ulam chain

Nonlinearity has a crucial impact on the symmetry properties of dynamical systems. This paper studies a one-dimensional mixed Klein--Gordon/Fermi--Pasta--Ulam diatomic chain using the expanded rotating plane-wave approximation and numerical calculations to determine the effect of cubic potentials on the symmetry properties of discrete breathers in this system. The results will be very useful to researchers in the field of numerical calculations on discrete breathers.