---
_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: '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: '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: '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: '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: '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: '3993'
abstract:
- lang: eng
text: We present algorithms for constructing a hierarchy of increasingly coarse
Morse-Smale complexes that decompose a piecewise linear 2-manifold. While these
complexes are defined only in the smooth category, we extend the construction
to the piecewise linearcategory by ensuring structural integrity and simulating
differentiability. We then simplify Morse-Smale complexes by canceling pairs of
critical points in order of increasing persistence.
acknowledgement: Partially supported by ARO under Grant DAAG55-98-1-0177, NSF under
Grants CCR-97-12088, EIA-9972879 and CCR-00-86013.
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: Afra
full_name: Zomorodian, Afra
last_name: Zomorodian
citation:
ama: Edelsbrunner H, Harer J, Zomorodian A. Hierarchical Morse-Smale complexes for
piecewise linear 2-manifolds. Discrete & Computational Geometry. 2003;30(1):87-107.
doi:10.1007/s00454-003-2926-5
apa: Edelsbrunner, H., Harer, J., & Zomorodian, A. (2003). Hierarchical Morse-Smale
complexes for piecewise linear 2-manifolds. Discrete & Computational Geometry.
Springer. https://doi.org/10.1007/s00454-003-2926-5
chicago: Edelsbrunner, Herbert, John Harer, and Afra Zomorodian. “Hierarchical Morse-Smale
Complexes for Piecewise Linear 2-Manifolds.” Discrete & Computational Geometry.
Springer, 2003. https://doi.org/10.1007/s00454-003-2926-5.
ieee: H. Edelsbrunner, J. Harer, and A. Zomorodian, “Hierarchical Morse-Smale complexes
for piecewise linear 2-manifolds,” Discrete & Computational Geometry,
vol. 30, no. 1. Springer, pp. 87–107, 2003.
ista: Edelsbrunner H, Harer J, Zomorodian A. 2003. Hierarchical Morse-Smale complexes
for piecewise linear 2-manifolds. Discrete & Computational Geometry. 30(1),
87–107.
mla: Edelsbrunner, Herbert, et al. “Hierarchical Morse-Smale Complexes for Piecewise
Linear 2-Manifolds.” Discrete & Computational Geometry, vol. 30, no.
1, Springer, 2003, pp. 87–107, doi:10.1007/s00454-003-2926-5.
short: H. Edelsbrunner, J. Harer, A. Zomorodian, Discrete & Computational Geometry
30 (2003) 87–107.
date_created: 2018-12-11T12:06:19Z
date_published: 2003-07-01T00:00:00Z
date_updated: 2021-01-12T07:53:43Z
day: '01'
doi: 10.1007/s00454-003-2926-5
extern: 1
intvolume: ' 30'
issue: '1'
month: '07'
page: 87 - 107
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '2134'
quality_controlled: 0
status: public
title: Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds
type: journal_article
volume: 30
year: '2003'
...
---
_id: '3994'
abstract:
- lang: eng
text: The body defined by a finite collection of disks is a subset of the plane
bounded by a tangent continuous curve, which we call the skin. We give analytic
formulas for the area, the perimeter, the area derivative, and the perimeter derivative
of the body. Given the filtrations of the Delaunay triangulation and the Voronoi
diagram of the disks, all formulas can be evaluated in time proportional to the
number of disks.
acknowledgement: NSF under grant DMS-98-73945, ARO under grant DAAG55-98-1-0177 and
by NSF under grants CCR- 97-12088, EIA-9972879, and CCR-00-86013.
author:
- first_name: Ho
full_name: Cheng, Ho-Lun
last_name: Cheng
- first_name: Herbert
full_name: Herbert Edelsbrunner
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: 'Cheng H, Edelsbrunner H. Area, perimeter and derivatives of a skin curve.
Computational Geometry: Theory and Applications. 2003;26(2):173-192. doi:10.1016/S0925-7721(02)00124-4'
apa: 'Cheng, H., & Edelsbrunner, H. (2003). Area, perimeter and derivatives
of a skin curve. Computational Geometry: Theory and Applications. Elsevier.
https://doi.org/10.1016/S0925-7721(02)00124-4'
chicago: 'Cheng, Ho, and Herbert Edelsbrunner. “Area, Perimeter and Derivatives
of a Skin Curve.” Computational Geometry: Theory and Applications. Elsevier,
2003. https://doi.org/10.1016/S0925-7721(02)00124-4.'
ieee: 'H. Cheng and H. Edelsbrunner, “Area, perimeter and derivatives of a skin
curve,” Computational Geometry: Theory and Applications, vol. 26, no. 2.
Elsevier, pp. 173–192, 2003.'
ista: 'Cheng H, Edelsbrunner H. 2003. Area, perimeter and derivatives of a skin
curve. Computational Geometry: Theory and Applications. 26(2), 173–192.'
mla: 'Cheng, Ho, and Herbert Edelsbrunner. “Area, Perimeter and Derivatives of a
Skin Curve.” Computational Geometry: Theory and Applications, vol. 26,
no. 2, Elsevier, 2003, pp. 173–92, doi:10.1016/S0925-7721(02)00124-4.'
short: 'H. Cheng, H. Edelsbrunner, Computational Geometry: Theory and Applications
26 (2003) 173–192.'
date_created: 2018-12-11T12:06:20Z
date_published: 2003-10-01T00:00:00Z
date_updated: 2021-01-12T07:53:43Z
day: '01'
doi: 10.1016/S0925-7721(02)00124-4
extern: 1
intvolume: ' 26'
issue: '2'
month: '10'
page: 173 - 192
publication: 'Computational Geometry: Theory and Applications'
publication_status: published
publisher: Elsevier
publist_id: '2135'
quality_controlled: 0
status: public
title: Area, perimeter and derivatives of a skin curve
type: journal_article
volume: 26
year: '2003'
...
---
_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'
...