---
OA_place: repository
OA_type: green
_id: '22045'
abstract:
- lang: eng
  text: "We consider the initial-value problem for the cubic-quintic nonlinear Schrödinger
    equation (\U0001D456\U0001D715\U0001D461+Δ)⁢\U0001D713 =\U0001D6FC1⁢\U0001D713
    −\U0001D6FC3⁢|\U0001D713|2⁢\U0001D713 +\U0001D6FC5⁢|\U0001D713|4⁢\U0001D713 in
    three spatial dimensions in the class of solutions with |\U0001D713⁡(\U0001D465)|
    →\U0001D450 >0 as |\U0001D465| →∞. Here \U0001D6FC1, \U0001D6FC3, \U0001D6FC5,
    and \U0001D450 are such that \U0001D713⁡(\U0001D465) ≡\U0001D450 is an energetically
    stable equilibrium solution to this equation. Normalizing the boundary condition
    to \U0001D713⁡(\U0001D465) →1 as |\U0001D465| →∞, we study the associated initial-value
    problem for \U0001D462 =\U0001D713 −1 and prove a scattering result for small
    initial data in a weighted Sobolev space."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Rowan
  full_name: Killip, Rowan
  last_name: Killip
- first_name: Jason
  full_name: Murphy, Jason
  last_name: Murphy
- first_name: Monica
  full_name: Visan, Monica
  id: 056daca0-b8d1-11f0-964f-f91054abf8ca
  last_name: Visan
citation:
  ama: Killip R, Murphy J, Vişan M. The initial-value problem for the cubic-quintic
    NLS with nonvanishing boundary conditions. <i>SIAM Journal on Mathematical Analysis</i>.
    2018;50(3):2681-2739. doi:<a href="https://doi.org/10.1137/17m1116702">10.1137/17m1116702</a>
  apa: Killip, R., Murphy, J., &#38; Vişan, M. (2018). The initial-value problem for
    the cubic-quintic NLS with nonvanishing boundary conditions. <i>SIAM Journal on
    Mathematical Analysis</i>. Society for Industrial &#38; Applied Mathematics. <a
    href="https://doi.org/10.1137/17m1116702">https://doi.org/10.1137/17m1116702</a>
  chicago: Killip, Rowan, Jason Murphy, and Monica Vişan. “The Initial-Value Problem
    for the Cubic-Quintic NLS with Nonvanishing Boundary Conditions.” <i>SIAM Journal
    on Mathematical Analysis</i>. Society for Industrial &#38; Applied Mathematics,
    2018. <a href="https://doi.org/10.1137/17m1116702">https://doi.org/10.1137/17m1116702</a>.
  ieee: R. Killip, J. Murphy, and M. Vişan, “The initial-value problem for the cubic-quintic
    NLS with nonvanishing boundary conditions,” <i>SIAM Journal on Mathematical Analysis</i>,
    vol. 50, no. 3. Society for Industrial &#38; Applied Mathematics, pp. 2681–2739,
    2018.
  ista: Killip R, Murphy J, Vişan M. 2018. The initial-value problem for the cubic-quintic
    NLS with nonvanishing boundary conditions. SIAM Journal on Mathematical Analysis.
    50(3), 2681–2739.
  mla: Killip, Rowan, et al. “The Initial-Value Problem for the Cubic-Quintic NLS
    with Nonvanishing Boundary Conditions.” <i>SIAM Journal on Mathematical Analysis</i>,
    vol. 50, no. 3, Society for Industrial &#38; Applied Mathematics, 2018, pp. 2681–739,
    doi:<a href="https://doi.org/10.1137/17m1116702">10.1137/17m1116702</a>.
  short: R. Killip, J. Murphy, M. Vişan, SIAM Journal on Mathematical Analysis 50
    (2018) 2681–2739.
das_tickbox: '1'
date_created: 2026-06-19T07:49:03Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2026-06-25T07:49:21Z
day: '01'
doi: 10.1137/17m1116702
extern: '1'
external_id:
  arxiv:
  - '1702.04413'
fulldoi: https://doi.org/10.1137/17m1116702
intvolume: '        50'
issue: '3'
keyword:
- cubic-quintic NLS
- nonvanishing boundary conditions
- space-time resonances
- scattering
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.1702.04413
mathsc:
- 35Q55
month: '01'
oa: 1
oa_version: Preprint
page: 2681-2739
publication: SIAM Journal on Mathematical Analysis
publication_identifier:
  issn:
  - 0036-1410
  - 1095-7154
publication_status: published
publisher: Society for Industrial & Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: The initial-value problem for the cubic-quintic NLS with nonvanishing boundary
  conditions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 50
year: '2018'
...
---
OA_place: repository
OA_type: green
_id: '22055'
abstract:
- lang: eng
  text: We present a general method for obtaining conservation laws for integrable
    PDE at negative regularity and exhibit its application to KdV, NLS, and mKdV.
    Our method works uniformly for these problems posed both on the line and on the
    circle.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Rowan
  full_name: Killip, Rowan
  last_name: Killip
- first_name: Monica
  full_name: Visan, Monica
  id: 056daca0-b8d1-11f0-964f-f91054abf8ca
  last_name: Visan
- first_name: Xiaoyi
  full_name: Zhang, Xiaoyi
  last_name: Zhang
citation:
  ama: Killip R, Vişan M, Zhang X. Low regularity conservation laws for integrable
    PDE. <i>Geometric and Functional Analysis</i>. 2018;28(4):1062-1090. doi:<a href="https://doi.org/10.1007/s00039-018-0444-0">10.1007/s00039-018-0444-0</a>
  apa: Killip, R., Vişan, M., &#38; Zhang, X. (2018). Low regularity conservation
    laws for integrable PDE. <i>Geometric and Functional Analysis</i>. Springer Nature.
    <a href="https://doi.org/10.1007/s00039-018-0444-0">https://doi.org/10.1007/s00039-018-0444-0</a>
  chicago: Killip, Rowan, Monica Vişan, and Xiaoyi Zhang. “Low Regularity Conservation
    Laws for Integrable PDE.” <i>Geometric and Functional Analysis</i>. Springer Nature,
    2018. <a href="https://doi.org/10.1007/s00039-018-0444-0">https://doi.org/10.1007/s00039-018-0444-0</a>.
  ieee: R. Killip, M. Vişan, and X. Zhang, “Low regularity conservation laws for integrable
    PDE,” <i>Geometric and Functional Analysis</i>, vol. 28, no. 4. Springer Nature,
    pp. 1062–1090, 2018.
  ista: Killip R, Vişan M, Zhang X. 2018. Low regularity conservation laws for integrable
    PDE. Geometric and Functional Analysis. 28(4), 1062–1090.
  mla: Killip, Rowan, et al. “Low Regularity Conservation Laws for Integrable PDE.”
    <i>Geometric and Functional Analysis</i>, vol. 28, no. 4, Springer Nature, 2018,
    pp. 1062–90, doi:<a href="https://doi.org/10.1007/s00039-018-0444-0">10.1007/s00039-018-0444-0</a>.
  short: R. Killip, M. Vişan, X. Zhang, Geometric and Functional Analysis 28 (2018)
    1062–1090.
das_tickbox: '1'
date_created: 2026-06-19T07:56:48Z
date_published: 2018-07-01T00:00:00Z
date_updated: 2026-06-29T09:55:53Z
day: '01'
doi: 10.1007/s00039-018-0444-0
extern: '1'
external_id:
  arxiv:
  - '1708.05362'
fulldoi: https://doi.org/10.1007/s00039-018-0444-0
intvolume: '        28'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.1708.05362
month: '07'
oa: 1
oa_version: Preprint
page: 1062-1090
publication: Geometric and Functional Analysis
publication_identifier:
  eissn:
  - 1420-8970
  issn:
  - 1016-443X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Low regularity conservation laws for integrable PDE
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 28
year: '2018'
...
---
OA_type: free access
_id: '22093'
abstract:
- lang: eng
  text: Nonlinear dispersive equations are models for nonlinear waves in a wide range
    of physical contexts. Mathematically they display an interplay between linear
    dispersion and nonlinear interactions, which can result in a wide range of outcomes
    from finite time blow-up to solitons and scattering. They are linked to many areas
    of mathematics and physics, ranging from integrable systems and harmonic analysis
    to fluid dynamics, geometry, general relativity and probability.
article_processing_charge: No
author:
- first_name: Herbert
  full_name: Koch, Herbert
  last_name: Koch
- first_name: Pierre
  full_name: Raphaël, Pierre
  last_name: Raphaël
- first_name: Daniel
  full_name: Tataru, Daniel
  last_name: Tataru
- first_name: Monica
  full_name: Visan, Monica
  id: 056daca0-b8d1-11f0-964f-f91054abf8ca
  last_name: Visan
citation:
  ama: Koch H, Raphaël P, Tataru D, Vişan M. Nonlinear waves and dispersive equations.
    <i>Oberwolfach Reports</i>. 2018;14(2):1681-1745. doi:<a href="https://doi.org/10.4171/owr/2017/27">10.4171/owr/2017/27</a>
  apa: Koch, H., Raphaël, P., Tataru, D., &#38; Vişan, M. (2018). Nonlinear waves
    and dispersive equations. <i>Oberwolfach Reports</i>. EMS Press. <a href="https://doi.org/10.4171/owr/2017/27">https://doi.org/10.4171/owr/2017/27</a>
  chicago: Koch, Herbert, Pierre Raphaël, Daniel Tataru, and Monica Vişan. “Nonlinear
    Waves and Dispersive Equations.” <i>Oberwolfach Reports</i>. EMS Press, 2018.
    <a href="https://doi.org/10.4171/owr/2017/27">https://doi.org/10.4171/owr/2017/27</a>.
  ieee: H. Koch, P. Raphaël, D. Tataru, and M. Vişan, “Nonlinear waves and dispersive
    equations,” <i>Oberwolfach Reports</i>, vol. 14, no. 2. EMS Press, pp. 1681–1745,
    2018.
  ista: Koch H, Raphaël P, Tataru D, Vişan M. 2018. Nonlinear waves and dispersive
    equations. Oberwolfach Reports. 14(2), 1681–1745.
  mla: Koch, Herbert, et al. “Nonlinear Waves and Dispersive Equations.” <i>Oberwolfach
    Reports</i>, vol. 14, no. 2, EMS Press, 2018, pp. 1681–745, doi:<a href="https://doi.org/10.4171/owr/2017/27">10.4171/owr/2017/27</a>.
  short: H. Koch, P. Raphaël, D. Tataru, M. Vişan, Oberwolfach Reports 14 (2018) 1681–1745.
das_tickbox: '1'
date_created: 2026-06-19T08:55:08Z
date_published: 2018-04-28T00:00:00Z
date_updated: 2026-07-02T05:51:37Z
day: '28'
doi: 10.4171/owr/2017/27
extern: '1'
fulldoi: https://doi.org/10.4171/owr/2017/27
intvolume: '        14'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.4171/OWR/2017/27
month: '04'
oa: 1
oa_version: Published Version
page: 1681-1745
publication: Oberwolfach Reports
publication_identifier:
  eissn:
  - 1660-8941
  issn:
  - 1660-8933
publication_status: published
publisher: EMS Press
quality_controlled: '1'
status: public
title: Nonlinear waves and dispersive equations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14
year: '2018'
...
---
_id: '5992'
abstract:
- lang: eng
  text: Lamellipodia are flat membrane protrusions formed during mesenchymal motion.
    Polymerization at the leading edge assembles the actin filament network and generates
    protrusion force. How this force is supported by the network and how the assembly
    rate is shared between protrusion and network retrograde flow determines the protrusion
    rate. We use mathematical modeling to understand experiments changing the F-actin
    density in lamellipodia of B16-F1 melanoma cells by modulation of Arp2/3 complex
    activity or knockout of the formins FMNL2 and FMNL3. Cells respond to a reduction
    of density with a decrease of protrusion velocity, an increase in the ratio of
    force to filament number, but constant network assembly rate. The relation between
    protrusion force and tension gradient in the F-actin network and the density dependency
    of friction, elasticity, and viscosity of the network explain the experimental
    observations. The formins act as filament nucleators and elongators with differential
    rates. Modulation of their activity suggests an effect on network assembly rate.
    Contrary to these expectations, the effect of changes in elongator composition
    is much weaker than the consequences of the density change. We conclude that the
    force acting on the leading edge membrane is the force required to drive F-actin
    network retrograde flow.
article_processing_charge: No
author:
- first_name: Setareh
  full_name: Dolati, Setareh
  last_name: Dolati
- first_name: Frieda
  full_name: Kage, Frieda
  last_name: Kage
- first_name: Jan
  full_name: Mueller, Jan
  last_name: Mueller
- first_name: Mathias
  full_name: Müsken, Mathias
  last_name: Müsken
- first_name: Marieluise
  full_name: Kirchner, Marieluise
  last_name: Kirchner
- first_name: Gunnar
  full_name: Dittmar, Gunnar
  last_name: Dittmar
- first_name: Michael K
  full_name: Sixt, Michael K
  id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
  last_name: Sixt
  orcid: 0000-0002-6620-9179
- first_name: Klemens
  full_name: Rottner, Klemens
  last_name: Rottner
- first_name: Martin
  full_name: Falcke, Martin
  last_name: Falcke
citation:
  ama: Dolati S, Kage F, Mueller J, et al. On the relation between filament density,
    force generation, and protrusion rate in mesenchymal cell motility. <i>Molecular
    Biology of the Cell</i>. 2018;29(22):2674-2686. doi:<a href="https://doi.org/10.1091/mbc.e18-02-0082">10.1091/mbc.e18-02-0082</a>
  apa: Dolati, S., Kage, F., Mueller, J., Müsken, M., Kirchner, M., Dittmar, G., …
    Falcke, M. (2018). On the relation between filament density, force generation,
    and protrusion rate in mesenchymal cell motility. <i>Molecular Biology of the
    Cell</i>. American Society for Cell Biology. <a href="https://doi.org/10.1091/mbc.e18-02-0082">https://doi.org/10.1091/mbc.e18-02-0082</a>
  chicago: Dolati, Setareh, Frieda Kage, Jan Mueller, Mathias Müsken, Marieluise Kirchner,
    Gunnar Dittmar, Michael K Sixt, Klemens Rottner, and Martin Falcke. “On the Relation
    between Filament Density, Force Generation, and Protrusion Rate in Mesenchymal
    Cell Motility.” <i>Molecular Biology of the Cell</i>. American Society for Cell
    Biology, 2018. <a href="https://doi.org/10.1091/mbc.e18-02-0082">https://doi.org/10.1091/mbc.e18-02-0082</a>.
  ieee: S. Dolati <i>et al.</i>, “On the relation between filament density, force
    generation, and protrusion rate in mesenchymal cell motility,” <i>Molecular Biology
    of the Cell</i>, vol. 29, no. 22. American Society for Cell Biology, pp. 2674–2686,
    2018.
  ista: Dolati S, Kage F, Mueller J, Müsken M, Kirchner M, Dittmar G, Sixt MK, Rottner
    K, Falcke M. 2018. On the relation between filament density, force generation,
    and protrusion rate in mesenchymal cell motility. Molecular Biology of the Cell.
    29(22), 2674–2686.
  mla: Dolati, Setareh, et al. “On the Relation between Filament Density, Force Generation,
    and Protrusion Rate in Mesenchymal Cell Motility.” <i>Molecular Biology of the
    Cell</i>, vol. 29, no. 22, American Society for Cell Biology, 2018, pp. 2674–86,
    doi:<a href="https://doi.org/10.1091/mbc.e18-02-0082">10.1091/mbc.e18-02-0082</a>.
  short: S. Dolati, F. Kage, J. Mueller, M. Müsken, M. Kirchner, G. Dittmar, M.K.
    Sixt, K. Rottner, M. Falcke, Molecular Biology of the Cell 29 (2018) 2674–2686.
das_tickbox: '1'
date_created: 2019-02-14T12:25:47Z
date_published: 2018-11-01T00:00:00Z
date_updated: 2026-07-06T12:25:34Z
day: '01'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.1091/mbc.e18-02-0082
external_id:
  isi:
  - '000455641000011'
  pmid:
  - '30156465'
file:
- access_level: open_access
  checksum: e98465b4416b3e804c47f40086932af2
  content_type: application/pdf
  creator: kschuh
  date_created: 2019-02-14T12:34:29Z
  date_updated: 2020-07-14T12:47:15Z
  file_id: '5994'
  file_name: 2018_ASCB_Dolati.pdf
  file_size: 6668971
  relation: main_file
file_date_updated: 2020-07-14T12:47:15Z
fulldoi: https://doi.org/10.1091/mbc.e18-02-0082
has_accepted_license: '1'
intvolume: '        29'
isi: 1
issue: '22'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 2674-2686
pmid: 1
publication: Molecular Biology of the Cell
publication_identifier:
  eissn:
  - 1939-4586
publication_status: published
publisher: American Society for Cell Biology
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the relation between filament density, force generation, and protrusion
  rate in mesenchymal cell motility
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2018'
...
---
_id: '8547'
abstract:
- lang: eng
  text: The cerebral cortex contains multiple hierarchically organized areas with
    distinctive cytoarchitectonical patterns, but the cellular mechanisms underlying
    the emergence of this diversity remain unclear. Here, we have quantitatively investigated
    the neuronal output of individual progenitor cells in the ventricular zone of
    the developing mouse neocortex using a combination of methods that together circumvent
    the biases and limitations of individual approaches. We found that individual
    cortical progenitor cells show a high degree of stochasticity and generate pyramidal
    cell lineages that adopt a wide range of laminar configurations. Mathematical
    modelling these lineage data suggests that a small number of progenitor cell populations,
    each generating pyramidal cells following different stochastic developmental programs,
    suffice to generate the heterogenous complement of pyramidal cell lineages that
    collectively build the complex cytoarchitecture of the neocortex.
acknowledgement: We thank I. Andrew and S.E. Bae for excellent technical assistance,
  F. Gage for plasmids, and K. Nave (Nex-Cre) for mouse colonies. We thank members
  of the Marín and Rico laboratories for stimulating discussions and ideas. Our research
  on this topic is supported by grants from the European Research Council (ERC-2017-AdG
  787355 to O.M and ERC2016-CoG 725780 to S.H.) and Wellcome Trust (103714MA) to O.M.
  L.L. was the recipient of an EMBO long-term postdoctoral fellowship, R.B. received
  support from FWF Lise-Meitner program (M 2416) and F.K.W. was supported by an EMBO
  postdoctoral fellowship and is currently a Marie Skłodowska-Curie Fellow from the
  European Commission under the H2020 Programme.
article_processing_charge: No
author:
- first_name: Alfredo
  full_name: Llorca, Alfredo
  last_name: Llorca
- first_name: Gabriele
  full_name: Ciceri, Gabriele
  last_name: Ciceri
- first_name: Robert J
  full_name: Beattie, Robert J
  id: 2E26DF60-F248-11E8-B48F-1D18A9856A87
  last_name: Beattie
  orcid: 0000-0002-8483-8753
- first_name: Fong K.
  full_name: Wong, Fong K.
  last_name: Wong
- first_name: Giovanni
  full_name: Diana, Giovanni
  last_name: Diana
- first_name: Eleni
  full_name: Serafeimidou, Eleni
  last_name: Serafeimidou
- first_name: Marian
  full_name: Fernández-Otero, Marian
  last_name: Fernández-Otero
- first_name: Carmen
  full_name: Streicher, Carmen
  id: 36BCB99C-F248-11E8-B48F-1D18A9856A87
  last_name: Streicher
- first_name: Sebastian J.
  full_name: Arnold, Sebastian J.
  last_name: Arnold
- first_name: Martin
  full_name: Meyer, Martin
  last_name: Meyer
- first_name: Simon
  full_name: Hippenmeyer, Simon
  id: 37B36620-F248-11E8-B48F-1D18A9856A87
  last_name: Hippenmeyer
  orcid: 0000-0003-2279-1061
- first_name: Miguel
  full_name: Maravall, Miguel
  last_name: Maravall
- first_name: Oscar
  full_name: Marín, Oscar
  last_name: Marín
citation:
  ama: Llorca A, Ciceri G, Beattie RJ, et al. Heterogeneous progenitor cell behaviors
    underlie the assembly of neocortical cytoarchitecture. <i>bioRxiv</i>. doi:<a
    href="https://doi.org/10.1101/494088">10.1101/494088</a>
  apa: Llorca, A., Ciceri, G., Beattie, R. J., Wong, F. K., Diana, G., Serafeimidou,
    E., … Marín, O. (n.d.). Heterogeneous progenitor cell behaviors underlie the assembly
    of neocortical cytoarchitecture. <i>bioRxiv</i>. <a href="https://doi.org/10.1101/494088">https://doi.org/10.1101/494088</a>
  chicago: Llorca, Alfredo, Gabriele Ciceri, Robert J Beattie, Fong K. Wong, Giovanni
    Diana, Eleni Serafeimidou, Marian Fernández-Otero, et al. “Heterogeneous Progenitor
    Cell Behaviors Underlie the Assembly of Neocortical Cytoarchitecture.” <i>BioRxiv</i>,
    n.d. <a href="https://doi.org/10.1101/494088">https://doi.org/10.1101/494088</a>.
  ieee: A. Llorca <i>et al.</i>, “Heterogeneous progenitor cell behaviors underlie
    the assembly of neocortical cytoarchitecture,” <i>bioRxiv</i>. .
  ista: Llorca A, Ciceri G, Beattie RJ, Wong FK, Diana G, Serafeimidou E, Fernández-Otero
    M, Streicher C, Arnold SJ, Meyer M, Hippenmeyer S, Maravall M, Marín O. Heterogeneous
    progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture.
    bioRxiv, <a href="https://doi.org/10.1101/494088">10.1101/494088</a>.
  mla: Llorca, Alfredo, et al. “Heterogeneous Progenitor Cell Behaviors Underlie the
    Assembly of Neocortical Cytoarchitecture.” <i>BioRxiv</i>, doi:<a href="https://doi.org/10.1101/494088">10.1101/494088</a>.
  short: A. Llorca, G. Ciceri, R.J. Beattie, F.K. Wong, G. Diana, E. Serafeimidou,
    M. Fernández-Otero, C. Streicher, S.J. Arnold, M. Meyer, S. Hippenmeyer, M. Maravall,
    O. Marín, BioRxiv (n.d.).
das_tickbox: '1'
date_created: 2020-09-21T12:01:50Z
date_published: 2018-12-13T00:00:00Z
date_updated: 2026-07-06T12:52:50Z
day: '13'
department:
- _id: SiHi
doi: 10.1101/494088
ec_funded: 1
fulldoi: https://doi.org/10.1101/494088
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1101/494088
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 260018B0-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '725780'
  name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development
- _id: 264E56E2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: M02416
  name: Molecular Mechanisms Regulating Gliogenesis in the Neocortex
publication: bioRxiv
publication_status: submitted
status: public
title: Heterogeneous progenitor cell behaviors underlie the assembly of neocortical
  cytoarchitecture
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
OA_place: publisher
OA_type: diamond
_id: '10286'
abstract:
- lang: eng
  text: 'In this paper, we evaluate clock signals generated in ring oscillators and
    self-timed rings and the way their jitter can be transformed into random numbers.
    We show that counting the periods of the jittery clock signal produces random
    numbers of significantly better quality than the methods in which the jittery
    signal is simply sampled (the case in almost all current methods). Moreover, we
    use the counter values to characterize and continuously monitor the source of
    randomness. However, instead of using the widely used statistical variance, we
    propose to use Allan variance to do so. There are two main advantages: Allan variance
    is insensitive to low frequency noises such as flicker noise that are known to
    be autocorrelated and significantly less circuitry is required for its computation
    than that used to compute commonly used variance. We also show that it is essential
    to use a differential principle of randomness extraction from the jitter based
    on the use of two identical oscillators to avoid autocorrelations originating
    from external and internal global jitter sources and that this fact is valid for
    both kinds of rings. Last but not least, we propose a method of statistical testing
    based on high order Markov model to show the reduced dependencies when the proposed
    randomness extraction is applied.'
article_processing_charge: No
article_type: original
author:
- first_name: Elie Noumon
  full_name: Allini, Elie Noumon
  last_name: Allini
- first_name: Maciej
  full_name: Skórski, Maciej
  id: EC09FA6A-02D0-11E9-8223-86B7C91467DD
  last_name: Skórski
- first_name: Oto
  full_name: Petura, Oto
  last_name: Petura
- first_name: Florent
  full_name: Bernard, Florent
  last_name: Bernard
- first_name: Marek
  full_name: Laban, Marek
  last_name: Laban
- first_name: Viktor
  full_name: Fischer, Viktor
  last_name: Fischer
citation:
  ama: Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. Evaluation and
    monitoring of free running oscillators serving as source of randomness. <i>IACR
    Transactions on Cryptographic Hardware and Embedded Systems</i>. 2018;2018(3):214-242.
    doi:<a href="https://doi.org/10.13154/tches.v2018.i3.214-242">10.13154/tches.v2018.i3.214-242</a>
  apa: Allini, E. N., Skórski, M., Petura, O., Bernard, F., Laban, M., &#38; Fischer,
    V. (2018). Evaluation and monitoring of free running oscillators serving as source
    of randomness. <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>.
    International Association for Cryptologic Research. <a href="https://doi.org/10.13154/tches.v2018.i3.214-242">https://doi.org/10.13154/tches.v2018.i3.214-242</a>
  chicago: Allini, Elie Noumon, Maciej Skórski, Oto Petura, Florent Bernard, Marek
    Laban, and Viktor Fischer. “Evaluation and Monitoring of Free Running Oscillators
    Serving as Source of Randomness.” <i>IACR Transactions on Cryptographic Hardware
    and Embedded Systems</i>. International Association for Cryptologic Research,
    2018. <a href="https://doi.org/10.13154/tches.v2018.i3.214-242">https://doi.org/10.13154/tches.v2018.i3.214-242</a>.
  ieee: E. N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, and V. Fischer,
    “Evaluation and monitoring of free running oscillators serving as source of randomness,”
    <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>, vol.
    2018, no. 3. International Association for Cryptologic Research, pp. 214–242,
    2018.
  ista: Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. 2018. Evaluation
    and monitoring of free running oscillators serving as source of randomness. IACR
    Transactions on Cryptographic Hardware and Embedded Systems. 2018(3), 214–242.
  mla: Allini, Elie Noumon, et al. “Evaluation and Monitoring of Free Running Oscillators
    Serving as Source of Randomness.” <i>IACR Transactions on Cryptographic Hardware
    and Embedded Systems</i>, vol. 2018, no. 3, International Association for Cryptologic
    Research, 2018, pp. 214–42, doi:<a href="https://doi.org/10.13154/tches.v2018.i3.214-242">10.13154/tches.v2018.i3.214-242</a>.
  short: E.N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, V. Fischer, IACR
    Transactions on Cryptographic Hardware and Embedded Systems 2018 (2018) 214–242.
corr_author: '1'
das_tickbox: '1'
date_created: 2021-11-14T23:01:25Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2026-07-06T13:16:35Z
day: '01'
ddc:
- '000'
department:
- _id: KrPi
doi: 10.13154/tches.v2018.i3.214-242
file:
- access_level: open_access
  checksum: b816b848f046c48a8357700d9305dce5
  content_type: application/pdf
  creator: cchlebak
  date_created: 2021-11-15T10:27:29Z
  date_updated: 2021-11-15T10:27:29Z
  file_id: '10289'
  file_name: 2018_IACR_Allini.pdf
  file_size: 955755
  relation: main_file
  success: 1
file_date_updated: 2021-11-15T10:27:29Z
fulldoi: https://doi.org/10.13154/tches.v2018.i3.214-242
has_accepted_license: '1'
intvolume: '      2018'
issue: '3'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 214-242
publication: IACR Transactions on Cryptographic Hardware and Embedded Systems
publication_identifier:
  eissn:
  - 2569-2925
publication_status: published
publisher: International Association for Cryptologic Research
quality_controlled: '1'
scopus_import: '1'
status: public
title: Evaluation and monitoring of free running oscillators serving as source of
  randomness
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: '5995'
abstract:
- lang: eng
  text: "Motivation\r\nComputational prediction of the effect of mutations on protein
    stability is used by researchers in many fields. The utility of the prediction
    methods is affected by their accuracy and bias. Bias, a systematic shift of the
    predicted change of stability, has been noted as an issue for several methods,
    but has not been investigated systematically. Presence of the bias may lead to
    misleading results especially when exploring the effects of combination of different
    mutations.\r\n\r\nResults\r\nHere we use a protocol to measure the bias as a function
    of the number of introduced mutations. It is based on a self-consistency test
    of the reciprocity the effect of a mutation. An advantage of the used approach
    is that it relies solely on crystal structures without experimentally measured
    stability values. We applied the protocol to four popular algorithms predicting
    change of protein stability upon mutation, FoldX, Eris, Rosetta and I-Mutant,
    and found an inherent bias. For one program, FoldX, we manage to substantially
    reduce the bias using additional relaxation by Modeller. Authors using algorithms
    for predicting effects of mutations should be aware of the bias described here."
article_processing_charge: No
author:
- first_name: Dinara R
  full_name: Usmanova, Dinara R
  last_name: Usmanova
- first_name: Natalya S
  full_name: Bogatyreva, Natalya S
  last_name: Bogatyreva
- first_name: Joan
  full_name: Ariño Bernad, Joan
  last_name: Ariño Bernad
- first_name: Aleksandra A
  full_name: Eremina, Aleksandra A
  last_name: Eremina
- first_name: Anastasiya A
  full_name: Gorshkova, Anastasiya A
  last_name: Gorshkova
- first_name: German M
  full_name: Kanevskiy, German M
  last_name: Kanevskiy
- first_name: Lyubov R
  full_name: Lonishin, Lyubov R
  last_name: Lonishin
- first_name: Alexander V
  full_name: Meister, Alexander V
  last_name: Meister
- first_name: Alisa G
  full_name: Yakupova, Alisa G
  last_name: Yakupova
- first_name: Fyodor
  full_name: Kondrashov, Fyodor
  id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
  last_name: Kondrashov
  orcid: 0000-0001-8243-4694
- first_name: Dmitry
  full_name: Ivankov, Dmitry
  id: 49FF1036-F248-11E8-B48F-1D18A9856A87
  last_name: Ivankov
  orcid: 0000-0002-8224-4118
citation:
  ama: Usmanova DR, Bogatyreva NS, Ariño Bernad J, et al. Self-consistency test reveals
    systematic bias in programs for prediction change of stability upon mutation.
    <i>Bioinformatics</i>. 2018;34(21):3653-3658. doi:<a href="https://doi.org/10.1093/bioinformatics/bty340">10.1093/bioinformatics/bty340</a>
  apa: Usmanova, D. R., Bogatyreva, N. S., Ariño Bernad, J., Eremina, A. A., Gorshkova,
    A. A., Kanevskiy, G. M., … Ivankov, D. (2018). Self-consistency test reveals systematic
    bias in programs for prediction change of stability upon mutation. <i>Bioinformatics</i>.
    Oxford University Press. <a href="https://doi.org/10.1093/bioinformatics/bty340">https://doi.org/10.1093/bioinformatics/bty340</a>
  chicago: Usmanova, Dinara R, Natalya S Bogatyreva, Joan Ariño Bernad, Aleksandra
    A Eremina, Anastasiya A Gorshkova, German M Kanevskiy, Lyubov R Lonishin, et al.
    “Self-Consistency Test Reveals Systematic Bias in Programs for Prediction Change
    of Stability upon Mutation.” <i>Bioinformatics</i>. Oxford University Press, 2018.
    <a href="https://doi.org/10.1093/bioinformatics/bty340">https://doi.org/10.1093/bioinformatics/bty340</a>.
  ieee: D. R. Usmanova <i>et al.</i>, “Self-consistency test reveals systematic bias
    in programs for prediction change of stability upon mutation,” <i>Bioinformatics</i>,
    vol. 34, no. 21. Oxford University Press, pp. 3653–3658, 2018.
  ista: Usmanova DR, Bogatyreva NS, Ariño Bernad J, Eremina AA, Gorshkova AA, Kanevskiy
    GM, Lonishin LR, Meister AV, Yakupova AG, Kondrashov F, Ivankov D. 2018. Self-consistency
    test reveals systematic bias in programs for prediction change of stability upon
    mutation. Bioinformatics. 34(21), 3653–3658.
  mla: Usmanova, Dinara R., et al. “Self-Consistency Test Reveals Systematic Bias
    in Programs for Prediction Change of Stability upon Mutation.” <i>Bioinformatics</i>,
    vol. 34, no. 21, Oxford University Press, 2018, pp. 3653–58, doi:<a href="https://doi.org/10.1093/bioinformatics/bty340">10.1093/bioinformatics/bty340</a>.
  short: D.R. Usmanova, N.S. Bogatyreva, J. Ariño Bernad, A.A. Eremina, A.A. Gorshkova,
    G.M. Kanevskiy, L.R. Lonishin, A.V. Meister, A.G. Yakupova, F. Kondrashov, D.
    Ivankov, Bioinformatics 34 (2018) 3653–3658.
das_tickbox: '1'
date_created: 2019-02-14T12:48:00Z
date_published: 2018-11-01T00:00:00Z
date_updated: 2026-07-06T13:48:02Z
day: '01'
ddc:
- '570'
department:
- _id: FyKo
doi: 10.1093/bioinformatics/bty340
ec_funded: 1
external_id:
  isi:
  - '000450038900008'
  pmid:
  - '29722803'
file:
- access_level: open_access
  checksum: 7e0495153f44211479674601d7f6ee03
  content_type: application/pdf
  creator: kschuh
  date_created: 2019-02-14T13:00:55Z
  date_updated: 2020-07-14T12:47:15Z
  file_id: '5997'
  file_name: 2018_Oxford_Usmanova.pdf
  file_size: 291969
  relation: main_file
file_date_updated: 2020-07-14T12:47:15Z
fulldoi: https://doi.org/10.1093/bioinformatics/bty340
has_accepted_license: '1'
intvolume: '        34'
isi: 1
issue: '21'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 3653-3658
pmid: 1
project:
- _id: 26120F5C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '335980'
  name: Systematic investigation of epistasis in molecular evolution
publication: Bioinformatics
publication_identifier:
  eissn:
  - 1367-4811
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Self-consistency test reveals systematic bias in programs for prediction change
  of stability upon mutation
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: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2018'
...
---
_id: '404'
abstract:
- lang: eng
  text: "We construct martingale solutions to stochastic thin-film equations by introducing
    a (spatial) semidiscretization and establishing convergence. The discrete scheme
    allows for variants of the energy and entropy estimates in the continuous setting
    as long as the discrete energy does not exceed certain threshold values depending
    on the spatial grid size $h$. Using a stopping time argument to prolongate high-energy
    paths constant in time, arbitrary moments of coupled energy/entropy functionals
    can be controlled. Having established Hölder regularity of approximate solutions,
    the convergence proof is then based on compactness arguments---in particular on
    Jakubowski's generalization of Skorokhod's theorem---weak convergence methods,
    and recent tools on martingale convergence.\r\n\r\n"
article_processing_charge: No
article_type: original
author:
- first_name: Julian L
  full_name: Fischer, Julian L
  id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
  last_name: Fischer
  orcid: 0000-0002-0479-558X
- first_name: Günther
  full_name: Grün, Günther
  last_name: Grün
citation:
  ama: Fischer JL, Grün G. Existence of positive solutions to stochastic thin-film
    equations. <i>SIAM Journal on Mathematical Analysis</i>. 2018;50(1):411-455. doi:<a
    href="https://doi.org/10.1137/16M1098796">10.1137/16M1098796</a>
  apa: Fischer, J. L., &#38; Grün, G. (2018). Existence of positive solutions to stochastic
    thin-film equations. <i>SIAM Journal on Mathematical Analysis</i>. Society for
    Industrial and Applied Mathematics. <a href="https://doi.org/10.1137/16M1098796">https://doi.org/10.1137/16M1098796</a>
  chicago: Fischer, Julian L, and Günther Grün. “Existence of Positive Solutions to
    Stochastic Thin-Film Equations.” <i>SIAM Journal on Mathematical Analysis</i>.
    Society for Industrial and Applied Mathematics, 2018. <a href="https://doi.org/10.1137/16M1098796">https://doi.org/10.1137/16M1098796</a>.
  ieee: J. L. Fischer and G. Grün, “Existence of positive solutions to stochastic
    thin-film equations,” <i>SIAM Journal on Mathematical Analysis</i>, vol. 50, no.
    1. Society for Industrial and Applied Mathematics, pp. 411–455, 2018.
  ista: Fischer JL, Grün G. 2018. Existence of positive solutions to stochastic thin-film
    equations. SIAM Journal on Mathematical Analysis. 50(1), 411–455.
  mla: Fischer, Julian L., and Günther Grün. “Existence of Positive Solutions to Stochastic
    Thin-Film Equations.” <i>SIAM Journal on Mathematical Analysis</i>, vol. 50, no.
    1, Society for Industrial and Applied Mathematics, 2018, pp. 411–55, doi:<a href="https://doi.org/10.1137/16M1098796">10.1137/16M1098796</a>.
  short: J.L. Fischer, G. Grün, SIAM Journal on Mathematical Analysis 50 (2018) 411–455.
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T11:46:17Z
date_published: 2018-01-30T00:00:00Z
date_updated: 2026-07-06T14:01:18Z
day: '30'
ddc:
- '510'
department:
- _id: JuFi
doi: 10.1137/16M1098796
external_id:
  isi:
  - '000426630900015'
file:
- access_level: open_access
  checksum: 89a8eae7c52bb356c04f52b44bff4b5a
  content_type: application/pdf
  creator: dernst
  date_created: 2019-11-07T12:20:25Z
  date_updated: 2020-07-14T12:46:22Z
  file_id: '6992'
  file_name: 2018_SIAM_Fischer.pdf
  file_size: 557338
  relation: main_file
file_date_updated: 2020-07-14T12:46:22Z
fulldoi: https://doi.org/10.1137/16M1098796
has_accepted_license: '1'
intvolume: '        50'
isi: 1
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 411 - 455
publication: SIAM Journal on Mathematical Analysis
publication_status: published
publisher: Society for Industrial and Applied Mathematics
publist_id: '7425'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Existence of positive solutions to stochastic thin-film equations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 50
year: '2018'
...
---
_id: '181'
abstract:
- lang: eng
  text: We consider large random matrices X with centered, independent entries but
    possibly di erent variances. We compute the normalized trace of f(X)g(X∗) for
    f, g functions analytic on the spectrum of X. We use these results to compute
    the long time asymptotics for systems of coupled di erential equations with random
    coe cients. We show that when the coupling is critical, the norm squared of the
    solution decays like t−1/2.
acknowledgement: The work of the second author was also partially supported by the
  Hausdorff Center of Mathematics.
article_processing_charge: No
arxiv: 1
author:
- 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
- first_name: Torben H
  full_name: Krüger, Torben H
  id: 3020C786-F248-11E8-B48F-1D18A9856A87
  last_name: Krüger
  orcid: 0000-0002-4821-3297
- first_name: David T
  full_name: Renfrew, David T
  id: 4845BF6A-F248-11E8-B48F-1D18A9856A87
  last_name: Renfrew
  orcid: 0000-0003-3493-121X
citation:
  ama: Erdös L, Krüger TH, Renfrew DT. Power law decay for systems of randomly coupled
    differential equations. <i>SIAM Journal on Mathematical Analysis</i>. 2018;50(3):3271-3290.
    doi:<a href="https://doi.org/10.1137/17M1143125">10.1137/17M1143125</a>
  apa: Erdös, L., Krüger, T. H., &#38; Renfrew, D. T. (2018). Power law decay for
    systems of randomly coupled differential equations. <i>SIAM Journal on Mathematical
    Analysis</i>. Society for Industrial and Applied Mathematics. <a href="https://doi.org/10.1137/17M1143125">https://doi.org/10.1137/17M1143125</a>
  chicago: Erdös, László, Torben H Krüger, and David T Renfrew. “Power Law Decay for
    Systems of Randomly Coupled Differential Equations.” <i>SIAM Journal on Mathematical
    Analysis</i>. Society for Industrial and Applied Mathematics, 2018. <a href="https://doi.org/10.1137/17M1143125">https://doi.org/10.1137/17M1143125</a>.
  ieee: L. Erdös, T. H. Krüger, and D. T. Renfrew, “Power law decay for systems of
    randomly coupled differential equations,” <i>SIAM Journal on Mathematical Analysis</i>,
    vol. 50, no. 3. Society for Industrial and Applied Mathematics, pp. 3271–3290,
    2018.
  ista: Erdös L, Krüger TH, Renfrew DT. 2018. Power law decay for systems of randomly
    coupled differential equations. SIAM Journal on Mathematical Analysis. 50(3),
    3271–3290.
  mla: Erdös, László, et al. “Power Law Decay for Systems of Randomly Coupled Differential
    Equations.” <i>SIAM Journal on Mathematical Analysis</i>, vol. 50, no. 3, Society
    for Industrial and Applied Mathematics, 2018, pp. 3271–90, doi:<a href="https://doi.org/10.1137/17M1143125">10.1137/17M1143125</a>.
  short: L. Erdös, T.H. Krüger, D.T. Renfrew, SIAM Journal on Mathematical Analysis
    50 (2018) 3271–3290.
das_tickbox: '1'
date_created: 2018-12-11T11:45:03Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2026-07-06T14:02:06Z
day: '01'
ddc:
- '500'
department:
- _id: LaEr
doi: 10.1137/17M1143125
ec_funded: 1
external_id:
  arxiv:
  - '1708.01546'
  isi:
  - '000437018500032'
fulldoi: https://doi.org/10.1137/17M1143125
intvolume: '        50'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1708.01546
month: '01'
oa: 1
oa_version: Published Version
page: 3271 - 3290
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '338804'
  name: Random matrices, universality and disordered quantum systems
- _id: 258F40A4-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: M02080
  name: Structured Non-Hermitian Random Matrices
publication: SIAM Journal on Mathematical Analysis
publication_status: published
publisher: Society for Industrial and Applied Mathematics
publist_id: '7740'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Power law decay for systems of randomly coupled differential equations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 50
year: '2018'
...
---
_id: '312'
abstract:
- lang: eng
  text: Motivated by biological questions, we study configurations of equal spheres
    that neither pack nor cover. Placing their centers on a lattice, we define the
    soft density of the configuration by penalizing multiple overlaps. Considering
    the 1-parameter family of diagonally distorted 3-dimensional integer lattices,
    we show that the soft density is maximized at the FCC lattice.
acknowledgement: This work was partially supported by the DFG Collaborative Research
  Center TRR 109, “Discretization in Geometry and Dynamics,” through grant I02979-N35
  of the Austrian Science Fund (FWF).
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
  full_name: Edelsbrunner, Herbert
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
- first_name: Mabel
  full_name: Iglesias Ham, Mabel
  id: 41B58C0C-F248-11E8-B48F-1D18A9856A87
  last_name: Iglesias Ham
citation:
  ama: Edelsbrunner H, Iglesias Ham M. On the optimality of the FCC lattice for soft
    sphere packing. <i>SIAM J Discrete Math</i>. 2018;32(1):750-782. doi:<a href="https://doi.org/10.1137/16M1097201">10.1137/16M1097201</a>
  apa: Edelsbrunner, H., &#38; Iglesias Ham, M. (2018). On the optimality of the FCC
    lattice for soft sphere packing. <i>SIAM J Discrete Math</i>. Society for Industrial
    and Applied Mathematics. <a href="https://doi.org/10.1137/16M1097201">https://doi.org/10.1137/16M1097201</a>
  chicago: Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the
    FCC Lattice for Soft Sphere Packing.” <i>SIAM J Discrete Math</i>. Society for
    Industrial and Applied Mathematics, 2018. <a href="https://doi.org/10.1137/16M1097201">https://doi.org/10.1137/16M1097201</a>.
  ieee: H. Edelsbrunner and M. Iglesias Ham, “On the optimality of the FCC lattice
    for soft sphere packing,” <i>SIAM J Discrete Math</i>, vol. 32, no. 1. Society
    for Industrial and Applied Mathematics, pp. 750–782, 2018.
  ista: Edelsbrunner H, Iglesias Ham M. 2018. On the optimality of the FCC lattice
    for soft sphere packing. SIAM J Discrete Math. 32(1), 750–782.
  mla: Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the FCC
    Lattice for Soft Sphere Packing.” <i>SIAM J Discrete Math</i>, vol. 32, no. 1,
    Society for Industrial and Applied Mathematics, 2018, pp. 750–82, doi:<a href="https://doi.org/10.1137/16M1097201">10.1137/16M1097201</a>.
  short: H. Edelsbrunner, M. Iglesias Ham, SIAM J Discrete Math 32 (2018) 750–782.
das_tickbox: '1'
date_created: 2018-12-11T11:45:46Z
date_published: 2018-03-29T00:00:00Z
date_updated: 2026-07-06T14:00:50Z
day: '29'
department:
- _id: HeEd
doi: 10.1137/16M1097201
external_id:
  isi:
  - '000428958900038'
fulldoi: https://doi.org/10.1137/16M1097201
intvolume: '        32'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://pdfs.semanticscholar.org/d2d5/6da00fbc674e6a8b1bb9d857167e54200dc6.pdf
month: '03'
oa: 1
oa_version: Submitted Version
page: 750 - 782
project:
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: I02979-N35
  name: Persistence and stability of geometric complexes
publication: SIAM J Discrete Math
publication_identifier:
  issn:
  - 0895-4801
publication_status: published
publisher: Society for Industrial and Applied Mathematics
publist_id: '7553'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the optimality of the FCC lattice for soft sphere packing
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2018'
...
---
_id: '22'
abstract:
- lang: eng
  text: Conventional ultra-high sensitivity detectors in the millimeter-wave range
    are usually cooled as their own thermal noise at room temperature would mask the
    weak received radiation. The need for cryogenic systems increases the cost and
    complexity of the instruments, hindering the development of, among others, airborne
    and space applications. In this work, the nonlinear parametric upconversion of
    millimeter-wave radiation to the optical domain inside high-quality (Q) lithium
    niobate whispering-gallery mode (WGM) resonators is proposed for ultra-low noise
    detection. We experimentally demonstrate coherent upconversion of millimeter-wave
    signals to a 1550 nm telecom carrier, with a photon conversion efficiency surpassing
    the state-of-the-art by 2 orders of magnitude. Moreover, a theoretical model shows
    that the thermal equilibrium of counterpropagating WGMs is broken by overcoupling
    the millimeter-wave WGM, effectively cooling the upconverted mode and allowing
    ultra-low noise detection. By theoretically estimating the sensitivity of a correlation
    radiometer based on the presented scheme, it is found that room-temperature radiometers
    with better sensitivity than state-of-the-art high-electron-mobility transistor
    (HEMT)-based radiometers can be designed. This detection paradigm can be used
    to develop room-temperature instrumentation for radio astronomy, earth observation,
    planetary missions, and imaging systems.
article_processing_charge: No
article_type: original
author:
- first_name: Gabriel
  full_name: Botello, Gabriel
  last_name: Botello
- first_name: Florian
  full_name: Sedlmeir, Florian
  last_name: Sedlmeir
- first_name: Alfredo R
  full_name: Rueda Sanchez, Alfredo R
  id: 3B82B0F8-F248-11E8-B48F-1D18A9856A87
  last_name: Rueda Sanchez
  orcid: 0000-0001-6249-5860
- first_name: Kerlos
  full_name: Abdalmalak, Kerlos
  last_name: Abdalmalak
- first_name: Elliott
  full_name: Brown, Elliott
  last_name: Brown
- first_name: Gerd
  full_name: Leuchs, Gerd
  last_name: Leuchs
- first_name: Sascha
  full_name: Preu, Sascha
  last_name: Preu
- first_name: Daniel
  full_name: Segovia Vargas, Daniel
  last_name: Segovia Vargas
- first_name: Dmitry
  full_name: Strekalov, Dmitry
  last_name: Strekalov
- first_name: Luis
  full_name: Munoz, Luis
  last_name: Munoz
- first_name: Harald
  full_name: Schwefel, Harald
  last_name: Schwefel
citation:
  ama: Botello G, Sedlmeir F, Rueda Sanchez AR, et al. Sensitivity limits of millimeter-wave
    photonic radiometers based on efficient electro-optic upconverters. <i>Optica</i>.
    2018;5(10):1210-1219. doi:<a href="https://doi.org/10.1364/OPTICA.5.001210">10.1364/OPTICA.5.001210</a>
  apa: Botello, G., Sedlmeir, F., Rueda Sanchez, A. R., Abdalmalak, K., Brown, E.,
    Leuchs, G., … Schwefel, H. (2018). Sensitivity limits of millimeter-wave photonic
    radiometers based on efficient electro-optic upconverters. <i>Optica</i>. Optica
    Publishing Group. <a href="https://doi.org/10.1364/OPTICA.5.001210">https://doi.org/10.1364/OPTICA.5.001210</a>
  chicago: Botello, Gabriel, Florian Sedlmeir, Alfredo R Rueda Sanchez, Kerlos Abdalmalak,
    Elliott Brown, Gerd Leuchs, Sascha Preu, et al. “Sensitivity Limits of Millimeter-Wave
    Photonic Radiometers Based on Efficient Electro-Optic Upconverters.” <i>Optica</i>.
    Optica Publishing Group, 2018. <a href="https://doi.org/10.1364/OPTICA.5.001210">https://doi.org/10.1364/OPTICA.5.001210</a>.
  ieee: G. Botello <i>et al.</i>, “Sensitivity limits of millimeter-wave photonic
    radiometers based on efficient electro-optic upconverters,” <i>Optica</i>, vol.
    5, no. 10. Optica Publishing Group, pp. 1210–1219, 2018.
  ista: Botello G, Sedlmeir F, Rueda Sanchez AR, Abdalmalak K, Brown E, Leuchs G,
    Preu S, Segovia Vargas D, Strekalov D, Munoz L, Schwefel H. 2018. Sensitivity
    limits of millimeter-wave photonic radiometers based on efficient electro-optic
    upconverters. Optica. 5(10), 1210–1219.
  mla: Botello, Gabriel, et al. “Sensitivity Limits of Millimeter-Wave Photonic Radiometers
    Based on Efficient Electro-Optic Upconverters.” <i>Optica</i>, vol. 5, no. 10,
    Optica Publishing Group, 2018, pp. 1210–19, doi:<a href="https://doi.org/10.1364/OPTICA.5.001210">10.1364/OPTICA.5.001210</a>.
  short: G. Botello, F. Sedlmeir, A.R. Rueda Sanchez, K. Abdalmalak, E. Brown, G.
    Leuchs, S. Preu, D. Segovia Vargas, D. Strekalov, L. Munoz, H. Schwefel, Optica
    5 (2018) 1210–1219.
das_tickbox: '1'
date_created: 2018-12-11T11:44:12Z
date_published: 2018-10-20T00:00:00Z
date_updated: 2026-07-07T06:22:34Z
day: '20'
ddc:
- '530'
department:
- _id: JoFi
doi: 10.1364/OPTICA.5.001210
external_id:
  isi:
  - '000447853100007'
fulldoi: https://doi.org/10.1364/OPTICA.5.001210
intvolume: '         5'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: 'www.doi.org/10.1364/OPTICA.5.001210 '
month: '10'
oa: 1
oa_version: Published Version
page: 1210-1219
publication: Optica
publication_identifier:
  issn:
  - 2334-2536
publication_status: published
publisher: Optica Publishing Group
publist_id: '8033'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sensitivity limits of millimeter-wave photonic radiometers based on efficient
  electro-optic upconverters
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2018'
...
---
_id: '5686'
abstract:
- lang: eng
  text: 'In the working paper I describe in detail the approach for Open Access definitions
    which was presented in the Workshop "Open Access Monitoring - Approaches and Perspectives"
    in Vienna. It defines five criteria on which are the definitions build. Each criteria
    can be out of 4 classes. The minimum classes for the criteria which are used in
    a Open Access definition can be presented as the Classification of Open Access
    Tuples e.g. Open Access (Berlin Declaration) (1,1,1,1,3) this methods allows much
    easier to distinguish between different Open Access definitions. This is needed
    if the Open Access Universe should be measured in studies or monitoring approaches
    and the results should become more comparable.     '
article_processing_charge: No
author:
- first_name: Patrick
  full_name: Danowski, Patrick
  id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
  last_name: Danowski
  orcid: 0000-0002-6026-4409
citation:
  ama: Danowski P. <i>An Austrian Proposal for the Classification of Open Access Tuples
    (COAT) - Distinguish Different Open Access Types beyond Colors</i>. Zenodo; 2018.
    doi:<a href="https://doi.org/10.5281/zenodo.1244154">10.5281/zenodo.1244154</a>
  apa: Danowski, P. (2018). <i>An Austrian proposal for the Classification of Open
    Access Tuples (COAT) - Distinguish different Open Access types beyond colors</i>.
    Zenodo. <a href="https://doi.org/10.5281/zenodo.1244154">https://doi.org/10.5281/zenodo.1244154</a>
  chicago: Danowski, Patrick. <i>An Austrian Proposal for the Classification of Open
    Access Tuples (COAT) - Distinguish Different Open Access Types beyond Colors</i>.
    Zenodo, 2018. <a href="https://doi.org/10.5281/zenodo.1244154">https://doi.org/10.5281/zenodo.1244154</a>.
  ieee: P. Danowski, <i>An Austrian proposal for the Classification of Open Access
    Tuples (COAT) - Distinguish different Open Access types beyond colors</i>. Zenodo,
    2018.
  ista: Danowski P. 2018. An Austrian proposal for the Classification of Open Access
    Tuples (COAT) - Distinguish different Open Access types beyond colors, Zenodo,
    5p.
  mla: Danowski, Patrick. <i>An Austrian Proposal for the Classification of Open Access
    Tuples (COAT) - Distinguish Different Open Access Types beyond Colors</i>. Zenodo,
    2018, doi:<a href="https://doi.org/10.5281/zenodo.1244154">10.5281/zenodo.1244154</a>.
  short: P. Danowski, An Austrian Proposal for the Classification of Open Access Tuples
    (COAT) - Distinguish Different Open Access Types beyond Colors, Zenodo, 2018.
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-17T10:28:26Z
date_published: 2018-05-09T00:00:00Z
date_updated: 2026-07-07T06:28:30Z
day: '09'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.5281/zenodo.1244154
file:
- access_level: open_access
  checksum: 6cb95f8772491d155ce77c6160655fff
  content_type: application/pdf
  creator: dernst
  date_created: 2019-01-22T09:06:51Z
  date_updated: 2020-07-14T12:47:10Z
  file_id: '5872'
  file_name: 2018_WorkingPaper_Danowski.pdf
  file_size: 202798
  relation: main_file
file_date_updated: 2020-07-14T12:47:10Z
fulldoi: https://doi.org/10.5281/zenodo.1244154
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '5'
publication_status: published
publisher: Zenodo
related_material:
  record:
  - id: '6657'
    relation: later_version
    status: public
scopus_import: '1'
status: public
title: An Austrian proposal for the Classification of Open Access Tuples (COAT) -
  Distinguish different Open Access types beyond colors
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: working_paper
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '58'
abstract:
- lang: eng
  text: 'Inside a two-dimensional region (``cake&quot;&quot;), there are m nonoverlapping
    tiles of a certain kind (``toppings&quot;&quot;). We want to expand the toppings
    while keeping them nonoverlapping, and possibly add some blank pieces of the same
    ``certain kind,&quot;&quot; such that the entire cake is covered. How many blanks
    must we add? We study this question in several cases: (1) The cake and toppings
    are general polygons. (2) The cake and toppings are convex figures. (3) The cake
    and toppings are axis-parallel rectangles. (4) The cake is an axis-parallel rectilinear
    polygon and the toppings are axis-parallel rectangles. In all four cases, we provide
    tight bounds on the number of blanks.'
article_processing_charge: No
arxiv: 1
author:
- first_name: Arseniy
  full_name: Akopyan, Arseniy
  id: 430D2C90-F248-11E8-B48F-1D18A9856A87
  last_name: Akopyan
  orcid: 0000-0002-2548-617X
- first_name: Erel
  full_name: Segal Halevi, Erel
  last_name: Segal Halevi
citation:
  ama: Akopyan A, Segal Halevi E. Counting blanks in polygonal arrangements. <i>SIAM
    Journal on Discrete Mathematics</i>. 2018;32(3):2242-2257. doi:<a href="https://doi.org/10.1137/16M110407X">10.1137/16M110407X</a>
  apa: Akopyan, A., &#38; Segal Halevi, E. (2018). Counting blanks in polygonal arrangements.
    <i>SIAM Journal on Discrete Mathematics</i>. Society for Industrial and Applied
    Mathematics. <a href="https://doi.org/10.1137/16M110407X">https://doi.org/10.1137/16M110407X</a>
  chicago: Akopyan, Arseniy, and Erel Segal Halevi. “Counting Blanks in Polygonal
    Arrangements.” <i>SIAM Journal on Discrete Mathematics</i>. Society for Industrial
    and Applied Mathematics, 2018. <a href="https://doi.org/10.1137/16M110407X">https://doi.org/10.1137/16M110407X</a>.
  ieee: A. Akopyan and E. Segal Halevi, “Counting blanks in polygonal arrangements,”
    <i>SIAM Journal on Discrete Mathematics</i>, vol. 32, no. 3. Society for Industrial
    and Applied Mathematics, pp. 2242–2257, 2018.
  ista: Akopyan A, Segal Halevi E. 2018. Counting blanks in polygonal arrangements.
    SIAM Journal on Discrete Mathematics. 32(3), 2242–2257.
  mla: Akopyan, Arseniy, and Erel Segal Halevi. “Counting Blanks in Polygonal Arrangements.”
    <i>SIAM Journal on Discrete Mathematics</i>, vol. 32, no. 3, Society for Industrial
    and Applied Mathematics, 2018, pp. 2242–57, doi:<a href="https://doi.org/10.1137/16M110407X">10.1137/16M110407X</a>.
  short: A. Akopyan, E. Segal Halevi, SIAM Journal on Discrete Mathematics 32 (2018)
    2242–2257.
date_created: 2018-12-11T11:44:24Z
date_published: 2018-09-06T00:00:00Z
date_updated: 2026-07-07T10:46:26Z
day: '06'
department:
- _id: HeEd
doi: 10.1137/16M110407X
ec_funded: 1
external_id:
  arxiv:
  - '1604.00960'
  isi:
  - '000450810500036'
fulldoi: https://doi.org/10.1137/16M110407X
intvolume: '        32'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1604.00960
month: '09'
oa: 1
oa_version: Preprint
page: 2242 - 2257
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
publication: SIAM Journal on Discrete Mathematics
publication_status: published
publisher: Society for Industrial and Applied Mathematics
publist_id: '7996'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Counting blanks in polygonal arrangements
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2018'
...
---
_id: '427'
abstract:
- lang: eng
  text: We investigate the quantum interference induced shifts between energetically
    close states in highly charged ions, with the energy structure being observed
    by laser spectroscopy. In this work, we focus on hyperfine states of lithiumlike
    heavy-Z isotopes and quantify how much quantum interference changes the observed
    transition frequencies. The process of photon excitation and subsequent photon
    decay for the transition 2s→2p→2s is implemented with fully relativistic and full-multipole
    frameworks, which are relevant for such relativistic atomic systems. We consider
    the isotopes Pb79+207 and Bi80+209 due to experimental interest, as well as other
    examples of isotopes with lower Z, namely Pr56+141 and Ho64+165. We conclude that
    quantum interference can induce shifts up to 11% of the linewidth in the measurable
    resonances of the considered isotopes, if interference between resonances is neglected.
    The inclusion of relativity decreases the cross section by 35%, mainly due to
    the complete retardation form of the electric dipole multipole. However, the contribution
    of the next higher multipoles (e.g., magnetic quadrupole) to the cross section
    is negligible. This makes the contribution of relativity and higher-order multipoles
    to the quantum interference induced shifts a minor effect, even for heavy-Z elements.
acknowledgement: "This work was funded by the Portuguese Fundação para a Ciência e
  a Tecnologia (FCT/MCTES/PIDDAC) under Grant No. UID/FIS/04559/2013 (LIBPhys). P.A.
  acknowledges the support of the FCT, under Contract No. SFRH/BPD/92329/2013. L.S.
  acknowledges financial support from the People Programme (Marie Curie Actions) of
  the European Union's Seventh Framework Programme (FP7/2007-2013) under REA Grant
  Agreement No. (291734). Laboratoire Kastler Brossel (LKB) is “Unité Mixte de Recherche
  de Sorbonne Université, de ENS-PSL Research University, du Collège de France et
  du CNRS No. 8552.” APPENDIX:\r\n"
article_number: '022510'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Pedro
  full_name: Amaro, Pedro
  last_name: Amaro
- first_name: Ulisses
  full_name: Loureiro, Ulisses
  last_name: Loureiro
- first_name: Laleh
  full_name: Safari, Laleh
  id: 3C325E5E-F248-11E8-B48F-1D18A9856A87
  last_name: Safari
- first_name: Filippo
  full_name: Fratini, Filippo
  last_name: Fratini
- first_name: Paul
  full_name: Indelicato, Paul
  last_name: Indelicato
- first_name: Thomas
  full_name: Stöhlker, Thomas
  last_name: Stöhlker
- first_name: José
  full_name: Santos, José
  last_name: Santos
citation:
  ama: Amaro P, Loureiro U, Safari L, et al. Quantum interference in laser spectroscopy
    of highly charged lithiumlike ions. <i>Physical Review A</i>. 2018;97(2). doi:<a
    href="https://doi.org/10.1103/PhysRevA.97.022510">10.1103/PhysRevA.97.022510</a>
  apa: Amaro, P., Loureiro, U., Safari, L., Fratini, F., Indelicato, P., Stöhlker,
    T., &#38; Santos, J. (2018). Quantum interference in laser spectroscopy of highly
    charged lithiumlike ions. <i>Physical Review A</i>. American Physical Society.
    <a href="https://doi.org/10.1103/PhysRevA.97.022510">https://doi.org/10.1103/PhysRevA.97.022510</a>
  chicago: Amaro, Pedro, Ulisses Loureiro, Laleh Safari, Filippo Fratini, Paul Indelicato,
    Thomas Stöhlker, and José Santos. “Quantum Interference in Laser Spectroscopy
    of Highly Charged Lithiumlike Ions.” <i>Physical Review A</i>. American Physical
    Society, 2018. <a href="https://doi.org/10.1103/PhysRevA.97.022510">https://doi.org/10.1103/PhysRevA.97.022510</a>.
  ieee: P. Amaro <i>et al.</i>, “Quantum interference in laser spectroscopy of highly
    charged lithiumlike ions,” <i>Physical Review A</i>, vol. 97, no. 2. American
    Physical Society, 2018.
  ista: Amaro P, Loureiro U, Safari L, Fratini F, Indelicato P, Stöhlker T, Santos
    J. 2018. Quantum interference in laser spectroscopy of highly charged lithiumlike
    ions. Physical Review A. 97(2), 022510.
  mla: Amaro, Pedro, et al. “Quantum Interference in Laser Spectroscopy of Highly
    Charged Lithiumlike Ions.” <i>Physical Review A</i>, vol. 97, no. 2, 022510, American
    Physical Society, 2018, doi:<a href="https://doi.org/10.1103/PhysRevA.97.022510">10.1103/PhysRevA.97.022510</a>.
  short: P. Amaro, U. Loureiro, L. Safari, F. Fratini, P. Indelicato, T. Stöhlker,
    J. Santos, Physical Review A 97 (2018).
das_tickbox: '1'
date_created: 2018-12-11T11:46:25Z
date_published: 2018-02-21T00:00:00Z
date_updated: 2026-07-07T13:17:14Z
day: '21'
department:
- _id: MiLe
doi: 10.1103/PhysRevA.97.022510
ec_funded: 1
external_id:
  arxiv:
  - '1802.07920'
  isi:
  - '000425601000004'
fulldoi: https://doi.org/10.1103/PhysRevA.97.022510
intvolume: '        97'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1802.07920
month: '02'
oa: 1
oa_version: Preprint
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
publication: Physical Review A
publication_status: published
publisher: American Physical Society
publist_id: '7396'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantum interference in laser spectroscopy of highly charged lithiumlike ions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 97
year: '2018'
...
---
_id: '307'
abstract:
- lang: eng
  text: 'Spontaneous emission spectra of two initially excited closely spaced identical
    atoms are very sensitive to the strength and the direction of the applied magnetic
    field. We consider the relevant schemes that ensure the determination of the mutual
    spatial orientation of the atoms and the distance between them by entirely optical
    means. A corresponding theoretical description is given accounting for the dipole-dipole
    interaction between the two atoms in the presence of a magnetic field and for
    polarizations of the quantum field interacting with magnetic sublevels of the
    two-atom system. '
acknowledgement: The work was partially supported by Russian Foundation for Basic
  Research (Grant No. 15-02-05657a) and by the Basic research program of Higher School
  of Economics (HSE).
article_number: ' 043812 '
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Elena
  full_name: Redchenko, Elena
  id: 2C21D6E8-F248-11E8-B48F-1D18A9856A87
  last_name: Redchenko
- first_name: Alexander
  full_name: Makarov, Alexander
  last_name: Makarov
- first_name: Vladimir
  full_name: Yudson, Vladimir
  last_name: Yudson
citation:
  ama: Redchenko E, Makarov A, Yudson V. Nanoscopy of pairs of atoms by fluorescence
    in a magnetic field. <i>Physical Review A</i>. 2018;97(4). doi:<a href="https://doi.org/10.1103/PhysRevA.97.043812">10.1103/PhysRevA.97.043812</a>
  apa: Redchenko, E., Makarov, A., &#38; Yudson, V. (2018). Nanoscopy of pairs of
    atoms by fluorescence in a magnetic field. <i>Physical Review A</i>. American
    Physical Society. <a href="https://doi.org/10.1103/PhysRevA.97.043812">https://doi.org/10.1103/PhysRevA.97.043812</a>
  chicago: Redchenko, Elena, Alexander Makarov, and Vladimir Yudson. “Nanoscopy of
    Pairs of Atoms by Fluorescence in a Magnetic Field.” <i>Physical Review A</i>.
    American Physical Society, 2018. <a href="https://doi.org/10.1103/PhysRevA.97.043812">https://doi.org/10.1103/PhysRevA.97.043812</a>.
  ieee: E. Redchenko, A. Makarov, and V. Yudson, “Nanoscopy of pairs of atoms by fluorescence
    in a magnetic field,” <i>Physical Review A</i>, vol. 97, no. 4. American Physical
    Society, 2018.
  ista: Redchenko E, Makarov A, Yudson V. 2018. Nanoscopy of pairs of atoms by fluorescence
    in a magnetic field. Physical Review A. 97(4), 043812.
  mla: Redchenko, Elena, et al. “Nanoscopy of Pairs of Atoms by Fluorescence in a
    Magnetic Field.” <i>Physical Review A</i>, vol. 97, no. 4, 043812, American Physical
    Society, 2018, doi:<a href="https://doi.org/10.1103/PhysRevA.97.043812">10.1103/PhysRevA.97.043812</a>.
  short: E. Redchenko, A. Makarov, V. Yudson, Physical Review A 97 (2018).
das_tickbox: '1'
date_created: 2018-12-11T11:45:44Z
date_published: 2018-04-09T00:00:00Z
date_updated: 2026-07-07T13:16:52Z
day: '09'
department:
- _id: JoFi
doi: 10.1103/PhysRevA.97.043812
external_id:
  arxiv:
  - '1712.10127'
  isi:
  - '000429454000015'
fulldoi: https://doi.org/10.1103/PhysRevA.97.043812
intvolume: '        97'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1712.10127
month: '04'
oa: 1
oa_version: Submitted Version
publication: Physical Review A
publication_status: published
publisher: American Physical Society
publist_id: '7572'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nanoscopy of pairs of atoms by fluorescence in a magnetic field
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 97
year: '2018'
...
---
_id: '34'
abstract:
- lang: eng
  text: Partially observable Markov decision processes (POMDPs) are widely used in
    probabilistic planning problems in which an agent interacts with an environment
    using noisy and imprecise sensors. We study a setting in which the sensors are
    only partially defined and the goal is to synthesize “weakest” additional sensors,
    such that in the resulting POMDP, there is a small-memory policy for the agent
    that almost-surely (with probability 1) satisfies a reachability objective. We
    show that the problem is NP-complete, and present a symbolic algorithm by encoding
    the problem into SAT instances. We illustrate trade-offs between the amount of
    memory of the policy and the number of additional sensors on a simple example.
    We have implemented our approach and consider three classical POMDP examples from
    the literature, and show that in all the examples the number of sensors can be
    significantly decreased (as compared to the existing solutions in the literature)
    without increasing the complexity of the policies.
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Martin
  full_name: Chemlík, Martin
  last_name: Chemlík
- first_name: Ufuk
  full_name: Topcu, Ufuk
  last_name: Topcu
citation:
  ama: 'Chatterjee K, Chemlík M, Topcu U. Sensor synthesis for POMDPs with reachability
    objectives. In: <i>28th International Conference on Automated Planning and Scheduling</i>.
    Vol 2018. AAAI Press; 2018:47-55. doi:<a href="https://doi.org/10.1609/icaps.v28i1.13875">10.1609/icaps.v28i1.13875</a>'
  apa: 'Chatterjee, K., Chemlík, M., &#38; Topcu, U. (2018). Sensor synthesis for
    POMDPs with reachability objectives. In <i>28th International Conference on Automated
    Planning and Scheduling</i> (Vol. 2018, pp. 47–55). Delft, Netherlands: AAAI Press.
    <a href="https://doi.org/10.1609/icaps.v28i1.13875">https://doi.org/10.1609/icaps.v28i1.13875</a>'
  chicago: Chatterjee, Krishnendu, Martin Chemlík, and Ufuk Topcu. “Sensor Synthesis
    for POMDPs with Reachability Objectives.” In <i>28th International Conference
    on Automated Planning and Scheduling</i>, 2018:47–55. AAAI Press, 2018. <a href="https://doi.org/10.1609/icaps.v28i1.13875">https://doi.org/10.1609/icaps.v28i1.13875</a>.
  ieee: K. Chatterjee, M. Chemlík, and U. Topcu, “Sensor synthesis for POMDPs with
    reachability objectives,” in <i>28th International Conference on Automated Planning
    and Scheduling</i>, Delft, Netherlands, 2018, vol. 2018, pp. 47–55.
  ista: 'Chatterjee K, Chemlík M, Topcu U. 2018. Sensor synthesis for POMDPs with
    reachability objectives. 28th International Conference on Automated Planning and
    Scheduling. ICAPS: International Conference on Automated Planning and Scheduling
    vol. 2018, 47–55.'
  mla: Chatterjee, Krishnendu, et al. “Sensor Synthesis for POMDPs with Reachability
    Objectives.” <i>28th International Conference on Automated Planning and Scheduling</i>,
    vol. 2018, AAAI Press, 2018, pp. 47–55, doi:<a href="https://doi.org/10.1609/icaps.v28i1.13875">10.1609/icaps.v28i1.13875</a>.
  short: K. Chatterjee, M. Chemlík, U. Topcu, in:, 28th International Conference on
    Automated Planning and Scheduling, AAAI Press, 2018, pp. 47–55.
conference:
  end_date: 2018-06-29
  location: Delft, Netherlands
  name: 'ICAPS: International Conference on Automated Planning and Scheduling'
  start_date: 2018-06-24
das_tickbox: '1'
date_created: 2018-12-11T11:44:16Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2026-07-07T13:35:51Z
day: '01'
department:
- _id: KrCh
doi: 10.1609/icaps.v28i1.13875
ec_funded: 1
external_id:
  arxiv:
  - '1710.00675'
  isi:
  - '000492986200006'
fulldoi: https://doi.org/10.1609/icaps.v28i1.13875
intvolume: '      2018'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1710.00675
month: '06'
oa: 1
oa_version: Preprint
page: 47 - 55
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P 23499-N23
  name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '279307'
  name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 2587B514-B435-11E9-9278-68D0E5697425
  name: Microsoft Research Faculty Fellowship
publication: 28th International Conference on Automated Planning and Scheduling
publication_status: published
publisher: AAAI Press
publist_id: '8021'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sensor synthesis for POMDPs with reachability objectives
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2018
year: '2018'
...
---
_id: '35'
abstract:
- lang: eng
  text: 'We consider planning problems for graphs, Markov decision processes (MDPs),
    and games on graphs. While graphs represent the most basic planning model, MDPs
    represent interaction with nature and games on graphs represent interaction with
    an adversarial environment. We consider two planning problems where there are
    k different target sets, and the problems are as follows: (a) the coverage problem
    asks whether there is a plan for each individual target set; and (b) the sequential
    target reachability problem asks whether the targets can be reached in sequence.
    For the coverage problem, we present a linear-time algorithm for graphs, and quadratic
    conditional lower bound for MDPs and games on graphs. For the sequential target
    problem, we present a linear-time algorithm for graphs, a sub-quadratic algorithm
    for MDPs, and a quadratic conditional lower bound for games on graphs. Our results
    with conditional lower bounds establish (i) model-separation results showing that
    for the coverage problem MDPs and games on graphs are harder than graphs and for
    the sequential reachability problem games on graphs are harder than MDPs and graphs;
    and (ii) objective-separation results showing that for MDPs the coverage problem
    is harder than the sequential target problem.'
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Wolfgang
  full_name: Dvorák, Wolfgang
  last_name: Dvorák
- 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: Alexander
  full_name: Svozil, Alexander
  last_name: Svozil
citation:
  ama: 'Chatterjee K, Dvorák W, Henzinger M, Svozil A. Algorithms and conditional
    lower bounds for planning problems. In: <i>28th International Conference on Automated
    Planning and Scheduling</i>. AAAI Press; 2018.'
  apa: 'Chatterjee, K., Dvorák, W., Henzinger, M., &#38; Svozil, A. (2018). Algorithms
    and conditional lower bounds for planning problems. In <i>28th International Conference
    on Automated Planning and Scheduling</i>. Delft, Netherlands: AAAI Press.'
  chicago: Chatterjee, Krishnendu, Wolfgang Dvorák, Monika Henzinger, and Alexander
    Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” In <i>28th
    International Conference on Automated Planning and Scheduling</i>. AAAI Press,
    2018.
  ieee: K. Chatterjee, W. Dvorák, M. Henzinger, and A. Svozil, “Algorithms and conditional
    lower bounds for planning problems,” in <i>28th International Conference on Automated
    Planning and Scheduling</i>, Delft, Netherlands, 2018.
  ista: 'Chatterjee K, Dvorák W, Henzinger M, Svozil A. 2018. Algorithms and conditional
    lower bounds for planning problems. 28th International Conference on Automated
    Planning and Scheduling. ICAPS: International Conference on Automated Planning
    and Scheduling.'
  mla: Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for
    Planning Problems.” <i>28th International Conference on Automated Planning and
    Scheduling</i>, AAAI Press, 2018.
  short: K. Chatterjee, W. Dvorák, M. Henzinger, A. Svozil, in:, 28th International
    Conference on Automated Planning and Scheduling, AAAI Press, 2018.
conference:
  end_date: 2018-06-29
  location: Delft, Netherlands
  name: 'ICAPS: International Conference on Automated Planning and Scheduling'
  start_date: 2018-06-24
das_tickbox: '1'
date_created: 2018-12-11T11:44:17Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2026-07-07T13:36:04Z
day: '01'
department:
- _id: KrCh
ec_funded: 1
external_id:
  arxiv:
  - '1804.07031'
  isi:
  - '000492986200007'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1804.07031
month: '06'
oa: 1
oa_version: Preprint
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '279307'
  name: 'Quantitative Graph Games: Theory and Applications'
publication: 28th International Conference on Automated Planning and Scheduling
publication_status: published
publisher: AAAI Press
publist_id: '8020'
quality_controlled: '1'
related_material:
  record:
  - id: '9293'
    relation: later_version
    status: public
scopus_import: '1'
status: public
title: Algorithms and conditional lower bounds for planning problems
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '12'
abstract:
- lang: eng
  text: Molding is a popular mass production method, in which the initial expenses
    for the mold are offset by the low per-unit production cost. However, the physical
    fabrication constraints of the molding technique commonly restrict the shape of
    moldable objects. For a complex shape, a decomposition of the object into moldable
    parts is a common strategy to address these constraints, with plastic model kits
    being a popular and illustrative example. However, conducting such a decomposition
    requires considerable expertise, and it depends on the technical aspects of the
    fabrication technique, as well as aesthetic considerations. We present an interactive
    technique to create such decompositions for two-piece molding, in which each part
    of the object is cast between two rigid mold pieces. Given the surface description
    of an object, we decompose its thin-shell equivalent into moldable parts by first
    performing a coarse decomposition and then utilizing an active contour model for
    the boundaries between individual parts. Formulated as an optimization problem,
    the movement of the contours is guided by an energy reflecting fabrication constraints
    to ensure the moldability of each part. Simultaneously, the user is provided with
    editing capabilities to enforce aesthetic guidelines. Our interactive interface
    provides control of the contour positions by allowing, for example, the alignment
    of part boundaries with object features. Our technique enables a novel workflow,
    as it empowers novice users to explore the design space, and it generates fabrication-ready
    two-piece molds that can be used either for casting or industrial injection molding
    of free-form objects.
article_number: '135'
article_processing_charge: No
author:
- first_name: Kazutaka
  full_name: Nakashima, Kazutaka
  last_name: Nakashima
- first_name: Thomas
  full_name: Auzinger, Thomas
  id: 4718F954-F248-11E8-B48F-1D18A9856A87
  last_name: Auzinger
  orcid: 0000-0002-1546-3265
- first_name: Emmanuel
  full_name: Iarussi, Emmanuel
  id: 33F19F16-F248-11E8-B48F-1D18A9856A87
  last_name: Iarussi
  orcid: 0000-0001-7438-9299
- first_name: Ran
  full_name: Zhang, Ran
  id: 4DDBCEB0-F248-11E8-B48F-1D18A9856A87
  last_name: Zhang
  orcid: 0000-0002-3808-281X
- first_name: Takeo
  full_name: Igarashi, Takeo
  last_name: Igarashi
- first_name: Bernd
  full_name: Bickel, Bernd
  id: 49876194-F248-11E8-B48F-1D18A9856A87
  last_name: Bickel
  orcid: 0000-0001-6511-9385
citation:
  ama: 'Nakashima K, Auzinger T, Iarussi E, Zhang R, Igarashi T, Bickel B. CoreCavity:
    Interactive shell decomposition for fabrication with two-piece rigid molds. <i>ACM
    Transactions on Graphics</i>. 2018;37(4). doi:<a href="https://doi.org/10.1145/3197517.3201341">10.1145/3197517.3201341</a>'
  apa: 'Nakashima, K., Auzinger, T., Iarussi, E., Zhang, R., Igarashi, T., &#38; Bickel,
    B. (2018). CoreCavity: Interactive shell decomposition for fabrication with two-piece
    rigid molds. <i>ACM Transactions on Graphics</i>. ACM. <a href="https://doi.org/10.1145/3197517.3201341">https://doi.org/10.1145/3197517.3201341</a>'
  chicago: 'Nakashima, Kazutaka, Thomas Auzinger, Emmanuel Iarussi, Ran Zhang, Takeo
    Igarashi, and Bernd Bickel. “CoreCavity: Interactive Shell Decomposition for Fabrication
    with Two-Piece Rigid Molds.” <i>ACM Transactions on Graphics</i>. ACM, 2018. <a
    href="https://doi.org/10.1145/3197517.3201341">https://doi.org/10.1145/3197517.3201341</a>.'
  ieee: 'K. Nakashima, T. Auzinger, E. Iarussi, R. Zhang, T. Igarashi, and B. Bickel,
    “CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid
    molds,” <i>ACM Transactions on Graphics</i>, vol. 37, no. 4. ACM, 2018.'
  ista: 'Nakashima K, Auzinger T, Iarussi E, Zhang R, Igarashi T, Bickel B. 2018.
    CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid
    molds. ACM Transactions on Graphics. 37(4), 135.'
  mla: 'Nakashima, Kazutaka, et al. “CoreCavity: Interactive Shell Decomposition for
    Fabrication with Two-Piece Rigid Molds.” <i>ACM Transactions on Graphics</i>,
    vol. 37, no. 4, 135, ACM, 2018, doi:<a href="https://doi.org/10.1145/3197517.3201341">10.1145/3197517.3201341</a>.'
  short: K. Nakashima, T. Auzinger, E. Iarussi, R. Zhang, T. Igarashi, B. Bickel,
    ACM Transactions on Graphics 37 (2018).
date_created: 2018-12-11T11:44:09Z
date_published: 2018-08-04T00:00:00Z
date_updated: 2026-07-07T14:00:35Z
day: '04'
ddc:
- '004'
- '516'
- '670'
department:
- _id: BeBi
doi: 10.1145/3197517.3201341
ec_funded: 1
external_id:
  isi:
  - '000448185000096'
file:
- access_level: open_access
  checksum: 6a5368bc86c4e1a9fcfe588fd1f14ee8
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:18:38Z
  date_updated: 2020-07-14T12:44:38Z
  file_id: '5360'
  file_name: IST-2018-1037-v1+1_CoreCavity-AuthorVersion.pdf
  file_size: 104225664
  relation: main_file
- access_level: open_access
  checksum: 3861e693ba47c51f3ec7b7867d573a61
  content_type: application/zip
  creator: system
  date_created: 2018-12-12T10:18:39Z
  date_updated: 2020-07-14T12:44:38Z
  file_id: '5361'
  file_name: IST-2018-1037-v1+2_CoreCavity-Supplemental.zip
  file_size: 377743553
  relation: main_file
- access_level: open_access
  checksum: 490040c685ed869536e2a18f5a906b94
  content_type: video/vnd.objectvideo
  creator: system
  date_created: 2018-12-12T10:18:41Z
  date_updated: 2020-07-14T12:44:38Z
  file_id: '5362'
  file_name: IST-2018-1037-v1+3_CoreCavity-Video.mp4
  file_size: 162634396
  relation: main_file
- access_level: open_access
  checksum: be7fc8b229adda727419b6504b3b9352
  content_type: image/jpeg
  creator: system
  date_created: 2018-12-12T10:18:42Z
  date_updated: 2020-07-14T12:44:38Z
  file_id: '5363'
  file_name: IST-2018-1037-v1+4_CoreCavity-RepresentativeImage.jpg
  file_size: 527972
  relation: main_file
file_date_updated: 2020-07-14T12:44:38Z
fulldoi: https://doi.org/10.1145/3197517.3201341
has_accepted_license: '1'
intvolume: '        37'
isi: 1
issue: '4'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
project:
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '715767'
  name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
    Modeling'
- _id: 2508E324-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '642841'
  name: Distributed 3D Object Design
publication: ACM Transactions on Graphics
publication_status: published
publisher: ACM
publist_id: '8044'
pubrep_id: '1037'
quality_controlled: '1'
related_material:
  link:
  - description: News on IST Homepage
    relation: press_release
    url: https://ist.ac.at/en/news/interactive-software-tool-makes-complex-mold-design-simple/
scopus_import: '1'
status: public
title: 'CoreCavity: Interactive shell decomposition for fabrication with two-piece
  rigid molds'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2018'
...
---
_id: '4'
abstract:
- lang: eng
  text: We present a data-driven technique to instantly predict how fluid flows around
    various three-dimensional objects. Such simulation is useful for computational
    fabrication and engineering, but is usually computationally expensive since it
    requires solving the Navier-Stokes equation for many time steps. To accelerate
    the process, we propose a machine learning framework which predicts aerodynamic
    forces and velocity and pressure fields given a threedimensional shape input.
    Handling detailed free-form three-dimensional shapes in a data-driven framework
    is challenging because machine learning approaches usually require a consistent
    parametrization of input and output. We present a novel PolyCube maps-based parametrization
    that can be computed for three-dimensional shapes at interactive rates. This allows
    us to efficiently learn the nonlinear response of the flow using a Gaussian process
    regression. We demonstrate the effectiveness of our approach for the interactive
    design and optimization of a car body.
article_number: '89'
article_processing_charge: No
author:
- first_name: Nobuyuki
  full_name: Umetani, Nobuyuki
  last_name: Umetani
- first_name: Bernd
  full_name: Bickel, Bernd
  id: 49876194-F248-11E8-B48F-1D18A9856A87
  last_name: Bickel
  orcid: 0000-0001-6511-9385
citation:
  ama: Umetani N, Bickel B. Learning three-dimensional flow for interactive aerodynamic
    design. <i>ACM Transactions on Graphics</i>. 2018;37(4). doi:<a href="https://doi.org/10.1145/3197517.3201325">10.1145/3197517.3201325</a>
  apa: Umetani, N., &#38; Bickel, B. (2018). Learning three-dimensional flow for interactive
    aerodynamic design. <i>ACM Transactions on Graphics</i>. ACM. <a href="https://doi.org/10.1145/3197517.3201325">https://doi.org/10.1145/3197517.3201325</a>
  chicago: Umetani, Nobuyuki, and Bernd Bickel. “Learning Three-Dimensional Flow for
    Interactive Aerodynamic Design.” <i>ACM Transactions on Graphics</i>. ACM, 2018.
    <a href="https://doi.org/10.1145/3197517.3201325">https://doi.org/10.1145/3197517.3201325</a>.
  ieee: N. Umetani and B. Bickel, “Learning three-dimensional flow for interactive
    aerodynamic design,” <i>ACM Transactions on Graphics</i>, vol. 37, no. 4. ACM,
    2018.
  ista: Umetani N, Bickel B. 2018. Learning three-dimensional flow for interactive
    aerodynamic design. ACM Transactions on Graphics. 37(4), 89.
  mla: Umetani, Nobuyuki, and Bernd Bickel. “Learning Three-Dimensional Flow for Interactive
    Aerodynamic Design.” <i>ACM Transactions on Graphics</i>, vol. 37, no. 4, 89,
    ACM, 2018, doi:<a href="https://doi.org/10.1145/3197517.3201325">10.1145/3197517.3201325</a>.
  short: N. Umetani, B. Bickel, ACM Transactions on Graphics 37 (2018).
das_tickbox: '1'
date_created: 2018-12-11T11:44:06Z
date_published: 2018-08-04T00:00:00Z
date_updated: 2026-07-07T13:58:59Z
day: '04'
ddc:
- '003'
- '004'
department:
- _id: BeBi
doi: 10.1145/3197517.3201325
ec_funded: 1
external_id:
  isi:
  - '000448185000050'
file:
- access_level: open_access
  checksum: 7a2243668f215821bc6aecad0320079a
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:16:28Z
  date_updated: 2020-07-14T12:46:22Z
  file_id: '5216'
  file_name: IST-2018-1049-v1+1_2018_sigg_Learning3DAerodynamics.pdf
  file_size: 22803163
  relation: main_file
file_date_updated: 2020-07-14T12:46:22Z
fulldoi: https://doi.org/10.1145/3197517.3201325
has_accepted_license: '1'
intvolume: '        37'
isi: 1
issue: '4'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
project:
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '715767'
  name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
    Modeling'
publication: ACM Transactions on Graphics
publication_status: published
publisher: ACM
publist_id: '8053'
pubrep_id: '1049'
quality_controlled: '1'
related_material:
  link:
  - description: News on IST Homepage
    relation: press_release
    url: https://ist.ac.at/en/news/new-interactive-machine-learning-tool-makes-car-designs-more-aerodynamic/
scopus_import: '1'
status: public
title: Learning three-dimensional flow for interactive aerodynamic design
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2018'
...
---
_id: '13'
abstract:
- lang: eng
  text: We propose a new method for fabricating digital objects through reusable silicone
    molds. Molds are generated by casting liquid silicone into custom 3D printed containers
    called metamolds. Metamolds automatically define the cuts that are needed to extract
    the cast object from the silicone mold. The shape of metamolds is designed through
    a novel segmentation technique, which takes into account both geometric and topological
    constraints involved in the process of mold casting. Our technique is simple,
    does not require changing the shape or topology of the input objects, and only
    requires off-the- shelf materials and technologies. We successfully tested our
    method on a set of challenging examples with complex shapes and rich geometric
    detail. © 2018 Association for Computing Machinery.
article_number: '136'
article_processing_charge: No
author:
- first_name: Thomas
  full_name: Alderighi, Thomas
  last_name: Alderighi
- first_name: Luigi
  full_name: Malomo, Luigi
  last_name: Malomo
- first_name: Daniela
  full_name: Giorgi, Daniela
  last_name: Giorgi
- first_name: Nico
  full_name: Pietroni, Nico
  last_name: Pietroni
- first_name: Bernd
  full_name: Bickel, Bernd
  id: 49876194-F248-11E8-B48F-1D18A9856A87
  last_name: Bickel
  orcid: 0000-0001-6511-9385
- first_name: Paolo
  full_name: Cignoni, Paolo
  last_name: Cignoni
citation:
  ama: 'Alderighi T, Malomo L, Giorgi D, Pietroni N, Bickel B, Cignoni P. Metamolds:
    Computational design of silicone molds. <i>ACM Transactions on Graphics</i>. 2018;37(4).
    doi:<a href="https://doi.org/10.1145/3197517.3201381">10.1145/3197517.3201381</a>'
  apa: 'Alderighi, T., Malomo, L., Giorgi, D., Pietroni, N., Bickel, B., &#38; Cignoni,
    P. (2018). Metamolds: Computational design of silicone molds. <i>ACM Transactions
    on Graphics</i>. ACM. <a href="https://doi.org/10.1145/3197517.3201381">https://doi.org/10.1145/3197517.3201381</a>'
  chicago: 'Alderighi, Thomas, Luigi Malomo, Daniela Giorgi, Nico Pietroni, Bernd
    Bickel, and Paolo Cignoni. “Metamolds: Computational Design of Silicone Molds.”
    <i>ACM Transactions on Graphics</i>. ACM, 2018. <a href="https://doi.org/10.1145/3197517.3201381">https://doi.org/10.1145/3197517.3201381</a>.'
  ieee: 'T. Alderighi, L. Malomo, D. Giorgi, N. Pietroni, B. Bickel, and P. Cignoni,
    “Metamolds: Computational design of silicone molds,” <i>ACM Transactions on Graphics</i>,
    vol. 37, no. 4. ACM, 2018.'
  ista: 'Alderighi T, Malomo L, Giorgi D, Pietroni N, Bickel B, Cignoni P. 2018. Metamolds:
    Computational design of silicone molds. ACM Transactions on Graphics. 37(4), 136.'
  mla: 'Alderighi, Thomas, et al. “Metamolds: Computational Design of Silicone Molds.”
    <i>ACM Transactions on Graphics</i>, vol. 37, no. 4, 136, ACM, 2018, doi:<a href="https://doi.org/10.1145/3197517.3201381">10.1145/3197517.3201381</a>.'
  short: T. Alderighi, L. Malomo, D. Giorgi, N. Pietroni, B. Bickel, P. Cignoni, ACM
    Transactions on Graphics 37 (2018).
das_tickbox: '1'
date_created: 2018-12-11T11:44:09Z
date_published: 2018-08-04T00:00:00Z
date_updated: 2026-07-07T13:59:14Z
day: '04'
ddc:
- '004'
department:
- _id: BeBi
doi: 10.1145/3197517.3201381
ec_funded: 1
external_id:
  isi:
  - '000448185000097'
file:
- access_level: open_access
  checksum: 61d46273dca4de626accef1d17a0aaad
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:18:52Z
  date_updated: 2020-07-14T12:44:43Z
  file_id: '5374'
  file_name: IST-2018-1038-v1+1_metamolds_authorversion.pdf
  file_size: 91939066
  relation: main_file
file_date_updated: 2020-07-14T12:44:43Z
fulldoi: https://doi.org/10.1145/3197517.3201381
has_accepted_license: '1'
intvolume: '        37'
isi: 1
issue: '4'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
project:
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '715767'
  name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
    Modeling'
publication: ACM Transactions on Graphics
publication_status: published
publisher: ACM
publist_id: '8043'
pubrep_id: '1038'
quality_controlled: '1'
related_material:
  link:
  - description: News on IST Homepage
    relation: press_release
    url: https://ist.ac.at/en/news/metamolds-molding-a-mold/
scopus_import: '1'
status: public
title: 'Metamolds: Computational design of silicone molds'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2018'
...
