Glial development in the Drosophila CNS requires concomitant activation of glial and repression of neuronal differentiation genes

Two classes of glial cells are found in the embryonic Drosophila CNS, midline glial cells and lateral glial cells. Midline glial development is triggered by EGF-receptor signalling, whereas lateral glial development is controlled by the gcm gene. Subsequent glial cell differentiation depends partly on the pointed gene. Here we describe a novel component required for all CNS glia development. The tramtrack gene encodes two zinc-finger proteins, one of which, ttkp69, is expressed in all non-neuronal CNS cells. We show that ttkp69 is downstream of gcm and can repress neuronal differentiation. Double mutant analysis and coexpression experiments indicate that glial cell differentiation may depend on a dual process, requiring the activation of glial differentiation by pointed and the concomitant repression of neuronal development by tramtrack.     

Detection of fatty acid beta-oxidizing syntrophic bacteria by fluorescence in situ hybridization.

A new 16S rRNA-targeted oligonucleotide probe, specific for the cluster of fatty acid beta-oxidizing syntrophic bacteria of the family Syntrophomonadaceae was designed for fluorescence in situ hybridization. This probe was evaluated with target as well as non-target cultures. Moreover this probe was assessed with butyrate and oleate degrading enrichment cultures and methanogenic sludges from full-scale plants. The results showed that the probe revealed the presence of fatty acid beta-oxidizing syntrophic bacteria in some of the samples analyzed. However, cell quantification was possible only in enrichment cultures and in a flocculent sludge from a reactor that treats lipid-rich wastewaters, but not in methanogenic granular sludges from upflow anaerobic sludge blanket reactors.     

Robust stability and stabilization of uncertain linear positive systems via integral linear constraints: L1‐gain and L∞‐gain characterization

Copositive linear Lyapunov functions are used along with dissipativity theory for stability analysis and control of uncertain linear positive systems. Unlike usual results on linear systems, linear supply rates are employed here for robustness and performance analysis using L₁‐gain and L_∞‐gain. Robust stability analysis is performed using integral linear constraints for which several classes of uncertainties are discussed. The approach is then extended to robust stabilization and performance optimization. The obtained results are expressed in terms of robust linear programming problems that are equivalently turned into finite dimensional ones using Handelman's theorem. Several examples are provided for illustration. Copyright © 2012 John Wiley & Sons, Ltd.     

Model of Frequency Analysis in the Visual Cortex and the Shape from Texture Problem

This paper addresses the question: at the level of cortical cells present in the primary area V1, is the information sufficient to extract the local perspective from the texture? Starting from a model of complex cells in visual area V1, we propose a biologically plausible algorithm for frequency analysis applied to the shape from texture problem. First, specific log-normal filters are designed in replacement of the classical Gabor filters because of their theoretical properties and of their biological plausibility. These filters are separable in frequency and orientation and they better sample the image spectrum which makes them appropriate for any pattern analysis technique. A method to estimate the local frequency in the image, which discards the need to choose the best local scale, is designed. Based on this frequency analysis model, a local decomposition of the image into patches leads to the estimation of the local frequency variation which is used to solve the problem of recovering the shape from the texture. From the analytical relation between the local frequency and the geometrical parameters, under perspective projection, it is possible to recover the orientation and the shape of the original image. The accuracy of the method is evaluated and discussed on different kind of textures, both regular and irregular, with planar and curved surfaces and also on natural scenes and psychophysical stimuli. It compares favorably to the best existing methods, with in addition, a low computational cost. The biological plausibility of the model is finally discussed.     

The k-simultaneous consensus problem

This paper introduces and investigates the k-simultaneous consensus task: each process participates at the same time in k independent consensus instances until it decides in any one of them. It is shown that the k-simultaneous consensus task is equivalent to the k-set agreement task in the wait-free read/write shared memory model, and furthermore k-simultaneous consensus possesses properties that k-set does not. In particular we show that the multivalued version and the binary version of the k-simultaneous consensus task are wait-free equivalent. These equivalences are independent of the number of processes. Interestingly, this provides us with a new characterization of the k-set agreement task that is based on the fundamental binary consensus problem.     

Universal constructions that ensure disjoint-access parallelism and wait-freedom

A universal construction is a general mechanism for obtaining a concurrent implementation of an object from its sequential code. We show that there is no universal construction that is both disjoint-access parallel (guaranteeing the processes operating on different parts of an implemented object do not interfere with one another) and wait-free (guaranteeing progress for each nonfaulty process when accessing an object). In contrast, we present a universal construction which results in disjoint-access parallel, wait-free implementations of any object provided there is a bound on the number of data items accessed by each operation supported by the object.     

Correlated fluorescence lifetime and spectral measurements in living cells

Studies of proteins' interaction in cells by FRET can take benefit from two important photo-physical properties describing fluorescent proteins: fluorescence emission spectrum and fluorescence lifetime. These properties provide specific and complementary information about the tagged proteins and their environment. However, none of them taken individually can completely quantify the involved fluorophore characteristics due to their multiparametric dependency with molecular environment, experimental conditions, and interpretation complexity. A solution to get a better understanding of the biological process implied at the cellular level is to combine the spectral and temporal fluorescence data acquired simultaneously at every cell region under investigation. We present the SLiM-SPRC160, an original temporal/spectral acquisition system for simultaneous lifetime measurements in 16 spectral channels directly attached to the descanned port of a confocal microscope with two-photon excitation. It features improved light throughput, enabling low-level excitation and minimum invasivity in living cells studies. To guarantee a fairly good level of accuracy and reproducibility in the measurements of fluorescence lifetime and spectra on living cells, we propose a rigorous protocol for running experiments with this new equipment that preserves cell viability. The usefulness of SLiM approach for the precise determination of overlapping fluorophores is illustrated with the study of known solutions of rhodamine. Then, we describe reliable FRET experiments in imaging mode realized in living cells using this protocol. We also demonstrate the benefit of localized fluorescence spectrum-lifetime acquisitions for the dynamic study of fluorescent proteins. proteins.     

Glossopharyngeal nerve transection impairs unconditioned avoidance of diverse bitter stimuli in rats.

There is growing evidence of heterogeneity among responses to bitter stimuli at the peripheral, central and behavioral levels. For instance, the glossopharyngeal (GL) nerve and neurons receiving its projections are more responsive to bitter stimuli than the chorda tympani (CT) nerve, and this is particularly true for some bitter stimuli like PROP & cycloheximide that stimulate the GL to a far greater extent. Given this information, we hypothesized that cutting the GL would have a greater effect on behavioral avoidance of cycloheximide and PROP than quinine and denatonium, which also stimulate the CT, albeit to a lesser degree than salts and acids. Forty male SD rats were divided into four surgery groups: bilateral GL transection (GLX), chorda tympani transection (CTX), SHAM surgery, and combined transection (CTX + GLX). Postsurgical avoidance functions were generated for the four bitter stimuli using a brief-access test. GLX significantly compromised avoidance compared to both CTX and SHAM groups for all stimuli (p     

Locality and checkability in wait-free computing

This paper studies notions of locality that are inherent to the specification of distributed tasks by identifying fundamental relationships between the various scales of computation, from the individual process to the whole system. A locality property called projection-closed is identified. This property completely characterizes tasks that are wait-free checkable, where a task $T =(\mathcal{I },\mathcal{O },\varDelta )$ T = ( I , O , Δ ) is said to be checkable if there exists a distributed algorithm that, given $s\in \mathcal{I }$ s ∈ I and $t\in \mathcal{O }$ t ∈ O , determines whether $t\in \varDelta {(s)}$ t ∈ Δ ( s ) , i.e., whether $t$ t is a valid output for $s$ s according to the specification of $T$ T . Projection-closed tasks are proved to form a rich class of tasks. In particular, determining whether a projection-closed task is wait-free solvable is shown to be undecidable. A stronger notion of locality is identified by considering tasks whose outputs “look identical” to the inputs at every process: a task $T= (\mathcal{I },\mathcal{O },\varDelta )$ T = ( I , O , Δ ) is said to be locality-preserving if $\mathcal{O }$ O is a covering complex of $\mathcal{I }$ I . We show that this topological property yields obstacles for wait-free solvability different in nature from the classical impossibility results. On the other hand, locality-preserving tasks are projection-closed, and thus they are wait-free checkable. A classification of locality-preserving tasks in term of their relative computational power is provided. This is achieved by defining a correspondence between subgroups of the edgepath group of an input complex and locality-preserving tasks. This correspondence enables to demonstrate the existence of hierarchies of locality-preserving tasks, each one containing, at the top, the universal task (induced by the universal covering complex), and, at the bottom, the trivial identity task.     

On the necessity of looped-functionals arising in the analysis of pseudo-periodic,sampled-data and hybrid systems

Looped-functionals have been shown to be relevant for the analysis of a wide variety of systems. However, the conditions obtained in previous papers on the analysis of sampled-data, impulsive and switched systems have only been shown to be sufficient for the characterisation of their associated discrete-time stability conditions. We prove here that these conditions are also necessary. This result is derived for a wider class of linear systems, referred to as impulsive pseudo-periodic systems, that encompass periodic, impulsive, sampled-data and switched systems as special cases.