---
_id: '804'
abstract:
- lang: eng
  text: Polysaccharides (carbohydrates) are key regulators of a large number of cell
    biological processes. However, precise biochemical or genetic manipulation of
    these often complex structures is laborious and hampers experimental structure–function
    studies. Molecular Dynamics (MD) simulations provide a valuable alternative tool
    to generate and test hypotheses on saccharide function. Yet, currently used MD
    force fields often overestimate the aggregation propensity of polysaccharides,
    affecting the usability of those simulations. Here we tested MARTINI, a popular
    coarse-grained (CG) force field for biological macromolecules, for its ability
    to accurately represent molecular forces between saccharides. To this end, we
    calculated a thermodynamic solution property, the second virial coefficient of
    the osmotic pressure (B22). Comparison with light scattering experiments revealed
    a nonphysical aggregation of a prototypical polysaccharide in MARTINI, pointing
    at an imbalance of the nonbonded solute–solute, solute–water, and water–water
    interactions. This finding also applies to smaller oligosaccharides which were
    all found to aggregate in simulations even at moderate concentrations, well below
    their solubility limit. Finally, we explored the influence of the Lennard-Jones
    (LJ) interaction between saccharide molecules and propose a simple scaling of
    the LJ interaction strength that makes MARTINI more reliable for the simulation
    of saccharides.
acknowledged_ssus:
- _id: ScienComp
acknowledgement: P.S.S. was supported by research fellowship 2811/1-1 from the German
  Research Foundation (DFG), and M.S. was supported by EMBO Long Term Fellowship ALTF
  187-2013 and Grant GC65-32 from the  Interdisciplinary Centre for Mathematical and
  Computational Modelling (ICM), University of Warsaw, Poland. The authors thank Antje
  Potthast, Marek Cieplak, Tomasz Włodarski, and Damien Thompson for fruitful discussions
  and the IST Austria Scientific Computing Facility for support.
article_processing_charge: No
author:
- first_name: Philipp S
  full_name: Schmalhorst, Philipp S
  id: 309D50DA-F248-11E8-B48F-1D18A9856A87
  last_name: Schmalhorst
  orcid: 0000-0002-5795-0133
- first_name: Felix
  full_name: Deluweit, Felix
  last_name: Deluweit
- first_name: Roger
  full_name: Scherrers, Roger
  last_name: Scherrers
- 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: Mateusz K
  full_name: Sikora, Mateusz K
  id: 2F74BCDE-F248-11E8-B48F-1D18A9856A87
  last_name: Sikora
citation:
  ama: Schmalhorst PS, Deluweit F, Scherrers R, Heisenberg C-PJ, Sikora MK. Overcoming
    the limitations of the MARTINI force field in simulations of polysaccharides.
    <i>Journal of Chemical Theory and Computation</i>. 2017;13(10):5039-5053. doi:<a
    href="https://doi.org/10.1021/acs.jctc.7b00374">10.1021/acs.jctc.7b00374</a>
  apa: Schmalhorst, P. S., Deluweit, F., Scherrers, R., Heisenberg, C.-P. J., &#38;
    Sikora, M. K. (2017). Overcoming the limitations of the MARTINI force field in
    simulations of polysaccharides. <i>Journal of Chemical Theory and Computation</i>.
    American Chemical Society. <a href="https://doi.org/10.1021/acs.jctc.7b00374">https://doi.org/10.1021/acs.jctc.7b00374</a>
  chicago: Schmalhorst, Philipp S, Felix Deluweit, Roger Scherrers, Carl-Philipp J
    Heisenberg, and Mateusz K Sikora. “Overcoming the Limitations of the MARTINI Force
    Field in Simulations of Polysaccharides.” <i>Journal of Chemical Theory and Computation</i>.
    American Chemical Society, 2017. <a href="https://doi.org/10.1021/acs.jctc.7b00374">https://doi.org/10.1021/acs.jctc.7b00374</a>.
  ieee: P. S. Schmalhorst, F. Deluweit, R. Scherrers, C.-P. J. Heisenberg, and M.
    K. Sikora, “Overcoming the limitations of the MARTINI force field in simulations
    of polysaccharides,” <i>Journal of Chemical Theory and Computation</i>, vol. 13,
    no. 10. American Chemical Society, pp. 5039–5053, 2017.
  ista: Schmalhorst PS, Deluweit F, Scherrers R, Heisenberg C-PJ, Sikora MK. 2017.
    Overcoming the limitations of the MARTINI force field in simulations of polysaccharides.
    Journal of Chemical Theory and Computation. 13(10), 5039–5053.
  mla: Schmalhorst, Philipp S., et al. “Overcoming the Limitations of the MARTINI
    Force Field in Simulations of Polysaccharides.” <i>Journal of Chemical Theory
    and Computation</i>, vol. 13, no. 10, American Chemical Society, 2017, pp. 5039–53,
    doi:<a href="https://doi.org/10.1021/acs.jctc.7b00374">10.1021/acs.jctc.7b00374</a>.
  short: P.S. Schmalhorst, F. Deluweit, R. Scherrers, C.-P.J. Heisenberg, M.K. Sikora,
    Journal of Chemical Theory and Computation 13 (2017) 5039–5053.
date_created: 2018-12-11T11:48:35Z
date_published: 2017-10-10T00:00:00Z
date_updated: 2023-09-27T10:58:45Z
day: '10'
department:
- _id: CaHe
doi: 10.1021/acs.jctc.7b00374
external_id:
  isi:
  - '000412965700036'
intvolume: '        13'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1704.03773
month: '10'
oa: 1
oa_version: Submitted Version
page: 5039 - 5053
publication: Journal of Chemical Theory and Computation
publication_identifier:
  issn:
  - '15499618'
publication_status: published
publisher: American Chemical Society
publist_id: '6847'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Overcoming the limitations of the MARTINI force field in simulations of polysaccharides
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 13
year: '2017'
...
---
_id: '805'
abstract:
- lang: eng
  text: During corticogenesis, distinct classes of neurons are born from progenitor
    cells located in the ventricular and subventricular zones, from where they migrate
    towards the pial surface to assemble into highly organized layer-specific circuits.
    However, the precise and coordinated transcriptional network activity defining
    neuronal identity is still not understood. Here, we show that genetic depletion
    of the basic helix-loop-helix (bHLH) transcription factor E2A splice variant E47
    increased the number of Tbr1-positive deep layer and Satb2-positive upper layer
    neurons at E14.5, while depletion of the alternatively spliced E12 variant did
    not affect layer-specific neurogenesis. While ChIP-Seq identified a big overlap
    for E12- and E47-specific binding sites in embryonic NSCs, including sites at
    the cyclin-dependent kinase inhibitor (CDKI) Cdkn1c gene locus, RNA-Seq revealed
    a unique transcriptional regulation by each splice variant. E47 activated the
    expression of the CDKI Cdkn1c through binding to a distal enhancer. Finally, overexpression
    of E47 in embryonic NSCs in vitro impaired neurite outgrowth and E47 overexpression
    in vivo by in utero electroporation disturbed proper layer-specific neurogenesis
    and upregulated p57(KIP2) expression. Overall, this study identified E2A target
    genes in embryonic NSCs and demonstrates that E47 regulates neuronal differentiation
    via p57(KIP2).
article_processing_charge: No
author:
- first_name: Sabrina
  full_name: Pfurr, Sabrina
  last_name: Pfurr
- first_name: Yu
  full_name: Chu, Yu
  last_name: Chu
- first_name: Christian
  full_name: Bohrer, Christian
  last_name: Bohrer
- first_name: Franziska
  full_name: Greulich, Franziska
  last_name: Greulich
- first_name: Robert J
  full_name: Beattie, Robert J
  id: 2E26DF60-F248-11E8-B48F-1D18A9856A87
  last_name: Beattie
  orcid: 0000-0002-8483-8753
- first_name: Könül
  full_name: Mammadzada, Könül
  last_name: Mammadzada
- first_name: Miriam
  full_name: Hils, Miriam
  last_name: Hils
- first_name: Sebastian
  full_name: Arnold, Sebastian
  last_name: Arnold
- first_name: Verdon
  full_name: Taylor, Verdon
  last_name: Taylor
- first_name: Kristina
  full_name: Schachtrup, Kristina
  last_name: Schachtrup
- first_name: N Henriette
  full_name: Uhlenhaut, N Henriette
  last_name: Uhlenhaut
- first_name: Christian
  full_name: Schachtrup, Christian
  last_name: Schachtrup
citation:
  ama: Pfurr S, Chu Y, Bohrer C, et al. The E2A splice variant E47 regulates the differentiation
    of projection neurons via p57(KIP2) during cortical development. <i>Development</i>.
    2017;144:3917-3931. doi:<a href="https://doi.org/10.1242/dev.145698">10.1242/dev.145698</a>
  apa: Pfurr, S., Chu, Y., Bohrer, C., Greulich, F., Beattie, R. J., Mammadzada, K.,
    … Schachtrup, C. (2017). The E2A splice variant E47 regulates the differentiation
    of projection neurons via p57(KIP2) during cortical development. <i>Development</i>.
    Company of Biologists. <a href="https://doi.org/10.1242/dev.145698">https://doi.org/10.1242/dev.145698</a>
  chicago: Pfurr, Sabrina, Yu Chu, Christian Bohrer, Franziska Greulich, Robert J
    Beattie, Könül Mammadzada, Miriam Hils, et al. “The E2A Splice Variant E47 Regulates
    the Differentiation of Projection Neurons via P57(KIP2) during Cortical Development.”
    <i>Development</i>. Company of Biologists, 2017. <a href="https://doi.org/10.1242/dev.145698">https://doi.org/10.1242/dev.145698</a>.
  ieee: S. Pfurr <i>et al.</i>, “The E2A splice variant E47 regulates the differentiation
    of projection neurons via p57(KIP2) during cortical development,” <i>Development</i>,
    vol. 144. Company of Biologists, pp. 3917–3931, 2017.
  ista: Pfurr S, Chu Y, Bohrer C, Greulich F, Beattie RJ, Mammadzada K, Hils M, Arnold
    S, Taylor V, Schachtrup K, Uhlenhaut NH, Schachtrup C. 2017. The E2A splice variant
    E47 regulates the differentiation of projection neurons via p57(KIP2) during cortical
    development. Development. 144, 3917–3931.
  mla: Pfurr, Sabrina, et al. “The E2A Splice Variant E47 Regulates the Differentiation
    of Projection Neurons via P57(KIP2) during Cortical Development.” <i>Development</i>,
    vol. 144, Company of Biologists, 2017, pp. 3917–31, doi:<a href="https://doi.org/10.1242/dev.145698">10.1242/dev.145698</a>.
  short: S. Pfurr, Y. Chu, C. Bohrer, F. Greulich, R.J. Beattie, K. Mammadzada, M.
    Hils, S. Arnold, V. Taylor, K. Schachtrup, N.H. Uhlenhaut, C. Schachtrup, Development
    144 (2017) 3917–3931.
date_created: 2018-12-11T11:48:36Z
date_published: 2017-10-31T00:00:00Z
date_updated: 2023-09-26T16:20:09Z
day: '31'
department:
- _id: SiHi
doi: 10.1242/dev.145698
external_id:
  isi:
  - '000414025600007'
intvolume: '       144'
isi: 1
language:
- iso: eng
month: '10'
oa_version: None
page: 3917 - 3931
publication: Development
publication_status: published
publisher: Company of Biologists
publist_id: '6846'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The E2A splice variant E47 regulates the differentiation of projection neurons
  via p57(KIP2) during cortical development
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 144
year: '2017'
...
---
_id: '807'
abstract:
- lang: eng
  text: 'On January the 1st, 2016 a new agreement between 32 Austrian scientific libraries
    and the publisher Springer took its effect: this deal covers accessing the licensed
    content on the one hand, and publishing open access on the other hand. More than
    1000 papers by Austrian authors were published open access at Springer in the
    first year alone. The working group &quot;Springer Compact Evaluierung&quot; made
    the data for these articles available via the platform OpenAPC and would like
    to use this opportunity to give a short account of what this publishing agreement
    actually entails and the working group intends to do.'
author:
- first_name: Magdalena
  full_name: Andrae, Magdalena
  last_name: Andrae
- first_name: Márton
  full_name: Villányi, Márton
  id: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87
  last_name: Villányi
  orcid: 0000-0001-8126-0426
citation:
  ama: Andrae M, Villányi M. Der Springer Compact-Deal – Ein erster Einblick in die
    Evaluierung einer Offsetting-Vereinbarung. <i>Mitteilungen der Vereinigung Österreichischer
    Bibliothekarinnen und Bibliothekare</i>. 2017;70(2):274-280. doi:<a href="https://doi.org/10.31263/voebm.v70i2.1898">10.31263/voebm.v70i2.1898</a>
  apa: Andrae, M., &#38; Villányi, M. (2017). Der Springer Compact-Deal – Ein erster
    Einblick in die Evaluierung einer Offsetting-Vereinbarung. <i>Mitteilungen Der
    Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare</i>. VÖB. <a
    href="https://doi.org/10.31263/voebm.v70i2.1898">https://doi.org/10.31263/voebm.v70i2.1898</a>
  chicago: Andrae, Magdalena, and Márton Villányi. “Der Springer Compact-Deal – Ein
    Erster Einblick in Die Evaluierung Einer Offsetting-Vereinbarung.” <i>Mitteilungen
    Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare</i>. VÖB,
    2017. <a href="https://doi.org/10.31263/voebm.v70i2.1898">https://doi.org/10.31263/voebm.v70i2.1898</a>.
  ieee: M. Andrae and M. Villányi, “Der Springer Compact-Deal – Ein erster Einblick
    in die Evaluierung einer Offsetting-Vereinbarung,” <i>Mitteilungen der Vereinigung
    Österreichischer Bibliothekarinnen und Bibliothekare</i>, vol. 70, no. 2. VÖB,
    pp. 274–280, 2017.
  ista: Andrae M, Villányi M. 2017. Der Springer Compact-Deal – Ein erster Einblick
    in die Evaluierung einer Offsetting-Vereinbarung. Mitteilungen der Vereinigung
    Österreichischer Bibliothekarinnen und Bibliothekare. 70(2), 274–280.
  mla: Andrae, Magdalena, and Márton Villányi. “Der Springer Compact-Deal – Ein Erster
    Einblick in Die Evaluierung Einer Offsetting-Vereinbarung.” <i>Mitteilungen Der
    Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare</i>, vol. 70,
    no. 2, VÖB, 2017, pp. 274–80, doi:<a href="https://doi.org/10.31263/voebm.v70i2.1898">10.31263/voebm.v70i2.1898</a>.
  short: M. Andrae, M. Villányi, Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen
    Und Bibliothekare 70 (2017) 274–280.
date_created: 2018-12-11T11:48:36Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2021-01-12T08:16:45Z
day: '01'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.31263/voebm.v70i2.1898
file:
- access_level: open_access
  checksum: 558c18bcf5580d87dd371ec626d52075
  content_type: application/pdf
  creator: dernst
  date_created: 2019-01-18T13:39:26Z
  date_updated: 2020-07-14T12:48:09Z
  file_id: '5851'
  file_name: 2017_VOEB_Andrae.pdf
  file_size: 125065
  relation: main_file
file_date_updated: 2020-07-14T12:48:09Z
has_accepted_license: '1'
intvolume: '        70'
issue: '2'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '08'
oa: 1
oa_version: Published Version
page: 274 - 280
popular_science: '1'
publication: Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare
publication_identifier:
  issn:
  - '10222588'
publication_status: published
publisher: VÖB
publist_id: '6843'
scopus_import: 1
status: public
title: Der Springer Compact-Deal – Ein erster Einblick in die Evaluierung einer Offsetting-Vereinbarung
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: 70
year: '2017'
...
---
_id: '818'
abstract:
- lang: eng
  text: 'Antibiotics have diverse effects on bacteria, including massive changes in
    bacterial gene expression. Whereas the gene expression changes under many antibiotics
    have been measured, the temporal organization of these responses and their dependence
    on the bacterial growth rate are unclear. As described in Chapter 1, we quantified
    the temporal gene expression changes in the bacterium Escherichia coli in response
    to the sudden exposure to antibiotics using a fluorescent reporter library and
    a robotic system. Our data show temporally structured gene expression responses,
    with response times for individual genes ranging from tens of minutes to several
    hours. We observed that many stress response genes were activated in response
    to antibiotics. As certain stress responses cross-protect bacteria from other
    stressors, we then asked whether cellular responses to antibiotics have a similar
    protective role in Chapter 2. Indeed, we found that the trimethoprim-induced acid
    stress response protects bacteria from subsequent acid stress. We combined microfluidics
    with time-lapse imaging to monitor survival, intracellular pH, and acid stress
    response in single cells. This approach revealed that the variable expression
    of the acid resistance operon gadBC strongly correlates with single-cell survival
    time. Cells with higher gadBC expression following trimethoprim maintain higher
    intracellular pH and survive the acid stress longer. Overall, we provide a way
    to identify single-cell cross-protection between antibiotics and environmental
    stressors from temporal gene expression data, and show how antibiotics can increase
    bacterial fitness in changing environments. While gene expression changes to antibiotics
    show a clear temporal structure at the population-level, it is unclear whether
    this clear temporal order is followed by every single cell. Using dual-reporter
    strains described in Chapter 3, we measured gene expression dynamics of promoter
    pairs in the same cells using microfluidics and microscopy. Chapter 4 shows that
    the oxidative stress response and the DNA stress response showed little timing
    variability and a clear temporal order under the antibiotic nitrofurantoin. In
    contrast, the acid stress response under trimethoprim ran independently from all
    other activated response programs including the DNA stress response, which showed
    particularly high timing variability in this stress condition. In summary, this
    approach provides insight into the temporal organization of gene expression programs
    at the single-cell level and suggests dependencies between response programs and
    the underlying variability-introducing mechanisms. Altogether, this work advances
    our understanding of the diverse effects that antibiotics have on bacteria. These
    results were obtained by taking into account gene expression dynamics, which allowed
    us to identify general principles, molecular mechanisms, and dependencies between
    genes. Our findings may have implications for infectious disease treatments, and
    microbial communities in the human body and in nature. '
acknowledgement: 'First of all, I would like to express great gratitude to my PhD
  supervisor Tobias Bollenbach. Through his open and trusting attitude I had the freedom
  to explore different scientific directions during this project, and follow the research
  lines of my interest. I am thankful for constructive and often extensive discussions
  and his support and commitment during the different stages of my PhD. I want to
  thank my committee members, Călin Guet, Terry Hwa and Nassos Typas for their interest
  and their valuable input to this project. Special thanks to Nassos for career guidance,
  and for accepting me in his lab. A big thank you goes to the past, present and affiliated
  members of the Bollenbach group: Guillaume Chevereau, Marjon de Vos, Marta Lukačišinová,
  Veronika Bierbaum, Qi Qin, Marcin Zagórski, Martin Lukačišin, Andreas Angermayr,
  Bor Kavčič, Julia Tischler, Dilay Ayhan, Jaroslav Ferenc, and Georg Rieckh. I enjoyed
  working and discussing with you very much and I will miss our lengthy group meetings,
  our inspiring journal clubs, and our common lunches. Special thanks to Bor for great
  mental and professional support during the hard months of thesis writing, and to
  Marta for very creative times during the beginning of our PhDs. May the ‘Bacterial
  Survival Guide’ decorate the walls of IST forever! A great thanks to my friend and
  collaborator Georg Rieckh for his enthusiasm and for getting so involved in these
  projects, for his endurance and for his company throughout the years. Thanks to
  the FriSBi crowd at IST Austria for interesting meetings and discussions. In particular
  I want to thank Magdalena Steinrück, and Anna Andersson for inspiring exchange,
  and enjoyable time together. Thanks to everybody who contributed to the cover for
  Cell Systems: The constructive input from Tobias Bollenbach, Bor Kavčič, Georg Rieckh,
  Marta Lukačišinová, and Sebastian Nozzi, and the professional implementation by
  the graphic designer Martina Markus from the University of Cologne. Thanks to all
  my office mates in the first floor Bertalanffy building throughout the years: for
  ensuring a pleasant working atmosphere, and for your company! In general, I want
  to thank all the people that make IST such a great environment, with the many possibilities
  to shape our own social and research environment. I want to thank my family for
  all kind of practical support during the years, and my second family in Argentina
  for their enthusiasm. Thanks to my brother Bernhard and my sister Martina for being
  great siblings, and to Helena and Valentin for the joy you brought to my life. My
  deep gratitude goes to Sebastian Nozzi, for constant support, patience, love and
  for believing in me. '
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Karin
  full_name: Mitosch, Karin
  id: 39B66846-F248-11E8-B48F-1D18A9856A87
  last_name: Mitosch
citation:
  ama: Mitosch K. Timing, variability and cross-protection in bacteria – insights
    from dynamic gene expression responses to antibiotics. 2017. doi:<a href="https://doi.org/10.15479/AT:ISTA:th_862">10.15479/AT:ISTA:th_862</a>
  apa: Mitosch, K. (2017). <i>Timing, variability and cross-protection in bacteria
    – insights from dynamic gene expression responses to antibiotics</i>. Institute
    of Science and Technology Austria. <a href="https://doi.org/10.15479/AT:ISTA:th_862">https://doi.org/10.15479/AT:ISTA:th_862</a>
  chicago: Mitosch, Karin. “Timing, Variability and Cross-Protection in Bacteria –
    Insights from Dynamic Gene Expression Responses to Antibiotics.” Institute of
    Science and Technology Austria, 2017. <a href="https://doi.org/10.15479/AT:ISTA:th_862">https://doi.org/10.15479/AT:ISTA:th_862</a>.
  ieee: K. Mitosch, “Timing, variability and cross-protection in bacteria – insights
    from dynamic gene expression responses to antibiotics,” Institute of Science and
    Technology Austria, 2017.
  ista: Mitosch K. 2017. Timing, variability and cross-protection in bacteria – insights
    from dynamic gene expression responses to antibiotics. Institute of Science and
    Technology Austria.
  mla: Mitosch, Karin. <i>Timing, Variability and Cross-Protection in Bacteria – Insights
    from Dynamic Gene Expression Responses to Antibiotics</i>. Institute of Science
    and Technology Austria, 2017, doi:<a href="https://doi.org/10.15479/AT:ISTA:th_862">10.15479/AT:ISTA:th_862</a>.
  short: K. Mitosch, Timing, Variability and Cross-Protection in Bacteria – Insights
    from Dynamic Gene Expression Responses to Antibiotics, Institute of Science and
    Technology Austria, 2017.
date_created: 2018-12-11T11:48:40Z
date_published: 2017-09-27T00:00:00Z
date_updated: 2023-09-07T12:00:26Z
day: '27'
ddc:
- '571'
- '579'
degree_awarded: PhD
department:
- _id: ToBo
doi: 10.15479/AT:ISTA:th_862
file:
- access_level: closed
  checksum: da3993c5f90f59a8e8623cc31ad501dd
  content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
  creator: dernst
  date_created: 2019-04-05T08:48:51Z
  date_updated: 2020-07-14T12:48:09Z
  file_id: '6210'
  file_name: Thesis_KarinMitosch.docx
  file_size: 6331071
  relation: source_file
- access_level: open_access
  checksum: 24c3d9e51992f1b721f3df55aa13fcb8
  content_type: application/pdf
  creator: dernst
  date_created: 2019-04-05T08:48:51Z
  date_updated: 2020-07-14T12:48:09Z
  file_id: '6211'
  file_name: Thesis_KarinMitosch.pdf
  file_size: 9289852
  relation: main_file
file_date_updated: 2020-07-14T12:48:09Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '113'
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6831'
pubrep_id: '862'
related_material:
  record:
  - id: '2001'
    relation: part_of_dissertation
    status: public
  - id: '666'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- first_name: Mark Tobias
  full_name: Bollenbach, Mark Tobias
  id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
  last_name: Bollenbach
  orcid: 0000-0003-4398-476X
title: Timing, variability and cross-protection in bacteria – insights from dynamic
  gene expression responses to antibiotics
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '819'
abstract:
- lang: eng
  text: 'Contagious diseases must transmit from infectious to susceptible hosts in
    order to reproduce. Whilst vectored pathogens can rely on intermediaries to find
    new hosts for them, many infectious pathogens require close contact or direct
    interaction between hosts for transmission. Hence, this means that conspecifics
    are often the main source of infection for most animals and so, in theory, animals
    should avoid conspecifics to reduce their risk of infection. Of course, in reality
    animals must interact with one another, as a bare minimum, to mate. However, being
    social provides many additional benefits and group living has become a taxonomically
    diverse and widespread trait. How then do social animals overcome the issue of
    increased disease? Over the last few decades, the social insects (ants, termites
    and some bees and wasps) have become a model system for studying disease in social
    animals. On paper, a social insect colony should be particularly susceptible to
    disease, given that they often contain thousands of potential hosts that are closely
    related and frequently interact, as well as exhibiting stable environmental conditions
    that encourage microbial growth. Yet, disease outbreaks appear to be rare and
    attempts to eradicate pest species using pathogens have failed time and again.
    Evolutionary biologists investigating this observation have discovered that the
    reduced disease susceptibility in social insects is, in part, due to collectively
    performed disease defences of the workers. These defences act like a “social immune
    system” for the colony, resulting in a per capita decrease in disease, termed
    social immunity. Our understanding of social immunity, and its importance in relation
    to the immunological defences of each insect, continues to grow, but there remain
    many open questions. In this thesis I have studied disease defence in garden ants.
    In the first data chapter, I use the invasive garden ant, Lasius neglectus, to
    investigate how colonies mitigate lethal infections and prevent them from spreading
    systemically. I find that ants have evolved ‘destructive disinfection’ – a behaviour
    that uses endogenously produced acidic poison to kill diseased brood and to prevent
    the pathogen from replicating. In the second experimental chapter, I continue
    to study the use of poison in invasive garden ant colonies, finding that it is
    sprayed prophylactically within the nest. However, this spraying has negative
    effects on developing pupae when they have had their cocoons artificially removed.
    Hence, I suggest that acidic nest sanitation may be maintaining larval cocoon
    spinning in this species. In the next experimental chapter, I investigated how
    colony founding black garden ant queens (Lasius niger) prevent disease when a
    co-foundress dies. I show that ant queens prophylactically perform undertaking
    behaviours, similar to those performed by the workers in mature nests. When a
    co-foundress was infected, these undertaking behaviours improved the survival
    of the healthy queen. In the final data chapter, I explored how immunocompetence
    (measured as antifungal activity) changes as incipient black garden ant colonies
    grow and mature, from the solitary queen phase to colonies with several hundred
    workers. Queen and worker antifungal activity varied throughout this time period,
    but despite social immunity, did not decrease as colonies matured. In addition
    to the above data chapters, this thesis includes two co-authored reviews. In the
    first, we examine the state of the art in the field of social immunity and how
    it might develop in the future. In the second, we identify several challenges
    and open questions in the study of disease defence in animals. We highlight how
    social insects offer a unique model to tackle some of these problems, as disease
    defence can be studied from the cell to the society. '
acknowledgement: "ERC FP7 programme (grant agreement no. 240371)\r\nI have been supremely
  spoilt to work in a lab with such good resources and I must thank the wonderful
  Cremer group technicians, Anna, Barbara, Eva and Florian, for all of their help
  and keeping the lab up and running. You guys will probably be the most missed once
  I realise just how much work you have been saving me! For the same reason, I must
  say a big Dzi ę kuj ę Ci to Wonder Woman Wanda, for her tireless efforts feeding
  my colonies and cranking out thousands of petri dishes and sugar tubes. Again, you
  will be sorely missed now that I will have to take this task on myself. Of course,
  I will be eternally indebted to Prof. Sylvia Cremer for taking me under her wing
  and being a constant source of guidance and inspiration. You have given me the perfect
  balance of independence and supervision. I cannot thank you enough for creating
  such a great working environment and allowing me the freedom to follow my own research
  questions. I have had so many exceptional opportunities – attending and presenting
  at conferences all over the world, inviting me to write the ARE with you, going
  to workshops in Panama and Switzerland, and even organising our own PhD course –
  that I often think I must have had the best PhD in the world. You have taught me
  so much and made me a scientist. I sincerely hope we get the chance to work together
  again in the future. Thank you for everything. I must also thank my PhD Committee,
  Daria Siekhaus and Jacobus “Koos” Boomsma, for being very supportive throughout
  the duration of my PhD. "
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Christopher
  full_name: Pull, Christopher
  id: 3C7F4840-F248-11E8-B48F-1D18A9856A87
  last_name: Pull
  orcid: 0000-0003-1122-3982
citation:
  ama: Pull C. Disease defence in garden ants. 2017. doi:<a href="https://doi.org/10.15479/AT:ISTA:th_861">10.15479/AT:ISTA:th_861</a>
  apa: Pull, C. (2017). <i>Disease defence in garden ants</i>. Institute of Science
    and Technology Austria. <a href="https://doi.org/10.15479/AT:ISTA:th_861">https://doi.org/10.15479/AT:ISTA:th_861</a>
  chicago: Pull, Christopher. “Disease Defence in Garden Ants.” Institute of Science
    and Technology Austria, 2017. <a href="https://doi.org/10.15479/AT:ISTA:th_861">https://doi.org/10.15479/AT:ISTA:th_861</a>.
  ieee: C. Pull, “Disease defence in garden ants,” Institute of Science and Technology
    Austria, 2017.
  ista: Pull C. 2017. Disease defence in garden ants. Institute of Science and Technology
    Austria.
  mla: Pull, Christopher. <i>Disease Defence in Garden Ants</i>. Institute of Science
    and Technology Austria, 2017, doi:<a href="https://doi.org/10.15479/AT:ISTA:th_861">10.15479/AT:ISTA:th_861</a>.
  short: C. Pull, Disease Defence in Garden Ants, Institute of Science and Technology
    Austria, 2017.
date_created: 2018-12-11T11:48:40Z
date_published: 2017-09-26T00:00:00Z
date_updated: 2023-09-28T11:31:32Z
day: '26'
ddc:
- '576'
- '577'
- '578'
- '579'
- '590'
- '592'
degree_awarded: PhD
department:
- _id: SyCr
doi: 10.15479/AT:ISTA:th_861
file:
- access_level: closed
  checksum: 4993cdd5382295758ecc3ecbd2a9aaff
  content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
  creator: dernst
  date_created: 2019-04-05T07:53:04Z
  date_updated: 2020-07-14T12:48:09Z
  file_id: '6199'
  file_name: 2017_Thesis_Pull.docx
  file_size: 18580400
  relation: source_file
- access_level: open_access
  checksum: ee2e3ebb5b53c154c866f5b052b25153
  content_type: application/pdf
  creator: dernst
  date_created: 2019-04-05T07:53:04Z
  date_updated: 2020-07-14T12:48:09Z
  file_id: '6200'
  file_name: 2017_Thesis_Pull.pdf
  file_size: 14400681
  relation: main_file
file_date_updated: 2020-07-14T12:48:09Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '122'
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6830'
pubrep_id: '861'
related_material:
  record:
  - id: '616'
    relation: part_of_dissertation
    status: public
  - id: '806'
    relation: part_of_dissertation
    status: public
  - id: '734'
    relation: part_of_dissertation
    status: public
  - id: '732'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- first_name: Sylvia M
  full_name: Cremer, Sylvia M
  id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
  last_name: Cremer
  orcid: 0000-0002-2193-3868
title: Disease defence in garden ants
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '820'
abstract:
- lang: eng
  text: "The lac operon is a classic model system for bacterial gene regulation, and
    has been studied extensively in E. coli, a classic model organism. However, not
    much is known about E. coli’s ecology and life outside the laboratory, in particular
    in soil and water environments. The natural diversity of the lac operon outside
    the laboratory, its role in the ecology of E. coli and the selection pressures
    it is exposed to, are similarly unknown.\r\nIn Chapter Two of this thesis, I explore
    the genetic diversity, phylogenetic history and signatures of selection of the
    lac operon across 20 natural isolates of E. coli and divergent clades of Escherichia.
    I found that complete lac operons were present in all isolates examined, which
    in all but one case were functional. The lac operon phylogeny conformed to the
    whole-genome phylogeny of the divergent Escherichia clades, which excludes horizontal
    gene transfer as an explanation for the presence of functional lac operons in
    these clades. All lac operon genes showed a signature of purifying selection;
    this signature was strongest for the lacY gene. Lac operon genes of human and
    environmental isolates showed similar signatures of selection, except the lacZ
    gene, which showed a stronger signature of selection in environmental isolates.\r\nIn
    Chapter Three, I try to identify the natural genetic variation relevant for phenotype
    and fitness in the lac operon, comparing growth rate on lactose and LacZ activity
    of the lac operons of these wild isolates in a common genetic background. Sequence
    variation in the lac promoter region, upstream of the -10 and -35 RNA polymerase
    binding motif, predicted variation in LacZ activity at full induction, using a
    thermodynamic model of polymerase binding (Tugrul, 2016). However, neither variation
    in LacZ activity, nor RNA polymerase binding predicted by the model correlated
    with variation in growth rate. Lac operons of human and environmental isolates
    did not differ systematically in either growth rate on lactose or LacZ protein
    activity, suggesting that these lac operons have been exposed to similar selection
    pressures. We thus have no evidence that the phenotypic variation we measured
    is relevant for fitness.\r\nTo start assessing the effect of genomic background
    on the growth phenotype conferred by the lac operon, I compared growth on minimal
    medium with lactose between lac operon constructs and the corresponding original
    isolates, I found that maximal growth rate was determined by genomic background,
    with almost all backgrounds conferring higher growth rates than lab strain K12
    MG1655. However, I found no evidence that the lactose concentration at which growth
    was half maximal depended on genomic background."
acknowledgement: "ERC H2020 programme (grant agreement no. 648440)\r\nThanks to Jon
  Bollback for giving me the chance to do this work, for sharing the ideas that lay
  at the basis of this work, for his honesty and openness, showing himself to me as
  a person and not just as a boss. Thanks to Nick Barton for his guidance at the last
  stage, reading and commenting extensively on several versions of this manuscript,
  and for his encouragement; thanks to both Jon and Nick for their kindness and patience.
  Thanks to Erik van Nimwegen and Calin Guet for their time and willingness to be
  in my thesis committee, and to Erik van Nimwegen especially for agreeing to enter
  my thesis committee at the last moment, and for his very sharp, helpful and relevant
  comments during and after the defense. Thanks to my collaborators and discussion
  partners: Anne Kupczok, for her guidance, ideas and discussions during the construction
  of the manuscript of Chapter Two, and her comments on the manuscript; Georg Rieckh
  for making me aware of the issue of parameter identifiability, suggesting how to
  solve it, and for his unfortunate idea to start the plasmid enterprise in the first
  place; Murat Tugrul for sharing his model, for his enthusiasm, and his comments
  on Chapter Three; Srdjan Sarikas for his collaboration on the Monod model fitting,
  fast forwarding the analysis to turbo speed and making beautiful figures, and making
  the discussion fun on top of it all; Vanessa Barone for her last minute comments,
  especially on Chapter Three, providing a sharp and very helpful experimentalist
  perspective at the last moment; Maros Pleska and Marjon de Vos for their comments
  on the manuscript of Chapter Two; Gasper Tkacik for his crucial input on the relation
  between growth rate and lactose concentration; Bor Kavcic for his input on growth
  rate modeling and error propagation. Thanks to the Bollback, Bollenbach, Barton,
  Guet and Tkacik group members for both pro- viding an inspiring and supportive scientific
  environment to work in, as well as a lot of warmth and colour to everyday life.
  And thanks to the friends I found here, to the people who were there for me and
  to the people who changed my life, making it stranger and more beautiful than I
  could have imagined, Maros, Vanessa, Tade, Suzi, Andrej, Peter, Tiago, Kristof,
  Karin, Irene, Misha, Mato, Guillaume and Zanin. "
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Fabienne
  full_name: Jesse, Fabienne
  id: 4C8C26A4-F248-11E8-B48F-1D18A9856A87
  last_name: Jesse
citation:
  ama: Jesse F. The lac operon in the wild. 2017. doi:<a href="https://doi.org/10.15479/AT:ISTA:th_857">10.15479/AT:ISTA:th_857</a>
  apa: Jesse, F. (2017). <i>The lac operon in the wild</i>. Institute of Science and
    Technology Austria. <a href="https://doi.org/10.15479/AT:ISTA:th_857">https://doi.org/10.15479/AT:ISTA:th_857</a>
  chicago: Jesse, Fabienne. “The Lac Operon in the Wild.” Institute of Science and
    Technology Austria, 2017. <a href="https://doi.org/10.15479/AT:ISTA:th_857">https://doi.org/10.15479/AT:ISTA:th_857</a>.
  ieee: F. Jesse, “The lac operon in the wild,” Institute of Science and Technology
    Austria, 2017.
  ista: Jesse F. 2017. The lac operon in the wild. Institute of Science and Technology
    Austria.
  mla: Jesse, Fabienne. <i>The Lac Operon in the Wild</i>. Institute of Science and
    Technology Austria, 2017, doi:<a href="https://doi.org/10.15479/AT:ISTA:th_857">10.15479/AT:ISTA:th_857</a>.
  short: F. Jesse, The Lac Operon in the Wild, Institute of Science and Technology
    Austria, 2017.
date_created: 2018-12-11T11:48:41Z
date_published: 2017-08-25T00:00:00Z
date_updated: 2023-09-07T12:01:21Z
day: '25'
ddc:
- '576'
- '577'
- '579'
degree_awarded: PhD
department:
- _id: JoBo
doi: 10.15479/AT:ISTA:th_857
ec_funded: 1
file:
- access_level: open_access
  checksum: c62257a7bff0c5f39e1abffc6bfcca5c
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:17:00Z
  date_updated: 2020-07-14T12:48:10Z
  file_id: '5252'
  file_name: IST-2017-857-v1+1_thesis_fabienne.pdf
  file_size: 3417773
  relation: main_file
- access_level: closed
  checksum: fc87d7d72fce52824a3ae7dcad0413a8
  content_type: application/x-tex
  creator: dernst
  date_created: 2019-04-05T08:51:59Z
  date_updated: 2020-07-14T12:48:10Z
  file_id: '6212'
  file_name: 2017_thesis_Jesse_source.tex
  file_size: 215899
  relation: source_file
file_date_updated: 2020-07-14T12:48:10Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: '87'
project:
- _id: 2578D616-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '648440'
  name: Selective Barriers to Horizontal Gene Transfer
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6829'
pubrep_id: '857'
status: public
supervisor:
- first_name: Jonathan P
  full_name: Bollback, Jonathan P
  id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
  last_name: Bollback
  orcid: 0000-0002-4624-4612
title: The lac operon in the wild
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '821'
abstract:
- lang: eng
  text: "This dissertation focuses on algorithmic aspects of program verification,
    and presents modeling and complexity advances on several problems related to the\r\nstatic
    analysis of programs, the stateless model checking of concurrent programs, and
    the competitive analysis of real-time scheduling algorithms.\r\nOur contributions
    can be broadly grouped into five categories.\r\n\r\nOur first contribution is
    a set of new algorithms and data structures for the quantitative and data-flow
    analysis of programs, based on the graph-theoretic notion of treewidth.\r\nIt
    has been observed that the control-flow graphs of typical programs have special
    structure, and are characterized as graphs of small treewidth.\r\nWe utilize this
    structural property to provide faster algorithms for the quantitative and data-flow
    analysis of recursive and concurrent programs.\r\nIn most cases we make an algebraic
    treatment of the considered problem,\r\nwhere several interesting analyses, such
    as the reachability, shortest path, and certain kind of data-flow analysis problems
    follow as special cases. \r\nWe exploit the constant-treewidth property to obtain
    algorithmic improvements for on-demand versions of the problems, \r\nand provide
    data structures with various tradeoffs between the resources spent in the preprocessing
    and querying phase.\r\nWe also improve on the algorithmic complexity of quantitative
    problems outside the algebraic path framework,\r\nnamely of the minimum mean-payoff,
    minimum ratio, and minimum initial credit for energy problems.\r\n\r\n\r\nOur
    second contribution is a set of algorithms for Dyck reachability with applications
    to data-dependence analysis and alias analysis.\r\nIn particular, we develop an
    optimal algorithm for Dyck reachability on bidirected graphs, which are ubiquitous
    in context-insensitive, field-sensitive points-to analysis.\r\nAdditionally, we
    develop an efficient algorithm for context-sensitive data-dependence analysis
    via Dyck reachability,\r\nwhere the task is to obtain analysis summaries of library
    code in the presence of callbacks.\r\nOur algorithm preprocesses libraries in
    almost linear time, after which the contribution of the library in the complexity
    of the client analysis is (i)~linear in the number of call sites and (ii)~only
    logarithmic in the size of the whole library, as opposed to linear in the size
    of the whole library.\r\nFinally, we prove that Dyck reachability is Boolean Matrix
    Multiplication-hard in general, and the hardness also holds for graphs of constant
    treewidth.\r\nThis hardness result strongly indicates that there exist no combinatorial
    algorithms for Dyck reachability with truly subcubic complexity.\r\n\r\n\r\nOur
    third contribution is the formalization and algorithmic treatment of the Quantitative
    Interprocedural Analysis framework.\r\nIn this framework, the transitions of a
    recursive program are annotated as good, bad or neutral, and receive a weight
    which measures\r\nthe magnitude of their respective effect.\r\nThe Quantitative
    Interprocedural Analysis problem asks to determine whether there exists an infinite
    run of the program where the long-run ratio of the bad weights over the good weights
    is above a given threshold.\r\nWe illustrate how several quantitative problems
    related to static analysis of recursive programs can be instantiated in this framework,\r\nand
    present some case studies to this direction.\r\n\r\n\r\nOur fourth contribution
    is a new dynamic partial-order reduction for the stateless model checking of concurrent
    programs. Traditional approaches rely on the standard Mazurkiewicz equivalence
    between  traces, by means of partitioning the trace space into equivalence classes,
    and attempting to explore a few representatives from each class.\r\nWe present
    a new dynamic partial-order reduction method  called the Data-centric Partial
    Order Reduction (DC-DPOR).\r\nOur algorithm is based on a new equivalence between
    traces, called the observation equivalence.\r\nDC-DPOR explores a coarser partitioning
    of the trace space than any exploration method based on the standard Mazurkiewicz
    equivalence.\r\nDepending on the program, the new partitioning can be even exponentially
    coarser.\r\nAdditionally, DC-DPOR spends only polynomial time in each explored
    class.\r\n\r\n\r\nOur fifth contribution is the use of automata and game-theoretic
    verification techniques in the competitive analysis and synthesis of real-time
    scheduling algorithms for firm-deadline tasks.\r\nOn the analysis side, we leverage
    automata on infinite words to compute the competitive ratio of real-time schedulers
    subject to various environmental constraints.\r\nOn the synthesis side, we introduce
    a new instance of two-player mean-payoff partial-information games, and show\r\nhow
    the synthesis of an optimal real-time scheduler can be reduced to computing winning
    strategies in this new type of games."
acknowledgement: "First, I am thankful to my advisor, Krishnendu Chatterjee, for offering
  me the opportunity to\r\nmaterialize my scientific curiosity in a remarkably wide
  range of interesting topics, as well as for his constant availability and continuous
  support throughout my doctoral studies. I have had the privilege of collaborating
  with, discussing and getting inspired by all members of my committee: Thomas A.
  Henzinger, Ulrich Schmid and Martin A. Nowak. The role of the above four people
  has been very instrumental both to the research carried out for this dissertation,
  and to the researcher I evolved to in the process.\r\nI have greatly enjoyed my
  numerous brainstorming sessions with Rasmus Ibsen-Jensen, many\r\nof which led to
  results on low-treewidth graphs presented here.  I thank Alex Kößler for our\r\ndiscussions
  on modeling and analyzing real-time scheduling algorithms, Yaron Velner for our\r\ncollaboration
  on the Quantitative Interprocedural Analysis framework, and Nishant Sinha for our
  initial discussions on partial order reduction techniques in stateless model checking.
  I also thank Jan Otop, Ben Adlam, Bernhard Kragl and Josef Tkadlec for our fruitful
  collaborations on\r\ntopics outside the scope of this dissertation, as well as the
  interns Prateesh Goyal, Amir Kafshdar Goharshady, Samarth Mishra, Bhavya Choudhary
  and Marek Chalupa, with whom I have shared my excitement on various research topics.
  Together with my collaborators, I thank officemates and members of the Chatterjee
  and Henzinger groups throughout the years, Thorsten Tarrach, Ventsi Chonev, Roopsha
  Samanta, Przemek Daca, Mirco Giacobbe, Tanja Petrov, Ashutosh\r\nGupta,  Arjun Radhakrishna,
  \ Petr Novontý,  Christian Hilbe,  Jakob Ruess,  Martin Chmelik,\r\nCezara Dragoi,
  Johannes Reiter, Andrey Kupriyanov, Guy Avni, Sasha Rubin, Jessica Davies, Hongfei
  Fu, Thomas Ferrère, Pavol Cerný, Ali Sezgin, Jan Kretínský, Sergiy Bogomolov, Hui\r\nKong,
  Benjamin Aminof, Duc-Hiep Chu, and Damien Zufferey.  Besides collaborations and
  office spaces, with many of the above people I have been fortunate to share numerous
  whiteboard\r\ndiscussions, as well as memorable long walks and amicable meals accompanied
  by stimulating\r\nconversations. I am highly indebted to Elisabeth Hacker for her
  continuous assistance in matters\r\nthat often exceeded her official duties, and
  who made my integration in Austria a smooth process."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Andreas
  full_name: Pavlogiannis, Andreas
  id: 49704004-F248-11E8-B48F-1D18A9856A87
  last_name: Pavlogiannis
  orcid: 0000-0002-8943-0722
citation:
  ama: Pavlogiannis A. Algorithmic advances in program analysis and their applications.
    2017. doi:<a href="https://doi.org/10.15479/AT:ISTA:th_854">10.15479/AT:ISTA:th_854</a>
  apa: Pavlogiannis, A. (2017). <i>Algorithmic advances in program analysis and their
    applications</i>. Institute of Science and Technology Austria. <a href="https://doi.org/10.15479/AT:ISTA:th_854">https://doi.org/10.15479/AT:ISTA:th_854</a>
  chicago: Pavlogiannis, Andreas. “Algorithmic Advances in Program Analysis and Their
    Applications.” Institute of Science and Technology Austria, 2017. <a href="https://doi.org/10.15479/AT:ISTA:th_854">https://doi.org/10.15479/AT:ISTA:th_854</a>.
  ieee: A. Pavlogiannis, “Algorithmic advances in program analysis and their applications,”
    Institute of Science and Technology Austria, 2017.
  ista: Pavlogiannis A. 2017. Algorithmic advances in program analysis and their applications.
    Institute of Science and Technology Austria.
  mla: Pavlogiannis, Andreas. <i>Algorithmic Advances in Program Analysis and Their
    Applications</i>. Institute of Science and Technology Austria, 2017, doi:<a href="https://doi.org/10.15479/AT:ISTA:th_854">10.15479/AT:ISTA:th_854</a>.
  short: A. Pavlogiannis, Algorithmic Advances in Program Analysis and Their Applications,
    Institute of Science and Technology Austria, 2017.
date_created: 2018-12-11T11:48:41Z
date_published: 2017-08-09T00:00:00Z
date_updated: 2023-09-07T12:01:59Z
day: '09'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: KrCh
doi: 10.15479/AT:ISTA:th_854
ec_funded: 1
file:
- access_level: open_access
  checksum: 3a3ec003f6ee73f41f82a544d63dfc77
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:11:44Z
  date_updated: 2020-07-14T12:48:10Z
  file_id: '4900'
  file_name: IST-2017-854-v1+1_Pavlogiannis_Thesis_PubRep.pdf
  file_size: 4103115
  relation: main_file
- access_level: closed
  checksum: bd2facc45ff8a2e20c5ed313c2ccaa83
  content_type: application/zip
  creator: dernst
  date_created: 2019-04-05T07:59:31Z
  date_updated: 2020-07-14T12:48:10Z
  file_id: '6201'
  file_name: 2017_thesis_Pavlogiannis.zip
  file_size: 14744374
  relation: source_file
file_date_updated: 2020-07-14T12:48:10Z
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '08'
oa: 1
oa_version: Published Version
page: '418'
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'
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6828'
pubrep_id: '854'
related_material:
  record:
  - id: '1071'
    relation: part_of_dissertation
    status: public
  - id: '1437'
    relation: part_of_dissertation
    status: public
  - id: '1602'
    relation: part_of_dissertation
    status: public
  - id: '1604'
    relation: part_of_dissertation
    status: public
  - id: '1607'
    relation: part_of_dissertation
    status: public
  - id: '1714'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
title: Algorithmic advances in program analysis and their applications
tmp:
  image: /image/cc_by_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
  name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
  short: CC BY-ND (4.0)
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '822'
abstract:
- lang: eng
  text: 'Polymicrobial infections constitute small ecosystems that accommodate several
    bacterial species. Commonly, these bacteria are investigated in isolation. However,
    it is unknown to what extent the isolates interact and whether their interactions
    alter bacterial growth and ecosystem resilience in the presence and absence of
    antibiotics. We quantified the complete ecological interaction network for 72
    bacterial isolates collected from 23 individuals diagnosed with polymicrobial
    urinary tract infections and found that most interactions cluster based on evolutionary
    relatedness. Statistical network analysis revealed that competitive and cooperative
    reciprocal interactions are enriched in the global network, while cooperative
    interactions are depleted in the individual host community networks. A population
    dynamics model parameterized by our measurements suggests that interactions restrict
    community stability, explaining the observed species diversity of these communities.
    We further show that the clinical isolates frequently protect each other from
    clinically relevant antibiotics. Together, these results highlight that ecological
    interactions are crucial for the growth and survival of bacteria in polymicrobial
    infection communities and affect their assembly and resilience. '
article_processing_charge: No
author:
- first_name: Marjon
  full_name: De Vos, Marjon
  id: 3111FFAC-F248-11E8-B48F-1D18A9856A87
  last_name: De Vos
- first_name: Marcin P
  full_name: Zagórski, Marcin P
  id: 343DA0DC-F248-11E8-B48F-1D18A9856A87
  last_name: Zagórski
  orcid: 0000-0001-7896-7762
- first_name: Alan
  full_name: Mcnally, Alan
  last_name: Mcnally
- first_name: Mark Tobias
  full_name: Bollenbach, Mark Tobias
  id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
  last_name: Bollenbach
  orcid: 0000-0003-4398-476X
citation:
  ama: de Vos M, Zagórski MP, Mcnally A, Bollenbach MT. Interaction networks, ecological
    stability, and collective antibiotic tolerance in polymicrobial infections. <i>PNAS</i>.
    2017;114(40):10666-10671. doi:<a href="https://doi.org/10.1073/pnas.1713372114">10.1073/pnas.1713372114</a>
  apa: de Vos, M., Zagórski, M. P., Mcnally, A., &#38; Bollenbach, M. T. (2017). Interaction
    networks, ecological stability, and collective antibiotic tolerance in polymicrobial
    infections. <i>PNAS</i>. National Academy of Sciences. <a href="https://doi.org/10.1073/pnas.1713372114">https://doi.org/10.1073/pnas.1713372114</a>
  chicago: Vos, Marjon de, Marcin P Zagórski, Alan Mcnally, and Mark Tobias Bollenbach.
    “Interaction Networks, Ecological Stability, and Collective Antibiotic Tolerance
    in Polymicrobial Infections.” <i>PNAS</i>. National Academy of Sciences, 2017.
    <a href="https://doi.org/10.1073/pnas.1713372114">https://doi.org/10.1073/pnas.1713372114</a>.
  ieee: M. de Vos, M. P. Zagórski, A. Mcnally, and M. T. Bollenbach, “Interaction
    networks, ecological stability, and collective antibiotic tolerance in polymicrobial
    infections,” <i>PNAS</i>, vol. 114, no. 40. National Academy of Sciences, pp.
    10666–10671, 2017.
  ista: de Vos M, Zagórski MP, Mcnally A, Bollenbach MT. 2017. Interaction networks,
    ecological stability, and collective antibiotic tolerance in polymicrobial infections.
    PNAS. 114(40), 10666–10671.
  mla: de Vos, Marjon, et al. “Interaction Networks, Ecological Stability, and Collective
    Antibiotic Tolerance in Polymicrobial Infections.” <i>PNAS</i>, vol. 114, no.
    40, National Academy of Sciences, 2017, pp. 10666–71, doi:<a href="https://doi.org/10.1073/pnas.1713372114">10.1073/pnas.1713372114</a>.
  short: M. de Vos, M.P. Zagórski, A. Mcnally, M.T. Bollenbach, PNAS 114 (2017) 10666–10671.
date_created: 2018-12-11T11:48:41Z
date_published: 2017-10-03T00:00:00Z
date_updated: 2023-09-26T16:18:48Z
day: '03'
department:
- _id: ToBo
doi: 10.1073/pnas.1713372114
ec_funded: 1
external_id:
  isi:
  - '000412130500061'
  pmid:
  - '28923953'
intvolume: '       114'
isi: 1
issue: '40'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5635929/
month: '10'
oa: 1
oa_version: Submitted Version
page: 10666 - 10671
pmid: 1
project:
- _id: 25E83C2C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '303507'
  name: Optimality principles in responses to antibiotics
- _id: 25E9AF9E-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P27201-B22
  name: Revealing the mechanisms underlying drug interactions
publication: PNAS
publication_identifier:
  issn:
  - '00278424'
publication_status: published
publisher: National Academy of Sciences
publist_id: '6827'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Interaction networks, ecological stability, and collective antibiotic tolerance
  in polymicrobial infections
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 114
year: '2017'
...
---
_id: '823'
abstract:
- lang: eng
  text: The resolution of a linear system with positive integer variables is a basic
    yet difficult computational problem with many applications. We consider sparse
    uncorrelated random systems parametrised by the density c and the ratio α=N/M
    between number of variables N and number of constraints M. By means of ensemble
    calculations we show that the space of feasible solutions endows a Van-Der-Waals
    phase diagram in the plane (c, α). We give numerical evidence that the associated
    computational problems become more difficult across the critical point and in
    particular in the coexistence region.
article_number: '093404'
article_processing_charge: No
author:
- first_name: Simona
  full_name: Colabrese, Simona
  last_name: Colabrese
- first_name: Daniele
  full_name: De Martino, Daniele
  id: 3FF5848A-F248-11E8-B48F-1D18A9856A87
  last_name: De Martino
  orcid: 0000-0002-5214-4706
- first_name: Luca
  full_name: Leuzzi, Luca
  last_name: Leuzzi
- first_name: Enzo
  full_name: Marinari, Enzo
  last_name: Marinari
citation:
  ama: 'Colabrese S, De Martino D, Leuzzi L, Marinari E. Phase transitions in integer
    linear problems. <i> Journal of Statistical Mechanics: Theory and Experiment</i>.
    2017;2017(9). doi:<a href="https://doi.org/10.1088/1742-5468/aa85c3">10.1088/1742-5468/aa85c3</a>'
  apa: 'Colabrese, S., De Martino, D., Leuzzi, L., &#38; Marinari, E. (2017). Phase
    transitions in integer linear problems. <i> Journal of Statistical Mechanics:
    Theory and Experiment</i>. IOPscience. <a href="https://doi.org/10.1088/1742-5468/aa85c3">https://doi.org/10.1088/1742-5468/aa85c3</a>'
  chicago: 'Colabrese, Simona, Daniele De Martino, Luca Leuzzi, and Enzo Marinari.
    “Phase Transitions in Integer Linear Problems.” <i> Journal of Statistical Mechanics:
    Theory and Experiment</i>. IOPscience, 2017. <a href="https://doi.org/10.1088/1742-5468/aa85c3">https://doi.org/10.1088/1742-5468/aa85c3</a>.'
  ieee: 'S. Colabrese, D. De Martino, L. Leuzzi, and E. Marinari, “Phase transitions
    in integer linear problems,” <i> Journal of Statistical Mechanics: Theory and
    Experiment</i>, vol. 2017, no. 9. IOPscience, 2017.'
  ista: 'Colabrese S, De Martino D, Leuzzi L, Marinari E. 2017. Phase transitions
    in integer linear problems.  Journal of Statistical Mechanics: Theory and Experiment.
    2017(9), 093404.'
  mla: 'Colabrese, Simona, et al. “Phase Transitions in Integer Linear Problems.”
    <i> Journal of Statistical Mechanics: Theory and Experiment</i>, vol. 2017, no.
    9, 093404, IOPscience, 2017, doi:<a href="https://doi.org/10.1088/1742-5468/aa85c3">10.1088/1742-5468/aa85c3</a>.'
  short: 'S. Colabrese, D. De Martino, L. Leuzzi, E. Marinari,  Journal of Statistical
    Mechanics: Theory and Experiment 2017 (2017).'
date_created: 2018-12-11T11:48:41Z
date_published: 2017-09-26T00:00:00Z
date_updated: 2023-09-26T16:18:12Z
day: '26'
department:
- _id: GaTk
doi: 10.1088/1742-5468/aa85c3
ec_funded: 1
external_id:
  isi:
  - '000411842900001'
intvolume: '      2017'
isi: 1
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1705.06303
month: '09'
oa: 1
oa_version: Submitted Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
publication: ' Journal of Statistical Mechanics: Theory and Experiment'
publication_identifier:
  issn:
  - '17425468'
publication_status: published
publisher: IOPscience
publist_id: '6826'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Phase transitions in integer linear problems
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2017
year: '2017'
...
---
_id: '824'
abstract:
- lang: eng
  text: 'In shear flows at transitional Reynolds numbers, localized patches of turbulence,
    known as puffs, coexist with the laminar flow. Recently, Avila et al. (Phys. Rev.
    Lett., vol. 110, 2013, 224502) discovered two spatially localized relative periodic
    solutions for pipe flow, which appeared in a saddle-node bifurcation at low Reynolds
    number. Combining slicing methods for continuous symmetry reduction with Poincaré
    sections for the first time in a shear flow setting, we compute and visualize
    the unstable manifold of the lower-branch solution and show that it extends towards
    the neighbourhood of the upper-branch solution. Surprisingly, this connection
    even persists far above the bifurcation point and appears to mediate the first
    stage of the puff generation: amplification of streamwise localized fluctuations.
    When the state-space trajectories on the unstable manifold reach the vicinity
    of the upper branch, corresponding fluctuations expand in space and eventually
    take the usual shape of a puff.'
article_number: R1
article_processing_charge: No
author:
- first_name: Nazmi B
  full_name: Budanur, Nazmi B
  id: 3EA1010E-F248-11E8-B48F-1D18A9856A87
  last_name: Budanur
  orcid: 0000-0003-0423-5010
- first_name: Björn
  full_name: Hof, Björn
  id: 3A374330-F248-11E8-B48F-1D18A9856A87
  last_name: Hof
  orcid: 0000-0003-2057-2754
citation:
  ama: Budanur NB, Hof B. Heteroclinic path to spatially localized chaos in pipe flow.
    <i>Journal of Fluid Mechanics</i>. 2017;827. doi:<a href="https://doi.org/10.1017/jfm.2017.516">10.1017/jfm.2017.516</a>
  apa: Budanur, N. B., &#38; Hof, B. (2017). Heteroclinic path to spatially localized
    chaos in pipe flow. <i>Journal of Fluid Mechanics</i>. Cambridge University Press.
    <a href="https://doi.org/10.1017/jfm.2017.516">https://doi.org/10.1017/jfm.2017.516</a>
  chicago: Budanur, Nazmi B, and Björn Hof. “Heteroclinic Path to Spatially Localized
    Chaos in Pipe Flow.” <i>Journal of Fluid Mechanics</i>. Cambridge University Press,
    2017. <a href="https://doi.org/10.1017/jfm.2017.516">https://doi.org/10.1017/jfm.2017.516</a>.
  ieee: N. B. Budanur and B. Hof, “Heteroclinic path to spatially localized chaos
    in pipe flow,” <i>Journal of Fluid Mechanics</i>, vol. 827. Cambridge University
    Press, 2017.
  ista: Budanur NB, Hof B. 2017. Heteroclinic path to spatially localized chaos in
    pipe flow. Journal of Fluid Mechanics. 827, R1.
  mla: Budanur, Nazmi B., and Björn Hof. “Heteroclinic Path to Spatially Localized
    Chaos in Pipe Flow.” <i>Journal of Fluid Mechanics</i>, vol. 827, R1, Cambridge
    University Press, 2017, doi:<a href="https://doi.org/10.1017/jfm.2017.516">10.1017/jfm.2017.516</a>.
  short: N.B. Budanur, B. Hof, Journal of Fluid Mechanics 827 (2017).
date_created: 2018-12-11T11:48:42Z
date_published: 2017-08-18T00:00:00Z
date_updated: 2023-09-26T16:17:43Z
day: '18'
department:
- _id: BjHo
doi: 10.1017/jfm.2017.516
external_id:
  isi:
  - '000408326300001'
intvolume: '       827'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1703.10484
month: '08'
oa: 1
oa_version: Submitted Version
publication: Journal of Fluid Mechanics
publication_identifier:
  issn:
  - '00221120'
publication_status: published
publisher: Cambridge University Press
publist_id: '6824'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Heteroclinic path to spatially localized chaos in pipe flow
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 827
year: '2017'
...
---
_id: '825'
abstract:
- lang: eng
  text: What data is needed about data? Describing the process to answer this question
    for the institutional data repository IST DataRep.
author:
- first_name: Barbara
  full_name: Petritsch, Barbara
  id: 406048EC-F248-11E8-B48F-1D18A9856A87
  last_name: Petritsch
  orcid: 0000-0003-2724-4614
citation:
  ama: Petritsch B. Metadata for research data in practice. <i>Mitteilungen der Vereinigung
    Österreichischer Bibliothekarinnen &#38; Bibliothekare</i>. 2017;70(2):200-207.
    doi:<a href="https://doi.org/10.31263/voebm.v70i2.1678">10.31263/voebm.v70i2.1678</a>
  apa: Petritsch, B. (2017). Metadata for research data in practice. <i>Mitteilungen
    Der Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare</i>. VÖB.
    <a href="https://doi.org/10.31263/voebm.v70i2.1678">https://doi.org/10.31263/voebm.v70i2.1678</a>
  chicago: Petritsch, Barbara. “Metadata for Research Data in Practice.” <i>Mitteilungen
    Der Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare</i>. VÖB,
    2017. <a href="https://doi.org/10.31263/voebm.v70i2.1678">https://doi.org/10.31263/voebm.v70i2.1678</a>.
  ieee: B. Petritsch, “Metadata for research data in practice,” <i>Mitteilungen der
    Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare</i>, vol. 70,
    no. 2. VÖB, pp. 200–207, 2017.
  ista: Petritsch B. 2017. Metadata for research data in practice. Mitteilungen der
    Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare. 70(2), 200–207.
  mla: Petritsch, Barbara. “Metadata for Research Data in Practice.” <i>Mitteilungen
    Der Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare</i>, vol.
    70, no. 2, VÖB, 2017, pp. 200–07, doi:<a href="https://doi.org/10.31263/voebm.v70i2.1678">10.31263/voebm.v70i2.1678</a>.
  short: B. Petritsch, Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen
    &#38; Bibliothekare 70 (2017) 200–207.
date_created: 2018-12-11T11:48:42Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2021-01-12T08:17:44Z
day: '01'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.31263/voebm.v70i2.1678
file:
- access_level: open_access
  checksum: 7c4544d07efa2c2add8612b489abb4e2
  content_type: application/pdf
  creator: dernst
  date_created: 2019-01-18T13:32:17Z
  date_updated: 2020-07-14T12:48:11Z
  file_id: '5850'
  file_name: 2017_VOEB_Petritsch.pdf
  file_size: 7843975
  relation: main_file
file_date_updated: 2020-07-14T12:48:11Z
has_accepted_license: '1'
intvolume: '        70'
issue: '2'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 200 - 207
publication: Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare
publication_identifier:
  issn:
  - '10222588'
publication_status: published
publisher: VÖB
publist_id: '6823'
scopus_import: 1
status: public
title: Metadata for research data in practice
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: 70
year: '2017'
...
---
_id: '833'
abstract:
- lang: eng
  text: We present an efficient algorithm to compute Euler characteristic curves of
    gray scale images of arbitrary dimension. In various applications the Euler characteristic
    curve is used as a descriptor of an image. Our algorithm is the first streaming
    algorithm for Euler characteristic curves. The usage of streaming removes the
    necessity to store the entire image in RAM. Experiments show that our implementation
    handles terabyte scale images on commodity hardware. Due to lock-free parallelism,
    it scales well with the number of processor cores. Additionally, we put the concept
    of the Euler characteristic curve in the wider context of computational topology.
    In particular, we explain the connection with persistence diagrams.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Teresa
  full_name: Heiss, Teresa
  id: 4879BB4E-F248-11E8-B48F-1D18A9856A87
  last_name: Heiss
  orcid: 0000-0002-1780-2689
- first_name: Hubert
  full_name: Wagner, Hubert
  id: 379CA8B8-F248-11E8-B48F-1D18A9856A87
  last_name: Wagner
citation:
  ama: 'Heiss T, Wagner H. Streaming algorithm for Euler characteristic curves of
    multidimensional images. In: Felsberg M, Heyden A, Krüger N, eds. Vol 10424. Springer;
    2017:397-409. doi:<a href="https://doi.org/10.1007/978-3-319-64689-3_32">10.1007/978-3-319-64689-3_32</a>'
  apa: 'Heiss, T., &#38; Wagner, H. (2017). Streaming algorithm for Euler characteristic
    curves of multidimensional images. In M. Felsberg, A. Heyden, &#38; N. Krüger
    (Eds.) (Vol. 10424, pp. 397–409). Presented at the CAIP: Computer Analysis of
    Images and Patterns, Ystad, Sweden: Springer. <a href="https://doi.org/10.1007/978-3-319-64689-3_32">https://doi.org/10.1007/978-3-319-64689-3_32</a>'
  chicago: Heiss, Teresa, and Hubert Wagner. “Streaming Algorithm for Euler Characteristic
    Curves of Multidimensional Images.” edited by Michael Felsberg, Anders Heyden,
    and Norbert Krüger, 10424:397–409. Springer, 2017. <a href="https://doi.org/10.1007/978-3-319-64689-3_32">https://doi.org/10.1007/978-3-319-64689-3_32</a>.
  ieee: 'T. Heiss and H. Wagner, “Streaming algorithm for Euler characteristic curves
    of multidimensional images,” presented at the CAIP: Computer Analysis of Images
    and Patterns, Ystad, Sweden, 2017, vol. 10424, pp. 397–409.'
  ista: 'Heiss T, Wagner H. 2017. Streaming algorithm for Euler characteristic curves
    of multidimensional images. CAIP: Computer Analysis of Images and Patterns, LNCS,
    vol. 10424, 397–409.'
  mla: Heiss, Teresa, and Hubert Wagner. <i>Streaming Algorithm for Euler Characteristic
    Curves of Multidimensional Images</i>. Edited by Michael Felsberg et al., vol.
    10424, Springer, 2017, pp. 397–409, doi:<a href="https://doi.org/10.1007/978-3-319-64689-3_32">10.1007/978-3-319-64689-3_32</a>.
  short: T. Heiss, H. Wagner, in:, M. Felsberg, A. Heyden, N. Krüger (Eds.), Springer,
    2017, pp. 397–409.
conference:
  end_date: 2017-08-24
  location: Ystad, Sweden
  name: 'CAIP: Computer Analysis of Images and Patterns'
  start_date: 2017-08-22
date_created: 2018-12-11T11:48:45Z
date_published: 2017-07-28T00:00:00Z
date_updated: 2023-09-26T16:10:03Z
day: '28'
department:
- _id: HeEd
doi: 10.1007/978-3-319-64689-3_32
editor:
- first_name: Michael
  full_name: Felsberg, Michael
  last_name: Felsberg
- first_name: Anders
  full_name: Heyden, Anders
  last_name: Heyden
- first_name: Norbert
  full_name: Krüger, Norbert
  last_name: Krüger
external_id:
  isi:
  - '000432085900032'
intvolume: '     10424'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1705.02045
month: '07'
oa: 1
oa_version: Submitted Version
page: 397 - 409
publication_identifier:
  issn:
  - '03029743'
publication_status: published
publisher: Springer
publist_id: '6815'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Streaming algorithm for Euler characteristic curves of multidimensional images
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10424
year: '2017'
...
---
_id: '834'
abstract:
- lang: eng
  text: 'Thermal and many-body localized phases are separated by a dynamical phase
    transition of a new kind. We analyze the distribution of off-diagonal matrix elements
    of local operators across this transition in two different models of disordered
    spin chains. We show that the behavior of matrix elements can be used to characterize
    the breakdown of thermalization and to extract the many-body Thouless energy.
    We find that upon increasing the disorder strength the system enters a critical
    region around the many-body localization transition. The properties of the system
    in this region are: (i) the Thouless energy becomes smaller than the level spacing,
    (ii) the matrix elements show critical dependence on the energy difference, and
    (iii) the matrix elements, viewed as amplitudes of a fictitious wave function,
    exhibit strong multifractality. This critical region decreases with the system
    size, which we interpret as evidence for a diverging correlation length at the
    many-body localization transition. Our findings show that the correlation length
    becomes larger than the accessible system sizes in a broad range of disorder strength
    values and shed light on the critical behavior near the many-body localization
    transition.'
acknowledgement: We   acknowledge   useful   discussions with V. Kravtsov, T. Grover,
  and R. Vasseur.  M.S. was supported by Gordon and Betty Moore Foundation’s EPiQS
  Initiative through Grant GBMF4307.  M.S. and D.A.  acknowledge  hospitality  of  KITP,  where  parts  of
  this work were completed (supported in part by the National Science Foundation under
  Grant No. NSF PHY11-25915)
article_number: '104201'
article_processing_charge: No
author:
- first_name: Maksym
  full_name: Serbyn, Maksym
  id: 47809E7E-F248-11E8-B48F-1D18A9856A87
  last_name: Serbyn
  orcid: 0000-0002-2399-5827
- first_name: Papic
  full_name: Zlatko, Papic
  last_name: Zlatko
- first_name: Dmitry
  full_name: Abanin, Dmitry
  last_name: Abanin
citation:
  ama: Serbyn M, Zlatko P, Abanin D. Thouless energy and multifractality across the
    many-body localization transition. <i>Physical Review B - Condensed Matter and
    Materials Physics</i>. 2017;96(10). doi:<a href="https://doi.org/10.1103/PhysRevB.96.104201">10.1103/PhysRevB.96.104201</a>
  apa: Serbyn, M., Zlatko, P., &#38; Abanin, D. (2017). Thouless energy and multifractality
    across the many-body localization transition. <i>Physical Review B - Condensed
    Matter and Materials Physics</i>. American Physical Society. <a href="https://doi.org/10.1103/PhysRevB.96.104201">https://doi.org/10.1103/PhysRevB.96.104201</a>
  chicago: Serbyn, Maksym, Papic Zlatko, and Dmitry Abanin. “Thouless Energy and Multifractality
    across the Many-Body Localization Transition.” <i>Physical Review B - Condensed
    Matter and Materials Physics</i>. American Physical Society, 2017. <a href="https://doi.org/10.1103/PhysRevB.96.104201">https://doi.org/10.1103/PhysRevB.96.104201</a>.
  ieee: M. Serbyn, P. Zlatko, and D. Abanin, “Thouless energy and multifractality
    across the many-body localization transition,” <i>Physical Review B - Condensed
    Matter and Materials Physics</i>, vol. 96, no. 10. American Physical Society,
    2017.
  ista: Serbyn M, Zlatko P, Abanin D. 2017. Thouless energy and multifractality across
    the many-body localization transition. Physical Review B - Condensed Matter and
    Materials Physics. 96(10), 104201.
  mla: Serbyn, Maksym, et al. “Thouless Energy and Multifractality across the Many-Body
    Localization Transition.” <i>Physical Review B - Condensed Matter and Materials
    Physics</i>, vol. 96, no. 10, 104201, American Physical Society, 2017, doi:<a
    href="https://doi.org/10.1103/PhysRevB.96.104201">10.1103/PhysRevB.96.104201</a>.
  short: M. Serbyn, P. Zlatko, D. Abanin, Physical Review B - Condensed Matter and
    Materials Physics 96 (2017).
date_created: 2018-12-11T11:48:45Z
date_published: 2017-09-06T00:00:00Z
date_updated: 2023-09-26T15:51:54Z
day: '06'
department:
- _id: MaSe
doi: 10.1103/PhysRevB.96.104201
external_id:
  isi:
  - '000409429300004'
intvolume: '        96'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1610.02389
month: '09'
oa: 1
oa_version: Submitted Version
publication: Physical Review B - Condensed Matter and Materials Physics
publication_identifier:
  issn:
  - '24699950'
publication_status: published
publisher: American Physical Society
publist_id: '6814'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Thouless energy and multifractality across the many-body localization transition
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 96
year: '2017'
...
---
_id: '836'
abstract:
- lang: eng
  text: Recent research has examined how to study the topological features of a continuous
    self-map by means of the persistence of the eigenspaces, for given eigenvalues,
    of the endomorphism induced in homology over a field. This raised the question
    of how to select dynamically significant eigenvalues. The present paper aims to
    answer this question, giving an algorithm that computes the persistence of eigenspaces
    for every eigenvalue simultaneously, also expressing said eigenspaces as direct
    sums of “finite” and “singular” subspaces.
alternative_title:
- PROMS
article_processing_charge: No
author:
- first_name: Marc
  full_name: Ethier, Marc
  last_name: Ethier
- first_name: Grzegorz
  full_name: Jablonski, Grzegorz
  id: 4483EF78-F248-11E8-B48F-1D18A9856A87
  last_name: Jablonski
  orcid: 0000-0002-3536-9866
- first_name: Marian
  full_name: Mrozek, Marian
  last_name: Mrozek
citation:
  ama: 'Ethier M, Jablonski G, Mrozek M. Finding eigenvalues of self-maps with the
    Kronecker canonical form. In: <i>Special Sessions in Applications of Computer
    Algebra</i>. Vol 198. Springer; 2017:119-136. doi:<a href="https://doi.org/10.1007/978-3-319-56932-1_8">10.1007/978-3-319-56932-1_8</a>'
  apa: 'Ethier, M., Jablonski, G., &#38; Mrozek, M. (2017). Finding eigenvalues of
    self-maps with the Kronecker canonical form. In <i>Special Sessions in Applications
    of Computer Algebra</i> (Vol. 198, pp. 119–136). Kalamata, Greece: Springer. <a
    href="https://doi.org/10.1007/978-3-319-56932-1_8">https://doi.org/10.1007/978-3-319-56932-1_8</a>'
  chicago: Ethier, Marc, Grzegorz Jablonski, and Marian Mrozek. “Finding Eigenvalues
    of Self-Maps with the Kronecker Canonical Form.” In <i>Special Sessions in Applications
    of Computer Algebra</i>, 198:119–36. Springer, 2017. <a href="https://doi.org/10.1007/978-3-319-56932-1_8">https://doi.org/10.1007/978-3-319-56932-1_8</a>.
  ieee: M. Ethier, G. Jablonski, and M. Mrozek, “Finding eigenvalues of self-maps
    with the Kronecker canonical form,” in <i>Special Sessions in Applications of
    Computer Algebra</i>, Kalamata, Greece, 2017, vol. 198, pp. 119–136.
  ista: 'Ethier M, Jablonski G, Mrozek M. 2017. Finding eigenvalues of self-maps with
    the Kronecker canonical form. Special Sessions in Applications of Computer Algebra.
    ACA: Applications of Computer Algebra, PROMS, vol. 198, 119–136.'
  mla: Ethier, Marc, et al. “Finding Eigenvalues of Self-Maps with the Kronecker Canonical
    Form.” <i>Special Sessions in Applications of Computer Algebra</i>, vol. 198,
    Springer, 2017, pp. 119–36, doi:<a href="https://doi.org/10.1007/978-3-319-56932-1_8">10.1007/978-3-319-56932-1_8</a>.
  short: M. Ethier, G. Jablonski, M. Mrozek, in:, Special Sessions in Applications
    of Computer Algebra, Springer, 2017, pp. 119–136.
conference:
  end_date: 2015-07-23
  location: Kalamata, Greece
  name: 'ACA: Applications of Computer Algebra'
  start_date: 2015-07-20
date_created: 2018-12-11T11:48:46Z
date_published: 2017-07-27T00:00:00Z
date_updated: 2023-09-26T15:50:52Z
day: '27'
department:
- _id: HeEd
doi: 10.1007/978-3-319-56932-1_8
ec_funded: 1
external_id:
  isi:
  - '000434088200008'
intvolume: '       198'
isi: 1
language:
- iso: eng
month: '07'
oa_version: None
page: 119 - 136
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '318493'
  name: Topological Complex Systems
publication: Special Sessions in Applications of Computer Algebra
publication_identifier:
  isbn:
  - 978-331956930-7
publication_status: published
publisher: Springer
publist_id: '6812'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Finding eigenvalues of self-maps with the Kronecker canonical form
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 198
year: '2017'
...
---
_id: '837'
abstract:
- lang: eng
  text: 'The hippocampus is a key brain region for memory and notably for spatial
    memory, and is needed for both spatial working and reference memories. Hippocampal
    place cells selectively discharge in specific locations of the environment to
    form mnemonic represen tations of space. Several behavioral protocols have been
    designed to test spatial memory which requires the experimental subject to utilize
    working memory and reference memory. However, less is known about how these memory
    traces are presented in the hippo campus, especially considering tasks that require
    both spatial working and long -term reference memory demand. The aim of my thesis
    was to elucidate how spatial working memory, reference memory, and the combination
    of both are represented in the hippocampus. In this thesis, using a radial eight
    -arm maze, I examined how the combined demand on these memories influenced place
    cell assemblies while reference memories were partially updated by changing some
    of the reward- arms. This was contrasted with task varian ts requiring working
    or reference memories only. Reference memory update led to gradual place field
    shifts towards the rewards on the switched arms. Cells developed enhanced firing
    in passes between newly -rewarded arms as compared to those containing an unchanged
    reward. The working memory task did not show such gradual changes. Place assemblies
    on occasions replayed trajectories of the maze; at decision points the next arm
    choice was preferentially replayed in tasks needing reference memory while in
    the pure working memory task the previously visited arm was replayed. Hence trajectory
    replay only reflected the decision of the animal in tasks needing reference memory
    update. At the reward locations, in all three tasks outbound trajectories of the
    current arm were preferentially replayed, showing the animals’ next path to the
    center. At reward locations trajectories were replayed preferentially in reverse
    temporal order. Moreover, in the center reverse replay was seen in the working
    memory task but in the other tasks forward replay was seen. Hence, the direction
    of reactivation was determined by the goal locations so that part of the trajectory
    which was closer to the goal was reactivated later in an HSE while places further
    away from the goal were reactivated earlier. Altogether my work demonstrated that
    reference memory update triggers several levels of reorganization of the hippocampal
    cognitive map which are not seen in simpler working memory demand s. Moreover,
    hippocampus is likely to be involved in spatial decisions through reactivating
    planned trajectories when reference memory recall is required for such a decision. '
acknowledgement: 'I am very grateful for the opportunity I have had as a graduate
  student to explore and incredibly interesting branch of neuroscience, and for the
  people who made it possible. Firstly, I would like to offer my thanks to my supervisor
  Professor Jozsef Csicsvari for his great support, guidance and patience offered
  over the years. The door to his office was always open whenever I had questions.
  I have learned a lot from him about carefully designing experiments, asking interesting
  questions and how to integrate results into a broader picture. I also express my
  gratitude to the remarkable post- doc , Dr. Joseph O’Neill. He is a gre at scientific
  role model who is always willing to teach , and advice and talk through problems
  with his full attention. Many thanks to my wonderful “office mates” over the years
  and their support and encouragement, Alice Avernhe, Philipp Schönenberger, Desiree
  Dickerson, Karel Blahna, Charlotte Boccara, Igor Gridchyn, Peter Baracskay, Krisztián
  Kovács, Dámaris Rangel, Karola Käfer and Federico Stella. They were the ones in
  the lab for the many useful discussions about science and for making the laboratory
  such a nice and friendly place to work in. A special thank goes to Michael LoBianco
  and Jago Wallenschus for wonderful technical support. I would also like to thank
  Professor Peter Jonas and Professor David M Bannerman for being my qualifying exam
  and thesi s committee members despite their busy schedule. I am also very thankful
  to IST Austria for their support all throughout my PhD. '
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Haibing
  full_name: Xu, Haibing
  id: 310349D0-F248-11E8-B48F-1D18A9856A87
  last_name: Xu
citation:
  ama: Xu H. Reactivation of the hippocampal cognitive map in goal-directed spatial
    tasks. 2017. doi:<a href="https://doi.org/10.15479/AT:ISTA:th_858">10.15479/AT:ISTA:th_858</a>
  apa: Xu, H. (2017). <i>Reactivation of the hippocampal cognitive map in goal-directed
    spatial tasks</i>. Institute of Science and Technology Austria. <a href="https://doi.org/10.15479/AT:ISTA:th_858">https://doi.org/10.15479/AT:ISTA:th_858</a>
  chicago: Xu, Haibing. “Reactivation of the Hippocampal Cognitive Map in Goal-Directed
    Spatial Tasks.” Institute of Science and Technology Austria, 2017. <a href="https://doi.org/10.15479/AT:ISTA:th_858">https://doi.org/10.15479/AT:ISTA:th_858</a>.
  ieee: H. Xu, “Reactivation of the hippocampal cognitive map in goal-directed spatial
    tasks,” Institute of Science and Technology Austria, 2017.
  ista: Xu H. 2017. Reactivation of the hippocampal cognitive map in goal-directed
    spatial tasks. Institute of Science and Technology Austria.
  mla: Xu, Haibing. <i>Reactivation of the Hippocampal Cognitive Map in Goal-Directed
    Spatial Tasks</i>. Institute of Science and Technology Austria, 2017, doi:<a href="https://doi.org/10.15479/AT:ISTA:th_858">10.15479/AT:ISTA:th_858</a>.
  short: H. Xu, Reactivation of the Hippocampal Cognitive Map in Goal-Directed Spatial
    Tasks, Institute of Science and Technology Austria, 2017.
date_created: 2018-12-11T11:48:46Z
date_published: 2017-08-23T00:00:00Z
date_updated: 2023-09-07T12:06:38Z
day: '23'
ddc:
- '571'
degree_awarded: PhD
department:
- _id: JoCs
doi: 10.15479/AT:ISTA:th_858
file:
- access_level: closed
  checksum: f11925fbbce31e495124b6bc4f10573c
  content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
  creator: dernst
  date_created: 2019-04-05T08:59:51Z
  date_updated: 2020-07-14T12:48:12Z
  file_id: '6213'
  file_name: 2017_Xu_Haibing_Thesis_Source.docx
  file_size: 3589490
  relation: source_file
- access_level: open_access
  checksum: ffb10749a537d615fab1ef0937ccb157
  content_type: application/pdf
  creator: dernst
  date_created: 2019-04-05T08:59:51Z
  date_updated: 2020-07-14T12:48:12Z
  file_id: '6214'
  file_name: 2017_Xu_Thesis_IST.pdf
  file_size: 11668613
  relation: main_file
file_date_updated: 2020-07-14T12:48:12Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: '93'
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6811'
pubrep_id: '858'
related_material:
  record:
  - id: '5828'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- first_name: Jozsef L
  full_name: Csicsvari, Jozsef L
  id: 3FA14672-F248-11E8-B48F-1D18A9856A87
  last_name: Csicsvari
  orcid: 0000-0002-5193-4036
title: Reactivation of the hippocampal cognitive map in goal-directed spatial tasks
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '838'
abstract:
- lang: eng
  text: 'In this thesis we discuss the exact security of message authentications codes
    HMAC , NMAC , and PMAC . NMAC is a mode of operation which turns a fixed input-length
    keyed hash function f into a variable input-length function. A practical single-key
    variant of NMAC called HMAC is a very popular and widely deployed message authentication
    code (MAC). PMAC is a block-cipher based mode of operation, which also happens
    to be the most famous fully parallel MAC. NMAC was introduced by Bellare, Canetti
    and Krawczyk Crypto’96, who proved it to be a secure pseudorandom function (PRF),
    and thus also a MAC, under two assumptions. Unfortunately, for many instantiations
    of HMAC one of them has been found to be wrong. To restore the provable guarantees
    for NMAC , Bellare [Crypto’06] showed its security without this assumption. PMAC
    was introduced by Black and Rogaway at Eurocrypt 2002. If instantiated with a
    pseudorandom permutation over n -bit strings, PMAC constitutes a provably secure
    variable input-length PRF. For adversaries making q queries, each of length at
    most ` (in n -bit blocks), and of total length σ ≤ q` , the original paper proves
    an upper bound on the distinguishing advantage of O ( σ 2 / 2 n ), while the currently
    best bound is O ( qσ/ 2 n ). In this work we show that this bound is tight by
    giving an attack with advantage Ω( q 2 `/ 2 n ). In the PMAC construction one
    initially XORs a mask to every message block, where the mask for the i th block
    is computed as τ i := γ i · L , where L is a (secret) random value, and γ i is
    the i -th codeword of the Gray code. Our attack applies more generally to any
    sequence of γ i ’s which contains a large coset of a subgroup of GF (2 n ). As
    for NMAC , our first contribution is a simpler and uniform proof: If f is an ε
    -secure PRF (against q queries) and a δ - non-adaptively secure PRF (against q
    queries), then NMAC f is an ( ε + `qδ )-secure PRF against q queries of length
    at most ` blocks each. We also show that this ε + `qδ bound is basically tight
    by constructing an f for which an attack with advantage `qδ exists. Moreover,
    we analyze the PRF-security of a modification of NMAC called NI by An and Bellare
    that avoids the constant rekeying on multi-block messages in NMAC and allows for
    an information-theoretic analysis. We carry out such an analysis, obtaining a
    tight `q 2 / 2 c bound for this step, improving over the trivial bound of ` 2
    q 2 / 2 c . Finally, we investigate, if the security of PMAC can be further improved
    by using τ i ’s that are k -wise independent, for k &gt; 1 (the original has k
    = 1). We observe that the security of PMAC will not increase in general if k =
    2, and then prove that the security increases to O ( q 2 / 2 n ), if the k = 4.
    Due to simple extension attacks, this is the best bound one can hope for, using
    any distribution on the masks. Whether k = 3 is already sufficient to get this
    level of security is left as an open problem. Keywords: Message authentication
    codes, Pseudorandom functions, HMAC, PMAC. '
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Michal
  full_name: Rybar, Michal
  id: 2B3E3DE8-F248-11E8-B48F-1D18A9856A87
  last_name: Rybar
citation:
  ama: Rybar M. (The exact security of) Message authentication codes. 2017. doi:<a
    href="https://doi.org/10.15479/AT:ISTA:th_828">10.15479/AT:ISTA:th_828</a>
  apa: Rybar, M. (2017). <i>(The exact security of) Message authentication codes</i>.
    Institute of Science and Technology Austria. <a href="https://doi.org/10.15479/AT:ISTA:th_828">https://doi.org/10.15479/AT:ISTA:th_828</a>
  chicago: Rybar, Michal. “(The Exact Security of) Message Authentication Codes.”
    Institute of Science and Technology Austria, 2017. <a href="https://doi.org/10.15479/AT:ISTA:th_828">https://doi.org/10.15479/AT:ISTA:th_828</a>.
  ieee: M. Rybar, “(The exact security of) Message authentication codes,” Institute
    of Science and Technology Austria, 2017.
  ista: Rybar M. 2017. (The exact security of) Message authentication codes. Institute
    of Science and Technology Austria.
  mla: Rybar, Michal. <i>(The Exact Security of) Message Authentication Codes</i>.
    Institute of Science and Technology Austria, 2017, doi:<a href="https://doi.org/10.15479/AT:ISTA:th_828">10.15479/AT:ISTA:th_828</a>.
  short: M. Rybar, (The Exact Security of) Message Authentication Codes, Institute
    of Science and Technology Austria, 2017.
date_created: 2018-12-11T11:48:46Z
date_published: 2017-06-26T00:00:00Z
date_updated: 2023-09-07T12:02:28Z
day: '26'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: KrPi
doi: 10.15479/AT:ISTA:th_828
file:
- access_level: open_access
  checksum: ff8639ec4bded6186f44c7bd3ee26804
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:10:13Z
  date_updated: 2020-07-14T12:48:12Z
  file_id: '4799'
  file_name: IST-2017-828-v1+3_2017_Rybar_thesis.pdf
  file_size: 847400
  relation: main_file
- access_level: closed
  checksum: 3462101745ce8ad199c2d0f75dae4a7e
  content_type: application/zip
  creator: dernst
  date_created: 2019-04-05T08:24:11Z
  date_updated: 2020-07-14T12:48:12Z
  file_id: '6202'
  file_name: 2017_Thesis_Rybar_source.zip
  file_size: 26054879
  relation: source_file
file_date_updated: 2020-07-14T12:48:12Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '86'
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6810'
pubrep_id: '828'
related_material:
  record:
  - id: '2082'
    relation: part_of_dissertation
    status: public
  - id: '6196'
    relation: part_of_dissertation
    status: public
status: public
title: (The exact security of) Message authentication codes
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '839'
abstract:
- lang: eng
  text: 'This thesis describes a brittle fracture simulation method for visual effects
    applications. Building upon a symmetric Galerkin boundary element method, we first
    compute stress intensity factors following the theory of linear elastic fracture
    mechanics. We then use these stress intensities to simulate the motion of a propagating
    crack front at a significantly higher resolution than the overall deformation
    of the breaking object. Allowing for spatial variations of the material''s toughness
    during crack propagation produces visually realistic, highly-detailed fracture
    surfaces. Furthermore, we introduce approximations for stress intensities and
    crack opening displacements, resulting in both practical speed-up and theoretically
    superior runtime complexity compared to previous methods. While we choose a quasi-static
    approach to fracture mechanics, ignoring dynamic deformations, we also couple
    our fracture simulation framework to a standard rigid-body dynamics solver, enabling
    visual effects artists to simulate both large scale motion, as well as fracturing
    due to collision forces in a combined system. As fractures inside of an object
    grow, their geometry must be represented both in the coarse boundary element mesh,
    as well as at the desired fine output resolution. Using a boundary element method,
    we avoid complicated volumetric meshing operations. Instead we describe a simple
    set of surface meshing operations that allow us to progressively add cracks to
    the mesh of an object and still re-use all previously computed entries of the
    linear boundary element system matrix. On the high resolution level, we opt for
    an implicit surface representation. We then describe how to capture fracture surfaces
    during crack propagation, as well as separate the individual fragments resulting
    from the fracture process, based on this implicit representation. We show results
    obtained with our method, either solving the full boundary element system in every
    time step, or alternatively using our fast approximations. These results demonstrate
    that both of these methods perform well in basic test cases and produce realistic
    fracture surfaces. Furthermore we show that our fast approximations substantially
    out-perform the standard approach in more demanding scenarios. Finally, these
    two methods naturally combine, using the full solution while the problem size
    is manageably small and switching to the fast approximations later on. The resulting
    hybrid method gives the user a direct way to choose between speed and accuracy
    of the simulation. '
acknowledgement: "ERC H2020 programme (grant agreement no. 638176)\r\nFirst of all,
  let me thank my committee members, especially my supervisor, Chris\r\nWojtan, for
  supporting me throughout my PhD. Obviously, none of this work would\r\nhave been
  possible without you.\r\nFurthermore, Thank You to all the people who have contributed
  to this work in various\r\nways, in particular Martin Schanz and his group for providing
  and supporting the\r\nHyENA boundary element library, as well as Eder Miguel and
  Morten Bojsen-Hansen\r\nfor (repeatedly) proof reading and providing valuable suggestions
  during the writing\r\nof this thesis.\r\nI would also like to thank Bernd Bickel,
  and all the members – past and present – of his\r\nand Chris’ research groups at
  IST Austria for always providing honest and insightful\r\nfeedback throughout many
  joint group meetings, as well as Christopher Batty, Eitan\r\nGrinspun, and Fang
  Da for many insights into boundary element methods during our\r\ncollaboration.\r\nAs
  only virtual objects have been harmed in the process of creating this work, I would\r\nlike
  to acknowledge the Stanford scanning repository for providing the “Bunny” and\r\n“Armadillo”
  models, the AIM@SHAPE repository for “Pierre’s hand, watertight”, and\r\nS. Gainsbourg
  for the “Column” via Archive3D.net. Sorry for breaking these models\r\nin many different
  ways.\r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: David
  full_name: Hahn, David
  id: 357A6A66-F248-11E8-B48F-1D18A9856A87
  last_name: Hahn
citation:
  ama: Hahn D. Brittle fracture simulation with boundary elements for computer graphics.
    2017. doi:<a href="https://doi.org/10.15479/AT:ISTA:th_855">10.15479/AT:ISTA:th_855</a>
  apa: Hahn, D. (2017). <i>Brittle fracture simulation with boundary elements for
    computer graphics</i>. Institute of Science and Technology Austria. <a href="https://doi.org/10.15479/AT:ISTA:th_855">https://doi.org/10.15479/AT:ISTA:th_855</a>
  chicago: Hahn, David. “Brittle Fracture Simulation with Boundary Elements for Computer
    Graphics.” Institute of Science and Technology Austria, 2017. <a href="https://doi.org/10.15479/AT:ISTA:th_855">https://doi.org/10.15479/AT:ISTA:th_855</a>.
  ieee: D. Hahn, “Brittle fracture simulation with boundary elements for computer
    graphics,” Institute of Science and Technology Austria, 2017.
  ista: Hahn D. 2017. Brittle fracture simulation with boundary elements for computer
    graphics. Institute of Science and Technology Austria.
  mla: Hahn, David. <i>Brittle Fracture Simulation with Boundary Elements for Computer
    Graphics</i>. Institute of Science and Technology Austria, 2017, doi:<a href="https://doi.org/10.15479/AT:ISTA:th_855">10.15479/AT:ISTA:th_855</a>.
  short: D. Hahn, Brittle Fracture Simulation with Boundary Elements for Computer
    Graphics, Institute of Science and Technology Austria, 2017.
date_created: 2018-12-11T11:48:47Z
date_published: 2017-08-14T00:00:00Z
date_updated: 2024-02-21T13:48:02Z
day: '14'
ddc:
- '004'
- '005'
- '006'
- '531'
- '621'
degree_awarded: PhD
department:
- _id: ChWo
doi: 10.15479/AT:ISTA:th_855
ec_funded: 1
file:
- access_level: open_access
  checksum: 6c1ae8c90bfaba5e089417fefbc4a272
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:14:46Z
  date_updated: 2020-07-14T12:48:13Z
  file_id: '5100'
  file_name: IST-2017-855-v1+1_thesis_online_pdfA.pdf
  file_size: 14596191
  relation: main_file
- access_level: closed
  checksum: 421672f68d563b029869c5cf1713f919
  content_type: application/zip
  creator: dernst
  date_created: 2019-04-05T08:40:30Z
  date_updated: 2020-07-14T12:48:13Z
  file_id: '6207'
  file_name: 2017_thesis_Hahn_source.zip
  file_size: 15060566
  relation: source_file
file_date_updated: 2020-07-14T12:48:13Z
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-sa/4.0/
month: '08'
oa: 1
oa_version: Published Version
page: '124'
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '638176'
  name: Efficient Simulation of Natural Phenomena at Extremely Large Scales
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6809'
pubrep_id: '855'
related_material:
  record:
  - id: '1362'
    relation: part_of_dissertation
    status: public
  - id: '1633'
    relation: part_of_dissertation
    status: public
  - id: '5568'
    relation: popular_science
    status: public
status: public
supervisor:
- first_name: Christopher J
  full_name: Wojtan, Christopher J
  id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
  last_name: Wojtan
  orcid: 0000-0001-6646-5546
title: Brittle fracture simulation with boundary elements for computer graphics
tmp:
  image: /images/cc_by_sa.png
  legal_code_url: https://creativecommons.org/licenses/by-sa/4.0/legalcode
  name: Creative Commons Attribution-ShareAlike 4.0 International Public License (CC
    BY-SA 4.0)
  short: CC BY-SA (4.0)
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '84'
abstract:
- lang: eng
  text: The advent of high-throughput technologies and the concurrent advances in
    information sciences have led to a data revolution in biology. This revolution
    is most significant in molecular biology, with an increase in the number and scale
    of the “omics” projects over the last decade. Genomics projects, for example,
    have produced impressive advances in our knowledge of the information concealed
    into genomes, from the many genes that encode for the proteins that are responsible
    for most if not all cellular functions, to the noncoding regions that are now
    known to provide regulatory functions. Proteomics initiatives help to decipher
    the role of post-translation modifications on the protein structures and provide
    maps of protein-protein interactions, while functional genomics is the field that
    attempts to make use of the data produced by these projects to understand protein
    functions. The biggest challenge today is to assimilate the wealth of information
    provided by these initiatives into a conceptual framework that will help us decipher
    life. For example, the current views of the relationship between protein structure
    and function remain fragmented. We know of their sequences, more and more about
    their structures, we have information on their biological activities, but we have
    difficulties connecting this dotted line into an informed whole. We lack the experimental
    and computational tools for directly studying protein structure, function, and
    dynamics at the molecular and supra-molecular levels. In this chapter, we review
    some of the current developments in building the computational tools that are
    needed, focusing on the role that geometry and topology play in these efforts.
    One of our goals is to raise the general awareness about the importance of geometric
    methods in elucidating the mysterious foundations of our very existence. Another
    goal is the broadening of what we consider a geometric algorithm. There is plenty
    of valuable no-man’s-land between combinatorial and numerical algorithms, and
    it seems opportune to explore this land with a computational-geometric frame of
    mind.
article_processing_charge: No
author:
- first_name: Herbert
  full_name: Edelsbrunner, Herbert
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
- first_name: Patrice
  full_name: Koehl, Patrice
  last_name: Koehl
citation:
  ama: 'Edelsbrunner H, Koehl P. Computational topology for structural molecular biology.
    In: Toth C, O’Rourke J, Goodman J, eds. <i>Handbook of Discrete and Computational
    Geometry, Third Edition</i>. Handbook of Discrete and Computational Geometry.
    Taylor &#38; Francis; 2017:1709-1735. doi:<a href="https://doi.org/10.1201/9781315119601">10.1201/9781315119601</a>'
  apa: Edelsbrunner, H., &#38; Koehl, P. (2017). Computational topology for structural
    molecular biology. In C. Toth, J. O’Rourke, &#38; J. Goodman (Eds.), <i>Handbook
    of Discrete and Computational Geometry, Third Edition</i> (pp. 1709–1735). Taylor
    &#38; Francis. <a href="https://doi.org/10.1201/9781315119601">https://doi.org/10.1201/9781315119601</a>
  chicago: Edelsbrunner, Herbert, and Patrice Koehl. “Computational Topology for Structural
    Molecular Biology.” In <i>Handbook of Discrete and Computational Geometry, Third
    Edition</i>, edited by Csaba Toth, Joseph O’Rourke, and Jacob Goodman, 1709–35.
    Handbook of Discrete and Computational Geometry. Taylor &#38; Francis, 2017. <a
    href="https://doi.org/10.1201/9781315119601">https://doi.org/10.1201/9781315119601</a>.
  ieee: H. Edelsbrunner and P. Koehl, “Computational topology for structural molecular
    biology,” in <i>Handbook of Discrete and Computational Geometry, Third Edition</i>,
    C. Toth, J. O’Rourke, and J. Goodman, Eds. Taylor &#38; Francis, 2017, pp. 1709–1735.
  ista: 'Edelsbrunner H, Koehl P. 2017.Computational topology for structural molecular
    biology. In: Handbook of Discrete and Computational Geometry, Third Edition. ,
    1709–1735.'
  mla: Edelsbrunner, Herbert, and Patrice Koehl. “Computational Topology for Structural
    Molecular Biology.” <i>Handbook of Discrete and Computational Geometry, Third
    Edition</i>, edited by Csaba Toth et al., Taylor &#38; Francis, 2017, pp. 1709–35,
    doi:<a href="https://doi.org/10.1201/9781315119601">10.1201/9781315119601</a>.
  short: H. Edelsbrunner, P. Koehl, in:, C. Toth, J. O’Rourke, J. Goodman (Eds.),
    Handbook of Discrete and Computational Geometry, Third Edition, Taylor &#38; Francis,
    2017, pp. 1709–1735.
date_created: 2018-12-11T11:44:32Z
date_published: 2017-11-09T00:00:00Z
date_updated: 2023-10-16T11:15:22Z
day: '09'
department:
- _id: HeEd
doi: 10.1201/9781315119601
editor:
- first_name: Csaba
  full_name: Toth, Csaba
  last_name: Toth
- first_name: Joseph
  full_name: O'Rourke, Joseph
  last_name: O'Rourke
- first_name: Jacob
  full_name: Goodman, Jacob
  last_name: Goodman
language:
- iso: eng
month: '11'
oa_version: None
page: 1709 - 1735
publication: Handbook of Discrete and Computational Geometry, Third Edition
publication_identifier:
  eisbn:
  - '9781498711425'
publication_status: published
publisher: Taylor & Francis
publist_id: '7970'
quality_controlled: '1'
scopus_import: '1'
series_title: Handbook of Discrete and Computational Geometry
status: public
title: Computational topology for structural molecular biology
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '840'
abstract:
- lang: eng
  text: Heavy holes confined in quantum dots are predicted to be promising candidates
    for the realization of spin qubits with long coherence times. Here we focus on
    such heavy-hole states confined in germanium hut wires. By tuning the growth density
    of the latter we can realize a T-like structure between two neighboring wires.
    Such a structure allows the realization of a charge sensor, which is electrostatically
    and tunnel coupled to a quantum dot, with charge-transfer signals as high as 0.3
    e. By integrating the T-like structure into a radiofrequency reflectometry setup,
    single-shot measurements allowing the extraction of hole tunneling times are performed.
    The extracted tunneling times of less than 10 μs are attributed to the small effective
    mass of Ge heavy-hole states and pave the way toward projective spin readout measurements.
acknowledged_ssus:
- _id: M-Shop
article_processing_charge: No
author:
- first_name: Lada
  full_name: Vukusic, Lada
  id: 31E9F056-F248-11E8-B48F-1D18A9856A87
  last_name: Vukusic
  orcid: 0000-0003-2424-8636
- first_name: Josip
  full_name: Kukucka, Josip
  id: 3F5D8856-F248-11E8-B48F-1D18A9856A87
  last_name: Kukucka
- first_name: Hannes
  full_name: Watzinger, Hannes
  id: 35DF8E50-F248-11E8-B48F-1D18A9856A87
  last_name: Watzinger
- first_name: Georgios
  full_name: Katsaros, Georgios
  id: 38DB5788-F248-11E8-B48F-1D18A9856A87
  last_name: Katsaros
  orcid: 0000-0001-8342-202X
citation:
  ama: Vukušić L, Kukucka J, Watzinger H, Katsaros G. Fast hole tunneling times in
    germanium hut wires probed by single-shot reflectometry. <i>Nano Letters</i>.
    2017;17(9):5706-5710. doi:<a href="https://doi.org/10.1021/acs.nanolett.7b02627">10.1021/acs.nanolett.7b02627</a>
  apa: Vukušić, L., Kukucka, J., Watzinger, H., &#38; Katsaros, G. (2017). Fast hole
    tunneling times in germanium hut wires probed by single-shot reflectometry. <i>Nano
    Letters</i>. American Chemical Society. <a href="https://doi.org/10.1021/acs.nanolett.7b02627">https://doi.org/10.1021/acs.nanolett.7b02627</a>
  chicago: Vukušić, Lada, Josip Kukucka, Hannes Watzinger, and Georgios Katsaros.
    “Fast Hole Tunneling Times in Germanium Hut Wires Probed by Single-Shot Reflectometry.”
    <i>Nano Letters</i>. American Chemical Society, 2017. <a href="https://doi.org/10.1021/acs.nanolett.7b02627">https://doi.org/10.1021/acs.nanolett.7b02627</a>.
  ieee: L. Vukušić, J. Kukucka, H. Watzinger, and G. Katsaros, “Fast hole tunneling
    times in germanium hut wires probed by single-shot reflectometry,” <i>Nano Letters</i>,
    vol. 17, no. 9. American Chemical Society, pp. 5706–5710, 2017.
  ista: Vukušić L, Kukucka J, Watzinger H, Katsaros G. 2017. Fast hole tunneling times
    in germanium hut wires probed by single-shot reflectometry. Nano Letters. 17(9),
    5706–5710.
  mla: Vukušić, Lada, et al. “Fast Hole Tunneling Times in Germanium Hut Wires Probed
    by Single-Shot Reflectometry.” <i>Nano Letters</i>, vol. 17, no. 9, American Chemical
    Society, 2017, pp. 5706–10, doi:<a href="https://doi.org/10.1021/acs.nanolett.7b02627">10.1021/acs.nanolett.7b02627</a>.
  short: L. Vukušić, J. Kukucka, H. Watzinger, G. Katsaros, Nano Letters 17 (2017)
    5706–5710.
date_created: 2018-12-11T11:48:47Z
date_published: 2017-08-10T00:00:00Z
date_updated: 2023-09-26T15:50:22Z
day: '10'
ddc:
- '539'
department:
- _id: GeKa
doi: 10.1021/acs.nanolett.7b02627
ec_funded: 1
external_id:
  isi:
  - '000411043500078'
file:
- access_level: open_access
  checksum: 761371a0129b2aa442424b9561450ece
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:12:33Z
  date_updated: 2020-07-14T12:48:13Z
  file_id: '4951'
  file_name: IST-2017-865-v1+1_acs.nanolett.7b02627.pdf
  file_size: 2449546
  relation: main_file
file_date_updated: 2020-07-14T12:48:13Z
has_accepted_license: '1'
intvolume: '        17'
isi: 1
issue: '9'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 5706 - 5710
project:
- _id: 25517E86-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '335497'
  name: Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires
publication: Nano Letters
publication_identifier:
  issn:
  - '15306984'
publication_status: published
publisher: American Chemical Society
publist_id: '6808'
pubrep_id: '865'
quality_controlled: '1'
related_material:
  record:
  - id: '7977'
    relation: popular_science
  - id: '69'
    relation: dissertation_contains
    status: public
  - id: '7996'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Fast hole tunneling times in germanium hut wires probed by single-shot reflectometry
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 17
year: '2017'
...
---
_id: '2016'
abstract:
- lang: eng
  text: The Ising model is one of the simplest and most famous models of interacting
    systems. It was originally proposed to model ferromagnetic interactions in statistical
    physics and is now widely used to model spatial processes in many areas such as
    ecology, sociology, and genetics, usually without testing its goodness-of-fit.
    Here, we propose an exact goodness-of-fit test for the finite-lattice Ising model.
    The theory of Markov bases has been developed in algebraic statistics for exact
    goodness-of-fit testing using a Monte Carlo approach. However, this beautiful
    theory has fallen short of its promise for applications, because finding a Markov
    basis is usually computationally intractable. We develop a Monte Carlo method
    for exact goodness-of-fit testing for the Ising model which avoids computing a
    Markov basis and also leads to a better connectivity of the Markov chain and hence
    to a faster convergence. We show how this method can be applied to analyze the
    spatial organization of receptors on the cell membrane.
article_processing_charge: No
arxiv: 1
author:
- first_name: Abraham
  full_name: Martin Del Campo Sanchez, Abraham
  last_name: Martin Del Campo Sanchez
- first_name: Sarah A
  full_name: Cepeda Humerez, Sarah A
  id: 3DEE19A4-F248-11E8-B48F-1D18A9856A87
  last_name: Cepeda Humerez
- first_name: Caroline
  full_name: Uhler, Caroline
  id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
  last_name: Uhler
  orcid: 0000-0002-7008-0216
citation:
  ama: Martin Del Campo Sanchez A, Cepeda Humerez SA, Uhler C. Exact goodness-of-fit
    testing for the Ising model. <i>Scandinavian Journal of Statistics</i>. 2017;44(2):285-306.
    doi:<a href="https://doi.org/10.1111/sjos.12251">10.1111/sjos.12251</a>
  apa: Martin Del Campo Sanchez, A., Cepeda Humerez, S. A., &#38; Uhler, C. (2017).
    Exact goodness-of-fit testing for the Ising model. <i>Scandinavian Journal of
    Statistics</i>. Wiley-Blackwell. <a href="https://doi.org/10.1111/sjos.12251">https://doi.org/10.1111/sjos.12251</a>
  chicago: Martin Del Campo Sanchez, Abraham, Sarah A Cepeda Humerez, and Caroline
    Uhler. “Exact Goodness-of-Fit Testing for the Ising Model.” <i>Scandinavian Journal
    of Statistics</i>. Wiley-Blackwell, 2017. <a href="https://doi.org/10.1111/sjos.12251">https://doi.org/10.1111/sjos.12251</a>.
  ieee: A. Martin Del Campo Sanchez, S. A. Cepeda Humerez, and C. Uhler, “Exact goodness-of-fit
    testing for the Ising model,” <i>Scandinavian Journal of Statistics</i>, vol.
    44, no. 2. Wiley-Blackwell, pp. 285–306, 2017.
  ista: Martin Del Campo Sanchez A, Cepeda Humerez SA, Uhler C. 2017. Exact goodness-of-fit
    testing for the Ising model. Scandinavian Journal of Statistics. 44(2), 285–306.
  mla: Martin Del Campo Sanchez, Abraham, et al. “Exact Goodness-of-Fit Testing for
    the Ising Model.” <i>Scandinavian Journal of Statistics</i>, vol. 44, no. 2, Wiley-Blackwell,
    2017, pp. 285–306, doi:<a href="https://doi.org/10.1111/sjos.12251">10.1111/sjos.12251</a>.
  short: A. Martin Del Campo Sanchez, S.A. Cepeda Humerez, C. Uhler, Scandinavian
    Journal of Statistics 44 (2017) 285–306.
date_created: 2018-12-11T11:55:13Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2023-09-19T15:13:27Z
day: '01'
department:
- _id: GaTk
doi: 10.1111/sjos.12251
external_id:
  arxiv:
  - '1410.1242'
  isi:
  - '000400985000001'
intvolume: '        44'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1410.1242
month: '06'
oa: 1
oa_version: Preprint
page: 285 - 306
publication: Scandinavian Journal of Statistics
publication_identifier:
  issn:
  - '03036898'
publication_status: published
publisher: Wiley-Blackwell
publist_id: '5060'
quality_controlled: '1'
related_material:
  record:
  - id: '6473'
    relation: part_of_dissertation
    status: public
scopus_import: '1'
status: public
title: Exact goodness-of-fit testing for the Ising model
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 44
year: '2017'
...
