[{"external_id":{"isi":["000744436200004"]},"date_published":"2020-07-06T00:00:00Z","page":"37-49","issue":"7","publisher":"Association for Computing Machinery","isi":1,"scopus_import":"1","publication_identifier":{"isbn":["9781450369350"]},"month":"07","conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures","end_date":"2020-07-17","location":"Virtual Event, United States","start_date":"2020-07-15"},"date_created":"2020-08-02T22:00:58Z","status":"public","citation":{"chicago":"Alistarh, Dan-Adrian, Trevor A Brown, and Nandini Singhal. “Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures.” In <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>, 37–49. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3350755.3400213\">https://doi.org/10.1145/3350755.3400213</a>.","short":"D.-A. Alistarh, T.A. Brown, N. Singhal, in:, Annual ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2020, pp. 37–49.","ista":"Alistarh D-A, Brown TA, Singhal N. 2020. Memory tagging: Minimalist synchronization for scalable concurrent data structures. Annual ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 37–49.","ieee":"D.-A. Alistarh, T. A. Brown, and N. Singhal, “Memory tagging: Minimalist synchronization for scalable concurrent data structures,” in <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>, Virtual Event, United States, 2020, no. 7, pp. 37–49.","ama":"Alistarh D-A, Brown TA, Singhal N. Memory tagging: Minimalist synchronization for scalable concurrent data structures. In: <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>. Association for Computing Machinery; 2020:37-49. doi:<a href=\"https://doi.org/10.1145/3350755.3400213\">10.1145/3350755.3400213</a>","apa":"Alistarh, D.-A., Brown, T. A., &#38; Singhal, N. (2020). Memory tagging: Minimalist synchronization for scalable concurrent data structures. In <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i> (pp. 37–49). Virtual Event, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3350755.3400213\">https://doi.org/10.1145/3350755.3400213</a>","mla":"Alistarh, Dan-Adrian, et al. “Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures.” <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>, no. 7, Association for Computing Machinery, 2020, pp. 37–49, doi:<a href=\"https://doi.org/10.1145/3350755.3400213\">10.1145/3350755.3400213</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Brown","first_name":"Trevor A","full_name":"Brown, Trevor A","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Singhal, Nandini","last_name":"Singhal","first_name":"Nandini"}],"quality_controlled":"1","oa_version":"None","type":"conference","date_updated":"2024-02-28T12:56:32Z","year":"2020","day":"06","title":"Memory tagging: Minimalist synchronization for scalable concurrent data structures","publication":"Annual ACM Symposium on Parallelism in Algorithms and Architectures","_id":"8191","department":[{"_id":"DaAl"}],"doi":"10.1145/3350755.3400213","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"There has been a significant amount of research on hardware and software support for efficient concurrent data structures; yet, the question of how to build correct, simple, and scalable data structures has not yet been definitively settled. In this paper, we revisit this question from a minimalist perspective, and ask: what is the smallest amount of synchronization required for correct and efficient concurrent search data structures, and how could this minimal synchronization support be provided in hardware?\r\n\r\nTo address these questions, we introduce memory tagging, a simple hardware mechanism which enables the programmer to \"tag\" a dynamic set of memory locations, at cache-line granularity, and later validate whether the memory has been concurrently modified, with the possibility of updating one of the underlying locations atomically if validation succeeds. We provide several examples showing that this mechanism can enable fast and arguably simple concurrent data structure designs, such as lists, binary search trees, balanced search trees, range queries, and Software Transactional Memory (STM) implementations. We provide an implementation of memory tags in the Graphite multi-core simulator, showing that the mechanism can be implemented entirely at the level of L1 cache, and that it can enable non-trivial speedups versus existing implementations of the above data structures."}],"publication_status":"published"},{"scopus_import":"1","publication_identifier":{"issn":["23340835"],"eissn":["23340843"]},"date_published":"2020-06-01T00:00:00Z","page":"48-56","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"acknowledgement":"Krishnendu Chatterjee is supported by the Austrian ScienceFund (FWF) NFN Grant No. S11407-N23 (RiSE/SHiNE),and COST Action GAMENET. Petr Novotn ́y is supported bythe Czech Science Foundation grant No. GJ19-15134Y.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","oa_version":"None","date_updated":"2023-09-07T13:16:18Z","type":"conference","day":"01","intvolume":"        30","conference":{"location":"Nancy, France","start_date":"2020-10-26","name":"ICAPS: International Conference on Automated Planning and Scheduling","end_date":"2020-10-30"},"month":"06","date_created":"2020-08-02T22:00:58Z","status":"public","volume":30,"publisher":"Association for the Advancement of Artificial Intelligence","publication":"Proceedings of the 30th International Conference on Automated Planning and Scheduling","title":"Multiple-environment Markov decision processes: Efficient analysis and applications","_id":"8193","related_material":{"record":[{"id":"8390","relation":"dissertation_contains","status":"public"}]},"project":[{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"abstract":[{"lang":"eng","text":"Multiple-environment Markov decision processes (MEMDPs) are MDPs equipped with not one, but multiple probabilistic transition functions, which represent the various possible unknown environments. While the previous research on MEMDPs focused on theoretical properties for long-run average payoff, we study them with discounted-sum payoff and focus on their practical advantages and applications. MEMDPs can be viewed as a special case of Partially observable and Mixed observability MDPs: the state of the system is perfectly observable, but not the environment. We show that the specific structure of MEMDPs allows for more efficient algorithmic analysis, in particular for faster belief updates. We demonstrate the applicability of MEMDPs in several domains. In particular, we formalize the sequential decision-making approach to contextual recommendation systems as MEMDPs and substantially improve over the previous MDP approach."}],"publication_status":"published","citation":{"apa":"Chatterjee, K., Chmelik, M., Karkhanis, D., Novotný, P., &#38; Royer, A. (2020). Multiple-environment Markov decision processes: Efficient analysis and applications. In <i>Proceedings of the 30th International Conference on Automated Planning and Scheduling</i> (Vol. 30, pp. 48–56). Nancy, France: Association for the Advancement of Artificial Intelligence.","mla":"Chatterjee, Krishnendu, et al. “Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications.” <i>Proceedings of the 30th International Conference on Automated Planning and Scheduling</i>, vol. 30, Association for the Advancement of Artificial Intelligence, 2020, pp. 48–56.","ama":"Chatterjee K, Chmelik M, Karkhanis D, Novotný P, Royer A. Multiple-environment Markov decision processes: Efficient analysis and applications. In: <i>Proceedings of the 30th International Conference on Automated Planning and Scheduling</i>. Vol 30. Association for the Advancement of Artificial Intelligence; 2020:48-56.","ieee":"K. Chatterjee, M. Chmelik, D. Karkhanis, P. Novotný, and A. Royer, “Multiple-environment Markov decision processes: Efficient analysis and applications,” in <i>Proceedings of the 30th International Conference on Automated Planning and Scheduling</i>, Nancy, France, 2020, vol. 30, pp. 48–56.","ista":"Chatterjee K, Chmelik M, Karkhanis D, Novotný P, Royer A. 2020. Multiple-environment Markov decision processes: Efficient analysis and applications. Proceedings of the 30th International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 30, 48–56.","short":"K. Chatterjee, M. Chmelik, D. Karkhanis, P. Novotný, A. Royer, in:, Proceedings of the 30th International Conference on Automated Planning and Scheduling, Association for the Advancement of Artificial Intelligence, 2020, pp. 48–56.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, Deep Karkhanis, Petr Novotný, and Amélie Royer. “Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications.” In <i>Proceedings of the 30th International Conference on Automated Planning and Scheduling</i>, 30:48–56. Association for the Advancement of Artificial Intelligence, 2020."},"quality_controlled":"1","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Chmelik"},{"first_name":"Deep","last_name":"Karkhanis","full_name":"Karkhanis, Deep"},{"full_name":"Novotný, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","last_name":"Novotný"},{"id":"3811D890-F248-11E8-B48F-1D18A9856A87","full_name":"Royer, Amélie","orcid":"0000-0002-8407-0705","last_name":"Royer","first_name":"Amélie"}],"year":"2020"},{"department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-51074-9_2","article_processing_charge":"No","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Published Version","date_updated":"2023-08-22T08:27:25Z","type":"conference","day":"24","alternative_title":["LNCS"],"scopus_import":"1","publication_identifier":{"issn":["03029743"],"eissn":["16113349"],"isbn":["9783030510732"]},"external_id":{"isi":["000884318000002"]},"date_published":"2020-06-24T00:00:00Z","page":"13-31","publication":"Automated Reasoning","title":"An SMT theory of fixed-point arithmetic","_id":"8194","oa":1,"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"}],"abstract":[{"lang":"eng","text":"Fixed-point arithmetic is a popular alternative to floating-point arithmetic on embedded systems. Existing work on the verification of fixed-point programs relies on custom formalizations of fixed-point arithmetic, which makes it hard to compare the described techniques or reuse the implementations. In this paper, we address this issue by proposing and formalizing an SMT theory of fixed-point arithmetic. We present an intuitive yet comprehensive syntax of the fixed-point theory, and provide formal semantics for it based on rational arithmetic. We also describe two decision procedures for this theory: one based on the theory of bit-vectors and the other on the theory of reals. We implement the two decision procedures, and evaluate our implementations using existing mature SMT solvers on a benchmark suite we created. Finally, we perform a case study of using the theory we propose to verify properties of quantized neural networks."}],"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/978-3-030-51074-9_2"}],"citation":{"ista":"Baranowski M, He S, Lechner M, Nguyen TS, Rakamarić Z. 2020. An SMT theory of fixed-point arithmetic. Automated Reasoning. IJCAR: International Joint Conference on Automated Reasoning, LNCS, vol. 12166, 13–31.","chicago":"Baranowski, Marek, Shaobo He, Mathias Lechner, Thanh Son Nguyen, and Zvonimir Rakamarić. “An SMT Theory of Fixed-Point Arithmetic.” In <i>Automated Reasoning</i>, 12166:13–31. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">https://doi.org/10.1007/978-3-030-51074-9_2</a>.","short":"M. Baranowski, S. He, M. Lechner, T.S. Nguyen, Z. Rakamarić, in:, Automated Reasoning, Springer Nature, 2020, pp. 13–31.","ama":"Baranowski M, He S, Lechner M, Nguyen TS, Rakamarić Z. An SMT theory of fixed-point arithmetic. In: <i>Automated Reasoning</i>. Vol 12166. Springer Nature; 2020:13-31. doi:<a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">10.1007/978-3-030-51074-9_2</a>","ieee":"M. Baranowski, S. He, M. Lechner, T. S. Nguyen, and Z. Rakamarić, “An SMT theory of fixed-point arithmetic,” in <i>Automated Reasoning</i>, Paris, France, 2020, vol. 12166, pp. 13–31.","mla":"Baranowski, Marek, et al. “An SMT Theory of Fixed-Point Arithmetic.” <i>Automated Reasoning</i>, vol. 12166, Springer Nature, 2020, pp. 13–31, doi:<a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">10.1007/978-3-030-51074-9_2</a>.","apa":"Baranowski, M., He, S., Lechner, M., Nguyen, T. S., &#38; Rakamarić, Z. (2020). An SMT theory of fixed-point arithmetic. In <i>Automated Reasoning</i> (Vol. 12166, pp. 13–31). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">https://doi.org/10.1007/978-3-030-51074-9_2</a>"},"author":[{"full_name":"Baranowski, Marek","first_name":"Marek","last_name":"Baranowski"},{"full_name":"He, Shaobo","first_name":"Shaobo","last_name":"He"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","first_name":"Mathias","last_name":"Lechner"},{"full_name":"Nguyen, Thanh Son","last_name":"Nguyen","first_name":"Thanh Son"},{"full_name":"Rakamarić, Zvonimir","first_name":"Zvonimir","last_name":"Rakamarić"}],"quality_controlled":"1","year":"2020","intvolume":"     12166","isi":1,"conference":{"end_date":"2020-07-04","name":"IJCAR: International Joint Conference on Automated Reasoning","location":"Paris, France","start_date":"2020-07-01"},"month":"06","date_created":"2020-08-02T22:00:59Z","status":"public","volume":12166,"publisher":"Springer Nature"},{"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","date_updated":"2023-09-07T13:18:00Z","type":"conference","day":"14","department":[{"_id":"ToHe"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-53288-8_14","acknowledgement":"Bernhard Kragl and Thomas A. Henzinger were supported by\r\nthe Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","external_id":{"isi":["000695276000014"]},"file":[{"file_size":804237,"content_type":"application/pdf","creator":"dernst","date_created":"2020-08-06T08:14:54Z","relation":"main_file","access_level":"open_access","file_name":"2020_LNCS_Kragl.pdf","file_id":"8201","date_updated":"2020-08-06T08:14:54Z","success":1}],"date_published":"2020-07-14T00:00:00Z","page":"275-298","alternative_title":["LNCS"],"scopus_import":"1","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783030532871"],"eisbn":["9783030532888"],"issn":["0302-9743"]},"citation":{"mla":"Kragl, Bernhard, et al. “Refinement for Structured Concurrent Programs.” <i>Computer Aided Verification</i>, vol. 12224, Springer Nature, 2020, pp. 275–98, doi:<a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">10.1007/978-3-030-53288-8_14</a>.","apa":"Kragl, B., Qadeer, S., &#38; Henzinger, T. A. (2020). Refinement for structured concurrent programs. In <i>Computer Aided Verification</i> (Vol. 12224, pp. 275–298). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">https://doi.org/10.1007/978-3-030-53288-8_14</a>","ista":"Kragl B, Qadeer S, Henzinger TA. 2020. Refinement for structured concurrent programs. Computer Aided Verification. , LNCS, vol. 12224, 275–298.","chicago":"Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Refinement for Structured Concurrent Programs.” In <i>Computer Aided Verification</i>, 12224:275–98. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">https://doi.org/10.1007/978-3-030-53288-8_14</a>.","short":"B. Kragl, S. Qadeer, T.A. Henzinger, in:, Computer Aided Verification, Springer Nature, 2020, pp. 275–298.","ieee":"B. Kragl, S. Qadeer, and T. A. Henzinger, “Refinement for structured concurrent programs,” in <i>Computer Aided Verification</i>, 2020, vol. 12224, pp. 275–298.","ama":"Kragl B, Qadeer S, Henzinger TA. Refinement for structured concurrent programs. In: <i>Computer Aided Verification</i>. Vol 12224. Springer Nature; 2020:275-298. doi:<a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">10.1007/978-3-030-53288-8_14</a>"},"quality_controlled":"1","author":[{"last_name":"Kragl","first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117"},{"last_name":"Qadeer","first_name":"Shaz","full_name":"Qadeer, Shaz"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2020","title":"Refinement for structured concurrent programs","publication":"Computer Aided Verification","_id":"8195","related_material":{"record":[{"id":"8332","relation":"dissertation_contains","status":"public"}]},"oa":1,"ddc":["000"],"project":[{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"abstract":[{"lang":"eng","text":"This paper presents a foundation for refining concurrent programs with structured control flow. The verification problem is decomposed into subproblems that aid interactive program development, proof reuse, and automation. The formalization in this paper is the basis of a new design and implementation of the Civl verifier."}],"publication_status":"published","volume":12224,"file_date_updated":"2020-08-06T08:14:54Z","publisher":"Springer Nature","intvolume":"     12224","isi":1,"month":"07","date_created":"2020-08-03T11:45:35Z","status":"public"},{"article_type":"original","publisher":"Mathematical Sciences Publishers","volume":2,"issue":"1","status":"public","date_created":"2024-01-28T23:01:44Z","month":"01","intvolume":"         2","year":"2020","quality_controlled":"1","author":[{"full_name":"Lewin, Mathieu","last_name":"Lewin","first_name":"Mathieu"},{"full_name":"Lieb, Elliott H.","last_name":"Lieb","first_name":"Elliott H."},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1903.04046","open_access":"1"}],"citation":{"chicago":"Lewin, Mathieu, Elliott H. Lieb, and Robert Seiringer. “ The Local Density Approximation in Density Functional Theory.” <i>Pure and Applied Analysis</i>. Mathematical Sciences Publishers, 2020. <a href=\"https://doi.org/10.2140/paa.2020.2.35\">https://doi.org/10.2140/paa.2020.2.35</a>.","short":"M. Lewin, E.H. Lieb, R. Seiringer, Pure and Applied Analysis 2 (2020) 35–73.","ista":"Lewin M, Lieb EH, Seiringer R. 2020.  The local density approximation in density functional theory. Pure and Applied Analysis. 2(1), 35–73.","ama":"Lewin M, Lieb EH, Seiringer R.  The local density approximation in density functional theory. <i>Pure and Applied Analysis</i>. 2020;2(1):35-73. doi:<a href=\"https://doi.org/10.2140/paa.2020.2.35\">10.2140/paa.2020.2.35</a>","ieee":"M. Lewin, E. H. Lieb, and R. Seiringer, “ The local density approximation in density functional theory,” <i>Pure and Applied Analysis</i>, vol. 2, no. 1. Mathematical Sciences Publishers, pp. 35–73, 2020.","apa":"Lewin, M., Lieb, E. H., &#38; Seiringer, R. (2020).  The local density approximation in density functional theory. <i>Pure and Applied Analysis</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/paa.2020.2.35\">https://doi.org/10.2140/paa.2020.2.35</a>","mla":"Lewin, Mathieu, et al. “ The Local Density Approximation in Density Functional Theory.” <i>Pure and Applied Analysis</i>, vol. 2, no. 1, Mathematical Sciences Publishers, 2020, pp. 35–73, doi:<a href=\"https://doi.org/10.2140/paa.2020.2.35\">10.2140/paa.2020.2.35</a>."},"publication_status":"published","abstract":[{"lang":"eng","text":"We give the first mathematically rigorous justification of the local density approximation in density functional theory. We provide a quantitative estimate on the difference between the grand-canonical Levy–Lieb energy of a given density (the lowest possible energy of all quantum states having this density) and the integral over the uniform electron gas energy of this density. The error involves gradient terms and justifies the use of the local density approximation in the situation where the density is very flat on sufficiently large regions in space."}],"oa":1,"_id":"14891","publication":"Pure and Applied Analysis","title":" The local density approximation in density functional theory","page":"35-73","date_published":"2020-01-01T00:00:00Z","external_id":{"arxiv":["1903.04046"]},"arxiv":1,"publication_identifier":{"eissn":["2578-5885"],"issn":["2578-5893"]},"scopus_import":"1","day":"01","type":"journal_article","date_updated":"2024-01-29T09:01:12Z","oa_version":"Preprint","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"doi":"10.2140/paa.2020.2.35","department":[{"_id":"RoSe"}]},{"day":"02","oa_version":"Published Version","type":"journal_article","date_updated":"2024-02-28T12:37:54Z","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MaLo"}],"doi":"10.1016/j.jmb.2020.09.001","language":[{"iso":"eng"}],"page":"5784-5801","external_id":{"pmid":["32910969"]},"keyword":["Molecular Biology","Structural Biology"],"date_published":"2020-10-02T00:00:00Z","publication_identifier":{"issn":["0022-2836"]},"year":"2020","author":[{"first_name":"Higor Vinícius Dias","last_name":"Rosa","full_name":"Rosa, Higor Vinícius Dias"},{"last_name":"Leonardo","first_name":"Diego Antonio","full_name":"Leonardo, Diego Antonio"},{"last_name":"Brognara","first_name":"Gabriel","id":"D96FFDA0-A884-11E9-9968-DC26E6697425","full_name":"Brognara, Gabriel"},{"first_name":"José","last_name":"Brandão-Neto","full_name":"Brandão-Neto, José"},{"last_name":"D'Muniz Pereira","first_name":"Humberto","full_name":"D'Muniz Pereira, Humberto"},{"first_name":"Ana Paula Ulian","last_name":"Araújo","full_name":"Araújo, Ana Paula Ulian"},{"full_name":"Garratt, Richard Charles","first_name":"Richard Charles","last_name":"Garratt"}],"quality_controlled":"1","citation":{"mla":"Rosa, Higor Vinícius Dias, et al. “Molecular Recognition at Septin Interfaces: The Switches Hold the Key.” <i>Journal of Molecular Biology</i>, vol. 432, no. 21, Elsevier, 2020, pp. 5784–801, doi:<a href=\"https://doi.org/10.1016/j.jmb.2020.09.001\">10.1016/j.jmb.2020.09.001</a>.","apa":"Rosa, H. V. D., Leonardo, D. A., Brognara, G., Brandão-Neto, J., D’Muniz Pereira, H., Araújo, A. P. U., &#38; Garratt, R. C. (2020). Molecular recognition at septin interfaces: The switches hold the key. <i>Journal of Molecular Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jmb.2020.09.001\">https://doi.org/10.1016/j.jmb.2020.09.001</a>","ama":"Rosa HVD, Leonardo DA, Brognara G, et al. Molecular recognition at septin interfaces: The switches hold the key. <i>Journal of Molecular Biology</i>. 2020;432(21):5784-5801. doi:<a href=\"https://doi.org/10.1016/j.jmb.2020.09.001\">10.1016/j.jmb.2020.09.001</a>","ieee":"H. V. D. Rosa <i>et al.</i>, “Molecular recognition at septin interfaces: The switches hold the key,” <i>Journal of Molecular Biology</i>, vol. 432, no. 21. Elsevier, pp. 5784–5801, 2020.","chicago":"Rosa, Higor Vinícius Dias, Diego Antonio Leonardo, Gabriel Brognara, José Brandão-Neto, Humberto D’Muniz Pereira, Ana Paula Ulian Araújo, and Richard Charles Garratt. “Molecular Recognition at Septin Interfaces: The Switches Hold the Key.” <i>Journal of Molecular Biology</i>. Elsevier, 2020. <a href=\"https://doi.org/10.1016/j.jmb.2020.09.001\">https://doi.org/10.1016/j.jmb.2020.09.001</a>.","short":"H.V.D. Rosa, D.A. Leonardo, G. Brognara, J. Brandão-Neto, H. D’Muniz Pereira, A.P.U. Araújo, R.C. Garratt, Journal of Molecular Biology 432 (2020) 5784–5801.","ista":"Rosa HVD, Leonardo DA, Brognara G, Brandão-Neto J, D’Muniz Pereira H, Araújo APU, Garratt RC. 2020. Molecular recognition at septin interfaces: The switches hold the key. Journal of Molecular Biology. 432(21), 5784–5801."},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.jmb.2020.09.001"}],"abstract":[{"lang":"eng","text":"The assembly of a septin filament requires that homologous monomers must distinguish between one another in establishing appropriate interfaces with their neighbors. To understand this phenomenon at the molecular level, we present the first four crystal structures of heterodimeric septin complexes. We describe in detail the two distinct types of G-interface present within the octameric particles, which must polymerize to form filaments. These are formed between SEPT2 and SEPT6 and between SEPT7 and SEPT3, and their description permits an understanding of the structural basis for the selectivity necessary for correct filament assembly. By replacing SEPT6 by SEPT8 or SEPT11, it is possible to rationalize Kinoshita's postulate, which predicts the exchangeability of septins from within a subgroup. Switches I and II, which in classical small GTPases provide a mechanism for nucleotide-dependent conformational change, have been repurposed in septins to play a fundamental role in molecular recognition. Specifically, it is switch I which holds the key to discriminating between the two different G-interfaces. Moreover, residues which are characteristic for a given subgroup play subtle, but pivotal, roles in guaranteeing that the correct interfaces are formed."}],"publication_status":"published","_id":"15036","oa":1,"pmid":1,"title":"Molecular recognition at septin interfaces: The switches hold the key","publication":"Journal of Molecular Biology","article_type":"original","publisher":"Elsevier","volume":432,"issue":"21","status":"public","month":"10","date_created":"2024-02-28T08:50:34Z","intvolume":"       432"},{"issue":"5","volume":13,"file_date_updated":"2024-02-28T12:39:56Z","article_type":"original","publisher":"Elsevier","intvolume":"        13","month":"05","date_created":"2024-02-28T08:55:56Z","status":"public","citation":{"ieee":"J. Moulinier-Anzola <i>et al.</i>, “TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants,” <i>Molecular Plant</i>, vol. 13, no. 5. Elsevier, pp. 717–731, 2020.","ama":"Moulinier-Anzola J, Schwihla M, De-Araújo L, et al. TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants. <i>Molecular Plant</i>. 2020;13(5):717-731. doi:<a href=\"https://doi.org/10.1016/j.molp.2020.02.012\">10.1016/j.molp.2020.02.012</a>","chicago":"Moulinier-Anzola, Jeanette, Maximilian Schwihla, Lucinda De-Araújo, Christina Artner, Lisa Jörg, Nataliia Konstantinova, Christian Luschnig, and Barbara Korbei. “TOLs Function as Ubiquitin Receptors in the Early Steps of the ESCRT Pathway in Higher Plants.” <i>Molecular Plant</i>. Elsevier, 2020. <a href=\"https://doi.org/10.1016/j.molp.2020.02.012\">https://doi.org/10.1016/j.molp.2020.02.012</a>.","short":"J. Moulinier-Anzola, M. Schwihla, L. De-Araújo, C. Artner, L. Jörg, N. Konstantinova, C. Luschnig, B. Korbei, Molecular Plant 13 (2020) 717–731.","ista":"Moulinier-Anzola J, Schwihla M, De-Araújo L, Artner C, Jörg L, Konstantinova N, Luschnig C, Korbei B. 2020. TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants. Molecular Plant. 13(5), 717–731.","apa":"Moulinier-Anzola, J., Schwihla, M., De-Araújo, L., Artner, C., Jörg, L., Konstantinova, N., … Korbei, B. (2020). TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants. <i>Molecular Plant</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.molp.2020.02.012\">https://doi.org/10.1016/j.molp.2020.02.012</a>","mla":"Moulinier-Anzola, Jeanette, et al. “TOLs Function as Ubiquitin Receptors in the Early Steps of the ESCRT Pathway in Higher Plants.” <i>Molecular Plant</i>, vol. 13, no. 5, Elsevier, 2020, pp. 717–31, doi:<a href=\"https://doi.org/10.1016/j.molp.2020.02.012\">10.1016/j.molp.2020.02.012</a>."},"author":[{"full_name":"Moulinier-Anzola, Jeanette","first_name":"Jeanette","last_name":"Moulinier-Anzola"},{"full_name":"Schwihla, Maximilian","last_name":"Schwihla","first_name":"Maximilian"},{"full_name":"De-Araújo, Lucinda","first_name":"Lucinda","last_name":"De-Araújo"},{"full_name":"Artner, Christina","id":"45DF286A-F248-11E8-B48F-1D18A9856A87","last_name":"Artner","first_name":"Christina"},{"full_name":"Jörg, Lisa","last_name":"Jörg","first_name":"Lisa"},{"first_name":"Nataliia","last_name":"Konstantinova","full_name":"Konstantinova, Nataliia"},{"full_name":"Luschnig, Christian","first_name":"Christian","last_name":"Luschnig"},{"full_name":"Korbei, Barbara","first_name":"Barbara","last_name":"Korbei"}],"quality_controlled":"1","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2020","pmid":1,"title":"TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants","publication":"Molecular Plant","_id":"15037","oa":1,"ddc":["580"],"abstract":[{"lang":"eng","text":"Protein abundance and localization at the plasma membrane (PM) shapes plant development and mediates adaptation to changing environmental conditions. It is regulated by ubiquitination, a post-translational modification crucial for the proper sorting of endocytosed PM proteins to the vacuole for subsequent degradation. To understand the significance and the variety of roles played by this reversible modification, the function of ubiquitin receptors, which translate the ubiquitin signature into a cellular response, needs to be elucidated. In this study, we show that TOL (TOM1-like) proteins function in plants as multivalent ubiquitin receptors, governing ubiquitinated cargo delivery to the vacuole via the conserved Endosomal Sorting Complex Required for Transport (ESCRT) pathway. TOL2 and TOL6 interact with components of the ESCRT machinery and bind to K63-linked ubiquitin via two tandemly arranged conserved ubiquitin-binding domains. Mutation of these domains results not only in a loss of ubiquitin binding but also altered localization, abolishing TOL6 ubiquitin receptor activity. Function and localization of TOL6 is itself regulated by ubiquitination, whereby TOL6 ubiquitination potentially modulates degradation of PM-localized cargoes, assisting in the fine-tuning of the delicate interplay between protein recycling and downregulation. Taken together, our findings demonstrate the function and regulation of a ubiquitin receptor that mediates vacuolar degradation of PM proteins in higher plants."}],"publication_status":"published","external_id":{"pmid":["32087370"]},"keyword":["Plant Science","Molecular Biology"],"file":[{"success":1,"date_updated":"2024-02-28T12:39:56Z","file_id":"15038","file_name":"2020_MolecularPlant_MoulinierAnzola.pdf","checksum":"c538a5008f7827f62d17d40a3bfabe65","access_level":"open_access","relation":"main_file","date_created":"2024-02-28T12:39:56Z","file_size":3089212,"creator":"dernst","content_type":"application/pdf"}],"date_published":"2020-05-04T00:00:00Z","page":"717-731","publication_identifier":{"issn":["1674-2052"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","type":"journal_article","date_updated":"2024-02-28T12:41:52Z","day":"04","department":[{"_id":"EvBe"}],"has_accepted_license":"1","doi":"10.1016/j.molp.2020.02.012","language":[{"iso":"eng"}]},{"intvolume":"        34","status":"public","date_created":"2024-03-04T08:07:22Z","month":"04","conference":{"end_date":"2020-02-12","name":"AAAI: Conference on Artificial Intelligence","location":"New York, NY, United States","start_date":"2020-02-07"},"issue":"06","volume":34,"publisher":"Association for the Advancement of Artificial Intelligence","article_type":"original","oa":1,"_id":"15055","publication":"Proceedings of the 34th AAAI Conference on Artificial Intelligence","title":"Reinforcement learning of risk-constrained policies in Markov decision processes","publication_status":"published","abstract":[{"text":"<jats:p>Markov decision processes (MDPs) are the defacto framework for sequential decision making in the presence of stochastic uncertainty. A classical optimization criterion for MDPs is to maximize the expected discounted-sum payoff, which ignores low probability catastrophic events with highly negative impact on the system. On the other hand, risk-averse policies require the probability of undesirable events to be below a given threshold, but they do not account for optimization of the expected payoff. We consider MDPs with discounted-sum payoff with failure states which represent catastrophic outcomes. The objective of risk-constrained planning is to maximize the expected discounted-sum payoff among risk-averse policies that ensure the probability to encounter a failure state is below a desired threshold. Our main contribution is an efficient risk-constrained planning algorithm that combines UCT-like search with a predictor learned through interaction with the MDP (in the style of AlphaZero) and with a risk-constrained action selection via linear programming. We demonstrate the effectiveness of our approach with experiments on classical MDPs from the literature, including benchmarks with an order of 106 states.</jats:p>","lang":"eng"}],"project":[{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"}],"author":[{"full_name":"Brázdil, Tomáš","last_name":"Brázdil","first_name":"Tomáš"},{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Novotný, Petr","last_name":"Novotný","first_name":"Petr"},{"full_name":"Vahala, Jiří","last_name":"Vahala","first_name":"Jiří"}],"quality_controlled":"1","citation":{"ieee":"T. Brázdil, K. Chatterjee, P. Novotný, and J. Vahala, “Reinforcement learning of risk-constrained policies in Markov decision processes,” <i>Proceedings of the 34th AAAI Conference on Artificial Intelligence</i>, vol. 34, no. 06. Association for the Advancement of Artificial Intelligence, pp. 9794–9801, 2020.","ama":"Brázdil T, Chatterjee K, Novotný P, Vahala J. Reinforcement learning of risk-constrained policies in Markov decision processes. <i>Proceedings of the 34th AAAI Conference on Artificial Intelligence</i>. 2020;34(06):9794-9801. doi:<a href=\"https://doi.org/10.1609/aaai.v34i06.6531\">10.1609/aaai.v34i06.6531</a>","short":"T. Brázdil, K. Chatterjee, P. Novotný, J. Vahala, Proceedings of the 34th AAAI Conference on Artificial Intelligence 34 (2020) 9794–9801.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Petr Novotný, and Jiří Vahala. “Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes.” <i>Proceedings of the 34th AAAI Conference on Artificial Intelligence</i>. Association for the Advancement of Artificial Intelligence, 2020. <a href=\"https://doi.org/10.1609/aaai.v34i06.6531\">https://doi.org/10.1609/aaai.v34i06.6531</a>.","ista":"Brázdil T, Chatterjee K, Novotný P, Vahala J. 2020. Reinforcement learning of risk-constrained policies in Markov decision processes. Proceedings of the 34th AAAI Conference on Artificial Intelligence. 34(06), 9794–9801.","mla":"Brázdil, Tomáš, et al. “Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes.” <i>Proceedings of the 34th AAAI Conference on Artificial Intelligence</i>, vol. 34, no. 06, Association for the Advancement of Artificial Intelligence, 2020, pp. 9794–801, doi:<a href=\"https://doi.org/10.1609/aaai.v34i06.6531\">10.1609/aaai.v34i06.6531</a>.","apa":"Brázdil, T., Chatterjee, K., Novotný, P., &#38; Vahala, J. (2020). Reinforcement learning of risk-constrained policies in Markov decision processes. <i>Proceedings of the 34th AAAI Conference on Artificial Intelligence</i>. New York, NY, United States: Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v34i06.6531\">https://doi.org/10.1609/aaai.v34i06.6531</a>"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2002.12086"}],"year":"2020","publication_identifier":{"issn":["2374-3468"]},"arxiv":1,"page":"9794-9801","date_published":"2020-04-03T00:00:00Z","keyword":["General Medicine"],"external_id":{"arxiv":["2002.12086"]},"doi":"10.1609/aaai.v34i06.6531","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"acknowledgement":"Krishnendu Chatterjee is supported by the Austrian Science Fund (FWF) NFN Grant No. S11407-N23 (RiSE/SHiNE), and COST Action GAMENET. Tomas Brazdil is supported by the Grant Agency of Masaryk University grant no. MUNI/G/0739/2017 and by the Czech Science Foundation grant No. 18-11193S. Petr Novotny and Jirı Vahala are supported by the Czech Science Foundation grant No. GJ19-15134Y.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","day":"03","date_updated":"2024-03-04T08:30:16Z","type":"journal_article","oa_version":"Preprint"},{"publication":"Science Advances","title":"VRK-1 extends life span by activation of AMPK via phosphorylation","ddc":["570"],"oa":1,"_id":"15057","publication_status":"published","abstract":[{"lang":"eng","text":"Vaccinia virus–related kinase (VRK) is an evolutionarily conserved nuclear protein kinase. VRK-1, the single Caenorhabditis elegans VRK ortholog, functions in cell division and germline proliferation. However, the role of VRK-1 in postmitotic cells and adult life span remains unknown. Here, we show that VRK-1 increases organismal longevity by activating the cellular energy sensor, AMP-activated protein kinase (AMPK), via direct phosphorylation. We found that overexpression of vrk-1 in the soma of adult C. elegans increased life span and, conversely, inhibition of vrk-1 decreased life span. In addition, vrk-1 was required for longevity conferred by mutations that inhibit C. elegans mitochondrial respiration, which requires AMPK. VRK-1 directly phosphorylated and up-regulated AMPK in both C. elegans and cultured human cells. Thus, our data show that the somatic nuclear kinase, VRK-1, promotes longevity through AMPK activation, and this function appears to be conserved between C. elegans and humans."}],"citation":{"mla":"Park, Sangsoon, et al. “VRK-1 Extends Life Span by Activation of AMPK via Phosphorylation.” <i>Science Advances</i>, vol. 6, no. 27, aaw7824, American Association for the Advancement of Science, 2020, doi:<a href=\"https://doi.org/10.1126/sciadv.aaw7824\">10.1126/sciadv.aaw7824</a>.","apa":"Park, S., Artan, M., Han, S. H., Park, H.-E. H., Jung, Y., Hwang, A. B., … Lee, S.-J. V. (2020). VRK-1 extends life span by activation of AMPK via phosphorylation. <i>Science Advances</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/sciadv.aaw7824\">https://doi.org/10.1126/sciadv.aaw7824</a>","short":"S. Park, M. Artan, S.H. Han, H.-E.H. Park, Y. Jung, A.B. Hwang, W.S. Shin, K.-T. Kim, S.-J.V. Lee, Science Advances 6 (2020).","chicago":"Park, Sangsoon, Murat Artan, Seung Hyun Han, Hae-Eun H. Park, Yoonji Jung, Ara B. Hwang, Won Sik Shin, Kyong-Tai Kim, and Seung-Jae V. Lee. “VRK-1 Extends Life Span by Activation of AMPK via Phosphorylation.” <i>Science Advances</i>. American Association for the Advancement of Science, 2020. <a href=\"https://doi.org/10.1126/sciadv.aaw7824\">https://doi.org/10.1126/sciadv.aaw7824</a>.","ista":"Park S, Artan M, Han SH, Park H-EH, Jung Y, Hwang AB, Shin WS, Kim K-T, Lee S-JV. 2020. VRK-1 extends life span by activation of AMPK via phosphorylation. Science Advances. 6(27), aaw7824.","ama":"Park S, Artan M, Han SH, et al. VRK-1 extends life span by activation of AMPK via phosphorylation. <i>Science Advances</i>. 2020;6(27). doi:<a href=\"https://doi.org/10.1126/sciadv.aaw7824\">10.1126/sciadv.aaw7824</a>","ieee":"S. Park <i>et al.</i>, “VRK-1 extends life span by activation of AMPK via phosphorylation,” <i>Science Advances</i>, vol. 6, no. 27. American Association for the Advancement of Science, 2020."},"author":[{"full_name":"Park, Sangsoon","last_name":"Park","first_name":"Sangsoon"},{"id":"C407B586-6052-11E9-B3AE-7006E6697425","orcid":"0000-0001-8945-6992","full_name":"Artan, Murat","first_name":"Murat","last_name":"Artan"},{"full_name":"Han, Seung Hyun","last_name":"Han","first_name":"Seung Hyun"},{"last_name":"Park","first_name":"Hae-Eun H.","full_name":"Park, Hae-Eun H."},{"full_name":"Jung, Yoonji","first_name":"Yoonji","last_name":"Jung"},{"last_name":"Hwang","first_name":"Ara B.","full_name":"Hwang, Ara B."},{"full_name":"Shin, Won Sik","first_name":"Won Sik","last_name":"Shin"},{"full_name":"Kim, Kyong-Tai","last_name":"Kim","first_name":"Kyong-Tai"},{"full_name":"Lee, Seung-Jae V.","last_name":"Lee","first_name":"Seung-Jae V."}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"year":"2020","intvolume":"         6","date_created":"2024-03-04T09:41:57Z","month":"07","article_number":"aaw7824","status":"public","volume":6,"issue":"27","file_date_updated":"2024-03-04T09:46:41Z","publisher":"American Association for the Advancement of Science","article_type":"original","language":[{"iso":"eng"}],"doi":"10.1126/sciadv.aaw7824","has_accepted_license":"1","department":[{"_id":"MaDe"}],"acknowledgement":"This research was supported by grants NRF-2019R1A3B2067745 and NRF-2017R1A5A1015366 funded by the Korean Government (MSIT) through the National Research Foundation (NRF) of Korea to S.-J.V.L. and by grant Basic Science Research Program (No. 2019R1A2C2009440) funded by the Korean Government (MSIT) through the NRF of Korea to K.-T.K. ","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","date_updated":"2024-03-04T09:52:09Z","type":"journal_article","oa_version":"Published Version","day":"01","publication_identifier":{"eissn":["2375-2548"]},"date_published":"2020-07-01T00:00:00Z","file":[{"file_size":1864415,"content_type":"application/pdf","creator":"dernst","date_created":"2024-03-04T09:46:41Z","relation":"main_file","access_level":"open_access","file_name":"2020_ScienceAdvances_Park.pdf","checksum":"a37157cd0de709dce5fe03f4a31cd0b6","file_id":"15058","date_updated":"2024-03-04T09:46:41Z","success":1}]},{"day":"08","year":"2020","date_updated":"2024-03-04T10:02:49Z","type":"conference","oa_version":"None","article_processing_charge":"No","author":[{"first_name":"Michal","last_name":"Wasiak","full_name":"Wasiak, Michal"},{"first_name":"Gabriel Santamaria","last_name":"Botello","full_name":"Botello, Gabriel Santamaria"},{"first_name":"Kerlos Atia","last_name":"Abdalmalak","full_name":"Abdalmalak, Kerlos Atia"},{"first_name":"Florian","last_name":"Sedlmeir","full_name":"Sedlmeir, Florian"},{"first_name":"Alfredo R","last_name":"Rueda Sanchez","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6249-5860","full_name":"Rueda Sanchez, Alfredo R"},{"first_name":"Daniel","last_name":"Segovia-Vargas","full_name":"Segovia-Vargas, Daniel"},{"full_name":"Schwefel, Harald G. L.","first_name":"Harald G. L.","last_name":"Schwefel"},{"first_name":"Luis Enrique Garcia","last_name":"Munoz","full_name":"Munoz, Luis Enrique Garcia"}],"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Wasiak, M., Botello, G. S., Abdalmalak, K. A., Sedlmeir, F., Rueda Sanchez, A. R., Segovia-Vargas, D., … Munoz, L. E. G. (2020). Compact millimeter and submillimeter-wave photonic radiometer for cubesats. In <i>14th European Conference on Antennas and Propagation</i>. Copenhagen, Denmark: IEEE. <a href=\"https://doi.org/10.23919/eucap48036.2020.9135962\">https://doi.org/10.23919/eucap48036.2020.9135962</a>","mla":"Wasiak, Michal, et al. “Compact Millimeter and Submillimeter-Wave Photonic Radiometer for Cubesats.” <i>14th European Conference on Antennas and Propagation</i>, IEEE, 2020, doi:<a href=\"https://doi.org/10.23919/eucap48036.2020.9135962\">10.23919/eucap48036.2020.9135962</a>.","ieee":"M. Wasiak <i>et al.</i>, “Compact millimeter and submillimeter-wave photonic radiometer for cubesats,” in <i>14th European Conference on Antennas and Propagation</i>, Copenhagen, Denmark, 2020.","ama":"Wasiak M, Botello GS, Abdalmalak KA, et al. Compact millimeter and submillimeter-wave photonic radiometer for cubesats. In: <i>14th European Conference on Antennas and Propagation</i>. IEEE; 2020. doi:<a href=\"https://doi.org/10.23919/eucap48036.2020.9135962\">10.23919/eucap48036.2020.9135962</a>","ista":"Wasiak M, Botello GS, Abdalmalak KA, Sedlmeir F, Rueda Sanchez AR, Segovia-Vargas D, Schwefel HGL, Munoz LEG. 2020. Compact millimeter and submillimeter-wave photonic radiometer for cubesats. 14th European Conference on Antennas and Propagation. EuCAP: European Conference on Antennas and Propagation.","chicago":"Wasiak, Michal, Gabriel Santamaria Botello, Kerlos Atia Abdalmalak, Florian Sedlmeir, Alfredo R Rueda Sanchez, Daniel Segovia-Vargas, Harald G. L. Schwefel, and Luis Enrique Garcia Munoz. “Compact Millimeter and Submillimeter-Wave Photonic Radiometer for Cubesats.” In <i>14th European Conference on Antennas and Propagation</i>. IEEE, 2020. <a href=\"https://doi.org/10.23919/eucap48036.2020.9135962\">https://doi.org/10.23919/eucap48036.2020.9135962</a>.","short":"M. Wasiak, G.S. Botello, K.A. Abdalmalak, F. Sedlmeir, A.R. Rueda Sanchez, D. Segovia-Vargas, H.G.L. Schwefel, L.E.G. Munoz, in:, 14th European Conference on Antennas and Propagation, IEEE, 2020."},"publication_status":"published","abstract":[{"lang":"eng","text":"In this paper we present a room temperature radiometer that can eliminate the need of using cryostats in satellite payload reducing its weight and improving reliability. The proposed radiometer is based on an electro-optic upconverter that boosts up microwave photons energy by upconverting them into an optical domain what makes them immune to thermal noise even if operating at room temperature. The converter uses a high-quality factor whispering gallery\r\nmode (WGM) resonator providing naturally narrow bandwidth and therefore might be useful for applications like microwave hyperspectral sensing. The upconversion process is explained by\r\nproviding essential information about photon conversion efficiency and sensitivity. To prove the concept, we describe an experiment which shows state-of-the-art photon conversion efficiency n=10-5 per mW of pump power at the frequency of 80 GHz."}],"acknowledgement":"This work has been financially supported by Comunidad de Madrid S2018/NMT-4333 ARTINLARA-CM projects, and “FUNDACIÓN SENER” REFTA projects.","language":[{"iso":"eng"}],"doi":"10.23919/eucap48036.2020.9135962","department":[{"_id":"JoFi"}],"_id":"15059","title":"Compact millimeter and submillimeter-wave photonic radiometer for cubesats","publication":"14th European Conference on Antennas and Propagation","publisher":"IEEE","date_published":"2020-07-08T00:00:00Z","status":"public","date_created":"2024-03-04T09:57:48Z","conference":{"end_date":"2020-03-20","name":"EuCAP: European Conference on Antennas and Propagation","location":"Copenhagen, Denmark","start_date":"2020-03-15"},"month":"07","publication_identifier":{"eisbn":["9788831299008"]}},{"publication_status":"published","abstract":[{"text":"The actin cytoskeleton, a dynamic network of actin filaments and associated F-actin–binding proteins, is fundamentally important in eukaryotes. α-Actinins are major F-actin bundlers that are inhibited by Ca2+ in nonmuscle cells. Here we report the mechanism of Ca2+-mediated regulation of Entamoeba histolytica α-actinin-2 (EhActn2) with features expected for the common ancestor of Entamoeba and higher eukaryotic α-actinins. Crystal structures of Ca2+-free and Ca2+-bound EhActn2 reveal a calmodulin-like domain (CaMD) uniquely inserted within the rod domain. Integrative studies reveal an exceptionally high affinity of the EhActn2 CaMD for Ca2+, binding of which can only be regulated in the presence of physiological concentrations of Mg2+. Ca2+ binding triggers an increase in protein multidomain rigidity, reducing conformational flexibility of F-actin–binding domains via interdomain cross-talk and consequently inhibiting F-actin bundling. In vivo studies uncover that EhActn2 plays an important role in phagocytic cup formation and might constitute a new drug target for amoebic dysentery.","lang":"eng"}],"publication":"Proceedings of the National Academy of Sciences","title":"Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin","pmid":1,"oa":1,"_id":"15061","year":"2020","citation":{"mla":"Pinotsis, Nikos, et al. “Calcium Modulates the Domain Flexibility and Function of an α-Actinin Similar to the Ancestral α-Actinin.” <i>Proceedings of the National Academy of Sciences</i>, vol. 117, no. 36, Proceedings of the National Academy of Sciences, 2020, pp. 22101–12, doi:<a href=\"https://doi.org/10.1073/pnas.1917269117\">10.1073/pnas.1917269117</a>.","apa":"Pinotsis, N., Zielinska, K., Babuta, M., Arolas, J. L., Kostan, J., Khan, M. B., … Djinovic-Carugo, K. (2020). Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin. <i>Proceedings of the National Academy of Sciences</i>. Proceedings of the National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1917269117\">https://doi.org/10.1073/pnas.1917269117</a>","chicago":"Pinotsis, Nikos, Karolina Zielinska, Mrigya Babuta, Joan L. Arolas, Julius Kostan, Muhammad Bashir Khan, Claudia Schreiner, et al. “Calcium Modulates the Domain Flexibility and Function of an α-Actinin Similar to the Ancestral α-Actinin.” <i>Proceedings of the National Academy of Sciences</i>. Proceedings of the National Academy of Sciences, 2020. <a href=\"https://doi.org/10.1073/pnas.1917269117\">https://doi.org/10.1073/pnas.1917269117</a>.","short":"N. Pinotsis, K. Zielinska, M. Babuta, J.L. Arolas, J. Kostan, M.B. Khan, C. Schreiner, A.P. Testa Salmazo, L. Ciccarelli, M. Puchinger, E.A. Gkougkoulia, E. de A. Ribeiro, T.C. Marlovits, A. Bhattacharya, K. Djinovic-Carugo, Proceedings of the National Academy of Sciences 117 (2020) 22101–22112.","ista":"Pinotsis N, Zielinska K, Babuta M, Arolas JL, Kostan J, Khan MB, Schreiner C, Testa Salmazo AP, Ciccarelli L, Puchinger M, Gkougkoulia EA, Ribeiro E de A, Marlovits TC, Bhattacharya A, Djinovic-Carugo K. 2020. Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin. Proceedings of the National Academy of Sciences. 117(36), 22101–22112.","ieee":"N. Pinotsis <i>et al.</i>, “Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin,” <i>Proceedings of the National Academy of Sciences</i>, vol. 117, no. 36. Proceedings of the National Academy of Sciences, pp. 22101–22112, 2020.","ama":"Pinotsis N, Zielinska K, Babuta M, et al. Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin. <i>Proceedings of the National Academy of Sciences</i>. 2020;117(36):22101-22112. doi:<a href=\"https://doi.org/10.1073/pnas.1917269117\">10.1073/pnas.1917269117</a>"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1073/pnas.191726911"}],"quality_controlled":"1","author":[{"full_name":"Pinotsis, Nikos","first_name":"Nikos","last_name":"Pinotsis"},{"first_name":"Karolina","last_name":"Zielinska","full_name":"Zielinska, Karolina"},{"full_name":"Babuta, Mrigya","first_name":"Mrigya","last_name":"Babuta"},{"full_name":"Arolas, Joan L.","first_name":"Joan L.","last_name":"Arolas"},{"first_name":"Julius","last_name":"Kostan","full_name":"Kostan, Julius"},{"full_name":"Khan, Muhammad Bashir","last_name":"Khan","first_name":"Muhammad Bashir"},{"first_name":"Claudia","last_name":"Schreiner","full_name":"Schreiner, Claudia"},{"first_name":"Anita P","last_name":"Testa Salmazo","id":"41F1F098-F248-11E8-B48F-1D18A9856A87","full_name":"Testa Salmazo, Anita P"},{"last_name":"Ciccarelli","first_name":"Luciano","full_name":"Ciccarelli, Luciano"},{"first_name":"Martin","last_name":"Puchinger","full_name":"Puchinger, Martin"},{"full_name":"Gkougkoulia, Eirini A.","last_name":"Gkougkoulia","first_name":"Eirini A."},{"full_name":"Ribeiro, Euripedes de Almeida","first_name":"Euripedes de Almeida","last_name":"Ribeiro"},{"full_name":"Marlovits, Thomas C.","first_name":"Thomas C.","last_name":"Marlovits"},{"full_name":"Bhattacharya, Alok","first_name":"Alok","last_name":"Bhattacharya"},{"first_name":"Kristina","last_name":"Djinovic-Carugo","full_name":"Djinovic-Carugo, Kristina"}],"date_created":"2024-03-04T10:03:52Z","month":"09","status":"public","intvolume":"       117","publisher":"Proceedings of the National Academy of Sciences","article_type":"original","volume":117,"issue":"36","acknowledgement":"We thank the staff of the macromolecular crystallography (MX) and SAXS beamlines at the European Synchrotron Radiation facility, Diamond, and Swiss Light Source for excellent support, and the Life Sciences Facility of the Institute of Science and Technology Austria for usage of the rheometer. We thank Life Sciences editors for editing assistance. EM data were\r\nrecorded at the EM Facility of the Vienna BioCenter Core Facilities (Austria). Confocal microscopy was carried out at the Advanced Instrument Research Facility, Jawaharlal Nehru University. K.D.-C.’s research was supported by the Initial Training Network MUZIC (ITN-MUZIC) (N°238423), Austrian Science Fund (FWF) Projects I525, I1593, P22276, P19060, and W1221, Laura Bassi Centre of Optimized Structural Studies (N°253275), a Wellcome Trust Collaborative Award (201543/Z/16/Z), COST Action BM1405, Vienna Science and Technology Fund (WWTF) Chemical Biology Project LS17-008, and Christian Doppler Laboratory for High-Content Structural Biology and Biotechnology. K.Z., J.L.A., C.S., E.A.G., and A.S. were supported by the University of Vienna, J.K. by a Wellcome Trust Collaborative Award and by the Centre of Optimized Structural Studies, M.P. by FWF Project I1593, E.d.A.R. ITN-MUZIC, and FWF Projects I525 and I1593, and T.C.M. and L.C. by FWF Project I 2408-B22. E.A.G. acknowledges the PhD program Structure and Interaction of Biological Macromolecules. M.B. acknowledges the University Grant Commission, India, for a senior research fellowship. A.B. acknowledges a JC Bose Fellowship from the Science Engineering Research Council. ","acknowledged_ssus":[{"_id":"LifeSc"}],"language":[{"iso":"eng"}],"doi":"10.1073/pnas.1917269117","department":[{"_id":"CaBe"}],"type":"journal_article","date_updated":"2024-03-04T10:14:44Z","oa_version":"Published Version","day":"08","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"date_published":"2020-09-08T00:00:00Z","external_id":{"pmid":["32848067"]},"page":"22101-22112"},{"day":"16","date_updated":"2024-03-04T10:33:15Z","type":"journal_article","oa_version":"Preprint","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"Partially supported by ERC Advanced Grant No. 338804. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant Agreement No. 66538","language":[{"iso":"eng"}],"doi":"10.2140/pmp.2020.1.101","department":[{"_id":"LaEr"}],"ec_funded":1,"page":"101-146","date_published":"2020-11-16T00:00:00Z","keyword":["General Medicine"],"external_id":{"arxiv":["1908.01653"]},"arxiv":1,"publication_identifier":{"issn":["2690-1005","2690-0998"]},"scopus_import":"1","year":"2020","quality_controlled":"1","author":[{"orcid":"0000-0002-4901-7992","full_name":"Cipolloni, Giorgio","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","last_name":"Cipolloni","first_name":"Giorgio"},{"first_name":"László","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László","orcid":"0000-0001-5366-9603"},{"last_name":"Schröder","first_name":"Dominik J","full_name":"Schröder, Dominik J","orcid":"0000-0002-2904-1856","id":"408ED176-F248-11E8-B48F-1D18A9856A87"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1908.01653"}],"citation":{"ama":"Cipolloni G, Erdös L, Schröder DJ. Optimal lower bound on the least singular value of the shifted Ginibre ensemble. <i>Probability and Mathematical Physics</i>. 2020;1(1):101-146. doi:<a href=\"https://doi.org/10.2140/pmp.2020.1.101\">10.2140/pmp.2020.1.101</a>","ieee":"G. Cipolloni, L. Erdös, and D. J. Schröder, “Optimal lower bound on the least singular value of the shifted Ginibre ensemble,” <i>Probability and Mathematical Physics</i>, vol. 1, no. 1. Mathematical Sciences Publishers, pp. 101–146, 2020.","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Probability and Mathematical Physics 1 (2020) 101–146.","chicago":"Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Optimal Lower Bound on the Least Singular Value of the Shifted Ginibre Ensemble.” <i>Probability and Mathematical Physics</i>. Mathematical Sciences Publishers, 2020. <a href=\"https://doi.org/10.2140/pmp.2020.1.101\">https://doi.org/10.2140/pmp.2020.1.101</a>.","ista":"Cipolloni G, Erdös L, Schröder DJ. 2020. Optimal lower bound on the least singular value of the shifted Ginibre ensemble. Probability and Mathematical Physics. 1(1), 101–146.","apa":"Cipolloni, G., Erdös, L., &#38; Schröder, D. J. (2020). Optimal lower bound on the least singular value of the shifted Ginibre ensemble. <i>Probability and Mathematical Physics</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/pmp.2020.1.101\">https://doi.org/10.2140/pmp.2020.1.101</a>","mla":"Cipolloni, Giorgio, et al. “Optimal Lower Bound on the Least Singular Value of the Shifted Ginibre Ensemble.” <i>Probability and Mathematical Physics</i>, vol. 1, no. 1, Mathematical Sciences Publishers, 2020, pp. 101–46, doi:<a href=\"https://doi.org/10.2140/pmp.2020.1.101\">10.2140/pmp.2020.1.101</a>."},"publication_status":"published","abstract":[{"lang":"eng","text":"We consider the least singular value of a large random matrix with real or complex i.i.d. Gaussian entries shifted by a constant z∈C. We prove an optimal lower tail estimate on this singular value in the critical regime where z is around the spectral edge, thus improving the classical bound of Sankar, Spielman and Teng (SIAM J. Matrix Anal. Appl. 28:2 (2006), 446–476) for the particular shift-perturbation in the edge regime. Lacking Brézin–Hikami formulas in the real case, we rely on the superbosonization formula (Comm. Math. Phys. 283:2 (2008), 343–395)."}],"project":[{"grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program"}],"oa":1,"_id":"15063","publication":"Probability and Mathematical Physics","title":"Optimal lower bound on the least singular value of the shifted Ginibre ensemble","publisher":"Mathematical Sciences Publishers","article_type":"original","volume":1,"issue":"1","status":"public","date_created":"2024-03-04T10:27:57Z","month":"11","intvolume":"         1"},{"quality_controlled":"1","author":[{"first_name":"U.","last_name":"Bauer","full_name":"Bauer, U."},{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert"},{"full_name":"Jablonski, Grzegorz","orcid":"0000-0002-3536-9866","id":"4483EF78-F248-11E8-B48F-1D18A9856A87","first_name":"Grzegorz","last_name":"Jablonski"},{"full_name":"Mrozek, M.","first_name":"M.","last_name":"Mrozek"}],"citation":{"apa":"Bauer, U., Edelsbrunner, H., Jablonski, G., &#38; Mrozek, M. (2020). Čech-Delaunay gradient flow and homology inference for self-maps. <i>Journal of Applied and Computational Topology</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s41468-020-00058-8\">https://doi.org/10.1007/s41468-020-00058-8</a>","mla":"Bauer, U., et al. “Čech-Delaunay Gradient Flow and Homology Inference for Self-Maps.” <i>Journal of Applied and Computational Topology</i>, vol. 4, no. 4, Springer Nature, 2020, pp. 455–80, doi:<a href=\"https://doi.org/10.1007/s41468-020-00058-8\">10.1007/s41468-020-00058-8</a>.","ieee":"U. Bauer, H. Edelsbrunner, G. Jablonski, and M. Mrozek, “Čech-Delaunay gradient flow and homology inference for self-maps,” <i>Journal of Applied and Computational Topology</i>, vol. 4, no. 4. Springer Nature, pp. 455–480, 2020.","ama":"Bauer U, Edelsbrunner H, Jablonski G, Mrozek M. Čech-Delaunay gradient flow and homology inference for self-maps. <i>Journal of Applied and Computational Topology</i>. 2020;4(4):455-480. doi:<a href=\"https://doi.org/10.1007/s41468-020-00058-8\">10.1007/s41468-020-00058-8</a>","chicago":"Bauer, U., Herbert Edelsbrunner, Grzegorz Jablonski, and M. Mrozek. “Čech-Delaunay Gradient Flow and Homology Inference for Self-Maps.” <i>Journal of Applied and Computational Topology</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s41468-020-00058-8\">https://doi.org/10.1007/s41468-020-00058-8</a>.","short":"U. Bauer, H. Edelsbrunner, G. Jablonski, M. Mrozek, Journal of Applied and Computational Topology 4 (2020) 455–480.","ista":"Bauer U, Edelsbrunner H, Jablonski G, Mrozek M. 2020. Čech-Delaunay gradient flow and homology inference for self-maps. Journal of Applied and Computational Topology. 4(4), 455–480."},"year":"2020","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["500"],"oa":1,"_id":"15064","title":"Čech-Delaunay gradient flow and homology inference for self-maps","publication":"Journal of Applied and Computational Topology","publication_status":"published","abstract":[{"text":"We call a continuous self-map that reveals itself through a discrete set of point-value pairs a sampled dynamical system. Capturing the available information with chain maps on Delaunay complexes, we use persistent homology to quantify the evidence of recurrent behavior. We establish a sampling theorem to recover the eigenspaces of the endomorphism on homology induced by the self-map. Using a combinatorial gradient flow arising from the discrete Morse theory for Čech and Delaunay complexes, we construct a chain map to transform the problem from the natural but expensive Čech complexes to the computationally efficient Delaunay triangulations. The fast chain map algorithm has applications beyond dynamical systems.","lang":"eng"}],"issue":"4","volume":4,"article_type":"original","publisher":"Springer Nature","file_date_updated":"2024-03-04T10:52:42Z","intvolume":"         4","status":"public","date_created":"2024-03-04T10:47:49Z","month":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"Yes (via OA deal)","day":"01","type":"journal_article","date_updated":"2024-03-04T10:54:04Z","oa_version":"Published Version","language":[{"iso":"eng"}],"doi":"10.1007/s41468-020-00058-8","department":[{"_id":"HeEd"}],"has_accepted_license":"1","acknowledgement":"This research has been supported by the DFG Collaborative Research Center SFB/TRR 109 “Discretization in Geometry and Dynamics”, by Polish MNiSzW Grant No. 2621/7.PR/12/2013/2, by the Polish National Science Center under Maestro Grant No. 2014/14/A/ST1/00453 and Grant No. DEC-2013/09/N/ST6/02995. Open Access funding provided by Projekt DEAL.","page":"455-480","date_published":"2020-12-01T00:00:00Z","file":[{"creator":"dernst","content_type":"application/pdf","file_size":851190,"relation":"main_file","date_created":"2024-03-04T10:52:42Z","checksum":"eed1168b6e66cd55272c19bb7fca8a1c","file_name":"2020_JourApplCompTopology_Bauer.pdf","access_level":"open_access","success":1,"date_updated":"2024-03-04T10:52:42Z","file_id":"15065"}],"publication_identifier":{"issn":["2367-1726"],"eissn":["2367-1734"]},"scopus_import":"1"},{"file_date_updated":"2024-03-05T07:08:27Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","volume":179,"date_created":"2024-03-05T07:09:12Z","month":"10","conference":{"end_date":"2020-10-16","name":"DISC: Symposium on Distributed Computing","location":"Virtual","start_date":"2020-10-12"},"article_number":"40","status":"public","intvolume":"       179","tmp":{"short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png"},"year":"2020","citation":{"apa":"Brandt, S., Keller, B., Rybicki, J., Suomela, J., &#38; Uitto, J. (2020). Brief announcement: Efficient load-balancing through distributed token dropping. In <i>34th International Symposium on Distributed Computing</i> (Vol. 179). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.40\">https://doi.org/10.4230/LIPIcs.DISC.2020.40</a>","mla":"Brandt, Sebastian, et al. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.” <i>34th International Symposium on Distributed Computing</i>, vol. 179, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.40\">10.4230/LIPIcs.DISC.2020.40</a>.","ista":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. 2020. Brief announcement: Efficient load-balancing through distributed token dropping. 34th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 179, 40.","short":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, 34th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","chicago":"Brandt, Sebastian, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.” In <i>34th International Symposium on Distributed Computing</i>, Vol. 179. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.40\">https://doi.org/10.4230/LIPIcs.DISC.2020.40</a>.","ama":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. Brief announcement: Efficient load-balancing through distributed token dropping. In: <i>34th International Symposium on Distributed Computing</i>. Vol 179. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.40\">10.4230/LIPIcs.DISC.2020.40</a>","ieee":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Brief announcement: Efficient load-balancing through distributed token dropping,” in <i>34th International Symposium on Distributed Computing</i>, Virtual, 2020, vol. 179."},"author":[{"full_name":"Brandt, Sebastian","last_name":"Brandt","first_name":"Sebastian"},{"last_name":"Keller","first_name":"Barbara","full_name":"Keller, Barbara"},{"last_name":"Rybicki","first_name":"Joel","full_name":"Rybicki, Joel","orcid":"0000-0002-6432-6646","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Suomela, Jukka","first_name":"Jukka","last_name":"Suomela"},{"full_name":"Uitto, Jara","last_name":"Uitto","first_name":"Jara"}],"quality_controlled":"1","publication_status":"published","abstract":[{"text":"We introduce a new graph problem, the token dropping game, and we show how to solve it efficiently in a distributed setting. We use the token dropping game as a tool to design an efficient distributed algorithm for the stable orientation problem, which is a special case of the more general locally optimal semi-matching problem. The prior work by Czygrinow et al. (DISC 2012) finds a locally optimal semi-matching in O(Δ⁵) rounds in graphs of maximum degree Δ, which directly implies an algorithm with the same runtime for stable orientations. We improve the runtime to O(Δ⁴) for stable orientations and prove a lower bound of Ω(Δ) rounds.","lang":"eng"}],"title":"Brief announcement: Efficient load-balancing through distributed token dropping","publication":"34th International Symposium on Distributed Computing","oa":1,"related_material":{"record":[{"relation":"later_version","status":"public","id":"9678"}]},"ddc":["000"],"_id":"15074","date_published":"2020-10-07T00:00:00Z","file":[{"access_level":"open_access","checksum":"23e2d9321aef53092dc1e24a8ab82d72","file_name":"2020_LIPIcs_Brandt.pdf","date_updated":"2024-03-05T07:08:27Z","file_id":"15075","success":1,"file_size":303529,"creator":"dernst","content_type":"application/pdf","date_created":"2024-03-05T07:08:27Z","relation":"main_file"}],"external_id":{"arxiv":["2005.07761"]},"arxiv":1,"alternative_title":["LIPIcs"],"scopus_import":"1","date_updated":"2024-03-05T07:13:13Z","type":"conference","oa_version":"Published Version","day":"07","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.DISC.2020.40","department":[{"_id":"DaAl"}],"has_accepted_license":"1"},{"volume":168,"file_date_updated":"2024-03-05T07:25:15Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","intvolume":"       168","date_created":"2024-03-05T07:25:37Z","conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","end_date":"2020-07-11","start_date":"2020-07-08","location":"Saarbrücken, Germany, Virtual"},"month":"06","article_number":"7","status":"public","citation":{"mla":"Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.” <i>47th International Colloquium on Automata, Languages, and Programming</i>, vol. 168, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2020.7\">10.4230/LIPIcs.ICALP.2020.7</a>.","apa":"Alistarh, D.-A., Nadiradze, G., &#38; Sabour, A. (2020). Dynamic averaging load balancing on cycles. In <i>47th International Colloquium on Automata, Languages, and Programming</i> (Vol. 168). Saarbrücken, Germany, Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2020.7\">https://doi.org/10.4230/LIPIcs.ICALP.2020.7</a>","ista":"Alistarh D-A, Nadiradze G, Sabour A. 2020. Dynamic averaging load balancing on cycles. 47th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 168, 7.","chicago":"Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic Averaging Load Balancing on Cycles.” In <i>47th International Colloquium on Automata, Languages, and Programming</i>, Vol. 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2020.7\">https://doi.org/10.4230/LIPIcs.ICALP.2020.7</a>.","short":"D.-A. Alistarh, G. Nadiradze, A. Sabour, in:, 47th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ama":"Alistarh D-A, Nadiradze G, Sabour A. Dynamic averaging load balancing on cycles. In: <i>47th International Colloquium on Automata, Languages, and Programming</i>. Vol 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2020.7\">10.4230/LIPIcs.ICALP.2020.7</a>","ieee":"D.-A. Alistarh, G. Nadiradze, and A. Sabour, “Dynamic averaging load balancing on cycles,” in <i>47th International Colloquium on Automata, Languages, and Programming</i>, Saarbrücken, Germany, Virtual, 2020, vol. 168."},"author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian"},{"full_name":"Nadiradze, Giorgi","orcid":"0000-0001-5634-0731","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","first_name":"Giorgi","last_name":"Nadiradze"},{"id":"bcc145fd-e77f-11ea-ae8b-80d661dbff67","full_name":"Sabour, Amirmojtaba","last_name":"Sabour","first_name":"Amirmojtaba"}],"quality_controlled":"1","tmp":{"short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png"},"year":"2020","publication":"47th International Colloquium on Automata, Languages, and Programming","title":"Dynamic averaging load balancing on cycles","related_material":{"record":[{"relation":"later_version","status":"public","id":"8286"}]},"ddc":["000"],"oa":1,"_id":"15077","project":[{"call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning"}],"publication_status":"published","abstract":[{"lang":"eng","text":"We consider the following dynamic load-balancing process: given an underlying graph G with n nodes, in each step t≥ 0, one unit of load is created, and placed at a randomly chosen graph node. In the same step, the chosen node picks a random neighbor, and the two nodes balance their loads by averaging them. We are interested in the expected gap between the minimum and maximum loads at nodes as the process progresses, and its dependence on n and on the graph structure. Variants of the above graphical balanced allocation process have been studied previously by Peres, Talwar, and Wieder [Peres et al., 2015], and by Sauerwald and Sun [Sauerwald and Sun, 2015]. These authors left as open the question of characterizing the gap in the case of cycle graphs in the dynamic case, where weights are created during the algorithm’s execution. For this case, the only known upper bound is of 𝒪(n log n), following from a majorization argument due to [Peres et al., 2015], which analyzes a related graphical allocation process. In this paper, we provide an upper bound of 𝒪 (√n log n) on the expected gap of the above process for cycles of length n. We introduce a new potential analysis technique, which enables us to bound the difference in load between k-hop neighbors on the cycle, for any k ≤ n/2. We complement this with a \"gap covering\" argument, which bounds the maximum value of the gap by bounding its value across all possible subsets of a certain structure, and recursively bounding the gaps within each subset. We provide analytical and experimental evidence that our upper bound on the gap is tight up to a logarithmic factor."}],"date_published":"2020-06-29T00:00:00Z","file":[{"access_level":"open_access","file_name":"2020_LIPIcs_Alistarh.pdf","checksum":"e5eb16199f4ccfd77a321977eb3f026f","date_updated":"2024-03-05T07:25:15Z","file_id":"15078","success":1,"content_type":"application/pdf","creator":"dernst","file_size":782987,"date_created":"2024-03-05T07:25:15Z","relation":"main_file"}],"external_id":{"arxiv":["2003.09297"]},"alternative_title":["LIPIcs"],"scopus_import":"1","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","type":"conference","date_updated":"2024-03-05T07:35:53Z","oa_version":"Published Version","day":"29","ec_funded":1,"language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.ICALP.2020.7","department":[{"_id":"DaAl"}],"has_accepted_license":"1","acknowledgement":"The authors sincerely thank Thomas Sauerwald and George Giakkoupis for insightful discussions, and Mohsen Ghaffari, Yuval Peres, and Udi Wieder for feedback on earlier\r\nversions of this draft. We also thank the ICALP anonymous reviewers for their very useful comments.\r\nFunding: European Research Council funding award PR1042ERC01"},{"date_published":"2020-04-01T00:00:00Z","date_created":"2024-03-05T08:57:17Z","month":"04","conference":{"name":"EuroCG: European Workshop on Computational Geometry","end_date":"2020-03-18","location":"Würzburg, Germany, Virtual","start_date":"2020-03-16"},"status":"public","article_number":"56","date_updated":"2024-03-05T09:00:07Z","type":"conference","oa_version":"Published Version","day":"01","year":"2020","main_file_link":[{"open_access":"1","url":"https://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/data/uploads/papers/eurocg20_paper_56.pdf"}],"citation":{"ama":"Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. Disjoint tree-compatible plane perfect matchings. In: <i>36th European Workshop on Computational Geometry</i>. ; 2020.","ieee":"O. Aichholzer, J. Obmann, P. Patak, D. Perz, and J. Tkadlec, “Disjoint tree-compatible plane perfect matchings,” in <i>36th European Workshop on Computational Geometry</i>, Würzburg, Germany, Virtual, 2020.","ista":"Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. 2020. Disjoint tree-compatible plane perfect matchings. 36th European Workshop on Computational Geometry. EuroCG: European Workshop on Computational Geometry, 56.","chicago":"Aichholzer, Oswin, Julia Obmann, Pavel Patak, Daniel Perz, and Josef Tkadlec. “Disjoint Tree-Compatible Plane Perfect Matchings.” In <i>36th European Workshop on Computational Geometry</i>, 2020.","short":"O. Aichholzer, J. Obmann, P. Patak, D. Perz, J. Tkadlec, in:, 36th European Workshop on Computational Geometry, 2020.","apa":"Aichholzer, O., Obmann, J., Patak, P., Perz, D., &#38; Tkadlec, J. (2020). Disjoint tree-compatible plane perfect matchings. In <i>36th European Workshop on Computational Geometry</i>. Würzburg, Germany, Virtual.","mla":"Aichholzer, Oswin, et al. “Disjoint Tree-Compatible Plane Perfect Matchings.” <i>36th European Workshop on Computational Geometry</i>, 56, 2020."},"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"last_name":"Aichholzer","first_name":"Oswin","full_name":"Aichholzer, Oswin"},{"last_name":"Obmann","first_name":"Julia","full_name":"Obmann, Julia"},{"last_name":"Patak","first_name":"Pavel","id":"B593B804-1035-11EA-B4F1-947645A5BB83","full_name":"Patak, Pavel"},{"full_name":"Perz, Daniel","last_name":"Perz","first_name":"Daniel"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","first_name":"Josef","last_name":"Tkadlec"}],"acknowledgement":"Research on this work was initiated at the 6th Austrian-Japanese-Mexican-Spanish Workshop on Discrete Geometry and continued during the 16th European Geometric Graph-Week, both held near Strobl, Austria. We are grateful to the participants for the inspiring atmosphere. We especially thank Alexander Pilz for bringing this class of problems to our attention and Birgit Vogtenhuber for inspiring discussions. D.P. is partially supported by the FWF grant I 3340-N35 (Collaborative DACH project Arrangements and Drawings). The research stay of P.P. at IST Austria is funded by the project CZ.02.2.69/0.0/0.0/17_050/0008466 Improvement of internationalization in the field of research and development at Charles University, through the support of quality projects MSCA-IF. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 734922.","publication_status":"published","abstract":[{"lang":"eng","text":"Two plane drawings of geometric graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. For a given set S of 2n points two plane drawings of perfect matchings M1 and M2 (which do not need to be disjoint nor compatible) are disjoint tree-compatible if there exists a plane drawing of a spanning tree T on S which is disjoint compatible to both M1 and M2.\r\nWe show that the graph of all disjoint tree-compatible perfect geometric matchings on 2n points in convex position is connected if and only if 2n ≥ 10. Moreover, in that case the diameter\r\nof this graph is either 4 or 5, independent of n."}],"publication":"36th European Workshop on Computational Geometry","title":"Disjoint tree-compatible plane perfect matchings","oa":1,"language":[{"iso":"eng"}],"_id":"15082","department":[{"_id":"KrCh"},{"_id":"UlWa"}]},{"citation":{"ama":"Browning TD, Sawin W. A geometric version of the circle method. <i>Annals of Mathematics</i>. 2020;191(3):893-948. doi:<a href=\"https://doi.org/10.4007/annals.2020.191.3.4\">10.4007/annals.2020.191.3.4</a>","ieee":"T. D. Browning and W. Sawin, “A geometric version of the circle method,” <i>Annals of Mathematics</i>, vol. 191, no. 3. Princeton University, pp. 893–948, 2020.","short":"T.D. Browning, W. Sawin, Annals of Mathematics 191 (2020) 893–948.","chicago":"Browning, Timothy D, and Will Sawin. “A Geometric Version of the Circle Method.” <i>Annals of Mathematics</i>. Princeton University, 2020. <a href=\"https://doi.org/10.4007/annals.2020.191.3.4\">https://doi.org/10.4007/annals.2020.191.3.4</a>.","ista":"Browning TD, Sawin W. 2020. A geometric version of the circle method. Annals of Mathematics. 191(3), 893–948.","apa":"Browning, T. D., &#38; Sawin, W. (2020). A geometric version of the circle method. <i>Annals of Mathematics</i>. Princeton University. <a href=\"https://doi.org/10.4007/annals.2020.191.3.4\">https://doi.org/10.4007/annals.2020.191.3.4</a>","mla":"Browning, Timothy D., and Will Sawin. “A Geometric Version of the Circle Method.” <i>Annals of Mathematics</i>, vol. 191, no. 3, Princeton University, 2020, pp. 893–948, doi:<a href=\"https://doi.org/10.4007/annals.2020.191.3.4\">10.4007/annals.2020.191.3.4</a>."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1711.10451"}],"author":[{"last_name":"Browning","first_name":"Timothy D","full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sawin, Will","first_name":"Will","last_name":"Sawin"}],"quality_controlled":"1","year":"2020","title":"A geometric version of the circle method","publication":"Annals of Mathematics","_id":"177","oa":1,"abstract":[{"text":"We develop a geometric version of the circle method and use it to compute the compactly supported cohomology of the space of rational curves through a point on a smooth affine hypersurface of sufficiently low degree.","lang":"eng"}],"publication_status":"published","issue":"3","volume":191,"article_type":"original","publisher":"Princeton University","intvolume":"       191","isi":1,"publist_id":"7744","month":"05","date_created":"2018-12-11T11:45:02Z","status":"public","article_processing_charge":"No","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Preprint","type":"journal_article","date_updated":"2023-08-17T07:12:37Z","day":"01","department":[{"_id":"TiBr"}],"doi":"10.4007/annals.2020.191.3.4","language":[{"iso":"eng"}],"external_id":{"arxiv":["1711.10451"],"isi":["000526986300004"]},"date_published":"2020-05-01T00:00:00Z","page":"893-948","arxiv":1},{"year":"2020","author":[{"full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","first_name":"Timothy D"},{"full_name":"Heath Brown, Roger","first_name":"Roger","last_name":"Heath Brown"}],"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1805.10715","open_access":"1"}],"citation":{"ama":"Browning TD, Heath Brown R. Density of rational points on a quadric bundle in ℙ3×ℙ3. <i>Duke Mathematical Journal</i>. 2020;169(16):3099-3165. doi:<a href=\"https://doi.org/10.1215/00127094-2020-0031\">10.1215/00127094-2020-0031</a>","ieee":"T. D. Browning and R. Heath Brown, “Density of rational points on a quadric bundle in ℙ3×ℙ3,” <i>Duke Mathematical Journal</i>, vol. 169, no. 16. Duke University Press, pp. 3099–3165, 2020.","short":"T.D. Browning, R. Heath Brown, Duke Mathematical Journal 169 (2020) 3099–3165.","chicago":"Browning, Timothy D, and Roger Heath Brown. “Density of Rational Points on a Quadric Bundle in ℙ3×ℙ3.” <i>Duke Mathematical Journal</i>. Duke University Press, 2020. <a href=\"https://doi.org/10.1215/00127094-2020-0031\">https://doi.org/10.1215/00127094-2020-0031</a>.","ista":"Browning TD, Heath Brown R. 2020. Density of rational points on a quadric bundle in ℙ3×ℙ3. Duke Mathematical Journal. 169(16), 3099–3165.","mla":"Browning, Timothy D., and Roger Heath Brown. “Density of Rational Points on a Quadric Bundle in ℙ3×ℙ3.” <i>Duke Mathematical Journal</i>, vol. 169, no. 16, Duke University Press, 2020, pp. 3099–165, doi:<a href=\"https://doi.org/10.1215/00127094-2020-0031\">10.1215/00127094-2020-0031</a>.","apa":"Browning, T. D., &#38; Heath Brown, R. (2020). Density of rational points on a quadric bundle in ℙ3×ℙ3. <i>Duke Mathematical Journal</i>. Duke University Press. <a href=\"https://doi.org/10.1215/00127094-2020-0031\">https://doi.org/10.1215/00127094-2020-0031</a>"},"publication_status":"published","abstract":[{"lang":"eng","text":"An asymptotic formula is established for the number of rational points of bounded anticanonical height which lie on a certain Zariski dense subset of the biprojective hypersurface x1y21+⋯+x4y24=0 in ℙ3×ℙ3. This confirms the modified Manin conjecture for this variety, in which the removal of a thin set of rational points is allowed."}],"oa":1,"_id":"179","title":"Density of rational points on a quadric bundle in ℙ3×ℙ3","publication":"Duke Mathematical Journal","article_type":"original","publisher":"Duke University Press","volume":169,"issue":"16","status":"public","date_created":"2018-12-11T11:45:02Z","month":"09","isi":1,"intvolume":"       169","day":"10","type":"journal_article","date_updated":"2023-10-17T12:51:10Z","oa_version":"Preprint","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1215/00127094-2020-0031","language":[{"iso":"eng"}],"department":[{"_id":"TiBr"}],"page":"3099-3165","date_published":"2020-09-10T00:00:00Z","external_id":{"arxiv":["1805.10715"],"isi":["000582676300002"]},"arxiv":1,"publication_identifier":{"issn":["0012-7094"]}},{"volume":53,"issue":"11","publisher":"American Chemical Society","article_type":"original","intvolume":"        53","status":"public","month":"11","date_created":"2023-08-01T09:35:50Z","extern":"1","quality_controlled":"1","author":[{"first_name":"Angela B.","last_name":"Grommet","full_name":"Grommet, Angela B."},{"first_name":"Lucia M.","last_name":"Lee","full_name":"Lee, Lucia M."},{"full_name":"Klajn, Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","last_name":"Klajn","first_name":"Rafal"}],"citation":{"apa":"Grommet, A. B., Lee, L. M., &#38; Klajn, R. (2020). Molecular photoswitching in confined spaces. <i>Accounts of Chemical Research</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.accounts.0c00434\">https://doi.org/10.1021/acs.accounts.0c00434</a>","mla":"Grommet, Angela B., et al. “Molecular Photoswitching in Confined Spaces.” <i>Accounts of Chemical Research</i>, vol. 53, no. 11, American Chemical Society, 2020, pp. 2600–10, doi:<a href=\"https://doi.org/10.1021/acs.accounts.0c00434\">10.1021/acs.accounts.0c00434</a>.","ieee":"A. B. Grommet, L. M. Lee, and R. Klajn, “Molecular photoswitching in confined spaces,” <i>Accounts of Chemical Research</i>, vol. 53, no. 11. American Chemical Society, pp. 2600–2610, 2020.","ama":"Grommet AB, Lee LM, Klajn R. Molecular photoswitching in confined spaces. <i>Accounts of Chemical Research</i>. 2020;53(11):2600-2610. doi:<a href=\"https://doi.org/10.1021/acs.accounts.0c00434\">10.1021/acs.accounts.0c00434</a>","short":"A.B. Grommet, L.M. Lee, R. Klajn, Accounts of Chemical Research 53 (2020) 2600–2610.","chicago":"Grommet, Angela B., Lucia M. Lee, and Rafal Klajn. “Molecular Photoswitching in Confined Spaces.” <i>Accounts of Chemical Research</i>. American Chemical Society, 2020. <a href=\"https://doi.org/10.1021/acs.accounts.0c00434\">https://doi.org/10.1021/acs.accounts.0c00434</a>.","ista":"Grommet AB, Lee LM, Klajn R. 2020. Molecular photoswitching in confined spaces. Accounts of Chemical Research. 53(11), 2600–2610."},"main_file_link":[{"url":"https://doi.org/10.1021/acs.accounts.0c00434","open_access":"1"}],"year":"2020","_id":"13361","oa":1,"pmid":1,"publication":"Accounts of Chemical Research","title":"Molecular photoswitching in confined spaces","abstract":[{"lang":"eng","text":"In nature, light is harvested by photoactive proteins to drive a range of biological processes, including photosynthesis, phototaxis, vision, and ultimately life. Bacteriorhodopsin, for example, is a protein embedded within archaeal cell membranes that binds the chromophore retinal within its hydrophobic pocket. Exposure to light triggers regioselective photoisomerization of the confined retinal, which in turn initiates a cascade of conformational changes within the protein, triggering proton flux against the concentration gradient, providing the microorganisms with the energy to live. We are inspired by these functions in nature to harness light energy using synthetic photoswitches under confinement. Like retinal, synthetic photoswitches require some degree of conformational flexibility to isomerize. In nature, the conformational change associated with retinal isomerization is accommodated by the structural flexibility of the opsin host, yet it results in steric communication between the chromophore and the protein. Similarly, we strive to design systems wherein isomerization of confined photoswitches results in steric communication between a photoswitch and its confining environment. To achieve this aim, a balance must be struck between molecular crowding and conformational freedom under confinement: too much crowding prevents switching, whereas too much freedom resembles switching of isolated molecules in solution, preventing communication.\r\n\r\nIn this Account, we discuss five classes of synthetic light-switchable compounds—diarylethenes, anthracenes, azobenzenes, spiropyrans, and donor–acceptor Stenhouse adducts—comparing their behaviors under confinement and in solution. The environments employed to confine these photoswitches are diverse, ranging from planar surfaces to nanosized cavities within coordination cages, nanoporous frameworks, and nanoparticle aggregates. The trends that emerge are primarily dependent on the nature of the photoswitch and not on the material used for confinement. In general, we find that photoswitches requiring less conformational freedom for switching are, as expected, more straightforward to isomerize reversibly under confinement. Because these compounds undergo only small structural changes upon isomerization, however, switching does not propagate into communication with their environment. Conversely, photoswitches that require more conformational freedom are more challenging to switch under confinement but also can influence system-wide behavior.\r\n\r\nAlthough we are primarily interested in the effects of geometric constraints on photoswitching under confinement, additional effects inevitably emerge when a compound is removed from solution and placed within a new, more crowded environment. For instance, we have found that compounds that convert to zwitterionic isomers upon light irradiation often experience stabilization of these forms under confinement. This effect results from the mutual stabilization of zwitterions that are brought into close proximity on surfaces or within cavities. Furthermore, photoswitches can experience preorganization under confinement, influencing the selectivity and efficiency of their photoreactions. Because intermolecular interactions arising from confinement cannot be considered independently from the effects of geometric constraints, we describe all confinement effects concurrently throughout this Account."}],"publication_status":"published","page":"2600-2610","external_id":{"pmid":["32969638"]},"keyword":["General Medicine","General Chemistry"],"date_published":"2020-11-17T00:00:00Z","scopus_import":"1","publication_identifier":{"eissn":["1520-4898"],"issn":["0001-4842"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","day":"17","oa_version":"Published Version","type":"journal_article","date_updated":"2023-08-07T10:06:46Z","language":[{"iso":"eng"}],"doi":"10.1021/acs.accounts.0c00434"},{"date_created":"2023-08-01T09:36:10Z","month":"10","status":"public","intvolume":"       142","publisher":"American Chemical Society","article_type":"original","issue":"41","volume":142,"publication_status":"published","abstract":[{"lang":"eng","text":"Aggregation of organic molecules can drastically affect their physicochemical properties. For instance, the optical properties of BODIPY dyes are inherently related to the degree of aggregation and the mutual orientation of BODIPY units within these aggregates. Whereas the noncovalent aggregation of various BODIPY dyes has been studied in diverse media, the ill-defined nature of these aggregates has made it difficult to elucidate the structure–property relationships. Here, we studied the encapsulation of three structurally simple BODIPY derivatives within the hydrophobic cavity of a water-soluble, flexible PdII6L4 coordination cage. The cavity size allowed for the selective encapsulation of two dye molecules, irrespective of the substitution pattern on the BODIPY core. Working with a model, a pentamethyl-substituted derivative, we found that the mutual orientation of two BODIPY units in the cage’s cavity was remarkably similar to that in the crystalline state of the free dye, allowing us to isolate and characterize the smallest possible noncovalent H-type BODIPY aggregate, namely, an H-dimer. Interestingly, a CF3-substituted BODIPY, known for forming J-type aggregates, was also encapsulated as an H-dimer. Taking advantage of the dynamic nature of encapsulation, we developed a system in which reversible switching between H- and J-aggregates can be induced for multiple cycles simply by addition and subsequent destruction of the cage. We expect that the ability to rapidly and reversibly manipulate the optical properties of supramolecular inclusion complexes in aqueous media will open up avenues for developing detection systems that operate within biological environments."}],"title":"Modulating the optical properties of BODIPY dyes by noncovalent dimerization within a flexible coordination cage","publication":"Journal of the American Chemical Society","pmid":1,"oa":1,"_id":"13362","year":"2020","citation":{"mla":"Gemen, Julius, et al. “Modulating the Optical Properties of BODIPY Dyes by Noncovalent Dimerization within a Flexible Coordination Cage.” <i>Journal of the American Chemical Society</i>, vol. 142, no. 41, American Chemical Society, 2020, pp. 17721–29, doi:<a href=\"https://doi.org/10.1021/jacs.0c08589\">10.1021/jacs.0c08589</a>.","apa":"Gemen, J., Ahrens, J., Shimon, L. J. W., &#38; Klajn, R. (2020). Modulating the optical properties of BODIPY dyes by noncovalent dimerization within a flexible coordination cage. <i>Journal of the American Chemical Society</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/jacs.0c08589\">https://doi.org/10.1021/jacs.0c08589</a>","ama":"Gemen J, Ahrens J, Shimon LJW, Klajn R. Modulating the optical properties of BODIPY dyes by noncovalent dimerization within a flexible coordination cage. <i>Journal of the American Chemical Society</i>. 2020;142(41):17721-17729. doi:<a href=\"https://doi.org/10.1021/jacs.0c08589\">10.1021/jacs.0c08589</a>","ieee":"J. Gemen, J. Ahrens, L. J. W. Shimon, and R. Klajn, “Modulating the optical properties of BODIPY dyes by noncovalent dimerization within a flexible coordination cage,” <i>Journal of the American Chemical Society</i>, vol. 142, no. 41. American Chemical Society, pp. 17721–17729, 2020.","ista":"Gemen J, Ahrens J, Shimon LJW, Klajn R. 2020. Modulating the optical properties of BODIPY dyes by noncovalent dimerization within a flexible coordination cage. Journal of the American Chemical Society. 142(41), 17721–17729.","chicago":"Gemen, Julius, Johannes Ahrens, Linda J. W. Shimon, and Rafal Klajn. “Modulating the Optical Properties of BODIPY Dyes by Noncovalent Dimerization within a Flexible Coordination Cage.” <i>Journal of the American Chemical Society</i>. American Chemical Society, 2020. <a href=\"https://doi.org/10.1021/jacs.0c08589\">https://doi.org/10.1021/jacs.0c08589</a>.","short":"J. Gemen, J. Ahrens, L.J.W. Shimon, R. Klajn, Journal of the American Chemical Society 142 (2020) 17721–17729."},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1021/jacs.0c08589"}],"extern":"1","author":[{"first_name":"Julius","last_name":"Gemen","full_name":"Gemen, Julius"},{"last_name":"Ahrens","first_name":"Johannes","full_name":"Ahrens, Johannes"},{"full_name":"Shimon, Linda J. W.","last_name":"Shimon","first_name":"Linda J. W."},{"full_name":"Klajn, Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","last_name":"Klajn","first_name":"Rafal"}],"quality_controlled":"1","publication_identifier":{"issn":["0002-7863"],"eissn":["1520-5126"]},"scopus_import":"1","date_published":"2020-10-04T00:00:00Z","keyword":["Colloid and Surface Chemistry","Biochemistry","General Chemistry","Catalysis"],"external_id":{"pmid":["33006898"]},"page":"17721-17729","language":[{"iso":"eng"}],"doi":"10.1021/jacs.0c08589","date_updated":"2023-08-07T10:09:54Z","type":"journal_article","oa_version":"Published Version","day":"04","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No"}]