---
_id: '193'
abstract:
- lang: eng
  text: 'We show attacks on five data-independent memory-hard functions (iMHF) that
    were submitted to the password hashing competition (PHC). Informally, an MHF is
    a function which cannot be evaluated on dedicated hardware, like ASICs, at significantly
    lower hardware and/or energy cost than evaluating a single instance on a standard
    single-core architecture. Data-independent means the memory access pattern of
    the function is independent of the input; this makes iMHFs harder to construct
    than data-dependent ones, but the latter can be attacked by various side-channel
    attacks. Following [Alwen-Blocki''16], we capture the evaluation of an iMHF as
    a directed acyclic graph (DAG). The cumulative parallel pebbling complexity of
    this DAG is a measure for the hardware cost of evaluating the iMHF on an ASIC.
    Ideally, one would like the complexity of a DAG underlying an iMHF to be as close
    to quadratic in the number of nodes of the graph as possible. Instead, we show
    that (the DAGs underlying) the following iMHFs are far from this bound: Rig.v2,
    TwoCats and Gambit each having an exponent no more than 1.75. Moreover, we show
    that the complexity of the iMHF modes of the PHC finalists Pomelo and Lyra2 have
    exponents at most 1.83 and 1.67 respectively. To show this we investigate a combinatorial
    property of each underlying DAG (called its depth-robustness. By establishing
    upper bounds on this property we are then able to apply the general technique
    of [Alwen-Block''16] for analyzing the hardware costs of an iMHF.'
acknowledgement: Leonid Reyzin was supported in part by IST Austria and by US NSF
  grants 1012910, 1012798, and 1422965; this research was performed while he was visiting
  IST Austria.
article_processing_charge: No
author:
- first_name: Joel F
  full_name: Alwen, Joel F
  id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
  last_name: Alwen
- first_name: Peter
  full_name: Gazi, Peter
  last_name: Gazi
- first_name: Chethan
  full_name: Kamath Hosdurg, Chethan
  id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
  last_name: Kamath Hosdurg
- first_name: Karen
  full_name: Klein, Karen
  id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
  last_name: Klein
- first_name: Georg F
  full_name: Osang, Georg F
  id: 464B40D6-F248-11E8-B48F-1D18A9856A87
  last_name: Osang
  orcid: 0000-0002-8882-5116
- first_name: Krzysztof Z
  full_name: Pietrzak, Krzysztof Z
  id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
  last_name: Pietrzak
  orcid: 0000-0002-9139-1654
- first_name: Lenoid
  full_name: Reyzin, Lenoid
  last_name: Reyzin
- first_name: Michal
  full_name: Rolinek, Michal
  id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
  last_name: Rolinek
- first_name: Michal
  full_name: Rybar, Michal
  id: 2B3E3DE8-F248-11E8-B48F-1D18A9856A87
  last_name: Rybar
citation:
  ama: 'Alwen JF, Gazi P, Kamath Hosdurg C, et al. On the memory hardness of data
    independent password hashing functions. In: <i>Proceedings of the 2018 on Asia
    Conference on Computer and Communication Security</i>. ACM; 2018:51-65. doi:<a
    href="https://doi.org/10.1145/3196494.3196534">10.1145/3196494.3196534</a>'
  apa: 'Alwen, J. F., Gazi, P., Kamath Hosdurg, C., Klein, K., Osang, G. F., Pietrzak,
    K. Z., … Rybar, M. (2018). On the memory hardness of data independent password
    hashing functions. In <i>Proceedings of the 2018 on Asia Conference on Computer
    and Communication Security</i> (pp. 51–65). Incheon, Republic of Korea: ACM. <a
    href="https://doi.org/10.1145/3196494.3196534">https://doi.org/10.1145/3196494.3196534</a>'
  chicago: Alwen, Joel F, Peter Gazi, Chethan Kamath Hosdurg, Karen Klein, Georg F
    Osang, Krzysztof Z Pietrzak, Lenoid Reyzin, Michal Rolinek, and Michal Rybar.
    “On the Memory Hardness of Data Independent Password Hashing Functions.” In <i>Proceedings
    of the 2018 on Asia Conference on Computer and Communication Security</i>, 51–65.
    ACM, 2018. <a href="https://doi.org/10.1145/3196494.3196534">https://doi.org/10.1145/3196494.3196534</a>.
  ieee: J. F. Alwen <i>et al.</i>, “On the memory hardness of data independent password
    hashing functions,” in <i>Proceedings of the 2018 on Asia Conference on Computer
    and Communication Security</i>, Incheon, Republic of Korea, 2018, pp. 51–65.
  ista: 'Alwen JF, Gazi P, Kamath Hosdurg C, Klein K, Osang GF, Pietrzak KZ, Reyzin
    L, Rolinek M, Rybar M. 2018. On the memory hardness of data independent password
    hashing functions. Proceedings of the 2018 on Asia Conference on Computer and
    Communication Security. ASIACCS: Asia Conference on Computer and Communications
    Security , 51–65.'
  mla: Alwen, Joel F., et al. “On the Memory Hardness of Data Independent Password
    Hashing Functions.” <i>Proceedings of the 2018 on Asia Conference on Computer
    and Communication Security</i>, ACM, 2018, pp. 51–65, doi:<a href="https://doi.org/10.1145/3196494.3196534">10.1145/3196494.3196534</a>.
  short: J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak,
    L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference
    on Computer and Communication Security, ACM, 2018, pp. 51–65.
conference:
  end_date: 2018-06-08
  location: Incheon, Republic of Korea
  name: 'ASIACCS: Asia Conference on Computer and Communications Security '
  start_date: 2018-06-04
date_created: 2018-12-11T11:45:07Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2023-09-13T09:13:12Z
day: '01'
department:
- _id: KrPi
- _id: HeEd
- _id: VlKo
doi: 10.1145/3196494.3196534
ec_funded: 1
external_id:
  isi:
  - '000516620100005'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2016/783
month: '06'
oa: 1
oa_version: Submitted Version
page: 51 - 65
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '616160'
  name: 'Discrete Optimization in Computer Vision: Theory and Practice'
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '682815'
  name: Teaching Old Crypto New Tricks
publication: Proceedings of the 2018 on Asia Conference on Computer and Communication
  Security
publication_status: published
publisher: ACM
publist_id: '7723'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the memory hardness of data independent password hashing functions
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '194'
abstract:
- lang: eng
  text: Ants are emerging model systems to study cellular signaling because distinct
    castes possess different physiologic phenotypes within the same colony. Here we
    studied the functionality of inotocin signaling, an insect ortholog of mammalian
    oxytocin (OT), which was recently discovered in ants. In Lasius ants, we determined
    that specialization within the colony, seasonal factors, and physiologic conditions
    down-regulated the expression of the OT-like signaling system. Given this natural
    variation, we interrogated its function using RNAi knockdowns. Next-generation
    RNA sequencing of OT-like precursor knock-down ants highlighted its role in the
    regulation of genes involved in metabolism. Knock-down ants exhibited higher walking
    activity and increased self-grooming in the brood chamber. We propose that OT-like
    signaling in ants is important for regulating metabolic processes and locomotion.
article_processing_charge: No
article_type: original
author:
- first_name: Zita
  full_name: Liutkeviciute, Zita
  last_name: Liutkeviciute
- first_name: Esther
  full_name: Gil Mansilla, Esther
  last_name: Gil Mansilla
- first_name: Thomas
  full_name: Eder, Thomas
  last_name: Eder
- first_name: Barbara E
  full_name: Casillas Perez, Barbara E
  id: 351ED2AA-F248-11E8-B48F-1D18A9856A87
  last_name: Casillas Perez
- first_name: Maria
  full_name: Giulia Di Giglio, Maria
  last_name: Giulia Di Giglio
- first_name: Edin
  full_name: Muratspahić, Edin
  last_name: Muratspahić
- first_name: Florian
  full_name: Grebien, Florian
  last_name: Grebien
- first_name: Thomas
  full_name: Rattei, Thomas
  last_name: Rattei
- first_name: Markus
  full_name: Muttenthaler, Markus
  last_name: Muttenthaler
- first_name: Sylvia
  full_name: Cremer, Sylvia
  id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
  last_name: Cremer
  orcid: 0000-0002-2193-3868
- first_name: Christian
  full_name: Gruber, Christian
  last_name: Gruber
citation:
  ama: Liutkeviciute Z, Gil Mansilla E, Eder T, et al. Oxytocin-like signaling in
    ants influences metabolic gene expression and locomotor activity. <i>The FASEB
    Journal</i>. 2018;32(12):6808-6821. doi:<a href="https://doi.org/10.1096/fj.201800443">10.1096/fj.201800443</a>
  apa: Liutkeviciute, Z., Gil Mansilla, E., Eder, T., Casillas Perez, B. E., Giulia
    Di Giglio, M., Muratspahić, E., … Gruber, C. (2018). Oxytocin-like signaling in
    ants influences metabolic gene expression and locomotor activity. <i>The FASEB
    Journal</i>. FASEB. <a href="https://doi.org/10.1096/fj.201800443">https://doi.org/10.1096/fj.201800443</a>
  chicago: Liutkeviciute, Zita, Esther Gil Mansilla, Thomas Eder, Barbara E Casillas
    Perez, Maria Giulia Di Giglio, Edin Muratspahić, Florian Grebien, et al. “Oxytocin-like
    Signaling in Ants Influences Metabolic Gene Expression and Locomotor Activity.”
    <i>The FASEB Journal</i>. FASEB, 2018. <a href="https://doi.org/10.1096/fj.201800443">https://doi.org/10.1096/fj.201800443</a>.
  ieee: Z. Liutkeviciute <i>et al.</i>, “Oxytocin-like signaling in ants influences
    metabolic gene expression and locomotor activity,” <i>The FASEB Journal</i>, vol.
    32, no. 12. FASEB, pp. 6808–6821, 2018.
  ista: Liutkeviciute Z, Gil Mansilla E, Eder T, Casillas Perez BE, Giulia Di Giglio
    M, Muratspahić E, Grebien F, Rattei T, Muttenthaler M, Cremer S, Gruber C. 2018.
    Oxytocin-like signaling in ants influences metabolic gene expression and locomotor
    activity. The FASEB Journal. 32(12), 6808–6821.
  mla: Liutkeviciute, Zita, et al. “Oxytocin-like Signaling in Ants Influences Metabolic
    Gene Expression and Locomotor Activity.” <i>The FASEB Journal</i>, vol. 32, no.
    12, FASEB, 2018, pp. 6808–21, doi:<a href="https://doi.org/10.1096/fj.201800443">10.1096/fj.201800443</a>.
  short: Z. Liutkeviciute, E. Gil Mansilla, T. Eder, B.E. Casillas Perez, M. Giulia
    Di Giglio, E. Muratspahić, F. Grebien, T. Rattei, M. Muttenthaler, S. Cremer,
    C. Gruber, The FASEB Journal 32 (2018) 6808–6821.
date_created: 2018-12-11T11:45:08Z
date_published: 2018-11-29T00:00:00Z
date_updated: 2023-09-13T09:37:32Z
day: '29'
department:
- _id: SyCr
doi: 10.1096/fj.201800443
external_id:
  isi:
  - '000449359700035'
  pmid:
  - '29939785'
intvolume: '        32'
isi: 1
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: ' https://doi.org/10.1096/fj.201800443'
month: '11'
oa: 1
oa_version: Published Version
page: 6808-6821
pmid: 1
project:
- _id: 25E3D34E-B435-11E9-9278-68D0E5697425
  name: Individual function and social role of oxytocin-like neuropeptides in ants
publication: The FASEB Journal
publication_identifier:
  issn:
  - '08926638'
publication_status: published
publisher: FASEB
publist_id: '7721'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Oxytocin-like signaling in ants influences metabolic gene expression and locomotor
  activity
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 32
year: '2018'
...
---
_id: '195'
abstract:
- lang: eng
  text: We demonstrate that identical impurities immersed in a two-dimensional many-particle
    bath can be viewed as flux-tube-charged-particle composites described by fractional
    statistics. In particular, we find that the bath manifests itself as an external
    magnetic flux tube with respect to the impurities, and hence the time-reversal
    symmetry is broken for the effective Hamiltonian describing the impurities. The
    emerging flux tube acts as a statistical gauge field after a certain critical
    coupling. This critical coupling corresponds to the intersection point between
    the quasiparticle state and the phonon wing, where the angular momentum is transferred
    from the impurity to the bath. This amounts to a novel configuration with emerging
    anyons. The proposed setup paves the way to realizing anyons using electrons interacting
    with superfluid helium or lattice phonons, as well as using atomic impurities
    in ultracold gases.
article_number: '045402'
article_processing_charge: No
arxiv: 1
author:
- first_name: Enderalp
  full_name: Yakaboylu, Enderalp
  id: 38CB71F6-F248-11E8-B48F-1D18A9856A87
  last_name: Yakaboylu
  orcid: 0000-0001-5973-0874
- first_name: Mikhail
  full_name: Lemeshko, Mikhail
  id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
  last_name: Lemeshko
  orcid: 0000-0002-6990-7802
citation:
  ama: Yakaboylu E, Lemeshko M. Anyonic statistics of quantum impurities in two dimensions.
    <i>Physical Review B - Condensed Matter and Materials Physics</i>. 2018;98(4).
    doi:<a href="https://doi.org/10.1103/PhysRevB.98.045402">10.1103/PhysRevB.98.045402</a>
  apa: Yakaboylu, E., &#38; Lemeshko, M. (2018). Anyonic statistics of quantum impurities
    in two dimensions. <i>Physical Review B - Condensed Matter and Materials Physics</i>.
    American Physical Society. <a href="https://doi.org/10.1103/PhysRevB.98.045402">https://doi.org/10.1103/PhysRevB.98.045402</a>
  chicago: Yakaboylu, Enderalp, and Mikhail Lemeshko. “Anyonic Statistics of Quantum
    Impurities in Two Dimensions.” <i>Physical Review B - Condensed Matter and Materials
    Physics</i>. American Physical Society, 2018. <a href="https://doi.org/10.1103/PhysRevB.98.045402">https://doi.org/10.1103/PhysRevB.98.045402</a>.
  ieee: E. Yakaboylu and M. Lemeshko, “Anyonic statistics of quantum impurities in
    two dimensions,” <i>Physical Review B - Condensed Matter and Materials Physics</i>,
    vol. 98, no. 4. American Physical Society, 2018.
  ista: Yakaboylu E, Lemeshko M. 2018. Anyonic statistics of quantum impurities in
    two dimensions. Physical Review B - Condensed Matter and Materials Physics. 98(4),
    045402.
  mla: Yakaboylu, Enderalp, and Mikhail Lemeshko. “Anyonic Statistics of Quantum Impurities
    in Two Dimensions.” <i>Physical Review B - Condensed Matter and Materials Physics</i>,
    vol. 98, no. 4, 045402, American Physical Society, 2018, doi:<a href="https://doi.org/10.1103/PhysRevB.98.045402">10.1103/PhysRevB.98.045402</a>.
  short: E. Yakaboylu, M. Lemeshko, Physical Review B - Condensed Matter and Materials
    Physics 98 (2018).
date_created: 2018-12-11T11:45:08Z
date_published: 2018-07-15T00:00:00Z
date_updated: 2023-09-08T13:22:57Z
day: '15'
department:
- _id: MiLe
doi: 10.1103/PhysRevB.98.045402
ec_funded: 1
external_id:
  arxiv:
  - '1712.00308'
  isi:
  - '000436939100007'
intvolume: '        98'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1712.00308
month: '07'
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
- _id: 26031614-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P29902
  name: Quantum rotations in the presence of a many-body environment
publication: Physical Review B - Condensed Matter and Materials Physics
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Anyonic statistics of quantum impurities in two dimensions
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 98
year: '2018'
...
---
_id: '197'
abstract:
- lang: eng
  text: Modern computer vision systems heavily rely on statistical machine learning
    models, which typically require large amounts of labeled data to be learned reliably.
    Moreover, very recently computer vision research widely adopted techniques for
    representation learning, which further increase the demand for labeled data. However,
    for many important practical problems there is relatively small amount of labeled
    data available, so it is problematic to leverage full potential of the representation
    learning methods. One way to overcome this obstacle is to invest substantial resources
    into producing large labelled datasets. Unfortunately, this can be prohibitively
    expensive in practice. In this thesis we focus on the alternative way of tackling
    the aforementioned issue. We concentrate on methods, which make use of weakly-labeled
    or even unlabeled data. Specifically, the first half of the thesis is dedicated
    to the semantic image segmentation task. We develop a technique, which achieves
    competitive segmentation performance and only requires annotations in a form of
    global image-level labels instead of dense segmentation masks. Subsequently, we
    present a new methodology, which further improves segmentation performance by
    leveraging tiny additional feedback from a human annotator. By using our methods
    practitioners can greatly reduce the amount of data annotation effort, which is
    required to learn modern image segmentation models. In the second half of the
    thesis we focus on methods for learning from unlabeled visual data. We study a
    family of autoregressive models for modeling structure of natural images and discuss
    potential applications of these models. Moreover, we conduct in-depth study of
    one of these applications, where we develop the state-of-the-art model for the
    probabilistic image colorization task.
acknowledgement: I also gratefully acknowledge the support of NVIDIA Corporation with
  the donation of the GPUs used for this research.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Alexander
  full_name: Kolesnikov, Alexander
  id: 2D157DB6-F248-11E8-B48F-1D18A9856A87
  last_name: Kolesnikov
citation:
  ama: Kolesnikov A. Weakly-Supervised Segmentation and Unsupervised Modeling of Natural
    Images. 2018. doi:<a href="https://doi.org/10.15479/AT:ISTA:th_1021">10.15479/AT:ISTA:th_1021</a>
  apa: Kolesnikov, A. (2018). <i>Weakly-Supervised Segmentation and Unsupervised Modeling
    of Natural Images</i>. Institute of Science and Technology Austria. <a href="https://doi.org/10.15479/AT:ISTA:th_1021">https://doi.org/10.15479/AT:ISTA:th_1021</a>
  chicago: Kolesnikov, Alexander. “Weakly-Supervised Segmentation and Unsupervised
    Modeling of Natural Images.” Institute of Science and Technology Austria, 2018.
    <a href="https://doi.org/10.15479/AT:ISTA:th_1021">https://doi.org/10.15479/AT:ISTA:th_1021</a>.
  ieee: A. Kolesnikov, “Weakly-Supervised Segmentation and Unsupervised Modeling of
    Natural Images,” Institute of Science and Technology Austria, 2018.
  ista: Kolesnikov A. 2018. Weakly-Supervised Segmentation and Unsupervised Modeling
    of Natural Images. Institute of Science and Technology Austria.
  mla: Kolesnikov, Alexander. <i>Weakly-Supervised Segmentation and Unsupervised Modeling
    of Natural Images</i>. Institute of Science and Technology Austria, 2018, doi:<a
    href="https://doi.org/10.15479/AT:ISTA:th_1021">10.15479/AT:ISTA:th_1021</a>.
  short: A. Kolesnikov, Weakly-Supervised Segmentation and Unsupervised Modeling of
    Natural Images, Institute of Science and Technology Austria, 2018.
date_created: 2018-12-11T11:45:09Z
date_published: 2018-05-25T00:00:00Z
date_updated: 2023-09-07T12:51:46Z
day: '25'
ddc:
- '004'
degree_awarded: PhD
department:
- _id: ChLa
doi: 10.15479/AT:ISTA:th_1021
ec_funded: 1
file:
- access_level: open_access
  checksum: bc678e02468d8ebc39dc7267dfb0a1c4
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:14:57Z
  date_updated: 2020-07-14T12:45:22Z
  file_id: '5113'
  file_name: IST-2018-1021-v1+1_thesis-unsigned-pdfa.pdf
  file_size: 12918758
  relation: main_file
- access_level: closed
  checksum: bc66973b086da5a043f1162dcfb1fde4
  content_type: application/zip
  creator: dernst
  date_created: 2019-04-05T09:34:49Z
  date_updated: 2020-07-14T12:45:22Z
  file_id: '6225'
  file_name: 2018_Thesis_Kolesnikov_source.zip
  file_size: 55973760
  relation: source_file
file_date_updated: 2020-07-14T12:45:22Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '113'
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '308036'
  name: Lifelong Learning of Visual Scene Understanding
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7718'
pubrep_id: '1021'
status: public
supervisor:
- first_name: Christoph
  full_name: Lampert, Christoph
  id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
  last_name: Lampert
  orcid: 0000-0001-8622-7887
title: Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '198'
abstract:
- lang: eng
  text: We consider a class of students learning a language from a teacher. The situation
    can be interpreted as a group of child learners receiving input from the linguistic
    environment. The teacher provides sample sentences. The students try to learn
    the grammar from the teacher. In addition to just listening to the teacher, the
    students can also communicate with each other. The students hold hypotheses about
    the grammar and change them if they receive counter evidence. The process stops
    when all students have converged to the correct grammar. We study how the time
    to convergence depends on the structure of the classroom by introducing and evaluating
    various complexity measures. We find that structured communication between students,
    although potentially introducing confusion, can greatly reduce some of the complexity
    measures. Our theory can also be interpreted as applying to the scientific process,
    where nature is the teacher and the scientists are the students.
article_number: '20180073'
article_processing_charge: No
article_type: original
author:
- first_name: Rasmus
  full_name: Ibsen-Jensen, Rasmus
  id: 3B699956-F248-11E8-B48F-1D18A9856A87
  last_name: Ibsen-Jensen
  orcid: 0000-0003-4783-0389
- first_name: Josef
  full_name: Tkadlec, Josef
  id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
  last_name: Tkadlec
  orcid: 0000-0002-1097-9684
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Martin
  full_name: Nowak, Martin
  last_name: Nowak
citation:
  ama: Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. Language acquisition with
    communication between learners. <i>Journal of the Royal Society Interface</i>.
    2018;15(140). doi:<a href="https://doi.org/10.1098/rsif.2018.0073">10.1098/rsif.2018.0073</a>
  apa: Ibsen-Jensen, R., Tkadlec, J., Chatterjee, K., &#38; Nowak, M. (2018). Language
    acquisition with communication between learners. <i>Journal of the Royal Society
    Interface</i>. The Royal Society. <a href="https://doi.org/10.1098/rsif.2018.0073">https://doi.org/10.1098/rsif.2018.0073</a>
  chicago: Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin
    Nowak. “Language Acquisition with Communication between Learners.” <i>Journal
    of the Royal Society Interface</i>. The Royal Society, 2018. <a href="https://doi.org/10.1098/rsif.2018.0073">https://doi.org/10.1098/rsif.2018.0073</a>.
  ieee: R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Language acquisition
    with communication between learners,” <i>Journal of the Royal Society Interface</i>,
    vol. 15, no. 140. The Royal Society, 2018.
  ista: Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. 2018. Language acquisition
    with communication between learners. Journal of the Royal Society Interface. 15(140),
    20180073.
  mla: Ibsen-Jensen, Rasmus, et al. “Language Acquisition with Communication between
    Learners.” <i>Journal of the Royal Society Interface</i>, vol. 15, no. 140, 20180073,
    The Royal Society, 2018, doi:<a href="https://doi.org/10.1098/rsif.2018.0073">10.1098/rsif.2018.0073</a>.
  short: R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, Journal of the Royal
    Society Interface 15 (2018).
date_created: 2018-12-11T11:45:09Z
date_published: 2018-03-01T00:00:00Z
date_updated: 2023-10-18T06:36:00Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1098/rsif.2018.0073
ec_funded: 1
external_id:
  isi:
  - '000428576200023'
  pmid:
  - '29593089'
file:
- access_level: open_access
  checksum: 444e1a9d98eb0e780671be82b13025f3
  content_type: application/pdf
  creator: dernst
  date_created: 2019-02-12T07:54:37Z
  date_updated: 2020-07-14T12:45:22Z
  file_id: '5955'
  file_name: 2018_RS_IbsenJensen.pdf
  file_size: 219837
  relation: main_file
file_date_updated: 2020-07-14T12:45:22Z
has_accepted_license: '1'
intvolume: '        15'
isi: 1
issue: '140'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
pmid: 1
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '279307'
  name: 'Quantitative Graph Games: Theory and Applications'
- _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
publication: Journal of the Royal Society Interface
publication_identifier:
  eissn:
  - 1742-5662
publication_status: published
publisher: The Royal Society
publist_id: '7715'
quality_controlled: '1'
related_material:
  link:
  - relation: supplementary_material
    url: https://dx.doi.org/10.6084/m9.figshare.c.4028971
  record:
  - id: '9814'
    relation: research_data
    status: public
scopus_import: '1'
status: public
title: Language acquisition with communication between learners
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2018'
...
---
_id: '199'
abstract:
- lang: eng
  text: Sex-biased genes are central to the study of sexual selection, sexual antagonism,
    and sex chromosome evolution. We describe a comprehensive de novo assembled transcriptome
    in the common frog Rana temporaria based on five developmental stages and three
    adult tissues from both sexes, obtained from a population with karyotypically
    homomorphic but genetically differentiated sex chromosomes. This allows the study
    of sex-biased gene expression throughout development, and its effect on the rate
    of gene evolution while accounting for pleiotropic expression, which is known
    to negatively correlate with the evolutionary rate. Overall, sex-biased genes
    had little overlap among developmental stages and adult tissues. Late developmental
    stages and gonad tissues had the highest numbers of stage-or tissue-specific genes.
    We find that pleiotropic gene expression is a better predictor than sex bias for
    the evolutionary rate of genes, though it often interacts with sex bias. Although
    genetically differentiated, the sex chromosomes were not enriched in sex-biased
    genes, possibly due to a very recent arrest of XY recombination. These results
    extend our understanding of the developmental dynamics, tissue specificity, and
    genomic localization of sex-biased genes.
article_number: '294'
article_processing_charge: No
author:
- first_name: Wen
  full_name: Ma, Wen
  last_name: Ma
- first_name: Paris
  full_name: Veltsos, Paris
  last_name: Veltsos
- first_name: Melissa A
  full_name: Toups, Melissa A
  id: 4E099E4E-F248-11E8-B48F-1D18A9856A87
  last_name: Toups
  orcid: 0000-0002-9752-7380
- first_name: Nicolas
  full_name: Rodrigues, Nicolas
  last_name: Rodrigues
- first_name: Roberto
  full_name: Sermier, Roberto
  last_name: Sermier
- first_name: Daniel
  full_name: Jeffries, Daniel
  last_name: Jeffries
- first_name: Nicolas
  full_name: Perrin, Nicolas
  last_name: Perrin
citation:
  ama: Ma W, Veltsos P, Toups MA, et al. Tissue specificity and dynamics of sex biased
    gene expression in a common frog population with differentiated, yet homomorphic,
    sex chromosomes. <i>Genes</i>. 2018;9(6). doi:<a href="https://doi.org/10.3390/genes9060294">10.3390/genes9060294</a>
  apa: Ma, W., Veltsos, P., Toups, M. A., Rodrigues, N., Sermier, R., Jeffries, D.,
    &#38; Perrin, N. (2018). Tissue specificity and dynamics of sex biased gene expression
    in a common frog population with differentiated, yet homomorphic, sex chromosomes.
    <i>Genes</i>. MDPI AG. <a href="https://doi.org/10.3390/genes9060294">https://doi.org/10.3390/genes9060294</a>
  chicago: Ma, Wen, Paris Veltsos, Melissa A Toups, Nicolas Rodrigues, Roberto Sermier,
    Daniel Jeffries, and Nicolas Perrin. “Tissue Specificity and Dynamics of Sex Biased
    Gene Expression in a Common Frog Population with Differentiated, yet Homomorphic,
    Sex Chromosomes.” <i>Genes</i>. MDPI AG, 2018. <a href="https://doi.org/10.3390/genes9060294">https://doi.org/10.3390/genes9060294</a>.
  ieee: W. Ma <i>et al.</i>, “Tissue specificity and dynamics of sex biased gene expression
    in a common frog population with differentiated, yet homomorphic, sex chromosomes,”
    <i>Genes</i>, vol. 9, no. 6. MDPI AG, 2018.
  ista: Ma W, Veltsos P, Toups MA, Rodrigues N, Sermier R, Jeffries D, Perrin N. 2018.
    Tissue specificity and dynamics of sex biased gene expression in a common frog
    population with differentiated, yet homomorphic, sex chromosomes. Genes. 9(6),
    294.
  mla: Ma, Wen, et al. “Tissue Specificity and Dynamics of Sex Biased Gene Expression
    in a Common Frog Population with Differentiated, yet Homomorphic, Sex Chromosomes.”
    <i>Genes</i>, vol. 9, no. 6, 294, MDPI AG, 2018, doi:<a href="https://doi.org/10.3390/genes9060294">10.3390/genes9060294</a>.
  short: W. Ma, P. Veltsos, M.A. Toups, N. Rodrigues, R. Sermier, D. Jeffries, N.
    Perrin, Genes 9 (2018).
date_created: 2018-12-11T11:45:09Z
date_published: 2018-06-12T00:00:00Z
date_updated: 2023-09-19T10:15:31Z
day: '12'
ddc:
- '570'
department:
- _id: BeVi
doi: 10.3390/genes9060294
external_id:
  isi:
  - '000436494200026'
file:
- access_level: open_access
  checksum: 423069beb1cd3cdd25bf3f464b38f1d7
  content_type: application/pdf
  creator: dernst
  date_created: 2019-02-01T07:52:28Z
  date_updated: 2020-07-14T12:45:22Z
  file_id: '5905'
  file_name: 2018_Genes_Ma.pdf
  file_size: 3985796
  relation: main_file
file_date_updated: 2020-07-14T12:45:22Z
has_accepted_license: '1'
intvolume: '         9'
isi: 1
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: Genes
publication_status: published
publisher: MDPI AG
publist_id: '7714'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tissue specificity and dynamics of sex biased gene expression in a common frog
  population with differentiated, yet homomorphic, sex chromosomes
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: 9
year: '2018'
...
---
_id: '2'
abstract:
- lang: eng
  text: Indirect reciprocity explores how humans act when their reputation is at stake,
    and which social norms they use to assess the actions of others. A crucial question
    in indirect reciprocity is which social norms can maintain stable cooperation
    in a society. Past research has highlighted eight such norms, called “leading-eight”
    strategies. This past research, however, is based on the assumption that all relevant
    information about other population members is publicly available and that everyone
    agrees on who is good or bad. Instead, here we explore the reputation dynamics
    when information is private and noisy. We show that under these conditions, most
    leading-eight strategies fail to evolve. Those leading-eight strategies that do
    evolve are unable to sustain full cooperation.Indirect reciprocity is a mechanism
    for cooperation based on shared moral systems and individual reputations. It assumes
    that members of a community routinely observe and assess each other and that they
    use this information to decide who is good or bad, and who deserves cooperation.
    When information is transmitted publicly, such that all community members agree
    on each other’s reputation, previous research has highlighted eight crucial moral
    systems. These “leading-eight” strategies can maintain cooperation and resist
    invasion by defectors. However, in real populations individuals often hold their
    own private views of others. Once two individuals disagree about their opinion
    of some third party, they may also see its subsequent actions in a different light.
    Their opinions may further diverge over time. Herein, we explore indirect reciprocity
    when information transmission is private and noisy. We find that in the presence
    of perception errors, most leading-eight strategies cease to be stable. Even if
    a leading-eight strategy evolves, cooperation rates may drop considerably when
    errors are common. Our research highlights the role of reliable information and
    synchronized reputations to maintain stable moral systems.
article_processing_charge: No
author:
- first_name: Christian
  full_name: Hilbe, Christian
  id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87
  last_name: Hilbe
  orcid: 0000-0001-5116-955X
- first_name: Laura
  full_name: Schmid, Laura
  id: 38B437DE-F248-11E8-B48F-1D18A9856A87
  last_name: Schmid
  orcid: 0000-0002-6978-7329
- first_name: Josef
  full_name: Tkadlec, Josef
  id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
  last_name: Tkadlec
  orcid: 0000-0002-1097-9684
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Martin
  full_name: Nowak, Martin
  last_name: Nowak
citation:
  ama: Hilbe C, Schmid L, Tkadlec J, Chatterjee K, Nowak M. Indirect reciprocity with
    private, noisy, and incomplete information. <i>PNAS</i>. 2018;115(48):12241-12246.
    doi:<a href="https://doi.org/10.1073/pnas.1810565115">10.1073/pnas.1810565115</a>
  apa: Hilbe, C., Schmid, L., Tkadlec, J., Chatterjee, K., &#38; Nowak, M. (2018).
    Indirect reciprocity with private, noisy, and incomplete information. <i>PNAS</i>.
    National Academy of Sciences. <a href="https://doi.org/10.1073/pnas.1810565115">https://doi.org/10.1073/pnas.1810565115</a>
  chicago: Hilbe, Christian, Laura Schmid, Josef Tkadlec, Krishnendu Chatterjee, and
    Martin Nowak. “Indirect Reciprocity with Private, Noisy, and Incomplete Information.”
    <i>PNAS</i>. National Academy of Sciences, 2018. <a href="https://doi.org/10.1073/pnas.1810565115">https://doi.org/10.1073/pnas.1810565115</a>.
  ieee: C. Hilbe, L. Schmid, J. Tkadlec, K. Chatterjee, and M. Nowak, “Indirect reciprocity
    with private, noisy, and incomplete information,” <i>PNAS</i>, vol. 115, no. 48.
    National Academy of Sciences, pp. 12241–12246, 2018.
  ista: Hilbe C, Schmid L, Tkadlec J, Chatterjee K, Nowak M. 2018. Indirect reciprocity
    with private, noisy, and incomplete information. PNAS. 115(48), 12241–12246.
  mla: Hilbe, Christian, et al. “Indirect Reciprocity with Private, Noisy, and Incomplete
    Information.” <i>PNAS</i>, vol. 115, no. 48, National Academy of Sciences, 2018,
    pp. 12241–46, doi:<a href="https://doi.org/10.1073/pnas.1810565115">10.1073/pnas.1810565115</a>.
  short: C. Hilbe, L. Schmid, J. Tkadlec, K. Chatterjee, M. Nowak, PNAS 115 (2018)
    12241–12246.
date_created: 2018-12-11T11:44:05Z
date_published: 2018-11-27T00:00:00Z
date_updated: 2025-07-14T09:10:09Z
day: '27'
department:
- _id: KrCh
doi: 10.1073/pnas.1810565115
ec_funded: 1
external_id:
  isi:
  - '000451351000063'
  pmid:
  - '30429320'
intvolume: '       115'
isi: 1
issue: '48'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.ncbi.nlm.nih.gov/pubmed/30429320
month: '11'
oa: 1
oa_version: Submitted Version
page: 12241-12246
pmid: 1
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '279307'
  name: 'Quantitative Graph Games: Theory and Applications'
- _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: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
related_material:
  link:
  - description: News on IST Homepage
    relation: press_release
    url: https://ist.ac.at/en/news/no-cooperation-without-open-communication/
  record:
  - id: '10293'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Indirect reciprocity with private, noisy, and incomplete information
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 115
year: '2018'
...
---
_id: '20'
abstract:
- lang: eng
  text: 'Background: Norepinephrine (NE) signaling has a key role in white adipose
    tissue (WAT) functions, including lipolysis, free fatty acid liberation and, under
    certain conditions, conversion of white into brite (brown-in-white) adipocytes.
    However, acute effects of NE stimulation have not been described at the transcriptional
    network level. Results: We used RNA-seq to uncover a broad transcriptional response.
    The inference of protein-protein and protein-DNA interaction networks allowed
    us to identify a set of immediate-early genes (IEGs) with high betweenness, validating
    our approach and suggesting a hierarchical control of transcriptional regulation.
    In addition, we identified a transcriptional regulatory network with IEGs as master
    regulators, including HSF1 and NFIL3 as novel NE-induced IEG candidates. Moreover,
    a functional enrichment analysis and gene clustering into functional modules suggest
    a crosstalk between metabolic, signaling, and immune responses. Conclusions: Altogether,
    our network biology approach explores for the first time the immediate-early systems
    level response of human adipocytes to acute sympathetic activation, thereby providing
    a first network basis of early cell fate programs and crosstalks between metabolic
    and transcriptional networks required for proper WAT function.'
acknowledgement: This work was funded by the German Centre for Diabetes Research (DZD)
  and the Austrian Science Fund (FWF, P25729-B19).
article_processing_charge: No
article_type: original
author:
- first_name: Juan
  full_name: Higareda Almaraz, Juan
  last_name: Higareda Almaraz
- first_name: Michael
  full_name: Karbiener, Michael
  last_name: Karbiener
- first_name: Maude
  full_name: Giroud, Maude
  last_name: Giroud
- first_name: Florian
  full_name: Pauler, Florian
  id: 48EA0138-F248-11E8-B48F-1D18A9856A87
  last_name: Pauler
  orcid: 0000-0002-7462-0048
- first_name: Teresa
  full_name: Gerhalter, Teresa
  last_name: Gerhalter
- first_name: Stephan
  full_name: Herzig, Stephan
  last_name: Herzig
- first_name: Marcel
  full_name: Scheideler, Marcel
  last_name: Scheideler
citation:
  ama: Higareda Almaraz J, Karbiener M, Giroud M, et al. Norepinephrine triggers an
    immediate-early regulatory network response in primary human white adipocytes.
    <i>BMC Genomics</i>. 2018;19(1). doi:<a href="https://doi.org/10.1186/s12864-018-5173-0">10.1186/s12864-018-5173-0</a>
  apa: Higareda Almaraz, J., Karbiener, M., Giroud, M., Pauler, F., Gerhalter, T.,
    Herzig, S., &#38; Scheideler, M. (2018). Norepinephrine triggers an immediate-early
    regulatory network response in primary human white adipocytes. <i>BMC Genomics</i>.
    BioMed Central. <a href="https://doi.org/10.1186/s12864-018-5173-0">https://doi.org/10.1186/s12864-018-5173-0</a>
  chicago: Higareda Almaraz, Juan, Michael Karbiener, Maude Giroud, Florian Pauler,
    Teresa Gerhalter, Stephan Herzig, and Marcel Scheideler. “Norepinephrine Triggers
    an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes.”
    <i>BMC Genomics</i>. BioMed Central, 2018. <a href="https://doi.org/10.1186/s12864-018-5173-0">https://doi.org/10.1186/s12864-018-5173-0</a>.
  ieee: J. Higareda Almaraz <i>et al.</i>, “Norepinephrine triggers an immediate-early
    regulatory network response in primary human white adipocytes,” <i>BMC Genomics</i>,
    vol. 19, no. 1. BioMed Central, 2018.
  ista: Higareda Almaraz J, Karbiener M, Giroud M, Pauler F, Gerhalter T, Herzig S,
    Scheideler M. 2018. Norepinephrine triggers an immediate-early regulatory network
    response in primary human white adipocytes. BMC Genomics. 19(1).
  mla: Higareda Almaraz, Juan, et al. “Norepinephrine Triggers an Immediate-Early
    Regulatory Network Response in Primary Human White Adipocytes.” <i>BMC Genomics</i>,
    vol. 19, no. 1, BioMed Central, 2018, doi:<a href="https://doi.org/10.1186/s12864-018-5173-0">10.1186/s12864-018-5173-0</a>.
  short: J. Higareda Almaraz, M. Karbiener, M. Giroud, F. Pauler, T. Gerhalter, S.
    Herzig, M. Scheideler, BMC Genomics 19 (2018).
date_created: 2018-12-11T11:44:12Z
date_published: 2018-11-03T00:00:00Z
date_updated: 2023-09-13T09:10:47Z
day: '03'
ddc:
- '570'
department:
- _id: SiHi
doi: 10.1186/s12864-018-5173-0
external_id:
  isi:
  - '000450976700002'
file:
- access_level: open_access
  checksum: a56516e734dab589dc7f3e1915973b4d
  content_type: application/pdf
  creator: dernst
  date_created: 2018-12-17T14:52:57Z
  date_updated: 2020-07-14T12:45:23Z
  file_id: '5712'
  file_name: 2018_BMCGenomics_Higareda.pdf
  file_size: 4629784
  relation: main_file
file_date_updated: 2020-07-14T12:45:23Z
has_accepted_license: '1'
intvolume: '        19'
isi: 1
issue: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
publication: BMC Genomics
publication_identifier:
  issn:
  - 1471-2164
publication_status: published
publisher: BioMed Central
publist_id: '8035'
quality_controlled: '1'
related_material:
  record:
  - id: '9807'
    relation: research_data
    status: public
  - id: '9808'
    relation: research_data
    status: public
scopus_import: '1'
status: public
title: Norepinephrine triggers an immediate-early regulatory network response in primary
  human white adipocytes
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: 19
year: '2018'
...
---
_id: '200'
abstract:
- lang: eng
  text: This thesis is concerned with the inference of current population structure
    based on geo-referenced genetic data. The underlying idea is that population structure
    affects its spatial genetic structure. Therefore, genotype information can be
    utilized to estimate important demographic parameters such as migration rates.
    These indirect estimates of population structure have become very attractive,
    as genotype data is now widely available. However, there also has been much concern
    about these approaches. Importantly, genetic structure can be influenced by many
    complex patterns, which often cannot be disentangled. Moreover, many methods merely
    fit heuristic patterns of genetic structure, and do not build upon population
    genetics theory. Here, I describe two novel inference methods that address these
    shortcomings. In Chapter 2, I introduce an inference scheme based on a new type
    of signal, identity by descent (IBD) blocks. Recently, it has become feasible
    to detect such long blocks of genome shared between pairs of samples. These blocks
    are direct traces of recent coalescence events. As such, they contain ample signal
    for inferring recent demography. I examine sharing of IBD blocks in two-dimensional
    populations with local migration. Using a diffusion approximation, I derive formulas
    for an isolation by distance pattern of long IBD blocks and show that sharing
    of long IBD blocks approaches rapid exponential decay for growing sample distance.
    I describe an inference scheme based on these results. It can robustly estimate
    the dispersal rate and population density, which is demonstrated on simulated
    data. I also show an application to estimate mean migration and the rate of recent
    population growth within Eastern Europe. Chapter 3 is about a novel method to
    estimate barriers to gene flow in a two dimensional population. This inference
    scheme utilizes geographically localized allele frequency fluctuations - a classical
    isolation by distance signal. The strength of these local fluctuations increases
    on average next to a barrier, and there is less correlation across it. I again
    use a framework of diffusion of ancestral lineages to model this effect, and provide
    an efficient numerical implementation to fit the results to geo-referenced biallelic
    SNP data. This inference scheme is able to robustly estimate strong barriers to
    gene flow, as tests on simulated data confirm.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Harald
  full_name: Ringbauer, Harald
  id: 417FCFF4-F248-11E8-B48F-1D18A9856A87
  last_name: Ringbauer
  orcid: 0000-0002-4884-9682
citation:
  ama: Ringbauer H. Inferring recent demography from spatial genetic structure. 2018.
    doi:<a href="https://doi.org/10.15479/AT:ISTA:th_963">10.15479/AT:ISTA:th_963</a>
  apa: Ringbauer, H. (2018). <i>Inferring recent demography from spatial genetic structure</i>.
    Institute of Science and Technology Austria. <a href="https://doi.org/10.15479/AT:ISTA:th_963">https://doi.org/10.15479/AT:ISTA:th_963</a>
  chicago: Ringbauer, Harald. “Inferring Recent Demography from Spatial Genetic Structure.”
    Institute of Science and Technology Austria, 2018. <a href="https://doi.org/10.15479/AT:ISTA:th_963">https://doi.org/10.15479/AT:ISTA:th_963</a>.
  ieee: H. Ringbauer, “Inferring recent demography from spatial genetic structure,”
    Institute of Science and Technology Austria, 2018.
  ista: Ringbauer H. 2018. Inferring recent demography from spatial genetic structure.
    Institute of Science and Technology Austria.
  mla: Ringbauer, Harald. <i>Inferring Recent Demography from Spatial Genetic Structure</i>.
    Institute of Science and Technology Austria, 2018, doi:<a href="https://doi.org/10.15479/AT:ISTA:th_963">10.15479/AT:ISTA:th_963</a>.
  short: H. Ringbauer, Inferring Recent Demography from Spatial Genetic Structure,
    Institute of Science and Technology Austria, 2018.
date_created: 2018-12-11T11:45:10Z
date_published: 2018-02-21T00:00:00Z
date_updated: 2025-05-28T11:57:06Z
day: '21'
ddc:
- '576'
degree_awarded: PhD
department:
- _id: NiBa
doi: 10.15479/AT:ISTA:th_963
file:
- access_level: open_access
  checksum: 8cc534d2b528ae017acf80874cce48c9
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:14:55Z
  date_updated: 2020-07-14T12:45:23Z
  file_id: '5111'
  file_name: IST-2018-963-v1+1_thesis.pdf
  file_size: 5792935
  relation: main_file
- access_level: closed
  checksum: 6af18d7e5a7e2728ceda2f41ee24f628
  content_type: application/zip
  creator: dernst
  date_created: 2019-04-05T09:30:12Z
  date_updated: 2020-07-14T12:45:23Z
  file_id: '6224'
  file_name: 2018_thesis_ringbauer_source.zip
  file_size: 113365
  relation: source_file
file_date_updated: 2020-07-14T12:45:23Z
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '02'
oa: 1
oa_version: Published Version
page: '146'
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7713'
pubrep_id: '963'
related_material:
  record:
  - id: '563'
    relation: part_of_dissertation
    status: public
  - id: '1074'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- first_name: Nicholas H
  full_name: Barton, Nicholas H
  id: 4880FE40-F248-11E8-B48F-1D18A9856A87
  last_name: Barton
  orcid: 0000-0002-8548-5240
title: Inferring recent demography from spatial genetic structure
tmp:
  image: /images/cc_by_nc.png
  legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
  short: CC BY-NC (4.0)
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '201'
abstract:
- lang: eng
  text: 'We describe arrangements of three-dimensional spheres from a geometrical
    and topological point of view. Real data (fitting this setup) often consist of
    soft spheres which show certain degree of deformation while strongly packing against
    each other. In this context, we answer the following questions: If we model a
    soft packing of spheres by hard spheres that are allowed to overlap, can we measure
    the volume in the overlapped areas? Can we be more specific about the overlap
    volume, i.e. quantify how much volume is there covered exactly twice, three times,
    or k times? What would be a good optimization criteria that rule the arrangement
    of soft spheres while making a good use of the available space? Fixing a particular
    criterion, what would be the optimal sphere configuration? The first result of
    this thesis are short formulas for the computation of volumes covered by at least
    k of the balls. The formulas exploit information contained in the order-k Voronoi
    diagrams and its closely related Level-k complex. The used complexes lead to a
    natural generalization into poset diagrams, a theoretical formalism that contains
    the order-k and degree-k diagrams as special cases. In parallel, we define different
    criteria to determine what could be considered an optimal arrangement from a geometrical
    point of view. Fixing a criterion, we find optimal soft packing configurations
    in 2D and 3D where the ball centers lie on a lattice. As a last step, we use tools
    from computational topology on real physical data, to show the potentials of higher-order
    diagrams in the description of melting crystals. The results of the experiments
    leaves us with an open window to apply the theories developed in this thesis in
    real applications.'
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Mabel
  full_name: Iglesias Ham, Mabel
  id: 41B58C0C-F248-11E8-B48F-1D18A9856A87
  last_name: Iglesias Ham
citation:
  ama: Iglesias Ham M. Multiple covers with balls. 2018. doi:<a href="https://doi.org/10.15479/AT:ISTA:th_1026">10.15479/AT:ISTA:th_1026</a>
  apa: Iglesias Ham, M. (2018). <i>Multiple covers with balls</i>. Institute of Science
    and Technology Austria. <a href="https://doi.org/10.15479/AT:ISTA:th_1026">https://doi.org/10.15479/AT:ISTA:th_1026</a>
  chicago: Iglesias Ham, Mabel. “Multiple Covers with Balls.” Institute of Science
    and Technology Austria, 2018. <a href="https://doi.org/10.15479/AT:ISTA:th_1026">https://doi.org/10.15479/AT:ISTA:th_1026</a>.
  ieee: M. Iglesias Ham, “Multiple covers with balls,” Institute of Science and Technology
    Austria, 2018.
  ista: Iglesias Ham M. 2018. Multiple covers with balls. Institute of Science and
    Technology Austria.
  mla: Iglesias Ham, Mabel. <i>Multiple Covers with Balls</i>. Institute of Science
    and Technology Austria, 2018, doi:<a href="https://doi.org/10.15479/AT:ISTA:th_1026">10.15479/AT:ISTA:th_1026</a>.
  short: M. Iglesias Ham, Multiple Covers with Balls, Institute of Science and Technology
    Austria, 2018.
date_created: 2018-12-11T11:45:10Z
date_published: 2018-06-11T00:00:00Z
date_updated: 2023-09-07T12:25:32Z
day: '11'
ddc:
- '514'
- '516'
degree_awarded: PhD
department:
- _id: HeEd
doi: 10.15479/AT:ISTA:th_1026
file:
- access_level: closed
  checksum: dd699303623e96d1478a6ae07210dd05
  content_type: application/zip
  creator: kschuh
  date_created: 2019-02-05T07:43:31Z
  date_updated: 2020-07-14T12:45:24Z
  file_id: '5918'
  file_name: IST-2018-1025-v2+5_ist-thesis-iglesias-11June2018(1).zip
  file_size: 11827713
  relation: source_file
- access_level: open_access
  checksum: ba163849a190d2b41d66fef0e4983294
  content_type: application/pdf
  creator: kschuh
  date_created: 2019-02-05T07:43:45Z
  date_updated: 2020-07-14T12:45:24Z
  file_id: '5919'
  file_name: IST-2018-1025-v2+4_ThesisIglesiasFinal11June2018.pdf
  file_size: 4783846
  relation: main_file
file_date_updated: 2020-07-14T12:45:24Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '171'
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7712'
pubrep_id: '1026'
status: public
supervisor:
- first_name: Herbert
  full_name: Edelsbrunner, Herbert
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
title: Multiple covers with balls
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '203'
abstract:
- lang: eng
  text: Asymmetric auxin distribution is instrumental for the differential growth
    that causes organ bending on tropic stimuli and curvatures during plant development.
    Local differences in auxin concentrations are achieved mainly by polarized cellular
    distribution of PIN auxin transporters, but whether other mechanisms involving
    auxin homeostasis are also relevant for the formation of auxin gradients is not
    clear. Here we show that auxin methylation is required for asymmetric auxin distribution
    across the hypocotyl, particularly during its response to gravity. We found that
    loss-of-function mutants in Arabidopsis IAA CARBOXYL METHYLTRANSFERASE1 (IAMT1)
    prematurely unfold the apical hook, and that their hypocotyls are impaired in
    gravitropic reorientation. This defect is linked to an auxin-dependent increase
    in PIN gene expression, leading to an increased polar auxin transport and lack
    of asymmetric distribution of PIN3 in the iamt1 mutant. Gravitropic reorientation
    in the iamt1 mutant could be restored with either endodermis-specific expression
    of IAMT1 or partial inhibition of polar auxin transport, which also results in
    normal PIN gene expression levels. We propose that IAA methylation is necessary
    in gravity-sensing cells to restrict polar auxin transport within the range of
    auxin levels that allow for differential responses.
article_processing_charge: No
author:
- first_name: Mohamad
  full_name: Abbas, Mohamad
  id: 47E8FC1C-F248-11E8-B48F-1D18A9856A87
  last_name: Abbas
- first_name: García J
  full_name: Hernández, García J
  last_name: Hernández
- first_name: Stephan
  full_name: Pollmann, Stephan
  last_name: Pollmann
- first_name: Sophia L
  full_name: Samodelov, Sophia L
  last_name: Samodelov
- first_name: Martina
  full_name: Kolb, Martina
  last_name: Kolb
- first_name: Jirí
  full_name: Friml, Jirí
  id: 4159519E-F248-11E8-B48F-1D18A9856A87
  last_name: Friml
  orcid: 0000-0002-8302-7596
- first_name: Ulrich Z
  full_name: Hammes, Ulrich Z
  last_name: Hammes
- first_name: Matias D
  full_name: Zurbriggen, Matias D
  last_name: Zurbriggen
- first_name: Miguel
  full_name: Blázquez, Miguel
  last_name: Blázquez
- first_name: David
  full_name: Alabadí, David
  last_name: Alabadí
citation:
  ama: Abbas M, Hernández GJ, Pollmann S, et al. Auxin methylation is required for
    differential growth in Arabidopsis. <i>PNAS</i>. 2018;115(26):6864-6869. doi:<a
    href="https://doi.org/10.1073/pnas.1806565115">10.1073/pnas.1806565115</a>
  apa: Abbas, M., Hernández, G. J., Pollmann, S., Samodelov, S. L., Kolb, M., Friml,
    J., … Alabadí, D. (2018). Auxin methylation is required for differential growth
    in Arabidopsis. <i>PNAS</i>. National Academy of Sciences. <a href="https://doi.org/10.1073/pnas.1806565115">https://doi.org/10.1073/pnas.1806565115</a>
  chicago: Abbas, Mohamad, García J Hernández, Stephan Pollmann, Sophia L Samodelov,
    Martina Kolb, Jiří Friml, Ulrich Z Hammes, Matias D Zurbriggen, Miguel Blázquez,
    and David Alabadí. “Auxin Methylation Is Required for Differential Growth in Arabidopsis.”
    <i>PNAS</i>. National Academy of Sciences, 2018. <a href="https://doi.org/10.1073/pnas.1806565115">https://doi.org/10.1073/pnas.1806565115</a>.
  ieee: M. Abbas <i>et al.</i>, “Auxin methylation is required for differential growth
    in Arabidopsis,” <i>PNAS</i>, vol. 115, no. 26. National Academy of Sciences,
    pp. 6864–6869, 2018.
  ista: Abbas M, Hernández GJ, Pollmann S, Samodelov SL, Kolb M, Friml J, Hammes UZ,
    Zurbriggen MD, Blázquez M, Alabadí D. 2018. Auxin methylation is required for
    differential growth in Arabidopsis. PNAS. 115(26), 6864–6869.
  mla: Abbas, Mohamad, et al. “Auxin Methylation Is Required for Differential Growth
    in Arabidopsis.” <i>PNAS</i>, vol. 115, no. 26, National Academy of Sciences,
    2018, pp. 6864–69, doi:<a href="https://doi.org/10.1073/pnas.1806565115">10.1073/pnas.1806565115</a>.
  short: M. Abbas, G.J. Hernández, S. Pollmann, S.L. Samodelov, M. Kolb, J. Friml,
    U.Z. Hammes, M.D. Zurbriggen, M. Blázquez, D. Alabadí, PNAS 115 (2018) 6864–6869.
date_created: 2018-12-11T11:45:11Z
date_published: 2018-06-26T00:00:00Z
date_updated: 2025-05-07T11:12:32Z
day: '26'
department:
- _id: JiFr
doi: 10.1073/pnas.1806565115
ec_funded: 1
external_id:
  isi:
  - '000436245000096'
intvolume: '       115'
isi: 1
issue: '26'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://eprints.nottingham.ac.uk/52388/
month: '06'
oa: 1
oa_version: None
page: 6864-6869
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '282300'
  name: Polarity and subcellular dynamics in plants
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '7710'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Auxin methylation is required for differential growth in Arabidopsis
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 115
year: '2018'
...
---
_id: '134'
abstract:
- lang: eng
  text: "The current state of the art in real-time two-dimensional water wave simulation
    requires developers to choose between efficient Fourier-based methods, which lack
    interactions with moving obstacles, and finite-difference or finite element methods,
    which handle environmental interactions but are significantly more expensive.
    This paper attempts to bridge this long-standing gap between complexity and performance,
    by proposing a new wave simulation method that can faithfully simulate wave interactions
    with moving obstacles in real time while simultaneously preserving minute details
    and accommodating very large simulation domains.\r\n\r\nPrevious methods for simulating
    2D water waves directly compute the change in height of the water surface, a strategy
    which imposes limitations based on the CFL condition (fast moving waves require
    small time steps) and Nyquist's limit (small wave details require closely-spaced
    simulation variables). This paper proposes a novel wavelet transformation that
    discretizes the liquid motion in terms of amplitude-like functions that vary over
    space, frequency, and direction, effectively generalizing Fourier-based methods
    to handle local interactions. Because these new variables change much more slowly
    over space than the original water height function, our change of variables drastically
    reduces the limitations of the CFL condition and Nyquist limit, allowing us to
    simulate highly detailed water waves at very large visual resolutions. Our discretization
    is amenable to fast summation and easy to parallelize. We also present basic extensions
    like pre-computed wave paths and two-way solid fluid coupling. Finally, we argue
    that our discretization provides a convenient set of variables for artistic manipulation,
    which we illustrate with a novel wave-painting interface."
acknowledged_ssus:
- _id: ScienComp
alternative_title:
- SIGGRAPH
article_number: '94'
article_processing_charge: No
author:
- first_name: Stefan
  full_name: Jeschke, Stefan
  id: 44D6411A-F248-11E8-B48F-1D18A9856A87
  last_name: Jeschke
- first_name: Tomas
  full_name: Skrivan, Tomas
  id: 486A5A46-F248-11E8-B48F-1D18A9856A87
  last_name: Skrivan
- first_name: Matthias
  full_name: Mueller Fischer, Matthias
  last_name: Mueller Fischer
- first_name: Nuttapong
  full_name: Chentanez, Nuttapong
  last_name: Chentanez
- first_name: Miles
  full_name: Macklin, Miles
  last_name: Macklin
- first_name: Christopher J
  full_name: Wojtan, Christopher J
  id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
  last_name: Wojtan
  orcid: 0000-0001-6646-5546
citation:
  ama: Jeschke S, Skrivan T, Mueller Fischer M, Chentanez N, Macklin M, Wojtan C.
    Water surface wavelets. <i>ACM Transactions on Graphics</i>. 2018;37(4). doi:<a
    href="https://doi.org/10.1145/3197517.3201336">10.1145/3197517.3201336</a>
  apa: Jeschke, S., Skrivan, T., Mueller Fischer, M., Chentanez, N., Macklin, M.,
    &#38; Wojtan, C. (2018). Water surface wavelets. <i>ACM Transactions on Graphics</i>.
    ACM. <a href="https://doi.org/10.1145/3197517.3201336">https://doi.org/10.1145/3197517.3201336</a>
  chicago: Jeschke, Stefan, Tomas Skrivan, Matthias Mueller Fischer, Nuttapong Chentanez,
    Miles Macklin, and Chris Wojtan. “Water Surface Wavelets.” <i>ACM Transactions
    on Graphics</i>. ACM, 2018. <a href="https://doi.org/10.1145/3197517.3201336">https://doi.org/10.1145/3197517.3201336</a>.
  ieee: S. Jeschke, T. Skrivan, M. Mueller Fischer, N. Chentanez, M. Macklin, and
    C. Wojtan, “Water surface wavelets,” <i>ACM Transactions on Graphics</i>, vol.
    37, no. 4. ACM, 2018.
  ista: Jeschke S, Skrivan T, Mueller Fischer M, Chentanez N, Macklin M, Wojtan C.
    2018. Water surface wavelets. ACM Transactions on Graphics. 37(4), 94.
  mla: Jeschke, Stefan, et al. “Water Surface Wavelets.” <i>ACM Transactions on Graphics</i>,
    vol. 37, no. 4, 94, ACM, 2018, doi:<a href="https://doi.org/10.1145/3197517.3201336">10.1145/3197517.3201336</a>.
  short: S. Jeschke, T. Skrivan, M. Mueller Fischer, N. Chentanez, M. Macklin, C.
    Wojtan, ACM Transactions on Graphics 37 (2018).
date_created: 2018-12-11T11:44:48Z
date_published: 2018-07-30T00:00:00Z
date_updated: 2024-02-28T13:58:51Z
day: '30'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/3197517.3201336
ec_funded: 1
external_id:
  isi:
  - '000448185000055'
file:
- access_level: open_access
  checksum: db75ebabe2ec432bf41389e614d6ef62
  content_type: application/pdf
  creator: dernst
  date_created: 2018-12-18T09:59:23Z
  date_updated: 2020-07-14T12:44:45Z
  file_id: '5744'
  file_name: 2018_ACM_Jeschke.pdf
  file_size: 22185016
  relation: main_file
file_date_updated: 2020-07-14T12:44:45Z
has_accepted_license: '1'
intvolume: '        37'
isi: 1
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '638176'
  name: Efficient Simulation of Natural Phenomena at Extremely Large Scales
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '665385'
  name: International IST Doctoral Program
publication: ACM Transactions on Graphics
publication_status: published
publisher: ACM
publist_id: '7789'
quality_controlled: '1'
related_material:
  link:
  - description: News on IST Homepage
    relation: press_release
    url: https://ist.ac.at/en/news/new-water-simulation-captures-small-details-even-in-large-scenes/
scopus_import: '1'
status: public
title: Water surface wavelets
tmp:
  image: /images/cc_by_nc_sa.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
    BY-NC-SA 4.0)
  short: CC BY-NC-SA (4.0)
type: journal_article
user_id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2018'
...
---
_id: '135'
abstract:
- lang: eng
  text: The Fluid Implicit Particle method (FLIP) reduces numerical dissipation by
    combining particles with grids. To improve performance, the subsequent narrow
    band FLIP method (NB‐FLIP) uses a FLIP‐based fluid simulation only near the liquid
    surface and a traditional grid‐based fluid simulation away from the surface. This
    spatially‐limited FLIP simulation significantly reduces the number of particles
    and alleviates a computational bottleneck. In this paper, we extend the NB‐FLIP
    idea even further, by allowing a simulation to transition between a FLIP‐like
    fluid simulation and a grid‐based simulation in arbitrary locations, not just
    near the surface. This approach leads to even more savings in memory and computation,
    because we can concentrate the particles only in areas where they are needed.
    More importantly, this new method allows us to seamlessly transition to smooth
    implicit surface geometry wherever the particle‐based simulation is unnecessary.
    Consequently, our method leads to a practical algorithm for avoiding the noisy
    surface artifacts associated with particle‐based liquid simulations, while simultaneously
    maintaining the benefits of a FLIP simulation in regions of dynamic motion.
alternative_title:
- Eurographics
article_processing_charge: No
article_type: original
author:
- first_name: Takahiro
  full_name: Sato, Takahiro
  last_name: Sato
- first_name: Christopher J
  full_name: Wojtan, Christopher J
  id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
  last_name: Wojtan
  orcid: 0000-0001-6646-5546
- first_name: Nils
  full_name: Thuerey, Nils
  last_name: Thuerey
- first_name: Takeo
  full_name: Igarashi, Takeo
  last_name: Igarashi
- first_name: Ryoichi
  full_name: Ando, Ryoichi
  last_name: Ando
citation:
  ama: Sato T, Wojtan C, Thuerey N, Igarashi T, Ando R. Extended narrow band FLIP
    for liquid simulations. <i>Computer Graphics Forum</i>. 2018;37(2):169-177. doi:<a
    href="https://doi.org/10.1111/cgf.13351">10.1111/cgf.13351</a>
  apa: Sato, T., Wojtan, C., Thuerey, N., Igarashi, T., &#38; Ando, R. (2018). Extended
    narrow band FLIP for liquid simulations. <i>Computer Graphics Forum</i>. Wiley.
    <a href="https://doi.org/10.1111/cgf.13351">https://doi.org/10.1111/cgf.13351</a>
  chicago: Sato, Takahiro, Chris Wojtan, Nils Thuerey, Takeo Igarashi, and Ryoichi
    Ando. “Extended Narrow Band FLIP for Liquid Simulations.” <i>Computer Graphics
    Forum</i>. Wiley, 2018. <a href="https://doi.org/10.1111/cgf.13351">https://doi.org/10.1111/cgf.13351</a>.
  ieee: T. Sato, C. Wojtan, N. Thuerey, T. Igarashi, and R. Ando, “Extended narrow
    band FLIP for liquid simulations,” <i>Computer Graphics Forum</i>, vol. 37, no.
    2. Wiley, pp. 169–177, 2018.
  ista: Sato T, Wojtan C, Thuerey N, Igarashi T, Ando R. 2018. Extended narrow band
    FLIP for liquid simulations. Computer Graphics Forum. 37(2), 169–177.
  mla: Sato, Takahiro, et al. “Extended Narrow Band FLIP for Liquid Simulations.”
    <i>Computer Graphics Forum</i>, vol. 37, no. 2, Wiley, 2018, pp. 169–77, doi:<a
    href="https://doi.org/10.1111/cgf.13351">10.1111/cgf.13351</a>.
  short: T. Sato, C. Wojtan, N. Thuerey, T. Igarashi, R. Ando, Computer Graphics Forum
    37 (2018) 169–177.
date_created: 2018-12-11T11:44:49Z
date_published: 2018-05-22T00:00:00Z
date_updated: 2023-09-11T14:00:26Z
day: '22'
ddc:
- '006'
department:
- _id: ChWo
doi: 10.1111/cgf.13351
ec_funded: 1
external_id:
  isi:
  - '000434085600016'
file:
- access_level: open_access
  checksum: 8edb90da8a72395eb5d970580e0925b6
  content_type: application/pdf
  creator: wojtan
  date_created: 2020-10-08T08:38:23Z
  date_updated: 2020-10-08T08:38:23Z
  file_id: '8627'
  file_name: exnbflip.pdf
  file_size: 54309947
  relation: main_file
  success: 1
file_date_updated: 2020-10-08T08:38:23Z
has_accepted_license: '1'
intvolume: '        37'
isi: 1
issue: '2'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 169 - 177
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '638176'
  name: Efficient Simulation of Natural Phenomena at Extremely Large Scales
publication: Computer Graphics Forum
publication_identifier:
  issn:
  - 0167-7055
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Extended narrow band FLIP for liquid simulations
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 37
year: '2018'
...
---
_id: '136'
abstract:
- lang: eng
  text: Recent studies suggest that unstable, nonchaotic solutions of the Navier-Stokes
    equation may provide deep insights into fluid turbulence. In this article, we
    present a combined experimental and numerical study exploring the dynamical role
    of unstable equilibrium solutions and their invariant manifolds in a weakly turbulent,
    electromagnetically driven, shallow fluid layer. Identifying instants when turbulent
    evolution slows down, we compute 31 unstable equilibria of a realistic two-dimensional
    model of the flow. We establish the dynamical relevance of these unstable equilibria
    by showing that they are closely visited by the turbulent flow. We also establish
    the dynamical relevance of unstable manifolds by verifying that they are shadowed
    by turbulent trajectories departing from the neighborhoods of unstable equilibria
    over large distances in state space.
article_processing_charge: No
arxiv: 1
author:
- first_name: Balachandra
  full_name: Suri, Balachandra
  id: 47A5E706-F248-11E8-B48F-1D18A9856A87
  last_name: Suri
- first_name: Jeffrey
  full_name: Tithof, Jeffrey
  last_name: Tithof
- first_name: Roman
  full_name: Grigoriev, Roman
  last_name: Grigoriev
- first_name: Michael
  full_name: Schatz, Michael
  last_name: Schatz
citation:
  ama: Suri B, Tithof J, Grigoriev R, Schatz M. Unstable equilibria and invariant
    manifolds in quasi-two-dimensional Kolmogorov-like flow. <i>Physical Review E</i>.
    2018;98(2). doi:<a href="https://doi.org/10.1103/PhysRevE.98.023105">10.1103/PhysRevE.98.023105</a>
  apa: Suri, B., Tithof, J., Grigoriev, R., &#38; Schatz, M. (2018). Unstable equilibria
    and invariant manifolds in quasi-two-dimensional Kolmogorov-like flow. <i>Physical
    Review E</i>. American Physical Society. <a href="https://doi.org/10.1103/PhysRevE.98.023105">https://doi.org/10.1103/PhysRevE.98.023105</a>
  chicago: Suri, Balachandra, Jeffrey Tithof, Roman Grigoriev, and Michael Schatz.
    “Unstable Equilibria and Invariant Manifolds in Quasi-Two-Dimensional Kolmogorov-like
    Flow.” <i>Physical Review E</i>. American Physical Society, 2018. <a href="https://doi.org/10.1103/PhysRevE.98.023105">https://doi.org/10.1103/PhysRevE.98.023105</a>.
  ieee: B. Suri, J. Tithof, R. Grigoriev, and M. Schatz, “Unstable equilibria and
    invariant manifolds in quasi-two-dimensional Kolmogorov-like flow,” <i>Physical
    Review E</i>, vol. 98, no. 2. American Physical Society, 2018.
  ista: Suri B, Tithof J, Grigoriev R, Schatz M. 2018. Unstable equilibria and invariant
    manifolds in quasi-two-dimensional Kolmogorov-like flow. Physical Review E. 98(2).
  mla: Suri, Balachandra, et al. “Unstable Equilibria and Invariant Manifolds in Quasi-Two-Dimensional
    Kolmogorov-like Flow.” <i>Physical Review E</i>, vol. 98, no. 2, American Physical
    Society, 2018, doi:<a href="https://doi.org/10.1103/PhysRevE.98.023105">10.1103/PhysRevE.98.023105</a>.
  short: B. Suri, J. Tithof, R. Grigoriev, M. Schatz, Physical Review E 98 (2018).
date_created: 2018-12-11T11:44:49Z
date_published: 2018-08-13T00:00:00Z
date_updated: 2023-10-10T13:29:10Z
day: '13'
department:
- _id: BjHo
doi: 10.1103/PhysRevE.98.023105
external_id:
  arxiv:
  - '1808.02088'
  isi:
  - '000441466800010'
intvolume: '        98'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1808.02088
month: '08'
oa: 1
oa_version: Submitted Version
publication: Physical Review E
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Unstable equilibria and invariant manifolds in quasi-two-dimensional Kolmogorov-like
  flow
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 98
year: '2018'
...
---
_id: '137'
abstract:
- lang: eng
  text: Fluorescent sensors are an essential part of the experimental toolbox of the
    life sciences, where they are used ubiquitously to visualize intra- and extracellular
    signaling. In the brain, optical neurotransmitter sensors can shed light on temporal
    and spatial aspects of signal transmission by directly observing, for instance,
    neurotransmitter release and spread. Here we report the development and application
    of the first optical sensor for the amino acid glycine, which is both an inhibitory
    neurotransmitter and a co-agonist of the N-methyl-d-aspartate receptors (NMDARs)
    involved in synaptic plasticity. Computational design of a glycine-specific binding
    protein allowed us to produce the optical glycine FRET sensor (GlyFS), which can
    be used with single and two-photon excitation fluorescence microscopy. We took
    advantage of this newly developed sensor to test predictions about the uneven
    spatial distribution of glycine in extracellular space and to demonstrate that
    extracellular glycine levels are controlled by plasticity-inducing stimuli.
article_processing_charge: No
article_type: original
author:
- first_name: William
  full_name: Zhang, William
  last_name: Zhang
- first_name: Michel
  full_name: Herde, Michel
  last_name: Herde
- first_name: Joshua
  full_name: Mitchell, Joshua
  last_name: Mitchell
- first_name: Jason
  full_name: Whitfield, Jason
  last_name: Whitfield
- first_name: Andreas
  full_name: Wulff, Andreas
  last_name: Wulff
- first_name: Vanessa
  full_name: Vongsouthi, Vanessa
  last_name: Vongsouthi
- first_name: Inmaculada
  full_name: Sanchez Romero, Inmaculada
  id: 3D9C5D30-F248-11E8-B48F-1D18A9856A87
  last_name: Sanchez Romero
- first_name: Polina
  full_name: Gulakova, Polina
  last_name: Gulakova
- first_name: Daniel
  full_name: Minge, Daniel
  last_name: Minge
- first_name: Björn
  full_name: Breithausen, Björn
  last_name: Breithausen
- first_name: Susanne
  full_name: Schoch, Susanne
  last_name: Schoch
- first_name: Harald L
  full_name: Janovjak, Harald L
  id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
  last_name: Janovjak
  orcid: 0000-0002-8023-9315
- first_name: Colin
  full_name: Jackson, Colin
  last_name: Jackson
- first_name: Christian
  full_name: Henneberger, Christian
  last_name: Henneberger
citation:
  ama: Zhang W, Herde M, Mitchell J, et al. Monitoring hippocampal glycine with the
    computationally designed optical sensor GlyFS. <i>Nature Chemical Biology</i>.
    2018;14(9):861-869. doi:<a href="https://doi.org/10.1038/s41589-018-0108-2">10.1038/s41589-018-0108-2</a>
  apa: Zhang, W., Herde, M., Mitchell, J., Whitfield, J., Wulff, A., Vongsouthi, V.,
    … Henneberger, C. (2018). Monitoring hippocampal glycine with the computationally
    designed optical sensor GlyFS. <i>Nature Chemical Biology</i>. Nature Publishing
    Group. <a href="https://doi.org/10.1038/s41589-018-0108-2">https://doi.org/10.1038/s41589-018-0108-2</a>
  chicago: Zhang, William, Michel Herde, Joshua Mitchell, Jason Whitfield, Andreas
    Wulff, Vanessa Vongsouthi, Inmaculada Sanchez-Romero, et al. “Monitoring Hippocampal
    Glycine with the Computationally Designed Optical Sensor GlyFS.” <i>Nature Chemical
    Biology</i>. Nature Publishing Group, 2018. <a href="https://doi.org/10.1038/s41589-018-0108-2">https://doi.org/10.1038/s41589-018-0108-2</a>.
  ieee: W. Zhang <i>et al.</i>, “Monitoring hippocampal glycine with the computationally
    designed optical sensor GlyFS,” <i>Nature Chemical Biology</i>, vol. 14, no. 9.
    Nature Publishing Group, pp. 861–869, 2018.
  ista: Zhang W, Herde M, Mitchell J, Whitfield J, Wulff A, Vongsouthi V, Sanchez-Romero
    I, Gulakova P, Minge D, Breithausen B, Schoch S, Janovjak HL, Jackson C, Henneberger
    C. 2018. Monitoring hippocampal glycine with the computationally designed optical
    sensor GlyFS. Nature Chemical Biology. 14(9), 861–869.
  mla: Zhang, William, et al. “Monitoring Hippocampal Glycine with the Computationally
    Designed Optical Sensor GlyFS.” <i>Nature Chemical Biology</i>, vol. 14, no. 9,
    Nature Publishing Group, 2018, pp. 861–69, doi:<a href="https://doi.org/10.1038/s41589-018-0108-2">10.1038/s41589-018-0108-2</a>.
  short: W. Zhang, M. Herde, J. Mitchell, J. Whitfield, A. Wulff, V. Vongsouthi, I.
    Sanchez-Romero, P. Gulakova, D. Minge, B. Breithausen, S. Schoch, H.L. Janovjak,
    C. Jackson, C. Henneberger, Nature Chemical Biology 14 (2018) 861–869.
date_created: 2018-12-11T11:44:49Z
date_published: 2018-07-30T00:00:00Z
date_updated: 2023-09-13T08:58:05Z
day: '30'
department:
- _id: HaJa
doi: 10.1038/s41589-018-0108-2
external_id:
  isi:
  - '000442174500013'
  pmid:
  - '30061718 '
intvolume: '        14'
isi: 1
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.ncbi.nlm.nih.gov/pubmed/30061718
month: '07'
oa: 1
oa_version: Submitted Version
page: 861 - 869
pmid: 1
project:
- _id: 255BFFFA-B435-11E9-9278-68D0E5697425
  grant_number: RGY0084/2012
  name: In situ real-time imaging of neurotransmitter signaling using designer optical
    sensors (HFSP Young Investigator)
publication: Nature Chemical Biology
publication_status: published
publisher: Nature Publishing Group
publist_id: '7786'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Monitoring hippocampal glycine with the computationally designed optical sensor
  GlyFS
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 14
year: '2018'
...
---
_id: '139'
abstract:
- lang: eng
  text: 'Genome-scale diversity data are increasingly available in a variety of biological
    systems, and can be used to reconstruct the past evolutionary history of species
    divergence. However, extracting the full demographic information from these data
    is not trivial, and requires inferential methods that account for the diversity
    of coalescent histories throughout the genome. Here, we evaluate the potential
    and limitations of one such approach. We reexamine a well-known system of mussel
    sister species, using the joint site frequency spectrum (jSFS) of synonymousmutations
    computed either fromexome capture or RNA-seq, in an Approximate Bayesian Computation
    (ABC) framework. We first assess the best sampling strategy (number of: individuals,
    loci, and bins in the jSFS), and show that model selection is robust to variation
    in the number of individuals and loci. In contrast, different binning choices
    when summarizing the jSFS, strongly affect the results: including classes of low
    and high frequency shared polymorphisms can more effectively reveal recent migration
    events. We then take advantage of the flexibility of ABC to compare more realistic
    models of speciation, including variation in migration rates through time (i.e.,
    periodic connectivity) and across genes (i.e., genome-wide heterogeneity in migration
    rates). We show that these models were consistently selected as the most probable,
    suggesting that mussels have experienced a complex history of gene flow during
    divergence and that the species boundary is semi-permeable. Our work provides
    a comprehensive evaluation of ABC demographic inference in mussels based on the
    coding jSFS, and supplies guidelines for employing different sequencing techniques
    and sampling strategies. We emphasize, perhaps surprisingly, that inferences are
    less limited by the volume of data, than by the way in which they are analyzed.'
article_number: '30083438'
article_processing_charge: No
author:
- first_name: Christelle
  full_name: Fraisse, Christelle
  id: 32DF5794-F248-11E8-B48F-1D18A9856A87
  last_name: Fraisse
  orcid: 0000-0001-8441-5075
- first_name: Camille
  full_name: Roux, Camille
  last_name: Roux
- first_name: Pierre
  full_name: Gagnaire, Pierre
  last_name: Gagnaire
- first_name: Jonathan
  full_name: Romiguier, Jonathan
  last_name: Romiguier
- first_name: Nicolas
  full_name: Faivre, Nicolas
  last_name: Faivre
- first_name: John
  full_name: Welch, John
  last_name: Welch
- first_name: Nicolas
  full_name: Bierne, Nicolas
  last_name: Bierne
citation:
  ama: 'Fraisse C, Roux C, Gagnaire P, et al. The divergence history of European blue
    mussel species reconstructed from Approximate Bayesian Computation: The effects
    of sequencing techniques and sampling strategies. <i>PeerJ</i>. 2018;2018(7).
    doi:<a href="https://doi.org/10.7717/peerj.5198">10.7717/peerj.5198</a>'
  apa: 'Fraisse, C., Roux, C., Gagnaire, P., Romiguier, J., Faivre, N., Welch, J.,
    &#38; Bierne, N. (2018). The divergence history of European blue mussel species
    reconstructed from Approximate Bayesian Computation: The effects of sequencing
    techniques and sampling strategies. <i>PeerJ</i>. PeerJ. <a href="https://doi.org/10.7717/peerj.5198">https://doi.org/10.7717/peerj.5198</a>'
  chicago: 'Fraisse, Christelle, Camille Roux, Pierre Gagnaire, Jonathan Romiguier,
    Nicolas Faivre, John Welch, and Nicolas Bierne. “The Divergence History of European
    Blue Mussel Species Reconstructed from Approximate Bayesian Computation: The Effects
    of Sequencing Techniques and Sampling Strategies.” <i>PeerJ</i>. PeerJ, 2018.
    <a href="https://doi.org/10.7717/peerj.5198">https://doi.org/10.7717/peerj.5198</a>.'
  ieee: 'C. Fraisse <i>et al.</i>, “The divergence history of European blue mussel
    species reconstructed from Approximate Bayesian Computation: The effects of sequencing
    techniques and sampling strategies,” <i>PeerJ</i>, vol. 2018, no. 7. PeerJ, 2018.'
  ista: 'Fraisse C, Roux C, Gagnaire P, Romiguier J, Faivre N, Welch J, Bierne N.
    2018. The divergence history of European blue mussel species reconstructed from
    Approximate Bayesian Computation: The effects of sequencing techniques and sampling
    strategies. PeerJ. 2018(7), 30083438.'
  mla: 'Fraisse, Christelle, et al. “The Divergence History of European Blue Mussel
    Species Reconstructed from Approximate Bayesian Computation: The Effects of Sequencing
    Techniques and Sampling Strategies.” <i>PeerJ</i>, vol. 2018, no. 7, 30083438,
    PeerJ, 2018, doi:<a href="https://doi.org/10.7717/peerj.5198">10.7717/peerj.5198</a>.'
  short: C. Fraisse, C. Roux, P. Gagnaire, J. Romiguier, N. Faivre, J. Welch, N. Bierne,
    PeerJ 2018 (2018).
date_created: 2018-12-11T11:44:50Z
date_published: 2018-07-30T00:00:00Z
date_updated: 2023-10-17T12:25:28Z
day: '30'
ddc:
- '576'
department:
- _id: BeVi
- _id: NiBa
doi: 10.7717/peerj.5198
external_id:
  isi:
  - '000440484800002'
file:
- access_level: open_access
  checksum: 7d55ae22598a1c70759cd671600cff53
  content_type: application/pdf
  creator: dernst
  date_created: 2018-12-18T09:42:11Z
  date_updated: 2020-07-14T12:44:48Z
  file_id: '5739'
  file_name: 2018_PeerJ_Fraisse.pdf
  file_size: 1480792
  relation: main_file
file_date_updated: 2020-07-14T12:44:48Z
has_accepted_license: '1'
intvolume: '      2018'
isi: 1
issue: '7'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: PeerJ
publication_status: published
publisher: PeerJ
publist_id: '7784'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The divergence history of European blue mussel species reconstructed from
  Approximate Bayesian Computation: The effects of sequencing techniques and sampling
  strategies'
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: 2018
year: '2018'
...
---
_id: '14'
abstract:
- lang: eng
  text: The intercellular transport of auxin is driven by PIN-formed (PIN) auxin efflux
    carriers. PINs are localized at the plasma membrane (PM) and on constitutively
    recycling endomembrane vesicles. Therefore, PINs can mediate auxin transport either
    by direct translocation across the PM or by pumping auxin into secretory vesicles
    (SVs), leading to its secretory release upon fusion with the PM. Which of these
    two mechanisms dominates is a matter of debate. Here, we addressed the issue with
    a mathematical modeling approach. We demonstrate that the efficiency of secretory
    transport depends on SV size, half-life of PINs on the PM, pH, exocytosis frequency
    and PIN density. 3D structured illumination microscopy (SIM) was used to determine
    PIN density on the PM. Combining this data with published values of the other
    parameters, we show that the transport activity of PINs in SVs would have to be
    at least 1000× greater than on the PM in order to produce a comparable macroscopic
    auxin transport. If both transport mechanisms operated simultaneously and PINs
    were equally active on SVs and PM, the contribution of secretion to the total
    auxin flux would be negligible. In conclusion, while secretory vesicle-mediated
    transport of auxin is an intriguing and theoretically possible model, it is unlikely
    to be a major mechanism of auxin transport inplanta.
acknowledgement: 'European Research Council (ERC): 742985 to Jiri Friml; M.A. was
  supported by the Austrian Science Fund (FWF) (M2379-B28); AJ was supported by the
  Austria Science Fund (FWF): I03630 to Jiri Friml.'
article_processing_charge: No
article_type: original
author:
- first_name: Sander
  full_name: Hille, Sander
  last_name: Hille
- first_name: Maria
  full_name: Akhmanova, Maria
  id: 3425EC26-F248-11E8-B48F-1D18A9856A87
  last_name: Akhmanova
  orcid: 0000-0003-1522-3162
- first_name: Matous
  full_name: Glanc, Matous
  id: 1AE1EA24-02D0-11E9-9BAA-DAF4881429F2
  last_name: Glanc
  orcid: 0000-0003-0619-7783
- first_name: Alexander J
  full_name: Johnson, Alexander J
  id: 46A62C3A-F248-11E8-B48F-1D18A9856A87
  last_name: Johnson
  orcid: 0000-0002-2739-8843
- first_name: Jirí
  full_name: Friml, Jirí
  id: 4159519E-F248-11E8-B48F-1D18A9856A87
  last_name: Friml
  orcid: 0000-0002-8302-7596
citation:
  ama: 'Hille S, Akhmanova M, Glanc M, Johnson AJ, Friml J. Relative contribution
    of PIN-containing secretory vesicles and plasma membrane PINs to the directed
    auxin transport: Theoretical estimation. <i>International Journal of Molecular
    Sciences</i>. 2018;19(11). doi:<a href="https://doi.org/10.3390/ijms19113566">10.3390/ijms19113566</a>'
  apa: 'Hille, S., Akhmanova, M., Glanc, M., Johnson, A. J., &#38; Friml, J. (2018).
    Relative contribution of PIN-containing secretory vesicles and plasma membrane
    PINs to the directed auxin transport: Theoretical estimation. <i>International
    Journal of Molecular Sciences</i>. MDPI. <a href="https://doi.org/10.3390/ijms19113566">https://doi.org/10.3390/ijms19113566</a>'
  chicago: 'Hille, Sander, Maria Akhmanova, Matous Glanc, Alexander J Johnson, and
    Jiří Friml. “Relative Contribution of PIN-Containing Secretory Vesicles and Plasma
    Membrane PINs to the Directed Auxin Transport: Theoretical Estimation.” <i>International
    Journal of Molecular Sciences</i>. MDPI, 2018. <a href="https://doi.org/10.3390/ijms19113566">https://doi.org/10.3390/ijms19113566</a>.'
  ieee: 'S. Hille, M. Akhmanova, M. Glanc, A. J. Johnson, and J. Friml, “Relative
    contribution of PIN-containing secretory vesicles and plasma membrane PINs to
    the directed auxin transport: Theoretical estimation,” <i>International Journal
    of Molecular Sciences</i>, vol. 19, no. 11. MDPI, 2018.'
  ista: 'Hille S, Akhmanova M, Glanc M, Johnson AJ, Friml J. 2018. Relative contribution
    of PIN-containing secretory vesicles and plasma membrane PINs to the directed
    auxin transport: Theoretical estimation. International Journal of Molecular Sciences.
    19(11).'
  mla: 'Hille, Sander, et al. “Relative Contribution of PIN-Containing Secretory Vesicles
    and Plasma Membrane PINs to the Directed Auxin Transport: Theoretical Estimation.”
    <i>International Journal of Molecular Sciences</i>, vol. 19, no. 11, MDPI, 2018,
    doi:<a href="https://doi.org/10.3390/ijms19113566">10.3390/ijms19113566</a>.'
  short: S. Hille, M. Akhmanova, M. Glanc, A.J. Johnson, J. Friml, International Journal
    of Molecular Sciences 19 (2018).
date_created: 2018-12-11T11:44:09Z
date_published: 2018-11-12T00:00:00Z
date_updated: 2023-09-18T08:09:32Z
day: '12'
ddc:
- '580'
department:
- _id: DaSi
- _id: JiFr
doi: 10.3390/ijms19113566
ec_funded: 1
external_id:
  isi:
  - '000451528500282'
file:
- access_level: open_access
  checksum: e4b59c2599b0ca26ebf5b8434bcde94a
  content_type: application/pdf
  creator: dernst
  date_created: 2018-12-17T16:04:11Z
  date_updated: 2020-07-14T12:44:50Z
  file_id: '5719'
  file_name: 2018_IJMS_Hille.pdf
  file_size: 2200593
  relation: main_file
file_date_updated: 2020-07-14T12:44:50Z
has_accepted_license: '1'
intvolume: '        19'
isi: 1
issue: '11'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 261099A6-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '742985'
  name: Tracing Evolution of Auxin Transport and Polarity in Plants
- _id: 26538374-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: I03630
  name: Molecular mechanisms of endocytic cargo recognition in plants
publication: International Journal of Molecular Sciences
publication_identifier:
  eissn:
  - 1422-0067
publication_status: published
publisher: MDPI
publist_id: '8042'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Relative contribution of PIN-containing secretory vesicles and plasma membrane
  PINs to the directed auxin transport: Theoretical estimation'
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: 19
year: '2018'
...
---
_id: '140'
abstract:
- lang: eng
  text: Reachability analysis is difficult for hybrid automata with affine differential
    equations, because the reach set needs to be approximated. Promising abstraction
    techniques usually employ interval methods or template polyhedra. Interval methods
    account for dense time and guarantee soundness, and there are interval-based tools
    that overapproximate affine flowpipes. But interval methods impose bounded and
    rigid shapes, which make refinement expensive and fixpoint detection difficult.
    Template polyhedra, on the other hand, can be adapted flexibly and can be unbounded,
    but sound template refinement for unbounded reachability analysis has been implemented
    only for systems with piecewise constant dynamics. We capitalize on the advantages
    of both techniques, combining interval arithmetic and template polyhedra, using
    the former to abstract time and the latter to abstract space. During a CEGAR loop,
    whenever a spurious error trajectory is found, we compute additional space constraints
    and split time intervals, and use these space-time interpolants to eliminate the
    counterexample. Space-time interpolation offers a lazy, flexible framework for
    increasing precision while guaranteeing soundness, both for error avoidance and
    fixpoint detection. To the best of out knowledge, this is the first abstraction
    refinement scheme for the reachability analysis over unbounded and dense time
    of affine hybrid systems, which is both sound and automatic. We demonstrate the
    effectiveness of our algorithm with several benchmark examples, which cannot be
    handled by other tools.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Goran
  full_name: Frehse, Goran
  last_name: Frehse
- first_name: Mirco
  full_name: Giacobbe, Mirco
  id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
  last_name: Giacobbe
  orcid: 0000-0001-8180-0904
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
citation:
  ama: 'Frehse G, Giacobbe M, Henzinger TA. Space-time interpolants. In: Vol 10981.
    Springer; 2018:468-486. doi:<a href="https://doi.org/10.1007/978-3-319-96145-3_25">10.1007/978-3-319-96145-3_25</a>'
  apa: 'Frehse, G., Giacobbe, M., &#38; Henzinger, T. A. (2018). Space-time interpolants
    (Vol. 10981, pp. 468–486). Presented at the CAV: Computer Aided Verification,
    Oxford, United Kingdom: Springer. <a href="https://doi.org/10.1007/978-3-319-96145-3_25">https://doi.org/10.1007/978-3-319-96145-3_25</a>'
  chicago: Frehse, Goran, Mirco Giacobbe, and Thomas A Henzinger. “Space-Time Interpolants,”
    10981:468–86. Springer, 2018. <a href="https://doi.org/10.1007/978-3-319-96145-3_25">https://doi.org/10.1007/978-3-319-96145-3_25</a>.
  ieee: 'G. Frehse, M. Giacobbe, and T. A. Henzinger, “Space-time interpolants,” presented
    at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10981,
    pp. 468–486.'
  ista: 'Frehse G, Giacobbe M, Henzinger TA. 2018. Space-time interpolants. CAV: Computer
    Aided Verification, LNCS, vol. 10981, 468–486.'
  mla: Frehse, Goran, et al. <i>Space-Time Interpolants</i>. Vol. 10981, Springer,
    2018, pp. 468–86, doi:<a href="https://doi.org/10.1007/978-3-319-96145-3_25">10.1007/978-3-319-96145-3_25</a>.
  short: G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2018, pp. 468–486.
conference:
  end_date: 2018-07-17
  location: Oxford, United Kingdom
  name: 'CAV: Computer Aided Verification'
  start_date: 2018-07-14
date_created: 2018-12-11T11:44:50Z
date_published: 2018-07-18T00:00:00Z
date_updated: 2023-09-19T09:30:43Z
day: '18'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-319-96145-3_25
external_id:
  isi:
  - '000491481600025'
file:
- access_level: open_access
  checksum: 6dca832f575d6b3f0ea9dff56f579142
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:17:53Z
  date_updated: 2020-07-14T12:44:50Z
  file_id: '5310'
  file_name: IST-2018-1010-v1+1_space-time_interpolants.pdf
  file_size: 563710
  relation: main_file
file_date_updated: 2020-07-14T12:44:50Z
has_accepted_license: '1'
intvolume: '     10981'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 468 - 486
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S11402-N23
  name: Moderne Concurrency Paradigms
publication_identifier:
  issn:
  - '03029743'
publication_status: published
publisher: Springer
publist_id: '7783'
pubrep_id: '1010'
quality_controlled: '1'
related_material:
  record:
  - id: '6894'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Space-time interpolants
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: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10981
year: '2018'
...
---
_id: '141'
abstract:
- lang: eng
  text: 'Given a model and a specification, the fundamental model-checking problem
    asks for algorithmic verification of whether the model satisfies the specification.
    We consider graphs and Markov decision processes (MDPs), which are fundamental
    models for reactive systems. One of the very basic specifications that arise in
    verification of reactive systems is the strong fairness (aka Streett) objective.
    Given different types of requests and corresponding grants, the objective requires
    that for each type, if the request event happens infinitely often, then the corresponding
    grant event must also happen infinitely often. All ω -regular objectives can be
    expressed as Streett objectives and hence they are canonical in verification.
    To handle the state-space explosion, symbolic algorithms are required that operate
    on a succinct implicit representation of the system rather than explicitly accessing
    the system. While explicit algorithms for graphs and MDPs with Streett objectives
    have been widely studied, there has been no improvement of the basic symbolic
    algorithms. The worst-case numbers of symbolic steps required for the basic symbolic
    algorithms are as follows: quadratic for graphs and cubic for MDPs. In this work
    we present the first sub-quadratic symbolic algorithm for graphs with Streett
    objectives, and our algorithm is sub-quadratic even for MDPs. Based on our algorithmic
    insights we present an implementation of the new symbolic approach and show that
    it improves the existing approach on several academic benchmark examples.'
acknowledgement: 'Acknowledgements. K. C. and M. H. are partially supported by the
  Vienna Science and Technology Fund (WWTF) grant ICT15-003. K. C. is partially supported
  by the Austrian Science Fund (FWF): S11407-N23 (RiSE/SHiNE), and an ERC Start Grant
  (279307: Graph Games). V. T. is partially supported by the European Union’s Horizon
  2020 research and innovation programme under the Marie Sk lodowska-Curie Grant Agreement
  No. 665385.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
- first_name: Veronika
  full_name: Loitzenbauer, Veronika
  last_name: Loitzenbauer
- first_name: Simin
  full_name: Oraee, Simin
  last_name: Oraee
- first_name: Viktor
  full_name: Toman, Viktor
  id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
  last_name: Toman
  orcid: 0000-0001-9036-063X
citation:
  ama: 'Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. Symbolic algorithms
    for graphs and Markov decision processes with fairness objectives. In: Vol 10982.
    Springer; 2018:178-197. doi:<a href="https://doi.org/10.1007/978-3-319-96142-2_13">10.1007/978-3-319-96142-2_13</a>'
  apa: 'Chatterjee, K., Henzinger, M. H., Loitzenbauer, V., Oraee, S., &#38; Toman,
    V. (2018). Symbolic algorithms for graphs and Markov decision processes with fairness
    objectives (Vol. 10982, pp. 178–197). Presented at the CAV: Computer Aided Verification,
    Oxford, United Kingdom: Springer. <a href="https://doi.org/10.1007/978-3-319-96142-2_13">https://doi.org/10.1007/978-3-319-96142-2_13</a>'
  chicago: Chatterjee, Krishnendu, Monika H Henzinger, Veronika Loitzenbauer, Simin
    Oraee, and Viktor Toman. “Symbolic Algorithms for Graphs and Markov Decision Processes
    with Fairness Objectives,” 10982:178–97. Springer, 2018. <a href="https://doi.org/10.1007/978-3-319-96142-2_13">https://doi.org/10.1007/978-3-319-96142-2_13</a>.
  ieee: 'K. Chatterjee, M. H. Henzinger, V. Loitzenbauer, S. Oraee, and V. Toman,
    “Symbolic algorithms for graphs and Markov decision processes with fairness objectives,”
    presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018,
    vol. 10982, pp. 178–197.'
  ista: 'Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. 2018. Symbolic
    algorithms for graphs and Markov decision processes with fairness objectives.
    CAV: Computer Aided Verification, LNCS, vol. 10982, 178–197.'
  mla: Chatterjee, Krishnendu, et al. <i>Symbolic Algorithms for Graphs and Markov
    Decision Processes with Fairness Objectives</i>. Vol. 10982, Springer, 2018, pp.
    178–97, doi:<a href="https://doi.org/10.1007/978-3-319-96142-2_13">10.1007/978-3-319-96142-2_13</a>.
  short: K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, S. Oraee, V. Toman, in:,
    Springer, 2018, pp. 178–197.
conference:
  end_date: 2018-07-17
  location: Oxford, United Kingdom
  name: 'CAV: Computer Aided Verification'
  start_date: 2018-07-14
date_created: 2018-12-11T11:44:51Z
date_published: 2018-07-18T00:00:00Z
date_updated: 2025-07-14T09:10:15Z
day: '18'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-319-96142-2_13
ec_funded: 1
external_id:
  isi:
  - '000491469700013'
file:
- access_level: open_access
  checksum: 1a6ffa4febe8bb8ac28be3adb3eafebc
  content_type: application/pdf
  creator: dernst
  date_created: 2018-12-18T08:52:38Z
  date_updated: 2020-07-14T12:44:53Z
  file_id: '5737'
  file_name: 2018_LNCS_Chatterjee.pdf
  file_size: 675606
  relation: main_file
file_date_updated: 2020-07-14T12:44:53Z
has_accepted_license: '1'
intvolume: '     10982'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 178-197
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '279307'
  name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
  grant_number: ICT15-003
  name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '665385'
  name: International IST Doctoral Program
publication_status: published
publisher: Springer
publist_id: '7782'
quality_controlled: '1'
related_material:
  record:
  - id: '10199'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Symbolic algorithms for graphs and Markov decision processes with fairness
  objectives
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: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10982
year: '2018'
...
---
_id: '14198'
abstract:
- lang: eng
  text: "High-dimensional time series are common in many domains. Since human\r\ncognition
    is not optimized to work well in high-dimensional spaces, these areas\r\ncould
    benefit from interpretable low-dimensional representations. However, most\r\nrepresentation
    learning algorithms for time series data are difficult to\r\ninterpret. This is
    due to non-intuitive mappings from data features to salient\r\nproperties of the
    representation and non-smoothness over time. To address this\r\nproblem, we propose
    a new representation learning framework building on ideas\r\nfrom interpretable
    discrete dimensionality reduction and deep generative\r\nmodeling. This framework
    allows us to learn discrete representations of time\r\nseries, which give rise
    to smooth and interpretable embeddings with superior\r\nclustering performance.
    We introduce a new way to overcome the\r\nnon-differentiability in discrete representation
    learning and present a\r\ngradient-based version of the traditional self-organizing
    map algorithm that is\r\nmore performant than the original. Furthermore, to allow
    for a probabilistic\r\ninterpretation of our method, we integrate a Markov model
    in the representation\r\nspace. This model uncovers the temporal transition structure,
    improves\r\nclustering performance even further and provides additional explanatory\r\ninsights
    as well as a natural representation of uncertainty. We evaluate our\r\nmodel in
    terms of clustering performance and interpretability on static\r\n(Fashion-)MNIST
    data, a time series of linearly interpolated (Fashion-)MNIST\r\nimages, a chaotic
    Lorenz attractor system with two macro states, as well as on\r\na challenging
    real world medical time series application on the eICU data set.\r\nOur learned
    representations compare favorably with competitor methods and\r\nfacilitate downstream
    tasks on the real world data."
article_processing_charge: No
arxiv: 1
author:
- first_name: Vincent
  full_name: Fortuin, Vincent
  last_name: Fortuin
- first_name: Matthias
  full_name: Hüser, Matthias
  last_name: Hüser
- first_name: Francesco
  full_name: Locatello, Francesco
  id: 26cfd52f-2483-11ee-8040-88983bcc06d4
  last_name: Locatello
  orcid: 0000-0002-4850-0683
- first_name: Heiko
  full_name: Strathmann, Heiko
  last_name: Strathmann
- first_name: Gunnar
  full_name: Rätsch, Gunnar
  last_name: Rätsch
citation:
  ama: 'Fortuin V, Hüser M, Locatello F, Strathmann H, Rätsch G. SOM-VAE: Interpretable
    discrete representation learning on time series. In: <i>International Conference
    on Learning Representations</i>. ; 2018.'
  apa: 'Fortuin, V., Hüser, M., Locatello, F., Strathmann, H., &#38; Rätsch, G. (2018).
    SOM-VAE: Interpretable discrete representation learning on time series. In <i>International
    Conference on Learning Representations</i>. New Orleans, LA, United States.'
  chicago: 'Fortuin, Vincent, Matthias Hüser, Francesco Locatello, Heiko Strathmann,
    and Gunnar Rätsch. “SOM-VAE: Interpretable Discrete Representation Learning on
    Time Series.” In <i>International Conference on Learning Representations</i>,
    2018.'
  ieee: 'V. Fortuin, M. Hüser, F. Locatello, H. Strathmann, and G. Rätsch, “SOM-VAE:
    Interpretable discrete representation learning on time series,” in <i>International
    Conference on Learning Representations</i>, New Orleans, LA, United States, 2018.'
  ista: 'Fortuin V, Hüser M, Locatello F, Strathmann H, Rätsch G. 2018. SOM-VAE: Interpretable
    discrete representation learning on time series. International Conference on Learning
    Representations. ICLR: International Conference on Learning Representations.'
  mla: 'Fortuin, Vincent, et al. “SOM-VAE: Interpretable Discrete Representation Learning
    on Time Series.” <i>International Conference on Learning Representations</i>,
    2018.'
  short: V. Fortuin, M. Hüser, F. Locatello, H. Strathmann, G. Rätsch, in:, International
    Conference on Learning Representations, 2018.
conference:
  end_date: 2019-05-09
  location: New Orleans, LA, United States
  name: 'ICLR: International Conference on Learning Representations'
  start_date: 2019-05-06
date_created: 2023-08-22T14:12:48Z
date_published: 2018-06-06T00:00:00Z
date_updated: 2023-09-13T06:35:12Z
day: '06'
department:
- _id: FrLo
extern: '1'
external_id:
  arxiv:
  - '1806.02199'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1806.02199
month: '06'
oa: 1
oa_version: Preprint
publication: International Conference on Learning Representations
publication_status: published
quality_controlled: '1'
status: public
title: 'SOM-VAE: Interpretable discrete representation learning on time series'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
