[{"author":[{"full_name":"Guseinov, Ruslan","orcid":"0000-0001-9819-5077","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","first_name":"Ruslan","last_name":"Guseinov"}],"project":[{"call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767"}],"language":[{"iso":"eng"}],"page":"118","citation":{"ista":"Guseinov R. 2020. Computational design of curved thin shells: From glass façades to programmable matter. Institute of Science and Technology Austria.","chicago":"Guseinov, Ruslan. “Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8366\">https://doi.org/10.15479/AT:ISTA:8366</a>.","apa":"Guseinov, R. (2020). <i>Computational design of curved thin shells: From glass façades to programmable matter</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8366\">https://doi.org/10.15479/AT:ISTA:8366</a>","ama":"Guseinov R. Computational design of curved thin shells: From glass façades to programmable matter. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8366\">10.15479/AT:ISTA:8366</a>","short":"R. Guseinov, Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter, Institute of Science and Technology Austria, 2020.","mla":"Guseinov, Ruslan. <i>Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8366\">10.15479/AT:ISTA:8366</a>.","ieee":"R. Guseinov, “Computational design of curved thin shells: From glass façades to programmable matter,” Institute of Science and Technology Austria, 2020."},"article_processing_charge":"No","oa":1,"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.","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-010-7"]},"month":"09","OA_place":"publisher","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."}],"has_accepted_license":"1","title":"Computational design of curved thin shells: From glass façades to programmable matter","publication_status":"published","corr_author":"1","ec_funded":1,"day":"21","degree_awarded":"PhD","status":"public","date_published":"2020-09-21T00:00:00Z","date_created":"2020-09-10T16:19:55Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","keyword":["computer-aided design","shape modeling","self-morphing","mechanical engineering"],"type":"dissertation","publisher":"Institute of Science and Technology Austria","ddc":["000"],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"ScienComp"}],"year":"2020","file_date_updated":"2020-09-16T15:11:01Z","oa_version":"Published Version","alternative_title":["ISTA Thesis"],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","date_created":"2020-09-10T16:11:49Z","date_updated":"2020-09-10T16:11:49Z","access_level":"open_access","checksum":"f8da89553da36037296b0a80f14ebf50","file_id":"8367","file_size":70950442,"file_name":"thesis_rguseinov.pdf","creator":"rguseino"},{"content_type":"application/x-zip-compressed","date_created":"2020-09-11T09:39:48Z","relation":"source_file","creator":"rguseino","file_id":"8374","file_name":"thesis_source.zip","file_size":76207597,"checksum":"e8fd944c960c20e0e27e6548af69121d","date_updated":"2020-09-16T15:11:01Z","access_level":"closed"}],"_id":"8366","supervisor":[{"last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd"}],"doi":"10.15479/AT:ISTA:8366","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"8562"},{"status":"public","id":"8375","relation":"research_data"},{"status":"deleted","relation":"research_data","id":"7151"},{"status":"public","relation":"part_of_dissertation","id":"1001"},{"status":"public","relation":"part_of_dissertation","id":"7262"}]},"date_updated":"2026-04-08T07:25:22Z","department":[{"_id":"BeBi"}]},{"type":"research_data","publisher":"Institute of Science and Technology Austria","ddc":["000"],"year":"2020","month":"09","author":[{"full_name":"Guseinov, Ruslan","orcid":"0000-0001-9819-5077","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","first_name":"Ruslan","last_name":"Guseinov"}],"project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767"}],"status":"public","citation":{"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.","mla":"Guseinov, Ruslan. <i>Supplementary Data for “Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter.”</i> Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8375\">10.15479/AT:ISTA:8375</a>.","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. <a href=\"https://doi.org/10.15479/AT:ISTA:8375\">https://doi.org/10.15479/AT:ISTA:8375</a>","ama":"Guseinov R. Supplementary data for “Computational design of curved thin shells: from glass façades to programmable matter.” 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8375\">10.15479/AT:ISTA:8375</a>","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. <a href=\"https://doi.org/10.15479/AT:ISTA:8375\">https://doi.org/10.15479/AT:ISTA:8375</a>.","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, <a href=\"https://doi.org/10.15479/AT:ISTA:8375\">10.15479/AT:ISTA:8375</a>.","short":"R. Guseinov, (2020)."},"contributor":[{"last_name":"Guseinov","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","first_name":"Ruslan","orcid":"0000-0001-9819-5077","contributor_type":"researcher"},{"contributor_type":"researcher","first_name":"Connor","last_name":"McMahan"},{"id":"2DC83906-F248-11E8-B48F-1D18A9856A87","first_name":"Jesus","last_name":"Perez Rodriguez","contributor_type":"researcher"},{"contributor_type":"researcher","last_name":"Daraio","first_name":"Chiara"},{"last_name":"Bickel","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","contributor_type":"researcher"}],"article_processing_charge":"No","date_published":"2020-09-21T00:00:00Z","oa":1,"date_created":"2020-09-11T09:52:54Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"21","date_updated":"2026-04-08T07:25:22Z","related_material":{"record":[{"id":"8366","relation":"used_in_publication","status":"public"}]},"department":[{"_id":"BeBi"}],"file_date_updated":"2020-09-11T09:52:36Z","oa_version":"Published Version","abstract":[{"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.","lang":"eng"}],"has_accepted_license":"1","title":"Supplementary data for \"Computational design of curved thin shells: from glass façades to programmable matter\"","_id":"8375","corr_author":"1","file":[{"relation":"main_file","content_type":"video/mp4","success":1,"date_created":"2020-09-11T09:45:21Z","checksum":"4029ffd65fb82ef2366b2fc2a4908e16","date_updated":"2020-09-11T09:45:21Z","access_level":"open_access","creator":"rguseino","file_id":"8376","file_size":29214988,"file_name":"supplementary_movie_1.mp4"},{"content_type":"video/mp4","success":1,"date_created":"2020-09-11T09:45:25Z","relation":"main_file","file_id":"8377","file_size":28449475,"file_name":"supplementary_movie_2.mp4","creator":"rguseino","date_updated":"2020-09-11T09:45:25Z","access_level":"open_access","checksum":"8ed03b04d80f1a4e622cb22e6100afd8"},{"access_level":"open_access","date_updated":"2020-09-11T09:45:28Z","checksum":"ad6864afb5e694e5c52a88fba4e02eea","file_name":"supplementary_movie_3.mp4","file_size":26315853,"file_id":"8378","creator":"rguseino","relation":"main_file","date_created":"2020-09-11T09:45:28Z","success":1,"content_type":"video/mp4"},{"file_name":"supplementary_movie_4.mp4","file_size":25198755,"file_id":"8379","creator":"rguseino","access_level":"open_access","date_updated":"2020-09-11T09:45:33Z","checksum":"b079cef7871fe1afb69af0e2b099f3b1","date_created":"2020-09-11T09:45:33Z","content_type":"video/mp4","success":1,"relation":"main_file"},{"date_updated":"2020-09-11T09:45:36Z","access_level":"open_access","checksum":"9d1d48a8ed5c109a999c51b044ee523d","file_id":"8380","file_name":"supplementary_movie_5.mp4","file_size":29011354,"creator":"rguseino","relation":"main_file","content_type":"video/mp4","success":1,"date_created":"2020-09-11T09:45:36Z"},{"relation":"main_file","date_created":"2020-09-11T09:52:36Z","success":1,"content_type":"text/plain","access_level":"open_access","date_updated":"2020-09-11T09:52:36Z","checksum":"d414d0059e982d752d218756b3c3ce05","file_size":586,"file_name":"readme.txt","file_id":"8381","creator":"rguseino"}],"ec_funded":1,"doi":"10.15479/AT:ISTA:8375","tmp":{"short":"CC BY (4.0)","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)"}},{"author":[{"last_name":"Alistarh","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Aspnes","first_name":"James","full_name":"Aspnes, James"},{"full_name":"Ellen, Faith","last_name":"Ellen","first_name":"Faith"},{"full_name":"Gelashvili, Rati","last_name":"Gelashvili","first_name":"Rati"},{"full_name":"Zhu, Leqi","last_name":"Zhu","first_name":"Leqi"}],"language":[{"iso":"eng"}],"status":"public","page":"54-56","article_processing_charge":"No","isi":1,"date_published":"2020-07-31T00:00:00Z","citation":{"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.","ama":"Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. Brief Announcement: Why Extension-Based Proofs Fail. In: <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>. Association for Computing Machinery; 2020:54-56. doi:<a href=\"https://doi.org/10.1145/3382734.3405743\">10.1145/3382734.3405743</a>","apa":"Alistarh, D.-A., Aspnes, J., Ellen, F., Gelashvili, R., &#38; Zhu, L. (2020). Brief Announcement: Why Extension-Based Proofs Fail. In <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i> (pp. 54–56). Virtual, Italy: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3382734.3405743\">https://doi.org/10.1145/3382734.3405743</a>","chicago":"Alistarh, Dan-Adrian, James Aspnes, Faith Ellen, Rati Gelashvili, and Leqi Zhu. “Brief Announcement: Why Extension-Based Proofs Fail.” In <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>, 54–56. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3382734.3405743\">https://doi.org/10.1145/3382734.3405743</a>.","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.","ieee":"D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, and L. Zhu, “Brief Announcement: Why Extension-Based Proofs Fail,” in <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>, Virtual, Italy, 2020, pp. 54–56.","mla":"Alistarh, Dan-Adrian, et al. “Brief Announcement: Why Extension-Based Proofs Fail.” <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>, Association for Computing Machinery, 2020, pp. 54–56, doi:<a href=\"https://doi.org/10.1145/3382734.3405743\">10.1145/3382734.3405743</a>."},"date_created":"2020-09-13T22:01:18Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_identifier":{"isbn":["9781450375825"]},"type":"conference","publisher":"Association for Computing Machinery","conference":{"end_date":"2020-08-07","location":"Virtual, Italy","name":"PODC: Principles of Distributed Computing","start_date":"2020-08-03"},"year":"2020","month":"07","scopus_import":"1","publication":"Proceedings of the 39th Symposium on Principles of Distributed Computing","oa_version":"None","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."}],"title":"Brief Announcement: Why Extension-Based Proofs Fail","_id":"8383","publication_status":"published","doi":"10.1145/3382734.3405743","external_id":{"isi":["001436693500007"]},"day":"31","quality_controlled":"1","date_updated":"2025-09-10T10:26:32Z","department":[{"_id":"DaAl"}]},{"department":[{"_id":"ChWo"}],"external_id":{"isi":["000583700300004"]},"related_material":{"record":[{"id":"19630","relation":"dissertation_contains","status":"public"}]},"date_updated":"2026-04-16T08:29:36Z","doi":"10.1145/3386569.3392405","oa_version":"Submitted Version","file_date_updated":"2020-11-23T09:03:19Z","file":[{"checksum":"813831ca91319d794d9748c276b24578","date_updated":"2020-11-23T09:03:19Z","access_level":"open_access","creator":"dernst","file_id":"8795","file_name":"2020_soapfilm_submitted.pdf","file_size":14935529,"relation":"main_file","success":1,"content_type":"application/pdf","date_created":"2020-11-23T09:03:19Z"}],"_id":"8384","article_number":"31","acknowledged_ssus":[{"_id":"ScienComp"}],"issue":"4","ddc":["000"],"year":"2020","publisher":"Association for Computing Machinery","article_type":"original","type":"journal_article","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_created":"2020-09-13T22:01:18Z","date_published":"2020-07-08T00:00:00Z","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3386569.3392405"}],"day":"08","quality_controlled":"1","ec_funded":1,"abstract":[{"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.","lang":"eng"}],"intvolume":"        39","publication":"ACM Transactions on Graphics","publication_status":"published","title":"A model for soap film dynamics with evolving thickness","has_accepted_license":"1","scopus_import":"1","month":"07","volume":39,"publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"oa":1,"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.","project":[{"grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales"}],"language":[{"iso":"eng"}],"author":[{"last_name":"Ishida","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","first_name":"Sadashige","orcid":"0000-0002-3121-3100","full_name":"Ishida, Sadashige"},{"full_name":"Synak, Peter","last_name":"Synak","id":"331776E2-F248-11E8-B48F-1D18A9856A87","first_name":"Peter"},{"full_name":"Narita, Fumiya","first_name":"Fumiya","last_name":"Narita"},{"first_name":"Toshiya","last_name":"Hachisuka","full_name":"Hachisuka, Toshiya"},{"orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J"}],"isi":1,"citation":{"short":"S. Ishida, P. Synak, F. Narita, T. Hachisuka, C. Wojtan, ACM Transactions on Graphics 39 (2020).","ama":"Ishida S, Synak P, Narita F, Hachisuka T, Wojtan C. A model for soap film dynamics with evolving thickness. <i>ACM Transactions on Graphics</i>. 2020;39(4). doi:<a href=\"https://doi.org/10.1145/3386569.3392405\">10.1145/3386569.3392405</a>","apa":"Ishida, S., Synak, P., Narita, F., Hachisuka, T., &#38; Wojtan, C. (2020). A model for soap film dynamics with evolving thickness. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3386569.3392405\">https://doi.org/10.1145/3386569.3392405</a>","chicago":"Ishida, Sadashige, Peter Synak, Fumiya Narita, Toshiya Hachisuka, and Chris Wojtan. “A Model for Soap Film Dynamics with Evolving Thickness.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3386569.3392405\">https://doi.org/10.1145/3386569.3392405</a>.","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.” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4, 31, Association for Computing Machinery, 2020, doi:<a href=\"https://doi.org/10.1145/3386569.3392405\">10.1145/3386569.3392405</a>.","ieee":"S. Ishida, P. Synak, F. Narita, T. Hachisuka, and C. Wojtan, “A model for soap film dynamics with evolving thickness,” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4. Association for Computing Machinery, 2020."},"article_processing_charge":"No"},{"ec_funded":1,"corr_author":"1","title":"Homogenized yarn-level cloth","publication_status":"published","has_accepted_license":"1","intvolume":"        39","abstract":[{"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.","lang":"eng"}],"publication":"ACM Transactions on Graphics","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3386569.3392412"}],"quality_controlled":"1","day":"08","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.","oa":1,"article_processing_charge":"No","citation":{"short":"G. Sperl, R. Narain, C. Wojtan, ACM Transactions on Graphics 39 (2020).","ama":"Sperl G, Narain R, Wojtan C. Homogenized yarn-level cloth. <i>ACM Transactions on Graphics</i>. 2020;39(4). doi:<a href=\"https://doi.org/10.1145/3386569.3392412\">10.1145/3386569.3392412</a>","apa":"Sperl, G., Narain, R., &#38; Wojtan, C. (2020). Homogenized yarn-level cloth. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3386569.3392412\">https://doi.org/10.1145/3386569.3392412</a>","chicago":"Sperl, Georg, Rahul Narain, and Chris Wojtan. “Homogenized Yarn-Level Cloth.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3386569.3392412\">https://doi.org/10.1145/3386569.3392412</a>.","ista":"Sperl G, Narain R, Wojtan C. 2020. Homogenized yarn-level cloth. ACM Transactions on Graphics. 39(4), 48.","ieee":"G. Sperl, R. Narain, and C. Wojtan, “Homogenized yarn-level cloth,” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4. Association for Computing Machinery, 2020.","mla":"Sperl, Georg, et al. “Homogenized Yarn-Level Cloth.” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4, 48, Association for Computing Machinery, 2020, doi:<a href=\"https://doi.org/10.1145/3386569.3392412\">10.1145/3386569.3392412</a>."},"isi":1,"project":[{"grant_number":"638176","call_identifier":"H2020","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","_id":"2533E772-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"author":[{"full_name":"Sperl, Georg","first_name":"Georg","id":"4DD40360-F248-11E8-B48F-1D18A9856A87","last_name":"Sperl"},{"last_name":"Narain","first_name":"Rahul","full_name":"Narain, Rahul"},{"orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","last_name":"Wojtan","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"month":"07","scopus_import":"1","volume":39,"publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"doi":"10.1145/3386569.3392412","article_number":"48","_id":"8385","file":[{"creator":"dernst","file_id":"8794","file_name":"2020_hylc_submitted.pdf","file_size":38922662,"checksum":"cf4c1d361c3196c4bd424520a5588205","date_updated":"2020-11-23T09:01:22Z","access_level":"open_access","content_type":"application/pdf","success":1,"date_created":"2020-11-23T09:01:22Z","relation":"main_file"}],"oa_version":"Submitted Version","file_date_updated":"2020-11-23T09:01:22Z","department":[{"_id":"ChWo"}],"related_material":{"record":[{"relation":"dissertation_contains","id":"12358","status":"public"}]},"date_updated":"2026-04-16T08:31:55Z","external_id":{"isi":["000583700300021"]},"date_created":"2020-09-13T22:01:18Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_published":"2020-07-08T00:00:00Z","status":"public","year":"2020","issue":"4","acknowledged_ssus":[{"_id":"ScienComp"}],"ddc":["000"],"publisher":"Association for Computing Machinery","type":"journal_article","article_type":"original"},{"degree_awarded":"PhD","day":"14","ec_funded":1,"OA_place":"publisher","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."}],"has_accepted_license":"1","publication_status":"published","corr_author":"1","title":"Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability","month":"09","publication_identifier":{"issn":["2663-337X"]},"oa":1,"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.","author":[{"first_name":"Ran","id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87","last_name":"Zhang","full_name":"Zhang, Ran","orcid":"0000-0002-3808-281X"}],"project":[{"grant_number":"642841","_id":"2508E324-B435-11E9-9278-68D0E5697425","name":"Distributed 3D Object Design","call_identifier":"H2020"},{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767"}],"language":[{"iso":"eng"}],"page":"148","citation":{"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. <a href=\"https://doi.org/10.15479/AT:ISTA:8386\">https://doi.org/10.15479/AT:ISTA:8386</a>.","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.","ama":"Zhang R. Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8386\">10.15479/AT:ISTA:8386</a>","apa":"Zhang, R. (2020). <i>Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8386\">https://doi.org/10.15479/AT:ISTA:8386</a>","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.","mla":"Zhang, Ran. <i>Structure-Aware Computational Design and Its Application to 3D Printable Volume Scattering, Mechanism, and Multistability</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8386\">10.15479/AT:ISTA:8386</a>.","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."},"article_processing_charge":"No","department":[{"_id":"BeBi"}],"related_material":{"record":[{"id":"486","relation":"part_of_dissertation","status":"public"},{"id":"1002","relation":"part_of_dissertation","status":"public"}]},"date_updated":"2026-04-16T10:06:31Z","supervisor":[{"orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd"}],"doi":"10.15479/AT:ISTA:8386","file_date_updated":"2020-09-15T12:51:53Z","oa_version":"Published Version","alternative_title":["ISTA Thesis"],"file":[{"checksum":"edcf578b6e1c9b0dd81ff72d319b66ba","date_updated":"2020-09-14T12:18:43Z","access_level":"closed","creator":"rzhang","file_id":"8388","file_name":"Thesis_Ran.zip","file_size":1245800191,"relation":"source_file","content_type":"application/x-zip-compressed","date_created":"2020-09-14T01:02:59Z"},{"date_created":"2020-09-15T12:51:53Z","success":1,"content_type":"application/pdf","relation":"main_file","file_name":"PhD_thesis_Ran Zhang_20200915.pdf","file_size":161385316,"file_id":"8396","creator":"rzhang","access_level":"open_access","date_updated":"2020-09-15T12:51:53Z","checksum":"817e20c33be9247f906925517c56a40d"}],"_id":"8386","ddc":["003"],"acknowledged_ssus":[{"_id":"SSU"}],"year":"2020","type":"dissertation","publisher":"Institute of Science and Technology Austria","date_created":"2020-09-14T01:04:53Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","status":"public","date_published":"2020-09-14T00:00:00Z"},{"degree_awarded":"PhD","day":"14","corr_author":"1","title":"Leveraging structure in Computer Vision tasks for flexible Deep Learning models","publication_status":"published","has_accepted_license":"1","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. "}],"OA_place":"publisher","month":"09","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-007-7"]},"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.","oa":1,"citation":{"short":"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.","chicago":"Royer, Amélie. “Leveraging Structure in Computer Vision Tasks for Flexible Deep Learning Models.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8390\">https://doi.org/10.15479/AT:ISTA:8390</a>.","ama":"Royer A. Leveraging structure in Computer Vision tasks for flexible Deep Learning models. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8390\">10.15479/AT:ISTA:8390</a>","apa":"Royer, A. (2020). <i>Leveraging structure in Computer Vision tasks for flexible Deep Learning models</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8390\">https://doi.org/10.15479/AT:ISTA:8390</a>","mla":"Royer, Amélie. <i>Leveraging Structure in Computer Vision Tasks for Flexible Deep Learning Models</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8390\">10.15479/AT:ISTA:8390</a>.","ieee":"A. Royer, “Leveraging structure in Computer Vision tasks for flexible Deep Learning models,” Institute of Science and Technology Austria, 2020."},"article_processing_charge":"No","page":"197","language":[{"iso":"eng"}],"author":[{"full_name":"Royer, Amélie","orcid":"0000-0002-8407-0705","first_name":"Amélie","id":"3811D890-F248-11E8-B48F-1D18A9856A87","last_name":"Royer"}],"department":[{"_id":"ChLa"}],"date_updated":"2026-04-08T07:26:44Z","related_material":{"record":[{"id":"7936","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"8092","relation":"part_of_dissertation"},{"status":"public","id":"911","relation":"part_of_dissertation"},{"id":"8193","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"7937","relation":"part_of_dissertation"}]},"doi":"10.15479/AT:ISTA:8390","tmp":{"image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)","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)"},"supervisor":[{"last_name":"Lampert","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"file":[{"file_id":"8391","file_size":30224591,"file_name":"2020_Thesis_Royer.pdf","creator":"dernst","date_updated":"2020-09-14T13:39:14Z","access_level":"open_access","checksum":"c914d2f88846032f3d8507734861b6ee","success":1,"content_type":"application/pdf","date_created":"2020-09-14T13:39:14Z","relation":"main_file"},{"content_type":"application/x-zip-compressed","date_created":"2020-09-14T13:39:17Z","relation":"main_file","creator":"dernst","file_id":"8392","file_name":"thesis_sources.zip","file_size":74227627,"checksum":"ae98fb35d912cff84a89035ae5794d3c","date_updated":"2020-09-14T13:39:17Z","access_level":"closed"}],"_id":"8390","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","file_date_updated":"2020-09-14T13:39:17Z","year":"2020","acknowledged_ssus":[{"_id":"CampIT"},{"_id":"ScienComp"}],"ddc":["000"],"publisher":"Institute of Science and Technology Austria","type":"dissertation","date_created":"2020-09-14T13:42:09Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_published":"2020-09-14T00:00:00Z","status":"public"},{"oa":1,"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.","arxiv":1,"project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen"},{"last_name":"Jecker","first_name":"Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","full_name":"Jecker, Ismael R"},{"last_name":"Svoboda","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","first_name":"Jakub","orcid":"0000-0002-1419-3267","full_name":"Svoboda, Jakub"}],"article_processing_charge":"No","citation":{"ama":"Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. Simplified game of life: Algorithms and complexity. In: <i>45th International Symposium on Mathematical Foundations of Computer Science</i>. Vol 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.22\">10.4230/LIPIcs.MFCS.2020.22</a>","apa":"Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., &#38; Svoboda, J. (2020). Simplified game of life: Algorithms and complexity. In <i>45th International Symposium on Mathematical Foundations of Computer Science</i> (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.22\">https://doi.org/10.4230/LIPIcs.MFCS.2020.22</a>","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Simplified Game of Life: Algorithms and Complexity.” In <i>45th International Symposium on Mathematical Foundations of Computer Science</i>, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.22\">https://doi.org/10.4230/LIPIcs.MFCS.2020.22</a>.","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.","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.","mla":"Chatterjee, Krishnendu, et al. “Simplified Game of Life: Algorithms and Complexity.” <i>45th International Symposium on Mathematical Foundations of Computer Science</i>, vol. 170, 22:1-22:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.22\">10.4230/LIPIcs.MFCS.2020.22</a>.","ieee":"K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Simplified game of life: Algorithms and complexity,” in <i>45th International Symposium on Mathematical Foundations of Computer Science</i>, Prague, Czech Republic, 2020, vol. 170."},"scopus_import":"1","month":"08","volume":170,"publication_identifier":{"isbn":["9783959771597"],"issn":["1868-8969"]},"ec_funded":1,"intvolume":"       170","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."}],"publication":"45th International Symposium on Mathematical Foundations of Computer Science","title":"Simplified game of life: Algorithms and complexity","publication_status":"published","has_accepted_license":"1","day":"18","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2020-09-20T22:01:36Z","date_published":"2020-08-18T00:00:00Z","status":"public","ddc":["000"],"license":"https://creativecommons.org/licenses/by/3.0/","conference":{"end_date":"2020-08-28","location":"Prague, Czech Republic","name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2020-08-24"},"year":"2020","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","doi":"10.4230/LIPIcs.MFCS.2020.22","tmp":{"name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png","short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"oa_version":"Published Version","file_date_updated":"2020-09-21T13:57:34Z","file":[{"relation":"main_file","content_type":"application/pdf","success":1,"date_created":"2020-09-21T13:57:34Z","checksum":"bbd7c4f55d45f2ff2a0a4ef0e10a77b1","date_updated":"2020-09-21T13:57:34Z","access_level":"open_access","creator":"dernst","file_id":"8550","file_name":"2020_LIPIcs_Chatterjee.pdf","file_size":491374}],"_id":"8533","article_number":"22:1-22:13","alternative_title":["LIPIcs"],"department":[{"_id":"KrCh"}],"external_id":{"arxiv":["2007.02894"]},"date_updated":"2025-07-10T11:57:06Z"},{"article_processing_charge":"No","citation":{"chicago":"Jecker, Ismael R, Orna Kupferman, and Nicolas Mazzocchi. “Unary Prime Languages.” In <i>45th International Symposium on Mathematical Foundations of Computer Science</i>, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.51\">https://doi.org/10.4230/LIPIcs.MFCS.2020.51</a>.","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.","ama":"Jecker IR, Kupferman O, Mazzocchi N. Unary prime languages. In: <i>45th International Symposium on Mathematical Foundations of Computer Science</i>. Vol 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.51\">10.4230/LIPIcs.MFCS.2020.51</a>","apa":"Jecker, I. R., Kupferman, O., &#38; Mazzocchi, N. (2020). Unary prime languages. In <i>45th International Symposium on Mathematical Foundations of Computer Science</i> (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.51\">https://doi.org/10.4230/LIPIcs.MFCS.2020.51</a>","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.","ieee":"I. R. Jecker, O. Kupferman, and N. Mazzocchi, “Unary prime languages,” in <i>45th International Symposium on Mathematical Foundations of Computer Science</i>, Prague, Czech Republic, 2020, vol. 170.","mla":"Jecker, Ismael R., et al. “Unary Prime Languages.” <i>45th International Symposium on Mathematical Foundations of Computer Science</i>, vol. 170, 51:1-51:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.51\">10.4230/LIPIcs.MFCS.2020.51</a>."},"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411"}],"language":[{"iso":"eng"}],"author":[{"id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R","last_name":"Jecker","full_name":"Jecker, Ismael R"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"},{"full_name":"Mazzocchi, Nicolas","first_name":"Nicolas","last_name":"Mazzocchi"}],"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.","oa":1,"publication_identifier":{"isbn":["9783959771597"],"issn":["1868-8969"]},"month":"08","scopus_import":"1","volume":170,"publication_status":"published","title":"Unary prime languages","corr_author":"1","has_accepted_license":"1","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."}],"intvolume":"       170","publication":"45th International Symposium on Mathematical Foundations of Computer Science","ec_funded":1,"quality_controlled":"1","day":"18","date_published":"2020-08-18T00:00:00Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2020-09-20T22:01:36Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","year":"2020","conference":{"start_date":"2020-08-24","name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2020-08-28","location":"Prague, Czech Republic"},"ddc":["000"],"_id":"8534","article_number":"51:1-51:12","file":[{"date_created":"2020-09-21T14:17:08Z","success":1,"content_type":"application/pdf","relation":"main_file","file_size":597977,"file_name":"2020_LIPIcsMFCS_Jecker.pdf","file_id":"8552","creator":"dernst","access_level":"open_access","date_updated":"2020-09-21T14:17:08Z","checksum":"2dc9e2fad6becd4563aef3e27a473f70"}],"alternative_title":["LIPIcs"],"oa_version":"Published Version","file_date_updated":"2020-09-21T14:17:08Z","tmp":{"name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png","short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"doi":"10.4230/LIPIcs.MFCS.2020.51","date_updated":"2025-07-10T11:57:07Z","department":[{"_id":"KrCh"}]},{"type":"journal_article","article_type":"original","publisher":"Association for Computing Machinery","year":"2020","ddc":["000"],"issue":"4","acknowledged_ssus":[{"_id":"ScienComp"}],"status":"public","date_published":"2020-07-08T00:00:00Z","date_created":"2020-09-20T22:01:37Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_updated":"2026-04-16T08:26:38Z","external_id":{"isi":["000583700300038"]},"department":[{"_id":"ChWo"}],"_id":"8535","article_number":"65","file":[{"access_level":"open_access","date_updated":"2020-09-21T07:51:44Z","checksum":"c3a680893f01cc4a9e961ff0a4cfa12f","file_name":"2020_ACM_Skrivan.pdf","file_size":20223953,"file_id":"8541","creator":"dernst","relation":"main_file","date_created":"2020-09-21T07:51:44Z","success":1,"content_type":"application/pdf"}],"file_date_updated":"2020-09-21T07:51:44Z","oa_version":"Published Version","doi":"10.1145/3386569.3392466","publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"volume":39,"scopus_import":"1","month":"07","isi":1,"article_processing_charge":"No","citation":{"short":"T. Skrivan, A. Soderstrom, J. Johansson, C. Sprenger, K. Museth, C. Wojtan, ACM Transactions on Graphics 39 (2020).","chicago":"Skrivan, Tomas, Andreas Soderstrom, John Johansson, Christoph Sprenger, Ken Museth, and Chris Wojtan. “Wave Curves: Simulating Lagrangian Water Waves on Dynamically Deforming Surfaces.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3386569.3392466\">https://doi.org/10.1145/3386569.3392466</a>.","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.","apa":"Skrivan, T., Soderstrom, A., Johansson, J., Sprenger, C., Museth, K., &#38; Wojtan, C. (2020). Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3386569.3392466\">https://doi.org/10.1145/3386569.3392466</a>","ama":"Skrivan T, Soderstrom A, Johansson J, Sprenger C, Museth K, Wojtan C. Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces. <i>ACM Transactions on Graphics</i>. 2020;39(4). doi:<a href=\"https://doi.org/10.1145/3386569.3392466\">10.1145/3386569.3392466</a>","mla":"Skrivan, Tomas, et al. “Wave Curves: Simulating Lagrangian Water Waves on Dynamically Deforming Surfaces.” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4, 65, Association for Computing Machinery, 2020, doi:<a href=\"https://doi.org/10.1145/3386569.3392466\">10.1145/3386569.3392466</a>.","ieee":"T. Skrivan, A. Soderstrom, J. Johansson, C. Sprenger, K. Museth, and C. Wojtan, “Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces,” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4. Association for Computing Machinery, 2020."},"author":[{"full_name":"Skrivan, Tomas","last_name":"Skrivan","id":"486A5A46-F248-11E8-B48F-1D18A9856A87","first_name":"Tomas"},{"first_name":"Andreas","last_name":"Soderstrom","full_name":"Soderstrom, Andreas"},{"full_name":"Johansson, John","first_name":"John","last_name":"Johansson"},{"last_name":"Sprenger","first_name":"Christoph","full_name":"Sprenger, Christoph"},{"first_name":"Ken","last_name":"Museth","full_name":"Museth, Ken"},{"full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan"}],"language":[{"iso":"eng"}],"project":[{"_id":"2533E772-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","grant_number":"638176"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"}],"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.","oa":1,"quality_controlled":"1","day":"08","has_accepted_license":"1","title":"Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces","corr_author":"1","publication_status":"published","publication":"ACM Transactions on Graphics","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."}],"intvolume":"        39","ec_funded":1},{"doi":"10.1109/ISIT44484.2020.9174141","_id":"8536","article_number":"401-406","oa_version":"Preprint","department":[{"_id":"MaMo"}],"related_material":{"record":[{"status":"public","id":"9047","relation":"later_version"}]},"date_updated":"2025-09-10T10:27:05Z","external_id":{"arxiv":["1909.04892"],"isi":["000714963400069"]},"date_created":"2020-09-20T22:01:37Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_published":"2020-06-01T00:00:00Z","status":"public","year":"2020","conference":{"location":"Los Angeles, CA, United States","end_date":"2020-06-26","name":"ISIT: International Symposium on Information Theory","start_date":"2020-06-21"},"publisher":"IEEE","type":"conference","publication_status":"published","title":"Simplified successive cancellation decoding of polar codes has sublinear latency","abstract":[{"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.","lang":"eng"}],"publication":"IEEE International Symposium on Information Theory - Proceedings","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1909.04892"}],"quality_controlled":"1","day":"01","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.","arxiv":1,"oa":1,"citation":{"short":"M. Mondelli, S.A. Hashemi, J. Cioffi, A. Goldsmith, in:, IEEE International Symposium on Information Theory - Proceedings, IEEE, 2020.","apa":"Mondelli, M., Hashemi, S. A., Cioffi, J., &#38; Goldsmith, A. (2020). Simplified successive cancellation decoding of polar codes has sublinear latency. In <i>IEEE International Symposium on Information Theory - Proceedings</i> (Vol. 2020–June). Los Angeles, CA, United States: IEEE. <a href=\"https://doi.org/10.1109/ISIT44484.2020.9174141\">https://doi.org/10.1109/ISIT44484.2020.9174141</a>","ama":"Mondelli M, Hashemi SA, Cioffi J, Goldsmith A. Simplified successive cancellation decoding of polar codes has sublinear latency. In: <i>IEEE International Symposium on Information Theory - Proceedings</i>. Vol 2020-June. IEEE; 2020. doi:<a href=\"https://doi.org/10.1109/ISIT44484.2020.9174141\">10.1109/ISIT44484.2020.9174141</a>","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.","chicago":"Mondelli, Marco, Seyyed Ali Hashemi, John Cioffi, and Andrea Goldsmith. “Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency.” In <i>IEEE International Symposium on Information Theory - Proceedings</i>, Vol. 2020–June. IEEE, 2020. <a href=\"https://doi.org/10.1109/ISIT44484.2020.9174141\">https://doi.org/10.1109/ISIT44484.2020.9174141</a>.","ieee":"M. Mondelli, S. A. Hashemi, J. Cioffi, and A. Goldsmith, “Simplified successive cancellation decoding of polar codes has sublinear latency,” in <i>IEEE International Symposium on Information Theory - Proceedings</i>, Los Angeles, CA, United States, 2020, vol. 2020–June.","mla":"Mondelli, Marco, et al. “Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency.” <i>IEEE International Symposium on Information Theory - Proceedings</i>, vol. 2020–June, 401–406, IEEE, 2020, doi:<a href=\"https://doi.org/10.1109/ISIT44484.2020.9174141\">10.1109/ISIT44484.2020.9174141</a>."},"isi":1,"article_processing_charge":"No","language":[{"iso":"eng"}],"author":[{"full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli"},{"full_name":"Hashemi, Seyyed Ali","last_name":"Hashemi","first_name":"Seyyed Ali"},{"full_name":"Cioffi, John","last_name":"Cioffi","first_name":"John"},{"full_name":"Goldsmith, Andrea","first_name":"Andrea","last_name":"Goldsmith"}],"scopus_import":"1","month":"06","volume":"2020-June","publication_identifier":{"isbn":["9781728164328"],"issn":["2157-8095"]}},{"publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"month":"11","scopus_import":"1","volume":39,"project":[{"grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020"}],"language":[{"iso":"eng"}],"author":[{"last_name":"Gavriil","first_name":"Konstantinos","full_name":"Gavriil, Konstantinos"},{"orcid":"0000-0001-9819-5077","full_name":"Guseinov, Ruslan","last_name":"Guseinov","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","first_name":"Ruslan"},{"full_name":"Perez Rodriguez, Jesus","first_name":"Jesus","id":"2DC83906-F248-11E8-B48F-1D18A9856A87","last_name":"Perez Rodriguez"},{"full_name":"Pellis, Davide","last_name":"Pellis","first_name":"Davide"},{"first_name":"Paul M","id":"13C09E74-18D9-11E9-8878-32CFE5697425","last_name":"Henderson","full_name":"Henderson, Paul M","orcid":"0000-0002-5198-7445"},{"full_name":"Rist, Florian","last_name":"Rist","first_name":"Florian"},{"first_name":"Helmut","last_name":"Pottmann","full_name":"Pottmann, Helmut"},{"last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd"}],"citation":{"short":"K. Gavriil, R. Guseinov, J. Perez Rodriguez, D. Pellis, P.M. Henderson, F. Rist, H. Pottmann, B. Bickel, ACM Transactions on Graphics 39 (2020).","chicago":"Gavriil, Konstantinos, Ruslan Guseinov, Jesus Perez Rodriguez, Davide Pellis, Paul M Henderson, Florian Rist, Helmut Pottmann, and Bernd Bickel. “Computational Design of Cold Bent Glass Façades.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3414685.3417843\">https://doi.org/10.1145/3414685.3417843</a>.","ista":"Gavriil K, Guseinov R, Perez Rodriguez J, Pellis D, Henderson PM, Rist F, Pottmann H, Bickel B. 2020. Computational design of cold bent glass façades. ACM Transactions on Graphics. 39(6), 208.","ama":"Gavriil K, Guseinov R, Perez Rodriguez J, et al. Computational design of cold bent glass façades. <i>ACM Transactions on Graphics</i>. 2020;39(6). doi:<a href=\"https://doi.org/10.1145/3414685.3417843\">10.1145/3414685.3417843</a>","apa":"Gavriil, K., Guseinov, R., Perez Rodriguez, J., Pellis, D., Henderson, P. M., Rist, F., … Bickel, B. (2020). Computational design of cold bent glass façades. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3414685.3417843\">https://doi.org/10.1145/3414685.3417843</a>","ieee":"K. Gavriil <i>et al.</i>, “Computational design of cold bent glass façades,” <i>ACM Transactions on Graphics</i>, vol. 39, no. 6. Association for Computing Machinery, 2020.","mla":"Gavriil, Konstantinos, et al. “Computational Design of Cold Bent Glass Façades.” <i>ACM Transactions on Graphics</i>, vol. 39, no. 6, 208, Association for Computing Machinery, 2020, doi:<a href=\"https://doi.org/10.1145/3414685.3417843\">10.1145/3414685.3417843</a>."},"isi":1,"article_processing_charge":"No","oa":1,"acknowledgement":"We thank IST Austria’s Scientific Computing team for their support, Corinna Datsiou and Sophie Pennetier for their expert input on the practical applications of cold bent glass, and Zaha Hadid Architects and Waagner Biro for providing the architectural datasets. Photo of Fondation Louis Vuitton by Francisco Anzola / CC BY 2.0 / cropped.\r\nPhoto of Opus by Danica O. Kus. This project has received funding from the European Union’s\r\nHorizon 2020 research and innovation program under grant agreement No 675789 - Algebraic Representations in Computer-Aided Design for complEx Shapes (ARCADES), from the European Research Council (ERC) under grant agreement No 715767 - MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling, and SFB-Transregio “Discretization in Geometry and Dynamics” through grant I 2978 of the Austrian Science Fund (FWF). F. Rist and K. Gavriil have been partially supported by KAUST baseline funding.","arxiv":1,"day":"26","quality_controlled":"1","abstract":[{"lang":"eng","text":"Cold bent glass is a promising and cost-efficient method for realizing doubly curved glass facades. They are produced by attaching planar glass sheets to curved frames and require keeping the occurring stress within safe limits.\r\nHowever, it is very challenging to navigate the design space of cold bent glass panels due to the fragility of the material, which impedes the form-finding for practically feasible and aesthetically pleasing cold bent glass facades. We propose an interactive, data-driven approach for designing cold bent glass facades that can be seamlessly integrated into a typical architectural design pipeline. Our method allows non-expert users to interactively edit a parametric surface while providing real-time feedback on the deformed shape and maximum stress of cold bent glass panels. Designs are automatically refined to minimize several fairness criteria while maximal stresses are kept within glass limits. We achieve interactive frame rates by using a differentiable Mixture Density Network trained from more than a million simulations. Given a curved boundary, our regression model is capable of handling multistable\r\nconfigurations and accurately predicting the equilibrium shape of the panel and its corresponding maximal stress. We show predictions are highly accurate and validate our results with a physical realization of a cold bent glass surface."}],"intvolume":"        39","publication":"ACM Transactions on Graphics","publication_status":"published","corr_author":"1","title":"Computational design of cold bent glass façades","has_accepted_license":"1","ec_funded":1,"publisher":"Association for Computing Machinery","type":"journal_article","article_type":"original","acknowledged_ssus":[{"_id":"ScienComp"}],"issue":"6","ddc":["000"],"year":"2020","date_published":"2020-11-26T00:00:00Z","status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_created":"2020-09-23T11:30:02Z","external_id":{"arxiv":["2009.03667"],"isi":["000595589100048"]},"related_material":{"record":[{"id":"8761","relation":"research_data","status":"public"},{"status":"public","id":"8366","relation":"dissertation_contains"}],"link":[{"url":"https://ist.ac.at/en/news/bend-dont-break/","description":"News on IST Homepage","relation":"press_release"}]},"date_updated":"2026-04-08T07:25:22Z","department":[{"_id":"BeBi"}],"oa_version":"Submitted Version","file_date_updated":"2023-05-23T20:54:43Z","_id":"8562","article_number":"208","file":[{"relation":"main_file","date_created":"2023-05-23T20:54:43Z","content_type":"application/pdf","success":1,"access_level":"open_access","date_updated":"2023-05-23T20:54:43Z","checksum":"c7f67717ad74e670b7daeae732abe151","file_size":28964641,"file_name":"coldglass.pdf","file_id":"13084","creator":"bbickel"}],"doi":"10.1145/3414685.3417843"},{"department":[{"_id":"JoCs"}],"day":"19","date_updated":"2026-04-07T08:37:11Z","related_material":{"record":[{"status":"public","id":"8740","relation":"used_in_publication"}]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"doi":"10.15479/AT:ISTA:8563","abstract":[{"text":"Supplementary data  provided for the provided for the publication:\r\nIgor Gridchyn , Philipp Schoenenberger , Joseph O'Neill , Jozsef Csicsvari (2020) Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior. Elife.","lang":"eng"}],"oa_version":"Published Version","file_date_updated":"2020-10-19T10:12:29Z","_id":"8563","file":[{"relation":"main_file","date_created":"2020-09-23T14:36:17Z","success":1,"content_type":"application/x-compressed","checksum":"a16098a6d172f9c42ab5af5f6991668c","access_level":"open_access","date_updated":"2020-09-23T14:36:17Z","creator":"jozsef","file_name":"upload.tgz","file_size":145243906,"file_id":"8564"},{"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","success":1,"date_created":"2020-10-19T10:12:29Z","relation":"main_file","creator":"jozsef","file_id":"8675","file_size":11648,"file_name":"redme.docx","checksum":"0bfc54b7e14c0694cd081617318ba606","date_updated":"2020-10-19T10:12:29Z","access_level":"open_access"}],"title":"Optogenetic alteration of hippocampal network activity","corr_author":"1","has_accepted_license":"1","ddc":["570"],"month":"10","year":"2020","publisher":"Institute of Science and Technology Austria","type":"research_data","date_created":"2020-09-23T14:39:54Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"author":[{"full_name":"Csicsvari, Jozsef L","orcid":"0000-0002-5193-4036","first_name":"Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","last_name":"Csicsvari"},{"last_name":"Gridchyn","id":"4B60654C-F248-11E8-B48F-1D18A9856A87","first_name":"Igor","orcid":"0000-0002-1807-1929","full_name":"Gridchyn, Igor"},{"full_name":"Schönenberger, Philipp","last_name":"Schönenberger","id":"3B9D816C-F248-11E8-B48F-1D18A9856A87","first_name":"Philipp"}],"citation":{"ieee":"J. L. Csicsvari, I. Gridchyn, and P. Schönenberger, “Optogenetic alteration of hippocampal network activity.” Institute of Science and Technology Austria, 2020.","mla":"Csicsvari, Jozsef L., et al. <i>Optogenetic Alteration of Hippocampal Network Activity</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8563\">10.15479/AT:ISTA:8563</a>.","short":"J.L. Csicsvari, I. Gridchyn, P. Schönenberger, (2020).","ama":"Csicsvari JL, Gridchyn I, Schönenberger P. Optogenetic alteration of hippocampal network activity. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8563\">10.15479/AT:ISTA:8563</a>","apa":"Csicsvari, J. L., Gridchyn, I., &#38; Schönenberger, P. (2020). Optogenetic alteration of hippocampal network activity. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8563\">https://doi.org/10.15479/AT:ISTA:8563</a>","ista":"Csicsvari JL, Gridchyn I, Schönenberger P. 2020. Optogenetic alteration of hippocampal network activity, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:8563\">10.15479/AT:ISTA:8563</a>.","chicago":"Csicsvari, Jozsef L, Igor Gridchyn, and Philipp Schönenberger. “Optogenetic Alteration of Hippocampal Network Activity.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8563\">https://doi.org/10.15479/AT:ISTA:8563</a>."},"contributor":[{"orcid":"0000-0002-5193-4036","contributor_type":"project_leader","last_name":"Csicsvari","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L"}],"article_processing_charge":"No","date_published":"2020-10-19T00:00:00Z","status":"public"},{"quality_controlled":"1","day":"24","has_accepted_license":"1","corr_author":"1","title":"Persistent and reversible solid iodine electrodeposition in nanoporous carbons","publication_status":"published","publication":"Nature Communications","intvolume":"        11","abstract":[{"lang":"eng","text":"Aqueous iodine based electrochemical energy storage is considered a potential candidate to improve sustainability and performance of current battery and supercapacitor technology. It harnesses the redox activity of iodide, iodine, and polyiodide species in the confined geometry of nanoporous carbon electrodes. However, current descriptions of the electrochemical reaction mechanism to interconvert these species are elusive. Here we show that electrochemical oxidation of iodide in nanoporous carbons forms persistent solid iodine deposits. Confinement slows down dissolution into triiodide and pentaiodide, responsible for otherwise significant self-discharge via shuttling. The main tools for these insights are in situ Raman spectroscopy and in situ small and wide-angle X-ray scattering (in situ SAXS/WAXS). In situ Raman confirms the reversible formation of triiodide and pentaiodide. In situ SAXS/WAXS indicates remarkable amounts of solid iodine deposited in the carbon nanopores. Combined with stochastic modeling, in situ SAXS allows quantifying the solid iodine volume fraction and visualizing the iodine structure on 3D lattice models at the sub-nanometer scale. Based on the derived mechanism, we demonstrate strategies for improved iodine pore filling capacity and prevention of self-discharge, applicable to hybrid supercapacitors and batteries."}],"volume":11,"month":"09","scopus_import":"1","publication_identifier":{"issn":["2041-1723"]},"oa":1,"citation":{"ieee":"C. Prehal <i>et al.</i>, “Persistent and reversible solid iodine electrodeposition in nanoporous carbons,” <i>Nature Communications</i>, vol. 11. Springer Nature, 2020.","mla":"Prehal, Christian, et al. “Persistent and Reversible Solid Iodine Electrodeposition in Nanoporous Carbons.” <i>Nature Communications</i>, vol. 11, 4838, Springer Nature, 2020, doi:<a href=\"https://doi.org/10.1038/s41467-020-18610-6\">10.1038/s41467-020-18610-6</a>.","apa":"Prehal, C., Fitzek, H., Kothleitner, G., Presser, V., Gollas, B., Freunberger, S. A., &#38; Abbas, Q. (2020). Persistent and reversible solid iodine electrodeposition in nanoporous carbons. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-020-18610-6\">https://doi.org/10.1038/s41467-020-18610-6</a>","ama":"Prehal C, Fitzek H, Kothleitner G, et al. Persistent and reversible solid iodine electrodeposition in nanoporous carbons. <i>Nature Communications</i>. 2020;11. doi:<a href=\"https://doi.org/10.1038/s41467-020-18610-6\">10.1038/s41467-020-18610-6</a>","ista":"Prehal C, Fitzek H, Kothleitner G, Presser V, Gollas B, Freunberger SA, Abbas Q. 2020. Persistent and reversible solid iodine electrodeposition in nanoporous carbons. Nature Communications. 11, 4838.","chicago":"Prehal, Christian, Harald Fitzek, Gerald Kothleitner, Volker Presser, Bernhard Gollas, Stefan Alexander Freunberger, and Qamar Abbas. “Persistent and Reversible Solid Iodine Electrodeposition in Nanoporous Carbons.” <i>Nature Communications</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1038/s41467-020-18610-6\">https://doi.org/10.1038/s41467-020-18610-6</a>.","short":"C. Prehal, H. Fitzek, G. Kothleitner, V. Presser, B. Gollas, S.A. Freunberger, Q. Abbas, Nature Communications 11 (2020)."},"article_processing_charge":"No","isi":1,"author":[{"full_name":"Prehal, Christian","last_name":"Prehal","first_name":"Christian"},{"last_name":"Fitzek","first_name":"Harald","full_name":"Fitzek, Harald"},{"first_name":"Gerald","last_name":"Kothleitner","full_name":"Kothleitner, Gerald"},{"first_name":"Volker","last_name":"Presser","full_name":"Presser, Volker"},{"full_name":"Gollas, Bernhard","last_name":"Gollas","first_name":"Bernhard"},{"last_name":"Freunberger","first_name":"Stefan Alexander","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","orcid":"0000-0003-2902-5319","full_name":"Freunberger, Stefan Alexander"},{"full_name":"Abbas, Qamar","first_name":"Qamar","last_name":"Abbas"}],"language":[{"iso":"eng"}],"department":[{"_id":"StFr"}],"related_material":{"link":[{"url":"https://doi.org/10.1038/s41467-020-19720-x","relation":"erratum"}]},"date_updated":"2025-06-12T06:58:51Z","external_id":{"isi":["000573756600004"],"pmid":["32973214"]},"tmp":{"short":"CC BY (4.0)","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)"},"doi":"10.1038/s41467-020-18610-6","_id":"8568","file":[{"date_created":"2020-09-28T13:16:15Z","content_type":"application/pdf","success":1,"relation":"main_file","file_name":"2020_NatureComm_Prehal.pdf","file_size":1822469,"file_id":"8585","creator":"dernst","access_level":"open_access","date_updated":"2020-09-28T13:16:15Z","checksum":"eada7bc8dd16a49390137cff882ef328"}],"article_number":"4838","file_date_updated":"2020-09-28T13:16:15Z","oa_version":"Published Version","year":"2020","ddc":["530"],"pmid":1,"type":"journal_article","article_type":"original","publisher":"Springer Nature","keyword":["General Biochemistry","Genetics and Molecular Biology","General Physics and Astronomy","General Chemistry"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2020-09-25T07:23:13Z","status":"public","date_published":"2020-09-24T00:00:00Z"},{"publication_status":"published","title":"ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics","corr_author":"1","intvolume":"        74","abstract":[{"text":"We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2020. This year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. These tools are applied to solve reachability analysis problems on six benchmark problems, two of them featuring hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools.","lang":"eng"}],"publication":"EPiC Series in Computing","ec_funded":1,"quality_controlled":"1","day":"25","main_file_link":[{"url":"https://easychair.org/publications/download/nrdD","open_access":"1"}],"article_processing_charge":"No","citation":{"ista":"Geretti L, Alexandre Dit Sandretto J, Althoff M, Benet L, Chapoutot A, Chen X, Collins P, Forets M, Freire D, Immler F, Kochdumper N, Sanders D, Schilling C. 2020. ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 74, 49–75.","chicago":"Geretti, Luca, Julien Alexandre Dit Sandretto, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin Chen, Pieter Collins, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” In <i>EPiC Series in Computing</i>, 74:49–75. EasyChair, 2020. <a href=\"https://doi.org/10.29007/zkf6\">https://doi.org/10.29007/zkf6</a>.","apa":"Geretti, L., Alexandre Dit Sandretto, J., Althoff, M., Benet, L., Chapoutot, A., Chen, X., … Schilling, C. (2020). ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. In <i>EPiC Series in Computing</i> (Vol. 74, pp. 49–75). EasyChair. <a href=\"https://doi.org/10.29007/zkf6\">https://doi.org/10.29007/zkf6</a>","ama":"Geretti L, Alexandre Dit Sandretto J, Althoff M, et al. ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. In: <i>EPiC Series in Computing</i>. Vol 74. EasyChair; 2020:49-75. doi:<a href=\"https://doi.org/10.29007/zkf6\">10.29007/zkf6</a>","short":"L. Geretti, J. Alexandre Dit Sandretto, M. Althoff, L. Benet, A. Chapoutot, X. Chen, P. Collins, M. Forets, D. Freire, F. Immler, N. Kochdumper, D. Sanders, C. Schilling, in:, EPiC Series in Computing, EasyChair, 2020, pp. 49–75.","ieee":"L. Geretti <i>et al.</i>, “ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics,” in <i>EPiC Series in Computing</i>, 2020, vol. 74, pp. 49–75.","mla":"Geretti, Luca, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” <i>EPiC Series in Computing</i>, vol. 74, EasyChair, 2020, pp. 49–75, doi:<a href=\"https://doi.org/10.29007/zkf6\">10.29007/zkf6</a>."},"page":"49-75","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"}],"language":[{"iso":"eng"}],"author":[{"first_name":"Luca","last_name":"Geretti","full_name":"Geretti, Luca"},{"last_name":"Alexandre Dit Sandretto","first_name":"Julien","full_name":"Alexandre Dit Sandretto, Julien"},{"full_name":"Althoff, Matthias","last_name":"Althoff","first_name":"Matthias"},{"full_name":"Benet, Luis","last_name":"Benet","first_name":"Luis"},{"last_name":"Chapoutot","first_name":"Alexandre","full_name":"Chapoutot, Alexandre"},{"full_name":"Chen, Xin","last_name":"Chen","first_name":"Xin"},{"first_name":"Pieter","last_name":"Collins","full_name":"Collins, Pieter"},{"first_name":"Marcelo","last_name":"Forets","full_name":"Forets, Marcelo"},{"last_name":"Freire","first_name":"Daniel","full_name":"Freire, Daniel"},{"last_name":"Immler","first_name":"Fabian","full_name":"Immler, Fabian"},{"full_name":"Kochdumper, Niklas","last_name":"Kochdumper","first_name":"Niklas"},{"first_name":"David","last_name":"Sanders","full_name":"Sanders, David"},{"full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","last_name":"Schilling"}],"acknowledgement":"Christian Schilling acknowledges support in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award) and the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 754411.","oa":1,"month":"09","scopus_import":"1","volume":74,"_id":"8571","oa_version":"Published Version","doi":"10.29007/zkf6","date_updated":"2026-06-18T19:34:03Z","department":[{"_id":"ToHe"}],"date_published":"2020-09-25T00:00:00Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2020-09-26T14:41:29Z","publisher":"EasyChair","type":"conference","conference":{"end_date":"2020-07-12","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","start_date":"2020-07-12"},"year":"2020","ddc":["000"]},{"doi":"10.29007/7dt2","oa_version":"Published Version","_id":"8572","department":[{"_id":"ToHe"}],"date_updated":"2026-06-18T19:34:29Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2020-09-26T14:49:43Z","status":"public","date_published":"2020-09-25T00:00:00Z","ddc":["000"],"conference":{"end_date":"2020-07-12","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","start_date":"2020-07-12"},"year":"2020","type":"conference","publisher":"EasyChair","ec_funded":1,"publication":"EPiC Series in Computing","abstract":[{"text":"We present the results of the ARCH 2020 friendly competition for formal verification of continuous and hybrid systems with linear continuous dynamics. In its fourth edition, eight tools have been applied to solve eight different benchmark problems in the category for linear continuous dynamics (in alphabetical order): CORA, C2E2, HyDRA, Hylaa, Hylaa-Continuous, JuliaReach, SpaceEx, and XSpeed. This report is a snapshot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results provide one of the most complete assessments of tools for the safety verification of continuous and hybrid systems with linear continuous dynamics up to this date.","lang":"eng"}],"intvolume":"        74","publication_status":"published","title":"ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics","corr_author":"1","main_file_link":[{"open_access":"1","url":"https://easychair.org/publications/download/DRpS"}],"day":"25","quality_controlled":"1","oa":1,"acknowledgement":"The authors gratefully acknowledge financial support by the European Commission project\r\njustITSELF under grant number 817629, by the Austrian Science Fund (FWF) under grant\r\nZ211-N23 (Wittgenstein Award), by the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 754411, and by the\r\nScience and Engineering Research Board (SERB) project with file number IMP/2018/000523.\r\nThis material is based upon work supported by the Air Force Office of Scientific Research under\r\naward number FA9550-19-1-0288. Any opinions, finding, and conclusions or recommendations\r\nexpressed in this material are those of the author(s) and do not necessarily reflect the views of\r\nthe United States Air Force.","author":[{"last_name":"Althoff","first_name":"Matthias","full_name":"Althoff, Matthias"},{"full_name":"Bak, Stanley","first_name":"Stanley","last_name":"Bak"},{"last_name":"Bao","first_name":"Zongnan","full_name":"Bao, Zongnan"},{"last_name":"Forets","first_name":"Marcelo","full_name":"Forets, Marcelo"},{"full_name":"Frehse, Goran","last_name":"Frehse","first_name":"Goran"},{"full_name":"Freire, Daniel","first_name":"Daniel","last_name":"Freire"},{"last_name":"Kochdumper","first_name":"Niklas","full_name":"Kochdumper, Niklas"},{"first_name":"Yangge","last_name":"Li","full_name":"Li, Yangge"},{"full_name":"Mitra, Sayan","first_name":"Sayan","last_name":"Mitra"},{"full_name":"Ray, Rajarshi","first_name":"Rajarshi","last_name":"Ray"},{"full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065","first_name":"Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","last_name":"Schilling"},{"last_name":"Schupp","first_name":"Stefan","full_name":"Schupp, Stefan"},{"full_name":"Wetzlinger, Mark","last_name":"Wetzlinger","first_name":"Mark"}],"language":[{"iso":"eng"}],"project":[{"grant_number":"Z00312","_id":"25C5A090-B435-11E9-9278-68D0E5697425","name":"Synaptic communication in neuronal microcircuits","call_identifier":"FWF"},{"grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"page":"16-48","citation":{"mla":"Althoff, Matthias, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Linear Dynamics.” <i>EPiC Series in Computing</i>, vol. 74, EasyChair, 2020, pp. 16–48, doi:<a href=\"https://doi.org/10.29007/7dt2\">10.29007/7dt2</a>.","ieee":"M. Althoff <i>et al.</i>, “ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics,” in <i>EPiC Series in Computing</i>, 2020, vol. 74, pp. 16–48.","chicago":"Althoff, Matthias, Stanley Bak, Zongnan Bao, Marcelo Forets, Goran Frehse, Daniel Freire, Niklas Kochdumper, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Linear Dynamics.” In <i>EPiC Series in Computing</i>, 74:16–48. EasyChair, 2020. <a href=\"https://doi.org/10.29007/7dt2\">https://doi.org/10.29007/7dt2</a>.","ista":"Althoff M, Bak S, Bao Z, Forets M, Frehse G, Freire D, Kochdumper N, Li Y, Mitra S, Ray R, Schilling C, Schupp S, Wetzlinger M. 2020. ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 74, 16–48.","apa":"Althoff, M., Bak, S., Bao, Z., Forets, M., Frehse, G., Freire, D., … Wetzlinger, M. (2020). ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. In <i>EPiC Series in Computing</i> (Vol. 74, pp. 16–48). EasyChair. <a href=\"https://doi.org/10.29007/7dt2\">https://doi.org/10.29007/7dt2</a>","ama":"Althoff M, Bak S, Bao Z, et al. ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. In: <i>EPiC Series in Computing</i>. Vol 74. EasyChair; 2020:16-48. doi:<a href=\"https://doi.org/10.29007/7dt2\">10.29007/7dt2</a>","short":"M. Althoff, S. Bak, Z. Bao, M. Forets, G. Frehse, D. Freire, N. Kochdumper, Y. Li, S. Mitra, R. Ray, C. Schilling, S. Schupp, M. Wetzlinger, in:, EPiC Series in Computing, EasyChair, 2020, pp. 16–48."},"article_processing_charge":"No","volume":74,"month":"09","scopus_import":"1"},{"month":"09","publication_identifier":{"eissn":["2663-337X"]},"oa":1,"language":[{"iso":"eng"}],"author":[{"last_name":"Szep","id":"485BB5A4-F248-11E8-B48F-1D18A9856A87","first_name":"Eniko","full_name":"Szep, Eniko"}],"article_processing_charge":"No","citation":{"ieee":"E. Szep, “Local adaptation in metapopulations,” Institute of Science and Technology Austria, 2020.","mla":"Szep, Eniko. <i>Local Adaptation in Metapopulations</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8574\">10.15479/AT:ISTA:8574</a>.","short":"E. Szep, Local Adaptation in Metapopulations, Institute of Science and Technology Austria, 2020.","apa":"Szep, E. (2020). <i>Local adaptation in metapopulations</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8574\">https://doi.org/10.15479/AT:ISTA:8574</a>","ama":"Szep E. Local adaptation in metapopulations. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8574\">10.15479/AT:ISTA:8574</a>","ista":"Szep E. 2020. Local adaptation in metapopulations. Institute of Science and Technology Austria.","chicago":"Szep, Eniko. “Local Adaptation in Metapopulations.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8574\">https://doi.org/10.15479/AT:ISTA:8574</a>."},"page":"158","degree_awarded":"PhD","day":"20","abstract":[{"lang":"eng","text":"This thesis concerns itself with the interactions of evolutionary and ecological forces and the consequences on genetic diversity and the ultimate survival of populations. It is important to understand what signals processes \r\nleave on the genome and what we can infer from such data, which is usually abundant but noisy. Furthermore, understanding how and when populations adapt or go extinct is important for practical purposes,  such as the genetic management of populations, as well as for theoretical questions, since local adaptation can be the first step toward speciation. \r\nIn Chapter 2, we introduce the method of maximum entropy to approximate the demographic changes of a population in a simple setting, namely the logistic growth model with immigration. We show that this method is not only a powerful \r\ntool in physics but can be gainfully applied in an ecological framework. We investigate how well it approximates the real \r\nbehavior of the system, and find that is does so, even in unexpected situations. Finally, we illustrate how it can model changing environments.\r\nIn Chapter 3, we analyze the co-evolution of allele frequencies and population sizes in an infinite island model.\r\nWe give conditions under which polygenic adaptation to a rare habitat is possible. The model we use is based on the diffusion approximation, considers eco-evolutionary feedback mechanisms (hard selection), and treats both \r\ndrift and environmental fluctuations explicitly. We also look at limiting scenarios, for which we derive analytical expressions. \r\nIn Chapter 4, we present a coalescent based simulation tool to obtain patterns of diversity in a spatially explicit subdivided population, in which the demographic history of each subpopulation can be specified. We compare \r\nthe results to existing predictions, and explore the relative importance of time and space under a variety of spatial arrangements and demographic histories, such as expansion and extinction. \r\nIn the last chapter, we give a brief outlook to further research. "}],"OA_place":"publisher","title":"Local adaptation in metapopulations","publication_status":"published","corr_author":"1","has_accepted_license":"1","ddc":["570"],"year":"2020","publisher":"Institute of Science and Technology Austria","type":"dissertation","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_created":"2020-09-28T07:33:38Z","date_published":"2020-09-20T00:00:00Z","status":"public","department":[{"_id":"NiBa"}],"date_updated":"2026-04-08T07:21:44Z","supervisor":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240"}],"doi":"10.15479/AT:ISTA:8574","oa_version":"Published Version","file_date_updated":"2020-09-28T07:25:37Z","_id":"8574","file":[{"checksum":"20e71f015fbbd78fea708893ad634ed0","access_level":"open_access","date_updated":"2020-09-28T07:25:35Z","creator":"dernst","file_size":6354833,"file_name":"thesis_EnikoSzep_final.pdf","file_id":"8575","relation":"main_file","date_created":"2020-09-28T07:25:35Z","success":1,"content_type":"application/pdf"},{"relation":"source_file","content_type":"application/x-zip-compressed","date_created":"2020-09-28T07:25:37Z","date_updated":"2020-09-28T07:25:37Z","access_level":"closed","checksum":"a8de2c14a1bb4e53c857787efbb289e1","file_id":"8576","file_size":23020401,"file_name":"thesisFiles_EnikoSzep.zip","creator":"dernst"}],"alternative_title":["ISTA Thesis"]},{"oa":1,"author":[{"full_name":"Andrei, Andreea","first_name":"Andreea","last_name":"Andrei"},{"full_name":"Öztürk, Yavuz","first_name":"Yavuz","last_name":"Öztürk"},{"last_name":"Khalfaoui-Hassani","first_name":"Bahia","full_name":"Khalfaoui-Hassani, Bahia"},{"full_name":"Rauch, Juna","first_name":"Juna","last_name":"Rauch"},{"last_name":"Marckmann","first_name":"Dorian","full_name":"Marckmann, Dorian"},{"full_name":"Trasnea, Petru Iulian","last_name":"Trasnea","first_name":"Petru Iulian","id":"D560034C-10C4-11EA-ABF4-A4B43DDC885E"},{"full_name":"Daldal, Fevzi","last_name":"Daldal","first_name":"Fevzi"},{"full_name":"Koch, Hans-Georg","first_name":"Hans-Georg","last_name":"Koch"}],"language":[{"iso":"eng"}],"citation":{"mla":"Andrei, Andreea, et al. “Cu Homeostasis in Bacteria: The Ins and Outs.” <i>Membranes</i>, vol. 10, no. 9, 242, MDPI, 2020, doi:<a href=\"https://doi.org/10.3390/membranes10090242\">10.3390/membranes10090242</a>.","ieee":"A. Andrei <i>et al.</i>, “Cu homeostasis in bacteria: The ins and outs,” <i>Membranes</i>, vol. 10, no. 9. MDPI, 2020.","short":"A. Andrei, Y. Öztürk, B. Khalfaoui-Hassani, J. Rauch, D. Marckmann, P.I. Trasnea, F. Daldal, H.-G. Koch, Membranes 10 (2020).","ama":"Andrei A, Öztürk Y, Khalfaoui-Hassani B, et al. Cu homeostasis in bacteria: The ins and outs. <i>Membranes</i>. 2020;10(9). doi:<a href=\"https://doi.org/10.3390/membranes10090242\">10.3390/membranes10090242</a>","apa":"Andrei, A., Öztürk, Y., Khalfaoui-Hassani, B., Rauch, J., Marckmann, D., Trasnea, P. I., … Koch, H.-G. (2020). Cu homeostasis in bacteria: The ins and outs. <i>Membranes</i>. MDPI. <a href=\"https://doi.org/10.3390/membranes10090242\">https://doi.org/10.3390/membranes10090242</a>","chicago":"Andrei, Andreea, Yavuz Öztürk, Bahia Khalfaoui-Hassani, Juna Rauch, Dorian Marckmann, Petru Iulian Trasnea, Fevzi Daldal, and Hans-Georg Koch. “Cu Homeostasis in Bacteria: The Ins and Outs.” <i>Membranes</i>. MDPI, 2020. <a href=\"https://doi.org/10.3390/membranes10090242\">https://doi.org/10.3390/membranes10090242</a>.","ista":"Andrei A, Öztürk Y, Khalfaoui-Hassani B, Rauch J, Marckmann D, Trasnea PI, Daldal F, Koch H-G. 2020. Cu homeostasis in bacteria: The ins and outs. Membranes. 10(9), 242."},"isi":1,"article_processing_charge":"No","volume":10,"month":"09","scopus_import":"1","publication_identifier":{"eissn":["2077-0375"]},"publication":"Membranes","abstract":[{"lang":"eng","text":"Copper (Cu) is an essential trace element for all living organisms and used as cofactor in key enzymes of important biological processes, such as aerobic respiration or superoxide dismutation. However, due to its toxicity, cells have developed elaborate mechanisms for Cu homeostasis, which balance Cu supply for cuproprotein biogenesis with the need to remove excess Cu. This review summarizes our current knowledge on bacterial Cu homeostasis with a focus on Gram-negative bacteria and describes the multiple strategies that bacteria use for uptake, storage and export of Cu. We furthermore describe general mechanistic principles that aid the bacterial response to toxic Cu concentrations and illustrate dedicated Cu relay systems that facilitate Cu delivery for cuproenzyme biogenesis. Progress in understanding how bacteria avoid Cu poisoning while maintaining a certain Cu quota for cell proliferation is of particular importance for microbial pathogens because Cu is utilized by the host immune system for attenuating pathogen survival in host cells."}],"intvolume":"        10","has_accepted_license":"1","title":"Cu homeostasis in bacteria: The ins and outs","publication_status":"published","day":"01","quality_controlled":"1","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_created":"2020-09-28T08:59:26Z","status":"public","date_published":"2020-09-01T00:00:00Z","ddc":["570"],"issue":"9","year":"2020","type":"journal_article","article_type":"original","publisher":"MDPI","tmp":{"short":"CC BY (4.0)","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)"},"doi":"10.3390/membranes10090242","file_date_updated":"2020-09-28T11:36:50Z","oa_version":"Published Version","file":[{"content_type":"application/pdf","success":1,"date_created":"2020-09-28T11:36:50Z","relation":"main_file","file_id":"8583","file_size":4612258,"file_name":"2020_Membranes_Andrei.pdf","creator":"dernst","date_updated":"2020-09-28T11:36:50Z","access_level":"open_access","checksum":"ceb43d7554e712dea6f36f9287271737"}],"_id":"8579","article_number":"242","department":[{"_id":"LeSa"}],"external_id":{"isi":["000581446000001"]},"date_updated":"2026-04-02T14:29:28Z"},{"publisher":"IEEE","publication_identifier":{"isbn":["9781728157511"]},"type":"conference","scopus_import":"1","month":"08","year":"2020","conference":{"end_date":"2020-07-15","location":"Pisa, Italy","start_date":"2020-07-15","name":"ESGCO: European Study Group on Cardiovascular Oscillations"},"language":[{"iso":"eng"}],"author":[{"last_name":"Graff","first_name":"Grzegorz","full_name":"Graff, Grzegorz"},{"last_name":"Graff","first_name":"Beata","full_name":"Graff, Beata"},{"id":"4483EF78-F248-11E8-B48F-1D18A9856A87","first_name":"Grzegorz","last_name":"Jablonski","full_name":"Jablonski, Grzegorz","orcid":"0000-0002-3536-9866"},{"last_name":"Narkiewicz","first_name":"Krzysztof","full_name":"Narkiewicz, Krzysztof"}],"isi":1,"date_published":"2020-08-01T00:00:00Z","article_processing_charge":"No","citation":{"ieee":"G. Graff, B. Graff, G. Jablonski, and K. Narkiewicz, “The application of persistent homology in the analysis of heart rate variability,” in <i>11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, </i>, Pisa, Italy, 2020.","mla":"Graff, Grzegorz, et al. “The Application of Persistent Homology in the Analysis of Heart Rate Variability.” <i>11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, </i>, 9158054, IEEE, 2020, doi:<a href=\"https://doi.org/10.1109/ESGCO49734.2020.9158054\">10.1109/ESGCO49734.2020.9158054</a>.","apa":"Graff, G., Graff, B., Jablonski, G., &#38; Narkiewicz, K. (2020). The application of persistent homology in the analysis of heart rate variability. In <i>11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, </i>. Pisa, Italy: IEEE. <a href=\"https://doi.org/10.1109/ESGCO49734.2020.9158054\">https://doi.org/10.1109/ESGCO49734.2020.9158054</a>","ama":"Graff G, Graff B, Jablonski G, Narkiewicz K. The application of persistent homology in the analysis of heart rate variability. In: <i>11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, </i>. IEEE; 2020. doi:<a href=\"https://doi.org/10.1109/ESGCO49734.2020.9158054\">10.1109/ESGCO49734.2020.9158054</a>","chicago":"Graff, Grzegorz, Beata Graff, Grzegorz Jablonski, and Krzysztof Narkiewicz. “The Application of Persistent Homology in the Analysis of Heart Rate Variability.” In <i>11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, </i>. IEEE, 2020. <a href=\"https://doi.org/10.1109/ESGCO49734.2020.9158054\">https://doi.org/10.1109/ESGCO49734.2020.9158054</a>.","ista":"Graff G, Graff B, Jablonski G, Narkiewicz K. 2020. The application of persistent homology in the analysis of heart rate variability. 11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, . ESGCO: European Study Group on Cardiovascular Oscillations, 9158054.","short":"G. Graff, B. Graff, G. Jablonski, K. Narkiewicz, in:, 11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, , IEEE, 2020."},"status":"public","date_created":"2020-09-28T08:59:27Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","day":"01","external_id":{"isi":["000621172600045"]},"quality_controlled":"1","date_updated":"2023-08-22T09:33:34Z","department":[{"_id":"HeEd"}],"oa_version":"None","abstract":[{"lang":"eng","text":"We evaluate the usefulness of persistent homology in the analysis of heart rate variability. In our approach we extract several topological descriptors characterising datasets of RR-intervals, which are later used in classical machine learning algorithms. By this method we are able to differentiate the group of patients with the history of transient ischemic attack and the group of hypertensive patients."}],"publication":"11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, ","_id":"8580","title":"The application of persistent homology in the analysis of heart rate variability","article_number":"9158054","publication_status":"published","doi":"10.1109/ESGCO49734.2020.9158054"},{"status":"public","date_published":"2020-11-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2020-09-28T08:59:27Z","type":"journal_article","article_type":"original","publisher":"Springer Nature","year":"2020","pmid":1,"acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"ScienComp"}],"issue":"11","_id":"8581","oa_version":"None","doi":"10.1038/s41594-020-0503-8","date_updated":"2025-07-10T11:57:09Z","related_material":{"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/structure-of-atpase-solved/","description":"News on IST Homepage"}]},"external_id":{"isi":["000569299400004"],"pmid":["32929284"]},"department":[{"_id":"LeSa"}],"page":"1077-1085","article_processing_charge":"No","citation":{"ieee":"G. Pinke, L. Zhou, and L. A. Sazanov, “Cryo-EM structure of the entire mammalian F-type ATP synthase,” <i>Nature Structural and Molecular Biology</i>, vol. 27, no. 11. Springer Nature, pp. 1077–1085, 2020.","mla":"Pinke, Gergely, et al. “Cryo-EM Structure of the Entire Mammalian F-Type ATP Synthase.” <i>Nature Structural and Molecular Biology</i>, vol. 27, no. 11, Springer Nature, 2020, pp. 1077–85, doi:<a href=\"https://doi.org/10.1038/s41594-020-0503-8\">10.1038/s41594-020-0503-8</a>.","apa":"Pinke, G., Zhou, L., &#38; Sazanov, L. A. (2020). Cryo-EM structure of the entire mammalian F-type ATP synthase. <i>Nature Structural and Molecular Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41594-020-0503-8\">https://doi.org/10.1038/s41594-020-0503-8</a>","ama":"Pinke G, Zhou L, Sazanov LA. Cryo-EM structure of the entire mammalian F-type ATP synthase. <i>Nature Structural and Molecular Biology</i>. 2020;27(11):1077-1085. doi:<a href=\"https://doi.org/10.1038/s41594-020-0503-8\">10.1038/s41594-020-0503-8</a>","ista":"Pinke G, Zhou L, Sazanov LA. 2020. Cryo-EM structure of the entire mammalian F-type ATP synthase. Nature Structural and Molecular Biology. 27(11), 1077–1085.","chicago":"Pinke, Gergely, Long Zhou, and Leonid A Sazanov. “Cryo-EM Structure of the Entire Mammalian F-Type ATP Synthase.” <i>Nature Structural and Molecular Biology</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1038/s41594-020-0503-8\">https://doi.org/10.1038/s41594-020-0503-8</a>.","short":"G. Pinke, L. Zhou, L.A. Sazanov, Nature Structural and Molecular Biology 27 (2020) 1077–1085."},"isi":1,"author":[{"id":"4D5303E6-F248-11E8-B48F-1D18A9856A87","first_name":"Gergely","last_name":"Pinke","full_name":"Pinke, Gergely"},{"full_name":"Zhou, Long","orcid":"0000-0002-1864-8951","first_name":"Long","id":"3E751364-F248-11E8-B48F-1D18A9856A87","last_name":"Zhou"},{"full_name":"Sazanov, Leonid A","orcid":"0000-0002-0977-7989","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","first_name":"Leonid A","last_name":"Sazanov"}],"language":[{"iso":"eng"}],"acknowledgement":"We thank J. Novacek from CEITEC (Brno, Czech Republic) for assistance with collecting the FEI Krios dataset and iNEXT for providing access to CEITEC. We thank the IST Austria EM facility for access and assistance with collecting the FEI Glacios dataset. Data processing was performed at the IST high-performance computing cluster. This work has been supported by iNEXT EM HEDC (proposal 4506), funded by the Horizon 2020 Programme of the European Commission.","publication_identifier":{"eissn":["1545-9985"],"issn":["1545-9993"]},"volume":27,"month":"11","scopus_import":"1","title":"Cryo-EM structure of the entire mammalian F-type ATP synthase","publication_status":"published","publication":"Nature Structural and Molecular Biology","intvolume":"        27","abstract":[{"text":"The majority of adenosine triphosphate (ATP) powering cellular processes in eukaryotes is produced by the mitochondrial F1Fo ATP synthase. Here, we present the atomic models of the membrane Fo domain and the entire mammalian (ovine) F1Fo, determined by cryo-electron microscopy. Subunits in the membrane domain are arranged in the ‘proton translocation cluster’ attached to the c-ring and a more distant ‘hook apparatus’ holding subunit e. Unexpectedly, this subunit is anchored to a lipid ‘plug’ capping the c-ring. We present a detailed proton translocation pathway in mammalian Fo and key inter-monomer contacts in F1Fo multimers. Cryo-EM maps of F1Fo exposed to calcium reveal a retracted subunit e and a disassembled c-ring, suggesting permeability transition pore opening. We propose a model for the permeability transition pore opening, whereby subunit e pulls the lipid plug out of the c-ring. Our structure will allow the design of drugs for many emerging applications in medicine.","lang":"eng"}],"quality_controlled":"1","day":"01"}]