---
_id: '3139'
abstract:
- lang: eng
text: Significant advances have been made during the past few years in our understanding
of how the spinal monosynaptic reflex develops. Transcription factors in the Neurogenin,
Runt, ETS, and LIM families control sequential steps of the specification of various
subtypes of dorsal root ganglia sensory neurons. The initiation of muscle spindle
differentiation requires neuregulin 1, derived from Ia afferent sensory neurons,
and signaling through ErbB receptors in intrafusal muscle fibers. Several retrograde
signals from the periphery are important for the establishment of late connectivity
in the reflex circuit. Finally, neurotrophin 3 released from muscle spindles regulates
the strength of sensory-motor connections within the spinal cord postnatally.
author:
- first_name: Hsiao
full_name: Chen, Hsiao Huei
last_name: Chen
- first_name: Simon
full_name: Simon Hippenmeyer
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Silvia
full_name: Arber, Silvia
last_name: Arber
- first_name: Eric
full_name: Frank, Eric
last_name: Frank
citation:
ama: Chen H, Hippenmeyer S, Arber S, Frank E. Development of the monosynaptic stretch
reflex circuit. Current Opinion in Neurobiology. 2003;13(1):96-102. doi:10.1016/S0959-4388(03)00006-0
apa: Chen, H., Hippenmeyer, S., Arber, S., & Frank, E. (2003). Development of
the monosynaptic stretch reflex circuit. Current Opinion in Neurobiology.
Elsevier. https://doi.org/10.1016/S0959-4388(03)00006-0
chicago: Chen, Hsiao, Simon Hippenmeyer, Silvia Arber, and Eric Frank. “Development
of the Monosynaptic Stretch Reflex Circuit.” Current Opinion in Neurobiology.
Elsevier, 2003. https://doi.org/10.1016/S0959-4388(03)00006-0.
ieee: H. Chen, S. Hippenmeyer, S. Arber, and E. Frank, “Development of the monosynaptic
stretch reflex circuit,” Current Opinion in Neurobiology, vol. 13, no.
1. Elsevier, pp. 96–102, 2003.
ista: Chen H, Hippenmeyer S, Arber S, Frank E. 2003. Development of the monosynaptic
stretch reflex circuit. Current Opinion in Neurobiology. 13(1), 96–102.
mla: Chen, Hsiao, et al. “Development of the Monosynaptic Stretch Reflex Circuit.”
Current Opinion in Neurobiology, vol. 13, no. 1, Elsevier, 2003, pp. 96–102,
doi:10.1016/S0959-4388(03)00006-0.
short: H. Chen, S. Hippenmeyer, S. Arber, E. Frank, Current Opinion in Neurobiology
13 (2003) 96–102.
date_created: 2018-12-11T12:01:37Z
date_published: 2003-02-01T00:00:00Z
date_updated: 2019-04-26T07:22:24Z
day: '01'
doi: 10.1016/S0959-4388(03)00006-0
extern: 1
intvolume: ' 13'
issue: '1'
month: '02'
page: 96 - 102
publication: Current Opinion in Neurobiology
publication_status: published
publisher: Elsevier
publist_id: '3557'
quality_controlled: 0
status: public
title: Development of the monosynaptic stretch reflex circuit
type: review
volume: 13
year: '2003'
...
---
_id: '3171'
abstract:
- lang: eng
text: 'Reconstructing a 3-D scene from more than one camera is a classical problem
in computer vision. One of the major sources of difficulty is the fact that not
all scene elements are visible from all cameras. In the last few years, two promising
approaches have been developed 11,12 that formulate the scene reconstruction problem
in terms of energy minimization, and minimize the energy using graph cuts. These
energy minimization approaches treat the input images symmetrically, handle visibility
constraints correctly, and allow spatial smoothness to be enforced. However, these
algorithm propose different problem formulations, and handle a limited class of
smoothness terms. One algorithm 11 uses a problem formulation that is restricted
to two-camera stereo, and imposes smoothness between a pair of cameras. The other
algorithm 12 can handle an arbitrary number of cameras, but imposes smoothness
only with respect to a single camera. In this paper we give a more general energy
minimization formulation for the problem, which allows a larger class of spatial
smoothness constraints. We show that our formulation includes both of the previous
approaches as special cases, as well as permitting new energy functions. Experimental
results on real data with ground truth are also included. '
alternative_title:
- LNCS
author:
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Ramin
full_name: Zabih, Ramin
last_name: Zabih
- first_name: Steven
full_name: Gortler, Steven
last_name: Gortler
citation:
ama: 'Kolmogorov V, Zabih R, Gortler S. Generalized multi camera scene reconstruction
using graph cuts. In: Vol 2683. Springer; 2003:501-516. doi:10.1007/978-3-540-45063-4_32'
apa: 'Kolmogorov, V., Zabih, R., & Gortler, S. (2003). Generalized multi camera
scene reconstruction using graph cuts (Vol. 2683, pp. 501–516). Presented at the
EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition,
Springer. https://doi.org/10.1007/978-3-540-45063-4_32'
chicago: Kolmogorov, Vladimir, Ramin Zabih, and Steven Gortler. “Generalized Multi
Camera Scene Reconstruction Using Graph Cuts,” 2683:501–16. Springer, 2003. https://doi.org/10.1007/978-3-540-45063-4_32.
ieee: 'V. Kolmogorov, R. Zabih, and S. Gortler, “Generalized multi camera scene
reconstruction using graph cuts,” presented at the EMMCVPR: Energy Minimization
Methods in Computer Vision and Pattern Recognition, 2003, vol. 2683, pp. 501–516.'
ista: 'Kolmogorov V, Zabih R, Gortler S. 2003. Generalized multi camera scene reconstruction
using graph cuts. EMMCVPR: Energy Minimization Methods in Computer Vision and
Pattern Recognition, LNCS, vol. 2683, 501–516.'
mla: Kolmogorov, Vladimir, et al. Generalized Multi Camera Scene Reconstruction
Using Graph Cuts. Vol. 2683, Springer, 2003, pp. 501–16, doi:10.1007/978-3-540-45063-4_32.
short: V. Kolmogorov, R. Zabih, S. Gortler, in:, Springer, 2003, pp. 501–516.
conference:
name: 'EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition'
date_created: 2018-12-11T12:01:48Z
date_published: 2003-06-26T00:00:00Z
date_updated: 2021-01-12T07:41:34Z
day: '26'
doi: 10.1007/978-3-540-45063-4_32
extern: 1
intvolume: ' 2683'
month: '06'
page: 501 - 516
publication_status: published
publisher: Springer
publist_id: '3512'
quality_controlled: 0
status: public
title: Generalized multi camera scene reconstruction using graph cuts
type: conference
volume: 2683
year: '2003'
...
---
_id: '3174'
abstract:
- lang: eng
text: We address visual correspondence problems without assuming that scene points
have similar intensities in different views. This situation is common, usually
due to non-lambertian scenes or to differences between cameras. We use maximization
of mutual information, a powerful technique for registering images that requires
no a priori model of the relationship between scene intensities in different views.
However, it has proven difficult to use mutual information to compute dense visual
correspondence. Comparing fixed-size windows via mutual information suffers from
the well-known problems of fixed windows, namely poor performance at discontinuities
and in low-texture regions. In this paper, we show how to compute visual correspondence
using mutual information without suffering from these problems. Using 'a simple
approximation, mutual information can be incorporated into the standard energy
minimization framework used in early vision. The energy can then be efficiently
minimized using graph cuts, which preserve discontinuities and handle low-texture
regions. The resulting algorithm combines the accurate disparity maps that come
from graph cuts with the tolerance for intensity changes that comes from mutual
information.
author:
- first_name: Junhwan
full_name: Kim, Junhwan
last_name: Kim
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Ramin
full_name: Zabih, Ramin
last_name: Zabih
citation:
ama: 'Kim J, Kolmogorov V, Zabih R. Visual correspondence using energy minimization
and mutual information. In: Vol 2. IEEE; 2003:1033-1040. doi:10.1109/ICCV.2003.1238463'
apa: 'Kim, J., Kolmogorov, V., & Zabih, R. (2003). Visual correspondence using
energy minimization and mutual information (Vol. 2, pp. 1033–1040). Presented
at the ICCV: International Conference on Computer Vision, IEEE. https://doi.org/10.1109/ICCV.2003.1238463'
chicago: Kim, Junhwan, Vladimir Kolmogorov, and Ramin Zabih. “Visual Correspondence
Using Energy Minimization and Mutual Information,” 2:1033–40. IEEE, 2003. https://doi.org/10.1109/ICCV.2003.1238463.
ieee: 'J. Kim, V. Kolmogorov, and R. Zabih, “Visual correspondence using energy
minimization and mutual information,” presented at the ICCV: International Conference
on Computer Vision, 2003, vol. 2, pp. 1033–1040.'
ista: 'Kim J, Kolmogorov V, Zabih R. 2003. Visual correspondence using energy minimization
and mutual information. ICCV: International Conference on Computer Vision vol.
2, 1033–1040.'
mla: Kim, Junhwan, et al. Visual Correspondence Using Energy Minimization and
Mutual Information. Vol. 2, IEEE, 2003, pp. 1033–40, doi:10.1109/ICCV.2003.1238463.
short: J. Kim, V. Kolmogorov, R. Zabih, in:, IEEE, 2003, pp. 1033–1040.
conference:
name: 'ICCV: International Conference on Computer Vision'
date_created: 2018-12-11T12:01:49Z
date_published: 2003-09-30T00:00:00Z
date_updated: 2021-01-12T07:41:35Z
day: '30'
doi: 10.1109/ICCV.2003.1238463
extern: 1
intvolume: ' 2'
month: '09'
page: 1033 - 1040
publication_status: published
publisher: IEEE
publist_id: '3510'
quality_controlled: 0
status: public
title: Visual correspondence using energy minimization and mutual information
type: conference
volume: 2
year: '2003'
...
---
_id: '3170'
abstract:
- lang: eng
text: Geodesic active contours and graph cuts are two standard image segmentation
techniques. We introduce a new segmentation method combining some of their benefits.
Our main intuition is that any cut on a graph embedded in some continuous space
can be interpreted as a contour (in 2D) or a surface (in 3D). We show how to build
a grid graph and set its edge weights so that the cost of cuts is arbitrarily
close to the length (area) of the corresponding contours (surfaces) for any anisotropic
Riemannian metric. There are two interesting consequences of this technical result.
First, graph cut algorithms can be used to find globally minimum geodesic contours
(minimal surfaces in 3D) under arbitrary Riemannian metric for a given set of
boundary conditions. Second, we show how to minimize metrication artifacts in
existing graph-cut based methods in vision. Theoretically speaking, our work provides
an interesting link between several branches of mathematics -differential geometry,
integral geometry, and combinatorial optimization. The main technical problem
is solved using Cauchy-Crofton formula from integral geometry.
author:
- first_name: Yuri
full_name: Boykov, Yuri
last_name: Boykov
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Boykov Y, Kolmogorov V. Computing geodesics and minimal surfaces via graph
cuts. In: Vol 1. IEEE; 2003:26-33. doi:10.1109/ICCV.2003.1238310'
apa: 'Boykov, Y., & Kolmogorov, V. (2003). Computing geodesics and minimal surfaces
via graph cuts (Vol. 1, pp. 26–33). Presented at the ICCV: International Conference
on Computer Vision, IEEE. https://doi.org/10.1109/ICCV.2003.1238310'
chicago: Boykov, Yuri, and Vladimir Kolmogorov. “Computing Geodesics and Minimal
Surfaces via Graph Cuts,” 1:26–33. IEEE, 2003. https://doi.org/10.1109/ICCV.2003.1238310.
ieee: 'Y. Boykov and V. Kolmogorov, “Computing geodesics and minimal surfaces via
graph cuts,” presented at the ICCV: International Conference on Computer Vision,
2003, vol. 1, pp. 26–33.'
ista: 'Boykov Y, Kolmogorov V. 2003. Computing geodesics and minimal surfaces via
graph cuts. ICCV: International Conference on Computer Vision vol. 1, 26–33.'
mla: Boykov, Yuri, and Vladimir Kolmogorov. Computing Geodesics and Minimal Surfaces
via Graph Cuts. Vol. 1, IEEE, 2003, pp. 26–33, doi:10.1109/ICCV.2003.1238310.
short: Y. Boykov, V. Kolmogorov, in:, IEEE, 2003, pp. 26–33.
conference:
name: 'ICCV: International Conference on Computer Vision'
date_created: 2018-12-11T12:01:48Z
date_published: 2003-09-30T00:00:00Z
date_updated: 2021-01-12T07:41:33Z
day: '30'
doi: 10.1109/ICCV.2003.1238310
extern: 1
intvolume: ' 1'
month: '09'
page: 26 - 33
publication_status: published
publisher: IEEE
publist_id: '3511'
quality_controlled: 0
status: public
title: Computing geodesics and minimal surfaces via graph cuts
type: conference
volume: 1
year: '2003'
...
---
_id: '3526'
abstract:
- lang: eng
text: Neurons can produce action potentials with high temporal precision(1). A fundamental
issue is whether, and how, this capability is used in information processing.
According to the `cell assembly' hypothesis, transient synchrony of anatomically
distributed groups of neurons underlies processing of both external sensory input
and internal cognitive mechanisms(2-4). Accordingly, neuron populations should
be arranged into groups whose synchrony exceeds that predicted by common modulation
by sensory input. Here we find that the spike times of hippocampal pyramidal cells
can be predicted more accurately by using the spike times of simultaneously recorded
neurons in addition to the animals location in space. This improvement remained
when the spatial prediction was refined with a spatially dependent theta phase
modulation(5-8). The time window in which spike times are best predicted from
simultaneous peer activity is 10-30 ms, suggesting that cell assemblies are synchronized
at this timescale. Because this temporal window matches the membrane time constant
of pyramidal neurons(9), the period of the hippocampal gamma oscillation(10) and
the time window for synaptic plasticity(11), we propose that cooperative activity
at this timescale is optimal for information transmission and storage in cortical
circuits.
author:
- first_name: Kenneth
full_name: Harris, Kenneth D
last_name: Harris
- first_name: Jozsef L
full_name: Jozsef Csicsvari
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
- first_name: Hajima
full_name: Hirase, Hajima
last_name: Hirase
- first_name: George
full_name: Dragoi, George
last_name: Dragoi
- first_name: György
full_name: Buzsáki, György
last_name: Buzsáki
citation:
ama: Harris K, Csicsvari JL, Hirase H, Dragoi G, Buzsáki G. Organization of cell
assemblies in the hippocampus. Nature. 2003;424(6948):552-556. doi:0.1038/nature01834
apa: Harris, K., Csicsvari, J. L., Hirase, H., Dragoi, G., & Buzsáki, G. (2003).
Organization of cell assemblies in the hippocampus. Nature. Nature Publishing
Group. https://doi.org/0.1038/nature01834
chicago: Harris, Kenneth, Jozsef L Csicsvari, Hajima Hirase, George Dragoi, and
György Buzsáki. “Organization of Cell Assemblies in the Hippocampus.” Nature.
Nature Publishing Group, 2003. https://doi.org/0.1038/nature01834.
ieee: K. Harris, J. L. Csicsvari, H. Hirase, G. Dragoi, and G. Buzsáki, “Organization
of cell assemblies in the hippocampus,” Nature, vol. 424, no. 6948. Nature
Publishing Group, pp. 552–556, 2003.
ista: Harris K, Csicsvari JL, Hirase H, Dragoi G, Buzsáki G. 2003. Organization
of cell assemblies in the hippocampus. Nature. 424(6948), 552–556.
mla: Harris, Kenneth, et al. “Organization of Cell Assemblies in the Hippocampus.”
Nature, vol. 424, no. 6948, Nature Publishing Group, 2003, pp. 552–56,
doi:0.1038/nature01834.
short: K. Harris, J.L. Csicsvari, H. Hirase, G. Dragoi, G. Buzsáki, Nature 424 (2003)
552–556.
date_created: 2018-12-11T12:03:47Z
date_published: 2003-07-31T00:00:00Z
date_updated: 2021-01-12T07:44:04Z
day: '31'
doi: 0.1038/nature01834
extern: 1
intvolume: ' 424'
issue: '6948'
month: '07'
page: 552 - 556
publication: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '2859'
quality_controlled: 0
status: public
title: Organization of cell assemblies in the hippocampus
type: journal_article
volume: 424
year: '2003'
...
---
_id: '3529'
abstract:
- lang: eng
text: Parallel recording of neuronal activity in the behaving animal is a prerequisite
for our understanding of neuronal representation and storage of information. Here
we describe the development of micro-machined silicon microelectrode arrays for
unit and local field recordings. The two-dimensional probes with 96 or 64 recording
sites provided high-density recording of unit and field activity with minimal
tissue displacement or damage. The on-chip active circuit eliminated movement
and other artifacts and greatly reduced the weight of the headgear. The precise
geometry of the recording tips allowed for the estimation of the spatial location
of the recorded neurons and for high-resolution estimation of extracellular current
source density. Action potentials could be simultaneously recorded from the soma
and dendrites of the same neurons. Silicon technology is a promising approach
for high-density, high-resolution sampling of neuronal activity in both basic
research and prosthetic devices.
author:
- first_name: Jozsef L
full_name: Jozsef Csicsvari
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
- first_name: Darrell
full_name: Henze, Darrell A
last_name: Henze
- first_name: Brian
full_name: Jamieson, Brian G
last_name: Jamieson
- first_name: Kenneth
full_name: Harris, Kenneth D
last_name: Harris
- first_name: Anton
full_name: Sirota, Anton M
last_name: Sirota
- first_name: Peter
full_name: Bartho, Peter
last_name: Bartho
- first_name: Kensall
full_name: Wise, Kensall D
last_name: Wise
- first_name: György
full_name: Buzsáki, György
last_name: Buzsáki
citation:
ama: Csicsvari JL, Henze D, Jamieson B, et al. Massively parallel recording of unit
and local field potentials with silicon-based electrodes. Journal of Neurophysiology.
2003;90(2):1314-1323. doi:10.1152/jn.00116.2003
apa: Csicsvari, J. L., Henze, D., Jamieson, B., Harris, K., Sirota, A., Bartho,
P., … Buzsáki, G. (2003). Massively parallel recording of unit and local field
potentials with silicon-based electrodes. Journal of Neurophysiology. American
Physiological Society. https://doi.org/10.1152/jn.00116.2003
chicago: Csicsvari, Jozsef L, Darrell Henze, Brian Jamieson, Kenneth Harris, Anton
Sirota, Peter Bartho, Kensall Wise, and György Buzsáki. “Massively Parallel Recording
of Unit and Local Field Potentials with Silicon-Based Electrodes.” Journal
of Neurophysiology. American Physiological Society, 2003. https://doi.org/10.1152/jn.00116.2003.
ieee: J. L. Csicsvari et al., “Massively parallel recording of unit and local
field potentials with silicon-based electrodes,” Journal of Neurophysiology,
vol. 90, no. 2. American Physiological Society, pp. 1314–1323, 2003.
ista: Csicsvari JL, Henze D, Jamieson B, Harris K, Sirota A, Bartho P, Wise K, Buzsáki
G. 2003. Massively parallel recording of unit and local field potentials with
silicon-based electrodes. Journal of Neurophysiology. 90(2), 1314–1323.
mla: Csicsvari, Jozsef L., et al. “Massively Parallel Recording of Unit and Local
Field Potentials with Silicon-Based Electrodes.” Journal of Neurophysiology,
vol. 90, no. 2, American Physiological Society, 2003, pp. 1314–23, doi:10.1152/jn.00116.2003.
short: J.L. Csicsvari, D. Henze, B. Jamieson, K. Harris, A. Sirota, P. Bartho, K.
Wise, G. Buzsáki, Journal of Neurophysiology 90 (2003) 1314–1323.
date_created: 2018-12-11T12:03:48Z
date_published: 2003-08-01T00:00:00Z
date_updated: 2021-01-12T07:44:05Z
day: '01'
doi: 10.1152/jn.00116.2003
extern: 1
intvolume: ' 90'
issue: '2'
month: '08'
page: 1314 - 1323
publication: Journal of Neurophysiology
publication_status: published
publisher: American Physiological Society
publist_id: '2856'
quality_controlled: 0
status: public
title: Massively parallel recording of unit and local field potentials with silicon-based
electrodes
type: journal_article
volume: 90
year: '2003'
...
---
_id: '3528'
abstract:
- lang: eng
text: Gamma frequency oscillations (30-100 Hz) have been suggested to underlie various
cognitive and motor functions. Here, we examine the generation of gamma oscillation
currents in the hippocampus, using two-dimensional, 96-site silicon probes. Two
gamma generators were identified, one in the dentate gyrus and another in the
CA3-CA1 regions. The coupling strength between the two oscillators varied during
both theta and nontheta states. Both pyramidal cells and interneurons were phase-locked
to gamma waves. Anatomical connectivity, rather than physical distance, determined
the coupling strength of the oscillating neurons. CA3 pyramidal neurons discharged
CA3 and CA1 interneurons at latencies indicative of monosynaptic connections.
Intrahippocampal gamma oscillation emerges in the CA3 recurrent system, which
entrains the CA1 region via its interneurons.
author:
- first_name: Jozsef L
full_name: Jozsef Csicsvari
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
- first_name: Brian
full_name: Jamieson, Brian G
last_name: Jamieson
- first_name: Kensall
full_name: Wise, Kensall D
last_name: Wise
- first_name: György
full_name: Buzsáki, György
last_name: Buzsáki
citation:
ama: Csicsvari JL, Jamieson B, Wise K, Buzsáki G. Mechanisms of gamma oscillations
in the hippocampus of the behaving rat. Neuron. 2003;37(2):311-322. doi:10.1016/S0896-6273(02)01169-8
apa: Csicsvari, J. L., Jamieson, B., Wise, K., & Buzsáki, G. (2003). Mechanisms
of gamma oscillations in the hippocampus of the behaving rat. Neuron. Elsevier.
https://doi.org/10.1016/S0896-6273(02)01169-8
chicago: Csicsvari, Jozsef L, Brian Jamieson, Kensall Wise, and György Buzsáki.
“Mechanisms of Gamma Oscillations in the Hippocampus of the Behaving Rat.” Neuron.
Elsevier, 2003. https://doi.org/10.1016/S0896-6273(02)01169-8.
ieee: J. L. Csicsvari, B. Jamieson, K. Wise, and G. Buzsáki, “Mechanisms of gamma
oscillations in the hippocampus of the behaving rat,” Neuron, vol. 37,
no. 2. Elsevier, pp. 311–322, 2003.
ista: Csicsvari JL, Jamieson B, Wise K, Buzsáki G. 2003. Mechanisms of gamma oscillations
in the hippocampus of the behaving rat. Neuron. 37(2), 311–322.
mla: Csicsvari, Jozsef L., et al. “Mechanisms of Gamma Oscillations in the Hippocampus
of the Behaving Rat.” Neuron, vol. 37, no. 2, Elsevier, 2003, pp. 311–22,
doi:10.1016/S0896-6273(02)01169-8.
short: J.L. Csicsvari, B. Jamieson, K. Wise, G. Buzsáki, Neuron 37 (2003) 311–322.
date_created: 2018-12-11T12:03:48Z
date_published: 2003-01-01T00:00:00Z
date_updated: 2021-01-12T07:44:05Z
day: '01'
doi: 10.1016/S0896-6273(02)01169-8
extern: 1
intvolume: ' 37'
issue: '2'
month: '01'
page: 311 - 322
publication: Neuron
publication_status: published
publisher: Elsevier
publist_id: '2857'
quality_controlled: 0
status: public
title: Mechanisms of gamma oscillations in the hippocampus of the behaving rat
type: journal_article
volume: 37
year: '2003'
...
---
_id: '3543'
abstract:
- lang: eng
text: 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.
author:
- first_name: Anton
full_name: Sirota, Anton M
last_name: Sirota
- first_name: Jozsef L
full_name: Jozsef Csicsvari
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
- first_name: Derek
full_name: Buhl, Derek L
last_name: Buhl
- first_name: György
full_name: Buzsáki, György
last_name: Buzsáki
citation:
ama: Sirota A, Csicsvari JL, Buhl D, Buzsáki G. Communication between neocortex
and hippocampus during sleep in rodents. PNAS. 2003;100(4):2065-2069. doi:10.1073/pnas.0437938100
apa: Sirota, A., Csicsvari, J. L., Buhl, D., & Buzsáki, G. (2003). Communication
between neocortex and hippocampus during sleep in rodents. PNAS. National
Academy of Sciences. https://doi.org/10.1073/pnas.0437938100
chicago: Sirota, Anton, Jozsef L Csicsvari, Derek Buhl, and György Buzsáki. “Communication
between Neocortex and Hippocampus during Sleep in Rodents.” PNAS. National
Academy of Sciences, 2003. https://doi.org/10.1073/pnas.0437938100.
ieee: A. Sirota, J. L. Csicsvari, D. Buhl, and G. Buzsáki, “Communication between
neocortex and hippocampus during sleep in rodents,” PNAS, vol. 100, no.
4. National Academy of Sciences, pp. 2065–2069, 2003.
ista: Sirota A, Csicsvari JL, Buhl D, Buzsáki G. 2003. Communication between neocortex
and hippocampus during sleep in rodents. PNAS. 100(4), 2065–2069.
mla: Sirota, Anton, et al. “Communication between Neocortex and Hippocampus during
Sleep in Rodents.” PNAS, vol. 100, no. 4, National Academy of Sciences,
2003, pp. 2065–69, doi:10.1073/pnas.0437938100.
short: A. Sirota, J.L. Csicsvari, D. Buhl, G. Buzsáki, PNAS 100 (2003) 2065–2069.
date_created: 2018-12-11T12:03:53Z
date_published: 2003-02-18T00:00:00Z
date_updated: 2021-01-12T07:44:12Z
day: '18'
doi: 10.1073/pnas.0437938100
extern: 1
intvolume: ' 100'
issue: '4'
month: '02'
page: 2065 - 2069
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '2841'
quality_controlled: 0
status: public
title: Communication between neocortex and hippocampus during sleep in rodents
type: journal_article
volume: 100
year: '2003'
...
---
_id: '3593'
abstract:
- lang: eng
text: 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.
author:
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Pallab
full_name: Dasgupta, Pallab
last_name: Dasgupta
- first_name: Partha
full_name: Chakrabarti, Partha P
last_name: Chakrabarti
citation:
ama: Chatterjee K, Dasgupta P, Chakrabarti P. A branching time temporal framework
for quantitative reasoning. Journal of Automated Reasoning. 2003;30(2):205-232.
doi:10.1023/A:1023217515688
apa: Chatterjee, K., Dasgupta, P., & Chakrabarti, P. (2003). A branching time
temporal framework for quantitative reasoning. Journal of Automated Reasoning.
Springer. https://doi.org/10.1023/A:1023217515688
chicago: Chatterjee, Krishnendu, Pallab Dasgupta, and Partha Chakrabarti. “A Branching
Time Temporal Framework for Quantitative Reasoning.” Journal of Automated Reasoning.
Springer, 2003. https://doi.org/10.1023/A:1023217515688.
ieee: K. Chatterjee, P. Dasgupta, and P. Chakrabarti, “A branching time temporal
framework for quantitative reasoning,” Journal of Automated Reasoning,
vol. 30, no. 2. Springer, pp. 205–232, 2003.
ista: Chatterjee K, Dasgupta P, Chakrabarti P. 2003. A branching time temporal framework
for quantitative reasoning. Journal of Automated Reasoning. 30(2), 205–232.
mla: Chatterjee, Krishnendu, et al. “A Branching Time Temporal Framework for Quantitative
Reasoning.” Journal of Automated Reasoning, vol. 30, no. 2, Springer, 2003,
pp. 205–32, doi:10.1023/A:1023217515688.
short: K. Chatterjee, P. Dasgupta, P. Chakrabarti, Journal of Automated Reasoning
30 (2003) 205–232.
date_created: 2018-12-11T12:04:08Z
date_published: 2003-02-01T00:00:00Z
date_updated: 2021-01-12T07:44:31Z
day: '01'
doi: 10.1023/A:1023217515688
extern: 1
intvolume: ' 30'
issue: '2'
month: '02'
page: 205 - 232
publication: Journal of Automated Reasoning
publication_status: published
publisher: Springer
publist_id: '2790'
quality_controlled: 0
status: public
title: A branching time temporal framework for quantitative reasoning
type: journal_article
volume: 30
year: '2003'
...
---
_id: '3678'
author:
- first_name: Christoph
full_name: Christoph Lampert
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: Lampert C. The Neumann operator in strictly pseudoconvex domains with weighted
Bergman metric . Bonner Mathematische Schriften. 2003;356:1-165.
apa: Lampert, C. (2003). The Neumann operator in strictly pseudoconvex domains
with weighted Bergman metric . Bonner Mathematische Schriften. Universität
Bonn, Fachbibliothek Mathematik.
chicago: Lampert, Christoph. “The Neumann Operator in Strictly Pseudoconvex Domains
with Weighted Bergman Metric .” Bonner Mathematische Schriften. Universität
Bonn, Fachbibliothek Mathematik, 2003.
ieee: C. Lampert, “The Neumann operator in strictly pseudoconvex domains with weighted
Bergman metric ,” Universität Bonn, Fachbibliothek Mathematik, 2003.
ista: Lampert C. 2003. The Neumann operator in strictly pseudoconvex domains with
weighted Bergman metric . Universität Bonn, Fachbibliothek Mathematik.
mla: Lampert, Christoph. “The Neumann Operator in Strictly Pseudoconvex Domains
with Weighted Bergman Metric .” Bonner Mathematische Schriften, vol. 356,
Universität Bonn, Fachbibliothek Mathematik, 2003, pp. 1–165.
short: C. Lampert, The Neumann Operator in Strictly Pseudoconvex Domains with Weighted
Bergman Metric , Universität Bonn, Fachbibliothek Mathematik, 2003.
date_created: 2018-12-11T12:04:34Z
date_published: 2003-03-31T00:00:00Z
date_updated: 2021-01-12T07:45:05Z
day: '31'
extern: 1
intvolume: ' 356'
main_file_link:
- open_access: '0'
url: http://pub.ist.ac.at/~chl/papers/lampert-phd2003.pdf
month: '03'
page: 1 - 165
publication: Bonner Mathematische Schriften
publication_status: published
publisher: Universität Bonn, Fachbibliothek Mathematik
publist_id: '2704'
quality_controlled: 0
status: public
title: 'The Neumann operator in strictly pseudoconvex domains with weighted Bergman
metric '
type: dissertation
volume: 356
year: '2003'
...