---
_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: '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: '3536'
abstract:
- lang: eng
text: 'Genetic engineering of the mouse brain allows investigators to address novel
hypotheses in vivo. Because of the paucity of information on the network patterns
of the mouse hippocampus, we investigated the electrical patterns in the behaving
animal using multisite silicon probes and wire tetrodes. Theta (6-9 Hz) and gamma
(40-100 Hz) oscillations were present during exploration and rapid eye movement
sleep. Gamma power and theta power were comodulated and gamma power varied as
a function of the theta cycle. Pyramidal cells and putative interneurons were
phase-locked to theta oscillations. During immobility, consummatory behaviors
and slow-wave sleep, sharp waves were present in cornu ammonis region CA1 of the
hippocampus stratum radiatum associated with 140-200-Hz “ripples” in the pyramidal
cell layer and population burst of CA1 neurons. In the hilus, large-amplitude
“dentate spikes” occurred in association with increased discharge of hilar neurons.
The amplitude of field patterns was larger in the mouse than in the rat, likely
reflecting the higher neuron density in a smaller brain. We suggest that the main
hippocampal network patterns are mediated by similar pathways and mechanisms in
mouse and rat. '
author:
- first_name: György
full_name: Buzsáki, György
last_name: Buzsáki
- first_name: Derek
full_name: Buhl, Derek L
last_name: Buhl
- 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: Boldizsár
full_name: Czéh, Boldizsár
last_name: Czéh
- first_name: Alexei
full_name: Morozov, Alexei
last_name: Morozov
citation:
ama: Buzsáki G, Buhl D, Harris K, Csicsvari JL, Czéh B, Morozov A. Hippocampal network
patterns of activity in the mouse. Neuroscience. 2003;116(1):201-211. doi:10.1016/S0306-4522(02)00669-3
apa: Buzsáki, G., Buhl, D., Harris, K., Csicsvari, J. L., Czéh, B., & Morozov,
A. (2003). Hippocampal network patterns of activity in the mouse. Neuroscience.
Elsevier. https://doi.org/10.1016/S0306-4522(02)00669-3
chicago: Buzsáki, György, Derek Buhl, Kenneth Harris, Jozsef L Csicsvari, Boldizsár
Czéh, and Alexei Morozov. “Hippocampal Network Patterns of Activity in the Mouse.”
Neuroscience. Elsevier, 2003. https://doi.org/10.1016/S0306-4522(02)00669-3.
ieee: G. Buzsáki, D. Buhl, K. Harris, J. L. Csicsvari, B. Czéh, and A. Morozov,
“Hippocampal network patterns of activity in the mouse,” Neuroscience,
vol. 116, no. 1. Elsevier, pp. 201–211, 2003.
ista: Buzsáki G, Buhl D, Harris K, Csicsvari JL, Czéh B, Morozov A. 2003. Hippocampal
network patterns of activity in the mouse. Neuroscience. 116(1), 201–211.
mla: Buzsáki, György, et al. “Hippocampal Network Patterns of Activity in the Mouse.”
Neuroscience, vol. 116, no. 1, Elsevier, 2003, pp. 201–11, doi:10.1016/S0306-4522(02)00669-3.
short: G. Buzsáki, D. Buhl, K. Harris, J.L. Csicsvari, B. Czéh, A. Morozov, Neuroscience
116 (2003) 201–211.
date_created: 2018-12-11T12:03:50Z
date_published: 2003-01-15T00:00:00Z
date_updated: 2021-01-12T07:44:09Z
day: '15'
doi: 10.1016/S0306-4522(02)00669-3
extern: 1
intvolume: ' 116'
issue: '1'
month: '01'
page: 201 - 211
publication: Neuroscience
publication_status: published
publisher: Elsevier
publist_id: '2849'
quality_controlled: 0
status: public
title: Hippocampal network patterns of activity in the mouse
type: journal_article
volume: 116
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: '3556'
abstract:
- lang: eng
text: 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.
author:
- first_name: Herbert
full_name: Herbert Edelsbrunner
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: John
full_name: Harer, John
last_name: Harer
- first_name: Vijay
full_name: Natarajan, Vijay
last_name: Natarajan
- first_name: Valerio
full_name: Pascucci, Valerio
last_name: Pascucci
citation:
ama: 'Edelsbrunner H, Harer J, Natarajan V, Pascucci V. Morse-Smale complexes for
piecewise linear 3-manifolds. In: ACM; 2003:361-370. doi:10.1145/777792.777846'
apa: 'Edelsbrunner, H., Harer, J., Natarajan, V., & Pascucci, V. (2003). Morse-Smale
complexes for piecewise linear 3-manifolds (pp. 361–370). Presented at the SCG:
Symposium on Computational Geometry, ACM. https://doi.org/10.1145/777792.777846'
chicago: Edelsbrunner, Herbert, John Harer, Vijay Natarajan, and Valerio Pascucci.
“Morse-Smale Complexes for Piecewise Linear 3-Manifolds,” 361–70. ACM, 2003. https://doi.org/10.1145/777792.777846.
ieee: 'H. Edelsbrunner, J. Harer, V. Natarajan, and V. Pascucci, “Morse-Smale complexes
for piecewise linear 3-manifolds,” presented at the SCG: Symposium on Computational
Geometry, 2003, pp. 361–370.'
ista: 'Edelsbrunner H, Harer J, Natarajan V, Pascucci V. 2003. Morse-Smale complexes
for piecewise linear 3-manifolds. SCG: Symposium on Computational Geometry, 361–370.'
mla: Edelsbrunner, Herbert, et al. Morse-Smale Complexes for Piecewise Linear
3-Manifolds. ACM, 2003, pp. 361–70, doi:10.1145/777792.777846.
short: H. Edelsbrunner, J. Harer, V. Natarajan, V. Pascucci, in:, ACM, 2003, pp.
361–370.
conference:
name: 'SCG: Symposium on Computational Geometry'
date_created: 2018-12-11T12:03:57Z
date_published: 2003-06-01T00:00:00Z
date_updated: 2021-01-12T07:44:17Z
day: '01'
doi: 10.1145/777792.777846
extern: 1
main_file_link:
- open_access: '0'
url: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.9592
month: '06'
page: 361 - 370
publication_status: published
publisher: ACM
publist_id: '2829'
quality_controlled: 0
status: public
title: Morse-Smale complexes for piecewise linear 3-manifolds
type: conference
year: '2003'
...
---
_id: '3573'
abstract:
- lang: eng
text: 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.
author:
- first_name: Herbert
full_name: Herbert Edelsbrunner
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: 'Edelsbrunner H. Surface reconstruction by wrapping finite sets in space. In:
Discrete & Computational Geometry. Springer; 2003:379-404. doi:10.1007/978-3-642-55566-4_17'
apa: Edelsbrunner, H. (2003). Surface reconstruction by wrapping finite sets in
space. In Discrete & Computational Geometry (pp. 379–404). Springer.
https://doi.org/10.1007/978-3-642-55566-4_17
chicago: Edelsbrunner, Herbert. “Surface Reconstruction by Wrapping Finite Sets
in Space.” In Discrete & Computational Geometry, 379–404. Springer,
2003. https://doi.org/10.1007/978-3-642-55566-4_17.
ieee: H. Edelsbrunner, “Surface reconstruction by wrapping finite sets in space,”
in Discrete & Computational Geometry, Springer, 2003, pp. 379–404.
ista: 'Edelsbrunner H. 2003.Surface reconstruction by wrapping finite sets in space.
In: Discrete & Computational Geometry. , 379–404.'
mla: Edelsbrunner, Herbert. “Surface Reconstruction by Wrapping Finite Sets in Space.”
Discrete & Computational Geometry, Springer, 2003, pp. 379–404, doi:10.1007/978-3-642-55566-4_17.
short: H. Edelsbrunner, in:, Discrete & Computational Geometry, Springer, 2003,
pp. 379–404.
date_created: 2018-12-11T12:04:02Z
date_published: 2003-06-23T00:00:00Z
date_updated: 2021-01-12T07:44:24Z
day: '23'
doi: 10.1007/978-3-642-55566-4_17
extern: 1
main_file_link:
- open_access: '0'
url: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.3633
month: '06'
page: 379 - 404
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '2812'
quality_controlled: 0
status: public
title: Surface reconstruction by wrapping finite sets in space
type: book_chapter
year: '2003'
...
---
_id: '3584'
abstract:
- lang: eng
text: 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.
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Afra
full_name: Zomorodian, Afra
last_name: Zomorodian
citation:
ama: Edelsbrunner H, Zomorodian A. Computing linking numbers of a filtration. Homology,
Homotopy and Applications. 2003;5(2):19-37.
apa: Edelsbrunner, H., & Zomorodian, A. (2003). Computing linking numbers of
a filtration. Homology, Homotopy and Applications. International Press.
chicago: Edelsbrunner, Herbert, and Afra Zomorodian. “Computing Linking Numbers
of a Filtration.” Homology, Homotopy and Applications. International Press,
2003.
ieee: H. Edelsbrunner and A. Zomorodian, “Computing linking numbers of a filtration,”
Homology, Homotopy and Applications, vol. 5, no. 2. International Press,
pp. 19–37, 2003.
ista: Edelsbrunner H, Zomorodian A. 2003. Computing linking numbers of a filtration.
Homology, Homotopy and Applications. 5(2), 19–37.
mla: Edelsbrunner, Herbert, and Afra Zomorodian. “Computing Linking Numbers of a
Filtration.” Homology, Homotopy and Applications, vol. 5, no. 2, International
Press, 2003, pp. 19–37.
short: H. Edelsbrunner, A. Zomorodian, Homology, Homotopy and Applications 5 (2003)
19–37.
date_created: 2018-12-11T12:04:05Z
date_published: 2003-04-22T00:00:00Z
date_updated: 2021-01-12T07:44:28Z
day: '22'
extern: '1'
intvolume: ' 5'
issue: '2'
language:
- iso: eng
main_file_link:
- url: http://projecteuclid.org/euclid.hha/1088453320
month: '04'
oa_version: None
page: 19 - 37
publication: Homology, Homotopy and Applications
publication_status: published
publisher: International Press
publist_id: '2801'
quality_controlled: '1'
status: public
title: Computing linking numbers of a filtration
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
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: '3618'
abstract:
- lang: eng
text: There are several analyses in evolutionary ecology which assume that a family
of offspring has come from only two parents. Here, we present a simple test for
detecting when a batch involves two or more subfamilies. It is based on the fact
that the mixing of families generates associations amongst unlinked marker loci.
We also present simulations illustrating the power of our method for varying numbers
of loci, alleles per locus and genotyped individuals.
author:
- first_name: Timothy
full_name: Vines, Timothy H
last_name: Vines
- first_name: Nicholas H
full_name: Nicholas Barton
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Vines T, Barton NH. A new approach to detecting mixed families. Molecular
Ecology. 2003;12(7):1999-2002. doi:10.1046/j.1365-294X.2003.01867.x
apa: Vines, T., & Barton, N. H. (2003). A new approach to detecting mixed families.
Molecular Ecology. Wiley-Blackwell. https://doi.org/10.1046/j.1365-294X.2003.01867.x
chicago: Vines, Timothy, and Nicholas H Barton. “A New Approach to Detecting Mixed
Families.” Molecular Ecology. Wiley-Blackwell, 2003. https://doi.org/10.1046/j.1365-294X.2003.01867.x.
ieee: T. Vines and N. H. Barton, “A new approach to detecting mixed families,” Molecular
Ecology, vol. 12, no. 7. Wiley-Blackwell, pp. 1999–2002, 2003.
ista: Vines T, Barton NH. 2003. A new approach to detecting mixed families. Molecular
Ecology. 12(7), 1999–2002.
mla: Vines, Timothy, and Nicholas H. Barton. “A New Approach to Detecting Mixed
Families.” Molecular Ecology, vol. 12, no. 7, Wiley-Blackwell, 2003, pp.
1999–2002, doi:10.1046/j.1365-294X.2003.01867.x.
short: T. Vines, N.H. Barton, Molecular Ecology 12 (2003) 1999–2002.
date_created: 2018-12-11T12:04:16Z
date_published: 2003-07-01T00:00:00Z
date_updated: 2021-01-12T07:44:42Z
day: '01'
doi: 10.1046/j.1365-294X.2003.01867.x
extern: 1
intvolume: ' 12'
issue: '7'
month: '07'
page: 1999 - 2002
publication: Molecular Ecology
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2765'
quality_controlled: 0
status: public
title: A new approach to detecting mixed families
type: journal_article
volume: 12
year: '2003'
...
---
_id: '3619'
abstract:
- lang: eng
text: What is the chance that some part of a stretch of genome will survive? In
a population of constant size, and with no selection, the probability of survival
of some part of a stretch of map length y<1 approaches View the MathML source
for View the MathML source. Thus, the whole genome is certain to be lost, but
the rate of loss is extremely slow. This solution extends to give the whole distribution
of surviving block sizes as a function of time. We show that the expected number
of blocks at time t is 1+yt and give expressions for the moments of the number
of blocks and the total amount of genome that survives for a given time. The solution
is based on a branching process and assumes complete interference between crossovers,
so that each descendant carries only a single block of ancestral material. We
consider cases where most individuals carry multiple blocks, either because there
are multiple crossovers in a long genetic map, or because enough time has passed
that most individuals in the population are related to each other. For species
such as ours, which have a long genetic map, the genome of any individual which
leaves descendants (∼80% of the population for a Poisson offspring number with
mean two) is likely to persist for an extremely long time, in the form of a few
short blocks of genome.
author:
- first_name: Stuart
full_name: Baird, Stuart J
last_name: Baird
- first_name: Nicholas H
full_name: Nicholas Barton
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Alison
full_name: Etheridge, Alison M
last_name: Etheridge
citation:
ama: Baird S, Barton NH, Etheridge A. The distribution of surviving blocks of an
ancestral genome. Theoretical Population Biology. 2003;64(4):451-471. doi:10.1016/S0040-5809(03)00098-4
apa: Baird, S., Barton, N. H., & Etheridge, A. (2003). The distribution of surviving
blocks of an ancestral genome. Theoretical Population Biology. Academic
Press. https://doi.org/10.1016/S0040-5809(03)00098-4
chicago: Baird, Stuart, Nicholas H Barton, and Alison Etheridge. “The Distribution
of Surviving Blocks of an Ancestral Genome.” Theoretical Population Biology.
Academic Press, 2003. https://doi.org/10.1016/S0040-5809(03)00098-4.
ieee: S. Baird, N. H. Barton, and A. Etheridge, “The distribution of surviving blocks
of an ancestral genome,” Theoretical Population Biology, vol. 64, no. 4.
Academic Press, pp. 451–471, 2003.
ista: Baird S, Barton NH, Etheridge A. 2003. The distribution of surviving blocks
of an ancestral genome. Theoretical Population Biology. 64(4), 451–471.
mla: Baird, Stuart, et al. “The Distribution of Surviving Blocks of an Ancestral
Genome.” Theoretical Population Biology, vol. 64, no. 4, Academic Press,
2003, pp. 451–71, doi:10.1016/S0040-5809(03)00098-4.
short: S. Baird, N.H. Barton, A. Etheridge, Theoretical Population Biology 64 (2003)
451–471.
date_created: 2018-12-11T12:04:17Z
date_published: 2003-12-01T00:00:00Z
date_updated: 2021-01-12T07:44:42Z
day: '01'
doi: 10.1016/S0040-5809(03)00098-4
extern: 1
intvolume: ' 64'
issue: '4'
month: '12'
page: 451 - 471
publication: Theoretical Population Biology
publication_status: published
publisher: Academic Press
publist_id: '2764'
quality_controlled: 0
status: public
title: The distribution of surviving blocks of an ancestral genome
type: journal_article
volume: 64
year: '2003'
...
---
_id: '3620'
abstract:
- lang: eng
text: 'Stable hybrid zones in which ecologically divergent taxa give rise to a range
of recombinants are natural laboratories in which the genetic basis of adaptation
and reproductive isolation can be unraveled. One such hybrid zone is formed by
the fire-bellied toads Bombina bombina and B. variegata (Anura: Discoglossidae).
Adaptations to permanent and ephemeral breeding habitats, respectively, have shaped
numerous phenotypic differences between the taxa. All of these are, in principle,
candidates for a genetic dissection via QTL mapping. We present here a linkage
map of 28 codominant and 10 dominant markers in the Bombina genome. In an F2 cross,
markers that were mainly microsatellites, SSCPs or allozymes were mapped to 20
linkage groups. Among the 40 isolated CA microsatellites, we noted a preponderance
of compound and frequently interleaved CA-TA repeats as well as a striking polarity
at the 5′ end of the repeats.'
author:
- first_name: Beate
full_name: Nürnberger, Beate
last_name: Nürnberger
- first_name: Sebastian
full_name: Hofman, Sebastian
last_name: Hofman
- first_name: Bqruni
full_name: Förg-Brey, Bqruni
last_name: Förg Brey
- first_name: Gabriele
full_name: Praetzel, Gabriele
last_name: Praetzel
- first_name: Alan
full_name: Maclean, Alan W
last_name: Maclean
- first_name: Jacek
full_name: Szymura, Jacek M
last_name: Szymura
- first_name: Catherine
full_name: Abbott, Catherine M
last_name: Abbott
- first_name: Nicholas H
full_name: Nicholas Barton
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: 'Nürnberger B, Hofman S, Förg Brey B, et al. A linkage map for the hybridising
toads Bombina bombina and B. variegata (Anura: Discoglossidae). Heredity.
2003;91(2):136-142. doi:10.1038/sj.hdy.6800291'
apa: 'Nürnberger, B., Hofman, S., Förg Brey, B., Praetzel, G., Maclean, A., Szymura,
J., … Barton, N. H. (2003). A linkage map for the hybridising toads Bombina bombina
and B. variegata (Anura: Discoglossidae). Heredity. Nature Publishing Group.
https://doi.org/10.1038/sj.hdy.6800291'
chicago: 'Nürnberger, Beate, Sebastian Hofman, Bqruni Förg Brey, Gabriele Praetzel,
Alan Maclean, Jacek Szymura, Catherine Abbott, and Nicholas H Barton. “A Linkage
Map for the Hybridising Toads Bombina Bombina and B. Variegata (Anura: Discoglossidae).”
Heredity. Nature Publishing Group, 2003. https://doi.org/10.1038/sj.hdy.6800291.'
ieee: 'B. Nürnberger et al., “A linkage map for the hybridising toads Bombina
bombina and B. variegata (Anura: Discoglossidae),” Heredity, vol. 91, no.
2. Nature Publishing Group, pp. 136–142, 2003.'
ista: 'Nürnberger B, Hofman S, Förg Brey B, Praetzel G, Maclean A, Szymura J, Abbott
C, Barton NH. 2003. A linkage map for the hybridising toads Bombina bombina and
B. variegata (Anura: Discoglossidae). Heredity. 91(2), 136–142.'
mla: 'Nürnberger, Beate, et al. “A Linkage Map for the Hybridising Toads Bombina
Bombina and B. Variegata (Anura: Discoglossidae).” Heredity, vol. 91, no.
2, Nature Publishing Group, 2003, pp. 136–42, doi:10.1038/sj.hdy.6800291.'
short: B. Nürnberger, S. Hofman, B. Förg Brey, G. Praetzel, A. Maclean, J. Szymura,
C. Abbott, N.H. Barton, Heredity 91 (2003) 136–142.
date_created: 2018-12-11T12:04:17Z
date_published: 2003-08-01T00:00:00Z
date_updated: 2021-01-12T07:44:43Z
day: '01'
doi: 10.1038/sj.hdy.6800291
extern: 1
intvolume: ' 91'
issue: '2'
month: '08'
page: 136 - 142
publication: Heredity
publication_status: published
publisher: Nature Publishing Group
publist_id: '2763'
quality_controlled: 0
status: public
title: 'A linkage map for the hybridising toads Bombina bombina and B. variegata (Anura:
Discoglossidae)'
type: journal_article
volume: 91
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'
...
---
_id: '3725'
abstract:
- lang: eng
text: The combination of high-resolution atomic force microscopy (AFM) imaging and
single-molecule force-spectroscopy was employed to unfold single bacteriorhodopsins
(BR) from native purple membrane patches at various physiologically relevant temperatures.
The unfolding spectra reveal detailed insight into the stability of individual
structural elements of BR against mechanical unfolding. Intermittent states in
the unfolding process are associated with the stepwise unfolding of alpha-helices,
whereas other states are associated with the unfolding of polypeptide loops connecting
the alpha-helices. It was found that the unfolding forces of the secondary structures
considerably decreased upon increasing the temperature from 8 to 52°C. Associated
with this effect, the probability of individual unfolding pathways of BR was significantly
influenced by the temperature. At lower temperatures, transmembrane alpha-helices
and extracellular polypeptide loops exhibited sufficient stability to individually
establish potential barriers against unfolding, whereas they predominantly unfolded
collectively at elevated temperatures. This suggests that increasing the temperature
decreases the mechanical stability of secondary structural elements and changes
molecular interactions between secondary structures, thereby forcing them to act
as grouped structures.
author:
- first_name: Harald L
full_name: Harald Janovjak
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Max
full_name: Kessler, Max
last_name: Kessler
- first_name: Dieter
full_name: Oesterhelt, Dieter
last_name: Oesterhelt
- first_name: Hermann
full_name: Gaub, Hermann
last_name: Gaub
- first_name: Daniel
full_name: Mueller, Daniel J
last_name: Mueller
citation:
ama: Janovjak HL, Kessler M, Oesterhelt D, Gaub H, Mueller D. Unfolding pathways
of native bacteriorhodopsin depend on temperature. EMBO Journal. 2003;22(19):5220-5229.
doi:10.1093/emboj/cdg509
apa: Janovjak, H. L., Kessler, M., Oesterhelt, D., Gaub, H., & Mueller, D. (2003).
Unfolding pathways of native bacteriorhodopsin depend on temperature. EMBO
Journal. Wiley-Blackwell. https://doi.org/10.1093/emboj/cdg509
chicago: Janovjak, Harald L, Max Kessler, Dieter Oesterhelt, Hermann Gaub, and Daniel
Mueller. “Unfolding Pathways of Native Bacteriorhodopsin Depend on Temperature.”
EMBO Journal. Wiley-Blackwell, 2003. https://doi.org/10.1093/emboj/cdg509.
ieee: H. L. Janovjak, M. Kessler, D. Oesterhelt, H. Gaub, and D. Mueller, “Unfolding
pathways of native bacteriorhodopsin depend on temperature,” EMBO Journal,
vol. 22, no. 19. Wiley-Blackwell, pp. 5220–5229, 2003.
ista: Janovjak HL, Kessler M, Oesterhelt D, Gaub H, Mueller D. 2003. Unfolding pathways
of native bacteriorhodopsin depend on temperature. EMBO Journal. 22(19), 5220–5229.
mla: Janovjak, Harald L., et al. “Unfolding Pathways of Native Bacteriorhodopsin
Depend on Temperature.” EMBO Journal, vol. 22, no. 19, Wiley-Blackwell,
2003, pp. 5220–29, doi:10.1093/emboj/cdg509.
short: H.L. Janovjak, M. Kessler, D. Oesterhelt, H. Gaub, D. Mueller, EMBO Journal
22 (2003) 5220–5229.
date_created: 2018-12-11T12:04:50Z
date_published: 2003-01-01T00:00:00Z
date_updated: 2021-01-12T07:51:45Z
day: '01'
doi: 10.1093/emboj/cdg509
extern: 1
intvolume: ' 22'
issue: '19'
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC204492/
month: '01'
oa: 1
page: 5220 - 5229
publication: EMBO Journal
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2506'
quality_controlled: 0
status: public
title: Unfolding pathways of native bacteriorhodopsin depend on temperature
type: journal_article
volume: 22
year: '2003'
...
---
_id: '3752'
abstract:
- lang: eng
text: We use the lac operon in Escherichia coli as a prototype system to illustrate
the current state, applicability, and limitations of modeling the dynamics of
cellular networks. We integrate three different levels of description (molecular,
cellular, and that of cell population) into a single model, which seems to capture
many experimental aspects of the system.
author:
- first_name: Jose
full_name: Vilar,Jose M
last_name: Vilar
- first_name: Calin C
full_name: Calin Guet
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
- first_name: Stanislas
full_name: Leibler, Stanislas
last_name: Leibler
citation:
ama: 'Vilar J, Guet CC, Leibler S. Modeling network dynamics: the lac operon, a
case study. Journal of Cell Biology. 2003;161(3):471-476. doi:10.1083/jcb.200301125'
apa: 'Vilar, J., Guet, C. C., & Leibler, S. (2003). Modeling network dynamics:
the lac operon, a case study. Journal of Cell Biology. Rockefeller University
Press. https://doi.org/10.1083/jcb.200301125'
chicago: 'Vilar, Jose, Calin C Guet, and Stanislas Leibler. “Modeling Network Dynamics:
The Lac Operon, a Case Study.” Journal of Cell Biology. Rockefeller University
Press, 2003. https://doi.org/10.1083/jcb.200301125.'
ieee: 'J. Vilar, C. C. Guet, and S. Leibler, “Modeling network dynamics: the lac
operon, a case study,” Journal of Cell Biology, vol. 161, no. 3. Rockefeller
University Press, pp. 471–476, 2003.'
ista: 'Vilar J, Guet CC, Leibler S. 2003. Modeling network dynamics: the lac operon,
a case study. Journal of Cell Biology. 161(3), 471–476.'
mla: 'Vilar, Jose, et al. “Modeling Network Dynamics: The Lac Operon, a Case Study.”
Journal of Cell Biology, vol. 161, no. 3, Rockefeller University Press,
2003, pp. 471–76, doi:10.1083/jcb.200301125.'
short: J. Vilar, C.C. Guet, S. Leibler, Journal of Cell Biology 161 (2003) 471–476.
date_created: 2018-12-11T12:04:58Z
date_published: 2003-01-12T00:00:00Z
date_updated: 2021-01-12T07:51:57Z
day: '12'
doi: 10.1083/jcb.200301125
extern: 1
intvolume: ' 161'
issue: '3'
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2172934/?tool=pubmed
month: '01'
oa: 1
page: 471 - 476
publication: Journal of Cell Biology
publication_status: published
publisher: Rockefeller University Press
publist_id: '2475'
quality_controlled: 0
status: public
title: 'Modeling network dynamics: the lac operon, a case study'
type: journal_article
volume: 161
year: '2003'
...
---
_id: '3797'
article_processing_charge: No
author:
- first_name: Wolfgang
full_name: Bauer, Wolfgang
last_name: Bauer
- first_name: Marco
full_name: Kleine Berkenbusch, Marco
last_name: Kleine Berkenbusch
- first_name: Mark Tobias
full_name: Bollenbach, Mark Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
citation:
ama: 'Bauer W, Kleine Berkenbusch M, Bollenbach MT. Breaking atomic nuclei into
little pieces: evidence for a phase transition. Revista Mexicana De Fisica.
2003;49(4):1-6.'
apa: 'Bauer, W., Kleine Berkenbusch, M., & Bollenbach, M. T. (2003). Breaking
atomic nuclei into little pieces: evidence for a phase transition. Revista
Mexicana De Fisica. Sociedad Mexicana de Física.'
chicago: 'Bauer, Wolfgang, Marco Kleine Berkenbusch, and Mark Tobias Bollenbach.
“Breaking Atomic Nuclei into Little Pieces: Evidence for a Phase Transition.”
Revista Mexicana De Fisica. Sociedad Mexicana de Física, 2003.'
ieee: 'W. Bauer, M. Kleine Berkenbusch, and M. T. Bollenbach, “Breaking atomic nuclei
into little pieces: evidence for a phase transition,” Revista Mexicana De Fisica,
vol. 49, no. 4. Sociedad Mexicana de Física, pp. 1–6, 2003.'
ista: 'Bauer W, Kleine Berkenbusch M, Bollenbach MT. 2003. Breaking atomic nuclei
into little pieces: evidence for a phase transition. Revista Mexicana De Fisica.
49(4), 1–6.'
mla: 'Bauer, Wolfgang, et al. “Breaking Atomic Nuclei into Little Pieces: Evidence
for a Phase Transition.” Revista Mexicana De Fisica, vol. 49, no. 4, Sociedad
Mexicana de Física, 2003, pp. 1–6.'
short: W. Bauer, M. Kleine Berkenbusch, M.T. Bollenbach, Revista Mexicana De Fisica
49 (2003) 1–6.
date_created: 2018-12-11T12:05:13Z
date_published: 2003-01-01T00:00:00Z
date_updated: 2021-01-12T07:52:16Z
day: '01'
extern: '1'
intvolume: ' 49'
issue: '4'
language:
- iso: eng
month: '01'
oa_version: None
page: 1 - 6
publication: Revista Mexicana De Fisica
publication_status: published
publisher: Sociedad Mexicana de Física
publist_id: '2413'
status: public
title: 'Breaking atomic nuclei into little pieces: evidence for a phase transition'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 49
year: '2003'
...
---
_id: '3804'
abstract:
- lang: eng
text: Kv3 channels are thought to be essential for the fast-spiking (FS) phenotype
in GABAergic interneurons, but how these channels confer the ability to generate
action potentials (APs) at high frequency is unknown. To address this question,
we developed a fast dynamic-clamp system (approximately 50 kHz) that allowed us
to add a Kv3 model conductance to CA1 oriens alveus (OA) interneurons in hippocampal
slices. Selective pharmacological block of Kv3 channels by 0.3 mm 4-aminopyridine
or 1 mm tetraethylammonium ions led to a marked broadening of APs during trains
of short stimuli and a reduction in AP frequency during 1 sec stimuli. The addition
of artificial Kv3 conductance restored the original AP pattern. Subtraction of
Kv3 conductance by dynamic clamp mimicked the effects of the blockers. Application
of artificial Kv3 conductance also led to FS in OA interneurons after complete
K+ channel block and even induced FS in hippocampal pyramidal neurons in the absence
of blockers. Adding artificial Kv3 conductance with altered deactivation kinetics
revealed a nonmonotonic relationship between mean AP frequency and deactivation
rate, with a maximum slightly above the original value. Insertion of artificial
Kv3 conductance with either lowered activation threshold or inactivation also
led to a reduction in the mean AP frequency. However, the mechanisms were distinct.
Shifting the activation threshold induced adaptation, whereas adding inactivation
caused frequency-dependent AP broadening. In conclusion, Kv3 channels are necessary
for the FS phenotype of OA interneurons, and several of their gating properties
appear to be optimized for high-frequency repetitive activity.
author:
- first_name: Cheng
full_name: Lien, Cheng-Chang
last_name: Lien
- first_name: Peter M
full_name: Peter Jonas
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Lien C, Jonas PM. Kv3 potassium conductance is necessary and kinetically optimized
for high-frequency action potential generation in hippocampal interneurons. Journal
of Neuroscience. 2003;23(6):2058-2068.
apa: Lien, C., & Jonas, P. M. (2003). Kv3 potassium conductance is necessary
and kinetically optimized for high-frequency action potential generation in hippocampal
interneurons. Journal of Neuroscience. Society for Neuroscience.
chicago: Lien, Cheng, and Peter M Jonas. “Kv3 Potassium Conductance Is Necessary
and Kinetically Optimized for High-Frequency Action Potential Generation in Hippocampal
Interneurons.” Journal of Neuroscience. Society for Neuroscience, 2003.
ieee: C. Lien and P. M. Jonas, “Kv3 potassium conductance is necessary and kinetically
optimized for high-frequency action potential generation in hippocampal interneurons,”
Journal of Neuroscience, vol. 23, no. 6. Society for Neuroscience, pp.
2058–68, 2003.
ista: Lien C, Jonas PM. 2003. Kv3 potassium conductance is necessary and kinetically
optimized for high-frequency action potential generation in hippocampal interneurons.
Journal of Neuroscience. 23(6), 2058–68.
mla: Lien, Cheng, and Peter M. Jonas. “Kv3 Potassium Conductance Is Necessary and
Kinetically Optimized for High-Frequency Action Potential Generation in Hippocampal
Interneurons.” Journal of Neuroscience, vol. 23, no. 6, Society for Neuroscience,
2003, pp. 2058–68.
short: C. Lien, P.M. Jonas, Journal of Neuroscience 23 (2003) 2058–68.
date_created: 2018-12-11T12:05:16Z
date_published: 2003-01-01T00:00:00Z
date_updated: 2021-01-12T07:52:19Z
day: '01'
extern: 1
intvolume: ' 23'
issue: '6'
month: '01'
page: 2058 - 68
publication: Journal of Neuroscience
publication_status: published
publisher: Society for Neuroscience
publist_id: '2406'
quality_controlled: 0
status: public
title: Kv3 potassium conductance is necessary and kinetically optimized for high-frequency
action potential generation in hippocampal interneurons
type: journal_article
volume: 23
year: '2003'
...
---
_id: '3806'
abstract:
- lang: eng
text: To probe exocytosis at a cortical glutamatergic synapse, we made capacitance
measurements in whole-cell recorded hippocampal mossy fiber terminals. Evaluation
of different methods by using a morphology-based equivalent electrical model revealed
that quantitative capacitance measurements are possible in this presynaptic structure.
Voltage pulses leading to presynaptic Ca2+ inflow evoked large capacitance signals
that showed saturation with increasing pulse duration. The mean peak capacitance
increase was 100 fF, corresponding to a pool of approximately 1,400 releasable
vesicles. Thus hippocampal mossy fiber synapses have a vesicular "maxipool."
Large pool size and rapid vesicle recycling may underlie the uniquely large extent
of activity-dependent plasticity in this synapse.
author:
- first_name: Stefan
full_name: Hallermann, Stefan
last_name: Hallermann
- first_name: Christian
full_name: Pawlu, Christian
last_name: Pawlu
- first_name: Peter M
full_name: Peter Jonas
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Manfred
full_name: Heckmann, Manfred
last_name: Heckmann
citation:
ama: Hallermann S, Pawlu C, Jonas PM, Heckmann M. A large pool of releasable vesicles
in a cortical glutamatergic synapse. PNAS. 2003;100(15):8975-8980. doi:10.1073/pnas.1432836100
apa: Hallermann, S., Pawlu, C., Jonas, P. M., & Heckmann, M. (2003). A large
pool of releasable vesicles in a cortical glutamatergic synapse. PNAS.
National Academy of Sciences. https://doi.org/10.1073/pnas.1432836100
chicago: Hallermann, Stefan, Christian Pawlu, Peter M Jonas, and Manfred Heckmann.
“A Large Pool of Releasable Vesicles in a Cortical Glutamatergic Synapse.” PNAS.
National Academy of Sciences, 2003. https://doi.org/10.1073/pnas.1432836100.
ieee: S. Hallermann, C. Pawlu, P. M. Jonas, and M. Heckmann, “A large pool of releasable
vesicles in a cortical glutamatergic synapse,” PNAS, vol. 100, no. 15.
National Academy of Sciences, pp. 8975–80, 2003.
ista: Hallermann S, Pawlu C, Jonas PM, Heckmann M. 2003. A large pool of releasable
vesicles in a cortical glutamatergic synapse. PNAS. 100(15), 8975–80.
mla: Hallermann, Stefan, et al. “A Large Pool of Releasable Vesicles in a Cortical
Glutamatergic Synapse.” PNAS, vol. 100, no. 15, National Academy of Sciences,
2003, pp. 8975–80, doi:10.1073/pnas.1432836100.
short: S. Hallermann, C. Pawlu, P.M. Jonas, M. Heckmann, PNAS 100 (2003) 8975–80.
date_created: 2018-12-11T12:05:16Z
date_published: 2003-01-01T00:00:00Z
date_updated: 2021-01-12T07:52:20Z
day: '01'
doi: 10.1073/pnas.1432836100
extern: 1
intvolume: ' 100'
issue: '15'
month: '01'
page: 8975 - 80
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '2405'
quality_controlled: 0
status: public
title: A large pool of releasable vesicles in a cortical glutamatergic synapse
type: journal_article
volume: 100
year: '2003'
...
---
_id: '3897'
abstract:
- lang: eng
text: Many verification, planning, and control problems can be modeled as games
played on state-transition graphs by one or two players whose conflicting goals
are to form a path in the graph. The focus here is on simple stochastic parity
games, that is, two-player games with turn-based probabilistic transitions and
omega-regular objectives formalized as parity (Rabin chain) winning conditions.
An efficient translation from simple stochastic parity games to nonstochastic
parity games is given. As many algorithms are known for solving the latter, the
translation yields efficient algorithms for computing the states of a simple stochastic
parity game from which a player can win with probability 1. An important special
case of simple stochastic parity games are the Markov decision processes with
Buchi objectives. For this special case a first provably subquadratic algorithm
is given for computing the states from which the single player has a strategy
to achieve a Buchi objective with probability 1. For game graphs with m edges
the algorithm works in time O(mrootm). Interestingly, a similar technique sheds
light on the question of the computational complexity of solving simple Buchi
games and yields the first provably subquadratic algorithm, with a running time
of O(n(2)/log n) for game graphs with n vertices and O(n) edges.
acknowledgement: This research was supported in part by the DARPA grant F33615-C-98-3614,
the ONR grant N00014-02-1-0671, the NSF grants CCR-9988172 and CCR-0225610, and
the Polish KBN grant 7-T11C-027-20.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Marcin
full_name: Jurdziński, Marcin
last_name: Jurdziński
- first_name: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Chatterjee K, Jurdziński M, Henzinger TA. Simple stochastic parity games.
In: Vol 2803. Springer; 2003:100-113. doi:10.1007/978-3-540-45220-1_11'
apa: 'Chatterjee, K., Jurdziński, M., & Henzinger, T. A. (2003). Simple stochastic
parity games (Vol. 2803, pp. 100–113). Presented at the CSL: Computer Science
Logic, Springer. https://doi.org/10.1007/978-3-540-45220-1_11'
chicago: Chatterjee, Krishnendu, Marcin Jurdziński, and Thomas A Henzinger. “Simple
Stochastic Parity Games,” 2803:100–113. Springer, 2003. https://doi.org/10.1007/978-3-540-45220-1_11.
ieee: 'K. Chatterjee, M. Jurdziński, and T. A. Henzinger, “Simple stochastic parity
games,” presented at the CSL: Computer Science Logic, 2003, vol. 2803, pp. 100–113.'
ista: 'Chatterjee K, Jurdziński M, Henzinger TA. 2003. Simple stochastic parity
games. CSL: Computer Science Logic, LNCS, vol. 2803, 100–113.'
mla: Chatterjee, Krishnendu, et al. Simple Stochastic Parity Games. Vol.
2803, Springer, 2003, pp. 100–13, doi:10.1007/978-3-540-45220-1_11.
short: K. Chatterjee, M. Jurdziński, T.A. Henzinger, in:, Springer, 2003, pp. 100–113.
conference:
name: 'CSL: Computer Science Logic'
date_created: 2018-12-11T12:05:46Z
date_published: 2003-08-18T00:00:00Z
date_updated: 2021-01-12T07:53:02Z
day: '18'
doi: 10.1007/978-3-540-45220-1_11
extern: 1
intvolume: ' 2803'
month: '08'
page: 100 - 113
publication_status: published
publisher: Springer
publist_id: '2259'
quality_controlled: 0
status: public
title: Simple stochastic parity games
type: conference
volume: 2803
year: '2003'
...
---
_id: '3898'
abstract:
- lang: eng
text: We study the problem of determining stack boundedness and the exact maximum
stack size for three classes of interrupt-driven programs. Interrupt-driven programs
axe used in many real-time applications that require responsive interrupt handling.
In order to ensure responsiveness, programmers often enable interrupt processing
in the body of lower-priority interrupt handlers. In such programs a programming
error can allow interrupt handlers to be interrupted in cyclic fashion to lead
to an unbounded stack, causing the system to crash. For a restricted class of
interrupt-driven programs, we show that there is a polynomial-time procedure to
check stack boundedness, while determining the exact maximum stack size is PSPACE-complete.
For a larger class of programs, the two problems are both PSPACE-complete, and
for the largest class of programs we consider, the two problems are PSPACE-hard
and can be solved in exponential time.
acknowledgement: Jens Palsberg, Di Ma, and Tian Zhao were supported by the NSF ITR
award 0112628. Thomas A. Henzinger, Krishnendu Chatterjee, and Rupak Majumdar were
supported by the AFOSR grant F49620-00-1-0327, the DARPA grants F33615-C-98-3614
and F33615-00-C-1693, the MARCO grant 98-DT-660, and the NSF grants CCR-0208875
and CCR-0085949.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Di
full_name: Ma, Di
last_name: Ma
- first_name: Ritankar
full_name: Majumdar, Ritankar S
last_name: Majumdar
- first_name: Tian
full_name: Zhao, Tian
last_name: Zhao
- first_name: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jens
full_name: Palsberg, Jens
last_name: Palsberg
citation:
ama: 'Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. Stack size
analysis for interrupt-driven programs. In: Vol 2694. Springer; 2003:109-126.
doi:10.1007/3-540-44898-5_7'
apa: 'Chatterjee, K., Ma, D., Majumdar, R., Zhao, T., Henzinger, T. A., & Palsberg,
J. (2003). Stack size analysis for interrupt-driven programs (Vol. 2694, pp. 109–126).
Presented at the SAS: Static Analysis Symposium, Springer. https://doi.org/10.1007/3-540-44898-5_7'
chicago: Chatterjee, Krishnendu, Di Ma, Ritankar Majumdar, Tian Zhao, Thomas A Henzinger,
and Jens Palsberg. “Stack Size Analysis for Interrupt-Driven Programs,” 2694:109–26.
Springer, 2003. https://doi.org/10.1007/3-540-44898-5_7.
ieee: 'K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T. A. Henzinger, and J. Palsberg,
“Stack size analysis for interrupt-driven programs,” presented at the SAS: Static
Analysis Symposium, 2003, vol. 2694, pp. 109–126.'
ista: 'Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. 2003. Stack
size analysis for interrupt-driven programs. SAS: Static Analysis Symposium, LNCS,
vol. 2694, 109–126.'
mla: Chatterjee, Krishnendu, et al. Stack Size Analysis for Interrupt-Driven
Programs. Vol. 2694, Springer, 2003, pp. 109–26, doi:10.1007/3-540-44898-5_7.
short: K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T.A. Henzinger, J. Palsberg,
in:, Springer, 2003, pp. 109–126.
conference:
name: 'SAS: Static Analysis Symposium'
date_created: 2018-12-11T12:05:46Z
date_published: 2003-05-28T00:00:00Z
date_updated: 2021-01-12T07:53:02Z
day: '28'
doi: 10.1007/3-540-44898-5_7
extern: 1
intvolume: ' 2694'
month: '05'
page: 109 - 126
publication_status: published
publisher: Springer
publist_id: '2260'
quality_controlled: 0
status: public
title: Stack size analysis for interrupt-driven programs
type: conference
volume: 2694
year: '2003'
...
---
_id: '3917'
abstract:
- lang: eng
text: Male dimorphism is not genetically determined, but is induced by environmental
conditions particularly decreasing temperature and density.
author:
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
- first_name: Jürgen
full_name: Heinze, Jürgen
last_name: Heinze
citation:
ama: 'Cremer S, Heinze J. Zwischen Hochzeitsflug und Brudermord: reproduktive Taktiken
bei Ameisenmännchen. Blick in die Wissenschaft. 2003;12(15):32-36.'
apa: 'Cremer, S., & Heinze, J. (2003). Zwischen Hochzeitsflug und Brudermord:
reproduktive Taktiken bei Ameisenmännchen. Blick in Die Wissenschaft. Schnell
und Steiner.'
chicago: 'Cremer, Sylvia, and Jürgen Heinze. “Zwischen Hochzeitsflug Und Brudermord:
Reproduktive Taktiken Bei Ameisenmännchen.” Blick in Die Wissenschaft.
Schnell und Steiner, 2003.'
ieee: 'S. Cremer and J. Heinze, “Zwischen Hochzeitsflug und Brudermord: reproduktive
Taktiken bei Ameisenmännchen,” Blick in die Wissenschaft, vol. 12, no.
15. Schnell und Steiner, pp. 32–36, 2003.'
ista: 'Cremer S, Heinze J. 2003. Zwischen Hochzeitsflug und Brudermord: reproduktive
Taktiken bei Ameisenmännchen. Blick in die Wissenschaft. 12(15), 32–36.'
mla: 'Cremer, Sylvia, and Jürgen Heinze. “Zwischen Hochzeitsflug Und Brudermord:
Reproduktive Taktiken Bei Ameisenmännchen.” Blick in Die Wissenschaft,
vol. 12, no. 15, Schnell und Steiner, 2003, pp. 32–36.'
short: S. Cremer, J. Heinze, Blick in Die Wissenschaft 12 (2003) 32–36.
date_created: 2018-12-11T12:05:53Z
date_published: 2003-01-01T00:00:00Z
date_updated: 2021-01-12T07:53:11Z
day: '01'
extern: '1'
intvolume: ' 12'
issue: '15'
language:
- iso: eng
month: '01'
oa_version: None
page: 32 - 36
publication: Blick in die Wissenschaft
publication_status: published
publisher: Schnell und Steiner
publist_id: '2235'
status: public
title: 'Zwischen Hochzeitsflug und Brudermord: reproduktive Taktiken bei Ameisenmännchen'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 12
year: '2003'
...