[{"publication":"Proceedings of the 37th International Conference on Machine Learning","oa":1,"day":"07","date_updated":"2023-09-12T07:59:29Z","author":[{"orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","first_name":"Francesco"},{"full_name":"Poole, Ben","first_name":"Ben","last_name":"Poole"},{"full_name":"Rätsch, Gunnar","last_name":"Rätsch","first_name":"Gunnar"},{"full_name":"Schölkopf, Bernhard","last_name":"Schölkopf","first_name":"Bernhard"},{"full_name":"Bachem, Olivier","first_name":"Olivier","last_name":"Bachem"},{"first_name":"Michael","last_name":"Tschannen","full_name":"Tschannen, Michael"}],"citation":{"chicago":"Locatello, Francesco, Ben Poole, Gunnar Rätsch, Bernhard Schölkopf, Olivier Bachem, and Michael Tschannen. “Weakly-Supervised Disentanglement without Compromises.” In <i>Proceedings of the 37th International Conference on Machine Learning</i>, 119:6348–6359, 2020.","ista":"Locatello F, Poole B, Rätsch G, Schölkopf B, Bachem O, Tschannen M. 2020. Weakly-supervised disentanglement without compromises. Proceedings of the 37th International Conference on Machine Learning. International Conference on Machine Learning, PMLR, vol. 119, 6348–6359.","mla":"Locatello, Francesco, et al. “Weakly-Supervised Disentanglement without Compromises.” <i>Proceedings of the 37th International Conference on Machine Learning</i>, vol. 119, 2020, pp. 6348–6359.","ieee":"F. Locatello, B. Poole, G. Rätsch, B. Schölkopf, O. Bachem, and M. Tschannen, “Weakly-supervised disentanglement without compromises,” in <i>Proceedings of the 37th International Conference on Machine Learning</i>, Virtual, 2020, vol. 119, pp. 6348–6359.","ama":"Locatello F, Poole B, Rätsch G, Schölkopf B, Bachem O, Tschannen M. Weakly-supervised disentanglement without compromises. In: <i>Proceedings of the 37th International Conference on Machine Learning</i>. Vol 119. ; 2020:6348–6359.","apa":"Locatello, F., Poole, B., Rätsch, G., Schölkopf, B., Bachem, O., &#38; Tschannen, M. (2020). Weakly-supervised disentanglement without compromises. In <i>Proceedings of the 37th International Conference on Machine Learning</i> (Vol. 119, pp. 6348–6359). Virtual.","short":"F. Locatello, B. Poole, G. Rätsch, B. Schölkopf, O. Bachem, M. Tschannen, in:, Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 6348–6359."},"title":"Weakly-supervised disentanglement without compromises","external_id":{"arxiv":["2002.02886"]},"year":"2020","_id":"14188","date_created":"2023-08-22T14:08:14Z","oa_version":"Preprint","article_processing_charge":"No","quality_controlled":"1","abstract":[{"text":"Intelligent agents should be able to learn useful representations by\r\nobserving changes in their environment. We model such observations as pairs of\r\nnon-i.i.d. images sharing at least one of the underlying factors of variation.\r\nFirst, we theoretically show that only knowing how many factors have changed,\r\nbut not which ones, is sufficient to learn disentangled representations.\r\nSecond, we provide practical algorithms that learn disentangled representations\r\nfrom pairs of images without requiring annotation of groups, individual\r\nfactors, or the number of factors that have changed. Third, we perform a\r\nlarge-scale empirical study and show that such pairs of observations are\r\nsufficient to reliably learn disentangled representations on several benchmark\r\ndata sets. Finally, we evaluate our learned representations and find that they\r\nare simultaneously useful on a diverse suite of tasks, including generalization\r\nunder covariate shifts, fairness, and abstract reasoning. Overall, our results\r\ndemonstrate that weak supervision enables learning of useful disentangled\r\nrepresentations in realistic scenarios.","lang":"eng"}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":119,"type":"conference","alternative_title":["PMLR"],"intvolume":"       119","extern":"1","language":[{"iso":"eng"}],"status":"public","date_published":"2020-07-07T00:00:00Z","scopus_import":"1","page":"6348–6359","conference":{"location":"Virtual","name":"International Conference on Machine Learning","start_date":"2020-07-13","end_date":"2020-07-18"},"arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/2002.02886","open_access":"1"}],"department":[{"_id":"FrLo"}],"month":"07"},{"citation":{"short":"F. Locatello, S. Bauer, M. Lucic, G. Rätsch, S. Gelly, B. Schölkopf, O. Bachem, Journal of Machine Learning Research 21 (2020).","ama":"Locatello F, Bauer S, Lucic M, et al. A sober look at the unsupervised learning of disentangled representations and their evaluation. <i>Journal of Machine Learning Research</i>. 2020;21.","ieee":"F. Locatello <i>et al.</i>, “A sober look at the unsupervised learning of disentangled representations and their evaluation,” <i>Journal of Machine Learning Research</i>, vol. 21. MIT Press, 2020.","apa":"Locatello, F., Bauer, S., Lucic, M., Rätsch, G., Gelly, S., Schölkopf, B., &#38; Bachem, O. (2020). A sober look at the unsupervised learning of disentangled representations and their evaluation. <i>Journal of Machine Learning Research</i>. MIT Press.","mla":"Locatello, Francesco, et al. “A Sober Look at the Unsupervised Learning of Disentangled Representations and Their Evaluation.” <i>Journal of Machine Learning Research</i>, vol. 21, 209, MIT Press, 2020.","ista":"Locatello F, Bauer S, Lucic M, Rätsch G, Gelly S, Schölkopf B, Bachem O. 2020. A sober look at the unsupervised learning of disentangled representations and their evaluation. Journal of Machine Learning Research. 21, 209.","chicago":"Locatello, Francesco, Stefan Bauer, Mario Lucic, Gunnar Rätsch, Sylvain Gelly, Bernhard Schölkopf, and Olivier Bachem. “A Sober Look at the Unsupervised Learning of Disentangled Representations and Their Evaluation.” <i>Journal of Machine Learning Research</i>. MIT Press, 2020."},"date_updated":"2023-09-12T09:23:56Z","author":[{"orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco","first_name":"Francesco","last_name":"Locatello"},{"last_name":"Bauer","first_name":"Stefan","full_name":"Bauer, Stefan"},{"last_name":"Lucic","first_name":"Mario","full_name":"Lucic, Mario"},{"full_name":"Rätsch, Gunnar","last_name":"Rätsch","first_name":"Gunnar"},{"first_name":"Sylvain","last_name":"Gelly","full_name":"Gelly, Sylvain"},{"full_name":"Schölkopf, Bernhard","last_name":"Schölkopf","first_name":"Bernhard"},{"full_name":"Bachem, Olivier","last_name":"Bachem","first_name":"Olivier"}],"oa":1,"publication":"Journal of Machine Learning Research","day":"01","title":"A sober look at the unsupervised learning of disentangled representations and their evaluation","external_id":{"arxiv":["2010.14766"]},"article_number":"209","has_accepted_license":"1","_id":"14195","year":"2020","date_created":"2023-08-22T14:10:34Z","abstract":[{"lang":"eng","text":"The idea behind the unsupervised learning of disentangled representations is that real-world data is generated by a few explanatory factors of variation which can be recovered by unsupervised learning algorithms. In this paper, we provide a sober look at recent progress in the field and challenge some common assumptions. We first theoretically show that the unsupervised learning of disentangled representations is fundamentally impossible without inductive biases on both the models and the data. Then, we train over 14000\r\n models covering most prominent methods and evaluation metrics in a reproducible large-scale experimental study on eight data sets. We observe that while the different methods successfully enforce properties “encouraged” by the corresponding losses, well-disentangled models seemingly cannot be identified without supervision. Furthermore, different evaluation metrics do not always agree on what should be considered “disentangled” and exhibit systematic differences in the estimation. Finally, increased disentanglement does not seem to necessarily lead to a decreased sample complexity of learning for downstream tasks. Our results suggest that future work on disentanglement learning should be explicit about the role of inductive biases and (implicit) supervision, investigate concrete benefits of enforcing disentanglement of the learned representations, and consider a reproducible experimental setup covering several data sets."}],"publication_status":"published","article_type":"original","article_processing_charge":"No","oa_version":"Published Version","quality_controlled":"1","volume":21,"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"language":[{"iso":"eng"}],"date_published":"2020-09-01T00:00:00Z","extern":"1","intvolume":"        21","ddc":["000"],"arxiv":1,"scopus_import":"1","month":"09","department":[{"_id":"FrLo"}],"publisher":"MIT Press","main_file_link":[{"open_access":"1","url":"https://jmlr.csail.mit.edu/papers/v21/19-976.html"}]},{"arxiv":1,"page":"11525-11538","conference":{"location":"Virtual","start_date":"2020-12-06","name":"NeurIPS: Neural Information Processing Systems","end_date":"2020-12-12"},"date_created":"2023-09-13T12:03:46Z","year":"2020","_id":"14326","publication_status":"published","department":[{"_id":"FrLo"}],"publisher":"Curran Associates","abstract":[{"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","lang":"eng"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2006.15055"}],"oa_version":"Preprint","article_processing_charge":"No","author":[{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","first_name":"Francesco","last_name":"Locatello"},{"last_name":"Weissenborn","first_name":"Dirk","full_name":"Weissenborn, Dirk"},{"full_name":"Unterthiner, Thomas","first_name":"Thomas","last_name":"Unterthiner"},{"last_name":"Mahendran","first_name":"Aravindh","full_name":"Mahendran, Aravindh"},{"full_name":"Heigold, Georg","first_name":"Georg","last_name":"Heigold"},{"full_name":"Uszkoreit, Jakob","first_name":"Jakob","last_name":"Uszkoreit"},{"full_name":"Dosovitskiy, Alexey","first_name":"Alexey","last_name":"Dosovitskiy"},{"full_name":"Kipf, Thomas","first_name":"Thomas","last_name":"Kipf"}],"citation":{"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.","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.","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.","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.","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.","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.","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."},"type":"conference","date_updated":"2023-09-13T12:19:19Z","volume":33,"publication_identifier":{"isbn":["9781713829546"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Advances in Neural Information Processing Systems","oa":1,"date_published":"2020-01-01T00:00:00Z","language":[{"iso":"eng"}],"external_id":{"arxiv":["2006.15055"]},"title":"Object-centric learning with slot attention","status":"public","intvolume":"        33","extern":"1"},{"abstract":[{"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.","lang":"eng"}],"file":[{"access_level":"open_access","creator":"fschur","checksum":"0108616e2a59e51879ea51299a29b091","file_size":49297,"content_type":"application/zip","date_updated":"2023-11-22T14:58:44Z","file_name":"3Dprint-files_download_v2.zip","file_id":"14593","date_created":"2023-11-22T14:58:44Z","success":1,"relation":"main_file"},{"access_level":"open_access","creator":"cchlebak","content_type":"text/plain","file_size":641,"checksum":"4c66ddedee4d01c1c4a7978208350cfc","date_updated":"2023-12-01T10:39:59Z","file_id":"14637","relation":"main_file","date_created":"2023-12-01T10:39:59Z","success":1,"file_name":"readme.txt"}],"month":"12","publisher":"Institute of Science and Technology Austria","related_material":{"record":[{"relation":"research_data","status":"public","id":"8586"}]},"department":[{"_id":"FlSc"}],"article_processing_charge":"No","oa_version":"Published Version","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","_id":"14592","year":"2020","date_created":"2023-11-22T15:00:57Z","status":"public","tmp":{"image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"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","project":[{"_id":"9B954C5C-BA93-11EA-9121-9846C619BF3A","grant_number":"P33367","name":"Structure and isoform diversity of the Arp2/3 complex"}],"date_published":"2020-12-01T00:00:00Z","doi":"10.15479/AT:ISTA:14592","ddc":["570"],"has_accepted_license":"1","type":"research_data","date_updated":"2024-02-21T12:44:48Z","citation":{"short":"F.K. Schur, (2020).","ama":"Schur FK. STL-files for 3D-printed grid holders described in  Fäßler F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:14592\">10.15479/AT:ISTA:14592</a>","ieee":"F. K. Schur, “STL-files for 3D-printed grid holders described in  Fäßler F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy.” Institute of Science and Technology Austria, 2020.","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>.","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>.","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>."},"author":[{"orcid":"0000-0003-4790-8078","full_name":"Schur, Florian KM","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","last_name":"Schur","first_name":"Florian KM"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","file_date_updated":"2023-12-01T10:39:59Z","contributor":[{"first_name":"Florian","last_name":"Fäßler","contributor_type":"researcher","orcid":"0000-0001-7149-769X","id":"404F5528-F248-11E8-B48F-1D18A9856A87"},{"id":"45FD126C-F248-11E8-B48F-1D18A9856A87","contributor_type":"researcher","last_name":"Zens","first_name":"Bettina"},{"first_name":"Robert","last_name":"Hauschild","contributor_type":"researcher","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-4790-8078","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","contributor_type":"researcher","last_name":"Schur","first_name":"Florian KM"}]},{"type":"journal_article","volume":25,"file_date_updated":"2023-12-18T10:42:32Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2020-09-01T00:00:00Z","doi":"10.4171/dm/780","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"language":[{"iso":"eng"}],"ddc":["510"],"intvolume":"        25","arxiv":1,"page":"1421-1539","month":"09","publisher":"EMS Press","department":[{"_id":"LaEr"}],"author":[{"full_name":"Alt, Johannes","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","last_name":"Alt","first_name":"Johannes"},{"last_name":"Erdös","first_name":"László","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603"},{"full_name":"Krüger, Torben H","id":"3020C786-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4821-3297","last_name":"Krüger","first_name":"Torben H"}],"date_updated":"2023-12-18T10:46:09Z","citation":{"ama":"Alt J, Erdös L, Krüger TH. The Dyson equation with linear self-energy: Spectral bands, edges and cusps. <i>Documenta Mathematica</i>. 2020;25:1421-1539. doi:<a href=\"https://doi.org/10.4171/dm/780\">10.4171/dm/780</a>","ieee":"J. Alt, L. Erdös, and T. H. Krüger, “The Dyson equation with linear self-energy: Spectral bands, edges and cusps,” <i>Documenta Mathematica</i>, vol. 25. EMS Press, pp. 1421–1539, 2020.","apa":"Alt, J., Erdös, L., &#38; Krüger, T. H. (2020). The Dyson equation with linear self-energy: Spectral bands, edges and cusps. <i>Documenta Mathematica</i>. EMS Press. <a href=\"https://doi.org/10.4171/dm/780\">https://doi.org/10.4171/dm/780</a>","mla":"Alt, Johannes, et al. “The Dyson Equation with Linear Self-Energy: Spectral Bands, Edges and Cusps.” <i>Documenta Mathematica</i>, vol. 25, EMS Press, 2020, pp. 1421–539, doi:<a href=\"https://doi.org/10.4171/dm/780\">10.4171/dm/780</a>.","ista":"Alt J, Erdös L, Krüger TH. 2020. The Dyson equation with linear self-energy: Spectral bands, edges and cusps. Documenta Mathematica. 25, 1421–1539.","chicago":"Alt, Johannes, László Erdös, and Torben H Krüger. “The Dyson Equation with Linear Self-Energy: Spectral Bands, Edges and Cusps.” <i>Documenta Mathematica</i>. EMS Press, 2020. <a href=\"https://doi.org/10.4171/dm/780\">https://doi.org/10.4171/dm/780</a>.","short":"J. Alt, L. Erdös, T.H. Krüger, Documenta Mathematica 25 (2020) 1421–1539."},"day":"01","oa":1,"publication":"Documenta Mathematica","publication_identifier":{"issn":["1431-0635"],"eissn":["1431-0643"]},"external_id":{"arxiv":["1804.07752"]},"title":"The Dyson equation with linear self-energy: Spectral bands, edges and cusps","has_accepted_license":"1","date_created":"2023-12-18T10:37:43Z","_id":"14694","year":"2020","article_type":"original","related_material":{"record":[{"relation":"earlier_version","id":"6183","status":"public"}]},"publication_status":"published","abstract":[{"text":"We study the unique solution m of the Dyson equation \\( -m(z)^{-1} = z\\1 - a + S[m(z)] \\) on a von Neumann algebra A with the constraint Imm≥0. Here, z lies in the complex upper half-plane, a is a self-adjoint element of A and S is a positivity-preserving linear operator on A. We show that m is the Stieltjes transform of a compactly supported A-valued measure on R. Under suitable assumptions, we establish that this measure has a uniformly 1/3-Hölder continuous density with respect to the Lebesgue measure, which is supported on finitely many intervals, called bands. In fact, the density is analytic inside the bands with a square-root growth at the edges and internal cubic root cusps whenever the gap between two bands vanishes. The shape of these singularities is universal and no other singularity may occur. We give a precise asymptotic description of m near the singular points. These asymptotics generalize the analysis at the regular edges given in the companion paper on the Tracy-Widom universality for the edge eigenvalue statistics for correlated random matrices [the first author et al., Ann. Probab. 48, No. 2, 963--1001 (2020; Zbl 1434.60017)] and they play a key role in the proof of the Pearcey universality at the cusp for Wigner-type matrices [G. Cipolloni et al., Pure Appl. Anal. 1, No. 4, 615--707 (2019; Zbl 07142203); the second author et al., Commun. Math. Phys. 378, No. 2, 1203--1278 (2020; Zbl 07236118)]. We also extend the finite dimensional band mass formula from [the first author et al., loc. cit.] to the von Neumann algebra setting by showing that the spectral mass of the bands is topologically rigid under deformations and we conclude that these masses are quantized in some important cases.","lang":"eng"}],"file":[{"date_updated":"2023-12-18T10:42:32Z","file_name":"2020_DocumentaMathematica_Alt.pdf","success":1,"date_created":"2023-12-18T10:42:32Z","relation":"main_file","file_id":"14695","creator":"dernst","access_level":"open_access","checksum":"12aacc1d63b852ff9a51c1f6b218d4a6","file_size":1374708,"content_type":"application/pdf"}],"quality_controlled":"1","keyword":["General Mathematics"],"article_processing_charge":"Yes","oa_version":"Published Version"},{"publisher":"Mathematical Sciences Publishers","department":[{"_id":"RoSe"}],"month":"01","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1903.04046","open_access":"1"}],"page":"35-73","arxiv":1,"scopus_import":"1","language":[{"iso":"eng"}],"status":"public","doi":"10.2140/paa.2020.2.35","date_published":"2020-01-01T00:00:00Z","intvolume":"         2","volume":2,"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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."}],"article_type":"original","publication_status":"published","oa_version":"Preprint","article_processing_charge":"No","quality_controlled":"1","year":"2020","_id":"14891","date_created":"2024-01-28T23:01:44Z","external_id":{"arxiv":["1903.04046"]},"title":" The local density approximation in density functional theory","issue":"1","date_updated":"2024-01-29T09:01:12Z","author":[{"full_name":"Lewin, Mathieu","first_name":"Mathieu","last_name":"Lewin"},{"full_name":"Lieb, Elliott H.","last_name":"Lieb","first_name":"Elliott H."},{"last_name":"Seiringer","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521"}],"citation":{"ista":"Lewin M, Lieb EH, Seiringer R. 2020.  The local density approximation in density functional theory. Pure and Applied Analysis. 2(1), 35–73.","chicago":"Lewin, Mathieu, Elliott H. Lieb, and Robert Seiringer. “ The Local Density Approximation in Density Functional Theory.” <i>Pure and Applied Analysis</i>. Mathematical Sciences Publishers, 2020. <a href=\"https://doi.org/10.2140/paa.2020.2.35\">https://doi.org/10.2140/paa.2020.2.35</a>.","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.","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>","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>.","short":"M. Lewin, E.H. Lieb, R. Seiringer, Pure and Applied Analysis 2 (2020) 35–73."},"publication":"Pure and Applied Analysis","publication_identifier":{"issn":["2578-5893"],"eissn":["2578-5885"]},"oa":1,"day":"01"},{"date_created":"2024-02-28T08:50:34Z","pmid":1,"_id":"15036","year":"2020","publication_status":"published","article_type":"original","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."}],"quality_controlled":"1","article_processing_charge":"No","keyword":["Molecular Biology","Structural Biology"],"oa_version":"Published Version","date_updated":"2024-02-28T12:37:54Z","author":[{"first_name":"Higor Vinícius Dias","last_name":"Rosa","full_name":"Rosa, Higor Vinícius Dias"},{"last_name":"Leonardo","first_name":"Diego Antonio","full_name":"Leonardo, Diego Antonio"},{"full_name":"Brognara, Gabriel","id":"D96FFDA0-A884-11E9-9968-DC26E6697425","last_name":"Brognara","first_name":"Gabriel"},{"last_name":"Brandão-Neto","first_name":"José","full_name":"Brandão-Neto, José"},{"full_name":"D'Muniz Pereira, Humberto","last_name":"D'Muniz Pereira","first_name":"Humberto"},{"full_name":"Araújo, Ana Paula Ulian","first_name":"Ana Paula Ulian","last_name":"Araújo"},{"full_name":"Garratt, Richard Charles","first_name":"Richard Charles","last_name":"Garratt"}],"citation":{"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>.","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.","mla":"Rosa, Higor Vinícius Dias, et al. “Molecular Recognition at Septin Interfaces: The Switches Hold the Key.” <i>Journal of Molecular Biology</i>, vol. 432, no. 21, Elsevier, 2020, pp. 5784–801, doi:<a href=\"https://doi.org/10.1016/j.jmb.2020.09.001\">10.1016/j.jmb.2020.09.001</a>.","apa":"Rosa, H. V. D., Leonardo, D. A., Brognara, G., Brandão-Neto, J., D’Muniz Pereira, H., Araújo, A. P. U., &#38; Garratt, R. C. (2020). Molecular recognition at septin interfaces: The switches hold the key. <i>Journal of Molecular Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jmb.2020.09.001\">https://doi.org/10.1016/j.jmb.2020.09.001</a>","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.","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>","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."},"day":"02","oa":1,"publication_identifier":{"issn":["0022-2836"]},"publication":"Journal of Molecular Biology","external_id":{"pmid":["32910969"]},"title":"Molecular recognition at septin interfaces: The switches hold the key","issue":"21","page":"5784-5801","month":"10","department":[{"_id":"MaLo"}],"publisher":"Elsevier","main_file_link":[{"url":"https://doi.org/10.1016/j.jmb.2020.09.001","open_access":"1"}],"type":"journal_article","volume":432,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2020-10-02T00:00:00Z","doi":"10.1016/j.jmb.2020.09.001","status":"public","language":[{"iso":"eng"}],"intvolume":"       432"},{"date_created":"2024-02-28T08:55:56Z","pmid":1,"_id":"15037","year":"2020","publication_status":"published","article_type":"original","abstract":[{"lang":"eng","text":"Protein abundance and localization at the plasma membrane (PM) shapes plant development and mediates adaptation to changing environmental conditions. It is regulated by ubiquitination, a post-translational modification crucial for the proper sorting of endocytosed PM proteins to the vacuole for subsequent degradation. To understand the significance and the variety of roles played by this reversible modification, the function of ubiquitin receptors, which translate the ubiquitin signature into a cellular response, needs to be elucidated. In this study, we show that TOL (TOM1-like) proteins function in plants as multivalent ubiquitin receptors, governing ubiquitinated cargo delivery to the vacuole via the conserved Endosomal Sorting Complex Required for Transport (ESCRT) pathway. TOL2 and TOL6 interact with components of the ESCRT machinery and bind to K63-linked ubiquitin via two tandemly arranged conserved ubiquitin-binding domains. Mutation of these domains results not only in a loss of ubiquitin binding but also altered localization, abolishing TOL6 ubiquitin receptor activity. Function and localization of TOL6 is itself regulated by ubiquitination, whereby TOL6 ubiquitination potentially modulates degradation of PM-localized cargoes, assisting in the fine-tuning of the delicate interplay between protein recycling and downregulation. Taken together, our findings demonstrate the function and regulation of a ubiquitin receptor that mediates vacuolar degradation of PM proteins in higher plants."}],"file":[{"file_id":"15038","date_created":"2024-02-28T12:39:56Z","success":1,"relation":"main_file","file_name":"2020_MolecularPlant_MoulinierAnzola.pdf","date_updated":"2024-02-28T12:39:56Z","content_type":"application/pdf","file_size":3089212,"checksum":"c538a5008f7827f62d17d40a3bfabe65","access_level":"open_access","creator":"dernst"}],"quality_controlled":"1","keyword":["Plant Science","Molecular Biology"],"article_processing_charge":"No","oa_version":"Published Version","citation":{"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>.","ista":"Moulinier-Anzola J, Schwihla M, De-Araújo L, Artner C, Jörg L, Konstantinova N, Luschnig C, Korbei B. 2020. TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants. Molecular Plant. 13(5), 717–731.","mla":"Moulinier-Anzola, Jeanette, et al. “TOLs Function as Ubiquitin Receptors in the Early Steps of the ESCRT Pathway in Higher Plants.” <i>Molecular Plant</i>, vol. 13, no. 5, Elsevier, 2020, pp. 717–31, doi:<a href=\"https://doi.org/10.1016/j.molp.2020.02.012\">10.1016/j.molp.2020.02.012</a>.","apa":"Moulinier-Anzola, J., Schwihla, M., De-Araújo, L., Artner, C., Jörg, L., Konstantinova, N., … Korbei, B. (2020). TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants. <i>Molecular Plant</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.molp.2020.02.012\">https://doi.org/10.1016/j.molp.2020.02.012</a>","ieee":"J. Moulinier-Anzola <i>et al.</i>, “TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants,” <i>Molecular Plant</i>, vol. 13, no. 5. Elsevier, pp. 717–731, 2020.","ama":"Moulinier-Anzola J, Schwihla M, De-Araújo L, et al. TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants. <i>Molecular Plant</i>. 2020;13(5):717-731. doi:<a href=\"https://doi.org/10.1016/j.molp.2020.02.012\">10.1016/j.molp.2020.02.012</a>","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."},"author":[{"last_name":"Moulinier-Anzola","first_name":"Jeanette","full_name":"Moulinier-Anzola, Jeanette"},{"last_name":"Schwihla","first_name":"Maximilian","full_name":"Schwihla, Maximilian"},{"full_name":"De-Araújo, Lucinda","last_name":"De-Araújo","first_name":"Lucinda"},{"full_name":"Artner, Christina","id":"45DF286A-F248-11E8-B48F-1D18A9856A87","last_name":"Artner","first_name":"Christina"},{"last_name":"Jörg","first_name":"Lisa","full_name":"Jörg, Lisa"},{"full_name":"Konstantinova, Nataliia","last_name":"Konstantinova","first_name":"Nataliia"},{"full_name":"Luschnig, Christian","last_name":"Luschnig","first_name":"Christian"},{"last_name":"Korbei","first_name":"Barbara","full_name":"Korbei, Barbara"}],"date_updated":"2024-02-28T12:41:52Z","day":"04","oa":1,"publication":"Molecular Plant","publication_identifier":{"issn":["1674-2052"]},"external_id":{"pmid":["32087370"]},"title":"TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants","has_accepted_license":"1","issue":"5","page":"717-731","month":"05","publisher":"Elsevier","department":[{"_id":"EvBe"}],"type":"journal_article","volume":13,"file_date_updated":"2024-02-28T12:39:56Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2020-05-04T00:00:00Z","doi":"10.1016/j.molp.2020.02.012","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","language":[{"iso":"eng"}],"intvolume":"        13","ddc":["580"]},{"year":"2020","_id":"15055","date_created":"2024-03-04T08:07:22Z","oa_version":"Preprint","article_processing_charge":"No","keyword":["General Medicine"],"quality_controlled":"1","abstract":[{"lang":"eng","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>"}],"publication_status":"published","article_type":"original","publication":"Proceedings of the 34th AAAI Conference on Artificial Intelligence","publication_identifier":{"issn":["2374-3468"]},"oa":1,"day":"03","citation":{"mla":"Brázdil, Tomáš, et al. “Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes.” <i>Proceedings of the 34th AAAI Conference on Artificial Intelligence</i>, vol. 34, no. 06, Association for the Advancement of Artificial Intelligence, 2020, pp. 9794–801, doi:<a href=\"https://doi.org/10.1609/aaai.v34i06.6531\">10.1609/aaai.v34i06.6531</a>.","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.","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>","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>","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Petr Novotný, and Jiří Vahala. “Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes.” <i>Proceedings of the 34th AAAI Conference on Artificial Intelligence</i>. Association for the Advancement of Artificial Intelligence, 2020. <a href=\"https://doi.org/10.1609/aaai.v34i06.6531\">https://doi.org/10.1609/aaai.v34i06.6531</a>.","ista":"Brázdil T, Chatterjee K, Novotný P, Vahala J. 2020. Reinforcement learning of risk-constrained policies in Markov decision processes. Proceedings of the 34th AAAI Conference on Artificial Intelligence. 34(06), 9794–9801.","short":"T. Brázdil, K. Chatterjee, P. Novotný, J. Vahala, Proceedings of the 34th AAAI Conference on Artificial Intelligence 34 (2020) 9794–9801."},"author":[{"full_name":"Brázdil, Tomáš","last_name":"Brázdil","first_name":"Tomáš"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Novotný","first_name":"Petr","full_name":"Novotný, Petr"},{"full_name":"Vahala, Jiří","first_name":"Jiří","last_name":"Vahala"}],"date_updated":"2024-03-04T08:30:16Z","issue":"06","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"}],"external_id":{"arxiv":["2002.12086"]},"title":"Reinforcement learning of risk-constrained policies in Markov decision processes","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.","page":"9794-9801","conference":{"end_date":"2020-02-12","name":"AAAI: Conference on Artificial Intelligence","location":"New York, NY, United States","start_date":"2020-02-07"},"arxiv":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2002.12086","open_access":"1"}],"publisher":"Association for the Advancement of Artificial Intelligence","department":[{"_id":"KrCh"}],"month":"04","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":34,"type":"journal_article","intvolume":"        34","language":[{"iso":"eng"}],"status":"public","doi":"10.1609/aaai.v34i06.6531","date_published":"2020-04-03T00:00:00Z"},{"ddc":["570"],"intvolume":"         6","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"status":"public","language":[{"iso":"eng"}],"date_published":"2020-07-01T00:00:00Z","doi":"10.1126/sciadv.aaw7824","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2024-03-04T09:46:41Z","volume":6,"type":"journal_article","license":"https://creativecommons.org/licenses/by-nc/4.0/","month":"07","publisher":"American Association for the Advancement of Science","department":[{"_id":"MaDe"}],"acknowledgement":"This research was supported by grants NRF-2019R1A3B2067745 and NRF-2017R1A5A1015366 funded by the Korean Government (MSIT) through the National Research Foundation (NRF) of Korea to S.-J.V.L. and by grant Basic Science Research Program (No. 2019R1A2C2009440) funded by the Korean Government (MSIT) through the NRF of Korea to K.-T.K. ","issue":"27","article_number":"aaw7824","has_accepted_license":"1","title":"VRK-1 extends life span by activation of AMPK via phosphorylation","oa":1,"publication":"Science Advances","publication_identifier":{"eissn":["2375-2548"]},"day":"01","author":[{"first_name":"Sangsoon","last_name":"Park","full_name":"Park, Sangsoon"},{"id":"C407B586-6052-11E9-B3AE-7006E6697425","full_name":"Artan, Murat","orcid":"0000-0001-8945-6992","last_name":"Artan","first_name":"Murat"},{"last_name":"Han","first_name":"Seung Hyun","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"},{"last_name":"Hwang","first_name":"Ara B.","full_name":"Hwang, Ara B."},{"first_name":"Won Sik","last_name":"Shin","full_name":"Shin, Won Sik"},{"first_name":"Kyong-Tai","last_name":"Kim","full_name":"Kim, Kyong-Tai"},{"last_name":"Lee","first_name":"Seung-Jae V.","full_name":"Lee, Seung-Jae V."}],"date_updated":"2024-03-04T09:52:09Z","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).","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>.","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>","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.","chicago":"Park, Sangsoon, Murat Artan, Seung Hyun Han, Hae-Eun H. Park, Yoonji Jung, Ara B. Hwang, Won Sik Shin, Kyong-Tai Kim, and Seung-Jae V. Lee. “VRK-1 Extends Life Span by Activation of AMPK via Phosphorylation.” <i>Science Advances</i>. American Association for the Advancement of Science, 2020. <a href=\"https://doi.org/10.1126/sciadv.aaw7824\">https://doi.org/10.1126/sciadv.aaw7824</a>.","ista":"Park S, Artan M, Han SH, Park H-EH, Jung Y, Hwang AB, Shin WS, Kim K-T, Lee S-JV. 2020. VRK-1 extends life span by activation of AMPK via phosphorylation. Science Advances. 6(27), aaw7824."},"article_processing_charge":"No","oa_version":"Published Version","quality_controlled":"1","abstract":[{"text":"Vaccinia virus–related kinase (VRK) is an evolutionarily conserved nuclear protein kinase. VRK-1, the single Caenorhabditis elegans VRK ortholog, functions in cell division and germline proliferation. However, the role of VRK-1 in postmitotic cells and adult life span remains unknown. Here, we show that VRK-1 increases organismal longevity by activating the cellular energy sensor, AMP-activated protein kinase (AMPK), via direct phosphorylation. We found that overexpression of vrk-1 in the soma of adult C. elegans increased life span and, conversely, inhibition of vrk-1 decreased life span. In addition, vrk-1 was required for longevity conferred by mutations that inhibit C. elegans mitochondrial respiration, which requires AMPK. VRK-1 directly phosphorylated and up-regulated AMPK in both C. elegans and cultured human cells. Thus, our data show that the somatic nuclear kinase, VRK-1, promotes longevity through AMPK activation, and this function appears to be conserved between C. elegans and humans.","lang":"eng"}],"file":[{"access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":1864415,"checksum":"a37157cd0de709dce5fe03f4a31cd0b6","date_updated":"2024-03-04T09:46:41Z","file_id":"15058","relation":"main_file","success":1,"date_created":"2024-03-04T09:46:41Z","file_name":"2020_ScienceAdvances_Park.pdf"}],"article_type":"original","publication_status":"published","_id":"15057","year":"2020","date_created":"2024-03-04T09:41:57Z"},{"conference":{"end_date":"2020-03-20","name":"EuCAP: European Conference on Antennas and Propagation","start_date":"2020-03-15","location":"Copenhagen, Denmark"},"year":"2020","_id":"15059","date_created":"2024-03-04T09:57:48Z","acknowledgement":"This work has been financially supported by Comunidad de Madrid S2018/NMT-4333 ARTINLARA-CM projects, and “FUNDACIÓN SENER” REFTA projects.","abstract":[{"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.","lang":"eng"}],"publisher":"IEEE","department":[{"_id":"JoFi"}],"publication_status":"published","month":"07","oa_version":"None","article_processing_charge":"No","quality_controlled":"1","type":"conference","author":[{"full_name":"Wasiak, Michal","first_name":"Michal","last_name":"Wasiak"},{"full_name":"Botello, Gabriel Santamaria","first_name":"Gabriel Santamaria","last_name":"Botello"},{"full_name":"Abdalmalak, Kerlos Atia","first_name":"Kerlos Atia","last_name":"Abdalmalak"},{"full_name":"Sedlmeir, Florian","last_name":"Sedlmeir","first_name":"Florian"},{"full_name":"Rueda Sanchez, Alfredo R","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6249-5860","last_name":"Rueda Sanchez","first_name":"Alfredo R"},{"first_name":"Daniel","last_name":"Segovia-Vargas","full_name":"Segovia-Vargas, Daniel"},{"full_name":"Schwefel, Harald G. L.","first_name":"Harald G. L.","last_name":"Schwefel"},{"last_name":"Munoz","first_name":"Luis Enrique Garcia","full_name":"Munoz, Luis Enrique Garcia"}],"date_updated":"2024-03-04T10:02:49Z","citation":{"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>.","ista":"Wasiak M, Botello GS, Abdalmalak KA, Sedlmeir F, Rueda Sanchez AR, Segovia-Vargas D, Schwefel HGL, Munoz LEG. 2020. Compact millimeter and submillimeter-wave photonic radiometer for cubesats. 14th European Conference on Antennas and Propagation. EuCAP: European Conference on Antennas and Propagation.","mla":"Wasiak, Michal, et al. “Compact Millimeter and Submillimeter-Wave Photonic Radiometer for Cubesats.” <i>14th European Conference on Antennas and Propagation</i>, IEEE, 2020, doi:<a href=\"https://doi.org/10.23919/eucap48036.2020.9135962\">10.23919/eucap48036.2020.9135962</a>.","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>","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>","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."},"publication_identifier":{"eisbn":["9788831299008"]},"publication":"14th European Conference on Antennas and Propagation","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"08","language":[{"iso":"eng"}],"status":"public","title":"Compact millimeter and submillimeter-wave photonic radiometer for cubesats","doi":"10.23919/eucap48036.2020.9135962","date_published":"2020-07-08T00:00:00Z"},{"main_file_link":[{"url":"https://doi.org/10.1073/pnas.191726911","open_access":"1"}],"month":"09","publisher":"Proceedings of the National Academy of Sciences","department":[{"_id":"CaBe"}],"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. ","page":"22101-22112","intvolume":"       117","status":"public","language":[{"iso":"eng"}],"date_published":"2020-09-08T00:00:00Z","doi":"10.1073/pnas.1917269117","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":117,"type":"journal_article","article_processing_charge":"No","oa_version":"Published Version","quality_controlled":"1","abstract":[{"lang":"eng","text":"The actin cytoskeleton, a dynamic network of actin filaments and associated F-actin–binding proteins, is fundamentally important in eukaryotes. α-Actinins are major F-actin bundlers that are inhibited by Ca2+ in nonmuscle cells. Here we report the mechanism of Ca2+-mediated regulation of Entamoeba histolytica α-actinin-2 (EhActn2) with features expected for the common ancestor of Entamoeba and higher eukaryotic α-actinins. Crystal structures of Ca2+-free and Ca2+-bound EhActn2 reveal a calmodulin-like domain (CaMD) uniquely inserted within the rod domain. Integrative studies reveal an exceptionally high affinity of the EhActn2 CaMD for Ca2+, binding of which can only be regulated in the presence of physiological concentrations of Mg2+. Ca2+ binding triggers an increase in protein multidomain rigidity, reducing conformational flexibility of F-actin–binding domains via interdomain cross-talk and consequently inhibiting F-actin bundling. In vivo studies uncover that EhActn2 plays an important role in phagocytic cup formation and might constitute a new drug target for amoebic dysentery."}],"publication_status":"published","article_type":"original","_id":"15061","year":"2020","pmid":1,"date_created":"2024-03-04T10:03:52Z","acknowledged_ssus":[{"_id":"LifeSc"}],"issue":"36","title":"Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin","external_id":{"pmid":["32848067"]},"oa":1,"publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"publication":"Proceedings of the National Academy of Sciences","day":"08","citation":{"short":"N. Pinotsis, K. Zielinska, M. Babuta, J.L. Arolas, J. Kostan, M.B. Khan, C. Schreiner, A.P. Testa Salmazo, L. Ciccarelli, M. Puchinger, E.A. Gkougkoulia, E. de A. Ribeiro, T.C. Marlovits, A. Bhattacharya, K. Djinovic-Carugo, Proceedings of the National Academy of Sciences 117 (2020) 22101–22112.","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.","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>.","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.","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>","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>","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>."},"date_updated":"2024-03-04T10:14:44Z","author":[{"first_name":"Nikos","last_name":"Pinotsis","full_name":"Pinotsis, Nikos"},{"full_name":"Zielinska, Karolina","first_name":"Karolina","last_name":"Zielinska"},{"first_name":"Mrigya","last_name":"Babuta","full_name":"Babuta, Mrigya"},{"first_name":"Joan L.","last_name":"Arolas","full_name":"Arolas, Joan L."},{"full_name":"Kostan, Julius","first_name":"Julius","last_name":"Kostan"},{"first_name":"Muhammad Bashir","last_name":"Khan","full_name":"Khan, Muhammad Bashir"},{"last_name":"Schreiner","first_name":"Claudia","full_name":"Schreiner, Claudia"},{"id":"41F1F098-F248-11E8-B48F-1D18A9856A87","full_name":"Testa Salmazo, Anita P","first_name":"Anita P","last_name":"Testa Salmazo"},{"full_name":"Ciccarelli, Luciano","first_name":"Luciano","last_name":"Ciccarelli"},{"full_name":"Puchinger, Martin","first_name":"Martin","last_name":"Puchinger"},{"full_name":"Gkougkoulia, Eirini A.","first_name":"Eirini A.","last_name":"Gkougkoulia"},{"first_name":"Euripedes de Almeida","last_name":"Ribeiro","full_name":"Ribeiro, Euripedes de Almeida"},{"first_name":"Thomas C.","last_name":"Marlovits","full_name":"Marlovits, Thomas C."},{"full_name":"Bhattacharya, Alok","last_name":"Bhattacharya","first_name":"Alok"},{"last_name":"Djinovic-Carugo","first_name":"Kristina","full_name":"Djinovic-Carugo, Kristina"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":1,"type":"journal_article","intvolume":"         1","language":[{"iso":"eng"}],"status":"public","doi":"10.2140/pmp.2020.1.101","date_published":"2020-11-16T00:00:00Z","scopus_import":"1","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","page":"101-146","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1908.01653"}],"department":[{"_id":"LaEr"}],"publisher":"Mathematical Sciences Publishers","month":"11","publication_identifier":{"issn":["2690-1005","2690-0998"]},"publication":"Probability and Mathematical Physics","oa":1,"day":"16","author":[{"orcid":"0000-0002-4901-7992","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","full_name":"Cipolloni, Giorgio","last_name":"Cipolloni","first_name":"Giorgio"},{"full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","first_name":"László","last_name":"Erdös"},{"last_name":"Schröder","first_name":"Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87","full_name":"Schröder, Dominik J","orcid":"0000-0002-2904-1856"}],"citation":{"short":"G. Cipolloni, L. Erdös, D.J. Schröder, Probability and Mathematical Physics 1 (2020) 101–146.","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.","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>.","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.","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>","apa":"Cipolloni, G., Erdös, L., &#38; Schröder, D. J. (2020). Optimal lower bound on the least singular value of the shifted Ginibre ensemble. <i>Probability and Mathematical Physics</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/pmp.2020.1.101\">https://doi.org/10.2140/pmp.2020.1.101</a>","mla":"Cipolloni, Giorgio, et al. “Optimal Lower Bound on the Least Singular Value of the Shifted Ginibre Ensemble.” <i>Probability and Mathematical Physics</i>, vol. 1, no. 1, Mathematical Sciences Publishers, 2020, pp. 101–46, doi:<a href=\"https://doi.org/10.2140/pmp.2020.1.101\">10.2140/pmp.2020.1.101</a>."},"date_updated":"2024-03-04T10:33:15Z","issue":"1","project":[{"grant_number":"338804","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program"}],"external_id":{"arxiv":["1908.01653"]},"title":"Optimal lower bound on the least singular value of the shifted Ginibre ensemble","year":"2020","_id":"15063","ec_funded":1,"date_created":"2024-03-04T10:27:57Z","oa_version":"Preprint","keyword":["General Medicine"],"article_processing_charge":"No","quality_controlled":"1","abstract":[{"lang":"eng","text":"We consider the least singular value of a large random matrix with real or complex i.i.d. Gaussian entries shifted by a constant z∈C. We prove an optimal lower tail estimate on this singular value in the critical regime where z is around the spectral edge, thus improving the classical bound of Sankar, Spielman and Teng (SIAM J. Matrix Anal. Appl. 28:2 (2006), 446–476) for the particular shift-perturbation in the edge regime. Lacking Brézin–Hikami formulas in the real case, we rely on the superbosonization formula (Comm. Math. Phys. 283:2 (2008), 343–395)."}],"publication_status":"published","article_type":"original"},{"issue":"4","has_accepted_license":"1","title":"Čech-Delaunay gradient flow and homology inference for self-maps","publication_identifier":{"issn":["2367-1726"],"eissn":["2367-1734"]},"publication":"Journal of Applied and Computational Topology","oa":1,"day":"01","citation":{"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>.","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.","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>","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>","short":"U. Bauer, H. Edelsbrunner, G. Jablonski, M. Mrozek, Journal of Applied and Computational Topology 4 (2020) 455–480."},"date_updated":"2024-03-04T10:54:04Z","author":[{"full_name":"Bauer, U.","first_name":"U.","last_name":"Bauer"},{"first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"orcid":"0000-0002-3536-9866","id":"4483EF78-F248-11E8-B48F-1D18A9856A87","full_name":"Jablonski, Grzegorz","last_name":"Jablonski","first_name":"Grzegorz"},{"first_name":"M.","last_name":"Mrozek","full_name":"Mrozek, M."}],"oa_version":"Published Version","article_processing_charge":"Yes (via OA deal)","quality_controlled":"1","file":[{"checksum":"eed1168b6e66cd55272c19bb7fca8a1c","content_type":"application/pdf","file_size":851190,"creator":"dernst","access_level":"open_access","file_name":"2020_JourApplCompTopology_Bauer.pdf","success":1,"relation":"main_file","date_created":"2024-03-04T10:52:42Z","file_id":"15065","date_updated":"2024-03-04T10:52:42Z"}],"abstract":[{"lang":"eng","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."}],"publication_status":"published","article_type":"original","year":"2020","_id":"15064","date_created":"2024-03-04T10:47:49Z","ddc":["500"],"intvolume":"         4","language":[{"iso":"eng"}],"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"doi":"10.1007/s41468-020-00058-8","date_published":"2020-12-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2024-03-04T10:52:42Z","volume":4,"type":"journal_article","publisher":"Springer Nature","department":[{"_id":"HeEd"}],"month":"12","scopus_import":"1","acknowledgement":"This research has been supported by the DFG Collaborative Research Center SFB/TRR 109 “Discretization in Geometry and Dynamics”, by Polish MNiSzW Grant No. 2621/7.PR/12/2013/2, by the Polish National Science Center under Maestro Grant No. 2014/14/A/ST1/00453 and Grant No. DEC-2013/09/N/ST6/02995. Open Access funding provided by Projekt DEAL.","page":"455-480"},{"has_accepted_license":"1","article_number":"40","title":"Brief announcement: Efficient load-balancing through distributed token dropping","external_id":{"arxiv":["2005.07761"]},"day":"07","oa":1,"publication":"34th International Symposium on Distributed Computing","author":[{"first_name":"Sebastian","last_name":"Brandt","full_name":"Brandt, Sebastian"},{"last_name":"Keller","first_name":"Barbara","full_name":"Keller, Barbara"},{"id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","full_name":"Rybicki, Joel","orcid":"0000-0002-6432-6646","first_name":"Joel","last_name":"Rybicki"},{"full_name":"Suomela, Jukka","first_name":"Jukka","last_name":"Suomela"},{"first_name":"Jara","last_name":"Uitto","full_name":"Uitto, Jara"}],"date_updated":"2024-03-05T07:13:13Z","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>","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>","mla":"Brandt, Sebastian, et al. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.” <i>34th International Symposium on Distributed Computing</i>, vol. 179, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.40\">10.4230/LIPIcs.DISC.2020.40</a>.","ista":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. 2020. Brief announcement: Efficient load-balancing through distributed token dropping. 34th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 179, 40.","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>.","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."},"quality_controlled":"1","article_processing_charge":"No","oa_version":"Published Version","publication_status":"published","related_material":{"record":[{"relation":"later_version","status":"public","id":"9678"}]},"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"}],"file":[{"date_updated":"2024-03-05T07:08:27Z","file_id":"15075","relation":"main_file","success":1,"date_created":"2024-03-05T07:08:27Z","file_name":"2020_LIPIcs_Brandt.pdf","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":303529,"checksum":"23e2d9321aef53092dc1e24a8ab82d72"}],"date_created":"2024-03-05T07:09:12Z","_id":"15074","year":"2020","intvolume":"       179","ddc":["000"],"alternative_title":["LIPIcs"],"date_published":"2020-10-07T00:00:00Z","doi":"10.4230/LIPIcs.DISC.2020.40","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"file_date_updated":"2024-03-05T07:08:27Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","volume":179,"license":"https://creativecommons.org/licenses/by/3.0/","month":"10","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"DaAl"}],"scopus_import":"1","arxiv":1,"conference":{"start_date":"2020-10-12","name":"DISC: Symposium on Distributed Computing","location":"Virtual","end_date":"2020-10-16"}},{"title":"Dynamic averaging load balancing on cycles","external_id":{"arxiv":["2003.09297"]},"project":[{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"article_number":"7","has_accepted_license":"1","date_updated":"2024-03-05T07:35:53Z","citation":{"ieee":"D.-A. Alistarh, G. Nadiradze, and A. Sabour, “Dynamic averaging load balancing on cycles,” in <i>47th International Colloquium on Automata, Languages, and Programming</i>, Saarbrücken, Germany, Virtual, 2020, vol. 168.","ama":"Alistarh D-A, Nadiradze G, Sabour A. Dynamic averaging load balancing on cycles. In: <i>47th International Colloquium on Automata, Languages, and Programming</i>. Vol 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2020.7\">10.4230/LIPIcs.ICALP.2020.7</a>","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>","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>.","ista":"Alistarh D-A, Nadiradze G, Sabour A. 2020. Dynamic averaging load balancing on cycles. 47th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 168, 7.","chicago":"Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic Averaging Load Balancing on Cycles.” In <i>47th International Colloquium on Automata, Languages, and Programming</i>, Vol. 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2020.7\">https://doi.org/10.4230/LIPIcs.ICALP.2020.7</a>.","short":"D.-A. Alistarh, G. Nadiradze, A. Sabour, in:, 47th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020."},"author":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"},{"first_name":"Giorgi","last_name":"Nadiradze","orcid":"0000-0001-5634-0731","full_name":"Nadiradze, Giorgi","id":"3279A00C-F248-11E8-B48F-1D18A9856A87"},{"id":"bcc145fd-e77f-11ea-ae8b-80d661dbff67","full_name":"Sabour, Amirmojtaba","first_name":"Amirmojtaba","last_name":"Sabour"}],"oa":1,"publication":"47th International Colloquium on Automata, Languages, and Programming","day":"29","abstract":[{"text":"We consider the following dynamic load-balancing process: given an underlying graph G with n nodes, in each step t≥ 0, one unit of load is created, and placed at a randomly chosen graph node. In the same step, the chosen node picks a random neighbor, and the two nodes balance their loads by averaging them. We are interested in the expected gap between the minimum and maximum loads at nodes as the process progresses, and its dependence on n and on the graph structure. Variants of the above graphical balanced allocation process have been studied previously by Peres, Talwar, and Wieder [Peres et al., 2015], and by Sauerwald and Sun [Sauerwald and Sun, 2015]. These authors left as open the question of characterizing the gap in the case of cycle graphs in the dynamic case, where weights are created during the algorithm’s execution. For this case, the only known upper bound is of 𝒪(n log n), following from a majorization argument due to [Peres et al., 2015], which analyzes a related graphical allocation process. In this paper, we provide an upper bound of 𝒪 (√n log n) on the expected gap of the above process for cycles of length n. We introduce a new potential analysis technique, which enables us to bound the difference in load between k-hop neighbors on the cycle, for any k ≤ n/2. We complement this with a \"gap covering\" argument, which bounds the maximum value of the gap by bounding its value across all possible subsets of a certain structure, and recursively bounding the gaps within each subset. We provide analytical and experimental evidence that our upper bound on the gap is tight up to a logarithmic factor.","lang":"eng"}],"file":[{"checksum":"e5eb16199f4ccfd77a321977eb3f026f","file_size":782987,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2020_LIPIcs_Alistarh.pdf","relation":"main_file","success":1,"date_created":"2024-03-05T07:25:15Z","file_id":"15078","date_updated":"2024-03-05T07:25:15Z"}],"publication_status":"published","related_material":{"record":[{"status":"public","id":"8286","relation":"later_version"}]},"article_processing_charge":"No","oa_version":"Published Version","quality_controlled":"1","_id":"15077","year":"2020","date_created":"2024-03-05T07:25:37Z","ec_funded":1,"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"date_published":"2020-06-29T00:00:00Z","doi":"10.4230/LIPIcs.ICALP.2020.7","intvolume":"       168","ddc":["000"],"alternative_title":["LIPIcs"],"volume":168,"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2024-03-05T07:25:15Z","month":"06","department":[{"_id":"DaAl"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","start_date":"2020-07-08","location":"Saarbrücken, Germany, Virtual","end_date":"2020-07-11"},"arxiv":1,"scopus_import":"1","acknowledgement":"The authors sincerely thank Thomas Sauerwald and George Giakkoupis for insightful discussions, and Mohsen Ghaffari, Yuval Peres, and Udi Wieder for feedback on earlier\r\nversions of this draft. We also thank the ICALP anonymous reviewers for their very useful comments.\r\nFunding: European Research Council funding award PR1042ERC01"},{"article_number":"56","language":[{"iso":"eng"}],"status":"public","title":"Disjoint tree-compatible plane perfect matchings","date_published":"2020-04-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"36th European Workshop on Computational Geometry","oa":1,"day":"01","author":[{"full_name":"Aichholzer, Oswin","last_name":"Aichholzer","first_name":"Oswin"},{"full_name":"Obmann, Julia","first_name":"Julia","last_name":"Obmann"},{"last_name":"Patak","first_name":"Pavel","full_name":"Patak, Pavel","id":"B593B804-1035-11EA-B4F1-947645A5BB83"},{"first_name":"Daniel","last_name":"Perz","full_name":"Perz, Daniel"},{"last_name":"Tkadlec","first_name":"Josef","full_name":"Tkadlec, Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684"}],"type":"conference","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.","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.","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.","apa":"Aichholzer, O., Obmann, J., Patak, P., Perz, D., &#38; Tkadlec, J. (2020). Disjoint tree-compatible plane perfect matchings. In <i>36th European Workshop on Computational Geometry</i>. Würzburg, Germany, Virtual.","ama":"Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. Disjoint tree-compatible plane perfect matchings. In: <i>36th European Workshop on Computational Geometry</i>. ; 2020.","mla":"Aichholzer, Oswin, et al. “Disjoint Tree-Compatible Plane Perfect Matchings.” <i>36th European Workshop on Computational Geometry</i>, 56, 2020."},"date_updated":"2024-03-05T09:00:07Z","oa_version":"Published Version","article_processing_charge":"No","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/data/uploads/papers/eurocg20_paper_56.pdf"}],"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."}],"department":[{"_id":"KrCh"},{"_id":"UlWa"}],"publication_status":"published","month":"04","year":"2020","_id":"15082","date_created":"2024-03-05T08:57:17Z","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.","conference":{"name":"EuroCG: European Workshop on Computational Geometry","location":"Würzburg, Germany, Virtual","start_date":"2020-03-16","end_date":"2020-03-18"}},{"intvolume":"       191","doi":"10.4007/annals.2020.191.3.4","date_published":"2020-05-01T00:00:00Z","language":[{"iso":"eng"}],"status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","volume":191,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1711.10451"}],"isi":1,"publisher":"Princeton University","department":[{"_id":"TiBr"}],"month":"05","arxiv":1,"page":"893-948","issue":"3","external_id":{"isi":["000526986300004"],"arxiv":["1711.10451"]},"title":"A geometric version of the circle method","day":"01","publist_id":"7744","publication":"Annals of Mathematics","oa":1,"author":[{"id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177","first_name":"Timothy D","last_name":"Browning"},{"full_name":"Sawin, Will","first_name":"Will","last_name":"Sawin"}],"date_updated":"2023-08-17T07:12:37Z","citation":{"short":"T.D. Browning, W. Sawin, Annals of Mathematics 191 (2020) 893–948.","apa":"Browning, T. D., &#38; Sawin, W. (2020). A geometric version of the circle method. <i>Annals of Mathematics</i>. Princeton University. <a href=\"https://doi.org/10.4007/annals.2020.191.3.4\">https://doi.org/10.4007/annals.2020.191.3.4</a>","ieee":"T. D. Browning and W. Sawin, “A geometric version of the circle method,” <i>Annals of Mathematics</i>, vol. 191, no. 3. Princeton University, pp. 893–948, 2020.","ama":"Browning TD, Sawin W. A geometric version of the circle method. <i>Annals of Mathematics</i>. 2020;191(3):893-948. doi:<a href=\"https://doi.org/10.4007/annals.2020.191.3.4\">10.4007/annals.2020.191.3.4</a>","mla":"Browning, Timothy D., and Will Sawin. “A Geometric Version of the Circle Method.” <i>Annals of Mathematics</i>, vol. 191, no. 3, Princeton University, 2020, pp. 893–948, doi:<a href=\"https://doi.org/10.4007/annals.2020.191.3.4\">10.4007/annals.2020.191.3.4</a>.","ista":"Browning TD, Sawin W. 2020. A geometric version of the circle method. Annals of Mathematics. 191(3), 893–948.","chicago":"Browning, Timothy D, and Will Sawin. “A Geometric Version of the Circle Method.” <i>Annals of Mathematics</i>. Princeton University, 2020. <a href=\"https://doi.org/10.4007/annals.2020.191.3.4\">https://doi.org/10.4007/annals.2020.191.3.4</a>."},"quality_controlled":"1","oa_version":"Preprint","article_processing_charge":"No","article_type":"original","publication_status":"published","abstract":[{"text":"We develop a geometric version of the circle method and use it to compute the compactly supported cohomology of the space of rational curves through a point on a smooth affine hypersurface of sufficiently low degree.","lang":"eng"}],"date_created":"2018-12-11T11:45:02Z","year":"2020","_id":"177"},{"title":"Density of rational points on a quadric bundle in ℙ3×ℙ3","external_id":{"arxiv":["1805.10715"],"isi":["000582676300002"]},"issue":"16","date_updated":"2023-10-17T12:51:10Z","author":[{"last_name":"Browning","first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177"},{"full_name":"Heath Brown, Roger","first_name":"Roger","last_name":"Heath Brown"}],"citation":{"ieee":"T. D. Browning and R. Heath Brown, “Density of rational points on a quadric bundle in ℙ3×ℙ3,” <i>Duke Mathematical Journal</i>, vol. 169, no. 16. Duke University Press, pp. 3099–3165, 2020.","ama":"Browning TD, Heath Brown R. Density of rational points on a quadric bundle in ℙ3×ℙ3. <i>Duke Mathematical Journal</i>. 2020;169(16):3099-3165. doi:<a href=\"https://doi.org/10.1215/00127094-2020-0031\">10.1215/00127094-2020-0031</a>","apa":"Browning, T. D., &#38; Heath Brown, R. (2020). Density of rational points on a quadric bundle in ℙ3×ℙ3. <i>Duke Mathematical Journal</i>. Duke University Press. <a href=\"https://doi.org/10.1215/00127094-2020-0031\">https://doi.org/10.1215/00127094-2020-0031</a>","mla":"Browning, Timothy D., and Roger Heath Brown. “Density of Rational Points on a Quadric Bundle in ℙ3×ℙ3.” <i>Duke Mathematical Journal</i>, vol. 169, no. 16, Duke University Press, 2020, pp. 3099–165, doi:<a href=\"https://doi.org/10.1215/00127094-2020-0031\">10.1215/00127094-2020-0031</a>.","ista":"Browning TD, Heath Brown R. 2020. Density of rational points on a quadric bundle in ℙ3×ℙ3. Duke Mathematical Journal. 169(16), 3099–3165.","chicago":"Browning, Timothy D, and Roger Heath Brown. “Density of Rational Points on a Quadric Bundle in ℙ3×ℙ3.” <i>Duke Mathematical Journal</i>. Duke University Press, 2020. <a href=\"https://doi.org/10.1215/00127094-2020-0031\">https://doi.org/10.1215/00127094-2020-0031</a>.","short":"T.D. Browning, R. Heath Brown, Duke Mathematical Journal 169 (2020) 3099–3165."},"day":"10","oa":1,"publication_identifier":{"issn":["0012-7094"]},"publication":"Duke Mathematical Journal","article_type":"original","publication_status":"published","abstract":[{"lang":"eng","text":"An asymptotic formula is established for the number of rational points of bounded anticanonical height which lie on a certain Zariski dense subset of the biprojective hypersurface x1y21+⋯+x4y24=0 in ℙ3×ℙ3. This confirms the modified Manin conjecture for this variety, in which the removal of a thin set of rational points is allowed."}],"quality_controlled":"1","article_processing_charge":"No","oa_version":"Preprint","date_created":"2018-12-11T11:45:02Z","_id":"179","year":"2020","date_published":"2020-09-10T00:00:00Z","doi":"10.1215/00127094-2020-0031","status":"public","language":[{"iso":"eng"}],"intvolume":"       169","type":"journal_article","volume":169,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"09","department":[{"_id":"TiBr"}],"publisher":"Duke University Press","isi":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1805.10715"}],"arxiv":1,"page":"3099-3165"},{"ddc":["006"],"intvolume":"        26","date_published":"2020-06-01T00:00:00Z","doi":"10.1109/TVCG.2018.2883628","status":"public","language":[{"iso":"eng"}],"file_date_updated":"2020-10-08T08:34:53Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","type":"journal_article","volume":26,"isi":1,"month":"06","publisher":"IEEE","department":[{"_id":"ChWo"}],"acknowledgement":"This work was partially supported by JSPS Grant-in-Aid forYoung Scientists (Start-up) 16H07410, the ERC StartingGrantsrealFlow(StG-2015-637014) andBigSplash(StG-2014-638176). This research was supported by the Scientific Ser-vice Units (SSU) of IST Austria through resources providedby Scientific Computing. We would like to express my grati-tude to Nobuyuki Umetani and Tomas Skrivan for insight-ful discussion.","scopus_import":"1","page":"2288-2302","has_accepted_license":"1","issue":"6","title":"Simulating liquids on dynamically warping grids","external_id":{"isi":["000532295600014"],"pmid":["30507534"]},"day":"01","oa":1,"publication":"IEEE Transactions on Visualization and Computer Graphics","publication_identifier":{"eissn":["19410506"],"issn":["10772626"]},"date_updated":"2023-09-18T09:30:01Z","author":[{"full_name":"Hikaru, Ibayashi","last_name":"Hikaru","first_name":"Ibayashi"},{"last_name":"Wojtan","first_name":"Christopher J","full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546"},{"full_name":"Thuerey, Nils","first_name":"Nils","last_name":"Thuerey"},{"full_name":"Igarashi, Takeo","last_name":"Igarashi","first_name":"Takeo"},{"last_name":"Ando","first_name":"Ryoichi","full_name":"Ando, Ryoichi"}],"citation":{"ista":"Hikaru I, Wojtan C, Thuerey N, Igarashi T, Ando R. 2020. Simulating liquids on dynamically warping grids. IEEE Transactions on Visualization and Computer Graphics. 26(6), 2288–2302.","chicago":"Hikaru, Ibayashi, Chris Wojtan, Nils Thuerey, Takeo Igarashi, and Ryoichi Ando. “Simulating Liquids on Dynamically Warping Grids.” <i>IEEE Transactions on Visualization and Computer Graphics</i>. IEEE, 2020. <a href=\"https://doi.org/10.1109/TVCG.2018.2883628\">https://doi.org/10.1109/TVCG.2018.2883628</a>.","ieee":"I. Hikaru, C. Wojtan, N. Thuerey, T. Igarashi, and R. Ando, “Simulating liquids on dynamically warping grids,” <i>IEEE Transactions on Visualization and Computer Graphics</i>, vol. 26, no. 6. IEEE, pp. 2288–2302, 2020.","ama":"Hikaru I, Wojtan C, Thuerey N, Igarashi T, Ando R. Simulating liquids on dynamically warping grids. <i>IEEE Transactions on Visualization and Computer Graphics</i>. 2020;26(6):2288-2302. doi:<a href=\"https://doi.org/10.1109/TVCG.2018.2883628\">10.1109/TVCG.2018.2883628</a>","apa":"Hikaru, I., Wojtan, C., Thuerey, N., Igarashi, T., &#38; Ando, R. (2020). Simulating liquids on dynamically warping grids. <i>IEEE Transactions on Visualization and Computer Graphics</i>. IEEE. <a href=\"https://doi.org/10.1109/TVCG.2018.2883628\">https://doi.org/10.1109/TVCG.2018.2883628</a>","mla":"Hikaru, Ibayashi, et al. “Simulating Liquids on Dynamically Warping Grids.” <i>IEEE Transactions on Visualization and Computer Graphics</i>, vol. 26, no. 6, IEEE, 2020, pp. 2288–302, doi:<a href=\"https://doi.org/10.1109/TVCG.2018.2883628\">10.1109/TVCG.2018.2883628</a>.","short":"I. Hikaru, C. Wojtan, N. Thuerey, T. Igarashi, R. Ando, IEEE Transactions on Visualization and Computer Graphics 26 (2020) 2288–2302."},"quality_controlled":"1","article_processing_charge":"No","oa_version":"Submitted Version","article_type":"original","publication_status":"published","abstract":[{"lang":"eng","text":"We introduce dynamically warping grids for adaptive liquid simulation. Our primary contributions are a strategy for dynamically deforming regular grids over the course of a simulation and a method for efficiently utilizing these deforming grids for liquid simulation. Prior work has shown that unstructured grids are very effective for adaptive fluid simulations. However, unstructured grids often lead to complicated implementations and a poor cache hit rate due to inconsistent memory access. Regular grids, on the other hand, provide a fast, fixed memory access pattern and straightforward implementation. Our method combines the advantages of both: we leverage the simplicity of regular grids while still achieving practical and controllable spatial adaptivity. We demonstrate that our method enables adaptive simulations that are fast, flexible, and robust to null-space issues. At the same time, our method is simple to implement and takes advantage of existing highly-tuned algorithms."}],"file":[{"file_name":"preprint.pdf","success":1,"date_created":"2020-10-08T08:34:53Z","relation":"main_file","file_id":"8626","date_updated":"2020-10-08T08:34:53Z","checksum":"8d4c55443a0ee335bb5bb652de503042","file_size":21910098,"content_type":"application/pdf","creator":"wojtan","access_level":"open_access"}],"pmid":1,"date_created":"2018-12-16T22:59:21Z","_id":"5681","year":"2020","acknowledged_ssus":[{"_id":"ScienComp"}]}]