[{"publisher":"Association for the Advancement of Artificial Intelligence","title":"Multiple-environment Markov decision processes: Efficient analysis and applications","page":"48-56","language":[{"iso":"eng"}],"date_created":"2020-08-02T22:00:58Z","publication":"Proceedings of the 30th International Conference on Automated Planning and Scheduling","date_published":"2020-06-01T00:00:00Z","publication_status":"published","scopus_import":"1","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."}],"quality_controlled":"1","intvolume":"        30","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","date_updated":"2023-09-07T13:16:18Z","status":"public","related_material":{"record":[{"status":"public","id":"8390","relation":"dissertation_contains"}]},"department":[{"_id":"KrCh"}],"month":"06","oa_version":"None","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","full_name":"Chmelik, Martin","first_name":"Martin"},{"full_name":"Karkhanis, Deep","first_name":"Deep","last_name":"Karkhanis"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotný","full_name":"Novotný, Petr","first_name":"Petr"},{"last_name":"Royer","id":"3811D890-F248-11E8-B48F-1D18A9856A87","first_name":"Amélie","orcid":"0000-0002-8407-0705","full_name":"Royer, Amélie"}],"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.","project":[{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"}],"volume":30,"conference":{"name":"ICAPS: International Conference on Automated Planning and Scheduling","start_date":"2020-10-26","end_date":"2020-10-30","location":"Nancy, France"},"day":"01","article_processing_charge":"No","citation":{"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.","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.","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.","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.","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.","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."},"publication_identifier":{"issn":["23340835"],"eissn":["23340843"]},"year":"2020","_id":"8193"},{"year":"2020","_id":"8194","publication_identifier":{"eissn":["16113349"],"issn":["03029743"],"isbn":["9783030510732"]},"citation":{"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>.","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.","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.","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>","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>","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."},"article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/978-3-030-51074-9_2"}],"day":"24","project":[{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"alternative_title":["LNCS"],"conference":{"name":"IJCAR: International Joint Conference on Automated Reasoning","start_date":"2020-07-01","location":"Paris, France","end_date":"2020-07-04"},"volume":12166,"author":[{"last_name":"Baranowski","full_name":"Baranowski, Marek","first_name":"Marek"},{"last_name":"He","full_name":"He, Shaobo","first_name":"Shaobo"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias","first_name":"Mathias"},{"last_name":"Nguyen","first_name":"Thanh Son","full_name":"Nguyen, Thanh Son"},{"first_name":"Zvonimir","full_name":"Rakamarić, Zvonimir","last_name":"Rakamarić"}],"oa_version":"Published Version","month":"06","oa":1,"department":[{"_id":"ToHe"}],"external_id":{"isi":["000884318000002"]},"status":"public","date_updated":"2023-08-22T08:27:25Z","type":"conference","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":"     12166","quality_controlled":"1","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."}],"isi":1,"scopus_import":"1","publication_status":"published","date_published":"2020-06-24T00:00:00Z","date_created":"2020-08-02T22:00:59Z","publication":"Automated Reasoning","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-51074-9_2","page":"13-31","title":"An SMT theory of fixed-point arithmetic","publisher":"Springer Nature"},{"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"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."}],"file":[{"content_type":"application/pdf","date_created":"2020-08-06T08:14:54Z","success":1,"file_name":"2020_LNCS_Kragl.pdf","file_size":804237,"relation":"main_file","file_id":"8201","access_level":"open_access","creator":"dernst","date_updated":"2020-08-06T08:14:54Z"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":"     12224","quality_controlled":"1","page":"275-298","doi":"10.1007/978-3-030-53288-8_14","title":"Refinement for structured concurrent programs","file_date_updated":"2020-08-06T08:14:54Z","license":"https://creativecommons.org/licenses/by/4.0/","publisher":"Springer Nature","has_accepted_license":"1","isi":1,"scopus_import":"1","publication_status":"published","date_published":"2020-07-14T00:00:00Z","date_created":"2020-08-03T11:45:35Z","language":[{"iso":"eng"}],"publication":"Computer Aided Verification","article_processing_charge":"No","day":"14","project":[{"name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"}],"alternative_title":["LNCS"],"volume":12224,"_id":"8195","year":"2020","publication_identifier":{"eisbn":["9783030532888"],"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783030532871"]},"citation":{"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>","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.","short":"B. Kragl, S. Qadeer, T.A. Henzinger, in:, Computer Aided Verification, Springer Nature, 2020, pp. 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>.","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>","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>.","ista":"Kragl B, Qadeer S, Henzinger TA. 2020. Refinement for structured concurrent programs. Computer Aided Verification. , LNCS, vol. 12224, 275–298."},"department":[{"_id":"ToHe"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8332"}]},"external_id":{"isi":["000695276000014"]},"status":"public","date_updated":"2023-09-07T13:18:00Z","type":"conference","acknowledgement":"Bernhard Kragl and Thomas A. Henzinger were supported by\r\nthe Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","author":[{"full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117","first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","last_name":"Kragl"},{"last_name":"Qadeer","first_name":"Shaz","full_name":"Qadeer, Shaz"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"ddc":["000"],"oa_version":"Published Version","month":"07","oa":1},{"oa":1,"month":"01","oa_version":"Preprint","issue":"1","author":[{"first_name":"Mathieu","full_name":"Lewin, Mathieu","last_name":"Lewin"},{"full_name":"Lieb, Elliott H.","first_name":"Elliott H.","last_name":"Lieb"},{"first_name":"Robert","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"type":"journal_article","date_updated":"2024-01-29T09:01:12Z","status":"public","external_id":{"arxiv":["1903.04046"]},"department":[{"_id":"RoSe"}],"citation":{"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>","short":"M. Lewin, E.H. Lieb, R. Seiringer, Pure and Applied Analysis 2 (2020) 35–73.","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>.","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.","ista":"Lewin M, Lieb EH, Seiringer R. 2020.  The local density approximation in density functional theory. Pure and Applied Analysis. 2(1), 35–73.","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_identifier":{"issn":["2578-5893"],"eissn":["2578-5885"]},"year":"2020","_id":"14891","article_type":"original","volume":2,"day":"01","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1903.04046"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"date_created":"2024-01-28T23:01:44Z","publication":"Pure and Applied Analysis","date_published":"2020-01-01T00:00:00Z","scopus_import":"1","publication_status":"published","publisher":"Mathematical Sciences Publishers","title":" The local density approximation in density functional theory","page":"35-73","doi":"10.2140/paa.2020.2.35","arxiv":1,"quality_controlled":"1","intvolume":"         2","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"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.","lang":"eng"}]},{"type":"journal_article","date_updated":"2024-02-28T12:37:54Z","status":"public","keyword":["Molecular Biology","Structural Biology"],"external_id":{"pmid":["32910969"]},"department":[{"_id":"MaLo"}],"month":"10","oa":1,"oa_version":"Published Version","issue":"21","author":[{"last_name":"Rosa","first_name":"Higor Vinícius Dias","full_name":"Rosa, Higor Vinícius Dias"},{"first_name":"Diego Antonio","full_name":"Leonardo, Diego Antonio","last_name":"Leonardo"},{"first_name":"Gabriel","full_name":"Brognara, Gabriel","last_name":"Brognara","id":"D96FFDA0-A884-11E9-9968-DC26E6697425"},{"last_name":"Brandão-Neto","full_name":"Brandão-Neto, José","first_name":"José"},{"last_name":"D'Muniz Pereira","first_name":"Humberto","full_name":"D'Muniz Pereira, Humberto"},{"first_name":"Ana Paula Ulian","full_name":"Araújo, Ana Paula Ulian","last_name":"Araújo"},{"full_name":"Garratt, Richard Charles","first_name":"Richard Charles","last_name":"Garratt"}],"volume":432,"day":"02","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.jmb.2020.09.001"}],"article_processing_charge":"No","citation":{"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.","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>","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.","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>.","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."},"publication_identifier":{"issn":["0022-2836"]},"_id":"15036","year":"2020","article_type":"original","publisher":"Elsevier","title":"Molecular recognition at septin interfaces: The switches hold the key","page":"5784-5801","doi":"10.1016/j.jmb.2020.09.001","date_created":"2024-02-28T08:50:34Z","language":[{"iso":"eng"}],"publication":"Journal of Molecular Biology","date_published":"2020-10-02T00:00:00Z","publication_status":"published","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."}],"pmid":1,"quality_controlled":"1","intvolume":"       432","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publication_identifier":{"issn":["1674-2052"]},"citation":{"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.","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>.","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>","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.","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>.","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>","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."},"year":"2020","_id":"15037","article_type":"original","volume":13,"day":"04","article_processing_charge":"No","oa_version":"Published Version","month":"05","oa":1,"issue":"5","author":[{"last_name":"Moulinier-Anzola","full_name":"Moulinier-Anzola, Jeanette","first_name":"Jeanette"},{"last_name":"Schwihla","first_name":"Maximilian","full_name":"Schwihla, Maximilian"},{"first_name":"Lucinda","full_name":"De-Araújo, Lucinda","last_name":"De-Araújo"},{"full_name":"Artner, Christina","first_name":"Christina","id":"45DF286A-F248-11E8-B48F-1D18A9856A87","last_name":"Artner"},{"first_name":"Lisa","full_name":"Jörg, Lisa","last_name":"Jörg"},{"last_name":"Konstantinova","first_name":"Nataliia","full_name":"Konstantinova, Nataliia"},{"last_name":"Luschnig","first_name":"Christian","full_name":"Luschnig, Christian"},{"first_name":"Barbara","full_name":"Korbei, Barbara","last_name":"Korbei"}],"ddc":["580"],"type":"journal_article","status":"public","date_updated":"2024-02-28T12:41:52Z","external_id":{"pmid":["32087370"]},"keyword":["Plant Science","Molecular Biology"],"department":[{"_id":"EvBe"}],"quality_controlled":"1","intvolume":"        13","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"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.","lang":"eng"}],"file":[{"access_level":"open_access","checksum":"c538a5008f7827f62d17d40a3bfabe65","file_size":3089212,"relation":"main_file","file_id":"15038","file_name":"2020_MolecularPlant_MoulinierAnzola.pdf","date_updated":"2024-02-28T12:39:56Z","creator":"dernst","success":1,"date_created":"2024-02-28T12:39:56Z","content_type":"application/pdf"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"pmid":1,"language":[{"iso":"eng"}],"date_created":"2024-02-28T08:55:56Z","publication":"Molecular Plant","date_published":"2020-05-04T00:00:00Z","publication_status":"published","has_accepted_license":"1","publisher":"Elsevier","title":"TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants","file_date_updated":"2024-02-28T12:39:56Z","doi":"10.1016/j.molp.2020.02.012","page":"717-731"},{"external_id":{"arxiv":["2002.12086"]},"keyword":["General Medicine"],"department":[{"_id":"KrCh"}],"type":"journal_article","status":"public","date_updated":"2024-03-04T08:30:16Z","issue":"06","author":[{"last_name":"Brázdil","full_name":"Brázdil, Tomáš","first_name":"Tomáš"},{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Novotný","full_name":"Novotný, Petr","first_name":"Petr"},{"full_name":"Vahala, Jiří","first_name":"Jiří","last_name":"Vahala"}],"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.","oa_version":"Preprint","month":"04","oa":1,"day":"03","article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2002.12086","open_access":"1"}],"project":[{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"}],"conference":{"start_date":"2020-02-07","location":"New York, NY, United States","end_date":"2020-02-12","name":"AAAI: Conference on Artificial Intelligence"},"volume":34,"_id":"15055","year":"2020","article_type":"original","publication_identifier":{"issn":["2374-3468"]},"citation":{"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>.","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.","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>","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.","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>.","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>"},"title":"Reinforcement learning of risk-constrained policies in Markov decision processes","page":"9794-9801","arxiv":1,"doi":"10.1609/aaai.v34i06.6531","publisher":"Association for the Advancement of Artificial Intelligence","publication_status":"published","date_created":"2024-03-04T08:07:22Z","publication":"Proceedings of the 34th AAAI Conference on Artificial Intelligence","language":[{"iso":"eng"}],"date_published":"2020-04-03T00:00:00Z","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"}],"intvolume":"        34","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1"},{"ddc":["570"],"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. ","author":[{"last_name":"Park","first_name":"Sangsoon","full_name":"Park, Sangsoon"},{"id":"C407B586-6052-11E9-B3AE-7006E6697425","last_name":"Artan","full_name":"Artan, Murat","orcid":"0000-0001-8945-6992","first_name":"Murat"},{"last_name":"Han","full_name":"Han, Seung Hyun","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"},{"full_name":"Hwang, Ara B.","first_name":"Ara B.","last_name":"Hwang"},{"last_name":"Shin","first_name":"Won Sik","full_name":"Shin, Won Sik"},{"last_name":"Kim","full_name":"Kim, Kyong-Tai","first_name":"Kyong-Tai"},{"last_name":"Lee","full_name":"Lee, Seung-Jae V.","first_name":"Seung-Jae V."}],"issue":"27","oa":1,"month":"07","oa_version":"Published Version","department":[{"_id":"MaDe"}],"date_updated":"2024-03-04T09:52:09Z","status":"public","type":"journal_article","article_type":"original","_id":"15057","year":"2020","article_number":"aaw7824","citation":{"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.","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>","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>.","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).","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.","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>"},"publication_identifier":{"eissn":["2375-2548"]},"article_processing_charge":"No","day":"01","volume":6,"has_accepted_license":"1","publication_status":"published","date_published":"2020-07-01T00:00:00Z","date_created":"2024-03-04T09:41:57Z","publication":"Science Advances","language":[{"iso":"eng"}],"doi":"10.1126/sciadv.aaw7824","file_date_updated":"2024-03-04T09:46:41Z","title":"VRK-1 extends life span by activation of AMPK via phosphorylation","publisher":"American Association for the Advancement of Science","license":"https://creativecommons.org/licenses/by-nc/4.0/","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"         6","quality_controlled":"1","tmp":{"image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"file":[{"relation":"main_file","file_size":1864415,"file_id":"15058","file_name":"2020_ScienceAdvances_Park.pdf","access_level":"open_access","checksum":"a37157cd0de709dce5fe03f4a31cd0b6","creator":"dernst","date_updated":"2024-03-04T09:46:41Z","success":1,"date_created":"2024-03-04T09:46:41Z","content_type":"application/pdf"}],"abstract":[{"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.","lang":"eng"}]},{"title":"Compact millimeter and submillimeter-wave photonic radiometer for cubesats","doi":"10.23919/eucap48036.2020.9135962","department":[{"_id":"JoFi"}],"type":"conference","date_updated":"2024-03-04T10:02:49Z","publisher":"IEEE","status":"public","publication_status":"published","author":[{"last_name":"Wasiak","first_name":"Michal","full_name":"Wasiak, Michal"},{"full_name":"Botello, Gabriel Santamaria","first_name":"Gabriel Santamaria","last_name":"Botello"},{"last_name":"Abdalmalak","first_name":"Kerlos Atia","full_name":"Abdalmalak, Kerlos Atia"},{"first_name":"Florian","full_name":"Sedlmeir, Florian","last_name":"Sedlmeir"},{"last_name":"Rueda Sanchez","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6249-5860","first_name":"Alfredo R","full_name":"Rueda Sanchez, Alfredo R"},{"full_name":"Segovia-Vargas, Daniel","first_name":"Daniel","last_name":"Segovia-Vargas"},{"first_name":"Harald G. L.","full_name":"Schwefel, Harald G. L.","last_name":"Schwefel"},{"full_name":"Munoz, Luis Enrique Garcia","first_name":"Luis Enrique Garcia","last_name":"Munoz"}],"acknowledgement":"This work has been financially supported by Comunidad de Madrid S2018/NMT-4333 ARTINLARA-CM projects, and “FUNDACIÓN SENER” REFTA projects.","month":"07","language":[{"iso":"eng"}],"date_created":"2024-03-04T09:57:48Z","publication":"14th European Conference on Antennas and Propagation","oa_version":"None","date_published":"2020-07-08T00:00:00Z","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."}],"day":"08","article_processing_charge":"No","conference":{"name":"EuCAP: European Conference on Antennas and Propagation","start_date":"2020-03-15","location":"Copenhagen, Denmark","end_date":"2020-03-20"},"_id":"15059","year":"2020","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>","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.","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>.","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.","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>."},"publication_identifier":{"eisbn":["9788831299008"]},"quality_controlled":"1"},{"publication":"Proceedings of the National Academy of Sciences","date_created":"2024-03-04T10:03:52Z","language":[{"iso":"eng"}],"date_published":"2020-09-08T00:00:00Z","publication_status":"published","publisher":"Proceedings of the National Academy of Sciences","title":"Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin","page":"22101-22112","doi":"10.1073/pnas.1917269117","quality_controlled":"1","intvolume":"       117","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","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."}],"pmid":1,"oa_version":"Published Version","month":"09","oa":1,"issue":"36","author":[{"full_name":"Pinotsis, Nikos","first_name":"Nikos","last_name":"Pinotsis"},{"full_name":"Zielinska, Karolina","first_name":"Karolina","last_name":"Zielinska"},{"first_name":"Mrigya","full_name":"Babuta, Mrigya","last_name":"Babuta"},{"last_name":"Arolas","first_name":"Joan L.","full_name":"Arolas, Joan L."},{"full_name":"Kostan, Julius","first_name":"Julius","last_name":"Kostan"},{"full_name":"Khan, Muhammad Bashir","first_name":"Muhammad Bashir","last_name":"Khan"},{"last_name":"Schreiner","first_name":"Claudia","full_name":"Schreiner, Claudia"},{"full_name":"Testa Salmazo, Anita P","first_name":"Anita P","id":"41F1F098-F248-11E8-B48F-1D18A9856A87","last_name":"Testa Salmazo"},{"last_name":"Ciccarelli","full_name":"Ciccarelli, Luciano","first_name":"Luciano"},{"last_name":"Puchinger","full_name":"Puchinger, Martin","first_name":"Martin"},{"last_name":"Gkougkoulia","first_name":"Eirini A.","full_name":"Gkougkoulia, Eirini A."},{"first_name":"Euripedes de Almeida","full_name":"Ribeiro, Euripedes de Almeida","last_name":"Ribeiro"},{"last_name":"Marlovits","full_name":"Marlovits, Thomas C.","first_name":"Thomas C."},{"last_name":"Bhattacharya","first_name":"Alok","full_name":"Bhattacharya, Alok"},{"last_name":"Djinovic-Carugo","full_name":"Djinovic-Carugo, Kristina","first_name":"Kristina"}],"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. ","type":"journal_article","status":"public","date_updated":"2024-03-04T10:14:44Z","external_id":{"pmid":["32848067"]},"department":[{"_id":"CaBe"}],"publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"citation":{"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.","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>.","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>","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>","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.","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>."},"year":"2020","_id":"15061","article_type":"original","volume":117,"acknowledged_ssus":[{"_id":"LifeSc"}],"day":"08","article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.1073/pnas.191726911","open_access":"1"}]},{"ec_funded":1,"day":"16","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1908.01653"}],"project":[{"name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020"}],"volume":1,"year":"2020","_id":"15063","article_type":"original","publication_identifier":{"issn":["2690-1005","2690-0998"]},"citation":{"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.","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>.","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>","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>.","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."},"external_id":{"arxiv":["1908.01653"]},"keyword":["General Medicine"],"department":[{"_id":"LaEr"}],"type":"journal_article","status":"public","date_updated":"2024-03-04T10:33:15Z","issue":"1","author":[{"first_name":"Giorgio","orcid":"0000-0002-4901-7992","full_name":"Cipolloni, Giorgio","last_name":"Cipolloni","id":"42198EFA-F248-11E8-B48F-1D18A9856A87"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","full_name":"Erdös, László","orcid":"0000-0001-5366-9603","first_name":"László"},{"last_name":"Schröder","id":"408ED176-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2904-1856","first_name":"Dominik J","full_name":"Schröder, Dominik J"}],"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","oa_version":"Preprint","oa":1,"month":"11","abstract":[{"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).","lang":"eng"}],"intvolume":"         1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","title":"Optimal lower bound on the least singular value of the shifted Ginibre ensemble","doi":"10.2140/pmp.2020.1.101","arxiv":1,"page":"101-146","publisher":"Mathematical Sciences Publishers","publication_status":"published","scopus_import":"1","date_created":"2024-03-04T10:27:57Z","language":[{"iso":"eng"}],"publication":"Probability and Mathematical Physics","date_published":"2020-11-16T00:00:00Z"},{"citation":{"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>.","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.","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>","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>","short":"U. Bauer, H. Edelsbrunner, G. Jablonski, M. Mrozek, Journal of Applied and Computational Topology 4 (2020) 455–480.","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>."},"publication_identifier":{"eissn":["2367-1734"],"issn":["2367-1726"]},"article_type":"original","_id":"15064","year":"2020","volume":4,"article_processing_charge":"Yes (via OA deal)","day":"01","month":"12","oa":1,"oa_version":"Published Version","ddc":["500"],"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.","author":[{"first_name":"U.","full_name":"Bauer, U.","last_name":"Bauer"},{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"first_name":"Grzegorz","orcid":"0000-0002-3536-9866","full_name":"Jablonski, Grzegorz","last_name":"Jablonski","id":"4483EF78-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mrozek, M.","first_name":"M.","last_name":"Mrozek"}],"issue":"4","date_updated":"2024-03-04T10:54:04Z","status":"public","type":"journal_article","department":[{"_id":"HeEd"}],"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"         4","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"date_updated":"2024-03-04T10:52:42Z","creator":"dernst","checksum":"eed1168b6e66cd55272c19bb7fca8a1c","access_level":"open_access","file_id":"15065","relation":"main_file","file_size":851190,"file_name":"2020_JourApplCompTopology_Bauer.pdf","success":1,"date_created":"2024-03-04T10:52:42Z","content_type":"application/pdf"}],"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"}],"date_published":"2020-12-01T00:00:00Z","date_created":"2024-03-04T10:47:49Z","publication":"Journal of Applied and Computational Topology","language":[{"iso":"eng"}],"has_accepted_license":"1","publication_status":"published","scopus_import":"1","publisher":"Springer Nature","page":"455-480","doi":"10.1007/s41468-020-00058-8","file_date_updated":"2024-03-04T10:52:42Z","title":"Čech-Delaunay gradient flow and homology inference for self-maps"},{"citation":{"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.","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.","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>","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>.","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>"},"article_number":"40","_id":"15074","year":"2020","conference":{"name":"DISC: Symposium on Distributed Computing","start_date":"2020-10-12","location":"Virtual","end_date":"2020-10-16"},"volume":179,"alternative_title":["LIPIcs"],"day":"07","article_processing_charge":"No","month":"10","oa":1,"oa_version":"Published Version","ddc":["000"],"author":[{"last_name":"Brandt","full_name":"Brandt, Sebastian","first_name":"Sebastian"},{"first_name":"Barbara","full_name":"Keller, Barbara","last_name":"Keller"},{"id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","last_name":"Rybicki","full_name":"Rybicki, Joel","orcid":"0000-0002-6432-6646","first_name":"Joel"},{"last_name":"Suomela","first_name":"Jukka","full_name":"Suomela, Jukka"},{"full_name":"Uitto, Jara","first_name":"Jara","last_name":"Uitto"}],"type":"conference","date_updated":"2024-03-05T07:13:13Z","status":"public","external_id":{"arxiv":["2005.07761"]},"related_material":{"record":[{"status":"public","id":"9678","relation":"later_version"}]},"department":[{"_id":"DaAl"}],"quality_controlled":"1","intvolume":"       179","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"access_level":"open_access","checksum":"23e2d9321aef53092dc1e24a8ab82d72","relation":"main_file","file_size":303529,"file_id":"15075","file_name":"2020_LIPIcs_Brandt.pdf","date_updated":"2024-03-05T07:08:27Z","creator":"dernst","success":1,"date_created":"2024-03-05T07:08:27Z","content_type":"application/pdf"}],"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"}],"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"date_created":"2024-03-05T07:09:12Z","publication":"34th International Symposium on Distributed Computing","language":[{"iso":"eng"}],"date_published":"2020-10-07T00:00:00Z","publication_status":"published","scopus_import":"1","has_accepted_license":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","license":"https://creativecommons.org/licenses/by/3.0/","title":"Brief announcement: Efficient load-balancing through distributed token dropping","file_date_updated":"2024-03-05T07:08:27Z","arxiv":1,"doi":"10.4230/LIPIcs.DISC.2020.40"},{"oa":1,"month":"06","oa_version":"Published Version","ddc":["000"],"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","author":[{"last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"},{"id":"3279A00C-F248-11E8-B48F-1D18A9856A87","last_name":"Nadiradze","full_name":"Nadiradze, Giorgi","orcid":"0000-0001-5634-0731","first_name":"Giorgi"},{"id":"bcc145fd-e77f-11ea-ae8b-80d661dbff67","last_name":"Sabour","full_name":"Sabour, Amirmojtaba","first_name":"Amirmojtaba"}],"type":"conference","date_updated":"2024-03-05T07:35:53Z","status":"public","external_id":{"arxiv":["2003.09297"]},"related_material":{"record":[{"status":"public","id":"8286","relation":"later_version"}]},"department":[{"_id":"DaAl"}],"citation":{"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.","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>.","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.","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>","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.","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>"},"article_number":"7","_id":"15077","year":"2020","project":[{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"volume":168,"alternative_title":["LIPIcs"],"conference":{"location":"Saarbrücken, Germany, Virtual","end_date":"2020-07-11","start_date":"2020-07-08","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"ec_funded":1,"day":"29","article_processing_charge":"No","language":[{"iso":"eng"}],"date_created":"2024-03-05T07:25:37Z","publication":"47th International Colloquium on Automata, Languages, and Programming","date_published":"2020-06-29T00:00:00Z","publication_status":"published","scopus_import":"1","has_accepted_license":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file_date_updated":"2024-03-05T07:25:15Z","title":"Dynamic averaging load balancing on cycles","arxiv":1,"doi":"10.4230/LIPIcs.ICALP.2020.7","quality_controlled":"1","intvolume":"       168","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"creator":"dernst","date_updated":"2024-03-05T07:25:15Z","file_name":"2020_LIPIcs_Alistarh.pdf","relation":"main_file","file_size":782987,"file_id":"15078","access_level":"open_access","checksum":"e5eb16199f4ccfd77a321977eb3f026f","date_created":"2024-03-05T07:25:15Z","content_type":"application/pdf","success":1}],"abstract":[{"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.","lang":"eng"}],"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"}},{"title":"Disjoint tree-compatible plane perfect matchings","department":[{"_id":"KrCh"},{"_id":"UlWa"}],"type":"conference","status":"public","date_updated":"2024-03-05T09:00:07Z","publication_status":"published","author":[{"last_name":"Aichholzer","first_name":"Oswin","full_name":"Aichholzer, Oswin"},{"last_name":"Obmann","full_name":"Obmann, Julia","first_name":"Julia"},{"full_name":"Patak, Pavel","first_name":"Pavel","id":"B593B804-1035-11EA-B4F1-947645A5BB83","last_name":"Patak"},{"first_name":"Daniel","full_name":"Perz, Daniel","last_name":"Perz"},{"last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef"}],"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.","oa_version":"Published Version","date_created":"2024-03-05T08:57:17Z","oa":1,"month":"04","publication":"36th European Workshop on Computational Geometry","language":[{"iso":"eng"}],"date_published":"2020-04-01T00:00:00Z","day":"01","abstract":[{"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.","lang":"eng"}],"main_file_link":[{"url":"https://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/data/uploads/papers/eurocg20_paper_56.pdf","open_access":"1"}],"article_processing_charge":"No","conference":{"end_date":"2020-03-18","location":"Würzburg, Germany, Virtual","start_date":"2020-03-16","name":"EuroCG: European Workshop on Computational Geometry"},"_id":"15082","year":"2020","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","citation":{"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.","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.","mla":"Aichholzer, Oswin, et al. “Disjoint Tree-Compatible Plane Perfect Matchings.” <i>36th European Workshop on Computational Geometry</i>, 56, 2020."},"article_number":"56"},{"oa":1,"month":"05","oa_version":"Preprint","issue":"3","author":[{"full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177","first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning"},{"last_name":"Sawin","first_name":"Will","full_name":"Sawin, Will"}],"type":"journal_article","date_updated":"2023-08-17T07:12:37Z","status":"public","external_id":{"arxiv":["1711.10451"],"isi":["000526986300004"]},"department":[{"_id":"TiBr"}],"citation":{"ista":"Browning TD, Sawin W. 2020. A geometric version of the circle method. Annals of Mathematics. 191(3), 893–948.","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>.","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>.","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>","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."},"_id":"177","year":"2020","article_type":"original","volume":191,"day":"01","main_file_link":[{"url":"https://arxiv.org/abs/1711.10451","open_access":"1"}],"article_processing_charge":"No","publication":"Annals of Mathematics","date_created":"2018-12-11T11:45:02Z","language":[{"iso":"eng"}],"date_published":"2020-05-01T00:00:00Z","publication_status":"published","isi":1,"publisher":"Princeton University","publist_id":"7744","title":"A geometric version of the circle method","doi":"10.4007/annals.2020.191.3.4","page":"893-948","arxiv":1,"quality_controlled":"1","intvolume":"       191","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","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"}]},{"publisher":"Duke University Press","title":"Density of rational points on a quadric bundle in ℙ3×ℙ3","page":"3099-3165","arxiv":1,"doi":"10.1215/00127094-2020-0031","language":[{"iso":"eng"}],"publication":"Duke Mathematical Journal","date_created":"2018-12-11T11:45:02Z","date_published":"2020-09-10T00:00:00Z","isi":1,"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."}],"quality_controlled":"1","intvolume":"       169","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","status":"public","date_updated":"2023-10-17T12:51:10Z","external_id":{"arxiv":["1805.10715"],"isi":["000582676300002"]},"department":[{"_id":"TiBr"}],"oa_version":"Preprint","oa":1,"month":"09","issue":"16","author":[{"orcid":"0000-0002-8314-0177","first_name":"Timothy D","full_name":"Browning, Timothy D","last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Heath Brown, Roger","first_name":"Roger","last_name":"Heath Brown"}],"volume":169,"day":"10","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1805.10715"}],"publication_identifier":{"issn":["0012-7094"]},"citation":{"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>.","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>.","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>","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.","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>"},"_id":"179","year":"2020","article_type":"original"},{"date_updated":"2023-08-22T11:03:00Z","status":"public","type":"preprint","arxiv":1,"doi":"10.48550/arXiv.2011.06630","external_id":{"arxiv":["2011.06630"]},"title":"Successful common envelope ejection and binary neutron star formation in 3D hydrodynamics","date_published":"2020-11-12T00:00:00Z","publication":"arXiv","language":[{"iso":"eng"}],"oa":1,"month":"11","date_created":"2023-08-21T10:10:41Z","oa_version":"Preprint","author":[{"last_name":"Jamie A. P. Law-Smith","first_name":"Jamie A. P. Law-Smith","full_name":"Jamie A. P. Law-Smith, Jamie A. P. Law-Smith"},{"full_name":"Everson, Rosa Wallace","first_name":"Rosa Wallace","last_name":"Everson"},{"last_name":"Enrico Ramirez-Ruiz","full_name":"Enrico Ramirez-Ruiz, Enrico Ramirez-Ruiz","first_name":"Enrico Ramirez-Ruiz"},{"last_name":"Mink","first_name":"Selma E. de","full_name":"Mink, Selma E. de"},{"last_name":"Son","first_name":"Lieke A. C. van","full_name":"Son, Lieke A. C. van"},{"id":"d0648d0c-0f64-11ee-a2e0-dd0faa2e4f7d","last_name":"Götberg","full_name":"Götberg, Ylva Louise Linsdotter","orcid":"0000-0002-6960-6911","first_name":"Ylva Louise Linsdotter"},{"full_name":"Zellmann, Stefan","first_name":"Stefan","last_name":"Zellmann"},{"first_name":"Alejandro Vigna-Gómez","full_name":"Alejandro Vigna-Gómez, Alejandro Vigna-Gómez","last_name":"Alejandro Vigna-Gómez"},{"last_name":"Renzo","full_name":"Renzo, Mathieu","first_name":"Mathieu"},{"last_name":"Wu","full_name":"Wu, Samantha","first_name":"Samantha"},{"last_name":"Schrøder","first_name":"Sophie L.","full_name":"Schrøder, Sophie L."},{"first_name":"Ryan J.","full_name":"Foley, Ryan J.","last_name":"Foley"},{"last_name":"Tenley Hutchinson-Smith","first_name":"Tenley Hutchinson-Smith","full_name":"Tenley Hutchinson-Smith, Tenley Hutchinson-Smith"}],"publication_status":"submitted","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2011.06630"}],"article_processing_charge":"No","day":"12","abstract":[{"lang":"eng","text":"A binary neutron star merger has been observed in a multi-messenger detection of gravitational wave (GW) and electromagnetic (EM) radiation. Binary neutron stars that merge within a Hubble time, as well as many other compact binaries, are expected to form via common envelope evolution. Yet five decades of research on common envelope evolution have not yet resulted in a satisfactory understanding of the multi-spatial multi-timescale evolution for the systems that lead to compact binaries. In this paper, we report on the first successful simulations of common envelope ejection leading to binary neutron star formation in 3D hydrodynamics. We simulate the dynamical inspiral phase of the interaction between a 12M⊙ red supergiant and a 1.4M⊙ neutron star for different initial separations and initial conditions. For all of our simulations, we find complete envelope ejection and final orbital separations of af≈1.3-5.1R⊙ depending on the simulation and criterion, leading to binary neutron stars that can merge within a Hubble time. We find αCE-equivalent efficiencies of ≈0.1-2.7 depending on the simulation and criterion, but this may be specific for these extended progenitors. We fully resolve the core of the star to ≲0.005R⊙ and our 3D hydrodynamics simulations are informed by an adjusted 1D analytic energy formalism and a 2D kinematics study in order to overcome the prohibitive computational cost of simulating these systems. The framework we develop in this paper can be used to simulate a wide variety of interactions between stars, from stellar mergers to common envelope episodes leading to GW sources."}],"citation":{"ista":"Jamie A. P. Law-Smith JAPL-S, Everson RW, Enrico Ramirez-Ruiz ER-R, Mink SE de, Son LAC van, Götberg YLL, Zellmann S, Alejandro Vigna-Gómez AV-G, Renzo M, Wu S, Schrøder SL, Foley RJ, Tenley Hutchinson-Smith TH-S. Successful common envelope ejection and binary neutron star formation in 3D hydrodynamics. arXiv, 2011.06630.","mla":"Jamie A. P. Law-Smith, Jamie A. P. Law-Smith, et al. “Successful Common Envelope Ejection and Binary Neutron Star Formation in 3D Hydrodynamics.” <i>ArXiv</i>, 2011.06630, doi:<a href=\"https://doi.org/10.48550/arXiv.2011.06630\">10.48550/arXiv.2011.06630</a>.","short":"J.A.P.L.-S. Jamie A. P. Law-Smith, R.W. Everson, E.R.-R. Enrico Ramirez-Ruiz, S.E. de Mink, L.A.C. van Son, Y.L.L. Götberg, S. Zellmann, A.V.-G. Alejandro Vigna-Gómez, M. Renzo, S. Wu, S.L. Schrøder, R.J. Foley, T.H.-S. Tenley Hutchinson-Smith, ArXiv (n.d.).","chicago":"Jamie A. P. Law-Smith, Jamie A. P. Law-Smith, Rosa Wallace Everson, Enrico Ramirez-Ruiz Enrico Ramirez-Ruiz, Selma E. de Mink, Lieke A. C. van Son, Ylva Louise Linsdotter Götberg, Stefan Zellmann, et al. “Successful Common Envelope Ejection and Binary Neutron Star Formation in 3D Hydrodynamics.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2011.06630\">https://doi.org/10.48550/arXiv.2011.06630</a>.","apa":"Jamie A. P. Law-Smith, J. A. P. L.-S., Everson, R. W., Enrico Ramirez-Ruiz, E. R.-R., Mink, S. E. de, Son, L. A. C. van, Götberg, Y. L. L., … Tenley Hutchinson-Smith, T. H.-S. (n.d.). Successful common envelope ejection and binary neutron star formation in 3D hydrodynamics. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2011.06630\">https://doi.org/10.48550/arXiv.2011.06630</a>","ieee":"J. A. P. L.-S. Jamie A. P. Law-Smith <i>et al.</i>, “Successful common envelope ejection and binary neutron star formation in 3D hydrodynamics,” <i>arXiv</i>. .","ama":"Jamie A. P. Law-Smith JAPL-S, Everson RW, Enrico Ramirez-Ruiz ER-R, et al. Successful common envelope ejection and binary neutron star formation in 3D hydrodynamics. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2011.06630\">10.48550/arXiv.2011.06630</a>"},"article_number":"2011.06630","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","_id":"14096"},{"citation":{"apa":"Schur, F. K. (2020). STL-files for 3D-printed grid holders described in  Fäßler F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:14592\">https://doi.org/10.15479/AT:ISTA:14592</a>","short":"F.K. Schur, (2020).","chicago":"Schur, Florian KM. “STL-Files for 3D-Printed Grid Holders Described in  Fäßler F, Zens B, et Al.; 3D Printed Cell Culture Grid Holders for Improved Cellular Specimen Preparation in Cryo-Electron Microscopy.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:14592\">https://doi.org/10.15479/AT:ISTA:14592</a>.","ama":"Schur FK. STL-files for 3D-printed grid holders described in  Fäßler F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:14592\">10.15479/AT:ISTA:14592</a>","ieee":"F. K. Schur, “STL-files for 3D-printed grid holders described in  Fäßler F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy.” Institute of Science and Technology Austria, 2020.","ista":"Schur FK. 2020. STL-files for 3D-printed grid holders described in  Fäßler F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:14592\">10.15479/AT:ISTA:14592</a>.","mla":"Schur, Florian KM. <i>STL-Files for 3D-Printed Grid Holders Described in  Fäßler F, Zens B, et Al.; 3D Printed Cell Culture Grid Holders for Improved Cellular Specimen Preparation in Cryo-Electron Microscopy</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:14592\">10.15479/AT:ISTA:14592</a>."},"year":"2020","_id":"14592","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"P33367","_id":"9B954C5C-BA93-11EA-9121-9846C619BF3A","name":"Structure and isoform diversity of the Arp2/3 complex"}],"file":[{"success":1,"content_type":"application/zip","date_created":"2023-11-22T14:58:44Z","file_id":"14593","relation":"main_file","file_size":49297,"file_name":"3Dprint-files_download_v2.zip","checksum":"0108616e2a59e51879ea51299a29b091","access_level":"open_access","creator":"fschur","date_updated":"2023-11-22T14:58:44Z"},{"date_created":"2023-12-01T10:39:59Z","content_type":"text/plain","success":1,"date_updated":"2023-12-01T10:39:59Z","creator":"cchlebak","checksum":"4c66ddedee4d01c1c4a7978208350cfc","access_level":"open_access","file_name":"readme.txt","relation":"main_file","file_id":"14637","file_size":641}],"abstract":[{"lang":"eng","text":"Cryo-electron microscopy (cryo-EM) of cellular specimens provides insights into biological processes and structures within a native context. However, a major challenge still lies in the efficient and reproducible preparation of adherent cells for subsequent cryo-EM analysis. This is due to the sensitivity of many cellular specimens to the varying seeding and culturing conditions required for EM experiments, the often limited amount of cellular material and also the fragility of EM grids and their substrate. Here, we present low-cost and reusable 3D printed grid holders, designed to improve specimen preparation when culturing challenging cellular samples directly on grids. The described grid holders increase cell culture reproducibility and throughput, and reduce the resources required for cell culturing. We show that grid holders can be integrated into various cryo-EM workflows, including micro-patterning approaches to control cell seeding on grids, and for generating samples for cryo-focused ion beam milling and cryo-electron tomography experiments. Their adaptable design allows for the generation of specialized grid holders customized to a large variety of applications."}],"day":"01","contributor":[{"contributor_type":"researcher","first_name":"Florian","orcid":"0000-0001-7149-769X","id":"404F5528-F248-11E8-B48F-1D18A9856A87","last_name":"Fäßler"},{"id":"45FD126C-F248-11E8-B48F-1D18A9856A87","last_name":"Zens","contributor_type":"researcher","first_name":"Bettina"},{"contributor_type":"researcher","first_name":"Robert","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","last_name":"Hauschild"},{"last_name":"Schur","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","first_name":"Florian KM","orcid":"0000-0003-4790-8078","contributor_type":"researcher"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"article_processing_charge":"No","oa":1,"month":"12","date_created":"2023-11-22T15:00:57Z","oa_version":"Published Version","date_published":"2020-12-01T00:00:00Z","ddc":["570"],"author":[{"full_name":"Schur, Florian KM","orcid":"0000-0003-4790-8078","first_name":"Florian KM","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","last_name":"Schur"}],"has_accepted_license":"1","type":"research_data","date_updated":"2024-02-21T12:44:48Z","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","publisher":"Institute of Science and Technology Austria","status":"public","title":"STL-files for 3D-printed grid holders described in  Fäßler F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy","file_date_updated":"2023-12-01T10:39:59Z","doi":"10.15479/AT:ISTA:14592","related_material":{"record":[{"relation":"research_data","id":"8586","status":"public"}]},"department":[{"_id":"FlSc"}]},{"volume":25,"article_processing_charge":"Yes","day":"01","publication_identifier":{"issn":["1431-0635"],"eissn":["1431-0643"]},"citation":{"ama":"Alt J, Erdös L, Krüger TH. The Dyson equation with linear self-energy: Spectral bands, edges and cusps. <i>Documenta Mathematica</i>. 2020;25:1421-1539. doi:<a href=\"https://doi.org/10.4171/dm/780\">10.4171/dm/780</a>","ieee":"J. Alt, L. Erdös, and T. H. Krüger, “The Dyson equation with linear self-energy: Spectral bands, edges and cusps,” <i>Documenta Mathematica</i>, vol. 25. EMS Press, pp. 1421–1539, 2020.","chicago":"Alt, Johannes, László Erdös, and Torben H Krüger. “The Dyson Equation with Linear Self-Energy: Spectral Bands, Edges and Cusps.” <i>Documenta Mathematica</i>. EMS Press, 2020. <a href=\"https://doi.org/10.4171/dm/780\">https://doi.org/10.4171/dm/780</a>.","short":"J. Alt, L. Erdös, T.H. Krüger, Documenta Mathematica 25 (2020) 1421–1539.","apa":"Alt, J., Erdös, L., &#38; Krüger, T. H. (2020). The Dyson equation with linear self-energy: Spectral bands, edges and cusps. <i>Documenta Mathematica</i>. EMS Press. <a href=\"https://doi.org/10.4171/dm/780\">https://doi.org/10.4171/dm/780</a>","mla":"Alt, Johannes, et al. “The Dyson Equation with Linear Self-Energy: Spectral Bands, Edges and Cusps.” <i>Documenta Mathematica</i>, vol. 25, EMS Press, 2020, pp. 1421–539, doi:<a href=\"https://doi.org/10.4171/dm/780\">10.4171/dm/780</a>.","ista":"Alt J, Erdös L, Krüger TH. 2020. The Dyson equation with linear self-energy: Spectral bands, edges and cusps. Documenta Mathematica. 25, 1421–1539."},"article_type":"original","_id":"14694","year":"2020","status":"public","date_updated":"2023-12-18T10:46:09Z","type":"journal_article","department":[{"_id":"LaEr"}],"related_material":{"record":[{"status":"public","id":"6183","relation":"earlier_version"}]},"external_id":{"arxiv":["1804.07752"]},"keyword":["General Mathematics"],"oa_version":"Published Version","month":"09","oa":1,"author":[{"id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","last_name":"Alt","full_name":"Alt, Johannes","first_name":"Johannes"},{"last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","orcid":"0000-0001-5366-9603","full_name":"Erdös, László"},{"last_name":"Krüger","id":"3020C786-F248-11E8-B48F-1D18A9856A87","first_name":"Torben H","orcid":"0000-0002-4821-3297","full_name":"Krüger, Torben H"}],"ddc":["510"],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"abstract":[{"text":"We study the unique solution m of the Dyson equation \\( -m(z)^{-1} = z\\1 - a + S[m(z)] \\) on a von Neumann algebra A with the constraint Imm≥0. Here, z lies in the complex upper half-plane, a is a self-adjoint element of A and S is a positivity-preserving linear operator on A. We show that m is the Stieltjes transform of a compactly supported A-valued measure on R. Under suitable assumptions, we establish that this measure has a uniformly 1/3-Hölder continuous density with respect to the Lebesgue measure, which is supported on finitely many intervals, called bands. In fact, the density is analytic inside the bands with a square-root growth at the edges and internal cubic root cusps whenever the gap between two bands vanishes. The shape of these singularities is universal and no other singularity may occur. We give a precise asymptotic description of m near the singular points. These asymptotics generalize the analysis at the regular edges given in the companion paper on the Tracy-Widom universality for the edge eigenvalue statistics for correlated random matrices [the first author et al., Ann. Probab. 48, No. 2, 963--1001 (2020; Zbl 1434.60017)] and they play a key role in the proof of the Pearcey universality at the cusp for Wigner-type matrices [G. Cipolloni et al., Pure Appl. Anal. 1, No. 4, 615--707 (2019; Zbl 07142203); the second author et al., Commun. Math. Phys. 378, No. 2, 1203--1278 (2020; Zbl 07236118)]. We also extend the finite dimensional band mass formula from [the first author et al., loc. cit.] to the von Neumann algebra setting by showing that the spectral mass of the bands is topologically rigid under deformations and we conclude that these masses are quantized in some important cases.","lang":"eng"}],"file":[{"file_size":1374708,"file_id":"14695","relation":"main_file","file_name":"2020_DocumentaMathematica_Alt.pdf","checksum":"12aacc1d63b852ff9a51c1f6b218d4a6","access_level":"open_access","creator":"dernst","date_updated":"2023-12-18T10:42:32Z","success":1,"date_created":"2023-12-18T10:42:32Z","content_type":"application/pdf"}],"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"        25","publisher":"EMS Press","doi":"10.4171/dm/780","page":"1421-1539","arxiv":1,"title":"The Dyson equation with linear self-energy: Spectral bands, edges and cusps","file_date_updated":"2023-12-18T10:42:32Z","date_published":"2020-09-01T00:00:00Z","date_created":"2023-12-18T10:37:43Z","language":[{"iso":"eng"}],"publication":"Documenta Mathematica","has_accepted_license":"1","publication_status":"published"}]