---
_id: '9780'
abstract:
- lang: eng
  text: "PADREV : 4,4'-dimethoxy[1,1'-biphenyl]-2,2',5,5'-tetrol\r\nSpace Group: C
    2 (5), Cell: a 24.488(16)Å b 5.981(4)Å c 3.911(3)Å, α 90° β 91.47(3)° γ 90°"
article_processing_charge: No
author:
- first_name: Werner
  full_name: Schlemmer, Werner
  last_name: Schlemmer
- first_name: Philipp
  full_name: Nothdurft, Philipp
  last_name: Nothdurft
- first_name: Alina
  full_name: Petzold, Alina
  last_name: Petzold
- first_name: Gisbert
  full_name: Riess, Gisbert
  last_name: Riess
- first_name: Philipp
  full_name: Frühwirt, Philipp
  last_name: Frühwirt
- first_name: Max
  full_name: Schmallegger, Max
  last_name: Schmallegger
- first_name: Georg
  full_name: Gescheidt-Demner, Georg
  last_name: Gescheidt-Demner
- first_name: Roland
  full_name: Fischer, Roland
  last_name: Fischer
- first_name: Stefan Alexander
  full_name: Freunberger, Stefan Alexander
  id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
  last_name: Freunberger
  orcid: 0000-0003-2902-5319
- first_name: Wolfgang
  full_name: Kern, Wolfgang
  last_name: Kern
- first_name: Stefan
  full_name: Spirk, Stefan
  last_name: Spirk
citation:
  ama: 'Schlemmer W, Nothdurft P, Petzold A, et al. CCDC 1991959: Experimental Crystal
    Structure Determination. 2020. doi:<a href="https://doi.org/10.5517/ccdc.csd.cc24vsrk">10.5517/ccdc.csd.cc24vsrk</a>'
  apa: 'Schlemmer, W., Nothdurft, P., Petzold, A., Riess, G., Frühwirt, P., Schmallegger,
    M., … Spirk, S. (2020). CCDC 1991959: Experimental Crystal Structure Determination.
    CCDC. <a href="https://doi.org/10.5517/ccdc.csd.cc24vsrk">https://doi.org/10.5517/ccdc.csd.cc24vsrk</a>'
  chicago: 'Schlemmer, Werner, Philipp Nothdurft, Alina Petzold, Gisbert Riess, Philipp
    Frühwirt, Max Schmallegger, Georg Gescheidt-Demner, et al. “CCDC 1991959: Experimental
    Crystal Structure Determination.” CCDC, 2020. <a href="https://doi.org/10.5517/ccdc.csd.cc24vsrk">https://doi.org/10.5517/ccdc.csd.cc24vsrk</a>.'
  ieee: 'W. Schlemmer <i>et al.</i>, “CCDC 1991959: Experimental Crystal Structure
    Determination.” CCDC, 2020.'
  ista: 'Schlemmer W, Nothdurft P, Petzold A, Riess G, Frühwirt P, Schmallegger M,
    Gescheidt-Demner G, Fischer R, Freunberger SA, Kern W, Spirk S. 2020. CCDC 1991959:
    Experimental Crystal Structure Determination, CCDC, <a href="https://doi.org/10.5517/ccdc.csd.cc24vsrk">10.5517/ccdc.csd.cc24vsrk</a>.'
  mla: 'Schlemmer, Werner, et al. <i>CCDC 1991959: Experimental Crystal Structure
    Determination</i>. CCDC, 2020, doi:<a href="https://doi.org/10.5517/ccdc.csd.cc24vsrk">10.5517/ccdc.csd.cc24vsrk</a>.'
  short: W. Schlemmer, P. Nothdurft, A. Petzold, G. Riess, P. Frühwirt, M. Schmallegger,
    G. Gescheidt-Demner, R. Fischer, S.A. Freunberger, W. Kern, S. Spirk, (2020).
date_created: 2021-08-06T07:41:07Z
date_published: 2020-03-22T00:00:00Z
date_updated: 2023-09-05T16:03:47Z
day: '22'
department:
- _id: StFr
doi: 10.5517/ccdc.csd.cc24vsrk
main_file_link:
- open_access: '1'
  url: https://dx.doi.org/10.5517/ccdc.csd.cc24vsrk
month: '03'
oa: 1
oa_version: Published Version
publisher: CCDC
related_material:
  record:
  - id: '8329'
    relation: used_in_publication
    status: public
status: public
title: 'CCDC 1991959: Experimental Crystal Structure Determination'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2020'
...
---
OA_place: publisher
OA_type: hybrid
_id: '9798'
abstract:
- lang: eng
  text: Fitness interactions between mutations can influence a population’s evolution
    in many different ways. While epistatic effects are difficult to measure precisely,
    important information is captured by the mean and variance of log fitnesses for
    individuals carrying different numbers of mutations. We derive predictions for
    these quantities from a class of simple fitness landscapes, based on models of
    optimizing selection on quantitative traits. We also explore extensions to the
    models, including modular pleiotropy, variable effect sizes, mutational bias and
    maladaptation of the wild type. We illustrate our approach by reanalysing a large
    dataset of mutant effects in a yeast snoRNA. Though characterized by some large
    epistatic effects, these data give a good overall fit to the non-epistatic null
    model, suggesting that epistasis might have limited influence on the evolutionary
    dynamics in this system. We also show how the amount of epistasis depends on both
    the underlying fitness landscape and the distribution of mutations, and so is
    expected to vary in consistent ways between new mutations, standing variation
    and fixed mutations.
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: John J.
  full_name: Welch, John J.
  last_name: Welch
citation:
  ama: Fraisse C, Welch JJ. Simulation code for Fig S2 from the distribution of epistasis
    on simple fitness landscapes. 2020. doi:<a href="https://doi.org/10.6084/m9.figshare.7957472.v1">10.6084/m9.figshare.7957472.v1</a>
  apa: Fraisse, C., &#38; Welch, J. J. (2020). Simulation code for Fig S2 from the
    distribution of epistasis on simple fitness landscapes. Royal Society of London.
    <a href="https://doi.org/10.6084/m9.figshare.7957472.v1">https://doi.org/10.6084/m9.figshare.7957472.v1</a>
  chicago: Fraisse, Christelle, and John J. Welch. “Simulation Code for Fig S2 from
    the Distribution of Epistasis on Simple Fitness Landscapes.” Royal Society of
    London, 2020. <a href="https://doi.org/10.6084/m9.figshare.7957472.v1">https://doi.org/10.6084/m9.figshare.7957472.v1</a>.
  ieee: C. Fraisse and J. J. Welch, “Simulation code for Fig S2 from the distribution
    of epistasis on simple fitness landscapes.” Royal Society of London, 2020.
  ista: Fraisse C, Welch JJ. 2020. Simulation code for Fig S2 from the distribution
    of epistasis on simple fitness landscapes, Royal Society of London, <a href="https://doi.org/10.6084/m9.figshare.7957472.v1">10.6084/m9.figshare.7957472.v1</a>.
  mla: Fraisse, Christelle, and John J. Welch. <i>Simulation Code for Fig S2 from
    the Distribution of Epistasis on Simple Fitness Landscapes</i>. Royal Society
    of London, 2020, doi:<a href="https://doi.org/10.6084/m9.figshare.7957472.v1">10.6084/m9.figshare.7957472.v1</a>.
  short: C. Fraisse, J.J. Welch, (2020).
date_created: 2021-08-06T11:18:15Z
date_published: 2020-10-15T00:00:00Z
date_updated: 2025-07-10T11:53:24Z
day: '15'
department:
- _id: BeVi
- _id: NiBa
doi: 10.6084/m9.figshare.7957472.v1
main_file_link:
- open_access: '1'
  url: https://doi.org/10.6084/m9.figshare.7957472.v1
month: '10'
oa: 1
oa_version: Published Version
publisher: Royal Society of London
related_material:
  record:
  - id: '6467'
    relation: used_in_publication
    status: public
status: public
title: Simulation code for Fig S2 from the distribution of epistasis on simple fitness
  landscapes
type: research_data_reference
user_id: 0043cee0-e5fc-11ee-9736-f83bc23afbf0
year: '2020'
...
---
OA_place: publisher
OA_type: hybrid
_id: '9799'
abstract:
- lang: eng
  text: Fitness interactions between mutations can influence a population’s evolution
    in many different ways. While epistatic effects are difficult to measure precisely,
    important information is captured by the mean and variance of log fitnesses for
    individuals carrying different numbers of mutations. We derive predictions for
    these quantities from a class of simple fitness landscapes, based on models of
    optimizing selection on quantitative traits. We also explore extensions to the
    models, including modular pleiotropy, variable effect sizes, mutational bias and
    maladaptation of the wild type. We illustrate our approach by reanalysing a large
    dataset of mutant effects in a yeast snoRNA. Though characterized by some large
    epistatic effects, these data give a good overall fit to the non-epistatic null
    model, suggesting that epistasis might have limited influence on the evolutionary
    dynamics in this system. We also show how the amount of epistasis depends on both
    the underlying fitness landscape and the distribution of mutations, and so is
    expected to vary in consistent ways between new mutations, standing variation
    and fixed mutations.
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: John J.
  full_name: Welch, John J.
  last_name: Welch
citation:
  ama: Fraisse C, Welch JJ. Simulation code for Fig S1 from the distribution of epistasis
    on simple fitness landscapes. 2020. doi:<a href="https://doi.org/10.6084/m9.figshare.7957469.v1">10.6084/m9.figshare.7957469.v1</a>
  apa: Fraisse, C., &#38; Welch, J. J. (2020). Simulation code for Fig S1 from the
    distribution of epistasis on simple fitness landscapes. Royal Society of London.
    <a href="https://doi.org/10.6084/m9.figshare.7957469.v1">https://doi.org/10.6084/m9.figshare.7957469.v1</a>
  chicago: Fraisse, Christelle, and John J. Welch. “Simulation Code for Fig S1 from
    the Distribution of Epistasis on Simple Fitness Landscapes.” Royal Society of
    London, 2020. <a href="https://doi.org/10.6084/m9.figshare.7957469.v1">https://doi.org/10.6084/m9.figshare.7957469.v1</a>.
  ieee: C. Fraisse and J. J. Welch, “Simulation code for Fig S1 from the distribution
    of epistasis on simple fitness landscapes.” Royal Society of London, 2020.
  ista: Fraisse C, Welch JJ. 2020. Simulation code for Fig S1 from the distribution
    of epistasis on simple fitness landscapes, Royal Society of London, <a href="https://doi.org/10.6084/m9.figshare.7957469.v1">10.6084/m9.figshare.7957469.v1</a>.
  mla: Fraisse, Christelle, and John J. Welch. <i>Simulation Code for Fig S1 from
    the Distribution of Epistasis on Simple Fitness Landscapes</i>. Royal Society
    of London, 2020, doi:<a href="https://doi.org/10.6084/m9.figshare.7957469.v1">10.6084/m9.figshare.7957469.v1</a>.
  short: C. Fraisse, J.J. Welch, (2020).
date_created: 2021-08-06T11:26:57Z
date_published: 2020-10-15T00:00:00Z
date_updated: 2025-07-10T11:53:23Z
day: '15'
department:
- _id: BeVi
- _id: NiBa
doi: 10.6084/m9.figshare.7957469.v1
main_file_link:
- open_access: '1'
  url: https://doi.org/10.6084/m9.figshare.7957469.v1
month: '10'
oa: 1
oa_version: Published Version
publisher: Royal Society of London
related_material:
  record:
  - id: '6467'
    relation: used_in_publication
    status: public
status: public
title: Simulation code for Fig S1 from the distribution of epistasis on simple fitness
  landscapes
type: research_data_reference
user_id: 0043cee0-e5fc-11ee-9736-f83bc23afbf0
year: '2020'
...
---
OA_place: publisher
OA_type: hybrid
_id: '9814'
abstract:
- lang: eng
  text: Data and mathematica notebooks for plotting figures from Language learning
    with communication between learners
article_processing_charge: No
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. Data and mathematica notebooks
    for plotting figures from language learning with communication between learners
    from language acquisition with communication between learners. 2020. doi:<a href="https://doi.org/10.6084/m9.figshare.5973013.v1">10.6084/m9.figshare.5973013.v1</a>
  apa: Ibsen-Jensen, R., Tkadlec, J., Chatterjee, K., &#38; Nowak, M. (2020). Data
    and mathematica notebooks for plotting figures from language learning with communication
    between learners from language acquisition with communication between learners.
    Royal Society. <a href="https://doi.org/10.6084/m9.figshare.5973013.v1">https://doi.org/10.6084/m9.figshare.5973013.v1</a>
  chicago: Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin
    Nowak. “Data and Mathematica Notebooks for Plotting Figures from Language Learning
    with Communication between Learners from Language Acquisition with Communication
    between Learners.” Royal Society, 2020. <a href="https://doi.org/10.6084/m9.figshare.5973013.v1">https://doi.org/10.6084/m9.figshare.5973013.v1</a>.
  ieee: R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Data and mathematica
    notebooks for plotting figures from language learning with communication between
    learners from language acquisition with communication between learners.” Royal
    Society, 2020.
  ista: Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. 2020. Data and mathematica
    notebooks for plotting figures from language learning with communication between
    learners from language acquisition with communication between learners, Royal
    Society, <a href="https://doi.org/10.6084/m9.figshare.5973013.v1">10.6084/m9.figshare.5973013.v1</a>.
  mla: Ibsen-Jensen, Rasmus, et al. <i>Data and Mathematica Notebooks for Plotting
    Figures from Language Learning with Communication between Learners from Language
    Acquisition with Communication between Learners</i>. Royal Society, 2020, doi:<a
    href="https://doi.org/10.6084/m9.figshare.5973013.v1">10.6084/m9.figshare.5973013.v1</a>.
  short: R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, (2020).
date_created: 2021-08-06T13:09:57Z
date_published: 2020-10-15T00:00:00Z
date_updated: 2025-04-15T08:12:20Z
day: '15'
department:
- _id: KrCh
doi: 10.6084/m9.figshare.5973013.v1
main_file_link:
- open_access: '1'
  url: https://doi.org/10.6084/m9.figshare.5973013.v1
month: '10'
oa: 1
oa_version: Published Version
publisher: Royal Society
related_material:
  record:
  - id: '198'
    relation: used_in_publication
    status: public
status: public
title: Data and mathematica notebooks for plotting figures from language learning
  with communication between learners from language acquisition with communication
  between learners
type: research_data_reference
user_id: 0043cee0-e5fc-11ee-9736-f83bc23afbf0
year: '2020'
...
---
_id: '5681'
abstract:
- lang: eng
  text: 'We introduce dynamically warping grids for adaptive liquid simulation. Our
    primary contributions are a strategy for dynamically deforming regular grids over
    the course of a simulation and a method for efficiently utilizing these deforming
    grids for liquid simulation. Prior work has shown that unstructured grids are
    very effective for adaptive fluid simulations. However, unstructured grids often
    lead to complicated implementations and a poor cache hit rate due to inconsistent
    memory access. Regular grids, on the other hand, provide a fast, fixed memory
    access pattern and straightforward implementation. Our method combines the advantages
    of both: we leverage the simplicity of regular grids while still achieving practical
    and controllable spatial adaptivity. We demonstrate that our method enables adaptive
    simulations that are fast, flexible, and robust to null-space issues. At the same
    time, our method is simple to implement and takes advantage of existing highly-tuned
    algorithms.'
acknowledged_ssus:
- _id: ScienComp
acknowledgement: This work was partially supported by JSPS Grant-in-Aid forYoung Scientists
  (Start-up) 16H07410, the ERC StartingGrantsrealFlow(StG-2015-637014) andBigSplash(StG-2014-638176).
  This research was supported by the Scientific Ser-vice Units (SSU) of IST Austria
  through resources providedby Scientific Computing. We would like to express my grati-tude
  to Nobuyuki Umetani and Tomas Skrivan for insight-ful discussion.
article_processing_charge: No
article_type: original
author:
- first_name: Ibayashi
  full_name: Hikaru, Ibayashi
  last_name: Hikaru
- 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: Hikaru I, Wojtan C, Thuerey N, Igarashi T, Ando R. Simulating liquids on dynamically
    warping grids. <i>IEEE Transactions on Visualization and Computer Graphics</i>.
    2020;26(6):2288-2302. doi:<a href="https://doi.org/10.1109/TVCG.2018.2883628">10.1109/TVCG.2018.2883628</a>
  apa: Hikaru, I., Wojtan, C., Thuerey, N., Igarashi, T., &#38; Ando, R. (2020). Simulating
    liquids on dynamically warping grids. <i>IEEE Transactions on Visualization and
    Computer Graphics</i>. IEEE. <a href="https://doi.org/10.1109/TVCG.2018.2883628">https://doi.org/10.1109/TVCG.2018.2883628</a>
  chicago: Hikaru, Ibayashi, Chris Wojtan, Nils Thuerey, Takeo Igarashi, and Ryoichi
    Ando. “Simulating Liquids on Dynamically Warping Grids.” <i>IEEE Transactions
    on Visualization and Computer Graphics</i>. IEEE, 2020. <a href="https://doi.org/10.1109/TVCG.2018.2883628">https://doi.org/10.1109/TVCG.2018.2883628</a>.
  ieee: I. Hikaru, C. Wojtan, N. Thuerey, T. Igarashi, and R. Ando, “Simulating liquids
    on dynamically warping grids,” <i>IEEE Transactions on Visualization and Computer
    Graphics</i>, vol. 26, no. 6. IEEE, pp. 2288–2302, 2020.
  ista: Hikaru I, Wojtan C, Thuerey N, Igarashi T, Ando R. 2020. Simulating liquids
    on dynamically warping grids. IEEE Transactions on Visualization and Computer
    Graphics. 26(6), 2288–2302.
  mla: Hikaru, Ibayashi, et al. “Simulating Liquids on Dynamically Warping Grids.”
    <i>IEEE Transactions on Visualization and Computer Graphics</i>, vol. 26, no.
    6, IEEE, 2020, pp. 2288–302, doi:<a href="https://doi.org/10.1109/TVCG.2018.2883628">10.1109/TVCG.2018.2883628</a>.
  short: I. Hikaru, C. Wojtan, N. Thuerey, T. Igarashi, R. Ando, IEEE Transactions
    on Visualization and Computer Graphics 26 (2020) 2288–2302.
date_created: 2018-12-16T22:59:21Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2025-07-10T11:52:55Z
day: '01'
ddc:
- '006'
department:
- _id: ChWo
doi: 10.1109/TVCG.2018.2883628
external_id:
  isi:
  - '000532295600014'
  pmid:
  - '30507534'
file:
- access_level: open_access
  checksum: 8d4c55443a0ee335bb5bb652de503042
  content_type: application/pdf
  creator: wojtan
  date_created: 2020-10-08T08:34:53Z
  date_updated: 2020-10-08T08:34:53Z
  file_id: '8626'
  file_name: preprint.pdf
  file_size: 21910098
  relation: main_file
  success: 1
file_date_updated: 2020-10-08T08:34:53Z
has_accepted_license: '1'
intvolume: '        26'
isi: 1
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 2288-2302
pmid: 1
publication: IEEE Transactions on Visualization and Computer Graphics
publication_identifier:
  eissn:
  - 1941-0506
  issn:
  - 1077-2626
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Simulating liquids on dynamically warping grids
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 26
year: '2020'
...
---
_id: '6358'
abstract:
- lang: eng
  text: We study dynamical optimal transport metrics between density matricesassociated
    to symmetric Dirichlet forms on finite-dimensional C∗-algebras.  Our settingcovers  arbitrary  skew-derivations  and  it  provides  a  unified  framework  that  simultaneously  generalizes  recently  constructed  transport  metrics  for  Markov  chains,  Lindblad  equations,  and  the  Fermi  Ornstein–Uhlenbeck  semigroup.   We  develop  a  non-nommutative
    differential calculus that allows us to obtain non-commutative Ricci curvature  bounds,  logarithmic  Sobolev  inequalities,  transport-entropy  inequalities,  andspectral
    gap estimates.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Eric A.
  full_name: Carlen, Eric A.
  last_name: Carlen
- first_name: Jan
  full_name: Maas, Jan
  id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
  last_name: Maas
  orcid: 0000-0002-0845-1338
citation:
  ama: Carlen EA, Maas J. Non-commutative calculus, optimal transport and functional
    inequalities  in dissipative quantum systems. <i>Journal of Statistical Physics</i>.
    2020;178(2):319-378. doi:<a href="https://doi.org/10.1007/s10955-019-02434-w">10.1007/s10955-019-02434-w</a>
  apa: Carlen, E. A., &#38; Maas, J. (2020). Non-commutative calculus, optimal transport
    and functional inequalities  in dissipative quantum systems. <i>Journal of Statistical
    Physics</i>. Springer Nature. <a href="https://doi.org/10.1007/s10955-019-02434-w">https://doi.org/10.1007/s10955-019-02434-w</a>
  chicago: Carlen, Eric A., and Jan Maas. “Non-Commutative Calculus, Optimal Transport
    and Functional Inequalities  in Dissipative Quantum Systems.” <i>Journal of Statistical
    Physics</i>. Springer Nature, 2020. <a href="https://doi.org/10.1007/s10955-019-02434-w">https://doi.org/10.1007/s10955-019-02434-w</a>.
  ieee: E. A. Carlen and J. Maas, “Non-commutative calculus, optimal transport and
    functional inequalities  in dissipative quantum systems,” <i>Journal of Statistical
    Physics</i>, vol. 178, no. 2. Springer Nature, pp. 319–378, 2020.
  ista: Carlen EA, Maas J. 2020. Non-commutative calculus, optimal transport and functional
    inequalities  in dissipative quantum systems. Journal of Statistical Physics.
    178(2), 319–378.
  mla: Carlen, Eric A., and Jan Maas. “Non-Commutative Calculus, Optimal Transport
    and Functional Inequalities  in Dissipative Quantum Systems.” <i>Journal of Statistical
    Physics</i>, vol. 178, no. 2, Springer Nature, 2020, pp. 319–78, doi:<a href="https://doi.org/10.1007/s10955-019-02434-w">10.1007/s10955-019-02434-w</a>.
  short: E.A. Carlen, J. Maas, Journal of Statistical Physics 178 (2020) 319–378.
corr_author: '1'
date_created: 2019-04-30T07:34:18Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2025-06-12T07:27:20Z
day: '01'
ddc:
- '500'
department:
- _id: JaMa
doi: 10.1007/s10955-019-02434-w
ec_funded: 1
external_id:
  arxiv:
  - '1811.04572'
  isi:
  - '000498933300001'
  pmid:
  - '33223567'
file:
- access_level: open_access
  checksum: 7b04befbdc0d4982c0ee945d25d19872
  content_type: application/pdf
  creator: dernst
  date_created: 2019-12-23T12:03:09Z
  date_updated: 2020-07-14T12:47:28Z
  file_id: '7209'
  file_name: 2019_JourStatistPhysics_Carlen.pdf
  file_size: 905538
  relation: main_file
file_date_updated: 2020-07-14T12:47:28Z
has_accepted_license: '1'
intvolume: '       178'
isi: 1
issue: '2'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 319-378
pmid: 1
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
  name: IST Austria Open Access Fund
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '716117'
  name: Optimal Transport and Stochastic Dynamics
- _id: 260482E2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: F06504
  name: Taming Complexity in Partial Differential Systems
publication: Journal of Statistical Physics
publication_identifier:
  eissn:
  - 1572-9613
  issn:
  - 0022-4715
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  link:
  - relation: erratum
    url: https://doi.org/10.1007/s10955-020-02671-4
scopus_import: '1'
status: public
title: Non-commutative calculus, optimal transport and functional inequalities  in
  dissipative quantum systems
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: 178
year: '2020'
...
---
_id: '6359'
abstract:
- lang: eng
  text: The strong rate of convergence of the Euler-Maruyama scheme for nondegenerate
    SDEs with irregular drift coefficients is considered. In the case of α-Hölder
    drift in the recent literature the rate α/2 was proved in many related situations.
    By exploiting the regularising effect of the noise more efficiently, we show that
    the rate is in fact arbitrarily close to 1/2 for all α>0. The result extends to
    Dini continuous coefficients, while in d=1 also to all bounded measurable coefficients.
article_number: '82'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Konstantinos
  full_name: Dareiotis, Konstantinos
  last_name: Dareiotis
- first_name: Mate
  full_name: Gerencser, Mate
  id: 44ECEDF2-F248-11E8-B48F-1D18A9856A87
  last_name: Gerencser
citation:
  ama: Dareiotis K, Gerencser M. On the regularisation of the noise for the Euler-Maruyama
    scheme with irregular drift. <i>Electronic Journal of Probability</i>. 2020;25.
    doi:<a href="https://doi.org/10.1214/20-EJP479">10.1214/20-EJP479</a>
  apa: Dareiotis, K., &#38; Gerencser, M. (2020). On the regularisation of the noise
    for the Euler-Maruyama scheme with irregular drift. <i>Electronic Journal of Probability</i>.
    Institute of Mathematical Statistics. <a href="https://doi.org/10.1214/20-EJP479">https://doi.org/10.1214/20-EJP479</a>
  chicago: Dareiotis, Konstantinos, and Mate Gerencser. “On the Regularisation of
    the Noise for the Euler-Maruyama Scheme with Irregular Drift.” <i>Electronic Journal
    of Probability</i>. Institute of Mathematical Statistics, 2020. <a href="https://doi.org/10.1214/20-EJP479">https://doi.org/10.1214/20-EJP479</a>.
  ieee: K. Dareiotis and M. Gerencser, “On the regularisation of the noise for the
    Euler-Maruyama scheme with irregular drift,” <i>Electronic Journal of Probability</i>,
    vol. 25. Institute of Mathematical Statistics, 2020.
  ista: Dareiotis K, Gerencser M. 2020. On the regularisation of the noise for the
    Euler-Maruyama scheme with irregular drift. Electronic Journal of Probability.
    25, 82.
  mla: Dareiotis, Konstantinos, and Mate Gerencser. “On the Regularisation of the
    Noise for the Euler-Maruyama Scheme with Irregular Drift.” <i>Electronic Journal
    of Probability</i>, vol. 25, 82, Institute of Mathematical Statistics, 2020, doi:<a
    href="https://doi.org/10.1214/20-EJP479">10.1214/20-EJP479</a>.
  short: K. Dareiotis, M. Gerencser, Electronic Journal of Probability 25 (2020).
date_created: 2019-04-30T07:40:17Z
date_published: 2020-07-16T00:00:00Z
date_updated: 2023-10-16T09:22:50Z
day: '16'
ddc:
- '510'
department:
- _id: JaMa
doi: 10.1214/20-EJP479
external_id:
  arxiv:
  - '1812.04583'
  isi:
  - '000550150700001'
file:
- access_level: open_access
  checksum: 8e7c42e72596f6889d786e8e8b89994f
  content_type: application/pdf
  creator: dernst
  date_created: 2020-09-21T13:15:02Z
  date_updated: 2020-09-21T13:15:02Z
  file_id: '8549'
  file_name: 2020_EJournProbab_Dareiotis.pdf
  file_size: 273042
  relation: main_file
  success: 1
file_date_updated: 2020-09-21T13:15:02Z
has_accepted_license: '1'
intvolume: '        25'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: Electronic Journal of Probability
publication_identifier:
  eissn:
  - 1083-6489
publication_status: published
publisher: Institute of Mathematical Statistics
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the regularisation of the noise for the Euler-Maruyama scheme with irregular
  drift
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: 25
year: '2020'
...
---
_id: '6488'
abstract:
- lang: eng
  text: We prove a central limit theorem for the difference of linear eigenvalue statistics
    of a sample covariance matrix W˜ and its minor W. We find that the fluctuation
    of this difference is much smaller than those of the individual linear statistics,
    as a consequence of the strong correlation between the eigenvalues of W˜ and W.
    Our result identifies the fluctuation of the spatial derivative of the approximate
    Gaussian field in the recent paper by Dumitru and Paquette. Unlike in a similar
    result for Wigner matrices, for sample covariance matrices, the fluctuation may
    entirely vanish.
article_number: '2050006'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Giorgio
  full_name: Cipolloni, Giorgio
  id: 42198EFA-F248-11E8-B48F-1D18A9856A87
  last_name: Cipolloni
  orcid: 0000-0002-4901-7992
- first_name: László
  full_name: Erdös, László
  id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
  last_name: Erdös
  orcid: 0000-0001-5366-9603
citation:
  ama: 'Cipolloni G, Erdös L. Fluctuations for differences of linear eigenvalue statistics
    for sample covariance matrices. <i>Random Matrices: Theory and Application</i>.
    2020;9(3). doi:<a href="https://doi.org/10.1142/S2010326320500069">10.1142/S2010326320500069</a>'
  apa: 'Cipolloni, G., &#38; Erdös, L. (2020). Fluctuations for differences of linear
    eigenvalue statistics for sample covariance matrices. <i>Random Matrices: Theory
    and Application</i>. World Scientific Publishing. <a href="https://doi.org/10.1142/S2010326320500069">https://doi.org/10.1142/S2010326320500069</a>'
  chicago: 'Cipolloni, Giorgio, and László Erdös. “Fluctuations for Differences of
    Linear Eigenvalue Statistics for Sample Covariance Matrices.” <i>Random Matrices:
    Theory and Application</i>. World Scientific Publishing, 2020. <a href="https://doi.org/10.1142/S2010326320500069">https://doi.org/10.1142/S2010326320500069</a>.'
  ieee: 'G. Cipolloni and L. Erdös, “Fluctuations for differences of linear eigenvalue
    statistics for sample covariance matrices,” <i>Random Matrices: Theory and Application</i>,
    vol. 9, no. 3. World Scientific Publishing, 2020.'
  ista: 'Cipolloni G, Erdös L. 2020. Fluctuations for differences of linear eigenvalue
    statistics for sample covariance matrices. Random Matrices: Theory and Application.
    9(3), 2050006.'
  mla: 'Cipolloni, Giorgio, and László Erdös. “Fluctuations for Differences of Linear
    Eigenvalue Statistics for Sample Covariance Matrices.” <i>Random Matrices: Theory
    and Application</i>, vol. 9, no. 3, 2050006, World Scientific Publishing, 2020,
    doi:<a href="https://doi.org/10.1142/S2010326320500069">10.1142/S2010326320500069</a>.'
  short: 'G. Cipolloni, L. Erdös, Random Matrices: Theory and Application 9 (2020).'
date_created: 2019-05-26T21:59:14Z
date_published: 2020-07-01T00:00:00Z
date_updated: 2025-07-10T11:53:26Z
day: '01'
department:
- _id: LaEr
doi: 10.1142/S2010326320500069
ec_funded: 1
external_id:
  arxiv:
  - '1806.08751'
  isi:
  - '000547464400001'
intvolume: '         9'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1806.08751
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '338804'
  name: Random matrices, universality and disordered quantum systems
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '665385'
  name: International IST Doctoral Program
publication: 'Random Matrices: Theory and Application'
publication_identifier:
  eissn:
  - 2010-3271
  issn:
  - 2010-3263
publication_status: published
publisher: World Scientific Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fluctuations for differences of linear eigenvalue statistics for sample covariance
  matrices
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2020'
...
---
_id: '6563'
abstract:
- lang: eng
  text: "This paper presents two algorithms. The first decides the existence of a
    pointed homotopy between given simplicial maps \U0001D453,\U0001D454:\U0001D44B→\U0001D44C,
    and the second computes the group [\U0001D6F4\U0001D44B,\U0001D44C]∗ of pointed
    homotopy classes of maps from a suspension; in both cases, the target Y is assumed
    simply connected. More generally, these algorithms work relative to \U0001D434⊆\U0001D44B."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Marek
  full_name: Filakovský, Marek
  id: 3E8AF77E-F248-11E8-B48F-1D18A9856A87
  last_name: Filakovský
- first_name: Lukas
  full_name: Vokřínek, Lukas
  last_name: Vokřínek
citation:
  ama: Filakovský M, Vokřínek L. Are two given maps homotopic? An algorithmic viewpoint.
    <i>Foundations of Computational Mathematics</i>. 2020;20:311-330. doi:<a href="https://doi.org/10.1007/s10208-019-09419-x">10.1007/s10208-019-09419-x</a>
  apa: Filakovský, M., &#38; Vokřínek, L. (2020). Are two given maps homotopic? An
    algorithmic viewpoint. <i>Foundations of Computational Mathematics</i>. Springer
    Nature. <a href="https://doi.org/10.1007/s10208-019-09419-x">https://doi.org/10.1007/s10208-019-09419-x</a>
  chicago: Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An
    Algorithmic Viewpoint.” <i>Foundations of Computational Mathematics</i>. Springer
    Nature, 2020. <a href="https://doi.org/10.1007/s10208-019-09419-x">https://doi.org/10.1007/s10208-019-09419-x</a>.
  ieee: M. Filakovský and L. Vokřínek, “Are two given maps homotopic? An algorithmic
    viewpoint,” <i>Foundations of Computational Mathematics</i>, vol. 20. Springer
    Nature, pp. 311–330, 2020.
  ista: Filakovský M, Vokřínek L. 2020. Are two given maps homotopic? An algorithmic
    viewpoint. Foundations of Computational Mathematics. 20, 311–330.
  mla: Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic
    Viewpoint.” <i>Foundations of Computational Mathematics</i>, vol. 20, Springer
    Nature, 2020, pp. 311–30, doi:<a href="https://doi.org/10.1007/s10208-019-09419-x">10.1007/s10208-019-09419-x</a>.
  short: M. Filakovský, L. Vokřínek, Foundations of Computational Mathematics 20 (2020)
    311–330.
date_created: 2019-06-16T21:59:14Z
date_published: 2020-04-01T00:00:00Z
date_updated: 2025-07-10T11:53:32Z
day: '01'
department:
- _id: UlWa
doi: 10.1007/s10208-019-09419-x
external_id:
  arxiv:
  - '1312.2337'
  isi:
  - '000522437400004'
intvolume: '        20'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1312.2337
month: '04'
oa: 1
oa_version: Preprint
page: 311-330
project:
- _id: 26611F5C-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P31312
  name: Algorithms for Embeddings and Homotopy Theory
publication: Foundations of Computational Mathematics
publication_identifier:
  eissn:
  - 1615-3383
  issn:
  - 1615-3375
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Are two given maps homotopic? An algorithmic viewpoint
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 20
year: '2020'
...
---
_id: '6593'
abstract:
- lang: eng
  text: 'We consider the monotone variational inequality problem in a Hilbert space
    and describe a projection-type method with inertial terms under the following
    properties: (a) The method generates a strongly convergent iteration sequence;
    (b) The method requires, at each iteration, only one projection onto the feasible
    set and two evaluations of the operator; (c) The method is designed for variational
    inequality for which the underline operator is monotone and uniformly continuous;
    (d) The method includes an inertial term. The latter is also shown to speed up
    the convergence in our numerical results. A comparison with some related methods
    is given and indicates that the new method is promising.'
acknowledgement: The research of this author is supported by the ERC grant at the
  IST.
article_processing_charge: No
article_type: original
author:
- first_name: Yekini
  full_name: Shehu, Yekini
  id: 3FC7CB58-F248-11E8-B48F-1D18A9856A87
  last_name: Shehu
  orcid: 0000-0001-9224-7139
- first_name: Xiao-Huan
  full_name: Li, Xiao-Huan
  last_name: Li
- first_name: Qiao-Li
  full_name: Dong, Qiao-Li
  last_name: Dong
citation:
  ama: Shehu Y, Li X-H, Dong Q-L. An efficient projection-type method for monotone
    variational inequalities in Hilbert spaces. <i>Numerical Algorithms</i>. 2020;84:365-388.
    doi:<a href="https://doi.org/10.1007/s11075-019-00758-y">10.1007/s11075-019-00758-y</a>
  apa: Shehu, Y., Li, X.-H., &#38; Dong, Q.-L. (2020). An efficient projection-type
    method for monotone variational inequalities in Hilbert spaces. <i>Numerical Algorithms</i>.
    Springer Nature. <a href="https://doi.org/10.1007/s11075-019-00758-y">https://doi.org/10.1007/s11075-019-00758-y</a>
  chicago: Shehu, Yekini, Xiao-Huan Li, and Qiao-Li Dong. “An Efficient Projection-Type
    Method for Monotone Variational Inequalities in Hilbert Spaces.” <i>Numerical
    Algorithms</i>. Springer Nature, 2020. <a href="https://doi.org/10.1007/s11075-019-00758-y">https://doi.org/10.1007/s11075-019-00758-y</a>.
  ieee: Y. Shehu, X.-H. Li, and Q.-L. Dong, “An efficient projection-type method for
    monotone variational inequalities in Hilbert spaces,” <i>Numerical Algorithms</i>,
    vol. 84. Springer Nature, pp. 365–388, 2020.
  ista: Shehu Y, Li X-H, Dong Q-L. 2020. An efficient projection-type method for monotone
    variational inequalities in Hilbert spaces. Numerical Algorithms. 84, 365–388.
  mla: Shehu, Yekini, et al. “An Efficient Projection-Type Method for Monotone Variational
    Inequalities in Hilbert Spaces.” <i>Numerical Algorithms</i>, vol. 84, Springer
    Nature, 2020, pp. 365–88, doi:<a href="https://doi.org/10.1007/s11075-019-00758-y">10.1007/s11075-019-00758-y</a>.
  short: Y. Shehu, X.-H. Li, Q.-L. Dong, Numerical Algorithms 84 (2020) 365–388.
corr_author: '1'
date_created: 2019-06-27T20:09:33Z
date_published: 2020-05-01T00:00:00Z
date_updated: 2024-11-04T13:52:40Z
day: '01'
ddc:
- '000'
department:
- _id: VlKo
doi: 10.1007/s11075-019-00758-y
ec_funded: 1
external_id:
  isi:
  - '000528979000015'
file:
- access_level: open_access
  checksum: bb1a1eb3ebb2df380863d0db594673ba
  content_type: application/pdf
  creator: kschuh
  date_created: 2019-10-01T13:14:10Z
  date_updated: 2020-07-14T12:47:34Z
  file_id: '6927'
  file_name: ExtragradientMethodPaper.pdf
  file_size: 359654
  relation: main_file
file_date_updated: 2020-07-14T12:47:34Z
has_accepted_license: '1'
intvolume: '        84'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 365-388
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '616160'
  name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: Numerical Algorithms
publication_identifier:
  eissn:
  - 1572-9265
  issn:
  - 1017-1398
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: An efficient projection-type method for monotone variational inequalities in
  Hilbert spaces
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 84
year: '2020'
...
---
_id: '6748'
abstract:
- lang: eng
  text: "Fitting a function by using linear combinations of a large number N of `simple'
    components is one of the most fruitful ideas in statistical learning. This idea
    lies at the core of a variety of methods, from two-layer neural networks to kernel
    regression, to boosting. In general, the resulting risk minimization problem is
    non-convex and is solved by gradient descent or its variants. Unfortunately, little
    is known about global convergence properties of these approaches.\r\nHere we consider
    the problem of learning a concave function f on a compact convex domain Ω⊆ℝd,
    using linear combinations of `bump-like' components (neurons). The parameters
    to be fitted are the centers of N bumps, and the resulting empirical risk minimization
    problem is highly non-convex. We prove that, in the limit in which the number
    of neurons diverges, the evolution of gradient descent converges to a Wasserstein
    gradient flow in the space of probability distributions over Ω. Further, when
    the bump width δ tends to 0, this gradient flow has a limit which is a viscous
    porous medium equation. Remarkably, the cost function optimized by this gradient
    flow exhibits a special property known as displacement convexity, which implies
    exponential convergence rates for N→∞, δ→0. Surprisingly, this asymptotic theory
    appears to capture well the behavior for moderate values of δ,N. Explaining this
    phenomenon, and understanding the dependence on δ,N in a quantitative manner remains
    an outstanding challenge."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Adel
  full_name: Javanmard, Adel
  last_name: Javanmard
- first_name: Marco
  full_name: Mondelli, Marco
  id: 27EB676C-8706-11E9-9510-7717E6697425
  last_name: Mondelli
  orcid: 0000-0002-3242-7020
- first_name: Andrea
  full_name: Montanari, Andrea
  last_name: Montanari
citation:
  ama: Javanmard A, Mondelli M, Montanari A. Analysis of a two-layer neural network
    via displacement convexity. <i>Annals of Statistics</i>. 2020;48(6):3619-3642.
    doi:<a href="https://doi.org/10.1214/20-AOS1945">10.1214/20-AOS1945</a>
  apa: Javanmard, A., Mondelli, M., &#38; Montanari, A. (2020). Analysis of a two-layer
    neural network via displacement convexity. <i>Annals of Statistics</i>. Institute
    of Mathematical Statistics. <a href="https://doi.org/10.1214/20-AOS1945">https://doi.org/10.1214/20-AOS1945</a>
  chicago: Javanmard, Adel, Marco Mondelli, and Andrea Montanari. “Analysis of a Two-Layer
    Neural Network via Displacement Convexity.” <i>Annals of Statistics</i>. Institute
    of Mathematical Statistics, 2020. <a href="https://doi.org/10.1214/20-AOS1945">https://doi.org/10.1214/20-AOS1945</a>.
  ieee: A. Javanmard, M. Mondelli, and A. Montanari, “Analysis of a two-layer neural
    network via displacement convexity,” <i>Annals of Statistics</i>, vol. 48, no.
    6. Institute of Mathematical Statistics, pp. 3619–3642, 2020.
  ista: Javanmard A, Mondelli M, Montanari A. 2020. Analysis of a two-layer neural
    network via displacement convexity. Annals of Statistics. 48(6), 3619–3642.
  mla: Javanmard, Adel, et al. “Analysis of a Two-Layer Neural Network via Displacement
    Convexity.” <i>Annals of Statistics</i>, vol. 48, no. 6, Institute of Mathematical
    Statistics, 2020, pp. 3619–42, doi:<a href="https://doi.org/10.1214/20-AOS1945">10.1214/20-AOS1945</a>.
  short: A. Javanmard, M. Mondelli, A. Montanari, Annals of Statistics 48 (2020) 3619–3642.
date_created: 2019-07-31T09:39:42Z
date_published: 2020-12-11T00:00:00Z
date_updated: 2024-10-21T06:02:33Z
day: '11'
department:
- _id: MaMo
doi: 10.1214/20-AOS1945
external_id:
  arxiv:
  - '1901.01375'
  isi:
  - '000598369200021'
intvolume: '        48'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1901.01375
month: '12'
oa: 1
oa_version: Preprint
page: 3619-3642
publication: Annals of Statistics
publication_identifier:
  eissn:
  - 1941-7330
  issn:
  - 1932-6157
publication_status: published
publisher: Institute of Mathematical Statistics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Analysis of a two-layer neural network via displacement convexity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 48
year: '2020'
...
---
_id: '6796'
abstract:
- lang: eng
  text: Nearby grid cells have been observed to express a remarkable degree of long-rangeorder,
    which is often idealized as extending potentially to infinity. Yet their strict
    peri-odic firing and ensemble coherence are theoretically possible only in flat
    environments, much unlike the burrows which rodents usually live in. Are the symmetrical,
    coherent grid maps inferred in the lab relevant to chart their way in their natural
    habitat? We consider spheres as simple models of curved environments and waiting
    for the appropriate experiments to be performed, we use our adaptation model to
    predict what grid maps would emerge in a network with the same type of recurrent
    connections, which on the plane produce coherence among the units. We find that
    on the sphere such connections distort the maps that single grid units would express
    on their own, and aggregate them into clusters. When remapping to a different
    spherical environment, units in each cluster maintain only partial coherence,
    similar to what is observed in disordered materials, such as spin glasses.
article_processing_charge: No
article_type: original
author:
- first_name: Federico
  full_name: Stella, Federico
  id: 39AF1E74-F248-11E8-B48F-1D18A9856A87
  last_name: Stella
  orcid: 0000-0001-9439-3148
- first_name: Eugenio
  full_name: Urdapilleta, Eugenio
  last_name: Urdapilleta
- first_name: Yifan
  full_name: Luo, Yifan
  last_name: Luo
- first_name: Alessandro
  full_name: Treves, Alessandro
  last_name: Treves
citation:
  ama: Stella F, Urdapilleta E, Luo Y, Treves A. Partial coherence and frustration
    in self-organizing spherical grids. <i>Hippocampus</i>. 2020;30(4):302-313. doi:<a
    href="https://doi.org/10.1002/hipo.23144">10.1002/hipo.23144</a>
  apa: Stella, F., Urdapilleta, E., Luo, Y., &#38; Treves, A. (2020). Partial coherence
    and frustration in self-organizing spherical grids. <i>Hippocampus</i>. Wiley.
    <a href="https://doi.org/10.1002/hipo.23144">https://doi.org/10.1002/hipo.23144</a>
  chicago: Stella, Federico, Eugenio Urdapilleta, Yifan Luo, and Alessandro Treves.
    “Partial Coherence and Frustration in Self-Organizing Spherical Grids.” <i>Hippocampus</i>.
    Wiley, 2020. <a href="https://doi.org/10.1002/hipo.23144">https://doi.org/10.1002/hipo.23144</a>.
  ieee: F. Stella, E. Urdapilleta, Y. Luo, and A. Treves, “Partial coherence and frustration
    in self-organizing spherical grids,” <i>Hippocampus</i>, vol. 30, no. 4. Wiley,
    pp. 302–313, 2020.
  ista: Stella F, Urdapilleta E, Luo Y, Treves A. 2020. Partial coherence and frustration
    in self-organizing spherical grids. Hippocampus. 30(4), 302–313.
  mla: Stella, Federico, et al. “Partial Coherence and Frustration in Self-Organizing
    Spherical Grids.” <i>Hippocampus</i>, vol. 30, no. 4, Wiley, 2020, pp. 302–13,
    doi:<a href="https://doi.org/10.1002/hipo.23144">10.1002/hipo.23144</a>.
  short: F. Stella, E. Urdapilleta, Y. Luo, A. Treves, Hippocampus 30 (2020) 302–313.
date_created: 2019-08-11T21:59:24Z
date_published: 2020-04-01T00:00:00Z
date_updated: 2025-05-22T11:13:25Z
day: '01'
ddc:
- '570'
department:
- _id: JoCs
doi: 10.1002/hipo.23144
external_id:
  isi:
  - '000477299600001'
  pmid:
  - '31339190'
file:
- access_level: open_access
  checksum: 7b54d22bfbfc0d1188a9ea24d985bfb2
  content_type: application/pdf
  creator: dernst
  date_created: 2019-08-12T07:53:33Z
  date_updated: 2020-07-14T12:47:40Z
  file_id: '6800'
  file_name: 2019_Hippocampus_Stella.pdf
  file_size: 2370658
  relation: main_file
file_date_updated: 2020-07-14T12:47:40Z
has_accepted_license: '1'
intvolume: '        30'
isi: 1
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 302-313
pmid: 1
publication: Hippocampus
publication_identifier:
  eissn:
  - 1098-1063
  issn:
  - 1050-9631
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Partial coherence and frustration in self-organizing spherical grids
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: 9947682f-b9fa-11ee-9c4a-b3ffaafe6614
volume: 30
year: '2020'
...
---
_id: '6808'
abstract:
- lang: eng
  text: Super-resolution fluorescence microscopy has become an important catalyst
    for discovery in the life sciences. In STimulated Emission Depletion (STED) microscopy,
    a pattern of light drives fluorophores from a signal-emitting on-state to a non-signalling
    off-state. Only emitters residing in a sub-diffraction volume around an intensity
    minimum are allowed to fluoresce, rendering them distinguishable from the nearby,
    but dark fluorophores. STED routinely achieves resolution in the few tens of nanometers
    range in biological samples and is suitable for live imaging. Here, we review
    the working principle of STED and provide general guidelines for successful STED
    imaging. The strive for ever higher resolution comes at the cost of increased
    light burden. We discuss techniques to reduce light exposure and mitigate its
    detrimental effects on the specimen. These include specialized illumination strategies
    as well as protecting fluorophores from photobleaching mediated by high-intensity
    STED light. This opens up the prospect of volumetric imaging in living cells and
    tissues with diffraction-unlimited resolution in all three spatial dimensions.
article_processing_charge: No
article_type: original
author:
- first_name: Wiebke
  full_name: Jahr, Wiebke
  id: 425C1CE8-F248-11E8-B48F-1D18A9856A87
  last_name: Jahr
- first_name: Philipp
  full_name: Velicky, Philipp
  id: 39BDC62C-F248-11E8-B48F-1D18A9856A87
  last_name: Velicky
  orcid: 0000-0002-2340-7431
- first_name: Johann G
  full_name: Danzl, Johann G
  id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
  last_name: Danzl
  orcid: 0000-0001-8559-3973
citation:
  ama: Jahr W, Velicky P, Danzl JG. Strategies to maximize performance in STimulated
    Emission Depletion (STED) nanoscopy of biological specimens. <i>Methods</i>. 2020;174(3):27-41.
    doi:<a href="https://doi.org/10.1016/j.ymeth.2019.07.019">10.1016/j.ymeth.2019.07.019</a>
  apa: Jahr, W., Velicky, P., &#38; Danzl, J. G. (2020). Strategies to maximize performance
    in STimulated Emission Depletion (STED) nanoscopy of biological specimens. <i>Methods</i>.
    Elsevier. <a href="https://doi.org/10.1016/j.ymeth.2019.07.019">https://doi.org/10.1016/j.ymeth.2019.07.019</a>
  chicago: Jahr, Wiebke, Philipp Velicky, and Johann G Danzl. “Strategies to Maximize
    Performance in STimulated Emission Depletion (STED) Nanoscopy of Biological Specimens.”
    <i>Methods</i>. Elsevier, 2020. <a href="https://doi.org/10.1016/j.ymeth.2019.07.019">https://doi.org/10.1016/j.ymeth.2019.07.019</a>.
  ieee: W. Jahr, P. Velicky, and J. G. Danzl, “Strategies to maximize performance
    in STimulated Emission Depletion (STED) nanoscopy of biological specimens,” <i>Methods</i>,
    vol. 174, no. 3. Elsevier, pp. 27–41, 2020.
  ista: Jahr W, Velicky P, Danzl JG. 2020. Strategies to maximize performance in STimulated
    Emission Depletion (STED) nanoscopy of biological specimens. Methods. 174(3),
    27–41.
  mla: Jahr, Wiebke, et al. “Strategies to Maximize Performance in STimulated Emission
    Depletion (STED) Nanoscopy of Biological Specimens.” <i>Methods</i>, vol. 174,
    no. 3, Elsevier, 2020, pp. 27–41, doi:<a href="https://doi.org/10.1016/j.ymeth.2019.07.019">10.1016/j.ymeth.2019.07.019</a>.
  short: W. Jahr, P. Velicky, J.G. Danzl, Methods 174 (2020) 27–41.
date_created: 2019-08-12T16:36:32Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2025-04-14T09:39:25Z
day: '01'
department:
- _id: JoDa
doi: 10.1016/j.ymeth.2019.07.019
external_id:
  isi:
  - '000525860400005'
  pmid:
  - '31344404'
intvolume: '       174'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7100895/
month: '03'
oa: 1
oa_version: Submitted Version
page: 27-41
pmid: 1
project:
- _id: 265CB4D0-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: I03600
  name: Optical control of synaptic function via adhesion molecules
- _id: 2668BFA0-B435-11E9-9278-68D0E5697425
  grant_number: LT00057
  name: High-speed 3D-nanoscopy to study the role of adhesion during 3D cell migration
publication: Methods
publication_identifier:
  issn:
  - 1046-2023
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Strategies to maximize performance in STimulated Emission Depletion (STED)
  nanoscopy of biological specimens
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 174
year: '2020'
...
---
_id: '6906'
abstract:
- lang: eng
  text: We consider systems of bosons trapped in a box, in the Gross–Pitaevskii regime.
    We show that low-energy states exhibit complete Bose–Einstein condensation with
    an optimal bound on the number of orthogonal excitations. This extends recent
    results obtained in Boccato et al. (Commun Math Phys 359(3):975–1026, 2018), removing
    the assumption of small interaction potential.
acknowledgement: "We would like to thank P. T. Nam and R. Seiringer for several useful
  discussions and\r\nfor suggesting us to use the localization techniques from [9].
  C. Boccato has received funding from the\r\nEuropean Research Council (ERC) under
  the programme Horizon 2020 (Grant Agreement 694227). B. Schlein gratefully acknowledges
  support from the NCCR SwissMAP and from the Swiss National Foundation of Science
  (Grant No. 200020_1726230) through the SNF Grant “Dynamical and energetic properties
  of Bose–Einstein condensates”."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Chiara
  full_name: Boccato, Chiara
  id: 342E7E22-F248-11E8-B48F-1D18A9856A87
  last_name: Boccato
- first_name: Christian
  full_name: Brennecke, Christian
  last_name: Brennecke
- first_name: Serena
  full_name: Cenatiempo, Serena
  last_name: Cenatiempo
- first_name: Benjamin
  full_name: Schlein, Benjamin
  last_name: Schlein
citation:
  ama: Boccato C, Brennecke C, Cenatiempo S, Schlein B. Optimal rate for Bose-Einstein
    condensation in the Gross-Pitaevskii regime. <i>Communications in Mathematical
    Physics</i>. 2020;376:1311-1395. doi:<a href="https://doi.org/10.1007/s00220-019-03555-9">10.1007/s00220-019-03555-9</a>
  apa: Boccato, C., Brennecke, C., Cenatiempo, S., &#38; Schlein, B. (2020). Optimal
    rate for Bose-Einstein condensation in the Gross-Pitaevskii regime. <i>Communications
    in Mathematical Physics</i>. Springer. <a href="https://doi.org/10.1007/s00220-019-03555-9">https://doi.org/10.1007/s00220-019-03555-9</a>
  chicago: Boccato, Chiara, Christian Brennecke, Serena Cenatiempo, and Benjamin Schlein.
    “Optimal Rate for Bose-Einstein Condensation in the Gross-Pitaevskii Regime.”
    <i>Communications in Mathematical Physics</i>. Springer, 2020. <a href="https://doi.org/10.1007/s00220-019-03555-9">https://doi.org/10.1007/s00220-019-03555-9</a>.
  ieee: C. Boccato, C. Brennecke, S. Cenatiempo, and B. Schlein, “Optimal rate for
    Bose-Einstein condensation in the Gross-Pitaevskii regime,” <i>Communications
    in Mathematical Physics</i>, vol. 376. Springer, pp. 1311–1395, 2020.
  ista: Boccato C, Brennecke C, Cenatiempo S, Schlein B. 2020. Optimal rate for Bose-Einstein
    condensation in the Gross-Pitaevskii regime. Communications in Mathematical Physics.
    376, 1311–1395.
  mla: Boccato, Chiara, et al. “Optimal Rate for Bose-Einstein Condensation in the
    Gross-Pitaevskii Regime.” <i>Communications in Mathematical Physics</i>, vol.
    376, Springer, 2020, pp. 1311–95, doi:<a href="https://doi.org/10.1007/s00220-019-03555-9">10.1007/s00220-019-03555-9</a>.
  short: C. Boccato, C. Brennecke, S. Cenatiempo, B. Schlein, Communications in Mathematical
    Physics 376 (2020) 1311–1395.
date_created: 2019-09-24T17:30:59Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2025-04-14T07:27:00Z
day: '01'
department:
- _id: RoSe
doi: 10.1007/s00220-019-03555-9
ec_funded: 1
external_id:
  arxiv:
  - '1812.03086'
  isi:
  - '000536053300012'
intvolume: '       376'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1812.03086
month: '06'
oa: 1
oa_version: Preprint
page: 1311-1395
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '694227'
  name: Analysis of quantum many-body systems
publication: Communications in Mathematical Physics
publication_identifier:
  eissn:
  - 1432-0916
  issn:
  - 0010-3616
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 376
year: '2020'
...
---
_id: '6944'
abstract:
- lang: eng
  text: 'We study the problem of automatically detecting if a given multi-class classifier
    operates outside of its specifications (out-of-specs), i.e. on input data from
    a different distribution than what it was trained for. This is an important problem
    to solve on the road towards creating reliable computer vision systems for real-world
    applications, because the quality of a classifier’s predictions cannot be guaranteed
    if it operates out-of-specs. Previously proposed methods for out-of-specs detection
    make decisions on the level of single inputs. This, however, is insufficient to
    achieve low false positive rate and high false negative rates at the same time.
    In this work, we describe a new procedure named KS(conf), based on statistical
    reasoning. Its main component is a classical Kolmogorov–Smirnov test that is applied
    to the set of predicted confidence values for batches of samples. Working with
    batches instead of single samples allows increasing the true positive rate without
    negatively affecting the false positive rate, thereby overcoming a crucial limitation
    of single sample tests. We show by extensive experiments using a variety of convolutional
    network architectures and datasets that KS(conf) reliably detects out-of-specs
    situations even under conditions where other tests fail. It furthermore has a
    number of properties that make it an excellent candidate for practical deployment:
    it is easy to implement, adds almost no overhead to the system, works with any
    classifier that outputs confidence scores, and requires no a priori knowledge
    about how the data distribution could change.'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Rémy
  full_name: Sun, Rémy
  last_name: Sun
- first_name: Christoph
  full_name: Lampert, Christoph
  id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
  last_name: Lampert
  orcid: 0000-0001-8622-7887
citation:
  ama: 'Sun R, Lampert C. KS(conf): A light-weight test if a multiclass classifier
    operates outside of its specifications. <i>International Journal of Computer Vision</i>.
    2020;128(4):970-995. doi:<a href="https://doi.org/10.1007/s11263-019-01232-x">10.1007/s11263-019-01232-x</a>'
  apa: 'Sun, R., &#38; Lampert, C. (2020). KS(conf): A light-weight test if a multiclass
    classifier operates outside of its specifications. <i>International Journal of
    Computer Vision</i>. Springer Nature. <a href="https://doi.org/10.1007/s11263-019-01232-x">https://doi.org/10.1007/s11263-019-01232-x</a>'
  chicago: 'Sun, Rémy, and Christoph Lampert. “KS(Conf): A Light-Weight Test If a
    Multiclass Classifier Operates Outside of Its Specifications.” <i>International
    Journal of Computer Vision</i>. Springer Nature, 2020. <a href="https://doi.org/10.1007/s11263-019-01232-x">https://doi.org/10.1007/s11263-019-01232-x</a>.'
  ieee: 'R. Sun and C. Lampert, “KS(conf): A light-weight test if a multiclass classifier
    operates outside of its specifications,” <i>International Journal of Computer
    Vision</i>, vol. 128, no. 4. Springer Nature, pp. 970–995, 2020.'
  ista: 'Sun R, Lampert C. 2020. KS(conf): A light-weight test if a multiclass classifier
    operates outside of its specifications. International Journal of Computer Vision.
    128(4), 970–995.'
  mla: 'Sun, Rémy, and Christoph Lampert. “KS(Conf): A Light-Weight Test If a Multiclass
    Classifier Operates Outside of Its Specifications.” <i>International Journal of
    Computer Vision</i>, vol. 128, no. 4, Springer Nature, 2020, pp. 970–95, doi:<a
    href="https://doi.org/10.1007/s11263-019-01232-x">10.1007/s11263-019-01232-x</a>.'
  short: R. Sun, C. Lampert, International Journal of Computer Vision 128 (2020) 970–995.
corr_author: '1'
date_created: 2019-10-14T09:14:28Z
date_published: 2020-04-01T00:00:00Z
date_updated: 2025-04-15T07:10:25Z
day: '01'
ddc:
- '004'
department:
- _id: ChLa
doi: 10.1007/s11263-019-01232-x
ec_funded: 1
external_id:
  isi:
  - '000494406800001'
file:
- access_level: open_access
  checksum: 155e63edf664dcacb3bdc1c2223e606f
  content_type: application/pdf
  creator: dernst
  date_created: 2019-11-26T10:30:02Z
  date_updated: 2020-07-14T12:47:45Z
  file_id: '7110'
  file_name: 2019_IJCV_Sun.pdf
  file_size: 1715072
  relation: main_file
file_date_updated: 2020-07-14T12:47:45Z
has_accepted_license: '1'
intvolume: '       128'
isi: 1
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 970-995
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '308036'
  name: Lifelong Learning of Visual Scene Understanding
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
  name: IST Austria Open Access Fund
publication: International Journal of Computer Vision
publication_identifier:
  eissn:
  - 1573-1405
  issn:
  - 0920-5691
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  link:
  - relation: erratum
    url: https://doi.org/10.1007/s11263-019-01262-5
  record:
  - id: '6482'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: 'KS(conf): A light-weight test if a multiclass classifier operates outside
  of its specifications'
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 128
year: '2020'
...
---
_id: '6952'
abstract:
- lang: eng
  text: 'We present a unified framework tackling two problems: class-specific 3D reconstruction
    from a single image, and generation of new 3D shape samples. These tasks have
    received considerable attention recently; however, most existing approaches rely
    on 3D supervision, annotation of 2D images with keypoints or poses, and/or training
    with multiple views of each object instance. Our framework is very general: it
    can be trained in similar settings to existing approaches, while also supporting
    weaker supervision. Importantly, it can be trained purely from 2D images, without
    pose annotations, and with only a single view per instance. We employ meshes as
    an output representation, instead of voxels used in most prior work. This allows
    us to reason over lighting parameters and exploit shading information during training,
    which previous 2D-supervised methods cannot. Thus, our method can learn to generate
    and reconstruct concave object classes. We evaluate our approach in various settings,
    showing that: (i) it learns to disentangle shape from pose and lighting; (ii)
    using shading in the loss improves performance compared to just silhouettes; (iii)
    when using a standard single white light, our model outperforms state-of-the-art
    2D-supervised methods, both with and without pose supervision, thanks to exploiting
    shading cues; (iv) performance improves further when using multiple coloured lights,
    even approaching that of state-of-the-art 3D-supervised methods; (v) shapes produced
    by our model capture smooth surfaces and fine details better than voxel-based
    approaches; and (vi) our approach supports concave classes such as bathtubs and
    sofas, which methods based on silhouettes cannot learn.'
acknowledgement: Open access funding provided by Institute of Science and Technology
  (IST Austria).
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Paul M
  full_name: Henderson, Paul M
  id: 13C09E74-18D9-11E9-8878-32CFE5697425
  last_name: Henderson
  orcid: 0000-0002-5198-7445
- first_name: Vittorio
  full_name: Ferrari, Vittorio
  last_name: Ferrari
citation:
  ama: Henderson PM, Ferrari V. Learning single-image 3D reconstruction by generative
    modelling of shape, pose and shading. <i>International Journal of Computer Vision</i>.
    2020;128:835-854. doi:<a href="https://doi.org/10.1007/s11263-019-01219-8">10.1007/s11263-019-01219-8</a>
  apa: Henderson, P. M., &#38; Ferrari, V. (2020). Learning single-image 3D reconstruction
    by generative modelling of shape, pose and shading. <i>International Journal of
    Computer Vision</i>. Springer Nature. <a href="https://doi.org/10.1007/s11263-019-01219-8">https://doi.org/10.1007/s11263-019-01219-8</a>
  chicago: Henderson, Paul M, and Vittorio Ferrari. “Learning Single-Image 3D Reconstruction
    by Generative Modelling of Shape, Pose and Shading.” <i>International Journal
    of Computer Vision</i>. Springer Nature, 2020. <a href="https://doi.org/10.1007/s11263-019-01219-8">https://doi.org/10.1007/s11263-019-01219-8</a>.
  ieee: P. M. Henderson and V. Ferrari, “Learning single-image 3D reconstruction by
    generative modelling of shape, pose and shading,” <i>International Journal of
    Computer Vision</i>, vol. 128. Springer Nature, pp. 835–854, 2020.
  ista: Henderson PM, Ferrari V. 2020. Learning single-image 3D reconstruction by
    generative modelling of shape, pose and shading. International Journal of Computer
    Vision. 128, 835–854.
  mla: Henderson, Paul M., and Vittorio Ferrari. “Learning Single-Image 3D Reconstruction
    by Generative Modelling of Shape, Pose and Shading.” <i>International Journal
    of Computer Vision</i>, vol. 128, Springer Nature, 2020, pp. 835–54, doi:<a href="https://doi.org/10.1007/s11263-019-01219-8">10.1007/s11263-019-01219-8</a>.
  short: P.M. Henderson, V. Ferrari, International Journal of Computer Vision 128
    (2020) 835–854.
corr_author: '1'
date_created: 2019-10-17T13:38:20Z
date_published: 2020-04-01T00:00:00Z
date_updated: 2025-04-15T06:53:15Z
day: '01'
ddc:
- '004'
department:
- _id: ChLa
doi: 10.1007/s11263-019-01219-8
external_id:
  arxiv:
  - '1901.06447'
  isi:
  - '000491042100002'
file:
- access_level: open_access
  checksum: a0f05dd4f5f64e4f713d8d9d4b5b1e3f
  content_type: application/pdf
  creator: dernst
  date_created: 2019-10-25T10:28:29Z
  date_updated: 2020-07-14T12:47:46Z
  file_id: '6973'
  file_name: 2019_CompVision_Henderson.pdf
  file_size: 2243134
  relation: main_file
file_date_updated: 2020-07-14T12:47:46Z
has_accepted_license: '1'
intvolume: '       128'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 835-854
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
  name: IST Austria Open Access Fund
publication: International Journal of Computer Vision
publication_identifier:
  eissn:
  - 1573-1405
  issn:
  - 0920-5691
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Learning single-image 3D reconstruction by generative modelling of shape, pose
  and shading
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 128
year: '2020'
...
---
_id: '6976'
abstract:
- lang: eng
  text: Origami is rapidly transforming the design of robots1,2, deployable structures3,4,5,6
    and metamaterials7,8,9,10,11,12,13,14. However, as foldability requires a large
    number of complex compatibility conditions that are difficult to satisfy, the
    design of crease patterns is limited to heuristics and computer optimization.
    Here we introduce a systematic strategy that enables intuitive and effective design
    of complex crease patterns that are guaranteed to fold. First, we exploit symmetries
    to construct 140 distinct foldable motifs, and represent these as jigsaw puzzle
    pieces. We then show that when these pieces are fitted together they encode foldable
    crease patterns. This maps origami design to solving combinatorial problems, which
    allows us to systematically create, count and classify a vast number of crease
    patterns. We show that all of these crease patterns are pluripotent—capable of
    folding into multiple shapes—and solve exactly for the number of possible shapes
    for each pattern. Finally, we employ our framework to rationally design a crease
    pattern that folds into two independently defined target shapes, and fabricate
    such pluripotent origami. Our results provide physicists, mathematicians and engineers
    with a powerful new design strategy.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Peter
  full_name: Dieleman, Peter
  last_name: Dieleman
- first_name: Niek
  full_name: Vasmel, Niek
  last_name: Vasmel
- first_name: Scott R
  full_name: Waitukaitis, Scott R
  id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87
  last_name: Waitukaitis
  orcid: 0000-0002-2299-3176
- first_name: Martin
  full_name: van Hecke, Martin
  last_name: van Hecke
citation:
  ama: Dieleman P, Vasmel N, Waitukaitis SR, van Hecke M. Jigsaw puzzle design of
    pluripotent origami. <i>Nature Physics</i>. 2020;16(1):63–68. doi:<a href="https://doi.org/10.1038/s41567-019-0677-3">10.1038/s41567-019-0677-3</a>
  apa: Dieleman, P., Vasmel, N., Waitukaitis, S. R., &#38; van Hecke, M. (2020). Jigsaw
    puzzle design of pluripotent origami. <i>Nature Physics</i>. Springer Nature.
    <a href="https://doi.org/10.1038/s41567-019-0677-3">https://doi.org/10.1038/s41567-019-0677-3</a>
  chicago: Dieleman, Peter, Niek Vasmel, Scott R Waitukaitis, and Martin van Hecke.
    “Jigsaw Puzzle Design of Pluripotent Origami.” <i>Nature Physics</i>. Springer
    Nature, 2020. <a href="https://doi.org/10.1038/s41567-019-0677-3">https://doi.org/10.1038/s41567-019-0677-3</a>.
  ieee: P. Dieleman, N. Vasmel, S. R. Waitukaitis, and M. van Hecke, “Jigsaw puzzle
    design of pluripotent origami,” <i>Nature Physics</i>, vol. 16, no. 1. Springer
    Nature, pp. 63–68, 2020.
  ista: Dieleman P, Vasmel N, Waitukaitis SR, van Hecke M. 2020. Jigsaw puzzle design
    of pluripotent origami. Nature Physics. 16(1), 63–68.
  mla: Dieleman, Peter, et al. “Jigsaw Puzzle Design of Pluripotent Origami.” <i>Nature
    Physics</i>, vol. 16, no. 1, Springer Nature, 2020, pp. 63–68, doi:<a href="https://doi.org/10.1038/s41567-019-0677-3">10.1038/s41567-019-0677-3</a>.
  short: P. Dieleman, N. Vasmel, S.R. Waitukaitis, M. van Hecke, Nature Physics 16
    (2020) 63–68.
date_created: 2019-10-31T07:51:44Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2021-01-12T08:11:16Z
day: '01'
doi: 10.1038/s41567-019-0677-3
extern: '1'
intvolume: '        16'
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 63–68
publication: Nature Physics
publication_identifier:
  eissn:
  - 1745-2481
  issn:
  - 1745-2473
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Jigsaw puzzle design of pluripotent origami
type: journal_article
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 16
year: '2020'
...
---
_id: '6997'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Yuzhou
  full_name: Zhang, Yuzhou
  id: 3B6137F2-F248-11E8-B48F-1D18A9856A87
  last_name: Zhang
  orcid: 0000-0003-2627-6956
- first_name: Jiří
  full_name: Friml, Jiří
  id: 4159519E-F248-11E8-B48F-1D18A9856A87
  last_name: Friml
  orcid: 0000-0002-8302-7596
citation:
  ama: Zhang Y, Friml J. Auxin guides roots to avoid obstacles during gravitropic
    growth. <i>New Phytologist</i>. 2020;225(3):1049-1052. doi:<a href="https://doi.org/10.1111/nph.16203">10.1111/nph.16203</a>
  apa: Zhang, Y., &#38; Friml, J. (2020). Auxin guides roots to avoid obstacles during
    gravitropic growth. <i>New Phytologist</i>. Wiley. <a href="https://doi.org/10.1111/nph.16203">https://doi.org/10.1111/nph.16203</a>
  chicago: Zhang, Yuzhou, and Jiří Friml. “Auxin Guides Roots to Avoid Obstacles during
    Gravitropic Growth.” <i>New Phytologist</i>. Wiley, 2020. <a href="https://doi.org/10.1111/nph.16203">https://doi.org/10.1111/nph.16203</a>.
  ieee: Y. Zhang and J. Friml, “Auxin guides roots to avoid obstacles during gravitropic
    growth,” <i>New Phytologist</i>, vol. 225, no. 3. Wiley, pp. 1049–1052, 2020.
  ista: Zhang Y, Friml J. 2020. Auxin guides roots to avoid obstacles during gravitropic
    growth. New Phytologist. 225(3), 1049–1052.
  mla: Zhang, Yuzhou, and Jiří Friml. “Auxin Guides Roots to Avoid Obstacles during
    Gravitropic Growth.” <i>New Phytologist</i>, vol. 225, no. 3, Wiley, 2020, pp.
    1049–52, doi:<a href="https://doi.org/10.1111/nph.16203">10.1111/nph.16203</a>.
  short: Y. Zhang, J. Friml, New Phytologist 225 (2020) 1049–1052.
corr_author: '1'
date_created: 2019-11-12T11:41:32Z
date_published: 2020-02-01T00:00:00Z
date_updated: 2025-04-14T07:45:04Z
day: '01'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.1111/nph.16203
ec_funded: 1
external_id:
  isi:
  - '000489638800001'
  pmid:
  - '31603260'
file:
- access_level: open_access
  checksum: cd42ffdb381fd52812b9583d4d407139
  content_type: application/pdf
  creator: dernst
  date_created: 2020-11-18T16:42:48Z
  date_updated: 2020-11-18T16:42:48Z
  file_id: '8772'
  file_name: 2020_NewPhytologist_Zhang.pdf
  file_size: 717345
  relation: main_file
  success: 1
file_date_updated: 2020-11-18T16:42:48Z
has_accepted_license: '1'
intvolume: '       225'
isi: 1
issue: '3'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 1049-1052
pmid: 1
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
- _id: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
publication: New Phytologist
publication_identifier:
  eissn:
  - 1469-8137
  issn:
  - 0028-646x
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Auxin guides roots to avoid obstacles during gravitropic growth
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 225
year: '2020'
...
---
_id: '7004'
abstract:
- lang: eng
  text: We define an action of the (double of) Cohomological Hall algebra of Kontsevich
    and Soibelman on the cohomology of the moduli space of spiked instantons of Nekrasov.
    We identify this action with the one of the affine Yangian of gl(1). Based on
    that we derive the vertex algebra at the corner Wr1,r2,r3 of Gaiotto and Rapčák.
    We conjecture that our approach works for a big class of Calabi–Yau categories,
    including those associated with toric Calabi–Yau 3-folds.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Miroslav
  full_name: Rapcak, Miroslav
  last_name: Rapcak
- first_name: Yan
  full_name: Soibelman, Yan
  last_name: Soibelman
- first_name: Yaping
  full_name: Yang, Yaping
  last_name: Yang
- first_name: Gufang
  full_name: Zhao, Gufang
  id: 2BC2AC5E-F248-11E8-B48F-1D18A9856A87
  last_name: Zhao
citation:
  ama: Rapcak M, Soibelman Y, Yang Y, Zhao G. Cohomological Hall algebras, vertex
    algebras and instantons. <i>Communications in Mathematical Physics</i>. 2020;376:1803-1873.
    doi:<a href="https://doi.org/10.1007/s00220-019-03575-5">10.1007/s00220-019-03575-5</a>
  apa: Rapcak, M., Soibelman, Y., Yang, Y., &#38; Zhao, G. (2020). Cohomological Hall
    algebras, vertex algebras and instantons. <i>Communications in Mathematical Physics</i>.
    Springer Nature. <a href="https://doi.org/10.1007/s00220-019-03575-5">https://doi.org/10.1007/s00220-019-03575-5</a>
  chicago: Rapcak, Miroslav, Yan Soibelman, Yaping Yang, and Gufang Zhao. “Cohomological
    Hall Algebras, Vertex Algebras and Instantons.” <i>Communications in Mathematical
    Physics</i>. Springer Nature, 2020. <a href="https://doi.org/10.1007/s00220-019-03575-5">https://doi.org/10.1007/s00220-019-03575-5</a>.
  ieee: M. Rapcak, Y. Soibelman, Y. Yang, and G. Zhao, “Cohomological Hall algebras,
    vertex algebras and instantons,” <i>Communications in Mathematical Physics</i>,
    vol. 376. Springer Nature, pp. 1803–1873, 2020.
  ista: Rapcak M, Soibelman Y, Yang Y, Zhao G. 2020. Cohomological Hall algebras,
    vertex algebras and instantons. Communications in Mathematical Physics. 376, 1803–1873.
  mla: Rapcak, Miroslav, et al. “Cohomological Hall Algebras, Vertex Algebras and
    Instantons.” <i>Communications in Mathematical Physics</i>, vol. 376, Springer
    Nature, 2020, pp. 1803–73, doi:<a href="https://doi.org/10.1007/s00220-019-03575-5">10.1007/s00220-019-03575-5</a>.
  short: M. Rapcak, Y. Soibelman, Y. Yang, G. Zhao, Communications in Mathematical
    Physics 376 (2020) 1803–1873.
date_created: 2019-11-12T14:01:27Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2025-04-14T09:12:46Z
day: '01'
department:
- _id: TaHa
doi: 10.1007/s00220-019-03575-5
ec_funded: 1
external_id:
  arxiv:
  - '1810.10402'
  isi:
  - '000536255500004'
intvolume: '       376'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1810.10402
month: '06'
oa: 1
oa_version: Preprint
page: 1803-1873
project:
- _id: 25E549F4-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '320593'
  name: Arithmetic and physics of Higgs moduli spaces
publication: Communications in Mathematical Physics
publication_identifier:
  eissn:
  - 1432-0916
  issn:
  - 0010-3616
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cohomological Hall algebras, vertex algebras and instantons
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 376
year: '2020'
...
---
_id: '7033'
abstract:
- lang: eng
  text: Removal of the Bax gene from mice completely protects the somas of retinal
    ganglion cells (RGCs) from apoptosis following optic nerve injury. This makes
    BAX a promising therapeutic target to prevent neurodegeneration. In this study,
    Bax+/− mice were used to test the hypothesis that lowering the quantity of BAX
    in RGCs would delay apoptosis following optic nerve injury. RGCs were damaged
    by performing optic nerve crush (ONC) and then immunostaining for phospho-cJUN,
    and quantitative PCR were used to monitor the status of the BAX activation mechanism
    in the months following injury. The apoptotic susceptibility of injured cells
    was directly tested by virally introducing GFP-BAX into Bax−/− RGCs after injury.
    The competency of quiescent RGCs to reactivate their BAX activation mechanism
    was tested by intravitreal injection of the JNK pathway agonist, anisomycin. Twenty-four
    weeks after ONC, Bax+/− mice had significantly less cell loss in their RGC layer
    than Bax+/+ mice 3 weeks after ONC. Bax+/− and Bax+/+ RGCs exhibited similar patterns
    of nuclear phospho-cJUN accumulation immediately after ONC, which persisted in
    Bax+/− RGCs for up to 7 weeks before abating. The transcriptional activation of
    BAX-activating genes was similar in Bax+/− and Bax+/+ RGCs following ONC. Intriguingly,
    cells deactivated their BAX activation mechanism between 7 and 12 weeks after
    crush. Introduction of GFP-BAX into Bax−/− cells at 4 weeks after ONC showed that
    these cells had a nearly normal capacity to activate this protein, but this capacity
    was lost 8 weeks after crush. Collectively, these data suggest that 8–12 weeks
    after crush, damaged cells no longer displayed increased susceptibility to BAX
    activation relative to their naïve counterparts. In this same timeframe, retinal
    glial activation and the signaling of the pro-apoptotic JNK pathway also abated.
    Quiescent RGCs did not show a timely reactivation of their JNK pathway following
    intravitreal injection with anisomycin. These findings demonstrate that lowering
    the quantity of BAX in RGCs is neuroprotective after acute injury. Damaged RGCs
    enter a quiescent state months after injury and are no longer responsive to an
    apoptotic stimulus. Quiescent RGCs will require rejuvenation to reacquire functionality.
acknowledgement: This work was supported by National Eye Institute grants R01 EY012223
  (RWN), R01 EY030123 (RWN), T32 EY027721 (Department of Ophthalmology and Visual
  Sciences, University of Wisconsin-Madison), and a Vision Science Core grant P30
  EY016665 (Department of Ophthalmology and Visual Sciences, University of Wisconsin-Madison),
  an unrestricted funding grant from Research to Prevent Blindness (Department of
  Ophthalmology and Visual Sciences, University of Wisconsin-Madison), the Frederick
  A. Davis Endowment (RWN), and the Mr. and Mrs. George Taylor Foundation (RWN).
article_processing_charge: No
article_type: original
author:
- first_name: RJ
  full_name: Donahue, RJ
  last_name: Donahue
- first_name: Margaret E
  full_name: Maes, Margaret E
  id: 3838F452-F248-11E8-B48F-1D18A9856A87
  last_name: Maes
  orcid: 0000-0001-9642-1085
- first_name: JA
  full_name: Grosser, JA
  last_name: Grosser
- first_name: RW
  full_name: Nickells, RW
  last_name: Nickells
citation:
  ama: Donahue R, Maes ME, Grosser J, Nickells R. BAX-depleted retinal ganglion cells
    survive and become quiescent following optic nerve damage. <i>Molecular Neurobiology</i>.
    2020;57(2):1070–1084. doi:<a href="https://doi.org/10.1007/s12035-019-01783-7">10.1007/s12035-019-01783-7</a>
  apa: Donahue, R., Maes, M. E., Grosser, J., &#38; Nickells, R. (2020). BAX-depleted
    retinal ganglion cells survive and become quiescent following optic nerve damage.
    <i>Molecular Neurobiology</i>. Springer Nature. <a href="https://doi.org/10.1007/s12035-019-01783-7">https://doi.org/10.1007/s12035-019-01783-7</a>
  chicago: Donahue, RJ, Margaret E Maes, JA Grosser, and RW Nickells. “BAX-Depleted
    Retinal Ganglion Cells Survive and Become Quiescent Following Optic Nerve Damage.”
    <i>Molecular Neurobiology</i>. Springer Nature, 2020. <a href="https://doi.org/10.1007/s12035-019-01783-7">https://doi.org/10.1007/s12035-019-01783-7</a>.
  ieee: R. Donahue, M. E. Maes, J. Grosser, and R. Nickells, “BAX-depleted retinal
    ganglion cells survive and become quiescent following optic nerve damage,” <i>Molecular
    Neurobiology</i>, vol. 57, no. 2. Springer Nature, pp. 1070–1084, 2020.
  ista: Donahue R, Maes ME, Grosser J, Nickells R. 2020. BAX-depleted retinal ganglion
    cells survive and become quiescent following optic nerve damage. Molecular Neurobiology.
    57(2), 1070–1084.
  mla: Donahue, RJ, et al. “BAX-Depleted Retinal Ganglion Cells Survive and Become
    Quiescent Following Optic Nerve Damage.” <i>Molecular Neurobiology</i>, vol. 57,
    no. 2, Springer Nature, 2020, pp. 1070–1084, doi:<a href="https://doi.org/10.1007/s12035-019-01783-7">10.1007/s12035-019-01783-7</a>.
  short: R. Donahue, M.E. Maes, J. Grosser, R. Nickells, Molecular Neurobiology 57
    (2020) 1070–1084.
date_created: 2019-11-18T14:18:39Z
date_published: 2020-02-01T00:00:00Z
date_updated: 2023-08-17T14:05:48Z
day: '01'
department:
- _id: SaSi
doi: 10.1007/s12035-019-01783-7
external_id:
  isi:
  - '000493754200001'
  pmid:
  - '31673950'
intvolume: '        57'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7035206/
month: '02'
oa: 1
oa_version: Submitted Version
page: 1070–1084
pmid: 1
publication: Molecular Neurobiology
publication_identifier:
  eissn:
  - 1559-1182
  issn:
  - 0893-7648
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: BAX-depleted retinal ganglion cells survive and become quiescent following
  optic nerve damage
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 57
year: '2020'
...
