Incorporating interactions in multi‐block sequential and orthogonalised partial least squares regression

This paper is about how to incorporate interaction effects in multi‐block methodologies. The method proposed is inspired by polynomial regression modelling in the case with only a few independent variables but extends/generalises the idea to situations where the blocks are potentially very large with respect to the number of variables. The method follows a so‐called type I sums of squares strategy where the linear effects (main effects) are incorporated sequentially and before the interactions. The sequential and orthogonalised partial least squares (SO‐PLS) technique is used as a basis for the proposal. The SO‐PLS method is based on sequential estimation of each new block by the PLS regression method after orthogonalisation with respect to blocks already fitted. The new method preserves the invariance already established for SO‐PLS and can be used for blocks with different dimensionality. The method is tested on one real data set with two independent blocks with different complexity and on a simulated data set with a large number of variables in each block. Copyright © 2011 John Wiley & Sons, Ltd.     

Reductive dehydroxylation of allyl alcohols by IspH protein

The biosynthesis of natural products is a treasure trove of unusual reaction mechanisms. This Minireview summarizes recent work on the structure and mechanism of IspH protein, which catalyzes the reductive dehydroxylation of an allyl alcohol in a biosynthetic pathway leading to isoprenoid precursors.     

Decreasing the oxidative potential of TiO(2) nanoparticles through modification of the surface with carbon: a new strategy for the production of safe UV filters

A safe UV filter may be obtained by inhibiting the photo-generation of free radicals through modification of the surface of TiO(2) nanoparticles with carbon.     

Design, parametrization, and pole placement of stabilizing output feedback compensators via injective cogenerator quotient signal modules

Control design belongs to the most important and difficult tasks of control engineering and has therefore been treated by many prominent researchers and in many textbooks, the systems being generally described by their transfer matrices or by Rosenbrock equations and more recently also as behaviors. Our approach to controller design uses, in addition to the ideas of our predecessors on coprime factorizations of transfer matrices and on the parametrization of stabilizing compensators, a new mathematical technique which enables simpler design and also new theorems in spite of the many outstanding results of the literature: (1) We use an injective cogenerator signal module ? over the polynomial algebra [Formula: see text] (F an infinite field), a saturated multiplicatively closed set T of stable polynomials and its quotient ring [Formula: see text] of stable rational functions. This enables the simultaneous treatment of continuous and discrete systems and of all notions of stability, called T-stability. We investigate stabilizing control design by output feedback of input/output (IO) behaviors and study the full feedback IO behavior, especially its autonomous part and not only its transfer matrix. (2) The new technique is characterized by the permanent application of the injective cogenerator quotient signal module [Formula: see text] and of quotient behaviors [Formula: see text] of [Formula: see text]-behaviors B. (3) For the control tasks of tracking, disturbance rejection, model matching, and decoupling and not necessarily proper plants we derive necessary and sufficient conditions for the existence of proper stabilizing compensators with proper and stable closed loop behaviors, parametrize all such compensators as IO behaviors and not only their transfer matrices and give new algorithms for their construction. Moreover we solve the problem of pole placement or spectral assignability for the complete feedback behavior. The properness of the full feedback behavior ensures the absence of impulsive solutions in the continuous case, and that of the compensator enables its realization by Kalman state space equations or elementary building blocks. We note that every behavior admits an IO decomposition with proper transfer matrix, but that most of these decompositions do not have this property, and therefore we do not assume the properness of the plant. (4) The new technique can also be applied to more general control interconnections according to Willems, in particular to two-parameter feedback compensators and to the recent tracking framework of Fiaz/Takaba/Trentelman. In contrast to these authors, however, we pay special attention to the properness of all constructed transfer matrices which requires more subtle algorithms.     

Synchrosqueezed wavelet transforms: An empirical mode decomposition-like tool

The EMD algorithm is a technique that aims to decompose into their building blocks functions that are the superposition of a (reasonably) small number of components, well separated in the time–frequency plane, each of which can be viewed as approximately harmonic locally, with slowly varying amplitudes and frequencies. The EMD has already shown its usefulness in a wide range of applications including meteorology, structural stability analysis, medical studies. On the other hand, the EMD algorithm contains heuristic and ad hoc elements that make it hard to analyze mathematically.In this paper we describe a method that captures the flavor and philosophy of the EMD approach, albeit using a different approach in constructing the components. The proposed method is a combination of wavelet analysis and reallocation method. We introduce a precise mathematical definition for a class of functions that can be viewed as a superposition of a reasonably small number of approximately harmonic components, and we prove that our method does indeed succeed in decomposing arbitrary functions in this class. We provide several examples, for simulated as well as real data.     

Spectral synthesis for coadjoint orbits of nilpotent Lie groups

We determine the space of primary ideals in the group algebra \(L^{1}(G) \) of a connected nilpotent Lie group by identifying for every \(\pi \in \widehat{G} \) the family \(\mathcal I^\pi \) of primary ideals with hull \(\{\pi \} \) with the family of invariant subspaces of a certain finite dimensional sub-space \(\mathcal P_Q^\pi \) of the space of polynomials \(\mathcal P(G) \) on G.