Multivariate calibration of near infrared spectra by orthogonal WAVElet correction using a genetic algorithm

Orthogonal WAVElet correction (OWAVEC) is a pre-processing method aimed at simultaneously accomplishing two essential needs in multivariate calibration, signal correction and data compression, by combining the application of an orthogonal signal correction algorithm to remove information unrelated to a certain response with the great potential that wavelet analysis has shown for signal processing. In the previous version of the OWAVEC method, once the wavelet coefficients matrix had been computed from NIR spectra and deflated from irrelevant information in the orthogonalization step, effective data compression was achieved by selecting those largest correlation/variance wavelet coefficients serving as the basis for the development of a reliable regression model. This paper presents an evolution of the OWAVEC method, maintaining the first two stages in its application procedure (wavelet signal decomposition and direct orthogonalization) intact but incorporating genetic algorithms as a wavelet coefficients selection method to perform data compression and to improve the quality of the regression models developed later. Several specific applications dealing with diverse NIR regression problems are analyzed to evaluate the actual performance of the new OWAVEC method. Results provided by OWAVEC are also compared with those obtained with original data and with other orthogonal signal correction methods.     

Efficiency of four different techniques in coupled HPLC-UV/VIS to quantify overlapping peaks with known spectral features

Summary Four different techniques to quantify unresolved chromatographic peaks with known spectral features combined with photodiode array detection, are investigated as regards their efficiency for the accurate and precise determination of drugs in the low g-range. The comparison includes peak suppression utilising difference chromatograms, first-order derivative chromatograms, selective chromatograms, generated by the calculation of orthogonal polynomial shares, and the powerful least-squares multicomponent analysis approach. Each of these methods uses UV-spectra taken throughout, the peak. The results presented and conclusions reached should enable the chromatographer to come to a decision about the reasonable use of these options now provided by multichannel detection in HPLC.     

Some generating functions of Jacobi polynomials

In this paper, Weisner’s group-theoretic method of obtaining generating functions is utilized in the study of Jacobi polynomialsP> _n ^(a,ß)(x) by giving suitable interpretations to the index (n) and the parameter (β) to find out the elements for constructing a six-dimensional Lie algebra.     

离子交换树脂纯化酪蛋白磷酸肽研究

通过单因素实验和正交试验确定了使用D-201型大孔强碱性阴离子交换树脂纯化酪蛋白磷酸肽(CPPs)的操作条件为：洗脱温度40℃、洗脱酸(HCI)浓度0．2mol／L、洗脱速度2．3ml／min、进样浓度2％(w／v)，进一步应用HPSEC技术分析考察了离子交换树脂纯化后含磷洗脱峰分子量分布情况，并计算了产品氮磷比与纯化收率．     

Zhang–Zhang Polynomials of Multiple Zigzag Chains Revisited: A Connection with the John–Sachs Theorem

Multiple zigzag chains Zm,n of length n and width m constitute an important class of regular graphene flakes of rectangular shape. The physical and chemical properties of these basic pericondensed benzenoids can be related to their various topological invariants, conveniently encoded as the coefficients of a combinatorial polynomial, usually referred to as the ZZ polynomial of multiple zigzag chains Zm,n. The current study reports a novel method for determination of these ZZ polynomials based on a hypothesized extension to John–Sachs theorem, used previously to enumerate Kekulé structures of various benzenoid hydrocarbons. We show that the ZZ polynomial of the Zm,n multiple zigzag chain can be conveniently expressed as a determinant of a Toeplitz (or almost Toeplitz) matrix of size m2×m2 consisting of simple hypergeometric polynomials. The presented analysis can be extended to generalized multiple zigzag chains Zkm,n, i.e., derivatives of Zm,n with a single attached polyacene chain of length k. All presented formulas are accompanied by formal proofs. The developed theoretical machinery is applied for predicting aromaticity distribution patterns in large and infinite multiple zigzag chains Zm,n and for computing the distribution of spin densities in biradical states of finite multiple zigzag chains Zm,n.     

Certain bilateral generating relations for generalized hypergeometric functions

Recently, we introduced a class of generalized hypergeometric functionsI n:(b _q)/α:(a _p) (x, w) by using a difference operator Δ _x,w , where . In this paper an attempt has been made to obtain some bilateral generating relations associated withI _n ^ga (x, w). Each result is followed by its applications to the classical orthogonal polynomials.     

The nearest neighbor random walk on subspaces of a vector space and rate of convergence

LetX be the collection ofk-dimensional subspaces of ann-dimensional vector spaceV _n overGF(q). A metric may be defined onX by letting

Characterizations of generalized Hermite and sieved ultraspherical polynomials

A new characterization of the generalized Hermite polyno-
mials and of the orthogonal polynomials with respect to the measure
is derived which is based on a ``reversing property" of the coefficients in the corresponding recurrence formulas and does not use the representation in terms of Laguerre and Jacobi polynomials. A similar characterization can be obtained for a generalization of the sieved ultraspherical polynomials of the first and second kind. These results are applied in order to determine the asymptotic limit distribution for the zeros when the degree and the parameters tend to infinity with the same order.

     

Formal orthogonal polynomials revisited. Applications

From some results concerning the formal orthogonal polynomials, already proved in [5], we develop new properties of generalized adjacent polynomials which correspond to a change in the weight function. A new structure of the singular blocks is given. These results have a direct application to Lanczos methods, theG and -algorithms.