[{"ec_funded":1,"oa":1,"department":[{"_id":"LaEr"}],"citation":{"ama":"Cipolloni G, Erdös L. Fluctuations for differences of linear eigenvalue statistics for sample covariance matrices. <i>Random Matrices: Theory and Application</i>. 2020;9(3). doi:<a href=\"https://doi.org/10.1142/S2010326320500069\">10.1142/S2010326320500069</a>","ista":"Cipolloni G, Erdös L. 2020. Fluctuations for differences of linear eigenvalue statistics for sample covariance matrices. Random Matrices: Theory and Application. 9(3), 2050006.","short":"G. Cipolloni, L. Erdös, Random Matrices: Theory and Application 9 (2020).","chicago":"Cipolloni, Giorgio, and László Erdös. “Fluctuations for Differences of Linear Eigenvalue Statistics for Sample Covariance Matrices.” <i>Random Matrices: Theory and Application</i>. World Scientific Publishing, 2020. <a href=\"https://doi.org/10.1142/S2010326320500069\">https://doi.org/10.1142/S2010326320500069</a>.","mla":"Cipolloni, Giorgio, and László Erdös. “Fluctuations for Differences of Linear Eigenvalue Statistics for Sample Covariance Matrices.” <i>Random Matrices: Theory and Application</i>, vol. 9, no. 3, 2050006, World Scientific Publishing, 2020, doi:<a href=\"https://doi.org/10.1142/S2010326320500069\">10.1142/S2010326320500069</a>.","ieee":"G. Cipolloni and L. Erdös, “Fluctuations for differences of linear eigenvalue statistics for sample covariance matrices,” <i>Random Matrices: Theory and Application</i>, vol. 9, no. 3. World Scientific Publishing, 2020.","apa":"Cipolloni, G., &#38; Erdös, L. (2020). Fluctuations for differences of linear eigenvalue statistics for sample covariance matrices. <i>Random Matrices: Theory and Application</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S2010326320500069\">https://doi.org/10.1142/S2010326320500069</a>"},"publication":"Random Matrices: Theory and Application","isi":1,"scopus_import":"1","day":"01","date_created":"2019-05-26T21:59:14Z","intvolume":"         9","volume":9,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_number":"2050006","arxiv":1,"project":[{"call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems"},{"grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"abstract":[{"lang":"eng","text":"We prove a central limit theorem for the difference of linear eigenvalue statistics of a sample covariance matrix W˜ and its minor W. We find that the fluctuation of this difference is much smaller than those of the individual linear statistics, as a consequence of the strong correlation between the eigenvalues of W˜ and W. Our result identifies the fluctuation of the spatial derivative of the approximate Gaussian field in the recent paper by Dumitru and Paquette. Unlike in a similar result for Wigner matrices, for sample covariance matrices, the fluctuation may entirely vanish."}],"publication_status":"published","oa_version":"Preprint","publisher":"World Scientific Publishing","doi":"10.1142/S2010326320500069","title":"Fluctuations for differences of linear eigenvalue statistics for sample covariance matrices","status":"public","year":"2020","author":[{"orcid":"0000-0002-4901-7992","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","last_name":"Cipolloni","first_name":"Giorgio","full_name":"Cipolloni, Giorgio"},{"orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László","first_name":"László","last_name":"Erdös"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1806.08751"}],"type":"journal_article","date_published":"2020-07-01T00:00:00Z","quality_controlled":"1","language":[{"iso":"eng"}],"issue":"3","external_id":{"arxiv":["1806.08751"],"isi":["000547464400001"]},"date_updated":"2023-08-28T08:38:48Z","article_type":"original","publication_identifier":{"issn":["20103263"],"eissn":["20103271"]},"article_processing_charge":"No","month":"07","_id":"6488"},{"quality_controlled":"1","date_published":"2020-04-01T00:00:00Z","language":[{"iso":"eng"}],"page":"311-330","article_type":"original","external_id":{"arxiv":["1312.2337"],"isi":["000522437400004"]},"date_updated":"2023-08-17T13:50:44Z","publication_identifier":{"eissn":["16153383"],"issn":["16153375"]},"month":"04","article_processing_charge":"No","_id":"6563","oa_version":"Preprint","doi":"10.1007/s10208-019-09419-x","publisher":"Springer Nature","year":"2020","status":"public","title":"Are two given maps homotopic? An algorithmic viewpoint","author":[{"full_name":"Filakovský, Marek","first_name":"Marek","last_name":"Filakovský","id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Vokřínek","first_name":"Lukas","full_name":"Vokřínek, Lukas"}],"main_file_link":[{"url":"https://arxiv.org/abs/1312.2337","open_access":"1"}],"type":"journal_article","date_created":"2019-06-16T21:59:14Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","volume":20,"intvolume":"        20","arxiv":1,"project":[{"call_identifier":"FWF","_id":"26611F5C-B435-11E9-9278-68D0E5697425","grant_number":"P31312","name":"Algorithms for Embeddings and Homotopy Theory"}],"publication_status":"published","abstract":[{"text":"This paper presents two algorithms. The first decides the existence of a pointed homotopy between given simplicial maps 𝑓,𝑔:𝑋→𝑌, and the second computes the group [𝛴𝑋,𝑌]∗ of pointed homotopy classes of maps from a suspension; in both cases, the target Y is assumed simply connected. More generally, these algorithms work relative to 𝐴⊆𝑋.","lang":"eng"}],"oa":1,"citation":{"chicago":"Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.” <i>Foundations of Computational Mathematics</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s10208-019-09419-x\">https://doi.org/10.1007/s10208-019-09419-x</a>.","mla":"Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.” <i>Foundations of Computational Mathematics</i>, vol. 20, Springer Nature, 2020, pp. 311–30, doi:<a href=\"https://doi.org/10.1007/s10208-019-09419-x\">10.1007/s10208-019-09419-x</a>.","apa":"Filakovský, M., &#38; Vokřínek, L. (2020). Are two given maps homotopic? An algorithmic viewpoint. <i>Foundations of Computational Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10208-019-09419-x\">https://doi.org/10.1007/s10208-019-09419-x</a>","ieee":"M. Filakovský and L. Vokřínek, “Are two given maps homotopic? An algorithmic viewpoint,” <i>Foundations of Computational Mathematics</i>, vol. 20. Springer Nature, pp. 311–330, 2020.","ista":"Filakovský M, Vokřínek L. 2020. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. 20, 311–330.","ama":"Filakovský M, Vokřínek L. Are two given maps homotopic? An algorithmic viewpoint. <i>Foundations of Computational Mathematics</i>. 2020;20:311-330. doi:<a href=\"https://doi.org/10.1007/s10208-019-09419-x\">10.1007/s10208-019-09419-x</a>","short":"M. Filakovský, L. Vokřínek, Foundations of Computational Mathematics 20 (2020) 311–330."},"department":[{"_id":"UlWa"}],"publication":"Foundations of Computational Mathematics","isi":1,"day":"01","scopus_import":"1"},{"scopus_import":"1","day":"01","isi":1,"publication":"Numerical Algorithms","department":[{"_id":"VlKo"}],"citation":{"chicago":"Shehu, Yekini, Xiao-Huan Li, and Qiao-Li Dong. “An Efficient Projection-Type Method for Monotone Variational Inequalities in Hilbert Spaces.” <i>Numerical Algorithms</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s11075-019-00758-y\">https://doi.org/10.1007/s11075-019-00758-y</a>.","mla":"Shehu, Yekini, et al. “An Efficient Projection-Type Method for Monotone Variational Inequalities in Hilbert Spaces.” <i>Numerical Algorithms</i>, vol. 84, Springer Nature, 2020, pp. 365–88, doi:<a href=\"https://doi.org/10.1007/s11075-019-00758-y\">10.1007/s11075-019-00758-y</a>.","ieee":"Y. Shehu, X.-H. Li, and Q.-L. Dong, “An efficient projection-type method for monotone variational inequalities in Hilbert spaces,” <i>Numerical Algorithms</i>, vol. 84. Springer Nature, pp. 365–388, 2020.","apa":"Shehu, Y., Li, X.-H., &#38; Dong, Q.-L. (2020). An efficient projection-type method for monotone variational inequalities in Hilbert spaces. <i>Numerical Algorithms</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11075-019-00758-y\">https://doi.org/10.1007/s11075-019-00758-y</a>","ama":"Shehu Y, Li X-H, Dong Q-L. An efficient projection-type method for monotone variational inequalities in Hilbert spaces. <i>Numerical Algorithms</i>. 2020;84:365-388. doi:<a href=\"https://doi.org/10.1007/s11075-019-00758-y\">10.1007/s11075-019-00758-y</a>","ista":"Shehu Y, Li X-H, Dong Q-L. 2020. An efficient projection-type method for monotone variational inequalities in Hilbert spaces. Numerical Algorithms. 84, 365–388.","short":"Y. Shehu, X.-H. Li, Q.-L. Dong, Numerical Algorithms 84 (2020) 365–388."},"ec_funded":1,"oa":1,"publication_status":"published","abstract":[{"text":"We consider the monotone variational inequality problem in a Hilbert space and describe a projection-type method with inertial terms under the following properties: (a) The method generates a strongly convergent iteration sequence; (b) The method requires, at each iteration, only one projection onto the feasible set and two evaluations of the operator; (c) The method is designed for variational inequality for which the underline operator is monotone and uniformly continuous; (d) The method includes an inertial term. The latter is also shown to speed up the convergence in our numerical results. A comparison with some related methods is given and indicates that the new method is promising.","lang":"eng"}],"project":[{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":"        84","volume":84,"date_created":"2019-06-27T20:09:33Z","type":"journal_article","file_date_updated":"2020-07-14T12:47:34Z","author":[{"orcid":"0000-0001-9224-7139","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","full_name":"Shehu, Yekini","first_name":"Yekini","last_name":"Shehu"},{"last_name":"Li","first_name":"Xiao-Huan","full_name":"Li, Xiao-Huan"},{"last_name":"Dong","first_name":"Qiao-Li","full_name":"Dong, Qiao-Li"}],"acknowledgement":"The research of this author is supported by the ERC grant at the IST.","title":"An efficient projection-type method for monotone variational inequalities in Hilbert spaces","year":"2020","status":"public","doi":"10.1007/s11075-019-00758-y","ddc":["000"],"publisher":"Springer Nature","has_accepted_license":"1","oa_version":"Submitted Version","_id":"6593","month":"05","article_processing_charge":"No","publication_identifier":{"issn":["1017-1398"],"eissn":["1572-9265"]},"article_type":"original","external_id":{"isi":["000528979000015"]},"date_updated":"2023-08-17T13:51:18Z","page":"365-388","file":[{"content_type":"application/pdf","relation":"main_file","checksum":"bb1a1eb3ebb2df380863d0db594673ba","access_level":"open_access","file_name":"ExtragradientMethodPaper.pdf","file_id":"6927","creator":"kschuh","date_created":"2019-10-01T13:14:10Z","date_updated":"2020-07-14T12:47:34Z","file_size":359654}],"language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2020-05-01T00:00:00Z"},{"publisher":"Curran Associates","citation":{"ieee":"F. Locatello <i>et al.</i>, “Object-centric learning with slot attention,” in <i>Advances in Neural Information Processing Systems</i>, Virtual, 2020, vol. 33, pp. 11525–11538.","apa":"Locatello, F., Weissenborn, D., Unterthiner, T., Mahendran, A., Heigold, G., Uszkoreit, J., … Kipf, T. (2020). Object-centric learning with slot attention. In <i>Advances in Neural Information Processing Systems</i> (Vol. 33, pp. 11525–11538). Virtual: Curran Associates.","mla":"Locatello, Francesco, et al. “Object-Centric Learning with Slot Attention.” <i>Advances in Neural Information Processing Systems</i>, vol. 33, Curran Associates, 2020, pp. 11525–38.","chicago":"Locatello, Francesco, Dirk Weissenborn, Thomas Unterthiner, Aravindh Mahendran, Georg Heigold, Jakob Uszkoreit, Alexey Dosovitskiy, and Thomas Kipf. “Object-Centric Learning with Slot Attention.” In <i>Advances in Neural Information Processing Systems</i>, 33:11525–38. Curran Associates, 2020.","short":"F. Locatello, D. Weissenborn, T. Unterthiner, A. Mahendran, G. Heigold, J. Uszkoreit, A. Dosovitskiy, T. Kipf, in:, Advances in Neural Information Processing Systems, Curran Associates, 2020, pp. 11525–11538.","ama":"Locatello F, Weissenborn D, Unterthiner T, et al. Object-centric learning with slot attention. In: <i>Advances in Neural Information Processing Systems</i>. Vol 33. Curran Associates; 2020:11525-11538.","ista":"Locatello F, Weissenborn D, Unterthiner T, Mahendran A, Heigold G, Uszkoreit J, Dosovitskiy A, Kipf T. 2020. Object-centric learning with slot attention. Advances in Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 33, 11525–11538."},"department":[{"_id":"FrLo"}],"status":"public","title":"Object-centric learning with slot attention","year":"2020","publication":"Advances in Neural Information Processing Systems","oa_version":"Preprint","oa":1,"conference":{"location":"Virtual","start_date":"2020-12-06","name":"NeurIPS: Neural Information Processing Systems","end_date":"2020-12-12"},"type":"conference","author":[{"orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco","first_name":"Francesco","last_name":"Locatello"},{"full_name":"Weissenborn, Dirk","first_name":"Dirk","last_name":"Weissenborn"},{"full_name":"Unterthiner, Thomas","first_name":"Thomas","last_name":"Unterthiner"},{"full_name":"Mahendran, Aravindh","last_name":"Mahendran","first_name":"Aravindh"},{"first_name":"Georg","last_name":"Heigold","full_name":"Heigold, Georg"},{"full_name":"Uszkoreit, Jakob","last_name":"Uszkoreit","first_name":"Jakob"},{"first_name":"Alexey","last_name":"Dosovitskiy","full_name":"Dosovitskiy, Alexey"},{"last_name":"Kipf","first_name":"Thomas","full_name":"Kipf, Thomas"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2006.15055"}],"page":"11525-11538","extern":"1","date_updated":"2023-09-13T12:19:19Z","external_id":{"arxiv":["2006.15055"]},"date_created":"2023-09-13T12:03:46Z","quality_controlled":"1","date_published":"2020-01-01T00:00:00Z","language":[{"iso":"eng"}],"volume":33,"intvolume":"        33","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","publication_status":"published","abstract":[{"lang":"eng","text":"Learning object-centric representations of complex scenes is a promising step towards enabling efficient abstract reasoning from low-level perceptual features. Yet, most deep learning approaches learn distributed representations that do not capture the compositional properties of natural scenes. In this paper, we present the Slot Attention module, an architectural component that interfaces with perceptual representations such as the output of a convolutional neural network and produces a set of task-dependent abstract representations which we call slots. These slots are exchangeable and can bind to any object in the input by specializing through a competitive procedure over multiple rounds of attention. We empirically demonstrate that Slot Attention can extract object-centric representations that enable generalization to unseen compositions when trained on unsupervised object discovery and supervised property prediction tasks.\r\n\r\n"}],"_id":"14326","arxiv":1,"publication_identifier":{"isbn":["9781713829546"]}},{"type":"research_data","day":"01","related_material":{"record":[{"id":"8586","relation":"research_data","status":"public"}]},"author":[{"orcid":"0000-0003-4790-8078","last_name":"Schur","first_name":"Florian KM","full_name":"Schur, Florian KM","id":"48AD8942-F248-11E8-B48F-1D18A9856A87"}],"file_date_updated":"2023-12-01T10:39:59Z","ddc":["570"],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"FlSc"}],"citation":{"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.","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>","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>.","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>.","short":"F.K. Schur, (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>.","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>"},"doi":"10.15479/AT:ISTA:14592","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","status":"public","year":"2020","oa":1,"oa_version":"Published Version","has_accepted_license":"1","tmp":{"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)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"article_processing_charge":"No","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."}],"month":"12","_id":"14592","contributor":[{"id":"404F5528-F248-11E8-B48F-1D18A9856A87","contributor_type":"researcher","first_name":"Florian","last_name":"Fäßler","orcid":"0000-0001-7149-769X"},{"contributor_type":"researcher","first_name":"Bettina","last_name":"Zens","id":"45FD126C-F248-11E8-B48F-1D18A9856A87"},{"id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","contributor_type":"researcher","last_name":"Hauschild","first_name":"Robert"},{"contributor_type":"researcher","first_name":"Florian KM","last_name":"Schur","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4790-8078"}],"project":[{"grant_number":"P33367","_id":"9B954C5C-BA93-11EA-9121-9846C619BF3A","name":"Structure and isoform diversity of the Arp2/3 complex"}],"file":[{"relation":"main_file","access_level":"open_access","checksum":"0108616e2a59e51879ea51299a29b091","file_name":"3Dprint-files_download_v2.zip","content_type":"application/zip","date_updated":"2023-11-22T14:58:44Z","file_size":49297,"success":1,"file_id":"14593","creator":"fschur","date_created":"2023-11-22T14:58:44Z"},{"file_size":641,"date_updated":"2023-12-01T10:39:59Z","date_created":"2023-12-01T10:39:59Z","success":1,"creator":"cchlebak","file_id":"14637","file_name":"readme.txt","access_level":"open_access","checksum":"4c66ddedee4d01c1c4a7978208350cfc","relation":"main_file","content_type":"text/plain"}],"date_updated":"2024-02-21T12:44:48Z","date_published":"2020-12-01T00:00:00Z","date_created":"2023-11-22T15:00:57Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"language":[{"iso":"eng"}],"date_published":"2020-09-01T00:00:00Z","quality_controlled":"1","date_updated":"2023-12-18T10:46:09Z","external_id":{"arxiv":["1804.07752"]},"article_type":"original","file":[{"date_updated":"2023-12-18T10:42:32Z","file_size":1374708,"file_id":"14695","creator":"dernst","success":1,"date_created":"2023-12-18T10:42:32Z","checksum":"12aacc1d63b852ff9a51c1f6b218d4a6","access_level":"open_access","relation":"main_file","file_name":"2020_DocumentaMathematica_Alt.pdf","content_type":"application/pdf"}],"page":"1421-1539","publication_identifier":{"eissn":["1431-0643"],"issn":["1431-0635"]},"_id":"14694","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_processing_charge":"Yes","month":"09","has_accepted_license":"1","oa_version":"Published Version","year":"2020","title":"The Dyson equation with linear self-energy: Spectral bands, edges and cusps","status":"public","ddc":["510"],"publisher":"EMS Press","doi":"10.4171/dm/780","file_date_updated":"2023-12-18T10:42:32Z","author":[{"first_name":"Johannes","last_name":"Alt","full_name":"Alt, Johannes","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","first_name":"László","full_name":"Erdös, László","orcid":"0000-0001-5366-9603"},{"orcid":"0000-0002-4821-3297","id":"3020C786-F248-11E8-B48F-1D18A9856A87","full_name":"Krüger, Torben H","first_name":"Torben H","last_name":"Krüger"}],"type":"journal_article","volume":25,"intvolume":"        25","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2023-12-18T10:37:43Z","arxiv":1,"publication_status":"published","abstract":[{"lang":"eng","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."}],"oa":1,"publication":"Documenta Mathematica","keyword":["General Mathematics"],"department":[{"_id":"LaEr"}],"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>","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.","short":"J. Alt, L. Erdös, T.H. Krüger, Documenta Mathematica 25 (2020) 1421–1539.","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.","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>","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>.","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>."},"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"6183"}]},"day":"01"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"         2","volume":2,"date_created":"2024-01-28T23:01:44Z","arxiv":1,"publication_status":"published","abstract":[{"lang":"eng","text":"We give the first mathematically rigorous justification of the local density approximation in density functional theory. We provide a quantitative estimate on the difference between the grand-canonical Levy–Lieb energy of a given density (the lowest possible energy of all quantum states having this density) and the integral over the uniform electron gas energy of this density. The error involves gradient terms and justifies the use of the local density approximation in the situation where the density is very flat on sufficiently large regions in space."}],"oa":1,"publication":"Pure and Applied Analysis","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>","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.","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>.","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>.","ista":"Lewin M, Lieb EH, Seiringer R. 2020.  The local density approximation in density functional theory. Pure and Applied Analysis. 2(1), 35–73.","ama":"Lewin M, Lieb EH, Seiringer R.  The local density approximation in density functional theory. <i>Pure and Applied Analysis</i>. 2020;2(1):35-73. doi:<a href=\"https://doi.org/10.2140/paa.2020.2.35\">10.2140/paa.2020.2.35</a>","short":"M. Lewin, E.H. Lieb, R. Seiringer, Pure and Applied Analysis 2 (2020) 35–73."},"day":"01","scopus_import":"1","language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2020-01-01T00:00:00Z","article_type":"original","date_updated":"2024-01-29T09:01:12Z","external_id":{"arxiv":["1903.04046"]},"page":"35-73","issue":"1","publication_identifier":{"issn":["2578-5893"],"eissn":["2578-5885"]},"_id":"14891","month":"01","article_processing_charge":"No","oa_version":"Preprint","year":"2020","status":"public","title":" The local density approximation in density functional theory","doi":"10.2140/paa.2020.2.35","publisher":"Mathematical Sciences Publishers","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1903.04046","open_access":"1"}],"author":[{"first_name":"Mathieu","last_name":"Lewin","full_name":"Lewin, Mathieu"},{"last_name":"Lieb","first_name":"Elliott H.","full_name":"Lieb, Elliott H."},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","first_name":"Robert","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521"}],"type":"journal_article"},{"publication_identifier":{"issn":["0022-2836"]},"_id":"15036","article_processing_charge":"No","month":"10","language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2020-10-02T00:00:00Z","external_id":{"pmid":["32910969"]},"date_updated":"2024-02-28T12:37:54Z","article_type":"original","issue":"21","page":"5784-5801","main_file_link":[{"url":"https://doi.org/10.1016/j.jmb.2020.09.001","open_access":"1"}],"author":[{"full_name":"Rosa, Higor Vinícius Dias","first_name":"Higor Vinícius Dias","last_name":"Rosa"},{"first_name":"Diego Antonio","last_name":"Leonardo","full_name":"Leonardo, Diego Antonio"},{"id":"D96FFDA0-A884-11E9-9968-DC26E6697425","full_name":"Brognara, Gabriel","last_name":"Brognara","first_name":"Gabriel"},{"last_name":"Brandão-Neto","first_name":"José","full_name":"Brandão-Neto, José"},{"first_name":"Humberto","last_name":"D'Muniz Pereira","full_name":"D'Muniz Pereira, Humberto"},{"first_name":"Ana Paula Ulian","last_name":"Araújo","full_name":"Araújo, Ana Paula Ulian"},{"full_name":"Garratt, Richard Charles","first_name":"Richard Charles","last_name":"Garratt"}],"type":"journal_article","oa_version":"Published Version","year":"2020","title":"Molecular recognition at septin interfaces: The switches hold the key","status":"public","publisher":"Elsevier","doi":"10.1016/j.jmb.2020.09.001","abstract":[{"lang":"eng","text":"The assembly of a septin filament requires that homologous monomers must distinguish between one another in establishing appropriate interfaces with their neighbors. To understand this phenomenon at the molecular level, we present the first four crystal structures of heterodimeric septin complexes. We describe in detail the two distinct types of G-interface present within the octameric particles, which must polymerize to form filaments. These are formed between SEPT2 and SEPT6 and between SEPT7 and SEPT3, and their description permits an understanding of the structural basis for the selectivity necessary for correct filament assembly. By replacing SEPT6 by SEPT8 or SEPT11, it is possible to rationalize Kinoshita's postulate, which predicts the exchangeability of septins from within a subgroup. Switches I and II, which in classical small GTPases provide a mechanism for nucleotide-dependent conformational change, have been repurposed in septins to play a fundamental role in molecular recognition. Specifically, it is switch I which holds the key to discriminating between the two different G-interfaces. Moreover, residues which are characteristic for a given subgroup play subtle, but pivotal, roles in guaranteeing that the correct interfaces are formed."}],"publication_status":"published","intvolume":"       432","volume":432,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2024-02-28T08:50:34Z","pmid":1,"day":"02","oa":1,"publication":"Journal of Molecular Biology","keyword":["Molecular Biology","Structural Biology"],"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>","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.","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.","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>","ieee":"H. V. D. Rosa <i>et al.</i>, “Molecular recognition at septin interfaces: The switches hold the key,” <i>Journal of Molecular Biology</i>, vol. 432, no. 21. Elsevier, pp. 5784–5801, 2020.","chicago":"Rosa, Higor Vinícius Dias, Diego Antonio Leonardo, Gabriel Brognara, José Brandão-Neto, Humberto D’Muniz Pereira, Ana Paula Ulian Araújo, and Richard Charles Garratt. “Molecular Recognition at Septin Interfaces: The Switches Hold the Key.” <i>Journal of Molecular Biology</i>. Elsevier, 2020. <a href=\"https://doi.org/10.1016/j.jmb.2020.09.001\">https://doi.org/10.1016/j.jmb.2020.09.001</a>.","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>."},"department":[{"_id":"MaLo"}]},{"type":"journal_article","file_date_updated":"2024-02-28T12:39:56Z","author":[{"full_name":"Moulinier-Anzola, Jeanette","last_name":"Moulinier-Anzola","first_name":"Jeanette"},{"full_name":"Schwihla, Maximilian","last_name":"Schwihla","first_name":"Maximilian"},{"first_name":"Lucinda","last_name":"De-Araújo","full_name":"De-Araújo, Lucinda"},{"full_name":"Artner, Christina","last_name":"Artner","first_name":"Christina","id":"45DF286A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Jörg","first_name":"Lisa","full_name":"Jörg, Lisa"},{"full_name":"Konstantinova, Nataliia","first_name":"Nataliia","last_name":"Konstantinova"},{"first_name":"Christian","last_name":"Luschnig","full_name":"Luschnig, Christian"},{"last_name":"Korbei","first_name":"Barbara","full_name":"Korbei, Barbara"}],"year":"2020","status":"public","title":"TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants","doi":"10.1016/j.molp.2020.02.012","publisher":"Elsevier","ddc":["580"],"has_accepted_license":"1","oa_version":"Published Version","_id":"15037","month":"05","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_processing_charge":"No","publication_identifier":{"issn":["1674-2052"]},"article_type":"original","external_id":{"pmid":["32087370"]},"date_updated":"2024-02-28T12:41:52Z","page":"717-731","issue":"5","file":[{"date_updated":"2024-02-28T12:39:56Z","file_size":3089212,"file_id":"15038","creator":"dernst","success":1,"date_created":"2024-02-28T12:39:56Z","relation":"main_file","checksum":"c538a5008f7827f62d17d40a3bfabe65","access_level":"open_access","file_name":"2020_MolecularPlant_MoulinierAnzola.pdf","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2020-05-04T00:00:00Z","day":"04","publication":"Molecular Plant","citation":{"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>.","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>.","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>","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.","short":"J. Moulinier-Anzola, M. Schwihla, L. De-Araújo, C. Artner, L. Jörg, N. Konstantinova, C. Luschnig, B. Korbei, Molecular Plant 13 (2020) 717–731.","ista":"Moulinier-Anzola J, Schwihla M, De-Araújo L, Artner C, Jörg L, Konstantinova N, Luschnig C, Korbei B. 2020. TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants. Molecular Plant. 13(5), 717–731.","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>"},"department":[{"_id":"EvBe"}],"keyword":["Plant Science","Molecular Biology"],"oa":1,"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"}],"publication_status":"published","pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"        13","volume":13,"date_created":"2024-02-28T08:55:56Z"},{"language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2020-04-03T00:00:00Z","article_type":"original","external_id":{"arxiv":["2002.12086"]},"date_updated":"2024-03-04T08:30:16Z","issue":"06","page":"9794-9801","publication_identifier":{"issn":["2374-3468"]},"_id":"15055","month":"04","article_processing_charge":"No","oa_version":"Preprint","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.","status":"public","year":"2020","title":"Reinforcement learning of risk-constrained policies in Markov decision processes","doi":"10.1609/aaai.v34i06.6531","publisher":"Association for the Advancement of Artificial Intelligence","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2002.12086","open_access":"1"}],"author":[{"full_name":"Brázdil, Tomáš","first_name":"Tomáš","last_name":"Brázdil"},{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Petr","last_name":"Novotný","full_name":"Novotný, Petr"},{"full_name":"Vahala, Jiří","first_name":"Jiří","last_name":"Vahala"}],"conference":{"location":"New York, NY, United States","start_date":"2020-02-07","end_date":"2020-02-12","name":"AAAI: Conference on Artificial Intelligence"},"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"        34","volume":34,"date_created":"2024-03-04T08:07:22Z","project":[{"name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"arxiv":1,"publication_status":"published","abstract":[{"text":"<jats:p>Markov decision processes (MDPs) are the defacto framework for sequential decision making in the presence of stochastic uncertainty. A classical optimization criterion for MDPs is to maximize the expected discounted-sum payoff, which ignores low probability catastrophic events with highly negative impact on the system. On the other hand, risk-averse policies require the probability of undesirable events to be below a given threshold, but they do not account for optimization of the expected payoff. We consider MDPs with discounted-sum payoff with failure states which represent catastrophic outcomes. The objective of risk-constrained planning is to maximize the expected discounted-sum payoff among risk-averse policies that ensure the probability to encounter a failure state is below a desired threshold. Our main contribution is an efficient risk-constrained planning algorithm that combines UCT-like search with a predictor learned through interaction with the MDP (in the style of AlphaZero) and with a risk-constrained action selection via linear programming. We demonstrate the effectiveness of our approach with experiments on classical MDPs from the literature, including benchmarks with an order of 106 states.</jats:p>","lang":"eng"}],"oa":1,"publication":"Proceedings of the 34th AAAI Conference on Artificial Intelligence","citation":{"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>","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.","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>.","mla":"Brázdil, Tomáš, et al. “Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes.” <i>Proceedings of the 34th AAAI Conference on Artificial Intelligence</i>, vol. 34, no. 06, Association for the Advancement of Artificial Intelligence, 2020, pp. 9794–801, doi:<a href=\"https://doi.org/10.1609/aaai.v34i06.6531\">10.1609/aaai.v34i06.6531</a>.","apa":"Brázdil, T., Chatterjee, K., Novotný, P., &#38; Vahala, J. (2020). Reinforcement learning of risk-constrained policies in Markov decision processes. <i>Proceedings of the 34th AAAI Conference on Artificial Intelligence</i>. New York, NY, United States: Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v34i06.6531\">https://doi.org/10.1609/aaai.v34i06.6531</a>","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."},"department":[{"_id":"KrCh"}],"keyword":["General Medicine"],"day":"03"},{"volume":6,"intvolume":"         6","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2024-03-04T09:41:57Z","abstract":[{"lang":"eng","text":"Vaccinia virus–related kinase (VRK) is an evolutionarily conserved nuclear protein kinase. VRK-1, the single Caenorhabditis elegans VRK ortholog, functions in cell division and germline proliferation. However, the role of VRK-1 in postmitotic cells and adult life span remains unknown. Here, we show that VRK-1 increases organismal longevity by activating the cellular energy sensor, AMP-activated protein kinase (AMPK), via direct phosphorylation. We found that overexpression of vrk-1 in the soma of adult C. elegans increased life span and, conversely, inhibition of vrk-1 decreased life span. In addition, vrk-1 was required for longevity conferred by mutations that inhibit C. elegans mitochondrial respiration, which requires AMPK. VRK-1 directly phosphorylated and up-regulated AMPK in both C. elegans and cultured human cells. Thus, our data show that the somatic nuclear kinase, VRK-1, promotes longevity through AMPK activation, and this function appears to be conserved between C. elegans and humans."}],"publication_status":"published","article_number":"aaw7824","publication":"Science Advances","citation":{"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).","ista":"Park S, Artan M, Han SH, Park H-EH, Jung Y, Hwang AB, Shin WS, Kim K-T, Lee S-JV. 2020. VRK-1 extends life span by activation of AMPK via phosphorylation. Science Advances. 6(27), aaw7824.","ama":"Park S, Artan M, Han SH, et al. VRK-1 extends life span by activation of AMPK via phosphorylation. <i>Science Advances</i>. 2020;6(27). doi:<a href=\"https://doi.org/10.1126/sciadv.aaw7824\">10.1126/sciadv.aaw7824</a>","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>.","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>.","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>","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."},"department":[{"_id":"MaDe"}],"oa":1,"day":"01","date_updated":"2024-03-04T09:52:09Z","article_type":"original","file":[{"content_type":"application/pdf","access_level":"open_access","checksum":"a37157cd0de709dce5fe03f4a31cd0b6","relation":"main_file","file_name":"2020_ScienceAdvances_Park.pdf","success":1,"creator":"dernst","file_id":"15058","date_created":"2024-03-04T09:46:41Z","date_updated":"2024-03-04T09:46:41Z","file_size":1864415}],"issue":"27","language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2020-07-01T00:00:00Z","_id":"15057","article_processing_charge":"No","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"month":"07","publication_identifier":{"eissn":["2375-2548"]},"title":"VRK-1 extends life span by activation of AMPK via phosphorylation","status":"public","year":"2020","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. ","publisher":"American Association for the Advancement of Science","ddc":["570"],"doi":"10.1126/sciadv.aaw7824","oa_version":"Published Version","has_accepted_license":"1","type":"journal_article","file_date_updated":"2024-03-04T09:46:41Z","author":[{"full_name":"Park, Sangsoon","last_name":"Park","first_name":"Sangsoon"},{"id":"C407B586-6052-11E9-B3AE-7006E6697425","first_name":"Murat","last_name":"Artan","full_name":"Artan, Murat","orcid":"0000-0001-8945-6992"},{"first_name":"Seung Hyun","last_name":"Han","full_name":"Han, 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"},{"full_name":"Shin, Won Sik","last_name":"Shin","first_name":"Won Sik"},{"last_name":"Kim","first_name":"Kyong-Tai","full_name":"Kim, Kyong-Tai"},{"full_name":"Lee, Seung-Jae V.","last_name":"Lee","first_name":"Seung-Jae V."}]},{"publisher":"IEEE","citation":{"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>.","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>.","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>","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.","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.","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."},"department":[{"_id":"JoFi"}],"doi":"10.23919/eucap48036.2020.9135962","status":"public","publication":"14th European Conference on Antennas and Propagation","year":"2020","title":"Compact millimeter and submillimeter-wave photonic radiometer for cubesats","acknowledgement":"This work has been financially supported by Comunidad de Madrid S2018/NMT-4333 ARTINLARA-CM projects, and “FUNDACIÓN SENER” REFTA projects.","oa_version":"None","type":"conference","conference":{"location":"Copenhagen, Denmark","start_date":"2020-03-15","name":"EuCAP: European Conference on Antennas and Propagation","end_date":"2020-03-20"},"day":"08","author":[{"last_name":"Wasiak","first_name":"Michal","full_name":"Wasiak, Michal"},{"full_name":"Botello, Gabriel Santamaria","first_name":"Gabriel Santamaria","last_name":"Botello"},{"full_name":"Abdalmalak, Kerlos Atia","first_name":"Kerlos Atia","last_name":"Abdalmalak"},{"last_name":"Sedlmeir","first_name":"Florian","full_name":"Sedlmeir, Florian"},{"full_name":"Rueda Sanchez, Alfredo R","last_name":"Rueda Sanchez","first_name":"Alfredo R","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6249-5860"},{"first_name":"Daniel","last_name":"Segovia-Vargas","full_name":"Segovia-Vargas, Daniel"},{"full_name":"Schwefel, Harald G. L.","last_name":"Schwefel","first_name":"Harald G. L."},{"full_name":"Munoz, Luis Enrique Garcia","last_name":"Munoz","first_name":"Luis Enrique Garcia"}],"date_updated":"2024-03-04T10:02:49Z","quality_controlled":"1","date_created":"2024-03-04T09:57:48Z","date_published":"2020-07-08T00:00:00Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","publication_status":"published","abstract":[{"lang":"eng","text":"In this paper we present a room temperature radiometer that can eliminate the need of using cryostats in satellite payload reducing its weight and improving reliability. The proposed radiometer is based on an electro-optic upconverter that boosts up microwave photons energy by upconverting them into an optical domain what makes them immune to thermal noise even if operating at room temperature. The converter uses a high-quality factor whispering gallery\r\nmode (WGM) resonator providing naturally narrow bandwidth and therefore might be useful for applications like microwave hyperspectral sensing. The upconversion process is explained by\r\nproviding essential information about photon conversion efficiency and sensitivity. To prove the concept, we describe an experiment which shows state-of-the-art photon conversion efficiency n=10-5 per mW of pump power at the frequency of 80 GHz."}],"month":"07","_id":"15059","publication_identifier":{"eisbn":["9788831299008"]}},{"day":"08","acknowledged_ssus":[{"_id":"LifeSc"}],"department":[{"_id":"CaBe"}],"citation":{"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.","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>.","mla":"Pinotsis, Nikos, et al. “Calcium Modulates the Domain Flexibility and Function of an α-Actinin Similar to the Ancestral α-Actinin.” <i>Proceedings of the National Academy of Sciences</i>, vol. 117, no. 36, Proceedings of the National Academy of Sciences, 2020, pp. 22101–12, doi:<a href=\"https://doi.org/10.1073/pnas.1917269117\">10.1073/pnas.1917269117</a>.","apa":"Pinotsis, N., Zielinska, K., Babuta, M., Arolas, J. L., Kostan, J., Khan, M. B., … Djinovic-Carugo, K. (2020). Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin. <i>Proceedings of the National Academy of Sciences</i>. Proceedings of the National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1917269117\">https://doi.org/10.1073/pnas.1917269117</a>","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."},"publication":"Proceedings of the National Academy of Sciences","oa":1,"abstract":[{"text":"The actin cytoskeleton, a dynamic network of actin filaments and associated F-actin–binding proteins, is fundamentally important in eukaryotes. α-Actinins are major F-actin bundlers that are inhibited by Ca2+ in nonmuscle cells. Here we report the mechanism of Ca2+-mediated regulation of Entamoeba histolytica α-actinin-2 (EhActn2) with features expected for the common ancestor of Entamoeba and higher eukaryotic α-actinins. Crystal structures of Ca2+-free and Ca2+-bound EhActn2 reveal a calmodulin-like domain (CaMD) uniquely inserted within the rod domain. Integrative studies reveal an exceptionally high affinity of the EhActn2 CaMD for Ca2+, binding of which can only be regulated in the presence of physiological concentrations of Mg2+. Ca2+ binding triggers an increase in protein multidomain rigidity, reducing conformational flexibility of F-actin–binding domains via interdomain cross-talk and consequently inhibiting F-actin bundling. In vivo studies uncover that EhActn2 plays an important role in phagocytic cup formation and might constitute a new drug target for amoebic dysentery.","lang":"eng"}],"publication_status":"published","pmid":1,"date_created":"2024-03-04T10:03:52Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":117,"intvolume":"       117","type":"journal_article","author":[{"full_name":"Pinotsis, Nikos","last_name":"Pinotsis","first_name":"Nikos"},{"full_name":"Zielinska, Karolina","first_name":"Karolina","last_name":"Zielinska"},{"last_name":"Babuta","first_name":"Mrigya","full_name":"Babuta, Mrigya"},{"full_name":"Arolas, Joan L.","first_name":"Joan L.","last_name":"Arolas"},{"full_name":"Kostan, Julius","first_name":"Julius","last_name":"Kostan"},{"full_name":"Khan, Muhammad Bashir","last_name":"Khan","first_name":"Muhammad Bashir"},{"full_name":"Schreiner, Claudia","last_name":"Schreiner","first_name":"Claudia"},{"full_name":"Testa Salmazo, Anita P","last_name":"Testa Salmazo","first_name":"Anita P","id":"41F1F098-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ciccarelli, Luciano","first_name":"Luciano","last_name":"Ciccarelli"},{"full_name":"Puchinger, Martin","last_name":"Puchinger","first_name":"Martin"},{"last_name":"Gkougkoulia","first_name":"Eirini A.","full_name":"Gkougkoulia, Eirini A."},{"full_name":"Ribeiro, Euripedes de Almeida","first_name":"Euripedes de Almeida","last_name":"Ribeiro"},{"last_name":"Marlovits","first_name":"Thomas C.","full_name":"Marlovits, Thomas C."},{"full_name":"Bhattacharya, Alok","last_name":"Bhattacharya","first_name":"Alok"},{"first_name":"Kristina","last_name":"Djinovic-Carugo","full_name":"Djinovic-Carugo, Kristina"}],"main_file_link":[{"url":"https://doi.org/10.1073/pnas.191726911","open_access":"1"}],"doi":"10.1073/pnas.1917269117","publisher":"Proceedings of the National Academy of Sciences","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. ","status":"public","year":"2020","title":"Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin","oa_version":"Published Version","month":"09","article_processing_charge":"No","_id":"15061","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"page":"22101-22112","issue":"36","article_type":"original","external_id":{"pmid":["32848067"]},"date_updated":"2024-03-04T10:14:44Z","quality_controlled":"1","date_published":"2020-09-08T00:00:00Z","language":[{"iso":"eng"}]},{"_id":"15063","article_processing_charge":"No","month":"11","publication_identifier":{"issn":["2690-1005","2690-0998"]},"external_id":{"arxiv":["1908.01653"]},"date_updated":"2024-03-04T10:33:15Z","article_type":"original","issue":"1","page":"101-146","language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2020-11-16T00:00:00Z","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1908.01653"}],"author":[{"full_name":"Cipolloni, Giorgio","first_name":"Giorgio","last_name":"Cipolloni","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4901-7992"},{"orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","first_name":"László","full_name":"Erdös, László"},{"id":"408ED176-F248-11E8-B48F-1D18A9856A87","first_name":"Dominik J","last_name":"Schröder","full_name":"Schröder, Dominik J","orcid":"0000-0002-2904-1856"}],"year":"2020","status":"public","title":"Optimal lower bound on the least singular value of the shifted Ginibre ensemble","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","publisher":"Mathematical Sciences Publishers","doi":"10.2140/pmp.2020.1.101","oa_version":"Preprint","publication_status":"published","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"}],"project":[{"grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"}],"arxiv":1,"volume":1,"intvolume":"         1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2024-03-04T10:27:57Z","scopus_import":"1","day":"16","publication":"Probability and Mathematical Physics","keyword":["General Medicine"],"department":[{"_id":"LaEr"}],"citation":{"short":"G. Cipolloni, L. Erdös, D.J. Schröder, Probability and Mathematical Physics 1 (2020) 101–146.","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>","ista":"Cipolloni G, Erdös L, Schröder DJ. 2020. Optimal lower bound on the least singular value of the shifted Ginibre ensemble. Probability and Mathematical Physics. 1(1), 101–146.","apa":"Cipolloni, G., Erdös, L., &#38; Schröder, D. J. (2020). Optimal lower bound on the least singular value of the shifted Ginibre ensemble. <i>Probability and Mathematical Physics</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/pmp.2020.1.101\">https://doi.org/10.2140/pmp.2020.1.101</a>","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.","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>.","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>."},"oa":1,"ec_funded":1},{"publication_status":"published","abstract":[{"text":"We call a continuous self-map that reveals itself through a discrete set of point-value pairs a sampled dynamical system. Capturing the available information with chain maps on Delaunay complexes, we use persistent homology to quantify the evidence of recurrent behavior. We establish a sampling theorem to recover the eigenspaces of the endomorphism on homology induced by the self-map. Using a combinatorial gradient flow arising from the discrete Morse theory for Čech and Delaunay complexes, we construct a chain map to transform the problem from the natural but expensive Čech complexes to the computationally efficient Delaunay triangulations. The fast chain map algorithm has applications beyond dynamical systems.","lang":"eng"}],"volume":4,"intvolume":"         4","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2024-03-04T10:47:49Z","day":"01","scopus_import":"1","oa":1,"publication":"Journal of Applied and Computational Topology","citation":{"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>","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.","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>.","mla":"Bauer, U., et al. “Čech-Delaunay Gradient Flow and Homology Inference for Self-Maps.” <i>Journal of Applied and Computational Topology</i>, vol. 4, no. 4, Springer Nature, 2020, pp. 455–80, doi:<a href=\"https://doi.org/10.1007/s41468-020-00058-8\">10.1007/s41468-020-00058-8</a>.","ieee":"U. Bauer, H. Edelsbrunner, G. Jablonski, and M. Mrozek, “Čech-Delaunay gradient flow and homology inference for self-maps,” <i>Journal of Applied and Computational Topology</i>, vol. 4, no. 4. Springer Nature, pp. 455–480, 2020.","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>"},"department":[{"_id":"HeEd"}],"publication_identifier":{"issn":["2367-1726"],"eissn":["2367-1734"]},"_id":"15064","article_processing_charge":"Yes (via OA deal)","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"month":"12","language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2020-12-01T00:00:00Z","date_updated":"2024-03-04T10:54:04Z","article_type":"original","file":[{"file_size":851190,"date_updated":"2024-03-04T10:52:42Z","date_created":"2024-03-04T10:52:42Z","creator":"dernst","file_id":"15065","success":1,"file_name":"2020_JourApplCompTopology_Bauer.pdf","relation":"main_file","checksum":"eed1168b6e66cd55272c19bb7fca8a1c","access_level":"open_access","content_type":"application/pdf"}],"issue":"4","page":"455-480","file_date_updated":"2024-03-04T10:52:42Z","author":[{"full_name":"Bauer, U.","last_name":"Bauer","first_name":"U."},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"id":"4483EF78-F248-11E8-B48F-1D18A9856A87","last_name":"Jablonski","first_name":"Grzegorz","full_name":"Jablonski, Grzegorz","orcid":"0000-0002-3536-9866"},{"full_name":"Mrozek, M.","first_name":"M.","last_name":"Mrozek"}],"type":"journal_article","has_accepted_license":"1","oa_version":"Published Version","status":"public","title":"Čech-Delaunay gradient flow and homology inference for self-maps","year":"2020","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.","publisher":"Springer Nature","ddc":["500"],"doi":"10.1007/s41468-020-00058-8"},{"related_material":{"record":[{"status":"public","relation":"later_version","id":"9678"}]},"alternative_title":["LIPIcs"],"day":"07","scopus_import":"1","oa":1,"publication":"34th International Symposium on Distributed Computing","department":[{"_id":"DaAl"}],"citation":{"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>","ista":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. 2020. Brief announcement: Efficient load-balancing through distributed token dropping. 34th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 179, 40.","short":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, 34th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","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.","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>","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>.","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>."},"arxiv":1,"article_number":"40","publication_status":"published","abstract":[{"text":"We introduce a new graph problem, the token dropping game, and we show how to solve it efficiently in a distributed setting. We use the token dropping game as a tool to design an efficient distributed algorithm for the stable orientation problem, which is a special case of the more general locally optimal semi-matching problem. The prior work by Czygrinow et al. (DISC 2012) finds a locally optimal semi-matching in O(Δ⁵) rounds in graphs of maximum degree Δ, which directly implies an algorithm with the same runtime for stable orientations. We improve the runtime to O(Δ⁴) for stable orientations and prove a lower bound of Ω(Δ) rounds.","lang":"eng"}],"intvolume":"       179","volume":179,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2024-03-05T07:09:12Z","file_date_updated":"2024-03-05T07:08:27Z","author":[{"full_name":"Brandt, Sebastian","first_name":"Sebastian","last_name":"Brandt"},{"full_name":"Keller, Barbara","last_name":"Keller","first_name":"Barbara"},{"orcid":"0000-0002-6432-6646","full_name":"Rybicki, Joel","last_name":"Rybicki","first_name":"Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Suomela, Jukka","last_name":"Suomela","first_name":"Jukka"},{"last_name":"Uitto","first_name":"Jara","full_name":"Uitto, Jara"}],"conference":{"location":"Virtual","end_date":"2020-10-16","name":"DISC: Symposium on Distributed Computing","start_date":"2020-10-12"},"type":"conference","oa_version":"Published Version","has_accepted_license":"1","status":"public","title":"Brief announcement: Efficient load-balancing through distributed token dropping","year":"2020","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ddc":["000"],"doi":"10.4230/LIPIcs.DISC.2020.40","_id":"15074","article_processing_charge":"No","tmp":{"name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png","short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"month":"10","language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2020-10-07T00:00:00Z","date_updated":"2024-03-05T07:13:13Z","external_id":{"arxiv":["2005.07761"]},"file":[{"creator":"dernst","file_id":"15075","success":1,"date_created":"2024-03-05T07:08:27Z","date_updated":"2024-03-05T07:08:27Z","file_size":303529,"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"23e2d9321aef53092dc1e24a8ab82d72","file_name":"2020_LIPIcs_Brandt.pdf"}]},{"has_accepted_license":"1","oa_version":"Published Version","ddc":["000"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","doi":"10.4230/LIPIcs.ICALP.2020.7","title":"Dynamic averaging load balancing on cycles","year":"2020","status":"public","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":[{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"id":"3279A00C-F248-11E8-B48F-1D18A9856A87","full_name":"Nadiradze, Giorgi","first_name":"Giorgi","last_name":"Nadiradze","orcid":"0000-0001-5634-0731"},{"id":"bcc145fd-e77f-11ea-ae8b-80d661dbff67","full_name":"Sabour, Amirmojtaba","last_name":"Sabour","first_name":"Amirmojtaba"}],"file_date_updated":"2024-03-05T07:25:15Z","conference":{"location":"Saarbrücken, Germany, Virtual","name":"ICALP: International Colloquium on Automata, Languages, and Programming","end_date":"2020-07-11","start_date":"2020-07-08"},"type":"conference","quality_controlled":"1","date_published":"2020-06-29T00:00:00Z","language":[{"iso":"eng"}],"file":[{"checksum":"e5eb16199f4ccfd77a321977eb3f026f","access_level":"open_access","relation":"main_file","file_name":"2020_LIPIcs_Alistarh.pdf","content_type":"application/pdf","date_updated":"2024-03-05T07:25:15Z","file_size":782987,"success":1,"file_id":"15078","creator":"dernst","date_created":"2024-03-05T07:25:15Z"}],"external_id":{"arxiv":["2003.09297"]},"date_updated":"2024-03-05T07:35:53Z","article_processing_charge":"No","tmp":{"name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png","short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"month":"06","_id":"15077","oa":1,"ec_funded":1,"citation":{"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.","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.","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>","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."},"department":[{"_id":"DaAl"}],"publication":"47th International Colloquium on Automata, Languages, and Programming","related_material":{"record":[{"id":"8286","relation":"later_version","status":"public"}]},"alternative_title":["LIPIcs"],"scopus_import":"1","day":"29","date_created":"2024-03-05T07:25:37Z","intvolume":"       168","volume":168,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"7","arxiv":1,"project":[{"call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning"}],"abstract":[{"lang":"eng","text":"We consider the following dynamic load-balancing process: given an underlying graph G with n nodes, in each step t≥ 0, one unit of load is created, and placed at a randomly chosen graph node. In the same step, the chosen node picks a random neighbor, and the two nodes balance their loads by averaging them. We are interested in the expected gap between the minimum and maximum loads at nodes as the process progresses, and its dependence on n and on the graph structure. Variants of the above graphical balanced allocation process have been studied previously by Peres, Talwar, and Wieder [Peres et al., 2015], and by Sauerwald and Sun [Sauerwald and Sun, 2015]. These authors left as open the question of characterizing the gap in the case of cycle graphs in the dynamic case, where weights are created during the algorithm’s execution. For this case, the only known upper bound is of 𝒪(n log n), following from a majorization argument due to [Peres et al., 2015], which analyzes a related graphical allocation process. In this paper, we provide an upper bound of 𝒪 (√n log n) on the expected gap of the above process for cycles of length n. We introduce a new potential analysis technique, which enables us to bound the difference in load between k-hop neighbors on the cycle, for any k ≤ n/2. We complement this with a \"gap covering\" argument, which bounds the maximum value of the gap by bounding its value across all possible subsets of a certain structure, and recursively bounding the gaps within each subset. We provide analytical and experimental evidence that our upper bound on the gap is tight up to a logarithmic factor."}],"publication_status":"published"},{"date_updated":"2024-03-05T09:00:07Z","date_published":"2020-04-01T00:00:00Z","quality_controlled":"1","date_created":"2024-03-05T08:57:17Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","month":"04","abstract":[{"lang":"eng","text":"Two plane drawings of geometric graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. For a given set S of 2n points two plane drawings of perfect matchings M1 and M2 (which do not need to be disjoint nor compatible) are disjoint tree-compatible if there exists a plane drawing of a spanning tree T on S which is disjoint compatible to both M1 and M2.\r\nWe show that the graph of all disjoint tree-compatible perfect geometric matchings on 2n points in convex position is connected if and only if 2n ≥ 10. Moreover, in that case the diameter\r\nof this graph is either 4 or 5, independent of n."}],"publication_status":"published","_id":"15082","article_number":"56","department":[{"_id":"KrCh"},{"_id":"UlWa"}],"citation":{"short":"O. Aichholzer, J. Obmann, P. Patak, D. Perz, J. Tkadlec, in:, 36th European Workshop on Computational Geometry, 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.","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.","mla":"Aichholzer, Oswin, et al. “Disjoint Tree-Compatible Plane Perfect Matchings.” <i>36th European Workshop on Computational Geometry</i>, 56, 2020.","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.","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.","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."},"title":"Disjoint tree-compatible plane perfect matchings","status":"public","year":"2020","publication":"36th European Workshop on Computational Geometry","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":1,"oa_version":"Published Version","conference":{"location":"Würzburg, Germany, Virtual","start_date":"2020-03-16","name":"EuroCG: European Workshop on Computational Geometry","end_date":"2020-03-18"},"type":"conference","day":"01","author":[{"full_name":"Aichholzer, Oswin","first_name":"Oswin","last_name":"Aichholzer"},{"full_name":"Obmann, Julia","last_name":"Obmann","first_name":"Julia"},{"id":"B593B804-1035-11EA-B4F1-947645A5BB83","full_name":"Patak, Pavel","first_name":"Pavel","last_name":"Patak"},{"last_name":"Perz","first_name":"Daniel","full_name":"Perz, Daniel"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef","first_name":"Josef","last_name":"Tkadlec","orcid":"0000-0002-1097-9684"}],"main_file_link":[{"open_access":"1","url":"https://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/data/uploads/papers/eurocg20_paper_56.pdf"}]},{"status":"public","year":"2020","title":"Converting microwave and telecom photons with a silicon photonic nanomechanical interface","department":[{"_id":"JoFi"}],"citation":{"short":"G.M. Arnold, M. Wulf, S. Barzanjeh, E. Redchenko, A.R. Rueda Sanchez, W.J. Hease, F. Hassani, J.M. Fink, (2020).","ista":"Arnold GM, Wulf M, Barzanjeh S, Redchenko E, Rueda Sanchez AR, Hease WJ, Hassani F, Fink JM. 2020. Converting microwave and telecom photons with a silicon photonic nanomechanical interface, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.3961561\">10.5281/ZENODO.3961561</a>.","ama":"Arnold GM, Wulf M, Barzanjeh S, et al. Converting microwave and telecom photons with a silicon photonic nanomechanical interface. 2020. doi:<a href=\"https://doi.org/10.5281/ZENODO.3961561\">10.5281/ZENODO.3961561</a>","ieee":"G. M. Arnold <i>et al.</i>, “Converting microwave and telecom photons with a silicon photonic nanomechanical interface.” Zenodo, 2020.","apa":"Arnold, G. M., Wulf, M., Barzanjeh, S., Redchenko, E., Rueda Sanchez, A. R., Hease, W. J., … Fink, J. M. (2020). Converting microwave and telecom photons with a silicon photonic nanomechanical interface. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.3961561\">https://doi.org/10.5281/ZENODO.3961561</a>","mla":"Arnold, Georg M., et al. <i>Converting Microwave and Telecom Photons with a Silicon Photonic Nanomechanical Interface</i>. Zenodo, 2020, doi:<a href=\"https://doi.org/10.5281/ZENODO.3961561\">10.5281/ZENODO.3961561</a>.","chicago":"Arnold, Georg M, Matthias Wulf, Shabir Barzanjeh, Elena Redchenko, Alfredo R Rueda Sanchez, William J Hease, Farid Hassani, and Johannes M Fink. “Converting Microwave and Telecom Photons with a Silicon Photonic Nanomechanical Interface.” Zenodo, 2020. <a href=\"https://doi.org/10.5281/ZENODO.3961561\">https://doi.org/10.5281/ZENODO.3961561</a>."},"doi":"10.5281/ZENODO.3961561","ddc":["530"],"publisher":"Zenodo","oa":1,"oa_version":"Published Version","day":"27","type":"research_data_reference","main_file_link":[{"url":"https://doi.org/10.5281/zenodo.3961562","open_access":"1"}],"author":[{"orcid":"0000-0003-1397-7876","first_name":"Georg M","last_name":"Arnold","full_name":"Arnold, Georg M","id":"3770C838-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wulf","first_name":"Matthias","full_name":"Wulf, Matthias","id":"45598606-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6613-1378"},{"id":"2D25E1F6-F248-11E8-B48F-1D18A9856A87","full_name":"Barzanjeh, Shabir","first_name":"Shabir","last_name":"Barzanjeh","orcid":"0000-0003-0415-1423"},{"last_name":"Redchenko","first_name":"Elena","full_name":"Redchenko, Elena","id":"2C21D6E8-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-6249-5860","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","full_name":"Rueda Sanchez, Alfredo R","last_name":"Rueda Sanchez","first_name":"Alfredo R"},{"orcid":"0000-0001-9868-2166","id":"29705398-F248-11E8-B48F-1D18A9856A87","full_name":"Hease, William J","last_name":"Hease","first_name":"William J"},{"orcid":"0000-0001-6937-5773","id":"2AED110C-F248-11E8-B48F-1D18A9856A87","first_name":"Farid","last_name":"Hassani","full_name":"Hassani, Farid"},{"full_name":"Fink, Johannes M","first_name":"Johannes M","last_name":"Fink","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X"}],"related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"8529"}]},"date_updated":"2024-09-10T12:23:51Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2023-05-23T13:37:41Z","date_published":"2020-07-27T00:00:00Z","_id":"13056","month":"07","abstract":[{"text":"This datasets comprises all data shown in plots of the submitted article \"Converting microwave and telecom photons with a silicon photonic nanomechanical interface\". Additional raw data are available from the corresponding author on reasonable request.","lang":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_processing_charge":"No"},{"department":[{"_id":"SyCr"},{"_id":"KrCh"}],"doi":"10.5061/DRYAD.CRJDFN318","citation":{"short":"B. Milutinovic, M. Stock, A.V. Grasse, E. Naderlinger, C. Hilbe, S. Cremer, (2020).","ista":"Milutinovic B, Stock M, Grasse AV, Naderlinger E, Hilbe C, Cremer S. 2020. Social immunity modulates competition between coinfecting pathogens, Dryad, <a href=\"https://doi.org/10.5061/DRYAD.CRJDFN318\">10.5061/DRYAD.CRJDFN318</a>.","ama":"Milutinovic B, Stock M, Grasse AV, Naderlinger E, Hilbe C, Cremer S. Social immunity modulates competition between coinfecting pathogens. 2020. doi:<a href=\"https://doi.org/10.5061/DRYAD.CRJDFN318\">10.5061/DRYAD.CRJDFN318</a>","ieee":"B. Milutinovic, M. Stock, A. V. Grasse, E. Naderlinger, C. Hilbe, and S. Cremer, “Social immunity modulates competition between coinfecting pathogens.” Dryad, 2020.","apa":"Milutinovic, B., Stock, M., Grasse, A. V., Naderlinger, E., Hilbe, C., &#38; Cremer, S. (2020). Social immunity modulates competition between coinfecting pathogens. Dryad. <a href=\"https://doi.org/10.5061/DRYAD.CRJDFN318\">https://doi.org/10.5061/DRYAD.CRJDFN318</a>","mla":"Milutinovic, Barbara, et al. <i>Social Immunity Modulates Competition between Coinfecting Pathogens</i>. Dryad, 2020, doi:<a href=\"https://doi.org/10.5061/DRYAD.CRJDFN318\">10.5061/DRYAD.CRJDFN318</a>.","chicago":"Milutinovic, Barbara, Miriam Stock, Anna V Grasse, Elisabeth Naderlinger, Christian Hilbe, and Sylvia Cremer. “Social Immunity Modulates Competition between Coinfecting Pathogens.” Dryad, 2020. <a href=\"https://doi.org/10.5061/DRYAD.CRJDFN318\">https://doi.org/10.5061/DRYAD.CRJDFN318</a>."},"ddc":["570"],"publisher":"Dryad","title":"Social immunity modulates competition between coinfecting pathogens","status":"public","year":"2020","oa":1,"oa_version":"Published Version","type":"research_data_reference","day":"19","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"7343"}]},"author":[{"id":"2CDC32B8-F248-11E8-B48F-1D18A9856A87","first_name":"Barbara","last_name":"Milutinovic","full_name":"Milutinovic, Barbara","orcid":"0000-0002-8214-4758"},{"id":"42462816-F248-11E8-B48F-1D18A9856A87","first_name":"Miriam","last_name":"Stock","full_name":"Stock, Miriam"},{"id":"406F989C-F248-11E8-B48F-1D18A9856A87","full_name":"Grasse, Anna V","first_name":"Anna V","last_name":"Grasse"},{"id":"31757262-F248-11E8-B48F-1D18A9856A87","first_name":"Elisabeth","last_name":"Naderlinger","full_name":"Naderlinger, Elisabeth"},{"id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","full_name":"Hilbe, Christian","last_name":"Hilbe","first_name":"Christian","orcid":"0000-0001-5116-955X"},{"full_name":"Cremer, Sylvia","last_name":"Cremer","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.crjdfn318"}],"date_updated":"2023-09-05T16:04:48Z","date_created":"2023-05-23T16:11:22Z","date_published":"2020-12-19T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Coinfections with multiple pathogens can result in complex within-host dynamics affecting virulence and transmission. Whilst multiple infections are intensively studied in solitary hosts, it is so far unresolved how social host interactions interfere with pathogen competition, and if this depends on coinfection diversity. We studied how the collective disease defenses of ants – their social immunity ­– influence pathogen competition in coinfections of same or different fungal pathogen species. Social immunity reduced virulence for all pathogen combinations, but interfered with spore production only in different-species coinfections. Here, it decreased overall pathogen sporulation success, whilst simultaneously increasing co-sporulation on individual cadavers and maintaining a higher pathogen diversity at the community-level. Mathematical modeling revealed that host sanitary care alone can modulate competitive outcomes between pathogens, giving advantage to fast-germinating, thus less grooming-sensitive ones. Host social interactions can hence modulate infection dynamics in coinfected group members, thereby altering pathogen communities at the host- and population-level.","lang":"eng"}],"month":"12","article_processing_charge":"No","tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"_id":"13060"}]
