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.     

Recyclable and reusable Pd(OAc)2/PPh3/PEG‐2000 system for homocoupling reaction of arylboronic acids under air without base

A stable and efficient Pd(OAc)₂/PPh₃/PEG‐2000 catalytic system for homocoupling of arylboronic acids has been developed. In the presence of Pd(OAc)₂ and PPh₃, the homocoupling reaction of arylboronic acids was carried out smoothly in PEG‐2000 at 70 °C under air without base to afford a variety of symmetric biaryls in good to excellent yields. The isolation of the products was readily performed by extraction with diethyl ether, and the Pd(OAc)₂/PPh₃/PEG‐2000 system could be easily recycled and reused six times without significant loss of catalytic activity. Copyright © 2014 John Wiley & Sons, Ltd.     

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.     

Approximate inverse computation using Frobenius inner product

Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, min_M∈??∥AM?I∥ _F and matrix M₀∈?? corresponding to this minimum (?? being any vectorial subspace of ??_n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd.     

Hankel convolution operators on entire functions and distributions

In this paper we study the Hankel convolution operators on the space of even and entire functions and on Schwartz distribution spaces. We characterize the Hankel convolution operators as those ones that commute with Hankel translations and with a Bessel operator. Also we prove that the Hankel convolution operators are hypercyclic and chaotic on the spaces under consideration.     

Minimal Submanifolds in a Locally Symmetric and Conformally Flat Space

We study minimal submanifolds in the locally symmetric and conformally flat Riemannian manifold and generalize Yau's result obtained in J. Amer. Math. 97 (1975), 76–100.     

Rank-perfect and" weakly rank-perfect graphs

An edge e of a perfect graph G is critical if G−e is imperfect. We would like to decide whether G−e is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph of a bipartite graph or from the complement of such a graph.     

Stable multi-sets

In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge bounds equal one, stable multi-sets are equivalent to stable sets.  For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable multi-sets and conditions for them to be facet defining are determined.  The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets emerge as an important substructure in the design of optical networks. Received: February 14, 2001/Revised version: September 7, 2001     

A method for calculating invariant subspaces of symmetric hyperbolic equations

An algorithm is constructed for calculating invariant subspaces of symmetric hyperbolic systems arising in electromagnetic, acoustic, and elasticity problems. Discrete approximations are calculated for subspaces that correspond to minimal eigenvalues and smooth eigenfunctions. Difficulties related to the presence of an infinite-dimensional kernel in the differential operator are successfully handled. The efficiency of the algorithm is demonstrated using acoustics equations.     

Commuting and stable feedback design for switched linear systems

In the paper, commuting and stable feedback design for switched linear systems is investigated. This problem is formulated as to build up suitable state feedback controller for each subsystem such that the closed-loop systems are not only asymptotically stable but also commuting each other. A new concept, common admissible eigenvector set (CAES), is introduced to establish necessary/sufficient conditions for commuting and stable feedback controllers. For second-order systems, a necessary and sufficient condition is established. Moreover, a parametrization of the CAES is also obtained. The motivation comes from stabilization of switched linear systems which consist of a family of LTI systems and a switching law specifying the switching between them, where if all the subsystems are stable and commuting each other, then the total system is stable under arbitrary switching.