离散小波变换-遗传算法-交互检验法用于近红外光谱数据的高倍压缩与变量筛选

用遗传算法(GA)与交互检验(CV)相结合建立了一种用于对近红外光谱(NIR)数据及其离散小波变换(DWT)系数进行变量筛选的方法，并应用于烟草样品中总挥发碱和总氮的同时测定。结果表明：NIR数据经DWT压缩为原始大小的3．3％时基本没有光谱信息的丢失；有效的变量筛选可以极大地减少模型中的变量个数，降低模型的复杂程度，改善预测的准确度。     

Genomic variation and point mutations analysis of Indian COVID-19 patient samples submitted in GISAID database

Corona virus disease 2019 (COVID-19) endemic has havoc on the world; the causative virus of the pandemic is SARS CoV-2. Pharmaceutical companies and academic institutes are in continuous efforts to identify anti-viral therapy or vaccines, but the most significant challenge faced is the highly evolving genome of SARS CoV-2, which is imparting evolutionary selective benefits to the virus. To understand the viral mutations, we have retrieved nine hundred and thirty-four samples from different states of India via the GISAID database and analyzed the frequency of all types of point mutation in all structural, non-structural proteins, and accessory factors of SARS CoV-2. Spike glycol protein, nsp3, nsp6, nsp12, N and NS3 were the most evolving proteins. High frequency point mutations were Q496P (nsp2), A380V (nsp4), A994D (nsp3), L37F (nsp6), P323L & A97V (nsp12), Q57H (ns3), D614G (S), P13L (N), R203K (N), G204R (N) and S194L (N).     

Improved quantification limits in chiral capillary electrochromatography by peak compression effects

The peak compression effect has been applied to improve quantification limits in chiral capillary electrochromatography (CEC). A stationary phase based on the chiral selector vancomycin (Chirobiotic V) was used for separations of the enantiomers of mianserin. By adding solvents with a low dielectric constant, e.g. 2-propanol or tetrahydrofuran, to the sample solution, peak compression could be induced. The plate numbers for the minor enantiomer increased from approximately 100,000 to 1.4-1.6 million plates/m, when the composition of the mobile phase was adjusted so that the analyte eluted within either one of two system zones originating from the sample solution. A 10-fold improvement in the quantification limit for the minor enantiomer was obtained compared to elution under non-focused conditions.     

Orientation-reversing involutions on handlebodies

The observation that the quotient orbifold of an orientation- reversing involution on a 3-dimensional handlebody has the structure of a compression body leads to a strong classification theorem, and general structure theorems. The structure theorems decompose the action along invariant discs into actions on handlebodies which preserve the -fibers of some -bundle structure. As applications, various results of R. Nelson are proved without restrictive hypotheses.

     

New dynamic axial compression columns with means for monitoring floating adapter position. Column design and utilisation in low pressure LC on soft packings

Summary The design of new dynamic, axial-compression columns with a system for continous packed bed adjustment and monitoring of the floating adapter position is described. The columns are meant for liquid chromatography at low pressures (up to 8 bar) in aqueous and organic media with stationary phases of all types. The columns have adapter position pickups for continuous automatic monitoring of the bed height (original “swellographic” monitoring). The column described with gas pressurisation was tested with soft Sephadex G-10 and G-25. In spite of the reduction in external porosity there was no dramatic increase in back-pressure. The column proved to provide long-term stability of the packed bed and improvement in resolution. Presented at the 21^st ISC held in Stuttgart, Germany, 15^th–20^th September, 1996     

The approximation of electron densities

This paper discusses the approximate representation of the electron density produced by an ab initio calculation. A linear combination of Gaussians is fitted to the density by minimizing a functional which is the consequent error in field-energy. The practical implementation of the procedure, following a Gaussian 80 calculation, is described and some of the complications are analysed.     

弛豫理论对离子交换毛细管电色谱中峰压缩现象的研究

 在毛细管电色谱中,由于溶质在输运过程中所具有的电性质,常会产生一些特殊的现象。这些现象,如离子交换毛细管电色谱中产生超高柱效峰的现象,已经不能用一般的色谱理论加以解释。基于弛豫理论所建立的基本模型,在考虑溶质在两相中皆有可能发生正、反向迁移的情况下,得到了流出曲线一阶原点矩和二阶中心矩的理论表达式,并通过对溶质在两相中电扩散速率与电泳速率、电渗流速率关系的分析结果证实:溶质在固定相表面的电扩散行为可以使其保留变弱,出峰加快;而这种电扩散导致的超常柱效峰的出现具有不稳定性,只有在多方面因素综合影响匹配的情况下才可能出现。     

A path following algorithm for a class of convex programming problems

We present a primal-dual path following interior algorithm for a class of linearly constrained convex programming problems with non-negative decision variables. We introduce the definition of a Scaled Lipschitz Condition and show that if the objective function satisfies the Scaled Lipschitz Condition then, at each iteration, our algorithm reduces the duality gap by at least a factor of (1–/n), where is positive and depends on the curvature of the objective function, by means of solving a system of linear equations which requires no more than O(n³) arithmetic operations. The class of functions having the Scaled Lipschitz Condition includes linear, convex quadratic and entropy functions.     

A class of simplicial restart fixed point algorithms without an extra dimension

In an earlier paper we introduced an algorithm for approximating a fixed point of a mapping on the product space of unit simplices. Ideas of that paper are used to construct a class of triangulations ofR ⁿ. More precisely, for somek, 1 k n, and positive integersm ₁ , m_k with sumn, a triangulation ofR ⁿ is obtained by triangulating the cells which are formed by taking the product of given triangulations ofR ^mj, j = 1, ,k. The triangulation of each cell will be defined in relation to an arbitrarily chosen pointv inR ⁿ, being the starting point of the algorithm. Fork = n we obtain theK triangulation originally due to Todd. Each element of the class can be used to find a simplex which approximates a fixed point of a mapping onR ⁿ by generating a unique path of adjacent simplices of variable dimension starting with the pointv. We also give convergence conditions. It is indicated how in casek = n a connected set of fixed points can be generated. Moreover, we give some computational experience.