---
_id: '3820'
abstract:
- lang: eng
text: 'Synapses are the key elements for signal processing and plasticity in the
brain. To determine the structural factors underlying the unique functional properties
of the hippocampal mossy fiber synapse, the complete quantitative geometry was
investigated, using electron microscopy of serial ultrathin sections followed
by computer-assisted three-dimensional reconstruction. In particular, parameters
relevant for transmitter release and synaptic plasticity were examined. Two membrane
specializations were found: active zones (AZs), transmitter release sites, and
puncta adherentia, putative adhesion complexes. Individual boutons had, on average,
25 AZs (range, 7-45) that varied in shape and size (mean, 0.1 microm2; range,
0.07-0.17 microm2). The mean distance between individual AZs was 0.45 microm.
Mossy fiber boutons and their target structures were mostly ensheathed by astrocytes,
but fine glial processes never reached the active zones. Two structural factors
are likely to promote synaptic cross talk: the short distance between AZs and
the absence of fine glial processes at AZs. Thus, synaptic cross talk may contribute
to the efficacy of hippocampal mossy fiber synapses. On average, a bouton contained
20,400 synaptic vesicles; approximately 900 vesicles were located within 60 nm
from the active zone, approximately 4400 between 60 and 200 nm, and the remaining
beyond 200 nm, suggesting large readily releasable, recycling, and reserve pools.
The organization of the different pools may be a key structural correlate of presynaptic
plasticity at this synapse. Thus, the mossy fiber bouton differs fundamentally
in structure and function from the calyx of Held and other central synapses.'
author:
- first_name: Astrid
full_name: Rollenhagen, Astrid
last_name: Rollenhagen
- first_name: Kurt
full_name: Satzler, Kurt
last_name: Satzler
- first_name: E Patricia
full_name: Rodriguez, E Patricia
last_name: Rodriguez
- first_name: Peter M
full_name: Peter Jonas
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Michael
full_name: Frotscher, Michael
last_name: Frotscher
- first_name: Joachim
full_name: Lubke, Joachim H
last_name: Lubke
citation:
ama: Rollenhagen A, Satzler K, Rodriguez EP, Jonas PM, Frotscher M, Lubke J. Structural
determinants of transmission at large hippocampal mossy fiber synapses. Journal
of Neuroscience. 2007;27(39):10434-10444. doi:10.1523/JNEUROSCI.1946-07.2007
apa: Rollenhagen, A., Satzler, K., Rodriguez, E. P., Jonas, P. M., Frotscher, M.,
& Lubke, J. (2007). Structural determinants of transmission at large hippocampal
mossy fiber synapses. Journal of Neuroscience. Society for Neuroscience.
https://doi.org/10.1523/JNEUROSCI.1946-07.2007
chicago: Rollenhagen, Astrid, Kurt Satzler, E Patricia Rodriguez, Peter M Jonas,
Michael Frotscher, and Joachim Lubke. “Structural Determinants of Transmission
at Large Hippocampal Mossy Fiber Synapses.” Journal of Neuroscience. Society
for Neuroscience, 2007. https://doi.org/10.1523/JNEUROSCI.1946-07.2007.
ieee: A. Rollenhagen, K. Satzler, E. P. Rodriguez, P. M. Jonas, M. Frotscher, and
J. Lubke, “Structural determinants of transmission at large hippocampal mossy
fiber synapses,” Journal of Neuroscience, vol. 27, no. 39. Society for
Neuroscience, pp. 10434–44, 2007.
ista: Rollenhagen A, Satzler K, Rodriguez EP, Jonas PM, Frotscher M, Lubke J. 2007.
Structural determinants of transmission at large hippocampal mossy fiber synapses.
Journal of Neuroscience. 27(39), 10434–44.
mla: Rollenhagen, Astrid, et al. “Structural Determinants of Transmission at Large
Hippocampal Mossy Fiber Synapses.” Journal of Neuroscience, vol. 27, no.
39, Society for Neuroscience, 2007, pp. 10434–44, doi:10.1523/JNEUROSCI.1946-07.2007.
short: A. Rollenhagen, K. Satzler, E.P. Rodriguez, P.M. Jonas, M. Frotscher, J.
Lubke, Journal of Neuroscience 27 (2007) 10434–44.
date_created: 2018-12-11T12:05:21Z
date_published: 2007-01-01T00:00:00Z
date_updated: 2021-01-12T07:52:26Z
day: '01'
doi: 10.1523/JNEUROSCI.1946-07.2007
extern: 1
intvolume: ' 27'
issue: '39'
month: '01'
page: 10434 - 44
publication: Journal of Neuroscience
publication_status: published
publisher: Society for Neuroscience
publist_id: '2390'
quality_controlled: 0
status: public
title: Structural determinants of transmission at large hippocampal mossy fiber synapses
type: journal_article
volume: 27
year: '2007'
...
---
_id: '3821'
abstract:
- lang: eng
text: Although dendritic signal processing has been extensively investigated in
hippocampal pyramidal cells, only little is known about dendritic integration
of synaptic potentials in dentate gyrus granule cells, the first stage in the
hippocampal trisynaptic circuit. Here we combined dual whole-cell patch-clamp
recordings with high-resolution two-photon microscopy to obtain detailed passive
cable models of hippocampal granule cells from adult mice. Passive cable properties
were determined by direct fitting of the compartmental model to the experimentally
measured voltage responses to short and long current pulses. The data are best
fit by a cable model with homogenously distributed parameters, including an average
specific membrane resistance (R(m)) of 38.0 kohms cm2, a membrane capacitance
(C(m)) of 1.0 microF cm(-2), and an intracellular resistivity (R(i)) of 194 ohms
cm. Computational analysis shows that signal propagation from somata into dendrites
is more efficient in granule cells compared with CA1 pyramidal cells for both
steady-state and sinusoidal voltage waveforms up to the gamma frequency range
(f50% of 74 Hz). Similarly, distal synaptic inputs from entorhinal fibers can
efficiently depolarize the somatic membrane of granule cells. Furthermore, the
time course of distal dendritic synaptic potentials is remarkably fast, and temporal
summation is restricted to a narrow time window in the range of approximately
10 ms attributable to the rapid dendritic charge redistribution during transient
voltage signals. Therefore, the structure of the granule cell dendritic tree may
be critically important for precise dendritic signal processing and coincidence
detection during hippocampus-dependent memory formation and retrieval.
author:
- first_name: Christoph
full_name: Schmidt-Hieber, Christoph
last_name: Schmidt Hieber
- first_name: Peter M
full_name: Peter Jonas
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Josef
full_name: Bischofberger, Josef
last_name: Bischofberger
citation:
ama: Schmidt Hieber C, Jonas PM, Bischofberger J. Subthreshold dendritic signal
processing and coincidence detection in dentate gyrus granule cells. Journal
of Neuroscience. 2007;27(31):8430-8441. doi:10.1523/JNEUROSCI.1787-07.2007
apa: Schmidt Hieber, C., Jonas, P. M., & Bischofberger, J. (2007). Subthreshold
dendritic signal processing and coincidence detection in dentate gyrus granule
cells. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.1787-07.2007
chicago: Schmidt Hieber, Christoph, Peter M Jonas, and Josef Bischofberger. “Subthreshold
Dendritic Signal Processing and Coincidence Detection in Dentate Gyrus Granule
Cells.” Journal of Neuroscience. Society for Neuroscience, 2007. https://doi.org/10.1523/JNEUROSCI.1787-07.2007.
ieee: C. Schmidt Hieber, P. M. Jonas, and J. Bischofberger, “Subthreshold dendritic
signal processing and coincidence detection in dentate gyrus granule cells,” Journal
of Neuroscience, vol. 27, no. 31. Society for Neuroscience, pp. 8430–8441,
2007.
ista: Schmidt Hieber C, Jonas PM, Bischofberger J. 2007. Subthreshold dendritic
signal processing and coincidence detection in dentate gyrus granule cells. Journal
of Neuroscience. 27(31), 8430–8441.
mla: Schmidt Hieber, Christoph, et al. “Subthreshold Dendritic Signal Processing
and Coincidence Detection in Dentate Gyrus Granule Cells.” Journal of Neuroscience,
vol. 27, no. 31, Society for Neuroscience, 2007, pp. 8430–41, doi:10.1523/JNEUROSCI.1787-07.2007.
short: C. Schmidt Hieber, P.M. Jonas, J. Bischofberger, Journal of Neuroscience
27 (2007) 8430–8441.
date_created: 2018-12-11T12:05:21Z
date_published: 2007-01-01T00:00:00Z
date_updated: 2021-01-12T07:52:26Z
day: '01'
doi: 10.1523/JNEUROSCI.1787-07.2007
extern: 1
intvolume: ' 27'
issue: '31'
month: '01'
page: 8430 - 8441
publication: Journal of Neuroscience
publication_status: published
publisher: Society for Neuroscience
publist_id: '2391'
quality_controlled: 0
status: public
title: Subthreshold dendritic signal processing and coincidence detection in dentate
gyrus granule cells
type: journal_article
volume: 27
year: '2007'
...
---
_id: '3881'
abstract:
- lang: eng
text: We present Qualitative Randomized CTL (QRCTL), a qualitative version of pCTL,
for specifying properties of Markov Decision Processes (MDPs). QRCTL formulas
can express the fact that certain temporal properties hold with probability 0
or 1, but they do not distinguish other probabilities values. We present a symbolic,
polynomial time model-checking algorithm for QRCTL on MDPs. Then, we study the
equivalence relation induced by QRCTL, called qualitative equivalence. We show
that for finite alternating MDPs, where nondeterministic and probabilistic choice
occur in different states, qualitative equivalence coincides with alternating
bisimulation, and can thus be computed via efficient partition-refinement algorithms.
Surprisingly, the result does not hold for non-alternating MDPs. Indeed, we show
that no local partition refinement algorithm can compute qualitative equivalence
on non-alternating MDPs. Finally, we consider QRCTL*, that is the “star extension”
of QRCTL. We show that QRCTL and QRCTL* induce the same qualitative equivalence
on alternating MDPs, while on non-alternating MDPs, the equivalence, arising from
QRCTL* can be strictly finer We also provide a full characterization of the relation
between qualitative equivalence, bisimulation, and alternating bisimulation, according
to whether the MDPs are finite, and to whether their transition relations are
finite-branching.
author:
- first_name: Luca
full_name: de Alfaro, Luca
last_name: De Alfaro
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Marco
full_name: Faella, Marco
last_name: Faella
- first_name: Axel
full_name: Legay, Axel
last_name: Legay
citation:
ama: 'De Alfaro L, Chatterjee K, Faella M, Legay A. Qualitative logics and equivalences
for probabilistic systems. In: IEEE; 2007:237-248. doi:10.1109/QEST.2007.15'
apa: 'De Alfaro, L., Chatterjee, K., Faella, M., & Legay, A. (2007). Qualitative
logics and equivalences for probabilistic systems (pp. 237–248). Presented at
the QEST: Quantitative Evaluation of Systems, IEEE. https://doi.org/10.1109/QEST.2007.15'
chicago: De Alfaro, Luca, Krishnendu Chatterjee, Marco Faella, and Axel Legay. “Qualitative
Logics and Equivalences for Probabilistic Systems,” 237–48. IEEE, 2007. https://doi.org/10.1109/QEST.2007.15.
ieee: 'L. De Alfaro, K. Chatterjee, M. Faella, and A. Legay, “Qualitative logics
and equivalences for probabilistic systems,” presented at the QEST: Quantitative
Evaluation of Systems, 2007, pp. 237–248.'
ista: 'De Alfaro L, Chatterjee K, Faella M, Legay A. 2007. Qualitative logics and
equivalences for probabilistic systems. QEST: Quantitative Evaluation of Systems,
237–248.'
mla: De Alfaro, Luca, et al. Qualitative Logics and Equivalences for Probabilistic
Systems. IEEE, 2007, pp. 237–48, doi:10.1109/QEST.2007.15.
short: L. De Alfaro, K. Chatterjee, M. Faella, A. Legay, in:, IEEE, 2007, pp. 237–248.
conference:
name: 'QEST: Quantitative Evaluation of Systems'
date_created: 2018-12-11T12:05:40Z
date_published: 2007-10-08T00:00:00Z
date_updated: 2021-01-12T07:52:55Z
day: '08'
doi: 10.1109/QEST.2007.15
extern: 1
month: '10'
page: 237 - 248
publication_status: published
publisher: IEEE
publist_id: '2289'
quality_controlled: 0
status: public
title: Qualitative logics and equivalences for probabilistic systems
type: conference
year: '2007'
...
---
_id: '3882'
abstract:
- lang: eng
text: 'We study infinite stochastic games played by two players over a finite state
space, with objectives specified by sets of infinite traces. The games are concurrent
(players make moves simultaneously and independently), stochastic (the next state
is determined by a probability distribution that depends on the current state
and chosen moves of the players) and infinite (proceed for an infinite number
of rounds). The analysis of concurrent stochastic games can be classified into:
quantitative analysis, analyzing the optimum value of the game and epsilon-optimal
strategies that ensure values within epsilon of the optimum value; and qualitative
analysis, analyzing the set of states with optimum value 1 and epsilon-optimal
strategies for the states with optimum value 1. We consider concurrent games with
tail objectives, i.e., objectives that are independent of the finite-prefix of
traces, and show that the class of tail objectives is strictly richer than that
of the omega-regular objectives. We develop new proof techniques to extend several
properties of concurrent games with omega-regular objectives to concurrent games
with tail objectives. We prove the positive limit-one property for tail objectives.
The positive limit-one property states that for all concurrent games if the optimum
value for a player is positive for a tail objective Phi at some state, then there
is a state where the optimum value is 1 for the player for the objective Phi.
We also show that the optimum values of zero-sum (strictly conflicting objectives)
games with tail objectives can be related to equilibrium values of nonzerosum
(not strictly conflicting objectives) games with simpler reachability objectives.
A consequence of our analysis presents a polynomial time reduction of the quantitative
analysis of tail objectives to the qualitative analysis for the subclass of one-player
stochastic games (Markov decision processes). '
acknowledgement: A preliminary version of the paper appeared in Computer Science Logic
(CSL) 2006.
author:
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: Chatterjee K. Concurrent games with tail objectives. Theoretical Computer
Science. 2007;388(1-3):181-198. doi:10.1016/j.tcs.2007.07.047
apa: Chatterjee, K. (2007). Concurrent games with tail objectives. Theoretical
Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2007.07.047
chicago: Chatterjee, Krishnendu. “Concurrent Games with Tail Objectives.” Theoretical
Computer Science. Elsevier, 2007. https://doi.org/10.1016/j.tcs.2007.07.047.
ieee: K. Chatterjee, “Concurrent games with tail objectives,” Theoretical Computer
Science, vol. 388, no. 1–3. Elsevier, pp. 181–198, 2007.
ista: Chatterjee K. 2007. Concurrent games with tail objectives. Theoretical Computer
Science. 388(1–3), 181–198.
mla: Chatterjee, Krishnendu. “Concurrent Games with Tail Objectives.” Theoretical
Computer Science, vol. 388, no. 1–3, Elsevier, 2007, pp. 181–98, doi:10.1016/j.tcs.2007.07.047.
short: K. Chatterjee, Theoretical Computer Science 388 (2007) 181–198.
date_created: 2018-12-11T12:05:41Z
date_published: 2007-12-05T00:00:00Z
date_updated: 2021-01-12T07:52:56Z
day: '05'
doi: 10.1016/j.tcs.2007.07.047
extern: 1
intvolume: ' 388'
issue: 1-3
month: '12'
page: 181 - 198
publication: Theoretical Computer Science
publication_status: published
publisher: Elsevier
publist_id: '2290'
quality_controlled: 0
status: public
title: Concurrent games with tail objectives
type: journal_article
volume: 388
year: '2007'
...
---
_id: '3883'
abstract:
- lang: eng
text: We consider games where the winning conditions are disjunctions (or dually,
conjunctions) of parity conditions; we call them generalized parity games. These
winning conditions, while omega-regular, arise naturally when considering fair
simulation between parity automata, secure equilibria for parity conditions, and
determinization of Rabin automata. We show that these games retain the computational
complexity of Rabin and Streett conditions; i.e., they are NP-complete and co-NP-complete,
respectively. The (co-) NP-hardness is proved for the special case of a conjunction/disjunction
of two parity conditions, which is the case that arises in fair simulation and
secure equilibria. However, considering these games as Rabin or Streett games
is not optimal. We give an exposition of Zielonka's algorithm when specialized
to this kind of games. The complexity of solving these games for k parity objectives
with d priorities, n states, and m edges is O(n(2kd) (.) m) (.) (k(.)d)!/ d!(k),
as compared to O(n(2kd .) m) - (k (.) d)! when these games are solved as Rabin/Streett
games. We also extend the subexponential algorithm for solving parity games recently
introduced by Jurdzinski, Paterson, and Zwick to generalized parity games. The
resulting complexity of solving generalized parity games is n(O(root n)) (.) (k(.)d)!/d!(k).
As a corollary we obtain an improved ald!k gorithm for Rabin and Streett games
with d pairs, with time complexity n(O(root n)) (.) d!.
acknowledgement: This research was supported in part by the Swiss National Science
Foundation, and by the NSF grants CCR-0225610 and CCR-0234690.
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: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Nir
full_name: Piterman, Nir
last_name: Piterman
citation:
ama: 'Chatterjee K, Henzinger TA, Piterman N. Generalized parity games. In: Vol
4423. Springer; 2007:153-167. doi:10.1007/978-3-540-71389-0_12'
apa: 'Chatterjee, K., Henzinger, T. A., & Piterman, N. (2007). Generalized parity
games (Vol. 4423, pp. 153–167). Presented at the FoSSaCS: Foundations of Software
Science and Computation Structures, Springer. https://doi.org/10.1007/978-3-540-71389-0_12'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Generalized
Parity Games,” 4423:153–67. Springer, 2007. https://doi.org/10.1007/978-3-540-71389-0_12.
ieee: 'K. Chatterjee, T. A. Henzinger, and N. Piterman, “Generalized parity games,”
presented at the FoSSaCS: Foundations of Software Science and Computation Structures,
2007, vol. 4423, pp. 153–167.'
ista: 'Chatterjee K, Henzinger TA, Piterman N. 2007. Generalized parity games. FoSSaCS:
Foundations of Software Science and Computation Structures, LNCS, vol. 4423, 153–167.'
mla: Chatterjee, Krishnendu, et al. Generalized Parity Games. Vol. 4423,
Springer, 2007, pp. 153–67, doi:10.1007/978-3-540-71389-0_12.
short: K. Chatterjee, T.A. Henzinger, N. Piterman, in:, Springer, 2007, pp. 153–167.
conference:
name: 'FoSSaCS: Foundations of Software Science and Computation Structures'
date_created: 2018-12-11T12:05:41Z
date_published: 2007-03-09T00:00:00Z
date_updated: 2021-01-12T07:52:56Z
day: '09'
doi: 10.1007/978-3-540-71389-0_12
extern: 1
intvolume: ' 4423'
month: '03'
page: 153 - 167
publication_status: published
publisher: Springer
publist_id: '2287'
quality_controlled: 0
status: public
title: Generalized parity games
type: conference
volume: 4423
year: '2007'
...
---
_id: '3884'
abstract:
- lang: eng
text: We introduce strategy logic, a logic that treats strategies in two-player
games as explicit first-order objects. The explicit treatment of strategies allows
us to specify properties of nonzero-sum games in a simple and natural way. We
show that the one-alternation fragment of strategy logic is strong enough to express
the existence of Nash equilibria and secure equilibria, and subsumes other logics
that were introduced to reason about games, such as ATL, ATL*, and game logic.
We show that strategy logic is decidable, by constructing tree automata that recognize
sets of strategies. While for the general logic, our decision procedure is nonelementary,
for the simple fragment that is used above we show that the complexity is polynomial
in the size of the game graph and optimal in the size of the formula (ranging
from polynomial to 2EXPTIME depending on the form of the formula).
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: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Nir
full_name: Piterman, Nir
last_name: Piterman
citation:
ama: 'Chatterjee K, Henzinger TA, Piterman N. Strategy logic. In: Vol 4703. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2007:59-73. doi:10.1007/978-3-540-74407-8_5'
apa: 'Chatterjee, K., Henzinger, T. A., & Piterman, N. (2007). Strategy logic
(Vol. 4703, pp. 59–73). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-74407-8_5'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Strategy
Logic,” 4703:59–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007. https://doi.org/10.1007/978-3-540-74407-8_5.
ieee: 'K. Chatterjee, T. A. Henzinger, and N. Piterman, “Strategy logic,” presented
at the CONCUR: Concurrency Theory, 2007, vol. 4703, pp. 59–73.'
ista: 'Chatterjee K, Henzinger TA, Piterman N. 2007. Strategy logic. CONCUR: Concurrency
Theory, LNCS, vol. 4703, 59–73.'
mla: Chatterjee, Krishnendu, et al. Strategy Logic. Vol. 4703, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2007, pp. 59–73, doi:10.1007/978-3-540-74407-8_5.
short: K. Chatterjee, T.A. Henzinger, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2007, pp. 59–73.
conference:
name: 'CONCUR: Concurrency Theory'
date_created: 2018-12-11T12:05:41Z
date_published: 2007-09-01T00:00:00Z
date_updated: 2023-02-23T11:45:56Z
day: '01'
doi: 10.1007/978-3-540-74407-8_5
extern: 1
intvolume: ' 4703'
month: '09'
page: 59 - 73
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '2286'
quality_controlled: 0
related_material:
record:
- id: '3861'
relation: later_version
status: public
status: public
title: Strategy logic
type: conference
volume: 4703
year: '2007'
...
---
_id: '3885'
abstract:
- lang: eng
text: 'The theory of graph games with ω-regular winning conditions is the foundation
for modeling and synthesizing reactive processes. In the case of stochastic reactive
processes, the corresponding stochastic graph games have three players, two of
them (System and Environment) behaving adversarially, and the third (Uncertainty)
behaving probabilistically. We consider two problems for stochastic graph games:
the qualitative problem asks for the set of states from which a player can win
with probability 1 (almost-sure winning); and the quantitative problem asks for
the maximal probability of winning (optimal winning) from each state. We consider
ω-regular winning conditions formalized as Müller winning conditions. We present
optimal memory bounds for pure almost-sure winning and optimal winning strategies
in stochastic graph games with Müller winning conditions. We also present improved
memory bounds for randomized almost-sure winning and optimal strategies.'
acknowledgement: This research was supported in part by the the AFOSR MURI grant F49620-00-1-
0327, and the NSF grant CCR-0225610.
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
citation:
ama: 'Chatterjee K. Optimal strategy synthesis in stochastic Müller games. In: Vol
4423. Springer; 2007:138-152. doi:10.1007/978-3-540-71389-0_11'
apa: 'Chatterjee, K. (2007). Optimal strategy synthesis in stochastic Müller games
(Vol. 4423, pp. 138–152). Presented at the FoSSaCS: Foundations of Software Science
and Computation Structures, Springer. https://doi.org/10.1007/978-3-540-71389-0_11'
chicago: Chatterjee, Krishnendu. “Optimal Strategy Synthesis in Stochastic Müller
Games,” 4423:138–52. Springer, 2007. https://doi.org/10.1007/978-3-540-71389-0_11.
ieee: 'K. Chatterjee, “Optimal strategy synthesis in stochastic Müller games,” presented
at the FoSSaCS: Foundations of Software Science and Computation Structures, 2007,
vol. 4423, pp. 138–152.'
ista: 'Chatterjee K. 2007. Optimal strategy synthesis in stochastic Müller games.
FoSSaCS: Foundations of Software Science and Computation Structures, LNCS , vol.
4423, 138–152.'
mla: Chatterjee, Krishnendu. Optimal Strategy Synthesis in Stochastic Müller
Games. Vol. 4423, Springer, 2007, pp. 138–52, doi:10.1007/978-3-540-71389-0_11.
short: K. Chatterjee, in:, Springer, 2007, pp. 138–152.
conference:
name: 'FoSSaCS: Foundations of Software Science and Computation Structures'
date_created: 2018-12-11T12:05:42Z
date_published: 2007-07-02T00:00:00Z
date_updated: 2021-01-12T07:52:57Z
day: '02'
doi: 10.1007/978-3-540-71389-0_11
extern: 1
intvolume: ' 4423'
month: '07'
page: 138 - 152
publication_status: published
publisher: Springer
publist_id: '2284'
quality_controlled: 0
status: public
title: Optimal strategy synthesis in stochastic Müller games
type: conference
volume: 4423
year: '2007'
...
---
_id: '3886'
abstract:
- lang: eng
text: 'The theory of graph games with ω-regular winning conditions is the foundation
for modeling and synthesizing reactive processes. In the case of stochastic reactive
processes, the corresponding stochastic graph games have three players, two of
them (System and Environment) behaving adversarially, and the third (Uncertainty)
behaving probabilistically. We consider two problems for stochastic graph games:
the qualitative problem asks for the set of states from which a player can win
with probability 1 (almost-sure winning); and the quantitative problem asks for
the maximal probability of winning (optimal winning) from each state. We consider
ω-regular winning conditions formalized as Müller winning conditions. We show
that both the qualitative and quantitative problem for stochastic Müller games
are PSPACE-complete. We also consider two well-known sub-classes of Müller objectives,
namely, upward-closed and union-closed objectives, and show that both the qualitative
and quantitative problem for these sub-classes are coNP-complete.'
acknowledgement: This research was supported in part by the the AFOSR MURI grant F49620-00-1-
0327, and the NSF grant CCR-0225610.
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
citation:
ama: 'Chatterjee K. Stochastic Müller games are PSPACE-complete. In: Vol 4855. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2007:436-448. doi:10.1007/978-3-540-77050-3_36'
apa: 'Chatterjee, K. (2007). Stochastic Müller games are PSPACE-complete (Vol. 4855,
pp. 436–448). Presented at the FSTTCS: Foundations of Software Technology and
Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.1007/978-3-540-77050-3_36'
chicago: Chatterjee, Krishnendu. “Stochastic Müller Games Are PSPACE-Complete,”
4855:436–48. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007. https://doi.org/10.1007/978-3-540-77050-3_36.
ieee: 'K. Chatterjee, “Stochastic Müller games are PSPACE-complete,” presented at
the FSTTCS: Foundations of Software Technology and Theoretical Computer Science,
2007, vol. 4855, pp. 436–448.'
ista: 'Chatterjee K. 2007. Stochastic Müller games are PSPACE-complete. FSTTCS:
Foundations of Software Technology and Theoretical Computer Science, LNCS, vol.
4855, 436–448.'
mla: Chatterjee, Krishnendu. Stochastic Müller Games Are PSPACE-Complete.
Vol. 4855, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007, pp. 436–48,
doi:10.1007/978-3-540-77050-3_36.
short: K. Chatterjee, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007,
pp. 436–448.
conference:
name: 'FSTTCS: Foundations of Software Technology and Theoretical Computer Science'
date_created: 2018-12-11T12:05:42Z
date_published: 2007-12-15T00:00:00Z
date_updated: 2021-01-12T07:52:57Z
day: '15'
doi: 10.1007/978-3-540-77050-3_36
extern: 1
intvolume: ' 4855'
month: '12'
page: 436 - 448
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '2282'
quality_controlled: 0
status: public
title: Stochastic Müller games are PSPACE-complete
type: conference
volume: 4855
year: '2007'
...
---
_id: '3887'
abstract:
- lang: eng
text: We consider Markov decision processes (MDPs) with multiple long-run average
objectives. Such MDPs occur in design problems where one wishes to simultaneously
optimize several criteria, for example, latency and power. The possible trade-offs
between the different objectives are characterized by the Pareto curve. We show
that every Pareto optimal point can be epsilon-approximated by a memoryless strategy,
for all epsilon > 0. In contrast to the single-objective case, the memoryless
strategy may require randomization. We show that the Pareto curve can be approximated
(a) in polynomial time in the size of the MDP for irreducible MDPs; and (b) in
polynomial space in the size of the MDP for all MDPs. Additionally, we study the
problem if a given value vector is realizable by any strategy, and show that it
can be decided in polynomial time for irreducible MDPs and in NP for all MDPs.
These results provide algorithms for design exploration in MDP models with multiple
long-run average objectives.
acknowledgement: This research was supported by the NSF grants CCR-0225610 and CCR-0234690
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
citation:
ama: 'Chatterjee K. Markov decision processes with multiple long-run average objectives.
In: Vol 4855. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2007:473-484.
doi:10.1007/978-3-540-77050-3_39'
apa: 'Chatterjee, K. (2007). Markov decision processes with multiple long-run average
objectives (Vol. 4855, pp. 473–484). Presented at the FSTTCS: Foundations of Software
Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.1007/978-3-540-77050-3_39'
chicago: Chatterjee, Krishnendu. “Markov Decision Processes with Multiple Long-Run
Average Objectives,” 4855:473–84. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2007. https://doi.org/10.1007/978-3-540-77050-3_39.
ieee: 'K. Chatterjee, “Markov decision processes with multiple long-run average
objectives,” presented at the FSTTCS: Foundations of Software Technology and Theoretical
Computer Science, 2007, vol. 4855, pp. 473–484.'
ista: 'Chatterjee K. 2007. Markov decision processes with multiple long-run average
objectives. FSTTCS: Foundations of Software Technology and Theoretical Computer
Science, LNCS , vol. 4855, 473–484.'
mla: Chatterjee, Krishnendu. Markov Decision Processes with Multiple Long-Run
Average Objectives. Vol. 4855, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2007, pp. 473–84, doi:10.1007/978-3-540-77050-3_39.
short: K. Chatterjee, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007,
pp. 473–484.
conference:
name: 'FSTTCS: Foundations of Software Technology and Theoretical Computer Science'
date_created: 2018-12-11T12:05:42Z
date_published: 2007-11-27T00:00:00Z
date_updated: 2021-01-12T07:52:58Z
day: '27'
doi: 10.1007/978-3-540-77050-3_39
extern: 1
intvolume: ' 4855'
month: '11'
page: 473 - 484
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '2283'
quality_controlled: 0
status: public
title: Markov decision processes with multiple long-run average objectives
type: conference
volume: 4855
year: '2007'
...
---
_id: '3909'
abstract:
- lang: eng
text: Social insect colonies have evolved collective immune defences against parasites.
These ‘social immune systems’ result from the cooperation of the individual group
members to combat the increased risk of disease transmission that arises from
sociality and group living. In this review we illustrate the pathways that parasites
can take to infect a social insect colony and use these pathways as a framework
to predict colony defence mechanisms and present the existing evidence. We find
that the collective defences can be both prophylactic and activated on demand
and consist of behavioural, physiological and organisational adaptations of the
colony that prevent parasite entrance, establishment and spread. We discuss the
regulation of collective immunity, which requires complex integration of information
about both the parasites and the internal status of the insect colony. Our review
concludes with an examination of the evolution of social immunity, which is based
on the consequences of selection at both the individual and the colony level.
author:
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
- first_name: Sophie
full_name: Armitage, Sophie
last_name: Armitage
- first_name: Paul
full_name: Schmid Hempel, Paul
last_name: Schmid Hempel
citation:
ama: Cremer S, Armitage S, Schmid Hempel P. Social immunity. Current Biology.
2007;17(16):R693-R702. doi:10.1016/j.cub.2007.06.008
apa: Cremer, S., Armitage, S., & Schmid Hempel, P. (2007). Social immunity.
Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2007.06.008
chicago: Cremer, Sylvia, Sophie Armitage, and Paul Schmid Hempel. “Social Immunity.”
Current Biology. Cell Press, 2007. https://doi.org/10.1016/j.cub.2007.06.008.
ieee: S. Cremer, S. Armitage, and P. Schmid Hempel, “Social immunity,” Current
Biology, vol. 17, no. 16. Cell Press, pp. R693–R702, 2007.
ista: Cremer S, Armitage S, Schmid Hempel P. 2007. Social immunity. Current Biology.
17(16), R693–R702.
mla: Cremer, Sylvia, et al. “Social Immunity.” Current Biology, vol. 17,
no. 16, Cell Press, 2007, pp. R693–702, doi:10.1016/j.cub.2007.06.008.
short: S. Cremer, S. Armitage, P. Schmid Hempel, Current Biology 17 (2007) R693–R702.
date_created: 2018-12-11T12:05:50Z
date_published: 2007-08-21T00:00:00Z
date_updated: 2021-01-12T07:53:07Z
day: '21'
doi: 10.1016/j.cub.2007.06.008
extern: '1'
intvolume: ' 17'
issue: '16'
language:
- iso: eng
month: '08'
oa_version: None
page: R693 - R702
publication: Current Biology
publication_status: published
publisher: Cell Press
publist_id: '2243'
status: public
title: Social immunity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2007'
...
---
_id: '3910'
author:
- first_name: David
full_name: Hughes, David
last_name: Hughes
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: Hughes D, Cremer S. Plasticity in anti-parasite behaviours and its suggested
role in invasion biology. Animal Behaviour. 2007;74(5):1593-1599. doi:10.1016/j.anbehav.2006.12.025
apa: Hughes, D., & Cremer, S. (2007). Plasticity in anti-parasite behaviours
and its suggested role in invasion biology. Animal Behaviour. Elsevier.
https://doi.org/10.1016/j.anbehav.2006.12.025
chicago: Hughes, David, and Sylvia Cremer. “Plasticity in Anti-Parasite Behaviours
and Its Suggested Role in Invasion Biology.” Animal Behaviour. Elsevier,
2007. https://doi.org/10.1016/j.anbehav.2006.12.025.
ieee: D. Hughes and S. Cremer, “Plasticity in anti-parasite behaviours and its suggested
role in invasion biology,” Animal Behaviour, vol. 74, no. 5. Elsevier,
pp. 1593–1599, 2007.
ista: Hughes D, Cremer S. 2007. Plasticity in anti-parasite behaviours and its suggested
role in invasion biology. Animal Behaviour. 74(5), 1593–1599.
mla: Hughes, David, and Sylvia Cremer. “Plasticity in Anti-Parasite Behaviours and
Its Suggested Role in Invasion Biology.” Animal Behaviour, vol. 74, no.
5, Elsevier, 2007, pp. 1593–99, doi:10.1016/j.anbehav.2006.12.025.
short: D. Hughes, S. Cremer, Animal Behaviour 74 (2007) 1593–1599.
date_created: 2018-12-11T12:05:50Z
date_published: 2007-11-01T00:00:00Z
date_updated: 2021-01-12T07:53:08Z
day: '01'
doi: 10.1016/j.anbehav.2006.12.025
extern: '1'
intvolume: ' 74'
issue: '5'
language:
- iso: eng
month: '11'
oa_version: None
page: 1593 - 1599
publication: Animal Behaviour
publication_status: published
publisher: Elsevier
publist_id: '2244'
status: public
title: Plasticity in anti-parasite behaviours and its suggested role in invasion biology
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 74
year: '2007'
...
---
_id: '3911'
abstract:
- lang: eng
text: Life in a social group increases the risk of disease transmission. To counteract
this threat, social insects have evolved manifold antiparasite defenses, ranging
from social exclusion of infected group members to intensive care. It is generally
assumed that individuals performing hygienic behaviors risk infecting themselves,
suggesting a high direct cost of helping. Our work instead indicates the opposite
for garden ants. Social contact with individual workers, which were experimentally
exposed to a fungal parasite, provided a clear survival benefit to nontreated,
naive group members upon later challenge with the same parasite. This first demonstration
of contact immunity in Social Hymenoptera and complementary results from other
animal groups and plants suggest its general importance in both antiparasite and
antiherbivore defense. In addition to this physiological prophylaxis of adult
ants, infection of the brood was prevented in our experiment by behavioral changes
of treated and naive workers. Parasite-treated ants stayed away from the brood
chamber, whereas their naive nestmates increased brood-care activities. Our findings
reveal a direct benefit for individuals to perform hygienic behaviors toward others,
and this might explain the widely observed maintenance of social cohesion under
parasite attack in insect societies.
author:
- first_name: Line V
full_name: Ugelvig, Line V
id: 3DC97C8E-F248-11E8-B48F-1D18A9856A87
last_name: Ugelvig
orcid: 0000-0003-1832-8883
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: 'Ugelvig LV, Cremer S. Social prophylaxis: group interaction promotes collective
immunity in ant colonies. Current Biology. 2007;17(22):1967-1971. doi:10.1016/j.cub.2007.10.029'
apa: 'Ugelvig, L. V., & Cremer, S. (2007). Social prophylaxis: group interaction
promotes collective immunity in ant colonies. Current Biology. Cell Press.
https://doi.org/10.1016/j.cub.2007.10.029'
chicago: 'Ugelvig, Line V, and Sylvia Cremer. “Social Prophylaxis: Group Interaction
Promotes Collective Immunity in Ant Colonies.” Current Biology. Cell Press,
2007. https://doi.org/10.1016/j.cub.2007.10.029.'
ieee: 'L. V. Ugelvig and S. Cremer, “Social prophylaxis: group interaction promotes
collective immunity in ant colonies,” Current Biology, vol. 17, no. 22.
Cell Press, pp. 1967–1971, 2007.'
ista: 'Ugelvig LV, Cremer S. 2007. Social prophylaxis: group interaction promotes
collective immunity in ant colonies. Current Biology. 17(22), 1967–1971.'
mla: 'Ugelvig, Line V., and Sylvia Cremer. “Social Prophylaxis: Group Interaction
Promotes Collective Immunity in Ant Colonies.” Current Biology, vol. 17,
no. 22, Cell Press, 2007, pp. 1967–71, doi:10.1016/j.cub.2007.10.029.'
short: L.V. Ugelvig, S. Cremer, Current Biology 17 (2007) 1967–1971.
date_created: 2018-12-11T12:05:51Z
date_published: 2007-11-20T00:00:00Z
date_updated: 2021-01-12T07:53:08Z
day: '20'
doi: 10.1016/j.cub.2007.10.029
extern: '1'
intvolume: ' 17'
issue: '22'
language:
- iso: eng
month: '11'
oa_version: None
page: 1967 - 1971
publication: Current Biology
publication_status: published
publisher: Cell Press
publist_id: '2245'
status: public
title: 'Social prophylaxis: group interaction promotes collective immunity in ant
colonies'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2007'
...
---
_id: '3937'
abstract:
- lang: eng
text: Lymphocyte motility in lymph nodes is regulated by chemokines, but the contribution
of integrins to this motility remains obscure. Here we examined lymphocyte migration
over CCR7-binding chemokines that 'decorate' lymph node stroma. In a shear-free
environment, surface-bound lymph node chemokines but not their soluble counterparts
promoted robust and sustained T lymphocyte motility. The chemokine CCL21 induced
compartmentalized clustering of the integrins LFA-1 and VLA-4 in motile lymphocytes,
but both integrins remained nonadhesive to ligands on lymphocytes, dendritic cells
and stroma. The application of shear stress to lymphocytes interacting with CCL21
and integrin ligands promoted robust integrin-mediated adhesion. Thus, lymph node
chemokines that promote motility and strongly activate lymphocyte integrins under
shear forces fail to stimulate stable integrin adhesiveness in extravascular shear-free
environments.
author:
- first_name: Eilon
full_name: Woolf, Eilon
last_name: Woolf
- first_name: Irina
full_name: Grigorova, Irina
last_name: Grigorova
- first_name: Adi
full_name: Sagiv, Adi
last_name: Sagiv
- first_name: Valentin
full_name: Grabovsky, Valentin
last_name: Grabovsky
- first_name: Sara
full_name: Feigelson, Sara W
last_name: Feigelson
- first_name: Ziv
full_name: Shulman, Ziv
last_name: Shulman
- first_name: Tanja
full_name: Hartmann, Tanja
last_name: Hartmann
- first_name: Michael K
full_name: Michael Sixt
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Jason
full_name: Cyster, Jason G
last_name: Cyster
- first_name: Ronen
full_name: Alon, Ronen
last_name: Alon
citation:
ama: Woolf E, Grigorova I, Sagiv A, et al. Lymph node chemokines promote sustained
T lymphocyte motility without triggering stable integrin adhesiveness in the absence
of shear forces. Nature Immunology. 2007;8(10):1076-1085. doi:10.1038/ni1499
apa: Woolf, E., Grigorova, I., Sagiv, A., Grabovsky, V., Feigelson, S., Shulman,
Z., … Alon, R. (2007). Lymph node chemokines promote sustained T lymphocyte motility
without triggering stable integrin adhesiveness in the absence of shear forces.
Nature Immunology. Nature Publishing Group. https://doi.org/10.1038/ni1499
chicago: Woolf, Eilon, Irina Grigorova, Adi Sagiv, Valentin Grabovsky, Sara Feigelson,
Ziv Shulman, Tanja Hartmann, Michael K Sixt, Jason Cyster, and Ronen Alon. “Lymph
Node Chemokines Promote Sustained T Lymphocyte Motility without Triggering Stable
Integrin Adhesiveness in the Absence of Shear Forces.” Nature Immunology.
Nature Publishing Group, 2007. https://doi.org/10.1038/ni1499.
ieee: E. Woolf et al., “Lymph node chemokines promote sustained T lymphocyte
motility without triggering stable integrin adhesiveness in the absence of shear
forces,” Nature Immunology, vol. 8, no. 10. Nature Publishing Group, pp.
1076–1085, 2007.
ista: Woolf E, Grigorova I, Sagiv A, Grabovsky V, Feigelson S, Shulman Z, Hartmann
T, Sixt MK, Cyster J, Alon R. 2007. Lymph node chemokines promote sustained T
lymphocyte motility without triggering stable integrin adhesiveness in the absence
of shear forces. Nature Immunology. 8(10), 1076–1085.
mla: Woolf, Eilon, et al. “Lymph Node Chemokines Promote Sustained T Lymphocyte
Motility without Triggering Stable Integrin Adhesiveness in the Absence of Shear
Forces.” Nature Immunology, vol. 8, no. 10, Nature Publishing Group, 2007,
pp. 1076–85, doi:10.1038/ni1499.
short: E. Woolf, I. Grigorova, A. Sagiv, V. Grabovsky, S. Feigelson, Z. Shulman,
T. Hartmann, M.K. Sixt, J. Cyster, R. Alon, Nature Immunology 8 (2007) 1076–1085.
date_created: 2018-12-11T12:05:59Z
date_published: 2007-08-26T00:00:00Z
date_updated: 2021-01-12T07:53:19Z
day: '26'
doi: 10.1038/ni1499
extern: 1
intvolume: ' 8'
issue: '10'
month: '08'
page: 1076 - 1085
publication: Nature Immunology
publication_status: published
publisher: Nature Publishing Group
publist_id: '2189'
quality_controlled: 0
status: public
title: Lymph node chemokines promote sustained T lymphocyte motility without triggering
stable integrin adhesiveness in the absence of shear forces
type: journal_article
volume: 8
year: '2007'
...
---
_id: '3938'
abstract:
- lang: eng
text: RhoH is a small GTPase expressed only in the hematopoietic system. With the
use of mice with targeted disruption of the RhoH gene, we demonstrated that RhoH
is crucial for thymocyte maturation during DN3 to DN4 transition and during positive
selection. Furthermore, the differentiation and expansion of DN3 and DN4 thymocytes
in vitro were severely impaired. These defects corresponded to defective TCR signaling.
Although RhoH is not required for TCR-induced activation of ZAP70 and ZAP70-mediated
activation of p38, it is crucial for the tyrosine phosphorylation of LAT, PLCgamma1,
and Vav1 and for the activation of Erk and calcium influx. These data suggest
that RhoH is important for pre-TCR and TCR signaling because it allows the efficient
interaction of ZAP70 with the LAT signalosome, thus regulating thymocyte development.
author:
- first_name: Tatjana
full_name: Dorn, Tatjana
last_name: Dorn
- first_name: Ursula
full_name: Kuhn, Ursula
last_name: Kuhn
- first_name: Gerd
full_name: Bungartz, Gerd
last_name: Bungartz
- first_name: Sebastian
full_name: Stiller, Sebastian
last_name: Stiller
- first_name: Martina
full_name: Bauer, Martina
last_name: Bauer
- first_name: Joachim
full_name: Ellwart, Joachim
last_name: Ellwart
- first_name: Thorsten
full_name: Peters, Thorsten
last_name: Peters
- first_name: Karin
full_name: Scharffetter-Kochanek, Karin
last_name: Scharffetter Kochanek
- first_name: Monika
full_name: Semmrich, Monika
last_name: Semmrich
- first_name: Melanie
full_name: Laschinger, Melanie
last_name: Laschinger
- first_name: Bernhard
full_name: Holzmann, Bernhard
last_name: Holzmann
- first_name: Wolfgang
full_name: Klinkert, Wolfgang E
last_name: Klinkert
- first_name: Per
full_name: Straten, Per Thor
last_name: Straten
- first_name: Tania
full_name: Køllgaard, Tania
last_name: Køllgaard
- first_name: Michael K
full_name: Michael Sixt
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Cord
full_name: Brakebusch, Cord
last_name: Brakebusch
citation:
ama: Dorn T, Kuhn U, Bungartz G, et al. RhoH is important for positive thymocyte
selection and T-cell receptor signaling. Blood. 2007;109(6):2346-2355.
doi:10.1182/blood-2006-04-019034
apa: Dorn, T., Kuhn, U., Bungartz, G., Stiller, S., Bauer, M., Ellwart, J., … Brakebusch,
C. (2007). RhoH is important for positive thymocyte selection and T-cell receptor
signaling. Blood. American Society of Hematology. https://doi.org/10.1182/blood-2006-04-019034
chicago: Dorn, Tatjana, Ursula Kuhn, Gerd Bungartz, Sebastian Stiller, Martina Bauer,
Joachim Ellwart, Thorsten Peters, et al. “RhoH Is Important for Positive Thymocyte
Selection and T-Cell Receptor Signaling.” Blood. American Society of Hematology,
2007. https://doi.org/10.1182/blood-2006-04-019034.
ieee: T. Dorn et al., “RhoH is important for positive thymocyte selection
and T-cell receptor signaling,” Blood, vol. 109, no. 6. American Society
of Hematology, pp. 2346–2355, 2007.
ista: Dorn T, Kuhn U, Bungartz G, Stiller S, Bauer M, Ellwart J, Peters T, Scharffetter
Kochanek K, Semmrich M, Laschinger M, Holzmann B, Klinkert W, Straten P, Køllgaard
T, Sixt MK, Brakebusch C. 2007. RhoH is important for positive thymocyte selection
and T-cell receptor signaling. Blood. 109(6), 2346–2355.
mla: Dorn, Tatjana, et al. “RhoH Is Important for Positive Thymocyte Selection and
T-Cell Receptor Signaling.” Blood, vol. 109, no. 6, American Society of
Hematology, 2007, pp. 2346–55, doi:10.1182/blood-2006-04-019034.
short: T. Dorn, U. Kuhn, G. Bungartz, S. Stiller, M. Bauer, J. Ellwart, T. Peters,
K. Scharffetter Kochanek, M. Semmrich, M. Laschinger, B. Holzmann, W. Klinkert,
P. Straten, T. Køllgaard, M.K. Sixt, C. Brakebusch, Blood 109 (2007) 2346–2355.
date_created: 2018-12-11T12:05:59Z
date_published: 2007-03-15T00:00:00Z
date_updated: 2021-01-12T07:53:19Z
day: '15'
doi: 10.1182/blood-2006-04-019034
extern: 1
intvolume: ' 109'
issue: '6'
month: '03'
page: 2346 - 2355
publication: Blood
publication_status: published
publisher: American Society of Hematology
publist_id: '2190'
quality_controlled: 0
status: public
title: RhoH is important for positive thymocyte selection and T-cell receptor signaling
type: journal_article
volume: 109
year: '2007'
...
---
_id: '3972'
abstract:
- lang: eng
text: 'The persistence diagram of a real-valued function on a topological space
is a multiset of points in the extended plane. We prove that under mild assumptions
on the function, the persistence diagram is stable: small changes in the function
imply only small changes in the diagram. We apply this result to estimating the
homology of sets in a metric space and to comparing and classifying geometric
shapes.'
author:
- first_name: David
full_name: Cohen-Steiner, David
last_name: Cohen Steiner
- 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
citation:
ama: Cohen Steiner D, Edelsbrunner H, Harer J. Stability of persistence diagrams.
Discrete & Computational Geometry. 2007;37(1):103-120. doi:10.1007/s00454-006-1276-5
apa: Cohen Steiner, D., Edelsbrunner, H., & Harer, J. (2007). Stability of persistence
diagrams. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-006-1276-5
chicago: Cohen Steiner, David, Herbert Edelsbrunner, and John Harer. “Stability
of Persistence Diagrams.” Discrete & Computational Geometry. Springer,
2007. https://doi.org/10.1007/s00454-006-1276-5.
ieee: D. Cohen Steiner, H. Edelsbrunner, and J. Harer, “Stability of persistence
diagrams,” Discrete & Computational Geometry, vol. 37, no. 1. Springer,
pp. 103–120, 2007.
ista: Cohen Steiner D, Edelsbrunner H, Harer J. 2007. Stability of persistence diagrams.
Discrete & Computational Geometry. 37(1), 103–120.
mla: Cohen Steiner, David, et al. “Stability of Persistence Diagrams.” Discrete
& Computational Geometry, vol. 37, no. 1, Springer, 2007, pp. 103–20,
doi:10.1007/s00454-006-1276-5.
short: D. Cohen Steiner, H. Edelsbrunner, J. Harer, Discrete & Computational
Geometry 37 (2007) 103–120.
date_created: 2018-12-11T12:06:12Z
date_published: 2007-01-01T00:00:00Z
date_updated: 2021-01-12T07:53:34Z
day: '01'
doi: 10.1007/s00454-006-1276-5
extern: 1
intvolume: ' 37'
issue: '1'
month: '01'
page: 103 - 120
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '2153'
quality_controlled: 0
status: public
title: Stability of persistence diagrams
type: journal_article
volume: 37
year: '2007'
...
---
_id: '3973'
abstract:
- lang: eng
text: In this paper we bound the difference between the total mean curvatures of
two closed surfaces in R-3 in terms of their total absolute curvatures and the
Frechet distance between the volumes they enclose. The proof relies on a combination
of methods from algebraic topology and integral geometry. We also bound the difference
between the lengths of two curves using the same methods.
author:
- first_name: David
full_name: Cohen-Steiner, David
last_name: Cohen Steiner
- first_name: Herbert
full_name: Herbert Edelsbrunner
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: Cohen Steiner D, Edelsbrunner H. Inequalities for the curvature of curves and
surfaces. Foundations of Computational Mathematics. 2007;7(4):391-404.
doi:10.1007/s10208-005-0200-3
apa: Cohen Steiner, D., & Edelsbrunner, H. (2007). Inequalities for the curvature
of curves and surfaces. Foundations of Computational Mathematics. Springer.
https://doi.org/10.1007/s10208-005-0200-3
chicago: Cohen Steiner, David, and Herbert Edelsbrunner. “Inequalities for the Curvature
of Curves and Surfaces.” Foundations of Computational Mathematics. Springer,
2007. https://doi.org/10.1007/s10208-005-0200-3.
ieee: D. Cohen Steiner and H. Edelsbrunner, “Inequalities for the curvature of curves
and surfaces,” Foundations of Computational Mathematics, vol. 7, no. 4.
Springer, pp. 391–404, 2007.
ista: Cohen Steiner D, Edelsbrunner H. 2007. Inequalities for the curvature of curves
and surfaces. Foundations of Computational Mathematics. 7(4), 391–404.
mla: Cohen Steiner, David, and Herbert Edelsbrunner. “Inequalities for the Curvature
of Curves and Surfaces.” Foundations of Computational Mathematics, vol.
7, no. 4, Springer, 2007, pp. 391–404, doi:10.1007/s10208-005-0200-3.
short: D. Cohen Steiner, H. Edelsbrunner, Foundations of Computational Mathematics
7 (2007) 391–404.
date_created: 2018-12-11T12:06:12Z
date_published: 2007-11-01T00:00:00Z
date_updated: 2021-01-12T07:53:34Z
day: '01'
doi: 10.1007/s10208-005-0200-3
extern: 1
intvolume: ' 7'
issue: '4'
month: '11'
page: 391 - 404
publication: Foundations of Computational Mathematics
publication_status: published
publisher: Springer
publist_id: '2154'
quality_controlled: 0
status: public
title: Inequalities for the curvature of curves and surfaces
type: journal_article
volume: 7
year: '2007'
...
---
_id: '3975'
abstract:
- lang: eng
text: We study the reconstruction of a stratified space from a possibly noisy point
sample. Specifically, we use the vineyard of the distance function restricted
to a I-parameter family of neighborhoods of a point to assess the local homology
of the stratified space at that point. We prove the correctness of this assessment
under the assumption of a sufficiently dense sample. We also give an algorithm
that constructs the vineyard and makes the local assessment in time at most cubic
in the size of the Delaunay triangulation of the point sample.
author:
- first_name: Paul
full_name: Paul Bendich
id: 43F6EC54-F248-11E8-B48F-1D18A9856A87
last_name: Bendich
- first_name: David
full_name: Cohen-Steiner, David
last_name: Cohen Steiner
- 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: Dmitriy
full_name: Morozov, Dmitriy
last_name: Morozov
citation:
ama: 'Bendich P, Cohen Steiner D, Edelsbrunner H, Harer J, Morozov D. Inferring
local homology from sampled stratified spaces. In: IEEE; 2007:536-546. doi:10.1109/FOCS.2007.33'
apa: 'Bendich, P., Cohen Steiner, D., Edelsbrunner, H., Harer, J., & Morozov,
D. (2007). Inferring local homology from sampled stratified spaces (pp. 536–546).
Presented at the FOCS: Foundations of Computer Science, IEEE. https://doi.org/10.1109/FOCS.2007.33'
chicago: Bendich, Paul, David Cohen Steiner, Herbert Edelsbrunner, John Harer, and
Dmitriy Morozov. “Inferring Local Homology from Sampled Stratified Spaces,” 536–46.
IEEE, 2007. https://doi.org/10.1109/FOCS.2007.33.
ieee: 'P. Bendich, D. Cohen Steiner, H. Edelsbrunner, J. Harer, and D. Morozov,
“Inferring local homology from sampled stratified spaces,” presented at the FOCS:
Foundations of Computer Science, 2007, pp. 536–546.'
ista: 'Bendich P, Cohen Steiner D, Edelsbrunner H, Harer J, Morozov D. 2007. Inferring
local homology from sampled stratified spaces. FOCS: Foundations of Computer Science,
536–546.'
mla: Bendich, Paul, et al. Inferring Local Homology from Sampled Stratified Spaces.
IEEE, 2007, pp. 536–46, doi:10.1109/FOCS.2007.33.
short: P. Bendich, D. Cohen Steiner, H. Edelsbrunner, J. Harer, D. Morozov, in:,
IEEE, 2007, pp. 536–546.
conference:
name: 'FOCS: Foundations of Computer Science'
date_created: 2018-12-11T12:06:13Z
date_published: 2007-01-01T00:00:00Z
date_updated: 2021-01-12T07:53:35Z
day: '01'
doi: 10.1109/FOCS.2007.33
extern: 1
month: '01'
page: 536 - 546
publication_status: published
publisher: IEEE
publist_id: '2150'
quality_controlled: 0
status: public
title: Inferring local homology from sampled stratified spaces
type: conference
year: '2007'
...
---
_id: '3976'
abstract:
- lang: eng
text: Herein, we study the interfaces of a set of 146 transient protein-protein
interfaces in order to better understand the principles of their interactions.
We define and generate the protein interface using tools from computational geometry
and topology and then apply statistical analysis to its residue composition. In
addition to counting individual occurrences, we evaluate pairing preferences,
both across and as neighbors on one side of an interface. Likelihood correction
emphasizes novel and unexpected pairs, such as the His-Cys pair found in most
complexes of serine proteases with their diverse inhibitors and the Met-Met neighbor
pair found in unrelated protein interfaces. We also present a visualization of
the protein interface that allows for facile identification of residue-residue
contacts and other biochemical properties.
author:
- first_name: Jeffrey
full_name: Headd, Jeffrey J
last_name: Headd
- first_name: Y E Andrew
full_name: Ban, Y E Andrew
last_name: Ban
- first_name: Paul
full_name: Brown, Paul
last_name: Brown
- first_name: Herbert
full_name: Herbert Edelsbrunner
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Madhuwanti
full_name: Vaidya, Madhuwanti
last_name: Vaidya
- first_name: Johannes
full_name: Rudolph, Johannes
last_name: Rudolph
citation:
ama: 'Headd J, Ban YEA, Brown P, Edelsbrunner H, Vaidya M, Rudolph J. Protein-protein
interfaces: Properties, preferences, and projections. Journal of Proteome Research.
2007;6(7):2576-2586. doi:10.1021/pr070018+'
apa: 'Headd, J., Ban, Y. E. A., Brown, P., Edelsbrunner, H., Vaidya, M., & Rudolph,
J. (2007). Protein-protein interfaces: Properties, preferences, and projections.
Journal of Proteome Research. American Chemical Society. https://doi.org/10.1021/pr070018+'
chicago: 'Headd, Jeffrey, Y E Andrew Ban, Paul Brown, Herbert Edelsbrunner, Madhuwanti
Vaidya, and Johannes Rudolph. “Protein-Protein Interfaces: Properties, Preferences,
and Projections.” Journal of Proteome Research. American Chemical Society,
2007. https://doi.org/10.1021/pr070018+.'
ieee: 'J. Headd, Y. E. A. Ban, P. Brown, H. Edelsbrunner, M. Vaidya, and J. Rudolph,
“Protein-protein interfaces: Properties, preferences, and projections,” Journal
of Proteome Research, vol. 6, no. 7. American Chemical Society, pp. 2576–2586,
2007.'
ista: 'Headd J, Ban YEA, Brown P, Edelsbrunner H, Vaidya M, Rudolph J. 2007. Protein-protein
interfaces: Properties, preferences, and projections. Journal of Proteome Research.
6(7), 2576–2586.'
mla: 'Headd, Jeffrey, et al. “Protein-Protein Interfaces: Properties, Preferences,
and Projections.” Journal of Proteome Research, vol. 6, no. 7, American
Chemical Society, 2007, pp. 2576–86, doi:10.1021/pr070018+.'
short: J. Headd, Y.E.A. Ban, P. Brown, H. Edelsbrunner, M. Vaidya, J. Rudolph, Journal
of Proteome Research 6 (2007) 2576–2586.
date_created: 2018-12-11T12:06:13Z
date_published: 2007-06-02T00:00:00Z
date_updated: 2021-01-12T07:53:36Z
day: '02'
doi: 10.1021/pr070018+
extern: 1
intvolume: ' 6'
issue: '7'
month: '06'
page: 2576 - 2586
publication: Journal of Proteome Research
publication_status: published
publisher: American Chemical Society
publist_id: '2151'
quality_controlled: 0
status: public
title: 'Protein-protein interfaces: Properties, preferences, and projections'
type: journal_article
volume: 6
year: '2007'
...
---
_id: '3977'
abstract:
- lang: eng
text: Using inclusion-exclusion, we can write the indicator function of a union
of finitely many balls as an alternating sum of indicator functions of common
intersections of balls. We exhibit abstract simplicial complexes that correspond
to minimal inclusion-exclusion formulas. They include the dual complex, as defined
in [3], and are characterized by the independence of their simplices and by geometric
realizations with the same underlying space as the dual complex.
author:
- first_name: Dominique
full_name: Attali, Dominique
last_name: Attali
- first_name: Herbert
full_name: Herbert Edelsbrunner
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: Attali D, Edelsbrunner H. Inclusion-exclusion formulas from independent complexes.
Discrete & Computational Geometry. 2007;37(1):59-77. doi:10.1007/s00454-006-1274-7
apa: Attali, D., & Edelsbrunner, H. (2007). Inclusion-exclusion formulas from
independent complexes. Discrete & Computational Geometry. Springer.
https://doi.org/10.1007/s00454-006-1274-7
chicago: Attali, Dominique, and Herbert Edelsbrunner. “Inclusion-Exclusion Formulas
from Independent Complexes.” Discrete & Computational Geometry. Springer,
2007. https://doi.org/10.1007/s00454-006-1274-7.
ieee: D. Attali and H. Edelsbrunner, “Inclusion-exclusion formulas from independent
complexes,” Discrete & Computational Geometry, vol. 37, no. 1. Springer,
pp. 59–77, 2007.
ista: Attali D, Edelsbrunner H. 2007. Inclusion-exclusion formulas from independent
complexes. Discrete & Computational Geometry. 37(1), 59–77.
mla: Attali, Dominique, and Herbert Edelsbrunner. “Inclusion-Exclusion Formulas
from Independent Complexes.” Discrete & Computational Geometry, vol.
37, no. 1, Springer, 2007, pp. 59–77, doi:10.1007/s00454-006-1274-7.
short: D. Attali, H. Edelsbrunner, Discrete & Computational Geometry 37 (2007)
59–77.
date_created: 2018-12-11T12:06:14Z
date_published: 2007-01-01T00:00:00Z
date_updated: 2021-01-12T07:53:36Z
day: '01'
doi: 10.1007/s00454-006-1274-7
extern: 1
intvolume: ' 37'
issue: '1'
month: '01'
page: 59 - 77
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '2152'
quality_controlled: 0
status: public
title: Inclusion-exclusion formulas from independent complexes
type: journal_article
volume: 37
year: '2007'
...
---
_id: '3981'
abstract:
- lang: eng
text: Building on the work of Martinetz, Schulten and de Silva, Carlsson, we introduce
a 2-parameter family of witness complexes and algorithms for constructing them.
This family can be used to determine the gross topology of point cloud data in
R-d or other metric spaces. The 2-parameter family is sensitive to differences
in sampling density and thus amenable to detecting patterns within the data set.
It also lends itself to theoretical analysis. For example, we can prove that in
the limit, when the witnesses cover the entire domain, witness complexes in the
family that share the first, scale parameter have the same homotopy type.
acknowledgement: Research by the authors is partially supported by DARPA under grant
HR0011-05-1-0007, by CNRS under grant PICS-3416 and by IST Program of the EU under
Contract IST-2002-506766.
alternative_title:
- LNCS
author:
- first_name: Dominique
full_name: Attali, Dominique
last_name: Attali
- 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: Yuriy
full_name: Mileyko, Yuriy
last_name: Mileyko
citation:
ama: 'Attali D, Edelsbrunner H, Harer J, Mileyko Y. Alpha-beta witness complexes.
In: Vol 4619. Springer; 2007:386-397. doi:10.1007/978-3-540-73951-7_34'
apa: 'Attali, D., Edelsbrunner, H., Harer, J., & Mileyko, Y. (2007). Alpha-beta
witness complexes (Vol. 4619, pp. 386–397). Presented at the WADS: International
Workshop on Algrithms and Data Structures, Springer. https://doi.org/10.1007/978-3-540-73951-7_34'
chicago: Attali, Dominique, Herbert Edelsbrunner, John Harer, and Yuriy Mileyko.
“Alpha-Beta Witness Complexes,” 4619:386–97. Springer, 2007. https://doi.org/10.1007/978-3-540-73951-7_34.
ieee: 'D. Attali, H. Edelsbrunner, J. Harer, and Y. Mileyko, “Alpha-beta witness
complexes,” presented at the WADS: International Workshop on Algrithms and Data
Structures, 2007, vol. 4619, pp. 386–397.'
ista: 'Attali D, Edelsbrunner H, Harer J, Mileyko Y. 2007. Alpha-beta witness complexes.
WADS: International Workshop on Algrithms and Data Structures, LNCS, vol. 4619,
386–397.'
mla: Attali, Dominique, et al. Alpha-Beta Witness Complexes. Vol. 4619, Springer,
2007, pp. 386–97, doi:10.1007/978-3-540-73951-7_34.
short: D. Attali, H. Edelsbrunner, J. Harer, Y. Mileyko, in:, Springer, 2007, pp.
386–397.
conference:
name: 'WADS: International Workshop on Algrithms and Data Structures'
date_created: 2018-12-11T12:06:15Z
date_published: 2007-08-21T00:00:00Z
date_updated: 2021-01-12T07:53:38Z
day: '21'
doi: 10.1007/978-3-540-73951-7_34
extern: 1
intvolume: ' 4619'
month: '08'
page: 386 - 397
publication_status: published
publisher: Springer
publist_id: '2149'
quality_controlled: 0
status: public
title: Alpha-beta witness complexes
type: conference
volume: 4619
year: '2007'
...