[{"department":[{"_id":"ToHe"}],"date_created":"2022-05-08T22:01:44Z","external_id":{"isi":["000782393600001"]},"publication_status":"published","related_material":{"record":[{"relation":"extended_version","id":"17094","status":"public"}]},"author":[{"full_name":"Bartocci, Ezio","last_name":"Bartocci","first_name":"Ezio"},{"full_name":"Ferrere, Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","last_name":"Ferrere","first_name":"Thomas","orcid":"0000-0001-5199-3143"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Nickovic, Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic","first_name":"Dejan"},{"full_name":"Da Costa, Ana Oliveira","first_name":"Ana Oliveira","last_name":"Da Costa"}],"alternative_title":["LNCS"],"month":"03","type":"conference","file":[{"access_level":"open_access","relation":"main_file","file_name":"2022_LNCS_Bartocci.pdf","date_updated":"2022-05-09T06:52:44Z","date_created":"2022-05-09T06:52:44Z","creator":"dernst","file_id":"11357","success":1,"checksum":"7f6f860b20b8de2a249e9c1b4eee15cf","file_size":479146,"content_type":"application/pdf"}],"page":"3-22","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"status":"public","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"citation":{"apa":"Bartocci, E., Ferrere, T., Henzinger, T. A., Nickovic, D., &#38; Da Costa, A. O. (2022). Information-flow interfaces. In <i>Fundamental Approaches to Software Engineering</i> (Vol. 13241, pp. 3–22). Munich, Germany: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-99429-7_1\">https://doi.org/10.1007/978-3-030-99429-7_1</a>","chicago":"Bartocci, Ezio, Thomas Ferrere, Thomas A Henzinger, Dejan Nickovic, and Ana Oliveira Da Costa. “Information-Flow Interfaces.” In <i>Fundamental Approaches to Software Engineering</i>, 13241:3–22. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-030-99429-7_1\">https://doi.org/10.1007/978-3-030-99429-7_1</a>.","ama":"Bartocci E, Ferrere T, Henzinger TA, Nickovic D, Da Costa AO. Information-flow interfaces. In: <i>Fundamental Approaches to Software Engineering</i>. Vol 13241. Springer Nature; 2022:3-22. doi:<a href=\"https://doi.org/10.1007/978-3-030-99429-7_1\">10.1007/978-3-030-99429-7_1</a>","short":"E. Bartocci, T. Ferrere, T.A. Henzinger, D. Nickovic, A.O. Da Costa, in:, Fundamental Approaches to Software Engineering, Springer Nature, 2022, pp. 3–22.","ista":"Bartocci E, Ferrere T, Henzinger TA, Nickovic D, Da Costa AO. 2022. Information-flow interfaces. Fundamental Approaches to Software Engineering. FASE: Fundamental Approaches to Software Engineering, LNCS, vol. 13241, 3–22.","ieee":"E. Bartocci, T. Ferrere, T. A. Henzinger, D. Nickovic, and A. O. Da Costa, “Information-flow interfaces,” in <i>Fundamental Approaches to Software Engineering</i>, Munich, Germany, 2022, vol. 13241, pp. 3–22.","mla":"Bartocci, Ezio, et al. “Information-Flow Interfaces.” <i>Fundamental Approaches to Software Engineering</i>, vol. 13241, Springer Nature, 2022, pp. 3–22, doi:<a href=\"https://doi.org/10.1007/978-3-030-99429-7_1\">10.1007/978-3-030-99429-7_1</a>."},"oa":1,"date_updated":"2025-12-30T06:50:51Z","isi":1,"title":"Information-flow interfaces","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","day":"29","acknowledgement":"This project has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 956123 and was funded in part by the FWF project W1255-N23 and by the ERC-2020-AdG 101020093.","file_date_updated":"2022-05-09T06:52:44Z","scopus_import":"1","_id":"11355","year":"2022","ddc":["000"],"oa_version":"Published Version","publication_identifier":{"isbn":["9783030994280"],"issn":["0302-9743"],"eissn":["1611-3349"]},"conference":{"end_date":"2022-04-07","location":"Munich, Germany","start_date":"2022-04-02","name":"FASE: Fundamental Approaches to Software Engineering"},"doi":"10.1007/978-3-030-99429-7_1","quality_controlled":"1","has_accepted_license":"1","abstract":[{"lang":"eng","text":"Contract-based design is a promising methodology for taming the complexity of developing sophisticated systems. A formal contract distinguishes between assumptions, which are constraints that the designer of a component puts on the environments in which the component can be used safely, and guarantees, which are promises that the designer asks from the team that implements the component. A theory of formal contracts can be formalized as an interface theory, which supports the composition and refinement of both assumptions and guarantees.\r\nAlthough there is a rich landscape of contract-based design methods that address functional and extra-functional properties, we present the first interface theory that is designed for ensuring system-wide security properties. Our framework provides a refinement relation and a composition operation that support both incremental design and independent implementability. We develop our theory for both stateless and stateful interfaces. We illustrate the applicability of our framework with an example inspired from the automotive domain."}],"publisher":"Springer Nature","article_processing_charge":"No","language":[{"iso":"eng"}],"ec_funded":1,"volume":13241,"date_published":"2022-03-29T00:00:00Z","publication":"Fundamental Approaches to Software Engineering","intvolume":"     13241"},{"acknowledgement":"This work was supported by the National Science Fund for Distinguished Young Scholars (51925101), National Key Research and Development Program of China (2018YFA0702100), 111 Project (B17002), and Lise Meitner Project (M2889-N).","day":"15","issue":"11","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11356","scopus_import":"1","date_updated":"2026-06-18T10:50:26Z","citation":{"ieee":"C. Chang, B. Qin, L. Su, and L. D. Zhao, “Distinct electron and hole transports in SnSe crystals,” <i>Science Bulletin</i>, vol. 67, no. 11. Elsevier, pp. 1105–1107, 2022.","mla":"Chang, Cheng, et al. “Distinct Electron and Hole Transports in SnSe Crystals.” <i>Science Bulletin</i>, vol. 67, no. 11, Elsevier, 2022, pp. 1105–07, doi:<a href=\"https://doi.org/10.1016/j.scib.2022.04.007\">10.1016/j.scib.2022.04.007</a>.","ista":"Chang C, Qin B, Su L, Zhao LD. 2022. Distinct electron and hole transports in SnSe crystals. Science Bulletin. 67(11), 1105–1107.","short":"C. Chang, B. Qin, L. Su, L.D. Zhao, Science Bulletin 67 (2022) 1105–1107.","ama":"Chang C, Qin B, Su L, Zhao LD. Distinct electron and hole transports in SnSe crystals. <i>Science Bulletin</i>. 2022;67(11):1105-1107. doi:<a href=\"https://doi.org/10.1016/j.scib.2022.04.007\">10.1016/j.scib.2022.04.007</a>","chicago":"Chang, Cheng, Bingchao Qin, Lizhong Su, and Li Dong Zhao. “Distinct Electron and Hole Transports in SnSe Crystals.” <i>Science Bulletin</i>. Elsevier, 2022. <a href=\"https://doi.org/10.1016/j.scib.2022.04.007\">https://doi.org/10.1016/j.scib.2022.04.007</a>.","apa":"Chang, C., Qin, B., Su, L., &#38; Zhao, L. D. (2022). Distinct electron and hole transports in SnSe crystals. <i>Science Bulletin</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.scib.2022.04.007\">https://doi.org/10.1016/j.scib.2022.04.007</a>"},"oa":1,"project":[{"_id":"9B8804FC-BA93-11EA-9121-9846C619BF3A","name":"Bottom-up Engineering for Thermoelectric Applications","grant_number":"M02889"}],"title":"Distinct electron and hole transports in SnSe crystals","isi":1,"page":"1105-1107","type":"journal_article","month":"06","status":"public","external_id":{"isi":["000835291100006"],"pmid":["36545972"]},"date_created":"2022-05-08T22:01:44Z","department":[{"_id":"MaIb"}],"pmid":1,"author":[{"id":"9E331C2E-9F27-11E9-AE48-5033E6697425","first_name":"Cheng","orcid":"0000-0002-9515-4277","last_name":"Chang","full_name":"Chang, Cheng"},{"full_name":"Qin, Bingchao","first_name":"Bingchao","last_name":"Qin"},{"first_name":"Lizhong","last_name":"Su","full_name":"Su, Lizhong"},{"full_name":"Zhao, Li Dong","last_name":"Zhao","first_name":"Li Dong"}],"publication_status":"published","intvolume":"        67","date_published":"2022-06-15T00:00:00Z","publication":"Science Bulletin","volume":67,"main_file_link":[{"url":"https://doi.org/10.1016/j.scib.2022.04.007","open_access":"1"}],"publisher":"Elsevier","language":[{"iso":"eng"}],"article_processing_charge":"No","publication_identifier":{"eissn":["2095-9281"],"issn":["2095-9273"]},"quality_controlled":"1","doi":"10.1016/j.scib.2022.04.007","year":"2022","article_type":"letter_note","ddc":["530"],"oa_version":"Published Version"},{"year":"2022","oa_version":"Preprint","doi":"10.48550/arXiv.2204.07373","abstract":[{"lang":"eng","text":"Adversarial training (i.e., training on adversarially perturbed input data) is a well-studied method for making neural networks robust to potential adversarial attacks during inference. However, the improved robustness does not\r\ncome for free but rather is accompanied by a decrease in overall model accuracy and performance. Recent work has shown that, in practical robot learning applications, the effects of adversarial training do not pose a fair trade-off\r\nbut inflict a net loss when measured in holistic robot performance. This work revisits the robustness-accuracy trade-off in robot learning by systematically analyzing if recent advances in robust training methods and theory in\r\nconjunction with adversarial robot learning can make adversarial training suitable for real-world robot applications. We evaluate a wide variety of robot learning tasks ranging from autonomous driving in a high-fidelity environment\r\namenable to sim-to-real deployment, to mobile robot gesture recognition. Our results demonstrate that, while these techniques make incremental improvements on the trade-off on a relative scale, the negative side-effects caused by\r\nadversarial training still outweigh the improvements by an order of magnitude. We conclude that more substantial advances in robust learning methods are necessary before they can benefit robot learning tasks in practice."}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2204.07373","open_access":"1"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"ec_funded":1,"publication":"arXiv","date_published":"2022-04-15T00:00:00Z","department":[{"_id":"ToHe"}],"date_created":"2022-05-12T13:20:17Z","external_id":{"arxiv":["2204.07373"]},"publication_status":"draft","related_material":{"record":[{"status":"public","id":"12704","relation":"later_version"},{"id":"11362","status":"public","relation":"dissertation_contains"}]},"author":[{"first_name":"Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias"},{"last_name":"Amini","first_name":"Alexander","full_name":"Amini, Alexander"},{"full_name":"Rus, Daniela","last_name":"Rus","first_name":"Daniela"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724","first_name":"Thomas A"}],"type":"preprint","month":"04","status":"public","project":[{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"oa":1,"citation":{"short":"M. Lechner, A. Amini, D. Rus, T.A. Henzinger, ArXiv (n.d.).","ista":"Lechner M, Amini A, Rus D, Henzinger TA. Revisiting the adversarial robustness-accuracy tradeoff in robot learning. arXiv, 2204.07373.","mla":"Lechner, Mathias, et al. “Revisiting the Adversarial Robustness-Accuracy Tradeoff in Robot Learning.” <i>ArXiv</i>, 2204.07373, doi:<a href=\"https://doi.org/10.48550/arXiv.2204.07373\">10.48550/arXiv.2204.07373</a>.","ieee":"M. Lechner, A. Amini, D. Rus, and T. A. Henzinger, “Revisiting the adversarial robustness-accuracy tradeoff in robot learning,” <i>arXiv</i>. .","apa":"Lechner, M., Amini, A., Rus, D., &#38; Henzinger, T. A. (n.d.). Revisiting the adversarial robustness-accuracy tradeoff in robot learning. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2204.07373\">https://doi.org/10.48550/arXiv.2204.07373</a>","ama":"Lechner M, Amini A, Rus D, Henzinger TA. Revisiting the adversarial robustness-accuracy tradeoff in robot learning. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2204.07373\">10.48550/arXiv.2204.07373</a>","chicago":"Lechner, Mathias, Alexander Amini, Daniela Rus, and Thomas A Henzinger. “Revisiting the Adversarial Robustness-Accuracy Tradeoff in Robot Learning.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2204.07373\">https://doi.org/10.48550/arXiv.2204.07373</a>."},"date_updated":"2026-04-07T14:21:58Z","arxiv":1,"corr_author":"1","OA_place":"repository","title":"Revisiting the adversarial robustness-accuracy tradeoff in robot learning","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"2204.07373","day":"15","acknowledgement":"This work was supported in parts by the ERC-2020-AdG 101020093, National Science Foundation (NSF), and JP\r\nMorgan Graduate Fellowships. We thank Christoph Lampert for inspiring this work.\r\n","_id":"11366"},{"date_created":"2022-05-15T22:01:41Z","external_id":{"pmid":["35405074"],"isi":["000809056900019"],"arxiv":["2109.00556"]},"department":[{"_id":"MaSe"}],"pmid":1,"author":[{"last_name":"Winterer","first_name":"Felix","full_name":"Winterer, Felix"},{"last_name":"Seiler","first_name":"Anna M.","full_name":"Seiler, Anna M."},{"full_name":"Ghazaryan, Areg","last_name":"Ghazaryan","orcid":"0000-0001-9666-3543","first_name":"Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Geisenhof, Fabian R.","last_name":"Geisenhof","first_name":"Fabian R."},{"full_name":"Watanabe, Kenji","first_name":"Kenji","last_name":"Watanabe"},{"last_name":"Taniguchi","first_name":"Takashi","full_name":"Taniguchi, Takashi"},{"full_name":"Serbyn, Maksym","last_name":"Serbyn","first_name":"Maksym","orcid":"0000-0002-2399-5827","id":"47809E7E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Weitz","first_name":"R. Thomas","full_name":"Weitz, R. Thomas"}],"publication_status":"published","page":"3317-3322","type":"journal_article","month":"04","status":"public","date_updated":"2025-06-11T13:47:08Z","oa":1,"citation":{"chicago":"Winterer, Felix, Anna M. Seiler, Areg Ghazaryan, Fabian R. Geisenhof, Kenji Watanabe, Takashi Taniguchi, Maksym Serbyn, and R. Thomas Weitz. “Spontaneous Gully-Polarized Quantum Hall States in ABA Trilayer Graphene.” <i>Nano Letters</i>. American Chemical Society, 2022. <a href=\"https://doi.org/10.1021/acs.nanolett.2c00435\">https://doi.org/10.1021/acs.nanolett.2c00435</a>.","ama":"Winterer F, Seiler AM, Ghazaryan A, et al. Spontaneous gully-polarized quantum hall states in ABA trilayer graphene. <i>Nano Letters</i>. 2022;22(8):3317-3322. doi:<a href=\"https://doi.org/10.1021/acs.nanolett.2c00435\">10.1021/acs.nanolett.2c00435</a>","apa":"Winterer, F., Seiler, A. M., Ghazaryan, A., Geisenhof, F. R., Watanabe, K., Taniguchi, T., … Weitz, R. T. (2022). Spontaneous gully-polarized quantum hall states in ABA trilayer graphene. <i>Nano Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.nanolett.2c00435\">https://doi.org/10.1021/acs.nanolett.2c00435</a>","mla":"Winterer, Felix, et al. “Spontaneous Gully-Polarized Quantum Hall States in ABA Trilayer Graphene.” <i>Nano Letters</i>, vol. 22, no. 8, American Chemical Society, 2022, pp. 3317–22, doi:<a href=\"https://doi.org/10.1021/acs.nanolett.2c00435\">10.1021/acs.nanolett.2c00435</a>.","ieee":"F. Winterer <i>et al.</i>, “Spontaneous gully-polarized quantum hall states in ABA trilayer graphene,” <i>Nano Letters</i>, vol. 22, no. 8. American Chemical Society, pp. 3317–3322, 2022.","short":"F. Winterer, A.M. Seiler, A. Ghazaryan, F.R. Geisenhof, K. Watanabe, T. Taniguchi, M. Serbyn, R.T. Weitz, Nano Letters 22 (2022) 3317–3322.","ista":"Winterer F, Seiler AM, Ghazaryan A, Geisenhof FR, Watanabe K, Taniguchi T, Serbyn M, Weitz RT. 2022. Spontaneous gully-polarized quantum hall states in ABA trilayer graphene. Nano Letters. 22(8), 3317–3322."},"title":"Spontaneous gully-polarized quantum hall states in ABA trilayer graphene","isi":1,"arxiv":1,"acknowledgement":"We acknowledge funding from the Center for Nanoscience (CeNS) and by the Deutsche\r\nForschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy-EXC-2111-390814868 (MCQST). K.W. and T.T. acknowledge support from the Elemental Strategy Initiative conducted by the MEXT, Japan (Grant Number PMXP0112101001) and JSPS KAKENHI (Grant Numbers 19H05790 and JP20H00354).","day":"27","issue":"8","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11379","scopus_import":"1","year":"2022","article_type":"original","oa_version":"Preprint","publication_identifier":{"issn":["1530-6984"],"eissn":["1530-6992"]},"quality_controlled":"1","doi":"10.1021/acs.nanolett.2c00435","publisher":"American Chemical Society","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2109.00556","open_access":"1"}],"abstract":[{"text":"Bernal-stacked multilayer graphene is a versatile platform to explore quantum transport phenomena and interaction physics due to its exceptional tunability via electrostatic gating. For instance, upon applying a perpendicular electric field, its band structure exhibits several off-center Dirac points (so-called Dirac gullies) in each valley. Here, the formation of Dirac gullies and the interaction-induced breakdown of gully coherence is explored via magnetotransport measurements in high-quality Bernal-stacked (ABA) trilayer graphene. At zero magnetic field, multiple Lifshitz transitions indicating the formation of Dirac gullies are identified. In the quantum Hall regime, the emergence of Dirac gullies is evident as an increase in Landau level degeneracy. When tuning both electric and magnetic fields, electron–electron interactions can be controllably enhanced until, beyond critical electric and magnetic fields, the gully degeneracy is eventually lifted. The arising correlated ground state is consistent with a previously predicted nematic phase that spontaneously breaks the rotational gully symmetry.","lang":"eng"}],"language":[{"iso":"eng"}],"article_processing_charge":"No","intvolume":"        22","date_published":"2022-04-27T00:00:00Z","publication":"Nano Letters","volume":22},{"type":"journal_article","month":"05","file":[{"file_name":"2022_JourChemPhysics_Palaia.pdf","date_updated":"2022-05-23T07:45:33Z","date_created":"2022-05-23T07:45:33Z","access_level":"open_access","relation":"main_file","creator":"dernst","file_size":6387208,"content_type":"application/pdf","success":1,"file_id":"11405","checksum":"7fada58059676a4bb0944b82247af740"}],"keyword":["Physical and Theoretical Chemistry","General Physics and Astronomy"],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"status":"public","external_id":{"pmid":["35597653"],"isi":["000797236000004"]},"date_created":"2022-05-22T17:04:48Z","department":[{"_id":"AnSa"}],"pmid":1,"author":[{"full_name":"Palaia, Ivan","first_name":"Ivan","orcid":" 0000-0002-8843-9485 ","last_name":"Palaia","id":"9c805cd2-4b75-11ec-a374-db6dd0ed57fa"},{"full_name":"Šarić, Anđela","id":"bf63d406-f056-11eb-b41d-f263a6566d8b","last_name":"Šarić","first_name":"Anđela","orcid":"0000-0002-7854-2139"}],"publication_status":"published","day":"16","article_number":"194902","acknowledgement":"The authors thank Longhui Zeng and Xiaolei Su (Yale University) for bringing the topic to their attention and for useful comments. This work has received funding from the European Research Council under the European Union’s Horizon\r\n2020 research and innovation program (ERC Grant No. 802960 and Marie Skłodowska-Curie Grant No. 101034413). The authors are grateful to the UK Materials and Molecular Modeling Hub for computational resources, which is partially funded by EPSRC (Grant Nos. EP/P020194/1 and EP/T022213/1). The authors acknowledge support from ISTA and from the Royal Society (Grant No. UF160266).","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"19","_id":"11400","scopus_import":"1","file_date_updated":"2022-05-23T07:45:33Z","date_updated":"2025-06-11T14:00:32Z","project":[{"grant_number":"802960","call_identifier":"H2020","name":"Non-Equilibrium Protein Assembly: from Building Blocks to Biological Machines","_id":"eba2549b-77a9-11ec-83b8-a81e493eae4e"},{"call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"citation":{"short":"I. Palaia, A. Šarić, The Journal of Chemical Physics 156 (2022).","ista":"Palaia I, Šarić A. 2022. Controlling cluster size in 2D phase-separating binary mixtures with specific interactions. The Journal of Chemical Physics. 156(19), 194902.","mla":"Palaia, Ivan, and Anđela Šarić. “Controlling Cluster Size in 2D Phase-Separating Binary Mixtures with Specific Interactions.” <i>The Journal of Chemical Physics</i>, vol. 156, no. 19, 194902, AIP Publishing, 2022, doi:<a href=\"https://doi.org/10.1063/5.0087769\">10.1063/5.0087769</a>.","ieee":"I. Palaia and A. Šarić, “Controlling cluster size in 2D phase-separating binary mixtures with specific interactions,” <i>The Journal of Chemical Physics</i>, vol. 156, no. 19. AIP Publishing, 2022.","apa":"Palaia, I., &#38; Šarić, A. (2022). Controlling cluster size in 2D phase-separating binary mixtures with specific interactions. <i>The Journal of Chemical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0087769\">https://doi.org/10.1063/5.0087769</a>","chicago":"Palaia, Ivan, and Anđela Šarić. “Controlling Cluster Size in 2D Phase-Separating Binary Mixtures with Specific Interactions.” <i>The Journal of Chemical Physics</i>. AIP Publishing, 2022. <a href=\"https://doi.org/10.1063/5.0087769\">https://doi.org/10.1063/5.0087769</a>.","ama":"Palaia I, Šarić A. Controlling cluster size in 2D phase-separating binary mixtures with specific interactions. <i>The Journal of Chemical Physics</i>. 2022;156(19). doi:<a href=\"https://doi.org/10.1063/5.0087769\">10.1063/5.0087769</a>"},"oa":1,"title":"Controlling cluster size in 2D phase-separating binary mixtures with specific interactions","isi":1,"corr_author":"1","publication_identifier":{"issn":["0021-9606"],"eissn":["1089-7690"]},"has_accepted_license":"1","doi":"10.1063/5.0087769","quality_controlled":"1","year":"2022","article_type":"original","oa_version":"Published Version","ddc":["540"],"intvolume":"       156","ec_funded":1,"volume":156,"publication":"The Journal of Chemical Physics","date_published":"2022-05-16T00:00:00Z","publisher":"AIP Publishing","abstract":[{"text":"By varying the concentration of molecules in the cytoplasm or on the membrane, cells can induce the formation of condensates and liquid droplets, similar to phase separation. Their thermodynamics, much studied, depends on the mutual interactions between microscopic constituents. Here, we focus on the kinetics and size control of 2D clusters, forming on membranes. Using molecular dynamics of patchy colloids, we model a system of two species of proteins, giving origin to specific heterotypic bonds. We find that concentrations, together with valence and bond strength, control both the size and the growth time rate of the clusters. In particular, if one species is in large excess, it gradually saturates the binding sites of the other species; the system then becomes kinetically arrested and cluster coarsening slows down or stops, thus yielding effective size selection. This phenomenology is observed both in solid and fluid clusters, which feature additional generic homotypic interactions and are reminiscent of the ones observed on biological membranes.","lang":"eng"}],"article_processing_charge":"No","language":[{"iso":"eng"}]},{"external_id":{"isi":["000794880200001"]},"date_created":"2022-05-22T22:01:40Z","department":[{"_id":"MaIb"}],"author":[{"full_name":"Nguyen, Van Quang","last_name":"Nguyen","first_name":"Van Quang"},{"last_name":"Trinh","first_name":"Thi Ly","full_name":"Trinh, Thi Ly"},{"full_name":"Chang, Cheng","orcid":"0000-0002-9515-4277","first_name":"Cheng","last_name":"Chang","id":"9E331C2E-9F27-11E9-AE48-5033E6697425"},{"full_name":"Zhao, Li Dong","first_name":"Li Dong","last_name":"Zhao"},{"last_name":"Nguyen","first_name":"Thi Huong","full_name":"Nguyen, Thi Huong"},{"full_name":"Duong, Van Thiet","first_name":"Van Thiet","last_name":"Duong"},{"first_name":"Anh Tuan","last_name":"Duong","full_name":"Duong, Anh Tuan"},{"full_name":"Park, Jong Ho","first_name":"Jong Ho","last_name":"Park"},{"first_name":"Sudong","last_name":"Park","full_name":"Park, Sudong"},{"full_name":"Kim, Jungdae","first_name":"Jungdae","last_name":"Kim"},{"full_name":"Cho, Sunglae","last_name":"Cho","first_name":"Sunglae"}],"publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","date_created":"2022-05-23T06:47:57Z","date_updated":"2022-05-23T06:47:57Z","file_name":"2022_NPGAsiaMaterials_Nguyen.pdf","creator":"dernst","success":1,"file_id":"11404","checksum":"0579997cc1d28bf66e29357e08e3e39d","content_type":"application/pdf","file_size":6202545}],"type":"journal_article","month":"05","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"status":"public","date_updated":"2023-08-03T07:13:58Z","citation":{"mla":"Nguyen, Van Quang, et al. “Unidentified Major P-Type Source in SnSe: Multivacancies.” <i>NPG Asia Materials</i>, vol. 14, 42, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1038/s41427-022-00393-5\">10.1038/s41427-022-00393-5</a>.","ieee":"V. Q. Nguyen <i>et al.</i>, “Unidentified major p-type source in SnSe: Multivacancies,” <i>NPG Asia Materials</i>, vol. 14. Springer Nature, 2022.","short":"V.Q. Nguyen, T.L. Trinh, C. Chang, L.D. Zhao, T.H. Nguyen, V.T. Duong, A.T. Duong, J.H. Park, S. Park, J. Kim, S. Cho, NPG Asia Materials 14 (2022).","ista":"Nguyen VQ, Trinh TL, Chang C, Zhao LD, Nguyen TH, Duong VT, Duong AT, Park JH, Park S, Kim J, Cho S. 2022. Unidentified major p-type source in SnSe: Multivacancies. NPG Asia Materials. 14, 42.","ama":"Nguyen VQ, Trinh TL, Chang C, et al. Unidentified major p-type source in SnSe: Multivacancies. <i>NPG Asia Materials</i>. 2022;14. doi:<a href=\"https://doi.org/10.1038/s41427-022-00393-5\">10.1038/s41427-022-00393-5</a>","chicago":"Nguyen, Van Quang, Thi Ly Trinh, Cheng Chang, Li Dong Zhao, Thi Huong Nguyen, Van Thiet Duong, Anh Tuan Duong, et al. “Unidentified Major P-Type Source in SnSe: Multivacancies.” <i>NPG Asia Materials</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s41427-022-00393-5\">https://doi.org/10.1038/s41427-022-00393-5</a>.","apa":"Nguyen, V. Q., Trinh, T. L., Chang, C., Zhao, L. D., Nguyen, T. H., Duong, V. T., … Cho, S. (2022). Unidentified major p-type source in SnSe: Multivacancies. <i>NPG Asia Materials</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41427-022-00393-5\">https://doi.org/10.1038/s41427-022-00393-5</a>"},"oa":1,"title":"Unidentified major p-type source in SnSe: Multivacancies","isi":1,"acknowledgement":"This work was supported by the National Research Foundation of Korea [NRF-2019R1F1A1058473, NRF-2019R1A6A1A11053838, and NRF-2020K1A4A7A02095438].","day":"13","article_number":"42","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"11401","file_date_updated":"2022-05-23T06:47:57Z","scopus_import":"1","year":"2022","article_type":"original","oa_version":"Published Version","ddc":["540"],"publication_identifier":{"issn":["1884-4049"],"eissn":["1884-4057"]},"has_accepted_license":"1","quality_controlled":"1","doi":"10.1038/s41427-022-00393-5","publisher":"Springer Nature","abstract":[{"text":"Tin selenide (SnSe) is considered a robust candidate for thermoelectric applications due to its very high thermoelectric figure of merit, ZT, with values of 2.6 in p-type and 2.8 in n-type single crystals. Sn has been replaced with various lower group dopants to achieve successful p-type doping in SnSe with high ZT values. A known, facile, and powerful alternative way to introduce a hole carrier is to use a natural single Sn vacancy, VSn. Through transport and scanning tunneling microscopy studies, we discovered that VSn are dominant in high-quality (slow cooling rate) SnSe single crystals, while multiple vacancies, Vmulti, are dominant in low-quality (high cooling rate) single crystals. Surprisingly, both VSn and Vmulti help to increase the power factors of SnSe, whereas samples with dominant VSn have superior thermoelectric properties in SnSe single crystals. Additionally, the observation that Vmulti are good p-type sources observed in relatively low-quality single crystals is useful in thermoelectric applications because polycrystalline SnSe can be used due to its mechanical strength; this substance is usually fabricated at very high cooling speeds.","lang":"eng"}],"language":[{"iso":"eng"}],"article_processing_charge":"No","intvolume":"        14","publication":"NPG Asia Materials","date_published":"2022-05-13T00:00:00Z","volume":14},{"year":"2022","article_type":"original","oa_version":"Preprint","publication_identifier":{"issn":["0022-0000"],"eissn":["1090-2724"]},"quality_controlled":"1","doi":"10.1016/j.jcss.2022.04.003","publisher":"Elsevier","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.1802.03642"}],"abstract":[{"lang":"eng","text":"Fixed-horizon planning considers a weighted graph and asks to construct a path that maximizes the sum of weights for a given time horizon T. However, in many scenarios, the time horizon is not fixed, but the stopping time is chosen according to some distribution such that the expected stopping time is T. If the stopping-time distribution is not known, then to ensure robustness, the distribution is chosen by an adversary as the worst-case scenario. A stationary plan for every vertex always chooses the same outgoing edge. For fixed horizon or fixed stopping-time distribution, stationary plans are not sufficient for optimality. Quite surprisingly we show that when an adversary chooses the stopping-time distribution with expected stopping-time T, then stationary plans are sufficient. While computing optimal stationary plans for fixed horizon is NP-complete, we show that computing optimal stationary plans under adversarial stopping-time distribution can be achieved in polynomial time."}],"language":[{"iso":"eng"}],"article_processing_charge":"No","intvolume":"       129","publication":"Journal of Computer and System Sciences","date_published":"2022-11-01T00:00:00Z","ec_funded":1,"volume":129,"external_id":{"arxiv":["1802.03642"],"isi":["000805002800001"]},"date_created":"2022-05-22T22:01:40Z","department":[{"_id":"KrCh"}],"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"}],"related_material":{"record":[{"relation":"earlier_version","id":"7402","status":"public"}]},"publication_status":"published","page":"1-21","month":"11","type":"journal_article","status":"public","date_updated":"2025-07-10T11:54:34Z","citation":{"short":"K. Chatterjee, L. Doyen, Journal of Computer and System Sciences 129 (2022) 1–21.","ista":"Chatterjee K, Doyen L. 2022. Graph planning with expected finite horizon. Journal of Computer and System Sciences. 129, 1–21.","ieee":"K. Chatterjee and L. Doyen, “Graph planning with expected finite horizon,” <i>Journal of Computer and System Sciences</i>, vol. 129. Elsevier, pp. 1–21, 2022.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.” <i>Journal of Computer and System Sciences</i>, vol. 129, Elsevier, 2022, pp. 1–21, doi:<a href=\"https://doi.org/10.1016/j.jcss.2022.04.003\">10.1016/j.jcss.2022.04.003</a>.","apa":"Chatterjee, K., &#38; Doyen, L. (2022). Graph planning with expected finite horizon. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jcss.2022.04.003\">https://doi.org/10.1016/j.jcss.2022.04.003</a>","ama":"Chatterjee K, Doyen L. Graph planning with expected finite horizon. <i>Journal of Computer and System Sciences</i>. 2022;129:1-21. doi:<a href=\"https://doi.org/10.1016/j.jcss.2022.04.003\">10.1016/j.jcss.2022.04.003</a>","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.” <i>Journal of Computer and System Sciences</i>. Elsevier, 2022. <a href=\"https://doi.org/10.1016/j.jcss.2022.04.003\">https://doi.org/10.1016/j.jcss.2022.04.003</a>."},"oa":1,"project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"title":"Graph planning with expected finite horizon","isi":1,"arxiv":1,"acknowledgement":"This work was partially supported by Austrian Science Fund (FWF) NFN Grant No RiSE/SHiNE S11407 and by the grant ERC CoG 863818 (ForM-SMArt).","day":"01","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"11402","scopus_import":"1"},{"intvolume":"       221","volume":221,"date_published":"2022-07-01T00:00:00Z","publication":"Genetics","article_processing_charge":"No","language":[{"iso":"eng"}],"publisher":"Oxford University Press","abstract":[{"text":"Many studies have quantified the distribution of heterozygosity and relatedness in natural populations, but few have examined the demographic processes driving these patterns. In this study, we take a novel approach by studying how population structure affects both pairwise identity and the distribution of heterozygosity in a natural population of the self-incompatible plant Antirrhinum majus. Excess variance in heterozygosity between individuals is due to identity disequilibrium, which reflects the variance in inbreeding between individuals; it is measured by the statistic g2. We calculated g2 together with FST and pairwise relatedness (Fij) using 91 SNPs in 22,353 individuals collected over 11 years. We find that pairwise Fij declines rapidly over short spatial scales, and the excess variance in heterozygosity between individuals reflects significant variation in inbreeding. Additionally, we detect an excess of individuals with around half the average heterozygosity, indicating either selfing or matings between close relatives. We use 2 types of simulation to ask whether variation in heterozygosity is consistent with fine-scale spatial population structure. First, by simulating offspring using parents drawn from a range of spatial scales, we show that the known pollen dispersal kernel explains g2. Second, we simulate a 1,000-generation pedigree using the known dispersal and spatial distribution and find that the resulting g2 is consistent with that observed from the field data. In contrast, a simulated population with uniform density underestimates g2, indicating that heterogeneous density promotes identity disequilibrium. Our study shows that heterogeneous density and leptokurtic dispersal can together explain the distribution of heterozygosity.","lang":"eng"}],"has_accepted_license":"1","doi":"10.1093/genetics/iyac083","acknowledged_ssus":[{"_id":"ScienComp"}],"quality_controlled":"1","publication_identifier":{"eissn":["1943-2631"]},"article_type":"original","ddc":["576"],"oa_version":"Submitted Version","year":"2022","_id":"11411","file_date_updated":"2022-05-26T12:48:21Z","scopus_import":"1","day":"01","article_number":"iyac083","acknowledgement":"Part of this work was funded by Marie Curie COFUND Doctoral Fellowship and Austrian Science Fund FWF (grant P32166).\r\nWe thank the many volunteers and friends who have contributed to data collection in the field site over the years, in particular those who have managed field seasons: Barbora Trubenova, Maria Clara Melo, Tom Ellis, Eva Cereghetti, Lenka Matejovicova, Beatriz Pablo Carmona. Frederic Ferrer and Eva Salmerón Mateu have been immensely helpful with logistics at our informal field station, El Serrat de Planoles. We thank Sean Stankowski for technical help in\r\nproducing figure 1. This research was also supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp).","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","issue":"3","title":"Effects of fine-scale population structure on the distribution of heterozygosity in a long-term study of Antirrhinum majus","isi":1,"corr_author":"1","date_updated":"2026-04-07T13:28:29Z","project":[{"name":"Snapdragon Speciation","grant_number":"P32166","_id":"05959E1C-7A3F-11EA-A408-12923DDC885E"}],"citation":{"chicago":"Surendranadh, Parvathy, Louise S Arathoon, Carina Baskett, David Field, Melinda Pickup, and Nicholas H Barton. “Effects of Fine-Scale Population Structure on the Distribution of Heterozygosity in a Long-Term Study of Antirrhinum Majus.” <i>Genetics</i>. Oxford University Press, 2022. <a href=\"https://doi.org/10.1093/genetics/iyac083\">https://doi.org/10.1093/genetics/iyac083</a>.","ama":"Surendranadh P, Arathoon LS, Baskett C, Field D, Pickup M, Barton NH. Effects of fine-scale population structure on the distribution of heterozygosity in a long-term study of Antirrhinum majus. <i>Genetics</i>. 2022;221(3). doi:<a href=\"https://doi.org/10.1093/genetics/iyac083\">10.1093/genetics/iyac083</a>","apa":"Surendranadh, P., Arathoon, L. S., Baskett, C., Field, D., Pickup, M., &#38; Barton, N. H. (2022). Effects of fine-scale population structure on the distribution of heterozygosity in a long-term study of Antirrhinum majus. <i>Genetics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/genetics/iyac083\">https://doi.org/10.1093/genetics/iyac083</a>","ieee":"P. Surendranadh, L. S. Arathoon, C. Baskett, D. Field, M. Pickup, and N. H. Barton, “Effects of fine-scale population structure on the distribution of heterozygosity in a long-term study of Antirrhinum majus,” <i>Genetics</i>, vol. 221, no. 3. Oxford University Press, 2022.","mla":"Surendranadh, Parvathy, et al. “Effects of Fine-Scale Population Structure on the Distribution of Heterozygosity in a Long-Term Study of Antirrhinum Majus.” <i>Genetics</i>, vol. 221, no. 3, iyac083, Oxford University Press, 2022, doi:<a href=\"https://doi.org/10.1093/genetics/iyac083\">10.1093/genetics/iyac083</a>.","short":"P. Surendranadh, L.S. Arathoon, C. Baskett, D. Field, M. Pickup, N.H. Barton, Genetics 221 (2022).","ista":"Surendranadh P, Arathoon LS, Baskett C, Field D, Pickup M, Barton NH. 2022. Effects of fine-scale population structure on the distribution of heterozygosity in a long-term study of Antirrhinum majus. Genetics. 221(3), iyac083."},"oa":1,"status":"public","type":"journal_article","month":"07","file":[{"relation":"main_file","access_level":"open_access","date_created":"2022-05-26T12:48:15Z","date_updated":"2022-05-26T12:48:15Z","file_name":"Manuscript.pdf","checksum":"cc2d56deb608bd53c5cc02f03a875107","file_id":"11412","success":1,"content_type":"application/pdf","file_size":885374,"creator":"larathoo"},{"creator":"larathoo","file_size":1401704,"content_type":"application/pdf","checksum":"693742595b6c7ed809423be01460d083","file_id":"11413","success":1,"file_name":"SupplementalMaterial.pdf","date_created":"2022-05-26T12:48:21Z","date_updated":"2022-05-26T12:48:21Z","access_level":"open_access","relation":"main_file"}],"pmid":1,"author":[{"id":"455235B8-F248-11E8-B48F-1D18A9856A87","last_name":"Surendranadh","orcid":"0000-0001-6395-386X","first_name":"Parvathy","full_name":"Surendranadh, Parvathy"},{"id":"2CFCFF98-F248-11E8-B48F-1D18A9856A87","last_name":"Arathoon","orcid":"0000-0003-1771-714X","first_name":"Louise S","full_name":"Arathoon, Louise S"},{"full_name":"Baskett, Carina","last_name":"Baskett","orcid":"0000-0002-7354-8574","first_name":"Carina","id":"3B4A7CE2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Field, David","id":"419049E2-F248-11E8-B48F-1D18A9856A87","last_name":"Field","orcid":"0000-0002-4014-8478","first_name":"David"},{"full_name":"Pickup, Melinda","id":"2C78037E-F248-11E8-B48F-1D18A9856A87","first_name":"Melinda","orcid":"0000-0001-6118-0541","last_name":"Pickup"},{"first_name":"Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"}],"publication_status":"published","related_material":{"record":[{"relation":"research_data","id":"9192","status":"public"},{"id":"11321","status":"public","relation":"research_data"},{"id":"14651","status":"public","relation":"dissertation_contains"}]},"date_created":"2022-05-26T13:44:50Z","external_id":{"isi":["000803735800001"],"pmid":["35639938"]},"department":[{"_id":"GradSch"},{"_id":"NiBa"}]},{"publication_identifier":{"issn":["0003-6951"]},"doi":"10.1063/5.0097339","quality_controlled":"1","year":"2022","article_type":"letter_note","ddc":["530"],"oa_version":"Published Version","intvolume":"       120","volume":120,"publication":"Applied Physics Letters","date_published":"2022-05-12T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1063/5.0097339"}],"publisher":"American Institute of Physics","abstract":[{"text":"Over the past few years, the field of quantum information science has seen tremendous progress toward realizing large-scale quantum computers. With demonstrations of quantum computers outperforming classical computers for a select range of problems,1–3 we have finally entered the noisy, intermediate-scale quantum (NISQ) computing era. While the quantum computers of today are technological marvels, they are not yet error corrected, and it is unclear whether any system will scale beyond a few hundred logical qubits without significant changes to architecture and control schemes. Today's quantum systems are analogous to the ENIAC (Electronic Numerical Integrator And Computer) and EDVAC (Electronic Discrete Variable Automatic Computer) systems of the 1940s, which ran on vacuum tubes. These machines were built on a solid, nominally scalable architecture and when they were developed, nobody could have predicted the development of the transistor and the impact of the resulting semiconductor industry. Simply put, the computers of today are nothing like the early computers of the 1940s. We believe that the qubits of future fault-tolerant quantum systems will look quite different from the qubits of the NISQ machines in operation today. This Special Topic issue is devoted to new and emerging quantum systems with a focus on enabling technologies that can eventually lead to the quantum analog to the transistor. We have solicited both research4–18 and perspective articles19–21 to discuss new and emerging qubit systems with a focus on novel materials, encodings, and architectures. We are proud to present a collection that touches on a wide range of technologies including superconductors,7–13,21 semiconductors,15–17,19 and individual atomic qubits.18\r\n","lang":"eng"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"month":"05","type":"journal_article","status":"public","date_created":"2022-05-29T22:01:53Z","external_id":{"isi":["000796002100002"]},"department":[{"_id":"JoFi"}],"author":[{"full_name":"Sigillito, Anthony J.","last_name":"Sigillito","first_name":"Anthony J."},{"full_name":"Covey, Jacob P.","last_name":"Covey","first_name":"Jacob P."},{"last_name":"Fink","first_name":"Johannes M","orcid":"0000-0001-8112-028X","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","full_name":"Fink, Johannes M"},{"first_name":"Karl","last_name":"Petersson","full_name":"Petersson, Karl"},{"first_name":"Stefan","last_name":"Preble","full_name":"Preble, Stefan"}],"publication_status":"published","article_number":"190401","day":"12","acknowledgement":"We would like to thank all of the authors who contributed to\r\nthis Special Topic. We would also like to thank the editorial team at\r\nAPL including Jessica Trudeau, Emma Van Burns, Martin Weides,\r\nand Lesley Cohen.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"19","_id":"11417","scopus_import":"1","date_updated":"2026-06-18T17:14:33Z","oa":1,"citation":{"ama":"Sigillito AJ, Covey JP, Fink JM, Petersson K, Preble S. Emerging qubit systems: Guest editorial. <i>Applied Physics Letters</i>. 2022;120(19). doi:<a href=\"https://doi.org/10.1063/5.0097339\">10.1063/5.0097339</a>","chicago":"Sigillito, Anthony J., Jacob P. Covey, Johannes M Fink, Karl Petersson, and Stefan Preble. “Emerging Qubit Systems: Guest Editorial.” <i>Applied Physics Letters</i>. American Institute of Physics, 2022. <a href=\"https://doi.org/10.1063/5.0097339\">https://doi.org/10.1063/5.0097339</a>.","apa":"Sigillito, A. J., Covey, J. P., Fink, J. M., Petersson, K., &#38; Preble, S. (2022). Emerging qubit systems: Guest editorial. <i>Applied Physics Letters</i>. American Institute of Physics. <a href=\"https://doi.org/10.1063/5.0097339\">https://doi.org/10.1063/5.0097339</a>","ieee":"A. J. Sigillito, J. P. Covey, J. M. Fink, K. Petersson, and S. Preble, “Emerging qubit systems: Guest editorial,” <i>Applied Physics Letters</i>, vol. 120, no. 19. American Institute of Physics, 2022.","mla":"Sigillito, Anthony J., et al. “Emerging Qubit Systems: Guest Editorial.” <i>Applied Physics Letters</i>, vol. 120, no. 19, 190401, American Institute of Physics, 2022, doi:<a href=\"https://doi.org/10.1063/5.0097339\">10.1063/5.0097339</a>.","short":"A.J. Sigillito, J.P. Covey, J.M. Fink, K. Petersson, S. Preble, Applied Physics Letters 120 (2022).","ista":"Sigillito AJ, Covey JP, Fink JM, Petersson K, Preble S. 2022. Emerging qubit systems: Guest editorial. Applied Physics Letters. 120(19), 190401."},"title":"Emerging qubit systems: Guest editorial","isi":1},{"language":[{"iso":"eng"}],"article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2103.06730"}],"publisher":"Institute of Mathematical Statistics","abstract":[{"text":"We consider the quadratic form of a general high-rank deterministic matrix on the eigenvectors of an N×N\r\nWigner matrix and prove that it has Gaussian fluctuation for each bulk eigenvector in the large N limit. The proof is a combination of the energy method for the Dyson Brownian motion inspired by Marcinek and Yau (2021) and our recent multiresolvent local laws (Comm. Math. Phys. 388 (2021) 1005–1048).","lang":"eng"}],"intvolume":"        50","publication":"Annals of Probability","date_published":"2022-05-01T00:00:00Z","volume":50,"article_type":"original","oa_version":"Preprint","year":"2022","quality_controlled":"1","doi":"10.1214/21-AOP1552","publication_identifier":{"eissn":["2168-894X"],"issn":["0091-1798"]},"title":"Normal fluctuation in quantum ergodicity for Wigner matrices","isi":1,"arxiv":1,"date_updated":"2023-08-03T07:16:53Z","citation":{"chicago":"Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Normal Fluctuation in Quantum Ergodicity for Wigner Matrices.” <i>Annals of Probability</i>. Institute of Mathematical Statistics, 2022. <a href=\"https://doi.org/10.1214/21-AOP1552\">https://doi.org/10.1214/21-AOP1552</a>.","ama":"Cipolloni G, Erdös L, Schröder DJ. Normal fluctuation in quantum ergodicity for Wigner matrices. <i>Annals of Probability</i>. 2022;50(3):984-1012. doi:<a href=\"https://doi.org/10.1214/21-AOP1552\">10.1214/21-AOP1552</a>","apa":"Cipolloni, G., Erdös, L., &#38; Schröder, D. J. (2022). Normal fluctuation in quantum ergodicity for Wigner matrices. <i>Annals of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/21-AOP1552\">https://doi.org/10.1214/21-AOP1552</a>","ieee":"G. Cipolloni, L. Erdös, and D. J. Schröder, “Normal fluctuation in quantum ergodicity for Wigner matrices,” <i>Annals of Probability</i>, vol. 50, no. 3. Institute of Mathematical Statistics, pp. 984–1012, 2022.","mla":"Cipolloni, Giorgio, et al. “Normal Fluctuation in Quantum Ergodicity for Wigner Matrices.” <i>Annals of Probability</i>, vol. 50, no. 3, Institute of Mathematical Statistics, 2022, pp. 984–1012, doi:<a href=\"https://doi.org/10.1214/21-AOP1552\">10.1214/21-AOP1552</a>.","ista":"Cipolloni G, Erdös L, Schröder DJ. 2022. Normal fluctuation in quantum ergodicity for Wigner matrices. Annals of Probability. 50(3), 984–1012.","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Annals of Probability 50 (2022) 984–1012."},"oa":1,"_id":"11418","scopus_import":"1","acknowledgement":"L.E. would like to thank Zhigang Bao for many illuminating discussions in an early stage of this research. The authors are also grateful to Paul Bourgade for his comments on the manuscript and the anonymous referee for several useful suggestions.","day":"01","issue":"3","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"id":"42198EFA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4901-7992","first_name":"Giorgio","last_name":"Cipolloni","full_name":"Cipolloni, Giorgio"},{"full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","orcid":"0000-0001-5366-9603","first_name":"László"},{"full_name":"Schröder, Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87","last_name":"Schröder","orcid":"0000-0002-2904-1856","first_name":"Dominik J"}],"publication_status":"published","date_created":"2022-05-29T22:01:53Z","external_id":{"arxiv":["2103.06730"],"isi":["000793963400005"]},"department":[{"_id":"LaEr"}],"status":"public","page":"984-1012","type":"journal_article","month":"05"},{"file_date_updated":"2022-05-30T08:09:16Z","scopus_import":"1","_id":"11419","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","acknowledgement":"We thank Yasuo Ihara, Nobuyuki Nukina, and Takeshi Sakaba for comments and Patrick Stoney for editing this paper. We also thank Shota Okuda and Mikako Matsubara for their contributions in the early stage of this study, and Satoko Wada-Kakuda for technical assistant with in vitro analysis of tau. This research was supported by funding from Okinawa Institute of Science and Technology and from Technology (OIST) and Core Research for the Evolutional Science and Technology of Japan Science and Technology Agency (CREST) to TT, and by Scientific Research on Innovative Areas to TM (Brain Protein Aging and Dementia Control 26117004).","article_number":"e73542","day":"05","isi":1,"title":"Microtubule assembly by tau impairs endocytosis and neurotransmission via dynamin sequestration in Alzheimer's disease synapse model","oa":1,"citation":{"apa":"Hori, T., Eguchi, K., Wang, H. Y., Miyasaka, T., Guillaud, L., Taoufiq, Z., … Takahashi, T. (2022). Microtubule assembly by tau impairs endocytosis and neurotransmission via dynamin sequestration in Alzheimer’s disease synapse model. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.73542\">https://doi.org/10.7554/eLife.73542</a>","chicago":"Hori, Tetsuya, Kohgaku Eguchi, Han Ying Wang, Tomohiro Miyasaka, Laurent Guillaud, Zacharie Taoufiq, Satyajit Mahapatra, Hiroshi Yamada, Kohji Takei, and Tomoyuki Takahashi. “Microtubule Assembly by Tau Impairs Endocytosis and Neurotransmission via Dynamin Sequestration in Alzheimer’s Disease Synapse Model.” <i>ELife</i>. eLife Sciences Publications, 2022. <a href=\"https://doi.org/10.7554/eLife.73542\">https://doi.org/10.7554/eLife.73542</a>.","ama":"Hori T, Eguchi K, Wang HY, et al. Microtubule assembly by tau impairs endocytosis and neurotransmission via dynamin sequestration in Alzheimer’s disease synapse model. <i>eLife</i>. 2022;11. doi:<a href=\"https://doi.org/10.7554/eLife.73542\">10.7554/eLife.73542</a>","short":"T. Hori, K. Eguchi, H.Y. Wang, T. Miyasaka, L. Guillaud, Z. Taoufiq, S. Mahapatra, H. Yamada, K. Takei, T. Takahashi, ELife 11 (2022).","ista":"Hori T, Eguchi K, Wang HY, Miyasaka T, Guillaud L, Taoufiq Z, Mahapatra S, Yamada H, Takei K, Takahashi T. 2022. Microtubule assembly by tau impairs endocytosis and neurotransmission via dynamin sequestration in Alzheimer’s disease synapse model. eLife. 11, e73542.","ieee":"T. Hori <i>et al.</i>, “Microtubule assembly by tau impairs endocytosis and neurotransmission via dynamin sequestration in Alzheimer’s disease synapse model,” <i>eLife</i>, vol. 11. eLife Sciences Publications, 2022.","mla":"Hori, Tetsuya, et al. “Microtubule Assembly by Tau Impairs Endocytosis and Neurotransmission via Dynamin Sequestration in Alzheimer’s Disease Synapse Model.” <i>ELife</i>, vol. 11, e73542, eLife Sciences Publications, 2022, doi:<a href=\"https://doi.org/10.7554/eLife.73542\">10.7554/eLife.73542</a>."},"date_updated":"2023-08-03T07:15:49Z","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"status":"public","file":[{"file_size":2466296,"content_type":"application/pdf","checksum":"ccddbd167e00ff8375f12998af497152","file_id":"11421","success":1,"creator":"cchlebak","file_name":"elife-73542-v2.pdf","date_updated":"2022-05-30T08:09:16Z","date_created":"2022-05-30T08:09:16Z","access_level":"open_access","relation":"main_file"}],"month":"05","type":"journal_article","publication_status":"published","pmid":1,"author":[{"last_name":"Hori","first_name":"Tetsuya","full_name":"Hori, Tetsuya"},{"last_name":"Eguchi","orcid":"0000-0002-6170-2546","first_name":"Kohgaku","id":"2B7846DC-F248-11E8-B48F-1D18A9856A87","full_name":"Eguchi, Kohgaku"},{"full_name":"Wang, Han Ying","last_name":"Wang","first_name":"Han Ying"},{"full_name":"Miyasaka, Tomohiro","first_name":"Tomohiro","last_name":"Miyasaka"},{"first_name":"Laurent","last_name":"Guillaud","full_name":"Guillaud, Laurent"},{"full_name":"Taoufiq, Zacharie","last_name":"Taoufiq","first_name":"Zacharie"},{"last_name":"Mahapatra","first_name":"Satyajit","full_name":"Mahapatra, Satyajit"},{"last_name":"Yamada","first_name":"Hiroshi","full_name":"Yamada, Hiroshi"},{"last_name":"Takei","first_name":"Kohji","full_name":"Takei, Kohji"},{"full_name":"Takahashi, Tomoyuki","last_name":"Takahashi","first_name":"Tomoyuki"}],"department":[{"_id":"RySh"}],"date_created":"2022-05-29T22:01:54Z","external_id":{"isi":["000876231600001"],"pmid":["35471147 "]},"publication":"eLife","date_published":"2022-05-05T00:00:00Z","volume":11,"intvolume":"        11","language":[{"iso":"eng"}],"article_processing_charge":"No","abstract":[{"text":"Elevation of soluble wild-type (WT) tau occurs in synaptic compartments in Alzheimer’s disease. We addressed whether tau elevation affects synaptic transmission at the calyx of Held in slices from mice brainstem. Whole-cell loading of WT human tau (h-tau) in presynaptic terminals at 10–20 µM caused microtubule (MT) assembly and activity-dependent rundown of excitatory neurotransmission. Capacitance measurements revealed that the primary target of WT h-tau is vesicle endocytosis. Blocking MT assembly using nocodazole prevented tau-induced impairments of endocytosis and neurotransmission. Immunofluorescence imaging analyses revealed that MT assembly by WT h-tau loading was associated with an increased MT-bound fraction of the endocytic protein dynamin. A synthetic dodecapeptide corresponding to dynamin 1-pleckstrin-homology domain inhibited MT-dynamin interaction and rescued tau-induced impairments of endocytosis and neurotransmission. We conclude that elevation of presynaptic WT tau induces de novo assembly of MTs, thereby sequestering free dynamins. As a result, endocytosis and subsequent vesicle replenishment are impaired, causing activity-dependent rundown of neurotransmission.","lang":"eng"}],"publisher":"eLife Sciences Publications","quality_controlled":"1","doi":"10.7554/eLife.73542","has_accepted_license":"1","publication_identifier":{"eissn":["2050-084X"]},"oa_version":"Published Version","ddc":["616"],"article_type":"original","year":"2022"},{"day":"01","acknowledgement":"Partially supported by the DFG Collaborative Research Center TRR 109, “Discretization in Geometry and Dynamics” and the European Research Council (ERC), grant no. 788183, “Alpha Shape Theory Extended”. Erin Chambers: Supported in part by the National Science Foundation through grants DBI-1759807, CCF-1907612, and CCF-2106672. Mathijs Wintraecken: Supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411. The Austrian science fund (FWF) M-3073 Acknowledgements We thank André Lieutier, David Letscher, Ellen Gasparovic, Kathryn Leonard, and Tao Ju for early discussions on this work. We also thank Lu Liu, Yajie Yan and Tao Ju for sharing code to generate the examples.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"11428","scopus_import":"1","file_date_updated":"2022-06-07T07:58:30Z","date_updated":"2025-04-14T07:43:57Z","project":[{"_id":"fc390959-9c52-11eb-aca3-afa58bd282b2","grant_number":"M03073","name":"Learning and triangulating manifolds via collapses"},{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Alpha Shape Theory Extended","grant_number":"788183"},{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"oa":1,"citation":{"apa":"Chambers, E., Fillmore, C. D., Stephenson, E. R., &#38; Wintraecken, M. (2022). A cautionary tale: Burning the medial axis is unstable. In X. Goaoc &#38; M. Kerber (Eds.), <i>38th International Symposium on Computational Geometry</i> (Vol. 224, p. 66:1-66:9). Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2022.66\">https://doi.org/10.4230/LIPIcs.SoCG.2022.66</a>","ama":"Chambers E, Fillmore CD, Stephenson ER, Wintraecken M. A cautionary tale: Burning the medial axis is unstable. In: Goaoc X, Kerber M, eds. <i>38th International Symposium on Computational Geometry</i>. Vol 224. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:66:1-66:9. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2022.66\">10.4230/LIPIcs.SoCG.2022.66</a>","chicago":"Chambers, Erin, Christopher D Fillmore, Elizabeth R Stephenson, and Mathijs Wintraecken. “A Cautionary Tale: Burning the Medial Axis Is Unstable.” In <i>38th International Symposium on Computational Geometry</i>, edited by Xavier Goaoc and Michael Kerber, 224:66:1-66:9. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2022.66\">https://doi.org/10.4230/LIPIcs.SoCG.2022.66</a>.","short":"E. Chambers, C.D. Fillmore, E.R. Stephenson, M. Wintraecken, in:, X. Goaoc, M. Kerber (Eds.), 38th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 66:1-66:9.","ista":"Chambers E, Fillmore CD, Stephenson ER, Wintraecken M. 2022. A cautionary tale: Burning the medial axis is unstable. 38th International Symposium on Computational Geometry. SoCG: Symposium on Computational GeometryLIPIcs vol. 224, 66:1-66:9.","ieee":"E. Chambers, C. D. Fillmore, E. R. Stephenson, and M. Wintraecken, “A cautionary tale: Burning the medial axis is unstable,” in <i>38th International Symposium on Computational Geometry</i>, Berlin, Germany, 2022, vol. 224, p. 66:1-66:9.","mla":"Chambers, Erin, et al. “A Cautionary Tale: Burning the Medial Axis Is Unstable.” <i>38th International Symposium on Computational Geometry</i>, edited by Xavier Goaoc and Michael Kerber, vol. 224, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 66:1-66:9, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2022.66\">10.4230/LIPIcs.SoCG.2022.66</a>."},"title":"A cautionary tale: Burning the medial axis is unstable","corr_author":"1","type":"conference","month":"06","file":[{"date_updated":"2022-06-07T07:58:30Z","date_created":"2022-06-07T07:58:30Z","file_name":"2022_LIPICs_Chambers.pdf","relation":"main_file","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":17580705,"checksum":"b25ce40fade4ebc0bcaae176db4f5f1f","file_id":"11437","success":1}],"page":"66:1-66:9","status":"public","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"date_created":"2022-06-01T14:18:04Z","department":[{"_id":"HeEd"}],"author":[{"last_name":"Chambers","first_name":"Erin","full_name":"Chambers, Erin"},{"full_name":"Fillmore, Christopher D","id":"35638A5C-AAC7-11E9-B0BF-5503E6697425","first_name":"Christopher D","last_name":"Fillmore"},{"id":"2D04F932-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6862-208X","first_name":"Elizabeth R","last_name":"Stephenson","full_name":"Stephenson, Elizabeth R"},{"id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","orcid":"0000-0002-7472-2220","first_name":"Mathijs","full_name":"Wintraecken, Mathijs"}],"publication_status":"published","intvolume":"       224","editor":[{"first_name":"Xavier","last_name":"Goaoc","full_name":"Goaoc, Xavier"},{"first_name":"Michael","last_name":"Kerber","full_name":"Kerber, Michael"}],"volume":224,"ec_funded":1,"date_published":"2022-06-01T00:00:00Z","publication":"38th International Symposium on Computational Geometry","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","abstract":[{"text":"The medial axis of a set consists of the points in the ambient space without a unique closest point on the original set. Since its introduction, the medial axis has been used extensively in many applications as a method of computing a topologically equivalent skeleton. Unfortunately, one limiting factor in the use of the medial axis of a smooth manifold is that it is not necessarily topologically stable under small perturbations of the manifold. To counter these instabilities various prunings of the medial axis have been proposed. Here, we examine one type of pruning, called burning. Because of the good experimental results, it was hoped that the burning method of simplifying the medial axis would be stable. In this work we show a simple example that dashes such hopes based on Bing’s house with two rooms, demonstrating an isotopy of a shape where the medial axis goes from collapsible to non-collapsible.","lang":"eng"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"series_title":"LIPIcs","publication_identifier":{"isbn":["978-3-95977-227-3"],"issn":["1868-8969"]},"has_accepted_license":"1","doi":"10.4230/LIPIcs.SoCG.2022.66","conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2022-06-07","location":"Berlin, Germany","end_date":"2022-06-10"},"quality_controlled":"1","year":"2022","oa_version":"Published Version","ddc":["510"]},{"date_published":"2022-05-01T00:00:00Z","volume":13238,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","editor":[{"last_name":"Karimipour","first_name":"Farid","orcid":"0000-0001-6746-4174","id":"2A2BCDC4-CF62-11E9-BE5E-3B1EE6697425","full_name":"Karimipour, Farid"},{"full_name":"Storandt, Sabine","first_name":"Sabine","last_name":"Storandt"}],"day":"01","intvolume":"     13238","_id":"11429","abstract":[{"lang":"eng","text":"This book constitutes the refereed proceedings of the 18th International Symposium on Web and Wireless Geographical Information Systems, W2GIS 2022, held in Konstanz, Germany, in April 2022.\r\nThe 7 full papers presented together with 6 short papers in the volume were carefully reviewed and selected from 16 submissions.  The papers cover topics that range from mobile GIS and Location-Based Services to Spatial Information Retrieval and Wireless Sensor Networks."}],"citation":{"ieee":"F. Karimipour and S. Storandt, Eds., <i>Web and Wireless Geographical Information Systems</i>, 1st ed., vol. 13238. Cham: Springer Nature, 2022.","mla":"Karimipour, Farid, and Sabine Storandt, editors. <i>Web and Wireless Geographical Information Systems</i>. 1st ed., vol. 13238, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1007/978-3-031-06245-2\">10.1007/978-3-031-06245-2</a>.","short":"F. Karimipour, S. Storandt, eds., Web and Wireless Geographical Information Systems, 1st ed., Springer Nature, Cham, 2022.","ista":"Karimipour F, Storandt S eds. 2022. Web and Wireless Geographical Information Systems 1st ed., Cham: Springer Nature, 153p.","ama":"Karimipour F, Storandt S, eds. <i>Web and Wireless Geographical Information Systems</i>. Vol 13238. 1st ed. Cham: Springer Nature; 2022. doi:<a href=\"https://doi.org/10.1007/978-3-031-06245-2\">10.1007/978-3-031-06245-2</a>","chicago":"Karimipour, Farid, and Sabine Storandt, eds. <i>Web and Wireless Geographical Information Systems</i>. 1st ed. Vol. 13238. Cham: Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-031-06245-2\">https://doi.org/10.1007/978-3-031-06245-2</a>.","apa":"Karimipour, F., &#38; Storandt, S. (Eds.). (2022). <i>Web and Wireless Geographical Information Systems</i> (1st ed., Vol. 13238). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-06245-2\">https://doi.org/10.1007/978-3-031-06245-2</a>"},"date_updated":"2024-10-09T21:02:30Z","publisher":"Springer Nature","corr_author":"1","language":[{"iso":"eng"}],"title":"Web and Wireless Geographical Information Systems","article_processing_charge":"No","alternative_title":["LNCS"],"publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031062445"],"issn":["0302-9743"],"eisbn":["9783031062452"]},"page":"153","month":"05","type":"book_editor","quality_controlled":"1","doi":"10.1007/978-3-031-06245-2","status":"public","department":[{"_id":"HeEd"}],"year":"2022","date_created":"2022-06-02T05:40:53Z","place":"Cham","oa_version":"None","publication_status":"published","edition":"1"},{"month":"05","type":"journal_article","page":"343-353","status":"public","date_created":"2022-06-05T22:01:49Z","external_id":{"isi":["000802723900027"]},"department":[{"_id":"ChWo"}],"author":[{"id":"2B14B676-F248-11E8-B48F-1D18A9856A87","last_name":"Schreck","first_name":"Camille","full_name":"Schreck, Camille"},{"orcid":"0000-0001-6646-5546","first_name":"Christopher J","last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J"}],"publication_status":"published","day":"01","acknowledgement":"We wish to thank the anonymous reviewers and the members of the Visual Computing Group at IST Austria and MFX Team at INRIA 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.","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","issue":"2","_id":"11432","scopus_import":"1","date_updated":"2024-10-22T09:58:19Z","project":[{"name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","call_identifier":"H2020","grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425"}],"oa":1,"citation":{"short":"C. Schreck, C. Wojtan, Computer Graphics Forum 41 (2022) 343–353.","ista":"Schreck C, Wojtan C. 2022. Coupling 3D liquid simulation with 2D wave propagation for large scale water surface animation using the equivalent sources method. Computer Graphics Forum. 41(2), 343–353.","ieee":"C. Schreck and C. Wojtan, “Coupling 3D liquid simulation with 2D wave propagation for large scale water surface animation using the equivalent sources method,” <i>Computer Graphics Forum</i>, vol. 41, no. 2. Wiley, pp. 343–353, 2022.","mla":"Schreck, Camille, and Chris Wojtan. “Coupling 3D Liquid Simulation with 2D Wave Propagation for Large Scale Water Surface Animation Using the Equivalent Sources Method.” <i>Computer Graphics Forum</i>, vol. 41, no. 2, Wiley, 2022, pp. 343–53, doi:<a href=\"https://doi.org/10.1111/cgf.14478\">10.1111/cgf.14478</a>.","apa":"Schreck, C., &#38; Wojtan, C. (2022). Coupling 3D liquid simulation with 2D wave propagation for large scale water surface animation using the equivalent sources method. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.14478\">https://doi.org/10.1111/cgf.14478</a>","chicago":"Schreck, Camille, and Chris Wojtan. “Coupling 3D Liquid Simulation with 2D Wave Propagation for Large Scale Water Surface Animation Using the Equivalent Sources Method.” <i>Computer Graphics Forum</i>. Wiley, 2022. <a href=\"https://doi.org/10.1111/cgf.14478\">https://doi.org/10.1111/cgf.14478</a>.","ama":"Schreck C, Wojtan C. Coupling 3D liquid simulation with 2D wave propagation for large scale water surface animation using the equivalent sources method. <i>Computer Graphics Forum</i>. 2022;41(2):343-353. doi:<a href=\"https://doi.org/10.1111/cgf.14478\">10.1111/cgf.14478</a>"},"title":"Coupling 3D liquid simulation with 2D wave propagation for large scale water surface animation using the equivalent sources method","isi":1,"corr_author":"1","publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]},"doi":"10.1111/cgf.14478","quality_controlled":"1","acknowledged_ssus":[{"_id":"ScienComp"}],"year":"2022","article_type":"original","oa_version":"Submitted Version","intvolume":"        41","ec_funded":1,"volume":41,"publication":"Computer Graphics Forum","date_published":"2022-05-01T00:00:00Z","main_file_link":[{"url":"https://hal.archives-ouvertes.fr/hal-03641349/","open_access":"1"}],"publisher":"Wiley","abstract":[{"text":"This paper proposes a method for simulating liquids in large bodies of water by coupling together a water surface wave simulator with a 3D Navier-Stokes simulator. The surface wave simulation uses the equivalent sources method (ESM) to efficiently animate large bodies of water with precisely controllable wave propagation behavior. The 3D liquid simulator animates complex non-linear fluid behaviors like splashes and breaking waves using off-the-shelf simulators using FLIP or the level set method with semi-Lagrangian advection.\r\nWe combine the two approaches by using the 3D solver to animate localized non-linear behaviors, and the 2D wave solver to animate larger regions with linear surface physics. We use the surface motion from the 3D solver as boundary conditions for 2D surface wave simulator, and we use the velocity and surface heights from the 2D surface wave simulator as boundary conditions for the 3D fluid simulation. We also introduce a novel technique for removing visual artifacts caused by numerical errors in 3D fluid solvers: we use experimental data to estimate the artificial dispersion caused by the 3D solver and we then carefully tune the wave speeds of the 2D solver to match it, effectively eliminating any differences in wave behavior across the boundary. To the best of our knowledge, this is the first time such a empirically driven error compensation approach has been used to remove coupling errors from a physics simulator.\r\nOur coupled simulation approach leverages the strengths of each simulation technique, animating large environments with seamless transitions between 2D and 3D physics.","lang":"eng"}],"article_processing_charge":"No","language":[{"iso":"eng"}]},{"issue":"2","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"G.I. acknowledges the financial support from the Ministry of Educational and Science of the Russian Federation in the framework of MegaGrant no 075-15-2019-1926. M.N. was supported by the National Research, Development and Innovation Fund (NRDI) grants K119670 and\r\nKKP-133864 as well as the Bolyai Scholarship of the Hungarian Academy of Sciences and the New National Excellence Programme and the TKP2020-NKA-06 program provided by the NRDI.","day":"11","scopus_import":"1","_id":"11435","oa":1,"citation":{"chicago":"Ivanov, Grigory, and Marton Naszodi. “A Quantitative Helly-Type Theorem: Containment in a Homothet.” <i>SIAM Journal on Discrete Mathematics</i>. Society for Industrial and Applied Mathematics, 2022. <a href=\"https://doi.org/10.1137/21M1403308\">https://doi.org/10.1137/21M1403308</a>.","ama":"Ivanov G, Naszodi M. A quantitative Helly-type theorem: Containment in a homothet. <i>SIAM Journal on Discrete Mathematics</i>. 2022;36(2):951-957. doi:<a href=\"https://doi.org/10.1137/21M1403308\">10.1137/21M1403308</a>","apa":"Ivanov, G., &#38; Naszodi, M. (2022). A quantitative Helly-type theorem: Containment in a homothet. <i>SIAM Journal on Discrete Mathematics</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/21M1403308\">https://doi.org/10.1137/21M1403308</a>","mla":"Ivanov, Grigory, and Marton Naszodi. “A Quantitative Helly-Type Theorem: Containment in a Homothet.” <i>SIAM Journal on Discrete Mathematics</i>, vol. 36, no. 2, Society for Industrial and Applied Mathematics, 2022, pp. 951–57, doi:<a href=\"https://doi.org/10.1137/21M1403308\">10.1137/21M1403308</a>.","ieee":"G. Ivanov and M. Naszodi, “A quantitative Helly-type theorem: Containment in a homothet,” <i>SIAM Journal on Discrete Mathematics</i>, vol. 36, no. 2. Society for Industrial and Applied Mathematics, pp. 951–957, 2022.","ista":"Ivanov G, Naszodi M. 2022. A quantitative Helly-type theorem: Containment in a homothet. SIAM Journal on Discrete Mathematics. 36(2), 951–957.","short":"G. Ivanov, M. Naszodi, SIAM Journal on Discrete Mathematics 36 (2022) 951–957."},"date_updated":"2023-10-18T06:58:03Z","isi":1,"arxiv":1,"title":"A quantitative Helly-type theorem: Containment in a homothet","page":"951-957","month":"04","type":"journal_article","status":"public","department":[{"_id":"UlWa"}],"date_created":"2022-06-05T22:01:50Z","external_id":{"arxiv":["2103.04122"],"isi":["000793158200002"]},"publication_status":"published","author":[{"full_name":"Ivanov, Grigory","first_name":"Grigory","last_name":"Ivanov","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E"},{"full_name":"Naszodi, Marton","last_name":"Naszodi","first_name":"Marton"}],"publication":"SIAM Journal on Discrete Mathematics","date_published":"2022-04-11T00:00:00Z","volume":36,"intvolume":"        36","abstract":[{"text":"We introduce a new variant of quantitative Helly-type theorems: the minimal homothetic distance of the intersection of a family of convex sets to the intersection of a subfamily of a fixed size. As an application, we establish the following quantitative Helly-type result for the diameter. If $K$ is the intersection of finitely many convex bodies in $\\mathbb{R}^d$, then one can select $2d$ of these bodies whose intersection is of diameter at most $(2d)^3{diam}(K)$. The best previously known estimate, due to Brazitikos [Bull. Hellenic Math. Soc., 62 (2018), pp. 19--25], is $c d^{11/2}$. Moreover, we confirm that the multiplicative factor $c d^{1/2}$ conjectured by Bárány, Katchalski, and Pach [Proc. Amer. Math. Soc., 86 (1982), pp. 109--114] cannot be improved. The bounds above follow from our key result that concerns sparse approximation of a convex polytope by the convex hull of a well-chosen subset of its vertices: Assume that $Q \\subset {\\mathbb R}^d$ is a polytope whose centroid is the origin. Then there exist at most 2d vertices of $Q$ whose convex hull $Q^{\\prime \\prime}$ satisfies $Q \\subset - 8d^3 Q^{\\prime \\prime}.$","lang":"eng"}],"main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2103.04122"}],"publisher":"Society for Industrial and Applied Mathematics","language":[{"iso":"eng"}],"article_processing_charge":"No","publication_identifier":{"issn":["0895-4801"]},"quality_controlled":"1","doi":"10.1137/21M1403308","year":"2022","oa_version":"Preprint","article_type":"original"},{"date_created":"2022-06-07T08:21:11Z","external_id":{"arxiv":["2102.11397"]},"department":[{"_id":"HeEd"}],"author":[{"last_name":"Bleile","first_name":"Bea","full_name":"Bleile, Bea"},{"last_name":"Garin","first_name":"Adélie","full_name":"Garin, Adélie"},{"full_name":"Heiss, Teresa","id":"4879BB4E-F248-11E8-B48F-1D18A9856A87","first_name":"Teresa","orcid":"0000-0002-1780-2689","last_name":"Heiss"},{"full_name":"Maggs, Kelly","first_name":"Kelly","last_name":"Maggs"},{"full_name":"Robins, Vanessa","first_name":"Vanessa","last_name":"Robins"}],"publication_status":"published","related_material":{"record":[{"relation":"dissertation_contains","id":"18667","status":"public"}]},"type":"book_chapter","month":"01","page":"1-26","alternative_title":["Association for Women in Mathematics Series"],"status":"public","date_updated":"2026-04-07T12:54:09Z","project":[{"grant_number":"788183","name":"Alpha Shape Theory Extended","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"}],"citation":{"ieee":"B. Bleile, A. Garin, T. Heiss, K. Maggs, and V. Robins, “The persistent homology of dual digital image constructions,” in <i>Research in Computational Topology 2</i>, 1st ed., vol. 30, E. Gasparovic, V. Robins, and K. Turner, Eds. Cham: Springer Nature, 2022, pp. 1–26.","mla":"Bleile, Bea, et al. “The Persistent Homology of Dual Digital Image Constructions.” <i>Research in Computational Topology 2</i>, edited by Ellen Gasparovic et al., 1st ed., vol. 30, Springer Nature, 2022, pp. 1–26, doi:<a href=\"https://doi.org/10.1007/978-3-030-95519-9_1\">10.1007/978-3-030-95519-9_1</a>.","short":"B. Bleile, A. Garin, T. Heiss, K. Maggs, V. Robins, in:, E. Gasparovic, V. Robins, K. Turner (Eds.), Research in Computational Topology 2, 1st ed., Springer Nature, Cham, 2022, pp. 1–26.","ista":"Bleile B, Garin A, Heiss T, Maggs K, Robins V. 2022.The persistent homology of dual digital image constructions. In: Research in Computational Topology 2. Association for Women in Mathematics Series, vol. 30, 1–26.","ama":"Bleile B, Garin A, Heiss T, Maggs K, Robins V. The persistent homology of dual digital image constructions. In: Gasparovic E, Robins V, Turner K, eds. <i>Research in Computational Topology 2</i>. Vol 30. 1st ed. AWMS. Cham: Springer Nature; 2022:1-26. doi:<a href=\"https://doi.org/10.1007/978-3-030-95519-9_1\">10.1007/978-3-030-95519-9_1</a>","chicago":"Bleile, Bea, Adélie Garin, Teresa Heiss, Kelly Maggs, and Vanessa Robins. “The Persistent Homology of Dual Digital Image Constructions.” In <i>Research in Computational Topology 2</i>, edited by Ellen Gasparovic, Vanessa Robins, and Katharine Turner, 1st ed., 30:1–26. AWMS. Cham: Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-030-95519-9_1\">https://doi.org/10.1007/978-3-030-95519-9_1</a>.","apa":"Bleile, B., Garin, A., Heiss, T., Maggs, K., &#38; Robins, V. (2022). The persistent homology of dual digital image constructions. In E. Gasparovic, V. Robins, &#38; K. Turner (Eds.), <i>Research in Computational Topology 2</i> (1st ed., Vol. 30, pp. 1–26). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-95519-9_1\">https://doi.org/10.1007/978-3-030-95519-9_1</a>"},"oa":1,"title":"The persistent homology of dual digital image constructions","arxiv":1,"day":"27","acknowledgement":"This project started during the Women in Computational Topology workshop held in Canberra in July of 2019. All authors are very grateful for its organisation and the financial support for the workshop from the Mathematical Sciences Institute at ANU, the US National Science Foundation through the award CCF-1841455, the Australian Mathematical Sciences Institute and the Association for Women in Mathematics. AG is supported by the Swiss National Science Foundation grant CRSII5_177237. TH is supported by the European Research Council (ERC) Horizon 2020 project “Alpha Shape Theory Extended” No. 788183. KM is supported by the ERC Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 859860. VR was supported by Australian Research Council Future Fellowship FT140100604 during the early stages of this project.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11440","scopus_import":"1","place":"Cham","year":"2022","edition":"1","oa_version":"Preprint","series_title":"AWMS","publication_identifier":{"eisbn":["9783030955199"],"isbn":["9783030955182"]},"doi":"10.1007/978-3-030-95519-9_1","quality_controlled":"1","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2102.11397","open_access":"1"}],"publisher":"Springer Nature","abstract":[{"lang":"eng","text":"To compute the persistent homology of a grayscale digital image one needs to build a simplicial or cubical complex from it. For cubical complexes, the two commonly used constructions (corresponding to direct and indirect digital adjacencies) can give different results for the same image. The two constructions are almost dual to each other, and we use this relationship to extend and modify the cubical complexes to become dual filtered cell complexes. We derive a general relationship between the persistent homology of two dual filtered cell complexes, and also establish how various modifications to a filtered complex change the persistence diagram. Applying these results to images, we derive a method to transform the persistence diagram computed using one type of cubical complex into a persistence diagram for the other construction. This means software for computing persistent homology from images can now be easily adapted to produce results for either of the two cubical complex constructions without additional low-level code implementation."}],"article_processing_charge":"No","language":[{"iso":"eng"}],"intvolume":"        30","editor":[{"last_name":"Gasparovic","first_name":"Ellen","full_name":"Gasparovic, Ellen"},{"last_name":"Robins","first_name":"Vanessa","full_name":"Robins, Vanessa"},{"full_name":"Turner, Katharine","last_name":"Turner","first_name":"Katharine"}],"volume":30,"ec_funded":1,"publication":"Research in Computational Topology 2","date_published":"2022-01-27T00:00:00Z"},{"month":"06","type":"journal_article","file":[{"file_size":33994829,"content_type":"application/pdf","file_id":"11467","success":1,"checksum":"27f6fe41c6ff84d50445cc9b0176d45b","creator":"dernst","file_name":"2022_ACM_acceptedversion_Piovarci.pdf","date_created":"2022-06-28T08:32:58Z","date_updated":"2022-06-28T08:32:58Z","access_level":"open_access","relation":"main_file"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"status":"public","date_created":"2022-06-10T06:41:47Z","external_id":{"isi":["000830989200091"],"arxiv":["2201.11819"]},"department":[{"_id":"BeBi"}],"author":[{"full_name":"Piovarci, Michael","id":"62E473F4-5C99-11EA-A40E-AF823DDC885E","orcid":"0000-0002-5062-4474","first_name":"Michael","last_name":"Piovarci"},{"full_name":"Foshey, Michael","last_name":"Foshey","first_name":"Michael"},{"full_name":"Xu, Jie","first_name":"Jie","last_name":"Xu"},{"full_name":"Erps, Timothy","last_name":"Erps","first_name":"Timothy"},{"first_name":"Vahid","last_name":"Babaei","full_name":"Babaei, Vahid"},{"full_name":"Didyk, Piotr","last_name":"Didyk","first_name":"Piotr"},{"first_name":"Szymon","last_name":"Rusinkiewicz","full_name":"Rusinkiewicz, Szymon"},{"full_name":"Matusik, Wojciech","last_name":"Matusik","first_name":"Wojciech"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","first_name":"Bernd","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd"}],"publication_status":"published","related_material":{"link":[{"relation":"press_release","description":"News on ISTA website","url":"https://ista.ac.at/en/news/machine-learning-3d-printing-fluids/"}]},"article_number":"112","day":"01","acknowledgement":"This work is graciously supported by the following grant agencies: FWF Lise Meitner (Grant M 3319), SNSF (Grant 200502), ERC Starting Grant (MATERIALIZABLE-715767), NSF (Grant IIS-181507).\r\n","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","issue":"4","_id":"11442","scopus_import":"1","file_date_updated":"2022-06-28T08:32:58Z","date_updated":"2025-09-10T09:36:45Z","PlanS_conform":"1","project":[{"_id":"eb901961-77a9-11ec-83b8-f5c883a62027","name":"Perception-Aware Appearance Fabrication","grant_number":"M03319"},{"grant_number":"715767","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"citation":{"ieee":"M. Piovarci <i>et al.</i>, “Closed-loop control of direct ink writing via reinforcement learning,” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4. Association for Computing Machinery, 2022.","mla":"Piovarci, Michael, et al. “Closed-Loop Control of Direct Ink Writing via Reinforcement Learning.” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4, 112, Association for Computing Machinery, 2022, doi:<a href=\"https://doi.org/10.1145/3528223.3530144\">10.1145/3528223.3530144</a>.","short":"M. Piovarci, M. Foshey, J. Xu, T. Erps, V. Babaei, P. Didyk, S. Rusinkiewicz, W. Matusik, B. Bickel, ACM Transactions on Graphics 41 (2022).","ista":"Piovarci M, Foshey M, Xu J, Erps T, Babaei V, Didyk P, Rusinkiewicz S, Matusik W, Bickel B. 2022. Closed-loop control of direct ink writing via reinforcement learning. ACM Transactions on Graphics. 41(4), 112.","chicago":"Piovarci, Michael, Michael Foshey, Jie Xu, Timothy Erps, Vahid Babaei, Piotr Didyk, Szymon Rusinkiewicz, Wojciech Matusik, and Bernd Bickel. “Closed-Loop Control of Direct Ink Writing via Reinforcement Learning.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3528223.3530144\">https://doi.org/10.1145/3528223.3530144</a>.","ama":"Piovarci M, Foshey M, Xu J, et al. Closed-loop control of direct ink writing via reinforcement learning. <i>ACM Transactions on Graphics</i>. 2022;41(4). doi:<a href=\"https://doi.org/10.1145/3528223.3530144\">10.1145/3528223.3530144</a>","apa":"Piovarci, M., Foshey, M., Xu, J., Erps, T., Babaei, V., Didyk, P., … Bickel, B. (2022). Closed-loop control of direct ink writing via reinforcement learning. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3528223.3530144\">https://doi.org/10.1145/3528223.3530144</a>"},"oa":1,"OA_place":"publisher","title":"Closed-loop control of direct ink writing via reinforcement learning","arxiv":1,"isi":1,"corr_author":"1","publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"has_accepted_license":"1","doi":"10.1145/3528223.3530144","quality_controlled":"1","year":"2022","article_type":"original","ddc":["000"],"oa_version":"Submitted Version","intvolume":"        41","OA_type":"hybrid","volume":41,"ec_funded":1,"date_published":"2022-06-01T00:00:00Z","publication":"ACM Transactions on Graphics","publisher":"Association for Computing Machinery","abstract":[{"lang":"eng","text":"Enabling additive manufacturing to employ a wide range of novel, functional materials can be a major boost to this technology. However, making such materials printable requires painstaking trial-and-error by an expert operator,\r\nas they typically tend to exhibit peculiar rheological or hysteresis properties. Even in the case of successfully finding the process parameters, there is no guarantee of print-to-print consistency due to material differences between batches. These challenges make closed-loop feedback an attractive option where the process parameters are adjusted on-the-fly. There are several challenges for designing an efficient controller: the deposition parameters are complex and highly coupled, artifacts occur after long time horizons, simulating the deposition is computationally costly, and learning on hardware is intractable. In this work, we demonstrate the feasibility of learning a closed-loop control policy for additive manufacturing using reinforcement learning. We show that approximate, but efficient, numerical simulation is\r\nsufficient as long as it allows learning the behavioral patterns of deposition that translate to real-world experiences. In combination with reinforcement learning, our model can be used to discover control policies that outperform\r\nbaseline controllers. Furthermore, the recovered policies have a minimal sim-to-real gap. We showcase this by applying our control policy in-vivo on a single-layer, direct ink writing printer. "}],"article_processing_charge":"No","language":[{"iso":"eng"}]},{"abstract":[{"lang":"eng","text":"Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope P is defined to be the minimum number of facets of a (possibly higher-dimensional) polytope from which P can be obtained as a (linear) projection. This notion is motivated by its relevance to combinatorial optimisation, and has been studied intensively for various specific polytopes associated with important optimisation problems. In this paper we study extension complexity as a parameter of general polytopes, more specifically considering various families of low-dimensional polytopes. First, we prove that for a fixed dimension d, the extension complexity of a random d-dimensional polytope (obtained as the convex hull of random points in a ball or on a sphere) is typically on the order of the square root of its number of vertices. Second, we prove that any cyclic n-vertex polygon (whose vertices lie on a circle) has extension complexity at most 24√n. This bound is tight up to the constant factor 24. Finally, we show that there exists an no(1)-dimensional polytope with at most n vertices and extension complexity n1−o(1). Our theorems are proved with a range of different techniques, which we hope will be of further interest."}],"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2006.08836","open_access":"1"}],"publisher":"American Mathematical Society","article_processing_charge":"No","language":[{"iso":"eng"}],"volume":375,"publication":"Transactions of the American Mathematical Society","date_published":"2022-06-01T00:00:00Z","intvolume":"       375","year":"2022","oa_version":"Preprint","article_type":"original","publication_identifier":{"issn":["0002-9947"],"eissn":["1088-6850"]},"doi":"10.1090/tran/8614","quality_controlled":"1","citation":{"chicago":"Kwan, Matthew Alan, Lisa Sauermann, and Yufei Zhao. “Extension Complexity of Low-Dimensional Polytopes.” <i>Transactions of the American Mathematical Society</i>. American Mathematical Society, 2022. <a href=\"https://doi.org/10.1090/tran/8614\">https://doi.org/10.1090/tran/8614</a>.","ama":"Kwan MA, Sauermann L, Zhao Y. Extension complexity of low-dimensional polytopes. <i>Transactions of the American Mathematical Society</i>. 2022;375(6):4209-4250. doi:<a href=\"https://doi.org/10.1090/tran/8614\">10.1090/tran/8614</a>","apa":"Kwan, M. A., Sauermann, L., &#38; Zhao, Y. (2022). Extension complexity of low-dimensional polytopes. <i>Transactions of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/tran/8614\">https://doi.org/10.1090/tran/8614</a>","ieee":"M. A. Kwan, L. Sauermann, and Y. Zhao, “Extension complexity of low-dimensional polytopes,” <i>Transactions of the American Mathematical Society</i>, vol. 375, no. 6. American Mathematical Society, pp. 4209–4250, 2022.","mla":"Kwan, Matthew Alan, et al. “Extension Complexity of Low-Dimensional Polytopes.” <i>Transactions of the American Mathematical Society</i>, vol. 375, no. 6, American Mathematical Society, 2022, pp. 4209–50, doi:<a href=\"https://doi.org/10.1090/tran/8614\">10.1090/tran/8614</a>.","ista":"Kwan MA, Sauermann L, Zhao Y. 2022. Extension complexity of low-dimensional polytopes. Transactions of the American Mathematical Society. 375(6), 4209–4250.","short":"M.A. Kwan, L. Sauermann, Y. Zhao, Transactions of the American Mathematical Society 375 (2022) 4209–4250."},"oa":1,"date_updated":"2024-10-09T21:02:31Z","arxiv":1,"isi":1,"corr_author":"1","title":"Extension complexity of low-dimensional polytopes","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","issue":"6","day":"01","acknowledgement":"The research of the first author was supported by SNSF Project 178493 and NSF Award DMS-1953990. The research of the second author supported by NSF Award DMS-1953772.\r\nThe research of the third author was supported by NSF Award DMS-1764176, NSF CAREER Award DMS-2044606, a Sloan Research Fellowship, and the MIT Solomon Buchsbaum Fund. ","scopus_import":"1","_id":"11443","department":[{"_id":"MaKw"}],"date_created":"2022-06-12T22:01:45Z","external_id":{"arxiv":["2006.08836"],"isi":["000798461500001"]},"publication_status":"published","author":[{"full_name":"Kwan, Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","last_name":"Kwan","first_name":"Matthew Alan","orcid":"0000-0002-4003-7567"},{"full_name":"Sauermann, Lisa","last_name":"Sauermann","first_name":"Lisa"},{"full_name":"Zhao, Yufei","first_name":"Yufei","last_name":"Zhao"}],"type":"journal_article","month":"06","page":"4209-4250","status":"public"},{"has_accepted_license":"1","quality_controlled":"1","doi":"10.1007/s11538-022-01029-z","publication_identifier":{"eissn":["1522-9602"],"issn":["0092-8240"]},"article_type":"original","oa_version":"Published Version","ddc":["510","570"],"year":"2022","intvolume":"        84","publication":"Bulletin of Mathematical Biology","date_published":"2022-06-17T00:00:00Z","volume":84,"ec_funded":1,"language":[{"iso":"eng"}],"article_processing_charge":"Yes (via OA deal)","publisher":"Springer Nature","abstract":[{"text":"Empirical essays of fitness landscapes suggest that they may be rugged, that is having multiple fitness peaks. Such fitness landscapes, those that have multiple peaks, necessarily have special local structures, called reciprocal sign epistasis (Poelwijk et al. in J Theor Biol 272:141–144, 2011). Here, we investigate the quantitative relationship between the number of fitness peaks and the number of reciprocal sign epistatic interactions. Previously, it has been shown (Poelwijk et al. in J Theor Biol 272:141–144, 2011) that pairwise reciprocal sign epistasis is a necessary but not sufficient condition for the existence of multiple peaks. Applying discrete Morse theory, which to our knowledge has never been used in this context, we extend this result by giving the minimal number of reciprocal sign epistatic interactions required to create a given number of peaks.","lang":"eng"}],"status":"public","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"keyword":["Computational Theory and Mathematics","General Agricultural and Biological Sciences","Pharmacology","General Environmental Science","General Biochemistry","Genetics and Molecular Biology","General Mathematics","Immunology","General Neuroscience"],"file":[{"file_name":"2022_BulletinMathBiology_Saona.pdf","date_updated":"2022-06-20T07:51:32Z","date_created":"2022-06-20T07:51:32Z","access_level":"open_access","relation":"main_file","creator":"dernst","file_size":463025,"content_type":"application/pdf","checksum":"05a1fe7d10914a00c2bca9b447993a65","success":1,"file_id":"11455"}],"type":"journal_article","month":"06","author":[{"id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","first_name":"Raimundo J","orcid":"0000-0001-5103-038X","last_name":"Saona Urmeneta","full_name":"Saona Urmeneta, Raimundo J"},{"orcid":"0000-0001-8243-4694","first_name":"Fyodor","last_name":"Kondrashov","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","full_name":"Kondrashov, Fyodor"},{"full_name":"Khudiakova, Kseniia","id":"4E6DC800-AE37-11E9-AC72-31CAE5697425","last_name":"Khudiakova","first_name":"Kseniia","orcid":"0000-0002-6246-1465"}],"pmid":1,"related_material":{"record":[{"relation":"dissertation_contains","id":"21918","status":"public"}],"link":[{"url":"https://doi.org/10.1007/s11538-022-01118-z","relation":"erratum"}]},"publication_status":"published","date_created":"2022-06-17T16:16:15Z","external_id":{"isi":["000812509800001"],"pmid":["35713756"]},"department":[{"_id":"GradSch"},{"_id":"NiBa"},{"_id":"JaMa"}],"_id":"11447","file_date_updated":"2022-06-20T07:51:32Z","scopus_import":"1","acknowledgement":"We are grateful to Herbert Edelsbrunner and Jeferson Zapata for helpful discussions. Open access funding provided by Austrian Science Fund (FWF). Partially supported by the ERC Consolidator (771209–CharFL) and the FWF Austrian Science Fund (I5127-B) grants to FAK.","day":"17","article_number":"74","issue":"8","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Relation between the number of peaks and the number of reciprocal sign epistatic interactions","corr_author":"1","isi":1,"date_updated":"2026-06-12T12:43:34Z","citation":{"apa":"Saona Urmeneta, R. J., Kondrashov, F., &#38; Khudiakova, K. (2022). Relation between the number of peaks and the number of reciprocal sign epistatic interactions. <i>Bulletin of Mathematical Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11538-022-01029-z\">https://doi.org/10.1007/s11538-022-01029-z</a>","chicago":"Saona Urmeneta, Raimundo J, Fyodor Kondrashov, and Kseniia Khudiakova. “Relation between the Number of Peaks and the Number of Reciprocal Sign Epistatic Interactions.” <i>Bulletin of Mathematical Biology</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s11538-022-01029-z\">https://doi.org/10.1007/s11538-022-01029-z</a>.","ama":"Saona Urmeneta RJ, Kondrashov F, Khudiakova K. Relation between the number of peaks and the number of reciprocal sign epistatic interactions. <i>Bulletin of Mathematical Biology</i>. 2022;84(8). doi:<a href=\"https://doi.org/10.1007/s11538-022-01029-z\">10.1007/s11538-022-01029-z</a>","ista":"Saona Urmeneta RJ, Kondrashov F, Khudiakova K. 2022. Relation between the number of peaks and the number of reciprocal sign epistatic interactions. Bulletin of Mathematical Biology. 84(8), 74.","short":"R.J. Saona Urmeneta, F. Kondrashov, K. Khudiakova, Bulletin of Mathematical Biology 84 (2022).","ieee":"R. J. Saona Urmeneta, F. Kondrashov, and K. Khudiakova, “Relation between the number of peaks and the number of reciprocal sign epistatic interactions,” <i>Bulletin of Mathematical Biology</i>, vol. 84, no. 8. Springer Nature, 2022.","mla":"Saona Urmeneta, Raimundo J., et al. “Relation between the Number of Peaks and the Number of Reciprocal Sign Epistatic Interactions.” <i>Bulletin of Mathematical Biology</i>, vol. 84, no. 8, 74, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1007/s11538-022-01029-z\">10.1007/s11538-022-01029-z</a>."},"oa":1,"project":[{"_id":"26580278-B435-11E9-9278-68D0E5697425","grant_number":"771209","name":"Characterizing the fitness landscape on population and global scales","call_identifier":"H2020"},{"name":"Evolutionary analysis of gene regulation","grant_number":"I05127","_id":"34e076d6-11ca-11ed-8bc3-aec76c41a181"}]},{"has_accepted_license":"1","quality_controlled":"1","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"}],"doi":"10.7554/elife.75842","publication_identifier":{"issn":["2050-084X"]},"article_type":"original","oa_version":"Published Version","ddc":["570"],"year":"2022","intvolume":"        11","date_published":"2022-05-05T00:00:00Z","publication":"eLife","volume":11,"ec_funded":1,"language":[{"iso":"eng"}],"article_processing_charge":"No","publisher":"eLife Sciences Publications","abstract":[{"text":"Studies of protein fitness landscapes reveal biophysical constraints guiding protein evolution and empower prediction of functional proteins. However, generalisation of these findings is limited due to scarceness of systematic data on fitness landscapes of proteins with a defined evolutionary relationship. We characterized the fitness peaks of four orthologous fluorescent proteins with a broad range of sequence divergence. While two of the four studied fitness peaks were sharp, the other two were considerably flatter, being almost entirely free of epistatic interactions. Mutationally robust proteins, characterized by a flat fitness peak, were not optimal templates for machine-learning-driven protein design – instead, predictions were more accurate for fragile proteins with epistatic landscapes. Our work paves insights for practical application of fitness landscape heterogeneity in protein engineering.","lang":"eng"}],"status":"public","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"keyword":["General Immunology and Microbiology","General Biochemistry","Genetics and Molecular Biology","General Medicine","General Neuroscience"],"file":[{"relation":"main_file","access_level":"open_access","date_created":"2022-06-20T07:44:19Z","date_updated":"2022-06-20T07:44:19Z","file_name":"2022_eLife_Somermeyer.pdf","success":1,"file_id":"11454","checksum":"7573c28f44028ab0cc81faef30039e44","content_type":"application/pdf","file_size":5297213,"creator":"dernst"}],"type":"journal_article","month":"05","pmid":1,"author":[{"id":"4720D23C-F248-11E8-B48F-1D18A9856A87","last_name":"Gonzalez Somermeyer","first_name":"Louisa","orcid":"0000-0001-9139-5383","full_name":"Gonzalez Somermeyer, Louisa"},{"full_name":"Fleiss, Aubin","last_name":"Fleiss","first_name":"Aubin"},{"last_name":"Mishin","first_name":"Alexander S","full_name":"Mishin, Alexander S"},{"full_name":"Bozhanova, Nina G","last_name":"Bozhanova","first_name":"Nina G"},{"last_name":"Igolkina","first_name":"Anna A","full_name":"Igolkina, Anna A"},{"last_name":"Meiler","first_name":"Jens","full_name":"Meiler, Jens"},{"last_name":"Alaball Pujol","first_name":"Maria-Elisenda","full_name":"Alaball Pujol, Maria-Elisenda"},{"first_name":"Ekaterina V","last_name":"Putintseva","full_name":"Putintseva, Ekaterina V"},{"full_name":"Sarkisyan, Karen S","last_name":"Sarkisyan","first_name":"Karen S"},{"full_name":"Kondrashov, Fyodor","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","last_name":"Kondrashov","first_name":"Fyodor","orcid":"0000-0001-8243-4694"}],"related_material":{"link":[{"url":"https://github.com/aequorea238/Orthologous_GFP_Fitness_Peaks","relation":"software"}],"record":[{"relation":"dissertation_contains","status":"public","id":"17850"}]},"publication_status":"published","external_id":{"isi":["000799197200001"],"pmid":["35510622"]},"date_created":"2022-06-18T09:06:59Z","department":[{"_id":"GradSch"},{"_id":"FyKo"}],"_id":"11448","scopus_import":"1","file_date_updated":"2022-06-20T07:44:19Z","acknowledgement":"We thank Ondřej Draganov, Rodrigo Redondo, Bor Kavčič, Mia Juračić and Andrea Pauli for discussion and technical advice. We thank Anita Testa Salmazo for advice on resin protein purification, Dmitry Bolotin and the Milaboratory (milaboratory.com) for access to computing and storage infrastructure, and Josef Houser and Eva Fujdiarova for technical assistance and data interpretation. Core facility Biomolecular Interactions and Crystallization of CEITEC Masaryk University is gratefully acknowledged for the obtaining of the scientific data presented in this paper. This research was supported by the Scientific Service Units (SSU) of IST-Austria\r\nthrough resources provided by the Bioimaging Facility (BIF), and the Life Science Facility (LSF). MiSeq and HiSeq NGS sequencing was performed by the Next Generation Sequencing Facility at Vienna BioCenter Core Facilities (VBCF), member of the Vienna BioCenter (VBC), Austria. FACS was performed at the BioOptics Facility of the Institute of Molecular Pathology (IMP), Austria. We also thank the Biomolecular Crystallography Facility in the Vanderbilt University Center for Structural Biology. We are grateful to Joel M Harp for help with X-ray data collection. This work was supported by the ERC Consolidator grant to FAK (771209—CharFL). KSS acknowledges support by President’s Grant МК–5405.2021.1.4, the Imperial College Research Fellowship and the MRC London Institute of Medical Sciences (UKRI MC-A658-5QEA0).\r\nAF is supported by the Marie Skłodowska-Curie Fellowship (H2020-MSCA-IF-2019, Grant Agreement No. 898203, Project acronym \"FLINDIP\"). Experiments were partially carried out using equipment provided by the Institute of Bioorganic Chemistry of the Russian Academy of Sciences Сore Facility (CKP IBCH). This work was supported by a Russian Science Foundation grant 19-74-10102.This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665,385.","article_number":"75842","day":"05","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Heterogeneity of the GFP fitness landscape and data-driven protein design","isi":1,"corr_author":"1","date_updated":"2026-04-07T13:25:01Z","citation":{"ista":"Gonzalez Somermeyer L, Fleiss A, Mishin AS, Bozhanova NG, Igolkina AA, Meiler J, Alaball Pujol M-E, Putintseva EV, Sarkisyan KS, Kondrashov F. 2022. Heterogeneity of the GFP fitness landscape and data-driven protein design. eLife. 11, 75842.","short":"L. Gonzalez Somermeyer, A. Fleiss, A.S. Mishin, N.G. Bozhanova, A.A. Igolkina, J. Meiler, M.-E. Alaball Pujol, E.V. Putintseva, K.S. Sarkisyan, F. Kondrashov, ELife 11 (2022).","mla":"Gonzalez Somermeyer, Louisa, et al. “Heterogeneity of the GFP Fitness Landscape and Data-Driven Protein Design.” <i>ELife</i>, vol. 11, 75842, eLife Sciences Publications, 2022, doi:<a href=\"https://doi.org/10.7554/elife.75842\">10.7554/elife.75842</a>.","ieee":"L. Gonzalez Somermeyer <i>et al.</i>, “Heterogeneity of the GFP fitness landscape and data-driven protein design,” <i>eLife</i>, vol. 11. eLife Sciences Publications, 2022.","apa":"Gonzalez Somermeyer, L., Fleiss, A., Mishin, A. S., Bozhanova, N. G., Igolkina, A. A., Meiler, J., … Kondrashov, F. (2022). Heterogeneity of the GFP fitness landscape and data-driven protein design. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/elife.75842\">https://doi.org/10.7554/elife.75842</a>","chicago":"Gonzalez Somermeyer, Louisa, Aubin Fleiss, Alexander S Mishin, Nina G Bozhanova, Anna A Igolkina, Jens Meiler, Maria-Elisenda Alaball Pujol, Ekaterina V Putintseva, Karen S Sarkisyan, and Fyodor Kondrashov. “Heterogeneity of the GFP Fitness Landscape and Data-Driven Protein Design.” <i>ELife</i>. eLife Sciences Publications, 2022. <a href=\"https://doi.org/10.7554/elife.75842\">https://doi.org/10.7554/elife.75842</a>.","ama":"Gonzalez Somermeyer L, Fleiss A, Mishin AS, et al. Heterogeneity of the GFP fitness landscape and data-driven protein design. <i>eLife</i>. 2022;11. doi:<a href=\"https://doi.org/10.7554/elife.75842\">10.7554/elife.75842</a>"},"oa":1,"project":[{"call_identifier":"H2020","name":"Characterizing the fitness landscape on population and global scales","grant_number":"771209","_id":"26580278-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}]}]