---
_id: '12933'
abstract:
- lang: eng
  text: Datasets of the publication "Sex-specific estimation of cis and trans regulation
    of gene expression in heads and gonads of Drosophila melanogaster".
article_processing_charge: No
author:
- first_name: Gemma
  full_name: Puixeu Sala, Gemma
  id: 33AB266C-F248-11E8-B48F-1D18A9856A87
  last_name: Puixeu Sala
  orcid: 0000-0001-8330-1754
citation:
  ama: 'Puixeu Sala G. Data from: Sex-specific estimation of cis and trans regulation
    of gene expression in heads and gonads of Drosophila melanogaster. 2023. doi:<a
    href="https://doi.org/10.15479/AT:ISTA:12933">10.15479/AT:ISTA:12933</a>'
  apa: 'Puixeu Sala, G. (2023). Data from: Sex-specific estimation of cis and trans
    regulation of gene expression in heads and gonads of Drosophila melanogaster.
    Institute of Science and Technology Austria. <a href="https://doi.org/10.15479/AT:ISTA:12933">https://doi.org/10.15479/AT:ISTA:12933</a>'
  chicago: 'Puixeu Sala, Gemma. “Data from: Sex-Specific Estimation of Cis and Trans
    Regulation of Gene Expression in Heads and Gonads of Drosophila Melanogaster.”
    Institute of Science and Technology Austria, 2023. <a href="https://doi.org/10.15479/AT:ISTA:12933">https://doi.org/10.15479/AT:ISTA:12933</a>.'
  ieee: 'G. Puixeu Sala, “Data from: Sex-specific estimation of cis and trans regulation
    of gene expression in heads and gonads of Drosophila melanogaster.” Institute
    of Science and Technology Austria, 2023.'
  ista: 'Puixeu Sala G. 2023. Data from: Sex-specific estimation of cis and trans
    regulation of gene expression in heads and gonads of Drosophila melanogaster,
    Institute of Science and Technology Austria, <a href="https://doi.org/10.15479/AT:ISTA:12933">10.15479/AT:ISTA:12933</a>.'
  mla: 'Puixeu Sala, Gemma. <i>Data from: Sex-Specific Estimation of Cis and Trans
    Regulation of Gene Expression in Heads and Gonads of Drosophila Melanogaster</i>.
    Institute of Science and Technology Austria, 2023, doi:<a href="https://doi.org/10.15479/AT:ISTA:12933">10.15479/AT:ISTA:12933</a>.'
  short: G. Puixeu Sala, (2023).
contributor:
- first_name: Ariana
  id: 2A0848E2-F248-11E8-B48F-1D18A9856A87
  last_name: Macon
- first_name: Beatriz
  id: 49E1C5C6-F248-11E8-B48F-1D18A9856A87
  last_name: Vicoso
  orcid: 0000-0002-4579-8306
date_created: 2023-05-10T10:00:49Z
date_published: 2023-05-15T00:00:00Z
date_updated: 2023-12-13T12:15:36Z
day: '15'
ddc:
- '570'
department:
- _id: GradSch
- _id: NiBa
- _id: BeVi
doi: 10.15479/AT:ISTA:12933
file:
- access_level: open_access
  checksum: 0ba0bcd0bb8b18d84792136a4370df90
  content_type: text/csv
  creator: gpuixeus
  date_created: 2023-05-10T09:41:43Z
  date_updated: 2023-05-10T09:41:43Z
  file_id: '12934'
  file_name: Dataset_S1.csv
  file_size: 8029982
  relation: main_file
  success: 1
- access_level: open_access
  checksum: a62aa9a6d4904e0fdb699cf752640863
  content_type: text/csv
  creator: gpuixeus
  date_created: 2023-05-10T09:41:43Z
  date_updated: 2023-05-10T09:41:43Z
  file_id: '12935'
  file_name: Dataset_S2.csv
  file_size: 13667640
  relation: main_file
  success: 1
- access_level: open_access
  checksum: e20ea7f4f8a9bdf1b3849a44664ae58b
  content_type: text/csv
  creator: gpuixeus
  date_created: 2023-05-10T09:41:48Z
  date_updated: 2023-05-10T09:41:48Z
  file_id: '12936'
  file_name: Dataset_S3.csv
  file_size: 8369141
  relation: main_file
  success: 1
- access_level: open_access
  checksum: f6156e5fc44446c907ddd0d7289d4cf8
  content_type: text/csv
  creator: gpuixeus
  date_created: 2023-05-10T09:41:50Z
  date_updated: 2023-05-10T09:41:50Z
  file_id: '12937'
  file_name: Dataset_S4.csv
  file_size: 19543247
  relation: main_file
  success: 1
- access_level: open_access
  checksum: ae9f54c77a1c42b666ae6c1dfd33ac86
  content_type: text/plain
  creator: gpuixeus
  date_created: 2023-05-11T12:50:18Z
  date_updated: 2023-05-11T12:50:18Z
  file_id: '12944'
  file_name: readme.txt
  file_size: 4566
  relation: main_file
  success: 1
file_date_updated: 2023-05-11T12:50:18Z
has_accepted_license: '1'
month: '05'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '14058'
    relation: used_in_publication
    status: public
  - id: '14077'
    relation: used_in_publication
    status: public
status: public
title: 'Data from: Sex-specific estimation of cis and trans regulation of gene expression
  in heads and gonads of Drosophila melanogaster'
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: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '12945'
abstract:
- lang: eng
  text: "basic data for use in code for experimental data analysis for manuscript
    under revision: \r\nDynamic pathogen detection and social feedback shape collective
    hygiene in ants\r\nCasillas-Pérez B, Boďová K, Grasse AV, Tkačik G, Cremer S"
acknowledged_ssus:
- _id: LifeSc
acknowledgement: This project has received funding from the European Research Council
  (ERC) under the European Union’s Horizon 2020 research and innovation programme
  (Grant No. 771402; EPIDEMICSonCHIP) to SC, from the Scientific Grant Agency of the
  Slovak Republic (Grant No. 1/0521/20) to KB, and the Human Frontier Science Program
  (Grant No. RGP0065/2012) to GT.
article_processing_charge: No
author:
- first_name: Sylvia
  full_name: Cremer, Sylvia
  id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
  last_name: Cremer
  orcid: 0000-0002-2193-3868
citation:
  ama: 'Cremer S. Data from: “Dynamic pathogen detection and social feedback shape
    collective hygiene in ants” . 2023. doi:<a href="https://doi.org/10.15479/AT:ISTA:12945">10.15479/AT:ISTA:12945</a>'
  apa: 'Cremer, S. (2023). Data from: “Dynamic pathogen detection and social feedback
    shape collective hygiene in ants” . Institute of Science and Technology Austria.
    <a href="https://doi.org/10.15479/AT:ISTA:12945">https://doi.org/10.15479/AT:ISTA:12945</a>'
  chicago: 'Cremer, Sylvia. “Data from: ‘Dynamic Pathogen Detection and Social Feedback
    Shape Collective Hygiene in Ants’ .” Institute of Science and Technology Austria,
    2023. <a href="https://doi.org/10.15479/AT:ISTA:12945">https://doi.org/10.15479/AT:ISTA:12945</a>.'
  ieee: 'S. Cremer, “Data from: ‘Dynamic pathogen detection and social feedback shape
    collective hygiene in ants’ .” Institute of Science and Technology Austria, 2023.'
  ista: 'Cremer S. 2023. Data from: ‘Dynamic pathogen detection and social feedback
    shape collective hygiene in ants’ , Institute of Science and Technology Austria,
    <a href="https://doi.org/10.15479/AT:ISTA:12945">10.15479/AT:ISTA:12945</a>.'
  mla: 'Cremer, Sylvia. <i>Data from: “Dynamic Pathogen Detection and Social Feedback
    Shape Collective Hygiene in Ants” </i>. Institute of Science and Technology Austria,
    2023, doi:<a href="https://doi.org/10.15479/AT:ISTA:12945">10.15479/AT:ISTA:12945</a>.'
  short: S. Cremer, (2023).
contributor:
- contributor_type: data_collector
  first_name: Barbara E
  id: 351ED2AA-F248-11E8-B48F-1D18A9856A87
  last_name: Casillas Perez
- contributor_type: data_collector
  first_name: Anna V
  id: 406F989C-F248-11E8-B48F-1D18A9856A87
  last_name: Grasse
- contributor_type: researcher
  first_name: Katarina
  last_name: Bodova
- contributor_type: supervisor
  first_name: Gašper
  id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
  last_name: Tkačik
  orcid: 0000-0002-6699-1455
date_created: 2023-05-11T21:35:17Z
date_published: 2023-05-12T00:00:00Z
date_updated: 2023-08-07T13:09:09Z
day: '12'
ddc:
- '570'
department:
- _id: SyCr
doi: 10.15479/AT:ISTA:12945
file:
- access_level: open_access
  checksum: 3eadf17fd59ad8c98bf10bf63061863c
  content_type: application/zip
  creator: scremer
  date_created: 2023-05-12T08:04:04Z
  date_updated: 2023-05-12T08:04:04Z
  file_id: '12947'
  file_name: Experimental_data.zip
  file_size: 3414674
  relation: main_file
  success: 1
- access_level: open_access
  checksum: 1b5e8e01a0989154a76b44e6d8d68f89
  content_type: application/octet-stream
  creator: scremer
  date_created: 2023-05-12T08:04:08Z
  date_updated: 2023-05-12T08:04:08Z
  file_id: '12948'
  file_name: README_Experimental_Data.md
  file_size: 2113
  relation: main_file
  success: 1
file_date_updated: 2023-05-12T08:04:08Z
has_accepted_license: '1'
keyword:
- collective behavior
- host-pathogen interactions
- social immunity
- epidemiology
- social insects
- probabilistic modeling
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '05'
oa: 1
oa_version: None
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '13127'
    relation: used_in_publication
    status: public
status: public
title: 'Data from: "Dynamic pathogen detection and social feedback shape collective
  hygiene in ants" '
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: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '12949'
abstract:
- lang: eng
  text: The classical infinitesimal model is a simple and robust model for the inheritance
    of quantitative traits. In this model, a quantitative trait is expressed as the
    sum of a genetic and a non-genetic (environmental) component and the genetic component
    of offspring traits within a family follows a normal distribution around the average
    of the parents’ trait values, and has a variance that is independent of the trait
    values of the parents. Although the trait distribution across the whole population
    can be far from normal, the trait distributions within families are normally distributed
    with a variance-covariance matrix that is determined entirely by that in  the
    ancestral population and the probabilities of identity determined by the pedigree.
    Moreover, conditioning on some of the trait values within the pedigree has predictable
    effects on the mean and variance within and between families. In previous work,
    Barton et al. (2017), we showed that when trait values are determined by the sum
    of a large number of Mendelian factors, each  of small effect, one can justify
    the infinitesimal model as limit of Mendelian inheritance. It was also shown that
    under some forms of epistasis, trait values within a family are still normally
    distributed.
article_processing_charge: No
author:
- first_name: Nicholas H
  full_name: Barton, Nicholas H
  id: 4880FE40-F248-11E8-B48F-1D18A9856A87
  last_name: Barton
  orcid: 0000-0002-8548-5240
citation:
  ama: Barton NH. The infinitesimal model with dominance. 2023. doi:<a href="https://doi.org/10.15479/AT:ISTA:12949">10.15479/AT:ISTA:12949</a>
  apa: Barton, N. H. (2023). The infinitesimal model with dominance. Institute of
    Science and Technology Austria. <a href="https://doi.org/10.15479/AT:ISTA:12949">https://doi.org/10.15479/AT:ISTA:12949</a>
  chicago: Barton, Nicholas H. “The Infinitesimal Model with Dominance.” Institute
    of Science and Technology Austria, 2023. <a href="https://doi.org/10.15479/AT:ISTA:12949">https://doi.org/10.15479/AT:ISTA:12949</a>.
  ieee: N. H. Barton, “The infinitesimal model with dominance.” Institute of Science
    and Technology Austria, 2023.
  ista: Barton NH. 2023. The infinitesimal model with dominance, Institute of Science
    and Technology Austria, <a href="https://doi.org/10.15479/AT:ISTA:12949">10.15479/AT:ISTA:12949</a>.
  mla: Barton, Nicholas H. <i>The Infinitesimal Model with Dominance</i>. Institute
    of Science and Technology Austria, 2023, doi:<a href="https://doi.org/10.15479/AT:ISTA:12949">10.15479/AT:ISTA:12949</a>.
  short: N.H. Barton, (2023).
contributor:
- contributor_type: researcher
  first_name: Amandine
  last_name: Veber
- contributor_type: researcher
  first_name: Alison
  last_name: Etheridge
date_created: 2023-05-13T09:49:09Z
date_published: 2023-05-13T00:00:00Z
date_updated: 2025-05-28T11:57:00Z
day: '13'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.15479/AT:ISTA:12949
file:
- access_level: open_access
  checksum: b0ce7d4b1ee7e7265430ceed36fc3336
  content_type: application/octet-stream
  creator: nbarton
  date_created: 2023-05-13T09:36:33Z
  date_updated: 2023-05-13T09:36:33Z
  file_id: '12950'
  file_name: Neutral identities 16th Jan
  file_size: 13662
  relation: main_file
  success: 1
- access_level: open_access
  checksum: ad5035ad4f7d3b150a252c79884f6a83
  content_type: application/octet-stream
  creator: nbarton
  date_created: 2023-05-13T09:38:17Z
  date_updated: 2023-05-13T09:38:17Z
  file_id: '12951'
  file_name: p, zA, zD, N=30 neutral III
  file_size: 181619928
  relation: main_file
  success: 1
- access_level: open_access
  checksum: 62182a1de796256edd6f4223704312ef
  content_type: application/octet-stream
  creator: nbarton
  date_created: 2023-05-13T09:41:59Z
  date_updated: 2023-05-13T09:41:59Z
  file_id: '12952'
  file_name: p, zA, zD, N=30 neutral IV
  file_size: 605902074
  relation: main_file
  success: 1
- access_level: open_access
  checksum: af775dda5c4f6859cb1e5a81ec40a667
  content_type: application/octet-stream
  creator: nbarton
  date_created: 2023-05-13T09:46:52Z
  date_updated: 2023-05-13T09:46:52Z
  file_id: '12953'
  file_name: p, zA, zD, N=30 selected k=5
  file_size: 1018238746
  relation: main_file
  success: 1
- access_level: open_access
  checksum: af26f3394c387d3ada14b434cd68b1e5
  content_type: application/octet-stream
  creator: nbarton
  date_created: 2023-05-13T09:42:05Z
  date_updated: 2023-05-13T09:42:05Z
  file_id: '12954'
  file_name: Pairwise F N=30 neutral II
  file_size: 3197160
  relation: main_file
  success: 1
- access_level: open_access
  checksum: d5da7dc0e7282dd48222e26d12e34220
  content_type: application/octet-stream
  creator: nbarton
  date_created: 2023-05-13T09:42:06Z
  date_updated: 2023-05-13T09:42:06Z
  file_id: '12955'
  file_name: Pedigrees N=30 neutral II
  file_size: 55492
  relation: main_file
  success: 1
- access_level: open_access
  checksum: 00f386d80677590e29f6235d49cba58d
  content_type: application/octet-stream
  creator: nbarton
  date_created: 2023-05-13T09:46:06Z
  date_updated: 2023-05-13T09:46:06Z
  file_id: '12956'
  file_name: selected reps N=30 selected k=1,2 300 reps III
  file_size: 474003467
  relation: main_file
  success: 1
- access_level: open_access
  checksum: 658cef3eaea6136a4d24da4f074191d7
  content_type: application/octet-stream
  creator: nbarton
  date_created: 2023-05-13T09:46:08Z
  date_updated: 2023-05-13T09:46:08Z
  file_id: '12957'
  file_name: Algorithm for caclulating identities.nb
  file_size: 121209
  relation: main_file
  success: 1
- access_level: open_access
  checksum: db9b6dddd7a596d974e25f5e78f5c45c
  content_type: application/octet-stream
  creator: nbarton
  date_created: 2023-05-13T09:46:08Z
  date_updated: 2023-05-13T09:46:08Z
  file_id: '12958'
  file_name: Infinitesimal with dominance.nb
  file_size: 1803898
  relation: main_file
  success: 1
- access_level: open_access
  checksum: 91f80a9fb58cae8eef2d8bf59fe30189
  content_type: text/plain
  creator: nbarton
  date_created: 2023-05-16T04:09:08Z
  date_updated: 2023-05-16T04:09:08Z
  file_id: '12967'
  file_name: ReadMe.txt
  file_size: 990
  relation: main_file
  success: 1
file_date_updated: 2023-05-16T04:09:08Z
has_accepted_license: '1'
keyword:
- Quantitative genetics
- infinitesimal model
month: '05'
oa: 1
oa_version: Published Version
project:
- _id: bd6958e0-d553-11ed-ba76-86eba6a76c00
  grant_number: '101055327'
  name: Understanding the evolution of continuous genomes
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '14452'
    relation: used_in_publication
    status: public
status: public
title: The infinitesimal model with dominance
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: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '12959'
abstract:
- lang: eng
  text: "This paper deals with the large-scale behaviour of dynamical optimal transport
    on Zd\r\n-periodic graphs with general lower semicontinuous and convex energy
    densities. Our main contribution is a homogenisation result that describes the
    effective behaviour of the discrete problems in terms of a continuous optimal
    transport problem. The effective energy density can be explicitly expressed in
    terms of a cell formula, which is a finite-dimensional convex programming problem
    that depends non-trivially on the local geometry of the discrete graph and the
    discrete energy density. Our homogenisation result is derived from a Γ\r\n-convergence
    result for action functionals on curves of measures, which we prove under very
    mild growth conditions on the energy density. We investigate the cell formula
    in several cases of interest, including finite-volume discretisations of the Wasserstein
    distance, where non-trivial limiting behaviour occurs."
acknowledgement: J.M. gratefully acknowledges support by the European Research Council
  (ERC) under the European Union’s Horizon 2020 research and innovation programme
  (Grant Agreement No. 716117). J.M and L.P. also acknowledge support from the Austrian
  Science Fund (FWF), grants No F65 and W1245. E.K. gratefully acknowledges support
  by the German Research Foundation through the Hausdorff Center for Mathematics and
  the Collaborative Research Center 1060. P.G. is partially funded by the Deutsche
  Forschungsgemeinschaft (DFG, German Research Foundation)—350398276. We thank the
  anonymous reviewer for the careful reading and for useful suggestions. Open access
  funding provided by Austrian Science Fund (FWF).
article_number: '143'
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Peter
  full_name: Gladbach, Peter
  last_name: Gladbach
- first_name: Eva
  full_name: Kopfer, Eva
  last_name: Kopfer
- first_name: Jan
  full_name: Maas, Jan
  id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
  last_name: Maas
  orcid: 0000-0002-0845-1338
- first_name: Lorenzo
  full_name: Portinale, Lorenzo
  id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87
  last_name: Portinale
citation:
  ama: Gladbach P, Kopfer E, Maas J, Portinale L. Homogenisation of dynamical optimal
    transport on periodic graphs. <i>Calculus of Variations and Partial Differential
    Equations</i>. 2023;62(5). doi:<a href="https://doi.org/10.1007/s00526-023-02472-z">10.1007/s00526-023-02472-z</a>
  apa: Gladbach, P., Kopfer, E., Maas, J., &#38; Portinale, L. (2023). Homogenisation
    of dynamical optimal transport on periodic graphs. <i>Calculus of Variations and
    Partial Differential Equations</i>. Springer Nature. <a href="https://doi.org/10.1007/s00526-023-02472-z">https://doi.org/10.1007/s00526-023-02472-z</a>
  chicago: Gladbach, Peter, Eva Kopfer, Jan Maas, and Lorenzo Portinale. “Homogenisation
    of Dynamical Optimal Transport on Periodic Graphs.” <i>Calculus of Variations
    and Partial Differential Equations</i>. Springer Nature, 2023. <a href="https://doi.org/10.1007/s00526-023-02472-z">https://doi.org/10.1007/s00526-023-02472-z</a>.
  ieee: P. Gladbach, E. Kopfer, J. Maas, and L. Portinale, “Homogenisation of dynamical
    optimal transport on periodic graphs,” <i>Calculus of Variations and Partial Differential
    Equations</i>, vol. 62, no. 5. Springer Nature, 2023.
  ista: Gladbach P, Kopfer E, Maas J, Portinale L. 2023. Homogenisation of dynamical
    optimal transport on periodic graphs. Calculus of Variations and Partial Differential
    Equations. 62(5), 143.
  mla: Gladbach, Peter, et al. “Homogenisation of Dynamical Optimal Transport on Periodic
    Graphs.” <i>Calculus of Variations and Partial Differential Equations</i>, vol.
    62, no. 5, 143, Springer Nature, 2023, doi:<a href="https://doi.org/10.1007/s00526-023-02472-z">10.1007/s00526-023-02472-z</a>.
  short: P. Gladbach, E. Kopfer, J. Maas, L. Portinale, Calculus of Variations and
    Partial Differential Equations 62 (2023).
date_created: 2023-05-14T22:01:00Z
date_published: 2023-04-28T00:00:00Z
date_updated: 2023-10-04T11:34:49Z
day: '28'
ddc:
- '510'
department:
- _id: JaMa
doi: 10.1007/s00526-023-02472-z
ec_funded: 1
external_id:
  arxiv:
  - '2110.15321'
  isi:
  - '000980588900001'
file:
- access_level: open_access
  checksum: 359bee38d94b7e0aa73925063cb8884d
  content_type: application/pdf
  creator: dernst
  date_created: 2023-10-04T11:34:10Z
  date_updated: 2023-10-04T11:34:10Z
  file_id: '14393'
  file_name: 2023_CalculusEquations_Gladbach.pdf
  file_size: 1240995
  relation: main_file
  success: 1
file_date_updated: 2023-10-04T11:34:10Z
has_accepted_license: '1'
intvolume: '        62'
isi: 1
issue: '5'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
project:
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '716117'
  name: Optimal Transport and Stochastic Dynamics
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
  grant_number: F6504
  name: Taming Complexity in Partial Differential Systems
- _id: 260788DE-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  name: Dissipation and Dispersion in Nonlinear Partial Differential Equations
publication: Calculus of Variations and Partial Differential Equations
publication_identifier:
  eissn:
  - 1432-0835
  issn:
  - 0944-2669
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Homogenisation of dynamical optimal transport on periodic graphs
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: 62
year: '2023'
...
---
_id: '12960'
abstract:
- lang: eng
  text: "Isomanifolds are the generalization of isosurfaces to arbitrary dimension
    and codimension, i.e., submanifolds of Rd defined as the zero set of some multivariate
    multivalued smooth function f:Rd→Rd−n, where n is the intrinsic dimension of the
    manifold. A natural way to approximate a smooth isomanifold M=f−1(0) is to consider
    its piecewise linear (PL) approximation M^\r\n based on a triangulation T of the
    ambient space Rd. In this paper, we describe a simple algorithm to trace isomanifolds
    from a given starting point. The algorithm works for arbitrary dimensions n and
    d, and any precision D. Our main result is that, when f (or M) has bounded complexity,
    the complexity of the algorithm is polynomial in d and δ=1/D (and unavoidably
    exponential in n). Since it is known that for δ=Ω(d2.5), M^ is O(D2)-close and
    isotopic to M\r\n, our algorithm produces a faithful PL-approximation of isomanifolds
    of bounded complexity in time polynomial in d. Combining this algorithm with dimensionality
    reduction techniques, the dependency on d in the size of M^ can be completely
    removed with high probability. We also show that the algorithm can handle isomanifolds
    with boundary and, more generally, isostratifolds. The algorithm for isomanifolds
    with boundary has been implemented and experimental results are reported, showing
    that it is practical and can handle cases that are far ahead of the state-of-the-art. "
acknowledgement: The authors have received funding from the European Research Council
  under the European Union's ERC grant greement 339025 GUDHI (Algorithmic Foundations
  of Geometric Un-derstanding  in  Higher  Dimensions).   The  first  author  was  supported  by  the  French  government,through
  the 3IA C\^ote d'Azur Investments in the Future project managed by the National
  ResearchAgency (ANR) with the reference ANR-19-P3IA-0002.  The third author was
  supported by the Eu-ropean Union's Horizon 2020 research and innovation programme
  under the Marie Sk\lodowska-Curiegrant agreement 754411 and the FWF (Austrian Science
  Fund) grant M 3073.
article_processing_charge: No
article_type: original
author:
- first_name: Jean Daniel
  full_name: Boissonnat, Jean Daniel
  last_name: Boissonnat
- first_name: Siargey
  full_name: Kachanovich, Siargey
  last_name: Kachanovich
- first_name: Mathijs
  full_name: Wintraecken, Mathijs
  id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
  last_name: Wintraecken
  orcid: 0000-0002-7472-2220
citation:
  ama: Boissonnat JD, Kachanovich S, Wintraecken M. Tracing isomanifolds in Rd in
    time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations. <i>SIAM Journal
    on Computing</i>. 2023;52(2):452-486. doi:<a href="https://doi.org/10.1137/21M1412918">10.1137/21M1412918</a>
  apa: Boissonnat, J. D., Kachanovich, S., &#38; Wintraecken, M. (2023). Tracing isomanifolds
    in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations. <i>SIAM
    Journal on Computing</i>. Society for Industrial and Applied Mathematics. <a href="https://doi.org/10.1137/21M1412918">https://doi.org/10.1137/21M1412918</a>
  chicago: Boissonnat, Jean Daniel, Siargey Kachanovich, and Mathijs Wintraecken.
    “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter–Freudenthal–Kuhn
    Triangulations.” <i>SIAM Journal on Computing</i>. Society for Industrial and
    Applied Mathematics, 2023. <a href="https://doi.org/10.1137/21M1412918">https://doi.org/10.1137/21M1412918</a>.
  ieee: J. D. Boissonnat, S. Kachanovich, and M. Wintraecken, “Tracing isomanifolds
    in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations,”
    <i>SIAM Journal on Computing</i>, vol. 52, no. 2. Society for Industrial and Applied
    Mathematics, pp. 452–486, 2023.
  ista: Boissonnat JD, Kachanovich S, Wintraecken M. 2023. Tracing isomanifolds in
    Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations. SIAM
    Journal on Computing. 52(2), 452–486.
  mla: Boissonnat, Jean Daniel, et al. “Tracing Isomanifolds in Rd in Time Polynomial
    in d Using Coxeter–Freudenthal–Kuhn Triangulations.” <i>SIAM Journal on Computing</i>,
    vol. 52, no. 2, Society for Industrial and Applied Mathematics, 2023, pp. 452–86,
    doi:<a href="https://doi.org/10.1137/21M1412918">10.1137/21M1412918</a>.
  short: J.D. Boissonnat, S. Kachanovich, M. Wintraecken, SIAM Journal on Computing
    52 (2023) 452–486.
date_created: 2023-05-14T22:01:00Z
date_published: 2023-04-30T00:00:00Z
date_updated: 2023-10-10T07:34:35Z
day: '30'
department:
- _id: HeEd
doi: 10.1137/21M1412918
ec_funded: 1
external_id:
  isi:
  - '001013183000012'
intvolume: '        52'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://hal-emse.ccsd.cnrs.fr/3IA-COTEDAZUR/hal-04083489v1
month: '04'
oa: 1
oa_version: Submitted Version
page: 452-486
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '754411'
  name: ISTplus - Postdoctoral Fellowships
- _id: fc390959-9c52-11eb-aca3-afa58bd282b2
  grant_number: M03073
  name: Learning and triangulating manifolds via collapses
publication: SIAM Journal on Computing
publication_identifier:
  eissn:
  - 1095-7111
  issn:
  - 0097-5397
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
related_material:
  record:
  - id: '9441'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: Tracing isomanifolds in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn
  triangulations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 52
year: '2023'
...
---
_id: '12972'
abstract:
- lang: eng
  text: Embroidery is a long-standing and high-quality approach to making logos and
    images on textiles. Nowadays, it can also be performed via automated machines
    that weave threads with high spatial accuracy. A characteristic feature of the
    appearance of the threads is a high degree of anisotropy. The anisotropic behavior
    is caused by depositing thin but long strings of thread. As a result, the stitched
    patterns convey both color and direction. Artists leverage this anisotropic behavior
    to enhance pure color images with textures, illusions of motion, or depth cues.
    However, designing colorful embroidery patterns with prescribed directionality
    is a challenging task, one usually requiring an expert designer. In this work,
    we propose an interactive algorithm that generates machine-fabricable embroidery
    patterns from multi-chromatic images equipped with user-specified directionality
    fields.We cast the problem of finding a stitching pattern into vector theory.
    To find a suitable stitching pattern, we extract sources and sinks from the divergence
    field of the vector field extracted from the input and use them to trace streamlines.
    We further optimize the streamlines to guarantee a smooth and connected stitching
    pattern. The generated patterns approximate the color distribution constrained
    by the directionality field. To allow for further artistic control, the trade-off
    between color match and directionality match can be interactively explored via
    an intuitive slider. We showcase our approach by fabricating several embroidery
    paths.
acknowledgement: This work was supported by the European Research Council (ERC) under
  the European Union’s Horizon 2020 research and innovation program (grant agreement
  No 715767 – MATERIALIZABLE), and FWF Lise Meitner (Grant M 3319). We thank the anonymous
  reviewers for their insightful feedback; Solal Pirelli, Shardul Chiplunkar, and
  Paola Mejia for proofreading; everyone in the visual computing group at ISTA for
  inspiring lunch and coffee breaks; Thibault Tricard for help producing the results
  of Phasor Noise.
article_processing_charge: No
article_type: original
author:
- first_name: Zhenyuan
  full_name: Liu, Zhenyuan
  id: 70f0d7cf-ae65-11ec-a14f-89dfc5505b19
  last_name: Liu
  orcid: 0000-0001-9200-5690
- first_name: Michael
  full_name: Piovarci, Michael
  id: 62E473F4-5C99-11EA-A40E-AF823DDC885E
  last_name: Piovarci
- first_name: Christian
  full_name: Hafner, Christian
  id: 400429CC-F248-11E8-B48F-1D18A9856A87
  last_name: Hafner
- first_name: Raphael
  full_name: Charrondiere, Raphael
  id: a3a24133-2cc7-11ec-be88-8ddaf6f464b1
  last_name: Charrondiere
- first_name: Bernd
  full_name: Bickel, Bernd
  id: 49876194-F248-11E8-B48F-1D18A9856A87
  last_name: Bickel
  orcid: 0000-0001-6511-9385
citation:
  ama: Liu Z, Piovarci M, Hafner C, Charrondiere R, Bickel B. Directionality-aware
    design of embroidery patterns. <i>Computer Graphics Forum</i>. 2023;42(2):397-409.
    doi:<a href="https://doi.org/10.1111/cgf.14770 ">10.1111/cgf.14770 </a>
  apa: 'Liu, Z., Piovarci, M., Hafner, C., Charrondiere, R., &#38; Bickel, B. (2023).
    Directionality-aware design of embroidery patterns. <i>Computer Graphics Forum</i>.
    Saarbrucken, Germany: Wiley. <a href="https://doi.org/10.1111/cgf.14770 ">https://doi.org/10.1111/cgf.14770
    </a>'
  chicago: Liu, Zhenyuan, Michael Piovarci, Christian Hafner, Raphael Charrondiere,
    and Bernd Bickel. “Directionality-Aware Design of Embroidery Patterns.” <i>Computer
    Graphics Forum</i>. Wiley, 2023. <a href="https://doi.org/10.1111/cgf.14770 ">https://doi.org/10.1111/cgf.14770
    </a>.
  ieee: Z. Liu, M. Piovarci, C. Hafner, R. Charrondiere, and B. Bickel, “Directionality-aware
    design of embroidery patterns,” <i>Computer Graphics Forum</i>, vol. 42, no. 2.
    Wiley, pp. 397–409, 2023.
  ista: Liu Z, Piovarci M, Hafner C, Charrondiere R, Bickel B. 2023. Directionality-aware
    design of embroidery patterns. Computer Graphics Forum. 42(2), 397–409.
  mla: Liu, Zhenyuan, et al. “Directionality-Aware Design of Embroidery Patterns.”
    <i>Computer Graphics Forum</i>, vol. 42, no. 2, Wiley, 2023, pp. 397–409, doi:<a
    href="https://doi.org/10.1111/cgf.14770 ">10.1111/cgf.14770 </a>.
  short: Z. Liu, M. Piovarci, C. Hafner, R. Charrondiere, B. Bickel, Computer Graphics
    Forum 42 (2023) 397–409.
conference:
  end_date: 2023-05-12
  location: Saarbrucken, Germany
  name: 'EG: Eurographics'
  start_date: 2023-05-08
date_created: 2023-05-16T08:47:25Z
date_published: 2023-05-08T00:00:00Z
date_updated: 2023-08-01T14:47:05Z
day: '08'
ddc:
- '004'
department:
- _id: BeBi
doi: '10.1111/cgf.14770 '
ec_funded: 1
external_id:
  isi:
  - '001000062600033'
file:
- access_level: open_access
  checksum: 4c188c2be4745467a8790bbf5d6491aa
  content_type: application/pdf
  creator: mpiovarc
  date_created: 2023-05-16T08:28:37Z
  date_updated: 2023-05-16T08:28:37Z
  file_id: '12974'
  file_name: Zhenyuan2023.pdf
  file_size: 24003702
  relation: main_file
  success: 1
file_date_updated: 2023-05-16T08:28:37Z
has_accepted_license: '1'
intvolume: '        42'
isi: 1
issue: '2'
keyword:
- embroidery
- design
- directionality
- density
- image
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 397-409
project:
- _id: eb901961-77a9-11ec-83b8-f5c883a62027
  grant_number: M03319
  name: Perception-Aware Appearance Fabrication
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '715767'
  name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
    Modeling'
publication: Computer Graphics Forum
publication_identifier:
  issn:
  - 1467-8659
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: Directionality-aware design of embroidery patterns
tmp:
  image: /images/cc_by_nc_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
    (CC BY-NC-ND 4.0)
  short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 42
year: '2023'
...
---
_id: '12976'
abstract:
- lang: eng
  text: "3D printing based on continuous deposition of materials, such as filament-based
    3D printing, has seen widespread adoption thanks to its versatility in working
    with a wide range of materials. An important shortcoming of this type of technology
    is its limited multi-material capabilities. While there are simple hardware designs
    that enable multi-material printing in principle, the required software is heavily
    underdeveloped. A typical hardware design fuses together individual materials
    fed into a single chamber from multiple inlets before they are deposited. This
    design, however, introduces a time delay between the intended material mixture
    and its actual deposition. In this work, inspired by diverse path planning research
    in robotics, we show that this mechanical challenge can be addressed via improved
    printer control. We propose to formulate the search for optimal multi-material
    printing policies in a reinforcement\r\nlearning setup. We put forward a simple
    numerical deposition model that takes into account the non-linear material mixing
    and delayed material deposition. To validate our system we focus on color fabrication,
    a problem known for its strict requirements for varying material mixtures at a
    high spatial frequency. We demonstrate that our learned control policy outperforms
    state-of-the-art hand-crafted algorithms."
acknowledgement: This work is graciously supported by FWF Lise Meitner (Grant M 3319).
  Kang Liao sincerely thank Emiliano Luci, Chunyu Lin, and Yao Zhao for their huge
  support.
article_processing_charge: No
author:
- first_name: Kang
  full_name: Liao, Kang
  last_name: Liao
- first_name: Thibault
  full_name: Tricard, Thibault
  last_name: Tricard
- first_name: Michael
  full_name: Piovarci, Michael
  id: 62E473F4-5C99-11EA-A40E-AF823DDC885E
  last_name: Piovarci
  orcid: 0000-0002-5062-4474
- first_name: Hans-Peter
  full_name: Seidel, Hans-Peter
  last_name: Seidel
- first_name: Vahid
  full_name: Babaei, Vahid
  last_name: Babaei
citation:
  ama: 'Liao K, Tricard T, Piovarci M, Seidel H-P, Babaei V. Learning deposition policies
    for fused multi-material 3D printing. In: <i>2023 IEEE International Conference
    on Robotics and Automation</i>. Vol 2023. IEEE; 2023:12345-12352. doi:<a href="https://doi.org/10.1109/ICRA48891.2023.10160465">10.1109/ICRA48891.2023.10160465</a>'
  apa: 'Liao, K., Tricard, T., Piovarci, M., Seidel, H.-P., &#38; Babaei, V. (2023).
    Learning deposition policies for fused multi-material 3D printing. In <i>2023
    IEEE International Conference on Robotics and Automation</i> (Vol. 2023, pp. 12345–12352).
    London, United Kingdom: IEEE. <a href="https://doi.org/10.1109/ICRA48891.2023.10160465">https://doi.org/10.1109/ICRA48891.2023.10160465</a>'
  chicago: Liao, Kang, Thibault Tricard, Michael Piovarci, Hans-Peter Seidel, and
    Vahid Babaei. “Learning Deposition Policies for Fused Multi-Material 3D Printing.”
    In <i>2023 IEEE International Conference on Robotics and Automation</i>, 2023:12345–52.
    IEEE, 2023. <a href="https://doi.org/10.1109/ICRA48891.2023.10160465">https://doi.org/10.1109/ICRA48891.2023.10160465</a>.
  ieee: K. Liao, T. Tricard, M. Piovarci, H.-P. Seidel, and V. Babaei, “Learning deposition
    policies for fused multi-material 3D printing,” in <i>2023 IEEE International
    Conference on Robotics and Automation</i>, London, United Kingdom, 2023, vol.
    2023, pp. 12345–12352.
  ista: 'Liao K, Tricard T, Piovarci M, Seidel H-P, Babaei V. 2023. Learning deposition
    policies for fused multi-material 3D printing. 2023 IEEE International Conference
    on Robotics and Automation. ICRA: International Conference on Robotics and Automation
    vol. 2023, 12345–12352.'
  mla: Liao, Kang, et al. “Learning Deposition Policies for Fused Multi-Material 3D
    Printing.” <i>2023 IEEE International Conference on Robotics and Automation</i>,
    vol. 2023, IEEE, 2023, pp. 12345–52, doi:<a href="https://doi.org/10.1109/ICRA48891.2023.10160465">10.1109/ICRA48891.2023.10160465</a>.
  short: K. Liao, T. Tricard, M. Piovarci, H.-P. Seidel, V. Babaei, in:, 2023 IEEE
    International Conference on Robotics and Automation, IEEE, 2023, pp. 12345–12352.
conference:
  end_date: 2023-06-02
  location: London, United Kingdom
  name: 'ICRA: International Conference on Robotics and Automation'
  start_date: 2023-05-29
date_created: 2023-05-16T09:14:09Z
date_published: 2023-07-04T00:00:00Z
date_updated: 2023-12-13T11:20:00Z
day: '04'
ddc:
- '004'
department:
- _id: BeBi
doi: 10.1109/ICRA48891.2023.10160465
external_id:
  isi:
  - '001048371104068'
file:
- access_level: open_access
  checksum: daeaa67124777d88487f933ea3f77164
  content_type: application/pdf
  creator: mpiovarc
  date_created: 2023-05-16T09:12:05Z
  date_updated: 2023-05-16T09:12:05Z
  file_id: '12977'
  file_name: Liao2023.pdf
  file_size: 5367986
  relation: main_file
  success: 1
file_date_updated: 2023-05-16T09:12:05Z
has_accepted_license: '1'
intvolume: '      2023'
isi: 1
keyword:
- reinforcement learning
- deposition
- control
- color
- multi-filament
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 12345-12352
project:
- _id: eb901961-77a9-11ec-83b8-f5c883a62027
  grant_number: M03319
  name: Perception-Aware Appearance Fabrication
publication: 2023 IEEE International Conference on Robotics and Automation
publication_identifier:
  eisbn:
  - '9798350323658'
  issn:
  - 1050-4729
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Learning deposition policies for fused multi-material 3D printing
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2023
year: '2023'
...
---
_id: '12979'
abstract:
- lang: eng
  text: 'Color and gloss are fundamental aspects of surface appearance. State-of-the-art
    fabrication techniques can manipulate both properties of the printed 3D objects.
    However, in the context of appearance reproduction, perceptual aspects of color
    and gloss are usually handled separately, even though previous perceptual studies
    suggest their interaction. Our work is motivated by previous studies demonstrating
    a perceived color shift due to a change in the object''s gloss, i.e., two samples
    with the same color but different surface gloss appear as they have different
    colors. In this paper, we conduct new experiments which support this observation
    and provide insights into the magnitude and direction of the perceived color change.
    We use the observations as guidance to design a new method that estimates and
    corrects the color shift enabling the fabrication of objects with the same perceived
    color but different surface gloss. We formulate the problem as an optimization
    procedure solved using differentiable rendering. We evaluate the effectiveness
    of our method in perceptual experiments with 3D objects fabricated using a multi-material
    3D printer and demonstrate potential applications. '
acknowledgement: We thank Matthew S Zurawski for the 3D model of the car speed shape.
  This research has been supported by the Swiss National Science Foundation (SNSF,
  Grant 200502) and the FWF Lise Meitner (Grant M 3319).
article_number: '21'
article_processing_charge: No
author:
- first_name: Jorge
  full_name: Condor, Jorge
  last_name: Condor
- first_name: Michael
  full_name: Piovarci, Michael
  id: 62E473F4-5C99-11EA-A40E-AF823DDC885E
  last_name: Piovarci
  orcid: 0000-0002-5062-4474
- first_name: Bernd
  full_name: Bickel, Bernd
  id: 49876194-F248-11E8-B48F-1D18A9856A87
  last_name: Bickel
  orcid: 0000-0001-6511-9385
- first_name: Piotr
  full_name: Didyk, Piotr
  last_name: Didyk
citation:
  ama: 'Condor J, Piovarci M, Bickel B, Didyk P. Gloss-aware color correction for
    3D printing. In: <i>SIGGRAPH ’23 Conference Proceedings</i>. Association for Computing
    Machinery; 2023. doi:<a href="https://doi.org/10.1145/3588432.3591546">10.1145/3588432.3591546</a>'
  apa: 'Condor, J., Piovarci, M., Bickel, B., &#38; Didyk, P. (2023). Gloss-aware
    color correction for 3D printing. In <i>SIGGRAPH ’23 Conference Proceedings</i>.
    Los Angeles, CA, United States: Association for Computing Machinery. <a href="https://doi.org/10.1145/3588432.3591546">https://doi.org/10.1145/3588432.3591546</a>'
  chicago: Condor, Jorge, Michael Piovarci, Bernd Bickel, and Piotr Didyk. “Gloss-Aware
    Color Correction for 3D Printing.” In <i>SIGGRAPH ’23 Conference Proceedings</i>.
    Association for Computing Machinery, 2023. <a href="https://doi.org/10.1145/3588432.3591546">https://doi.org/10.1145/3588432.3591546</a>.
  ieee: J. Condor, M. Piovarci, B. Bickel, and P. Didyk, “Gloss-aware color correction
    for 3D printing,” in <i>SIGGRAPH ’23 Conference Proceedings</i>, Los Angeles,
    CA, United States, 2023.
  ista: 'Condor J, Piovarci M, Bickel B, Didyk P. 2023. Gloss-aware color correction
    for 3D printing. SIGGRAPH ’23 Conference Proceedings. SIGGRAPH: Computer Graphics
    and Interactive Techniques Conference, 21.'
  mla: Condor, Jorge, et al. “Gloss-Aware Color Correction for 3D Printing.” <i>SIGGRAPH
    ’23 Conference Proceedings</i>, 21, Association for Computing Machinery, 2023,
    doi:<a href="https://doi.org/10.1145/3588432.3591546">10.1145/3588432.3591546</a>.
  short: J. Condor, M. Piovarci, B. Bickel, P. Didyk, in:, SIGGRAPH ’23 Conference
    Proceedings, Association for Computing Machinery, 2023.
conference:
  end_date: 2023-08-10
  location: Los Angeles, CA, United States
  name: 'SIGGRAPH: Computer Graphics and Interactive Techniques Conference'
  start_date: 2023-08-06
date_created: 2023-05-16T09:34:13Z
date_published: 2023-07-23T00:00:00Z
date_updated: 2024-02-28T12:52:04Z
day: '23'
ddc:
- '004'
department:
- _id: BeBi
doi: 10.1145/3588432.3591546
external_id:
  isi:
  - '001117690500021'
file:
- access_level: open_access
  checksum: 84a437739af5d46507928939b20c0c28
  content_type: application/pdf
  creator: mpiovarc
  date_created: 2023-05-16T09:32:50Z
  date_updated: 2023-05-16T09:32:50Z
  file_id: '12983'
  file_name: Condor2023_supplemental.pdf
  file_size: 42323971
  relation: main_file
  success: 1
- access_level: open_access
  checksum: 0f5c8b242e8e7c153c04888c4d0c6f37
  content_type: application/pdf
  creator: dernst
  date_created: 2024-01-29T10:14:10Z
  date_updated: 2024-01-29T10:14:10Z
  file_id: '14893'
  file_name: 2023_Siggraph_Condor.pdf
  file_size: 26079404
  relation: main_file
  success: 1
file_date_updated: 2024-01-29T10:14:10Z
has_accepted_license: '1'
isi: 1
keyword:
- color
- gloss
- perception
- color compensation
- color management
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: eb901961-77a9-11ec-83b8-f5c883a62027
  grant_number: M03319
  name: Perception-Aware Appearance Fabrication
publication: SIGGRAPH ’23 Conference Proceedings
publication_identifier:
  isbn:
  - '9798400701597'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
status: public
title: Gloss-aware color correction for 3D printing
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '12984'
abstract:
- lang: eng
  text: Tattoos are a highly popular medium, with both artistic and medical applications.
    Although the mechanical process of tattoo application has evolved historically,
    the results are reliant on the artisanal skill of the artist. This can be especially
    challenging for some skin tones, or in cases where artists lack experience. We
    provide the first systematic overview of tattooing as a computational fabrication
    technique. We built an automated tattooing rig and a recipe for the creation of
    silicone sheets mimicking realistic skin tones, which allowed us to create an
    accurate model predicting tattoo appearance. This enables several exciting applications
    including tattoo previewing, color retargeting, novel ink spectra optimization,
    color-accurate prosthetics, and more.
acknowledged_ssus:
- _id: M-Shop
acknowledgement: We thank Todor Asenov and the Miba Machine Shop for their help in
  assembling the tattoo machine and manufacturing the substrates. We thank Geysler
  Rodrigues for the insightful discussions on tattooing practices from a professional
  artist's perspective. We thank Maria Fernanda Portugal for sharing a doctor's perspective
  on medical applications of tattoos. This work is graciously supported by the FWF
  Lise Meitner (Grant M 3319).
article_number: '67'
article_processing_charge: No
article_type: original
author:
- first_name: Michael
  full_name: Piovarci, Michael
  id: 62E473F4-5C99-11EA-A40E-AF823DDC885E
  last_name: Piovarci
  orcid: 0000-0002-5062-4474
- first_name: Alexandre
  full_name: Chapiro, Alexandre
  last_name: Chapiro
- first_name: Bernd
  full_name: Bickel, Bernd
  id: 49876194-F248-11E8-B48F-1D18A9856A87
  last_name: Bickel
  orcid: 0000-0001-6511-9385
citation:
  ama: 'Piovarci M, Chapiro A, Bickel B. Skin-Screen: A computational fabrication
    framework for color tattoos. <i>Transactions on Graphics</i>. 2023;42(4). doi:<a
    href="https://doi.org/10.1145/3592432">10.1145/3592432</a>'
  apa: 'Piovarci, M., Chapiro, A., &#38; Bickel, B. (2023). Skin-Screen: A computational
    fabrication framework for color tattoos. <i>Transactions on Graphics</i>. Los
    Angeles, CA, United States: Association for Computing Machinery. <a href="https://doi.org/10.1145/3592432">https://doi.org/10.1145/3592432</a>'
  chicago: 'Piovarci, Michael, Alexandre Chapiro, and Bernd Bickel. “Skin-Screen:
    A Computational Fabrication Framework for Color Tattoos.” <i>Transactions on Graphics</i>.
    Association for Computing Machinery, 2023. <a href="https://doi.org/10.1145/3592432">https://doi.org/10.1145/3592432</a>.'
  ieee: 'M. Piovarci, A. Chapiro, and B. Bickel, “Skin-Screen: A computational fabrication
    framework for color tattoos,” <i>Transactions on Graphics</i>, vol. 42, no. 4.
    Association for Computing Machinery, 2023.'
  ista: 'Piovarci M, Chapiro A, Bickel B. 2023. Skin-Screen: A computational fabrication
    framework for color tattoos. Transactions on Graphics. 42(4), 67.'
  mla: 'Piovarci, Michael, et al. “Skin-Screen: A Computational Fabrication Framework
    for Color Tattoos.” <i>Transactions on Graphics</i>, vol. 42, no. 4, 67, Association
    for Computing Machinery, 2023, doi:<a href="https://doi.org/10.1145/3592432">10.1145/3592432</a>.'
  short: M. Piovarci, A. Chapiro, B. Bickel, Transactions on Graphics 42 (2023).
conference:
  end_date: 2023-08-10
  location: Los Angeles, CA, United States
  name: 'SIGGRAPH: Computer Graphics and Interactive Techniques Conference'
  start_date: 2023-08-06
date_created: 2023-05-16T09:39:14Z
date_published: 2023-07-26T00:00:00Z
date_updated: 2024-01-29T10:27:23Z
day: '26'
ddc:
- '004'
department:
- _id: BeBi
doi: 10.1145/3592432
external_id:
  isi:
  - '001044671300033'
file:
- access_level: open_access
  checksum: 5f0a6867689e025a661bd0b4fd90b821
  content_type: application/pdf
  creator: mpiovarc
  date_created: 2023-05-16T09:38:25Z
  date_updated: 2023-05-16T09:38:25Z
  file_id: '12985'
  file_name: Piovarci2023.pdf
  file_size: 30817343
  relation: main_file
  success: 1
file_date_updated: 2023-05-16T09:38:25Z
has_accepted_license: '1'
intvolume: '        42'
isi: 1
issue: '4'
keyword:
- appearance
- modeling
- reproduction
- tattoo
- skin color
- gamut mapping
- ink-optimization
- prosthetic
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: eb901961-77a9-11ec-83b8-f5c883a62027
  grant_number: M03319
  name: Perception-Aware Appearance Fabrication
publication: Transactions on Graphics
publication_identifier:
  eissn:
  - 1557-7368
  issn:
  - 0730-0301
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
status: public
title: 'Skin-Screen: A computational fabrication framework for color tattoos'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 42
year: '2023'
...
---
_id: '13033'
abstract:
- lang: eng
  text: Current methods for assessing cell proliferation in 3D scaffolds rely on changes
    in metabolic activity or total DNA, however, direct quantification of cell number
    in 3D scaffolds remains a challenge. To address this issue, we developed an unbiased
    stereology approach that uses systematic-random sampling and thin focal-plane
    optical sectioning of the scaffolds followed by estimation of total cell number
    (StereoCount). This approach was validated against an indirect method for measuring
    the total DNA (DNA content); and the Bürker counting chamber, the current reference
    method for quantifying cell number. We assessed the total cell number for cell
    seeding density (cells per unit volume) across four values and compared the methods
    in terms of accuracy, ease-of-use and time demands. The accuracy of StereoCount
    markedly outperformed the DNA content for cases with ~ 10,000 and ~ 125,000 cells/scaffold.
    For cases with ~ 250,000 and ~ 375,000 cells/scaffold both StereoCount and DNA
    content showed lower accuracy than the Bürker but did not differ from each other.
    In terms of ease-of-use, there was a strong advantage for the StereoCount due
    to output in terms of absolute cell numbers along with the possibility for an
    overview of cell distribution and future use of automation for high throughput
    analysis. Taking together, the StereoCount method is an efficient approach for
    direct cell quantification in 3D collagen scaffolds. Its major benefit is that
    automated StereoCount could accelerate research using 3D scaffolds focused on
    drug discovery for a wide variety of human diseases.
acknowledgement: The study was supported by Project No. CZ.02.1.01/0.0/0.0/16_019/0000787
  “Fighting INfectious Diseases”, awarded by the MEYS CR, financed from EFRR, by the
  Cooperatio Program, research area DIAG and research area MED/DIAG, by the profiBONE
  project (TO01000309) benefitting from a € (1.433.000) grant from Iceland, Liechtenstein
  and Norway through the EEA Grants and the Technology Agency of the Czech Republic
  and by a Grant (#1926990) to PRM and SRC Biosciences from the National Science Foundation
  (U.S. Public Health Service). The authors acknowledge the invaluable assistance
  provided by Iveta Paurova via her support in terms of the provision of laboratory
  services.
article_number: '7959'
article_processing_charge: No
article_type: original
author:
- first_name: Anna
  full_name: Zavadakova, Anna
  last_name: Zavadakova
- first_name: Lucie
  full_name: Vistejnova, Lucie
  last_name: Vistejnova
- first_name: Tereza
  full_name: Belinova, Tereza
  id: 0bf89b6a-d28b-11eb-8bd6-f43768e4d368
  last_name: Belinova
- first_name: Filip
  full_name: Tichanek, Filip
  last_name: Tichanek
- first_name: Dagmar
  full_name: Bilikova, Dagmar
  last_name: Bilikova
- first_name: Peter R.
  full_name: Mouton, Peter R.
  last_name: Mouton
citation:
  ama: Zavadakova A, Vistejnova L, Belinova T, Tichanek F, Bilikova D, Mouton PR.
    Novel stereological method for estimation of cell counts in 3D collagen scaffolds.
    <i>Scientific Reports</i>. 2023;13(1). doi:<a href="https://doi.org/10.1038/s41598-023-35162-z">10.1038/s41598-023-35162-z</a>
  apa: Zavadakova, A., Vistejnova, L., Belinova, T., Tichanek, F., Bilikova, D., &#38;
    Mouton, P. R. (2023). Novel stereological method for estimation of cell counts
    in 3D collagen scaffolds. <i>Scientific Reports</i>. Springer Nature. <a href="https://doi.org/10.1038/s41598-023-35162-z">https://doi.org/10.1038/s41598-023-35162-z</a>
  chicago: Zavadakova, Anna, Lucie Vistejnova, Tereza Belinova, Filip Tichanek, Dagmar
    Bilikova, and Peter R. Mouton. “Novel Stereological Method for Estimation of Cell
    Counts in 3D Collagen Scaffolds.” <i>Scientific Reports</i>. Springer Nature,
    2023. <a href="https://doi.org/10.1038/s41598-023-35162-z">https://doi.org/10.1038/s41598-023-35162-z</a>.
  ieee: A. Zavadakova, L. Vistejnova, T. Belinova, F. Tichanek, D. Bilikova, and P.
    R. Mouton, “Novel stereological method for estimation of cell counts in 3D collagen
    scaffolds,” <i>Scientific Reports</i>, vol. 13, no. 1. Springer Nature, 2023.
  ista: Zavadakova A, Vistejnova L, Belinova T, Tichanek F, Bilikova D, Mouton PR.
    2023. Novel stereological method for estimation of cell counts in 3D collagen
    scaffolds. Scientific Reports. 13(1), 7959.
  mla: Zavadakova, Anna, et al. “Novel Stereological Method for Estimation of Cell
    Counts in 3D Collagen Scaffolds.” <i>Scientific Reports</i>, vol. 13, no. 1, 7959,
    Springer Nature, 2023, doi:<a href="https://doi.org/10.1038/s41598-023-35162-z">10.1038/s41598-023-35162-z</a>.
  short: A. Zavadakova, L. Vistejnova, T. Belinova, F. Tichanek, D. Bilikova, P.R.
    Mouton, Scientific Reports 13 (2023).
date_created: 2023-05-19T11:12:25Z
date_published: 2023-05-17T00:00:00Z
date_updated: 2023-08-01T14:46:06Z
day: '17'
ddc:
- '570'
department:
- _id: Bio
doi: 10.1038/s41598-023-35162-z
external_id:
  isi:
  - '000995271600104'
file:
- access_level: open_access
  checksum: 8c1b769693ff4288df8376e59ad1176d
  content_type: application/pdf
  creator: dernst
  date_created: 2023-05-22T07:57:37Z
  date_updated: 2023-05-22T07:57:37Z
  file_id: '13047'
  file_name: 2023_ScientificReports_Zavadakova.pdf
  file_size: 3055077
  relation: main_file
  success: 1
file_date_updated: 2023-05-22T07:57:37Z
has_accepted_license: '1'
intvolume: '        13'
isi: 1
issue: '1'
keyword:
- Multidisciplinary
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
publication: Scientific Reports
publication_identifier:
  issn:
  - 2045-2322
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  link:
  - relation: erratum
    url: https://doi.org/10.1038/s41598-023-37265-z
scopus_import: '1'
status: public
title: Novel stereological method for estimation of cell counts in 3D collagen scaffolds
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13
year: '2023'
...
---
_id: '13041'
abstract:
- lang: eng
  text: A series of triarylamines was synthesised and screened for their suitability
    as catholytes in redox flow batteries using cyclic voltammetry (CV). Tris(4-aminophenyl)amine
    was found to be the strongest candidate. Solubility and initial electrochemical
    performance were promising; however, polymerisation was observed during electrochemical
    cycling leading to rapid capacity fade prescribed to a loss of accessible active
    material and the limitation of ion transport processes within the cell. A mixed
    electrolyte system of H3PO4 and HCl was found to inhibit polymerisation producing
    oligomers that consumed less active material reducing rates of degradation in
    the redox flow battery. Under these conditions Coulombic efficiency improved by
    over 4 %, the maximum number of cycles more than quadrupled and an additional
    theoretical capacity of 20 % was accessed. This paper is, to our knowledge, the
    first example of triarylamines as catholytes in all-aqueous redox flow batteries
    and emphasises the impact supporting electrolytes can have on electrochemical
    performance.
acknowledgement: The authors (N.L.F and R.B.J) would like to acknowledge the funding
  contributions of Shell and the EPRSC via I–Case studentships (grants no. EP/V519662/1
  and EP/R511870/1 respectively). T.I would like to thank the ERC advanced Investigator
  Grant for CPG (EC H2020 835073). Thank you to Zhen Wang from the University of Cambridge
  for measuring GPC, the Yusuf Hamied Department of Chemistry's mass spectrometry
  service for MS measurements and analysis and Dr Andrew Bond from the University
  of Cambridge for XRD measurement and analysis.
article_number: e202300128
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Nadia L.
  full_name: Farag, Nadia L.
  last_name: Farag
- first_name: Rajesh B
  full_name: Jethwa, Rajesh B
  id: 4cc538d5-803f-11ed-ab7e-8139573aad8f
  last_name: Jethwa
  orcid: 0000-0002-0404-4356
- first_name: Alice E.
  full_name: Beardmore, Alice E.
  last_name: Beardmore
- first_name: Teresa
  full_name: Insinna, Teresa
  last_name: Insinna
- first_name: Christopher A.
  full_name: O'Keefe, Christopher A.
  last_name: O'Keefe
- first_name: Peter A.A.
  full_name: Klusener, Peter A.A.
  last_name: Klusener
- first_name: Clare P.
  full_name: Grey, Clare P.
  last_name: Grey
- first_name: Dominic S.
  full_name: Wright, Dominic S.
  last_name: Wright
citation:
  ama: Farag NL, Jethwa RB, Beardmore AE, et al. Triarylamines as catholytes in aqueous
    organic redox flow batteries. <i>ChemSusChem</i>. 2023;16(13). doi:<a href="https://doi.org/10.1002/cssc.202300128">10.1002/cssc.202300128</a>
  apa: Farag, N. L., Jethwa, R. B., Beardmore, A. E., Insinna, T., O’Keefe, C. A.,
    Klusener, P. A. A., … Wright, D. S. (2023). Triarylamines as catholytes in aqueous
    organic redox flow batteries. <i>ChemSusChem</i>. Wiley. <a href="https://doi.org/10.1002/cssc.202300128">https://doi.org/10.1002/cssc.202300128</a>
  chicago: Farag, Nadia L., Rajesh B Jethwa, Alice E. Beardmore, Teresa Insinna, Christopher
    A. O’Keefe, Peter A.A. Klusener, Clare P. Grey, and Dominic S. Wright. “Triarylamines
    as Catholytes in Aqueous Organic Redox Flow Batteries.” <i>ChemSusChem</i>. Wiley,
    2023. <a href="https://doi.org/10.1002/cssc.202300128">https://doi.org/10.1002/cssc.202300128</a>.
  ieee: N. L. Farag <i>et al.</i>, “Triarylamines as catholytes in aqueous organic
    redox flow batteries,” <i>ChemSusChem</i>, vol. 16, no. 13. Wiley, 2023.
  ista: Farag NL, Jethwa RB, Beardmore AE, Insinna T, O’Keefe CA, Klusener PAA, Grey
    CP, Wright DS. 2023. Triarylamines as catholytes in aqueous organic redox flow
    batteries. ChemSusChem. 16(13), e202300128.
  mla: Farag, Nadia L., et al. “Triarylamines as Catholytes in Aqueous Organic Redox
    Flow Batteries.” <i>ChemSusChem</i>, vol. 16, no. 13, e202300128, Wiley, 2023,
    doi:<a href="https://doi.org/10.1002/cssc.202300128">10.1002/cssc.202300128</a>.
  short: N.L. Farag, R.B. Jethwa, A.E. Beardmore, T. Insinna, C.A. O’Keefe, P.A.A.
    Klusener, C.P. Grey, D.S. Wright, ChemSusChem 16 (2023).
date_created: 2023-05-21T22:01:05Z
date_published: 2023-07-06T00:00:00Z
date_updated: 2023-11-14T11:28:23Z
day: '06'
ddc:
- '540'
department:
- _id: StFr
doi: 10.1002/cssc.202300128
external_id:
  isi:
  - '000985051300001'
  pmid:
  - '36970847'
file:
- access_level: open_access
  checksum: efa0713289995af83a2147b3e8e1d6a6
  content_type: application/pdf
  creator: dernst
  date_created: 2023-11-14T11:27:16Z
  date_updated: 2023-11-14T11:27:16Z
  file_id: '14532'
  file_name: 2023_ChemSusChem_Farag.pdf
  file_size: 1168683
  relation: main_file
  success: 1
file_date_updated: 2023-11-14T11:27:16Z
has_accepted_license: '1'
intvolume: '        16'
isi: 1
issue: '13'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
pmid: 1
publication: ChemSusChem
publication_identifier:
  eissn:
  - 1864-564X
  issn:
  - 1864-5631
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Triarylamines as catholytes in aqueous organic redox flow batteries
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: 16
year: '2023'
...
---
_id: '13042'
abstract:
- lang: eng
  text: Let Lc,n denote the size of the longest cycle in G(n, c/n),c >1 constant.  We
    show that there exists a continuous function f(c) such that Lc,n/n→f(c) a.s.  for
    c>20,  thus  extending  a  result  of  Frieze  and  the  author  to  smaller  values  of
    c. Thereafter,  for c>20,  we  determine  the  limit  of  the  probability  that
    G(n, c/n)contains  cycles  of  every  length  between  the  length  of  its  shortest  and  its  longest
    cycles as n→∞.
acknowledgement: We would like to thank the reviewers for their helpful comments and
  remarks.
article_number: P2.21
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Michael
  full_name: Anastos, Michael
  id: 0b2a4358-bb35-11ec-b7b9-e3279b593dbb
  last_name: Anastos
citation:
  ama: Anastos M. A note on long cycles in sparse random graphs. <i>Electronic Journal
    of Combinatorics</i>. 2023;30(2). doi:<a href="https://doi.org/10.37236/11471">10.37236/11471</a>
  apa: Anastos, M. (2023). A note on long cycles in sparse random graphs. <i>Electronic
    Journal of Combinatorics</i>. Electronic Journal of Combinatorics. <a href="https://doi.org/10.37236/11471">https://doi.org/10.37236/11471</a>
  chicago: Anastos, Michael. “A Note on Long Cycles in Sparse Random Graphs.” <i>Electronic
    Journal of Combinatorics</i>. Electronic Journal of Combinatorics, 2023. <a href="https://doi.org/10.37236/11471">https://doi.org/10.37236/11471</a>.
  ieee: M. Anastos, “A note on long cycles in sparse random graphs,” <i>Electronic
    Journal of Combinatorics</i>, vol. 30, no. 2. Electronic Journal of Combinatorics,
    2023.
  ista: Anastos M. 2023. A note on long cycles in sparse random graphs. Electronic
    Journal of Combinatorics. 30(2), P2.21.
  mla: Anastos, Michael. “A Note on Long Cycles in Sparse Random Graphs.” <i>Electronic
    Journal of Combinatorics</i>, vol. 30, no. 2, P2.21, Electronic Journal of Combinatorics,
    2023, doi:<a href="https://doi.org/10.37236/11471">10.37236/11471</a>.
  short: M. Anastos, Electronic Journal of Combinatorics 30 (2023).
date_created: 2023-05-21T22:01:05Z
date_published: 2023-05-05T00:00:00Z
date_updated: 2023-08-01T14:44:52Z
day: '05'
ddc:
- '510'
department:
- _id: MaKw
doi: 10.37236/11471
external_id:
  arxiv:
  - '2105.13828'
  isi:
  - '000988285500001'
file:
- access_level: open_access
  checksum: 6269ed3b3eded6536d3d9d6baad2d5b9
  content_type: application/pdf
  creator: dernst
  date_created: 2023-05-22T07:43:19Z
  date_updated: 2023-05-22T07:43:19Z
  file_id: '13046'
  file_name: 2023_JourCombinatorics_Anastos.pdf
  file_size: 448736
  relation: main_file
  success: 1
file_date_updated: 2023-05-22T07:43:19Z
has_accepted_license: '1'
intvolume: '        30'
isi: 1
issue: '2'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
publication: Electronic Journal of Combinatorics
publication_identifier:
  eissn:
  - 1077-8926
publication_status: published
publisher: Electronic Journal of Combinatorics
quality_controlled: '1'
scopus_import: '1'
status: public
title: A note on long cycles in sparse random graphs
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 30
year: '2023'
...
---
_id: '13043'
abstract:
- lang: eng
  text: "We derive a weak-strong uniqueness principle for BV solutions to multiphase
    mean curvature flow of triple line clusters in three dimensions. Our proof is
    based on the explicit construction\r\nof a gradient flow calibration in the sense
    of the recent work of Fischer et al. (2020) for any such\r\ncluster. This extends
    the two-dimensional construction to the three-dimensional case of surfaces\r\nmeeting
    along triple junctions."
acknowledgement: This project has received funding from the European Research Council
  (ERC) under the European Union’s Horizon 2020 research and innovation programme
  (grant agreement no. 948819), and from the Deutsche Forschungsgemeinschaft (DFG,
  German Research Foundation) under Germany’s Excellence Strategy – EXC-2047/1 – 390685813.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Sebastian
  full_name: Hensel, Sebastian
  id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87
  last_name: Hensel
  orcid: 0000-0001-7252-8072
- first_name: Tim
  full_name: Laux, Tim
  last_name: Laux
citation:
  ama: Hensel S, Laux T. Weak-strong uniqueness for the mean curvature flow of double
    bubbles. <i>Interfaces and Free Boundaries</i>. 2023;25(1):37-107. doi:<a href="https://doi.org/10.4171/IFB/484">10.4171/IFB/484</a>
  apa: Hensel, S., &#38; Laux, T. (2023). Weak-strong uniqueness for the mean curvature
    flow of double bubbles. <i>Interfaces and Free Boundaries</i>. EMS Press. <a href="https://doi.org/10.4171/IFB/484">https://doi.org/10.4171/IFB/484</a>
  chicago: Hensel, Sebastian, and Tim Laux. “Weak-Strong Uniqueness for the Mean Curvature
    Flow of Double Bubbles.” <i>Interfaces and Free Boundaries</i>. EMS Press, 2023.
    <a href="https://doi.org/10.4171/IFB/484">https://doi.org/10.4171/IFB/484</a>.
  ieee: S. Hensel and T. Laux, “Weak-strong uniqueness for the mean curvature flow
    of double bubbles,” <i>Interfaces and Free Boundaries</i>, vol. 25, no. 1. EMS
    Press, pp. 37–107, 2023.
  ista: Hensel S, Laux T. 2023. Weak-strong uniqueness for the mean curvature flow
    of double bubbles. Interfaces and Free Boundaries. 25(1), 37–107.
  mla: Hensel, Sebastian, and Tim Laux. “Weak-Strong Uniqueness for the Mean Curvature
    Flow of Double Bubbles.” <i>Interfaces and Free Boundaries</i>, vol. 25, no. 1,
    EMS Press, 2023, pp. 37–107, doi:<a href="https://doi.org/10.4171/IFB/484">10.4171/IFB/484</a>.
  short: S. Hensel, T. Laux, Interfaces and Free Boundaries 25 (2023) 37–107.
date_created: 2023-05-21T22:01:06Z
date_published: 2023-04-20T00:00:00Z
date_updated: 2023-08-01T14:43:29Z
day: '20'
ddc:
- '510'
department:
- _id: JuFi
doi: 10.4171/IFB/484
ec_funded: 1
external_id:
  arxiv:
  - '2108.01733'
  isi:
  - '000975817300002'
file:
- access_level: open_access
  checksum: 622422484810441e48f613e968c7e7a4
  content_type: application/pdf
  creator: dernst
  date_created: 2023-05-22T07:24:13Z
  date_updated: 2023-05-22T07:24:13Z
  file_id: '13045'
  file_name: 2023_Interfaces_Hensel.pdf
  file_size: 867876
  relation: main_file
  success: 1
file_date_updated: 2023-05-22T07:24:13Z
has_accepted_license: '1'
intvolume: '        25'
isi: 1
issue: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 37-107
project:
- _id: 0aa76401-070f-11eb-9043-b5bb049fa26d
  call_identifier: H2020
  grant_number: '948819'
  name: Bridging Scales in Random Materials
publication: Interfaces and Free Boundaries
publication_identifier:
  eissn:
  - 1463-9971
  issn:
  - 1463-9963
publication_status: published
publisher: EMS Press
quality_controlled: '1'
related_material:
  record:
  - id: '10013'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: Weak-strong uniqueness for the mean curvature flow of double bubbles
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 25
year: '2023'
...
---
_id: '13044'
abstract:
- lang: eng
  text: Singlet oxygen (1O2) formation is now recognised as a key aspect of non-aqueous
    oxygen redox chemistry. For identifying 1O2, chemical trapping via 9,10-dimethylanthracene
    (DMA) to form the endoperoxide (DMA-O2) has become the mainstay method due to
    its sensitivity, selectivity, and ease of use. While DMA has been shown to be
    selective for 1O2, rather than forming DMA-O2 with a wide variety of potentially
    reactive O-containing species, false positives might hypothetically be obtained
    in the presence of previously overlooked species. Here, we first give unequivocal
    direct spectroscopic proof by the 1O2-specific near infrared (NIR) emission at
    1270 nm for the previously proposed 1O2 formation pathways, which centre around
    superoxide disproportionation. We then show that peroxocarbonates, common intermediates
    in metal-O2 and metal carbonate electrochemistry, do not produce false-positive
    DMA-O2. Moreover, we identify a previously unreported 1O2-forming pathway through
    the reaction of CO2 with superoxide. Overall, we give unequivocal proof for 1O2
    formation in non-aqueous oxygen redox and show that chemical trapping with DMA
    is a reliable method to assess 1O2 formation.
article_processing_charge: No
article_type: original
author:
- first_name: Soumyadip
  full_name: Mondal, Soumyadip
  id: d25d21ef-dc8d-11ea-abe3-ec4576307f48
  last_name: Mondal
- first_name: Rajesh B
  full_name: Jethwa, Rajesh B
  id: 4cc538d5-803f-11ed-ab7e-8139573aad8f
  last_name: Jethwa
  orcid: 0000-0002-0404-4356
- first_name: Bhargavi
  full_name: Pant, Bhargavi
  id: 50c64d4d-eb97-11eb-a6c2-d33e5e14f112
  last_name: Pant
- first_name: Robert
  full_name: Hauschild, Robert
  id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
  last_name: Hauschild
  orcid: 0000-0001-9843-3522
- first_name: Stefan Alexander
  full_name: Freunberger, Stefan Alexander
  id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
  last_name: Freunberger
  orcid: 0000-0003-2902-5319
citation:
  ama: 'Mondal S, Jethwa RB, Pant B, Hauschild R, Freunberger SA. Singlet oxygen in
    non-aqueous oxygen redox: Direct spectroscopic evidence for formation pathways
    and reliability of chemical probes. <i>Faraday Discussions</i>. 2023. doi:<a href="https://doi.org/10.1039/d3fd00088e">10.1039/d3fd00088e</a>'
  apa: 'Mondal, S., Jethwa, R. B., Pant, B., Hauschild, R., &#38; Freunberger, S.
    A. (2023). Singlet oxygen in non-aqueous oxygen redox: Direct spectroscopic evidence
    for formation pathways and reliability of chemical probes. <i>Faraday Discussions</i>.
    Royal Society of Chemistry. <a href="https://doi.org/10.1039/d3fd00088e">https://doi.org/10.1039/d3fd00088e</a>'
  chicago: 'Mondal, Soumyadip, Rajesh B Jethwa, Bhargavi Pant, Robert Hauschild, and
    Stefan Alexander Freunberger. “Singlet Oxygen in Non-Aqueous Oxygen Redox: Direct
    Spectroscopic Evidence for Formation Pathways and Reliability of Chemical Probes.”
    <i>Faraday Discussions</i>. Royal Society of Chemistry, 2023. <a href="https://doi.org/10.1039/d3fd00088e">https://doi.org/10.1039/d3fd00088e</a>.'
  ieee: 'S. Mondal, R. B. Jethwa, B. Pant, R. Hauschild, and S. A. Freunberger, “Singlet
    oxygen in non-aqueous oxygen redox: Direct spectroscopic evidence for formation
    pathways and reliability of chemical probes,” <i>Faraday Discussions</i>. Royal
    Society of Chemistry, 2023.'
  ista: 'Mondal S, Jethwa RB, Pant B, Hauschild R, Freunberger SA. 2023. Singlet oxygen
    in non-aqueous oxygen redox: Direct spectroscopic evidence for formation pathways
    and reliability of chemical probes. Faraday Discussions.'
  mla: 'Mondal, Soumyadip, et al. “Singlet Oxygen in Non-Aqueous Oxygen Redox: Direct
    Spectroscopic Evidence for Formation Pathways and Reliability of Chemical Probes.”
    <i>Faraday Discussions</i>, Royal Society of Chemistry, 2023, doi:<a href="https://doi.org/10.1039/d3fd00088e">10.1039/d3fd00088e</a>.'
  short: S. Mondal, R.B. Jethwa, B. Pant, R. Hauschild, S.A. Freunberger, Faraday
    Discussions (2023).
date_created: 2023-05-22T06:53:34Z
date_published: 2023-05-17T00:00:00Z
date_updated: 2023-12-13T11:19:07Z
day: '17'
department:
- _id: StFr
- _id: Bio
doi: 10.1039/d3fd00088e
external_id:
  isi:
  - '001070423500001'
isi: 1
keyword:
- Physical and Theoretical Chemistry
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1039/d3fd00088e
month: '05'
oa: 1
oa_version: Published Version
publication: Faraday Discussions
publication_identifier:
  eissn:
  - 1364-5498
  issn:
  - 1359-6640
publication_status: epub_ahead
publisher: Royal Society of Chemistry
quality_controlled: '1'
status: public
title: 'Singlet oxygen in non-aqueous oxygen redox: Direct spectroscopic evidence
  for formation pathways and reliability of chemical probes'
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
year: '2023'
...
---
_id: '13048'
abstract:
- lang: eng
  text: In this paper we introduce a pruning of the medial axis called the (λ,α)-medial
    axis (axλα). We prove that the (λ,α)-medial axis of a set K is stable in a Gromov-Hausdorff
    sense under weak assumptions. More formally we prove that if K and K′ are close
    in the Hausdorff (dH) sense then the (λ,α)-medial axes of K and K′ are close as
    metric spaces, that is the Gromov-Hausdorff distance (dGH) between the two is
    1/4-Hölder in the sense that dGH (axλα(K),axλα(K′)) ≲ dH(K,K′)1/4. The Hausdorff
    distance between the two medial axes is also bounded, by dH (axλα(K),λα(K′)) ≲
    dH(K,K′)1/2. These quantified stability results provide guarantees for practical
    computations of medial axes from approximations. Moreover, they provide key ingredients
    for studying the computability of the medial axis in the context of computable
    analysis.
acknowledgement: "We are greatly indebted to Erin Chambers for posing a number of
  questions that eventually led to this paper. We would also like to thank the other
  organizers of the workshop on ‘Algorithms\r\nfor the medial axis’. We are also indebted
  to Tatiana Ezubova for helping with the search for and translation of Russian literature.
  The second author thanks all members of the Edelsbrunner and Datashape groups for
  the atmosphere in which the research was conducted.\r\nThe research leading to these
  results has received funding from the European Research Council (ERC) under the
  European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement
  No. 339025 GUDHI (Algorithmic Foundations of Geometry Understanding in Higher Dimensions).
  Supported by the European Union’s Horizon 2020 research and innovation programme
  under the Marie Skłodowska-Curie grant agreement No. 754411. The Austrian science
  fund (FWF) M-3073."
article_processing_charge: No
arxiv: 1
author:
- first_name: André
  full_name: Lieutier, André
  last_name: Lieutier
- first_name: Mathijs
  full_name: Wintraecken, Mathijs
  id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
  last_name: Wintraecken
  orcid: 0000-0002-7472-2220
citation:
  ama: 'Lieutier A, Wintraecken M. Hausdorff and Gromov-Hausdorff stable subsets of
    the medial axis. In: <i>Proceedings of the 55th Annual ACM Symposium on Theory
    of Computing</i>. Association for Computing Machinery; 2023:1768-1776. doi:<a
    href="https://doi.org/10.1145/3564246.3585113">10.1145/3564246.3585113</a>'
  apa: 'Lieutier, A., &#38; Wintraecken, M. (2023). Hausdorff and Gromov-Hausdorff
    stable subsets of the medial axis. In <i>Proceedings of the 55th Annual ACM Symposium
    on Theory of Computing</i> (pp. 1768–1776). Orlando, FL, United States: Association
    for Computing Machinery. <a href="https://doi.org/10.1145/3564246.3585113">https://doi.org/10.1145/3564246.3585113</a>'
  chicago: Lieutier, André, and Mathijs Wintraecken. “Hausdorff and Gromov-Hausdorff
    Stable Subsets of the Medial Axis.” In <i>Proceedings of the 55th Annual ACM Symposium
    on Theory of Computing</i>, 1768–76. Association for Computing Machinery, 2023.
    <a href="https://doi.org/10.1145/3564246.3585113">https://doi.org/10.1145/3564246.3585113</a>.
  ieee: A. Lieutier and M. Wintraecken, “Hausdorff and Gromov-Hausdorff stable subsets
    of the medial axis,” in <i>Proceedings of the 55th Annual ACM Symposium on Theory
    of Computing</i>, Orlando, FL, United States, 2023, pp. 1768–1776.
  ista: 'Lieutier A, Wintraecken M. 2023. Hausdorff and Gromov-Hausdorff stable subsets
    of the medial axis. Proceedings of the 55th Annual ACM Symposium on Theory of
    Computing. STOC: Symposium on Theory of Computing, 1768–1776.'
  mla: Lieutier, André, and Mathijs Wintraecken. “Hausdorff and Gromov-Hausdorff Stable
    Subsets of the Medial Axis.” <i>Proceedings of the 55th Annual ACM Symposium on
    Theory of Computing</i>, Association for Computing Machinery, 2023, pp. 1768–76,
    doi:<a href="https://doi.org/10.1145/3564246.3585113">10.1145/3564246.3585113</a>.
  short: A. Lieutier, M. Wintraecken, in:, Proceedings of the 55th Annual ACM Symposium
    on Theory of Computing, Association for Computing Machinery, 2023, pp. 1768–1776.
conference:
  end_date: 2023-06-23
  location: Orlando, FL, United States
  name: 'STOC: Symposium on Theory of Computing'
  start_date: 2023-06-20
date_created: 2023-05-22T08:02:02Z
date_published: 2023-06-02T00:00:00Z
date_updated: 2023-05-22T08:15:19Z
day: '02'
department:
- _id: HeEd
doi: 10.1145/3564246.3585113
ec_funded: 1
external_id:
  arxiv:
  - '2303.04014'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2303.04014
month: '06'
oa: 1
oa_version: Preprint
page: 1768-1776
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '754411'
  name: ISTplus - Postdoctoral Fellowships
- _id: fc390959-9c52-11eb-aca3-afa58bd282b2
  grant_number: M03073
  name: Learning and triangulating manifolds via collapses
publication: Proceedings of the 55th Annual ACM Symposium on Theory of Computing
publication_identifier:
  isbn:
  - '9781450399135'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
status: public
title: Hausdorff and Gromov-Hausdorff stable subsets of the medial axis
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '13049'
abstract:
- lang: eng
  text: "We propose a computational design approach for covering a surface with individually
    addressable RGB LEDs, effectively forming a low-resolution surface screen. To
    achieve a low-cost and scalable approach, we propose creating designs from flat
    PCB panels bent in-place along the surface of a 3D printed core. Working with
    standard rigid PCBs enables the use of\r\nestablished PCB manufacturing services,
    allowing the fabrication of designs with several hundred LEDs. \r\nOur approach
    optimizes the PCB geometry for folding, and then jointly optimizes the LED packing,
    circuit and routing, solving a challenging layout problem under strict manufacturing
    requirements. Unlike paper, PCBs cannot bend beyond a certain point without breaking.
    Therefore, we introduce parametric cut patterns acting as hinges, designed to
    allow bending while remaining compact. To tackle the joint optimization of placement,
    circuit and routing, we propose a specialized algorithm that splits the global
    problem into one sub-problem per triangle, which is then individually solved.\r\nOur
    technique generates PCB blueprints in a completely automated way. After being
    fabricated by a PCB manufacturing service, the boards are bent and glued by the
    user onto the 3D printed support. We demonstrate our technique on a range of physical
    models and virtual examples, creating intricate surface light patterns from hundreds
    of LEDs."
acknowledged_ssus:
- _id: M-Shop
acknowledgement: We thank the reviewers for the valuable feedback. We also thank the
  Miba Machine Shop at ISTA, PCBWay, and PragoBoard for helping us with fabrication
  and assembly. This project was supported by the European Research Council (ERC)
  under the European Union’s Horizon 2020 research and innovation program (Grant Agreement
  No. 715767 – MATERIALIZABLE).
article_number: '142'
article_processing_charge: No
article_type: original
author:
- first_name: Marco
  full_name: Freire, Marco
  last_name: Freire
- first_name: Manas
  full_name: Bhargava, Manas
  id: FF8FA64C-AA6A-11E9-99AD-50D4E5697425
  last_name: Bhargava
  orcid: 0009-0007-6138-6890
- first_name: Camille
  full_name: Schreck, Camille
  id: 2B14B676-F248-11E8-B48F-1D18A9856A87
  last_name: Schreck
- first_name: Pierre-Alexandre
  full_name: Hugron, Pierre-Alexandre
  last_name: Hugron
- first_name: Bernd
  full_name: Bickel, Bernd
  id: 49876194-F248-11E8-B48F-1D18A9856A87
  last_name: Bickel
  orcid: 0000-0001-6511-9385
- first_name: Sylvain
  full_name: Lefebvre, Sylvain
  last_name: Lefebvre
citation:
  ama: 'Freire M, Bhargava M, Schreck C, Hugron P-A, Bickel B, Lefebvre S. PCBend:
    Light up your 3D shapes with foldable circuit boards. <i>Transactions on Graphics</i>.
    2023;42(4). doi:<a href="https://doi.org/10.1145/3592411">10.1145/3592411</a>'
  apa: 'Freire, M., Bhargava, M., Schreck, C., Hugron, P.-A., Bickel, B., &#38; Lefebvre,
    S. (2023). PCBend: Light up your 3D shapes with foldable circuit boards. <i>Transactions
    on Graphics</i>. Los Angeles, CA, United States: Association for Computing Machinery.
    <a href="https://doi.org/10.1145/3592411">https://doi.org/10.1145/3592411</a>'
  chicago: 'Freire, Marco, Manas Bhargava, Camille Schreck, Pierre-Alexandre Hugron,
    Bernd Bickel, and Sylvain Lefebvre. “PCBend: Light up Your 3D Shapes with Foldable
    Circuit Boards.” <i>Transactions on Graphics</i>. Association for Computing Machinery,
    2023. <a href="https://doi.org/10.1145/3592411">https://doi.org/10.1145/3592411</a>.'
  ieee: 'M. Freire, M. Bhargava, C. Schreck, P.-A. Hugron, B. Bickel, and S. Lefebvre,
    “PCBend: Light up your 3D shapes with foldable circuit boards,” <i>Transactions
    on Graphics</i>, vol. 42, no. 4. Association for Computing Machinery, 2023.'
  ista: 'Freire M, Bhargava M, Schreck C, Hugron P-A, Bickel B, Lefebvre S. 2023.
    PCBend: Light up your 3D shapes with foldable circuit boards. Transactions on
    Graphics. 42(4), 142.'
  mla: 'Freire, Marco, et al. “PCBend: Light up Your 3D Shapes with Foldable Circuit
    Boards.” <i>Transactions on Graphics</i>, vol. 42, no. 4, 142, Association for
    Computing Machinery, 2023, doi:<a href="https://doi.org/10.1145/3592411">10.1145/3592411</a>.'
  short: M. Freire, M. Bhargava, C. Schreck, P.-A. Hugron, B. Bickel, S. Lefebvre,
    Transactions on Graphics 42 (2023).
conference:
  end_date: 2023-08-10
  location: Los Angeles, CA, United States
  name: 'SIGGRAPH: Computer Graphics and Interactive Techniques Conference'
  start_date: 2023-08-06
date_created: 2023-05-22T08:37:04Z
date_published: 2023-07-26T00:00:00Z
date_updated: 2024-01-29T10:30:49Z
day: '26'
ddc:
- '006'
department:
- _id: GradSch
- _id: BeBi
doi: 10.1145/3592411
ec_funded: 1
external_id:
  isi:
  - '001044671300108'
file:
- access_level: open_access
  checksum: a0b0ba3b36f43a94388e8824613d812a
  content_type: application/pdf
  creator: dernst
  date_created: 2023-06-19T11:02:23Z
  date_updated: 2023-06-19T11:02:23Z
  file_id: '13156'
  file_name: 2023_ACMToG_Freire.pdf
  file_size: 78940724
  relation: main_file
  success: 1
- access_level: open_access
  checksum: b9206bbb67af82df49b7e7cdbde3410c
  content_type: application/pdf
  creator: dernst
  date_created: 2023-06-20T12:20:51Z
  date_updated: 2023-06-20T12:20:51Z
  file_id: '13157'
  file_name: 2023_ACMToG_SuppMaterial_Freire.pdf
  file_size: 34345905
  relation: main_file
  success: 1
file_date_updated: 2023-06-20T12:20:51Z
has_accepted_license: '1'
intvolume: '        42'
isi: 1
issue: '4'
keyword:
- PCB design and layout
- Mesh geometry models
language:
- iso: eng
month: '07'
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: Transactions on Graphics
publication_identifier:
  eissn:
  - 1557-7368
  issn:
  - 0730-0301
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
status: public
title: 'PCBend: Light up your 3D shapes with foldable circuit boards'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 42
year: '2023'
...
---
_id: '13053'
abstract:
- lang: eng
  text: 'Deep neural networks (DNNs) often have to be compressed, via pruning and/or
    quantization, before they can be deployed in practical settings. In this work
    we propose a new compression-aware minimizer dubbed CrAM that modifies the optimization
    step in a principled way, in order to produce models whose local loss behavior
    is stable under compression operations such as pruning. Thus, dense models trained
    via CrAM should be compressible post-training, in a single step, without significant
    accuracy loss. Experimental results on standard benchmarks, such as residual networks
    for ImageNet classification and BERT models for language modelling, show that
    CrAM produces dense models that can be more accurate than the standard SGD/Adam-based
    baselines, but which are stable under weight pruning: specifically, we can prune
    models in one-shot to 70-80% sparsity with almost no accuracy loss, and to 90%
    with reasonable (∼1%) accuracy loss, which is competitive with gradual compression
    methods. Additionally, CrAM can produce sparse models which perform well for transfer
    learning, and it also works for semi-structured 2:4 pruning patterns supported
    by GPU hardware. The code for reproducing the results is available at this https
    URL .'
acknowledged_ssus:
- _id: ScienComp
acknowledgement: "AP, EK, DA received funding from the European Research Council (ERC)
  under the European\r\nUnion’s Horizon 2020 research and innovation programme (grant
  agreement No 805223 ScaleML). AV acknowledges the support of the French Agence Nationale
  de la Recherche (ANR), under grant ANR-21-CE48-0016 (project COMCOPT). We further
  acknowledge the support from the Scientific Service Units (SSU) of ISTA through
  resources provided by Scientific Computing (SciComp)-"
article_processing_charge: No
arxiv: 1
author:
- first_name: Elena-Alexandra
  full_name: Peste, Elena-Alexandra
  id: 32D78294-F248-11E8-B48F-1D18A9856A87
  last_name: Peste
- first_name: Adrian
  full_name: Vladu, Adrian
  last_name: Vladu
- first_name: Eldar
  full_name: Kurtic, Eldar
  id: 47beb3a5-07b5-11eb-9b87-b108ec578218
  last_name: Kurtic
- first_name: Christoph
  full_name: Lampert, Christoph
  id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
  last_name: Lampert
  orcid: 0000-0001-8622-7887
- first_name: Dan-Adrian
  full_name: Alistarh, Dan-Adrian
  id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
  last_name: Alistarh
  orcid: 0000-0003-3650-940X
citation:
  ama: 'Peste E-A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. CrAM: A Compression-Aware
    Minimizer. In: <i>11th International Conference on Learning Representations </i>.'
  apa: 'Peste, E.-A., Vladu, A., Kurtic, E., Lampert, C., &#38; Alistarh, D.-A. (n.d.).
    CrAM: A Compression-Aware Minimizer. In <i>11th International Conference on Learning
    Representations </i>. Kigali, Rwanda .'
  chicago: 'Peste, Elena-Alexandra, Adrian Vladu, Eldar Kurtic, Christoph Lampert,
    and Dan-Adrian Alistarh. “CrAM: A Compression-Aware Minimizer.” In <i>11th International
    Conference on Learning Representations </i>, n.d.'
  ieee: 'E.-A. Peste, A. Vladu, E. Kurtic, C. Lampert, and D.-A. Alistarh, “CrAM:
    A Compression-Aware Minimizer,” in <i>11th International Conference on Learning
    Representations </i>, Kigali, Rwanda .'
  ista: 'Peste E-A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. CrAM: A Compression-Aware
    Minimizer. 11th International Conference on Learning Representations . ICLR: International
    Conference on Learning Representations.'
  mla: 'Peste, Elena-Alexandra, et al. “CrAM: A Compression-Aware Minimizer.” <i>11th
    International Conference on Learning Representations </i>.'
  short: E.-A. Peste, A. Vladu, E. Kurtic, C. Lampert, D.-A. Alistarh, in:, 11th International
    Conference on Learning Representations , n.d.
conference:
  end_date: 2023-05-05
  location: 'Kigali, Rwanda '
  name: 'ICLR: International Conference on Learning Representations'
  start_date: 2023-05-01
date_created: 2023-05-23T11:36:18Z
date_published: 2023-05-01T00:00:00Z
date_updated: 2023-06-01T12:54:45Z
department:
- _id: GradSch
- _id: DaAl
- _id: ChLa
ec_funded: 1
external_id:
  arxiv:
  - '2207.14200'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://openreview.net/pdf?id=_eTZBs-yedr
month: '05'
oa: 1
oa_version: Preprint
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '805223'
  name: Elastic Coordination for Scalable Machine Learning
publication: '11th International Conference on Learning Representations '
publication_status: accepted
quality_controlled: '1'
related_material:
  record:
  - id: '13074'
    relation: dissertation_contains
    status: public
status: public
title: 'CrAM: A Compression-Aware Minimizer'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '13074'
abstract:
- lang: eng
  text: "Deep learning has become an integral part of a large number of important
    applications, and many of the recent breakthroughs have been enabled by the ability
    to train very large models, capable to capture complex patterns and relationships
    from the data. At the same time, the massive sizes of modern deep learning models
    have made their deployment to smaller devices more challenging; this is particularly
    important, as in many applications the users rely on accurate deep learning predictions,
    but they only have access to devices with limited memory and compute power. One
    solution to this problem is to prune neural networks, by setting as many of their
    parameters as possible to zero, to obtain accurate sparse models with lower memory
    footprint. Despite the great research progress in obtaining sparse models that
    preserve accuracy, while satisfying memory and computational constraints, there
    are still many challenges associated with efficiently training sparse models,
    as well as understanding their generalization properties.\r\n\r\nThe focus of
    this thesis is to investigate how the training process of sparse models can be
    made more efficient, and to understand the differences between sparse and dense
    models in terms of how well they can generalize to changes in the data distribution.
    We first study a method for co-training sparse and dense models, at a lower cost
    compared to regular training. With our method we can obtain very accurate sparse
    networks, and dense models that can recover the baseline accuracy. Furthermore,
    we are able to more easily analyze the differences, at prediction level, between
    the sparse-dense model pairs. Next, we investigate the generalization properties
    of sparse neural networks in more detail, by studying how well different sparse
    models trained on a larger task can adapt to smaller, more specialized tasks,
    in a transfer learning scenario. Our analysis across multiple pruning methods
    and sparsity levels reveals that sparse models provide features that can transfer
    similarly to or better than the dense baseline. However, the choice of the pruning
    method plays an important role, and can influence the results when the features
    are fixed (linear finetuning), or when they are allowed to adapt to the new task
    (full finetuning). Using sparse models with fixed masks for finetuning on new
    tasks has an important practical advantage, as it enables training neural networks
    on smaller devices. However, one drawback of current pruning methods is that the
    entire training cycle has to be repeated to obtain the initial sparse model, for
    every sparsity target; in consequence, the entire training process is costly and
    also multiple models need to be stored. In the last part of the thesis we propose
    a method that can train accurate dense models that are compressible in a single
    step, to multiple sparsity levels, without additional finetuning. Our method results
    in sparse models that can be competitive with existing pruning methods, and which
    can also successfully generalize to new tasks."
acknowledged_ssus:
- _id: ScienComp
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Elena-Alexandra
  full_name: Peste, Elena-Alexandra
  id: 32D78294-F248-11E8-B48F-1D18A9856A87
  last_name: Peste
citation:
  ama: Peste E-A. Efficiency and generalization of sparse neural networks. 2023. doi:<a
    href="https://doi.org/10.15479/at:ista:13074">10.15479/at:ista:13074</a>
  apa: Peste, E.-A. (2023). <i>Efficiency and generalization of sparse neural networks</i>.
    Institute of Science and Technology Austria. <a href="https://doi.org/10.15479/at:ista:13074">https://doi.org/10.15479/at:ista:13074</a>
  chicago: Peste, Elena-Alexandra. “Efficiency and Generalization of Sparse Neural
    Networks.” Institute of Science and Technology Austria, 2023. <a href="https://doi.org/10.15479/at:ista:13074">https://doi.org/10.15479/at:ista:13074</a>.
  ieee: E.-A. Peste, “Efficiency and generalization of sparse neural networks,” Institute
    of Science and Technology Austria, 2023.
  ista: Peste E-A. 2023. Efficiency and generalization of sparse neural networks.
    Institute of Science and Technology Austria.
  mla: Peste, Elena-Alexandra. <i>Efficiency and Generalization of Sparse Neural Networks</i>.
    Institute of Science and Technology Austria, 2023, doi:<a href="https://doi.org/10.15479/at:ista:13074">10.15479/at:ista:13074</a>.
  short: E.-A. Peste, Efficiency and Generalization of Sparse Neural Networks, Institute
    of Science and Technology Austria, 2023.
date_created: 2023-05-23T17:07:53Z
date_published: 2023-05-23T00:00:00Z
date_updated: 2023-08-04T10:33:27Z
day: '23'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: GradSch
- _id: DaAl
- _id: ChLa
doi: 10.15479/at:ista:13074
ec_funded: 1
file:
- access_level: open_access
  checksum: 6b3354968403cb9d48cc5a83611fb571
  content_type: application/pdf
  creator: epeste
  date_created: 2023-05-24T16:11:16Z
  date_updated: 2023-05-24T16:11:16Z
  file_id: '13087'
  file_name: PhD_Thesis_Alexandra_Peste_final.pdf
  file_size: 2152072
  relation: main_file
  success: 1
- access_level: closed
  checksum: 8d0df94bbcf4db72c991f22503b3fd60
  content_type: application/zip
  creator: epeste
  date_created: 2023-05-24T16:12:59Z
  date_updated: 2023-05-24T16:12:59Z
  file_id: '13088'
  file_name: PhD_Thesis_APeste.zip
  file_size: 1658293
  relation: source_file
file_date_updated: 2023-05-24T16:12:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '147'
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '665385'
  name: International IST Doctoral Program
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '805223'
  name: Elastic Coordination for Scalable Machine Learning
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '11458'
    relation: part_of_dissertation
    status: public
  - id: '13053'
    relation: part_of_dissertation
    status: public
  - id: '12299'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- first_name: Christoph
  full_name: Lampert, Christoph
  id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
  last_name: Lampert
  orcid: 0000-0001-8622-7887
- first_name: Dan-Adrian
  full_name: Alistarh, Dan-Adrian
  id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
  last_name: Alistarh
  orcid: 0000-0003-3650-940X
title: Efficiency and generalization of sparse neural networks
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2023'
...
---
_id: '13091'
abstract:
- lang: eng
  text: We use a function field version of the Hardy–Littlewood circle method to study
    the locus of free rational curves on an arbitrary smooth projective hypersurface
    of sufficiently low degree. On the one hand this allows us to bound the dimension
    of the singular locus of the moduli space of rational curves on such hypersurfaces
    and, on the other hand, it sheds light on Peyre’s reformulation of the Batyrev–Manin
    conjecture in terms of slopes with respect to the tangent bundle.
acknowledgement: The authors are grateful to Paul Nelson, Per Salberger and Jason
  Starr for useful comments. While working on this paper the first author was supported
  by EPRSC grant EP/P026710/1. The research was partially conducted during the period
  the second author served as a Clay Research Fellow, and partially conducted during
  the period he was supported by Dr. Max Rössler, the Walter Haefner Foundation and
  the ETH Zurich Foundation.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Timothy D
  full_name: Browning, Timothy D
  id: 35827D50-F248-11E8-B48F-1D18A9856A87
  last_name: Browning
  orcid: 0000-0002-8314-0177
- first_name: Will
  full_name: Sawin, Will
  last_name: Sawin
citation:
  ama: Browning TD, Sawin W. Free rational curves on low degree hypersurfaces and
    the circle method. <i>Algebra and Number Theory</i>. 2023;17(3):719-748. doi:<a
    href="https://doi.org/10.2140/ant.2023.17.719">10.2140/ant.2023.17.719</a>
  apa: Browning, T. D., &#38; Sawin, W. (2023). Free rational curves on low degree
    hypersurfaces and the circle method. <i>Algebra and Number Theory</i>. Mathematical
    Sciences Publishers. <a href="https://doi.org/10.2140/ant.2023.17.719">https://doi.org/10.2140/ant.2023.17.719</a>
  chicago: Browning, Timothy D, and Will Sawin. “Free Rational Curves on Low Degree
    Hypersurfaces and the Circle Method.” <i>Algebra and Number Theory</i>. Mathematical
    Sciences Publishers, 2023. <a href="https://doi.org/10.2140/ant.2023.17.719">https://doi.org/10.2140/ant.2023.17.719</a>.
  ieee: T. D. Browning and W. Sawin, “Free rational curves on low degree hypersurfaces
    and the circle method,” <i>Algebra and Number Theory</i>, vol. 17, no. 3. Mathematical
    Sciences Publishers, pp. 719–748, 2023.
  ista: Browning TD, Sawin W. 2023. Free rational curves on low degree hypersurfaces
    and the circle method. Algebra and Number Theory. 17(3), 719–748.
  mla: Browning, Timothy D., and Will Sawin. “Free Rational Curves on Low Degree Hypersurfaces
    and the Circle Method.” <i>Algebra and Number Theory</i>, vol. 17, no. 3, Mathematical
    Sciences Publishers, 2023, pp. 719–48, doi:<a href="https://doi.org/10.2140/ant.2023.17.719">10.2140/ant.2023.17.719</a>.
  short: T.D. Browning, W. Sawin, Algebra and Number Theory 17 (2023) 719–748.
date_created: 2023-05-28T22:01:02Z
date_published: 2023-04-12T00:00:00Z
date_updated: 2023-08-01T14:51:57Z
day: '12'
ddc:
- '510'
department:
- _id: TiBr
doi: 10.2140/ant.2023.17.719
external_id:
  arxiv:
  - '1810.06882'
  isi:
  - '000996014700004'
file:
- access_level: open_access
  checksum: 5d5d67b235905650e33cf7065d7583b4
  content_type: application/pdf
  creator: dernst
  date_created: 2023-05-30T08:05:22Z
  date_updated: 2023-05-30T08:05:22Z
  file_id: '13101'
  file_name: 2023_AlgebraNumberTheory_Browning.pdf
  file_size: 1430719
  relation: main_file
  success: 1
file_date_updated: 2023-05-30T08:05:22Z
has_accepted_license: '1'
intvolume: '        17'
isi: 1
issue: '3'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 719-748
project:
- _id: 26A8D266-B435-11E9-9278-68D0E5697425
  grant_number: EP-P026710-2
  name: Between rational and integral points
publication: Algebra and Number Theory
publication_identifier:
  eissn:
  - 1944-7833
  issn:
  - 1937-0652
publication_status: published
publisher: Mathematical Sciences Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Free rational curves on low degree hypersurfaces and the circle method
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 17
year: '2023'
...
---
_id: '13092'
abstract:
- lang: eng
  text: There is a need for the development of lead-free thermoelectric materials
    for medium-/high-temperature applications. Here, we report a thiol-free tin telluride
    (SnTe) precursor that can be thermally decomposed to produce SnTe crystals with
    sizes ranging from tens to several hundreds of nanometers. We further engineer
    SnTe–Cu2SnTe3 nanocomposites with a homogeneous phase distribution by decomposing
    the liquid SnTe precursor containing a dispersion of Cu1.5Te colloidal nanoparticles.
    The presence of Cu within the SnTe and the segregated semimetallic Cu2SnTe3 phase
    effectively improves the electrical conductivity of SnTe while simultaneously
    reducing the lattice thermal conductivity without compromising the Seebeck coefficient.
    Overall, power factors up to 3.63 mW m–1 K–2 and thermoelectric figures of merit
    up to 1.04 are obtained at 823 K, which represent a 167% enhancement compared
    with pristine SnTe.
acknowledgement: Open Access is funded by the Austrian Science Fund (FWF). We thank
  Generalitat de Catalunya AGAUR─2021 SGR 01581 for financial support. B.F.N., K.X.,
  and L.L.Y. thank the China Scholarship Council (CSC) for the scholarship support.
  C.C. acknowledges funding from the FWF “Lise Meitner Fellowship” grant agreement
  M 2889-N. J.S.L is grateful to the Science and Technology Department of Sichuan
  Province for the project no. 22NSFSC0966. K.H.L. was supported by the Institute
  of Zhejiang University-Quzhou (IZQ2021RCZX003). M.I. acknowledges the financial
  support from IST Austria.
article_processing_charge: No
article_type: original
author:
- first_name: Bingfei
  full_name: Nan, Bingfei
  last_name: 'Nan'
- first_name: Xuan
  full_name: Song, Xuan
  last_name: Song
- first_name: Cheng
  full_name: Chang, Cheng
  id: 9E331C2E-9F27-11E9-AE48-5033E6697425
  last_name: Chang
  orcid: 0000-0002-9515-4277
- first_name: Ke
  full_name: Xiao, Ke
  last_name: Xiao
- first_name: Yu
  full_name: Zhang, Yu
  last_name: Zhang
- first_name: Linlin
  full_name: Yang, Linlin
  last_name: Yang
- first_name: Sharona
  full_name: Horta, Sharona
  id: 03a7e858-01b1-11ec-8b71-99ae6c4a05bc
  last_name: Horta
- first_name: Junshan
  full_name: Li, Junshan
  last_name: Li
- first_name: Khak Ho
  full_name: Lim, Khak Ho
  last_name: Lim
- first_name: Maria
  full_name: Ibáñez, Maria
  id: 43C61214-F248-11E8-B48F-1D18A9856A87
  last_name: Ibáñez
  orcid: 0000-0001-5013-2843
- first_name: Andreu
  full_name: Cabot, Andreu
  last_name: Cabot
citation:
  ama: Nan B, Song X, Chang C, et al. Bottom-up synthesis of SnTe-based thermoelectric
    composites. <i>ACS Applied Materials and Interfaces</i>. 2023;15(19):23380–23389.
    doi:<a href="https://doi.org/10.1021/acsami.3c00625">10.1021/acsami.3c00625</a>
  apa: Nan, B., Song, X., Chang, C., Xiao, K., Zhang, Y., Yang, L., … Cabot, A. (2023).
    Bottom-up synthesis of SnTe-based thermoelectric composites. <i>ACS Applied Materials
    and Interfaces</i>. American Chemical Society. <a href="https://doi.org/10.1021/acsami.3c00625">https://doi.org/10.1021/acsami.3c00625</a>
  chicago: Nan, Bingfei, Xuan Song, Cheng Chang, Ke Xiao, Yu Zhang, Linlin Yang, Sharona
    Horta, et al. “Bottom-up Synthesis of SnTe-Based Thermoelectric Composites.” <i>ACS
    Applied Materials and Interfaces</i>. American Chemical Society, 2023. <a href="https://doi.org/10.1021/acsami.3c00625">https://doi.org/10.1021/acsami.3c00625</a>.
  ieee: B. Nan <i>et al.</i>, “Bottom-up synthesis of SnTe-based thermoelectric composites,”
    <i>ACS Applied Materials and Interfaces</i>, vol. 15, no. 19. American Chemical
    Society, pp. 23380–23389, 2023.
  ista: Nan B, Song X, Chang C, Xiao K, Zhang Y, Yang L, Horta S, Li J, Lim KH, Ibáñez
    M, Cabot A. 2023. Bottom-up synthesis of SnTe-based thermoelectric composites.
    ACS Applied Materials and Interfaces. 15(19), 23380–23389.
  mla: Nan, Bingfei, et al. “Bottom-up Synthesis of SnTe-Based Thermoelectric Composites.”
    <i>ACS Applied Materials and Interfaces</i>, vol. 15, no. 19, American Chemical
    Society, 2023, pp. 23380–23389, doi:<a href="https://doi.org/10.1021/acsami.3c00625">10.1021/acsami.3c00625</a>.
  short: B. Nan, X. Song, C. Chang, K. Xiao, Y. Zhang, L. Yang, S. Horta, J. Li, K.H.
    Lim, M. Ibáñez, A. Cabot, ACS Applied Materials and Interfaces 15 (2023) 23380–23389.
date_created: 2023-05-28T22:01:03Z
date_published: 2023-05-04T00:00:00Z
date_updated: 2023-08-01T14:50:09Z
day: '04'
ddc:
- '540'
department:
- _id: MaIb
doi: 10.1021/acsami.3c00625
external_id:
  isi:
  - '000985497900001'
  pmid:
  - '37141543'
file:
- access_level: open_access
  checksum: 23893be46763c4c78daacddd019de821
  content_type: application/pdf
  creator: dernst
  date_created: 2023-05-30T07:38:44Z
  date_updated: 2023-05-30T07:38:44Z
  file_id: '13099'
  file_name: 2023_ACSAppliedMaterials_Nan.pdf
  file_size: 5640829
  relation: main_file
  success: 1
file_date_updated: 2023-05-30T07:38:44Z
has_accepted_license: '1'
intvolume: '        15'
isi: 1
issue: '19'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 23380–23389
pmid: 1
project:
- _id: 9B8804FC-BA93-11EA-9121-9846C619BF3A
  grant_number: M02889
  name: Bottom-up Engineering for Thermoelectric Applications
publication: ACS Applied Materials and Interfaces
publication_identifier:
  eissn:
  - 1944-8252
  issn:
  - 1944-8244
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bottom-up synthesis of SnTe-based thermoelectric composites
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 15
year: '2023'
...
