---
_id: '3760'
abstract:
- lang: eng
text: We introduce a method for efficiently animating a wide range of deformable
materials. We combine a high resolution surface mesh with a tetrahedral finite
element simulator that makes use of frequent re-meshing. This combination allows
for fast and detailed simulations of complex elastic and plastic behavior. We
significantly expand the range of physical parameters that can be simulated with
a single technique, and the results are free from common artifacts such as volume-loss,
smoothing, popping, and the absence of thin features like strands and sheets.
Our decision to couple a high resolution surface with low-resolution physics leads
to efficient simulation and detailed surface features, and our approach to creating
the tetrahedral mesh leads to an order-of-magnitude speedup over previous techniques
in the time spent re-meshing. We compute masses, collisions, and surface tension
forces on the scale of the fine mesh, which helps avoid visual artifacts due to
the differing mesh resolutions. The result is a method that can simulate a large
array of different material behaviors with high resolution features in a short
amount of time.
article_processing_charge: No
author:
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
- first_name: Greg
full_name: Turk, Greg
last_name: Turk
citation:
ama: Wojtan C, Turk G. Fast viscoelastic behavior with thin features. ACM Transactions
on Graphics. 2008;27(3). doi:10.1145/1360612.1360646
apa: Wojtan, C., & Turk, G. (2008). Fast viscoelastic behavior with thin features.
ACM Transactions on Graphics. ACM. https://doi.org/10.1145/1360612.1360646
chicago: Wojtan, Chris, and Greg Turk. “Fast Viscoelastic Behavior with Thin Features.”
ACM Transactions on Graphics. ACM, 2008. https://doi.org/10.1145/1360612.1360646.
ieee: C. Wojtan and G. Turk, “Fast viscoelastic behavior with thin features,” ACM
Transactions on Graphics, vol. 27, no. 3. ACM, 2008.
ista: Wojtan C, Turk G. 2008. Fast viscoelastic behavior with thin features. ACM
Transactions on Graphics. 27(3).
mla: Wojtan, Chris, and Greg Turk. “Fast Viscoelastic Behavior with Thin Features.”
ACM Transactions on Graphics, vol. 27, no. 3, ACM, 2008, doi:10.1145/1360612.1360646.
short: C. Wojtan, G. Turk, ACM Transactions on Graphics 27 (2008).
date_created: 2018-12-11T12:05:01Z
date_published: 2008-08-01T00:00:00Z
date_updated: 2023-02-23T11:41:29Z
day: '01'
doi: 10.1145/1360612.1360646
extern: '1'
intvolume: ' 27'
issue: '3'
language:
- iso: eng
main_file_link:
- url: http://www.cc.gatech.edu/~turk/my_papers/fast_goop_2008.pdf
month: '08'
oa_version: None
publication: ACM Transactions on Graphics
publication_status: published
publisher: ACM
publist_id: '2467'
status: public
title: Fast viscoelastic behavior with thin features
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 27
year: '2008'
...
---
_id: '3769'
abstract:
- lang: eng
text: The geometrical representation of the space of phylogenetic trees implies
a metric on the space of weighted trees. This metric, the geodesic distance, is
the length of the shortest path through that space. We present an exact algorithm
to compute this metric. For biologically reasonable trees, the implementation
allows fast computations of the geodesic distance, although the running time of
the algorithm is worst-case exponential. The algorithm was applied to pairs of
118 gene trees of the metazoa. The results show that a special path in tree space,
the cone path, which can be computed in linear time, is a good approximation of
the geodesic distance. The program GeoMeTree is a python implementation of the
geodesic distance, and it is approximations and is available from www.cibiv.at/software/geometree.
acknowledgement: 10.1089/cmb.2008.0068
author:
- first_name: Anne
full_name: Anne Kupczok
id: 2BB22BC2-F248-11E8-B48F-1D18A9856A87
last_name: Kupczok
- first_name: Arndt
full_name: von Haeseler,Arndt
last_name: Von Haeseler
- first_name: Steffen
full_name: Klaere,Steffen
last_name: Klaere
citation:
ama: Kupczok A, Von Haeseler A, Klaere S. An Exact Algorithm for the Geodesic Distance
between Phylogenetic Trees. Journal of Computational Biology. 2008;15(6):577-591.
doi:4200
apa: Kupczok, A., Von Haeseler, A., & Klaere, S. (2008). An Exact Algorithm
for the Geodesic Distance between Phylogenetic Trees. Journal of Computational
Biology. Mary Ann Liebert. https://doi.org/4200
chicago: Kupczok, Anne, Arndt Von Haeseler, and Steffen Klaere. “An Exact Algorithm
for the Geodesic Distance between Phylogenetic Trees.” Journal of Computational
Biology. Mary Ann Liebert, 2008. https://doi.org/4200.
ieee: A. Kupczok, A. Von Haeseler, and S. Klaere, “An Exact Algorithm for the Geodesic
Distance between Phylogenetic Trees.,” Journal of Computational Biology,
vol. 15, no. 6. Mary Ann Liebert, pp. 577–591, 2008.
ista: Kupczok A, Von Haeseler A, Klaere S. 2008. An Exact Algorithm for the Geodesic
Distance between Phylogenetic Trees. Journal of Computational Biology. 15(6),
577–591.
mla: Kupczok, Anne, et al. “An Exact Algorithm for the Geodesic Distance between
Phylogenetic Trees.” Journal of Computational Biology, vol. 15, no. 6,
Mary Ann Liebert, 2008, pp. 577–91, doi:4200.
short: A. Kupczok, A. Von Haeseler, S. Klaere, Journal of Computational Biology
15 (2008) 577–591.
date_created: 2018-12-11T12:05:04Z
date_published: 2008-01-01T00:00:00Z
date_updated: 2021-01-12T07:52:04Z
day: '01'
doi: '4200'
extern: 1
intvolume: ' 15'
issue: '6'
month: '01'
page: 577 - 591
publication: Journal of Computational Biology
publication_status: published
publisher: Mary Ann Liebert
publist_id: '2458'
quality_controlled: 0
status: public
title: An Exact Algorithm for the Geodesic Distance between Phylogenetic Trees.
type: journal_article
volume: 15
year: '2008'
...
---
_id: '3822'
abstract:
- lang: eng
text: Dentate gyrus granule cells transmit action potentials (APs) along their unmyelinated
mossy fibre axons to the CA3 region. Although the initiation and propagation of
APs are fundamental steps during neural computation, little is known about the
site of AP initiation and the speed of propagation in mossy fibre axons. To address
these questions, we performed simultaneous somatic and axonal whole-cell recordings
from granule cells in acute hippocampal slices of adult mice at approximately
23 degrees C. Injection of short current pulses or synaptic stimulation evoked
axonal and somatic APs with similar amplitudes. By contrast, the time course was
significantly different, as axonal APs had a higher maximal rate of rise (464
+/- 30 V s(-1) in the axon versus 297 +/- 12 V s(-1) in the soma, mean +/- s.e.m.).
Furthermore, analysis of latencies between the axonal and somatic signals showed
that APs were initiated in the proximal axon at approximately 20-30 mum distance
from the soma, and propagated orthodromically with a velocity of 0.24 m s(-1).
Qualitatively similar results were obtained at a recording temperature of approximately
34 degrees C. Modelling of AP propagation in detailed cable models of granule
cells suggested that a approximately 4 times higher Na(+) channel density ( approximately
1000 pS mum(-2)) in the axon might account for both the higher rate of rise of
axonal APs and the robust AP initiation in the proximal mossy fibre axon. This
may be of critical importance to separate dendritic integration of thousands of
synaptic inputs from the generation and transmission of a common AP output.
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. Action potential initiation and
propagation in hippocampal mossy fibre axons. Journal of Physiology. 2008;586(7):1849-1857.
doi:10.1113/jphysiol.2007.150151
apa: Schmidt Hieber, C., Jonas, P. M., & Bischofberger, J. (2008). Action potential
initiation and propagation in hippocampal mossy fibre axons. Journal of Physiology.
Wiley-Blackwell. https://doi.org/10.1113/jphysiol.2007.150151
chicago: Schmidt Hieber, Christoph, Peter M Jonas, and Josef Bischofberger. “Action
Potential Initiation and Propagation in Hippocampal Mossy Fibre Axons.” Journal
of Physiology. Wiley-Blackwell, 2008. https://doi.org/10.1113/jphysiol.2007.150151 .
ieee: C. Schmidt Hieber, P. M. Jonas, and J. Bischofberger, “Action potential initiation
and propagation in hippocampal mossy fibre axons,” Journal of Physiology,
vol. 586, no. 7. Wiley-Blackwell, pp. 1849–57, 2008.
ista: Schmidt Hieber C, Jonas PM, Bischofberger J. 2008. Action potential initiation
and propagation in hippocampal mossy fibre axons. Journal of Physiology. 586(7),
1849–57.
mla: Schmidt Hieber, Christoph, et al. “Action Potential Initiation and Propagation
in Hippocampal Mossy Fibre Axons.” Journal of Physiology, vol. 586, no.
7, Wiley-Blackwell, 2008, pp. 1849–57, doi:10.1113/jphysiol.2007.150151 .
short: C. Schmidt Hieber, P.M. Jonas, J. Bischofberger, Journal of Physiology 586
(2008) 1849–57.
date_created: 2018-12-11T12:05:21Z
date_published: 2008-01-01T00:00:00Z
date_updated: 2021-01-12T07:52:27Z
day: '01'
doi: '10.1113/jphysiol.2007.150151 '
extern: 1
intvolume: ' 586'
issue: '7'
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2375716/
month: '01'
oa: 1
page: 1849 - 57
publication: Journal of Physiology
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2387'
quality_controlled: 0
status: public
title: Action potential initiation and propagation in hippocampal mossy fibre axons
type: journal_article
volume: 586
year: '2008'
...
---
_id: '3823'
abstract:
- lang: eng
text: Two studies in this issue of Neuron (Kwon and Castillo and Rebola et al.)
show that the mossy fiber-CA3 pyramidal neuron synapse, a hippocampal synapse
well known for its presynaptic plasticity, exhibits a novel form of long-term
potentiation of NMDAR-mediated currents, which is induced and expressed postsynaptically.
author:
- first_name: Angharad
full_name: Kerr, Angharad M
last_name: Kerr
- first_name: Peter M
full_name: Peter Jonas
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Kerr A, Jonas PM. The two sides of hippocampal mossy fiber plasticity (Review).
Neuron. 2008;57(1):5-7. doi:10.1016/j.neuron.2007.12.015
apa: Kerr, A., & Jonas, P. M. (2008). The two sides of hippocampal mossy fiber
plasticity (Review). Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2007.12.015
chicago: Kerr, Angharad, and Peter M Jonas. “The Two Sides of Hippocampal Mossy
Fiber Plasticity (Review).” Neuron. Elsevier, 2008. https://doi.org/10.1016/j.neuron.2007.12.015.
ieee: A. Kerr and P. M. Jonas, “The two sides of hippocampal mossy fiber plasticity
(Review),” Neuron, vol. 57, no. 1. Elsevier, pp. 5–7, 2008.
ista: Kerr A, Jonas PM. 2008. The two sides of hippocampal mossy fiber plasticity
(Review). Neuron. 57(1), 5–7.
mla: Kerr, Angharad, and Peter M. Jonas. “The Two Sides of Hippocampal Mossy Fiber
Plasticity (Review).” Neuron, vol. 57, no. 1, Elsevier, 2008, pp. 5–7,
doi:10.1016/j.neuron.2007.12.015.
short: A. Kerr, P.M. Jonas, Neuron 57 (2008) 5–7.
date_created: 2018-12-11T12:05:22Z
date_published: 2008-01-10T00:00:00Z
date_updated: 2021-01-12T07:52:27Z
day: '10'
doi: 10.1016/j.neuron.2007.12.015
extern: 1
intvolume: ' 57'
issue: '1'
month: '01'
page: 5 - 7
publication: Neuron
publication_status: published
publisher: Elsevier
publist_id: '2388'
quality_controlled: 0
status: public
title: The two sides of hippocampal mossy fiber plasticity (Review)
type: journal_article
volume: 57
year: '2008'
...
---
_id: '3824'
abstract:
- lang: eng
text: It is generally thought that transmitter release at mammalian central synapses
is triggered by Ca2+ microdomains, implying loose coupling between presynaptic
Ca2+ channels and Ca2+ sensors of exocytosis. Here we show that Ca2+ channel subunit
immunoreactivity is highly concentrated in the active zone of GABAergic presynaptic
terminals of putative parvalbumin-containing basket cells in the hippocampus.
Paired recording combined with presynaptic patch pipette perfusion revealed that
GABA release at basket cell-granule cell synapses is sensitive to millimolar concentrations
of the fast Ca2+ chelator BAPTA but insensitive to the slow Ca2+ chelator EGTA.
These results show that Ca2+ source and Ca2+ sensor are tightly coupled at this
synapse, with distances in the range of 10-20 nm. Models of Ca2+ inflow-exocytosis
coupling further reveal that the tightness of coupling increases efficacy, speed,
and temporal precision of transmitter release. Thus, tight coupling contributes
to fast feedforward and feedback inhibition in the hippocampal network.
author:
- first_name: Iancu
full_name: Bucurenciu, Iancu
last_name: Bucurenciu
- first_name: Ákos
full_name: Kulik, Ákos
last_name: Kulik
- first_name: Beat
full_name: Schwaller, Beat
last_name: Schwaller
- first_name: Michael
full_name: Frotscher, Michael
last_name: Frotscher
- first_name: Peter M
full_name: Peter Jonas
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Bucurenciu I, Kulik Á, Schwaller B, Frotscher M, Jonas PM. Nanodomain coupling
between Ca(2+) channels and Ca2+ sensors promotes fast and efficient transmitter
release at a cortical GABAergic synapse. Neuron. 2008;57(4):536-545. doi:10.1016/j.neuron.2007.12.026
apa: Bucurenciu, I., Kulik, Á., Schwaller, B., Frotscher, M., & Jonas, P. M.
(2008). Nanodomain coupling between Ca(2+) channels and Ca2+ sensors promotes
fast and efficient transmitter release at a cortical GABAergic synapse. Neuron.
Elsevier. https://doi.org/10.1016/j.neuron.2007.12.026
chicago: Bucurenciu, Iancu, Ákos Kulik, Beat Schwaller, Michael Frotscher, and Peter
M Jonas. “Nanodomain Coupling between Ca(2+) Channels and Ca2+ Sensors Promotes
Fast and Efficient Transmitter Release at a Cortical GABAergic Synapse.” Neuron.
Elsevier, 2008. https://doi.org/10.1016/j.neuron.2007.12.026.
ieee: I. Bucurenciu, Á. Kulik, B. Schwaller, M. Frotscher, and P. M. Jonas, “Nanodomain
coupling between Ca(2+) channels and Ca2+ sensors promotes fast and efficient
transmitter release at a cortical GABAergic synapse,” Neuron, vol. 57,
no. 4. Elsevier, pp. 536–45, 2008.
ista: Bucurenciu I, Kulik Á, Schwaller B, Frotscher M, Jonas PM. 2008. Nanodomain
coupling between Ca(2+) channels and Ca2+ sensors promotes fast and efficient
transmitter release at a cortical GABAergic synapse. Neuron. 57(4), 536–45.
mla: Bucurenciu, Iancu, et al. “Nanodomain Coupling between Ca(2+) Channels and
Ca2+ Sensors Promotes Fast and Efficient Transmitter Release at a Cortical GABAergic
Synapse.” Neuron, vol. 57, no. 4, Elsevier, 2008, pp. 536–45, doi:10.1016/j.neuron.2007.12.026.
short: I. Bucurenciu, Á. Kulik, B. Schwaller, M. Frotscher, P.M. Jonas, Neuron 57
(2008) 536–45.
date_created: 2018-12-11T12:05:22Z
date_published: 2008-01-01T00:00:00Z
date_updated: 2021-01-12T07:52:27Z
day: '01'
doi: 10.1016/j.neuron.2007.12.026
extern: 1
intvolume: ' 57'
issue: '4'
month: '01'
page: 536 - 45
publication: Neuron
publication_status: published
publisher: Elsevier
publist_id: '2385'
quality_controlled: 0
status: public
title: Nanodomain coupling between Ca(2+) channels and Ca2+ sensors promotes fast
and efficient transmitter release at a cortical GABAergic synapse
type: journal_article
volume: 57
year: '2008'
...
---
_id: '3825'
abstract:
- lang: eng
text: Fast-spiking parvalbumin-expressing basket cells (BCs) represent a major type
of inhibitory interneuron in the hippocampus. These cells inhibit principal cells
in a temporally precise manner and are involved in the generation of network oscillations.
Although BCs show a unique expression profile of Ca(2+)-permeable receptors, Ca(2+)-binding
proteins and Ca(2+)-dependent signalling molecules, physiological Ca(2+) signalling
in these interneurons has not been investigated. To study action potential (AP)-induced
dendritic Ca(2+) influx and buffering, we combined whole-cell patch-clamp recordings
with ratiometric Ca(2+) imaging from the proximal apical dendrites of rigorously
identified BCs in acute slices, using the high-affinity Ca(2+) indicator fura-2
or the low-affinity dye fura-FF. Single APs evoked dendritic Ca(2+) transients
with small amplitude. Bursts of APs evoked Ca(2+) transients with amplitudes that
increased linearly with AP number. Analysis of Ca(2+) transients under steady-state
conditions with different fura-2 concentrations and during loading with 200 microm
fura-2 indicated that the endogenous Ca(2+)-binding ratio was approximately 200
(kappa(S) = 202 +/- 26 for the loading experiments). The peak amplitude of the
Ca(2+) transients measured directly with 100 microm fura-FF was 39 nm AP(-1).
At approximately 23 degrees C, the decay time constant of the Ca(2+) transients
was 390 ms, corresponding to an extrusion rate of approximately 600 s(-1). At
34 degrees C, the decay time constant was 203 ms and the corresponding extrusion
rate was approximately 1100 s(-1). At both temperatures, continuous theta-burst
activity with three to five APs per theta cycle, as occurs in vivo during exploration,
led to a moderate increase in the global Ca(2+) concentration that was proportional
to AP number, whereas more intense stimulation was required to reach micromolar
Ca(2+) concentrations and to shift Ca(2+) signalling into a non-linear regime.
In conclusion, dentate gyrus BCs show a high endogenous Ca(2+)-binding ratio,
a small AP-induced dendritic Ca(2+) influx, and a relatively slow Ca(2+) extrusion.
These specific buffering properties of BCs will sharpen the time course of local
Ca(2+) signals, while prolonging the decay of global Ca(2+) signals.
author:
- first_name: Yexica
full_name: Aponte, Yexica
last_name: Aponte
- first_name: Josef
full_name: Bischofberger, Josef
last_name: Bischofberger
- first_name: Peter M
full_name: Peter Jonas
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Aponte Y, Bischofberger J, Jonas PM. Efficient Ca(2+) buffering in fast-spiking
basket cells of rat hippocampus. Journal of Physiology. 2008;586(8):2061-2075.
doi:10.1113/jphysiol.2007.147298
apa: Aponte, Y., Bischofberger, J., & Jonas, P. M. (2008). Efficient Ca(2+)
buffering in fast-spiking basket cells of rat hippocampus. Journal of Physiology.
Wiley-Blackwell. https://doi.org/10.1113/jphysiol.2007.147298
chicago: Aponte, Yexica, Josef Bischofberger, and Peter M Jonas. “Efficient Ca(2+)
Buffering in Fast-Spiking Basket Cells of Rat Hippocampus.” Journal of Physiology.
Wiley-Blackwell, 2008. https://doi.org/10.1113/jphysiol.2007.147298.
ieee: Y. Aponte, J. Bischofberger, and P. M. Jonas, “Efficient Ca(2+) buffering
in fast-spiking basket cells of rat hippocampus,” Journal of Physiology,
vol. 586, no. 8. Wiley-Blackwell, pp. 2061–75, 2008.
ista: Aponte Y, Bischofberger J, Jonas PM. 2008. Efficient Ca(2+) buffering in fast-spiking
basket cells of rat hippocampus. Journal of Physiology. 586(8), 2061–75.
mla: Aponte, Yexica, et al. “Efficient Ca(2+) Buffering in Fast-Spiking Basket Cells
of Rat Hippocampus.” Journal of Physiology, vol. 586, no. 8, Wiley-Blackwell,
2008, pp. 2061–75, doi:10.1113/jphysiol.2007.147298.
short: Y. Aponte, J. Bischofberger, P.M. Jonas, Journal of Physiology 586 (2008)
2061–75.
date_created: 2018-12-11T12:05:22Z
date_published: 2008-01-01T00:00:00Z
date_updated: 2021-01-12T07:52:28Z
day: '01'
doi: 10.1113/jphysiol.2007.147298
extern: 1
intvolume: ' 586'
issue: '8'
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2465201/
month: '01'
oa: 1
page: 2061 - 75
publication: Journal of Physiology
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2386'
quality_controlled: 0
status: public
title: Efficient Ca(2+) buffering in fast-spiking basket cells of rat hippocampus
type: journal_article
volume: 586
year: '2008'
...
---
_id: '3826'
abstract:
- lang: eng
text: Gamma frequency (30-100 Hz) oscillations in the mature cortex underlie higher
cognitive functions. Fast signaling in GABAergic interneuron networks plays a
key role in the generation of these oscillations. During development of the rodent
brain, gamma activity appears at the end of the first postnatal week, but frequency
and synchrony reach adult levels only by the fourth week. However, the mechanisms
underlying the maturation of gamma activity are unclear. Here we demonstrate that
hippocampal basket cells (BCs), the proposed cellular substrate of gamma oscillations,
undergo marked changes in their morphological, intrinsic, and synaptic properties
between postnatal day 6 (P6) and P25. During maturation, action potential duration,
propagation time, duration of the release period, and decay time constant of IPSCs
decreases by approximately 30-60%. Thus, postnatal development converts BCs from
slow into fast signaling devices. Computational analysis reveals that BC networks
with young intrinsic and synaptic properties as well as reduced connectivity generate
oscillations with moderate coherence in the lower gamma frequency range. In contrast,
BC networks with mature properties and increased connectivity generate highly
coherent activity in the upper gamma frequency band. Thus, late postnatal maturation
of BCs enhances coherence in neuronal networks and will thereby contribute to
the development of cognitive brain functions.
author:
- first_name: Daniel
full_name: Doischer, Daniel
last_name: Doischer
- first_name: Jonas
full_name: Hosp, Jonas Aurel
last_name: Hosp
- first_name: Yuchio
full_name: Yanagawa, Yuchio
last_name: Yanagawa
- first_name: Kunihiko
full_name: Obata, Kunihiko
last_name: Obata
- first_name: Peter M
full_name: Peter Jonas
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Imre
full_name: Vida, Imre
last_name: Vida
- first_name: Marlene
full_name: Bartos, Marlene
last_name: Bartos
citation:
ama: Doischer D, Hosp J, Yanagawa Y, et al. Postnatal differentiation of basket
cells from slow to fast signaling devices. Journal of Neuroscience. 2008;28(48):12956-12968.
doi:10.1523/JNEUROSCI.2890-08.2008
apa: Doischer, D., Hosp, J., Yanagawa, Y., Obata, K., Jonas, P. M., Vida, I., &
Bartos, M. (2008). Postnatal differentiation of basket cells from slow to fast
signaling devices. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.2890-08.2008
chicago: Doischer, Daniel, Jonas Hosp, Yuchio Yanagawa, Kunihiko Obata, Peter M
Jonas, Imre Vida, and Marlene Bartos. “Postnatal Differentiation of Basket Cells
from Slow to Fast Signaling Devices.” Journal of Neuroscience. Society
for Neuroscience, 2008. https://doi.org/10.1523/JNEUROSCI.2890-08.2008.
ieee: D. Doischer et al., “Postnatal differentiation of basket cells from
slow to fast signaling devices,” Journal of Neuroscience, vol. 28, no.
48. Society for Neuroscience, pp. 12956–68, 2008.
ista: Doischer D, Hosp J, Yanagawa Y, Obata K, Jonas PM, Vida I, Bartos M. 2008.
Postnatal differentiation of basket cells from slow to fast signaling devices.
Journal of Neuroscience. 28(48), 12956–68.
mla: Doischer, Daniel, et al. “Postnatal Differentiation of Basket Cells from Slow
to Fast Signaling Devices.” Journal of Neuroscience, vol. 28, no. 48, Society
for Neuroscience, 2008, pp. 12956–68, doi:10.1523/JNEUROSCI.2890-08.2008.
short: D. Doischer, J. Hosp, Y. Yanagawa, K. Obata, P.M. Jonas, I. Vida, M. Bartos,
Journal of Neuroscience 28 (2008) 12956–68.
date_created: 2018-12-11T12:05:23Z
date_published: 2008-01-01T00:00:00Z
date_updated: 2021-01-12T07:52:28Z
day: '01'
doi: 10.1523/JNEUROSCI.2890-08.2008
extern: 1
intvolume: ' 28'
issue: '48'
month: '01'
page: 12956 - 68
publication: Journal of Neuroscience
publication_status: published
publisher: Society for Neuroscience
publist_id: '2383'
quality_controlled: 0
status: public
title: Postnatal differentiation of basket cells from slow to fast signaling devices
type: journal_article
volume: 28
year: '2008'
...
---
_id: '3827'
abstract:
- lang: eng
text: Previous studies revealed that synaptotagmin 1 is the major Ca(2+) sensor
for fast synchronous transmitter release at excitatory synapses. However, the
molecular identity of the Ca(2+) sensor at hippocampal inhibitory synapses has
not been determined. To address the functional role of synaptotagmin 1 at identified
inhibitory terminals, we made paired recordings from synaptically connected basket
cells (BCs) and granule cells (GCs) in the dentate gyrus in organotypic slice
cultures from wild-type and synaptotagmin 1-deficient mice. As expected, genetic
elimination of synaptotagmin 1 abolished synchronous transmitter release at excitatory
GC-BC synapses. However, synchronous release at inhibitory BC-GC synapses was
maintained. Quantitative analysis revealed that elimination of synaptotagmin 1
reduced release probability and depression but maintained the synchrony of transmitter
release at BC-GC synapses. Elimination of synaptotagmin 1 also increased the frequency
of both miniature excitatory postsynaptic currents (measured in BCs) and miniature
inhibitory postsynaptic currents (recorded in GCs), consistent with a clamping
function of synaptotagmin 1 at both excitatory and inhibitory terminals. Single-cell
reverse-transcription quantitative PCR analysis revealed that single BCs coexpressed
multiple synaptotagmin isoforms, including synaptotagmin 1-5, 7, and 11-13. Our
results indicate that, in contrast to excitatory synapses, synaptotagmin 1 is
not absolutely required for synchronous release at inhibitory BC-GC synapses.
Thus, alternative fast Ca(2+) sensors contribute to synchronous release of the
inhibitory transmitter GABA in cortical circuits.
author:
- first_name: Angharad
full_name: Kerr, Angharad M
last_name: Kerr
- first_name: Ellen
full_name: Reisinger, Ellen
last_name: Reisinger
- first_name: Peter M
full_name: Peter Jonas
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Kerr A, Reisinger E, Jonas PM. Differential dependence of phasic transmitter
release on synaptotagmin 1 at GABAergic and glutamatergic hippocampal synapses.
PNAS. 2008;105(40):15581-15586. doi:10.1073/pnas.0800621105
apa: Kerr, A., Reisinger, E., & Jonas, P. M. (2008). Differential dependence
of phasic transmitter release on synaptotagmin 1 at GABAergic and glutamatergic
hippocampal synapses. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.0800621105
chicago: Kerr, Angharad, Ellen Reisinger, and Peter M Jonas. “Differential Dependence
of Phasic Transmitter Release on Synaptotagmin 1 at GABAergic and Glutamatergic
Hippocampal Synapses.” PNAS. National Academy of Sciences, 2008. https://doi.org/10.1073/pnas.0800621105.
ieee: A. Kerr, E. Reisinger, and P. M. Jonas, “Differential dependence of phasic
transmitter release on synaptotagmin 1 at GABAergic and glutamatergic hippocampal
synapses,” PNAS, vol. 105, no. 40. National Academy of Sciences, pp. 15581–6,
2008.
ista: Kerr A, Reisinger E, Jonas PM. 2008. Differential dependence of phasic transmitter
release on synaptotagmin 1 at GABAergic and glutamatergic hippocampal synapses.
PNAS. 105(40), 15581–6.
mla: Kerr, Angharad, et al. “Differential Dependence of Phasic Transmitter Release
on Synaptotagmin 1 at GABAergic and Glutamatergic Hippocampal Synapses.” PNAS,
vol. 105, no. 40, National Academy of Sciences, 2008, pp. 15581–86, doi:10.1073/pnas.0800621105.
short: A. Kerr, E. Reisinger, P.M. Jonas, PNAS 105 (2008) 15581–6.
date_created: 2018-12-11T12:05:23Z
date_published: 2008-01-01T00:00:00Z
date_updated: 2021-01-12T07:52:29Z
day: '01'
doi: 10.1073/pnas.0800621105
extern: 1
intvolume: ' 105'
issue: '40'
month: '01'
page: 15581 - 6
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '2384'
quality_controlled: 0
status: public
title: Differential dependence of phasic transmitter release on synaptotagmin 1 at
GABAergic and glutamatergic hippocampal synapses
type: journal_article
volume: 105
year: '2008'
...
---
_id: '3872'
abstract:
- lang: eng
text: We survey value iteration algorithms on graphs. Such algorithms can be used
for determining the existence of certain paths (model checking), the existence
of certain strategies (game solving), and the probabilities of certain events
(performance analysis). We classify the algorithms according to the value domain
(boolean, probabilistic, or quantitative); according to the graph structure (nondeterministic,
probabilistic, or multi-player); according to the desired property of paths (Borel
level 1, 2, or 3); and according to the alternation depth and convergence rate
of fixpoint computations.
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
citation:
ama: 'Chatterjee K, Henzinger TA. Value iteration. In: 25 Years in Model Checking.
Vol 5000. Springer; 2008:107-138. doi:10.1007/978-3-540-69850-0_7'
apa: Chatterjee, K., & Henzinger, T. A. (2008). Value iteration. In 25 Years
in Model Checking (Vol. 5000, pp. 107–138). Springer. https://doi.org/10.1007/978-3-540-69850-0_7
chicago: Chatterjee, Krishnendu, and Thomas A Henzinger. “Value Iteration.” In 25
Years in Model Checking, 5000:107–38. Springer, 2008. https://doi.org/10.1007/978-3-540-69850-0_7.
ieee: K. Chatterjee and T. A. Henzinger, “Value iteration,” in 25 Years in Model
Checking, vol. 5000, Springer, 2008, pp. 107–138.
ista: 'Chatterjee K, Henzinger TA. 2008.Value iteration. In: 25 Years in Model Checking.
LNCS, vol. 5000, 107–138.'
mla: Chatterjee, Krishnendu, and Thomas A. Henzinger. “Value Iteration.” 25 Years
in Model Checking, vol. 5000, Springer, 2008, pp. 107–38, doi:10.1007/978-3-540-69850-0_7.
short: K. Chatterjee, T.A. Henzinger, in:, 25 Years in Model Checking, Springer,
2008, pp. 107–138.
date_created: 2018-12-11T12:05:38Z
date_published: 2008-01-01T00:00:00Z
date_updated: 2021-01-12T07:52:51Z
day: '01'
doi: 10.1007/978-3-540-69850-0_7
extern: 1
intvolume: ' 5000'
month: '01'
page: 107 - 138
publication: 25 Years in Model Checking
publication_status: published
publisher: Springer
publist_id: '2299'
quality_controlled: 0
status: public
title: Value iteration
type: book_chapter
volume: 5000
year: '2008'
...
---
_id: '3873'
abstract:
- lang: eng
text: We study the controller synthesis problem under budget constraints. In this
problem, there is a cost associated with making an observation, and a controller
can make only a limited number of observations in each round so that the total
cost of the observations does not exceed a given fixed budget. The controller
must ensure some omega-regular requirement subject to the budget constraint. Budget
constraints arise in designing and implementing controllers for resource-constrained
embedded systems, where a controller may not have enough power, time, or bandwidth
to obtain data from all sensors in each round. They lead to games of imperfect
information, where the unknown information is not fixed a priori, but can vary
from round to round, based on the choices made by the controller how to allocate
its budget. We show that the budget-constrained synthesis problem for W-regular
objectives is complete for exponential time. In addition to studying synthesis
under a fixed budget constraint, we study the budget optimization problem, where
given a plant, an objective, and observation costs, we have to find a controller
that achieves the objective with minimal average accumulated cost (or minimal
peak cost). We show that this problem is reducible to a game of imperfect information
where the winning objective is a conjunction of an omega-regular condition and
a long-run average condition (or a least max-cost condition), and this again leads
to an exponential-time algorithm. Finally, we extend our results to games over
infinite state spaces, and show that the budget-constrained synthesis problem
is decidable for infinite state games with stable quotients of finite index. Consequently,
the discrete time budget-constrained synthesis problem is decidable for rectangular
hybrid automata.
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: Ritankar
full_name: Majumdar, Ritankar S
last_name: Majumdar
- 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, Majumdar R, Henzinger TA. Controller synthesis with budget constraints.
In: Vol 4981. Springer; 2008:72-86. doi:DOI:
10.1007/978-3-540-78929-1_6'
apa: 'Chatterjee, K., Majumdar, R., & Henzinger, T. A. (2008). Controller synthesis
with budget constraints (Vol. 4981, pp. 72–86). Presented at the HSCC: Hybrid
Systems - Computation and Control, Springer. https://doi.org/DOI:
10.1007/978-3-540-78929-1_6'
chicago: 'Chatterjee, Krishnendu, Ritankar Majumdar, and Thomas A Henzinger. “Controller
Synthesis with Budget Constraints,” 4981:72–86. Springer, 2008. https://doi.org/DOI: 10.1007/978-3-540-78929-1_6.'
ieee: 'K. Chatterjee, R. Majumdar, and T. A. Henzinger, “Controller synthesis with
budget constraints,” presented at the HSCC: Hybrid Systems - Computation and Control,
2008, vol. 4981, pp. 72–86.'
ista: 'Chatterjee K, Majumdar R, Henzinger TA. 2008. Controller synthesis with budget
constraints. HSCC: Hybrid Systems - Computation and Control, LNCS, vol. 4981,
72–86.'
mla: 'Chatterjee, Krishnendu, et al. Controller Synthesis with Budget Constraints.
Vol. 4981, Springer, 2008, pp. 72–86, doi:DOI:
10.1007/978-3-540-78929-1_6.'
short: K. Chatterjee, R. Majumdar, T.A. Henzinger, in:, Springer, 2008, pp. 72–86.
conference:
name: 'HSCC: Hybrid Systems - Computation and Control'
date_created: 2018-12-11T12:05:38Z
date_published: 2008-04-03T00:00:00Z
date_updated: 2021-01-12T07:52:51Z
day: '03'
doi: 'DOI: 10.1007/978-3-540-78929-1_6'
extern: 1
intvolume: ' 4981'
month: '04'
page: 72 - 86
publication_status: published
publisher: Springer
publist_id: '2296'
quality_controlled: 0
status: public
title: Controller synthesis with budget constraints
type: conference
volume: 4981
year: '2008'
...
---
_id: '3874'
abstract:
- lang: eng
text: We consider concurrent two-player timed automaton games with omega-regular
objectives specified as parity conditions. These games offer an appropriate model
for the synthesis of real-time controllers. Earlier works on timed games focused
on pure strategies for each player. We study, for the first time, the use of randomized
strategies in such games. While pure (i.e., nonrandomized) strategies in timed
games require infinite memory for winning even with respect to reachability objectives,
we show that randomized strategies can win with finite memory with respect to
all parity objectives. Also, the synthesized randomized real-time controllers
are much simpler in structure than the corresponding pure controllers, and therefore
easier to implement. For safety objectives we prove the existence of pure finite-memory
winning strategies. Finally, while randomization helps in simplifying the strategies
required for winning timed parity games, we prove that randomization does not
help in winning at more states.
acknowledgement: This research was supported in part by the NSF grants CCR-0208875,
CCR-0225610, CCR-0234690, by the Swiss National Science Foundation, and by the Artist2
European Network of Excellence.
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: Vinayak
full_name: Prabhu, Vinayak S
last_name: Prabhu
citation:
ama: 'Chatterjee K, Henzinger TA, Prabhu V. Trading infinite memory for uniform
randomness in timed games. In: Vol 4981. Springer; 2008:87-100. doi:10.1007/978-3-540-78929-1_7'
apa: 'Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2008). Trading infinite
memory for uniform randomness in timed games (Vol. 4981, pp. 87–100). Presented
at the HSCC: Hybrid Systems - Computation and Control, Springer. https://doi.org/10.1007/978-3-540-78929-1_7'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Trading
Infinite Memory for Uniform Randomness in Timed Games,” 4981:87–100. Springer,
2008. https://doi.org/10.1007/978-3-540-78929-1_7.
ieee: 'K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Trading infinite memory for
uniform randomness in timed games,” presented at the HSCC: Hybrid Systems - Computation
and Control, 2008, vol. 4981, pp. 87–100.'
ista: 'Chatterjee K, Henzinger TA, Prabhu V. 2008. Trading infinite memory for uniform
randomness in timed games. HSCC: Hybrid Systems - Computation and Control, LNCS,
vol. 4981, 87–100.'
mla: Chatterjee, Krishnendu, et al. Trading Infinite Memory for Uniform Randomness
in Timed Games. Vol. 4981, Springer, 2008, pp. 87–100, doi:10.1007/978-3-540-78929-1_7.
short: K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Springer, 2008, pp. 87–100.
conference:
name: 'HSCC: Hybrid Systems - Computation and Control'
date_created: 2018-12-11T12:05:38Z
date_published: 2008-04-03T00:00:00Z
date_updated: 2021-01-12T07:52:51Z
day: '03'
doi: 10.1007/978-3-540-78929-1_7
extern: 1
intvolume: ' 4981'
month: '04'
page: 87 - 100
publication_status: published
publisher: Springer
publist_id: '2297'
quality_controlled: 0
status: public
title: Trading infinite memory for uniform randomness in timed games
type: conference
volume: 4981
year: '2008'
...
---
_id: '3875'
abstract:
- lang: eng
text: We study the problem of model checking Interval-valued Discrete-time Markov
Chains (IDTMC). IDTMCs are discrete-time finite Markov Chains for which the exact
transition probabilities are riot known. Instead in IDTMCs, each transition is
associated with an interval in which the actual transition probability must lie.
We consider two semantic interpretations for the uncertainty in the transition
probabilities of an IDTMC. In the first interpretation, we think of an IDTMC as
representing a (possibly uncountable) family of (classical) discrete-time Markov
Chains, where each member of the family is a Markov Chain whose transition probabilities
lie within the interval range given in the IDTMC. We call this semantic interpretation
Uncertain Markov Chains (UMC). In the second semantics for an IDTMC, which we
call Interval Markov Decision Process (IMDP), we view the uncertainty as being
resolved through non-determinism. In other words, each time a state is visited,
we adversarially pick a transition distribution that respects the interval constraints,
and take a probabilistic step according to the chosen distribution. We introduce
a logic omega-PCTL that can express liveness, strong fairness, and omega-regular
properties (such properties cannot be expressed in PCTL). We show that the omega-PCTL
model checking problem for Uncertain Markov Chain semantics is decidable in PSPACE
(same as the best known upper bound for PCTL) and for Interval Markov Decision
Process semantics is decidable in coNP (improving the previous known PSPACE bound
for PCTL). We also show that the qualitative fragment of the logic can lie solved
in coNP for the UMC interpretation, and can be solved in polynomial time for a
sub-class of UMCs. We also prove lower bounds for these model checking problems.
We show that the model checking problem of IDTMCs with LTL formulas can be solved
for both UMC and IMDP semantics by reduction to the model checking problem of
IDTMC with omega-PcTL formulas.
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: Koushik
full_name: Sen, Koushik
last_name: Sen
citation:
ama: 'Chatterjee K, Henzinger TA, Sen K. Model-checking omega-regular properties
of interval Markov chains. In: Vol 4962. Springer; 2008:302-317. doi:10.1007/978-3-540-78499-9_22'
apa: 'Chatterjee, K., Henzinger, T. A., & Sen, K. (2008). Model-checking omega-regular
properties of interval Markov chains (Vol. 4962, pp. 302–317). Presented at the
FoSSaCS: Foundations of Software Science and Computation Structures, Springer.
https://doi.org/10.1007/978-3-540-78499-9_22'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Koushik Sen. “Model-Checking
Omega-Regular Properties of Interval Markov Chains,” 4962:302–17. Springer, 2008.
https://doi.org/10.1007/978-3-540-78499-9_22.
ieee: 'K. Chatterjee, T. A. Henzinger, and K. Sen, “Model-checking omega-regular
properties of interval Markov chains,” presented at the FoSSaCS: Foundations of
Software Science and Computation Structures, 2008, vol. 4962, pp. 302–317.'
ista: 'Chatterjee K, Henzinger TA, Sen K. 2008. Model-checking omega-regular properties
of interval Markov chains. FoSSaCS: Foundations of Software Science and Computation
Structures, LNCS, vol. 4962, 302–317.'
mla: Chatterjee, Krishnendu, et al. Model-Checking Omega-Regular Properties of
Interval Markov Chains. Vol. 4962, Springer, 2008, pp. 302–17, doi:10.1007/978-3-540-78499-9_22.
short: K. Chatterjee, T.A. Henzinger, K. Sen, in:, Springer, 2008, pp. 302–317.
conference:
name: 'FoSSaCS: Foundations of Software Science and Computation Structures'
date_created: 2018-12-11T12:05:39Z
date_published: 2008-03-01T00:00:00Z
date_updated: 2021-01-12T07:52:52Z
day: '01'
doi: 10.1007/978-3-540-78499-9_22
extern: 1
intvolume: ' 4962'
month: '03'
page: 302 - 317
publication_status: published
publisher: Springer
publist_id: '2298'
quality_controlled: 0
status: public
title: Model-checking omega-regular properties of interval Markov chains
type: conference
volume: 4962
year: '2008'
...
---
_id: '3876'
abstract:
- lang: eng
text: We consider two-player games played in real time on game structures with clocks
and parity objectives. The games are concurrent in that at each turn, both players
independently propose a time delay and an action, and the action with the shorter
delay is chosen. To prevent a player from winning by blocking time, we restrict
each player to strategies that ensure that the player cannot be responsible for
causing a zeno run. First, we present an efficient reduction of these games to
turn-based (i.e., nonconcurrent) finite-state (i.e., untimed) parity games. The
states of the resulting game are pairs of clock regions of the original game.
Our reduction improves the best known complexity for solving timed parity games.
Moreover, the rich class of algorithms for classical parity games can now be applied
to timed parity games. Second, we consider two restricted classes of strategies
for the player that represents the controller in a real-time synthesis problem,
namely, limit-robust and bounded-robust strategies. Using a limit-robust strategy,
the controller cannot choose an exact real-valued time delay but must allow for
some nonzero jitter in each of its actions. If there is a given lower bound on
the jitter, then the strategy is bounded-robust. We show that exact strategies
are more powerful than limit-robust strategies, which are more powerful than bounded-robust
strategies for any bound. For both kinds of robust strategies, we present efficient
reductions to standard timed automaton games. These reductions provide algorithms
for the synthesis of robust real-time controllers.
acknowledgement: This research was supported in part by the NSF grants CCR-0132780,
CNS-0720884, and CCR-0225610, and by the European COMBEST project.
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: Vinayak
full_name: Prabhu, Vinayak S
last_name: Prabhu
citation:
ama: 'Chatterjee K, Henzinger TA, Prabhu V. Timed parity games: complexity and robustness.
In: Vol 5215. Springer; 2008:124-140. doi:10.1007/978-3-540-85778-5_10'
apa: 'Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2008). Timed parity games:
complexity and robustness (Vol. 5215, pp. 124–140). Presented at the FORMATS:
Formal Modeling and Analysis of Timed Systems, Springer. https://doi.org/10.1007/978-3-540-85778-5_10'
chicago: 'Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed
Parity Games: Complexity and Robustness,” 5215:124–40. Springer, 2008. https://doi.org/10.1007/978-3-540-85778-5_10.'
ieee: 'K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: complexity
and robustness,” presented at the FORMATS: Formal Modeling and Analysis of Timed
Systems, 2008, vol. 5215, pp. 124–140.'
ista: 'Chatterjee K, Henzinger TA, Prabhu V. 2008. Timed parity games: complexity
and robustness. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS,
vol. 5215, 124–140.'
mla: 'Chatterjee, Krishnendu, et al. Timed Parity Games: Complexity and Robustness.
Vol. 5215, Springer, 2008, pp. 124–40, doi:10.1007/978-3-540-85778-5_10.'
short: K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Springer, 2008, pp. 124–140.
conference:
name: 'FORMATS: Formal Modeling and Analysis of Timed Systems'
date_created: 2018-12-11T12:05:39Z
date_published: 2008-10-01T00:00:00Z
date_updated: 2023-02-23T11:21:54Z
day: '01'
doi: 10.1007/978-3-540-85778-5_10
extern: 1
intvolume: ' 5215'
month: '10'
page: 124 - 140
publication_status: published
publisher: Springer
publist_id: '2294'
quality_controlled: 0
related_material:
record:
- id: '3315'
relation: later_version
status: public
status: public
title: 'Timed parity games: complexity and robustness'
type: conference
volume: 5215
year: '2008'
...
---
_id: '3877'
abstract:
- lang: eng
text: The synthesis problem asks to construct a reactive finite-state system from
an omega-regular specification. Initial specifications are often unrealizable,
which means that there is no system that implements the specification. A common
reason for unrealizability is that assumptions on the environment of the system
are incomplete. We study the problem of correcting an unrealizable specification
phi by computing an environment assumption psi such that the new specification
psi -> phi is realizable. Our aim is to construct an assumption psi that constrains
only the environment and is as weak as possible. We present a two-step algorithm
for computing assumptions. The algorithm operates on the game graph that is used
to answer the realizability question. First, we compute a safety assumption that
removes a minimal set of environment edges from the graph. Second, we compute
a liveness assumption that puts fairness conditions on some of the remaining environment
edges. We show that the problem of finding a minimal set of fair edges is computationally
hard, and we use probabilistic games to compute a locally minimal fairness assumption.
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: Barbara
full_name: Jobstmann, Barbara
last_name: Jobstmann
citation:
ama: 'Chatterjee K, Henzinger TA, Jobstmann B. Environment assumptions for synthesis.
In: Vol 5201. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2008:147-161.
doi:10.1007/978-3-540-85361-9_14'
apa: 'Chatterjee, K., Henzinger, T. A., & Jobstmann, B. (2008). Environment
assumptions for synthesis (Vol. 5201, pp. 147–161). Presented at the CONCUR: Concurrency
Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-85361-9_14'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Barbara Jobstmann. “Environment
Assumptions for Synthesis,” 5201:147–61. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2008. https://doi.org/10.1007/978-3-540-85361-9_14.
ieee: 'K. Chatterjee, T. A. Henzinger, and B. Jobstmann, “Environment assumptions
for synthesis,” presented at the CONCUR: Concurrency Theory, 2008, vol. 5201,
pp. 147–161.'
ista: 'Chatterjee K, Henzinger TA, Jobstmann B. 2008. Environment assumptions for
synthesis. CONCUR: Concurrency Theory, LNCS, vol. 5201, 147–161.'
mla: Chatterjee, Krishnendu, et al. Environment Assumptions for Synthesis.
Vol. 5201, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008, pp. 147–61,
doi:10.1007/978-3-540-85361-9_14.
short: K. Chatterjee, T.A. Henzinger, B. Jobstmann, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2008, pp. 147–161.
conference:
name: 'CONCUR: Concurrency Theory'
date_created: 2018-12-11T12:05:39Z
date_published: 2008-07-30T00:00:00Z
date_updated: 2021-01-12T07:52:53Z
day: '30'
doi: 10.1007/978-3-540-85361-9_14
extern: 1
intvolume: ' 5201'
month: '07'
page: 147 - 161
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '2295'
quality_controlled: 0
status: public
title: Environment assumptions for synthesis
type: conference
volume: 5201
year: '2008'
...
---
_id: '3878'
abstract:
- lang: eng
text: We study the problem of generating a test sequence that achieves maximal coverage
for a reactive system under test. We formulate the problem as a repeated game
between the tester and the system, where the system state space is partitioned
according to some coverage criterion and the objective of the tester is to maximize
the set of partitions (or coverage goals) visited during the game. We show the
complexity of the maximal coverage problem for non-deterministic systems is PSPACE-complete,
but is NP-complete for deterministic systems. For the special case of non-deterministic
systems with a re-initializing “reset” action, which represent running a new test
input on a re-initialized system, we show that the complexity is coNP-complete.
Our proof technique for reset games uses randomized testing strategies that circumvent
the exponentially large memory requirement of deterministic testing strategies.
acknowledgement: This research was supported in part by the NSF grants CCR-0132780
and CNS-0720884.
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: Luca
full_name: de Alfaro, Luca
last_name: De Alfaro
- first_name: Ritankar
full_name: Majumdar, Ritankar S
last_name: Majumdar
citation:
ama: 'Chatterjee K, De Alfaro L, Majumdar R. The complexity of coverage. In: Vol
5356. Springer; 2008:91-106. doi:10.1007/978-3-540-89330-1_7'
apa: 'Chatterjee, K., De Alfaro, L., & Majumdar, R. (2008). The complexity of
coverage (Vol. 5356, pp. 91–106). Presented at the APLAS: Asian Symposium on Programming
Languages and Systems, Springer. https://doi.org/10.1007/978-3-540-89330-1_7'
chicago: Chatterjee, Krishnendu, Luca De Alfaro, and Ritankar Majumdar. “The Complexity
of Coverage,” 5356:91–106. Springer, 2008. https://doi.org/10.1007/978-3-540-89330-1_7.
ieee: 'K. Chatterjee, L. De Alfaro, and R. Majumdar, “The complexity of coverage,”
presented at the APLAS: Asian Symposium on Programming Languages and Systems,
2008, vol. 5356, pp. 91–106.'
ista: 'Chatterjee K, De Alfaro L, Majumdar R. 2008. The complexity of coverage.
APLAS: Asian Symposium on Programming Languages and Systems, LNCS, vol. 5356,
91–106.'
mla: Chatterjee, Krishnendu, et al. The Complexity of Coverage. Vol. 5356,
Springer, 2008, pp. 91–106, doi:10.1007/978-3-540-89330-1_7.
short: K. Chatterjee, L. De Alfaro, R. Majumdar, in:, Springer, 2008, pp. 91–106.
conference:
name: 'APLAS: Asian Symposium on Programming Languages and Systems'
date_created: 2018-12-11T12:05:40Z
date_published: 2008-12-03T00:00:00Z
date_updated: 2021-01-12T07:52:53Z
day: '03'
doi: 10.1007/978-3-540-89330-1_7
extern: 1
intvolume: ' 5356'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/0804.4525
month: '12'
oa: 1
page: 91 - 106
publication_status: published
publisher: Springer
publist_id: '2292'
quality_controlled: 0
status: public
title: The complexity of coverage
type: conference
volume: 5356
year: '2008'
...
---
_id: '3879'
abstract:
- lang: eng
text: Quantitative generalizations of classical languages, which assign to each
word a real number instead of a boolean value, have applications in modeling resource-constrained
computation. We use weighted automata (finite automata with transition weights)
to define several natural classes of quantitative languages over finite and infinite
words; in particular, the real value of an infinite run is computed as the maximum,
limsup, liminf, limit average, or discounted sum of the transition weights. We
define the classical decision problems of automata theory (emptiness, universality,
language inclusion, and language equivalence) in the quantitative setting and
study their computational complexity. As the decidability of language inclusion
remains open for some classes of weighted automata, we introduce a notion of quantitative
simulation that is decidable and implies language inclusion. We also give a complete
characterization of the expressive power of the various classes of weighted automata.
In particular, we show that most classes of weighted automata cannot be determinized.
acknowledgement: Research supported in part by the NSF grants CCR-0132780, CNS-0720884,
and CCR-0225610, by the Swiss National Science Foundation, and by the European COMBEST
project.
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: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- 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, Doyen L, Henzinger TA. Quantitative languages. In: Vol 5213.
Springer; 2008:385-400. doi:10.1007/978-3-540-87531-4_28'
apa: 'Chatterjee, K., Doyen, L., & Henzinger, T. A. (2008). Quantitative languages
(Vol. 5213, pp. 385–400). Presented at the CSL: Computer Science Logic, Springer.
https://doi.org/10.1007/978-3-540-87531-4_28'
chicago: Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Quantitative
Languages,” 5213:385–400. Springer, 2008. https://doi.org/10.1007/978-3-540-87531-4_28.
ieee: 'K. Chatterjee, L. Doyen, and T. A. Henzinger, “Quantitative languages,” presented
at the CSL: Computer Science Logic, 2008, vol. 5213, pp. 385–400.'
ista: 'Chatterjee K, Doyen L, Henzinger TA. 2008. Quantitative languages. CSL: Computer
Science Logic, LNCS, vol. 5213, 385–400.'
mla: Chatterjee, Krishnendu, et al. Quantitative Languages. Vol. 5213, Springer,
2008, pp. 385–400, doi:10.1007/978-3-540-87531-4_28.
short: K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2008, pp. 385–400.
conference:
name: 'CSL: Computer Science Logic'
date_created: 2018-12-11T12:05:40Z
date_published: 2008-09-10T00:00:00Z
date_updated: 2021-01-12T07:52:54Z
day: '10'
doi: 10.1007/978-3-540-87531-4_28
extern: 1
intvolume: ' 5213'
month: '09'
page: 385 - 400
publication_status: published
publisher: Springer
publist_id: '2293'
quality_controlled: 0
status: public
title: Quantitative languages
type: conference
volume: 5213
year: '2008'
...
---
_id: '3880'
abstract:
- lang: eng
text: We consider imperfect-information parity games in which strategies rely on
observations that provide imperfect information about the history of a play. To
solve such games, i.e., to determine the winning regions of players and corresponding
winning strategies, one can use the subset construction to build an equivalent
perfect-information game. Recently, an algorithm that avoids the inefficient subset
construction has been proposed. The algorithm performs a fixed-point computation
in a lattice of antichains, thus maintaining a succinct representation of state
sets. However, this representation does not allow to recover winning strategies.
In this paper, we build on the antichain approach to develop an algorithm for
constructing the winning strategies in parity games of imperfect information.
We have implemented this algorithm as a prototype. To our knowledge, this is the
first implementation of a procedure for solving imperfect-information parity games
on graphs.
alternative_title:
- LNCS
author:
- first_name: Dietmar
full_name: Berwanger, Dietmar
last_name: Berwanger
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Sangram
full_name: Raje, Sangram
last_name: Raje
citation:
ama: 'Berwanger D, Chatterjee K, Doyen L, Henzinger TA, Raje S. Strategy construction
for parity games with imperfect information. In: Vol 5201. Schloss Dagstuhl -
Leibniz-Zentrum für Informatik; 2008:325-339. doi:10.1007/978-3-540-85361-9'
apa: 'Berwanger, D., Chatterjee, K., Doyen, L., Henzinger, T. A., & Raje, S.
(2008). Strategy construction for parity games with imperfect information (Vol.
5201, pp. 325–339). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-85361-9'
chicago: Berwanger, Dietmar, Krishnendu Chatterjee, Laurent Doyen, Thomas A Henzinger,
and Sangram Raje. “Strategy Construction for Parity Games with Imperfect Information,”
5201:325–39. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008. https://doi.org/10.1007/978-3-540-85361-9.
ieee: 'D. Berwanger, K. Chatterjee, L. Doyen, T. A. Henzinger, and S. Raje, “Strategy
construction for parity games with imperfect information,” presented at the CONCUR:
Concurrency Theory, 2008, vol. 5201, pp. 325–339.'
ista: 'Berwanger D, Chatterjee K, Doyen L, Henzinger TA, Raje S. 2008. Strategy
construction for parity games with imperfect information. CONCUR: Concurrency
Theory, LNCS, vol. 5201, 325–339.'
mla: Berwanger, Dietmar, et al. Strategy Construction for Parity Games with Imperfect
Information. Vol. 5201, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2008, pp. 325–39, doi:10.1007/978-3-540-85361-9.
short: D. Berwanger, K. Chatterjee, L. Doyen, T.A. Henzinger, S. Raje, in:, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2008, pp. 325–339.
conference:
name: 'CONCUR: Concurrency Theory'
date_created: 2018-12-11T12:05:40Z
date_published: 2008-07-30T00:00:00Z
date_updated: 2023-02-23T11:46:01Z
day: '30'
doi: 10.1007/978-3-540-85361-9
extern: 1
intvolume: ' 5201'
month: '07'
page: 325 - 339
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '2291'
quality_controlled: 0
related_material:
record:
- id: '3863'
relation: later_version
status: public
status: public
title: Strategy construction for parity games with imperfect information
type: conference
volume: 5201
year: '2008'
...
---
_id: '3903'
abstract:
- lang: eng
text: "Background\r\n\r\nThe invasive garden ant, Lasius neglectus, is the most
recently detected pest ant and the first known invasive ant able to become established
and thrive in the temperate regions of Eurasia. In this study, we aim to reconstruct
the invasion history of this ant in Europe analysing 14 populations with three
complementary approaches: genetic microsatellite analysis, chemical analysis of
cuticular hydrocarbon profiles and behavioural observations of aggression behaviour.
We evaluate the relative informative power of the three methodological approaches
and estimate both the number of independent introduction events from a yet unknown
native range somewhere in the Black Sea area, and the invasive potential of the
existing introduced populations.\r\n\r\nResults\r\n\r\nThree clusters of genetically
similar populations were detected, and all but one population had a similar chemical
profile. Aggression between populations could be predicted from their genetic
and chemical distance, and two major clusters of non-aggressive groups of populations
were found. However, populations of L. neglectus did not separate into clear supercolonial
associations, as is typical for other invasive ants.\r\n\r\nConclusion\r\n\r\nThe
three methodological approaches gave consistent and complementary results. All
joint evidence supports the inference that the 14 introduced populations of L.
neglectus in Europe likely arose from only very few independent introductions
from the native range, and that new infestations were typically started through
introductions from other invasive populations. This indicates that existing introduced
populations have a very high invasive potential when the ants are inadvertently
spread by human transport. "
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: Falko
full_name: Drijfhout, Falko
last_name: Drijfhout
- first_name: Daniel
full_name: Kronauer, Daniel
last_name: Kronauer
- first_name: Jacobus
full_name: Boomsma, Jacobus
last_name: Boomsma
- first_name: Jes
full_name: Pedersen, Jes
last_name: Pedersen
- 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, Drijfhout F, Kronauer D, Boomsma J, Pedersen J, Cremer S. The
introduction history of invasive garden ants in Europe: integrating genetic, chemical
and behavioural approaches. BMC Biology. 2008;6(11). doi:10.1186/1741-7007-6-11'
apa: 'Ugelvig, L. V., Drijfhout, F., Kronauer, D., Boomsma, J., Pedersen, J., &
Cremer, S. (2008). The introduction history of invasive garden ants in Europe:
integrating genetic, chemical and behavioural approaches. BMC Biology.
BioMed Central. https://doi.org/10.1186/1741-7007-6-11'
chicago: 'Ugelvig, Line V, Falko Drijfhout, Daniel Kronauer, Jacobus Boomsma, Jes
Pedersen, and Sylvia Cremer. “The Introduction History of Invasive Garden Ants
in Europe: Integrating Genetic, Chemical and Behavioural Approaches.” BMC Biology.
BioMed Central, 2008. https://doi.org/10.1186/1741-7007-6-11.'
ieee: 'L. V. Ugelvig, F. Drijfhout, D. Kronauer, J. Boomsma, J. Pedersen, and S.
Cremer, “The introduction history of invasive garden ants in Europe: integrating
genetic, chemical and behavioural approaches,” BMC Biology, vol. 6, no.
11. BioMed Central, 2008.'
ista: 'Ugelvig LV, Drijfhout F, Kronauer D, Boomsma J, Pedersen J, Cremer S. 2008.
The introduction history of invasive garden ants in Europe: integrating genetic,
chemical and behavioural approaches. BMC Biology. 6(11).'
mla: 'Ugelvig, Line V., et al. “The Introduction History of Invasive Garden Ants
in Europe: Integrating Genetic, Chemical and Behavioural Approaches.” BMC Biology,
vol. 6, no. 11, BioMed Central, 2008, doi:10.1186/1741-7007-6-11.'
short: L.V. Ugelvig, F. Drijfhout, D. Kronauer, J. Boomsma, J. Pedersen, S. Cremer,
BMC Biology 6 (2008).
date_created: 2018-12-11T12:05:48Z
date_published: 2008-02-26T00:00:00Z
date_updated: 2021-01-12T07:53:05Z
day: '26'
doi: 10.1186/1741-7007-6-11
extern: '1'
intvolume: ' 6'
issue: '11'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '02'
oa_version: None
publication: BMC Biology
publication_status: published
publisher: BioMed Central
publist_id: '2249'
status: public
title: 'The introduction history of invasive garden ants in Europe: integrating genetic,
chemical and behavioural approaches'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2008'
...
---
_id: '3905'
abstract:
- lang: eng
text: Winged and wingless males coexist in the ant Cardiocondyla obscurior. Wingless
(“ergatoid”) males never leave their maternal colony and fight remorselessly among
each other for the access to emerging females. The peaceful winged males disperse
after about 10 days, but beforehand also mate in the nest. In the first 5 days
of their life, winged males perform a chemical female mimicry that protects them
against attack and even makes them sexually attractive to ergatoid males. When
older, the chemical profile of winged males no longer matches that of virgin females;
nevertheless, they are still tolerated, which so far has been puzzling. Contrasting
this general pattern, we have identified a single aberrant colony in which all
winged males were attacked and killed by the ergatoid males. A comparative analysis
of the morphology and chemical profile of these untypical attacked winged males
and the tolerated males from several normal colonies revealed that normal old
males are still performing some chemical mimicry to the virgin queens, though
less perfect than in their young ages. The anomalous attacked winged males, on
the other hand, had a very different odour to the females. Our study thus exemplifies
that the analysis of rare malfunctioning can add valuable insight on functioning
under normal conditions and allows the conclusion that older winged males from
normal colonies of the ant C. obscurior are guarded through an imperfect chemical
female mimicry, still close enough to protect against attacks by the wingless
fighters yet dissimilar enough not to elicit their sexual interest.
author:
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
- first_name: Patrizia
full_name: D'Ettorre, Patrizia
last_name: D'Ettorre
- first_name: Falko
full_name: Drijfhout, Falko
last_name: Drijfhout
- first_name: Matthew
full_name: Sledge, Matthew
last_name: Sledge
- first_name: Stefano
full_name: Turillazzi, Stefano
last_name: Turillazzi
- first_name: Jürgen
full_name: Heinze, Jürgen
last_name: Heinze
citation:
ama: Cremer S, D’Ettorre P, Drijfhout F, Sledge M, Turillazzi S, Heinze J. Imperfect
chemical female mimicry in males of the ant Cardiocondyla obscurior. Naturwissenschaften.
2008;95(11):1101-1105. doi:10.1007/s00114-008-0430-8
apa: Cremer, S., D’Ettorre, P., Drijfhout, F., Sledge, M., Turillazzi, S., &
Heinze, J. (2008). Imperfect chemical female mimicry in males of the ant Cardiocondyla
obscurior. Naturwissenschaften. Springer. https://doi.org/10.1007/s00114-008-0430-8
chicago: Cremer, Sylvia, Patrizia D’Ettorre, Falko Drijfhout, Matthew Sledge, Stefano
Turillazzi, and Jürgen Heinze. “Imperfect Chemical Female Mimicry in Males of
the Ant Cardiocondyla Obscurior.” Naturwissenschaften. Springer, 2008.
https://doi.org/10.1007/s00114-008-0430-8.
ieee: S. Cremer, P. D’Ettorre, F. Drijfhout, M. Sledge, S. Turillazzi, and J. Heinze,
“Imperfect chemical female mimicry in males of the ant Cardiocondyla obscurior,”
Naturwissenschaften, vol. 95, no. 11. Springer, pp. 1101–1105, 2008.
ista: Cremer S, D’Ettorre P, Drijfhout F, Sledge M, Turillazzi S, Heinze J. 2008.
Imperfect chemical female mimicry in males of the ant Cardiocondyla obscurior.
Naturwissenschaften. 95(11), 1101–1105.
mla: Cremer, Sylvia, et al. “Imperfect Chemical Female Mimicry in Males of the Ant
Cardiocondyla Obscurior.” Naturwissenschaften, vol. 95, no. 11, Springer,
2008, pp. 1101–05, doi:10.1007/s00114-008-0430-8.
short: S. Cremer, P. D’Ettorre, F. Drijfhout, M. Sledge, S. Turillazzi, J. Heinze,
Naturwissenschaften 95 (2008) 1101–1105.
date_created: 2018-12-11T12:05:48Z
date_published: 2008-08-05T00:00:00Z
date_updated: 2021-01-12T07:53:06Z
day: '05'
doi: 10.1007/s00114-008-0430-8
extern: '1'
intvolume: ' 95'
issue: '11'
language:
- iso: eng
month: '08'
oa_version: None
page: 1101 - 1105
publication: Naturwissenschaften
publication_status: published
publisher: Springer
publist_id: '2246'
status: public
title: Imperfect chemical female mimicry in males of the ant Cardiocondyla obscurior
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 95
year: '2008'
...
---
_id: '3906'
acknowledgement: 'Funding was obtained from the European Community: FP5 EU research-training
network ‘INSECTS’ (JJB SC PD FPD DPH) and FP6 Individual Marie Curie EIF grant (SC),
the Alexander-von-Humboldt Foundation (Feodor-Lynen postdoctoral stipend to SC),
the Danish Natural Science Research Council (JSP), the Danish National Research
Foundation (JJB DRN JSP), and the Austrian Science Fund (BCS FMS CS HK).'
author:
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
- 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: Falko
full_name: Drijfhout, Falko
last_name: Drijfhout
- first_name: Birgit
full_name: Schlick Steiner, Birgit
last_name: Schlick Steiner
- first_name: Florian
full_name: Steiner, Florian
last_name: Steiner
- first_name: Bernhard
full_name: Seifert, Bernhard
last_name: Seifert
- first_name: David
full_name: Hughes, David
last_name: Hughes
- first_name: Andreas
full_name: Schulz, Andreas
last_name: Schulz
- first_name: Klaus
full_name: Petersen, Klaus
last_name: Petersen
- first_name: Heino
full_name: Konrad, Heino
last_name: Konrad
- first_name: Christian
full_name: Stauffer, Christian
last_name: Stauffer
- first_name: Kadri
full_name: Kiran, Kadri
last_name: Kiran
- first_name: Xavier
full_name: Espadaler, Xavier
last_name: Espadaler
- first_name: Patrizia
full_name: D'Ettorre, Patrizia
last_name: D'Ettorre
- first_name: Nihat
full_name: Aktaç, Nihat
last_name: Aktaç
- first_name: Jørgen
full_name: Eilenberg, Jørgen
last_name: Eilenberg
- first_name: Graeme
full_name: Jones, Graeme
last_name: Jones
- first_name: David
full_name: Nash, David
last_name: Nash
- first_name: Jes
full_name: Pedersen, Jes
last_name: Pedersen
- first_name: Jacobus
full_name: Boomsma, Jacobus
last_name: Boomsma
citation:
ama: Cremer S, Ugelvig LV, Drijfhout F, et al. The evolution of invasiveness in
garden ants. PLoS One. 2008;3(12). doi:10.1371/journal.pone.0003838
apa: Cremer, S., Ugelvig, L. V., Drijfhout, F., Schlick Steiner, B., Steiner, F.,
Seifert, B., … Boomsma, J. (2008). The evolution of invasiveness in garden ants.
PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0003838
chicago: Cremer, Sylvia, Line V Ugelvig, Falko Drijfhout, Birgit Schlick Steiner,
Florian Steiner, Bernhard Seifert, David Hughes, et al. “The Evolution of Invasiveness
in Garden Ants.” PLoS One. Public Library of Science, 2008. https://doi.org/10.1371/journal.pone.0003838.
ieee: S. Cremer et al., “The evolution of invasiveness in garden ants,” PLoS
One, vol. 3, no. 12. Public Library of Science, 2008.
ista: Cremer S, Ugelvig LV, Drijfhout F, Schlick Steiner B, Steiner F, Seifert B,
Hughes D, Schulz A, Petersen K, Konrad H, Stauffer C, Kiran K, Espadaler X, D’Ettorre
P, Aktaç N, Eilenberg J, Jones G, Nash D, Pedersen J, Boomsma J. 2008. The evolution
of invasiveness in garden ants. PLoS One. 3(12).
mla: Cremer, Sylvia, et al. “The Evolution of Invasiveness in Garden Ants.” PLoS
One, vol. 3, no. 12, Public Library of Science, 2008, doi:10.1371/journal.pone.0003838.
short: S. Cremer, L.V. Ugelvig, F. Drijfhout, B. Schlick Steiner, F. Steiner, B.
Seifert, D. Hughes, A. Schulz, K. Petersen, H. Konrad, C. Stauffer, K. Kiran,
X. Espadaler, P. D’Ettorre, N. Aktaç, J. Eilenberg, G. Jones, D. Nash, J. Pedersen,
J. Boomsma, PLoS One 3 (2008).
date_created: 2018-12-11T12:05:49Z
date_published: 2008-12-03T00:00:00Z
date_updated: 2021-01-12T07:53:06Z
day: '03'
doi: 10.1371/journal.pone.0003838
extern: '1'
intvolume: ' 3'
issue: '12'
language:
- iso: eng
month: '12'
oa_version: None
publication: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '2247'
status: public
title: The evolution of invasiveness in garden ants
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2008'
...