Setting local rank constraints by orthogonal projections for image resolution analysis: Application to the determination of a low dose pharmaceutical compound

Raman chemical imaging provides chemical and spatial information about pharmaceutical drug product. By using resolution methods on acquired spectra, the objective is to calculate pure spectra and distribution maps of image compounds. With multivariate curve resolution-alternating least squares, constraints are used to improve the performance of the resolution and to decrease the ambiguity linked to the final solution. Non negativity and spatial local rank constraints have been identified as the most powerful constraints to be used.     

A volatolomic approach using cerumen as biofluid to diagnose bovine intoxication by Stryphnodendron rotundifolium

An innovative volatolomic approach employs the detection of biomarkers present in cerumen (earwax) to identify cattle intoxication by Stryphnodendron rotundifolium Mart., Fabaceae (popularly known as barbatimão). S. rotundifolium is a poisonous plant with the toxic compound undefined and widely distributed throughout the Brazilian territory. Cerumen samples from cattle of two local Brazilian breeds (‘Curraleiro Pé-Duro’ and ‘Pantaneiro’) were collected during an experimental intoxication protocol and analyzed using headspace (HS)/GC–MS followed by multivariate analysis (genetic algorithm for a partial least squares, cluster analysis, and classification and regression trees). A total of 106 volatile organic metabolites were identified in the cerumen samples of bovines. The intoxication by S. rotundifolium influenced the cerumen volatolomic profile of the bovines throughout the intoxication protocol. In this way, it was possible to detect biomarkers for cattle intoxication. Among the biomarkers, 2-octyldecanol and 9-tetradecen-1-ol were able to discriminate all samples between intoxicated and nonintoxicated bovines. The cattle intoxication diagnosis by S. rotundifolium was accomplished by applying the cerumen analysis using HS/GC–MS, in an easy, accurate, and noninvasive way. Thus, the proposed bioanalytical chromatography protocol is a useful tool in veterinary applications to determine this kind of intoxication.     

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.     

有势场逆问题的边界元法

本文给出了位势方程逆问题的一种最小二乘边界元解法。控制方程为Ｌａｐｌａｃｅ方程，但一部分边界上未给出任何边值，而只在某些内点上给出了势函值。这一问题在数学上属不适定问题，但在一定条件下存在唯一解。本文同时给出了一种估计解的可靠性的方法。数值试验表明，这类逆问题采用边界元法是非常有效的。     

线性双向联想存储器

提出了一个线性双向联想存储器的模型，一组有限个向量对由一线性算子建立起双向联想关系，此线性算于是一个网络的联结权重矩阵。该权矩阵由最小二乘法决定。由权矩阵的解导出一特殊类型的Ｌｙａｐｕｎｏｖ矩阵方程．本文提供了这种Ｌｙａｐｕｎｏｖ矩阵方程的解。     

模糊线性回归模型的约束最小二乘估计

自Tanaka等1982年提出模糊回归概念以来,该问题已得到广泛的研究。作为主要估计方法之一的模糊最小二乘估计以其与统计最小二乘估计的密切联系更受到人们的重视。本文依据适当定义的两个模糊数之间的距离,提出了模糊线性回归模型的一个约束最小二乘估计方法,该方法不仅能使估计的模糊参数的宽度具有非负性而且估计的模糊参数的中心线与传统的最小二乘估计相一致。最后,通过数值例子说明了所提方法的具体应用。     

Analytic calculation of scaling dimensions: Tricritical hard squares and critical hard hexagons

The finite-size corrections, central chargesc, and scaling dimensionsx of tricritical hard squares and critical hard hexagons are calculated analytically. This is achieved by solving the special functional equation or inversion identity satisfied by the commuting row transfer matrices of these lattice models at criticality. The results are expressed in terms of Rogers dilogarithms. For tricritical hard squares we obtainc=7/10,x=3/40, 1/5, 7/8, 6/5 and for hard hexagons we obtainc=4/5,x=2/15, 4/5, 17/15, 4/3, 9/5, in accord with the predictions of conformal and modular invariance.     

A stochastic algorithm using one sample point per iteration and diminishing stepsizes

A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex _i , one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx ₁,x ₂,...generated by the algorithm is bounded, then all of its accumulation points are stationary.     

Adaptive Algorithm for Constrained Least-Squares Problems

This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method.     

Solution of large‐scale weighted least‐squares problems

A sequence of least‐squares problems of the form min_y∥G^1/2(A^T y?h)∥₂, where G is an n×n positive‐definite diagonal weight matrix, and A an m×n (m?n) sparse matrix with some dense columns; has many applications in linear programming, electrical networks, elliptic boundary value problems, and structural analysis. We suggest low‐rank correction preconditioners for such problems, and a mixed solver (a combination of a direct solver and an iterative solver). The numerical results show that our technique for selecting the low‐rank correction matrix is very effective. Copyright © 2002 John Wiley & Sons, Ltd.