[{"type":"dissertation","ddc":["000"],"citation":{"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>","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>","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.","short":"R. Guseinov, Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter, Institute of Science and Technology Austria, 2020.","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>.","ista":"Guseinov R. 2020. Computational design of curved thin shells: From glass façades to programmable matter. Institute of Science and Technology Austria."},"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.","page":"118","author":[{"id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","first_name":"Ruslan","full_name":"Guseinov, Ruslan","last_name":"Guseinov","orcid":"0000-0001-9819-5077"}],"project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}],"_id":"8366","doi":"10.15479/AT:ISTA:8366","supervisor":[{"first_name":"Bernd","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","last_name":"Bickel"}],"keyword":["computer-aided design","shape modeling","self-morphing","mechanical engineering"],"file_date_updated":"2020-09-16T15:11:01Z","related_material":{"record":[{"relation":"part_of_dissertation","id":"8562","status":"public"},{"id":"8375","relation":"research_data","status":"public"},{"status":"deleted","relation":"research_data","id":"7151"},{"id":"1001","relation":"part_of_dissertation","status":"public"},{"id":"7262","relation":"part_of_dissertation","status":"public"}]},"language":[{"iso":"eng"}],"title":"Computational design of curved thin shells: From glass façades to programmable matter","date_created":"2020-09-10T16:19:55Z","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."}],"day":"21","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication_identifier":{"isbn":["978-3-99078-010-7"],"issn":["2663-337X"]},"OA_place":"publisher","oa_version":"Published Version","alternative_title":["ISTA Thesis"],"file":[{"date_created":"2020-09-10T16:11:49Z","file_name":"thesis_rguseinov.pdf","relation":"main_file","file_id":"8367","content_type":"application/pdf","checksum":"f8da89553da36037296b0a80f14ebf50","file_size":70950442,"access_level":"open_access","creator":"rguseino","success":1,"date_updated":"2020-09-10T16:11:49Z"},{"date_updated":"2020-09-16T15:11:01Z","creator":"rguseino","access_level":"closed","file_size":76207597,"checksum":"e8fd944c960c20e0e27e6548af69121d","content_type":"application/x-zip-compressed","file_id":"8374","relation":"source_file","file_name":"thesis_source.zip","date_created":"2020-09-11T09:39:48Z"}],"year":"2020","status":"public","degree_awarded":"PhD","corr_author":"1","has_accepted_license":"1","date_updated":"2026-04-08T07:25:22Z","publication_status":"published","date_published":"2020-09-21T00:00:00Z","month":"09","ec_funded":1,"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"ScienComp"}],"publisher":"Institute of Science and Technology Austria","oa":1,"department":[{"_id":"BeBi"}],"article_processing_charge":"No"},{"_id":"8375","doi":"10.15479/AT:ISTA:8375","project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}],"corr_author":"1","has_accepted_license":"1","year":"2020","status":"public","author":[{"orcid":"0000-0001-9819-5077","last_name":"Guseinov","full_name":"Guseinov, Ruslan","first_name":"Ruslan","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87"}],"ddc":["000"],"oa_version":"Published Version","file":[{"file_id":"8376","relation":"main_file","date_created":"2020-09-11T09:45:21Z","file_name":"supplementary_movie_1.mp4","date_updated":"2020-09-11T09:45:21Z","success":1,"content_type":"video/mp4","access_level":"open_access","checksum":"4029ffd65fb82ef2366b2fc2a4908e16","file_size":29214988,"creator":"rguseino"},{"date_updated":"2020-09-11T09:45:25Z","success":1,"content_type":"video/mp4","file_size":28449475,"checksum":"8ed03b04d80f1a4e622cb22e6100afd8","access_level":"open_access","creator":"rguseino","file_id":"8377","relation":"main_file","date_created":"2020-09-11T09:45:25Z","file_name":"supplementary_movie_2.mp4"},{"file_id":"8378","file_name":"supplementary_movie_3.mp4","date_created":"2020-09-11T09:45:28Z","relation":"main_file","date_updated":"2020-09-11T09:45:28Z","creator":"rguseino","content_type":"video/mp4","checksum":"ad6864afb5e694e5c52a88fba4e02eea","access_level":"open_access","file_size":26315853,"success":1},{"creator":"rguseino","file_size":25198755,"content_type":"video/mp4","checksum":"b079cef7871fe1afb69af0e2b099f3b1","access_level":"open_access","success":1,"date_updated":"2020-09-11T09:45:33Z","file_name":"supplementary_movie_4.mp4","date_created":"2020-09-11T09:45:33Z","relation":"main_file","file_id":"8379"},{"date_updated":"2020-09-11T09:45:36Z","checksum":"9d1d48a8ed5c109a999c51b044ee523d","file_size":29011354,"access_level":"open_access","content_type":"video/mp4","creator":"rguseino","success":1,"file_id":"8380","date_created":"2020-09-11T09:45:36Z","file_name":"supplementary_movie_5.mp4","relation":"main_file"},{"file_id":"8381","date_created":"2020-09-11T09:52:36Z","file_name":"readme.txt","relation":"main_file","date_updated":"2020-09-11T09:52:36Z","access_level":"open_access","content_type":"text/plain","file_size":586,"checksum":"d414d0059e982d752d218756b3c3ce05","creator":"rguseino","success":1}],"citation":{"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>","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>","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>.","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.","short":"R. Guseinov, (2020).","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>."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"research_data","date_created":"2020-09-11T09:52:54Z","day":"21","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"}],"article_processing_charge":"No","department":[{"_id":"BeBi"}],"related_material":{"record":[{"relation":"used_in_publication","id":"8366","status":"public"}]},"oa":1,"title":"Supplementary data for \"Computational design of curved thin shells: from glass façades to programmable matter\"","file_date_updated":"2020-09-11T09:52:36Z","publisher":"Institute of Science and Technology Austria","ec_funded":1,"date_updated":"2026-04-08T07:25:22Z","contributor":[{"id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","first_name":"Ruslan","last_name":"Guseinov","contributor_type":"researcher","orcid":"0000-0001-9819-5077"},{"first_name":"Connor","last_name":"McMahan","contributor_type":"researcher"},{"last_name":"Perez Rodriguez","contributor_type":"researcher","id":"2DC83906-F248-11E8-B48F-1D18A9856A87","first_name":"Jesus"},{"last_name":"Daraio","contributor_type":"researcher","first_name":"Chiara"},{"last_name":"Bickel","contributor_type":"researcher","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd"}],"month":"09","date_published":"2020-09-21T00:00:00Z"},{"_id":"8382","doi":"10.1145/3382734.3406005","page":"31-40","status":"public","author":[{"id":"3EDE6DE4-AA5A-11E9-986D-341CE6697425","first_name":"Mirza Ahad","full_name":"Baig, Mirza Ahad","last_name":"Baig"},{"first_name":"Danny","full_name":"Hendler, Danny","last_name":"Hendler"},{"full_name":"Milani, Alessia","first_name":"Alessia","last_name":"Milani"},{"last_name":"Travers","full_name":"Travers, Corentin","first_name":"Corentin"}],"year":"2020","quality_controlled":"1","oa_version":"Preprint","external_id":{"isi":["001436693500004"]},"citation":{"chicago":"Baig, Mirza Ahad, Danny Hendler, Alessia Milani, and Corentin Travers. “Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.” In <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>, 31–40. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3382734.3406005\">https://doi.org/10.1145/3382734.3406005</a>.","short":"M.A. Baig, D. Hendler, A. Milani, C. Travers, in:, Proceedings of the 39th Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 31–40.","ista":"Baig MA, Hendler D, Milani A, Travers C. 2020. Long-lived snapshots with polylogarithmic amortized step complexity. Proceedings of the 39th Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing, 31–40.","apa":"Baig, M. A., Hendler, D., Milani, A., &#38; Travers, C. (2020). Long-lived snapshots with polylogarithmic amortized step complexity. In <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i> (pp. 31–40). Virtual, Italy: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3382734.3406005\">https://doi.org/10.1145/3382734.3406005</a>","ama":"Baig MA, Hendler D, Milani A, Travers C. Long-lived snapshots with polylogarithmic amortized step complexity. In: <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>. Association for Computing Machinery; 2020:31-40. doi:<a href=\"https://doi.org/10.1145/3382734.3406005\">10.1145/3382734.3406005</a>","ieee":"M. A. Baig, D. Hendler, A. Milani, and C. Travers, “Long-lived snapshots with polylogarithmic amortized step complexity,” in <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>, Virtual, Italy, 2020, pp. 31–40.","mla":"Baig, Mirza Ahad, et al. “Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.” <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>, Association for Computing Machinery, 2020, pp. 31–40, doi:<a href=\"https://doi.org/10.1145/3382734.3406005\">10.1145/3382734.3406005</a>."},"type":"conference","publication":"Proceedings of the 39th Symposium on Principles of Distributed Computing","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_identifier":{"isbn":["9781450375825"]},"conference":{"location":"Virtual, Italy","end_date":"2020-08-07","name":"PODC: Principles of Distributed Computing","start_date":"2020-08-03"},"date_created":"2020-09-13T22:01:17Z","abstract":[{"lang":"eng","text":"We present the first deterministic wait-free long-lived snapshot algorithm, using only read and write operations, that guarantees polylogarithmic amortized step complexity in all executions. This is the first non-blocking snapshot algorithm, using reads and writes only, that has sub-linear amortized step complexity in executions of arbitrary length. The key to our construction is a novel implementation of a 2-component max array object which may be of independent interest."}],"article_processing_charge":"No","day":"31","main_file_link":[{"url":"https://hal.archives-ouvertes.fr/hal-02860087/document","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"title":"Long-lived snapshots with polylogarithmic amortized step complexity","publisher":"Association for Computing Machinery","isi":1,"scopus_import":"1","date_updated":"2025-09-10T10:25:23Z","publication_status":"published","month":"07","date_published":"2020-07-31T00:00:00Z"},{"publisher":"Association for Computing Machinery","month":"07","date_published":"2020-07-31T00:00:00Z","date_updated":"2025-09-10T10:26:32Z","publication_status":"published","scopus_import":"1","isi":1,"article_processing_charge":"No","day":"31","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."}],"date_created":"2020-09-13T22:01:18Z","conference":{"start_date":"2020-08-03","name":"PODC: Principles of Distributed Computing","end_date":"2020-08-07","location":"Virtual, Italy"},"department":[{"_id":"DaAl"}],"title":"Brief Announcement: Why Extension-Based Proofs Fail","language":[{"iso":"eng"}],"citation":{"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.","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>.","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.","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>.","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.","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>","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>"},"external_id":{"isi":["001436693500007"]},"oa_version":"None","publication_identifier":{"isbn":["9781450375825"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Proceedings of the 39th Symposium on Principles of Distributed Computing","type":"conference","doi":"10.1145/3382734.3405743","_id":"8383","quality_controlled":"1","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X"},{"first_name":"James","full_name":"Aspnes, James","last_name":"Aspnes"},{"first_name":"Faith","full_name":"Ellen, Faith","last_name":"Ellen"},{"first_name":"Rati","full_name":"Gelashvili, Rati","last_name":"Gelashvili"},{"last_name":"Zhu","first_name":"Leqi","full_name":"Zhu, Leqi"}],"year":"2020","status":"public","page":"54-56"},{"file":[{"relation":"main_file","file_name":"2020_soapfilm_submitted.pdf","date_created":"2020-11-23T09:03:19Z","file_id":"8795","success":1,"creator":"dernst","content_type":"application/pdf","checksum":"813831ca91319d794d9748c276b24578","access_level":"open_access","file_size":14935529,"date_updated":"2020-11-23T09:03:19Z"}],"oa_version":"Submitted Version","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"has_accepted_license":"1","issue":"4","status":"public","year":"2020","ec_funded":1,"acknowledged_ssus":[{"_id":"ScienComp"}],"publisher":"Association for Computing Machinery","month":"07","article_type":"original","date_published":"2020-07-08T00:00:00Z","publication_status":"published","date_updated":"2026-04-16T08:29:36Z","department":[{"_id":"ChWo"}],"article_number":"31","article_processing_charge":"No","oa":1,"intvolume":"        39","citation":{"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.","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>","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>","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.","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>.","short":"S. Ishida, P. Synak, F. Narita, T. Hachisuka, C. Wojtan, ACM Transactions on Graphics 39 (2020)."},"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.","external_id":{"isi":["000583700300004"]},"ddc":["000"],"type":"journal_article","publication":"ACM Transactions on Graphics","project":[{"_id":"2533E772-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"638176","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales"}],"doi":"10.1145/3386569.3392405","_id":"8384","author":[{"last_name":"Ishida","orcid":"0000-0002-3121-3100","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","first_name":"Sadashige","full_name":"Ishida, Sadashige"},{"last_name":"Synak","full_name":"Synak, Peter","first_name":"Peter","id":"331776E2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Narita","first_name":"Fumiya","full_name":"Narita, Fumiya"},{"full_name":"Hachisuka, Toshiya","first_name":"Toshiya","last_name":"Hachisuka"},{"id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","full_name":"Wojtan, Christopher J","last_name":"Wojtan","orcid":"0000-0001-6646-5546"}],"quality_controlled":"1","isi":1,"scopus_import":"1","abstract":[{"lang":"eng","text":"Previous research on animations of soap bubbles, films, and foams largely focuses on the motion and geometric shape of the bubble surface. These works neglect the evolution of the bubble’s thickness, which is normally responsible for visual phenomena like surface vortices, Newton’s interference patterns, capillary waves, and deformation-dependent rupturing of films in a foam. In this paper, we model these natural phenomena by introducing the film thickness as a reduced degree of freedom in the Navier-Stokes equations and deriving their equations of motion. We discretize the equations on a nonmanifold triangle mesh surface and couple it to an existing bubble solver. In doing so, we also introduce an incompressible fluid solver for 2.5D films and a novel advection algorithm for convecting fields across non-manifold surface junctions. Our simulations enhance state-of-the-art bubble solvers with additional effects caused by convection, rippling, draining, and evaporation of the thin film."}],"day":"08","date_created":"2020-09-13T22:01:18Z","file_date_updated":"2020-11-23T09:03:19Z","volume":39,"title":"A model for soap film dynamics with evolving thickness","language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"19630"}]},"main_file_link":[{"url":"https://doi.org/10.1145/3386569.3392405","open_access":"1"}]},{"_id":"8385","doi":"10.1145/3386569.3392412","project":[{"_id":"2533E772-B435-11E9-9278-68D0E5697425","grant_number":"638176","call_identifier":"H2020","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales"}],"quality_controlled":"1","author":[{"last_name":"Sperl","first_name":"Georg","full_name":"Sperl, Georg","id":"4DD40360-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Narain, Rahul","first_name":"Rahul","last_name":"Narain"},{"full_name":"Wojtan, Christopher J","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","last_name":"Wojtan"}],"external_id":{"isi":["000583700300021"]},"ddc":["000"],"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.","citation":{"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>.","short":"G. Sperl, R. Narain, C. Wojtan, ACM Transactions on Graphics 39 (2020).","ista":"Sperl G, Narain R, Wojtan C. 2020. Homogenized yarn-level cloth. ACM Transactions on Graphics. 39(4), 48.","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>","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>","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>."},"intvolume":"        39","type":"journal_article","publication":"ACM Transactions on Graphics","date_created":"2020-09-13T22:01:18Z","abstract":[{"lang":"eng","text":"We present a method for animating yarn-level cloth effects using a thin-shell solver. We accomplish this through numerical homogenization: we first use a large number of yarn-level simulations to build a model of the potential energy density of the cloth, and then use this energy density function to compute forces in a thin shell simulator. We model several yarn-based materials, including both woven and knitted fabrics. Our model faithfully reproduces expected effects like the stiffness of woven fabrics, and the highly deformable nature and anisotropy of knitted fabrics. Our approach does not require any real-world experiments nor measurements; because the method is based entirely on simulations, it can generate entirely new material models quickly, without the need for testing apparatuses or human intervention. We provide data-driven models of several woven and knitted fabrics, which can be used for efficient simulation with an off-the-shelf cloth solver."}],"day":"08","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1145/3386569.3392412","open_access":"1"}],"related_material":{"record":[{"relation":"dissertation_contains","id":"12358","status":"public"}]},"title":"Homogenized yarn-level cloth","volume":39,"file_date_updated":"2020-11-23T09:01:22Z","scopus_import":"1","isi":1,"has_accepted_license":"1","corr_author":"1","status":"public","year":"2020","issue":"4","oa_version":"Submitted Version","file":[{"date_updated":"2020-11-23T09:01:22Z","content_type":"application/pdf","file_size":38922662,"checksum":"cf4c1d361c3196c4bd424520a5588205","access_level":"open_access","creator":"dernst","success":1,"file_id":"8794","date_created":"2020-11-23T09:01:22Z","file_name":"2020_hylc_submitted.pdf","relation":"main_file"}],"publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","article_processing_charge":"No","article_number":"48","department":[{"_id":"ChWo"}],"oa":1,"publisher":"Association for Computing Machinery","acknowledged_ssus":[{"_id":"ScienComp"}],"ec_funded":1,"date_updated":"2026-04-16T08:31:55Z","publication_status":"published","month":"07","date_published":"2020-07-08T00:00:00Z","article_type":"original"},{"corr_author":"1","has_accepted_license":"1","year":"2020","status":"public","degree_awarded":"PhD","oa_version":"Published Version","alternative_title":["ISTA Thesis"],"file":[{"date_created":"2020-09-14T01:02:59Z","file_name":"Thesis_Ran.zip","relation":"source_file","file_id":"8388","access_level":"closed","content_type":"application/x-zip-compressed","file_size":1245800191,"checksum":"edcf578b6e1c9b0dd81ff72d319b66ba","creator":"rzhang","date_updated":"2020-09-14T12:18:43Z"},{"relation":"main_file","file_name":"PhD_thesis_Ran Zhang_20200915.pdf","date_created":"2020-09-15T12:51:53Z","file_id":"8396","success":1,"creator":"rzhang","checksum":"817e20c33be9247f906925517c56a40d","content_type":"application/pdf","file_size":161385316,"access_level":"open_access","date_updated":"2020-09-15T12:51:53Z"}],"publication_identifier":{"issn":["2663-337X"]},"OA_place":"publisher","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","article_processing_charge":"No","department":[{"_id":"BeBi"}],"oa":1,"publisher":"Institute of Science and Technology Austria","acknowledged_ssus":[{"_id":"SSU"}],"ec_funded":1,"date_updated":"2026-04-16T10:06:31Z","publication_status":"published","month":"09","date_published":"2020-09-14T00:00:00Z","_id":"8386","doi":"10.15479/AT:ISTA:8386","project":[{"_id":"2508E324-B435-11E9-9278-68D0E5697425","name":"Distributed 3D Object Design","grant_number":"642841","call_identifier":"H2020"},{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","grant_number":"715767"}],"page":"148","author":[{"id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87","full_name":"Zhang, Ran","first_name":"Ran","last_name":"Zhang","orcid":"0000-0002-3808-281X"}],"ddc":["003"],"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.","citation":{"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.","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>","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>","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.","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>.","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."},"type":"dissertation","date_created":"2020-09-14T01:04:53Z","day":"14","abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"id":"486","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"1002","relation":"part_of_dissertation"}]},"title":"Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability","file_date_updated":"2020-09-15T12:51:53Z","supervisor":[{"last_name":"Bickel","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd","first_name":"Bernd"}]},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)","image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)"},"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"file":[{"relation":"main_file","file_name":"2020_Thesis_Royer.pdf","date_created":"2020-09-14T13:39:14Z","file_id":"8391","success":1,"creator":"dernst","access_level":"open_access","content_type":"application/pdf","file_size":30224591,"checksum":"c914d2f88846032f3d8507734861b6ee","date_updated":"2020-09-14T13:39:14Z"},{"date_updated":"2020-09-14T13:39:17Z","creator":"dernst","access_level":"closed","content_type":"application/x-zip-compressed","file_size":74227627,"checksum":"ae98fb35d912cff84a89035ae5794d3c","file_id":"8392","file_name":"thesis_sources.zip","date_created":"2020-09-14T13:39:17Z","relation":"main_file"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-007-7"]},"OA_place":"publisher","corr_author":"1","has_accepted_license":"1","year":"2020","status":"public","degree_awarded":"PhD","acknowledged_ssus":[{"_id":"CampIT"},{"_id":"ScienComp"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","date_updated":"2026-04-08T07:26:44Z","month":"09","date_published":"2020-09-14T00:00:00Z","department":[{"_id":"ChLa"}],"article_processing_charge":"No","oa":1,"ddc":["000"],"citation":{"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>","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>","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.","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>.","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."},"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.","type":"dissertation","_id":"8390","doi":"10.15479/AT:ISTA:8390","author":[{"first_name":"Amélie","full_name":"Royer, Amélie","id":"3811D890-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8407-0705","last_name":"Royer"}],"page":"197","supervisor":[{"full_name":"Lampert, Christoph","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","last_name":"Lampert"}],"date_created":"2020-09-14T13:42:09Z","day":"14","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. "}],"file_date_updated":"2020-09-14T13:39:17Z","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"7936"},{"status":"public","id":"8092","relation":"part_of_dissertation"},{"status":"public","id":"911","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"8193"},{"id":"7937","relation":"part_of_dissertation","status":"public"}]},"language":[{"iso":"eng"}],"title":"Leveraging structure in Computer Vision tasks for flexible Deep Learning models"},{"_id":"8402","doi":"10.1186/s12915-019-0733-6","author":[{"full_name":"Rampelt, Heike","first_name":"Heike","last_name":"Rampelt"},{"full_name":"Sucec, Iva","first_name":"Iva","last_name":"Sucec"},{"first_name":"Beate","full_name":"Bersch, Beate","last_name":"Bersch"},{"full_name":"Horten, Patrick","first_name":"Patrick","last_name":"Horten"},{"first_name":"Inge","full_name":"Perschil, Inge","last_name":"Perschil"},{"full_name":"Martinou, Jean-Claude","first_name":"Jean-Claude","last_name":"Martinou"},{"last_name":"van der Laan","first_name":"Martin","full_name":"van der Laan, Martin"},{"first_name":"Nils","full_name":"Wiedemann, Nils","last_name":"Wiedemann"},{"full_name":"Schanda, Paul","first_name":"Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","orcid":"0000-0002-9350-7606","last_name":"Schanda"},{"full_name":"Pfanner, Nikolaus","first_name":"Nikolaus","last_name":"Pfanner"}],"quality_controlled":"1","intvolume":"        18","external_id":{"pmid":["31907035"]},"citation":{"ama":"Rampelt H, Sucec I, Bersch B, et al. The mitochondrial carrier pathway transports non-canonical substrates with an odd number of transmembrane segments. <i>BMC Biology</i>. 2020;18. doi:<a href=\"https://doi.org/10.1186/s12915-019-0733-6\">10.1186/s12915-019-0733-6</a>","apa":"Rampelt, H., Sucec, I., Bersch, B., Horten, P., Perschil, I., Martinou, J.-C., … Pfanner, N. (2020). The mitochondrial carrier pathway transports non-canonical substrates with an odd number of transmembrane segments. <i>BMC Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1186/s12915-019-0733-6\">https://doi.org/10.1186/s12915-019-0733-6</a>","mla":"Rampelt, Heike, et al. “The Mitochondrial Carrier Pathway Transports Non-Canonical Substrates with an Odd Number of Transmembrane Segments.” <i>BMC Biology</i>, vol. 18, 2, Springer Nature, 2020, doi:<a href=\"https://doi.org/10.1186/s12915-019-0733-6\">10.1186/s12915-019-0733-6</a>.","ieee":"H. Rampelt <i>et al.</i>, “The mitochondrial carrier pathway transports non-canonical substrates with an odd number of transmembrane segments,” <i>BMC Biology</i>, vol. 18. Springer Nature, 2020.","short":"H. Rampelt, I. Sucec, B. Bersch, P. Horten, I. Perschil, J.-C. Martinou, M. van der Laan, N. Wiedemann, P. Schanda, N. Pfanner, BMC Biology 18 (2020).","chicago":"Rampelt, Heike, Iva Sucec, Beate Bersch, Patrick Horten, Inge Perschil, Jean-Claude Martinou, Martin van der Laan, Nils Wiedemann, Paul Schanda, and Nikolaus Pfanner. “The Mitochondrial Carrier Pathway Transports Non-Canonical Substrates with an Odd Number of Transmembrane Segments.” <i>BMC Biology</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1186/s12915-019-0733-6\">https://doi.org/10.1186/s12915-019-0733-6</a>.","ista":"Rampelt H, Sucec I, Bersch B, Horten P, Perschil I, Martinou J-C, van der Laan M, Wiedemann N, Schanda P, Pfanner N. 2020. The mitochondrial carrier pathway transports non-canonical substrates with an odd number of transmembrane segments. BMC Biology. 18, 2."},"publication":"BMC Biology","type":"journal_article","date_created":"2020-09-17T10:26:53Z","day":"06","abstract":[{"lang":"eng","text":"Background: The mitochondrial pyruvate carrier (MPC) plays a central role in energy metabolism by transporting pyruvate across the inner mitochondrial membrane. Its heterodimeric composition and homology to SWEET and semiSWEET transporters set the MPC apart from the canonical mitochondrial carrier family (named MCF or SLC25). The import of the canonical carriers is mediated by the carrier translocase of the inner membrane (TIM22) pathway and is dependent on their structure, which features an even number of transmembrane segments and both termini in the intermembrane space. The import pathway of MPC proteins has not been elucidated. The odd number of transmembrane segments and positioning of the N-terminus in the matrix argues against an import via the TIM22 carrier pathway but favors an import via the flexible presequence pathway.\r\nResults: Here, we systematically analyzed the import pathways of Mpc2 and Mpc3 and report that, contrary to an expected import via the flexible presequence pathway, yeast MPC proteins with an odd number of transmembrane segments and matrix-exposed N-terminus are imported by the carrier pathway, using the receptor Tom70, small TIM chaperones, and the TIM22 complex. The TIM9·10 complex chaperones MPC proteins through the mitochondrial intermembrane space using conserved hydrophobic motifs that are also required for the interaction with canonical carrier proteins.\r\nConclusions: The carrier pathway can import paired and non-paired transmembrane helices and translocate N-termini to either side of the mitochondrial inner membrane, revealing an unexpected versatility of the mitochondrial import pathway for non-cleavable inner membrane proteins."}],"keyword":["Biotechnology","Plant Science","General Biochemistry","Genetics and Molecular Biology","Developmental Biology","Cell Biology","Physiology","Ecology","Evolution","Behavior and Systematics","Structural Biology","General Agricultural and Biological Sciences"],"volume":18,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1186/s12915-019-0733-6"}],"language":[{"iso":"eng"}],"DOAJ_listed":"1","title":"The mitochondrial carrier pathway transports non-canonical substrates with an odd number of transmembrane segments","pmid":1,"extern":"1","year":"2020","status":"public","OA_type":"gold","oa_version":"Published Version","user_id":"0043cee0-e5fc-11ee-9736-f83bc23afbf0","publication_identifier":{"issn":["1741-7007"]},"OA_place":"publisher","article_number":"2","article_processing_charge":"No","oa":1,"publisher":"Springer Nature","publication_status":"published","date_updated":"2024-10-15T13:23:11Z","month":"01","date_published":"2020-01-06T00:00:00Z","article_type":"original"},{"doi":"10.1101/2020.06.08.140772","_id":"8403","year":"2020","status":"public","author":[{"full_name":"Sučec, Iva","first_name":"Iva","last_name":"Sučec"},{"first_name":"Yong","full_name":"Wang, Yong","last_name":"Wang"},{"first_name":"Ons","full_name":"Dakhlaoui, Ons","last_name":"Dakhlaoui"},{"last_name":"Weinhäupl","first_name":"Katharina","full_name":"Weinhäupl, Katharina"},{"full_name":"Jores, Tobias","first_name":"Tobias","last_name":"Jores"},{"full_name":"Costa, Doriane","first_name":"Doriane","last_name":"Costa"},{"last_name":"Hessel","full_name":"Hessel, Audrey","first_name":"Audrey"},{"last_name":"Brennich","full_name":"Brennich, Martha","first_name":"Martha"},{"last_name":"Rapaport","first_name":"Doron","full_name":"Rapaport, Doron"},{"last_name":"Lindorff-Larsen","first_name":"Kresten","full_name":"Lindorff-Larsen, Kresten"},{"last_name":"Bersch","first_name":"Beate","full_name":"Bersch, Beate"},{"id":"7B541462-FAF6-11E9-A490-E8DFE5697425","full_name":"Schanda, Paul","first_name":"Paul","last_name":"Schanda","orcid":"0000-0002-9350-7606"}],"citation":{"chicago":"Sučec, Iva, Yong Wang, Ons Dakhlaoui, Katharina Weinhäupl, Tobias Jores, Doriane Costa, Audrey Hessel, et al. “Structural Basis of Client Specificity in Mitochondrial Membrane-Protein Chaperones.” <i>BioRxiv</i>. Cold Spring Harbor Laboratory, n.d. <a href=\"https://doi.org/10.1101/2020.06.08.140772\">https://doi.org/10.1101/2020.06.08.140772</a>.","short":"I. Sučec, Y. Wang, O. Dakhlaoui, K. Weinhäupl, T. Jores, D. Costa, A. Hessel, M. Brennich, D. Rapaport, K. Lindorff-Larsen, B. Bersch, P. Schanda, BioRxiv (n.d.).","ista":"Sučec I, Wang Y, Dakhlaoui O, Weinhäupl K, Jores T, Costa D, Hessel A, Brennich M, Rapaport D, Lindorff-Larsen K, Bersch B, Schanda P. Structural basis of client specificity in mitochondrial membrane-protein chaperones. bioRxiv, <a href=\"https://doi.org/10.1101/2020.06.08.140772\">10.1101/2020.06.08.140772</a>.","apa":"Sučec, I., Wang, Y., Dakhlaoui, O., Weinhäupl, K., Jores, T., Costa, D., … Schanda, P. (n.d.). Structural basis of client specificity in mitochondrial membrane-protein chaperones. <i>bioRxiv</i>. Cold Spring Harbor Laboratory. <a href=\"https://doi.org/10.1101/2020.06.08.140772\">https://doi.org/10.1101/2020.06.08.140772</a>","ama":"Sučec I, Wang Y, Dakhlaoui O, et al. Structural basis of client specificity in mitochondrial membrane-protein chaperones. <i>bioRxiv</i>. doi:<a href=\"https://doi.org/10.1101/2020.06.08.140772\">10.1101/2020.06.08.140772</a>","mla":"Sučec, Iva, et al. “Structural Basis of Client Specificity in Mitochondrial Membrane-Protein Chaperones.” <i>BioRxiv</i>, Cold Spring Harbor Laboratory, doi:<a href=\"https://doi.org/10.1101/2020.06.08.140772\">10.1101/2020.06.08.140772</a>.","ieee":"I. Sučec <i>et al.</i>, “Structural basis of client specificity in mitochondrial membrane-protein chaperones,” <i>bioRxiv</i>. Cold Spring Harbor Laboratory."},"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"bioRxiv","type":"preprint","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Chaperones are essential for assisting protein folding, and for transferring poorly soluble proteins to their functional locations within cells. Hydrophobic interactions drive promiscuous chaperone–client binding, but our understanding of how additional interactions enable client specificity is sparse. Here we decipher what determines binding of two chaperones (TIM8·13, TIM9·10) to different integral membrane proteins, the all-transmembrane mitochondrial carrier Ggc1, and Tim23 which has an additional disordered hydrophilic domain. Combining NMR, SAXS and molecular dynamics simulations, we determine the structures of Tim23/TIM8·13 and Tim23/TIM9·10 complexes. TIM8·13 uses transient salt bridges to interact with the hydrophilic part of its client, but its interactions to the transmembrane part are weaker than in TIM9·10. Consequently, TIM9·10 outcompetes TIM8·13 in binding hydrophobic clients, while TIM8·13 is tuned to few clients with both hydrophilic and hydrophobic parts. Our study exemplifies how chaperones fine-tune the balance of promiscuity <jats:italic>vs.</jats:italic> specificity."}],"day":"17","date_created":"2020-09-17T10:27:47Z","title":"Structural basis of client specificity in mitochondrial membrane-protein chaperones","oa":1,"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1101/2020.06.08.140772","open_access":"1"}],"publisher":"Cold Spring Harbor Laboratory","month":"09","date_published":"2020-09-17T00:00:00Z","date_updated":"2021-01-12T08:19:02Z","extern":"1","publication_status":"submitted"},{"citation":{"short":"K. Weinhäupl, Y. Wang, A. Hessel, M. Brennich, K. Lindorff-Larsen, P. Schanda, BioRxiv (n.d.).","chicago":"Weinhäupl, Katharina, Yong Wang, Audrey Hessel, Martha Brennich, Kresten Lindorff-Larsen, and Paul Schanda. “Architecture and Subunit Dynamics of the Mitochondrial TIM9·10·12 Chaperone.” <i>BioRxiv</i>. Cold Spring Harbor Laboratory, n.d. <a href=\"https://doi.org/10.1101/2020.03.13.990150\">https://doi.org/10.1101/2020.03.13.990150</a>.","ista":"Weinhäupl K, Wang Y, Hessel A, Brennich M, Lindorff-Larsen K, Schanda P. Architecture and subunit dynamics of the mitochondrial TIM9·10·12 chaperone. bioRxiv, <a href=\"https://doi.org/10.1101/2020.03.13.990150\">10.1101/2020.03.13.990150</a>.","ama":"Weinhäupl K, Wang Y, Hessel A, Brennich M, Lindorff-Larsen K, Schanda P. Architecture and subunit dynamics of the mitochondrial TIM9·10·12 chaperone. <i>bioRxiv</i>. doi:<a href=\"https://doi.org/10.1101/2020.03.13.990150\">10.1101/2020.03.13.990150</a>","apa":"Weinhäupl, K., Wang, Y., Hessel, A., Brennich, M., Lindorff-Larsen, K., &#38; Schanda, P. (n.d.). Architecture and subunit dynamics of the mitochondrial TIM9·10·12 chaperone. <i>bioRxiv</i>. Cold Spring Harbor Laboratory. <a href=\"https://doi.org/10.1101/2020.03.13.990150\">https://doi.org/10.1101/2020.03.13.990150</a>","mla":"Weinhäupl, Katharina, et al. “Architecture and Subunit Dynamics of the Mitochondrial TIM9·10·12 Chaperone.” <i>BioRxiv</i>, Cold Spring Harbor Laboratory, doi:<a href=\"https://doi.org/10.1101/2020.03.13.990150\">10.1101/2020.03.13.990150</a>.","ieee":"K. Weinhäupl, Y. Wang, A. Hessel, M. Brennich, K. Lindorff-Larsen, and P. Schanda, “Architecture and subunit dynamics of the mitochondrial TIM9·10·12 chaperone,” <i>bioRxiv</i>. Cold Spring Harbor Laboratory."},"oa_version":"Preprint","publication":"bioRxiv","type":"preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1101/2020.03.13.990150","_id":"8404","status":"public","author":[{"first_name":"Katharina","full_name":"Weinhäupl, Katharina","last_name":"Weinhäupl"},{"last_name":"Wang","first_name":"Yong","full_name":"Wang, Yong"},{"last_name":"Hessel","first_name":"Audrey","full_name":"Hessel, Audrey"},{"full_name":"Brennich, Martha","first_name":"Martha","last_name":"Brennich"},{"last_name":"Lindorff-Larsen","full_name":"Lindorff-Larsen, Kresten","first_name":"Kresten"},{"id":"7B541462-FAF6-11E9-A490-E8DFE5697425","full_name":"Schanda, Paul","first_name":"Paul","last_name":"Schanda","orcid":"0000-0002-9350-7606"}],"year":"2020","publisher":"Cold Spring Harbor Laboratory","date_published":"2020-03-14T00:00:00Z","month":"03","extern":"1","date_updated":"2021-01-12T08:19:03Z","publication_status":"submitted","abstract":[{"text":"<jats:p>The mitochondrial Tim chaperones are responsible for the transport of membrane proteins across the inter-membrane space to the inner and outer mitochondrial membranes. TIM9·10, a hexameric 70 kDa protein complex formed by 3 copies of Tim9 and Tim10, guides its clients across the aqueous compartment. The TIM9·10·12 complex is the anchor point at the inner-membrane insertase complex TIM22. The mechanism of client transport by TIM9·10 has been resolved recently, but the structure and subunit composition of the TIM9·10·12 complex remains largely unresolved. Furthermore, the assembly process of the hexameric TIM chaperones from its subunits remained elusive. We investigate the structural and dynamical properties of the Tim subunits, and show that they are highly dynamic. In their non-assembled form, the subunits behave as intrinsically disordered proteins; when the conserved cysteines of the CX<jats:sub>3</jats:sub>C-X<jats:sub><jats:italic>n</jats:italic></jats:sub>-CX<jats:sub>3</jats:sub>C motifs are formed, short marginally stable <jats:italic>α</jats:italic>-helices are formed, which are only fully stabilized upon hexamer formation to the mature chaperone. Subunits are in equilibrium between their hexamer-embedded and a free form, with exchange kinetics on a minutes time scale. Joint NMR, small-angle X-ray scattering and MD simulation data allow us to derive a structural model of the TIM9·10·12 assembly, which has a 2:3:1 stoichiometry (Tim9:Tim10:Tim12) with a conserved hydrophobic client-binding groove and flexible N- and C-terminal tentacles.</jats:p>","lang":"eng"}],"day":"14","article_processing_charge":"No","date_created":"2020-09-17T10:27:59Z","title":"Architecture and subunit dynamics of the mitochondrial TIM9·10·12 chaperone","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2020.03.13.990150"}],"oa":1,"language":[{"iso":"eng"}]},{"doi":"10.1515/9780691204932","edition":"1","_id":"8414","status":"public","year":"2020","page":"224","author":[{"first_name":"Vadim","full_name":"Kaloshin, Vadim","id":"FE553552-CDE8-11E9-B324-C0EBE5697425","orcid":"0000-0002-6051-2628","last_name":"Kaloshin"},{"last_name":"Zhang","full_name":"Zhang, Ke","first_name":"Ke"}],"quality_controlled":"1","intvolume":"       208","alternative_title":["Annals of Mathematics Studies"],"citation":{"mla":"Kaloshin, Vadim, and Ke Zhang. <i>Arnold Diffusion for Smooth Systems of Two and a Half Degrees of Freedom</i>. 1st ed., vol. 208, Princeton University Press, 2020, doi:<a href=\"https://doi.org/10.1515/9780691204932\">10.1515/9780691204932</a>.","ieee":"V. Kaloshin and K. Zhang, <i>Arnold Diffusion for Smooth Systems of Two and a Half Degrees of Freedom</i>, 1st ed., vol. 208. Princeton University Press, 2020.","ama":"Kaloshin V, Zhang K. <i>Arnold Diffusion for Smooth Systems of Two and a Half Degrees of Freedom</i>. Vol 208. 1st ed. Princeton University Press; 2020. doi:<a href=\"https://doi.org/10.1515/9780691204932\">10.1515/9780691204932</a>","apa":"Kaloshin, V., &#38; Zhang, K. (2020). <i>Arnold Diffusion for Smooth Systems of Two and a Half Degrees of Freedom</i> (1st ed., Vol. 208). Princeton University Press. <a href=\"https://doi.org/10.1515/9780691204932\">https://doi.org/10.1515/9780691204932</a>","ista":"Kaloshin V, Zhang K. 2020. Arnold Diffusion for Smooth Systems of Two and a Half Degrees of Freedom 1st ed., Princeton University Press, 224p.","short":"V. Kaloshin, K. Zhang, Arnold Diffusion for Smooth Systems of Two and a Half Degrees of Freedom, 1st ed., Princeton University Press, 2020.","chicago":"Kaloshin, Vadim, and Ke Zhang. <i>Arnold Diffusion for Smooth Systems of Two and a Half Degrees of Freedom</i>. 1st ed. Vol. 208. AMS. Princeton University Press, 2020. <a href=\"https://doi.org/10.1515/9780691204932\">https://doi.org/10.1515/9780691204932</a>."},"oa_version":"None","type":"book","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publication_identifier":{"isbn":["9-780-6912-0253-2"]},"article_processing_charge":"No","day":"01","abstract":[{"lang":"eng","text":"Arnold diffusion, which concerns the appearance of chaos in classical mechanics, is one of the most important problems in the fields of dynamical systems and mathematical physics. Since it was discovered by Vladimir Arnold in 1963, it has attracted the efforts of some of the most prominent researchers in mathematics. The question is whether a typical perturbation of a particular system will result in chaotic or unstable dynamical phenomena. In this groundbreaking book, Vadim Kaloshin and Ke Zhang provide the first complete proof of Arnold diffusion, demonstrating that that there is topological instability for typical perturbations of five-dimensional integrable systems (two and a half degrees of freedom).\r\nThis proof realizes a plan John Mather announced in 2003 but was unable to complete before his death. Kaloshin and Zhang follow Mather’s strategy but emphasize a more Hamiltonian approach, tying together normal forms theory, hyperbolic theory, Mather theory, and weak KAM theory. Offering a complete, clean, and modern explanation of the steps involved in the proof, and a clear account of background material, this book is designed to be accessible to students as well as researchers. The result is a critical contribution to mathematical physics and dynamical systems, especially Hamiltonian systems."}],"date_created":"2020-09-17T10:41:05Z","volume":208,"series_title":"AMS","title":"Arnold Diffusion for Smooth Systems of Two and a Half Degrees of Freedom","language":[{"iso":"eng"}],"publisher":"Princeton University Press","date_published":"2020-03-01T00:00:00Z","month":"03","extern":"1","publication_status":"published","date_updated":"2021-12-21T10:50:49Z","scopus_import":"1"},{"oa_version":"Published Version","file":[{"file_id":"8550","file_name":"2020_LIPIcs_Chatterjee.pdf","date_created":"2020-09-21T13:57:34Z","relation":"main_file","date_updated":"2020-09-21T13:57:34Z","creator":"dernst","access_level":"open_access","checksum":"bbd7c4f55d45f2ff2a0a4ef0e10a77b1","content_type":"application/pdf","file_size":491374,"success":1}],"alternative_title":["LIPIcs"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","short":"CC BY (3.0)","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png"},"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959771597"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","status":"public","year":"2020","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ec_funded":1,"publication_status":"published","date_updated":"2025-07-10T11:57:06Z","date_published":"2020-08-18T00:00:00Z","month":"08","article_processing_charge":"No","article_number":"22:1-22:13","department":[{"_id":"KrCh"}],"conference":{"name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2020-08-24","location":"Prague, Czech Republic","end_date":"2020-08-28"},"oa":1,"external_id":{"arxiv":["2007.02894"]},"ddc":["000"],"citation":{"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.","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>.","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.","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>"},"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.","intvolume":"       170","arxiv":1,"publication":"45th International Symposium on Mathematical Foundations of Computer Science","type":"conference","_id":"8533","doi":"10.4230/LIPIcs.MFCS.2020.22","project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020"}],"quality_controlled":"1","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389"},{"id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R","full_name":"Jecker, Ismael R","last_name":"Jecker"},{"id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","full_name":"Svoboda, Jakub","first_name":"Jakub","last_name":"Svoboda","orcid":"0000-0002-1419-3267"}],"scopus_import":"1","date_created":"2020-09-20T22:01:36Z","abstract":[{"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.","lang":"eng"}],"day":"18","language":[{"iso":"eng"}],"license":"https://creativecommons.org/licenses/by/3.0/","title":"Simplified game of life: Algorithms and complexity","volume":170,"file_date_updated":"2020-09-21T13:57:34Z"},{"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ec_funded":1,"date_updated":"2025-07-10T11:57:07Z","publication_status":"published","month":"08","date_published":"2020-08-18T00:00:00Z","article_processing_charge":"No","department":[{"_id":"KrCh"}],"conference":{"name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2020-08-24","location":"Prague, Czech Republic","end_date":"2020-08-28"},"article_number":"51:1-51:12","oa":1,"oa_version":"Published Version","file":[{"relation":"main_file","file_name":"2020_LIPIcsMFCS_Jecker.pdf","date_created":"2020-09-21T14:17:08Z","file_id":"8552","success":1,"creator":"dernst","content_type":"application/pdf","access_level":"open_access","checksum":"2dc9e2fad6becd4563aef3e27a473f70","file_size":597977,"date_updated":"2020-09-21T14:17:08Z"}],"alternative_title":["LIPIcs"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","short":"CC BY (3.0)","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png"},"publication_identifier":{"isbn":["9783959771597"],"issn":["1868-8969"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","has_accepted_license":"1","year":"2020","status":"public","scopus_import":"1","date_created":"2020-09-20T22:01:36Z","abstract":[{"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.","lang":"eng"}],"day":"18","language":[{"iso":"eng"}],"title":"Unary prime languages","volume":170,"file_date_updated":"2020-09-21T14:17:08Z","ddc":["000"],"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.","citation":{"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.","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>.","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>.","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>","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>"},"intvolume":"       170","publication":"45th International Symposium on Mathematical Foundations of Computer Science","type":"conference","_id":"8534","doi":"10.4230/LIPIcs.MFCS.2020.51","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020"}],"quality_controlled":"1","author":[{"first_name":"Ismael R","full_name":"Jecker, Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","last_name":"Jecker"},{"first_name":"Orna","full_name":"Kupferman, Orna","last_name":"Kupferman"},{"first_name":"Nicolas","full_name":"Mazzocchi, Nicolas","last_name":"Mazzocchi"}]},{"article_processing_charge":"No","article_number":"65","department":[{"_id":"ChWo"}],"oa":1,"publisher":"Association for Computing Machinery","acknowledged_ssus":[{"_id":"ScienComp"}],"ec_funded":1,"date_published":"2020-07-08T00:00:00Z","month":"07","article_type":"original","date_updated":"2026-04-16T08:26:38Z","publication_status":"published","corr_author":"1","has_accepted_license":"1","status":"public","issue":"4","year":"2020","file":[{"date_created":"2020-09-21T07:51:44Z","file_name":"2020_ACM_Skrivan.pdf","relation":"main_file","file_id":"8541","checksum":"c3a680893f01cc4a9e961ff0a4cfa12f","access_level":"open_access","content_type":"application/pdf","file_size":20223953,"creator":"dernst","success":1,"date_updated":"2020-09-21T07:51:44Z"}],"oa_version":"Published Version","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","day":"08","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."}],"date_created":"2020-09-20T22:01:37Z","title":"Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces","language":[{"iso":"eng"}],"file_date_updated":"2020-09-21T07:51:44Z","volume":39,"scopus_import":"1","isi":1,"doi":"10.1145/3386569.3392466","_id":"8535","project":[{"_id":"2533E772-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"638176","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program"}],"quality_controlled":"1","author":[{"id":"486A5A46-F248-11E8-B48F-1D18A9856A87","full_name":"Skrivan, Tomas","first_name":"Tomas","last_name":"Skrivan"},{"last_name":"Soderstrom","full_name":"Soderstrom, Andreas","first_name":"Andreas"},{"first_name":"John","full_name":"Johansson, John","last_name":"Johansson"},{"last_name":"Sprenger","first_name":"Christoph","full_name":"Sprenger, Christoph"},{"last_name":"Museth","full_name":"Museth, Ken","first_name":"Ken"},{"orcid":"0000-0001-6646-5546","last_name":"Wojtan","full_name":"Wojtan, Christopher J","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"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.","citation":{"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>.","short":"T. Skrivan, A. Soderstrom, J. Johansson, C. Sprenger, K. Museth, C. Wojtan, ACM Transactions on Graphics 39 (2020).","ista":"Skrivan T, Soderstrom A, Johansson J, Sprenger C, Museth K, Wojtan C. 2020. Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces. ACM Transactions on Graphics. 39(4), 65.","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."},"external_id":{"isi":["000583700300038"]},"ddc":["000"],"intvolume":"        39","type":"journal_article","publication":"ACM Transactions on Graphics"},{"year":"2020","status":"public","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_identifier":{"issn":["2157-8095"],"isbn":["9781728164328"]},"oa_version":"Preprint","oa":1,"conference":{"start_date":"2020-06-21","name":"ISIT: International Symposium on Information Theory","end_date":"2020-06-26","location":"Los Angeles, CA, United States"},"article_number":"401-406","department":[{"_id":"MaMo"}],"article_processing_charge":"No","publication_status":"published","date_updated":"2025-09-10T10:27:05Z","month":"06","date_published":"2020-06-01T00:00:00Z","publisher":"IEEE","author":[{"first_name":"Marco","full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","last_name":"Mondelli"},{"full_name":"Hashemi, Seyyed Ali","first_name":"Seyyed Ali","last_name":"Hashemi"},{"first_name":"John","full_name":"Cioffi, John","last_name":"Cioffi"},{"first_name":"Andrea","full_name":"Goldsmith, Andrea","last_name":"Goldsmith"}],"quality_controlled":"1","_id":"8536","doi":"10.1109/ISIT44484.2020.9174141","type":"conference","publication":"IEEE International Symposium on Information Theory - Proceedings","arxiv":1,"external_id":{"arxiv":["1909.04892"],"isi":["000714963400069"]},"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.","citation":{"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>","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>","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>.","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.","short":"M. Mondelli, S.A. Hashemi, J. Cioffi, A. Goldsmith, in:, IEEE International Symposium on Information Theory - Proceedings, IEEE, 2020.","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>.","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."},"volume":"2020-June","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1909.04892"}],"related_material":{"record":[{"id":"9047","relation":"later_version","status":"public"}]},"title":"Simplified successive cancellation decoding of polar codes has sublinear latency","date_created":"2020-09-20T22:01:37Z","abstract":[{"lang":"eng","text":"This work analyzes the latency of the simplified successive cancellation (SSC) decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It is shown that, unlike conventional successive cancellation decoding, where latency is linear in the block length, the latency of SSC decoding is sublinear. More specifically, the latency of SSC decoding is O(N 1−1/µ ), where N is the block length and µ is the scaling exponent of the channel, which captures the speed of convergence of the rate to capacity. Numerical results demonstrate the tightness of the bound and show that most of the latency reduction arises from the parallel decoding of subcodes of rate 0 and 1."}],"day":"01","isi":1,"scopus_import":"1"},{"publisher":"Société Mathématique de France","publication_status":"published","date_updated":"2023-08-22T09:27:57Z","date_published":"2020-06-01T00:00:00Z","month":"06","article_type":"original","department":[{"_id":"TaHa"}],"article_processing_charge":"No","oa":1,"oa_version":"Preprint","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_identifier":{"issn":["0012-9593"]},"status":"public","year":"2020","issue":"3","isi":1,"scopus_import":"1","date_created":"2020-09-20T22:01:38Z","day":"01","abstract":[{"text":"Cohomological and K-theoretic stable bases originated from the study of quantum cohomology and quantum K-theory. Restriction formula for cohomological stable bases played an important role in computing the quantum connection of cotangent bundle of partial flag varieties. In this paper we study the K-theoretic stable bases of cotangent bundles of flag varieties. We describe these bases in terms of the action of the affine Hecke algebra and the twisted group algebra of KostantKumar. Using this algebraic description and the method of root polynomials, we give a restriction formula of the stable bases. We apply it to obtain the restriction formula for partial flag varieties. We also build a relation between the stable basis and the Casselman basis in the principal series representations of the Langlands dual group. As an application, we give a closed formula for the transition matrix between Casselman basis and the characteristic functions.","lang":"eng"},{"lang":"fre","text":"Les bases stables cohomologiques et K-théoriques proviennent de l’étude de la cohomologie quantique et de la K-théorie quantique. La formule de restriction pour les bases stables cohomologiques a joué un rôle important dans le calcul de la connexion quantique du fibré cotangent de variétés de drapeaux partielles. Dans cet article, nous étudions les bases stables K-théoriques de fibré cotangents des variétés de drapeaux. Nous décrivons ces bases en fonction de l’action de l’algèbre de Hecke affine et de l’algèbre de Kostant-Kumar. En utilisant cette description algébrique et la méthode des polynômes de racine, nous donnons une formule de restriction des bases stables. Nous l’appliquons\r\npour obtenir la formule de restriction pour les variétés de drapeaux partielles. Nous construisons également une relation entre la base stable et la base de Casselman dans les représentations de la série principale du groupe dual de Langlands p-adique. Comme une application, nous donnons une formule close pour la matrice de transition entre la base de Casselman et les fonctions caractéristiques. "}],"volume":53,"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1708.08013"}],"title":"On the K-theory stable bases of the springer resolution","intvolume":"        53","arxiv":1,"external_id":{"arxiv":["1708.08013"],"isi":["000592182600004"]},"citation":{"ama":"Su C, Zhao G, Zhong C. On the K-theory stable bases of the springer resolution. <i>Annales Scientifiques de l’Ecole Normale Superieure</i>. 2020;53(3):663-671. doi:<a href=\"https://doi.org/10.24033/asens.2431\">10.24033/asens.2431</a>","apa":"Su, C., Zhao, G., &#38; Zhong, C. (2020). On the K-theory stable bases of the springer resolution. <i>Annales Scientifiques de l’Ecole Normale Superieure</i>. Société Mathématique de France. <a href=\"https://doi.org/10.24033/asens.2431\">https://doi.org/10.24033/asens.2431</a>","mla":"Su, C., et al. “On the K-Theory Stable Bases of the Springer Resolution.” <i>Annales Scientifiques de l’Ecole Normale Superieure</i>, vol. 53, no. 3, Société Mathématique de France, 2020, pp. 663–71, doi:<a href=\"https://doi.org/10.24033/asens.2431\">10.24033/asens.2431</a>.","ieee":"C. Su, G. Zhao, and C. Zhong, “On the K-theory stable bases of the springer resolution,” <i>Annales Scientifiques de l’Ecole Normale Superieure</i>, vol. 53, no. 3. Société Mathématique de France, pp. 663–671, 2020.","short":"C. Su, G. Zhao, C. Zhong, Annales Scientifiques de l’Ecole Normale Superieure 53 (2020) 663–671.","chicago":"Su, C., Gufang Zhao, and C. Zhong. “On the K-Theory Stable Bases of the Springer Resolution.” <i>Annales Scientifiques de l’Ecole Normale Superieure</i>. Société Mathématique de France, 2020. <a href=\"https://doi.org/10.24033/asens.2431\">https://doi.org/10.24033/asens.2431</a>.","ista":"Su C, Zhao G, Zhong C. 2020. On the K-theory stable bases of the springer resolution. Annales Scientifiques de l’Ecole Normale Superieure. 53(3), 663–671."},"type":"journal_article","publication":"Annales Scientifiques de l'Ecole Normale Superieure","_id":"8539","doi":"10.24033/asens.2431","author":[{"last_name":"Su","first_name":"C.","full_name":"Su, C."},{"full_name":"Zhao, Gufang","first_name":"Gufang","id":"2BC2AC5E-F248-11E8-B48F-1D18A9856A87","last_name":"Zhao"},{"last_name":"Zhong","first_name":"C.","full_name":"Zhong, C."}],"page":"663-671","quality_controlled":"1"},{"scopus_import":"1","isi":1,"related_material":{"record":[{"status":"public","id":"8761","relation":"research_data"},{"relation":"dissertation_contains","id":"8366","status":"public"}],"link":[{"description":"News on IST Homepage","url":"https://ist.ac.at/en/news/bend-dont-break/","relation":"press_release"}]},"language":[{"iso":"eng"}],"title":"Computational design of cold bent glass façades","volume":39,"file_date_updated":"2023-05-23T20:54:43Z","date_created":"2020-09-23T11:30:02Z","day":"26","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."}],"type":"journal_article","publication":"ACM Transactions on Graphics","ddc":["000"],"external_id":{"isi":["000595589100048"],"arxiv":["2009.03667"]},"citation":{"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>.","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.","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>","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.","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>."},"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.","intvolume":"        39","arxiv":1,"quality_controlled":"1","author":[{"first_name":"Konstantinos","full_name":"Gavriil, Konstantinos","last_name":"Gavriil"},{"full_name":"Guseinov, Ruslan","first_name":"Ruslan","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9819-5077","last_name":"Guseinov"},{"last_name":"Perez Rodriguez","full_name":"Perez Rodriguez, Jesus","first_name":"Jesus","id":"2DC83906-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Davide","full_name":"Pellis, Davide","last_name":"Pellis"},{"orcid":"0000-0002-5198-7445","last_name":"Henderson","full_name":"Henderson, Paul M","first_name":"Paul M","id":"13C09E74-18D9-11E9-8878-32CFE5697425"},{"first_name":"Florian","full_name":"Rist, Florian","last_name":"Rist"},{"full_name":"Pottmann, Helmut","first_name":"Helmut","last_name":"Pottmann"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd","first_name":"Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385"}],"_id":"8562","doi":"10.1145/3414685.3417843","project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"date_updated":"2026-04-08T07:25:22Z","publication_status":"published","date_published":"2020-11-26T00:00:00Z","article_type":"original","month":"11","acknowledged_ssus":[{"_id":"ScienComp"}],"publisher":"Association for Computing Machinery","ec_funded":1,"oa":1,"article_processing_charge":"No","department":[{"_id":"BeBi"}],"article_number":"208","publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Submitted Version","file":[{"relation":"main_file","file_name":"coldglass.pdf","date_created":"2023-05-23T20:54:43Z","file_id":"13084","success":1,"creator":"bbickel","content_type":"application/pdf","checksum":"c7f67717ad74e670b7daeae732abe151","file_size":28964641,"access_level":"open_access","date_updated":"2023-05-23T20:54:43Z"}],"issue":"6","status":"public","year":"2020","has_accepted_license":"1","corr_author":"1"},{"file_date_updated":"2020-10-19T10:12:29Z","title":"Optogenetic alteration of hippocampal network activity","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"8740"}]},"oa":1,"department":[{"_id":"JoCs"}],"day":"19","article_processing_charge":"No","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"}],"date_created":"2020-09-23T14:39:54Z","month":"10","date_published":"2020-10-19T00:00:00Z","contributor":[{"orcid":"0000-0002-5193-4036","contributor_type":"project_leader","last_name":"Csicsvari","first_name":"Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2026-04-07T08:37:11Z","publisher":"Institute of Science and Technology Austria","status":"public","author":[{"orcid":"0000-0002-5193-4036","last_name":"Csicsvari","full_name":"Csicsvari, Jozsef L","first_name":"Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-1807-1929","last_name":"Gridchyn","full_name":"Gridchyn, Igor","first_name":"Igor","id":"4B60654C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Schönenberger, Philipp","first_name":"Philipp","id":"3B9D816C-F248-11E8-B48F-1D18A9856A87","last_name":"Schönenberger"}],"year":"2020","has_accepted_license":"1","corr_author":"1","doi":"10.15479/AT:ISTA:8563","_id":"8563","type":"research_data","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"citation":{"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>.","short":"J.L. Csicsvari, I. Gridchyn, P. Schönenberger, (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>.","ieee":"J. L. Csicsvari, I. Gridchyn, and P. Schönenberger, “Optogenetic alteration of hippocampal network activity.” Institute of Science and Technology Austria, 2020.","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>","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>"},"file":[{"file_name":"upload.tgz","date_created":"2020-09-23T14:36:17Z","relation":"main_file","file_id":"8564","creator":"jozsef","access_level":"open_access","content_type":"application/x-compressed","file_size":145243906,"checksum":"a16098a6d172f9c42ab5af5f6991668c","success":1,"date_updated":"2020-09-23T14:36:17Z"},{"date_updated":"2020-10-19T10:12:29Z","creator":"jozsef","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","checksum":"0bfc54b7e14c0694cd081617318ba606","access_level":"open_access","file_size":11648,"success":1,"file_id":"8675","file_name":"redme.docx","date_created":"2020-10-19T10:12:29Z","relation":"main_file"}],"ddc":["570"],"oa_version":"Published Version"},{"oa_version":"Published Version","file":[{"creator":"dernst","access_level":"open_access","content_type":"application/pdf","checksum":"eada7bc8dd16a49390137cff882ef328","file_size":1822469,"success":1,"date_updated":"2020-09-28T13:16:15Z","file_name":"2020_NatureComm_Prehal.pdf","date_created":"2020-09-28T13:16:15Z","relation":"main_file","file_id":"8585"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"publication_identifier":{"issn":["2041-1723"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","has_accepted_license":"1","status":"public","year":"2020","publisher":"Springer Nature","date_updated":"2025-06-12T06:58:51Z","publication_status":"published","month":"09","article_type":"original","date_published":"2020-09-24T00:00:00Z","article_processing_charge":"No","article_number":"4838","department":[{"_id":"StFr"}],"oa":1,"external_id":{"pmid":["32973214"],"isi":["000573756600004"]},"ddc":["530"],"citation":{"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>","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>","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>.","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.","short":"C. Prehal, H. Fitzek, G. Kothleitner, V. Presser, B. Gollas, S.A. Freunberger, Q. Abbas, Nature Communications 11 (2020).","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>.","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."},"intvolume":"        11","type":"journal_article","publication":"Nature Communications","_id":"8568","doi":"10.1038/s41467-020-18610-6","quality_controlled":"1","author":[{"last_name":"Prehal","first_name":"Christian","full_name":"Prehal, Christian"},{"last_name":"Fitzek","full_name":"Fitzek, Harald","first_name":"Harald"},{"full_name":"Kothleitner, Gerald","first_name":"Gerald","last_name":"Kothleitner"},{"last_name":"Presser","full_name":"Presser, Volker","first_name":"Volker"},{"last_name":"Gollas","full_name":"Gollas, Bernhard","first_name":"Bernhard"},{"first_name":"Stefan Alexander","full_name":"Freunberger, Stefan Alexander","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","orcid":"0000-0003-2902-5319","last_name":"Freunberger"},{"last_name":"Abbas","first_name":"Qamar","full_name":"Abbas, Qamar"}],"pmid":1,"scopus_import":"1","isi":1,"date_created":"2020-09-25T07:23:13Z","day":"24","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."}],"related_material":{"link":[{"url":"https://doi.org/10.1038/s41467-020-19720-x","relation":"erratum"}]},"language":[{"iso":"eng"}],"title":"Persistent and reversible solid iodine electrodeposition in nanoporous carbons","keyword":["General Biochemistry","Genetics and Molecular Biology","General Physics and Astronomy","General Chemistry"],"volume":11,"file_date_updated":"2020-09-28T13:16:15Z"}]