Inducible transgenic expression in the short‐lived fish Nothobranchius furzeri

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/98378/1/jfb12099.pd

Self-stabilizing algorithms for Connected Vertex Cover and Clique decomposition problems

In many wireless networks, there is no fixed physical backbone nor centralized network management. The nodes of such a network have to self-organize in order to maintain a virtual backbone used to route messages. Moreover, any node of the network can be a priori at the origin of a malicious attack. Thus, in one hand the backbone must be fault-tolerant and in other hand it can be useful to monitor all network communications to identify an attack as soon as possible. We are interested in the minimum \emph{Connected Vertex Cover} problem, a generalization of the classical minimum Vertex Cover problem, which allows to obtain a connected backbone. Recently, Delbot et al.~\cite{DelbotLP13} proposed a new centralized algorithm with a constant approximation ratio of $2$ for this problem. In this paper, we propose a distributed and self-stabilizing version of their algorithm with the same approximation guarantee. To the best knowledge of the authors, it is the first distributed and fault-tolerant algorithm for this problem. The approach followed to solve the considered problem is based on the construction of a connected minimal clique partition. Therefore, we also design the first distributed self-stabilizing algorithm for this problem, which is of independent interest

A Superstabilizing log⁡(n)\log(n)-Approximation Algorithm for Dynamic Steiner Trees

In this paper we design and prove correct a fully dynamic distributed algorithm for maintaining an approximate Steiner tree that connects via a minimum-weight spanning tree a subset of nodes of a network (referred as Steiner members or Steiner group) . Steiner trees are good candidates to efficiently implement communication primitives such as publish/subscribe or multicast, essential building blocks for the new emergent networks (e.g. P2P, sensor or adhoc networks). The cost of the solution returned by our algorithm is at most $\log |S|$ times the cost of an optimal solution, where $S$ is the group of members. Our algorithm improves over existing solutions in several ways. First, it tolerates the dynamism of both the group members and the network. Next, our algorithm is self-stabilizing, that is, it copes with nodes memory corruption. Last but not least, our algorithm is \emph{superstabilizing}. That is, while converging to a correct configuration (i.e., a Steiner tree) after a modification of the network, it keeps offering the Steiner tree service during the stabilization time to all members that have not been affected by this modification

Rendezvous of Two Robots with Constant Memory

We study the impact that persistent memory has on the classical rendezvous problem of two mobile computational entities, called robots, in the plane. It is well known that, without additional assumptions, rendezvous is impossible if the entities are oblivious (i.e., have no persistent memory) even if the system is semi-synchronous (SSynch). It has been recently shown that rendezvous is possible even if the system is asynchronous (ASynch) if each robot is endowed with O(1) bits of persistent memory, can transmit O(1) bits in each cycle, and can remember (i.e., can persistently store) the last received transmission. This setting is overly powerful. In this paper we weaken that setting in two different ways: (1) by maintaining the O(1) bits of persistent memory but removing the communication capabilities; and (2) by maintaining the O(1) transmission capability and the ability to remember the last received transmission, but removing the ability of an agent to remember its previous activities. We call the former setting finite-state (FState) and the latter finite-communication (FComm). Note that, even though its use is very different, in both settings, the amount of persistent memory of a robot is constant. We investigate the rendezvous problem in these two weaker settings. We model both settings as a system of robots endowed with visible lights: in FState, a robot can only see its own light, while in FComm a robot can only see the other robot's light. We prove, among other things, that finite-state robots can rendezvous in SSynch, and that finite-communication robots are able to rendezvous even in ASynch. All proofs are constructive: in each setting, we present a protocol that allows the two robots to rendezvous in finite time.Comment: 18 pages, 3 figure

Structure and morphology of ACEL ZnS:Cu,Cl phosphor powder etched by hydrochloric acid

© The Electrochemical Society, Inc. 2009. All rights reserved. Except as provided under U.S. copyright law, this work may not be reproduced, resold, distributed, or modified without the express permission of The Electrochemical Society (ECS). The archival version is available at the link below.Despite many researches over the last half century, the mechanism of ac powder electroluminescence remains to be fully elucidated and, to this end, a better understanding of the relatively complex structure of alternate current electroluminescence (ACEL) phosphors is required. Consequently, the structure and morphology of ZnS:Cu,Cl phosphor powders have been investigated herein by means of scanning electron microscopy (SEM) on hydrochloric acid-etched samples and X-ray powder diffraction. The latter technique confirmed that, as a result of two-stage firing during their synthesis, the phosphors were converted from the high temperature hexagonal (wurtzite) structure to the low temperature cubic (sphalerite) polymorph having a high density of planar stacking faults. Optical microscopy revealed that the crystal habit of the phosphor had the appearance of the hexagonal polymorph, which can be explained by the sphalerite pseudomorphing of the earlier wurtzite after undergoing the hexagonal to cubic phase transformation during the synthesis. SEM micrographs of the hydrochloric-etched phosphor particles revealed etch pits, a high density of planar stacking faults along the cubic [111] axis, and the pyramids on the (111) face. These observations were consistent with unidirectional crystal growth originating from the face showing the pyramids.EPSRC, DTI, and the Technology Strategy Board-led Technology Program

Mate-guarding behavior enhances male reproductive success via familiarization with mating partners in medaka fish

[Background] Male-male competition and female mating preference are major mechanisms of sexual selection, which influences individual fitness. How male-male competition affects female preference, however, remains poorly understood. Under laboratory conditions, medaka (Oryzias latipes) males compete to position themselves between a rival male and the female (mate-guarding) in triadic relationships (male, male, and female). In addition, females prefer to mate with visually familiar males. In the present study, to examine whether mate-guarding affects female preference via visual familiarization, we established a novel behavioral test to simultaneously quantify visual familiarization of focal males with females and mate-guarding against rival males. In addition, we investigated the effect of familiarization on male reproductive success in triadic relationships. [Results] Three fish (female, male, male) were placed separately in a transparent three-chamber tank, which allowed the male in the center (near male) to maintain closer proximity to the female than the other male (far male). Placement of the wild-type male in the center blocked visual familiarization of the far male by the female via mate-guarding. In contrast, placement of an arginine-vasotocin receptor mutant male, which exhibits mate-guarding deficits, in the center, allowing for maintaining close proximity to the female, did not block familiarization of the far male by the female. We also demonstrated that the reproductive success of males was significantly decreased by depriving females visual familiarization with the males. [Conclusions] Our findings indicated that, at least in triadic relationships, dominance in mate-guarding, not simply close proximity, allows males to gain familiarity with the female over their rivals, which may enhance female preference for the dominant male. These findings focusing on the triadic relationships of medaka may contribute to our understanding of the adaptive significance of persistent mate-guarding, as well as female preference for familiar mates

Mate-guarding behavior enhances male reproductive success via familiarization with mating partners in medaka fish

Background: Male-male competition and female mating preference are major mechanisms of sexual selection, which influences individual fitness. How male-male competition affects female preference, however, remains poorly understood. Under laboratory conditions, medaka (Oryzias latipes) males compete to position themselves between a rival male and the female (mate-guarding) in triadic relationships (male, male, and female). In addition, females prefer to mate with visually familiar males. In the present study, to examine whether mate-guarding affects female preference via visual familiarization, we established a novel behavioral test to simultaneously quantify visual familiarization of focal males with females and mate-guarding against rival males. In addition, we investigated the effect of familiarization on male reproductive success in triadic relationships. Results: Three fish (female, male, male) were placed separately in a transparent three-chamber tank, which allowed the male in the center (near male) to maintain closer proximity to the female than the other male (far male). Placement of the wild-type male in the center blocked visual familiarization of the far male by the female via mate-guarding. In contrast, placement of an arginine-vasotocin receptor mutant male, which exhibits mate-guarding deficits, in the center, allowing for maintaining close proximity to the female, did not block familiarization of the far male by the female. We also demonstrated that the reproductive success of males was significantly decreased by depriving females visual familiarization with the males. Conclusions: Our findings indicated that, at least in triadic relationships, dominance in mate-guarding, not simply close proximity, allows males to gain familiarity with the female over their rivals, which may enhance female preference for the dominant male. These findings focusing on the triadic relationships of medaka may contribute to our understanding of the adaptive significance of persistent mate-guarding, as well as female preference for familiar mates

Dual mechanism of brain injury and novel treatment strategy in maple syrup urine disease

Maple syrup urine disease (MSUD) is an inherited disorder of branched-chain amino acid metabolism presenting with lifethreatening cerebral oedema and dysmyelination in affected individuals. Treatment requires life-long dietary restriction and monitoring of branched-chain amino acids to avoid brain injury. Despite careful management, children commonly suffer metabolic decompensation in the context of catabolic stress associated with non-specific illness. The mechanisms underlying this decompensation and brain injury are poorly understood. Using recently developed mouse models of classic and intermediate maple syrup urine disease, we assessed biochemical, behavioural and neuropathological changes that occurred during encephalopathy in these mice. Here, we show that rapid brain leucine accumulation displaces other essential amino acids resulting in neurotransmitter depletion and disruption of normal brain growth and development. A novel approach of administering norleucine to heterozygous mothers of classic maple syrup urine disease pups reduced branched-chain amino acid accumulation in milk as well as blood and brain of these pups to enhance survival. Similarly, norleucine substantially delayed encephalopathy in intermediate maple syrup urine disease mice placed on a high protein diet that mimics the catabolic stress shown to cause encephalopathy in human maple syrup urine disease. Current findings suggest two converging mechanisms of brain injury in maple syrup urine disease including: (i) neurotransmitter deficiencies and growth restriction associated with branchedchain amino acid accumulation and (ii) energy deprivation through Krebs cycle disruption associated with branched-chain ketoacid accumulation. Both classic and intermediate models appear to be useful to study the mechanism of brain injury and potential treatment strategies for maple syrup urine disease. Norleucine should be further tested as a potential treatment to prevent encephalopathy in children with maple syrup urine disease during catabolic stress

PPARγ is a Major Driver of the Accumulation and Phenotype of Adipose-Tissue TregT_{reg} Cells

Obesity and type-2 diabetes have increased markedly over the past few decades, in parallel. One of the major links between these two disorders is chronic, low-grade inflammation. Prolonged nutrient excess promotes the accumulation and activation of leukocytes in visceral adipose tissue (VAT) and ultimately other tissues, leading to metabolic abnormalities such as insulin resistance, type-2 diabetes and fatty-liver disease. Although invasion of VAT by pro-inflammatory macrophages is considered to be a key event driving adipose-tissue inflammation and insulin resistance, little is known about the roles of other immune system cell types in these processes. A unique population of VAT-resident regulatory T $(T_{reg})$ cells was recently implicated in control of the inflammatory state of adipose tissue and, thereby, insulin sensitivity. Here we identify peroxisome proliferator-activated receptor (PPAR)-γ, the ‘master regulator’ of adipocyte differentiation, as a crucial molecular orchestrator of VAT $T_{reg}$ cell accumulation, phenotype and function. Unexpectedly, PPAR-γ expression by VAT $T_{reg}$ cells was necessary for complete restoration of insulin sensitivity in obese mice by the thiazolidinedione drug pioglitazone. These findings suggest a previously unknown cellular mechanism for this important class of thiazolidinedione drugs, and provide proof-of-principle that discrete populations of $T_{reg}$ cells with unique functions can be precisely targeted to therapeutic ends