---
OA_place: publisher
_id: '8366'
abstract:
- lang: eng
text: "Fabrication of curved shells plays an important role in modern design, industry,
and science. Among their remarkable properties are, for example, aesthetics of
organic shapes, ability to evenly distribute loads, or efficient flow separation.
They find applications across vast length scales ranging from sky-scraper architecture
to microscopic devices. But, at\r\nthe same time, the design of curved shells
and their manufacturing process pose a variety of challenges. In this thesis,
they are addressed from several perspectives. In particular, this thesis presents
approaches based on the transformation of initially flat sheets into the target
curved surfaces. This involves problems of interactive design of shells with nontrivial
mechanical constraints, inverse design of complex structural materials, and data-driven
modeling of delicate and time-dependent physical properties. At the same time,
two newly-developed self-morphing mechanisms targeting flat-to-curved transformation
are presented.\r\nIn architecture, doubly curved surfaces can be realized as cold
bent glass panelizations. Originally flat glass panels are bent into frames and
remain stressed. This is a cost-efficient fabrication approach compared to hot
bending, when glass panels are shaped plastically. However such constructions
are prone to breaking during bending, and it is highly\r\nnontrivial to navigate
the design space, keeping the panels fabricable and aesthetically pleasing at
the same time. We introduce an interactive design system for cold bent glass façades,
while previously even offline optimization for such scenarios has not been sufficiently
developed. Our method is based on a deep learning approach providing quick\r\nand
high precision estimation of glass panel shape and stress while handling the shape\r\nmultimodality.\r\nFabrication
of smaller objects of scales below 1 m, can also greatly benefit from shaping
originally flat sheets. In this respect, we designed new self-morphing shell mechanisms
transforming from an initial flat state to a doubly curved state with high precision
and detail. Our so-called CurveUps demonstrate the encodement of the geometric
information\r\ninto the shell. Furthermore, we explored the frontiers of programmable
materials and showed how temporal information can additionally be encoded into
a flat shell. This allows prescribing deformation sequences for doubly curved
surfaces and, thus, facilitates self-collision avoidance enabling complex shapes
and functionalities otherwise impossible.\r\nBoth of these methods include inverse
design tools keeping the user in the design loop."
acknowledged_ssus:
- _id: M-Shop
- _id: ScienComp
acknowledgement: "During the work on this thesis, I received substantial support from
IST Austria’s scientific service units. A big thank you to Todor Asenov and other
Miba Machine Shop team members for their help with fabrication of experimental prototypes.
In addition, I would like to thank Scientific Computing team for the support with
high performance computing.\r\nFinancial support was provided by the European Research
Council (ERC) under grant agreement No 715767 - MATERIALIZABLE: Intelligent fabrication-oriented
Computational Design and Modeling, which I gratefully acknowledge."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Ruslan
full_name: Guseinov, Ruslan
id: 3AB45EE2-F248-11E8-B48F-1D18A9856A87
last_name: Guseinov
orcid: 0000-0001-9819-5077
citation:
ama: 'Guseinov R. Computational design of curved thin shells: From glass façades
to programmable matter. 2020. doi:10.15479/AT:ISTA:8366'
apa: 'Guseinov, R. (2020). Computational design of curved thin shells: From glass
façades to programmable matter. Institute of Science and Technology Austria.
https://doi.org/10.15479/AT:ISTA:8366'
chicago: 'Guseinov, Ruslan. “Computational Design of Curved Thin Shells: From Glass
Façades to Programmable Matter.” Institute of Science and Technology Austria,
2020. https://doi.org/10.15479/AT:ISTA:8366.'
ieee: 'R. Guseinov, “Computational design of curved thin shells: From glass façades
to programmable matter,” Institute of Science and Technology Austria, 2020.'
ista: 'Guseinov R. 2020. Computational design of curved thin shells: From glass
façades to programmable matter. Institute of Science and Technology Austria.'
mla: 'Guseinov, Ruslan. Computational Design of Curved Thin Shells: From Glass
Façades to Programmable Matter. Institute of Science and Technology Austria,
2020, doi:10.15479/AT:ISTA:8366.'
short: 'R. Guseinov, Computational Design of Curved Thin Shells: From Glass Façades
to Programmable Matter, Institute of Science and Technology Austria, 2020.'
corr_author: '1'
date_created: 2020-09-10T16:19:55Z
date_published: 2020-09-21T00:00:00Z
date_updated: 2026-04-08T07:25:22Z
day: '21'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: BeBi
doi: 10.15479/AT:ISTA:8366
ec_funded: 1
file:
- access_level: open_access
checksum: f8da89553da36037296b0a80f14ebf50
content_type: application/pdf
creator: rguseino
date_created: 2020-09-10T16:11:49Z
date_updated: 2020-09-10T16:11:49Z
file_id: '8367'
file_name: thesis_rguseinov.pdf
file_size: 70950442
relation: main_file
success: 1
- access_level: closed
checksum: e8fd944c960c20e0e27e6548af69121d
content_type: application/x-zip-compressed
creator: rguseino
date_created: 2020-09-11T09:39:48Z
date_updated: 2020-09-16T15:11:01Z
file_id: '8374'
file_name: thesis_source.zip
file_size: 76207597
relation: source_file
file_date_updated: 2020-09-16T15:11:01Z
has_accepted_license: '1'
keyword:
- computer-aided design
- shape modeling
- self-morphing
- mechanical engineering
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '118'
project:
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
publication_identifier:
isbn:
- 978-3-99078-010-7
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '8562'
relation: part_of_dissertation
status: public
- id: '8375'
relation: research_data
status: public
- id: '7151'
relation: research_data
status: deleted
- id: '1001'
relation: part_of_dissertation
status: public
- id: '7262'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
title: 'Computational design of curved thin shells: From glass façades to programmable
matter'
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2020'
...
---
_id: '8375'
abstract:
- lang: eng
text: 'Supplementary movies showing the following sequences for spatio-temporarily
programmed shells: input geometry and actuation time landscape; comparison of
morphing processes from a camera recording and a simulation; final actuated shape.'
article_processing_charge: No
author:
- first_name: Ruslan
full_name: Guseinov, Ruslan
id: 3AB45EE2-F248-11E8-B48F-1D18A9856A87
last_name: Guseinov
orcid: 0000-0001-9819-5077
citation:
ama: 'Guseinov R. Supplementary data for “Computational design of curved thin shells:
from glass façades to programmable matter.” 2020. doi:10.15479/AT:ISTA:8375'
apa: 'Guseinov, R. (2020). Supplementary data for “Computational design of curved
thin shells: from glass façades to programmable matter.” Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:8375'
chicago: 'Guseinov, Ruslan. “Supplementary Data for ‘Computational Design of Curved
Thin Shells: From Glass Façades to Programmable Matter.’” Institute of Science
and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8375.'
ieee: 'R. Guseinov, “Supplementary data for ‘Computational design of curved thin
shells: from glass façades to programmable matter.’” Institute of Science and
Technology Austria, 2020.'
ista: 'Guseinov R. 2020. Supplementary data for ‘Computational design of curved
thin shells: from glass façades to programmable matter’, Institute of Science
and Technology Austria, 10.15479/AT:ISTA:8375.'
mla: 'Guseinov, Ruslan. Supplementary Data for “Computational Design of Curved
Thin Shells: From Glass Façades to Programmable Matter.” Institute of Science
and Technology Austria, 2020, doi:10.15479/AT:ISTA:8375.'
short: R. Guseinov, (2020).
contributor:
- contributor_type: researcher
first_name: Ruslan
id: 3AB45EE2-F248-11E8-B48F-1D18A9856A87
last_name: Guseinov
orcid: 0000-0001-9819-5077
- contributor_type: researcher
first_name: Connor
last_name: McMahan
- contributor_type: researcher
first_name: Jesus
id: 2DC83906-F248-11E8-B48F-1D18A9856A87
last_name: Perez Rodriguez
- contributor_type: researcher
first_name: Chiara
last_name: Daraio
- contributor_type: researcher
first_name: Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
corr_author: '1'
date_created: 2020-09-11T09:52:54Z
date_published: 2020-09-21T00:00:00Z
date_updated: 2026-04-08T07:25:22Z
day: '21'
ddc:
- '000'
department:
- _id: BeBi
doi: 10.15479/AT:ISTA:8375
ec_funded: 1
file:
- access_level: open_access
checksum: 4029ffd65fb82ef2366b2fc2a4908e16
content_type: video/mp4
creator: rguseino
date_created: 2020-09-11T09:45:21Z
date_updated: 2020-09-11T09:45:21Z
file_id: '8376'
file_name: supplementary_movie_1.mp4
file_size: 29214988
relation: main_file
success: 1
- access_level: open_access
checksum: 8ed03b04d80f1a4e622cb22e6100afd8
content_type: video/mp4
creator: rguseino
date_created: 2020-09-11T09:45:25Z
date_updated: 2020-09-11T09:45:25Z
file_id: '8377'
file_name: supplementary_movie_2.mp4
file_size: 28449475
relation: main_file
success: 1
- access_level: open_access
checksum: ad6864afb5e694e5c52a88fba4e02eea
content_type: video/mp4
creator: rguseino
date_created: 2020-09-11T09:45:28Z
date_updated: 2020-09-11T09:45:28Z
file_id: '8378'
file_name: supplementary_movie_3.mp4
file_size: 26315853
relation: main_file
success: 1
- access_level: open_access
checksum: b079cef7871fe1afb69af0e2b099f3b1
content_type: video/mp4
creator: rguseino
date_created: 2020-09-11T09:45:33Z
date_updated: 2020-09-11T09:45:33Z
file_id: '8379'
file_name: supplementary_movie_4.mp4
file_size: 25198755
relation: main_file
success: 1
- access_level: open_access
checksum: 9d1d48a8ed5c109a999c51b044ee523d
content_type: video/mp4
creator: rguseino
date_created: 2020-09-11T09:45:36Z
date_updated: 2020-09-11T09:45:36Z
file_id: '8380'
file_name: supplementary_movie_5.mp4
file_size: 29011354
relation: main_file
success: 1
- access_level: open_access
checksum: d414d0059e982d752d218756b3c3ce05
content_type: text/plain
creator: rguseino
date_created: 2020-09-11T09:52:36Z
date_updated: 2020-09-11T09:52:36Z
file_id: '8381'
file_name: readme.txt
file_size: 586
relation: main_file
success: 1
file_date_updated: 2020-09-11T09:52:36Z
has_accepted_license: '1'
license: https://creativecommons.org/licenses/by/4.0/
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '8366'
relation: used_in_publication
status: public
status: public
title: 'Supplementary data for "Computational design of curved thin shells: from glass
façades to programmable matter"'
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: '2020'
...
---
_id: '8382'
abstract:
- lang: eng
text: We present the first deterministic wait-free long-lived snapshot algorithm,
using only read and write operations, that guarantees polylogarithmic amortized
step complexity in all executions. This is the first non-blocking snapshot algorithm,
using reads and writes only, that has sub-linear amortized step complexity in
executions of arbitrary length. The key to our construction is a novel implementation
of a 2-component max array object which may be of independent interest.
article_processing_charge: No
author:
- first_name: Mirza Ahad
full_name: Baig, Mirza Ahad
id: 3EDE6DE4-AA5A-11E9-986D-341CE6697425
last_name: Baig
- first_name: Danny
full_name: Hendler, Danny
last_name: Hendler
- first_name: Alessia
full_name: Milani, Alessia
last_name: Milani
- first_name: Corentin
full_name: Travers, Corentin
last_name: Travers
citation:
ama: 'Baig MA, Hendler D, Milani A, Travers C. Long-lived snapshots with polylogarithmic
amortized step complexity. In: Proceedings of the 39th Symposium on Principles
of Distributed Computing. Association for Computing Machinery; 2020:31-40.
doi:10.1145/3382734.3406005'
apa: 'Baig, M. A., Hendler, D., Milani, A., & Travers, C. (2020). Long-lived
snapshots with polylogarithmic amortized step complexity. In Proceedings of
the 39th Symposium on Principles of Distributed Computing (pp. 31–40). Virtual,
Italy: Association for Computing Machinery. https://doi.org/10.1145/3382734.3406005'
chicago: Baig, Mirza Ahad, Danny Hendler, Alessia Milani, and Corentin Travers.
“Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.” In Proceedings
of the 39th Symposium on Principles of Distributed Computing, 31–40. Association
for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3406005.
ieee: M. A. Baig, D. Hendler, A. Milani, and C. Travers, “Long-lived snapshots with
polylogarithmic amortized step complexity,” in Proceedings of the 39th Symposium
on Principles of Distributed Computing, Virtual, Italy, 2020, pp. 31–40.
ista: 'Baig MA, Hendler D, Milani A, Travers C. 2020. Long-lived snapshots with
polylogarithmic amortized step complexity. Proceedings of the 39th Symposium on
Principles of Distributed Computing. PODC: Principles of Distributed Computing,
31–40.'
mla: Baig, Mirza Ahad, et al. “Long-Lived Snapshots with Polylogarithmic Amortized
Step Complexity.” Proceedings of the 39th Symposium on Principles of Distributed
Computing, Association for Computing Machinery, 2020, pp. 31–40, doi:10.1145/3382734.3406005.
short: M.A. Baig, D. Hendler, A. Milani, C. Travers, in:, Proceedings of the 39th
Symposium on Principles of Distributed Computing, Association for Computing Machinery,
2020, pp. 31–40.
conference:
end_date: 2020-08-07
location: Virtual, Italy
name: 'PODC: Principles of Distributed Computing'
start_date: 2020-08-03
date_created: 2020-09-13T22:01:17Z
date_published: 2020-07-31T00:00:00Z
date_updated: 2025-09-10T10:25:23Z
day: '31'
doi: 10.1145/3382734.3406005
external_id:
isi:
- '001436693500004'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal.archives-ouvertes.fr/hal-02860087/document
month: '07'
oa: 1
oa_version: Preprint
page: 31-40
publication: Proceedings of the 39th Symposium on Principles of Distributed Computing
publication_identifier:
isbn:
- '9781450375825'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Long-lived snapshots with polylogarithmic amortized step complexity
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2020'
...
---
_id: '8383'
abstract:
- lang: eng
text: We introduce extension-based proofs, a class of impossibility proofs that
includes valency arguments. They are modelled as an interaction between a prover
and a protocol. Using proofs based on combinatorial topology, it has been shown
that it is impossible to deterministically solve k-set agreement among n > k ≥
2 processes in a wait-free manner. However, it was unknown whether proofs based
on simpler techniques were possible. We explain why this impossibility result
cannot be obtained by an extension-based proof and, hence, extension-based proofs
are limited in power.
article_processing_charge: No
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: James
full_name: Aspnes, James
last_name: Aspnes
- first_name: Faith
full_name: Ellen, Faith
last_name: Ellen
- first_name: Rati
full_name: Gelashvili, Rati
last_name: Gelashvili
- first_name: Leqi
full_name: Zhu, Leqi
last_name: Zhu
citation:
ama: 'Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. Brief Announcement:
Why Extension-Based Proofs Fail. In: Proceedings of the 39th Symposium on Principles
of Distributed Computing. Association for Computing Machinery; 2020:54-56.
doi:10.1145/3382734.3405743'
apa: 'Alistarh, D.-A., Aspnes, J., Ellen, F., Gelashvili, R., & Zhu, L. (2020).
Brief Announcement: Why Extension-Based Proofs Fail. In Proceedings of the
39th Symposium on Principles of Distributed Computing (pp. 54–56). Virtual,
Italy: Association for Computing Machinery. https://doi.org/10.1145/3382734.3405743'
chicago: 'Alistarh, Dan-Adrian, James Aspnes, Faith Ellen, Rati Gelashvili, and
Leqi Zhu. “Brief Announcement: Why Extension-Based Proofs Fail.” In Proceedings
of the 39th Symposium on Principles of Distributed Computing, 54–56. Association
for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3405743.'
ieee: 'D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, and L. Zhu, “Brief Announcement:
Why Extension-Based Proofs Fail,” in Proceedings of the 39th Symposium on Principles
of Distributed Computing, Virtual, Italy, 2020, pp. 54–56.'
ista: 'Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. 2020. Brief Announcement:
Why Extension-Based Proofs Fail. Proceedings of the 39th Symposium on Principles
of Distributed Computing. PODC: Principles of Distributed Computing, 54–56.'
mla: 'Alistarh, Dan-Adrian, et al. “Brief Announcement: Why Extension-Based Proofs
Fail.” Proceedings of the 39th Symposium on Principles of Distributed Computing,
Association for Computing Machinery, 2020, pp. 54–56, doi:10.1145/3382734.3405743.'
short: D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, L. Zhu, in:, Proceedings
of the 39th Symposium on Principles of Distributed Computing, Association for
Computing Machinery, 2020, pp. 54–56.
conference:
end_date: 2020-08-07
location: Virtual, Italy
name: 'PODC: Principles of Distributed Computing'
start_date: 2020-08-03
date_created: 2020-09-13T22:01:18Z
date_published: 2020-07-31T00:00:00Z
date_updated: 2025-09-10T10:26:32Z
day: '31'
department:
- _id: DaAl
doi: 10.1145/3382734.3405743
external_id:
isi:
- '001436693500007'
isi: 1
language:
- iso: eng
month: '07'
oa_version: None
page: 54-56
publication: Proceedings of the 39th Symposium on Principles of Distributed Computing
publication_identifier:
isbn:
- '9781450375825'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Brief Announcement: Why Extension-Based Proofs Fail'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2020'
...
---
_id: '8384'
abstract:
- lang: eng
text: Previous research on animations of soap bubbles, films, and foams largely
focuses on the motion and geometric shape of the bubble surface. These works neglect
the evolution of the bubble’s thickness, which is normally responsible for visual
phenomena like surface vortices, Newton’s interference patterns, capillary waves,
and deformation-dependent rupturing of films in a foam. In this paper, we model
these natural phenomena by introducing the film thickness as a reduced degree
of freedom in the Navier-Stokes equations and deriving their equations of motion.
We discretize the equations on a nonmanifold triangle mesh surface and couple
it to an existing bubble solver. In doing so, we also introduce an incompressible
fluid solver for 2.5D films and a novel advection algorithm for convecting fields
across non-manifold surface junctions. Our simulations enhance state-of-the-art
bubble solvers with additional effects caused by convection, rippling, draining,
and evaporation of the thin film.
acknowledged_ssus:
- _id: ScienComp
acknowledgement: "We wish to thank the anonymous reviewers and the members of the
Visual Computing Group at IST Austria for their valuable feedback, especially Camille
Schreck for her help in rendering. This research was supported by the Scientific
Service Units (SSU) of IST Austria through resources provided by Scientific Computing.
We would like to thank the authors of [Belcour and Barla 2017] for providing their
implementation, the authors of [Atkins and Elliott 2010] and [Seychelles et al.
2008] for allowing us to use their results, and Rok Grah for helpful discussions.
Finally, we thank Ryoichi Ando for many discussions from the beginning of the project
that resulted in important contents of the paper including our formulation, numerical
scheme, and initial implementation. This project has received funding from the\r\nEuropean
Research Council (ERC) under the European Union’s Horizon 2020 research and innovation
programme under grant agreement No. 638176."
article_number: '31'
article_processing_charge: No
article_type: original
author:
- first_name: Sadashige
full_name: Ishida, Sadashige
id: 6F7C4B96-A8E9-11E9-A7CA-09ECE5697425
last_name: Ishida
orcid: 0000-0002-3121-3100
- first_name: Peter
full_name: Synak, Peter
id: 331776E2-F248-11E8-B48F-1D18A9856A87
last_name: Synak
- first_name: Fumiya
full_name: Narita, Fumiya
last_name: Narita
- first_name: Toshiya
full_name: Hachisuka, Toshiya
last_name: Hachisuka
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: Ishida S, Synak P, Narita F, Hachisuka T, Wojtan C. A model for soap film dynamics
with evolving thickness. ACM Transactions on Graphics. 2020;39(4). doi:10.1145/3386569.3392405
apa: Ishida, S., Synak, P., Narita, F., Hachisuka, T., & Wojtan, C. (2020).
A model for soap film dynamics with evolving thickness. ACM Transactions on
Graphics. Association for Computing Machinery. https://doi.org/10.1145/3386569.3392405
chicago: Ishida, Sadashige, Peter Synak, Fumiya Narita, Toshiya Hachisuka, and Chris
Wojtan. “A Model for Soap Film Dynamics with Evolving Thickness.” ACM Transactions
on Graphics. Association for Computing Machinery, 2020. https://doi.org/10.1145/3386569.3392405.
ieee: S. Ishida, P. Synak, F. Narita, T. Hachisuka, and C. Wojtan, “A model for
soap film dynamics with evolving thickness,” ACM Transactions on Graphics,
vol. 39, no. 4. Association for Computing Machinery, 2020.
ista: Ishida S, Synak P, Narita F, Hachisuka T, Wojtan C. 2020. A model for soap
film dynamics with evolving thickness. ACM Transactions on Graphics. 39(4), 31.
mla: Ishida, Sadashige, et al. “A Model for Soap Film Dynamics with Evolving Thickness.”
ACM Transactions on Graphics, vol. 39, no. 4, 31, Association for Computing
Machinery, 2020, doi:10.1145/3386569.3392405.
short: S. Ishida, P. Synak, F. Narita, T. Hachisuka, C. Wojtan, ACM Transactions
on Graphics 39 (2020).
date_created: 2020-09-13T22:01:18Z
date_published: 2020-07-08T00:00:00Z
date_updated: 2026-04-16T08:29:36Z
day: '08'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/3386569.3392405
ec_funded: 1
external_id:
isi:
- '000583700300004'
file:
- access_level: open_access
checksum: 813831ca91319d794d9748c276b24578
content_type: application/pdf
creator: dernst
date_created: 2020-11-23T09:03:19Z
date_updated: 2020-11-23T09:03:19Z
file_id: '8795'
file_name: 2020_soapfilm_submitted.pdf
file_size: 14935529
relation: main_file
success: 1
file_date_updated: 2020-11-23T09:03:19Z
has_accepted_license: '1'
intvolume: ' 39'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1145/3386569.3392405
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: 'Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large
Scales'
publication: ACM Transactions on Graphics
publication_identifier:
eissn:
- 1557-7368
issn:
- 0730-0301
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '19630'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: A model for soap film dynamics with evolving thickness
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 39
year: '2020'
...
---
_id: '8385'
abstract:
- lang: eng
text: 'We present a method for animating yarn-level cloth effects using a thin-shell
solver. We accomplish this through numerical homogenization: we first use a large
number of yarn-level simulations to build a model of the potential energy density
of the cloth, and then use this energy density function to compute forces in a
thin shell simulator. We model several yarn-based materials, including both woven
and knitted fabrics. Our model faithfully reproduces expected effects like the
stiffness of woven fabrics, and the highly deformable nature and anisotropy of
knitted fabrics. Our approach does not require any real-world experiments nor
measurements; because the method is based entirely on simulations, it can generate
entirely new material models quickly, without the need for testing apparatuses
or human intervention. We provide data-driven models of several woven and knitted
fabrics, which can be used for efficient simulation with an off-the-shelf cloth
solver.'
acknowledged_ssus:
- _id: ScienComp
acknowledgement: "We wish to thank the anonymous reviewers and the members of the
Visual Computing Group at IST Austria for their valuable feedback. We also thank
the creators of the Berkeley Garment Library [de Joya et al. 2012] for providing
garment meshes, [Krishnamurthy and Levoy 1996] and [Turk and Levoy 1994] for the
armadillo and bunny meshes, the creators of libWetCloth [Fei et al. 2018] for their
implementation of discrete elastic rod forces, and Tomáš Skřivan for\r\ninspiring
discussions and help with Mathematica code generation. This research was supported
by the Scientific Service Units (SSU) of IST Austria through resources provided
by Scientific Computing. This project has received funding from the European Research
Council (ERC) under the European Union’s Horizon 2020 research and innovation programme
under grant agreement No. 638176. Rahul Narain is supported by a Pankaj Gupta Young
Faculty Fellowship and a gift from Adobe Inc."
article_number: '48'
article_processing_charge: No
article_type: original
author:
- first_name: Georg
full_name: Sperl, Georg
id: 4DD40360-F248-11E8-B48F-1D18A9856A87
last_name: Sperl
- first_name: Rahul
full_name: Narain, Rahul
last_name: Narain
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: Sperl G, Narain R, Wojtan C. Homogenized yarn-level cloth. ACM Transactions
on Graphics. 2020;39(4). doi:10.1145/3386569.3392412
apa: Sperl, G., Narain, R., & Wojtan, C. (2020). Homogenized yarn-level cloth.
ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3386569.3392412
chicago: Sperl, Georg, Rahul Narain, and Chris Wojtan. “Homogenized Yarn-Level Cloth.”
ACM Transactions on Graphics. Association for Computing Machinery, 2020.
https://doi.org/10.1145/3386569.3392412.
ieee: G. Sperl, R. Narain, and C. Wojtan, “Homogenized yarn-level cloth,” ACM
Transactions on Graphics, vol. 39, no. 4. Association for Computing Machinery,
2020.
ista: Sperl G, Narain R, Wojtan C. 2020. Homogenized yarn-level cloth. ACM Transactions
on Graphics. 39(4), 48.
mla: Sperl, Georg, et al. “Homogenized Yarn-Level Cloth.” ACM Transactions on
Graphics, vol. 39, no. 4, 48, Association for Computing Machinery, 2020, doi:10.1145/3386569.3392412.
short: G. Sperl, R. Narain, C. Wojtan, ACM Transactions on Graphics 39 (2020).
corr_author: '1'
date_created: 2020-09-13T22:01:18Z
date_published: 2020-07-08T00:00:00Z
date_updated: 2026-04-16T08:31:55Z
day: '08'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/3386569.3392412
ec_funded: 1
external_id:
isi:
- '000583700300021'
file:
- access_level: open_access
checksum: cf4c1d361c3196c4bd424520a5588205
content_type: application/pdf
creator: dernst
date_created: 2020-11-23T09:01:22Z
date_updated: 2020-11-23T09:01:22Z
file_id: '8794'
file_name: 2020_hylc_submitted.pdf
file_size: 38922662
relation: main_file
success: 1
file_date_updated: 2020-11-23T09:01:22Z
has_accepted_license: '1'
intvolume: ' 39'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1145/3386569.3392412
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: 'Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large
Scales'
publication: ACM Transactions on Graphics
publication_identifier:
eissn:
- 1557-7368
issn:
- 0730-0301
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '12358'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Homogenized yarn-level cloth
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 39
year: '2020'
...
---
OA_place: publisher
_id: '8386'
abstract:
- lang: eng
text: "Form versus function is a long-standing debate in various design-related
fields, such as architecture as well as graphic and industrial design. A good
design that balances form and function often requires considerable human effort
and collaboration among experts from different professional fields. Computational
design tools provide a new paradigm for designing functional objects. In computational
design, form and function are represented as mathematical\r\nquantities, with
the help of numerical and combinatorial algorithms, they can assist even novice
users in designing versatile models that exhibit their desired functionality.
This thesis presents three disparate research studies on the computational design
of functional objects: The appearance of 3d print—we optimize the volumetric material
distribution for faithfully replicating colored surface texture in 3d printing;
the dynamic motion of mechanical structures—\r\nour design system helps the novice
user to retarget various mechanical templates with different functionality to
complex 3d shapes; and a more abstract functionality, multistability—our algorithm
automatically generates models that exhibit multiple stable target poses. For
each of these cases, our computational design tools not only ensure the functionality
of the results but also permit the user aesthetic freedom over the form. Moreover,
fabrication constraints\r\nwere taken into account, which allow for the immediate
creation of physical realization via 3D printing or laser cutting."
acknowledged_ssus:
- _id: SSU
acknowledgement: The research in this thesis has received funding from the European
Union’s Horizon 2020 research and innovation programme, under the Marie Skłodowska-Curie
grant agreement No 642841 (DISTRO) and the European Research Council grant agreement
No 715767 (MATERIALIZABLE). All the research projects in this thesis were also supported
by Scientific Service Units (SSUs) at IST Austria.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Ran
full_name: Zhang, Ran
id: 4DDBCEB0-F248-11E8-B48F-1D18A9856A87
last_name: Zhang
orcid: 0000-0002-3808-281X
citation:
ama: Zhang R. Structure-aware computational design and its application to 3D printable
volume scattering, mechanism, and multistability. 2020. doi:10.15479/AT:ISTA:8386
apa: Zhang, R. (2020). Structure-aware computational design and its application
to 3D printable volume scattering, mechanism, and multistability. Institute
of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8386
chicago: Zhang, Ran. “Structure-Aware Computational Design and Its Application to
3D Printable Volume Scattering, Mechanism, and Multistability.” Institute of Science
and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8386.
ieee: R. Zhang, “Structure-aware computational design and its application to 3D
printable volume scattering, mechanism, and multistability,” Institute of Science
and Technology Austria, 2020.
ista: Zhang R. 2020. Structure-aware computational design and its application to
3D printable volume scattering, mechanism, and multistability. Institute of Science
and Technology Austria.
mla: Zhang, Ran. Structure-Aware Computational Design and Its Application to
3D Printable Volume Scattering, Mechanism, and Multistability. Institute of
Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8386.
short: R. Zhang, Structure-Aware Computational Design and Its Application to 3D
Printable Volume Scattering, Mechanism, and Multistability, Institute of Science
and Technology Austria, 2020.
corr_author: '1'
date_created: 2020-09-14T01:04:53Z
date_published: 2020-09-14T00:00:00Z
date_updated: 2026-04-16T10:06:31Z
day: '14'
ddc:
- '003'
degree_awarded: PhD
department:
- _id: BeBi
doi: 10.15479/AT:ISTA:8386
ec_funded: 1
file:
- access_level: closed
checksum: edcf578b6e1c9b0dd81ff72d319b66ba
content_type: application/x-zip-compressed
creator: rzhang
date_created: 2020-09-14T01:02:59Z
date_updated: 2020-09-14T12:18:43Z
file_id: '8388'
file_name: Thesis_Ran.zip
file_size: 1245800191
relation: source_file
- access_level: open_access
checksum: 817e20c33be9247f906925517c56a40d
content_type: application/pdf
creator: rzhang
date_created: 2020-09-15T12:51:53Z
date_updated: 2020-09-15T12:51:53Z
file_id: '8396'
file_name: PhD_thesis_Ran Zhang_20200915.pdf
file_size: 161385316
relation: main_file
success: 1
file_date_updated: 2020-09-15T12:51:53Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '148'
project:
- _id: 2508E324-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '642841'
name: Distributed 3D Object Design
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '486'
relation: part_of_dissertation
status: public
- id: '1002'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
title: Structure-aware computational design and its application to 3D printable volume
scattering, mechanism, and multistability
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2020'
...
---
OA_place: publisher
_id: '8390'
abstract:
- lang: eng
text: "Deep neural networks have established a new standard for data-dependent feature
extraction pipelines in the Computer Vision literature. Despite their remarkable
performance in the standard supervised learning scenario, i.e. when models are
trained with labeled data and tested on samples that follow a similar distribution,
neural networks have been shown to struggle with more advanced generalization
abilities, such as transferring knowledge across visually different domains, or
generalizing to new unseen combinations of known concepts. In this thesis we argue
that, in contrast to the usual black-box behavior of neural networks, leveraging
more structured internal representations is a promising direction\r\nfor tackling
such problems. In particular, we focus on two forms of structure. First, we tackle
modularity: We show that (i) compositional architectures are a natural tool for
modeling reasoning tasks, in that they efficiently capture their combinatorial
nature, which is key for generalizing beyond the compositions seen during training.
We investigate how to to learn such models, both formally and experimentally,
for the task of abstract visual reasoning. Then, we show that (ii) in some settings,
modularity allows us to efficiently break down complex tasks into smaller, easier,
modules, thereby improving computational efficiency; We study this behavior in
the context of generative models for colorization, as well as for small objects
detection. Secondly, we investigate the inherently layered structure of representations
learned by neural networks, and analyze its role in the context of transfer learning
and domain adaptation across visually\r\ndissimilar domains. "
acknowledged_ssus:
- _id: CampIT
- _id: ScienComp
acknowledgement: Last but not least, I would like to acknowledge the support of the
IST IT and scientific computing team for helping provide a great work environment.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Amélie
full_name: Royer, Amélie
id: 3811D890-F248-11E8-B48F-1D18A9856A87
last_name: Royer
orcid: 0000-0002-8407-0705
citation:
ama: Royer A. Leveraging structure in Computer Vision tasks for flexible Deep Learning
models. 2020. doi:10.15479/AT:ISTA:8390
apa: Royer, A. (2020). Leveraging structure in Computer Vision tasks for flexible
Deep Learning models. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8390
chicago: Royer, Amélie. “Leveraging Structure in Computer Vision Tasks for Flexible
Deep Learning Models.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8390.
ieee: A. Royer, “Leveraging structure in Computer Vision tasks for flexible Deep
Learning models,” Institute of Science and Technology Austria, 2020.
ista: Royer A. 2020. Leveraging structure in Computer Vision tasks for flexible
Deep Learning models. Institute of Science and Technology Austria.
mla: Royer, Amélie. Leveraging Structure in Computer Vision Tasks for Flexible
Deep Learning Models. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8390.
short: A. Royer, Leveraging Structure in Computer Vision Tasks for Flexible Deep
Learning Models, Institute of Science and Technology Austria, 2020.
corr_author: '1'
date_created: 2020-09-14T13:42:09Z
date_published: 2020-09-14T00:00:00Z
date_updated: 2026-04-08T07:26:44Z
day: '14'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: ChLa
doi: 10.15479/AT:ISTA:8390
file:
- access_level: open_access
checksum: c914d2f88846032f3d8507734861b6ee
content_type: application/pdf
creator: dernst
date_created: 2020-09-14T13:39:14Z
date_updated: 2020-09-14T13:39:14Z
file_id: '8391'
file_name: 2020_Thesis_Royer.pdf
file_size: 30224591
relation: main_file
success: 1
- access_level: closed
checksum: ae98fb35d912cff84a89035ae5794d3c
content_type: application/x-zip-compressed
creator: dernst
date_created: 2020-09-14T13:39:17Z
date_updated: 2020-09-14T13:39:17Z
file_id: '8392'
file_name: thesis_sources.zip
file_size: 74227627
relation: main_file
file_date_updated: 2020-09-14T13:39:17Z
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '09'
oa: 1
oa_version: Published Version
page: '197'
publication_identifier:
isbn:
- 978-3-99078-007-7
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '7936'
relation: part_of_dissertation
status: public
- id: '8092'
relation: part_of_dissertation
status: public
- id: '911'
relation: part_of_dissertation
status: public
- id: '8193'
relation: part_of_dissertation
status: public
- id: '7937'
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
title: Leveraging structure in Computer Vision tasks for flexible Deep Learning models
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2020'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '8402'
abstract:
- lang: eng
text: "Background: The mitochondrial pyruvate carrier (MPC) plays a central role
in energy metabolism by transporting pyruvate across the inner mitochondrial membrane.
Its heterodimeric composition and homology to SWEET and semiSWEET transporters
set the MPC apart from the canonical mitochondrial carrier family (named MCF or
SLC25). The import of the canonical carriers is mediated by the carrier translocase
of the inner membrane (TIM22) pathway and is dependent on their structure, which
features an even number of transmembrane segments and both termini in the intermembrane
space. The import pathway of MPC proteins has not been elucidated. The odd number
of transmembrane segments and positioning of the N-terminus in the matrix argues
against an import via the TIM22 carrier pathway but favors an import via the flexible
presequence pathway.\r\nResults: Here, we systematically analyzed the import pathways
of Mpc2 and Mpc3 and report that, contrary to an expected import via the flexible
presequence pathway, yeast MPC proteins with an odd number of transmembrane segments
and matrix-exposed N-terminus are imported by the carrier pathway, using the receptor
Tom70, small TIM chaperones, and the TIM22 complex. The TIM9·10 complex chaperones
MPC proteins through the mitochondrial intermembrane space using conserved hydrophobic
motifs that are also required for the interaction with canonical carrier proteins.\r\nConclusions:
The carrier pathway can import paired and non-paired transmembrane helices and
translocate N-termini to either side of the mitochondrial inner membrane, revealing
an unexpected versatility of the mitochondrial import pathway for non-cleavable
inner membrane proteins."
article_number: '2'
article_processing_charge: No
article_type: original
author:
- first_name: Heike
full_name: Rampelt, Heike
last_name: Rampelt
- first_name: Iva
full_name: Sucec, Iva
last_name: Sucec
- first_name: Beate
full_name: Bersch, Beate
last_name: Bersch
- first_name: Patrick
full_name: Horten, Patrick
last_name: Horten
- first_name: Inge
full_name: Perschil, Inge
last_name: Perschil
- first_name: Jean-Claude
full_name: Martinou, Jean-Claude
last_name: Martinou
- first_name: Martin
full_name: van der Laan, Martin
last_name: van der Laan
- first_name: Nils
full_name: Wiedemann, Nils
last_name: Wiedemann
- first_name: Paul
full_name: Schanda, Paul
id: 7B541462-FAF6-11E9-A490-E8DFE5697425
last_name: Schanda
orcid: 0000-0002-9350-7606
- first_name: Nikolaus
full_name: Pfanner, Nikolaus
last_name: Pfanner
citation:
ama: Rampelt H, Sucec I, Bersch B, et al. The mitochondrial carrier pathway transports
non-canonical substrates with an odd number of transmembrane segments. BMC
Biology. 2020;18. doi:10.1186/s12915-019-0733-6
apa: Rampelt, H., Sucec, I., Bersch, B., Horten, P., Perschil, I., Martinou, J.-C.,
… Pfanner, N. (2020). The mitochondrial carrier pathway transports non-canonical
substrates with an odd number of transmembrane segments. BMC Biology. Springer
Nature. https://doi.org/10.1186/s12915-019-0733-6
chicago: Rampelt, Heike, Iva Sucec, Beate Bersch, Patrick Horten, Inge Perschil,
Jean-Claude Martinou, Martin van der Laan, Nils Wiedemann, Paul Schanda, and Nikolaus
Pfanner. “The Mitochondrial Carrier Pathway Transports Non-Canonical Substrates
with an Odd Number of Transmembrane Segments.” BMC Biology. Springer Nature,
2020. https://doi.org/10.1186/s12915-019-0733-6.
ieee: H. Rampelt et al., “The mitochondrial carrier pathway transports non-canonical
substrates with an odd number of transmembrane segments,” BMC Biology,
vol. 18. Springer Nature, 2020.
ista: Rampelt H, Sucec I, Bersch B, Horten P, Perschil I, Martinou J-C, van der
Laan M, Wiedemann N, Schanda P, Pfanner N. 2020. The mitochondrial carrier pathway
transports non-canonical substrates with an odd number of transmembrane segments.
BMC Biology. 18, 2.
mla: Rampelt, Heike, et al. “The Mitochondrial Carrier Pathway Transports Non-Canonical
Substrates with an Odd Number of Transmembrane Segments.” BMC Biology,
vol. 18, 2, Springer Nature, 2020, doi:10.1186/s12915-019-0733-6.
short: H. Rampelt, I. Sucec, B. Bersch, P. Horten, I. Perschil, J.-C. Martinou,
M. van der Laan, N. Wiedemann, P. Schanda, N. Pfanner, BMC Biology 18 (2020).
date_created: 2020-09-17T10:26:53Z
date_published: 2020-01-06T00:00:00Z
date_updated: 2024-10-15T13:23:11Z
day: '06'
doi: 10.1186/s12915-019-0733-6
extern: '1'
external_id:
pmid:
- '31907035'
intvolume: ' 18'
keyword:
- Biotechnology
- Plant Science
- General Biochemistry
- Genetics and Molecular Biology
- Developmental Biology
- Cell Biology
- Physiology
- Ecology
- Evolution
- Behavior and Systematics
- Structural Biology
- General Agricultural and Biological Sciences
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1186/s12915-019-0733-6
month: '01'
oa: 1
oa_version: Published Version
pmid: 1
publication: BMC Biology
publication_identifier:
issn:
- 1741-7007
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: The mitochondrial carrier pathway transports non-canonical substrates with
an odd number of transmembrane segments
type: journal_article
user_id: 0043cee0-e5fc-11ee-9736-f83bc23afbf0
volume: 18
year: '2020'
...
---
_id: '8403'
abstract:
- lang: eng
text: Chaperones are essential for assisting protein folding, and for transferring
poorly soluble proteins to their functional locations within cells. Hydrophobic
interactions drive promiscuous chaperone–client binding, but our understanding
of how additional interactions enable client specificity is sparse. Here we decipher
what determines binding of two chaperones (TIM8·13, TIM9·10) to different integral
membrane proteins, the all-transmembrane mitochondrial carrier Ggc1, and Tim23
which has an additional disordered hydrophilic domain. Combining NMR, SAXS and
molecular dynamics simulations, we determine the structures of Tim23/TIM8·13 and
Tim23/TIM9·10 complexes. TIM8·13 uses transient salt bridges to interact with
the hydrophilic part of its client, but its interactions to the transmembrane
part are weaker than in TIM9·10. Consequently, TIM9·10 outcompetes TIM8·13 in
binding hydrophobic clients, while TIM8·13 is tuned to few clients with both hydrophilic
and hydrophobic parts. Our study exemplifies how chaperones fine-tune the balance
of promiscuity vs. specificity.
article_processing_charge: No
author:
- first_name: Iva
full_name: Sučec, Iva
last_name: Sučec
- first_name: Yong
full_name: Wang, Yong
last_name: Wang
- first_name: Ons
full_name: Dakhlaoui, Ons
last_name: Dakhlaoui
- first_name: Katharina
full_name: Weinhäupl, Katharina
last_name: Weinhäupl
- first_name: Tobias
full_name: Jores, Tobias
last_name: Jores
- first_name: Doriane
full_name: Costa, Doriane
last_name: Costa
- first_name: Audrey
full_name: Hessel, Audrey
last_name: Hessel
- first_name: Martha
full_name: Brennich, Martha
last_name: Brennich
- first_name: Doron
full_name: Rapaport, Doron
last_name: Rapaport
- first_name: Kresten
full_name: Lindorff-Larsen, Kresten
last_name: Lindorff-Larsen
- first_name: Beate
full_name: Bersch, Beate
last_name: Bersch
- first_name: Paul
full_name: Schanda, Paul
id: 7B541462-FAF6-11E9-A490-E8DFE5697425
last_name: Schanda
orcid: 0000-0002-9350-7606
citation:
ama: Sučec I, Wang Y, Dakhlaoui O, et al. Structural basis of client specificity
in mitochondrial membrane-protein chaperones. bioRxiv. doi:10.1101/2020.06.08.140772
apa: Sučec, I., Wang, Y., Dakhlaoui, O., Weinhäupl, K., Jores, T., Costa, D., …
Schanda, P. (n.d.). Structural basis of client specificity in mitochondrial membrane-protein
chaperones. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/2020.06.08.140772
chicago: Sučec, Iva, Yong Wang, Ons Dakhlaoui, Katharina Weinhäupl, Tobias Jores,
Doriane Costa, Audrey Hessel, et al. “Structural Basis of Client Specificity in
Mitochondrial Membrane-Protein Chaperones.” BioRxiv. Cold Spring Harbor
Laboratory, n.d. https://doi.org/10.1101/2020.06.08.140772.
ieee: I. Sučec et al., “Structural basis of client specificity in mitochondrial
membrane-protein chaperones,” bioRxiv. Cold Spring Harbor Laboratory.
ista: Sučec I, Wang Y, Dakhlaoui O, Weinhäupl K, Jores T, Costa D, Hessel A, Brennich
M, Rapaport D, Lindorff-Larsen K, Bersch B, Schanda P. Structural basis of client
specificity in mitochondrial membrane-protein chaperones. bioRxiv, 10.1101/2020.06.08.140772.
mla: Sučec, Iva, et al. “Structural Basis of Client Specificity in Mitochondrial
Membrane-Protein Chaperones.” BioRxiv, Cold Spring Harbor Laboratory, doi:10.1101/2020.06.08.140772.
short: I. Sučec, Y. Wang, O. Dakhlaoui, K. Weinhäupl, T. Jores, D. Costa, A. Hessel,
M. Brennich, D. Rapaport, K. Lindorff-Larsen, B. Bersch, P. Schanda, BioRxiv (n.d.).
date_created: 2020-09-17T10:27:47Z
date_published: 2020-09-17T00:00:00Z
date_updated: 2021-01-12T08:19:02Z
day: '17'
doi: 10.1101/2020.06.08.140772
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/2020.06.08.140772
month: '09'
oa: 1
oa_version: Preprint
publication: bioRxiv
publication_status: submitted
publisher: Cold Spring Harbor Laboratory
status: public
title: Structural basis of client specificity in mitochondrial membrane-protein chaperones
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '8404'
abstract:
- lang: eng
text: The mitochondrial Tim chaperones are responsible for the transport
of membrane proteins across the inter-membrane space to the inner and outer mitochondrial
membranes. TIM9·10, a hexameric 70 kDa protein complex formed by 3 copies of Tim9
and Tim10, guides its clients across the aqueous compartment. The TIM9·10·12 complex
is the anchor point at the inner-membrane insertase complex TIM22. The mechanism
of client transport by TIM9·10 has been resolved recently, but the structure and
subunit composition of the TIM9·10·12 complex remains largely unresolved. Furthermore,
the assembly process of the hexameric TIM chaperones from its subunits remained
elusive. We investigate the structural and dynamical properties of the Tim subunits,
and show that they are highly dynamic. In their non-assembled form, the subunits
behave as intrinsically disordered proteins; when the conserved cysteines of the
CX3C-Xn-CX3C
motifs are formed, short marginally stable α-helices
are formed, which are only fully stabilized upon hexamer formation to the mature
chaperone. Subunits are in equilibrium between their hexamer-embedded and a free
form, with exchange kinetics on a minutes time scale. Joint NMR, small-angle X-ray
scattering and MD simulation data allow us to derive a structural model of the
TIM9·10·12 assembly, which has a 2:3:1 stoichiometry (Tim9:Tim10:Tim12) with a
conserved hydrophobic client-binding groove and flexible N- and C-terminal tentacles.
article_processing_charge: No
author:
- first_name: Katharina
full_name: Weinhäupl, Katharina
last_name: Weinhäupl
- first_name: Yong
full_name: Wang, Yong
last_name: Wang
- first_name: Audrey
full_name: Hessel, Audrey
last_name: Hessel
- first_name: Martha
full_name: Brennich, Martha
last_name: Brennich
- first_name: Kresten
full_name: Lindorff-Larsen, Kresten
last_name: Lindorff-Larsen
- first_name: Paul
full_name: Schanda, Paul
id: 7B541462-FAF6-11E9-A490-E8DFE5697425
last_name: Schanda
orcid: 0000-0002-9350-7606
citation:
ama: Weinhäupl K, Wang Y, Hessel A, Brennich M, Lindorff-Larsen K, Schanda P. Architecture
and subunit dynamics of the mitochondrial TIM9·10·12 chaperone. bioRxiv.
doi:10.1101/2020.03.13.990150
apa: Weinhäupl, K., Wang, Y., Hessel, A., Brennich, M., Lindorff-Larsen, K., &
Schanda, P. (n.d.). Architecture and subunit dynamics of the mitochondrial TIM9·10·12
chaperone. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/2020.03.13.990150
chicago: Weinhäupl, Katharina, Yong Wang, Audrey Hessel, Martha Brennich, Kresten
Lindorff-Larsen, and Paul Schanda. “Architecture and Subunit Dynamics of the Mitochondrial
TIM9·10·12 Chaperone.” BioRxiv. Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/2020.03.13.990150.
ieee: K. Weinhäupl, Y. Wang, A. Hessel, M. Brennich, K. Lindorff-Larsen, and P.
Schanda, “Architecture and subunit dynamics of the mitochondrial TIM9·10·12 chaperone,”
bioRxiv. Cold Spring Harbor Laboratory.
ista: Weinhäupl K, Wang Y, Hessel A, Brennich M, Lindorff-Larsen K, Schanda P. Architecture
and subunit dynamics of the mitochondrial TIM9·10·12 chaperone. bioRxiv, 10.1101/2020.03.13.990150.
mla: Weinhäupl, Katharina, et al. “Architecture and Subunit Dynamics of the Mitochondrial
TIM9·10·12 Chaperone.” BioRxiv, Cold Spring Harbor Laboratory, doi:10.1101/2020.03.13.990150.
short: K. Weinhäupl, Y. Wang, A. Hessel, M. Brennich, K. Lindorff-Larsen, P. Schanda,
BioRxiv (n.d.).
date_created: 2020-09-17T10:27:59Z
date_published: 2020-03-14T00:00:00Z
date_updated: 2021-01-12T08:19:03Z
day: '14'
doi: 10.1101/2020.03.13.990150
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/2020.03.13.990150
month: '03'
oa: 1
oa_version: Preprint
publication: bioRxiv
publication_status: submitted
publisher: Cold Spring Harbor Laboratory
status: public
title: Architecture and subunit dynamics of the mitochondrial TIM9·10·12 chaperone
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '8414'
abstract:
- lang: eng
text: "Arnold diffusion, which concerns the appearance of chaos in classical mechanics,
is one of the most important problems in the fields of dynamical systems and mathematical
physics. Since it was discovered by Vladimir Arnold in 1963, it has attracted
the efforts of some of the most prominent researchers in mathematics. The question
is whether a typical perturbation of a particular system will result in chaotic
or unstable dynamical phenomena. In this groundbreaking book, Vadim Kaloshin and
Ke Zhang provide the first complete proof of Arnold diffusion, demonstrating that
that there is topological instability for typical perturbations of five-dimensional
integrable systems (two and a half degrees of freedom).\r\nThis proof realizes
a plan John Mather announced in 2003 but was unable to complete before his death.
Kaloshin and Zhang follow Mather’s strategy but emphasize a more Hamiltonian approach,
tying together normal forms theory, hyperbolic theory, Mather theory, and weak
KAM theory. Offering a complete, clean, and modern explanation of the steps involved
in the proof, and a clear account of background material, this book is designed
to be accessible to students as well as researchers. The result is a critical
contribution to mathematical physics and dynamical systems, especially Hamiltonian
systems."
alternative_title:
- Annals of Mathematics Studies
article_processing_charge: No
author:
- first_name: Vadim
full_name: Kaloshin, Vadim
id: FE553552-CDE8-11E9-B324-C0EBE5697425
last_name: Kaloshin
orcid: 0000-0002-6051-2628
- first_name: Ke
full_name: Zhang, Ke
last_name: Zhang
citation:
ama: Kaloshin V, Zhang K. Arnold Diffusion for Smooth Systems of Two and a Half
Degrees of Freedom. Vol 208. 1st ed. Princeton University Press; 2020. doi:10.1515/9780691204932
apa: Kaloshin, V., & Zhang, K. (2020). Arnold Diffusion for Smooth Systems
of Two and a Half Degrees of Freedom (1st ed., Vol. 208). Princeton University
Press. https://doi.org/10.1515/9780691204932
chicago: Kaloshin, Vadim, and Ke Zhang. Arnold Diffusion for Smooth Systems of
Two and a Half Degrees of Freedom. 1st ed. Vol. 208. AMS. Princeton University
Press, 2020. https://doi.org/10.1515/9780691204932.
ieee: V. Kaloshin and K. Zhang, Arnold Diffusion for Smooth Systems of Two and
a Half Degrees of Freedom, 1st ed., vol. 208. Princeton University Press,
2020.
ista: Kaloshin V, Zhang K. 2020. Arnold Diffusion for Smooth Systems of Two and
a Half Degrees of Freedom 1st ed., Princeton University Press, 224p.
mla: Kaloshin, Vadim, and Ke Zhang. Arnold Diffusion for Smooth Systems of Two
and a Half Degrees of Freedom. 1st ed., vol. 208, Princeton University Press,
2020, doi:10.1515/9780691204932.
short: V. Kaloshin, K. Zhang, Arnold Diffusion for Smooth Systems of Two and a Half
Degrees of Freedom, 1st ed., Princeton University Press, 2020.
date_created: 2020-09-17T10:41:05Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2021-12-21T10:50:49Z
day: '01'
doi: 10.1515/9780691204932
edition: '1'
extern: '1'
intvolume: ' 208'
language:
- iso: eng
month: '03'
oa_version: None
page: '224'
publication_identifier:
isbn:
- 9-780-6912-0253-2
publication_status: published
publisher: Princeton University Press
quality_controlled: '1'
scopus_import: '1'
series_title: AMS
status: public
title: Arnold Diffusion for Smooth Systems of Two and a Half Degrees of Freedom
type: book
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 208
year: '2020'
...
---
_id: '8533'
abstract:
- lang: eng
text: Game of Life is a simple and elegant model to study dynamical system over
networks. The model consists of a graph where every vertex has one of two types,
namely, dead or alive. A configuration is a mapping of the vertices to the types.
An update rule describes how the type of a vertex is updated given the types of
its neighbors. In every round, all vertices are updated synchronously, which leads
to a configuration update. While in general, Game of Life allows a broad range
of update rules, we focus on two simple families of update rules, namely, underpopulation
and overpopulation, that model several interesting dynamics studied in the literature.
In both settings, a dead vertex requires at least a desired number of live neighbors
to become alive. For underpopulation (resp., overpopulation), a live vertex requires
at least (resp. at most) a desired number of live neighbors to remain alive. We
study the basic computation problems, e.g., configuration reachability, for these
two families of rules. For underpopulation rules, we show that these problems
can be solved in polynomial time, whereas for overpopulation rules they are PSPACE-complete.
acknowledgement: "Krishnendu Chatterjee: The research was partially supported by the
Vienna Science and\r\nTechnology Fund (WWTF) Project ICT15-003.\r\nIsmaël Jecker:
This project has received funding from the European Union’s Horizon 2020 research\r\nand
innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411."
alternative_title:
- LIPIcs
article_number: 22:1-22:13
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Ismael R
full_name: Jecker, Ismael R
id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425
last_name: Jecker
- first_name: Jakub
full_name: Svoboda, Jakub
id: 130759D2-D7DD-11E9-87D2-DE0DE6697425
last_name: Svoboda
orcid: 0000-0002-1419-3267
citation:
ama: 'Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. Simplified game of life:
Algorithms and complexity. In: 45th International Symposium on Mathematical
Foundations of Computer Science. Vol 170. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2020. doi:10.4230/LIPIcs.MFCS.2020.22'
apa: 'Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., & Svoboda, J. (2020).
Simplified game of life: Algorithms and complexity. In 45th International Symposium
on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech
Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2020.22'
chicago: 'Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub
Svoboda. “Simplified Game of Life: Algorithms and Complexity.” In 45th International
Symposium on Mathematical Foundations of Computer Science, Vol. 170. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.MFCS.2020.22.'
ieee: 'K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Simplified
game of life: Algorithms and complexity,” in 45th International Symposium on
Mathematical Foundations of Computer Science, Prague, Czech Republic, 2020,
vol. 170.'
ista: 'Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2020. Simplified game
of life: Algorithms and complexity. 45th International Symposium on Mathematical
Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science,
LIPIcs, vol. 170, 22:1-22:13.'
mla: 'Chatterjee, Krishnendu, et al. “Simplified Game of Life: Algorithms and Complexity.”
45th International Symposium on Mathematical Foundations of Computer Science,
vol. 170, 22:1-22:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020,
doi:10.4230/LIPIcs.MFCS.2020.22.'
short: K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 45th International
Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl -
Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-08-28
location: Prague, Czech Republic
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2020-08-24
date_created: 2020-09-20T22:01:36Z
date_published: 2020-08-18T00:00:00Z
date_updated: 2025-07-10T11:57:06Z
day: '18'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.MFCS.2020.22
ec_funded: 1
external_id:
arxiv:
- '2007.02894'
file:
- access_level: open_access
checksum: bbd7c4f55d45f2ff2a0a4ef0e10a77b1
content_type: application/pdf
creator: dernst
date_created: 2020-09-21T13:57:34Z
date_updated: 2020-09-21T13:57:34Z
file_id: '8550'
file_name: 2020_LIPIcs_Chatterjee.pdf
file_size: 491374
relation: main_file
success: 1
file_date_updated: 2020-09-21T13:57:34Z
has_accepted_license: '1'
intvolume: ' 170'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 45th International Symposium on Mathematical Foundations of Computer
Science
publication_identifier:
isbn:
- '9783959771597'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Simplified game of life: Algorithms and complexity'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 170
year: '2020'
...
---
_id: '8534'
abstract:
- lang: eng
text: A regular language L of finite words is composite if there are regular languages
L₁,L₂,…,L_t such that L = ⋂_{i = 1}^t L_i and the index (number of states in a
minimal DFA) of every language L_i is strictly smaller than the index of L. Otherwise,
L is prime. Primality of regular languages was introduced and studied in [O. Kupferman
and J. Mosheiff, 2015], where the complexity of deciding the primality of the
language of a given DFA was left open, with a doubly-exponential gap between the
upper and lower bounds. We study primality for unary regular languages, namely
regular languages with a singleton alphabet. A unary language corresponds to a
subset of ℕ, making the study of unary prime languages closer to that of primality
in number theory. We show that the setting of languages is richer. In particular,
while every composite number is the product of two smaller numbers, the number
t of languages necessary to decompose a composite unary language induces a strict
hierarchy. In addition, a primality witness for a unary language L, namely a word
that is not in L but is in all products of languages that contain L and have an
index smaller than L’s, may be of exponential length. Still, we are able to characterize
compositionality by structural properties of a DFA for L, leading to a LogSpace
algorithm for primality checking of unary DFAs.
acknowledgement: "Ismaël Jecker: This project has received funding from the European
Union’s Horizon\r\n2020 research and innovation programme under the Marie Skłodowska-Curie
Grant Agreement No.\r\n754411. Nicolas Mazzocchi: PhD fellowship FRIA from the F.R.S.-FNRS."
alternative_title:
- LIPIcs
article_number: 51:1-51:12
article_processing_charge: No
author:
- first_name: Ismael R
full_name: Jecker, Ismael R
id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425
last_name: Jecker
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
- first_name: Nicolas
full_name: Mazzocchi, Nicolas
last_name: Mazzocchi
citation:
ama: 'Jecker IR, Kupferman O, Mazzocchi N. Unary prime languages. In: 45th International
Symposium on Mathematical Foundations of Computer Science. Vol 170. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.MFCS.2020.51'
apa: 'Jecker, I. R., Kupferman, O., & Mazzocchi, N. (2020). Unary prime languages.
In 45th International Symposium on Mathematical Foundations of Computer Science
(Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.MFCS.2020.51'
chicago: Jecker, Ismael R, Orna Kupferman, and Nicolas Mazzocchi. “Unary Prime Languages.”
In 45th International Symposium on Mathematical Foundations of Computer Science,
Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.MFCS.2020.51.
ieee: I. R. Jecker, O. Kupferman, and N. Mazzocchi, “Unary prime languages,” in
45th International Symposium on Mathematical Foundations of Computer Science,
Prague, Czech Republic, 2020, vol. 170.
ista: 'Jecker IR, Kupferman O, Mazzocchi N. 2020. Unary prime languages. 45th International
Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical
Foundations of Computer Science, LIPIcs, vol. 170, 51:1-51:12.'
mla: Jecker, Ismael R., et al. “Unary Prime Languages.” 45th International Symposium
on Mathematical Foundations of Computer Science, vol. 170, 51:1-51:12, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.51.
short: I.R. Jecker, O. Kupferman, N. Mazzocchi, in:, 45th International Symposium
on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2020.
conference:
end_date: 2020-08-28
location: Prague, Czech Republic
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2020-08-24
corr_author: '1'
date_created: 2020-09-20T22:01:36Z
date_published: 2020-08-18T00:00:00Z
date_updated: 2025-07-10T11:57:07Z
day: '18'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.MFCS.2020.51
ec_funded: 1
file:
- access_level: open_access
checksum: 2dc9e2fad6becd4563aef3e27a473f70
content_type: application/pdf
creator: dernst
date_created: 2020-09-21T14:17:08Z
date_updated: 2020-09-21T14:17:08Z
file_id: '8552'
file_name: 2020_LIPIcsMFCS_Jecker.pdf
file_size: 597977
relation: main_file
success: 1
file_date_updated: 2020-09-21T14:17:08Z
has_accepted_license: '1'
intvolume: ' 170'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 45th International Symposium on Mathematical Foundations of Computer
Science
publication_identifier:
isbn:
- '9783959771597'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Unary prime languages
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 170
year: '2020'
...
---
_id: '8535'
abstract:
- lang: eng
text: We propose a method to enhance the visual detail of a water surface simulation.
Our method works as a post-processing step which takes a simulation as input and
increases its apparent resolution by simulating many detailed Lagrangian water
waves on top of it. We extend linear water wave theory to work in non-planar domains
which deform over time, and we discretize the theory using Lagrangian wave packets
attached to spline curves. The method is numerically stable and trivially parallelizable,
and it produces high frequency ripples with dispersive wave-like behaviors customized
to the underlying fluid simulation.
acknowledged_ssus:
- _id: ScienComp
acknowledgement: We wish to thank the anonymous reviewers and the members of the Visual
Computing Group at IST Austria for their valuable feedback. This research was supported
by the Scientific Service Units (SSU) of IST Austria through resources provided
by Scientific Computing. This project has received funding from the European Research
Council (ERC) under the European Union’s Horizon 2020 research and innovation programme
under grant agreement No. 638176 and Marie SkłodowskaCurie Grant Agreement No. 665385.
article_number: '65'
article_processing_charge: No
article_type: original
author:
- first_name: Tomas
full_name: Skrivan, Tomas
id: 486A5A46-F248-11E8-B48F-1D18A9856A87
last_name: Skrivan
- first_name: Andreas
full_name: Soderstrom, Andreas
last_name: Soderstrom
- first_name: John
full_name: Johansson, John
last_name: Johansson
- first_name: Christoph
full_name: Sprenger, Christoph
last_name: Sprenger
- first_name: Ken
full_name: Museth, Ken
last_name: Museth
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: 'Skrivan T, Soderstrom A, Johansson J, Sprenger C, Museth K, Wojtan C. Wave
curves: Simulating Lagrangian water waves on dynamically deforming surfaces. ACM
Transactions on Graphics. 2020;39(4). doi:10.1145/3386569.3392466'
apa: 'Skrivan, T., Soderstrom, A., Johansson, J., Sprenger, C., Museth, K., &
Wojtan, C. (2020). Wave curves: Simulating Lagrangian water waves on dynamically
deforming surfaces. ACM Transactions on Graphics. Association for Computing
Machinery. https://doi.org/10.1145/3386569.3392466'
chicago: 'Skrivan, Tomas, Andreas Soderstrom, John Johansson, Christoph Sprenger,
Ken Museth, and Chris Wojtan. “Wave Curves: Simulating Lagrangian Water Waves
on Dynamically Deforming Surfaces.” ACM Transactions on Graphics. Association
for Computing Machinery, 2020. https://doi.org/10.1145/3386569.3392466.'
ieee: 'T. Skrivan, A. Soderstrom, J. Johansson, C. Sprenger, K. Museth, and C. Wojtan,
“Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces,”
ACM Transactions on Graphics, vol. 39, no. 4. Association for Computing
Machinery, 2020.'
ista: 'Skrivan T, Soderstrom A, Johansson J, Sprenger C, Museth K, Wojtan C. 2020.
Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces.
ACM Transactions on Graphics. 39(4), 65.'
mla: 'Skrivan, Tomas, et al. “Wave Curves: Simulating Lagrangian Water Waves on
Dynamically Deforming Surfaces.” ACM Transactions on Graphics, vol. 39,
no. 4, 65, Association for Computing Machinery, 2020, doi:10.1145/3386569.3392466.'
short: T. Skrivan, A. Soderstrom, J. Johansson, C. Sprenger, K. Museth, C. Wojtan,
ACM Transactions on Graphics 39 (2020).
corr_author: '1'
date_created: 2020-09-20T22:01:37Z
date_published: 2020-07-08T00:00:00Z
date_updated: 2026-04-16T08:26:38Z
day: '08'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/3386569.3392466
ec_funded: 1
external_id:
isi:
- '000583700300038'
file:
- access_level: open_access
checksum: c3a680893f01cc4a9e961ff0a4cfa12f
content_type: application/pdf
creator: dernst
date_created: 2020-09-21T07:51:44Z
date_updated: 2020-09-21T07:51:44Z
file_id: '8541'
file_name: 2020_ACM_Skrivan.pdf
file_size: 20223953
relation: main_file
success: 1
file_date_updated: 2020-09-21T07:51:44Z
has_accepted_license: '1'
intvolume: ' 39'
isi: 1
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: 'Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large
Scales'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: ACM Transactions on Graphics
publication_identifier:
eissn:
- 1557-7368
issn:
- 0730-0301
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces'
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 39
year: '2020'
...
---
_id: '8536'
abstract:
- lang: eng
text: This work analyzes the latency of the simplified successive cancellation (SSC)
decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It
is shown that, unlike conventional successive cancellation decoding, where latency
is linear in the block length, the latency of SSC decoding is sublinear. More
specifically, the latency of SSC decoding is O(N 1−1/µ ), where N is the block
length and µ is the scaling exponent of the channel, which captures the speed
of convergence of the rate to capacity. Numerical results demonstrate the tightness
of the bound and show that most of the latency reduction arises from the parallel
decoding of subcodes of rate 0 and 1.
acknowledgement: M. Mondelli was partially supported by grants NSF DMS-1613091, CCF-1714305,
IIS-1741162 and ONR N00014-18-1-2729. S. A. Hashemi is supported by a Postdoctoral
Fellowship from the Natural Sciences and Engineering Research Council of Canada
(NSERC) and by Huawei.
article_number: 401-406
article_processing_charge: No
arxiv: 1
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Seyyed Ali
full_name: Hashemi, Seyyed Ali
last_name: Hashemi
- first_name: John
full_name: Cioffi, John
last_name: Cioffi
- first_name: Andrea
full_name: Goldsmith, Andrea
last_name: Goldsmith
citation:
ama: 'Mondelli M, Hashemi SA, Cioffi J, Goldsmith A. Simplified successive cancellation
decoding of polar codes has sublinear latency. In: IEEE International Symposium
on Information Theory - Proceedings. Vol 2020-June. IEEE; 2020. doi:10.1109/ISIT44484.2020.9174141'
apa: 'Mondelli, M., Hashemi, S. A., Cioffi, J., & Goldsmith, A. (2020). Simplified
successive cancellation decoding of polar codes has sublinear latency. In IEEE
International Symposium on Information Theory - Proceedings (Vol. 2020–June).
Los Angeles, CA, United States: IEEE. https://doi.org/10.1109/ISIT44484.2020.9174141'
chicago: Mondelli, Marco, Seyyed Ali Hashemi, John Cioffi, and Andrea Goldsmith.
“Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency.”
In IEEE International Symposium on Information Theory - Proceedings, Vol.
2020–June. IEEE, 2020. https://doi.org/10.1109/ISIT44484.2020.9174141.
ieee: M. Mondelli, S. A. Hashemi, J. Cioffi, and A. Goldsmith, “Simplified successive
cancellation decoding of polar codes has sublinear latency,” in IEEE International
Symposium on Information Theory - Proceedings, Los Angeles, CA, United States,
2020, vol. 2020–June.
ista: 'Mondelli M, Hashemi SA, Cioffi J, Goldsmith A. 2020. Simplified successive
cancellation decoding of polar codes has sublinear latency. IEEE International
Symposium on Information Theory - Proceedings. ISIT: International Symposium on
Information Theory vol. 2020–June, 401–406.'
mla: Mondelli, Marco, et al. “Simplified Successive Cancellation Decoding of Polar
Codes Has Sublinear Latency.” IEEE International Symposium on Information Theory
- Proceedings, vol. 2020–June, 401–406, IEEE, 2020, doi:10.1109/ISIT44484.2020.9174141.
short: M. Mondelli, S.A. Hashemi, J. Cioffi, A. Goldsmith, in:, IEEE International
Symposium on Information Theory - Proceedings, IEEE, 2020.
conference:
end_date: 2020-06-26
location: Los Angeles, CA, United States
name: 'ISIT: International Symposium on Information Theory'
start_date: 2020-06-21
date_created: 2020-09-20T22:01:37Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2025-09-10T10:27:05Z
day: '01'
department:
- _id: MaMo
doi: 10.1109/ISIT44484.2020.9174141
external_id:
arxiv:
- '1909.04892'
isi:
- '000714963400069'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1909.04892
month: '06'
oa: 1
oa_version: Preprint
publication: IEEE International Symposium on Information Theory - Proceedings
publication_identifier:
isbn:
- '9781728164328'
issn:
- 2157-8095
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '9047'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Simplified successive cancellation decoding of polar codes has sublinear latency
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 2020-June
year: '2020'
...
---
_id: '8539'
abstract:
- lang: eng
text: Cohomological and K-theoretic stable bases originated from the study of quantum
cohomology and quantum K-theory. Restriction formula for cohomological stable
bases played an important role in computing the quantum connection of cotangent
bundle of partial flag varieties. In this paper we study the K-theoretic stable
bases of cotangent bundles of flag varieties. We describe these bases in terms
of the action of the affine Hecke algebra and the twisted group algebra of KostantKumar.
Using this algebraic description and the method of root polynomials, we give a
restriction formula of the stable bases. We apply it to obtain the restriction
formula for partial flag varieties. We also build a relation between the stable
basis and the Casselman basis in the principal series representations of the Langlands
dual group. As an application, we give a closed formula for the transition matrix
between Casselman basis and the characteristic functions.
- lang: fre
text: "Les bases stables cohomologiques et K-théoriques proviennent de l’étude de
la cohomologie quantique et de la K-théorie quantique. La formule de restriction
pour les bases stables cohomologiques a joué un rôle important dans le calcul
de la connexion quantique du fibré cotangent de variétés de drapeaux partielles.
Dans cet article, nous étudions les bases stables K-théoriques de fibré cotangents
des variétés de drapeaux. Nous décrivons ces bases en fonction de l’action de
l’algèbre de Hecke affine et de l’algèbre de Kostant-Kumar. En utilisant cette
description algébrique et la méthode des polynômes de racine, nous donnons une
formule de restriction des bases stables. Nous l’appliquons\r\npour obtenir la
formule de restriction pour les variétés de drapeaux partielles. Nous construisons
également une relation entre la base stable et la base de Casselman dans les représentations
de la série principale du groupe dual de Langlands p-adique. Comme une application,
nous donnons une formule close pour la matrice de transition entre la base de
Casselman et les fonctions caractéristiques. "
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: C.
full_name: Su, C.
last_name: Su
- first_name: Gufang
full_name: Zhao, Gufang
id: 2BC2AC5E-F248-11E8-B48F-1D18A9856A87
last_name: Zhao
- first_name: C.
full_name: Zhong, C.
last_name: Zhong
citation:
ama: Su C, Zhao G, Zhong C. On the K-theory stable bases of the springer resolution.
Annales Scientifiques de l’Ecole Normale Superieure. 2020;53(3):663-671.
doi:10.24033/asens.2431
apa: Su, C., Zhao, G., & Zhong, C. (2020). On the K-theory stable bases of the
springer resolution. Annales Scientifiques de l’Ecole Normale Superieure.
Société Mathématique de France. https://doi.org/10.24033/asens.2431
chicago: Su, C., Gufang Zhao, and C. Zhong. “On the K-Theory Stable Bases of the
Springer Resolution.” Annales Scientifiques de l’Ecole Normale Superieure.
Société Mathématique de France, 2020. https://doi.org/10.24033/asens.2431.
ieee: C. Su, G. Zhao, and C. Zhong, “On the K-theory stable bases of the springer
resolution,” Annales Scientifiques de l’Ecole Normale Superieure, vol.
53, no. 3. Société Mathématique de France, pp. 663–671, 2020.
ista: Su C, Zhao G, Zhong C. 2020. On the K-theory stable bases of the springer
resolution. Annales Scientifiques de l’Ecole Normale Superieure. 53(3), 663–671.
mla: Su, C., et al. “On the K-Theory Stable Bases of the Springer Resolution.” Annales
Scientifiques de l’Ecole Normale Superieure, vol. 53, no. 3, Société Mathématique
de France, 2020, pp. 663–71, doi:10.24033/asens.2431.
short: C. Su, G. Zhao, C. Zhong, Annales Scientifiques de l’Ecole Normale Superieure
53 (2020) 663–671.
date_created: 2020-09-20T22:01:38Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2023-08-22T09:27:57Z
day: '01'
department:
- _id: TaHa
doi: 10.24033/asens.2431
external_id:
arxiv:
- '1708.08013'
isi:
- '000592182600004'
intvolume: ' 53'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1708.08013
month: '06'
oa: 1
oa_version: Preprint
page: 663-671
publication: Annales Scientifiques de l'Ecole Normale Superieure
publication_identifier:
issn:
- 0012-9593
publication_status: published
publisher: Société Mathématique de France
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the K-theory stable bases of the springer resolution
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 53
year: '2020'
...
---
_id: '8562'
abstract:
- lang: eng
text: "Cold bent glass is a promising and cost-efficient method for realizing doubly
curved glass facades. They are produced by attaching planar glass sheets to curved
frames and require keeping the occurring stress within safe limits.\r\nHowever,
it is very challenging to navigate the design space of cold bent glass panels
due to the fragility of the material, which impedes the form-finding for practically
feasible and aesthetically pleasing cold bent glass facades. We propose an interactive,
data-driven approach for designing cold bent glass facades that can be seamlessly
integrated into a typical architectural design pipeline. Our method allows non-expert
users to interactively edit a parametric surface while providing real-time feedback
on the deformed shape and maximum stress of cold bent glass panels. Designs are
automatically refined to minimize several fairness criteria while maximal stresses
are kept within glass limits. We achieve interactive frame rates by using a differentiable
Mixture Density Network trained from more than a million simulations. Given a
curved boundary, our regression model is capable of handling multistable\r\nconfigurations
and accurately predicting the equilibrium shape of the panel and its corresponding
maximal stress. We show predictions are highly accurate and validate our results
with a physical realization of a cold bent glass surface."
acknowledged_ssus:
- _id: ScienComp
acknowledgement: "We thank IST Austria’s Scientific Computing team for their support,
Corinna Datsiou and Sophie Pennetier for their expert input on the practical applications
of cold bent glass, and Zaha Hadid Architects and Waagner Biro for providing the
architectural datasets. Photo of Fondation Louis Vuitton by Francisco Anzola / CC
BY 2.0 / cropped.\r\nPhoto of Opus by Danica O. Kus. This project has received funding
from the European Union’s\r\nHorizon 2020 research and innovation program under
grant agreement No 675789 - Algebraic Representations in Computer-Aided Design for
complEx Shapes (ARCADES), from the European Research Council (ERC) under grant agreement
No 715767 - MATERIALIZABLE: Intelligent fabrication-oriented Computational Design
and Modeling, and SFB-Transregio “Discretization in Geometry and Dynamics” through
grant I 2978 of the Austrian Science Fund (FWF). F. Rist and K. Gavriil have been
partially supported by KAUST baseline funding."
article_number: '208'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Konstantinos
full_name: Gavriil, Konstantinos
last_name: Gavriil
- first_name: Ruslan
full_name: Guseinov, Ruslan
id: 3AB45EE2-F248-11E8-B48F-1D18A9856A87
last_name: Guseinov
orcid: 0000-0001-9819-5077
- first_name: Jesus
full_name: Perez Rodriguez, Jesus
id: 2DC83906-F248-11E8-B48F-1D18A9856A87
last_name: Perez Rodriguez
- first_name: Davide
full_name: Pellis, Davide
last_name: Pellis
- first_name: Paul M
full_name: Henderson, Paul M
id: 13C09E74-18D9-11E9-8878-32CFE5697425
last_name: Henderson
orcid: 0000-0002-5198-7445
- first_name: Florian
full_name: Rist, Florian
last_name: Rist
- first_name: Helmut
full_name: Pottmann, Helmut
last_name: Pottmann
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
citation:
ama: Gavriil K, Guseinov R, Perez Rodriguez J, et al. Computational design of cold
bent glass façades. ACM Transactions on Graphics. 2020;39(6). doi:10.1145/3414685.3417843
apa: Gavriil, K., Guseinov, R., Perez Rodriguez, J., Pellis, D., Henderson, P. M.,
Rist, F., … Bickel, B. (2020). Computational design of cold bent glass façades.
ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3414685.3417843
chicago: Gavriil, Konstantinos, Ruslan Guseinov, Jesus Perez Rodriguez, Davide Pellis,
Paul M Henderson, Florian Rist, Helmut Pottmann, and Bernd Bickel. “Computational
Design of Cold Bent Glass Façades.” ACM Transactions on Graphics. Association
for Computing Machinery, 2020. https://doi.org/10.1145/3414685.3417843.
ieee: K. Gavriil et al., “Computational design of cold bent glass façades,”
ACM Transactions on Graphics, vol. 39, no. 6. Association for Computing
Machinery, 2020.
ista: Gavriil K, Guseinov R, Perez Rodriguez J, Pellis D, Henderson PM, Rist F,
Pottmann H, Bickel B. 2020. Computational design of cold bent glass façades. ACM
Transactions on Graphics. 39(6), 208.
mla: Gavriil, Konstantinos, et al. “Computational Design of Cold Bent Glass Façades.”
ACM Transactions on Graphics, vol. 39, no. 6, 208, Association for Computing
Machinery, 2020, doi:10.1145/3414685.3417843.
short: K. Gavriil, R. Guseinov, J. Perez Rodriguez, D. Pellis, P.M. Henderson, F.
Rist, H. Pottmann, B. Bickel, ACM Transactions on Graphics 39 (2020).
corr_author: '1'
date_created: 2020-09-23T11:30:02Z
date_published: 2020-11-26T00:00:00Z
date_updated: 2026-04-08T07:25:22Z
day: '26'
ddc:
- '000'
department:
- _id: BeBi
doi: 10.1145/3414685.3417843
ec_funded: 1
external_id:
arxiv:
- '2009.03667'
isi:
- '000595589100048'
file:
- access_level: open_access
checksum: c7f67717ad74e670b7daeae732abe151
content_type: application/pdf
creator: bbickel
date_created: 2023-05-23T20:54:43Z
date_updated: 2023-05-23T20:54:43Z
file_id: '13084'
file_name: coldglass.pdf
file_size: 28964641
relation: main_file
success: 1
file_date_updated: 2023-05-23T20:54:43Z
has_accepted_license: '1'
intvolume: ' 39'
isi: 1
issue: '6'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
project:
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
publication: ACM Transactions on Graphics
publication_identifier:
eissn:
- 1557-7368
issn:
- 0730-0301
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/bend-dont-break/
record:
- id: '8761'
relation: research_data
status: public
- id: '8366'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Computational design of cold bent glass façades
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 39
year: '2020'
...
---
_id: '8563'
abstract:
- lang: eng
text: "Supplementary data provided for the provided for the publication:\r\nIgor
Gridchyn , Philipp Schoenenberger , Joseph O'Neill , Jozsef Csicsvari (2020) Optogenetic
inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron
connections during behavior. Elife."
article_processing_charge: No
author:
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
- first_name: Igor
full_name: Gridchyn, Igor
id: 4B60654C-F248-11E8-B48F-1D18A9856A87
last_name: Gridchyn
orcid: 0000-0002-1807-1929
- first_name: Philipp
full_name: Schönenberger, Philipp
id: 3B9D816C-F248-11E8-B48F-1D18A9856A87
last_name: Schönenberger
citation:
ama: Csicsvari JL, Gridchyn I, Schönenberger P. Optogenetic alteration of hippocampal
network activity. 2020. doi:10.15479/AT:ISTA:8563
apa: Csicsvari, J. L., Gridchyn, I., & Schönenberger, P. (2020). Optogenetic
alteration of hippocampal network activity. Institute of Science and Technology
Austria. https://doi.org/10.15479/AT:ISTA:8563
chicago: Csicsvari, Jozsef L, Igor Gridchyn, and Philipp Schönenberger. “Optogenetic
Alteration of Hippocampal Network Activity.” Institute of Science and Technology
Austria, 2020. https://doi.org/10.15479/AT:ISTA:8563.
ieee: J. L. Csicsvari, I. Gridchyn, and P. Schönenberger, “Optogenetic alteration
of hippocampal network activity.” Institute of Science and Technology Austria,
2020.
ista: Csicsvari JL, Gridchyn I, Schönenberger P. 2020. Optogenetic alteration of
hippocampal network activity, Institute of Science and Technology Austria, 10.15479/AT:ISTA:8563.
mla: Csicsvari, Jozsef L., et al. Optogenetic Alteration of Hippocampal Network
Activity. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8563.
short: J.L. Csicsvari, I. Gridchyn, P. Schönenberger, (2020).
contributor:
- contributor_type: project_leader
first_name: Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
corr_author: '1'
date_created: 2020-09-23T14:39:54Z
date_published: 2020-10-19T00:00:00Z
date_updated: 2026-04-07T08:37:11Z
day: '19'
ddc:
- '570'
department:
- _id: JoCs
doi: 10.15479/AT:ISTA:8563
file:
- access_level: open_access
checksum: a16098a6d172f9c42ab5af5f6991668c
content_type: application/x-compressed
creator: jozsef
date_created: 2020-09-23T14:36:17Z
date_updated: 2020-09-23T14:36:17Z
file_id: '8564'
file_name: upload.tgz
file_size: 145243906
relation: main_file
success: 1
- access_level: open_access
checksum: 0bfc54b7e14c0694cd081617318ba606
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: jozsef
date_created: 2020-10-19T10:12:29Z
date_updated: 2020-10-19T10:12:29Z
file_id: '8675'
file_name: redme.docx
file_size: 11648
relation: main_file
success: 1
file_date_updated: 2020-10-19T10:12:29Z
has_accepted_license: '1'
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '10'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '8740'
relation: used_in_publication
status: public
status: public
title: Optogenetic alteration of hippocampal network activity
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: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '8568'
abstract:
- lang: eng
text: Aqueous iodine based electrochemical energy storage is considered a potential
candidate to improve sustainability and performance of current battery and supercapacitor
technology. It harnesses the redox activity of iodide, iodine, and polyiodide
species in the confined geometry of nanoporous carbon electrodes. However, current
descriptions of the electrochemical reaction mechanism to interconvert these species
are elusive. Here we show that electrochemical oxidation of iodide in nanoporous
carbons forms persistent solid iodine deposits. Confinement slows down dissolution
into triiodide and pentaiodide, responsible for otherwise significant self-discharge
via shuttling. The main tools for these insights are in situ Raman spectroscopy
and in situ small and wide-angle X-ray scattering (in situ SAXS/WAXS). In situ
Raman confirms the reversible formation of triiodide and pentaiodide. In situ
SAXS/WAXS indicates remarkable amounts of solid iodine deposited in the carbon
nanopores. Combined with stochastic modeling, in situ SAXS allows quantifying
the solid iodine volume fraction and visualizing the iodine structure on 3D lattice
models at the sub-nanometer scale. Based on the derived mechanism, we demonstrate
strategies for improved iodine pore filling capacity and prevention of self-discharge,
applicable to hybrid supercapacitors and batteries.
article_number: '4838'
article_processing_charge: No
article_type: original
author:
- first_name: Christian
full_name: Prehal, Christian
last_name: Prehal
- first_name: Harald
full_name: Fitzek, Harald
last_name: Fitzek
- first_name: Gerald
full_name: Kothleitner, Gerald
last_name: Kothleitner
- first_name: Volker
full_name: Presser, Volker
last_name: Presser
- first_name: Bernhard
full_name: Gollas, Bernhard
last_name: Gollas
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
- first_name: Qamar
full_name: Abbas, Qamar
last_name: Abbas
citation:
ama: Prehal C, Fitzek H, Kothleitner G, et al. Persistent and reversible solid iodine
electrodeposition in nanoporous carbons. Nature Communications. 2020;11.
doi:10.1038/s41467-020-18610-6
apa: Prehal, C., Fitzek, H., Kothleitner, G., Presser, V., Gollas, B., Freunberger,
S. A., & Abbas, Q. (2020). Persistent and reversible solid iodine electrodeposition
in nanoporous carbons. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-020-18610-6
chicago: Prehal, Christian, Harald Fitzek, Gerald Kothleitner, Volker Presser, Bernhard
Gollas, Stefan Alexander Freunberger, and Qamar Abbas. “Persistent and Reversible
Solid Iodine Electrodeposition in Nanoporous Carbons.” Nature Communications.
Springer Nature, 2020. https://doi.org/10.1038/s41467-020-18610-6.
ieee: C. Prehal et al., “Persistent and reversible solid iodine electrodeposition
in nanoporous carbons,” Nature Communications, vol. 11. Springer Nature,
2020.
ista: Prehal C, Fitzek H, Kothleitner G, Presser V, Gollas B, Freunberger SA, Abbas
Q. 2020. Persistent and reversible solid iodine electrodeposition in nanoporous
carbons. Nature Communications. 11, 4838.
mla: Prehal, Christian, et al. “Persistent and Reversible Solid Iodine Electrodeposition
in Nanoporous Carbons.” Nature Communications, vol. 11, 4838, Springer
Nature, 2020, doi:10.1038/s41467-020-18610-6.
short: C. Prehal, H. Fitzek, G. Kothleitner, V. Presser, B. Gollas, S.A. Freunberger,
Q. Abbas, Nature Communications 11 (2020).
corr_author: '1'
date_created: 2020-09-25T07:23:13Z
date_published: 2020-09-24T00:00:00Z
date_updated: 2025-06-12T06:58:51Z
day: '24'
ddc:
- '530'
department:
- _id: StFr
doi: 10.1038/s41467-020-18610-6
external_id:
isi:
- '000573756600004'
pmid:
- '32973214'
file:
- access_level: open_access
checksum: eada7bc8dd16a49390137cff882ef328
content_type: application/pdf
creator: dernst
date_created: 2020-09-28T13:16:15Z
date_updated: 2020-09-28T13:16:15Z
file_id: '8585'
file_name: 2020_NatureComm_Prehal.pdf
file_size: 1822469
relation: main_file
success: 1
file_date_updated: 2020-09-28T13:16:15Z
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
keyword:
- General Biochemistry
- Genetics and Molecular Biology
- General Physics and Astronomy
- General Chemistry
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
publication: Nature Communications
publication_identifier:
issn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1038/s41467-020-19720-x
scopus_import: '1'
status: public
title: Persistent and reversible solid iodine electrodeposition in nanoporous carbons
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: 11
year: '2020'
...