162 research outputs found

    The Glial Regenerative Response to Central Nervous System Injury Is Enabled by Pros-Notch and Pros-NFκB Feedback

    Get PDF
    Organisms are structurally robust, as cells accommodate changes preserving structural integrity and function. The molecular mechanisms underlying structural robustness and plasticity are poorly understood, but can be investigated by probing how cells respond to injury. Injury to the CNS induces proliferation of enwrapping glia, leading to axonal re-enwrapment and partial functional recovery. This glial regenerative response is found across species, and may reflect a common underlying genetic mechanism. Here, we show that injury to the Drosophila larval CNS induces glial proliferation, and we uncover a gene network controlling this response. It consists of the mutual maintenance between the cell cycle inhibitor Prospero (Pros) and the cell cycle activators Notch and NFκB. Together they maintain glia in the brink of dividing, they enable glial proliferation following injury, and subsequently they exert negative feedback on cell division restoring cell cycle arrest. Pros also promotes glial differentiation, resolving vacuolization, enabling debris clearance and axonal enwrapment. Disruption of this gene network prevents repair and induces tumourigenesis. Using wound area measurements across genotypes and time-lapse recordings we show that when glial proliferation and glial differentiation are abolished, both the size of the glial wound and neuropile vacuolization increase. When glial proliferation and differentiation are enabled, glial wound size decreases and injury-induced apoptosis and vacuolization are prevented. The uncovered gene network promotes regeneration of the glial lesion and neuropile repair. In the unharmed animal, it is most likely a homeostatic mechanism for structural robustness. This gene network may be of relevance to mammalian glia to promote repair upon CNS injury or disease

    Approximating Markov Processes by Averaging

    Get PDF
    We recast the theory of labelled Markov processes in a new setting, in a way "dual" to the usual point of view. Instead of considering state transitions as a collection of subprobability distributions on the state space, we view them as transformers of real-valued functions. By generalizing the operation of conditional expectation, we build a category consisting of labelled Markov processes viewed as a collection of operators; the arrows of this category behave as projections on a smaller state space. We define a notion of equivalence for such processes, called bisimulation, which is closely linked to the usual definition for probabilistic processes. We show that we can categorically construct the smallest bisimilar process, and that this smallest object is linked to a well-known modal logic. We also expose an approximation scheme based on this logic, where the state space of the approximants is finite; furthermore, we show that these finite approximants categorically converge to the smallest bisimilar process.Nous reconsidérons les processus de Markov étiquetés sous une nouvelle approche, dans un certain sens "dual'' au point de vue usuel. Au lieu de considérer les transitions d'état en état en tant qu'une collection de distributions de sous-probabilités sur l'espace d'états, nous les regardons en tant que transformations de fonctions réelles. En généralisant l'opération d'espérance conditionelle, nous construisons une catégorie où les objets sont des processus de Markov étiquetés regardés en tant qu'un rassemblement d'opérateurs; les flèches de cette catégorie se comportent comme des projections sur un espace d'états plus petit. Nous définissons une notion d'équivalence pour de tels processus, que l'on appelle bisimulation, qui est intimement liée avec la définition usuelle pour les processus probabilistes. Nous démontrons que nous pouvons construire, d'une manière catégorique, le plus petit processus bisimilaire à un processus donné, et que ce plus petit object est lié à une logique modale bien connue. Nous développons une méthode d'approximation basée sur cette logique, où l'espace d'états des processus approximatifs est fini; de plus, nous démontrons que ces processus approximatifs convergent, d'une manière catégorique, au plus petit processus bisimilaire

    Phase field modeling of nonlinear material behavior

    Full text link
    Materials that undergo internal transformations are usually described in solid mechanics by multi-well energy functions that account for both elastic and transformational behavior. In order to separate the two effects, physicists use instead phase-field-type theories where conventional linear elastic strain is quadratically coupled to an additional field that describes the evolution of the reference state and solely accounts for nonlinearity. In this paper we propose a systematic method allowing one to split the non-convex energy into harmonic and nonharmonic parts and to convert a nonconvex mechanical problem into a partially linearized phase-field problem. The main ideas are illustrated using the simplest framework of the Peierls-Nabarro dislocation model.Comment: 12 pages, 4 figures. v1: as submitted. v2: as published (conclusion added, unessential part of appendix removed, minor typesetting revisions). To appear in: K. Hackl (ed.), Proceedings of the IUTAM Symposium on Variational Concepts with Applications to the Mechanics of Materials, September 22-26, 2008, Bochum. (Springer-Verlag, 2010 presumably

    Global Chromatin Domain Organization of the Drosophila Genome

    Get PDF
    In eukaryotes, neighboring genes can be packaged together in specific chromatin structures that ensure their coordinated expression. Examples of such multi-gene chromatin domains are well-documented, but a global view of the chromatin organization of eukaryotic genomes is lacking. To systematically identify multi-gene chromatin domains, we constructed a compendium of genome-scale binding maps for a broad panel of chromatin-associated proteins in Drosophila melanogaster. Next, we computationally analyzed this compendium for evidence of multi-gene chromatin domains using a novel statistical segmentation algorithm. We find that at least 50% of all fly genes are organized into chromatin domains, which often consist of dozens of genes. The domains are characterized by various known and novel combinations of chromatin proteins. The genes in many of the domains are coregulated during development and tend to have similar biological functions. Furthermore, during evolution fewer chromosomal rearrangements occur inside chromatin domains than outside domains. Our results indicate that a substantial portion of the Drosophila genome is packaged into functionally coherent, multi-gene chromatin domains. This has broad mechanistic implications for gene regulation and genome evolution

    Learning to Learn: Theta Oscillations Predict New Learning, which Enhances Related Learning and Neurogenesis

    Get PDF
    Animals in the natural world continuously encounter learning experiences of varying degrees of novelty. New neurons in the hippocampus are especially responsive to learning associations between novel events and more cells survive if a novel and challenging task is learned. One might wonder whether new neurons would be rescued from death upon each new learning experience or whether there is an internal control system that limits the number of cells that are retained as a function of learning. In this experiment, it was hypothesized that learning a task that was similar in content to one already learned previously would not increase cell survival. We further hypothesized that in situations in which the cells are rescued hippocampal theta oscillations (3–12 Hz) would be involved and perhaps necessary for increasing cell survival. Both hypotheses were disproved. Adult male Sprague-Dawley rats were trained on two similar hippocampus-dependent tasks, trace and very-long delay eyeblink conditioning, while recording hippocampal local-field potentials. Cells that were generated after training on the first task were labeled with bromodeoxyuridine and quantified after training on both tasks had ceased. Spontaneous theta activity predicted performance on the first task and the conditioned stimulus induced a theta-band response early in learning the first task. As expected, performance on the first task correlated with performance on the second task. However, theta activity did not increase during training on the second task, even though more cells were present in animals that had learned. Therefore, as long as learning occurs, relatively small changes in the environment are sufficient to increase the number of surviving neurons in the adult hippocampus and they can do so in the absence of an increase in theta activity. In conclusion, these data argue against an upper limit on the number of neurons that can be rescued from death by learning

    An MBO scheme for minimizing the graph Ohta-Kawasaki functional

    Get PDF
    We study a graph based version of the Ohta-Kawasaki functional, which was originally introduced in a continuum setting to model pattern formation in diblock copolymer melts and has been studied extensively as a paradigmatic example of a variational model for pattern formation. Graph based problems inspired by partial differential equations (PDEs) and varational methods have been the subject of many recent papers in the mathematical literature, because of their applications in areas such as image processing and data classification. This paper extends the area of PDE inspired graph based problems to pattern forming models, while continuing in the tradition of recent papers in the field. We introduce a mass conserving Merriman-Bence-Osher (MBO) scheme for minimizing the graph Ohta-Kawasaki functional with a mass constraint. We present three main results: (1) the Lyapunov functionals associated with this MBO scheme Γ-converge to the Ohta-Kawasaki functional (which includes the standard graph based MBO scheme and total variation as a special case); (2) there is a class of graphs on which the Ohta-Kawasaki MBO scheme corresponds to a standard MBO scheme on a transformed graph and for which generalized comparison principles hold; (3) this MBO scheme allows for the numerical computation of (approximate) minimizers of the graph Ohta-Kawasaki functional with a mass constraint

    FOXC2 controls formation and maturation of lymphatic collecting vessels through cooperation with NFATc1

    Get PDF
    The mechanisms of blood vessel maturation into distinct parts of the blood vasculature such as arteries, veins, and capillaries have been the subject of intense investigation over recent years. In contrast, our knowledge of lymphatic vessel maturation is still fragmentary. In this study, we provide a molecular and morphological characterization of the major steps in the maturation of the primary lymphatic capillary plexus into collecting lymphatic vessels during development and show that forkhead transcription factor Foxc2 controls this process. We further identify transcription factor NFATc1 as a novel regulator of lymphatic development and describe a previously unsuspected link between NFATc1 and Foxc2 in the regulation of lymphatic maturation. We also provide a genome-wide map of FOXC2-binding sites in lymphatic endothelial cells, identify a novel consensus FOXC2 sequence, and show that NFATc1 physically interacts with FOXC2-binding enhancers. As damage to collecting vessels is a major cause of lymphatic dysfunction in humans, our results suggest that FOXC2 and NFATc1 are potential targets for therapeutic intervention

    Human Centric Facial Expression Recognition

    Get PDF
    Facial expression recognition (FER) is an area of active research, both in computer science and in behavioural science. Across these domains there is evidence to suggest that humans and machines find it easier to recognise certain emotions, for example happiness, in comparison to others. Recent behavioural studies have explored human perceptions of emotion further, by evaluating the relative contribution of features in the face when evaluating human sensitivity to emotion. It has been identified that certain facial regions have more salient features for certain expressions of emotion, especially when emotions are subtle in nature. For example, it is easier to detect fearful expressions when the eyes are expressive. Using this observation as a starting point for analysis, we similarly examine the effectiveness with which knowledge of facial feature saliency may be integrated into current approaches to automated FER. Specifically, we compare and evaluate the accuracy of ‘full-face’ versus upper and lower facial area convolutional neural network (CNN) modelling for emotion recognition in static images, and propose a human centric CNN hierarchy which uses regional image inputs to leverage current understanding of how humans recognise emotions across the face. Evaluations using the CK+ dataset demonstrate that our hierarchy can enhance classification accuracy in comparison to individual CNN architectures, achieving overall true positive classification in 93.3% of cases
    corecore