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.     

The many proofs of an identity on the norm of oblique projections

Given an oblique projector P on a Hilbert space, i.e., an operator satisfying P ²=P, which is neither null nor the identity, it holds that ||P|| = ||I –P||. This useful equality, while not widely-known, has been proven repeatedly in the literature. Many published proofs are reviewed, and simpler ones are presented.     

准晶体中八方晶系点群的对称性与矩阵表示

从理论上对准晶体中八方晶系各点群进行了研究.运用八方晶系各点群的极赤投影图,列出了各点群的所有对称操作;填出了固有点群822的群乘表.运用坐标变换和群论在自定义的八方坐标系中,推导出八方晶系点群所有对称操作的矩阵.这32个3×3矩阵的结构是相当简洁的,它们的矩阵元只有5种可能取值:0,±1,±2.其中2是反映八方晶系准晶体所具有的准周期性的特殊无理数.     

The combination technique and some generalisations

The combination technique has repeatedly been shown to be an effective tool for the approximation with sparse grid spaces. Little is known about the reasons of this effectiveness and in some cases the combination technique can even break down. It is known, however, that the combination technique produces an exact result in the case of a projection into a sparse grid space if the involved partial projections commute.

The performance of the combination technique is analysed using a projection framework and the C/S decomposition. Error bounds are given in terms of angles between the spanning subspaces or the projections onto these subspaces. Based on this analysis modified combination coefficients are derived which are optimal in a certain sense and which can substantially extend the applicability and performance of the combination technique.     

Empirical minimization

We investigate the behavior of the empirical minimization algorithm using various methods. We first analyze it by comparing the empirical, random, structure and the original one on the class, either in an additive sense, via the uniform law of large numbers, or in a multiplicative sense, using isomorphic coordinate projections. We then show that a direct analysis of the empirical minimization algorithm yields a significantly better bound, and that the estimates we obtain are essentially sharp. The method of proof we use is based on Talagrand's concentration inequality for empirical processes. Research partially supported by NSF under award DMS-0434393. Research partially supported by the Australian Research Council Discovery Porject DP0343616.     

Metabolomic-based investigation of Yinlan alleviating hyperlipidemia by inhibiting blood stasis and phlegm turbidity through the PXR-CYP3A4-ABCB1-FXR pathway

Yinlan lipid regulatory capsule (YL) is a composite traditional Chinese medicine (TCM) new drug to alleviate hyperlipidemia, while its therapeutic mechanism in vivo was not clarified with nontargeted metabolomics investigation. An animal model was established in rats fed a high-fat diet, and their body weights, body mass index (BMI) and blood cholesterol levels were measured. Serum, liver and kidney tissue samples were also extracted for PXR-CYP3A4-ABCB1-FXR signaling pathway research using PCR and UHPLC–MS. The obtained plasma samples were analyzed by UHPLC-Q-TOF-MS metabolomic investigation, which revealed PXR-CYP3A4-related metabolites and changes induced by YL. Finally, the key metabolites were chosen as index components, and their levels in the serum, liver, small intestine and bile were used for simultaneous UHPLC–MS-MS determination. The results indicated that YL was effective in rebalancing blood TG and TC levels (compared to controls). With respect to the PXR-CYP3A4-ABCB1 pathway, as a result of YL’s effect, gene expression or activity of the two targets decreased significantly in both the liver and kidney. The same trend was observed in the serum samples mentioned above. Metabolomics screening and data revealed that 44 metabolites can be regarded as biomarkers related to hyperlipidemia, fatty acids synthesis, and body energy consumption, as well as synthesis, transportation and exertion of cholesterol. YL’s treatment focused on 26 of them, primarily bile acids, indicating that the antihyperlipidemic effect of this drug lies in its inhibitory activity of cholesterol metabolism. Subsequent analysis of those in vivo components revealed that significant increases (compared to the model group) occurred in the blood, liver, small intestine and bile in groups that received medium and high doses of YL (while the low dose was relatively unchanged). Those target components exhibit a close relationship with PXR and/or CYP3A4. The use of YL repressed PXR expression and subsequently decreased CYP3A4 activity. As a result, synthesis of related bile acids increased, while cholesterol levels decreased, consequently leading to the attenuation of hyperlipidemia. This study comprehensively investigated the antihyperlipidemia mechanism of YL based on its repression of PXR-CYP3A4 activity and related metabolite yield, establishing an accurate method for evaluating the therapeutic effect of YL.     

Numerical comparison of several variable-metric algorithms

The paper compares the numerical performances of the LDL decomposition of the BFGS variable-metric algorithm, the Dennis-Mei dogleg algorithm on the BFGS update, and Davidon's projections with the BFGS update with the straight BFGS update on a number of standard test problems. Numerical results indicate that the standard BFGS algorithm is superior to all of the more complex strategies.This research was supported by the National Science Foundation under Research Grant No. MCS77-07327.     

Conjugate-gradient method for computing the Moore-Penrose inverse and rank of a matrix

A conjugate-gradient method is developed for computing the Moore-Penrose generalized inverseA of a matrix and the associated projectors, by using the least-square characteristics of both the method and the inverseA . Two dual algorithms are introduced for computing the least-square and the minimum-norm generalized inverses, as well asA . It is shown that (i) these algorithms converge for any starting approximation; (ii) if they are started from the zero matrix, they converge toA ; and (iii) the trace of a sequence of approximations multiplied byA is a monotone increasing function converging to the rank ofA. A practical way of compensating the self-correcting feature in the computation ofA is devised by using the duality of the algorithms. Comparison with Ben-Israel's method is made through numerical examples. The conjugate-gradient method has an advantage over Ben-Israel's method.After having completed the present paper, the author received from Professor M. R. Hestenes his paper entitledPseudo Inverses and Conjugate Gradients. This paper treated the same subject and appeared in Communications of the ACM, Vol. 18, pp. 40–43, 1975.     

Interpolating solutions of the Poisson equation in the disk based on Radon projections

We consider an algebraic method for reconstruction of a function satisfying the Poisson equation with a polynomial right-hand side in the unit disk. The given data, besides the right-hand side, is assumed to be in the form of a finite number of values of Radon projections of the unknown function. We first homogenize the problem by finding a polynomial which satisfies the given Poisson equation. This leads to an interpolation problem for a harmonic function, which we solve in the space of harmonic polynomials using a previously established method. For the special case where the Radon projections are taken along chords that form a regular convex polygon, we extend the error estimates from the harmonic case to this Poisson problem. Finally we give some numerical examples.