[{"isi":1,"author":[{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner"},{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"full_name":"Rus, Daniela","first_name":"Daniela","last_name":"Rus"},{"first_name":"Radu","full_name":"Grosu, Radu","last_name":"Grosu"}],"abstract":[{"text":"Traditional robotic control suits require profound task-specific knowledge for designing, building and testing control software. The rise of Deep Learning has enabled end-to-end solutions to be learned entirely from data, requiring minimal knowledge about the application area. We design a learning scheme to train end-to-end linear dynamical systems (LDS)s by gradient descent in imitation learning robotic domains. We introduce a new regularization loss component together with a learning algorithm that improves the stability of the learned autonomous system, by forcing the eigenvalues of the internal state updates of an LDS to be negative reals. We evaluate our approach on a series of real-life and simulated robotic experiments, in comparison to linear and nonlinear Recurrent Neural Network (RNN) architectures. Our results show that our stabilizing method significantly improves test performance of LDS, enabling such linear models to match the performance of contemporary nonlinear RNN architectures. A video of the obstacle avoidance performance of our method on a mobile robot, in unseen environments, compared to other methods can be viewed at https://youtu.be/mhEsCoNao5E.","lang":"eng"}],"day":"01","publication_identifier":{"isbn":["9781728173955"],"issn":["1050-4729"]},"publisher":"IEEE","doi":"10.1109/ICRA40945.2020.9196608","file_date_updated":"2020-11-06T10:58:49Z","fulldoi":"https://doi.org/10.1109/ICRA40945.2020.9196608","ddc":["000"],"title":"Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme","scopus_import":"1","oa":1,"article_processing_charge":"No","year":"2020","status":"public","_id":"8704","month":"05","conference":{"start_date":"2020-05-31","location":"Paris, France","name":"ICRA: International Conference on Robotics and Automation","end_date":"2020-08-31"},"publication":"Proceedings - IEEE International Conference on Robotics and Automation","alternative_title":["ICRA"],"external_id":{"isi":["000712319503110"]},"page":"5446-5452","citation":{"chicago":"Lechner, Mathias, Ramin Hasani, Daniela Rus, and Radu Grosu. “Gershgorin Loss Stabilizes the Recurrent Neural Network Compartment of an End-to-End Robot Learning Scheme.” In <i>Proceedings - IEEE International Conference on Robotics and Automation</i>, 5446–52. IEEE, 2020. <a href=\"https://doi.org/10.1109/ICRA40945.2020.9196608\">https://doi.org/10.1109/ICRA40945.2020.9196608</a>.","ieee":"M. Lechner, R. Hasani, D. Rus, and R. Grosu, “Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme,” in <i>Proceedings - IEEE International Conference on Robotics and Automation</i>, Paris, France, 2020, pp. 5446–5452.","short":"M. Lechner, R. Hasani, D. Rus, R. Grosu, in:, Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2020, pp. 5446–5452.","ista":"Lechner M, Hasani R, Rus D, Grosu R. 2020. Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. Proceedings - IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, ICRA, , 5446–5452.","ama":"Lechner M, Hasani R, Rus D, Grosu R. Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. In: <i>Proceedings - IEEE International Conference on Robotics and Automation</i>. IEEE; 2020:5446-5452. doi:<a href=\"https://doi.org/10.1109/ICRA40945.2020.9196608\">10.1109/ICRA40945.2020.9196608</a>","apa":"Lechner, M., Hasani, R., Rus, D., &#38; Grosu, R. (2020). Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. In <i>Proceedings - IEEE International Conference on Robotics and Automation</i> (pp. 5446–5452). Paris, France: IEEE. <a href=\"https://doi.org/10.1109/ICRA40945.2020.9196608\">https://doi.org/10.1109/ICRA40945.2020.9196608</a>","mla":"Lechner, Mathias, et al. “Gershgorin Loss Stabilizes the Recurrent Neural Network Compartment of an End-to-End Robot Learning Scheme.” <i>Proceedings - IEEE International Conference on Robotics and Automation</i>, IEEE, 2020, pp. 5446–52, doi:<a href=\"https://doi.org/10.1109/ICRA40945.2020.9196608\">10.1109/ICRA40945.2020.9196608</a>."},"project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211"}],"acknowledgement":"M.L. is supported in parts by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H., and R.G. are partially supported by the Horizon-2020 ECSELProject grant No. 783163 (iDev40), and the Austrian Research Promotion Agency (FFG), Project No. 860424. R.H. and D.R. is partially supported by the Boeing Company.","department":[{"_id":"ToHe"}],"publication_status":"published","date_updated":"2025-07-10T12:01:21Z","file":[{"date_updated":"2020-11-06T10:58:49Z","file_id":"8733","relation":"main_file","checksum":"fccf7b986ac78046918a298cc6849a50","content_type":"application/pdf","file_name":"2020_ICRA_Lechner.pdf","success":1,"date_created":"2020-11-06T10:58:49Z","file_size":1070010,"creator":"dernst","access_level":"open_access"}],"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","date_created":"2020-10-25T23:01:19Z","language":[{"iso":"eng"}],"date_published":"2020-05-01T00:00:00Z","has_accepted_license":"1","type":"conference"},{"file_date_updated":"2020-10-27T12:49:04Z","doi":"10.1007/s00023-020-00969-3","publisher":"Springer Nature","ddc":["530"],"fulldoi":"https://doi.org/10.1007/s00023-020-00969-3","day":"01","publication_identifier":{"issn":["1424-0637"]},"_id":"8705","month":"12","status":"public","year":"2020","publication":"Annales Henri Poincare","scopus_import":"1","title":"Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit","article_processing_charge":"Yes (via OA deal)","oa":1,"corr_author":"1","isi":1,"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"11473"}]},"abstract":[{"text":"We consider the quantum mechanical many-body problem of a single impurity particle immersed in a weakly interacting Bose gas. The impurity interacts with the bosons via a two-body potential. We study the Hamiltonian of this system in the mean-field limit and rigorously show that, at low energies, the problem is well described by the Fröhlich polaron model.","lang":"eng"}],"author":[{"id":"316457FC-F248-11E8-B48F-1D18A9856A87","full_name":"Mysliwy, Krzysztof","first_name":"Krzysztof","last_name":"Mysliwy"},{"last_name":"Seiringer","first_name":"Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert"}],"article_type":"original","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file":[{"access_level":"open_access","file_size":469831,"creator":"cziletti","date_created":"2020-10-27T12:49:04Z","success":1,"content_type":"application/pdf","file_name":"2020_Annales_Mysliwy.pdf","file_id":"8711","relation":"main_file","checksum":"c12c9c1e6f08def245e42f3cb1d83827","date_updated":"2020-10-27T12:49:04Z"}],"department":[{"_id":"RoSe"}],"publication_status":"published","date_updated":"2026-04-07T14:14:51Z","date_published":"2020-12-01T00:00:00Z","type":"journal_article","has_accepted_license":"1","intvolume":"        21","quality_controlled":"1","arxiv":1,"language":[{"iso":"eng"}],"date_created":"2020-10-25T23:01:19Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Published Version","page":"4003-4025","citation":{"ieee":"K. Mysliwy and R. Seiringer, “Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit,” <i>Annales Henri Poincare</i>, vol. 21, no. 12. Springer Nature, pp. 4003–4025, 2020.","short":"K. Mysliwy, R. Seiringer, Annales Henri Poincare 21 (2020) 4003–4025.","ama":"Mysliwy K, Seiringer R. Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit. <i>Annales Henri Poincare</i>. 2020;21(12):4003-4025. doi:<a href=\"https://doi.org/10.1007/s00023-020-00969-3\">10.1007/s00023-020-00969-3</a>","ista":"Mysliwy K, Seiringer R. 2020. Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit. Annales Henri Poincare. 21(12), 4003–4025.","mla":"Mysliwy, Krzysztof, and Robert Seiringer. “Microscopic Derivation of the Fröhlich Hamiltonian for the Bose Polaron in the Mean-Field Limit.” <i>Annales Henri Poincare</i>, vol. 21, no. 12, Springer Nature, 2020, pp. 4003–25, doi:<a href=\"https://doi.org/10.1007/s00023-020-00969-3\">10.1007/s00023-020-00969-3</a>.","apa":"Mysliwy, K., &#38; Seiringer, R. (2020). Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit. <i>Annales Henri Poincare</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00023-020-00969-3\">https://doi.org/10.1007/s00023-020-00969-3</a>","chicago":"Mysliwy, Krzysztof, and Robert Seiringer. “Microscopic Derivation of the Fröhlich Hamiltonian for the Bose Polaron in the Mean-Field Limit.” <i>Annales Henri Poincare</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s00023-020-00969-3\">https://doi.org/10.1007/s00023-020-00969-3</a>."},"external_id":{"arxiv":["2003.12371"],"isi":["000578111800002"]},"ec_funded":1,"issue":"12","project":[{"call_identifier":"H2020","grant_number":"694227","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385","call_identifier":"H2020"}],"acknowledgement":"Financial support through the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme Grant agreement No. 694227 (R.S.) and the Maria Skłodowska-Curie Grant agreement No. 665386 (K.M.) is gratefully acknowledged. Funding Open access funding provided by Institute of Science and Technology (IST Austria)","volume":21},{"type":"journal_article","date_published":"2020-10-30T00:00:00Z","language":[{"iso":"eng"}],"date_created":"2020-11-02T10:04:46Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","intvolume":"       370","quality_controlled":"1","article_type":"original","date_updated":"2026-06-18T19:35:33Z","publication_status":"published","department":[{"_id":"JiFr"}],"acknowledgement":"We acknowledge M. Glanc and Y. Zhang for providing entryclones; Vienna Biocenter Core Facilities (VBCF) for recombinantprotein production and purification; Vienna Biocenter Massspectrometry Facility, Bioimaging, and Life Science Facilities at IST Austria and Proteomics Core Facility CEITEC for a great assistance.Funding:This project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement 742985) and Austrian Science Fund (FWF): I 3630-B25 to J.F.and by grants from the Austrian Academy of Science through the Gregor Mendel Institute (Y.B.) and the Austrian Agency for International Cooperation in Education and Research (D.D.); the Netherlands Organization for Scientific Research (NWO; VIDI-864.13.001) (W.S.); the Research Foundation–Flanders (FWO;Odysseus II G0D0515N) and a European Research Council grant (ERC; StG TORPEDO; 714055) to B.D.R., B.Y., and E.M.; and the Hertha Firnberg Programme postdoctoral fellowship (T-947) from the FWF Austrian Science Fund to E.S.-L.; J.H. is the recipient of a DOC Fellowship of the Austrian Academy of Sciences at IST Austria.","volume":370,"project":[{"call_identifier":"H2020","_id":"261099A6-B435-11E9-9278-68D0E5697425","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","grant_number":"742985"},{"name":"Molecular mechanisms of endocytic cargo recognition in plants","grant_number":"I03630","_id":"26538374-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2699E3D2-B435-11E9-9278-68D0E5697425","name":"Cell surface receptor complexes for PIN polarity and auxin-mediated development","grant_number":"25239"}],"page":"550-557","citation":{"chicago":"Hajny, Jakub, Tomas Prat, N Rydza, Lesia Rodriguez Solovey, Shutang Tan, Inge Verstraeten, David Domjan, et al. “Receptor Kinase Module Targets PIN-Dependent Auxin Transport during Canalization.” <i>Science</i>. American Association for the Advancement of Science, 2020. <a href=\"https://doi.org/10.1126/science.aba3178\">https://doi.org/10.1126/science.aba3178</a>.","mla":"Hajny, Jakub, et al. “Receptor Kinase Module Targets PIN-Dependent Auxin Transport during Canalization.” <i>Science</i>, vol. 370, no. 6516, American Association for the Advancement of Science, 2020, pp. 550–57, doi:<a href=\"https://doi.org/10.1126/science.aba3178\">10.1126/science.aba3178</a>.","apa":"Hajny, J., Prat, T., Rydza, N., Rodriguez Solovey, L., Tan, S., Verstraeten, I., … Friml, J. (2020). Receptor kinase module targets PIN-dependent auxin transport during canalization. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.aba3178\">https://doi.org/10.1126/science.aba3178</a>","ama":"Hajny J, Prat T, Rydza N, et al. Receptor kinase module targets PIN-dependent auxin transport during canalization. <i>Science</i>. 2020;370(6516):550-557. doi:<a href=\"https://doi.org/10.1126/science.aba3178\">10.1126/science.aba3178</a>","ista":"Hajny J, Prat T, Rydza N, Rodriguez Solovey L, Tan S, Verstraeten I, Domjan D, Mazur E, Smakowska-Luzan E, Smet W, Mor E, Nolf J, Yang B, Grunewald W, Molnar G, Belkhadir Y, De Rybel B, Friml J. 2020. Receptor kinase module targets PIN-dependent auxin transport during canalization. Science. 370(6516), 550–557.","short":"J. Hajny, T. Prat, N. Rydza, L. Rodriguez Solovey, S. Tan, I. Verstraeten, D. Domjan, E. Mazur, E. Smakowska-Luzan, W. Smet, E. Mor, J. Nolf, B. Yang, W. Grunewald, G. Molnar, Y. Belkhadir, B. De Rybel, J. Friml, Science 370 (2020) 550–557.","ieee":"J. Hajny <i>et al.</i>, “Receptor kinase module targets PIN-dependent auxin transport during canalization,” <i>Science</i>, vol. 370, no. 6516. American Association for the Advancement of Science, pp. 550–557, 2020."},"external_id":{"pmid":["33122378"],"isi":["000583031800041"]},"main_file_link":[{"url":"https://europepmc.org/article/MED/33122378#free-full-text","open_access":"1"}],"issue":"6516","ec_funded":1,"publication":"Science","month":"10","_id":"8721","status":"public","year":"2020","article_processing_charge":"No","oa":1,"scopus_import":"1","title":"Receptor kinase module targets PIN-dependent auxin transport during canalization","ddc":["580"],"fulldoi":"https://doi.org/10.1126/science.aba3178","doi":"10.1126/science.aba3178","publisher":"American Association for the Advancement of Science","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"day":"30","abstract":[{"lang":"eng","text":"Spontaneously arising channels that transport the phytohormone auxin provide positional cues for self-organizing aspects of plant development such as flexible vasculature regeneration or its patterning during leaf venation. The auxin canalization hypothesis proposes a feedback between auxin signaling and transport as the underlying mechanism, but molecular players await discovery. We identified part of the machinery that routes auxin transport. The auxin-regulated receptor CAMEL (Canalization-related Auxin-regulated Malectin-type RLK) together with CANAR (Canalization-related Receptor-like kinase) interact with and phosphorylate PIN auxin transporters. camel and canar mutants are impaired in PIN1 subcellular trafficking and auxin-mediated PIN polarization, which macroscopically manifests as defects in leaf venation and vasculature regeneration after wounding. The CAMEL-CANAR receptor complex is part of the auxin feedback that coordinates polarization of individual cells during auxin canalization."}],"related_material":{"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/molecular-compass-for-cell-orientation/"}]},"pmid":1,"author":[{"last_name":"Hajny","first_name":"Jakub","orcid":"0000-0003-2140-7195","full_name":"Hajny, Jakub","id":"4800CC20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Tomas","full_name":"Prat, Tomas","id":"3DA3BFEE-F248-11E8-B48F-1D18A9856A87","last_name":"Prat"},{"last_name":"Rydza","full_name":"Rydza, N","first_name":"N"},{"last_name":"Rodriguez Solovey","full_name":"Rodriguez Solovey, Lesia","id":"3922B506-F248-11E8-B48F-1D18A9856A87","first_name":"Lesia","orcid":"0000-0002-7244-7237"},{"full_name":"Tan, Shutang","id":"2DE75584-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0471-8285","first_name":"Shutang","last_name":"Tan"},{"orcid":"0000-0001-7241-2328","first_name":"Inge","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","full_name":"Verstraeten, Inge","last_name":"Verstraeten"},{"last_name":"Domjan","first_name":"David","orcid":"0000-0003-2267-106X","full_name":"Domjan, David","id":"C684CD7A-257E-11EA-9B6F-D8588B4F947F"},{"first_name":"E","full_name":"Mazur, E","last_name":"Mazur"},{"last_name":"Smakowska-Luzan","full_name":"Smakowska-Luzan, E","first_name":"E"},{"last_name":"Smet","full_name":"Smet, W","first_name":"W"},{"full_name":"Mor, E","first_name":"E","last_name":"Mor"},{"last_name":"Nolf","full_name":"Nolf, J","first_name":"J"},{"last_name":"Yang","full_name":"Yang, B","first_name":"B"},{"first_name":"W","full_name":"Grunewald, W","last_name":"Grunewald"},{"last_name":"Molnar","full_name":"Molnar, Gergely","id":"34F1AF46-F248-11E8-B48F-1D18A9856A87","first_name":"Gergely"},{"last_name":"Belkhadir","first_name":"Y","full_name":"Belkhadir, Y"},{"full_name":"De Rybel, B","first_name":"B","last_name":"De Rybel"},{"full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","orcid":"0000-0002-8302-7596","last_name":"Friml"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"isi":1},{"date_updated":"2025-04-14T07:49:12Z","publication_status":"published","department":[{"_id":"DaAl"}],"language":[{"iso":"eng"}],"date_created":"2020-11-05T15:25:30Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Preprint","quality_controlled":"1","arxiv":1,"type":"conference","date_published":"2020-02-01T00:00:00Z","ec_funded":1,"page":"45-61","citation":{"ieee":"S. Li, T. B.-N. Tal Ben-Nun, S. D. Girolamo, D.-A. Alistarh, and T. Hoefler, “Taming unbalanced training workloads in deep learning with partial collective operations,” in <i>Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>, San Diego, CA, United States, 2020, pp. 45–61.","short":"S. Li, T.B.-N. Tal Ben-Nun, S.D. Girolamo, D.-A. Alistarh, T. Hoefler, in:, Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2020, pp. 45–61.","ista":"Li S, Tal Ben-Nun TB-N, Girolamo SD, Alistarh D-A, Hoefler T. 2020. Taming unbalanced training workloads in deep learning with partial collective operations. Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPoPP: Sympopsium on Principles and Practice of Parallel Programming, 45–61.","ama":"Li S, Tal Ben-Nun TB-N, Girolamo SD, Alistarh D-A, Hoefler T. Taming unbalanced training workloads in deep learning with partial collective operations. In: <i>Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>. Association for Computing Machinery; 2020:45-61. doi:<a href=\"https://doi.org/10.1145/3332466.3374528\">10.1145/3332466.3374528</a>","apa":"Li, S., Tal Ben-Nun, T. B.-N., Girolamo, S. D., Alistarh, D.-A., &#38; Hoefler, T. (2020). Taming unbalanced training workloads in deep learning with partial collective operations. In <i>Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i> (pp. 45–61). San Diego, CA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3332466.3374528\">https://doi.org/10.1145/3332466.3374528</a>","mla":"Li, Shigang, et al. “Taming Unbalanced Training Workloads in Deep Learning with Partial Collective Operations.” <i>Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>, Association for Computing Machinery, 2020, pp. 45–61, doi:<a href=\"https://doi.org/10.1145/3332466.3374528\">10.1145/3332466.3374528</a>.","chicago":"Li, Shigang, Tal Ben-Nun Tal Ben-Nun, Salvatore Di Girolamo, Dan-Adrian Alistarh, and Torsten Hoefler. “Taming Unbalanced Training Workloads in Deep Learning with Partial Collective Operations.” In <i>Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>, 45–61. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3332466.3374528\">https://doi.org/10.1145/3332466.3374528</a>."},"external_id":{"arxiv":["1908.04207"],"isi":["000564476500004"]},"main_file_link":[{"url":"https://arxiv.org/abs/1908.04207","open_access":"1"}],"project":[{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"day":"01","fulldoi":"https://doi.org/10.1145/3332466.3374528","doi":"10.1145/3332466.3374528","publisher":"Association for Computing Machinery","article_processing_charge":"No","oa":1,"scopus_import":"1","title":"Taming unbalanced training workloads in deep learning with partial collective operations","publication":"Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","conference":{"location":"San Diego, CA, United States","name":"PPoPP: Sympopsium on Principles and Practice of Parallel Programming","end_date":"2020-02-26","start_date":"2020-02-22"},"_id":"8722","status":"public","month":"02","year":"2020","isi":1,"author":[{"last_name":"Li","first_name":"Shigang","full_name":"Li, Shigang"},{"last_name":"Tal Ben-Nun","first_name":"Tal Ben-Nun","full_name":"Tal Ben-Nun, Tal Ben-Nun"},{"last_name":"Girolamo","first_name":"Salvatore Di","full_name":"Girolamo, Salvatore Di"},{"first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"},{"first_name":"Torsten","full_name":"Hoefler, Torsten","last_name":"Hoefler"}],"abstract":[{"lang":"eng","text":"Load imbalance pervasively exists in distributed deep learning training systems, either caused by the inherent imbalance in learned tasks or by the system itself. Traditional synchronous Stochastic Gradient Descent (SGD)\r\nachieves good accuracy for a wide variety of tasks, but relies on global synchronization to accumulate the gradients at every training step. In this paper, we propose eager-SGD, which relaxes the global synchronization for\r\ndecentralized accumulation. To implement eager-SGD, we propose to use two partial collectives: solo and majority. With solo allreduce, the faster processes contribute their gradients eagerly without waiting for the slower processes, whereas with majority allreduce, at least half of the participants must contribute gradients before continuing, all without using a central parameter server. We theoretically prove the convergence of the algorithms and describe the partial collectives in detail. Experimental results on load-imbalanced environments (CIFAR-10, ImageNet, and UCF101 datasets) show\r\nthat eager-SGD achieves 1.27x speedup over the state-of-the-art synchronous SGD, without losing accuracy."}]},{"ec_funded":1,"external_id":{"arxiv":["2002.10384"]},"citation":{"short":"N.H. Konstantinov, E. Frantar, D.-A. Alistarh, C. Lampert, in:, Proceedings of the 37th International Conference on Machine Learning, ML Research Press, 2020, pp. 5416–5425.","ieee":"N. H. Konstantinov, E. Frantar, D.-A. Alistarh, and C. Lampert, “On the sample complexity of adversarial multi-source PAC learning,” in <i>Proceedings of the 37th International Conference on Machine Learning</i>, Online, 2020, vol. 119, pp. 5416–5425.","apa":"Konstantinov, N. H., Frantar, E., Alistarh, D.-A., &#38; Lampert, C. (2020). On the sample complexity of adversarial multi-source PAC learning. In <i>Proceedings of the 37th International Conference on Machine Learning</i> (Vol. 119, pp. 5416–5425). Online: ML Research Press.","mla":"Konstantinov, Nikola H., et al. “On the Sample Complexity of Adversarial Multi-Source PAC Learning.” <i>Proceedings of the 37th International Conference on Machine Learning</i>, vol. 119, ML Research Press, 2020, pp. 5416–25.","ista":"Konstantinov NH, Frantar E, Alistarh D-A, Lampert C. 2020. On the sample complexity of adversarial multi-source PAC learning. Proceedings of the 37th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 119, 5416–5425.","ama":"Konstantinov NH, Frantar E, Alistarh D-A, Lampert C. On the sample complexity of adversarial multi-source PAC learning. In: <i>Proceedings of the 37th International Conference on Machine Learning</i>. Vol 119. ML Research Press; 2020:5416-5425.","chicago":"Konstantinov, Nikola H, Elias Frantar, Dan-Adrian Alistarh, and Christoph Lampert. “On the Sample Complexity of Adversarial Multi-Source PAC Learning.” In <i>Proceedings of the 37th International Conference on Machine Learning</i>, 119:5416–25. ML Research Press, 2020."},"page":"5416-5425","volume":119,"acknowledgement":"Dan Alistarh is supported in part by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp).","project":[{"call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223"}],"date_updated":"2026-04-07T14:19:48Z","department":[{"_id":"DaAl"},{"_id":"ChLa"}],"publication_status":"published","file":[{"access_level":"open_access","creator":"dernst","file_size":281286,"date_created":"2021-02-15T09:00:01Z","success":1,"file_name":"2020_PMLR_Konstantinov.pdf","content_type":"application/pdf","relation":"main_file","checksum":"cc755d0054bc4b2be778ea7aa7884d2f","file_id":"9120","date_updated":"2021-02-15T09:00:01Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","date_created":"2020-11-05T15:25:58Z","language":[{"iso":"eng"}],"quality_controlled":"1","arxiv":1,"intvolume":"       119","has_accepted_license":"1","type":"conference","date_published":"2020-07-12T00:00:00Z","acknowledged_ssus":[{"_id":"ScienComp"}],"corr_author":"1","author":[{"last_name":"Konstantinov","first_name":"Nikola H","orcid":"0009-0009-5204-7621","full_name":"Konstantinov, Nikola H","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Frantar","first_name":"Elias","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f","full_name":"Frantar, Elias"},{"last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert"}],"abstract":[{"lang":"eng","text":"We study the problem of learning from multiple untrusted data sources, a scenario of increasing practical relevance given the recent emergence of crowdsourcing and collaborative learning paradigms. Specifically, we analyze the situation in which a learning system obtains datasets from multiple sources, some of which might be biased or even adversarially perturbed. It is\r\nknown that in the single-source case, an adversary with the power to corrupt a fixed fraction of the training data can prevent PAC-learnability, that is, even in the limit of infinitely much training data, no learning system can approach the optimal test error. In this work we show that, surprisingly, the same is not true in the multi-source setting, where the adversary can arbitrarily\r\ncorrupt a fixed fraction of the data sources. Our main results are a generalization bound that provides finite-sample guarantees for this learning setting, as well as corresponding lower bounds. Besides establishing PAC-learnability our results also show that in a cooperative learning setting sharing data with other parties has provable benefits, even if some\r\nparticipants are malicious. "}],"related_material":{"record":[{"id":"10799","relation":"dissertation_contains","status":"public"}],"link":[{"relation":"supplementary_material","url":"http://proceedings.mlr.press/v119/konstantinov20a/konstantinov20a-supp.pdf"}]},"publication_identifier":{"issn":["2640-3498"]},"day":"12","ddc":["000"],"publisher":"ML Research Press","file_date_updated":"2021-02-15T09:00:01Z","oa":1,"article_processing_charge":"No","title":"On the sample complexity of adversarial multi-source PAC learning","scopus_import":"1","conference":{"start_date":"2020-07-12","end_date":"2020-07-18","name":"ICML: International Conference on Machine Learning","location":"Online"},"publication":"Proceedings of the 37th International Conference on Machine Learning","year":"2020","_id":"8724","status":"public","month":"07"},{"language":[{"iso":"eng"}],"date_created":"2020-11-05T15:26:17Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","quality_controlled":"1","intvolume":"       179","arxiv":1,"type":"conference","has_accepted_license":"1","date_published":"2020-08-03T00:00:00Z","date_updated":"2025-04-14T07:49:12Z","publication_status":"published","department":[{"_id":"DaAl"}],"tmp":{"name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","short":"CC BY (3.0)","image":"/images/cc_by.png"},"file":[{"file_id":"9237","relation":"main_file","checksum":"a626a9c47df52b6f6d97edd910dae4ba","date_updated":"2021-03-11T12:33:35Z","success":1,"content_type":"application/pdf","file_name":"2020_LIPIcs_Aksenov.pdf","file_size":740358,"creator":"dernst","date_created":"2021-03-11T12:33:35Z","access_level":"open_access"}],"volume":179,"acknowledgement":"Vitaly Aksenov: Government of Russian Federation (Grant 08-08).\r\nDan Alistarh: ERC Starting Grant 805223 ScaleML.","project":[{"grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"ec_funded":1,"page":"3:1-3:18","citation":{"chicago":"Aksenov, Vitaly, Dan-Adrian Alistarh, Alexandra Drozdova, and Amirkeivan Mohtashami. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” In <i>34th International Symposium on Distributed Computing</i>, 179:3:1-3:18. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.3\">https://doi.org/10.4230/LIPIcs.DISC.2020.3</a>.","short":"V. Aksenov, D.-A. Alistarh, A. Drozdova, A. Mohtashami, in:, 34th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18.","ieee":"V. Aksenov, D.-A. Alistarh, A. Drozdova, and A. Mohtashami, “The splay-list: A distribution-adaptive concurrent skip-list,” in <i>34th International Symposium on Distributed Computing</i>, Freiburg, Germany, 2020, vol. 179, p. 3:1-3:18.","mla":"Aksenov, Vitaly, et al. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” <i>34th International Symposium on Distributed Computing</i>, vol. 179, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.3\">10.4230/LIPIcs.DISC.2020.3</a>.","apa":"Aksenov, V., Alistarh, D.-A., Drozdova, A., &#38; Mohtashami, A. (2020). The splay-list: A distribution-adaptive concurrent skip-list. In <i>34th International Symposium on Distributed Computing</i> (Vol. 179, p. 3:1-3:18). Freiburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.3\">https://doi.org/10.4230/LIPIcs.DISC.2020.3</a>","ista":"Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. 2020. The splay-list: A distribution-adaptive concurrent skip-list. 34th International Symposium on Distributed Computing. DISC: Symposium on Distributed ComputingLIPIcs vol. 179, 3:1-3:18.","ama":"Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. The splay-list: A distribution-adaptive concurrent skip-list. In: <i>34th International Symposium on Distributed Computing</i>. Vol 179. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020:3:1-3:18. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.3\">10.4230/LIPIcs.DISC.2020.3</a>"},"external_id":{"arxiv":["2008.01009"]},"article_processing_charge":"No","oa":1,"scopus_import":"1","title":"The splay-list: A distribution-adaptive concurrent skip-list","publication":"34th International Symposium on Distributed Computing","conference":{"end_date":"2020-10-16","name":"DISC: Symposium on Distributed Computing","location":"Freiburg, Germany","start_date":"2020-10-12"},"_id":"8725","month":"08","status":"public","year":"2020","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959771689"]},"day":"03","series_title":"LIPIcs","fulldoi":"https://doi.org/10.4230/LIPIcs.DISC.2020.3","ddc":["000"],"file_date_updated":"2021-03-11T12:33:35Z","doi":"10.4230/LIPIcs.DISC.2020.3","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"last_name":"Aksenov","first_name":"Vitaly","full_name":"Aksenov, Vitaly"},{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X"},{"first_name":"Alexandra","full_name":"Drozdova, Alexandra","last_name":"Drozdova"},{"full_name":"Mohtashami, Amirkeivan","first_name":"Amirkeivan","last_name":"Mohtashami"}],"abstract":[{"text":"The design and implementation of efficient concurrent data structures have\r\nseen significant attention. However, most of this work has focused on\r\nconcurrent data structures providing good \\emph{worst-case} guarantees. In real\r\nworkloads, objects are often accessed at different rates, since access\r\ndistributions may be non-uniform. Efficient distribution-adaptive data\r\nstructures are known in the sequential case, e.g. the splay-trees; however,\r\nthey often are hard to translate efficiently in the concurrent case.\r\n  In this paper, we investigate distribution-adaptive concurrent data\r\nstructures and propose a new design called the splay-list. At a high level, the\r\nsplay-list is similar to a standard skip-list, with the key distinction that\r\nthe height of each element adapts dynamically to its access rate: popular\r\nelements ``move up,'' whereas rarely-accessed elements decrease in height. We\r\nshow that the splay-list provides order-optimal amortized complexity bounds for\r\na subset of operations while being amenable to efficient concurrent\r\nimplementation. Experimental results show that the splay-list can leverage\r\ndistribution-adaptivity to improve on the performance of classic concurrent\r\ndesigns, and can outperform the only previously-known distribution-adaptive\r\ndesign in certain settings.","lang":"eng"}]},{"type":"journal_article","has_accepted_license":"1","date_published":"2020-08-26T00:00:00Z","language":[{"iso":"eng"}],"oa_version":"Published Version","date_created":"2020-11-06T07:21:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"         5","quality_controlled":"1","arxiv":1,"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file":[{"date_created":"2020-11-06T07:24:40Z","file_size":768336,"creator":"dernst","access_level":"open_access","date_updated":"2020-11-06T07:24:40Z","file_id":"8727","relation":"main_file","checksum":"a57a698ff99a11b6665bafd1bac7afbc","content_type":"application/pdf","file_name":"2020_CondensedMatter_Gotfryd.pdf","success":1}],"article_type":"original","date_updated":"2025-04-14T07:43:50Z","department":[{"_id":"MiLe"}],"publication_status":"published","volume":5,"project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"citation":{"ama":"Gotfryd D, Paerschke E, Wohlfeld K, Oleś AM. Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling. <i>Condensed Matter</i>. 2020;5(3). doi:<a href=\"https://doi.org/10.3390/condmat5030053\">10.3390/condmat5030053</a>","ista":"Gotfryd D, Paerschke E, Wohlfeld K, Oleś AM. 2020. Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling. Condensed Matter. 5(3), 53.","apa":"Gotfryd, D., Paerschke, E., Wohlfeld, K., &#38; Oleś, A. M. (2020). Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling. <i>Condensed Matter</i>. MDPI. <a href=\"https://doi.org/10.3390/condmat5030053\">https://doi.org/10.3390/condmat5030053</a>","mla":"Gotfryd, Dorota, et al. “Evolution of Spin-Orbital Entanglement with Increasing Ising Spin-Orbit Coupling.” <i>Condensed Matter</i>, vol. 5, no. 3, 53, MDPI, 2020, doi:<a href=\"https://doi.org/10.3390/condmat5030053\">10.3390/condmat5030053</a>.","ieee":"D. Gotfryd, E. Paerschke, K. Wohlfeld, and A. M. Oleś, “Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling,” <i>Condensed Matter</i>, vol. 5, no. 3. MDPI, 2020.","short":"D. Gotfryd, E. Paerschke, K. Wohlfeld, A.M. Oleś, Condensed Matter 5 (2020).","chicago":"Gotfryd, Dorota, Ekaterina Paerschke, Krzysztof Wohlfeld, and Andrzej M. Oleś. “Evolution of Spin-Orbital Entanglement with Increasing Ising Spin-Orbit Coupling.” <i>Condensed Matter</i>. MDPI, 2020. <a href=\"https://doi.org/10.3390/condmat5030053\">https://doi.org/10.3390/condmat5030053</a>."},"external_id":{"arxiv":["2009.11773"]},"issue":"3","ec_funded":1,"publication":"Condensed Matter","_id":"8726","status":"public","month":"08","year":"2020","article_processing_charge":"No","oa":1,"scopus_import":"1","title":"Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling","fulldoi":"https://doi.org/10.3390/condmat5030053","ddc":["530"],"doi":"10.3390/condmat5030053","file_date_updated":"2020-11-06T07:24:40Z","publisher":"MDPI","publication_identifier":{"issn":["2410-3896"]},"day":"26","abstract":[{"text":"Several realistic spin-orbital models for transition metal oxides go beyond the classical expectations and could be understood only by employing the quantum entanglement. Experiments on these materials confirm that spin-orbital entanglement has measurable consequences. Here, we capture the essential features of spin-orbital entanglement in complex quantum matter utilizing 1D spin-orbital model which accommodates SU(2)⊗SU(2) symmetric Kugel-Khomskii superexchange as well as the Ising on-site spin-orbit coupling. Building on the results obtained for full and effective models in the regime of strong spin-orbit coupling, we address the question whether the entanglement found on superexchange bonds always increases when the Ising spin-orbit coupling is added. We show that (i) quantum entanglement is amplified by strong spin-orbit coupling and, surprisingly, (ii) almost classical disentangled states are possible. We complete the latter case by analyzing how the entanglement existing for intermediate values of spin-orbit coupling can disappear for higher values of this coupling.","lang":"eng"}],"author":[{"full_name":"Gotfryd, Dorota","first_name":"Dorota","last_name":"Gotfryd"},{"first_name":"Ekaterina","orcid":"0000-0003-0853-8182","full_name":"Paerschke, Ekaterina","id":"8275014E-6063-11E9-9B7F-6338E6697425","last_name":"Paerschke"},{"first_name":"Krzysztof","full_name":"Wohlfeld, Krzysztof","last_name":"Wohlfeld"},{"last_name":"Oleś","first_name":"Andrzej M.","full_name":"Oleś, Andrzej M."}],"article_number":"53"},{"author":[{"orcid":"0000-0003-2401-8670","first_name":"Alan M","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","full_name":"Arroyo Guevara, Alan M","last_name":"Arroyo Guevara"},{"first_name":"Fabian","full_name":"Klute, Fabian","last_name":"Klute"},{"full_name":"Parada, Irene","first_name":"Irene","last_name":"Parada"},{"full_name":"Seidel, Raimund","first_name":"Raimund","last_name":"Seidel"},{"full_name":"Vogtenhuber, Birgit","first_name":"Birgit","last_name":"Vogtenhuber"},{"first_name":"Tilo","full_name":"Wiedera, Tilo","last_name":"Wiedera"}],"abstract":[{"lang":"eng","text":"A simple drawing D(G) of a graph G is one where each pair of edges share at most one point: either a common endpoint or a proper crossing. An edge e in the complement of G can be inserted into D(G) if there exists a simple drawing of   G+e  extending D(G). As a result of Levi’s Enlargement Lemma, if a drawing is rectilinear (pseudolinear), that is, the edges can be extended into an arrangement of lines (pseudolines), then any edge in the complement of G can be inserted. In contrast, we show that it is   NP -complete to decide whether one edge can be inserted into a simple drawing. This remains true even if we assume that the drawing is pseudocircular, that is, the edges can be extended to an arrangement of pseudocircles. On the positive side, we show that, given an arrangement of pseudocircles   A  and a pseudosegment   σ , it can be decided in polynomial time whether there exists a pseudocircle   Φσ  extending   σ  for which   A∪{Φσ}  is again an arrangement of pseudocircles."}],"isi":1,"title":"Inserting one edge into a simple drawing is hard","scopus_import":"1","article_processing_charge":"No","year":"2020","status":"public","_id":"8732","month":"10","conference":{"start_date":"2020-06-24","location":"Leeds, United Kingdom","name":"WG: Workshop on Graph-Theoretic Concepts in Computer Science","end_date":"2020-06-26"},"alternative_title":["LNCS"],"publication":"Graph-Theoretic Concepts in Computer Science","day":"09","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783030604394"],"eisbn":["9783030604400"]},"publisher":"Springer Nature","doi":"10.1007/978-3-030-60440-0_26","fulldoi":"https://doi.org/10.1007/978-3-030-60440-0_26","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"volume":12301,"ec_funded":1,"external_id":{"isi":["001299688100026"]},"citation":{"mla":"Arroyo Guevara, Alan M., et al. “Inserting One Edge into a Simple Drawing Is Hard.” <i>Graph-Theoretic Concepts in Computer Science</i>, vol. 12301, Springer Nature, 2020, pp. 325–38, doi:<a href=\"https://doi.org/10.1007/978-3-030-60440-0_26\">10.1007/978-3-030-60440-0_26</a>.","apa":"Arroyo Guevara, A. M., Klute, F., Parada, I., Seidel, R., Vogtenhuber, B., &#38; Wiedera, T. (2020). Inserting one edge into a simple drawing is hard. In <i>Graph-Theoretic Concepts in Computer Science</i> (Vol. 12301, pp. 325–338). Leeds, United Kingdom: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-60440-0_26\">https://doi.org/10.1007/978-3-030-60440-0_26</a>","ista":"Arroyo Guevara AM, Klute F, Parada I, Seidel R, Vogtenhuber B, Wiedera T. 2020. Inserting one edge into a simple drawing is hard. Graph-Theoretic Concepts in Computer Science. WG: Workshop on Graph-Theoretic Concepts in Computer Science, LNCS, vol. 12301, 325–338.","ama":"Arroyo Guevara AM, Klute F, Parada I, Seidel R, Vogtenhuber B, Wiedera T. Inserting one edge into a simple drawing is hard. In: <i>Graph-Theoretic Concepts in Computer Science</i>. Vol 12301. Springer Nature; 2020:325-338. doi:<a href=\"https://doi.org/10.1007/978-3-030-60440-0_26\">10.1007/978-3-030-60440-0_26</a>","short":"A.M. Arroyo Guevara, F. Klute, I. Parada, R. Seidel, B. Vogtenhuber, T. Wiedera, in:, Graph-Theoretic Concepts in Computer Science, Springer Nature, 2020, pp. 325–338.","ieee":"A. M. Arroyo Guevara, F. Klute, I. Parada, R. Seidel, B. Vogtenhuber, and T. Wiedera, “Inserting one edge into a simple drawing is hard,” in <i>Graph-Theoretic Concepts in Computer Science</i>, Leeds, United Kingdom, 2020, vol. 12301, pp. 325–338.","chicago":"Arroyo Guevara, Alan M, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, and Tilo Wiedera. “Inserting One Edge into a Simple Drawing Is Hard.” In <i>Graph-Theoretic Concepts in Computer Science</i>, 12301:325–38. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-60440-0_26\">https://doi.org/10.1007/978-3-030-60440-0_26</a>."},"page":"325-338","quality_controlled":"1","intvolume":"     12301","date_created":"2020-11-06T08:45:03Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa_version":"None","language":[{"iso":"eng"}],"date_published":"2020-10-09T00:00:00Z","type":"conference","publication_status":"published","department":[{"_id":"UlWa"}],"date_updated":"2026-04-16T10:22:35Z"},{"_id":"8737","status":"public","month":"10","year":"2020","publication":"Science","scopus_import":"1","title":"The coupling mechanism of mammalian respiratory complex I","article_processing_charge":"No","oa":1,"doi":"10.1126/science.abc4209","file_date_updated":"2020-11-26T18:47:58Z","publisher":"American Association for the Advancement of Science","ddc":["572"],"fulldoi":"https://doi.org/10.1126/science.abc4209","day":"30","publication_identifier":{"eissn":["1095-9203"]},"abstract":[{"text":"Mitochondrial complex I couples NADH:ubiquinone oxidoreduction to proton pumping by an unknown mechanism. Here, we present cryo-electron microscopy structures of ovine complex I in five different conditions, including turnover, at resolutions up to 2.3 to 2.5 angstroms. Resolved water molecules allowed us to experimentally define the proton translocation pathways. Quinone binds at three positions along the quinone cavity, as does the inhibitor rotenone that also binds within subunit ND4. Dramatic conformational changes around the quinone cavity couple the redox reaction to proton translocation during open-to-closed state transitions of the enzyme. In the induced deactive state, the open conformation is arrested by the ND6 subunit. We propose a detailed molecular coupling mechanism of complex I, which is an unexpected combination of conformational changes and electrostatic interactions.","lang":"eng"}],"author":[{"id":"37233050-F248-11E8-B48F-1D18A9856A87","full_name":"Kampjut, Domen","orcid":"0000-0002-6018-3422","first_name":"Domen","last_name":"Kampjut"},{"id":"338D39FE-F248-11E8-B48F-1D18A9856A87","full_name":"Sazanov, Leonid A","orcid":"0000-0002-0977-7989","first_name":"Leonid A","last_name":"Sazanov"}],"pmid":1,"isi":1,"article_number":"eabc4209","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"EM-Fac"}],"date_published":"2020-10-30T00:00:00Z","type":"journal_article","has_accepted_license":"1","intvolume":"       370","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_created":"2020-11-08T23:01:23Z","oa_version":"Submitted Version","article_type":"original","file":[{"success":1,"content_type":"application/pdf","file_name":"Full_manuscript_with_SI_opt_red.pdf","file_id":"8820","checksum":"658ba90979ca9528a2efdfac8547047a","relation":"main_file","date_updated":"2020-11-26T18:47:58Z","access_level":"open_access","file_size":7618987,"creator":"lsazanov","date_created":"2020-11-26T18:47:58Z"}],"department":[{"_id":"LeSa"}],"publication_status":"published","date_updated":"2026-04-02T14:32:34Z","project":[{"call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"acknowledgement":"We thank J. Novacek (CEITEC Brno) and V.-V. Hodirnau (IST Austria) for their help with collecting cryo-EM datasets. We thank the IST Life Science and Electron Microscopy Facilities for providing equipment. This work has been supported by iNEXT,project number 653706, funded by the Horizon 2020 program of the European Union. This article reflects only the authors’view,and the European Commission is not responsible for any use that may be made of the information it contains. CIISB research infrastructure project LM2015043 funded by MEYS CR is gratefully acknowledged for the financial support of the measurements at the CF Cryo-electron Microscopy and Tomography CEITEC MU.This project has received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement no. 665385","volume":370,"citation":{"short":"D. Kampjut, L.A. Sazanov, Science 370 (2020).","ieee":"D. Kampjut and L. A. Sazanov, “The coupling mechanism of mammalian respiratory complex I,” <i>Science</i>, vol. 370, no. 6516. American Association for the Advancement of Science, 2020.","mla":"Kampjut, Domen, and Leonid A. Sazanov. “The Coupling Mechanism of Mammalian Respiratory Complex I.” <i>Science</i>, vol. 370, no. 6516, eabc4209, American Association for the Advancement of Science, 2020, doi:<a href=\"https://doi.org/10.1126/science.abc4209\">10.1126/science.abc4209</a>.","apa":"Kampjut, D., &#38; Sazanov, L. A. (2020). The coupling mechanism of mammalian respiratory complex I. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.abc4209\">https://doi.org/10.1126/science.abc4209</a>","ista":"Kampjut D, Sazanov LA. 2020. The coupling mechanism of mammalian respiratory complex I. Science. 370(6516), eabc4209.","ama":"Kampjut D, Sazanov LA. The coupling mechanism of mammalian respiratory complex I. <i>Science</i>. 2020;370(6516). doi:<a href=\"https://doi.org/10.1126/science.abc4209\">10.1126/science.abc4209</a>","chicago":"Kampjut, Domen, and Leonid A Sazanov. “The Coupling Mechanism of Mammalian Respiratory Complex I.” <i>Science</i>. American Association for the Advancement of Science, 2020. <a href=\"https://doi.org/10.1126/science.abc4209\">https://doi.org/10.1126/science.abc4209</a>."},"external_id":{"isi":["000583031800004"],"pmid":["32972993"]},"ec_funded":1,"issue":"6516"},{"has_accepted_license":"1","type":"journal_article","date_published":"2020-10-05T00:00:00Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_created":"2020-11-08T23:01:25Z","oa_version":"Published Version","language":[{"iso":"eng"}],"intvolume":"         9","quality_controlled":"1","file":[{"success":1,"file_name":"2020_eLife_Gridchyn.pdf","content_type":"application/pdf","relation":"main_file","checksum":"6a7b0543c440f4c000a1864e69377d95","file_id":"8749","date_updated":"2020-11-09T09:17:40Z","access_level":"open_access","creator":"dernst","file_size":447669,"date_created":"2020-11-09T09:17:40Z"}],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","date_updated":"2026-04-07T08:37:11Z","department":[{"_id":"JoCs"}],"publication_status":"published","acknowledgement":"We thank Michele Nardin and Federico Stella for comments on an earlier version of the manuscript. K Deisseroth for providing the pAAV-CaMKIIα::eNpHR3.0-YFP plasmid through Addgene. E Boyden for providing AAV2/1.CaMKII::ArchT.GFP.WPRE.SV40 plasmid through Penn Vector Core. This work was supported by the Austrian Science Fund (I02072 and I03713) and a Swiss National Science Foundation grant to PS. The authors declare no conflicts of interest.","volume":9,"project":[{"_id":"257D4372-B435-11E9-9278-68D0E5697425","grant_number":"I2072-B27","name":"Interneuron plasticity during spatial learning","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"I 3713-B27","name":"Interneuro plasticity during spatial learning","_id":"2654F984-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000584369000001"],"pmid":["33016875"]},"citation":{"ama":"Gridchyn I, Schönenberger P, O’Neill J, Csicsvari JL. Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior. <i>eLife</i>. 2020;9. doi:<a href=\"https://doi.org/10.7554/eLife.61106\">10.7554/eLife.61106</a>","ista":"Gridchyn I, Schönenberger P, O’Neill J, Csicsvari JL. 2020. Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior. eLife. 9, 61106.","apa":"Gridchyn, I., Schönenberger, P., O’Neill, J., &#38; Csicsvari, J. L. (2020). Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.61106\">https://doi.org/10.7554/eLife.61106</a>","mla":"Gridchyn, Igor, et al. “Optogenetic Inhibition-Mediated Activity-Dependent Modification of CA1 Pyramidal-Interneuron Connections during Behavior.” <i>ELife</i>, vol. 9, 61106, eLife Sciences Publications, 2020, doi:<a href=\"https://doi.org/10.7554/eLife.61106\">10.7554/eLife.61106</a>.","ieee":"I. Gridchyn, P. Schönenberger, J. O’Neill, and J. L. Csicsvari, “Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior,” <i>eLife</i>, vol. 9. eLife Sciences Publications, 2020.","short":"I. Gridchyn, P. Schönenberger, J. O’Neill, J.L. Csicsvari, ELife 9 (2020).","chicago":"Gridchyn, Igor, Philipp Schönenberger, Joseph O’Neill, and Jozsef L Csicsvari. “Optogenetic Inhibition-Mediated Activity-Dependent Modification of CA1 Pyramidal-Interneuron Connections during Behavior.” <i>ELife</i>. eLife Sciences Publications, 2020. <a href=\"https://doi.org/10.7554/eLife.61106\">https://doi.org/10.7554/eLife.61106</a>."},"publication":"eLife","year":"2020","status":"public","_id":"8740","month":"10","oa":1,"article_processing_charge":"No","title":"Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior","scopus_import":"1","ddc":["570"],"fulldoi":"https://doi.org/10.7554/eLife.61106","publisher":"eLife Sciences Publications","doi":"10.7554/eLife.61106","file_date_updated":"2020-11-09T09:17:40Z","publication_identifier":{"eissn":["2050-084X"]},"day":"05","abstract":[{"lang":"eng","text":"In vitro work revealed that excitatory synaptic inputs to hippocampal inhibitory interneurons could undergo Hebbian, associative, or non-associative plasticity. Both behavioral and learning-dependent reorganization of these connections has also been demonstrated by measuring spike transmission probabilities in pyramidal cell-interneuron spike cross-correlations that indicate monosynaptic connections. Here we investigated the activity-dependent modification of these connections during exploratory behavior in rats by optogenetically inhibiting pyramidal cell and interneuron subpopulations. Light application and associated firing alteration of pyramidal and interneuron populations led to lasting changes in pyramidal-interneuron connection weights as indicated by spike transmission changes. Spike transmission alterations were predicted by the light-mediated changes in the number of pre- and postsynaptic spike pairing events and by firing rate changes of interneurons but not pyramidal cells. This work demonstrates the presence of activity-dependent associative and non-associative reorganization of pyramidal-interneuron connections triggered by the optogenetic modification of the firing rate and spike synchrony of cells."}],"related_material":{"record":[{"relation":"research_data","id":"8563","status":"public"}]},"pmid":1,"author":[{"last_name":"Gridchyn","full_name":"Gridchyn, Igor","id":"4B60654C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1807-1929","first_name":"Igor"},{"id":"3B9D816C-F248-11E8-B48F-1D18A9856A87","full_name":"Schönenberger, Philipp","first_name":"Philipp","last_name":"Schönenberger"},{"first_name":"Joseph","id":"426376DC-F248-11E8-B48F-1D18A9856A87","full_name":"O'Neill, Joseph","last_name":"O'Neill"},{"last_name":"Csicsvari","full_name":"Csicsvari, Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","orcid":"0000-0002-5193-4036"}],"article_number":"61106","isi":1,"corr_author":"1"},{"citation":{"short":"A.K. Klose, V. Karle, R. Winkelmann, J.F. Donges, Royal Society Open Science 7 (2020).","ieee":"A. K. Klose, V. Karle, R. Winkelmann, and J. F. Donges, “Emergence of cascading dynamics in interacting tipping elements of ecology and climate: Cascading dynamics in tipping elements,” <i>Royal Society Open Science</i>, vol. 7, no. 6. The Royal Society, 2020.","mla":"Klose, Ann Kristin, et al. “Emergence of Cascading Dynamics in Interacting Tipping Elements of Ecology and Climate: Cascading Dynamics in Tipping Elements.” <i>Royal Society Open Science</i>, vol. 7, no. 6, 200599, The Royal Society, 2020, doi:<a href=\"https://doi.org/10.1098/rsos.200599\">10.1098/rsos.200599</a>.","apa":"Klose, A. K., Karle, V., Winkelmann, R., &#38; Donges, J. F. (2020). Emergence of cascading dynamics in interacting tipping elements of ecology and climate: Cascading dynamics in tipping elements. <i>Royal Society Open Science</i>. The Royal Society. <a href=\"https://doi.org/10.1098/rsos.200599\">https://doi.org/10.1098/rsos.200599</a>","ama":"Klose AK, Karle V, Winkelmann R, Donges JF. Emergence of cascading dynamics in interacting tipping elements of ecology and climate: Cascading dynamics in tipping elements. <i>Royal Society Open Science</i>. 2020;7(6). doi:<a href=\"https://doi.org/10.1098/rsos.200599\">10.1098/rsos.200599</a>","ista":"Klose AK, Karle V, Winkelmann R, Donges JF. 2020. Emergence of cascading dynamics in interacting tipping elements of ecology and climate: Cascading dynamics in tipping elements. Royal Society Open Science. 7(6), 200599.","chicago":"Klose, Ann Kristin, Volker Karle, Ricarda Winkelmann, and Jonathan F. Donges. “Emergence of Cascading Dynamics in Interacting Tipping Elements of Ecology and Climate: Cascading Dynamics in Tipping Elements.” <i>Royal Society Open Science</i>. The Royal Society, 2020. <a href=\"https://doi.org/10.1098/rsos.200599\">https://doi.org/10.1098/rsos.200599</a>."},"external_id":{"pmid":["32742700"],"arxiv":["1910.12042"],"isi":["000545625200001"]},"issue":"6","acknowledgement":"V.K. thanks the German National Academic Foundation (Studienstiftung des deutschen Volkes) for financial\r\nsupport. J.F.D. is grateful for financial support by the Stordalen Foundation via the Planetary Boundary Research\r\nNetwork (PB.net), the Earth League’s EarthDoc program and the European Research Council Advanced Grant\r\nproject ERA (Earth Resilience in the Anthropocene). We are thankful for support by the Leibniz Association\r\n(project DominoES).\r\nAcknowledgements. This work has been performed in the context of the copan collaboration and the FutureLab on Earth\r\nResilience in the Anthropocene at the Potsdam Institute for Climate Impact Research. Furthermore, we acknowledge\r\ndiscussions with and helpful comments by N. Wunderling, J. Heitzig and M. Wiedermann.","volume":7,"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file":[{"date_updated":"2020-11-09T09:07:11Z","file_id":"8748","checksum":"5505c445de373bfd836eb4d3b48b1f37","relation":"main_file","content_type":"application/pdf","file_name":"2020_RoyalSocOpenScience_Klose.pdf","success":1,"date_created":"2020-11-09T09:07:11Z","file_size":1611485,"creator":"dernst","access_level":"open_access"}],"article_type":"original","date_updated":"2026-04-03T09:26:55Z","publication_status":"published","department":[{"_id":"MiLe"}],"type":"journal_article","has_accepted_license":"1","date_published":"2020-06-01T00:00:00Z","language":[{"iso":"eng"}],"date_created":"2020-11-08T23:01:25Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa_version":"Published Version","arxiv":1,"quality_controlled":"1","intvolume":"         7","isi":1,"article_number":"200599","abstract":[{"text":"In ecology, climate and other fields, (sub)systems have been identified that can transition into a qualitatively different state when a critical threshold or tipping point in a driving process is crossed. An understanding of those tipping elements is of great interest given the increasing influence of humans on the biophysical Earth system. Complex interactions exist between tipping elements, e.g. physical mechanisms connect subsystems of the climate system. Based on earlier work on such coupled nonlinear systems, we systematically assessed the qualitative long-term behaviour of interacting tipping elements. We developed an understanding of the consequences of interactions\r\non the tipping behaviour allowing for tipping cascades to emerge under certain conditions. The (narrative) application of\r\nthese qualitative results to real-world examples of interacting tipping elements indicates that tipping cascades with profound consequences may occur: the interacting Greenland ice sheet and thermohaline ocean circulation might tip before the tipping points of the isolated subsystems are crossed. The eutrophication of the first lake in a lake chain might propagate through the following lakes without a crossing of their individual critical nutrient input levels. The possibility of emerging cascading tipping dynamics calls for the development of a unified theory of interacting tipping elements and the quantitative analysis of interacting real-world tipping elements.","lang":"eng"}],"pmid":1,"author":[{"last_name":"Klose","first_name":"Ann Kristin","full_name":"Klose, Ann Kristin"},{"last_name":"Karle","full_name":"Karle, Volker","id":"D7C012AE-D7ED-11E9-95E8-1EC5E5697425","orcid":"0000-0002-6963-0129","first_name":"Volker"},{"last_name":"Winkelmann","first_name":"Ricarda","full_name":"Winkelmann, Ricarda"},{"last_name":"Donges","full_name":"Donges, Jonathan F.","first_name":"Jonathan F."}],"ddc":["530","550"],"fulldoi":"https://doi.org/10.1098/rsos.200599","file_date_updated":"2020-11-09T09:07:11Z","doi":"10.1098/rsos.200599","publisher":"The Royal Society","publication_identifier":{"eissn":["2054-5703"]},"day":"01","publication":"Royal Society Open Science","status":"public","_id":"8741","month":"06","year":"2020","article_processing_charge":"No","oa":1,"scopus_import":"1","title":"Emergence of cascading dynamics in interacting tipping elements of ecology and climate: Cascading dynamics in tipping elements"},{"month":"10","_id":"8746","status":"public","year":"2020","publication":"Applied Physics Letters","scopus_import":"1","title":"Electron transport in iodide-capped core@shell PbTe@PbS colloidal nanocrystal solids","article_processing_charge":"No","oa":1,"doi":"10.1063/5.0025965","publisher":"AIP Publishing","fulldoi":"https://doi.org/10.1063/5.0025965","ddc":["530"],"day":"26","publication_identifier":{"eissn":["1077-3118"],"issn":["0003-6951"]},"abstract":[{"lang":"eng","text":"Research in the field of colloidal semiconductor nanocrystals (NCs) has progressed tremendously, mostly because of their exceptional optoelectronic properties. Core@shell NCs, in which one or more inorganic layers overcoat individual NCs, recently received significant attention due to their remarkable optical characteristics. Reduced Auger recombination, suppressed blinking, and enhanced carrier multiplication are among the merits of core@shell NCs. Despite their importance in device development, the influence of the shell and the surface modification of the core@shell NC assemblies on the charge carrier transport remains a pertinent research objective. Type-II PbTe@PbS core@shell NCs, in which exclusive electron transport was demonstrated, still exhibit instability of their electron \r\n ransport. Here, we demonstrate the enhancement of electron transport and stability in PbTe@PbS core@shell NC assemblies using iodide as a surface passivating ligand. The combination of the PbS shelling and the use of the iodide ligand contributes to the addition of one mobile electron for each core@shell NC. Furthermore, both electron mobility and on/off current modulation ratio values of the core@shell NC field-effect transistor are steady with the usage of iodide. Excellent stability in these exclusively electron-transporting core@shell NCs paves the way for their utilization in electronic devices. "}],"author":[{"last_name":"Miranti","first_name":"Retno","full_name":"Miranti, Retno"},{"first_name":"Ricky Dwi","full_name":"Septianto, Ricky Dwi","last_name":"Septianto"},{"orcid":"0000-0001-5013-2843","first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria","last_name":"Ibáñez"},{"last_name":"Kovalenko","first_name":"Maksym V.","full_name":"Kovalenko, Maksym V."},{"last_name":"Matsushita","full_name":"Matsushita, Nobuhiro","first_name":"Nobuhiro"},{"last_name":"Iwasa","first_name":"Yoshihiro","full_name":"Iwasa, Yoshihiro"},{"last_name":"Bisri","first_name":"Satria Zulkarnaen","full_name":"Bisri, Satria Zulkarnaen"}],"isi":1,"article_number":"173101","date_published":"2020-10-26T00:00:00Z","type":"journal_article","intvolume":"       117","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","date_created":"2020-11-09T08:05:43Z","article_type":"original","department":[{"_id":"MaIb"}],"publication_status":"published","date_updated":"2026-06-18T19:36:46Z","acknowledgement":"This work was partly supported by Grants-in-Aid for Scientific Research by Young Scientist A (KAKENHI Wakate-A) No.\r\nJP17H04802, Grants-in-Aid for Scientific Research No. JP19H05602 from the Japan Society for the Promotion of Science, and RIKEN Incentive Research Grant (Shoreikadai) 2016. M.V.K. and M.I. acknowledge financial support from the European Union (EU) via FP7 ERC Starting Grant 2012 (Project NANOSOLID, GA No. 306733) and ETH Zurich via ETH career seed grant (No. SEED-18 16-2). We acknowledge Mrs. T. Kikitsu and Dr. D. Hashizume (RIKEN-CEMS) for access to the transmission electron microscope facility.","volume":117,"main_file_link":[{"url":"https://doi.org/10.1063/5.0025965","open_access":"1"}],"citation":{"chicago":"Miranti, Retno, Ricky Dwi Septianto, Maria Ibáñez, Maksym V. Kovalenko, Nobuhiro Matsushita, Yoshihiro Iwasa, and Satria Zulkarnaen Bisri. “Electron Transport in Iodide-Capped Core@shell PbTe@PbS Colloidal Nanocrystal Solids.” <i>Applied Physics Letters</i>. AIP Publishing, 2020. <a href=\"https://doi.org/10.1063/5.0025965\">https://doi.org/10.1063/5.0025965</a>.","ieee":"R. Miranti <i>et al.</i>, “Electron transport in iodide-capped core@shell PbTe@PbS colloidal nanocrystal solids,” <i>Applied Physics Letters</i>, vol. 117, no. 17. AIP Publishing, 2020.","short":"R. Miranti, R.D. Septianto, M. Ibáñez, M.V. Kovalenko, N. Matsushita, Y. Iwasa, S.Z. Bisri, Applied Physics Letters 117 (2020).","ama":"Miranti R, Septianto RD, Ibáñez M, et al. Electron transport in iodide-capped core@shell PbTe@PbS colloidal nanocrystal solids. <i>Applied Physics Letters</i>. 2020;117(17). doi:<a href=\"https://doi.org/10.1063/5.0025965\">10.1063/5.0025965</a>","ista":"Miranti R, Septianto RD, Ibáñez M, Kovalenko MV, Matsushita N, Iwasa Y, Bisri SZ. 2020. Electron transport in iodide-capped core@shell PbTe@PbS colloidal nanocrystal solids. Applied Physics Letters. 117(17), 173101.","apa":"Miranti, R., Septianto, R. D., Ibáñez, M., Kovalenko, M. V., Matsushita, N., Iwasa, Y., &#38; Bisri, S. Z. (2020). Electron transport in iodide-capped core@shell PbTe@PbS colloidal nanocrystal solids. <i>Applied Physics Letters</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0025965\">https://doi.org/10.1063/5.0025965</a>","mla":"Miranti, Retno, et al. “Electron Transport in Iodide-Capped Core@shell PbTe@PbS Colloidal Nanocrystal Solids.” <i>Applied Physics Letters</i>, vol. 117, no. 17, 173101, AIP Publishing, 2020, doi:<a href=\"https://doi.org/10.1063/5.0025965\">10.1063/5.0025965</a>."},"external_id":{"isi":["000591639700001"]},"issue":"17"},{"volume":8,"acknowledgement":"This work was supported by the European Regional Development Funds and by the Spanish Ministerio de Economı´a y\r\nCompetitividad through the project SEHTOP (ENE2016-77798-C4-3-R). Y. Z. and X. H., thank the China Scholarship Council for scholarship support. M. C. has received funding from the European Union’s Horizon 2020 Research and Innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385. M. I. acknowledges financial support from IST Austria. Y. L. acknowledges funding from the European Union’s Horizon 2020 Research and Innovation Programme under the Marie Sklodowska-Curie grant agreement no. 754411. ICN2 acknowledges funding from Generalitat de Catalunya 2017 SGR 327 and the Spanish MINECO project ENE2017-85087-C3. ICN2 is supported by the Severo Ochoa program from the Spanish MINECO (grant no. SEV-2017-0706) and is funded by the CERCA Programme/Generalitat de Catalunya. Part of the present work has been performed in the framework of Universitat \r\nAuto`noma de Barcelona Materials Science PhD program.","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"issue":"40","ec_funded":1,"external_id":{"isi":["000581559100015"]},"citation":{"chicago":"Zhang, Yu, Yu Liu, Mariano Calcabrini, Congcong Xing, Xu Han, Jordi Arbiol, Doris Cadavid, Maria Ibáñez, and Andreu Cabot. “Bismuth Telluride-Copper Telluride Nanocomposites from Heterostructured Building Blocks.” <i>Journal of Materials Chemistry C</i>. Royal Society of Chemistry, 2020. <a href=\"https://doi.org/10.1039/D0TC02182B\">https://doi.org/10.1039/D0TC02182B</a>.","ieee":"Y. Zhang <i>et al.</i>, “Bismuth telluride-copper telluride nanocomposites from heterostructured building blocks,” <i>Journal of Materials Chemistry C</i>, vol. 8, no. 40. Royal Society of Chemistry, pp. 14092–14099, 2020.","short":"Y. Zhang, Y. Liu, M. Calcabrini, C. Xing, X. Han, J. Arbiol, D. Cadavid, M. Ibáñez, A. Cabot, Journal of Materials Chemistry C 8 (2020) 14092–14099.","ista":"Zhang Y, Liu Y, Calcabrini M, Xing C, Han X, Arbiol J, Cadavid D, Ibáñez M, Cabot A. 2020. Bismuth telluride-copper telluride nanocomposites from heterostructured building blocks. Journal of Materials Chemistry C. 8(40), 14092–14099.","ama":"Zhang Y, Liu Y, Calcabrini M, et al. Bismuth telluride-copper telluride nanocomposites from heterostructured building blocks. <i>Journal of Materials Chemistry C</i>. 2020;8(40):14092-14099. doi:<a href=\"https://doi.org/10.1039/D0TC02182B\">10.1039/D0TC02182B</a>","apa":"Zhang, Y., Liu, Y., Calcabrini, M., Xing, C., Han, X., Arbiol, J., … Cabot, A. (2020). Bismuth telluride-copper telluride nanocomposites from heterostructured building blocks. <i>Journal of Materials Chemistry C</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/D0TC02182B\">https://doi.org/10.1039/D0TC02182B</a>","mla":"Zhang, Yu, et al. “Bismuth Telluride-Copper Telluride Nanocomposites from Heterostructured Building Blocks.” <i>Journal of Materials Chemistry C</i>, vol. 8, no. 40, Royal Society of Chemistry, 2020, pp. 14092–99, doi:<a href=\"https://doi.org/10.1039/D0TC02182B\">10.1039/D0TC02182B</a>."},"page":"14092-14099","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_created":"2020-11-09T08:37:51Z","oa_version":"None","language":[{"iso":"eng"}],"intvolume":"         8","quality_controlled":"1","type":"journal_article","date_published":"2020-10-28T00:00:00Z","date_updated":"2025-04-14T07:43:50Z","publication_status":"published","department":[{"_id":"MaIb"}],"article_type":"original","author":[{"full_name":"Zhang, Yu","first_name":"Yu","last_name":"Zhang"},{"full_name":"Liu, Yu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","first_name":"Yu","orcid":"0000-0001-7313-6740","last_name":"Liu"},{"first_name":"Mariano","full_name":"Calcabrini, Mariano","last_name":"Calcabrini"},{"last_name":"Xing","full_name":"Xing, Congcong","first_name":"Congcong"},{"last_name":"Han","first_name":"Xu","full_name":"Han, Xu"},{"last_name":"Arbiol","first_name":"Jordi","full_name":"Arbiol, Jordi"},{"last_name":"Cadavid","full_name":"Cadavid, Doris","first_name":"Doris"},{"first_name":"Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria","last_name":"Ibáñez"},{"last_name":"Cabot","full_name":"Cabot, Andreu","first_name":"Andreu"}],"abstract":[{"text":"Appropriately designed nanocomposites allow improving the thermoelectric performance by several mechanisms, including phonon scattering, modulation doping and energy filtering, while additionally promoting better mechanical properties than those of crystalline materials. Here, a strategy for producing Bi2Te3–Cu2xTe nanocomposites based on the consolidation of heterostructured nanoparticles is described and the thermoelectric properties of the obtained materials are investigated. We first detail a two-step solution-based process to produce Bi2Te3–Cu2xTe heteronanostructures, based on the growth of Cu2xTe nanocrystals on the surface of Bi2Te3 nanowires. We characterize the structural and chemical properties of the synthesized nanostructures and of the nanocomposites\r\nproduced by hot-pressing the particles at moderate temperatures. Besides, the transport properties of the nanocomposites are investigated as a function of the amount of Cu introduced. Overall, the presence of Cu decreases the material thermal conductivity through promotion of phonon scattering, modulates the charge carrier concentration through electron spillover, and increases the Seebeck coefficient through filtering of charge carriers at energy barriers. These effects result in an improvement of over 50% of the thermoelectric figure of merit of Bi2Te3.","lang":"eng"}],"isi":1,"corr_author":"1","article_processing_charge":"No","title":"Bismuth telluride-copper telluride nanocomposites from heterostructured building blocks","scopus_import":"1","publication":"Journal of Materials Chemistry C","year":"2020","status":"public","_id":"8747","month":"10","day":"28","fulldoi":"https://doi.org/10.1039/D0TC02182B","publisher":"Royal Society of Chemistry","doi":"10.1039/D0TC02182B"},{"date_updated":"2025-04-15T06:26:12Z","publication_status":"published","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"date_created":"2020-11-10T07:04:57Z","oa_version":"Preprint","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","quality_controlled":"1","arxiv":1,"type":"conference","date_published":"2020-12-04T00:00:00Z","ec_funded":1,"citation":{"chicago":"Forets, Marcelo, Daniel Freire, and Christian Schilling. “Efficient Reachability Analysis of Parametric Linear Hybrid Systems with  Time-Triggered Transitions.” In <i>18th ACM-IEEE International Conference on Formal Methods and Models for System Design</i>. IEEE, 2020. <a href=\"https://doi.org/10.1109/MEMOCODE51338.2020.9314994\">https://doi.org/10.1109/MEMOCODE51338.2020.9314994</a>.","short":"M. Forets, D. Freire, C. Schilling, in:, 18th ACM-IEEE International Conference on Formal Methods and Models for System Design, IEEE, 2020.","ieee":"M. Forets, D. Freire, and C. Schilling, “Efficient reachability analysis of parametric linear hybrid systems with  time-triggered transitions,” in <i>18th ACM-IEEE International Conference on Formal Methods and Models for System Design</i>, Virtual Conference, 2020.","apa":"Forets, M., Freire, D., &#38; Schilling, C. (2020). Efficient reachability analysis of parametric linear hybrid systems with  time-triggered transitions. In <i>18th ACM-IEEE International Conference on Formal Methods and Models for System Design</i>. Virtual Conference: IEEE. <a href=\"https://doi.org/10.1109/MEMOCODE51338.2020.9314994\">https://doi.org/10.1109/MEMOCODE51338.2020.9314994</a>","mla":"Forets, Marcelo, et al. “Efficient Reachability Analysis of Parametric Linear Hybrid Systems with  Time-Triggered Transitions.” <i>18th ACM-IEEE International Conference on Formal Methods and Models for System Design</i>, 9314994, IEEE, 2020, doi:<a href=\"https://doi.org/10.1109/MEMOCODE51338.2020.9314994\">10.1109/MEMOCODE51338.2020.9314994</a>.","ama":"Forets M, Freire D, Schilling C. Efficient reachability analysis of parametric linear hybrid systems with  time-triggered transitions. In: <i>18th ACM-IEEE International Conference on Formal Methods and Models for System Design</i>. IEEE; 2020. doi:<a href=\"https://doi.org/10.1109/MEMOCODE51338.2020.9314994\">10.1109/MEMOCODE51338.2020.9314994</a>","ista":"Forets M, Freire D, Schilling C. 2020. Efficient reachability analysis of parametric linear hybrid systems with  time-triggered transitions. 18th ACM-IEEE International Conference on Formal Methods and Models for System Design. MEMOCODE: Conference on Formal Methods and Models for System Design, 9314994."},"external_id":{"isi":["000661920400013"],"arxiv":["2006.12325"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2006.12325"}],"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"},{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"publication_identifier":{"isbn":["9781728191485"]},"day":"04","fulldoi":"https://doi.org/10.1109/MEMOCODE51338.2020.9314994","doi":"10.1109/MEMOCODE51338.2020.9314994","publisher":"IEEE","article_processing_charge":"No","oa":1,"scopus_import":"1","title":"Efficient reachability analysis of parametric linear hybrid systems with  time-triggered transitions","publication":"18th ACM-IEEE International Conference on Formal Methods and Models for System Design","conference":{"start_date":"2020-12-02","name":"MEMOCODE: Conference on Formal Methods and Models for System Design","end_date":"2020-12-04","location":"Virtual Conference"},"month":"12","_id":"8750","status":"public","year":"2020","isi":1,"article_number":"9314994","author":[{"full_name":"Forets, Marcelo","first_name":"Marcelo","last_name":"Forets"},{"first_name":"Daniel","full_name":"Freire, Daniel","last_name":"Freire"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","full_name":"Schilling, Christian","first_name":"Christian","orcid":"0000-0003-3658-1065","last_name":"Schilling"}],"abstract":[{"lang":"eng","text":"Efficiently handling time-triggered and possibly nondeterministic switches\r\nfor hybrid systems reachability is a challenging task. In this paper we present\r\nan approach based on conservative set-based enclosure of the dynamics that can\r\nhandle systems with uncertain parameters and inputs, where the uncertainties\r\nare bound to given intervals. The method is evaluated on the plant model of an\r\nexperimental electro-mechanical braking system with periodic controller. In\r\nthis model, the fast-switching controller dynamics requires simulation time\r\nscales of the order of nanoseconds. Accurate set-based computations for\r\nrelatively large time horizons are known to be expensive. However, by\r\nappropriately decoupling the time variable with respect to the spatial\r\nvariables, and enclosing the uncertain parameters using interval matrix maps\r\nacting on zonotopes, we show that the computation time can be lowered to 5000\r\ntimes faster with respect to previous works. This is a step forward in formal\r\nverification of hybrid systems because reduced run-times allow engineers to\r\nintroduce more expressiveness in their models with a relatively inexpensive\r\ncomputational cost."}]},{"isi":1,"corr_author":"1","abstract":[{"lang":"eng","text":"We consider various modeling levels for spatially homogeneous chemical reaction systems, namely the chemical master equation, the chemical Langevin dynamics, and the reaction-rate equation. Throughout we restrict our study to the case where the microscopic system satisfies the detailed-balance condition. The latter allows us to enrich the systems with a gradient structure, i.e. the evolution is given by a gradient-flow equation. We present the arising links between the associated gradient structures that are driven by the relative entropy of the detailed-balance steady state. The limit of large volumes is studied in the sense of evolutionary Γ-convergence of gradient flows. Moreover, we use the gradient structures to derive hybrid models for coupling different modeling levels."}],"author":[{"first_name":"Jan","orcid":"0000-0002-0845-1338","full_name":"Maas, Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas"},{"first_name":"Alexander","full_name":"Mielke, Alexander","last_name":"Mielke"}],"pmid":1,"doi":"10.1007/s10955-020-02663-4","file_date_updated":"2021-02-04T10:29:11Z","publisher":"Springer Nature","ddc":["510"],"fulldoi":"https://doi.org/10.1007/s10955-020-02663-4","day":"01","publication_identifier":{"issn":["0022-4715"],"eissn":["1572-9613"]},"_id":"8758","month":"12","status":"public","year":"2020","publication":"Journal of Statistical Physics","scopus_import":"1","title":"Modeling of chemical reaction systems with detailed balance using gradient structures","article_processing_charge":"No","oa":1,"citation":{"ama":"Maas J, Mielke A. Modeling of chemical reaction systems with detailed balance using gradient structures. <i>Journal of Statistical Physics</i>. 2020;181(6):2257-2303. doi:<a href=\"https://doi.org/10.1007/s10955-020-02663-4\">10.1007/s10955-020-02663-4</a>","ista":"Maas J, Mielke A. 2020. Modeling of chemical reaction systems with detailed balance using gradient structures. Journal of Statistical Physics. 181(6), 2257–2303.","apa":"Maas, J., &#38; Mielke, A. (2020). Modeling of chemical reaction systems with detailed balance using gradient structures. <i>Journal of Statistical Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10955-020-02663-4\">https://doi.org/10.1007/s10955-020-02663-4</a>","mla":"Maas, Jan, and Alexander Mielke. “Modeling of Chemical Reaction Systems with Detailed Balance Using Gradient Structures.” <i>Journal of Statistical Physics</i>, vol. 181, no. 6, Springer Nature, 2020, pp. 2257–303, doi:<a href=\"https://doi.org/10.1007/s10955-020-02663-4\">10.1007/s10955-020-02663-4</a>.","ieee":"J. Maas and A. Mielke, “Modeling of chemical reaction systems with detailed balance using gradient structures,” <i>Journal of Statistical Physics</i>, vol. 181, no. 6. Springer Nature, pp. 2257–2303, 2020.","short":"J. Maas, A. Mielke, Journal of Statistical Physics 181 (2020) 2257–2303.","chicago":"Maas, Jan, and Alexander Mielke. “Modeling of Chemical Reaction Systems with Detailed Balance Using Gradient Structures.” <i>Journal of Statistical Physics</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s10955-020-02663-4\">https://doi.org/10.1007/s10955-020-02663-4</a>."},"page":"2257-2303","external_id":{"isi":["000587107200002"],"pmid":["33268907"],"arxiv":["2004.02831"]},"ec_funded":1,"issue":"6","project":[{"name":"Optimal Transport and Stochastic Dynamics","grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"name":"Taming Complexity in Partial Differential Systems","grant_number":"F06504","_id":"260482E2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"acknowledgement":"The research of A.M. was partially supported by the Deutsche Forschungsgemeinschaft (DFG) via the Collaborative Research Center SFB 1114 Scaling Cascades in Complex Systems (Project No. 235221301), through the Subproject C05 Effective models for materials and interfaces with multiple scales. J.M. gratefully acknowledges support by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No. 716117), and by the Austrian Science Fund (FWF), Project SFB F65. The authors thank Christof Schütte, Robert I. A. Patterson, and Stefanie Winkelmann for helpful and stimulating discussions. Open access funding provided by Austrian Science Fund (FWF).","volume":181,"article_type":"original","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file":[{"file_name":"2020_JourStatPhysics_Maas.pdf","content_type":"application/pdf","success":1,"date_updated":"2021-02-04T10:29:11Z","checksum":"bc2b63a90197b97cbc73eccada4639f5","relation":"main_file","file_id":"9087","access_level":"open_access","date_created":"2021-02-04T10:29:11Z","creator":"dernst","file_size":753596}],"department":[{"_id":"JaMa"}],"publication_status":"published","date_updated":"2025-06-12T07:01:39Z","date_published":"2020-12-01T00:00:00Z","type":"journal_article","has_accepted_license":"1","quality_controlled":"1","intvolume":"       181","arxiv":1,"language":[{"iso":"eng"}],"date_created":"2020-11-15T23:01:18Z","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"author":[{"last_name":"Guseinov","full_name":"Guseinov, Ruslan","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9819-5077","first_name":"Ruslan"}],"related_material":{"link":[{"url":"https://github.com/russelmann/cold-glass-acm","relation":"software"}],"record":[{"relation":"used_in_publication","id":"8562","status":"public"}]},"contributor":[{"last_name":"Gavriil","first_name":"Konstantinos","contributor_type":"researcher"},{"last_name":"Guseinov","first_name":"Ruslan","orcid":"0000-0001-9819-5077","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","contributor_type":"researcher"},{"last_name":"Perez Rodriguez","first_name":"Jesus","contributor_type":"researcher","id":"2DC83906-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Davide","contributor_type":"researcher","last_name":"Pellis"},{"last_name":"Henderson","first_name":"Paul M","orcid":"0000-0002-5198-7445","id":"13C09E74-18D9-11E9-8878-32CFE5697425","contributor_type":"researcher"},{"last_name":"Rist","contributor_type":"researcher","first_name":"Florian"},{"first_name":"Helmut","contributor_type":"researcher","last_name":"Pottmann"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","contributor_type":"researcher","first_name":"Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel"}],"corr_author":"1","acknowledged_ssus":[{"_id":"ScienComp"}],"title":"Supplementary data for \"Computational design of cold bent glass façades\"","oa":1,"article_processing_charge":"No","year":"2020","status":"public","month":"11","_id":"8761","day":"23","publisher":"Institute of Science and Technology Austria","doi":"10.15479/AT:ISTA:8761","file_date_updated":"2020-11-18T10:04:59Z","ddc":["000"],"fulldoi":"https://doi.org/10.15479/AT:ISTA:8761","project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","call_identifier":"H2020"}],"ec_funded":1,"citation":{"chicago":"Guseinov, Ruslan. “Supplementary Data for ‘Computational Design of Cold Bent Glass Façades.’” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8761\">https://doi.org/10.15479/AT:ISTA:8761</a>.","apa":"Guseinov, R. (2020). Supplementary data for “Computational design of cold bent glass façades.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8761\">https://doi.org/10.15479/AT:ISTA:8761</a>","mla":"Guseinov, Ruslan. <i>Supplementary Data for “Computational Design of Cold Bent Glass Façades.”</i> Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8761\">10.15479/AT:ISTA:8761</a>.","ista":"Guseinov R. 2020. Supplementary data for ‘Computational design of cold bent glass façades’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:8761\">10.15479/AT:ISTA:8761</a>.","ama":"Guseinov R. Supplementary data for “Computational design of cold bent glass façades.” 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8761\">10.15479/AT:ISTA:8761</a>","short":"R. Guseinov, (2020).","ieee":"R. Guseinov, “Supplementary data for ‘Computational design of cold bent glass façades.’” Institute of Science and Technology Austria, 2020."},"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2020-11-16T10:47:18Z","date_published":"2020-11-23T00:00:00Z","has_accepted_license":"1","type":"research_data","department":[{"_id":"BeBi"}],"date_updated":"2025-04-15T07:16:12Z","file":[{"success":1,"content_type":"application/x-gzip","file_name":"mdn_model.tar.gz","file_id":"8762","checksum":"f5ae57b97017b9f61081032703361233","relation":"main_file","date_updated":"2020-11-16T10:31:29Z","access_level":"open_access","file_size":15378270,"creator":"rguseino","date_created":"2020-11-16T10:31:29Z"},{"access_level":"open_access","date_created":"2020-11-16T10:43:23Z","file_size":615387734,"creator":"rguseino","content_type":"application/x-gzip","file_name":"optimal_panels_data.tar.gz","success":1,"date_updated":"2020-11-16T10:43:23Z","file_id":"8763","relation":"main_file","checksum":"b0d25e04060ee78c585ee2f23542c744"},{"success":1,"file_name":"readme.txt","content_type":"text/plain","checksum":"69c1dde3434ada86d125e0c2588caf1e","relation":"main_file","file_id":"8770","date_updated":"2020-11-18T10:04:59Z","access_level":"open_access","creator":"rguseino","file_size":1228,"date_created":"2020-11-18T10:04:59Z"}],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"}},{"external_id":{"isi":["000548709600008"]},"citation":{"mla":"Schreck, Camille, and Chris Wojtan. “A Practical Method for Animating Anisotropic Elastoplastic Materials.” <i>Computer Graphics Forum</i>, vol. 39, no. 2, Wiley, 2020, pp. 89–99, doi:<a href=\"https://doi.org/10.1111/cgf.13914\">10.1111/cgf.13914</a>.","apa":"Schreck, C., &#38; Wojtan, C. (2020). A practical method for animating anisotropic elastoplastic materials. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.13914\">https://doi.org/10.1111/cgf.13914</a>","ama":"Schreck C, Wojtan C. A practical method for animating anisotropic elastoplastic materials. <i>Computer Graphics Forum</i>. 2020;39(2):89-99. doi:<a href=\"https://doi.org/10.1111/cgf.13914\">10.1111/cgf.13914</a>","ista":"Schreck C, Wojtan C. 2020. A practical method for animating anisotropic elastoplastic materials. Computer Graphics Forum. 39(2), 89–99.","short":"C. Schreck, C. Wojtan, Computer Graphics Forum 39 (2020) 89–99.","ieee":"C. Schreck and C. Wojtan, “A practical method for animating anisotropic elastoplastic materials,” <i>Computer Graphics Forum</i>, vol. 39, no. 2. Wiley, pp. 89–99, 2020.","chicago":"Schreck, Camille, and Chris Wojtan. “A Practical Method for Animating Anisotropic Elastoplastic Materials.” <i>Computer Graphics Forum</i>. Wiley, 2020. <a href=\"https://doi.org/10.1111/cgf.13914\">https://doi.org/10.1111/cgf.13914</a>."},"page":"89-99","issue":"2","ec_funded":1,"volume":39,"acknowledgement":"We wish to thank the anonymous reviewers and the members of the Visual Computing Group at IST Austria for their valuable feedback. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing. We would also like to thank Joseph Teran and Chenfanfu Jiang for the helpful discussions.\r\nThis 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.","project":[{"name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"file":[{"date_created":"2020-11-23T09:05:13Z","file_size":38969122,"creator":"dernst","access_level":"open_access","date_updated":"2020-11-23T09:05:13Z","file_id":"8796","relation":"main_file","checksum":"7605f605acd84d0942b48bc7a1c2d72e","content_type":"application/pdf","file_name":"2020_poff_revisited.pdf","success":1}],"article_type":"original","date_updated":"2024-10-22T09:58:14Z","publication_status":"published","department":[{"_id":"ChWo"}],"has_accepted_license":"1","type":"journal_article","date_published":"2020-05-01T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Submitted Version","date_created":"2020-11-17T09:35:10Z","language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"        39","acknowledged_ssus":[{"_id":"ScienComp"}],"keyword":["Computer Networks and Communications"],"isi":1,"abstract":[{"lang":"eng","text":"This paper introduces a simple method for simulating highly anisotropic elastoplastic material behaviors like the dissolution of fibrous phenomena (splintering wood, shredding bales of hay) and materials composed of large numbers of irregularly‐shaped bodies (piles of twigs, pencils, or cards). We introduce a simple transformation of the anisotropic problem into an equivalent isotropic one, and we solve this new “fictitious” isotropic problem using an existing simulator based on the material point method. Our approach results in minimal changes to existing simulators, and it allows us to re‐use popular isotropic plasticity models like the Drucker‐Prager yield criterion instead of inventing new anisotropic plasticity models for every phenomenon we wish to simulate."}],"author":[{"last_name":"Schreck","full_name":"Schreck, Camille","id":"2B14B676-F248-11E8-B48F-1D18A9856A87","first_name":"Camille"},{"last_name":"Wojtan","first_name":"Christopher J","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J"}],"fulldoi":"https://doi.org/10.1111/cgf.13914","ddc":["000"],"publisher":"Wiley","file_date_updated":"2020-11-23T09:05:13Z","doi":"10.1111/cgf.13914","publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"day":"01","publication":"Computer Graphics Forum","year":"2020","status":"public","_id":"8765","month":"05","oa":1,"article_processing_charge":"No","title":"A practical method for animating anisotropic elastoplastic materials","scopus_import":"1"},{"article_type":"original","date_updated":"2024-10-22T09:58:15Z","publication_status":"published","department":[{"_id":"ChWo"},{"_id":"BeBi"}],"type":"journal_article","date_published":"2020-12-01T00:00:00Z","user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","oa_version":"None","date_created":"2020-11-17T10:47:48Z","language":[{"iso":"eng"}],"intvolume":"        39","quality_controlled":"1","external_id":{"isi":["000591780400005"]},"page":"47-54","citation":{"short":"S. Jeschke, C. Hafner, N. Chentanez, M. Macklin, M. Müller-Fischer, C. Wojtan, Computer Graphics Forum 39 (2020) 47–54.","ieee":"S. Jeschke, C. Hafner, N. Chentanez, M. Macklin, M. Müller-Fischer, and C. Wojtan, “Making procedural water waves boundary-aware,” <i>Computer Graphics forum</i>, vol. 39, no. 8. Wiley, pp. 47–54, 2020.","apa":"Jeschke, S., Hafner, C., Chentanez, N., Macklin, M., Müller-Fischer, M., &#38; Wojtan, C. (2020). Making procedural water waves boundary-aware. <i>Computer Graphics Forum</i>. Online Symposium: Wiley. <a href=\"https://doi.org/10.1111/cgf.14100\">https://doi.org/10.1111/cgf.14100</a>","mla":"Jeschke, Stefan, et al. “Making Procedural Water Waves Boundary-Aware.” <i>Computer Graphics Forum</i>, vol. 39, no. 8, Wiley, 2020, pp. 47–54, doi:<a href=\"https://doi.org/10.1111/cgf.14100\">10.1111/cgf.14100</a>.","ista":"Jeschke S, Hafner C, Chentanez N, Macklin M, Müller-Fischer M, Wojtan C. 2020. Making procedural water waves boundary-aware. Computer Graphics forum. 39(8), 47–54.","ama":"Jeschke S, Hafner C, Chentanez N, Macklin M, Müller-Fischer M, Wojtan C. Making procedural water waves boundary-aware. <i>Computer Graphics forum</i>. 2020;39(8):47-54. doi:<a href=\"https://doi.org/10.1111/cgf.14100\">10.1111/cgf.14100</a>","chicago":"Jeschke, Stefan, Christian Hafner, Nuttapong Chentanez, Miles Macklin, Matthias Müller-Fischer, and Chris Wojtan. “Making Procedural Water Waves Boundary-Aware.” <i>Computer Graphics Forum</i>. Wiley, 2020. <a href=\"https://doi.org/10.1111/cgf.14100\">https://doi.org/10.1111/cgf.14100</a>."},"issue":"8","ec_funded":1,"volume":39,"project":[{"call_identifier":"H2020","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767"}],"fulldoi":"https://doi.org/10.1111/cgf.14100","publisher":"Wiley","doi":"10.1111/cgf.14100","day":"01","conference":{"start_date":"2020-10-06","name":"SCA: Symposium on Computer Animation","end_date":"2020-10-09","location":"Online Symposium"},"publication":"Computer Graphics forum","year":"2020","month":"12","_id":"8766","status":"public","article_processing_charge":"No","title":"Making procedural water waves boundary-aware","scopus_import":"1","isi":1,"abstract":[{"lang":"eng","text":"The “procedural” approach to animating ocean waves is the dominant algorithm for animating larger bodies of water in\r\ninteractive applications as well as in off-line productions — it provides high visual quality with a low computational demand. In this paper, we widen the applicability of procedural water wave animation with an extension that guarantees the satisfaction of boundary conditions imposed by terrain while still approximating physical wave behavior. In combination with a particle system that models wave breaking, foam, and spray, this allows us to naturally model waves interacting with beaches and rocks. Our system is able to animate waves at large scales at interactive frame rates on a commodity PC."}],"author":[{"last_name":"Jeschke","first_name":"Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","full_name":"Jeschke, Stefan"},{"full_name":"Hafner, Christian","id":"400429CC-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","last_name":"Hafner"},{"last_name":"Chentanez","full_name":"Chentanez, Nuttapong","first_name":"Nuttapong"},{"last_name":"Macklin","first_name":"Miles","full_name":"Macklin, Miles"},{"full_name":"Müller-Fischer, Matthias","first_name":"Matthias","last_name":"Müller-Fischer"},{"first_name":"Christopher J","orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan"}]},{"acknowledgement":"We thank Igor Erovenko for many helpful comments on an earlier version of this paper. : Army Research Laboratory (grant W911NF-18-2-0265) (M.A.N.); the Bill & Melinda Gates Foundation (grant OPP1148627) (M.A.N.); the NVIDIA Corporation (A.M.). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.","volume":16,"external_id":{"isi":["000591317200004"],"pmid":["33151935"]},"citation":{"chicago":"Kaveh, Kamran, Alex McAvoy, Krishnendu Chatterjee, and Martin A. Nowak. “The Moran Process on 2-Chromatic Graphs.” <i>PLOS Computational Biology</i>. Public Library of Science, 2020. <a href=\"https://doi.org/10.1371/journal.pcbi.1008402\">https://doi.org/10.1371/journal.pcbi.1008402</a>.","ieee":"K. Kaveh, A. McAvoy, K. Chatterjee, and M. A. Nowak, “The Moran process on 2-chromatic graphs,” <i>PLOS Computational Biology</i>, vol. 16, no. 11. Public Library of Science, 2020.","short":"K. Kaveh, A. McAvoy, K. Chatterjee, M.A. Nowak, PLOS Computational Biology 16 (2020).","ama":"Kaveh K, McAvoy A, Chatterjee K, Nowak MA. The Moran process on 2-chromatic graphs. <i>PLOS Computational Biology</i>. 2020;16(11). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1008402\">10.1371/journal.pcbi.1008402</a>","ista":"Kaveh K, McAvoy A, Chatterjee K, Nowak MA. 2020. The Moran process on 2-chromatic graphs. PLOS Computational Biology. 16(11), e1008402.","mla":"Kaveh, Kamran, et al. “The Moran Process on 2-Chromatic Graphs.” <i>PLOS Computational Biology</i>, vol. 16, no. 11, e1008402, Public Library of Science, 2020, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1008402\">10.1371/journal.pcbi.1008402</a>.","apa":"Kaveh, K., McAvoy, A., Chatterjee, K., &#38; Nowak, M. A. (2020). The Moran process on 2-chromatic graphs. <i>PLOS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1008402\">https://doi.org/10.1371/journal.pcbi.1008402</a>"},"issue":"11","date_published":"2020-11-05T00:00:00Z","has_accepted_license":"1","type":"journal_article","quality_controlled":"1","intvolume":"        16","date_created":"2020-11-18T07:20:23Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","language":[{"iso":"eng"}],"article_type":"original","file":[{"file_name":"2020_PlosCompBio_Kaveh.pdf","content_type":"application/pdf","success":1,"date_updated":"2020-11-18T07:26:10Z","checksum":"555456dd0e47bcf9e0994bcb95577e88","relation":"main_file","file_id":"8768","access_level":"open_access","date_created":"2020-11-18T07:26:10Z","creator":"dernst","file_size":2498594}],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"publication_status":"published","department":[{"_id":"KrCh"}],"date_updated":"2025-06-12T07:02:01Z","abstract":[{"text":"Resources are rarely distributed uniformly within a population. Heterogeneity in the concentration of a drug, the quality of breeding sites, or wealth can all affect evolutionary dynamics. In this study, we represent a collection of properties affecting the fitness at a given location using a color. A green node is rich in resources while a red node is poorer. More colors can represent a broader spectrum of resource qualities. For a population evolving according to the birth-death Moran model, the first question we address is which structures, identified by graph connectivity and graph coloring, are evolutionarily equivalent. We prove that all properly two-colored, undirected, regular graphs are evolutionarily equivalent (where “properly colored” means that no two neighbors have the same color). We then compare the effects of background heterogeneity on properly two-colored graphs to those with alternative schemes in which the colors are permuted. Finally, we discuss dynamic coloring as a model for spatiotemporal resource fluctuations, and we illustrate that random dynamic colorings often diminish the effects of background heterogeneity relative to a proper two-coloring.","lang":"eng"}],"author":[{"first_name":"Kamran","full_name":"Kaveh, Kamran","last_name":"Kaveh"},{"full_name":"McAvoy, Alex","first_name":"Alex","last_name":"McAvoy"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Nowak, Martin A.","first_name":"Martin A.","last_name":"Nowak"}],"pmid":1,"article_number":"e1008402","isi":1,"keyword":["Ecology","Modelling and Simulation","Computational Theory and Mathematics","Genetics","Ecology","Evolution","Behavior and Systematics","Molecular Biology","Cellular and Molecular Neuroscience"],"year":"2020","_id":"8767","status":"public","month":"11","publication":"PLOS Computational Biology","title":"The Moran process on 2-chromatic graphs","scopus_import":"1","oa":1,"article_processing_charge":"No","publisher":"Public Library of Science","doi":"10.1371/journal.pcbi.1008402","file_date_updated":"2020-11-18T07:26:10Z","ddc":["000"],"fulldoi":"https://doi.org/10.1371/journal.pcbi.1008402","day":"05","publication_identifier":{"issn":["1553-734X"],"eissn":["1553-7358"]}},{"oa":1,"article_processing_charge":"No","title":"Quantum impurity model for anyons","scopus_import":"1","publication":"Physical Review B","year":"2020","status":"public","_id":"8769","month":"10","publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"day":"01","fulldoi":"https://doi.org/10.1103/physrevb.102.144109","publisher":"American Physical Society","doi":"10.1103/physrevb.102.144109","author":[{"last_name":"Yakaboylu","first_name":"Enderalp","orcid":"0000-0001-5973-0874","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","full_name":"Yakaboylu, Enderalp"},{"first_name":"Areg","orcid":"0000-0001-9666-3543","full_name":"Ghazaryan, Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","last_name":"Ghazaryan"},{"full_name":"Lundholm, D.","first_name":"D.","last_name":"Lundholm"},{"first_name":"N.","full_name":"Rougerie, N.","last_name":"Rougerie"},{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","first_name":"Mikhail","last_name":"Lemeshko"},{"orcid":"0000-0002-6781-0521","first_name":"Robert","full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer"}],"abstract":[{"lang":"eng","text":"One of the hallmarks of quantum statistics, tightly entwined with the concept of topological phases of matter, is the prediction of anyons. Although anyons are predicted to be realized in certain fractional quantum Hall systems, they have not yet been unambiguously detected in experiment. Here we introduce a simple quantum impurity model, where bosonic or fermionic impurities turn into anyons as a consequence of their interaction with the surrounding many-particle bath. A cloud of phonons dresses each impurity in such a way that it effectively attaches fluxes or vortices to it and thereby converts it into an Abelian anyon. The corresponding quantum impurity model, first, provides a different approach to the numerical solution of the many-anyon problem, along with a concrete perspective of anyons as emergent quasiparticles built from composite bosons or fermions. More importantly, the model paves the way toward realizing anyons using impurities in crystal lattices as well as ultracold gases. In particular, we consider two heavy electrons interacting with a two-dimensional lattice crystal in a magnetic field, and show that when the impurity-bath system is rotated at the cyclotron frequency, impurities behave as anyons as a consequence of the angular momentum exchange between the impurities and the bath. A possible experimental realization is proposed by identifying the statistics parameter in terms of the mean-square distance of the impurities and the magnetization of the impurity-bath system, both of which are accessible to experiment. Another proposed application is impurities immersed in a two-dimensional weakly interacting Bose gas."}],"article_number":"144109","isi":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Preprint","date_created":"2020-11-18T07:34:17Z","language":[{"iso":"eng"}],"arxiv":1,"intvolume":"       102","quality_controlled":"1","type":"journal_article","date_published":"2020-10-01T00:00:00Z","date_updated":"2025-04-14T07:26:54Z","department":[{"_id":"MiLe"},{"_id":"RoSe"}],"publication_status":"published","article_type":"original","acknowledgement":"We are grateful to M. Correggi, A. Deuchert, and P. Schmelcher for valuable discussions. We also thank the anonymous referees for helping to clarify a few important points in the experimental realization. A.G. acknowledges support by the European Unions Horizon 2020 research and innovation program under the Marie Skłodowska-Curie grant agreement\r\nNo 754411. D.L. acknowledges financial support from the Goran Gustafsson Foundation (grant no. 1804) and LMU Munich. R.S., M.L., and N.R. gratefully acknowledge financial support by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreements No 694227, No 801770, and No 758620, respectively).","volume":102,"project":[{"call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","name":"Analysis of quantum many-body systems","call_identifier":"H2020"},{"call_identifier":"H2020","_id":"2688CF98-B435-11E9-9278-68D0E5697425","grant_number":"801770","name":"Angulon: physics and applications of a new quasiparticle"}],"issue":"14","ec_funded":1,"external_id":{"isi":["000582563300001"],"arxiv":["1912.07890"]},"citation":{"chicago":"Yakaboylu, Enderalp, Areg Ghazaryan, D. Lundholm, N. Rougerie, Mikhail Lemeshko, and Robert Seiringer. “Quantum Impurity Model for Anyons.” <i>Physical Review B</i>. American Physical Society, 2020. <a href=\"https://doi.org/10.1103/physrevb.102.144109\">https://doi.org/10.1103/physrevb.102.144109</a>.","ieee":"E. Yakaboylu, A. Ghazaryan, D. Lundholm, N. Rougerie, M. Lemeshko, and R. Seiringer, “Quantum impurity model for anyons,” <i>Physical Review B</i>, vol. 102, no. 14. American Physical Society, 2020.","short":"E. Yakaboylu, A. Ghazaryan, D. Lundholm, N. Rougerie, M. Lemeshko, R. Seiringer, Physical Review B 102 (2020).","ama":"Yakaboylu E, Ghazaryan A, Lundholm D, Rougerie N, Lemeshko M, Seiringer R. Quantum impurity model for anyons. <i>Physical Review B</i>. 2020;102(14). doi:<a href=\"https://doi.org/10.1103/physrevb.102.144109\">10.1103/physrevb.102.144109</a>","ista":"Yakaboylu E, Ghazaryan A, Lundholm D, Rougerie N, Lemeshko M, Seiringer R. 2020. Quantum impurity model for anyons. Physical Review B. 102(14), 144109.","apa":"Yakaboylu, E., Ghazaryan, A., Lundholm, D., Rougerie, N., Lemeshko, M., &#38; Seiringer, R. (2020). Quantum impurity model for anyons. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevb.102.144109\">https://doi.org/10.1103/physrevb.102.144109</a>","mla":"Yakaboylu, Enderalp, et al. “Quantum Impurity Model for Anyons.” <i>Physical Review B</i>, vol. 102, no. 14, 144109, American Physical Society, 2020, doi:<a href=\"https://doi.org/10.1103/physrevb.102.144109\">10.1103/physrevb.102.144109</a>."},"main_file_link":[{"url":"https://arxiv.org/abs/1912.07890","open_access":"1"}]}]
