Investigation into mercury bound to biothiols:structural identification using ESI-ion-trap MS and introduction of a method for their HPLC separation with simultaneous detection by ICP-MS and ESI-MS

Mercury in plants or animal tissue is supposed to occur in the form of complexes formed with biologically relevant thiols (biothiols), rather than as free cation. We describe a technique for the separation and molecular identification of mercury and methylmercury complexes derived from their reactions with cysteine (Cys) and glutathione (GS): Hg(Cys)(2), Hg(GS)(2), MeHgCys, MeHgGS. Complexes were characterised by electrospray mass spectrometry (MS) equipped with an ion trap and the fragmentation pattern of MeHgCys was explained by using MP2 and B3LYP calculations, showing the importance of mercury-amine interactions in the gas phase. Chromatographic baseline separation was performed within 10 min with formic acid as the mobile phase on a reversed-phase column. Detection was done by online simultaneous coupling of ES-MS and inductively coupled plasma MS. When the mercury complexes were spiked in real samples (plant extracts), no perturbation of the separation and detection conditions was observed, suggesting that this method is capable of detecting mercury biothiol complexes in plants.

Multi-Modal CTL:Completeness, Complexity, and an Application

We define a multi-modal version of Computation Tree Logic (ctl) by extending the language with path quantifiers E and A where d denotes one of finitely many dimensions, interpreted over Kripke structures with one total relation for each dimension. As expected, the logic is axiomatised by taking a copy of a ctl axiomatisation for each dimension. Completeness is proved by employing the completeness result for ctl to obtain a model along each dimension in turn. We also show that the logic is decidable and that its satisfiability problem is no harder than the corresponding problem for ctl. We then demonstrate how Normative Systems can be conceived as a natural interpretation of such a multi-dimensional ctl logic. © 2009 Springer Science+Business Media B.V.

Added complexity in Ras and Rho family GTPase function:Added complexity in Ras and Rho family GTPase function

The regulation of the small GTPases leading to their membrane localization has long been attributed to processing of their C-terminal CAAX box. As deregulation of many of these GTPases have been implicated in cancer and other disorders, prenylation and methylation of this CAAX box has been studied in depth as a possibility for drug targeting, but unfortunately, to date no drug has proved clinically beneficial. However, these GTPases also undergo other modifications that may be important for their regulation. Ubiquitination has long been demonstrated to regulate the fate of numerous cellular proteins and recently it has become apparent that many GTPases, along with their GAPs, GeFs and GDis, undergo ubiquitination leading to a variety of fates such as re-localization or degradation. in this review we focus on the recent literature demonstrating that the regulation of small GTPases by ubiquitination, either directly or indirectly, plays a considerable role in controlling their function and that targeting these modifications could be important for disease treatment.

3D deflagration simulations leaving bound remnants:A model for 2002cx-like Type Ia supernovae

2002cx-like supernovae are a sub-class of sub-luminous Type Ia supernovae (SNe). Their light curves and spectra are characterized by distinct features that indicate strong mixing of the explosion ejecta. Pure turbulent deflagrations have been shown to produce such mixed ejecta. Here, we present hydrodynamics, nucleosynthesis and radiative-transfer calculations for a 3D full-star deflagration of a Chandrasekhar-mass white dwarf. Our model is able to reproduce the characteristic observational features of SN 2005hk (a prototypical 2002cx-like supernova), not only in the optical, but also in the near-infrared. For that purpose we present, for the first time, five near-infrared spectra of SN 2005hk from -0.2 to 26.6 d with respect to B-band maximum. Since our model burns only small parts of the initial white dwarf, it fails to completely unbind the white dwarf and leaves behind a bound remnant of ~1.03Mconsisting mainly of unburned carbon and oxygen, but also enriched by some amount of intermediate-mass and iron-group elements from the explosion products that fall back on the remnant.We discuss possibilities for detecting this bound remnant and how it might influence the late-time observables of 2002cx-like SNe. © 2013 The Authors Published by Oxford University Press on behalf of the Royal Astronomical Society.

Harnessing the complexity of gene expression data from cancer: from single gene to structural pathway methods

High-dimensional gene expression data provide a rich source of information because they capture the expression level of genes in dynamic states that reflect the biological functioning of a cell. For this reason, such data are suitable to reveal systems related properties inside a cell, e.g., in order to elucidate molecular mechanisms of complex diseases like breast or prostate cancer. However, this is not only strongly dependent on the sample size and the correlation structure of a data set, but also on the statistical hypotheses tested. Many different approaches have been developed over the years to analyze gene expression data to (I) identify changes in single genes, (II) identify changes in gene sets or pathways, and (III) identify changes in the correlation structure in pathways. In this paper, we review statistical methods for all three types of approaches, including subtypes, in the context of cancer data and provide links to software implementations and tools and address also the general problem of multiple hypotheses testing. Further, we provide recommendations for the selection of such analysis methods.

Food web indicators under the Marine Strategy Framework Directive: From complexity to simplicity?

The Marine Strategy Framework Directive (MSFD) requires that European Union Member States achieve "Good Environmental Status" (GES) in respect of 11 Descriptors of the marine environment by 2020. Of those, Descriptor 4, which focuses on marine food webs, is perhaps the most challenging to implement since the identification of simple indicators able to assess the health of highly dynamic and complex interactions is difficult. Here, we present the proposed food web criteria/indicators and analyse their theoretical background and applicability in order to highlight both the current knowledge gaps and the difficulties associated with the assessment of GES. We conclude that the existing suite of indicators gives variable focus to the three important food web properties: structure, functioning and dynamics, and more emphasis should be given to the latter two and the general principles that relate these three properties. The development of food web indicators should be directed towards more integrative and process-based indicators with an emphasis on their responsiveness to multiple anthropogenic pressures. (C) 2013 Elsevier Ltd. All rights reserved.

Sublinear Bounds for Randomized Leader Election

This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) takes only O(n-vlog3/2n) messages to elect a unique leader (with high probability). This algorithm is then extended to solve leader election on any connected non-bipartiten-node graph G in O(t(G)) time and O(t(G)n-vlog3/2n) messages, where t(G) is the mixing time of a random walk on G. The above result implies highly efficient (sublinear running time and messages) leader election algorithms for networks with small mixing times, such as expanders and hypercubes. In contrast, previous leader election algorithms had at least linear message complexity even in complete graphs. Moreover, super-linear message lower bounds are known for time-efficientdeterministic leader election algorithms. Finally, an almost-tight lower bound is presented for randomized leader election, showing that O(n-v) messages are needed for any O(1) time leader election algorithm which succeeds with high probability. It is also shown that O(n 1/3) messages are needed by any leader election algorithm that succeeds with high probability, regardless of the number of the rounds. We view our results as a step towards understanding the randomized complexity of leader election in distributed networks.

Sublinear bounds for randomized leader election

This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) uses only O(√ √nlog^3/2n) messages to elect a unique leader (with high probability). When considering the "explicit" variant of leader election where eventually every node knows the identity of the leader, our algorithm yields the asymptotically optimal bounds of O(1) rounds and O(. n) messages. This algorithm is then extended to one solving leader election on any connected non-bipartite n-node graph G in O(τ(. G)) time and O(τ(G)n√log^3/2n) messages, where τ(. G) is the mixing time of a random walk on G. The above result implies highly efficient (sublinear running time and messages) leader election algorithms for networks with small mixing times, such as expanders and hypercubes. In contrast, previous leader election algorithms had at least linear message complexity even in complete graphs. Moreover, super-linear message lower bounds are known for time-efficient deterministic leader election algorithms. Finally, we present an almost matching lower bound for randomized leader election, showing that Ω(n) messages are needed for any leader election algorithm that succeeds with probability at least 1/. e+. ε, for any small constant ε. >. 0. We view our results as a step towards understanding the randomized complexity of leader election in distributed networks.

Macroscopic bound entanglement in thermal graph states

We address the presence of bound entanglement in strongly interacting spin systems at thermal equilibrium. In particular, we consider thermal graph states composed of an arbitrary number of particles. We show that for a certain range of temperatures no entanglement can be extracted by means of local operations and classical communication, even though the system is still entangled. This is found by harnessing the independence of the entanglement in some bipartitions of such states with the system's size. Specific examples for one- and two-dimensional systems are given. Our results thus prove the existence of thermal bound entanglement in an arbitrary large spin system with finite-range local interactions.

Thermal bound entanglement in macroscopic systems and area law

Does bound entanglement naturally appear in quantum many-body systems? We address this question by showing the existence of bound-entangled thermal states for harmonic oscillator systems consisting of an arbitrary number of particles. By explicit calculations of the negativity for different partitions, we find a range of temperatures for which no entanglement can be distilled by means of local operations, despite the system being globally entangled. We offer an interpretation of this result in terms of entanglement-area laws, typical of these systems. Finally, we discuss generalizations of this result to other systems, including spin chains.

Complex organic molecules along the accretion flow in isolated and externally irradiated protoplanetary disks

(Abridged) The birth environment of the Sun will have influenced the conditions in the pre-solar nebula, including the attainable chemical complexity, important for prebiotic chemistry. The formation and distribution of complex organic molecules (COMs) in a disk around a T Tauri star is investigated for two scenarios: (i) an isolated disk, and (ii) a disk irradiated externally by a nearby massive star. The chemistry is calculated along the accretion flow from the outer disk inwards using a comprehensive network. Two simulations are performed, one beginning with complex ices and one with simple ices only. For the isolated disk, COMs are transported without major alteration into the inner disk where they thermally desorb into the gas reaching an abundance representative of the initial assumed ice abundance. For simple ices, COMs efficiently form on grain surfaces under the conditions in the outer disk. Gas-phase COMs are released into the molecular layer via photodesorption. For the irradiated disk, complex ices are also transported inwards; however, they undergo thermal processing caused by the warmer conditions in the irradiated disk which tends to reduce their abundance along the accretion flow. For simple ices, grain-surface chemistry cannot synthesise COMs in the outer disk because the necessary grain-surface radicals, which tend to be particularly volatile, are not sufficiently abundant on the grain surfaces. Gas-phase COMs are formed in the inner region of the irradiated disk via gas-phase chemistry induced by the desorption of strongly bound molecules such as methanol; hence, the abundances are not representative of the initial molecular abundances injected into the outer disk. These results suggest that the composition of comets formed in isolated disks may differ from those formed in externally irradiated disks with the latter composed of more simple ices.

A Tight Upper Bound on Bit Error Rate of Joint OFDM and Multi-Carrier Index Keying

This letter investigates performance enhancement by the concept of multi-carrier index keying in orthogonal frequency division multiplexing (OFDM) systems. For the performance evaluation, a tight closed-form approximation of the bit error rate (BER) is derived introducing the expression for the number of bit errors occurring in both the index domain and the complex domain, in the presence of both imperfect and perfect detection of active multi-carrier indices. The accuracy of the derived BER results for various cases are validated using simulations, which can provide accuracy within 1 dB at favorable channels.