---
_id: '2949'
author:
- first_name: David
full_name: Dupret, David
last_name: Dupret
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
citation:
ama: Dupret D, Csicsvari JL. The medial entorhinal cortex keeps Up. Nature Neuroscience.
2012;15(11):1471-1472. doi:10.1038/nn.3245
apa: Dupret, D., & Csicsvari, J. L. (2012). The medial entorhinal cortex keeps
Up. Nature Neuroscience. Nature Publishing Group. https://doi.org/10.1038/nn.3245
chicago: Dupret, David, and Jozsef L Csicsvari. “The Medial Entorhinal Cortex Keeps
Up.” Nature Neuroscience. Nature Publishing Group, 2012. https://doi.org/10.1038/nn.3245.
ieee: D. Dupret and J. L. Csicsvari, “The medial entorhinal cortex keeps Up,” Nature
Neuroscience, vol. 15, no. 11. Nature Publishing Group, pp. 1471–1472, 2012.
ista: Dupret D, Csicsvari JL. 2012. The medial entorhinal cortex keeps Up. Nature
Neuroscience. 15(11), 1471–1472.
mla: Dupret, David, and Jozsef L. Csicsvari. “The Medial Entorhinal Cortex Keeps
Up.” Nature Neuroscience, vol. 15, no. 11, Nature Publishing Group, 2012,
pp. 1471–72, doi:10.1038/nn.3245.
short: D. Dupret, J.L. Csicsvari, Nature Neuroscience 15 (2012) 1471–1472.
date_created: 2018-12-11T12:00:30Z
date_published: 2012-11-01T00:00:00Z
date_updated: 2021-01-12T07:39:59Z
day: '01'
department:
- _id: JoCs
doi: 10.1038/nn.3245
intvolume: ' 15'
issue: '11'
language:
- iso: eng
main_file_link:
- url: http://www.mrcbndu.ox.ac.uk/publications/medial-entorhinal-cortex-keeps
month: '11'
oa_version: None
page: 1471 - 1472
publication: Nature Neuroscience
publication_status: published
publisher: Nature Publishing Group
publist_id: '3782'
quality_controlled: '1'
scopus_import: 1
status: public
title: The medial entorhinal cortex keeps Up
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2012'
...
---
_id: '2950'
abstract:
- lang: eng
text: Contractile actomyosin rings drive various fundamental morphogenetic processes
ranging from cytokinesis to wound healing. Actomyosin rings are generally thought
to function by circumferential contraction. Here, we show that the spreading of
the enveloping cell layer (EVL) over the yolk cell during zebrafish gastrulation
is driven by a contractile actomyosin ring. In contrast to previous suggestions,
we find that this ring functions not only by circumferential contraction but also
by a flow-friction mechanism. This generates a pulling force through resistance
against retrograde actomyosin flow. EVL spreading proceeds normally in situations
where circumferential contraction is unproductive, indicating that the flow-friction
mechanism is sufficient. Thus, actomyosin rings can function in epithelial morphogenesis
through a combination of cable-constriction and flow-friction mechanisms.
acknowledged_ssus:
- _id: SSU
author:
- first_name: Martin
full_name: Behrndt, Martin
id: 3ECECA3A-F248-11E8-B48F-1D18A9856A87
last_name: Behrndt
- first_name: Guillaume
full_name: Salbreux, Guillaume
last_name: Salbreux
- first_name: Pedro
full_name: Campinho, Pedro
id: 3AFBBC42-F248-11E8-B48F-1D18A9856A87
last_name: Campinho
orcid: 0000-0002-8526-5416
- first_name: Robert
full_name: Hauschild, Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
orcid: 0000-0001-9843-3522
- first_name: Felix
full_name: Oswald, Felix
last_name: Oswald
- first_name: Julia
full_name: Roensch, Julia
id: 4220E59C-F248-11E8-B48F-1D18A9856A87
last_name: Roensch
- first_name: Stephan
full_name: Grill, Stephan
last_name: Grill
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
citation:
ama: Behrndt M, Salbreux G, Campinho P, et al. Forces driving epithelial spreading
in zebrafish gastrulation. Science. 2012;338(6104):257-260. doi:10.1126/science.1224143
apa: Behrndt, M., Salbreux, G., Campinho, P., Hauschild, R., Oswald, F., Roensch,
J., … Heisenberg, C.-P. J. (2012). Forces driving epithelial spreading in zebrafish
gastrulation. Science. American Association for the Advancement of Science.
https://doi.org/10.1126/science.1224143
chicago: Behrndt, Martin, Guillaume Salbreux, Pedro Campinho, Robert Hauschild,
Felix Oswald, Julia Roensch, Stephan Grill, and Carl-Philipp J Heisenberg. “Forces
Driving Epithelial Spreading in Zebrafish Gastrulation.” Science. American
Association for the Advancement of Science, 2012. https://doi.org/10.1126/science.1224143.
ieee: M. Behrndt et al., “Forces driving epithelial spreading in zebrafish
gastrulation,” Science, vol. 338, no. 6104. American Association for the
Advancement of Science, pp. 257–260, 2012.
ista: Behrndt M, Salbreux G, Campinho P, Hauschild R, Oswald F, Roensch J, Grill
S, Heisenberg C-PJ. 2012. Forces driving epithelial spreading in zebrafish gastrulation.
Science. 338(6104), 257–260.
mla: Behrndt, Martin, et al. “Forces Driving Epithelial Spreading in Zebrafish Gastrulation.”
Science, vol. 338, no. 6104, American Association for the Advancement of
Science, 2012, pp. 257–60, doi:10.1126/science.1224143.
short: M. Behrndt, G. Salbreux, P. Campinho, R. Hauschild, F. Oswald, J. Roensch,
S. Grill, C.-P.J. Heisenberg, Science 338 (2012) 257–260.
date_created: 2018-12-11T12:00:30Z
date_published: 2012-10-12T00:00:00Z
date_updated: 2023-02-21T17:02:44Z
day: '12'
department:
- _id: CaHe
- _id: Bio
doi: 10.1126/science.1224143
intvolume: ' 338'
issue: '6104'
language:
- iso: eng
month: '10'
oa_version: None
page: 257 - 260
project:
- _id: 252ABD0A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I 930-B20
name: Control of Epithelial Cell Layer Spreading in Zebrafish
publication: Science
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '3778'
quality_controlled: '1'
related_material:
record:
- id: '1403'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Forces driving epithelial spreading in zebrafish gastrulation
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 338
year: '2012'
...
---
_id: '2951'
abstract:
- lang: eng
text: Differential cell adhesion and cortex tension are thought to drive cell sorting
by controlling cell-cell contact formation. Here, we show that cell adhesion and
cortex tension have different mechanical functions in controlling progenitor cell-cell
contact formation and sorting during zebrafish gastrulation. Cortex tension controls
cell-cell contact expansion by modulating interfacial tension at the contact.
By contrast, adhesion has little direct function in contact expansion, but instead
is needed to mechanically couple the cortices of adhering cells at their contacts,
allowing cortex tension to control contact expansion. The coupling function of
adhesion is mediated by E-cadherin and limited by the mechanical anchoring of
E-cadherin to the cortex. Thus, cell adhesion provides the mechanical scaffold
for cell cortex tension to drive cell sorting during gastrulation.
acknowledged_ssus:
- _id: SSU
author:
- first_name: Jean-Léon
full_name: Maître, Jean-Léon
id: 48F1E0D8-F248-11E8-B48F-1D18A9856A87
last_name: Maître
orcid: 0000-0002-3688-1474
- first_name: Hélène
full_name: Berthoumieux, Hélène
last_name: Berthoumieux
- first_name: Gabriel
full_name: Krens, Gabriel
id: 2B819732-F248-11E8-B48F-1D18A9856A87
last_name: Krens
orcid: 0000-0003-4761-5996
- first_name: Guillaume
full_name: Salbreux, Guillaume
last_name: Salbreux
- first_name: Frank
full_name: Julicher, Frank
last_name: Julicher
- first_name: Ewa
full_name: Paluch, Ewa
last_name: Paluch
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
citation:
ama: Maître J-L, Berthoumieux H, Krens G, et al. Adhesion functions in cell sorting
by mechanically coupling the cortices of adhering cells. Science. 2012;338(6104):253-256.
doi:10.1126/science.1225399
apa: Maître, J.-L., Berthoumieux, H., Krens, G., Salbreux, G., Julicher, F., Paluch,
E., & Heisenberg, C.-P. J. (2012). Adhesion functions in cell sorting by mechanically
coupling the cortices of adhering cells. Science. American Association
for the Advancement of Science. https://doi.org/10.1126/science.1225399
chicago: Maître, Jean-Léon, Hélène Berthoumieux, Gabriel Krens, Guillaume Salbreux,
Frank Julicher, Ewa Paluch, and Carl-Philipp J Heisenberg. “Adhesion Functions
in Cell Sorting by Mechanically Coupling the Cortices of Adhering Cells.” Science.
American Association for the Advancement of Science, 2012. https://doi.org/10.1126/science.1225399.
ieee: J.-L. Maître et al., “Adhesion functions in cell sorting by mechanically
coupling the cortices of adhering cells,” Science, vol. 338, no. 6104.
American Association for the Advancement of Science, pp. 253–256, 2012.
ista: Maître J-L, Berthoumieux H, Krens G, Salbreux G, Julicher F, Paluch E, Heisenberg
C-PJ. 2012. Adhesion functions in cell sorting by mechanically coupling the cortices
of adhering cells. Science. 338(6104), 253–256.
mla: Maître, Jean-Léon, et al. “Adhesion Functions in Cell Sorting by Mechanically
Coupling the Cortices of Adhering Cells.” Science, vol. 338, no. 6104,
American Association for the Advancement of Science, 2012, pp. 253–56, doi:10.1126/science.1225399.
short: J.-L. Maître, H. Berthoumieux, G. Krens, G. Salbreux, F. Julicher, E. Paluch,
C.-P.J. Heisenberg, Science 338 (2012) 253–256.
date_created: 2018-12-11T12:00:31Z
date_published: 2012-10-12T00:00:00Z
date_updated: 2021-01-12T07:40:00Z
day: '12'
department:
- _id: CaHe
doi: 10.1126/science.1225399
intvolume: ' 338'
issue: '6104'
language:
- iso: eng
month: '10'
oa_version: None
page: 253 - 256
publication: Science
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '3777'
quality_controlled: '1'
scopus_import: 1
status: public
title: Adhesion functions in cell sorting by mechanically coupling the cortices of
adhering cells
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 338
year: '2012'
...
---
_id: '2952'
abstract:
- lang: eng
text: Body axis elongation represents a common and fundamental morphogenetic process
in development. A key mechanism triggering body axis elongation without additional
growth is convergent extension (CE), whereby a tissue undergoes simultaneous narrowing
and extension. Both collective cell migration and cell intercalation are thought
to drive CE and are used to different degrees in various species as they elongate
their body axis. Here, we provide an overview of CE as a general strategy for
body axis elongation and discuss conserved and divergent mechanisms underlying
CE among different species.
acknowledgement: 'M.T. is supported by the UK Medical Research Council (MRC) and Royal
Society and C.-P.H. by the Fonds zur Förderung der wissenschaftlichen Forschung
(FWF), Deutsche Forschungsgemeinschaft (DFG) and Institute of Science and Technology
Austria. '
author:
- first_name: Masazumi
full_name: Tada, Masazumi
last_name: Tada
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
citation:
ama: Tada M, Heisenberg C-PJ. Convergent extension Using collective cell migration
and cell intercalation to shape embryos. Development. 2012;139(21):3897-3904.
doi:10.1242/dev.073007
apa: Tada, M., & Heisenberg, C.-P. J. (2012). Convergent extension Using collective
cell migration and cell intercalation to shape embryos. Development. Company
of Biologists. https://doi.org/10.1242/dev.073007
chicago: Tada, Masazumi, and Carl-Philipp J Heisenberg. “Convergent Extension Using
Collective Cell Migration and Cell Intercalation to Shape Embryos.” Development.
Company of Biologists, 2012. https://doi.org/10.1242/dev.073007.
ieee: M. Tada and C.-P. J. Heisenberg, “Convergent extension Using collective cell
migration and cell intercalation to shape embryos,” Development, vol. 139,
no. 21. Company of Biologists, pp. 3897–3904, 2012.
ista: Tada M, Heisenberg C-PJ. 2012. Convergent extension Using collective cell
migration and cell intercalation to shape embryos. Development. 139(21), 3897–3904.
mla: Tada, Masazumi, and Carl-Philipp J. Heisenberg. “Convergent Extension Using
Collective Cell Migration and Cell Intercalation to Shape Embryos.” Development,
vol. 139, no. 21, Company of Biologists, 2012, pp. 3897–904, doi:10.1242/dev.073007.
short: M. Tada, C.-P.J. Heisenberg, Development 139 (2012) 3897–3904.
date_created: 2018-12-11T12:00:31Z
date_published: 2012-11-01T00:00:00Z
date_updated: 2021-01-12T07:40:00Z
day: '01'
department:
- _id: CaHe
doi: 10.1242/dev.073007
intvolume: ' 139'
issue: '21'
language:
- iso: eng
month: '11'
oa_version: None
page: 3897 - 3904
publication: Development
publication_status: published
publisher: Company of Biologists
publist_id: '3776'
quality_controlled: '1'
scopus_import: 1
status: public
title: Convergent extension Using collective cell migration and cell intercalation
to shape embryos
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 139
year: '2012'
...
---
_id: '2953'
author:
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
- first_name: Reinhard
full_name: Fässler, Reinhard
last_name: Fässler
citation:
ama: Heisenberg C-PJ, Fässler R. Cell-cell adhesion and extracellular matrix diversity
counts. Current Opinion in Cell Biology. 2012;24(5):559-561. doi:10.1016/j.ceb.2012.09.002
apa: Heisenberg, C.-P. J., & Fässler, R. (2012). Cell-cell adhesion and extracellular
matrix diversity counts. Current Opinion in Cell Biology. Elsevier. https://doi.org/10.1016/j.ceb.2012.09.002
chicago: Heisenberg, Carl-Philipp J, and Reinhard Fässler. “Cell-Cell Adhesion and
Extracellular Matrix Diversity Counts.” Current Opinion in Cell Biology.
Elsevier, 2012. https://doi.org/10.1016/j.ceb.2012.09.002.
ieee: C.-P. J. Heisenberg and R. Fässler, “Cell-cell adhesion and extracellular
matrix diversity counts,” Current Opinion in Cell Biology, vol. 24, no.
5. Elsevier, pp. 559–561, 2012.
ista: Heisenberg C-PJ, Fässler R. 2012. Cell-cell adhesion and extracellular matrix
diversity counts. Current Opinion in Cell Biology. 24(5), 559–561.
mla: Heisenberg, Carl-Philipp J., and Reinhard Fässler. “Cell-Cell Adhesion and
Extracellular Matrix Diversity Counts.” Current Opinion in Cell Biology,
vol. 24, no. 5, Elsevier, 2012, pp. 559–61, doi:10.1016/j.ceb.2012.09.002.
short: C.-P.J. Heisenberg, R. Fässler, Current Opinion in Cell Biology 24 (2012)
559–561.
date_created: 2018-12-11T12:00:31Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2021-01-12T07:40:01Z
day: '01'
department:
- _id: CaHe
doi: 10.1016/j.ceb.2012.09.002
intvolume: ' 24'
issue: '5'
language:
- iso: eng
month: '10'
oa_version: None
page: 559 - 561
publication: Current Opinion in Cell Biology
publication_status: published
publisher: Elsevier
publist_id: '3773'
quality_controlled: '1'
scopus_import: 1
status: public
title: Cell-cell adhesion and extracellular matrix diversity counts
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 24
year: '2012'
...
---
_id: '2954'
abstract:
- lang: eng
text: Spontaneous postsynaptic currents (PSCs) provide key information about the
mechanisms of synaptic transmission and the activity modes of neuronal networks.
However, detecting spontaneous PSCs in vitro and in vivo has been challenging,
because of the small amplitude, the variable kinetics, and the undefined time
of generation of these events. Here, we describe a, to our knowledge, new method
for detecting spontaneous synaptic events by deconvolution, using a template that
approximates the average time course of spontaneous PSCs. A recorded PSC trace
is deconvolved from the template, resulting in a series of delta-like functions.
The maxima of these delta-like events are reliably detected, revealing the precise
onset times of the spontaneous PSCs. Among all detection methods, the deconvolution-based
method has a unique temporal resolution, allowing the detection of individual
events in high-frequency bursts. Furthermore, the deconvolution-based method has
a high amplitude resolution, because deconvolution can substantially increase
the signal/noise ratio. When tested against previously published methods using
experimental data, the deconvolution-based method was superior for spontaneous
PSCs recorded in vivo. Using the high-resolution deconvolution-based detection
algorithm, we show that the frequency of spontaneous excitatory postsynaptic currents
in dentate gyrus granule cells is 4.5 times higher in vivo than in vitro.
acknowledgement: "This work was supported by the Deutsche Forschungsgemeinschaft (TR3/B10)
and a European Research Council Advanced grant to P.J.\r\nWe thank H. Hu, S. J.
Guzman, and C. Schmidt-Hieber for critically reading the manuscript, I. Koeva and
F. Marr for technical support, and E. Kramberger for editorial assistance.\r\n"
author:
- first_name: Alejandro
full_name: Pernia-Andrade, Alejandro
id: 36963E98-F248-11E8-B48F-1D18A9856A87
last_name: Pernia-Andrade
- first_name: Sarit
full_name: Goswami, Sarit
id: 3A578F32-F248-11E8-B48F-1D18A9856A87
last_name: Goswami
- first_name: Yvonne
full_name: Stickler, Yvonne
id: 63B76600-E9CC-11E9-9B5F-82450873F7A1
last_name: Stickler
- first_name: Ulrich
full_name: Fröbe, Ulrich
last_name: Fröbe
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Pernia-Andrade A, Goswami S, Stickler Y, Fröbe U, Schlögl A, Jonas PM. A deconvolution
based method with high sensitivity and temporal resolution for detection of spontaneous
synaptic currents in vitro and in vivo. Biophysical Journal. 2012;103(7):1429-1439.
doi:10.1016/j.bpj.2012.08.039
apa: Pernia-Andrade, A., Goswami, S., Stickler, Y., Fröbe, U., Schlögl, A., &
Jonas, P. M. (2012). A deconvolution based method with high sensitivity and temporal
resolution for detection of spontaneous synaptic currents in vitro and in vivo.
Biophysical Journal. Biophysical. https://doi.org/10.1016/j.bpj.2012.08.039
chicago: Pernia-Andrade, Alejandro, Sarit Goswami, Yvonne Stickler, Ulrich Fröbe,
Alois Schlögl, and Peter M Jonas. “A Deconvolution Based Method with High Sensitivity
and Temporal Resolution for Detection of Spontaneous Synaptic Currents in Vitro
and in Vivo.” Biophysical Journal. Biophysical, 2012. https://doi.org/10.1016/j.bpj.2012.08.039.
ieee: A. Pernia-Andrade, S. Goswami, Y. Stickler, U. Fröbe, A. Schlögl, and P. M.
Jonas, “A deconvolution based method with high sensitivity and temporal resolution
for detection of spontaneous synaptic currents in vitro and in vivo,” Biophysical
Journal, vol. 103, no. 7. Biophysical, pp. 1429–1439, 2012.
ista: Pernia-Andrade A, Goswami S, Stickler Y, Fröbe U, Schlögl A, Jonas PM. 2012.
A deconvolution based method with high sensitivity and temporal resolution for
detection of spontaneous synaptic currents in vitro and in vivo. Biophysical Journal.
103(7), 1429–1439.
mla: Pernia-Andrade, Alejandro, et al. “A Deconvolution Based Method with High Sensitivity
and Temporal Resolution for Detection of Spontaneous Synaptic Currents in Vitro
and in Vivo.” Biophysical Journal, vol. 103, no. 7, Biophysical, 2012,
pp. 1429–39, doi:10.1016/j.bpj.2012.08.039.
short: A. Pernia-Andrade, S. Goswami, Y. Stickler, U. Fröbe, A. Schlögl, P.M. Jonas,
Biophysical Journal 103 (2012) 1429–1439.
date_created: 2018-12-11T12:00:32Z
date_published: 2012-10-03T00:00:00Z
date_updated: 2021-01-12T07:40:01Z
day: '03'
department:
- _id: PeJo
- _id: ScienComp
doi: 10.1016/j.bpj.2012.08.039
external_id:
pmid:
- '23062335'
intvolume: ' 103'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3471482/
month: '10'
oa: 1
oa_version: Submitted Version
page: 1429 - 1439
pmid: 1
project:
- _id: 25BDE9A4-B435-11E9-9278-68D0E5697425
grant_number: SFB-TR3-TP10B
name: Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen
publication: Biophysical Journal
publication_status: published
publisher: Biophysical
publist_id: '3774'
quality_controlled: '1'
scopus_import: 1
status: public
title: A deconvolution based method with high sensitivity and temporal resolution
for detection of spontaneous synaptic currents in vitro and in vivo
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 103
year: '2012'
...
---
_id: '2955'
abstract:
- lang: eng
text: 'We consider two-player stochastic games played on finite graphs with reachability
objectives where the first player tries to ensure a target state to be visited
almost-surely (i.e., with probability 1), or positively (i.e., with positive probability),
no matter the strategy of the second player. We classify such games according
to the information and the power of randomization available to the players. On
the basis of information, the game can be one-sided with either (a) player 1,
or (b) player 2 having partial observation (and the other player has perfect observation),
or two-sided with (c) both players having partial observation. On the basis of
randomization, the players (a) may not be allowed to use randomization (pure strategies),
or (b) may choose a probability distribution over actions but the actual random
choice is external and not visible to the player (actions invisible), or (c) may
use full randomization. Our main results for pure strategies are as follows. (1)
For one-sided games with player 1 having partial observation we show that (in
contrast to full randomized strategies) belief-based (subset-construction based)
strategies are not sufficient, and we present an exponential upper bound on memory
both for almostsure and positive winning strategies; we show that the problem
of deciding the existence of almost-sure and positive winning strategies for player
1 is EXPTIME-complete. (2) For one-sided games with player 2 having partial observation
we show that non-elementary memory is both necessary and sufficient for both almost-sure
and positive winning strategies. (3) We show that for the general (two-sided)
case finite-memory strategies are sufficient for both positive and almost-sure
winning, and at least non-elementary memory is required. We establish the equivalence
of the almost-sure winning problems for pure strategies and for randomized strategies
with actions invisible. Our equivalence result exhibits serious flaws in previous
results of the literature: we show a non-elementary memory lower bound for almost-sure
winning whereas an exponential upper bound was previously claimed.'
acknowledgement: 'This work was partially supported by FWF Grant No P 23499-N23, FWF
NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft
faculty fellows award.'
article_number: '6280436'
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Partial-observation stochastic games: How to win when
belief fails. In: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on
Logic in Computer Science. IEEE; 2012. doi:10.1109/LICS.2012.28'
apa: 'Chatterjee, K., & Doyen, L. (2012). Partial-observation stochastic games:
How to win when belief fails. In Proceedings of the 2012 27th Annual ACM/IEEE
Symposium on Logic in Computer Science. Dubrovnik, Croatia: IEEE. https://doi.org/10.1109/LICS.2012.28'
chicago: 'Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic
Games: How to Win When Belief Fails.” In Proceedings of the 2012 27th Annual
ACM/IEEE Symposium on Logic in Computer Science. IEEE, 2012. https://doi.org/10.1109/LICS.2012.28.'
ieee: 'K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to
win when belief fails,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium
on Logic in Computer Science, Dubrovnik, Croatia, 2012.'
ista: 'Chatterjee K, Doyen L. 2012. Partial-observation stochastic games: How to
win when belief fails. Proceedings of the 2012 27th Annual ACM/IEEE Symposium
on Logic in Computer Science. LICS: Logic in Computer Science, 6280436.'
mla: 'Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic
Games: How to Win When Belief Fails.” Proceedings of the 2012 27th Annual ACM/IEEE
Symposium on Logic in Computer Science, 6280436, IEEE, 2012, doi:10.1109/LICS.2012.28.'
short: K. Chatterjee, L. Doyen, in:, Proceedings of the 2012 27th Annual ACM/IEEE
Symposium on Logic in Computer Science, IEEE, 2012.
conference:
end_date: 2012-06-28
location: Dubrovnik, Croatia
name: 'LICS: Logic in Computer Science'
start_date: 2012-06-25
date_created: 2018-12-11T12:00:32Z
date_published: 2012-08-23T00:00:00Z
date_updated: 2023-02-23T12:23:43Z
day: '23'
department:
- _id: KrCh
doi: 10.1109/LICS.2012.28
ec_funded: 1
external_id:
arxiv:
- '1107.2141'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1107.2141
month: '08'
oa: 1
oa_version: Preprint
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer
Science
publication_status: published
publisher: IEEE
publist_id: '3771'
quality_controlled: '1'
related_material:
record:
- id: '2211'
relation: later_version
status: public
- id: '5381'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: 'Partial-observation stochastic games: How to win when belief fails'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '2956'
abstract:
- lang: eng
text: 'Two-player games on graphs are central in many problems in formal verification
and program analysis such as synthesis and verification of open systems. In this
work we consider solving recursive game graphs (or pushdown game graphs) that
can model the control flow of sequential programs with recursion. While pushdown
games have been studied before with qualitative objectives, such as reachability
and parity objectives, in this work we study for the first time such games with
the most well-studied quantitative objective, namely, mean payoff objectives.
In pushdown games two types of strategies are relevant: (1) global strategies,
that depend on the entire global history; and (2) modular strategies, that have
only local memory and thus do not depend on the context of invocation, but only
on the history of the current invocation of the module. Our main results are as
follows: (1) One-player pushdown games with mean-payoff objectives under global
strategies are decidable in polynomial time. (2) Two-player pushdown games with
mean-payoff objectives under global strategies are undecidable. (3) One-player
pushdown games with mean-payoff objectives under modular strategies are NP-hard.
(4) Two-player pushdown games with mean-payoff objectives under modular strategies
can be solved in NP (i.e., both one-player and two-player pushdown games with
mean-payoff objectives under modular strategies are NP-complete). We also establish
the optimal strategy complexity showing that global strategies for mean-payoff
objectives require infinite memory even in one-player pushdown games; and memoryless
modular strategies are sufficient in two-player pushdown games. Finally we also
show that all the problems have the same computational complexity if the stack
boundedness condition is added, where along with the mean-payoff objective the
player must also ensure that the stack height is bounded.'
acknowledgement: "The research was supported by Austrian Science Fund (FWF) Grant
No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph
Games), Microsoft faculty fellows award, the Israeli Centers of Research Excellence
(ICORE) program, (Center No. 4/11), the RICH Model Toolkit (ICT COST Action IC0901),
and was carried out in partial fulfillment of the requirements for the Ph.D. degree
of the second author.\r\nA Technical Report of this paper is available via internal
link."
article_number: '6280438'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Yaron
full_name: Velner, Yaron
last_name: Velner
citation:
ama: 'Chatterjee K, Velner Y. Mean payoff pushdown games. In: Proceedings of
the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE;
2012. doi:10.1109/LICS.2012.30'
apa: 'Chatterjee, K., & Velner, Y. (2012). Mean payoff pushdown games. In Proceedings
of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. Dubrovnik,
Croatia : IEEE. https://doi.org/10.1109/LICS.2012.30'
chicago: Chatterjee, Krishnendu, and Yaron Velner. “Mean Payoff Pushdown Games.”
In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer
Science. IEEE, 2012. https://doi.org/10.1109/LICS.2012.30.
ieee: K. Chatterjee and Y. Velner, “Mean payoff pushdown games,” in Proceedings
of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik,
Croatia , 2012.
ista: 'Chatterjee K, Velner Y. 2012. Mean payoff pushdown games. Proceedings of
the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic
in Computer Science, 6280438.'
mla: Chatterjee, Krishnendu, and Yaron Velner. “Mean Payoff Pushdown Games.” Proceedings
of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, 6280438,
IEEE, 2012, doi:10.1109/LICS.2012.30.
short: K. Chatterjee, Y. Velner, in:, Proceedings of the 2012 27th Annual ACM/IEEE
Symposium on Logic in Computer Science, IEEE, 2012.
conference:
end_date: 2012-06-28
location: 'Dubrovnik, Croatia '
name: 'LICS: Logic in Computer Science'
start_date: 2012-06-25
date_created: 2018-12-11T12:00:32Z
date_published: 2012-08-23T00:00:00Z
date_updated: 2023-02-23T12:23:30Z
day: '23'
department:
- _id: KrCh
doi: 10.1109/LICS.2012.30
ec_funded: 1
language:
- iso: eng
month: '08'
oa_version: None
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer
Science
publication_status: published
publisher: IEEE
publist_id: '3770'
quality_controlled: '1'
related_material:
record:
- id: '5377'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Mean payoff pushdown games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '2957'
abstract:
- lang: eng
text: 'We consider probabilistic automata on infinite words with acceptance defined
by parity conditions. We consider three qualitative decision problems: (i) the
positive decision problem asks whether there is a word that is accepted with positive
probability; (ii) the almost decision problem asks whether there is a word that
is accepted with probability 1; and (iii) the limit decision problem asks whether
words are accepted with probability arbitrarily close to 1. We unify and generalize
several decidability results for probabilistic automata over infinite words, and
identify a robust (closed under union and intersection) subclass of probabilistic
automata for which all the qualitative decision problems are decidable for parity
conditions. We also show that if the input words are restricted to lasso shape
(regular) words, then the positive and almost problems are decidable for all probabilistic
automata with parity conditions. For most decidable problems we show an optimal
PSPACE-complete complexity bound.'
article_number: '6280437'
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Mathieu
full_name: Tracol, Mathieu
id: 3F54FA38-F248-11E8-B48F-1D18A9856A87
last_name: Tracol
citation:
ama: 'Chatterjee K, Tracol M. Decidable problems for probabilistic automata on infinite
words. In: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic
in Computer Science. IEEE; 2012. doi:10.1109/LICS.2012.29'
apa: 'Chatterjee, K., & Tracol, M. (2012). Decidable problems for probabilistic
automata on infinite words. In Proceedings of the 2012 27th Annual ACM/IEEE
Symposium on Logic in Computer Science. Dubrovnik, Croatia : IEEE. https://doi.org/10.1109/LICS.2012.29'
chicago: Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic
Automata on Infinite Words.” In Proceedings of the 2012 27th Annual ACM/IEEE
Symposium on Logic in Computer Science. IEEE, 2012. https://doi.org/10.1109/LICS.2012.29.
ieee: K. Chatterjee and M. Tracol, “Decidable problems for probabilistic automata
on infinite words,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium
on Logic in Computer Science, Dubrovnik, Croatia , 2012.
ista: 'Chatterjee K, Tracol M. 2012. Decidable problems for probabilistic automata
on infinite words. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic
in Computer Science. LICS: Logic in Computer Science, 6280437.'
mla: Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic
Automata on Infinite Words.” Proceedings of the 2012 27th Annual ACM/IEEE Symposium
on Logic in Computer Science, 6280437, IEEE, 2012, doi:10.1109/LICS.2012.29.
short: K. Chatterjee, M. Tracol, in:, Proceedings of the 2012 27th Annual ACM/IEEE
Symposium on Logic in Computer Science, IEEE, 2012.
conference:
end_date: 2012-06-28
location: 'Dubrovnik, Croatia '
name: 'LICS: Logic in Computer Science'
start_date: 2012-06-25
date_created: 2018-12-11T12:00:33Z
date_published: 2012-08-23T00:00:00Z
date_updated: 2023-02-23T12:23:51Z
day: '23'
department:
- _id: KrCh
doi: 10.1109/LICS.2012.29
ec_funded: 1
external_id:
arxiv:
- '1107.2091'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1107.2091
month: '08'
oa: 1
oa_version: Preprint
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer
Science
publication_status: published
publisher: IEEE
publist_id: '3769'
quality_controlled: '1'
related_material:
record:
- id: '5384'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Decidable problems for probabilistic automata on infinite words
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '2958'
abstract:
- lang: eng
text: 'The activity of hippocampal pyramidal cells reflects both the current position
of the animal and information related to its current behavior. Here we investigated
whether single hippocampal neurons can encode several independent features defining
trials during a memory task. We also tested whether task-related information is
represented by partial remapping of the place cell population or, instead, via
firing rate modulation of spatially stable place cells. To address these two questions,
the activity of hippocampal neurons was recorded in rats performing a conditional
discrimination task on a modified T-maze in which the identity of a food reward
guided behavior. When the rat was on the central arm of the maze, the firing rate
of pyramidal cells changed depending on two independent factors: (1) the identity
of the food reward given to the animal and (2) the previous location of the animal
on the maze. Importantly, some pyramidal cells encoded information relative to
both factors. This trial-type specific and retrospective coding did not interfere
with the spatial representation of the maze: hippocampal cells had stable place
fields and their theta-phase precession profiles were unaltered during the task,
indicating that trial-related information was encoded via rate remapping. During
error trials, encoding of both trial-related information and spatial location
was impaired. Finally, we found that pyramidal cells also encode trial-related
information via rate remapping during the continuous version of the rewarded alternation
task without delays. These results suggest that hippocampal neurons can encode
several task-related cognitive aspects via rate remapping.'
acknowledgement: J.C. was supported by a MRC Intramural Programme Grant (U138197111)
and a European Research Council Starter Grant (281511). K.A. held a Wellcome Trust
PhD studentship and a Humboldt Research Fellowship for Postdoctoral Researchers.
D.M.B. was supported by Wellcome Trust Senior Fellowships (074385 and 087736).
author:
- first_name: Kevin
full_name: Allen, Kevin
last_name: Allen
- first_name: J Nick
full_name: Rawlins, J Nick
last_name: Rawlins
- first_name: David
full_name: Bannerman, David
last_name: Bannerman
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
citation:
ama: Allen K, Rawlins JN, Bannerman D, Csicsvari JL. Hippocampal place cells can
encode multiple trial-dependent features through rate remapping. Journal of
Neuroscience. 2012;32(42):14752-14766. doi:10.1523/JNEUROSCI.6175-11.2012
apa: Allen, K., Rawlins, J. N., Bannerman, D., & Csicsvari, J. L. (2012). Hippocampal
place cells can encode multiple trial-dependent features through rate remapping.
Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.6175-11.2012
chicago: Allen, Kevin, J Nick Rawlins, David Bannerman, and Jozsef L Csicsvari.
“Hippocampal Place Cells Can Encode Multiple Trial-Dependent Features through
Rate Remapping.” Journal of Neuroscience. Society for Neuroscience, 2012.
https://doi.org/10.1523/JNEUROSCI.6175-11.2012.
ieee: K. Allen, J. N. Rawlins, D. Bannerman, and J. L. Csicsvari, “Hippocampal place
cells can encode multiple trial-dependent features through rate remapping,” Journal
of Neuroscience, vol. 32, no. 42. Society for Neuroscience, pp. 14752–14766,
2012.
ista: Allen K, Rawlins JN, Bannerman D, Csicsvari JL. 2012. Hippocampal place cells
can encode multiple trial-dependent features through rate remapping. Journal of
Neuroscience. 32(42), 14752–14766.
mla: Allen, Kevin, et al. “Hippocampal Place Cells Can Encode Multiple Trial-Dependent
Features through Rate Remapping.” Journal of Neuroscience, vol. 32, no.
42, Society for Neuroscience, 2012, pp. 14752–66, doi:10.1523/JNEUROSCI.6175-11.2012.
short: K. Allen, J.N. Rawlins, D. Bannerman, J.L. Csicsvari, Journal of Neuroscience
32 (2012) 14752–14766.
date_created: 2018-12-11T12:00:33Z
date_published: 2012-10-17T00:00:00Z
date_updated: 2021-01-12T07:40:03Z
day: '17'
department:
- _id: JoCs
doi: 10.1523/JNEUROSCI.6175-11.2012
ec_funded: 1
external_id:
pmid:
- '23077060'
intvolume: ' 32'
issue: '42'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3531717/
month: '10'
oa: 1
oa_version: Submitted Version
page: 14752 - 14766
pmid: 1
project:
- _id: 257A4776-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '281511'
name: Memory-related information processing in neuronal circuits of the hippocampus
and entorhinal cortex
publication: Journal of Neuroscience
publication_status: published
publisher: Society for Neuroscience
publist_id: '3768'
quality_controlled: '1'
scopus_import: 1
status: public
title: Hippocampal place cells can encode multiple trial-dependent features through
rate remapping
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2012'
...
---
_id: '2959'
abstract:
- lang: eng
text: We study maximum likelihood estimation in Gaussian graphical models from a
geometric point of view. An algebraic elimination criterion allows us to find
exact lower bounds on the number of observations needed to ensure that the maximum
likelihood estimator (MLE) exists with probability one. This is applied to bipartite
graphs, grids and colored graphs. We also study the ML degree, and we present
the first instance of a graph for which the MLE exists with probability one, even
when the number of observations equals the treewidth.
acknowledgement: "I wish to thank Bernd Sturmfels for many helpful discus- sions and
Steffen Lauritzen for introducing me to the problem of the existence of the MLE
in Gaussian graphical models. I would also like to thank two referees who provided
helpful comments on the original version of this paper.\r\n"
author:
- first_name: Caroline
full_name: Uhler, Caroline
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
citation:
ama: Uhler C. Geometry of maximum likelihood estimation in Gaussian graphical models.
Annals of Statistics. 2012;40(1):238-261. doi:10.1214/11-AOS957
apa: Uhler, C. (2012). Geometry of maximum likelihood estimation in Gaussian graphical
models. Annals of Statistics. Institute of Mathematical Statistics. https://doi.org/10.1214/11-AOS957
chicago: Uhler, Caroline. “Geometry of Maximum Likelihood Estimation in Gaussian
Graphical Models.” Annals of Statistics. Institute of Mathematical Statistics,
2012. https://doi.org/10.1214/11-AOS957.
ieee: C. Uhler, “Geometry of maximum likelihood estimation in Gaussian graphical
models,” Annals of Statistics, vol. 40, no. 1. Institute of Mathematical
Statistics, pp. 238–261, 2012.
ista: Uhler C. 2012. Geometry of maximum likelihood estimation in Gaussian graphical
models. Annals of Statistics. 40(1), 238–261.
mla: Uhler, Caroline. “Geometry of Maximum Likelihood Estimation in Gaussian Graphical
Models.” Annals of Statistics, vol. 40, no. 1, Institute of Mathematical
Statistics, 2012, pp. 238–61, doi:10.1214/11-AOS957.
short: C. Uhler, Annals of Statistics 40 (2012) 238–261.
date_created: 2018-12-11T12:00:33Z
date_published: 2012-02-01T00:00:00Z
date_updated: 2021-01-12T07:40:04Z
day: '01'
department:
- _id: CaUh
doi: 10.1214/11-AOS957
intvolume: ' 40'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1012.2643
month: '02'
oa: 1
oa_version: Preprint
page: 238 - 261
publication: Annals of Statistics
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '3767'
quality_controlled: '1'
scopus_import: 1
status: public
title: Geometry of maximum likelihood estimation in Gaussian graphical models
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 40
year: '2012'
...
---
_id: '2962'
abstract:
- lang: eng
text: The choice of summary statistics is a crucial step in approximate Bayesian
computation (ABC). Since statistics are often not sufficient, this choice involves
a trade-off between loss of information and reduction of dimensionality. The latter
may increase the efficiency of ABC. Here, we propose an approach for choosing
summary statistics based on boosting, a technique from the machine learning literature.
We consider different types of boosting and compare them to partial least squares
regression as an alternative. To mitigate the lack of sufficiency, we also propose
an approach for choosing summary statistics locally, in the putative neighborhood
of the true parameter value. We study a demographic model motivated by the re-introduction
of Alpine ibex (Capra ibex) into the Swiss Alps. The parameters of interest are
the mean and standard deviation across microsatellites of the scaled ancestral
mutation rate (θanc = 4 Ne u), and the proportion of males obtaining access to
matings per breeding season (ω). By simulation, we assess the properties of the
posterior distribution obtained with the various methods. According to our criteria,
ABC with summary statistics chosen locally via boosting with the L2-loss performs
best. Applying that method to the ibex data, we estimate θanc ≈ 1.288, and find
that most of the variation across loci of the ancestral mutation rate u is between
7.7×10−4 and 3.5×10−3 per locus per generation. The proportion of males with access
to matings is estimated to ω ≈ 0.21, which is in good agreement with recent independent
estimates.
acknowledged_ssus:
- _id: ScienComp
author:
- first_name: Simon
full_name: Aeschbacher, Simon
id: 2D35326E-F248-11E8-B48F-1D18A9856A87
last_name: Aeschbacher
- first_name: Mark
full_name: Beaumont, Mark
last_name: Beaumont
- first_name: Andreas
full_name: Futschik, Andreas
last_name: Futschik
citation:
ama: Aeschbacher S, Beaumont M, Futschik A. A novel approach for choosing summary
statistics in approximate Bayesian computation. Genetics. 2012;192(3):1027-1047.
doi:10.1534/genetics.112.143164
apa: Aeschbacher, S., Beaumont, M., & Futschik, A. (2012). A novel approach
for choosing summary statistics in approximate Bayesian computation. Genetics.
Genetics Society of America. https://doi.org/10.1534/genetics.112.143164
chicago: Aeschbacher, Simon, Mark Beaumont, and Andreas Futschik. “A Novel Approach
for Choosing Summary Statistics in Approximate Bayesian Computation.” Genetics.
Genetics Society of America, 2012. https://doi.org/10.1534/genetics.112.143164.
ieee: S. Aeschbacher, M. Beaumont, and A. Futschik, “A novel approach for choosing
summary statistics in approximate Bayesian computation,” Genetics, vol.
192, no. 3. Genetics Society of America, pp. 1027–1047, 2012.
ista: Aeschbacher S, Beaumont M, Futschik A. 2012. A novel approach for choosing
summary statistics in approximate Bayesian computation. Genetics. 192(3), 1027–1047.
mla: Aeschbacher, Simon, et al. “A Novel Approach for Choosing Summary Statistics
in Approximate Bayesian Computation.” Genetics, vol. 192, no. 3, Genetics
Society of America, 2012, pp. 1027–47, doi:10.1534/genetics.112.143164.
short: S. Aeschbacher, M. Beaumont, A. Futschik, Genetics 192 (2012) 1027–1047.
date_created: 2018-12-11T12:00:34Z
date_published: 2012-11-01T00:00:00Z
date_updated: 2021-01-12T07:40:05Z
day: '01'
department:
- _id: NiBa
doi: 10.1534/genetics.112.143164
external_id:
pmid:
- '22960215'
intvolume: ' 192'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3522150/
month: '11'
oa: 1
oa_version: Submitted Version
page: 1027 - 1047
pmid: 1
publication: Genetics
publication_status: published
publisher: Genetics Society of America
publist_id: '3763'
quality_controlled: '1'
scopus_import: 1
status: public
title: A novel approach for choosing summary statistics in approximate Bayesian computation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 192
year: '2012'
...
---
_id: '2963'
abstract:
- lang: eng
text: 'Zebra finches are an ubiquitous model system for the study of vocal learning
in animal communication. Their song has been well described, but its possible
function(s) in social communication are only partly understood. The so-called
‘directed song’ is a high-intensity, high-performance song given during courtship
in close proximity to the female, which is known to mediate mate choice and mating.
However, this singing mode constitutes only a fraction of zebra finch males’ prolific
song output. Potential communicative functions of their second, ‘undirected’ singing
mode remain unresolved in the face of contradicting reports of both facilitating
and inhibiting effects of social company on singing. We addressed this issue by
experimentally manipulating social contexts in a within-subject design, comparing
a solo versus male or female only company condition, each lasting for 24 hours.
Males’ total song output was significantly higher when a conspecific was in audible
and visible distance than when they were alone. Male and female company had an
equally facilitating effect on song output. Our findings thus indicate that singing
motivation is facilitated rather than inhibited by social company, suggesting
that singing in zebra finches might function both in inter- and intrasexual communication. '
author:
- first_name: Fabienne
full_name: Jesse, Fabienne
id: 4C8C26A4-F248-11E8-B48F-1D18A9856A87
last_name: Jesse
- first_name: Katharina
full_name: Riebel, Katharina
last_name: Riebel
citation:
ama: Jesse F, Riebel K. Social facilitation of male song by male and female conspecifics
in the zebra finch, Taeniopygia guttata. Behavioural Processes. 2012;91(3):262-266.
doi:10.1016/j.beproc.2012.09.006
apa: Jesse, F., & Riebel, K. (2012). Social facilitation of male song by male
and female conspecifics in the zebra finch, Taeniopygia guttata. Behavioural
Processes. Elsevier. https://doi.org/10.1016/j.beproc.2012.09.006
chicago: Jesse, Fabienne, and Katharina Riebel. “Social Facilitation of Male Song
by Male and Female Conspecifics in the Zebra Finch, Taeniopygia Guttata.” Behavioural
Processes. Elsevier, 2012. https://doi.org/10.1016/j.beproc.2012.09.006.
ieee: F. Jesse and K. Riebel, “Social facilitation of male song by male and female
conspecifics in the zebra finch, Taeniopygia guttata,” Behavioural Processes,
vol. 91, no. 3. Elsevier, pp. 262–266, 2012.
ista: Jesse F, Riebel K. 2012. Social facilitation of male song by male and female
conspecifics in the zebra finch, Taeniopygia guttata. Behavioural Processes. 91(3),
262–266.
mla: Jesse, Fabienne, and Katharina Riebel. “Social Facilitation of Male Song by
Male and Female Conspecifics in the Zebra Finch, Taeniopygia Guttata.” Behavioural
Processes, vol. 91, no. 3, Elsevier, 2012, pp. 262–66, doi:10.1016/j.beproc.2012.09.006.
short: F. Jesse, K. Riebel, Behavioural Processes 91 (2012) 262–266.
date_created: 2018-12-11T12:00:35Z
date_published: 2012-11-01T00:00:00Z
date_updated: 2021-01-12T07:40:06Z
day: '01'
department:
- _id: JoBo
doi: 10.1016/j.beproc.2012.09.006
intvolume: ' 91'
issue: '3'
language:
- iso: eng
month: '11'
oa_version: None
page: 262 - 266
publication: Behavioural Processes
publication_status: published
publisher: Elsevier
publist_id: '3756'
quality_controlled: '1'
status: public
title: Social facilitation of male song by male and female conspecifics in the zebra
finch, Taeniopygia guttata
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 91
year: '2012'
...
---
_id: '2964'
abstract:
- lang: eng
text: 'CA3 pyramidal neurons are important for memory formation and pattern completion
in the hippocampal network. These neurons receive multiple excitatory inputs from
numerous sources. Therefore, the rules of spatiotemporal integration of multiple
synaptic inputs and propagation of action potentials are important to understand
how CA3 neurons contribute to higher brain functions at cellular level. By using
confocally targeted patch-clamp recording techniques, we investigated the biophysical
properties of rat CA3 pyramidal neuron dendrites. We found two distinct dendritic
domains critical for action potential initiation and propagation: In the proximal
domain, action potentials initiated in the axon backpropagate actively with large
amplitude and fast time course. In the distal domain, Na+-channel mediated dendritic
spikes are efficiently evoked by local dendritic depolarization or waveforms mimicking
synaptic events. These findings can be explained by a high Na+-to-K+ conductance
density ratio of CA3 pyramidal neuron dendrites. The results challenge the prevailing
view that proximal mossy fiber inputs activate CA3 pyramidal neurons more efficiently
than distal perforant inputs by showing that the distal synapses trigger a different
form of activity represented by dendritic spikes. The high probability of dendritic
spike initiation in the distal area may enhance the computational power of CA3
pyramidal neurons in the hippocampal network. '
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Sooyun
full_name: Kim, Sooyun
id: 394AB1C8-F248-11E8-B48F-1D18A9856A87
last_name: Kim
citation:
ama: Kim S. Active properties of hippocampal CA3 pyramidal neuron dendrites. 2012.
apa: Kim, S. (2012). Active properties of hippocampal CA3 pyramidal neuron dendrites.
Institute of Science and Technology Austria.
chicago: Kim, Sooyun. “Active Properties of Hippocampal CA3 Pyramidal Neuron Dendrites.”
Institute of Science and Technology Austria, 2012.
ieee: S. Kim, “Active properties of hippocampal CA3 pyramidal neuron dendrites,”
Institute of Science and Technology Austria, 2012.
ista: Kim S. 2012. Active properties of hippocampal CA3 pyramidal neuron dendrites.
Institute of Science and Technology Austria.
mla: Kim, Sooyun. Active Properties of Hippocampal CA3 Pyramidal Neuron Dendrites.
Institute of Science and Technology Austria, 2012.
short: S. Kim, Active Properties of Hippocampal CA3 Pyramidal Neuron Dendrites,
Institute of Science and Technology Austria, 2012.
date_created: 2018-12-11T12:00:35Z
date_published: 2012-06-01T00:00:00Z
date_updated: 2023-09-07T11:43:51Z
day: '01'
degree_awarded: PhD
department:
- _id: PeJo
- _id: GradSch
language:
- iso: eng
month: '06'
oa_version: None
page: '65'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '3755'
related_material:
record:
- id: '3258'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
title: Active properties of hippocampal CA3 pyramidal neuron dendrites
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2012'
...
---
_id: '2965'
abstract:
- lang: eng
text: Dieser Artikel soll die sechs verschiedenen Creative Commons Lizenzen erläutern
und ihre Bedeutung im Rahmen des wissenschaftlichen Publizierens und des Open
Access erklären (CC-BY, CC-BY-SA, CC-BY-NC, CC-BY-ND, CC-BYNC-SA, CC-BY-NC-ND).
author:
- first_name: Patrick
full_name: Danowski, Patrick
id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
last_name: Danowski
orcid: 0000-0002-6026-4409
citation:
ama: 'Danowski P. Kontext Open Access: Creative Commons. Mitteilungen der Vereinigung
Österreichischer Bibliothekarinnen & Bibliothekare. 2012;65(2):200-212.'
apa: 'Danowski, P. (2012). Kontext Open Access: Creative Commons. Mitteilungen
der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare. VÖB.'
chicago: 'Danowski, Patrick. “Kontext Open Access: Creative Commons.” Mitteilungen
der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare. VÖB,
2012.'
ieee: 'P. Danowski, “Kontext Open Access: Creative Commons,” Mitteilungen der
Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare, vol. 65,
no. 2. VÖB, pp. 200–212, 2012.'
ista: 'Danowski P. 2012. Kontext Open Access: Creative Commons. Mitteilungen der
Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare. 65(2), 200–212.'
mla: 'Danowski, Patrick. “Kontext Open Access: Creative Commons.” Mitteilungen
der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare, vol.
65, no. 2, VÖB, 2012, pp. 200–12.'
short: P. Danowski, Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen
& Bibliothekare 65 (2012) 200–212.
date_created: 2018-12-11T12:00:35Z
date_published: 2012-09-01T00:00:00Z
date_updated: 2021-01-12T07:40:07Z
day: '01'
ddc:
- '020'
department:
- _id: E-Lib
file:
- access_level: open_access
checksum: 162eea47d9d840c26b496ba6ae4d1c09
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:42Z
date_updated: 2020-07-14T12:45:57Z
file_id: '4703'
file_name: IST-2012-95-v1+1_sp-beitrag_danowski_kontext_open_access_creative_commons.pdf
file_size: 503345
relation: main_file
file_date_updated: 2020-07-14T12:45:57Z
has_accepted_license: '1'
intvolume: ' 65'
issue: '2'
language:
- iso: ger
main_file_link:
- open_access: '1'
url: ' http://hdl.handle.net/10760/17625'
month: '09'
oa: 1
oa_version: Published Version
page: 200 - 212
popular_science: '1'
publication: Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare
publication_status: published
publisher: VÖB
publist_id: '3754'
pubrep_id: '95'
scopus_import: 1
status: public
title: 'Kontext Open Access: Creative Commons'
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 65
year: '2012'
...
---
_id: '2966'
abstract:
- lang: eng
text: 'Background: The outcome of male-male competition can be predicted from the
relative fighting qualities of the opponents, which often depend on their age.
In insects, freshly emerged and still sexually inactive males are morphologically
indistinct from older, sexually active males. These young inactive males may thus
be easy targets for older males if they cannot conceal themselves from their attacks.
The ant Cardiocondyla obscurior is characterised by lethal fighting between wingless
(" ergatoid" ) males. Here, we analyse for how long young males are
defenceless after eclosion, and how early adult males can detect the presence
of rival males.Results: We found that old ergatoid males consistently won fights
against ergatoid males younger than two days. Old males did not differentiate
between different types of unpigmented pupae several days before emergence, but
had more frequent contact to ready-to-eclose pupae of female sexuals and winged
males than of workers and ergatoid males. In rare cases, old ergatoid males displayed
alleviated biting of pigmented ergatoid male pupae shortly before adult eclosion,
as well as copulation attempts to dark pupae of female sexuals and winged males.
Ergatoid male behaviour may be promoted by a closer similarity of the chemical
profile of ready-to-eclose pupae to the profile of adults than that of young pupae
several days prior to emergence.Conclusion: Young ergatoid males of C. obscurior
would benefit greatly by hiding their identity from older, resident males, as
they are highly vulnerable during the first two days of their adult lives. In
contrast to the winged males of the same species, which are able to prevent ergatoid
male attacks by chemical female mimicry, young ergatoids do not seem to be able
to produce a protective chemical profile. Conflicts in male-male competition between
ergatoid males of different age thus seem to be resolved in favour of the older
males. This might represent selection at the colony level rather than the individual
level. © 2012 Cremer et al.; licensee BioMed Central Ltd.'
article_number: '7'
author:
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
- first_name: Masaki
full_name: Suefuji, Masaki
last_name: Suefuji
- first_name: Alexandra
full_name: Schrempf, Alexandra
last_name: Schrempf
- first_name: Jürgen
full_name: Heinze, Jürgen
last_name: Heinze
citation:
ama: Cremer S, Suefuji M, Schrempf A, Heinze J. The dynamics of male-male competition
in Cardiocondyla obscurior ants. BMC Ecology. 2012;12. doi:10.1186/1472-6785-12-7
apa: Cremer, S., Suefuji, M., Schrempf, A., & Heinze, J. (2012). The dynamics
of male-male competition in Cardiocondyla obscurior ants. BMC Ecology.
BioMed Central. https://doi.org/10.1186/1472-6785-12-7
chicago: Cremer, Sylvia, Masaki Suefuji, Alexandra Schrempf, and Jürgen Heinze.
“The Dynamics of Male-Male Competition in Cardiocondyla Obscurior Ants.” BMC
Ecology. BioMed Central, 2012. https://doi.org/10.1186/1472-6785-12-7.
ieee: S. Cremer, M. Suefuji, A. Schrempf, and J. Heinze, “The dynamics of male-male
competition in Cardiocondyla obscurior ants,” BMC Ecology, vol. 12. BioMed
Central, 2012.
ista: Cremer S, Suefuji M, Schrempf A, Heinze J. 2012. The dynamics of male-male
competition in Cardiocondyla obscurior ants. BMC Ecology. 12, 7.
mla: Cremer, Sylvia, et al. “The Dynamics of Male-Male Competition in Cardiocondyla
Obscurior Ants.” BMC Ecology, vol. 12, 7, BioMed Central, 2012, doi:10.1186/1472-6785-12-7.
short: S. Cremer, M. Suefuji, A. Schrempf, J. Heinze, BMC Ecology 12 (2012).
date_created: 2018-12-11T12:00:35Z
date_published: 2012-06-15T00:00:00Z
date_updated: 2021-01-12T07:40:07Z
day: '15'
ddc:
- '570'
department:
- _id: SyCr
doi: 10.1186/1472-6785-12-7
file:
- access_level: open_access
checksum: 03d004bdff3724fb1627e3f5004bad80
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:44Z
date_updated: 2020-07-14T12:45:57Z
file_id: '4706'
file_name: IST-2012-94-v1+1_1472-6785-12-7.pdf
file_size: 489994
relation: main_file
file_date_updated: 2020-07-14T12:45:57Z
has_accepted_license: '1'
intvolume: ' 12'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: BMC Ecology
publication_status: published
publisher: BioMed Central
publist_id: '3753'
pubrep_id: '94'
quality_controlled: '1'
scopus_import: 1
status: public
title: The dynamics of male-male competition in Cardiocondyla obscurior 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: 12
year: '2012'
...
---
_id: '2967'
abstract:
- lang: eng
text: For programs whose data variables range over Boolean or finite domains, program
verification is decidable, and this forms the basis of recent tools for software
model checking. In this article, we consider algorithmic verification of programs
that use Boolean variables, and in addition, access a single read-only array whose
length is potentially unbounded, and whose elements range over an unbounded data
domain. We show that the reachability problem, while undecidable in general, is
(1) PSPACE-complete for programs in which the array-accessing for-loops are not
nested, (2) decidable for a restricted class of programs with doubly nested loops.
The second result establishes connections to automata and logics defining languages
over data words.
acknowledgement: This research was supported in part by the NSF Cybertrust award CNS
0524059, by the European Research Council (ERC) Advanced Investigator Grant QUAREM,
and by the Austrian Science Fund (FWF) project S11402-N23.
article_number: '27'
author:
- first_name: Rajeev
full_name: Alur, Rajeev
last_name: Alur
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- first_name: Scott
full_name: Weinstein, Scott
last_name: Weinstein
citation:
ama: Alur R, Cerny P, Weinstein S. Algorithmic analysis of array-accessing programs.
ACM Transactions on Computational Logic (TOCL). 2012;13(3). doi:10.1145/2287718.2287727
apa: Alur, R., Cerny, P., & Weinstein, S. (2012). Algorithmic analysis of array-accessing
programs. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/2287718.2287727
chicago: Alur, Rajeev, Pavol Cerny, and Scott Weinstein. “Algorithmic Analysis of
Array-Accessing Programs.” ACM Transactions on Computational Logic (TOCL).
ACM, 2012. https://doi.org/10.1145/2287718.2287727.
ieee: R. Alur, P. Cerny, and S. Weinstein, “Algorithmic analysis of array-accessing
programs,” ACM Transactions on Computational Logic (TOCL), vol. 13, no.
3. ACM, 2012.
ista: Alur R, Cerny P, Weinstein S. 2012. Algorithmic analysis of array-accessing
programs. ACM Transactions on Computational Logic (TOCL). 13(3), 27.
mla: Alur, Rajeev, et al. “Algorithmic Analysis of Array-Accessing Programs.” ACM
Transactions on Computational Logic (TOCL), vol. 13, no. 3, 27, ACM, 2012,
doi:10.1145/2287718.2287727.
short: R. Alur, P. Cerny, S. Weinstein, ACM Transactions on Computational Logic
(TOCL) 13 (2012).
date_created: 2018-12-11T12:00:36Z
date_published: 2012-08-01T00:00:00Z
date_updated: 2023-02-23T12:09:43Z
day: '01'
department:
- _id: ToHe
doi: 10.1145/2287718.2287727
ec_funded: 1
intvolume: ' 13'
issue: '3'
language:
- iso: eng
month: '08'
oa_version: None
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: ACM Transactions on Computational Logic (TOCL)
publication_status: published
publisher: ACM
publist_id: '3748'
quality_controlled: '1'
related_material:
record:
- id: '4403'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Algorithmic analysis of array-accessing programs
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2012'
...
---
_id: '2968'
abstract:
- lang: eng
text: Little is known about the stability of trophic relationships in complex natural
communities over evolutionary timescales. Here, we use sequence data from 18 nuclear
loci to reconstruct and compare the intraspecific histories of major Pleistocene
refugial populations in the Middle East, the Balkans and Iberia in a guild of
four Chalcid parasitoids (Cecidostiba fungosa, Cecidostiba semifascia, Hobbya
stenonota and Mesopolobus amaenus) all attacking Cynipid oak galls. We develop
a likelihood method to numerically estimate models of divergence between three
populations from multilocus data. We investigate the power of this framework on
simulated data, and-using triplet alignments of intronic loci-quantify the support
for all possible divergence relationships between refugial populations in the
four parasitoids. Although an East to West order of population divergence has
highest support in all but one species, we cannot rule out alternative population
tree topologies. Comparing the estimated times of population splits between species,
we find that one species, M. amaenus, has a significantly older history than the
rest of the guild and must have arrived in central Europe at least one glacial
cycle prior to other guild members. This suggests that although all four species
may share a common origin in the East, they expanded westwards into Europe at
different times. © 2012 Blackwell Publishing Ltd.
acknowledgement: "This work was supported by funding from the UK Natural Environment
Research Council to KL (NE/I020288/1) and GS (NE/H000038/1, NE/E014453/1, NER/B/504406/1,
NER/B/S2003/00856) and a grant from the European Research Council (250152) to NB.\r\nWe
thank Majide Tavakoli, Juli Pujade-Villar and Pablo-Fuentes Utrilla for contributing
specimens. Mike Hickerson and three anonymous reviewers gave helpful comments on
earlier versions of the manuscript. "
author:
- first_name: Konrad
full_name: Lohse, Konrad
last_name: Lohse
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: George
full_name: Melika, George
last_name: Melika
- first_name: Graham
full_name: Stone, Graham
last_name: Stone
citation:
ama: Lohse K, Barton NH, Melika G, Stone G. A likelihood based comparison of population
histories in a parasitoid guild. Molecular Ecology. 2012;21(18):4605-4617.
doi:10.1111/j.1365-294X.2012.05700.x
apa: Lohse, K., Barton, N. H., Melika, G., & Stone, G. (2012). A likelihood
based comparison of population histories in a parasitoid guild. Molecular Ecology.
Wiley-Blackwell. https://doi.org/10.1111/j.1365-294X.2012.05700.x
chicago: Lohse, Konrad, Nicholas H Barton, George Melika, and Graham Stone. “A Likelihood
Based Comparison of Population Histories in a Parasitoid Guild.” Molecular
Ecology. Wiley-Blackwell, 2012. https://doi.org/10.1111/j.1365-294X.2012.05700.x.
ieee: K. Lohse, N. H. Barton, G. Melika, and G. Stone, “A likelihood based comparison
of population histories in a parasitoid guild,” Molecular Ecology, vol.
21, no. 18. Wiley-Blackwell, pp. 4605–4617, 2012.
ista: Lohse K, Barton NH, Melika G, Stone G. 2012. A likelihood based comparison
of population histories in a parasitoid guild. Molecular Ecology. 21(18), 4605–4617.
mla: Lohse, Konrad, et al. “A Likelihood Based Comparison of Population Histories
in a Parasitoid Guild.” Molecular Ecology, vol. 21, no. 18, Wiley-Blackwell,
2012, pp. 4605–17, doi:10.1111/j.1365-294X.2012.05700.x.
short: K. Lohse, N.H. Barton, G. Melika, G. Stone, Molecular Ecology 21 (2012) 4605–4617.
date_created: 2018-12-11T12:00:36Z
date_published: 2012-09-01T00:00:00Z
date_updated: 2023-05-30T13:07:47Z
day: '01'
ddc:
- '570'
- '579'
department:
- _id: NiBa
doi: 10.1111/j.1365-294X.2012.05700.x
ec_funded: 1
file:
- access_level: open_access
checksum: c14ee4cb2a8ba9575bfd8a9bb7a883bb
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:47Z
date_updated: 2020-07-14T12:45:57Z
file_id: '5304'
file_name: IST-2014-296-v1+1_4_wasps_revised3.pdf
file_size: 235820
relation: main_file
- access_level: open_access
checksum: f00afc5b887c8222014b57375b8caece
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:48Z
date_updated: 2020-07-14T12:45:57Z
file_id: '5305'
file_name: IST-2014-296-v1+2_4_wasps_Supporting2.pdf
file_size: 41975
relation: main_file
file_date_updated: 2020-07-14T12:45:57Z
has_accepted_license: '1'
intvolume: ' 21'
issue: '18'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 4605 - 4617
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Molecular Ecology
publication_status: published
publisher: Wiley-Blackwell
publist_id: '3746'
pubrep_id: '296'
quality_controlled: '1'
related_material:
record:
- id: '13075'
relation: research_data
status: public
scopus_import: 1
status: public
title: A likelihood based comparison of population histories in a parasitoid guild
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 21
year: '2012'
...
---
_id: '2969'
abstract:
- lang: eng
text: "The coupling between presynaptic Ca^(2+) channels and Ca^(2+) sensors of
exocytosis is a key determinant of synaptic transmission. Evoked release from
parvalbumin (PV)-expressing interneurons is triggered by nanodomain coupling of
P/Q-type Ca^(2+) channels, whereas release from cholecystokinin (CCK)-containing
interneurons is generated by microdomain coupling of N-type channels. Nanodomain
coupling has several functional advantages, including speed and efficacy of transmission.
One potential disadvantage is that stochastic\r\nopening of presynaptic Ca^(2+)
channels may trigger spontaneous transmitter release. We addressed this possibility
in rat hippocampal\r\ngranule cells, which receive converging inputs from different
inhibitory sources. Both reduction of extracellular Ca^(2+) concentration and
the unselective Ca^(2+) channel blocker Cd^(2+) reduced the frequency of miniature
IPSCs (mIPSCs) in granule cells by ~50%, suggesting that the opening of presynaptic
Ca^(2+) channels contributes to spontaneous release. Application of the selective
P/Q-type Ca^(2+) channel blocker\r\nω-agatoxin IVa had no detectable effects,
whereas both the N-type blocker ω-conotoxin GVIa and the L-type blocker nimodipine
reduced\r\nmIPSC frequency. Furthermore, both the fast Ca^(2+) chelator BAPTA-AM
and the slow chelator EGTA-AM reduced the mIPSC frequency,\r\nsuggesting that
Ca^(2+)-dependent spontaneous release is triggered by microdomain rather than
nanodomain coupling. The CB_(1) receptor\r\nagonist WIN 55212-2 also decreased
spontaneous release; this effect was occluded by prior application of ω-conotoxin
GVIa, suggesting that a major fraction of Ca^(2+)-dependent spontaneous release
was generated at the terminals of CCK-expressing interneurons. Tonic inhibition
generated by spontaneous opening of presynaptic N- and L-type Ca^(2+) channels
may be important for hippocampal information processing.\r\n"
acknowledgement: This work was supported by grants from the Deutsche Forschungsgemeinschaft
(TR 3/B10, Leibniz program, GSC-4 Spemann Graduate School) and the European Union
(European Research Council Advanced Grant).
author:
- first_name: Sarit
full_name: Goswami, Sarit
id: 3A578F32-F248-11E8-B48F-1D18A9856A87
last_name: Goswami
- first_name: Iancu
full_name: Bucurenciu, Iancu
last_name: Bucurenciu
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Goswami S, Bucurenciu I, Jonas PM. Miniature IPSCs in hippocampal granule cells
are triggered by voltage-gated Ca^(2+) channels via microdomain coupling. Journal
of Neuroscience. 2012;32(41):14294-14304. doi:10.1523/JNEUROSCI.6104-11.2012
apa: Goswami, S., Bucurenciu, I., & Jonas, P. M. (2012). Miniature IPSCs in
hippocampal granule cells are triggered by voltage-gated Ca^(2+) channels via
microdomain coupling. Journal of Neuroscience. Society for Neuroscience.
https://doi.org/10.1523/JNEUROSCI.6104-11.2012
chicago: Goswami, Sarit, Iancu Bucurenciu, and Peter M Jonas. “Miniature IPSCs in
Hippocampal Granule Cells Are Triggered by Voltage-Gated Ca^(2+) Channels via
Microdomain Coupling.” Journal of Neuroscience. Society for Neuroscience,
2012. https://doi.org/10.1523/JNEUROSCI.6104-11.2012.
ieee: S. Goswami, I. Bucurenciu, and P. M. Jonas, “Miniature IPSCs in hippocampal
granule cells are triggered by voltage-gated Ca^(2+) channels via microdomain
coupling,” Journal of Neuroscience, vol. 32, no. 41. Society for Neuroscience,
pp. 14294–14304, 2012.
ista: Goswami S, Bucurenciu I, Jonas PM. 2012. Miniature IPSCs in hippocampal granule
cells are triggered by voltage-gated Ca^(2+) channels via microdomain coupling.
Journal of Neuroscience. 32(41), 14294–14304.
mla: Goswami, Sarit, et al. “Miniature IPSCs in Hippocampal Granule Cells Are Triggered
by Voltage-Gated Ca^(2+) Channels via Microdomain Coupling.” Journal of Neuroscience,
vol. 32, no. 41, Society for Neuroscience, 2012, pp. 14294–304, doi:10.1523/JNEUROSCI.6104-11.2012.
short: S. Goswami, I. Bucurenciu, P.M. Jonas, Journal of Neuroscience 32 (2012)
14294–14304.
date_created: 2018-12-11T12:00:36Z
date_published: 2012-10-10T00:00:00Z
date_updated: 2021-01-12T07:40:08Z
day: '10'
department:
- _id: PeJo
doi: 10.1523/JNEUROSCI.6104-11.2012
external_id:
pmid:
- '23055500'
intvolume: ' 32'
issue: '41'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3632771/
month: '10'
oa: 1
oa_version: Submitted Version
page: 14294 - 14304
pmid: 1
project:
- _id: 25BDE9A4-B435-11E9-9278-68D0E5697425
grant_number: SFB-TR3-TP10B
name: Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen
publication: Journal of Neuroscience
publication_status: published
publisher: Society for Neuroscience
publist_id: '3744'
quality_controlled: '1'
scopus_import: 1
status: public
title: Miniature IPSCs in hippocampal granule cells are triggered by voltage-gated
Ca^(2+) channels via microdomain coupling
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2012'
...
---
_id: '2970'
abstract:
- lang: eng
text: Morphogen gradients regulate the patterning and growth of many tissues, hence
a key question is how they are established and maintained during development.
Theoretical descriptions have helped to explain how gradient shape is controlled
by the rates of morphogen production, spreading and degradation. These effective
rates have been measured using fluorescence recovery after photobleaching (FRAP)
and photoactivation. To unravel which molecular events determine the effective
rates, such tissue-level assays have been combined with genetic analysis, high-resolution
assays, and models that take into account interactions with receptors, extracellular
components and trafficking. Nevertheless, because of the natural and experimental
data variability, and the underlying assumptions of transport models, it remains
challenging to conclusively distinguish between cellular mechanisms.
acknowledgement: AK is currently supported by an MRC CDF. MGG and OW were supported
by the Swiss National Science Foundation, grants from the Swiss SystemsX.ch initiative,
LipidX-2008/011, an ERC advanced investigator grant and the Polish-Swiss research
program.
author:
- first_name: Anna
full_name: Kicheva, Anna
id: 3959A2A0-F248-11E8-B48F-1D18A9856A87
last_name: Kicheva
orcid: 0000-0003-4509-4998
- first_name: Mark Tobias
full_name: Bollenbach, Mark Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
- first_name: Ortrud
full_name: Wartlick, Ortrud
last_name: Wartlick
- first_name: Frank
full_name: Julicher, Frank
last_name: Julicher
- first_name: Marcos
full_name: Gonzalez Gaitan, Marcos
last_name: Gonzalez Gaitan
citation:
ama: 'Kicheva A, Bollenbach MT, Wartlick O, Julicher F, Gonzalez Gaitan M. Investigating
the principles of morphogen gradient formation: from tissues to cells. Current
Opinion in Genetics & Development. 2012;22(6):527-532. doi:10.1016/j.gde.2012.08.004'
apa: 'Kicheva, A., Bollenbach, M. T., Wartlick, O., Julicher, F., & Gonzalez
Gaitan, M. (2012). Investigating the principles of morphogen gradient formation:
from tissues to cells. Current Opinion in Genetics & Development. Elsevier.
https://doi.org/10.1016/j.gde.2012.08.004'
chicago: 'Kicheva, Anna, Mark Tobias Bollenbach, Ortrud Wartlick, Frank Julicher,
and Marcos Gonzalez Gaitan. “Investigating the Principles of Morphogen Gradient
Formation: From Tissues to Cells.” Current Opinion in Genetics & Development.
Elsevier, 2012. https://doi.org/10.1016/j.gde.2012.08.004.'
ieee: 'A. Kicheva, M. T. Bollenbach, O. Wartlick, F. Julicher, and M. Gonzalez Gaitan,
“Investigating the principles of morphogen gradient formation: from tissues to
cells,” Current Opinion in Genetics & Development, vol. 22, no. 6.
Elsevier, pp. 527–532, 2012.'
ista: 'Kicheva A, Bollenbach MT, Wartlick O, Julicher F, Gonzalez Gaitan M. 2012.
Investigating the principles of morphogen gradient formation: from tissues to
cells. Current Opinion in Genetics & Development. 22(6), 527–532.'
mla: 'Kicheva, Anna, et al. “Investigating the Principles of Morphogen Gradient
Formation: From Tissues to Cells.” Current Opinion in Genetics & Development,
vol. 22, no. 6, Elsevier, 2012, pp. 527–32, doi:10.1016/j.gde.2012.08.004.'
short: A. Kicheva, M.T. Bollenbach, O. Wartlick, F. Julicher, M. Gonzalez Gaitan,
Current Opinion in Genetics & Development 22 (2012) 527–532.
date_created: 2018-12-11T12:00:37Z
date_published: 2012-12-01T00:00:00Z
date_updated: 2021-01-12T07:40:09Z
day: '01'
department:
- _id: ToBo
doi: 10.1016/j.gde.2012.08.004
intvolume: ' 22'
issue: '6'
language:
- iso: eng
month: '12'
oa_version: None
page: 527 - 532
publication: Current Opinion in Genetics & Development
publication_status: published
publisher: Elsevier
publist_id: '3739'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Investigating the principles of morphogen gradient formation: from tissues
to cells'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 22
year: '2012'
...