Astrocyte dense-core vesicle gliosecretion is governed by rest/nrsf

Astrocytes are the brain non-nerve cells competent for the expression of clear and dense-core vesicles (DCVs) and for their regulated exocytosis. This process, called gliosecretion, nearly resembles the neurosecretion occurring in neurons and neurosecretory cells. REST/NRSF is a transcription repressor known to orchestrate nerve-cell differentiation, governing the expression of hundreds of neuron-specific genes through their repression in the non-nerve and their fine modulation in the nerve cells. Our previous studies in neurosecretory rat PC12 cells identified REST as the critical factor for the expression not only of individual genes, but also of the whole neurosecretory process via multiple, direct and indirect mechanisms (D'Alessandro et al., J. Neurochem., 2008; Klajn et al., J. Neurosci., 2009). Therefore we wondered whether gliosecretion was governed by REST. We investigated rat astrocyte primary cultures: they exhibited high REST, which directly represses the transcription of at least one target gene, and expressed neither DCVs nor their markers (granins, peptides, membrane proteins). Transfection of a dominant-negative construct of REST (REST/ DBD-GFP) induced the appearance of DCVs filled with secretogranin2 and NPY that are distinct from other intracellular organelles. TIRF analysis of astrocytes co-transfected with REST/DBD-GFP and NPY-mRFP constructs revealed NPY-mRFP-positive DCVs undergoing Ca2þ-dependent exocytosis, largely prevented by BoNT/B. Immunohistochemistry of the I-II layers of the human temporal brain cortex showed all neurons and microglia exhibiting the expected inappreciable and high levels of REST, respectively. In contrast astrocyte RESTwas variable, going from inappreciable to high, accompanied by variable expression of DCVs. In this work it has been demonstrated that astrocyte DCV expression and gliosecretion are governed by REST (Prada et al., 2011 in press). The variable in situ REST levels may contribute to the well known structural/functional heterogeneity of astrocytes and this new observation might be of great interest for the understanding of both astrocyte physiology and pathology.

Omnidirectional Depth Computation from a Single Image

Omnidirectional cameras offer a much wider field of view than the perspective ones and alleviate the problems due to occlusions. However, both types of cameras suffer from the lack of depth perception. A practical method for obtaining depth in computer vision is to project a known structured light pattern on the scene avoiding the problems and costs involved by stereo vision. This paper is focused on the idea of combining omnidirectional vision and structured light with the aim to provide 3D information about the scene. The resulting sensor is formed by a single catadioptric camera and an omnidirectional light projector. It is also discussed how this sensor can be used in robot navigation applications

On optimal computation of MPLS label binding for multipoint-to-point connections

Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging - better known as MultiPoint-to-Point (MP2P) connections. Because of its origins in IP, MP2P connections have been considered to have tree- shapes with Label Switched Paths (LSP) as branches. Due to this fact, previous works by many authors affirm that the problem of minimizing the label space using MP2P in MPLS - the Merging Problem - cannot be solved optimally with a polynomial algorithm (NP-complete), since it involves a hard- decision problem. However, in this letter, the Merging Problem is analyzed, from the perspective of MPLS, and it is deduced that tree-shapes in MP2P connections are irrelevant. By overriding this tree-shape consideration, it is possible to perform label merging in polynomial time. Based on how MPLS signaling works, this letter proposes an algorithm to compute the minimum number of labels using label merging: the Full Label Merging algorithm. As conclusion, we reclassify the Merging Problem as Polynomial-solvable, instead of NP-complete. In addition, simulation experiments confirm that without the tree-branch selection problem, more labels can be reduced

High throughput 3D super-resolution microscopy reveals Caulobacter crescentus in vivo Z-ring organization.

We created a high-throughput modality of photoactivated localization microscopy (PALM) that enables automated 3D PALM imaging of hundreds of synchronized bacteria during all stages of the cell cycle. We used high-throughput PALM to investigate the nanoscale organization of the bacterial cell division protein FtsZ in live Caulobacter crescentus. We observed that FtsZ predominantly localizes as a patchy midcell band, and only rarely as a continuous ring, supporting a model of "Z-ring" organization whereby FtsZ protofilaments are randomly distributed within the band and interact only weakly. We found evidence for a previously unidentified period of rapid ring contraction in the final stages of the cell cycle. We also found that DNA damage resulted in production of high-density continuous Z-rings, which may obstruct cytokinesis. Our results provide a detailed quantitative picture of in vivo Z-ring organization.

Magistri Petri Rogerii, Prioris sancti Baudilii, qui fuit postea Clemens Papa VI.lectura super Decretalem Joannis Papae XXII. Quia quorumdam mentes.

Baluzianus

1.° Joannis de Sacrobosco tractatus de sphaera, cum Joannis Anglici commentario. — 2.° Summa Lamberti de logica. — 3.° Communia super totam logicam, grammaticam, et super mathematicas scientias : authore anonymo.

Colbertinus

Transmission delays in residual computation

The design of control, estimation or diagnosis algorithms most often assumes that all available process variables represent the system state at the same instant of time. However, this is never true in current network systems, because of the unknown deterministic or stochastic transmission delays introduced by the communication network. During the diagnosing stage, this will often generate false alarms. Under nominal operation, the different transmission delays associated with the variables that appear in the computation form produce discrepancies of the residuals from zero. A technique aiming at the minimisation of the resulting false alarms rate, that is based on the explicit modelling of communication delays and on their best-case estimation is proposed