[{"date_created":"2024-03-04T10:27:57Z","day":"16","status":"public","volume":1,"ec_funded":1,"oa_version":"Preprint","doi":"10.2140/pmp.2020.1.101","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1908.01653","open_access":"1"}],"publication":"Probability and Mathematical Physics","date_updated":"2024-03-04T10:33:15Z","keyword":["General Medicine"],"issue":"1","oa":1,"month":"11","intvolume":"         1","date_published":"2020-11-16T00:00:00Z","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","year":"2020","external_id":{"arxiv":["1908.01653"]},"page":"101-146","_id":"15063","quality_controlled":"1","citation":{"chicago":"Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Optimal Lower Bound on the Least Singular Value of the Shifted Ginibre Ensemble.” <i>Probability and Mathematical Physics</i>. Mathematical Sciences Publishers, 2020. <a href=\"https://doi.org/10.2140/pmp.2020.1.101\">https://doi.org/10.2140/pmp.2020.1.101</a>.","ista":"Cipolloni G, Erdös L, Schröder DJ. 2020. Optimal lower bound on the least singular value of the shifted Ginibre ensemble. Probability and Mathematical Physics. 1(1), 101–146.","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Probability and Mathematical Physics 1 (2020) 101–146.","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>","mla":"Cipolloni, Giorgio, et al. “Optimal Lower Bound on the Least Singular Value of the Shifted Ginibre Ensemble.” <i>Probability and Mathematical Physics</i>, vol. 1, no. 1, Mathematical Sciences Publishers, 2020, pp. 101–46, doi:<a href=\"https://doi.org/10.2140/pmp.2020.1.101\">10.2140/pmp.2020.1.101</a>.","apa":"Cipolloni, G., Erdös, L., &#38; Schröder, D. J. (2020). Optimal lower bound on the least singular value of the shifted Ginibre ensemble. <i>Probability and Mathematical Physics</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/pmp.2020.1.101\">https://doi.org/10.2140/pmp.2020.1.101</a>"},"publication_identifier":{"issn":["2690-1005","2690-0998"]},"type":"journal_article","scopus_import":"1","arxiv":1,"abstract":[{"text":"We consider the least singular value of a large random matrix with real or complex i.i.d. Gaussian entries shifted by a constant z∈C. We prove an optimal lower tail estimate on this singular value in the critical regime where z is around the spectral edge, thus improving the classical bound of Sankar, Spielman and Teng (SIAM J. Matrix Anal. Appl. 28:2 (2006), 446–476) for the particular shift-perturbation in the edge regime. Lacking Brézin–Hikami formulas in the real case, we rely on the superbosonization formula (Comm. Math. Phys. 283:2 (2008), 343–395).","lang":"eng"}],"project":[{"call_identifier":"FP7","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"},{"grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"}],"publication_status":"published","author":[{"orcid":"0000-0002-4901-7992","last_name":"Cipolloni","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","first_name":"Giorgio","full_name":"Cipolloni, Giorgio"},{"full_name":"Erdös, László","orcid":"0000-0001-5366-9603","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László"},{"id":"408ED176-F248-11E8-B48F-1D18A9856A87","first_name":"Dominik J","orcid":"0000-0002-2904-1856","last_name":"Schröder","full_name":"Schröder, Dominik J"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Optimal lower bound on the least singular value of the shifted Ginibre ensemble","publisher":"Mathematical Sciences Publishers","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","department":[{"_id":"LaEr"}]},{"publication_status":"published","_id":"15064","quality_controlled":"1","publication_identifier":{"issn":["2367-1726"],"eissn":["2367-1734"]},"citation":{"apa":"Bauer, U., Edelsbrunner, H., Jablonski, G., &#38; Mrozek, M. (2020). Čech-Delaunay gradient flow and homology inference for self-maps. <i>Journal of Applied and Computational Topology</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s41468-020-00058-8\">https://doi.org/10.1007/s41468-020-00058-8</a>","mla":"Bauer, U., et al. “Čech-Delaunay Gradient Flow and Homology Inference for Self-Maps.” <i>Journal of Applied and Computational Topology</i>, vol. 4, no. 4, Springer Nature, 2020, pp. 455–80, doi:<a href=\"https://doi.org/10.1007/s41468-020-00058-8\">10.1007/s41468-020-00058-8</a>.","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.","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.","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.","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>."},"scopus_import":"1","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."}],"file_date_updated":"2024-03-04T10:52:42Z","type":"journal_article","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"Yes (via OA deal)","department":[{"_id":"HeEd"}],"title":"Čech-Delaunay gradient flow and homology inference for self-maps","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Bauer","first_name":"U.","full_name":"Bauer, U."},{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"id":"4483EF78-F248-11E8-B48F-1D18A9856A87","first_name":"Grzegorz","last_name":"Jablonski","orcid":"0000-0002-3536-9866","full_name":"Jablonski, Grzegorz"},{"last_name":"Mrozek","first_name":"M.","full_name":"Mrozek, M."}],"file":[{"date_updated":"2024-03-04T10:52:42Z","date_created":"2024-03-04T10:52:42Z","file_name":"2020_JourApplCompTopology_Bauer.pdf","success":1,"checksum":"eed1168b6e66cd55272c19bb7fca8a1c","relation":"main_file","access_level":"open_access","file_size":851190,"creator":"dernst","content_type":"application/pdf","file_id":"15065"}],"has_accepted_license":"1","publisher":"Springer Nature","oa_version":"Published Version","publication":"Journal of Applied and Computational Topology","doi":"10.1007/s41468-020-00058-8","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["500"],"date_created":"2024-03-04T10:47:49Z","day":"01","status":"public","volume":4,"year":"2020","page":"455-480","license":"https://creativecommons.org/licenses/by/4.0/","date_updated":"2024-03-04T10:54:04Z","oa":1,"issue":"4","date_published":"2020-12-01T00:00:00Z","month":"12","intvolume":"         4","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."},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Brief announcement: Efficient load-balancing through distributed token dropping","author":[{"last_name":"Brandt","first_name":"Sebastian","full_name":"Brandt, Sebastian"},{"last_name":"Keller","first_name":"Barbara","full_name":"Keller, Barbara"},{"full_name":"Rybicki, Joel","last_name":"Rybicki","orcid":"0000-0002-6432-6646","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","first_name":"Joel"},{"full_name":"Suomela, Jukka","last_name":"Suomela","first_name":"Jukka"},{"full_name":"Uitto, Jara","last_name":"Uitto","first_name":"Jara"}],"file":[{"content_type":"application/pdf","file_id":"15075","file_size":303529,"creator":"dernst","access_level":"open_access","relation":"main_file","checksum":"23e2d9321aef53092dc1e24a8ab82d72","success":1,"file_name":"2020_LIPIcs_Brandt.pdf","date_updated":"2024-03-05T07:08:27Z","date_created":"2024-03-05T07:08:27Z"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","has_accepted_license":"1","language":[{"iso":"eng"}],"department":[{"_id":"DaAl"}],"article_processing_charge":"No","quality_controlled":"1","_id":"15074","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"}],"scopus_import":"1","arxiv":1,"type":"conference","file_date_updated":"2024-03-05T07:08:27Z","citation":{"apa":"Brandt, S., Keller, B., Rybicki, J., Suomela, J., &#38; Uitto, J. (2020). Brief announcement: Efficient load-balancing through distributed token dropping. In <i>34th International Symposium on Distributed Computing</i> (Vol. 179). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.40\">https://doi.org/10.4230/LIPIcs.DISC.2020.40</a>","mla":"Brandt, Sebastian, et al. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.” <i>34th International Symposium on Distributed Computing</i>, vol. 179, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.40\">10.4230/LIPIcs.DISC.2020.40</a>.","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.","ista":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. 2020. Brief announcement: Efficient load-balancing through distributed token dropping. 34th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 179, 40.","short":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, 34th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","chicago":"Brandt, Sebastian, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.” In <i>34th International Symposium on Distributed Computing</i>, Vol. 179. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.40\">https://doi.org/10.4230/LIPIcs.DISC.2020.40</a>."},"publication_status":"published","oa":1,"date_updated":"2024-03-05T07:13:13Z","article_number":"40","date_published":"2020-10-07T00:00:00Z","alternative_title":["LIPIcs"],"month":"10","intvolume":"       179","year":"2020","conference":{"name":"DISC: Symposium on Distributed Computing","end_date":"2020-10-16","start_date":"2020-10-12","location":"Virtual"},"license":"https://creativecommons.org/licenses/by/3.0/","external_id":{"arxiv":["2005.07761"]},"status":"public","day":"07","tmp":{"short":"CC BY (3.0)","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","image":"/images/cc_by.png"},"date_created":"2024-03-05T07:09:12Z","ddc":["000"],"volume":179,"oa_version":"Published Version","related_material":{"record":[{"id":"9678","relation":"later_version","status":"public"}]},"publication":"34th International Symposium on Distributed Computing","doi":"10.4230/LIPIcs.DISC.2020.40"},{"title":"Dynamic averaging load balancing on cycles","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"},{"first_name":"Giorgi","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5634-0731","last_name":"Nadiradze","full_name":"Nadiradze, Giorgi"},{"last_name":"Sabour","id":"bcc145fd-e77f-11ea-ae8b-80d661dbff67","first_name":"Amirmojtaba","full_name":"Sabour, Amirmojtaba"}],"file":[{"access_level":"open_access","checksum":"e5eb16199f4ccfd77a321977eb3f026f","relation":"main_file","creator":"dernst","file_size":782987,"file_id":"15078","content_type":"application/pdf","date_updated":"2024-03-05T07:25:15Z","date_created":"2024-03-05T07:25:15Z","file_name":"2020_LIPIcs_Alistarh.pdf","success":1}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","has_accepted_license":"1","language":[{"iso":"eng"}],"department":[{"_id":"DaAl"}],"article_processing_charge":"No","quality_controlled":"1","_id":"15077","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"}],"arxiv":1,"scopus_import":"1","type":"conference","file_date_updated":"2024-03-05T07:25:15Z","citation":{"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>.","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.","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.","short":"D.-A. Alistarh, G. Nadiradze, A. Sabour, in:, 47th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ama":"Alistarh D-A, Nadiradze G, Sabour A. Dynamic averaging load balancing on cycles. In: <i>47th International Colloquium on Automata, Languages, and Programming</i>. Vol 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2020.7\">10.4230/LIPIcs.ICALP.2020.7</a>","mla":"Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.” <i>47th International Colloquium on Automata, Languages, and Programming</i>, vol. 168, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2020.7\">10.4230/LIPIcs.ICALP.2020.7</a>.","apa":"Alistarh, D.-A., Nadiradze, G., &#38; Sabour, A. (2020). Dynamic averaging load balancing on cycles. In <i>47th International Colloquium on Automata, Languages, and Programming</i> (Vol. 168). Saarbrücken, Germany, Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2020.7\">https://doi.org/10.4230/LIPIcs.ICALP.2020.7</a>"},"publication_status":"published","project":[{"call_identifier":"H2020","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"oa":1,"date_updated":"2024-03-05T07:35:53Z","article_number":"7","acknowledgement":"The authors sincerely thank Thomas Sauerwald and George Giakkoupis for insightful discussions, and Mohsen Ghaffari, Yuval Peres, and Udi Wieder for feedback on earlier\r\nversions of this draft. We also thank the ICALP anonymous reviewers for their very useful comments.\r\nFunding: European Research Council funding award PR1042ERC01","date_published":"2020-06-29T00:00:00Z","alternative_title":["LIPIcs"],"month":"06","intvolume":"       168","year":"2020","conference":{"location":"Saarbrücken, Germany, Virtual","end_date":"2020-07-11","start_date":"2020-07-08","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"external_id":{"arxiv":["2003.09297"]},"day":"29","status":"public","ddc":["000"],"tmp":{"short":"CC BY (3.0)","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","image":"/images/cc_by.png"},"date_created":"2024-03-05T07:25:37Z","volume":168,"oa_version":"Published Version","ec_funded":1,"related_material":{"record":[{"status":"public","relation":"later_version","id":"8286"}]},"publication":"47th International Colloquium on Automata, Languages, and Programming","doi":"10.4230/LIPIcs.ICALP.2020.7"},{"oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/data/uploads/papers/eurocg20_paper_56.pdf"}],"publication_status":"published","publication":"36th European Workshop on Computational Geometry","quality_controlled":"1","status":"public","day":"01","_id":"15082","date_created":"2024-03-05T08:57:17Z","type":"conference","abstract":[{"text":"Two plane drawings of geometric graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. For a given set S of 2n points two plane drawings of perfect matchings M1 and M2 (which do not need to be disjoint nor compatible) are disjoint tree-compatible if there exists a plane drawing of a spanning tree T on S which is disjoint compatible to both M1 and M2.\r\nWe show that the graph of all disjoint tree-compatible perfect geometric matchings on 2n points in convex position is connected if and only if 2n ≥ 10. Moreover, in that case the diameter\r\nof this graph is either 4 or 5, independent of n.","lang":"eng"}],"citation":{"chicago":"Aichholzer, Oswin, Julia Obmann, Pavel Patak, Daniel Perz, and Josef Tkadlec. “Disjoint Tree-Compatible Plane Perfect Matchings.” In <i>36th European Workshop on Computational Geometry</i>, 2020.","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.","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.","short":"O. Aichholzer, J. Obmann, P. Patak, D. Perz, J. Tkadlec, in:, 36th European Workshop on Computational Geometry, 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.","mla":"Aichholzer, Oswin, et al. “Disjoint Tree-Compatible Plane Perfect Matchings.” <i>36th European Workshop on Computational Geometry</i>, 56, 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."},"year":"2020","language":[{"iso":"eng"}],"conference":{"name":"EuroCG: European Workshop on Computational Geometry","start_date":"2020-03-16","end_date":"2020-03-18","location":"Würzburg, Germany, Virtual"},"department":[{"_id":"KrCh"},{"_id":"UlWa"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Disjoint tree-compatible plane perfect matchings","oa":1,"author":[{"last_name":"Aichholzer","first_name":"Oswin","full_name":"Aichholzer, Oswin"},{"last_name":"Obmann","first_name":"Julia","full_name":"Obmann, Julia"},{"full_name":"Patak, Pavel","first_name":"Pavel","id":"B593B804-1035-11EA-B4F1-947645A5BB83","last_name":"Patak"},{"first_name":"Daniel","last_name":"Perz","full_name":"Perz, Daniel"},{"orcid":"0000-0002-1097-9684","last_name":"Tkadlec","first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef"}],"date_updated":"2024-03-05T09:00:07Z","article_number":"56","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.","month":"04","date_published":"2020-04-01T00:00:00Z"},{"citation":{"mla":"Arnold, Georg M., et al. <i>Converting Microwave and Telecom Photons with a Silicon Photonic Nanomechanical Interface</i>. Zenodo, 2020, doi:<a href=\"https://doi.org/10.5281/ZENODO.3961561\">10.5281/ZENODO.3961561</a>.","apa":"Arnold, G. M., Wulf, M., Barzanjeh, S., Redchenko, E., Rueda Sanchez, A. R., Hease, W. J., … Fink, J. M. (2020). Converting microwave and telecom photons with a silicon photonic nanomechanical interface. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.3961561\">https://doi.org/10.5281/ZENODO.3961561</a>","chicago":"Arnold, Georg M, Matthias Wulf, Shabir Barzanjeh, Elena Redchenko, Alfredo R Rueda Sanchez, William J Hease, Farid Hassani, and Johannes M Fink. “Converting Microwave and Telecom Photons with a Silicon Photonic Nanomechanical Interface.” Zenodo, 2020. <a href=\"https://doi.org/10.5281/ZENODO.3961561\">https://doi.org/10.5281/ZENODO.3961561</a>.","ista":"Arnold GM, Wulf M, Barzanjeh S, Redchenko E, Rueda Sanchez AR, Hease WJ, Hassani F, Fink JM. 2020. Converting microwave and telecom photons with a silicon photonic nanomechanical interface, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.3961561\">10.5281/ZENODO.3961561</a>.","short":"G.M. Arnold, M. Wulf, S. Barzanjeh, E. Redchenko, A.R. Rueda Sanchez, W.J. Hease, F. Hassani, J.M. Fink, (2020).","ieee":"G. M. Arnold <i>et al.</i>, “Converting microwave and telecom photons with a silicon photonic nanomechanical interface.” Zenodo, 2020.","ama":"Arnold GM, Wulf M, Barzanjeh S, et al. Converting microwave and telecom photons with a silicon photonic nanomechanical interface. 2020. doi:<a href=\"https://doi.org/10.5281/ZENODO.3961561\">10.5281/ZENODO.3961561</a>"},"abstract":[{"lang":"eng","text":"This datasets comprises all data shown in plots of the submitted article \"Converting microwave and telecom photons with a silicon photonic nanomechanical interface\". Additional raw data are available from the corresponding author on reasonable request."}],"type":"research_data_reference","_id":"13056","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2023-05-23T13:37:41Z","ddc":["530"],"status":"public","day":"27","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.3961562"}],"doi":"10.5281/ZENODO.3961561","related_material":{"record":[{"id":"8529","status":"public","relation":"used_in_publication"}]},"oa_version":"Published Version","date_published":"2020-07-27T00:00:00Z","month":"07","publisher":"Zenodo","date_updated":"2024-09-10T12:23:51Z","author":[{"full_name":"Arnold, Georg M","orcid":"0000-0003-1397-7876","last_name":"Arnold","first_name":"Georg M","id":"3770C838-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wulf","orcid":"0000-0001-6613-1378","id":"45598606-F248-11E8-B48F-1D18A9856A87","first_name":"Matthias","full_name":"Wulf, Matthias"},{"full_name":"Barzanjeh, Shabir","last_name":"Barzanjeh","orcid":"0000-0003-0415-1423","id":"2D25E1F6-F248-11E8-B48F-1D18A9856A87","first_name":"Shabir"},{"last_name":"Redchenko","id":"2C21D6E8-F248-11E8-B48F-1D18A9856A87","first_name":"Elena","full_name":"Redchenko, Elena"},{"full_name":"Rueda Sanchez, Alfredo R","first_name":"Alfredo R","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","last_name":"Rueda Sanchez","orcid":"0000-0001-6249-5860"},{"full_name":"Hease, William J","orcid":"0000-0001-9868-2166","last_name":"Hease","first_name":"William J","id":"29705398-F248-11E8-B48F-1D18A9856A87"},{"id":"2AED110C-F248-11E8-B48F-1D18A9856A87","first_name":"Farid","orcid":"0000-0001-6937-5773","last_name":"Hassani","full_name":"Hassani, Farid"},{"full_name":"Fink, Johannes M","last_name":"Fink","orcid":"0000-0001-8112-028X","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes M"}],"oa":1,"title":"Converting microwave and telecom photons with a silicon photonic nanomechanical interface","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","department":[{"_id":"JoFi"}],"year":"2020"},{"tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode"},"_id":"13060","date_created":"2023-05-23T16:11:22Z","ddc":["570"],"status":"public","day":"19","citation":{"chicago":"Milutinovic, Barbara, Miriam Stock, Anna V Grasse, Elisabeth Naderlinger, Christian Hilbe, and Sylvia Cremer. “Social Immunity Modulates Competition between Coinfecting Pathogens.” Dryad, 2020. <a href=\"https://doi.org/10.5061/DRYAD.CRJDFN318\">https://doi.org/10.5061/DRYAD.CRJDFN318</a>.","short":"B. Milutinovic, M. Stock, A.V. Grasse, E. Naderlinger, C. Hilbe, S. Cremer, (2020).","ista":"Milutinovic B, Stock M, Grasse AV, Naderlinger E, Hilbe C, Cremer S. 2020. Social immunity modulates competition between coinfecting pathogens, Dryad, <a href=\"https://doi.org/10.5061/DRYAD.CRJDFN318\">10.5061/DRYAD.CRJDFN318</a>.","ieee":"B. Milutinovic, M. Stock, A. V. Grasse, E. Naderlinger, C. Hilbe, and S. Cremer, “Social immunity modulates competition between coinfecting pathogens.” Dryad, 2020.","ama":"Milutinovic B, Stock M, Grasse AV, Naderlinger E, Hilbe C, Cremer S. Social immunity modulates competition between coinfecting pathogens. 2020. doi:<a href=\"https://doi.org/10.5061/DRYAD.CRJDFN318\">10.5061/DRYAD.CRJDFN318</a>","mla":"Milutinovic, Barbara, et al. <i>Social Immunity Modulates Competition between Coinfecting Pathogens</i>. Dryad, 2020, doi:<a href=\"https://doi.org/10.5061/DRYAD.CRJDFN318\">10.5061/DRYAD.CRJDFN318</a>.","apa":"Milutinovic, B., Stock, M., Grasse, A. V., Naderlinger, E., Hilbe, C., &#38; Cremer, S. (2020). Social immunity modulates competition between coinfecting pathogens. Dryad. <a href=\"https://doi.org/10.5061/DRYAD.CRJDFN318\">https://doi.org/10.5061/DRYAD.CRJDFN318</a>"},"type":"research_data_reference","abstract":[{"text":"Coinfections with multiple pathogens can result in complex within-host dynamics affecting virulence and transmission. Whilst multiple infections are intensively studied in solitary hosts, it is so far unresolved how social host interactions interfere with pathogen competition, and if this depends on coinfection diversity. We studied how the collective disease defenses of ants – their social immunity ­– influence pathogen competition in coinfections of same or different fungal pathogen species. Social immunity reduced virulence for all pathogen combinations, but interfered with spore production only in different-species coinfections. Here, it decreased overall pathogen sporulation success, whilst simultaneously increasing co-sporulation on individual cadavers and maintaining a higher pathogen diversity at the community-level. Mathematical modeling revealed that host sanitary care alone can modulate competitive outcomes between pathogens, giving advantage to fast-germinating, thus less grooming-sensitive ones. Host social interactions can hence modulate infection dynamics in coinfected group members, thereby altering pathogen communities at the host- and population-level.","lang":"eng"}],"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"7343"}]},"oa_version":"Published Version","doi":"10.5061/DRYAD.CRJDFN318","main_file_link":[{"url":"https://doi.org/10.5061/dryad.crjdfn318","open_access":"1"}],"date_updated":"2023-09-05T16:04:48Z","author":[{"last_name":"Milutinovic","orcid":"0000-0002-8214-4758","first_name":"Barbara","id":"2CDC32B8-F248-11E8-B48F-1D18A9856A87","full_name":"Milutinovic, Barbara"},{"full_name":"Stock, Miriam","first_name":"Miriam","id":"42462816-F248-11E8-B48F-1D18A9856A87","last_name":"Stock"},{"full_name":"Grasse, Anna V","id":"406F989C-F248-11E8-B48F-1D18A9856A87","first_name":"Anna V","last_name":"Grasse"},{"last_name":"Naderlinger","first_name":"Elisabeth","id":"31757262-F248-11E8-B48F-1D18A9856A87","full_name":"Naderlinger, Elisabeth"},{"full_name":"Hilbe, Christian","first_name":"Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5116-955X","last_name":"Hilbe"},{"orcid":"0000-0002-2193-3868","last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia","full_name":"Cremer, Sylvia"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Social immunity modulates competition between coinfecting pathogens","month":"12","date_published":"2020-12-19T00:00:00Z","publisher":"Dryad","year":"2020","article_processing_charge":"No","department":[{"_id":"SyCr"},{"_id":"KrCh"}],"license":"https://creativecommons.org/publicdomain/zero/1.0/"},{"author":[{"full_name":"Arnoux, Stephanie","last_name":"Arnoux","first_name":"Stephanie"},{"first_name":"Christelle","id":"32DF5794-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8441-5075","last_name":"Fraisse","full_name":"Fraisse, Christelle"},{"full_name":"Sauvage, Christopher","first_name":"Christopher","last_name":"Sauvage"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"VCF files of synonymous SNPs related to: Genomic inference of complex domestication histories in three Solanaceae species","oa":1,"date_updated":"2023-08-04T11:19:26Z","publisher":"Dryad","date_published":"2020-10-19T00:00:00Z","month":"10","year":"2020","department":[{"_id":"NiBa"}],"article_processing_charge":"No","day":"19","status":"public","ddc":["570"],"tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode"},"_id":"13065","date_created":"2023-05-23T16:30:20Z","abstract":[{"lang":"eng","text":"Domestication is a human-induced selection process that imprints the genomes of domesticated populations over a short evolutionary time scale, and that occurs in a given demographic context. Reconstructing historical gene flow, effective population size changes and their timing is therefore of fundamental interest to understand how plant demography and human selection jointly shape genomic divergence during domestication. Yet, the comparison under a single statistical framework of independent domestication histories across different crop species has been little evaluated so far. Thus, it is unclear whether domestication leads to convergent demographic changes that similarly affect crop genomes. To address this question, we used existing and new transcriptome data on three crop species of Solanaceae (eggplant, pepper and tomato), together with their close wild relatives. We fitted twelve demographic models of increasing complexity on the unfolded joint allele frequency spectrum for each wild/crop pair, and we found evidence for both shared and species-specific demographic processes between species. A convergent history of domestication with gene-flow was inferred for all three species, along with evidence of strong reduction in the effective population size during the cultivation stage of tomato and pepper. The absence of any reduction in size of the crop in eggplant stands out from the classical view of the domestication process; as does the existence of a “protracted period” of management before cultivation. Our results also suggest divergent management strategies of modern cultivars among species as their current demography substantially differs. Finally, the timing of domestication is species-specific and supported by the few historical records available."}],"type":"research_data_reference","citation":{"apa":"Arnoux, S., Fraisse, C., &#38; Sauvage, C. (2020). VCF files of synonymous SNPs related to: Genomic inference of complex domestication histories in three Solanaceae species. Dryad. <a href=\"https://doi.org/10.5061/DRYAD.Q2BVQ83HD\">https://doi.org/10.5061/DRYAD.Q2BVQ83HD</a>","mla":"Arnoux, Stephanie, et al. <i>VCF Files of Synonymous SNPs Related to: Genomic Inference of Complex Domestication Histories in Three Solanaceae Species</i>. Dryad, 2020, doi:<a href=\"https://doi.org/10.5061/DRYAD.Q2BVQ83HD\">10.5061/DRYAD.Q2BVQ83HD</a>.","ama":"Arnoux S, Fraisse C, Sauvage C. VCF files of synonymous SNPs related to: Genomic inference of complex domestication histories in three Solanaceae species. 2020. doi:<a href=\"https://doi.org/10.5061/DRYAD.Q2BVQ83HD\">10.5061/DRYAD.Q2BVQ83HD</a>","ieee":"S. Arnoux, C. Fraisse, and C. Sauvage, “VCF files of synonymous SNPs related to: Genomic inference of complex domestication histories in three Solanaceae species.” Dryad, 2020.","short":"S. Arnoux, C. Fraisse, C. Sauvage, (2020).","ista":"Arnoux S, Fraisse C, Sauvage C. 2020. VCF files of synonymous SNPs related to: Genomic inference of complex domestication histories in three Solanaceae species, Dryad, <a href=\"https://doi.org/10.5061/DRYAD.Q2BVQ83HD\">10.5061/DRYAD.Q2BVQ83HD</a>.","chicago":"Arnoux, Stephanie, Christelle Fraisse, and Christopher Sauvage. “VCF Files of Synonymous SNPs Related to: Genomic Inference of Complex Domestication Histories in Three Solanaceae Species.” Dryad, 2020. <a href=\"https://doi.org/10.5061/DRYAD.Q2BVQ83HD\">https://doi.org/10.5061/DRYAD.Q2BVQ83HD</a>."},"oa_version":"Published Version","related_material":{"link":[{"relation":"software","url":"https://github.com/starnoux/arnoux_et_al_2019"}],"record":[{"id":"8928","relation":"used_in_publication","status":"public"}]},"doi":"10.5061/DRYAD.Q2BVQ83HD","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.q2bvq83hd"}]},{"date_created":"2023-05-23T16:42:30Z","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"13070","ddc":["530"],"status":"public","day":"27","citation":{"chicago":"Peruzzo, Matilda, Andrea Trioni, Farid Hassani, Martin Zemlicka, and Johannes M Fink. “Surpassing the Resistance Quantum with a Geometric Superinductor.” Zenodo, 2020. <a href=\"https://doi.org/10.5281/ZENODO.4052882\">https://doi.org/10.5281/ZENODO.4052882</a>.","ieee":"M. Peruzzo, A. Trioni, F. Hassani, M. Zemlicka, and J. M. Fink, “Surpassing the resistance quantum with a geometric superinductor.” Zenodo, 2020.","ista":"Peruzzo M, Trioni A, Hassani F, Zemlicka M, Fink JM. 2020. Surpassing the resistance quantum with a geometric superinductor, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.4052882\">10.5281/ZENODO.4052882</a>.","short":"M. Peruzzo, A. Trioni, F. Hassani, M. Zemlicka, J.M. Fink, (2020).","ama":"Peruzzo M, Trioni A, Hassani F, Zemlicka M, Fink JM. Surpassing the resistance quantum with a geometric superinductor. 2020. doi:<a href=\"https://doi.org/10.5281/ZENODO.4052882\">10.5281/ZENODO.4052882</a>","mla":"Peruzzo, Matilda, et al. <i>Surpassing the Resistance Quantum with a Geometric Superinductor</i>. Zenodo, 2020, doi:<a href=\"https://doi.org/10.5281/ZENODO.4052882\">10.5281/ZENODO.4052882</a>.","apa":"Peruzzo, M., Trioni, A., Hassani, F., Zemlicka, M., &#38; Fink, J. M. (2020). Surpassing the resistance quantum with a geometric superinductor. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.4052882\">https://doi.org/10.5281/ZENODO.4052882</a>"},"abstract":[{"text":"This dataset comprises all data shown in the figures of the submitted article \"Surpassing the resistance quantum with a geometric superinductor\". Additional raw data are available from the corresponding author on reasonable request.","lang":"eng"}],"type":"research_data_reference","related_material":{"record":[{"id":"8755","relation":"used_in_publication","status":"public"}]},"oa_version":"Published Version","main_file_link":[{"url":"https://doi.org/10.5281/zenodo.4052883","open_access":"1"}],"doi":"10.5281/ZENODO.4052882","date_updated":"2024-09-10T12:23:56Z","title":"Surpassing the resistance quantum with a geometric superinductor","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"author":[{"full_name":"Peruzzo, Matilda","last_name":"Peruzzo","orcid":"0000-0002-3415-4628","id":"3F920B30-F248-11E8-B48F-1D18A9856A87","first_name":"Matilda"},{"first_name":"Andrea","id":"42F71B44-F248-11E8-B48F-1D18A9856A87","last_name":"Trioni","full_name":"Trioni, Andrea"},{"full_name":"Hassani, Farid","id":"2AED110C-F248-11E8-B48F-1D18A9856A87","first_name":"Farid","orcid":"0000-0001-6937-5773","last_name":"Hassani"},{"last_name":"Zemlicka","id":"2DCF8DE6-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","full_name":"Zemlicka, Martin"},{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes M","last_name":"Fink","orcid":"0000-0001-8112-028X","full_name":"Fink, Johannes M"}],"date_published":"2020-09-27T00:00:00Z","month":"09","publisher":"Zenodo","year":"2020","article_processing_charge":"No","department":[{"_id":"JoFi"}]},{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.4266026"}],"doi":"10.5281/ZENODO.4266025","oa_version":"Published Version","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"9114"}]},"abstract":[{"text":"This dataset comprises all data shown in the plots of the main part of the submitted article \"Bidirectional Electro-Optic Wavelength Conversion in the Quantum Ground State\". Additional raw data are available from the corresponding author on reasonable request.","lang":"eng"}],"type":"research_data_reference","citation":{"chicago":"Hease, William J, Alfredo R Rueda Sanchez, Rishabh Sahu, Matthias Wulf, Georg M Arnold, Harald Schwefel, and Johannes M Fink. “Bidirectional Electro-Optic Wavelength Conversion in the Quantum Ground State.” Zenodo, 2020. <a href=\"https://doi.org/10.5281/ZENODO.4266025\">https://doi.org/10.5281/ZENODO.4266025</a>.","ieee":"W. J. Hease <i>et al.</i>, “Bidirectional electro-optic wavelength conversion in the quantum ground state.” Zenodo, 2020.","ista":"Hease WJ, Rueda Sanchez AR, Sahu R, Wulf M, Arnold GM, Schwefel H, Fink JM. 2020. Bidirectional electro-optic wavelength conversion in the quantum ground state, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.4266025\">10.5281/ZENODO.4266025</a>.","short":"W.J. Hease, A.R. Rueda Sanchez, R. Sahu, M. Wulf, G.M. Arnold, H. Schwefel, J.M. Fink, (2020).","ama":"Hease WJ, Rueda Sanchez AR, Sahu R, et al. Bidirectional electro-optic wavelength conversion in the quantum ground state. 2020. doi:<a href=\"https://doi.org/10.5281/ZENODO.4266025\">10.5281/ZENODO.4266025</a>","mla":"Hease, William J., et al. <i>Bidirectional Electro-Optic Wavelength Conversion in the Quantum Ground State</i>. Zenodo, 2020, doi:<a href=\"https://doi.org/10.5281/ZENODO.4266025\">10.5281/ZENODO.4266025</a>.","apa":"Hease, W. J., Rueda Sanchez, A. R., Sahu, R., Wulf, M., Arnold, G. M., Schwefel, H., &#38; Fink, J. M. (2020). Bidirectional electro-optic wavelength conversion in the quantum ground state. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.4266025\">https://doi.org/10.5281/ZENODO.4266025</a>"},"day":"10","status":"public","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"13071","ddc":["530"],"date_created":"2023-05-23T16:44:11Z","department":[{"_id":"JoFi"}],"article_processing_charge":"No","year":"2020","publisher":"Zenodo","date_published":"2020-11-10T00:00:00Z","month":"11","title":"Bidirectional electro-optic wavelength conversion in the quantum ground state","author":[{"id":"29705398-F248-11E8-B48F-1D18A9856A87","first_name":"William J","orcid":"0000-0001-9868-2166","last_name":"Hease","full_name":"Hease, William J"},{"full_name":"Rueda Sanchez, Alfredo R","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","first_name":"Alfredo R","last_name":"Rueda Sanchez","orcid":"0000-0001-6249-5860"},{"id":"47D26E34-F248-11E8-B48F-1D18A9856A87","first_name":"Rishabh","last_name":"Sahu","orcid":"0000-0001-6264-2162","full_name":"Sahu, Rishabh"},{"full_name":"Wulf, Matthias","first_name":"Matthias","id":"45598606-F248-11E8-B48F-1D18A9856A87","last_name":"Wulf","orcid":"0000-0001-6613-1378"},{"orcid":"0000-0003-1397-7876","last_name":"Arnold","id":"3770C838-F248-11E8-B48F-1D18A9856A87","first_name":"Georg M","full_name":"Arnold, Georg M"},{"full_name":"Schwefel, Harald","first_name":"Harald","last_name":"Schwefel"},{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes M","last_name":"Fink","orcid":"0000-0001-8112-028X","full_name":"Fink, Johannes M"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-09-10T12:23:54Z"},{"status":"public","day":"22","_id":"13073","tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode"},"ddc":["570"],"date_created":"2023-05-23T16:48:27Z","abstract":[{"lang":"eng","text":"The Mytilus complex of marine mussel species forms a mosaic of hybrid zones, found across temperate regions of the globe. This allows us to study \"replicated\" instances of secondary contact between closely-related species. Previous work on this complex has shown that local introgression is both widespread and highly heterogeneous, and has identified SNPs that are outliers of differentiation between lineages. Here, we developed an ancestry-informative panel of such SNPs. We then compared their frequencies in newly-sampled populations, including samples from within the hybrid zones, and parental populations at different distances from the contact. Results show that close to the hybrid zones, some outlier loci are near to fixation for the heterospecific allele, suggesting enhanced local introgression, or the local sweep of a shared ancestral allele. Conversely, genomic cline analyses, treating local parental populations as the reference, reveal a globally high concordance among loci, albeit with a few signals of asymmetric introgression. Enhanced local introgression at specific loci is consistent with the early transfer of adaptive variants after contact, possibly including asymmetric bi-stable variants (Dobzhansky-Muller incompatibilities), or haplotypes loaded with fewer deleterious mutations. Having escaped one barrier, however, these variants can be trapped or delayed at the next barrier, confining the introgression locally. These results shed light on the decay of species barriers during phases of contact."}],"type":"research_data_reference","citation":{"ama":"Simon A, Fraisse C, El Ayari T, et al. How do species barriers decay? concordance and local introgression in mosaic hybrid zones of mussels. 2020. doi:<a href=\"https://doi.org/10.5061/DRYAD.R4XGXD29N\">10.5061/DRYAD.R4XGXD29N</a>","ista":"Simon A, Fraisse C, El Ayari T, Liautard-Haag C, Strelkov P, Welch J, Bierne N. 2020. How do species barriers decay? concordance and local introgression in mosaic hybrid zones of mussels, Dryad, <a href=\"https://doi.org/10.5061/DRYAD.R4XGXD29N\">10.5061/DRYAD.R4XGXD29N</a>.","short":"A. Simon, C. Fraisse, T. El Ayari, C. Liautard-Haag, P. Strelkov, J. Welch, N. Bierne, (2020).","ieee":"A. Simon <i>et al.</i>, “How do species barriers decay? concordance and local introgression in mosaic hybrid zones of mussels.” Dryad, 2020.","chicago":"Simon, Alexis, Christelle Fraisse, Tahani El Ayari, Cathy Liautard-Haag, Petr Strelkov, John Welch, and Nicolas Bierne. “How Do Species Barriers Decay? Concordance and Local Introgression in Mosaic Hybrid Zones of Mussels.” Dryad, 2020. <a href=\"https://doi.org/10.5061/DRYAD.R4XGXD29N\">https://doi.org/10.5061/DRYAD.R4XGXD29N</a>.","apa":"Simon, A., Fraisse, C., El Ayari, T., Liautard-Haag, C., Strelkov, P., Welch, J., &#38; Bierne, N. (2020). How do species barriers decay? concordance and local introgression in mosaic hybrid zones of mussels. Dryad. <a href=\"https://doi.org/10.5061/DRYAD.R4XGXD29N\">https://doi.org/10.5061/DRYAD.R4XGXD29N</a>","mla":"Simon, Alexis, et al. <i>How Do Species Barriers Decay? Concordance and Local Introgression in Mosaic Hybrid Zones of Mussels</i>. Dryad, 2020, doi:<a href=\"https://doi.org/10.5061/DRYAD.R4XGXD29N\">10.5061/DRYAD.R4XGXD29N</a>."},"oa_version":"Published Version","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"8708"}]},"doi":"10.5061/DRYAD.R4XGXD29N","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.r4xgxd29n"}],"author":[{"full_name":"Simon, Alexis","first_name":"Alexis","last_name":"Simon"},{"full_name":"Fraisse, Christelle","orcid":"0000-0001-8441-5075","last_name":"Fraisse","first_name":"Christelle","id":"32DF5794-F248-11E8-B48F-1D18A9856A87"},{"last_name":"El Ayari","first_name":"Tahani","full_name":"El Ayari, Tahani"},{"full_name":"Liautard-Haag, Cathy","last_name":"Liautard-Haag","first_name":"Cathy"},{"last_name":"Strelkov","first_name":"Petr","full_name":"Strelkov, Petr"},{"last_name":"Welch","first_name":"John","full_name":"Welch, John"},{"first_name":"Nicolas","last_name":"Bierne","full_name":"Bierne, Nicolas"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"How do species barriers decay? concordance and local introgression in mosaic hybrid zones of mussels","oa":1,"date_updated":"2023-08-04T11:04:11Z","publisher":"Dryad","date_published":"2020-09-22T00:00:00Z","month":"09","year":"2020","department":[{"_id":"NiBa"}],"article_processing_charge":"No"},{"publication_status":"published","scopus_import":"1","abstract":[{"text":"Motivation: Recent technological advances have led to an increase in the production and availability of single-cell data. The ability to integrate a set of multi-technology measurements would allow the identification of biologically or clinically meaningful observations through the unification of the perspectives afforded by each technology. In most cases, however, profiling technologies consume the used cells and thus pairwise correspondences between datasets are lost. Due to the sheer size single-cell datasets can acquire, scalable algorithms that are able to universally match single-cell measurements carried out in one cell to its corresponding sibling in another technology are needed.\r\nResults: We propose Single-Cell data Integration via Matching (SCIM), a scalable approach to recover such correspondences in two or more technologies. SCIM assumes that cells share a common (low-dimensional) underlying structure and that the underlying cell distribution is approximately constant across technologies. It constructs a technology-invariant latent space using an autoencoder framework with an adversarial objective. Multi-modal datasets are integrated by pairing cells across technologies using a bipartite matching scheme that operates on the low-dimensional latent representations. We evaluate SCIM on a simulated cellular branching process and show that the cell-to-cell matches derived by SCIM reflect the same pseudotime on the simulated dataset. Moreover, we apply our method to two real-world scenarios, a melanoma tumor sample and a human bone marrow sample, where we pair cells from a scRNA dataset to their sibling cells in a CyTOF dataset achieving 90% and 78% cell-matching accuracy for each one of the samples, respectively.","lang":"eng"}],"type":"journal_article","citation":{"apa":"Stark, S. G., Ficek, J., Locatello, F., Bonilla, X., Chevrier, S., Singer, F., … Lehmann, K.-V. (2020). SCIM: Universal single-cell matching with unpaired feature sets. <i>Bioinformatics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/bioinformatics/btaa843\">https://doi.org/10.1093/bioinformatics/btaa843</a>","mla":"Stark, Stefan G., et al. “SCIM: Universal Single-Cell Matching with Unpaired Feature Sets.” <i>Bioinformatics</i>, vol. 36, no. Supplement_2, Oxford University Press, 2020, pp. i919–27, doi:<a href=\"https://doi.org/10.1093/bioinformatics/btaa843\">10.1093/bioinformatics/btaa843</a>.","ama":"Stark SG, Ficek J, Locatello F, et al. SCIM: Universal single-cell matching with unpaired feature sets. <i>Bioinformatics</i>. 2020;36(Supplement_2):i919-i927. doi:<a href=\"https://doi.org/10.1093/bioinformatics/btaa843\">10.1093/bioinformatics/btaa843</a>","ista":"Stark SG et al. 2020. SCIM: Universal single-cell matching with unpaired feature sets. Bioinformatics. 36(Supplement_2), i919–i927.","short":"S.G. Stark, J. Ficek, F. Locatello, X. Bonilla, S. Chevrier, F. Singer, R. Aebersold, F.S. Al-Quaddoomi, J. Albinus, I. Alborelli, S. Andani, P.-O. Attinger, M. Bacac, D. Baumhoer, B. Beck-Schimmer, N. Beerenwinkel, C. Beisel, L. Bernasconi, A. Bertolini, B. Bodenmiller, X. Bonilla, R. Casanova, S. Chevrier, N. Chicherova, M. D’Costa, E. Danenberg, N. Davidson, M.-A.D. gan, R. Dummer, S. Engler, M. Erkens, K. Eschbach, C. Esposito, A. Fedier, P. Ferreira, J. Ficek, A.L. Frei, B. Frey, S. Goetze, L. Grob, G. Gut, D. Günther, M. Haberecker, P. Haeuptle, V. Heinzelmann-Schwarz, S. Herter, R. Holtackers, T. Huesser, A. Irmisch, F. Jacob, A. Jacobs, T.M. Jaeger, K. Jahn, A.R. James, P.M. Jermann, A. Kahles, A. Kahraman, V.H. Koelzer, W. Kuebler, J. Kuipers, C.P. Kunze, C. Kurzeder, K.-V. Lehmann, M. Levesque, S. Lugert, G. Maass, M. Manz, P. Markolin, J. Mena, U. Menzel, J.M. Metzler, N. Miglino, E.S. Milani, H. Moch, S. Muenst, R. Murri, C.K. Ng, S. Nicolet, M. Nowak, P.G. Pedrioli, L. Pelkmans, S. Piscuoglio, M. Prummer, M. Ritter, C. Rommel, M.L. Rosano-González, G. Rätsch, N. Santacroce, J.S. del Castillo, R. Schlenker, P.C. Schwalie, S. Schwan, T. Schär, G. Senti, F. Singer, S. Sivapatham, B. Snijder, B. Sobottka, V.T. Sreedharan, S. Stark, D.J. Stekhoven, A.P. Theocharides, T.M. Thomas, M. Tolnay, V. Tosevski, N.C. Toussaint, M.A. Tuncel, M. Tusup, A.V. Drogen, M. Vetter, T. Vlajnic, S. Weber, W.P. Weber, R. Wegmann, M. Weller, F. Wendt, N. Wey, A. Wicki, B. Wollscheid, S. Yu, J. Ziegler, M. Zimmermann, M. Zoche, G. Zuend, G. Rätsch, K.-V. Lehmann, Bioinformatics 36 (2020) i919–i927.","ieee":"S. G. Stark <i>et al.</i>, “SCIM: Universal single-cell matching with unpaired feature sets,” <i>Bioinformatics</i>, vol. 36, no. Supplement_2. Oxford University Press, pp. i919–i927, 2020.","chicago":"Stark, Stefan G, Joanna Ficek, Francesco Locatello, Ximena Bonilla, Stéphane Chevrier, Franziska Singer, Rudolf Aebersold, et al. “SCIM: Universal Single-Cell Matching with Unpaired Feature Sets.” <i>Bioinformatics</i>. Oxford University Press, 2020. <a href=\"https://doi.org/10.1093/bioinformatics/btaa843\">https://doi.org/10.1093/bioinformatics/btaa843</a>."},"publication_identifier":{"eissn":["1367-4811"]},"extern":"1","quality_controlled":"1","_id":"14125","department":[{"_id":"FrLo"}],"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"publisher":"Oxford University Press","author":[{"last_name":"Stark","first_name":"Stefan G","full_name":"Stark, Stefan G"},{"full_name":"Ficek, Joanna","first_name":"Joanna","last_name":"Ficek"},{"last_name":"Locatello","orcid":"0000-0002-4850-0683","first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco"},{"full_name":"Bonilla, Ximena","last_name":"Bonilla","first_name":"Ximena"},{"full_name":"Chevrier, Stéphane","last_name":"Chevrier","first_name":"Stéphane"},{"full_name":"Singer, Franziska","first_name":"Franziska","last_name":"Singer"},{"first_name":"Rudolf","last_name":"Aebersold","full_name":"Aebersold, Rudolf"},{"full_name":"Al-Quaddoomi, Faisal S","first_name":"Faisal S","last_name":"Al-Quaddoomi"},{"first_name":"Jonas","last_name":"Albinus","full_name":"Albinus, Jonas"},{"first_name":"Ilaria","last_name":"Alborelli","full_name":"Alborelli, Ilaria"},{"first_name":"Sonali","last_name":"Andani","full_name":"Andani, Sonali"},{"last_name":"Attinger","first_name":"Per-Olof","full_name":"Attinger, Per-Olof"},{"full_name":"Bacac, Marina","last_name":"Bacac","first_name":"Marina"},{"first_name":"Daniel","last_name":"Baumhoer","full_name":"Baumhoer, Daniel"},{"last_name":"Beck-Schimmer","first_name":"Beatrice","full_name":"Beck-Schimmer, Beatrice"},{"full_name":"Beerenwinkel, Niko","first_name":"Niko","last_name":"Beerenwinkel"},{"full_name":"Beisel, Christian","last_name":"Beisel","first_name":"Christian"},{"first_name":"Lara","last_name":"Bernasconi","full_name":"Bernasconi, Lara"},{"first_name":"Anne","last_name":"Bertolini","full_name":"Bertolini, Anne"},{"full_name":"Bodenmiller, Bernd","first_name":"Bernd","last_name":"Bodenmiller"},{"first_name":"Ximena","last_name":"Bonilla","full_name":"Bonilla, Ximena"},{"last_name":"Casanova","first_name":"Ruben","full_name":"Casanova, Ruben"},{"first_name":"Stéphane","last_name":"Chevrier","full_name":"Chevrier, Stéphane"},{"full_name":"Chicherova, Natalia","first_name":"Natalia","last_name":"Chicherova"},{"full_name":"D'Costa, Maya","first_name":"Maya","last_name":"D'Costa"},{"full_name":"Danenberg, Esther","last_name":"Danenberg","first_name":"Esther"},{"last_name":"Davidson","first_name":"Natalie","full_name":"Davidson, Natalie"},{"first_name":"Monica-Andreea Dră","last_name":"gan","full_name":"gan, Monica-Andreea Dră"},{"first_name":"Reinhard","last_name":"Dummer","full_name":"Dummer, Reinhard"},{"full_name":"Engler, Stefanie","last_name":"Engler","first_name":"Stefanie"},{"first_name":"Martin","last_name":"Erkens","full_name":"Erkens, Martin"},{"full_name":"Eschbach, Katja","first_name":"Katja","last_name":"Eschbach"},{"last_name":"Esposito","first_name":"Cinzia","full_name":"Esposito, Cinzia"},{"full_name":"Fedier, André","last_name":"Fedier","first_name":"André"},{"full_name":"Ferreira, Pedro","first_name":"Pedro","last_name":"Ferreira"},{"first_name":"Joanna","last_name":"Ficek","full_name":"Ficek, Joanna"},{"last_name":"Frei","first_name":"Anja L","full_name":"Frei, Anja L"},{"first_name":"Bruno","last_name":"Frey","full_name":"Frey, Bruno"},{"first_name":"Sandra","last_name":"Goetze","full_name":"Goetze, Sandra"},{"first_name":"Linda","last_name":"Grob","full_name":"Grob, Linda"},{"full_name":"Gut, Gabriele","last_name":"Gut","first_name":"Gabriele"},{"full_name":"Günther, Detlef","first_name":"Detlef","last_name":"Günther"},{"full_name":"Haberecker, Martina","first_name":"Martina","last_name":"Haberecker"},{"full_name":"Haeuptle, Pirmin","last_name":"Haeuptle","first_name":"Pirmin"},{"full_name":"Heinzelmann-Schwarz, Viola","first_name":"Viola","last_name":"Heinzelmann-Schwarz"},{"last_name":"Herter","first_name":"Sylvia","full_name":"Herter, Sylvia"},{"full_name":"Holtackers, Rene","last_name":"Holtackers","first_name":"Rene"},{"full_name":"Huesser, Tamara","last_name":"Huesser","first_name":"Tamara"},{"first_name":"Anja","last_name":"Irmisch","full_name":"Irmisch, Anja"},{"first_name":"Francis","last_name":"Jacob","full_name":"Jacob, Francis"},{"full_name":"Jacobs, Andrea","last_name":"Jacobs","first_name":"Andrea"},{"first_name":"Tim M","last_name":"Jaeger","full_name":"Jaeger, Tim M"},{"full_name":"Jahn, Katharina","first_name":"Katharina","last_name":"Jahn"},{"full_name":"James, Alva R","last_name":"James","first_name":"Alva R"},{"last_name":"Jermann","first_name":"Philip M","full_name":"Jermann, Philip M"},{"first_name":"André","last_name":"Kahles","full_name":"Kahles, André"},{"first_name":"Abdullah","last_name":"Kahraman","full_name":"Kahraman, Abdullah"},{"last_name":"Koelzer","first_name":"Viktor H","full_name":"Koelzer, Viktor H"},{"first_name":"Werner","last_name":"Kuebler","full_name":"Kuebler, Werner"},{"first_name":"Jack","last_name":"Kuipers","full_name":"Kuipers, Jack"},{"last_name":"Kunze","first_name":"Christian P","full_name":"Kunze, Christian P"},{"last_name":"Kurzeder","first_name":"Christian","full_name":"Kurzeder, Christian"},{"full_name":"Lehmann, Kjong-Van","first_name":"Kjong-Van","last_name":"Lehmann"},{"full_name":"Levesque, Mitchell","first_name":"Mitchell","last_name":"Levesque"},{"last_name":"Lugert","first_name":"Sebastian","full_name":"Lugert, Sebastian"},{"last_name":"Maass","first_name":"Gerd","full_name":"Maass, Gerd"},{"last_name":"Manz","first_name":"Markus","full_name":"Manz, Markus"},{"last_name":"Markolin","first_name":"Philipp","full_name":"Markolin, Philipp"},{"first_name":"Julien","last_name":"Mena","full_name":"Mena, Julien"},{"full_name":"Menzel, Ulrike","first_name":"Ulrike","last_name":"Menzel"},{"full_name":"Metzler, Julian M","last_name":"Metzler","first_name":"Julian M"},{"first_name":"Nicola","last_name":"Miglino","full_name":"Miglino, Nicola"},{"full_name":"Milani, Emanuela S","first_name":"Emanuela S","last_name":"Milani"},{"last_name":"Moch","first_name":"Holger","full_name":"Moch, Holger"},{"last_name":"Muenst","first_name":"Simone","full_name":"Muenst, Simone"},{"last_name":"Murri","first_name":"Riccardo","full_name":"Murri, Riccardo"},{"full_name":"Ng, Charlotte KY","last_name":"Ng","first_name":"Charlotte KY"},{"full_name":"Nicolet, Stefan","first_name":"Stefan","last_name":"Nicolet"},{"full_name":"Nowak, Marta","first_name":"Marta","last_name":"Nowak"},{"first_name":"Patrick GA","last_name":"Pedrioli","full_name":"Pedrioli, Patrick GA"},{"last_name":"Pelkmans","first_name":"Lucas","full_name":"Pelkmans, Lucas"},{"first_name":"Salvatore","last_name":"Piscuoglio","full_name":"Piscuoglio, Salvatore"},{"first_name":"Michael","last_name":"Prummer","full_name":"Prummer, Michael"},{"first_name":"Mathilde","last_name":"Ritter","full_name":"Ritter, Mathilde"},{"full_name":"Rommel, Christian","first_name":"Christian","last_name":"Rommel"},{"full_name":"Rosano-González, María L","first_name":"María L","last_name":"Rosano-González"},{"full_name":"Rätsch, Gunnar","first_name":"Gunnar","last_name":"Rätsch"},{"full_name":"Santacroce, Natascha","last_name":"Santacroce","first_name":"Natascha"},{"first_name":"Jacobo Sarabia del","last_name":"Castillo","full_name":"Castillo, Jacobo Sarabia del"},{"full_name":"Schlenker, Ramona","first_name":"Ramona","last_name":"Schlenker"},{"full_name":"Schwalie, Petra C","first_name":"Petra C","last_name":"Schwalie"},{"first_name":"Severin","last_name":"Schwan","full_name":"Schwan, Severin"},{"full_name":"Schär, Tobias","last_name":"Schär","first_name":"Tobias"},{"last_name":"Senti","first_name":"Gabriela","full_name":"Senti, Gabriela"},{"full_name":"Singer, Franziska","first_name":"Franziska","last_name":"Singer"},{"full_name":"Sivapatham, Sujana","first_name":"Sujana","last_name":"Sivapatham"},{"last_name":"Snijder","first_name":"Berend","full_name":"Snijder, Berend"},{"full_name":"Sobottka, Bettina","last_name":"Sobottka","first_name":"Bettina"},{"full_name":"Sreedharan, Vipin T","last_name":"Sreedharan","first_name":"Vipin T"},{"full_name":"Stark, Stefan","last_name":"Stark","first_name":"Stefan"},{"first_name":"Daniel J","last_name":"Stekhoven","full_name":"Stekhoven, Daniel J"},{"last_name":"Theocharides","first_name":"Alexandre PA","full_name":"Theocharides, Alexandre PA"},{"full_name":"Thomas, Tinu M","last_name":"Thomas","first_name":"Tinu M"},{"full_name":"Tolnay, Markus","last_name":"Tolnay","first_name":"Markus"},{"full_name":"Tosevski, Vinko","last_name":"Tosevski","first_name":"Vinko"},{"full_name":"Toussaint, Nora C","last_name":"Toussaint","first_name":"Nora C"},{"full_name":"Tuncel, Mustafa A","first_name":"Mustafa A","last_name":"Tuncel"},{"last_name":"Tusup","first_name":"Marina","full_name":"Tusup, Marina"},{"full_name":"Drogen, Audrey Van","first_name":"Audrey Van","last_name":"Drogen"},{"full_name":"Vetter, Marcus","last_name":"Vetter","first_name":"Marcus"},{"first_name":"Tatjana","last_name":"Vlajnic","full_name":"Vlajnic, Tatjana"},{"full_name":"Weber, Sandra","last_name":"Weber","first_name":"Sandra"},{"full_name":"Weber, Walter P","last_name":"Weber","first_name":"Walter P"},{"first_name":"Rebekka","last_name":"Wegmann","full_name":"Wegmann, Rebekka"},{"last_name":"Weller","first_name":"Michael","full_name":"Weller, Michael"},{"last_name":"Wendt","first_name":"Fabian","full_name":"Wendt, Fabian"},{"last_name":"Wey","first_name":"Norbert","full_name":"Wey, Norbert"},{"last_name":"Wicki","first_name":"Andreas","full_name":"Wicki, Andreas"},{"first_name":"Bernd","last_name":"Wollscheid","full_name":"Wollscheid, Bernd"},{"first_name":"Shuqing","last_name":"Yu","full_name":"Yu, Shuqing"},{"last_name":"Ziegler","first_name":"Johanna","full_name":"Ziegler, Johanna"},{"last_name":"Zimmermann","first_name":"Marc","full_name":"Zimmermann, Marc"},{"first_name":"Martin","last_name":"Zoche","full_name":"Zoche, Martin"},{"full_name":"Zuend, Gregor","first_name":"Gregor","last_name":"Zuend"},{"full_name":"Rätsch, Gunnar","last_name":"Rätsch","first_name":"Gunnar"},{"full_name":"Lehmann, Kjong-Van","last_name":"Lehmann","first_name":"Kjong-Van"}],"title":"SCIM: Universal single-cell matching with unpaired feature sets","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Bioinformatics","doi":"10.1093/bioinformatics/btaa843","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1093/bioinformatics/btaa843"}],"oa_version":"Published Version","related_material":{"link":[{"relation":"software","url":"https://github.com/ratschlab/scim"}]},"volume":36,"pmid":1,"day":"01","status":"public","date_created":"2023-08-21T12:28:20Z","external_id":{"pmid":["33381818"]},"page":"i919-i927","year":"2020","date_published":"2020-12-01T00:00:00Z","month":"12","intvolume":"        36","oa":1,"issue":"Supplement_2","keyword":["Computational Mathematics","Computational Theory and Mathematics","Computer Science Applications","Molecular Biology","Biochemistry","Statistics and Probability"],"date_updated":"2023-09-11T10:21:00Z"},{"date_updated":"2023-09-12T07:44:48Z","issue":"9","oa":1,"intvolume":"        34","month":"07","date_published":"2020-07-28T00:00:00Z","year":"2020","external_id":{"arxiv":["2007.14184"]},"page":"13681-13684","conference":{"location":"New York, NY, United States","end_date":"2020-02-12","start_date":"2020-02-07","name":"AAAI: Conference on Artificial Intelligence"},"date_created":"2023-08-22T14:07:26Z","day":"28","status":"public","volume":34,"oa_version":"Preprint","doi":"10.1609/aaai.v34i09.7120","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2007.14184"}],"publication":"The 34th AAAI Conference on Artificial Intelligence","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"A commentary on the unsupervised learning of disentangled representations","author":[{"orcid":"0000-0002-4850-0683","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","full_name":"Locatello, Francesco"},{"first_name":"Stefan","last_name":"Bauer","full_name":"Bauer, Stefan"},{"full_name":"Lucic, Mario","first_name":"Mario","last_name":"Lucic"},{"last_name":"Rätsch","first_name":"Gunnar","full_name":"Rätsch, Gunnar"},{"full_name":"Gelly, Sylvain","last_name":"Gelly","first_name":"Sylvain"},{"last_name":"Schölkopf","first_name":"Bernhard","full_name":"Schölkopf, Bernhard"},{"first_name":"Olivier","last_name":"Bachem","full_name":"Bachem, Olivier"}],"publisher":"Association for the Advancement of Artificial Intelligence","language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"FrLo"}],"_id":"14186","quality_controlled":"1","publication_identifier":{"isbn":["9781577358350"],"eissn":["2374-3468"]},"extern":"1","citation":{"ieee":"F. Locatello <i>et al.</i>, “A commentary on the unsupervised learning of disentangled representations,” in <i>The 34th AAAI Conference on Artificial Intelligence</i>, New York, NY, United States, 2020, vol. 34, no. 9, pp. 13681–13684.","short":"F. Locatello, S. Bauer, M. Lucic, G. Rätsch, S. Gelly, B. Schölkopf, O. Bachem, in:, The 34th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2020, pp. 13681–13684.","ista":"Locatello F, Bauer S, Lucic M, Rätsch G, Gelly S, Schölkopf B, Bachem O. 2020. A commentary on the unsupervised learning of disentangled representations. The 34th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 34, 13681–13684.","ama":"Locatello F, Bauer S, Lucic M, et al. A commentary on the unsupervised learning of disentangled representations. In: <i>The 34th AAAI Conference on Artificial Intelligence</i>. Vol 34. Association for the Advancement of Artificial Intelligence; 2020:13681-13684. doi:<a href=\"https://doi.org/10.1609/aaai.v34i09.7120\">10.1609/aaai.v34i09.7120</a>","chicago":"Locatello, Francesco, Stefan Bauer, Mario Lucic, Gunnar Rätsch, Sylvain Gelly, Bernhard Schölkopf, and Olivier Bachem. “A Commentary on the Unsupervised Learning of Disentangled Representations.” In <i>The 34th AAAI Conference on Artificial Intelligence</i>, 34:13681–84. Association for the Advancement of Artificial Intelligence, 2020. <a href=\"https://doi.org/10.1609/aaai.v34i09.7120\">https://doi.org/10.1609/aaai.v34i09.7120</a>.","apa":"Locatello, F., Bauer, S., Lucic, M., Rätsch, G., Gelly, S., Schölkopf, B., &#38; Bachem, O. (2020). A commentary on the unsupervised learning of disentangled representations. In <i>The 34th AAAI Conference on Artificial Intelligence</i> (Vol. 34, pp. 13681–13684). New York, NY, United States: Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v34i09.7120\">https://doi.org/10.1609/aaai.v34i09.7120</a>","mla":"Locatello, Francesco, et al. “A Commentary on the Unsupervised Learning of Disentangled Representations.” <i>The 34th AAAI Conference on Artificial Intelligence</i>, vol. 34, no. 9, Association for the Advancement of Artificial Intelligence, 2020, pp. 13681–84, doi:<a href=\"https://doi.org/10.1609/aaai.v34i09.7120\">10.1609/aaai.v34i09.7120</a>."},"type":"conference","scopus_import":"1","abstract":[{"text":"The goal of the unsupervised learning of disentangled representations is to\r\nseparate the independent explanatory factors of variation in the data without\r\naccess to supervision. In this paper, we summarize the results of Locatello et\r\nal., 2019, and focus on their implications for practitioners. We discuss the\r\ntheoretical result showing that the unsupervised learning of disentangled\r\nrepresentations is fundamentally impossible without inductive biases and the\r\npractical challenges it entails. Finally, we comment on our experimental\r\nfindings, highlighting the limitations of state-of-the-art approaches and\r\ndirections for future research.","lang":"eng"}],"arxiv":1,"publication_status":"published"},{"title":"Stochastic Frank-Wolfe for constrained finite-sum minimization","author":[{"first_name":"Geoffrey","last_name":"Négiar","full_name":"Négiar, Geoffrey"},{"full_name":"Dresdner, Gideon","last_name":"Dresdner","first_name":"Gideon"},{"full_name":"Tsai, Alicia","first_name":"Alicia","last_name":"Tsai"},{"last_name":"Ghaoui","first_name":"Laurent El","full_name":"Ghaoui, Laurent El"},{"last_name":"Locatello","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","full_name":"Locatello, Francesco"},{"last_name":"Freund","first_name":"Robert M.","full_name":"Freund, Robert M."},{"full_name":"Pedregosa, Fabian","first_name":"Fabian","last_name":"Pedregosa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"FrLo"}],"_id":"14187","quality_controlled":"1","extern":"1","citation":{"mla":"Négiar, Geoffrey, et al. “Stochastic Frank-Wolfe for Constrained Finite-Sum Minimization.” <i>Proceedings of the 37th International Conference on Machine Learning</i>, vol. 119, 2020, pp. 7253–62.","apa":"Négiar, G., Dresdner, G., Tsai, A., Ghaoui, L. E., Locatello, F., Freund, R. M., &#38; Pedregosa, F. (2020). Stochastic Frank-Wolfe for constrained finite-sum minimization. In <i>Proceedings of the 37th International Conference on Machine Learning</i> (Vol. 119, pp. 7253–7262). Virtual.","chicago":"Négiar, Geoffrey, Gideon Dresdner, Alicia Tsai, Laurent El Ghaoui, Francesco Locatello, Robert M. Freund, and Fabian Pedregosa. “Stochastic Frank-Wolfe for Constrained Finite-Sum Minimization.” In <i>Proceedings of the 37th International Conference on Machine Learning</i>, 119:7253–62, 2020.","short":"G. Négiar, G. Dresdner, A. Tsai, L.E. Ghaoui, F. Locatello, R.M. Freund, F. Pedregosa, in:, Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 7253–7262.","ieee":"G. Négiar <i>et al.</i>, “Stochastic Frank-Wolfe for constrained finite-sum minimization,” in <i>Proceedings of the 37th International Conference on Machine Learning</i>, Virtual, 2020, vol. 119, pp. 7253–7262.","ista":"Négiar G, Dresdner G, Tsai A, Ghaoui LE, Locatello F, Freund RM, Pedregosa F. 2020. Stochastic Frank-Wolfe for constrained finite-sum minimization. Proceedings of the 37th International Conference on Machine Learning. International Conference on Machine Learning, PMLR, vol. 119, 7253–7262.","ama":"Négiar G, Dresdner G, Tsai A, et al. Stochastic Frank-Wolfe for constrained finite-sum minimization. In: <i>Proceedings of the 37th International Conference on Machine Learning</i>. Vol 119. ; 2020:7253-7262."},"type":"conference","abstract":[{"text":"We propose a novel Stochastic Frank-Wolfe (a.k.a. conditional gradient)\r\nalgorithm for constrained smooth finite-sum minimization with a generalized\r\nlinear prediction/structure. This class of problems includes empirical risk\r\nminimization with sparse, low-rank, or other structured constraints. The\r\nproposed method is simple to implement, does not require step-size tuning, and\r\nhas a constant per-iteration cost that is independent of the dataset size.\r\nFurthermore, as a byproduct of the method we obtain a stochastic estimator of\r\nthe Frank-Wolfe gap that can be used as a stopping criterion. Depending on the\r\nsetting, the proposed method matches or improves on the best computational\r\nguarantees for Stochastic Frank-Wolfe algorithms. Benchmarks on several\r\ndatasets highlight different regimes in which the proposed method exhibits a\r\nfaster empirical convergence than related methods. Finally, we provide an\r\nimplementation of all considered methods in an open-source package.","lang":"eng"}],"arxiv":1,"publication_status":"published","date_updated":"2023-09-12T08:03:40Z","oa":1,"month":"07","intvolume":"       119","date_published":"2020-07-27T00:00:00Z","alternative_title":["PMLR"],"year":"2020","external_id":{"arxiv":["2002.11860"]},"page":"7253-7262","conference":{"start_date":"2020-07-13","end_date":"2020-07-18","name":"International Conference on Machine Learning","location":"Virtual"},"date_created":"2023-08-22T14:07:52Z","day":"27","status":"public","volume":119,"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/2002.11860","open_access":"1"}],"publication":"Proceedings of the 37th International Conference on Machine Learning"},{"language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"FrLo"}],"author":[{"full_name":"Locatello, Francesco","first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","last_name":"Locatello"},{"first_name":"Ben","last_name":"Poole","full_name":"Poole, Ben"},{"first_name":"Gunnar","last_name":"Rätsch","full_name":"Rätsch, Gunnar"},{"first_name":"Bernhard","last_name":"Schölkopf","full_name":"Schölkopf, Bernhard"},{"full_name":"Bachem, Olivier","first_name":"Olivier","last_name":"Bachem"},{"first_name":"Michael","last_name":"Tschannen","full_name":"Tschannen, Michael"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Weakly-supervised disentanglement without compromises","publication_status":"published","_id":"14188","quality_controlled":"1","extern":"1","citation":{"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.","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.","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.","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.","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.","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."},"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"}],"scopus_import":"1","arxiv":1,"type":"conference","year":"2020","external_id":{"arxiv":["2002.02886"]},"page":"6348–6359","conference":{"name":"International Conference on Machine Learning","end_date":"2020-07-18","start_date":"2020-07-13","location":"Virtual"},"date_updated":"2023-09-12T07:59:29Z","oa":1,"alternative_title":["PMLR"],"date_published":"2020-07-07T00:00:00Z","month":"07","intvolume":"       119","oa_version":"Preprint","publication":"Proceedings of the 37th International Conference on Machine Learning","main_file_link":[{"url":"https://arxiv.org/abs/2002.02886","open_access":"1"}],"date_created":"2023-08-22T14:08:14Z","status":"public","day":"07","volume":119},{"article_type":"original","language":[{"iso":"eng"}],"department":[{"_id":"FrLo"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"A sober look at the unsupervised learning of disentangled representations and their evaluation","author":[{"full_name":"Locatello, Francesco","last_name":"Locatello","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco"},{"full_name":"Bauer, Stefan","last_name":"Bauer","first_name":"Stefan"},{"full_name":"Lucic, Mario","first_name":"Mario","last_name":"Lucic"},{"last_name":"Rätsch","first_name":"Gunnar","full_name":"Rätsch, Gunnar"},{"last_name":"Gelly","first_name":"Sylvain","full_name":"Gelly, Sylvain"},{"full_name":"Schölkopf, Bernhard","first_name":"Bernhard","last_name":"Schölkopf"},{"first_name":"Olivier","last_name":"Bachem","full_name":"Bachem, Olivier"}],"publisher":"MIT Press","has_accepted_license":"1","publication_status":"published","quality_controlled":"1","_id":"14195","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."}],"scopus_import":"1","arxiv":1,"type":"journal_article","extern":"1","citation":{"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.","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.","short":"F. Locatello, S. Bauer, M. Lucic, G. Rätsch, S. Gelly, B. Schölkopf, O. Bachem, Journal of Machine Learning Research 21 (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.","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.","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."},"year":"2020","external_id":{"arxiv":["2010.14766"]},"oa":1,"date_updated":"2023-09-12T09:23:56Z","article_number":"209","date_published":"2020-09-01T00:00:00Z","month":"09","intvolume":"        21","oa_version":"Published Version","publication":"Journal of Machine Learning Research","main_file_link":[{"open_access":"1","url":"https://jmlr.csail.mit.edu/papers/v21/19-976.html"}],"status":"public","day":"01","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["000"],"date_created":"2023-08-22T14:10:34Z","volume":21},{"external_id":{"isi":["000612224900089"],"arxiv":["1908.03058"]},"conference":{"location":"Florence, Italy","name":"RadarConf: National Conference on Radar","end_date":"2020-09-25","start_date":"2020-09-21"},"year":"2020","intvolume":"      2020","month":"09","date_published":"2020-09-21T00:00:00Z","article_number":"9266397","acknowledgement":"This work was supported by the Institute of Science and Technology Austria (IST Austria), the European Research Council under grant agreement number 758053 (ERC StG QUNNECT) and the EU’s Horizon 2020 research and innovation programme under grant agreement number 862644 (FET Open QUARTET). S.B. acknowledges support from the Marie Skłodowska Curie\r\nfellowship number 707438 (MSC-IF SUPEREOM), DV acknowledge support from EU’s Horizon 2020 research and innovation programme under grant agreement number 732894 (FET Proactive HOT) and the Project QuaSeRT funded by the QuantERA ERANET Cofund in Quantum Technologies, and J.M.F from the Austrian Science Fund (FWF) through BeyondC (F71), a NOMIS foundation research grant, and the EU’s Horizon 2020 research and\r\ninnovation programme under grant agreement number 732894 (FET Proactive\r\nHOT).","date_updated":"2024-09-10T12:23:52Z","issue":"9","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1908.03058"}],"doi":"10.1109/RadarConf2043947.2020.9266397","publication":"IEEE National Radar Conference - Proceedings","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"7910"}]},"isi":1,"oa_version":"Preprint","ec_funded":1,"volume":2020,"date_created":"2021-01-10T23:01:17Z","status":"public","day":"21","article_processing_charge":"No","department":[{"_id":"JoFi"}],"language":[{"iso":"eng"}],"publisher":"IEEE","title":"Microwave quantum illumination with a digital phase-conjugated receiver","author":[{"full_name":"Barzanjeh, Shabir","last_name":"Barzanjeh","orcid":"0000-0003-0415-1423","id":"2D25E1F6-F248-11E8-B48F-1D18A9856A87","first_name":"Shabir"},{"full_name":"Pirandola, Stefano","first_name":"Stefano","last_name":"Pirandola"},{"last_name":"Vitali","first_name":"David","full_name":"Vitali, David"},{"orcid":"0000-0001-8112-028X","last_name":"Fink","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes M","full_name":"Fink, Johannes M"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"call_identifier":"H2020","grant_number":"758053","name":"A Fiber Optic Transceiver for Superconducting Qubits","_id":"26336814-B435-11E9-9278-68D0E5697425"},{"_id":"237CBA6C-32DE-11EA-91FC-C7463DDC885E","name":"Quantum readout techniques and technologies","call_identifier":"H2020","grant_number":"862644"},{"grant_number":"707438","call_identifier":"H2020","_id":"258047B6-B435-11E9-9278-68D0E5697425","name":"Microwave-to-Optical Quantum Link: Quantum Teleportation and Quantum Illumination with cavity Optomechanics SUPEREOM"},{"name":"Hybrid Optomechanical Technologies","_id":"257EB838-B435-11E9-9278-68D0E5697425","grant_number":"732894","call_identifier":"H2020"}],"publication_status":"published","publication_identifier":{"isbn":["9781728189420"],"issn":["1097-5659"]},"citation":{"apa":"Barzanjeh, S., Pirandola, S., Vitali, D., &#38; Fink, J. M. (2020). Microwave quantum illumination with a digital phase-conjugated receiver. In <i>IEEE National Radar Conference - Proceedings</i> (Vol. 2020). Florence, Italy: IEEE. <a href=\"https://doi.org/10.1109/RadarConf2043947.2020.9266397\">https://doi.org/10.1109/RadarConf2043947.2020.9266397</a>","mla":"Barzanjeh, Shabir, et al. “Microwave Quantum Illumination with a Digital Phase-Conjugated Receiver.” <i>IEEE National Radar Conference - Proceedings</i>, vol. 2020, no. 9, 9266397, IEEE, 2020, doi:<a href=\"https://doi.org/10.1109/RadarConf2043947.2020.9266397\">10.1109/RadarConf2043947.2020.9266397</a>.","ama":"Barzanjeh S, Pirandola S, Vitali D, Fink JM. Microwave quantum illumination with a digital phase-conjugated receiver. In: <i>IEEE National Radar Conference - Proceedings</i>. Vol 2020. IEEE; 2020. doi:<a href=\"https://doi.org/10.1109/RadarConf2043947.2020.9266397\">10.1109/RadarConf2043947.2020.9266397</a>","ieee":"S. Barzanjeh, S. Pirandola, D. Vitali, and J. M. Fink, “Microwave quantum illumination with a digital phase-conjugated receiver,” in <i>IEEE National Radar Conference - Proceedings</i>, Florence, Italy, 2020, vol. 2020, no. 9.","short":"S. Barzanjeh, S. Pirandola, D. Vitali, J.M. Fink, in:, IEEE National Radar Conference - Proceedings, IEEE, 2020.","ista":"Barzanjeh S, Pirandola S, Vitali D, Fink JM. 2020. Microwave quantum illumination with a digital phase-conjugated receiver. IEEE National Radar Conference - Proceedings. RadarConf: National Conference on Radar vol. 2020, 9266397.","chicago":"Barzanjeh, Shabir, Stefano Pirandola, David Vitali, and Johannes M Fink. “Microwave Quantum Illumination with a Digital Phase-Conjugated Receiver.” In <i>IEEE National Radar Conference - Proceedings</i>, Vol. 2020. IEEE, 2020. <a href=\"https://doi.org/10.1109/RadarConf2043947.2020.9266397\">https://doi.org/10.1109/RadarConf2043947.2020.9266397</a>."},"type":"conference","arxiv":1,"abstract":[{"text":"Quantum illumination is a sensing technique that employs entangled signal-idler beams to improve the detection efficiency of low-reflectivity objects in environments with large thermal noise. The advantage over classical strategies is evident at low signal brightness, a feature which could make the protocol an ideal prototype for non-invasive scanning or low-power short-range radar. Here we experimentally investigate the concept of quantum illumination at microwave frequencies, by generating entangled fields using a Josephson parametric converter which are then amplified to illuminate a room-temperature object at a distance of 1 meter. Starting from experimental data, we simulate the case of perfect idler photon number detection, which results in a quantum advantage compared to the relative classical benchmark. Our results highlight the opportunities and challenges on the way towards a first room-temperature application of microwave quantum circuits.","lang":"eng"}],"scopus_import":"1","_id":"9001","quality_controlled":"1"},{"arxiv":1,"scopus_import":"1","abstract":[{"text":"Motivated by a recent question of Peyre, we apply the Hardy–Littlewood circle method to count “sufficiently free” rational points of bounded height on arbitrary smooth projective hypersurfaces of low degree that are defined over the rationals.","lang":"eng"}],"type":"journal_article","citation":{"chicago":"Browning, Timothy D, and Will Sawin. “Free Rational Points on Smooth Hypersurfaces.” <i>Commentarii Mathematici Helvetici</i>. European Mathematical Society, 2020. <a href=\"https://doi.org/10.4171/CMH/499\">https://doi.org/10.4171/CMH/499</a>.","ieee":"T. D. Browning and W. Sawin, “Free rational points on smooth hypersurfaces,” <i>Commentarii Mathematici Helvetici</i>, vol. 95, no. 4. European Mathematical Society, pp. 635–659, 2020.","short":"T.D. Browning, W. Sawin, Commentarii Mathematici Helvetici 95 (2020) 635–659.","ista":"Browning TD, Sawin W. 2020. Free rational points on smooth hypersurfaces. Commentarii Mathematici Helvetici. 95(4), 635–659.","ama":"Browning TD, Sawin W. Free rational points on smooth hypersurfaces. <i>Commentarii Mathematici Helvetici</i>. 2020;95(4):635-659. doi:<a href=\"https://doi.org/10.4171/CMH/499\">10.4171/CMH/499</a>","mla":"Browning, Timothy D., and Will Sawin. “Free Rational Points on Smooth Hypersurfaces.” <i>Commentarii Mathematici Helvetici</i>, vol. 95, no. 4, European Mathematical Society, 2020, pp. 635–59, doi:<a href=\"https://doi.org/10.4171/CMH/499\">10.4171/CMH/499</a>.","apa":"Browning, T. D., &#38; Sawin, W. (2020). Free rational points on smooth hypersurfaces. <i>Commentarii Mathematici Helvetici</i>. European Mathematical Society. <a href=\"https://doi.org/10.4171/CMH/499\">https://doi.org/10.4171/CMH/499</a>"},"publication_identifier":{"issn":["00102571"],"eissn":["14208946"]},"quality_controlled":"1","_id":"9007","publication_status":"published","publisher":"European Mathematical Society","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Browning, Timothy D","first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","orcid":"0000-0002-8314-0177"},{"last_name":"Sawin","first_name":"Will","full_name":"Sawin, Will"}],"title":"Free rational points on smooth hypersurfaces","department":[{"_id":"TiBr"}],"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"volume":95,"status":"public","day":"07","date_created":"2021-01-17T23:01:11Z","publication":"Commentarii Mathematici Helvetici","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1906.08463"}],"doi":"10.4171/CMH/499","oa_version":"Preprint","isi":1,"date_published":"2020-12-07T00:00:00Z","intvolume":"        95","month":"12","oa":1,"issue":"4","date_updated":"2023-08-24T11:11:36Z","page":"635-659","external_id":{"isi":["000596833300001"],"arxiv":["1906.08463"]},"year":"2020"},{"publication_status":"published","quality_controlled":"1","_id":"9011","type":"journal_article","scopus_import":"1","abstract":[{"text":"Distributed ledgers provide high availability and integrity, making them a key enabler for practical and secure computation of distributed workloads among mutually distrustful parties. Many practical applications also require strong confidentiality, however. This work enhances permissioned and permissionless blockchains with the ability to manage confidential data without forfeiting availability or decentralization. The proposed Calypso architecture addresses two orthogonal challenges confronting modern distributed ledgers: (a) enabling the auditable management of secrets and (b) protecting distributed computations against arbitrage attacks when their results depend on the ordering and secrecy of inputs.\r\n\r\nCalypso introduces on-chain secrets, a novel abstraction that enforces atomic deposition of an auditable trace whenever users access confidential data. Calypso provides user-controlled consent management that ensures revocation atomicity and accountable anonymity. To enable permissionless deployment, we introduce an incentive scheme and provide users with the option to select their preferred trustees. We evaluated our Calypso prototype with a confidential document-sharing application and a decentralized lottery. Our benchmarks show that transaction-processing latency increases linearly in terms of security (number of trustees) and is in the range of 0.2 to 8 seconds for 16 to 128 trustees.","lang":"eng"}],"citation":{"chicago":"Kokoris Kogias, Eleftherios, Enis Ceyhun Alp, Linus Gasser, Philipp Jovanovic, Ewa Syta, and Bryan Ford. “CALYPSO: Private Data Management for Decentralized Ledgers.” <i>Proceedings of the VLDB Endowment</i>. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.14778/3436905.3436917\">https://doi.org/10.14778/3436905.3436917</a>.","ieee":"E. Kokoris Kogias, E. C. Alp, L. Gasser, P. Jovanovic, E. Syta, and B. Ford, “CALYPSO: Private data management for decentralized ledgers,” <i>Proceedings of the VLDB Endowment</i>, vol. 14, no. 4. Association for Computing Machinery, pp. 586–599, 2020.","short":"E. Kokoris Kogias, E.C. Alp, L. Gasser, P. Jovanovic, E. Syta, B. Ford, Proceedings of the VLDB Endowment 14 (2020) 586–599.","ista":"Kokoris Kogias E, Alp EC, Gasser L, Jovanovic P, Syta E, Ford B. 2020. CALYPSO: Private data management for decentralized ledgers. Proceedings of the VLDB Endowment. 14(4), 586–599.","ama":"Kokoris Kogias E, Alp EC, Gasser L, Jovanovic P, Syta E, Ford B. CALYPSO: Private data management for decentralized ledgers. <i>Proceedings of the VLDB Endowment</i>. 2020;14(4):586-599. doi:<a href=\"https://doi.org/10.14778/3436905.3436917\">10.14778/3436905.3436917</a>","mla":"Kokoris Kogias, Eleftherios, et al. “CALYPSO: Private Data Management for Decentralized Ledgers.” <i>Proceedings of the VLDB Endowment</i>, vol. 14, no. 4, Association for Computing Machinery, 2020, pp. 586–99, doi:<a href=\"https://doi.org/10.14778/3436905.3436917\">10.14778/3436905.3436917</a>.","apa":"Kokoris Kogias, E., Alp, E. C., Gasser, L., Jovanovic, P., Syta, E., &#38; Ford, B. (2020). CALYPSO: Private data management for decentralized ledgers. <i>Proceedings of the VLDB Endowment</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.14778/3436905.3436917\">https://doi.org/10.14778/3436905.3436917</a>"},"publication_identifier":{"eissn":["2150-8097"]},"article_type":"original","language":[{"iso":"eng"}],"department":[{"_id":"ElKo"}],"article_processing_charge":"No","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios","last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios"},{"full_name":"Alp, Enis Ceyhun","last_name":"Alp","first_name":"Enis Ceyhun"},{"full_name":"Gasser, Linus","last_name":"Gasser","first_name":"Linus"},{"last_name":"Jovanovic","first_name":"Philipp","full_name":"Jovanovic, Philipp"},{"last_name":"Syta","first_name":"Ewa","full_name":"Syta, Ewa"},{"first_name":"Bryan","last_name":"Ford","full_name":"Ford, Bryan"}],"title":"CALYPSO: Private data management for decentralized ledgers","publisher":"Association for Computing Machinery","isi":1,"oa_version":"Published Version","doi":"10.14778/3436905.3436917","main_file_link":[{"url":"https://dl.acm.org/doi/10.14778/3436905.3436917","open_access":"1"}],"publication":"Proceedings of the VLDB Endowment","status":"public","day":"01","date_created":"2021-01-17T23:01:13Z","tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"volume":14,"year":"2020","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","external_id":{"isi":["000658495400012"]},"page":"586-599","issue":"4","oa":1,"date_updated":"2023-08-24T13:57:13Z","acknowledgement":"We thank Nicolas Gailly, Vincent Graf, Jean-Pierre Hubaux, Wouter Lueks, Massimo Marelli, Carmela Troncoso, Juan-Ramón Troncoso Pastoriza, Frédéric Pont, and Sandra Siby for their valuable feedback. This project was supported in part by the ETH domain under PHRT grant #2017−201, and by the AXA Research Fund, Byzgen, DFINITY, and the Swiss Data Science Center (SDSC).","intvolume":"        14","month":"12","date_published":"2020-12-01T00:00:00Z"},{"publication":"SIAM Journal on Mathematical Analysis","doi":"10.1137/20M1322182","ec_funded":1,"oa_version":"Published Version","isi":1,"volume":52,"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2021-01-24T23:01:09Z","ddc":["510"],"day":"15","status":"public","page":"6222-6233","external_id":{"isi":["000600695200027"]},"year":"2020","date_published":"2020-12-15T00:00:00Z","month":"12","intvolume":"        52","acknowledgement":"This work was supported by the European Union's Horizon 2020 Research and Innovation\r\nProgramme under Marie Sklodowska-Curie grant agreement 665385 and by the Deutsche\r\nForschungsgemeinschaft (DFG, German Research Foundation) under Germany's Excellence Strategy, EXC-2047/1--390685813.","date_updated":"2023-08-24T11:15:16Z","oa":1,"issue":"6","project":[{"grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"}],"publication_status":"published","citation":{"mla":"Fischer, Julian L., et al. “Convergence Rates of the Allen-Cahn Equation to Mean Curvature Flow: A Short Proof Based on Relative Entropies.” <i>SIAM Journal on Mathematical Analysis</i>, vol. 52, no. 6, Society for Industrial and Applied Mathematics, 2020, pp. 6222–33, doi:<a href=\"https://doi.org/10.1137/20M1322182\">10.1137/20M1322182</a>.","apa":"Fischer, J. L., Laux, T., &#38; Simon, T. M. (2020). Convergence rates of the Allen-Cahn equation to mean curvature flow: A short proof based on relative entropies. <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/20M1322182\">https://doi.org/10.1137/20M1322182</a>","chicago":"Fischer, Julian L, Tim Laux, and Theresa M. Simon. “Convergence Rates of the Allen-Cahn Equation to Mean Curvature Flow: A Short Proof Based on Relative Entropies.” <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics, 2020. <a href=\"https://doi.org/10.1137/20M1322182\">https://doi.org/10.1137/20M1322182</a>.","ama":"Fischer JL, Laux T, Simon TM. Convergence rates of the Allen-Cahn equation to mean curvature flow: A short proof based on relative entropies. <i>SIAM Journal on Mathematical Analysis</i>. 2020;52(6):6222-6233. doi:<a href=\"https://doi.org/10.1137/20M1322182\">10.1137/20M1322182</a>","short":"J.L. Fischer, T. Laux, T.M. Simon, SIAM Journal on Mathematical Analysis 52 (2020) 6222–6233.","ieee":"J. L. Fischer, T. Laux, and T. M. Simon, “Convergence rates of the Allen-Cahn equation to mean curvature flow: A short proof based on relative entropies,” <i>SIAM Journal on Mathematical Analysis</i>, vol. 52, no. 6. Society for Industrial and Applied Mathematics, pp. 6222–6233, 2020.","ista":"Fischer JL, Laux T, Simon TM. 2020. Convergence rates of the Allen-Cahn equation to mean curvature flow: A short proof based on relative entropies. SIAM Journal on Mathematical Analysis. 52(6), 6222–6233."},"publication_identifier":{"eissn":["10957154"],"issn":["00361410"]},"scopus_import":"1","abstract":[{"text":"We give a short and self-contained proof for rates of convergence of the Allen--Cahn equation towards mean curvature flow, assuming that a classical (smooth) solution to the latter exists and starting from well-prepared initial data. Our approach is based on a relative entropy technique. In particular, it does not require a stability analysis for the linearized Allen--Cahn operator. As our analysis also does not rely on the comparison principle, we expect it to be applicable to more complex equations and systems.","lang":"eng"}],"type":"journal_article","file_date_updated":"2021-01-25T07:48:39Z","_id":"9039","quality_controlled":"1","article_processing_charge":"No","department":[{"_id":"JuFi"}],"language":[{"iso":"eng"}],"article_type":"original","has_accepted_license":"1","publisher":"Society for Industrial and Applied Mathematics","title":"Convergence rates of the Allen-Cahn equation to mean curvature flow: A short proof based on relative entropies","author":[{"full_name":"Fischer, Julian L","first_name":"Julian L","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0479-558X","last_name":"Fischer"},{"full_name":"Laux, Tim","first_name":"Tim","last_name":"Laux"},{"last_name":"Simon","first_name":"Theresa M.","full_name":"Simon, Theresa M."}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"access_level":"open_access","relation":"main_file","checksum":"21aa1cf4c30a86a00cae15a984819b5d","file_size":310655,"creator":"dernst","content_type":"application/pdf","file_id":"9041","date_updated":"2021-01-25T07:48:39Z","date_created":"2021-01-25T07:48:39Z","file_name":"2020_SIAM_Fischer.pdf","success":1}]}]