---
_id: '10899'
article_processing_charge: No
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: 'Barton NH. Differentiation. In: Encyclopedia of Biodiversity. 2nd ed.
Elsevier; 2013:508-515. doi:10.1016/b978-0-12-384719-5.00031-9'
apa: Barton, N. H. (2013). Differentiation. In Encyclopedia of Biodiversity
(2nd ed., pp. 508–515). Elsevier. https://doi.org/10.1016/b978-0-12-384719-5.00031-9
chicago: Barton, Nicholas H. “Differentiation.” In Encyclopedia of Biodiversity,
2nd ed., 508–15. Elsevier, 2013. https://doi.org/10.1016/b978-0-12-384719-5.00031-9.
ieee: N. H. Barton, “Differentiation,” in Encyclopedia of Biodiversity, 2nd
ed., Elsevier, 2013, pp. 508–515.
ista: 'Barton NH. 2013.Differentiation. In: Encyclopedia of Biodiversity. , 508–515.'
mla: Barton, Nicholas H. “Differentiation.” Encyclopedia of Biodiversity,
2nd ed., Elsevier, 2013, pp. 508–15, doi:10.1016/b978-0-12-384719-5.00031-9.
short: N.H. Barton, in:, Encyclopedia of Biodiversity, 2nd ed., Elsevier, 2013,
pp. 508–515.
date_created: 2022-03-21T07:46:22Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2022-06-20T09:18:06Z
day: '01'
department:
- _id: NiBa
doi: 10.1016/b978-0-12-384719-5.00031-9
edition: '2'
keyword:
- Adaptive landscape
- Cline
- Coalescent process
- Gene flow
- Hybrid zone
- Local adaptation
- Natural selection
- Neutral theory
- Population structure
- Speciation
language:
- iso: eng
month: '01'
oa_version: None
page: 508-515
publication: Encyclopedia of Biodiversity
publication_identifier:
isbn:
- 978-0-12-384720-1
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Differentiation
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '10900'
abstract:
- lang: eng
text: Leukocyte migration through the interstitial space is crucial for the maintenance
of tolerance and immunity. The main cues for leukocyte trafficking are chemokines
thought to directionally guide these cells towards their targets. However, model
systems that facilitate quantification of chemokine-guided leukocyte migration
in vivo are uncommon. Here we describe an ex vivo crawl-in assay using explanted
mouse ears that allows the visualization of chemokine-dependent dendritic cell
(DC) motility in the dermal interstitium in real time. We present methods for
the preparation of mouse ear sheets and their use in multidimensional confocal
imaging experiments to monitor and analyze the directional migration of fluorescently
labelled DCs through the dermis and into afferent lymphatic vessels. The assay
provides a more physiological approach to study leukocyte migration than in vitro
three-dimensional (3D) or 2-dimensional (2D) migration assays such as collagen
gels and transwell assays.
acknowledgement: We would like to thank Alexander Eichner and Ingrid de Vries for
discussion and critical reading of the manuscript, and Mary Frank for assistance
with the recording of videos and images in Fig. 1. M.S. is supported through funding
from the German Research Foundation (DFG). M.W. acknowledges the Alexander von Humboldt
Foundation for funding.
alternative_title:
- Methods in Molecular Biology
article_processing_charge: No
author:
- first_name: Michele
full_name: Weber, Michele
id: 3A3FC708-F248-11E8-B48F-1D18A9856A87
last_name: Weber
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
citation:
ama: 'Weber M, Sixt MK. Live Cell Imaging of Chemotactic Dendritic Cell Migration
in Explanted Mouse Ear Preparations. In: Cardona A, Ubogu E, eds. Chemokines.
Vol 1013. MIMB. Totowa, NJ: Humana Press; 2013:215-226. doi:10.1007/978-1-62703-426-5_14'
apa: 'Weber, M., & Sixt, M. K. (2013). Live Cell Imaging of Chemotactic Dendritic
Cell Migration in Explanted Mouse Ear Preparations. In A. Cardona & E. Ubogu
(Eds.), Chemokines (Vol. 1013, pp. 215–226). Totowa, NJ: Humana Press.
https://doi.org/10.1007/978-1-62703-426-5_14'
chicago: 'Weber, Michele, and Michael K Sixt. “Live Cell Imaging of Chemotactic
Dendritic Cell Migration in Explanted Mouse Ear Preparations.” In Chemokines,
edited by Astrid Cardona and Eroboghene Ubogu, 1013:215–26. MIMB. Totowa, NJ:
Humana Press, 2013. https://doi.org/10.1007/978-1-62703-426-5_14.'
ieee: 'M. Weber and M. K. Sixt, “Live Cell Imaging of Chemotactic Dendritic Cell
Migration in Explanted Mouse Ear Preparations,” in Chemokines, vol. 1013,
A. Cardona and E. Ubogu, Eds. Totowa, NJ: Humana Press, 2013, pp. 215–226.'
ista: 'Weber M, Sixt MK. 2013.Live Cell Imaging of Chemotactic Dendritic Cell Migration
in Explanted Mouse Ear Preparations. In: Chemokines. Methods in Molecular Biology,
vol. 1013, 215–226.'
mla: Weber, Michele, and Michael K. Sixt. “Live Cell Imaging of Chemotactic Dendritic
Cell Migration in Explanted Mouse Ear Preparations.” Chemokines, edited
by Astrid Cardona and Eroboghene Ubogu, vol. 1013, Humana Press, 2013, pp. 215–26,
doi:10.1007/978-1-62703-426-5_14.
short: M. Weber, M.K. Sixt, in:, A. Cardona, E. Ubogu (Eds.), Chemokines, Humana
Press, Totowa, NJ, 2013, pp. 215–226.
date_created: 2022-03-21T07:47:41Z
date_published: 2013-04-03T00:00:00Z
date_updated: 2023-09-05T13:15:33Z
day: '03'
department:
- _id: MiSi
doi: 10.1007/978-1-62703-426-5_14
editor:
- first_name: Astrid
full_name: Cardona, Astrid
last_name: Cardona
- first_name: Eroboghene
full_name: Ubogu, Eroboghene
last_name: Ubogu
external_id:
pmid:
- '23625502'
intvolume: ' 1013'
language:
- iso: eng
month: '04'
oa_version: None
page: 215-226
place: Totowa, NJ
pmid: 1
publication: Chemokines
publication_identifier:
eisbn:
- '9781627034265'
eissn:
- 1940-6029
isbn:
- '9781627034258'
issn:
- 1064-3745
publication_status: published
publisher: Humana Press
quality_controlled: '1'
scopus_import: '1'
series_title: MIMB
status: public
title: Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse
Ear Preparations
type: book_chapter
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 1013
year: '2013'
...
---
_id: '10902'
abstract:
- lang: eng
text: We consider how to edit strings from a source language so that the edited
strings belong to a target language, where the languages are given as deterministic
finite automata. Non-streaming (or offline) transducers perform edits given the
whole source string. We show that the class of deterministic one-pass transducers
with registers along with increment and min operation suffices for computing optimal
edit distance, whereas the same class of transducers without the min operation
is not sufficient. Streaming (or online) transducers perform edits as the letters
of the source string are received. We present a polynomial time algorithm for
the partial-repair problem that given a bound α asks for the construction of a
deterministic streaming transducer (if one exists) that ensures that the ‘maximum
fraction’ η of the strings of the source language are edited, within cost α, to
the target language.
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), and Microsoft faculty fellows award. Thanks to Gabriele Puppis for suggesting
the problem of identifying a deterministic transducer to compute the optimal cost,
and to Martin Chmelik for his comments on the introduction.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Siddhesh
full_name: Chaubal, Siddhesh
last_name: Chaubal
- first_name: Sasha
full_name: Rubin, Sasha
id: 2EC51194-F248-11E8-B48F-1D18A9856A87
last_name: Rubin
citation:
ama: 'Chatterjee K, Chaubal S, Rubin S. How to travel between languages. In: 7th
International Conference on Language and Automata Theory and Applications.
Vol 7810. LNCS. Berlin, Heidelberg: Springer Nature; 2013:214-225. doi:10.1007/978-3-642-37064-9_20'
apa: 'Chatterjee, K., Chaubal, S., & Rubin, S. (2013). How to travel between
languages. In 7th International Conference on Language and Automata Theory
and Applications (Vol. 7810, pp. 214–225). Berlin, Heidelberg: Springer Nature.
https://doi.org/10.1007/978-3-642-37064-9_20'
chicago: 'Chatterjee, Krishnendu, Siddhesh Chaubal, and Sasha Rubin. “How to Travel
between Languages.” In 7th International Conference on Language and Automata
Theory and Applications, 7810:214–25. LNCS. Berlin, Heidelberg: Springer Nature,
2013. https://doi.org/10.1007/978-3-642-37064-9_20.'
ieee: K. Chatterjee, S. Chaubal, and S. Rubin, “How to travel between languages,”
in 7th International Conference on Language and Automata Theory and Applications,
Bilbao, Spain, 2013, vol. 7810, pp. 214–225.
ista: 'Chatterjee K, Chaubal S, Rubin S. 2013. How to travel between languages.
7th International Conference on Language and Automata Theory and Applications.
LATA: Conference on Language and Automata Theory and ApplicationsLNCS, LNCS, vol.
7810, 214–225.'
mla: Chatterjee, Krishnendu, et al. “How to Travel between Languages.” 7th International
Conference on Language and Automata Theory and Applications, vol. 7810, Springer
Nature, 2013, pp. 214–25, doi:10.1007/978-3-642-37064-9_20.
short: K. Chatterjee, S. Chaubal, S. Rubin, in:, 7th International Conference on
Language and Automata Theory and Applications, Springer Nature, Berlin, Heidelberg,
2013, pp. 214–225.
conference:
end_date: 2013-04-05
location: Bilbao, Spain
name: 'LATA: Conference on Language and Automata Theory and Applications'
start_date: 2013-04-02
date_created: 2022-03-21T07:56:21Z
date_published: 2013-04-15T00:00:00Z
date_updated: 2023-09-05T15:10:38Z
day: '15'
department:
- _id: KrCh
doi: 10.1007/978-3-642-37064-9_20
ec_funded: 1
intvolume: ' 7810'
language:
- iso: eng
month: '04'
oa_version: None
page: 214-225
place: Berlin, Heidelberg
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _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: 7th International Conference on Language and Automata Theory and Applications
publication_identifier:
eisbn:
- '9783642370649'
eissn:
- 1611-3349
isbn:
- '9783642370632'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: How to travel between languages
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 7810
year: '2013'
...
---
_id: '2516'
abstract:
- lang: eng
text: 'We study the problem of object recognition for categories for which we have
no training examples, a task also called zero-data or zero-shot learning. This
situation has hardly been studied in computer vision research, even though it
occurs frequently: the world contains tens of thousands of different object classes
and for only few of them image collections have been formed and suitably annotated.
To tackle the problem we introduce attribute-based classification: objects are
identified based on a high-level description that is phrased in terms of semantic
attributes, such as the object''s color or shape. Because the identification of
each such property transcends the specific learning task at hand, the attribute
classifiers can be pre-learned independently, e.g. from existing image datasets
unrelated to the current task. Afterwards, new classes can be detected based on
their attribute representation, without the need for a new training phase. In
this paper we also introduce a new dataset, Animals with Attributes, of over 30,000
images of 50 animal classes, annotated with 85 semantic attributes. Extensive
experiments on this and two more datasets show that attribute-based classification
indeed is able to categorize images without access to any training images of the
target classes.'
article_processing_charge: No
author:
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
- first_name: Hannes
full_name: Nickisch, Hannes
last_name: Nickisch
- first_name: Stefan
full_name: Harmeling, Stefan
last_name: Harmeling
citation:
ama: Lampert C, Nickisch H, Harmeling S. Attribute-based classification for zero-shot
learning of object categories. IEEE Transactions on Pattern Analysis and Machine
Intelligence. 2013;36(3):453-465. doi:10.1109/TPAMI.2013.140
apa: Lampert, C., Nickisch, H., & Harmeling, S. (2013). Attribute-based classification
for zero-shot learning of object categories. IEEE Transactions on Pattern Analysis
and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2013.140
chicago: Lampert, Christoph, Hannes Nickisch, and Stefan Harmeling. “Attribute-Based
Classification for Zero-Shot Learning of Object Categories.” IEEE Transactions
on Pattern Analysis and Machine Intelligence. IEEE, 2013. https://doi.org/10.1109/TPAMI.2013.140.
ieee: C. Lampert, H. Nickisch, and S. Harmeling, “Attribute-based classification
for zero-shot learning of object categories,” IEEE Transactions on Pattern
Analysis and Machine Intelligence, vol. 36, no. 3. IEEE, pp. 453–465, 2013.
ista: Lampert C, Nickisch H, Harmeling S. 2013. Attribute-based classification for
zero-shot learning of object categories. IEEE Transactions on Pattern Analysis
and Machine Intelligence. 36(3), 453–465.
mla: Lampert, Christoph, et al. “Attribute-Based Classification for Zero-Shot Learning
of Object Categories.” IEEE Transactions on Pattern Analysis and Machine Intelligence,
vol. 36, no. 3, IEEE, 2013, pp. 453–65, doi:10.1109/TPAMI.2013.140.
short: C. Lampert, H. Nickisch, S. Harmeling, IEEE Transactions on Pattern Analysis
and Machine Intelligence 36 (2013) 453–465.
das_tickbox: '1'
date_created: 2018-12-11T11:58:08Z
date_published: 2013-07-30T00:00:00Z
date_updated: 2026-06-18T07:51:30Z
day: '30'
ddc:
- '000'
department:
- _id: ChLa
doi: 10.1109/TPAMI.2013.140
intvolume: ' 36'
issue: '3'
language:
- iso: eng
month: '07'
oa_version: None
page: 453 - 465
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_status: published
publisher: IEEE
publist_id: '4385'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Attribute-based classification for zero-shot learning of object categories
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2013'
...
---
_id: '12198'
abstract:
- lang: eng
text: The Arabidopsis thaliana central cell, the companion cell of the egg, undergoes
DNA demethylation before fertilization, but the targeting preferences, mechanism,
and biological significance of this process remain unclear. Here, we show that
active DNA demethylation mediated by the DEMETER DNA glycosylase accounts for
all of the demethylation in the central cell and preferentially targets small,
AT-rich, and nucleosome-depleted euchromatic transposable elements. The vegetative
cell, the companion cell of sperm, also undergoes DEMETER-dependent demethylation
of similar sequences, and lack of DEMETER in vegetative cells causes reduced small
RNA–directed DNA methylation of transposons in sperm. Our results demonstrate
that demethylation in companion cells reinforces transposon methylation in plant
gametes and likely contributes to stable silencing of transposable elements across
generations.
acknowledgement: We thank S. Harmer for assistance with the analysis of histone modifications,
the BioOptics team at the Vienna Biocenter Campus for sorting sperm and vegetative
cell nuclei, K. Slotkin for the LAT52p-amiRNA=GFP plasmid, and G. Drews for the
DD45p-GFP transgenic line. This work was partially funded by an NIH grant (GM69415)
to R.L.F., NSF grants (MCB-0918821 and IOS-1025890) to R.L.F. and D.Z., a Young
Investigator Grant from the Arnold and Mabel Beckman Foundation to D.Z., an Austrian
Science Fund (FWF) grant P21389-B03 to H.T., a Ruth L. Kirschstein NIH Predoctoral
Fellowship (GM093633) to C.A.I., a Fulbright Scholarship to J.A.R., a fellowship
from the Jane Coffin Childs Memorial Fund to A.Z., and a Robert and Colleen Haas
Scholarship to D.R. Sequencing data are deposited in GEO (GSE38935).
article_processing_charge: No
article_type: original
author:
- first_name: Christian A.
full_name: Ibarra, Christian A.
last_name: Ibarra
- first_name: Xiaoqi
full_name: Feng, Xiaoqi
id: e0164712-22ee-11ed-b12a-d80fcdf35958
last_name: Feng
orcid: 0000-0002-4008-1234
- first_name: Vera K.
full_name: Schoft, Vera K.
last_name: Schoft
- first_name: Tzung-Fu
full_name: Hsieh, Tzung-Fu
last_name: Hsieh
- first_name: Rie
full_name: Uzawa, Rie
last_name: Uzawa
- first_name: Jessica A.
full_name: Rodrigues, Jessica A.
last_name: Rodrigues
- first_name: Assaf
full_name: Zemach, Assaf
last_name: Zemach
- first_name: Nina
full_name: Chumak, Nina
last_name: Chumak
- first_name: Adriana
full_name: Machlicova, Adriana
last_name: Machlicova
- first_name: Toshiro
full_name: Nishimura, Toshiro
last_name: Nishimura
- first_name: Denisse
full_name: Rojas, Denisse
last_name: Rojas
- first_name: Robert L.
full_name: Fischer, Robert L.
last_name: Fischer
- first_name: Hisashi
full_name: Tamaru, Hisashi
last_name: Tamaru
- first_name: Daniel
full_name: Zilberman, Daniel
last_name: Zilberman
citation:
ama: Ibarra CA, Feng X, Schoft VK, et al. Active DNA demethylation in plant companion
cells reinforces transposon methylation in gametes. Science. 2012;337(6100):1360-1364.
doi:10.1126/science.1224839
apa: Ibarra, C. A., Feng, X., Schoft, V. K., Hsieh, T.-F., Uzawa, R., Rodrigues,
J. A., … Zilberman, D. (2012). Active DNA demethylation in plant companion cells
reinforces transposon methylation in gametes. Science. American Association
for the Advancement of Science. https://doi.org/10.1126/science.1224839
chicago: Ibarra, Christian A., Xiaoqi Feng, Vera K. Schoft, Tzung-Fu Hsieh, Rie
Uzawa, Jessica A. Rodrigues, Assaf Zemach, et al. “Active DNA Demethylation in
Plant Companion Cells Reinforces Transposon Methylation in Gametes.” Science.
American Association for the Advancement of Science, 2012. https://doi.org/10.1126/science.1224839.
ieee: C. A. Ibarra et al., “Active DNA demethylation in plant companion cells
reinforces transposon methylation in gametes,” Science, vol. 337, no. 6100.
American Association for the Advancement of Science, pp. 1360–1364, 2012.
ista: Ibarra CA, Feng X, Schoft VK, Hsieh T-F, Uzawa R, Rodrigues JA, Zemach A,
Chumak N, Machlicova A, Nishimura T, Rojas D, Fischer RL, Tamaru H, Zilberman
D. 2012. Active DNA demethylation in plant companion cells reinforces transposon
methylation in gametes. Science. 337(6100), 1360–1364.
mla: Ibarra, Christian A., et al. “Active DNA Demethylation in Plant Companion Cells
Reinforces Transposon Methylation in Gametes.” Science, vol. 337, no. 6100,
American Association for the Advancement of Science, 2012, pp. 1360–64, doi:10.1126/science.1224839.
short: C.A. Ibarra, X. Feng, V.K. Schoft, T.-F. Hsieh, R. Uzawa, J.A. Rodrigues,
A. Zemach, N. Chumak, A. Machlicova, T. Nishimura, D. Rojas, R.L. Fischer, H.
Tamaru, D. Zilberman, Science 337 (2012) 1360–1364.
date_created: 2023-01-16T09:21:24Z
date_published: 2012-09-14T00:00:00Z
date_updated: 2023-10-16T09:27:26Z
day: '14'
department:
- _id: XiFe
doi: 10.1126/science.1224839
external_id:
pmid:
- '22984074'
intvolume: ' 337'
issue: '6100'
keyword:
- Multidisciplinary
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4034762/
month: '09'
oa: 1
oa_version: Published Version
page: 1360-1364
pmid: 1
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: Active DNA demethylation in plant companion cells reinforces transposon methylation
in gametes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 337
year: '2012'
...
---
_id: '13075'
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, C. 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.
article_processing_charge: No
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: Graham
full_name: Stone, Graham
last_name: Stone
- first_name: George
full_name: Melika, George
last_name: Melika
citation:
ama: 'Lohse K, Barton NH, Stone G, Melika G. Data from: A likelihood-based comparison
of population histories in a parasitoid guild. 2012. doi:10.5061/DRYAD.0G0FS'
apa: 'Lohse, K., Barton, N. H., Stone, G., & Melika, G. (2012). Data from: A
likelihood-based comparison of population histories in a parasitoid guild. Dryad.
https://doi.org/10.5061/DRYAD.0G0FS'
chicago: 'Lohse, Konrad, Nicholas H Barton, Graham Stone, and George Melika. “Data
from: A Likelihood-Based Comparison of Population Histories in a Parasitoid Guild.”
Dryad, 2012. https://doi.org/10.5061/DRYAD.0G0FS.'
ieee: 'K. Lohse, N. H. Barton, G. Stone, and G. Melika, “Data from: A likelihood-based
comparison of population histories in a parasitoid guild.” Dryad, 2012.'
ista: 'Lohse K, Barton NH, Stone G, Melika G. 2012. Data from: A likelihood-based
comparison of population histories in a parasitoid guild, Dryad, 10.5061/DRYAD.0G0FS.'
mla: 'Lohse, Konrad, et al. Data from: A Likelihood-Based Comparison of Population
Histories in a Parasitoid Guild. Dryad, 2012, doi:10.5061/DRYAD.0G0FS.'
short: K. Lohse, N.H. Barton, G. Stone, G. Melika, (2012).
date_created: 2023-05-23T17:01:02Z
date_published: 2012-06-08T00:00:00Z
date_updated: 2025-05-28T11:56:58Z
day: '08'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.5061/DRYAD.0G0FS
license: https://creativecommons.org/publicdomain/zero/1.0/
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.0g0fs
month: '06'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '2968'
relation: used_in_publication
status: public
status: public
title: 'Data from: A likelihood-based comparison of population histories in a parasitoid
guild'
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '2048'
abstract:
- lang: eng
text: Leakage resilient cryptography attempts to incorporate side-channel leakage
into the black-box security model and designs cryptographic schemes that are provably
secure within it. Informally, a scheme is leakage-resilient if it remains secure
even if an adversary learns a bounded amount of arbitrary information about the
schemes internal state. Unfortunately, most leakage resilient schemes are unnecessarily
complicated in order to achieve strong provable security guarantees. As advocated
by Yu et al. [CCS’10], this mostly is an artefact of the security proof and in
practice much simpler construction may already suffice to protect against realistic
side-channel attacks. In this paper, we show that indeed for simpler constructions
leakage-resilience can be obtained when we aim for relaxed security notions where
the leakage-functions and/or the inputs to the primitive are chosen non-adaptively.
For example, we show that a three round Feistel network instantiated with a leakage
resilient PRF yields a leakage resilient PRP if the inputs are chosen non-adaptively
(This complements the result of Dodis and Pietrzak [CRYPTO’10] who show that if
a adaptive queries are allowed, a superlogarithmic number of rounds is necessary.)
We also show that a minor variation of the classical GGM construction gives a
leakage resilient PRF if both, the leakage-function and the inputs, are chosen
non-adaptively.
acknowledgement: "Sebastian Faust acknowledges support from the Danish National Research
Foundation and The National Science Foundation of China (under the grant 61061130540)
for the Sino-Danish Center for the Theory of Interactive Computation, within part
of this work was performed; and from the CFEM research center, supported by the
Danish Strategic Research Council. \r\nSupported by the European Research Council/ERC
Starting Grant 259668-PSPC.\r\n"
alternative_title:
- LNCS
author:
- first_name: Sebastian
full_name: Faust, Sebastian
last_name: Faust
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Joachim
full_name: Schipper, Joachim
id: 7BE863D4-E9CF-11E9-9EDB-90527418172C
last_name: Schipper
citation:
ama: 'Faust S, Pietrzak KZ, Schipper J. Practical leakage-resilient symmetric cryptography.
In: Conference Proceedings CHES 2012. Vol 7428. Springer; 2012:213-232.
doi:10.1007/978-3-642-33027-8_13'
apa: 'Faust, S., Pietrzak, K. Z., & Schipper, J. (2012). Practical leakage-resilient
symmetric cryptography. In Conference proceedings CHES 2012 (Vol. 7428,
pp. 213–232). Leuven, Belgium: Springer. https://doi.org/10.1007/978-3-642-33027-8_13'
chicago: Faust, Sebastian, Krzysztof Z Pietrzak, and Joachim Schipper. “Practical
Leakage-Resilient Symmetric Cryptography.” In Conference Proceedings CHES
2012, 7428:213–32. Springer, 2012. https://doi.org/10.1007/978-3-642-33027-8_13.
ieee: S. Faust, K. Z. Pietrzak, and J. Schipper, “Practical leakage-resilient symmetric
cryptography,” in Conference proceedings CHES 2012, Leuven, Belgium, 2012,
vol. 7428, pp. 213–232.
ista: 'Faust S, Pietrzak KZ, Schipper J. 2012. Practical leakage-resilient symmetric
cryptography. Conference proceedings CHES 2012. CHES: Cryptographic Hardware
and Embedded Systems, LNCS, vol. 7428, 213–232.'
mla: Faust, Sebastian, et al. “Practical Leakage-Resilient Symmetric Cryptography.”
Conference Proceedings CHES 2012, vol. 7428, Springer, 2012, pp. 213–32,
doi:10.1007/978-3-642-33027-8_13.
short: S. Faust, K.Z. Pietrzak, J. Schipper, in:, Conference Proceedings CHES 2012,
Springer, 2012, pp. 213–232.
conference:
end_date: 2012-09-12
location: Leuven, Belgium
name: 'CHES: Cryptographic Hardware and Embedded Systems'
start_date: 2012-09-09
date_created: 2018-12-11T11:55:25Z
date_published: 2012-09-01T00:00:00Z
date_updated: 2021-01-12T06:54:58Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-642-33027-8_13
ec_funded: 1
intvolume: ' 7428'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.iacr.org/archive/ches2012/74280211/74280211.pdf
month: '09'
oa: 1
oa_version: Preprint
page: 213 - 232
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication: ' Conference proceedings CHES 2012'
publication_status: published
publisher: Springer
publist_id: '5003'
quality_controlled: '1'
scopus_import: 1
status: public
title: Practical leakage-resilient symmetric cryptography
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7428
year: '2012'
...
---
_id: '2049'
abstract:
- lang: eng
text: "We propose a new authentication protocol that is provably secure based on
a ring variant of the learning parity with noise (LPN) problem. The protocol follows
the design principle of the LPN-based protocol from Eurocrypt’11 (Kiltz et al.),
and like it, is a two round protocol secure against active attacks. Moreover,
our protocol has small communication complexity and a very small footprint which
makes it applicable in scenarios that involve low-cost, resource-constrained devices.\r\n\r\nPerformance-wise,
our protocol is more efficient than previous LPN-based schemes, such as the many
variants of the Hopper-Blum (HB) protocol and the aforementioned protocol from
Eurocrypt’11. Our implementation results show that it is even comparable to the
standard challenge-and-response protocols based on the AES block-cipher. Our basic
protocol is roughly 20 times slower than AES, but with the advantage of having
10 times smaller code size. Furthermore, if a few hundred bytes of non-volatile
memory are available to allow the storage of some off-line pre-computations, then
the online phase of our protocols is only twice as slow as AES.\r\n"
acknowledgement: "Supported by the European Research Council / ERC Starting Grant
(259668- PSPC)\r\nWe would like to thank the anonymous referees of this confer-
ence and those of the ECRYPT Workshop on Lightweight Cryptography for very useful
comments, and in particular for the suggestion that the scheme is somewhat vulnerable
to a man-in-the-middle attack whenever an adversary observes two reader challenges
that are the same. We hope that the attack we described in Appendix A corresponds
to what the reviewer had in mind. We also thank Tanja Lange for pointing us to the
pa- per of [Kir11] and for discussions of some of her recent work. "
alternative_title:
- LNCS
author:
- first_name: Stefan
full_name: Heyse, Stefan
last_name: Heyse
- first_name: Eike
full_name: Kiltz, Eike
last_name: Kiltz
- first_name: Vadim
full_name: Lyubashevsky, Vadim
last_name: Lyubashevsky
- first_name: Christof
full_name: Paar, Christof
last_name: Paar
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Heyse S, Kiltz E, Lyubashevsky V, Paar C, Pietrzak KZ. Lapin: An efficient
authentication protocol based on ring-LPN. In: Conference Proceedings FSE
2012. Vol 7549. Springer; 2012:346-365. doi:10.1007/978-3-642-34047-5_20'
apa: 'Heyse, S., Kiltz, E., Lyubashevsky, V., Paar, C., & Pietrzak, K. Z. (2012).
Lapin: An efficient authentication protocol based on ring-LPN. In Conference
proceedings FSE 2012 (Vol. 7549, pp. 346–365). Washington, DC, USA: Springer.
https://doi.org/10.1007/978-3-642-34047-5_20'
chicago: 'Heyse, Stefan, Eike Kiltz, Vadim Lyubashevsky, Christof Paar, and Krzysztof
Z Pietrzak. “Lapin: An Efficient Authentication Protocol Based on Ring-LPN.” In
Conference Proceedings FSE 2012, 7549:346–65. Springer, 2012. https://doi.org/10.1007/978-3-642-34047-5_20.'
ieee: 'S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, and K. Z. Pietrzak, “Lapin:
An efficient authentication protocol based on ring-LPN,” in Conference proceedings
FSE 2012, Washington, DC, USA, 2012, vol. 7549, pp. 346–365.'
ista: 'Heyse S, Kiltz E, Lyubashevsky V, Paar C, Pietrzak KZ. 2012. Lapin: An efficient
authentication protocol based on ring-LPN. Conference proceedings FSE 2012. FSE:
Fast Software Encryption, LNCS, vol. 7549, 346–365.'
mla: 'Heyse, Stefan, et al. “Lapin: An Efficient Authentication Protocol Based on
Ring-LPN.” Conference Proceedings FSE 2012, vol. 7549, Springer, 2012,
pp. 346–65, doi:10.1007/978-3-642-34047-5_20.'
short: S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, K.Z. Pietrzak, in:, Conference
Proceedings FSE 2012, Springer, 2012, pp. 346–365.
conference:
end_date: 2012-03-21
location: Washington, DC, USA
name: 'FSE: Fast Software Encryption'
start_date: 2012-03-19
date_created: 2018-12-11T11:55:25Z
date_published: 2012-03-01T00:00:00Z
date_updated: 2021-01-12T06:54:58Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-642-34047-5_20
ec_funded: 1
intvolume: ' 7549'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.iacr.org/archive/fse2012/75490350/75490350.pdf
month: '03'
oa: 1
oa_version: Preprint
page: 346 - 365
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication: ' Conference proceedings FSE 2012'
publication_status: published
publisher: Springer
publist_id: '5002'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Lapin: An efficient authentication protocol based on ring-LPN'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7549
year: '2012'
...
---
_id: '1384'
abstract:
- lang: eng
text: 'Software model checking, as an undecidable problem, has three possible outcomes:
(1) the program satisfies the specification, (2) the program does not satisfy
the specification, and (3) the model checker fails. The third outcome usually
manifests itself in a space-out, time-out, or one component of the verification
tool giving up; in all of these failing cases, significant computation is performed
by the verification tool before the failure, but no result is reported. We propose
to reformulate the model-checking problem as follows, in order to have the verification
tool report a summary of the performed work even in case of failure: given a program
and a specification, the model checker returns a condition Ψ - usually a state
predicate - such that the program satisfies the specification under the condition
Ψ - that is, as long as the program does not leave the states in which Ψ is satisfied.
In our experiments, we investigated as one major application of conditional model
checking the sequential combination of model checkers with information passing.
We give the condition that one model checker produces, as input to a second conditional
model checker, such that the verification problem for the second is restricted
to the part of the state space that is not covered by the condition, i.e., the
second model checker works on the problems that the first model checker could
not solve. Our experiments demonstrate that repeated application of conditional
model checkers, passing information from one model checker to the next, can significantly
improve the verification results and performance, i.e., we can now verify programs
that we could not verify before.'
acknowledgement: This research was supported by the Canadian NSERC grant RGPIN 341819-07, the ERC Advanced Grant
QUAREM, and the Austrian Science Fund NFN RiSE.
article_number: '57'
author:
- first_name: Dirk
full_name: Beyer, Dirk
last_name: Beyer
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Mehmet
full_name: Keremoglu, Mehmet
last_name: Keremoglu
- first_name: Philipp
full_name: Wendler, Philipp
last_name: Wendler
citation:
ama: 'Beyer D, Henzinger TA, Keremoglu M, Wendler P. Conditional model checking:
A technique to pass information between verifiers. In: Proceedings of the ACM
SIGSOFT 20th International Symposium on the Foundations of Software Engineering.
ACM; 2012. doi:10.1145/2393596.2393664'
apa: 'Beyer, D., Henzinger, T. A., Keremoglu, M., & Wendler, P. (2012). Conditional
model checking: A technique to pass information between verifiers. In Proceedings
of the ACM SIGSOFT 20th International Symposium on the Foundations of Software
Engineering. Cary, NC, USA: ACM. https://doi.org/10.1145/2393596.2393664'
chicago: 'Beyer, Dirk, Thomas A Henzinger, Mehmet Keremoglu, and Philipp Wendler.
“Conditional Model Checking: A Technique to Pass Information between Verifiers.”
In Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations
of Software Engineering. ACM, 2012. https://doi.org/10.1145/2393596.2393664.'
ieee: 'D. Beyer, T. A. Henzinger, M. Keremoglu, and P. Wendler, “Conditional model
checking: A technique to pass information between verifiers,” in Proceedings
of the ACM SIGSOFT 20th International Symposium on the Foundations of Software
Engineering, Cary, NC, USA, 2012.'
ista: 'Beyer D, Henzinger TA, Keremoglu M, Wendler P. 2012. Conditional model checking:
A technique to pass information between verifiers. Proceedings of the ACM SIGSOFT
20th International Symposium on the Foundations of Software Engineering. FSE:
Foundations of Software Engineering, 57.'
mla: 'Beyer, Dirk, et al. “Conditional Model Checking: A Technique to Pass Information
between Verifiers.” Proceedings of the ACM SIGSOFT 20th International Symposium
on the Foundations of Software Engineering, 57, ACM, 2012, doi:10.1145/2393596.2393664.'
short: D. Beyer, T.A. Henzinger, M. Keremoglu, P. Wendler, in:, Proceedings of the
ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering,
ACM, 2012.
conference:
end_date: 2012-11-16
location: Cary, NC, USA
name: 'FSE: Foundations of Software Engineering'
start_date: 2012-11-11
date_created: 2018-12-11T11:51:42Z
date_published: 2012-11-01T00:00:00Z
date_updated: 2021-01-12T06:50:18Z
day: '01'
department:
- _id: ToHe
doi: 10.1145/2393596.2393664
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1109.6926
month: '11'
oa: 1
oa_version: Preprint
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: Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations
of Software Engineering
publication_status: published
publisher: ACM
publist_id: '5826'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Conditional model checking: A technique to pass information between verifiers'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '5396'
abstract:
- lang: eng
text: We consider the problem of inference in agraphical model with binary variables.
While in theory it is arguably preferable to compute marginal probabilities, in
practice researchers often use MAP inference due to the availability of efficient
discrete optimization algorithms. We bridge the gap between the two approaches
by introducing the Discrete Marginals technique in which approximate marginals
are obtained by minimizing an objective function with unary and pair-wise terms
over a discretized domain. This allows the use of techniques originally devel-oped
for MAP-MRF inference and learning. We explore two ways to set up the objective
function - by discretizing the Bethe free energy and by learning it from training
data. Experimental results show that for certain types of graphs a learned function
can out-perform the Bethe approximation. We also establish a link between the
Bethe free energy and submodular functions.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Filip
full_name: Korc, Filip
id: 476A2FD6-F248-11E8-B48F-1D18A9856A87
last_name: Korc
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: Korc F, Kolmogorov V, Lampert C. Approximating Marginals Using Discrete
Energy Minimization. IST Austria; 2012. doi:10.15479/AT:IST-2012-0003
apa: Korc, F., Kolmogorov, V., & Lampert, C. (2012). Approximating marginals
using discrete energy minimization. IST Austria. https://doi.org/10.15479/AT:IST-2012-0003
chicago: Korc, Filip, Vladimir Kolmogorov, and Christoph Lampert. Approximating
Marginals Using Discrete Energy Minimization. IST Austria, 2012. https://doi.org/10.15479/AT:IST-2012-0003.
ieee: F. Korc, V. Kolmogorov, and C. Lampert, Approximating marginals using discrete
energy minimization. IST Austria, 2012.
ista: Korc F, Kolmogorov V, Lampert C. 2012. Approximating marginals using discrete
energy minimization, IST Austria, 13p.
mla: Korc, Filip, et al. Approximating Marginals Using Discrete Energy Minimization.
IST Austria, 2012, doi:10.15479/AT:IST-2012-0003.
short: F. Korc, V. Kolmogorov, C. Lampert, Approximating Marginals Using Discrete
Energy Minimization, IST Austria, 2012.
date_created: 2018-12-12T11:39:06Z
date_published: 2012-07-23T00:00:00Z
date_updated: 2023-02-23T11:13:22Z
day: '23'
ddc:
- '000'
department:
- _id: VlKo
- _id: ChLa
doi: 10.15479/AT:IST-2012-0003
file:
- access_level: open_access
checksum: 7e0ba85ad123b13223aaf6cdde2d288c
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:29Z
date_updated: 2020-07-14T12:46:44Z
file_id: '5490'
file_name: IST-2012-0003_IST-2012-0003.pdf
file_size: 618744
relation: main_file
file_date_updated: 2020-07-14T12:46:44Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '13'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '36'
related_material:
record:
- id: '3124'
relation: earlier_version
status: public
status: public
title: Approximating marginals using discrete energy minimization
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '5398'
abstract:
- lang: eng
text: This document is created as a part of the project “Repository for Research
Data on IST Austria”. It summarises the actual state of research data at IST Austria,
based on survey results. It supports the choice of appropriate software, which
would best fit the requirements of their users, the researchers.
author:
- first_name: Jana
full_name: Porsche, Jana
id: 3252EDC2-F248-11E8-B48F-1D18A9856A87
last_name: Porsche
citation:
ama: Porsche J. Actual State of Research Data @ ISTAustria. IST Austria;
2012.
apa: Porsche, J. (2012). Actual state of research data @ ISTAustria. IST
Austria.
chicago: Porsche, Jana. Actual State of Research Data @ ISTAustria. IST Austria,
2012.
ieee: J. Porsche, Actual state of research data @ ISTAustria. IST Austria,
2012.
ista: Porsche J. 2012. Actual state of research data @ ISTAustria, IST Austria,p.
mla: Porsche, Jana. Actual State of Research Data @ ISTAustria. IST Austria,
2012.
short: J. Porsche, Actual State of Research Data @ ISTAustria, IST Austria, 2012.
date_created: 2018-12-12T11:39:06Z
date_published: 2012-11-12T00:00:00Z
date_updated: 2020-07-14T23:04:49Z
day: '12'
ddc:
- '020'
department:
- _id: E-Lib
file:
- access_level: open_access
checksum: e0a7c041eea1ca4b70ab6f9ec5177f4e
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:11Z
date_updated: 2020-07-14T12:46:44Z
file_id: '5472'
file_name: IST-2012-103-v1+1_Actual_state_of_research_data_@_IST_Austria.pdf
file_size: 238544
relation: main_file
file_date_updated: 2020-07-14T12:46:44Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
publication_status: published
publisher: IST Austria
pubrep_id: '103'
status: public
title: Actual state of research data @ ISTAustria
type: report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '5745'
article_processing_charge: No
author:
- first_name: Ashutosh
full_name: Gupta, Ashutosh
last_name: Gupta
citation:
ama: 'Gupta A. Improved Single Pass Algorithms for Resolution Proof Reduction. In:
Automated Technology for Verification and Analysis. Vol 7561. LNCS. Berlin,
Heidelberg: Springer Berlin Heidelberg; 2012:107-121. doi:10.1007/978-3-642-33386-6_10'
apa: 'Gupta, A. (2012). Improved Single Pass Algorithms for Resolution Proof Reduction.
In Automated Technology for Verification and Analysis (Vol. 7561, pp. 107–121).
Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-33386-6_10'
chicago: 'Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof
Reduction.” In Automated Technology for Verification and Analysis, 7561:107–21.
LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. https://doi.org/10.1007/978-3-642-33386-6_10.'
ieee: 'A. Gupta, “Improved Single Pass Algorithms for Resolution Proof Reduction,”
in Automated Technology for Verification and Analysis, vol. 7561, Berlin,
Heidelberg: Springer Berlin Heidelberg, 2012, pp. 107–121.'
ista: 'Gupta A. 2012.Improved Single Pass Algorithms for Resolution Proof Reduction.
In: Automated Technology for Verification and Analysis. vol. 7561, 107–121.'
mla: Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.”
Automated Technology for Verification and Analysis, vol. 7561, Springer
Berlin Heidelberg, 2012, pp. 107–21, doi:10.1007/978-3-642-33386-6_10.
short: A. Gupta, in:, Automated Technology for Verification and Analysis, Springer
Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 107–121.
conference:
end_date: 2012-10-06
location: Thiruvananthapuram, Kerala, India
name: ATVA 2012
start_date: 2012-10-03
date_created: 2018-12-18T13:01:46Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2023-09-05T14:15:29Z
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-642-33386-6_10
ec_funded: 1
file:
- access_level: open_access
checksum: 68415837a315de3cc4d120f6019d752c
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T13:07:35Z
date_updated: 2020-07-14T12:47:10Z
file_id: '5746'
file_name: 2012_ATVA_Gupta.pdf
file_size: 465502
relation: main_file
file_date_updated: 2020-07-14T12:47:10Z
has_accepted_license: '1'
intvolume: ' 7561'
language:
- iso: eng
oa: 1
oa_version: None
page: 107-121
place: Berlin, Heidelberg
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication: Automated Technology for Verification and Analysis
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783642333859'
- '9783642333866'
issn:
- 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
pubrep_id: '180'
quality_controlled: '1'
series_title: LNCS
status: public
title: Improved Single Pass Algorithms for Resolution Proof Reduction
type: book_chapter
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 7561
year: '2012'
...
---
_id: '6588'
abstract:
- lang: eng
text: First we note that the best polynomial approximation to vertical bar x vertical
bar on the set, which consists of an interval on the positive half-axis and a
point on the negative half-axis, can be given by means of the classical Chebyshev
polynomials. Then we explore the cases when a solution of the related problem
on two intervals can be given in elementary functions.
acknowledgement: "This work is supported by the Austrian Science Fund (FWF), Project
P22025-N18.\r\n"
article_processing_charge: No
article_type: original
author:
- first_name: Florian
full_name: Pausinger, Florian
id: 2A77D7A2-F248-11E8-B48F-1D18A9856A87
last_name: Pausinger
orcid: 0000-0002-8379-3768
citation:
ama: Pausinger F. Elementary solutions of the Bernstein problem on two intervals.
Journal of Mathematical Physics, Analysis, Geometry. 2012;8(1):63-78.
apa: Pausinger, F. (2012). Elementary solutions of the Bernstein problem on two
intervals. Journal of Mathematical Physics, Analysis, Geometry. B. Verkin
Institute for Low Temperature Physics and Engineering.
chicago: Pausinger, Florian. “Elementary Solutions of the Bernstein Problem on Two
Intervals.” Journal of Mathematical Physics, Analysis, Geometry. B. Verkin
Institute for Low Temperature Physics and Engineering, 2012.
ieee: F. Pausinger, “Elementary solutions of the Bernstein problem on two intervals,”
Journal of Mathematical Physics, Analysis, Geometry, vol. 8, no. 1. B.
Verkin Institute for Low Temperature Physics and Engineering, pp. 63–78, 2012.
ista: Pausinger F. 2012. Elementary solutions of the Bernstein problem on two intervals.
Journal of Mathematical Physics, Analysis, Geometry. 8(1), 63–78.
mla: Pausinger, Florian. “Elementary Solutions of the Bernstein Problem on Two Intervals.”
Journal of Mathematical Physics, Analysis, Geometry, vol. 8, no. 1, B.
Verkin Institute for Low Temperature Physics and Engineering, 2012, pp. 63–78.
short: F. Pausinger, Journal of Mathematical Physics, Analysis, Geometry 8 (2012)
63–78.
date_created: 2019-06-27T08:16:56Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2023-10-16T09:41:31Z
day: '01'
department:
- _id: HeEd
external_id:
isi:
- '000301173600004'
intvolume: ' 8'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://mi.mathnet.ru/eng/jmag525
month: '01'
oa: 1
oa_version: Published Version
page: 63-78
publication: Journal of Mathematical Physics, Analysis, Geometry
publication_identifier:
issn:
- 1812-9471
publication_status: published
publisher: B. Verkin Institute for Low Temperature Physics and Engineering
quality_controlled: '1'
scopus_import: '1'
status: public
title: Elementary solutions of the Bernstein problem on two intervals
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2012'
...
---
_id: '9755'
abstract:
- lang: eng
text: Due to the omnipresent risk of epidemics, insect societies have evolved sophisticated
disease defences at the individual and colony level. An intriguing yet little
understood phenomenon is that social contact to pathogen-exposed individuals reduces
susceptibility of previously naive nestmates to this pathogen. We tested whether
such social immunisation in Lasius ants against the entomopathogenic fungus Metarhizium
anisopliae is based on active upregulation of the immune system of nestmates following
contact to an infectious individual or passive protection via transfer of immune
effectors among group members—that is, active versus passive immunisation. We
found no evidence for involvement of passive immunisation via transfer of antimicrobials
among colony members. Instead, intensive allogrooming behaviour between naive
and pathogen-exposed ants before fungal conidia firmly attached to their cuticle
suggested passage of the pathogen from the exposed individuals to their nestmates.
By tracing fluorescence-labelled conidia we indeed detected frequent pathogen
transfer to the nestmates, where they caused low-level infections as revealed
by growth of small numbers of fungal colony forming units from their dissected
body content. These infections rarely led to death, but instead promoted an enhanced
ability to inhibit fungal growth and an active upregulation of immune genes involved
in antifungal defences (defensin and prophenoloxidase, PPO). Contrarily, there
was no upregulation of the gene cathepsin L, which is associated with antibacterial
and antiviral defences, and we found no increased antibacterial activity of nestmates
of fungus-exposed ants. This indicates that social immunisation after fungal exposure
is specific, similar to recent findings for individual-level immune priming in
invertebrates. Epidemiological modeling further suggests that active social immunisation
is adaptive, as it leads to faster elimination of the disease and lower death
rates than passive immunisation. Interestingly, humans have also utilised the
protective effect of low-level infections to fight smallpox by intentional transfer
of low pathogen doses (“variolation” or “inoculation”).
article_processing_charge: No
author:
- first_name: Matthias
full_name: Konrad, Matthias
id: 46528076-F248-11E8-B48F-1D18A9856A87
last_name: Konrad
- first_name: Meghan
full_name: Vyleta, Meghan
id: 418901AA-F248-11E8-B48F-1D18A9856A87
last_name: Vyleta
- first_name: Fabian
full_name: Theis, Fabian
last_name: Theis
- first_name: Miriam
full_name: Stock, Miriam
id: 42462816-F248-11E8-B48F-1D18A9856A87
last_name: Stock
- first_name: Martina
full_name: Klatt, Martina
id: E60F29C6-E9AE-11E9-AF6E-D190C7302F38
last_name: Klatt
- first_name: Verena
full_name: Drescher, Verena
last_name: Drescher
- first_name: Carsten
full_name: Marr, Carsten
last_name: Marr
- first_name: Line V
full_name: Ugelvig, Line V
id: 3DC97C8E-F248-11E8-B48F-1D18A9856A87
last_name: Ugelvig
orcid: 0000-0003-1832-8883
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: 'Konrad M, Vyleta M, Theis F, et al. Data from: Social transfer of pathogenic
fungus promotes active immunisation in ant colonies. 2012. doi:10.5061/dryad.sv37s'
apa: 'Konrad, M., Vyleta, M., Theis, F., Stock, M., Klatt, M., Drescher, V., … Cremer,
S. (2012). Data from: Social transfer of pathogenic fungus promotes active immunisation
in ant colonies. Dryad. https://doi.org/10.5061/dryad.sv37s'
chicago: 'Konrad, Matthias, Meghan Vyleta, Fabian Theis, Miriam Stock, Martina Klatt,
Verena Drescher, Carsten Marr, Line V Ugelvig, and Sylvia Cremer. “Data from:
Social Transfer of Pathogenic Fungus Promotes Active Immunisation in Ant Colonies.”
Dryad, 2012. https://doi.org/10.5061/dryad.sv37s.'
ieee: 'M. Konrad et al., “Data from: Social transfer of pathogenic fungus
promotes active immunisation in ant colonies.” Dryad, 2012.'
ista: 'Konrad M, Vyleta M, Theis F, Stock M, Klatt M, Drescher V, Marr C, Ugelvig
LV, Cremer S. 2012. Data from: Social transfer of pathogenic fungus promotes active
immunisation in ant colonies, Dryad, 10.5061/dryad.sv37s.'
mla: 'Konrad, Matthias, et al. Data from: Social Transfer of Pathogenic Fungus
Promotes Active Immunisation in Ant Colonies. Dryad, 2012, doi:10.5061/dryad.sv37s.'
short: M. Konrad, M. Vyleta, F. Theis, M. Stock, M. Klatt, V. Drescher, C. Marr,
L.V. Ugelvig, S. Cremer, (2012).
date_created: 2021-07-30T08:39:13Z
date_published: 2012-09-27T00:00:00Z
date_updated: 2023-02-23T11:18:41Z
day: '27'
department:
- _id: SyCr
doi: 10.5061/dryad.sv37s
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.sv37s
month: '09'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '3242'
relation: used_in_publication
status: public
status: public
title: 'Data from: Social transfer of pathogenic fungus promotes active immunisation
in ant colonies'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2012'
...
---
_id: '9757'
abstract:
- lang: eng
text: To fight infectious diseases, host immune defences are employed at multiple
levels. Sanitary behaviour, such as pathogen avoidance and removal, acts as a
first line of defence to prevent infection [1] before activation of the physiological
immune system. Insect societies have evolved a wide range of collective hygiene
measures and intensive health care towards pathogen-exposed group members [2].
One of the most common behaviours is allogrooming, in which nestmates remove infectious
particles from the body surfaces of exposed individuals [3]. Here we show that,
in invasive garden ants, grooming of fungus-exposed brood is effective beyond
the sheer mechanical removal of fungal conidiospores as it also includes chemical
disinfection through the application of poison produced by the ants themselves.
Formic acid is the main active component of the poison. It inhibits fungal growth
of conidiospores remaining on the brood surface after grooming and also those
collected in the mouth of the grooming ant. This dual function is achieved by
uptake of the poison droplet into the mouth through acidopore self-grooming and
subsequent application onto the infectious brood via brood grooming. This extraordinary
behaviour extends current understanding of grooming and the establishment of social
immunity in insect societies.
article_processing_charge: No
author:
- first_name: Simon
full_name: Tragust, Simon
id: 35A7A418-F248-11E8-B48F-1D18A9856A87
last_name: Tragust
- first_name: Barbara
full_name: Mitteregger, Barbara
id: 479DDAAC-E9CD-11E9-9B5F-82450873F7A1
last_name: Mitteregger
- first_name: Vanessa
full_name: Barone, Vanessa
id: 419EECCC-F248-11E8-B48F-1D18A9856A87
last_name: Barone
orcid: 0000-0003-2676-3367
- first_name: Matthias
full_name: Konrad, Matthias
id: 46528076-F248-11E8-B48F-1D18A9856A87
last_name: Konrad
- first_name: Line V
full_name: Ugelvig, Line V
id: 3DC97C8E-F248-11E8-B48F-1D18A9856A87
last_name: Ugelvig
orcid: 0000-0003-1832-8883
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: 'Tragust S, Mitteregger B, Barone V, Konrad M, Ugelvig LV, Cremer S. Data from:
Ants disinfect fungus-exposed brood by oral uptake and spread of their poison.
2012. doi:10.5061/dryad.61649'
apa: 'Tragust, S., Mitteregger, B., Barone, V., Konrad, M., Ugelvig, L. V., &
Cremer, S. (2012). Data from: Ants disinfect fungus-exposed brood by oral uptake
and spread of their poison. Dryad. https://doi.org/10.5061/dryad.61649'
chicago: 'Tragust, Simon, Barbara Mitteregger, Vanessa Barone, Matthias Konrad,
Line V Ugelvig, and Sylvia Cremer. “Data from: Ants Disinfect Fungus-Exposed Brood
by Oral Uptake and Spread of Their Poison.” Dryad, 2012. https://doi.org/10.5061/dryad.61649.'
ieee: 'S. Tragust, B. Mitteregger, V. Barone, M. Konrad, L. V. Ugelvig, and S. Cremer,
“Data from: Ants disinfect fungus-exposed brood by oral uptake and spread of their
poison.” Dryad, 2012.'
ista: 'Tragust S, Mitteregger B, Barone V, Konrad M, Ugelvig LV, Cremer S. 2012.
Data from: Ants disinfect fungus-exposed brood by oral uptake and spread of their
poison, Dryad, 10.5061/dryad.61649.'
mla: 'Tragust, Simon, et al. Data from: Ants Disinfect Fungus-Exposed Brood by
Oral Uptake and Spread of Their Poison. Dryad, 2012, doi:10.5061/dryad.61649.'
short: S. Tragust, B. Mitteregger, V. Barone, M. Konrad, L.V. Ugelvig, S. Cremer,
(2012).
date_created: 2021-07-30T12:31:31Z
date_published: 2012-12-14T00:00:00Z
date_updated: 2023-02-23T11:04:28Z
day: '14'
department:
- _id: SyCr
doi: 10.5061/dryad.61649
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.61649
month: '12'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '2926'
relation: used_in_publication
status: public
status: public
title: 'Data from: Ants disinfect fungus-exposed brood by oral uptake and spread of
their poison'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2012'
...
---
_id: '9758'
abstract:
- lang: eng
text: 'We propose a two-step procedure for estimating multiple migration rates in
an approximate Bayesian computation (ABC) framework, accounting for global nuisance
parameters. The approach is not limited to migration, but generally of interest
for inference problems with multiple parameters and a modular structure (e.g.
independent sets of demes or loci). We condition on a known, but complex demographic
model of a spatially subdivided population, motivated by the reintroduction of
Alpine ibex (Capra ibex) into Switzerland. In the first step, the global parameters
ancestral mutation rate and male mating skew have been estimated for the whole
population in Aeschbacher et al. (Genetics 2012; 192: 1027). In the second step,
we estimate in this study the migration rates independently for clusters of demes
putatively connected by migration. For large clusters (many migration rates),
ABC faces the problem of too many summary statistics. We therefore assess by simulation
if estimation per pair of demes is a valid alternative. We find that the trade-off
between reduced dimensionality for the pairwise estimation on the one hand and
lower accuracy due to the assumption of pairwise independence on the other depends
on the number of migration rates to be inferred: the accuracy of the pairwise
approach increases with the number of parameters, relative to the joint estimation
approach. To distinguish between low and zero migration, we perform ABC-type model
comparison between a model with migration and one without. Applying the approach
to microsatellite data from Alpine ibex, we find no evidence for substantial gene
flow via migration, except for one pair of demes in one direction.'
article_processing_charge: No
author:
- first_name: Simon
full_name: Aeschbacher, Simon
id: 2D35326E-F248-11E8-B48F-1D18A9856A87
last_name: Aeschbacher
- first_name: Andreas
full_name: Futschik, Andreas
last_name: Futschik
- first_name: Mark
full_name: Beaumont, Mark
last_name: Beaumont
citation:
ama: 'Aeschbacher S, Futschik A, Beaumont M. Data from: Approximate Bayesian computation
for modular inference problems with many parameters: the example of migration
rates. 2012. doi:10.5061/dryad.274b1'
apa: 'Aeschbacher, S., Futschik, A., & Beaumont, M. (2012). Data from: Approximate
Bayesian computation for modular inference problems with many parameters: the
example of migration rates. Dryad. https://doi.org/10.5061/dryad.274b1'
chicago: 'Aeschbacher, Simon, Andreas Futschik, and Mark Beaumont. “Data from: Approximate
Bayesian Computation for Modular Inference Problems with Many Parameters: The
Example of Migration Rates.” Dryad, 2012. https://doi.org/10.5061/dryad.274b1.'
ieee: 'S. Aeschbacher, A. Futschik, and M. Beaumont, “Data from: Approximate Bayesian
computation for modular inference problems with many parameters: the example of
migration rates.” Dryad, 2012.'
ista: 'Aeschbacher S, Futschik A, Beaumont M. 2012. Data from: Approximate Bayesian
computation for modular inference problems with many parameters: the example of
migration rates, Dryad, 10.5061/dryad.274b1.'
mla: 'Aeschbacher, Simon, et al. Data from: Approximate Bayesian Computation
for Modular Inference Problems with Many Parameters: The Example of Migration
Rates. Dryad, 2012, doi:10.5061/dryad.274b1.'
short: S. Aeschbacher, A. Futschik, M. Beaumont, (2012).
date_created: 2021-07-30T12:36:39Z
date_published: 2012-11-14T00:00:00Z
date_updated: 2023-02-23T11:05:19Z
day: '14'
department:
- _id: NiBa
doi: 10.5061/dryad.274b1
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.274b1
month: '11'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '2944'
relation: used_in_publication
status: public
status: public
title: 'Data from: Approximate Bayesian computation for modular inference problems
with many parameters: the example of migration rates'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2012'
...
---
_id: '3317'
abstract:
- lang: eng
text: The physical distance between presynaptic Ca2+ channels and the Ca2+ sensors
that trigger exocytosis of neurotransmitter-containing vesicles is a key determinant
of the signalling properties of synapses in the nervous system. Recent functional
analysis indicates that in some fast central synapses, transmitter release is
triggered by a small number of Ca2+ channels that are coupled to Ca2+ sensors
at the nanometre scale. Molecular analysis suggests that this tight coupling is
generated by protein–protein interactions involving Ca2+ channels, Ca2+ sensors
and various other synaptic proteins. Nanodomain coupling has several functional
advantages, as it increases the efficacy, speed and energy efficiency of synaptic
transmission.
acknowledgement: "Work of the authors was funded by grants of the Deutsche Forschungsgemeinschaft
to P.J. (grants SFB 780/A5, TR 3/B10 and the Leibniz programme), a European Research
Council Advanced grant to P.J. and a Swiss National Foundation fellowship to E.E.\r\nWe
thank D. Tsien and E. Neher for their comments on this Review, J. Guzmán and A.
Pernía-Andrade for reading earlier versions and E. Kramberger for perfect editorial
support. We apologize that owing to space constraints, not all relevant papers could
be cited.\r\n"
author:
- first_name: Emmanuel
full_name: Eggermann, Emmanuel
id: 34DACA34-E9AE-11E9-849C-D35BD8ADC20C
last_name: Eggermann
- first_name: Iancu
full_name: Bucurenciu, Iancu
id: 4BD1D872-E9AE-11E9-9EE9-8BF4597A9E2A
last_name: Bucurenciu
- first_name: Sarit
full_name: Goswami, Sarit
id: 3A578F32-F248-11E8-B48F-1D18A9856A87
last_name: Goswami
- 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: Eggermann E, Bucurenciu I, Goswami S, Jonas PM. Nanodomain coupling between
Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. Nature
Reviews Neuroscience. 2012;13(1):7-21. doi:10.1038/nrn3125
apa: Eggermann, E., Bucurenciu, I., Goswami, S., & Jonas, P. M. (2012). Nanodomain
coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses.
Nature Reviews Neuroscience. Nature Publishing Group. https://doi.org/10.1038/nrn3125
chicago: Eggermann, Emmanuel, Iancu Bucurenciu, Sarit Goswami, and Peter M Jonas.
“Nanodomain Coupling between Ca(2+) Channels and Sensors of Exocytosis at Fast
Mammalian Synapses.” Nature Reviews Neuroscience. Nature Publishing Group,
2012. https://doi.org/10.1038/nrn3125.
ieee: E. Eggermann, I. Bucurenciu, S. Goswami, and P. M. Jonas, “Nanodomain coupling
between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses,”
Nature Reviews Neuroscience, vol. 13, no. 1. Nature Publishing Group, pp.
7–21, 2012.
ista: Eggermann E, Bucurenciu I, Goswami S, Jonas PM. 2012. Nanodomain coupling
between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses.
Nature Reviews Neuroscience. 13(1), 7–21.
mla: Eggermann, Emmanuel, et al. “Nanodomain Coupling between Ca(2+) Channels and
Sensors of Exocytosis at Fast Mammalian Synapses.” Nature Reviews Neuroscience,
vol. 13, no. 1, Nature Publishing Group, 2012, pp. 7–21, doi:10.1038/nrn3125.
short: E. Eggermann, I. Bucurenciu, S. Goswami, P.M. Jonas, Nature Reviews Neuroscience
13 (2012) 7–21.
date_created: 2018-12-11T12:02:38Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2021-01-12T07:42:36Z
day: '01'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1038/nrn3125
file:
- access_level: open_access
checksum: 4c1c86b2f6e4e1562f5bb800b457ea9f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:13Z
date_updated: 2020-07-14T12:46:07Z
file_id: '4931'
file_name: IST-2017-820-v1+1_17463_3_art_file_109404_ltmxbw.pdf
file_size: 314246
relation: main_file
- access_level: open_access
checksum: bceb2efdd49d115f4dde8486bc1be3f2
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:14Z
date_updated: 2020-07-14T12:46:07Z
file_id: '4932'
file_name: IST-2017-820-v1+2_17463_3_figure_109402_ltmwlp.pdf
file_size: 1840216
relation: main_file
file_date_updated: 2020-07-14T12:46:07Z
has_accepted_license: '1'
intvolume: ' 13'
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 7 - 21
project:
- _id: 25BC64A8-B435-11E9-9278-68D0E5697425
grant_number: JO_780/A5
name: Synaptic Mechanisms of Neuronal Network Function
- _id: 25BDE9A4-B435-11E9-9278-68D0E5697425
grant_number: SFB-TR3-TP10B
name: Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen
publication: Nature Reviews Neuroscience
publication_status: published
publisher: Nature Publishing Group
publist_id: '3322'
pubrep_id: '820'
quality_controlled: '1'
scopus_import: 1
status: public
title: Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast
mammalian synapses
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2012'
...
---
_id: '3331'
abstract:
- lang: eng
text: Computing the topology of an algebraic plane curve C means computing a combinatorial
graph that is isotopic to C and thus represents its topology in R2. We prove that,
for a polynomial of degree n with integer coefficients bounded by 2ρ, the topology
of the induced curve can be computed with bit operations ( indicates that we
omit logarithmic factors). Our analysis improves the previous best known complexity
bounds by a factor of n2. The improvement is based on new techniques to compute
and refine isolating intervals for the real roots of polynomials, and on the consequent
amortized analysis of the critical fibers of the algebraic curve.
author:
- first_name: Michael
full_name: Kerber, Michael
id: 36E4574A-F248-11E8-B48F-1D18A9856A87
last_name: Kerber
orcid: 0000-0002-8030-9299
- first_name: Michael
full_name: Sagraloff, Michael
last_name: Sagraloff
citation:
ama: Kerber M, Sagraloff M. A worst case bound for topology computation of algebraic
curves. Journal of Symbolic Computation. 2012;47(3):239-258. doi:10.1016/j.jsc.2011.11.001
apa: Kerber, M., & Sagraloff, M. (2012). A worst case bound for topology computation
of algebraic curves. Journal of Symbolic Computation. Elsevier. https://doi.org/10.1016/j.jsc.2011.11.001
chicago: Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology
Computation of Algebraic Curves.” Journal of Symbolic Computation. Elsevier,
2012. https://doi.org/10.1016/j.jsc.2011.11.001.
ieee: M. Kerber and M. Sagraloff, “A worst case bound for topology computation of
algebraic curves,” Journal of Symbolic Computation, vol. 47, no. 3. Elsevier,
pp. 239–258, 2012.
ista: Kerber M, Sagraloff M. 2012. A worst case bound for topology computation of
algebraic curves. Journal of Symbolic Computation. 47(3), 239–258.
mla: Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology Computation
of Algebraic Curves.” Journal of Symbolic Computation, vol. 47, no. 3,
Elsevier, 2012, pp. 239–58, doi:10.1016/j.jsc.2011.11.001.
short: M. Kerber, M. Sagraloff, Journal of Symbolic Computation 47 (2012) 239–258.
date_created: 2018-12-11T12:02:43Z
date_published: 2012-03-01T00:00:00Z
date_updated: 2021-01-12T07:42:43Z
day: '01'
department:
- _id: HeEd
doi: 10.1016/j.jsc.2011.11.001
intvolume: ' 47'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1104.1510
month: '03'
oa: 1
oa_version: Preprint
page: 239 - 258
publication: ' Journal of Symbolic Computation'
publication_status: published
publisher: Elsevier
publist_id: '3303'
quality_controlled: '1'
scopus_import: 1
status: public
title: A worst case bound for topology computation of algebraic curves
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 47
year: '2012'
...
---
_id: '3341'
abstract:
- lang: eng
text: 'We consider two-player stochastic games played on a finite state space for
an infinite number of rounds. The games are concurrent: in each round, the two
players (player 1 and player 2) choose their moves independently and simultaneously;
the current state and the two moves determine a probability distribution over
the successor states. We also consider the important special case of turn-based
stochastic games where players make moves in turns, rather than concurrently.
We study concurrent games with \omega-regular winning conditions specified as
parity objectives. The value for player 1 for a parity objective is the maximal
probability with which the player can guarantee the satisfaction of the objective
against all strategies of the opponent. We study the problem of continuity and
robustness of the value function in concurrent and turn-based stochastic parity
gameswith respect to imprecision in the transition probabilities. We present quantitative
bounds on the difference of the value function (in terms of the imprecision of
the transition probabilities) and show the value continuity for structurally equivalent
concurrent games (two games are structurally equivalent if the support of the
transition function is same and the probabilities differ). We also show robustness
of optimal strategies for structurally equivalent turn-based stochastic parity
games. Finally we show that the value continuity property breaks without the structurally
equivalent assumption (even for Markov chains) and show that our quantitative
bound is asymptotically optimal. Hence our results are tight (the assumption is
both necessary and sufficient) and optimal (our quantitative bound is asymptotically
optimal).'
alternative_title:
- LNCS
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: 'Chatterjee K. Robustness of structurally equivalent concurrent parity games.
In: Vol 7213. Springer; 2012:270-285. doi:10.1007/978-3-642-28729-9_18'
apa: 'Chatterjee, K. (2012). Robustness of structurally equivalent concurrent parity
games (Vol. 7213, pp. 270–285). Presented at the FoSSaCS: Foundations of Software
Science and Computation Structures, Tallinn, Estonia: Springer. https://doi.org/10.1007/978-3-642-28729-9_18'
chicago: Chatterjee, Krishnendu. “Robustness of Structurally Equivalent Concurrent
Parity Games,” 7213:270–85. Springer, 2012. https://doi.org/10.1007/978-3-642-28729-9_18.
ieee: 'K. Chatterjee, “Robustness of structurally equivalent concurrent parity games,”
presented at the FoSSaCS: Foundations of Software Science and Computation Structures,
Tallinn, Estonia, 2012, vol. 7213, pp. 270–285.'
ista: 'Chatterjee K. 2012. Robustness of structurally equivalent concurrent parity
games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS,
vol. 7213, 270–285.'
mla: Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent
Parity Games. Vol. 7213, Springer, 2012, pp. 270–85, doi:10.1007/978-3-642-28729-9_18.
short: K. Chatterjee, in:, Springer, 2012, pp. 270–285.
conference:
end_date: 2012-04-01
location: Tallinn, Estonia
name: 'FoSSaCS: Foundations of Software Science and Computation Structures'
start_date: 2012-03-24
date_created: 2018-12-11T12:02:46Z
date_published: 2012-03-22T00:00:00Z
date_updated: 2023-02-23T12:23:46Z
day: '22'
department:
- _id: KrCh
doi: 10.1007/978-3-642-28729-9_18
ec_funded: 1
external_id:
arxiv:
- '1107.2009'
intvolume: ' 7213'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1107.2009
month: '03'
oa: 1
oa_version: Preprint
page: 270 - 285
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_status: published
publisher: Springer
publist_id: '3284'
quality_controlled: '1'
related_material:
record:
- id: '5382'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Robustness of structurally equivalent concurrent parity games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7213
year: '2012'
...
---
_id: '3836'
abstract:
- lang: eng
text: Hierarchical Timing Language (HTL) is a coordination language for distributed,
hard real-time applications. HTL is a hierarchical extension of Giotto and, like
its predecessor, based on the logical execution time (LET) paradigm of real-time
programming. Giotto is compiled into code for a virtual machine, called the EmbeddedMachine
(or E machine). If HTL is targeted to the E machine, then the hierarchicalprogram
structure needs to be flattened; the flattening makes separatecompilation difficult,
and may result in E machinecode of exponential size. In this paper, we propose
a generalization of the E machine, which supports a hierarchicalprogram structure
at runtime through real-time trigger mechanisms that are arranged in a tree. We
present the generalized E machine, and a modular compiler for HTL that generates
code of linear size. The compiler may generate code for any part of a given HTL
program separately in any order.
author:
- first_name: Arkadeb
full_name: Ghosal, Arkadeb
last_name: Ghosal
- first_name: Daniel
full_name: Iercan, Daniel
last_name: Iercan
- first_name: Christoph
full_name: Kirsch, Christoph
last_name: Kirsch
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Alberto
full_name: Sangiovanni Vincentelli, Alberto
last_name: Sangiovanni Vincentelli
citation:
ama: Ghosal A, Iercan D, Kirsch C, Henzinger TA, Sangiovanni Vincentelli A. Separate
compilation of hierarchical real-time programs into linear-bounded embedded machine
code. Science of Computer Programming. 2012;77(2):96-112. doi:10.1016/j.scico.2010.06.004
apa: Ghosal, A., Iercan, D., Kirsch, C., Henzinger, T. A., & Sangiovanni Vincentelli,
A. (2012). Separate compilation of hierarchical real-time programs into linear-bounded
embedded machine code. Science of Computer Programming. Elsevier. https://doi.org/10.1016/j.scico.2010.06.004
chicago: Ghosal, Arkadeb, Daniel Iercan, Christoph Kirsch, Thomas A Henzinger, and
Alberto Sangiovanni Vincentelli. “Separate Compilation of Hierarchical Real-Time
Programs into Linear-Bounded Embedded Machine Code.” Science of Computer Programming.
Elsevier, 2012. https://doi.org/10.1016/j.scico.2010.06.004.
ieee: A. Ghosal, D. Iercan, C. Kirsch, T. A. Henzinger, and A. Sangiovanni Vincentelli,
“Separate compilation of hierarchical real-time programs into linear-bounded embedded
machine code,” Science of Computer Programming, vol. 77, no. 2. Elsevier,
pp. 96–112, 2012.
ista: Ghosal A, Iercan D, Kirsch C, Henzinger TA, Sangiovanni Vincentelli A. 2012.
Separate compilation of hierarchical real-time programs into linear-bounded embedded
machine code. Science of Computer Programming. 77(2), 96–112.
mla: Ghosal, Arkadeb, et al. “Separate Compilation of Hierarchical Real-Time Programs
into Linear-Bounded Embedded Machine Code.” Science of Computer Programming,
vol. 77, no. 2, Elsevier, 2012, pp. 96–112, doi:10.1016/j.scico.2010.06.004.
short: A. Ghosal, D. Iercan, C. Kirsch, T.A. Henzinger, A. Sangiovanni Vincentelli,
Science of Computer Programming 77 (2012) 96–112.
date_created: 2018-12-11T12:05:26Z
date_published: 2012-02-01T00:00:00Z
date_updated: 2021-01-12T07:52:32Z
day: '01'
department:
- _id: ToHe
doi: 10.1016/j.scico.2010.06.004
intvolume: ' 77'
issue: '2'
language:
- iso: eng
month: '02'
oa_version: None
page: 96 - 112
publication: Science of Computer Programming
publication_status: published
publisher: Elsevier
publist_id: '2370'
quality_controlled: '1'
scopus_import: 1
status: public
title: Separate compilation of hierarchical real-time programs into linear-bounded
embedded machine code
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 77
year: '2012'
...