Plant Copper Amine Oxidases: Key Players in Hormone Signaling Leading to Stress-Induced Phenotypic Plasticity

Polyamines are ubiquitous, low-molecular-weight aliphatic compounds, present in living organisms and essential for cell growth and differentiation. Copper amine oxidases (CuAOs) oxidize polyamines to aminoaldehydes releasing ammonium and hydrogen peroxide, which participates in the complex network of reactive oxygen species acting as signaling molecules involved in responses to biotic and abiotic stresses. CuAOs have been identified and characterized in different plant species, but the most extensive study on a CuAO gene family has been carried out in Arabidopsis thaliana. Growing attention has been devoted in the last years to the investigation of the CuAO expression pattern during development and in response to an array of stress and stress-related hormones, events in which recent studies have highlighted CuAOs to play a key role by modulation of a multilevel phenotypic plasticity expression. In this review, the attention will be focused on the involvement of different AtCuAOs in the IAA/JA/ABA signal transduction pathways which mediate stress-induced phenotypic plasticity events.     

Enoxaparin in the prevention of deep venous thrombosis after major surgery: multicentric study. The Italian Study Group

Four hundred forty-six patients with Tourette Syndrome (TS) and/or their parents completed a 52-item self-report survey about vocal and motor tics, and the frequency of associated co-morbid conditions of aggression, obsessions and compulsions, attentional problems, sleep disturbance, mood disturbance, anxiety, and self-mutilative behaviours which have been frequently reported in the literature on TS. Respondents also responded to an open-ended question regarding the most disabling aspects of TS. Results were analyzed within two age groups; under 18 years of age (N = 245) and 18 years of age or older (N = 177). Tics and associated conditions were the most frequently reported disabling aspect by both age groups. Subjects under age 18, however, reported significantly more frequent problems with hyperactivity, temper control, aggressive behaviours and sleepwalking than adults with TS.     

Volatile compounds produced by irradiation of butterfat

Anhydrous butterfat was irradiated at 6 megarads in a special glass reaction flask, and the headspace and total condensate samples were examined by wide-range (−180C to 125C) gas chromatography combined with mass spectrometry. The nature and amounts of volatile compounds were not greatly influenced by whether the butterfat was irradiated under oxygen or under vacuum, nor (apart fromn-alkanoic acids) by storage for 1 and 9 weeks. Carbon dioxide was produced in greatest amount. Of the remaining compounds, aliphatic hydrocarbons predominated both in number and amount. Aliphatic oxygenated compounds including carbonyl compounds were isolated in relatively small amounts. The following compounds were identified positively: C_1–13 n-alkanes; C_4–9 2-methylalkanes; C_2–14 alk-l-enes; C_2–9 alk-l-ynes; C_2–5 n-alkanoic acids; C_1–5 n-alkan-l-ols and propan-2-ol; C_2–8 n-alkanals and 2-methylbut-2-enal; C_3–5,7 alkan-2-ones; C_1–4 n-alkyl formates, vinyl and isoamyl formate, methyl acetate and methyln-hexanoate; and carbon dioxide. Visiting Scientist from Division of Dairy Research, C.S.I.R.O., Highett, Victoria, Australia.     

A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques

In recent years, cubic regularization algorithms for unconstrained optimization have been defined as alternatives to trust-region and line search schemes. These regularization techniques are based on the strategy of computing an (approximate) global minimizer of a cubic overestimator of the objective function. In this work we focus on the adaptive regularization algorithm using cubics (ARC) proposed in Cartis et al. [Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results, Mathematical Programming A 127 (2011), pp. 245–295]. Our purpose is to design a modified version of ARC in order to improve the computational efficiency preserving global convergence properties. The basic idea is to suitably combine a Goldstein-type line search and a nonmonotone accepting criterion with the aim of advantageously exploiting the possible good descent properties of the trial step computed as (approximate) minimizer of the cubic model. Global convergence properties of the proposed nonmonotone ARC algorithm are proved. Numerical experiments are performed and the obtained results clearly show satisfactory performance of the new algorithm when compared to the basic ARC algorithm.     

Speeding up the spatial adiabatic passage of matter waves in optical microtraps by optimal control

We numerically investigate the performance of atomic transport in optical microtraps via the so called spatial adiabatic passage technique. Our analysis is carried out by means of optimal control methods, which enable us to determine suitable transport control pulses. We investigate the ultimate limits of the optimal control in speeding up the transport process in a triple well configuration for both a single atomic wave packet and a Bose-Einstein condensate within a regime of experimental parameters achievable with current optical technology.     

Quantum computing implementations with neutral particles

We review quantum information processing with cold neutral particles, that is, atoms or polar molecules. First, we analyze the best suited degrees of freedom of these particles for storing quantum information, and then we discuss both single- and two-qubit gate implementations. We focus our discussion mainly on collisional quantum gates, which are best suited for atom-chip-like devices, as well as on gate proposals conceived for optical lattices. Additionally, we analyze schemes both for cold atoms confined in optical cavities and hybrid approaches to entanglement generation, and we show how optimal control theory might be a powerful tool to enhance the speed up of the gate operations as well as to achieve high fidelities required for fault tolerant quantum computation.     

iLogDemons: A Demons-Based Registration Algorithm for Tracking Incompressible Elastic Biological Tissues

Tracking soft tissues in medical images using non-linear image registration algorithms requires methods that are fast and provide spatial transformations consistent with the biological characteristics of the tissues. LogDemons algorithm is a fast non-linear registration method that computes diffeomorphic transformations parameterised by stationary velocity fields. Although computationally efficient, its use for tissue tracking has been limited because of its ad-hoc Gaussian regularisation, which hampers the implementation of more biologically motivated regularisations. In this work, we improve the logDemons by integrating elasticity and incompressibility for soft-tissue tracking. To that end, a mathematical justification of demons Gaussian regularisation is proposed. Building on this result, we replace the Gaussian smoothing by an efficient elastic-like regulariser based on isotropic differential quadratic forms of vector fields. The registration energy functional is finally minimised under the divergence-free constraint to get incompressible deformations. As the elastic regulariser and the constraint are linear, the method remains computationally tractable and easy to implement. Tests on synthetic incompressible deformations showed that our approach outperforms the original logDemons in terms of elastic incompressible deformation recovery without reducing the image matching accuracy. As an application, we applied the proposed algorithm to estimate 3D myocardium strain on clinical cine MRI of two adult patients. Results showed that incompressibility constraint improves the cardiac motion recovery when compared to the ground truth provided by 3D tagged MRI.     

A pseudo-random network mobile automaton with linear growth

Based on the mobile automaton model, an algorithm is introduced that grows planar, tri-valent graphs by exhibiting a peculiar, twofold dynamics. In a first phase, graph growth appears to be pseudo-random and O(n) then it settles to a very regular behavior and rate. A pseudo-random mobile automaton is already known; the new automaton provides now a finite, but surprisingly long, pseudo-random, linear growth process. Applications of mobile automata to fundamental physics and quantum gravity have been recently suggested.