Accurate Gaussian basis sets for the H2O molecule generated with the molecular improved generator coordinate Hartree–Fock method

The molecular improved generator coordinate Hartree–Fock (MIGCHF) method is used to generate accurate basis sets of primitive Gaussian-type functions for the H₂O molecule. Sequences of increasing size atom centered basis sets are employed to explore the accuracy that can be achieved with this method. Using the O(24s14p8d5f2g1h);H(22s9p5d2f1g) basis set, the HF and second-order electron correlation energies of the H₂O ground state at the experimental geometry are computed as −76.0674680 and −0.3491935 hartree, respectively. The HF energy is in error by 20 μhartree and the second-order correlation energy corresponds to 96.5% of an estimate of the limiting value. The relevance of the present calculations is to show the accuracy that can be achieved in studies of small polyatomic molecules with the MIGCHF method.     

Gaussian basis sets for calculation of spin densities in first-row atoms

Summary The suitability of Gaussian basis sets for ab initio calculation of Fermi contact spin densities is established by application to the prototype first-row atoms B-F having open shell p electrons. Small multiconfiguration self-consistent-field wave functions are used to describe relevant spin and orbital polarization effects. Basis sets are evaluated by comparing the results to highly precise numerical grid calculations previously carried out with the same wave function models. It is found that modest contracted Gaussian basis sets developed primarily for Hartree-Fock calculations can give semiquantitative results if augmented by diffuse functions and if further uncontracted in the outer core-inner valence region.     

径向基-偏最小二乘-贝叶斯方法及其在化学模式分类中的应用

提出一种用于模式分类的RBF-PLS—Bayes方法。它集成地应用径向基(RBF)变换与偏最小二乘(PLS)方法，从原有模式中提取出分类能力甚强的成分，然后进行贝叶斯(Bayes)判别。这种集成方法尤其适用于复杂化学信息的模式分类，本文将其应用于两种类型的化学模式分类问题，均取得了令人满意的效果。与经典的判别分析方法和单纯的神经网络方法相比，具有明显的优越性。     

Oxidative addition of the ethane C-C bond to Pd. An ab initio benchmark and DFT validation study

We have computed a state-of-the-art benchmark potential energy surface (PES) for the archetypal oxidative addition of the ethane C-C bond to the palladium atom and have used this to evaluate the performance of 24 popular density functionals, covering LDA, GGA, meta-GGA, and hybrid density functionals, for describing this reaction. The ab initio benchmark is obtained by exploring the PES using a hierarchical series of ab initio methods [HF, MP2, CCSD, CCSD(T)] in combination with a hierarchical series of five Gaussian-type basis sets, up to g polarization. Relativistic effects are taken into account either through a relativistic effective core potential for palladium or through a full four-component all-electron approach. Our best estimate of kinetic and thermodynamic parameters is -10.8 (-11.3) kcal/mol for the formation of the reactant complex, 19.4 (17.1) kcal/mol for the activation energy relative to the separate reactants, and -4.5 (-6.8) kcal/mol for the reaction energy (zero-point vibrational energy-corrected values in parentheses). Our work highlights the importance of sufficient higher angular momentum polarization functions for correctly describing metal-d-electron correlation. Best overall agreement with our ab initio benchmark is obtained by functionals from all three categories, GGA, meta-GGA, and hybrid DFT, with mean absolute errors of 1.5 to 2.5 kcal/mol and errors in activation energies ranging from -0.2 to -3.2 kcal/mol. Interestingly, the well-known BLYP functional compares very reasonably with a slight underestimation of the overall barrier by -0.9 kcal/mol. For comparison, with B3LYP we arrive at an overestimation of the overall barrier by 5.8 kcal/mol. On the other hand, B3LYP performs excellently for the central barrier (i.e., relative to the reactant complex) which it underestimates by only -0.1 kcal/mol.     

Semi‐classical formulation of time‐dependent discrete variable representation method

In this article, we apply a novel time‐dependent discrete variable representation (TDDVR) method proposed by Barkakaty and Adhikari to investigate tunneling through an Eckart barrier. This semi‐classical method is theoretically rigorous and straightforward to implement. Among the TDDVR formulations, this report presents the first derivation of a rigorous form of quantum force (QF) for the present perspective. The validity of this semi‐classical approach is demanded based on the excellent agreement of the tunneling probability with the corresponding quantum results. © 2004 Wiley Periodicals, Inc. Int J Quantum Chem, 2004     

一些稀疏图的强边染色（英文）

图G的强边染色是指对图G进行正常边染色使得任意长度为3的路的三条边染不同的颜色.图G的强边色数,记为χ’_s(G),是使得图G是强k边着色的最小正整数kk.2015年,Zang [arXiv:1510.00785]证明了:最大度△(G)=5的图G,χ’_s(G)≤37.本文证明了:最大度△(G)=5且最大平均度小于8/3(或者14/5)的图G,χ’_s(G)≤13 (或者14).另外,本文证明了:最大度△(G)≥3的不含K_2,3-图子式的图G,χ’_s(G)≤4△(G)-6,这个界是紧的.     

AnL 1 smoothing spline algorithm with cross validation

We propose an algorithm for the computation ofL ₁ (LAD) smoothing splines in the spacesW _M (D), with . We assume one is given data of the formy _i =(f(t _i ) + _i , i=1,...,N with {itt_i} _i=1 ^{N D} , the _i are errors withE( _i )=0, andf is assumed to be inW _M . The LAD smoothing spline, for fixed smoothing parameter0, is defined as the solution,s , of the optimization problem (1/N) _i=1 ^N ¦y _i –g(t _i ¦+J _M (g), whereJ _M (g) is the seminorm consisting of the sum of the squaredL ₂ norms of theMth partial derivatives ofg. Such an LAD smoothing spline,s , would be expected to give robust smoothed estimates off in situations where the _i are from a distribution with heavy tails. The solution to such a problem is a thin plate spline of known form. An algorithm for computings is given which is based on considering a sequence of quadratic programming problems whose structure is guided by the optimality conditions for the above convex minimization problem, and which are solved readily, if a good initial point is available. The data driven selection of the smoothing parameter is achieved by minimizing aCV() score of the form .The combined LAD-CV smoothing spline algorithm is a continuation scheme in 0 taken on the above SQPs parametrized in, with the optimal smoothing parameter taken to be that value of at which theCV() score first begins to increase. The feasibility of constructing the LAD-CV smoothing spline is illustrated by an application to a problem in environment data interpretation.