--- OA_place: publisher _id: '8332' abstract: - lang: eng text: "Designing and verifying concurrent programs is a notoriously challenging, time consuming, and error prone task, even for experts. This is due to the sheer number of possible interleavings of a concurrent program, all of which have to be tracked and accounted for in a formal proof. Inventing an inductive invariant that captures all interleavings of a low-level implementation is theoretically possible, but practically intractable. We develop a refinement-based verification framework that provides mechanisms to simplify proof construction by decomposing the verification task into smaller subtasks.\r\n\r\nIn a first line of work, we present a foundation for refinement reasoning over structured concurrent programs. We introduce layered concurrent programs as a compact notation to represent multi-layer refinement proofs. A layered concurrent program specifies a sequence of connected concurrent programs, from most concrete to most abstract, such that common parts of different programs are written exactly once. Each program in this sequence is expressed as structured concurrent program, i.e., a program over (potentially recursive) procedures, imperative control flow, gated atomic actions, structured parallelism, and asynchronous concurrency. This is in contrast to existing refinement-based verifiers, which represent concurrent systems as flat transition relations. We present a powerful refinement proof rule that decomposes refinement checking over structured programs into modular verification conditions. Refinement checking is supported by a new form of modular, parameterized invariants, called yield invariants, and a linear permission system to enhance local reasoning.\r\n\r\nIn a second line of work, we present two new reduction-based program transformations that target asynchronous programs. These transformations reduce the number of interleavings that need to be considered, thus reducing the complexity of invariants. Synchronization simplifies the verification of asynchronous programs by introducing the fiction, for proof purposes, that asynchronous operations complete synchronously. Synchronization summarizes an asynchronous computation as immediate atomic effect. Inductive sequentialization establishes sequential reductions that captures every behavior of the original program up to reordering of coarse-grained commutative actions. A sequential reduction of a concurrent program is easy to reason about since it corresponds to a simple execution of the program in an idealized synchronous environment, where processes act in a fixed order and at the same speed.\r\n\r\nOur approach is implemented the CIVL verifier, which has been successfully used for the verification of several complex concurrent programs. In our methodology, the overall correctness of a program is established piecemeal by focusing on the invariant required for each refinement step separately. While the programmer does the creative work of specifying the chain of programs and the inductive invariant justifying each link in the chain, the tool automatically constructs the verification conditions underlying each refinement step." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Bernhard full_name: Kragl, Bernhard id: 320FC952-F248-11E8-B48F-1D18A9856A87 last_name: Kragl orcid: 0000-0001-7745-9117 citation: ama: 'Kragl B. Verifying concurrent programs: Refinement, synchronization, sequentialization. 2020. doi:10.15479/AT:ISTA:8332' apa: 'Kragl, B. (2020). Verifying concurrent programs: Refinement, synchronization, sequentialization. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8332' chicago: 'Kragl, Bernhard. “Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8332.' ieee: 'B. Kragl, “Verifying concurrent programs: Refinement, synchronization, sequentialization,” Institute of Science and Technology Austria, 2020.' ista: 'Kragl B. 2020. Verifying concurrent programs: Refinement, synchronization, sequentialization. Institute of Science and Technology Austria.' mla: 'Kragl, Bernhard. Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8332.' short: 'B. Kragl, Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization, Institute of Science and Technology Austria, 2020.' corr_author: '1' date_created: 2020-09-04T12:24:12Z date_published: 2020-09-03T00:00:00Z date_updated: 2026-06-18T19:29:42Z day: '03' ddc: - '000' degree_awarded: PhD department: - _id: ToHe doi: 10.15479/AT:ISTA:8332 file: - access_level: open_access checksum: 26fe261550f691280bda4c454bf015c7 content_type: application/pdf creator: bkragl date_created: 2020-09-04T12:17:47Z date_updated: 2020-09-04T12:17:47Z file_id: '8333' file_name: kragl-thesis.pdf file_size: 1348815 relation: main_file - access_level: closed checksum: b9694ce092b7c55557122adba8337ebc content_type: application/zip creator: bkragl date_created: 2020-09-04T13:00:17Z date_updated: 2020-09-04T13:00:17Z file_id: '8335' file_name: kragl-thesis.zip file_size: 372312 relation: source_file file_date_updated: 2020-09-04T13:00:17Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '120' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '8195' relation: part_of_dissertation status: public - id: '133' relation: part_of_dissertation status: public - id: '160' relation: part_of_dissertation status: public - id: '8012' relation: part_of_dissertation status: public status: public supervisor: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 title: 'Verifying concurrent programs: Refinement, synchronization, sequentialization' type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2020' ... --- _id: '8336' abstract: - lang: eng text: Plant hormone cytokinins are perceived by a subfamily of sensor histidine kinases (HKs), which via a two-component phosphorelay cascade activate transcriptional responses in the nucleus. Subcellular localization of the receptors proposed the endoplasmic reticulum (ER) membrane as a principal cytokinin perception site, while study of cytokinin transport pointed to the plasma membrane (PM)-mediated cytokinin signalling. Here, by detailed monitoring of subcellular localizations of the fluorescently labelled natural cytokinin probe and the receptor ARABIDOPSIS HISTIDINE KINASE 4 (CRE1/AHK4) fused to GFP reporter, we show that pools of the ER-located cytokinin receptors can enter the secretory pathway and reach the PM in cells of the root apical meristem, and the cell plate of dividing meristematic cells. Brefeldin A (BFA) experiments revealed vesicular recycling of the receptor and its accumulation in BFA compartments. We provide a revised view on cytokinin signalling and the possibility of multiple sites of perception at PM and ER. acknowledged_ssus: - _id: Bio - _id: LifeSc acknowledgement: This paper is dedicated to deceased P. Galuszka for his support and contribution to the project. This research was supported by the Scientific Service Units (SSU) of IST-Austria through resources provided by the Bioimaging Facility (BIF), the Life Science Facility (LSF) and by Centre of the Region Haná (CRH), Palacký University. We thank Lucia Hlusková, Zuzana Pěkná and Martin Hönig for technical assistance, and Fernando Aniento, Rashed Abualia and Andrej Hurný for sharing material. The work was supported from ERDF project “Plants as a tool for sustainable global development” (No. CZ.02.1.01/0.0/0.0/16_019/0000827), from Czech Science Foundation via projects 16-04184S (O.P., K.K. and K.D.), 18-23972Y (D.Z., K.K.), 17-21122S (K.B.), Erasmus+ (K.K.), Endowment Fund of Palacký University (K.K.) and EMBO Long-Term Fellowship, ALTF number 710-2016 (J.C.M.); People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. [291734] (N.C.); DOC Fellowship of the Austrian Academy of Sciences at the Institute of Science and Technology, Austria (H.S.). article_number: '4285' article_processing_charge: No article_type: original author: - first_name: Karolina full_name: Kubiasova, Karolina id: 946011F4-3E71-11EA-860B-C7A73DDC885E last_name: Kubiasova orcid: 0000-0001-5630-9419 - first_name: Juan C full_name: Montesinos López, Juan C id: 310A8E3E-F248-11E8-B48F-1D18A9856A87 last_name: Montesinos López orcid: 0000-0001-9179-6099 - first_name: Olga full_name: Šamajová, Olga last_name: Šamajová - first_name: Jaroslav full_name: Nisler, Jaroslav last_name: Nisler - first_name: Václav full_name: Mik, Václav last_name: Mik - first_name: Hana full_name: Semeradova, Hana id: 42FE702E-F248-11E8-B48F-1D18A9856A87 last_name: Semeradova - first_name: Lucie full_name: Plíhalová, Lucie last_name: Plíhalová - first_name: Ondřej full_name: Novák, Ondřej last_name: Novák - first_name: Peter full_name: Marhavý, Peter id: 3F45B078-F248-11E8-B48F-1D18A9856A87 last_name: Marhavý orcid: 0000-0001-5227-5741 - first_name: Nicola full_name: Cavallari, Nicola id: 457160E6-F248-11E8-B48F-1D18A9856A87 last_name: Cavallari - first_name: David full_name: Zalabák, David last_name: Zalabák - first_name: Karel full_name: Berka, Karel last_name: Berka - first_name: Karel full_name: Doležal, Karel last_name: Doležal - first_name: Petr full_name: Galuszka, Petr last_name: Galuszka - first_name: Jozef full_name: Šamaj, Jozef last_name: Šamaj - first_name: Miroslav full_name: Strnad, Miroslav last_name: Strnad - first_name: Eva full_name: Benková, Eva id: 38F4F166-F248-11E8-B48F-1D18A9856A87 last_name: Benková orcid: 0000-0002-8510-9739 - first_name: Ondřej full_name: Plíhal, Ondřej last_name: Plíhal - first_name: Lukáš full_name: Spíchal, Lukáš last_name: Spíchal citation: ama: Kubiasova K, Montesinos López JC, Šamajová O, et al. Cytokinin fluoroprobe reveals multiple sites of cytokinin perception at plasma membrane and endoplasmic reticulum. Nature Communications. 2020;11. doi:10.1038/s41467-020-17949-0 apa: Kubiasova, K., Montesinos López, J. C., Šamajová, O., Nisler, J., Mik, V., Semerádová, H., … Spíchal, L. (2020). Cytokinin fluoroprobe reveals multiple sites of cytokinin perception at plasma membrane and endoplasmic reticulum. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-020-17949-0 chicago: Kubiasova, Karolina, Juan C Montesinos López, Olga Šamajová, Jaroslav Nisler, Václav Mik, Hana Semerádová, Lucie Plíhalová, et al. “Cytokinin Fluoroprobe Reveals Multiple Sites of Cytokinin Perception at Plasma Membrane and Endoplasmic Reticulum.” Nature Communications. Springer Nature, 2020. https://doi.org/10.1038/s41467-020-17949-0. ieee: K. Kubiasova et al., “Cytokinin fluoroprobe reveals multiple sites of cytokinin perception at plasma membrane and endoplasmic reticulum,” Nature Communications, vol. 11. Springer Nature, 2020. ista: Kubiasova K, Montesinos López JC, Šamajová O, Nisler J, Mik V, Semerádová H, Plíhalová L, Novák O, Marhavý P, Cavallari N, Zalabák D, Berka K, Doležal K, Galuszka P, Šamaj J, Strnad M, Benková E, Plíhal O, Spíchal L. 2020. Cytokinin fluoroprobe reveals multiple sites of cytokinin perception at plasma membrane and endoplasmic reticulum. Nature Communications. 11, 4285. mla: Kubiasova, Karolina, et al. “Cytokinin Fluoroprobe Reveals Multiple Sites of Cytokinin Perception at Plasma Membrane and Endoplasmic Reticulum.” Nature Communications, vol. 11, 4285, Springer Nature, 2020, doi:10.1038/s41467-020-17949-0. short: K. Kubiasova, J.C. Montesinos López, O. Šamajová, J. Nisler, V. Mik, H. Semerádová, L. Plíhalová, O. Novák, P. Marhavý, N. Cavallari, D. Zalabák, K. Berka, K. Doležal, P. Galuszka, J. Šamaj, M. Strnad, E. Benková, O. Plíhal, L. Spíchal, Nature Communications 11 (2020). corr_author: '1' date_created: 2020-09-06T22:01:12Z date_published: 2020-08-27T00:00:00Z date_updated: 2026-04-02T14:35:13Z day: '27' ddc: - '580' department: - _id: EvBe doi: 10.1038/s41467-020-17949-0 ec_funded: 1 external_id: isi: - '000567931000002' pmid: - '32855390' file: - access_level: open_access checksum: 7494b7665b3d2bf2d8edb13e4f12b92d content_type: application/pdf creator: dernst date_created: 2020-09-10T08:05:19Z date_updated: 2020-09-10T08:05:19Z file_id: '8357' file_name: 2020_NatureComm_Kubiasova.pdf file_size: 3455704 relation: main_file success: 1 file_date_updated: 2020-09-10T08:05:19Z has_accepted_license: '1' intvolume: ' 11' isi: 1 language: - iso: eng month: '08' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme - _id: 261821BC-B435-11E9-9278-68D0E5697425 grant_number: '24746' name: Molecular mechanisms of the cytokinin regulated endomembrane trafficking to coordinate plant organogenesis - _id: 253E54C8-B435-11E9-9278-68D0E5697425 grant_number: ALTF710-2016 name: Molecular mechanism of auxindriven formative divisions delineating lateral root organogenesis in plants publication: Nature Communications publication_identifier: eissn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Cytokinin fluoroprobe reveals multiple sites of cytokinin perception at plasma membrane and endoplasmic reticulum 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: ba8df636-2132-11f1-aed0-ed93e2281fdd volume: 11 year: '2020' ... --- _id: '8337' abstract: - lang: eng text: Cytokinins are mobile multifunctional plant hormones with roles in development and stress resilience. Although their Histidine Kinase receptors are substantially localised to the endoplasmic reticulum, cellular sites of cytokinin perception and importance of spatially heterogeneous cytokinin distribution continue to be debated. Here we show that cytokinin perception by plasma membrane receptors is an effective additional path for cytokinin response. Readout from a Two Component Signalling cytokinin-specific reporter (TCSn::GFP) closely matches intracellular cytokinin content in roots, yet we also find cytokinins in extracellular fluid, potentially enabling action at the cell surface. Cytokinins covalently linked to beads that could not pass the plasma membrane increased expression of both TCSn::GFP and Cytokinin Response Factors. Super-resolution microscopy of GFP-labelled receptors and diminished TCSn::GFP response to immobilised cytokinins in cytokinin receptor mutants, further indicate that receptors can function at the cell surface. We argue that dual intracellular and surface locations may augment flexibility of cytokinin responses. acknowledged_ssus: - _id: Bio acknowledgement: 'We thank Bruno Müller and Aaron Rashotte for critical discussions and provision of plant lines used in this work, Roger Granbom and Tamara Hernández Verdeja (UPSC, Umeå, Sweden) for technical assistance and providing materials, Zuzana Pěkná and Karolina Wojewodová (CRH, Palacký University, Olomouc, Czech Republic) for help with cytokinin receptor binding assays, and David Zalabák (CRH, Palacký University, Olomouc, Czech Republic) for provision of vector pINIIIΔEH expressing CRE1/AHK4. The bioimaging facility of IST Austria, the Swedish Metabolomics Centre and the IST Austria Bio-Imaging facility are acknowledged for support. The work was funded by the European Molecular Biology Organization (EMBO ASTF 297-2013) (I.A.), Development—The Company of Biologists (DEVTF2012) (I.A.; C.T.), Plant Fellows (the International Post doc Fellowship Programme in Plant Sciences, 267423) (I.A.; K.L.), the Swedish Research Council (621-2014-4514) (K.L.), UPSC Berzelii Center for Forest Biotechnology (Vinnova 2012-01560), Kempestiftelserna (JCK-2711) (K.L.) and (JCK-1811) (E.-M.B., K.L.). The Ministry of Education, Youth and Sports of the Czech Republic via the European Regional Development Fund-Project “Plants as a tool for sustainable global development” (CZ.02.1.01/0.0/0.0/16_019/0000827) (O.N., O.P., R.S., V.M., L.P., K.D.) and project CEITEC 2020 (LQ1601) (M.P., J.H.) provided support, as did the Czech Science Foundation via projects GP14-30004P (M.P.) and 16-04184S (O.P., K.D., O.N.), Vetenskapsrådet and Vinnova (Verket för Innovationssystem) (T.V., S.R.), Knut och Alice Wallenbergs Stiftelse via “Shapesystem” grant number 2012.0050. A.J. was supported by the Austria Science Fund (FWF): I03630 to J.F. The research leading to these results received funding from European Union’s Horizon 2020 programme (ERC grant no. 742985) and FWO-FWF joint project G0E5718N to J.F.' article_number: '4284' article_processing_charge: No article_type: original author: - first_name: Ioanna full_name: Antoniadi, Ioanna last_name: Antoniadi - first_name: Ondřej full_name: Novák, Ondřej last_name: Novák - first_name: Zuzana full_name: Gelová, Zuzana id: 0AE74790-0E0B-11E9-ABC7-1ACFE5697425 last_name: Gelová orcid: 0000-0003-4783-1752 - first_name: Alexander J full_name: Johnson, Alexander J id: 46A62C3A-F248-11E8-B48F-1D18A9856A87 last_name: Johnson orcid: 0000-0002-2739-8843 - first_name: Ondřej full_name: Plíhal, Ondřej last_name: Plíhal - first_name: Radim full_name: Simerský, Radim last_name: Simerský - first_name: Václav full_name: Mik, Václav last_name: Mik - first_name: Thomas full_name: Vain, Thomas last_name: Vain - first_name: Eduardo full_name: Mateo-Bonmatí, Eduardo last_name: Mateo-Bonmatí - first_name: Michal full_name: Karady, Michal last_name: Karady - first_name: Markéta full_name: Pernisová, Markéta last_name: Pernisová - first_name: Lenka full_name: Plačková, Lenka last_name: Plačková - first_name: Korawit full_name: Opassathian, Korawit last_name: Opassathian - first_name: Jan full_name: Hejátko, Jan last_name: Hejátko - first_name: Stéphanie full_name: Robert, Stéphanie last_name: Robert - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 - first_name: Karel full_name: Doležal, Karel last_name: Doležal - first_name: Karin full_name: Ljung, Karin last_name: Ljung - first_name: Colin full_name: Turnbull, Colin last_name: Turnbull citation: ama: Antoniadi I, Novák O, Gelová Z, et al. Cell-surface receptors enable perception of extracellular cytokinins. Nature Communications. 2020;11. doi:10.1038/s41467-020-17700-9 apa: Antoniadi, I., Novák, O., Gelová, Z., Johnson, A. J., Plíhal, O., Simerský, R., … Turnbull, C. (2020). Cell-surface receptors enable perception of extracellular cytokinins. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-020-17700-9 chicago: Antoniadi, Ioanna, Ondřej Novák, Zuzana Gelová, Alexander J Johnson, Ondřej Plíhal, Radim Simerský, Václav Mik, et al. “Cell-Surface Receptors Enable Perception of Extracellular Cytokinins.” Nature Communications. Springer Nature, 2020. https://doi.org/10.1038/s41467-020-17700-9. ieee: I. Antoniadi et al., “Cell-surface receptors enable perception of extracellular cytokinins,” Nature Communications, vol. 11. Springer Nature, 2020. ista: Antoniadi I, Novák O, Gelová Z, Johnson AJ, Plíhal O, Simerský R, Mik V, Vain T, Mateo-Bonmatí E, Karady M, Pernisová M, Plačková L, Opassathian K, Hejátko J, Robert S, Friml J, Doležal K, Ljung K, Turnbull C. 2020. Cell-surface receptors enable perception of extracellular cytokinins. Nature Communications. 11, 4284. mla: Antoniadi, Ioanna, et al. “Cell-Surface Receptors Enable Perception of Extracellular Cytokinins.” Nature Communications, vol. 11, 4284, Springer Nature, 2020, doi:10.1038/s41467-020-17700-9. short: I. Antoniadi, O. Novák, Z. Gelová, A.J. Johnson, O. Plíhal, R. Simerský, V. Mik, T. Vain, E. Mateo-Bonmatí, M. Karady, M. Pernisová, L. Plačková, K. Opassathian, J. Hejátko, S. Robert, J. Friml, K. Doležal, K. Ljung, C. Turnbull, Nature Communications 11 (2020). date_created: 2020-09-06T22:01:13Z date_published: 2020-08-27T00:00:00Z date_updated: 2026-04-03T09:25:48Z day: '27' ddc: - '580' department: - _id: JiFr doi: 10.1038/s41467-020-17700-9 ec_funded: 1 external_id: isi: - '000567931000001' pmid: - '32855409' file: - access_level: open_access checksum: 5b96f39b598de7510cfefefb819b9a6d content_type: application/pdf creator: dernst date_created: 2020-12-10T12:23:56Z date_updated: 2020-12-10T12:23:56Z file_id: '8936' file_name: 2020_NatureComm_Antoniadi.pdf file_size: 3526415 relation: main_file success: 1 file_date_updated: 2020-12-10T12:23:56Z has_accepted_license: '1' intvolume: ' 11' isi: 1 language: - iso: eng month: '08' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 26538374-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I03630 name: Molecular mechanisms of endocytic cargo recognition in plants - _id: 261099A6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '742985' name: Tracing Evolution of Auxin Transport and Polarity in Plants publication: Nature Communications publication_identifier: eissn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Cell-surface receptors enable perception of extracellular cytokinins 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: ba8df636-2132-11f1-aed0-ed93e2281fdd volume: 11 year: '2020' ... --- _id: '8339' abstract: - lang: eng text: "Discrete Gaussian distributions over lattices are central to lattice-based cryptography, and to the computational and mathematical aspects of lattices more broadly. The literature contains a wealth of useful theorems about the behavior of discrete Gaussians under convolutions and related operations. Yet despite their structural similarities, most of these theorems are formally incomparable, and their proofs tend to be monolithic and written nearly “from scratch,” making them unnecessarily hard to verify, understand, and extend.\r\nIn this work we present a modular framework for analyzing linear operations on discrete Gaussian distributions. The framework abstracts away the particulars of Gaussians, and usually reduces proofs to the choice of appropriate linear transformations and elementary linear algebra. To showcase the approach, we establish several general properties of discrete Gaussians, and show how to obtain all prior convolution theorems (along with some new ones) as straightforward corollaries. As another application, we describe a self-reduction for Learning With Errors (LWE) that uses a fixed number of samples to generate an unlimited number of additional ones (having somewhat larger error). The distinguishing features of our reduction are its simple analysis in our framework, and its exclusive use of discrete Gaussians without any loss in parameters relative to a prior mixed discrete-and-continuous approach.\r\nAs a contribution of independent interest, for subgaussian random matrices we prove a singular value concentration bound with explicitly stated constants, and we give tighter heuristics for specific distributions that are commonly used for generating lattice trapdoors. These bounds yield improvements in the concrete bit-security estimates for trapdoor lattice cryptosystems." alternative_title: - LNCS article_processing_charge: No author: - first_name: Nicholas full_name: Genise, Nicholas last_name: Genise - first_name: Daniele full_name: Micciancio, Daniele last_name: Micciancio - first_name: Chris full_name: Peikert, Chris last_name: Peikert - first_name: Michael full_name: Walter, Michael id: 488F98B0-F248-11E8-B48F-1D18A9856A87 last_name: Walter orcid: 0000-0003-3186-2482 citation: ama: 'Genise N, Micciancio D, Peikert C, Walter M. Improved discrete Gaussian and subgaussian analysis for lattice cryptography. In: 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography. Vol 12110. Springer Nature; 2020:623-651. doi:10.1007/978-3-030-45374-9_21' apa: 'Genise, N., Micciancio, D., Peikert, C., & Walter, M. (2020). Improved discrete Gaussian and subgaussian analysis for lattice cryptography. In 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography (Vol. 12110, pp. 623–651). Edinburgh, United Kingdom: Springer Nature. https://doi.org/10.1007/978-3-030-45374-9_21' chicago: Genise, Nicholas, Daniele Micciancio, Chris Peikert, and Michael Walter. “Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.” In 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, 12110:623–51. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-45374-9_21. ieee: N. Genise, D. Micciancio, C. Peikert, and M. Walter, “Improved discrete Gaussian and subgaussian analysis for lattice cryptography,” in 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, Edinburgh, United Kingdom, 2020, vol. 12110, pp. 623–651. ista: 'Genise N, Micciancio D, Peikert C, Walter M. 2020. Improved discrete Gaussian and subgaussian analysis for lattice cryptography. 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography. PKC: Public-Key Cryptography, LNCS, vol. 12110, 623–651.' mla: Genise, Nicholas, et al. “Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.” 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, vol. 12110, Springer Nature, 2020, pp. 623–51, doi:10.1007/978-3-030-45374-9_21. short: N. Genise, D. Micciancio, C. Peikert, M. Walter, in:, 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, Springer Nature, 2020, pp. 623–651. conference: end_date: 2020-05-07 location: Edinburgh, United Kingdom name: 'PKC: Public-Key Cryptography' start_date: 2020-05-04 date_created: 2020-09-06T22:01:13Z date_published: 2020-05-15T00:00:00Z date_updated: 2026-04-16T09:32:27Z day: '15' department: - _id: KrPi doi: 10.1007/978-3-030-45374-9_21 ec_funded: 1 external_id: isi: - '001299210200021' intvolume: ' 12110' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2020/337 month: '05' oa: 1 oa_version: Preprint page: 623-651 project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication: 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography publication_identifier: eissn: - 1611-3349 isbn: - '9783030453732' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Improved discrete Gaussian and subgaussian analysis for lattice cryptography type: conference user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd volume: 12110 year: '2020' ... --- OA_place: publisher _id: '8341' abstract: - lang: eng text: "One of the most striking hallmarks of the eukaryotic cell is the presence of intracellular vesicles and organelles. Each of these membrane-enclosed compartments has a distinct composition of lipids and proteins, which is essential for accurate membrane traffic and homeostasis. Interestingly, their biochemical identities are achieved with the help\r\nof small GTPases of the Rab family, which cycle between GDP- and GTP-bound forms on the selected membrane surface. While this activity switch is well understood for an individual protein, how Rab GTPases collectively transition between states to generate decisive signal propagation in space and time is unclear. In my PhD thesis, I present\r\nin vitro reconstitution experiments with theoretical modeling to systematically study a minimal Rab5 activation network from bottom-up. We find that positive feedback based on known molecular interactions gives rise to bistable GTPase activity switching on system’s scale. Furthermore, we determine that collective transition near the critical\r\npoint is intrinsically stochastic and provide evidence that the inactive Rab5 abundance on the membrane can shape the network response. Finally, we demonstrate that collective switching can spread on the lipid bilayer as a traveling activation wave, representing a possible emergent activity pattern in endosomal maturation. Together, our\r\nfindings reveal new insights into the self-organization properties of signaling networks away from chemical equilibrium. Our work highlights the importance of systematic characterization of biochemical systems in well-defined physiological conditions. This way, we were able to answer long-standing open questions in the field and close the gap between regulatory processes on a molecular scale and emergent responses on system’s level." acknowledged_ssus: - _id: Bio - _id: LifeSc - _id: NanoFab acknowledgement: My thanks goes to the Loose lab members, BioImaging, Life Science and Nanofabrication Facilities and the wonderful international community at IST for sharing this experience with me. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Urban full_name: Bezeljak, Urban id: 2A58201A-F248-11E8-B48F-1D18A9856A87 last_name: Bezeljak orcid: 0000-0003-1365-5631 citation: ama: Bezeljak U. In vitro reconstitution of a Rab activation switch. 2020. doi:10.15479/AT:ISTA:8341 apa: Bezeljak, U. (2020). In vitro reconstitution of a Rab activation switch. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8341 chicago: Bezeljak, Urban. “In Vitro Reconstitution of a Rab Activation Switch.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8341. ieee: U. Bezeljak, “In vitro reconstitution of a Rab activation switch,” Institute of Science and Technology Austria, 2020. ista: Bezeljak U. 2020. In vitro reconstitution of a Rab activation switch. Institute of Science and Technology Austria. mla: Bezeljak, Urban. In Vitro Reconstitution of a Rab Activation Switch. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8341. short: U. Bezeljak, In Vitro Reconstitution of a Rab Activation Switch, Institute of Science and Technology Austria, 2020. corr_author: '1' date_created: 2020-09-08T08:53:53Z date_published: 2020-09-08T00:00:00Z date_updated: 2026-04-08T07:24:56Z day: '08' ddc: - '570' degree_awarded: PhD department: - _id: MaLo doi: 10.15479/AT:ISTA:8341 file: - access_level: closed checksum: 70871b335a595252a66c6bbf0824fb02 content_type: application/x-zip-compressed creator: dernst date_created: 2020-09-08T09:00:29Z date_updated: 2021-09-16T12:49:12Z file_id: '8342' file_name: 2020_Urban_Bezeljak_Thesis_TeX.zip file_size: 65246782 relation: source_file - access_level: open_access checksum: 59a62275088b00b7241e6ff4136434c7 content_type: application/pdf creator: dernst date_created: 2020-09-08T09:00:27Z date_updated: 2021-09-16T12:49:12Z file_id: '8343' file_name: 2020_Urban_Bezeljak_Thesis.pdf file_size: 31259058 relation: main_file file_date_updated: 2021-09-16T12:49:12Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '215' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '7580' relation: part_of_dissertation status: public status: public supervisor: - first_name: Martin full_name: Loose, Martin id: 462D4284-F248-11E8-B48F-1D18A9856A87 last_name: Loose orcid: 0000-0001-7309-9724 title: In vitro reconstitution of a Rab activation switch 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' ... --- OA_place: publisher _id: '8353' abstract: - lang: eng text: "Mrp (Multi resistance and pH adaptation) are broadly distributed secondary active antiporters that catalyze the transport of monovalent ions such as sodium and potassium outside of the cell coupled to the inward translocation of protons. Mrp antiporters are unique in a way that they are composed of seven subunits (MrpABCDEFG) encoded in a single operon, whereas other antiporters catalyzing the same reaction are mostly encoded by a single gene. Mrp exchangers are crucial for intracellular pH homeostasis and Na+ efflux, essential mechanisms for H+ uptake under alkaline environments and for reduction of the intracellular concentration of toxic cations. Mrp displays no homology to any other monovalent Na+(K+)/H+ antiporters but Mrp subunits have primary sequence similarity to essential redox-driven proton pumps, such as respiratory complex I and membrane-bound hydrogenases. This similarity reinforces the hypothesis that these present day redox-driven proton pumps are descended from the Mrp antiporter. The Mrp structure serves as a model to understand the yet obscure coupling mechanism between ion or electron transfer and proton translocation in this large group of proteins. In the thesis, I am presenting the purification, biochemical analysis, cryo-EM analysis and molecular structure of the Mrp complex from Anoxybacillus flavithermus solved by cryo-EM at 3.0 Å resolution. Numerous conditions were screened to purify Mrp to high homogeneity and to obtain an appropriate distribution of single particles on cryo-EM grids covered with a continuous layer of ultrathin carbon. A preferred particle orientation problem was solved by performing a tilted data collection. The activity assays showed the specific pH-dependent\r\nprofile of secondary active antiporters. The molecular structure shows that Mrp is a dimer of seven-subunit protomers with 50 trans-membrane helices each. The dimer interface is built by many short and tilted transmembrane helices, probably causing a thinning of the bacterial membrane. The surface charge distribution shows an extraordinary asymmetry within each monomer, revealing presumable proton and sodium translocation pathways. The two largest\r\nand homologous Mrp subunits MrpA and MrpD probably translocate one proton each into the cell. The sodium ion is likely being translocated in the opposite direction within the small subunits along a ladder of charged and conserved residues. Based on the structure, we propose a mechanism were the antiport activity is accomplished via electrostatic interactions between the charged cations and key charged residues. The flexible key TM helices coordinate these\r\nelectrostatic interactions, while the membrane thinning between the monomers enables the translocation of sodium across the charged membrane. The entire family of redox-driven proton pumps is likely to perform their mechanism in a likewise manner." acknowledged_ssus: - _id: LifeSc - _id: EM-Fac - _id: ScienComp acknowledgement: "I acknowledge the scientific service units of the IST Austria for providing resources by the Life Science Facility, the Electron Microscopy Facility and the high-performance computer cluster. Special thanks to the cryo-EM specialists Valentin Hodirnau and Daniel Johann Gütl for spending many hours with me in front of the microscope and for supporting me to collect the data presented here. I also want to thank Professor Masahiro Ito for providing plasmid DNA\r\nencoding Mrp from Anoxybacillus flavithermus WK1. I am a recipient of a DOC Fellowship of the Austrian Academy of Sciences." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Julia full_name: Steiner, Julia id: 3BB67EB0-F248-11E8-B48F-1D18A9856A87 last_name: Steiner orcid: 0000-0003-0493-3775 citation: ama: Steiner J. Biochemical and structural investigation of the Mrp antiporter, an ancestor of complex I. 2020. doi:10.15479/AT:ISTA:8353 apa: Steiner, J. (2020). Biochemical and structural investigation of the Mrp antiporter, an ancestor of complex I. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8353 chicago: Steiner, Julia. “Biochemical and Structural Investigation of the Mrp Antiporter, an Ancestor of Complex I.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8353. ieee: J. Steiner, “Biochemical and structural investigation of the Mrp antiporter, an ancestor of complex I,” Institute of Science and Technology Austria, 2020. ista: Steiner J. 2020. Biochemical and structural investigation of the Mrp antiporter, an ancestor of complex I. Institute of Science and Technology Austria. mla: Steiner, Julia. Biochemical and Structural Investigation of the Mrp Antiporter, an Ancestor of Complex I. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8353. short: J. Steiner, Biochemical and Structural Investigation of the Mrp Antiporter, an Ancestor of Complex I, Institute of Science and Technology Austria, 2020. corr_author: '1' date_created: 2020-09-09T14:27:01Z date_published: 2020-09-09T00:00:00Z date_updated: 2026-04-08T07:23:36Z day: '09' ddc: - '572' degree_awarded: PhD department: - _id: LeSa doi: 10.15479/AT:ISTA:8353 file: - access_level: open_access checksum: 2388d7e6e7a4d364c096fa89f305c3de content_type: application/pdf creator: jsteiner date_created: 2020-09-09T14:22:35Z date_updated: 2021-09-16T12:40:56Z file_id: '8354' file_name: Thesis_Julia_Steiner_pdfA.pdf file_size: 117547589 relation: main_file - access_level: closed checksum: ba112f957b7145462d0ab79044873ee9 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: jsteiner date_created: 2020-09-09T14:23:25Z date_updated: 2020-09-15T08:48:37Z file_id: '8355' file_name: Thesis_Julia_Steiner.docx file_size: 223328668 relation: source_file file_date_updated: 2021-09-16T12:40:56Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: None page: '191' project: - _id: 26169496-B435-11E9-9278-68D0E5697425 grant_number: '24741' name: Revealing the functional mechanism of Mrp antiporter, an ancestor of complex I publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '8284' relation: part_of_dissertation status: public status: public supervisor: - first_name: Leonid A full_name: Sazanov, Leonid A id: 338D39FE-F248-11E8-B48F-1D18A9856A87 last_name: Sazanov orcid: 0000-0002-0977-7989 title: Biochemical and structural investigation of the Mrp antiporter, an ancestor of complex I type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2020' ... --- OA_place: publisher _id: '8358' abstract: - lang: eng text: "During bacterial cell division, the tubulin-homolog FtsZ forms a ring-like structure at the center of the cell. This so-called Z-ring acts as a scaffold recruiting several division-related proteins to mid-cell and plays a key role in distributing proteins at the division site, a feature driven by the treadmilling motion of FtsZ filaments around the septum. What regulates the architecture, dynamics and stability of the Z-ring is still poorly understood, but FtsZ-associated proteins (Zaps) are known to play an important role. \r\nAdvances in fluorescence microscopy and in vitro reconstitution experiments have helped to shed light into some of the dynamic properties of these complex systems, but methods that allow to collect and analyze large quantitative data sets of the underlying polymer dynamics are still missing.\r\nHere, using an in vitro reconstitution approach, we studied how different Zaps affect FtsZ filament dynamics and organization into large-scale patterns, giving special emphasis to the role of the well-conserved protein ZapA. For this purpose, we use high-resolution fluorescence microscopy combined with novel image analysis workfows to study pattern organization and polymerization dynamics of active filaments. We quantified the influence of Zaps on FtsZ on three diferent spatial scales: the large-scale organization of the membrane-bound filament network, the underlying\r\npolymerization dynamics and the behavior of single molecules.\r\nWe found that ZapA cooperatively increases the spatial order of the filament network, binds only transiently to FtsZ filaments and has no effect on filament length and treadmilling velocity. Our data provides a model for how FtsZ-associated proteins can increase the precision and stability of the bacterial cell division machinery in a\r\nswitch-like manner, without compromising filament dynamics. Furthermore, we believe that our automated quantitative methods can be used to analyze a large variety of dynamic cytoskeletal systems, using standard time-lapse\r\nmovies of homogeneously labeled proteins obtained from experiments in vitro or even inside the living cell.\r\n" acknowledged_ssus: - _id: Bio acknowledgement: I should also express my gratitude to the bioimaging facility at IST Austria, for their assistance with the TIRF setup over the years, and especially to Christoph Sommer, who gave me a lot of input when I was starting to dive into programming. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Paulo R full_name: Dos Santos Caldas, Paulo R id: 38FCDB4C-F248-11E8-B48F-1D18A9856A87 last_name: Dos Santos Caldas orcid: 0000-0001-6730-4461 citation: ama: Dos Santos Caldas PR. Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers. 2020. doi:10.15479/AT:ISTA:8358 apa: Dos Santos Caldas, P. R. (2020). Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8358 chicago: Dos Santos Caldas, Paulo R. “Organization and Dynamics of Treadmilling Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinkers.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8358. ieee: P. R. Dos Santos Caldas, “Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers,” Institute of Science and Technology Austria, 2020. ista: Dos Santos Caldas PR. 2020. Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers. Institute of Science and Technology Austria. mla: Dos Santos Caldas, Paulo R. Organization and Dynamics of Treadmilling Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinkers. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8358. short: P.R. Dos Santos Caldas, Organization and Dynamics of Treadmilling Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinkers, Institute of Science and Technology Austria, 2020. corr_author: '1' date_created: 2020-09-10T09:26:49Z date_published: 2020-09-10T00:00:00Z date_updated: 2026-04-08T07:26:30Z day: '10' ddc: - '572' degree_awarded: PhD department: - _id: MaLo doi: 10.15479/AT:ISTA:8358 file: - access_level: open_access checksum: 882f93fe9c351962120e2669b84bf088 content_type: application/pdf creator: pcaldas date_created: 2020-09-10T12:11:29Z date_updated: 2020-09-10T12:11:29Z file_id: '8364' file_name: phd_thesis_pcaldas.pdf file_size: 141602462 relation: main_file success: 1 - access_level: closed checksum: 70cc9e399c4e41e6e6ac445ae55e8558 content_type: application/x-zip-compressed creator: pcaldas date_created: 2020-09-10T12:18:17Z date_updated: 2020-09-11T07:48:10Z file_id: '8365' file_name: phd_thesis_latex_pcaldas.zip file_size: 450437458 relation: source_file file_date_updated: 2020-09-11T07:48:10Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '135' publication_identifier: isbn: - 978-3-99078-009-1 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '7197' relation: part_of_dissertation status: public - id: '7572' relation: dissertation_contains status: public status: public supervisor: - first_name: Martin full_name: Loose, Martin id: 462D4284-F248-11E8-B48F-1D18A9856A87 last_name: Loose orcid: 0000-0001-7309-9724 title: Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers 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: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2020' ... --- _id: '8361' abstract: - lang: eng text: With the lithium-ion technology approaching its intrinsic limit with graphite-based anodes, Li metal is recently receiving renewed interest from the battery community as potential high capacity anode for next-generation rechargeable batteries. In this focus paper, we review the main advances in this field since the first attempts in the mid-1970s. Strategies for enabling reversible cycling and avoiding dendrite growth are thoroughly discussed, including specific applications in all-solid-state (inorganic and polymeric), Lithium–Sulfur (Li–S) and Lithium-O2 (air) batteries. A particular attention is paid to recent developments of these battery technologies and their current state with respect to the 2030 targets of the EU Integrated Strategic Energy Technology Plan (SET-Plan) Action 7. acknowledgement: A.V. and K.T. acknowledge, respectively, the financial support of the Helmholtz Association and BMW AG. J.H. acknowledges the collabo-ration project “Accordo di Collaborazione Quadro 2015” between Uni-versity of Ferrara (Department of Chemical and Pharmaceutical Sciences) and Sapienza University of Rome (Department of Chemistry). S.D., H.A. and S.K. thank the Fraunhofer Gesellschaft, Technische Uni-versit ̈at Dresden and would like to acknowledge European Union’s Horizon 2020 research and innovation programme under grant agree-ment No 814471. S.A.F. and C.P. are indebted to the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement no. 636069) and IST Austria. article_number: '228803' article_processing_charge: No article_type: original author: - first_name: Alberto full_name: Varzi, Alberto last_name: Varzi orcid: 0000-0001-5069-0589 - first_name: Katharina full_name: Thanner, Katharina last_name: Thanner orcid: 0000-0001-5394-2323 - first_name: Roberto full_name: Scipioni, Roberto last_name: Scipioni orcid: 0000-0003-1926-421X - first_name: Daniele full_name: Di Lecce, Daniele last_name: Di Lecce - first_name: Jusef full_name: Hassoun, Jusef last_name: Hassoun - first_name: Susanne full_name: Dörfler, Susanne last_name: Dörfler - first_name: Holger full_name: Altheus, Holger last_name: Altheus - first_name: Stefan full_name: Kaskel, Stefan last_name: Kaskel - first_name: Christian full_name: Prehal, Christian last_name: Prehal orcid: 0000-0003-0654-0940 - first_name: Stefan Alexander full_name: Freunberger, Stefan Alexander id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425 last_name: Freunberger orcid: 0000-0003-2902-5319 citation: ama: Varzi A, Thanner K, Scipioni R, et al. Current status and future perspectives of lithium metal batteries. Journal of Power Sources. 2020;480(12). doi:10.1016/j.jpowsour.2020.228803 apa: Varzi, A., Thanner, K., Scipioni, R., Di Lecce, D., Hassoun, J., Dörfler, S., … Freunberger, S. A. (2020). Current status and future perspectives of lithium metal batteries. Journal of Power Sources. Elsevier. https://doi.org/10.1016/j.jpowsour.2020.228803 chicago: Varzi, Alberto, Katharina Thanner, Roberto Scipioni, Daniele Di Lecce, Jusef Hassoun, Susanne Dörfler, Holger Altheus, Stefan Kaskel, Christian Prehal, and Stefan Alexander Freunberger. “Current Status and Future Perspectives of Lithium Metal Batteries.” Journal of Power Sources. Elsevier, 2020. https://doi.org/10.1016/j.jpowsour.2020.228803. ieee: A. Varzi et al., “Current status and future perspectives of lithium metal batteries,” Journal of Power Sources, vol. 480, no. 12. Elsevier, 2020. ista: Varzi A, Thanner K, Scipioni R, Di Lecce D, Hassoun J, Dörfler S, Altheus H, Kaskel S, Prehal C, Freunberger SA. 2020. Current status and future perspectives of lithium metal batteries. Journal of Power Sources. 480(12), 228803. mla: Varzi, Alberto, et al. “Current Status and Future Perspectives of Lithium Metal Batteries.” Journal of Power Sources, vol. 480, no. 12, 228803, Elsevier, 2020, doi:10.1016/j.jpowsour.2020.228803. short: A. Varzi, K. Thanner, R. Scipioni, D. Di Lecce, J. Hassoun, S. Dörfler, H. Altheus, S. Kaskel, C. Prehal, S.A. Freunberger, Journal of Power Sources 480 (2020). date_created: 2020-09-10T10:48:40Z date_published: 2020-12-31T00:00:00Z date_updated: 2026-06-18T19:33:06Z day: '31' ddc: - '540' department: - _id: StFr doi: 10.1016/j.jpowsour.2020.228803 external_id: isi: - '000593857300001' intvolume: ' 480' isi: 1 issue: '12' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1016/j.jpowsour.2020.228803 month: '12' oa: 1 oa_version: Published Version publication: Journal of Power Sources publication_identifier: issn: - 0378-7753 publication_status: published publisher: Elsevier quality_controlled: '1' related_material: record: - id: '8067' relation: earlier_version status: public scopus_import: '1' status: public title: Current status and future perspectives of lithium metal batteries type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 480 year: '2020' ... --- 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' 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: '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 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' ... --- _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 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' ...