TY - JOUR
AB - Both neocortical and hippocampal networks organize the firing patterns of their neurons by prominent oscillations during sleep, but the functional role of these rhythms is not well understood. Here, we show a robust correlation of neuronal discharges between the somatosensory cortex and hippocampus on both slow and fine time scales in the mouse and rat. Neuronal bursts in deep cortical layers, associated with sleep spindles and delta waves/slow rhythm, effectively triggered hippocampal discharges related to fast (ripple) oscillations. We hypothesize that oscillation-mediated temporal links coordinate specific information transfer between neocortical and hippocampal cell assemblies. Such a neocortical-hippocampal interplay may be important for memory consolidation.
AU - Sirota, Anton M
AU - Jozsef Csicsvari
AU - Buhl, Derek L
AU - Buzsáki, György
ID - 3543
IS - 4
JF - PNAS
TI - Communication between neocortex and hippocampus during sleep in rodents
VL - 100
ER -
TY - CONF
AB - We define the Morse-Smale complex of a Morse function over a 3-manifold as the overlay of the descending and as- cending manifolds of all critical points. In the generic case, its 3-dimensional cells are shaped like crystals and are sepa- rated by quadrangular faces. In this paper, we give a combi- natorial algorithm for constructing such complexes for piece- wise linear data.
AU - Herbert Edelsbrunner
AU - Harer, John
AU - Natarajan, Vijay
AU - Pascucci, Valerio
ID - 3556
TI - Morse-Smale complexes for piecewise linear 3-manifolds
ER -
TY - CHAP
AB - Given a finite point set in R, the surface reconstruction problem asks for a surface that passes through many but not necessarily all points. We describe an unambigu- ous definition of such a surface in geometric and topological terms, and sketch a fast algorithm for constructing it. Our solution overcomes past limitations to special point distributions and heuristic design decisions.
AU - Herbert Edelsbrunner
ID - 3573
T2 - Discrete & Computational Geometry
TI - Surface reconstruction by wrapping finite sets in space
ER -
TY - JOUR
AB - We develop fast algorithms for computing the linking number of a simplicial complex within a filtration.We give experimental results in applying our work toward the detection of non-trivial tangling in biomolecules, modeled as alpha complexes.
AU - Edelsbrunner, Herbert
AU - Zomorodian, Afra
ID - 3584
IS - 2
JF - Homology, Homotopy and Applications
TI - Computing linking numbers of a filtration
VL - 5
ER -
TY - JOUR
AB - Temporal logics such as Computation Tree Logic (CTL) and Linear Temporal Logic (LTL) have become popular for specifying temporal properties over a wide variety of planning and verification problems. In this paper we work towards building a generalized framework for automated reasoning based on temporal logics. We present a powerful extension of CTL with first-order quantification over the set of reachable states for reasoning about extremal properties of weighted labeled transition systems in general. The proposed logic, which we call Weighted Quantified Computation Tree Logic (WQCTL), captures the essential elements common to the domain of planning and verification problems and can thereby be used as an effective specification language in both domains. We show that in spite of the rich, expressive power of the logic, we are able to evaluate WQCTL formulas in time polynomial in the size of the state space times the length of the formula. Wepresent experimental results on the WQCTL verifier.
AU - Krishnendu Chatterjee
AU - Dasgupta, Pallab
AU - Chakrabarti, Partha P
ID - 3593
IS - 2
JF - Journal of Automated Reasoning
TI - A branching time temporal framework for quantitative reasoning
VL - 30
ER -