[{"date_updated":"2023-09-12T08:03:40Z","publication":"Proceedings of the 37th International Conference on Machine Learning","page":"7253-7262","oa":1,"year":"2020","alternative_title":["PMLR"],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2002.11860"}],"intvolume":"       119","type":"conference","language":[{"iso":"eng"}],"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"FrLo"}],"date_created":"2023-08-22T14:07:52Z","date_published":"2020-07-27T00:00:00Z","extern":"1","external_id":{"arxiv":["2002.11860"]},"publication_status":"published","status":"public","_id":"14187","author":[{"last_name":"Négiar","full_name":"Négiar, Geoffrey","first_name":"Geoffrey"},{"last_name":"Dresdner","full_name":"Dresdner, Gideon","first_name":"Gideon"},{"full_name":"Tsai, Alicia","last_name":"Tsai","first_name":"Alicia"},{"first_name":"Laurent El","full_name":"Ghaoui, Laurent El","last_name":"Ghaoui"},{"full_name":"Locatello, Francesco","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","orcid":"0000-0002-4850-0683"},{"last_name":"Freund","full_name":"Freund, Robert M.","first_name":"Robert M."},{"first_name":"Fabian","full_name":"Pedregosa, Fabian","last_name":"Pedregosa"}],"title":"Stochastic Frank-Wolfe for constrained finite-sum minimization","abstract":[{"lang":"eng","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."}],"arxiv":1,"volume":119,"article_processing_charge":"No","month":"07","day":"27","citation":{"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.","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.","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.","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."},"conference":{"name":"International Conference on Machine Learning","end_date":"2020-07-18","location":"Virtual","start_date":"2020-07-13"},"oa_version":"Preprint"},{"abstract":[{"lang":"eng","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."}],"_id":"14188","author":[{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","full_name":"Locatello, Francesco","last_name":"Locatello","orcid":"0000-0002-4850-0683"},{"last_name":"Poole","full_name":"Poole, Ben","first_name":"Ben"},{"first_name":"Gunnar","full_name":"Rätsch, Gunnar","last_name":"Rätsch"},{"first_name":"Bernhard","full_name":"Schölkopf, Bernhard","last_name":"Schölkopf"},{"first_name":"Olivier","full_name":"Bachem, Olivier","last_name":"Bachem"},{"full_name":"Tschannen, Michael","last_name":"Tschannen","first_name":"Michael"}],"title":"Weakly-supervised disentanglement without compromises","status":"public","publication_status":"published","conference":{"start_date":"2020-07-13","location":"Virtual","end_date":"2020-07-18","name":"International Conference on Machine Learning"},"oa_version":"Preprint","month":"07","day":"07","citation":{"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.","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.","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.","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.","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.","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.","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."},"article_processing_charge":"No","volume":119,"arxiv":1,"year":"2020","alternative_title":["PMLR"],"oa":1,"page":"6348–6359","date_updated":"2023-09-12T07:59:29Z","publication":"Proceedings of the 37th International Conference on Machine Learning","scopus_import":"1","date_created":"2023-08-22T14:08:14Z","extern":"1","external_id":{"arxiv":["2002.02886"]},"date_published":"2020-07-07T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"FrLo"}],"language":[{"iso":"eng"}],"type":"conference","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/2002.02886","open_access":"1"}],"intvolume":"       119"},{"month":"09","ddc":["000"],"day":"01","citation":{"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.","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.","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.","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.","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.","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.","short":"F. Locatello, S. Bauer, M. Lucic, G. Rätsch, S. Gelly, B. Schölkopf, O. Bachem, Journal of Machine Learning Research 21 (2020)."},"oa_version":"Published Version","arxiv":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":21,"article_processing_charge":"No","has_accepted_license":"1","_id":"14195","author":[{"last_name":"Locatello","full_name":"Locatello, Francesco","first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683"},{"last_name":"Bauer","full_name":"Bauer, Stefan","first_name":"Stefan"},{"full_name":"Lucic, Mario","last_name":"Lucic","first_name":"Mario"},{"full_name":"Rätsch, Gunnar","last_name":"Rätsch","first_name":"Gunnar"},{"first_name":"Sylvain","full_name":"Gelly, Sylvain","last_name":"Gelly"},{"full_name":"Schölkopf, Bernhard","last_name":"Schölkopf","first_name":"Bernhard"},{"full_name":"Bachem, Olivier","last_name":"Bachem","first_name":"Olivier"}],"title":"A sober look at the unsupervised learning of disentangled representations and their evaluation","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."}],"status":"public","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"FrLo"}],"scopus_import":"1","date_created":"2023-08-22T14:10:34Z","date_published":"2020-09-01T00:00:00Z","extern":"1","external_id":{"arxiv":["2010.14766"]},"intvolume":"        21","main_file_link":[{"url":"https://jmlr.csail.mit.edu/papers/v21/19-976.html","open_access":"1"}],"publisher":"MIT Press","language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","oa":1,"year":"2020","date_updated":"2023-09-12T09:23:56Z","publication":"Journal of Machine Learning Research","article_type":"original","article_number":"209"},{"intvolume":"      2020","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1908.03058"}],"publisher":"IEEE","isi":1,"type":"conference","language":[{"iso":"eng"}],"quality_controlled":"1","department":[{"_id":"JoFi"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"isi":["000612224900089"],"arxiv":["1908.03058"]},"date_published":"2020-09-21T00:00:00Z","scopus_import":"1","date_created":"2021-01-10T23:01:17Z","publication":"IEEE National Radar Conference - Proceedings","date_updated":"2024-09-10T12:23:52Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"7910"}]},"article_number":"9266397","oa":1,"year":"2020","arxiv":1,"article_processing_charge":"No","volume":2020,"day":"21","citation":{"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.","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>","short":"S. Barzanjeh, S. Pirandola, D. Vitali, J.M. Fink, in:, IEEE National Radar Conference - Proceedings, IEEE, 2020.","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.","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>.","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>."},"month":"09","conference":{"name":"RadarConf: National Conference on Radar","location":"Florence, Italy","start_date":"2020-09-21","end_date":"2020-09-25"},"oa_version":"Preprint","publication_identifier":{"issn":["1097-5659"],"isbn":["9781728189420"]},"project":[{"name":"A Fiber Optic Transceiver for Superconducting Qubits","call_identifier":"H2020","grant_number":"758053","_id":"26336814-B435-11E9-9278-68D0E5697425"},{"grant_number":"862644","_id":"237CBA6C-32DE-11EA-91FC-C7463DDC885E","name":"Quantum readout techniques and technologies","call_identifier":"H2020"},{"call_identifier":"H2020","name":"Microwave-to-Optical Quantum Link: Quantum Teleportation and Quantum Illumination with cavity Optomechanics SUPEREOM","grant_number":"707438","_id":"258047B6-B435-11E9-9278-68D0E5697425"},{"_id":"257EB838-B435-11E9-9278-68D0E5697425","grant_number":"732894","name":"Hybrid Optomechanical Technologies","call_identifier":"H2020"}],"status":"public","publication_status":"published","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).","ec_funded":1,"author":[{"last_name":"Barzanjeh","full_name":"Barzanjeh, Shabir","first_name":"Shabir","id":"2D25E1F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0415-1423"},{"first_name":"Stefano","last_name":"Pirandola","full_name":"Pirandola, Stefano"},{"full_name":"Vitali, David","last_name":"Vitali","first_name":"David"},{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes M","full_name":"Fink, Johannes M","last_name":"Fink","orcid":"0000-0001-8112-028X"}],"title":"Microwave quantum illumination with a digital phase-conjugated receiver","_id":"9001","issue":"9","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"}],"doi":"10.1109/RadarConf2043947.2020.9266397"},{"citation":{"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.","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>","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>","ista":"Browning TD, Sawin W. 2020. Free rational points on smooth hypersurfaces. Commentarii Mathematici Helvetici. 95(4), 635–659.","short":"T.D. Browning, W. Sawin, Commentarii Mathematici Helvetici 95 (2020) 635–659.","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>.","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>."},"day":"07","month":"12","oa_version":"Preprint","arxiv":1,"article_processing_charge":"No","volume":95,"title":"Free rational points on smooth hypersurfaces","author":[{"first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177"},{"full_name":"Sawin, Will","last_name":"Sawin","first_name":"Will"}],"_id":"9007","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"}],"issue":"4","doi":"10.4171/CMH/499","publication_identifier":{"issn":["00102571"],"eissn":["14208946"]},"publication_status":"published","status":"public","department":[{"_id":"TiBr"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_published":"2020-12-07T00:00:00Z","external_id":{"arxiv":["1906.08463"],"isi":["000596833300001"]},"date_created":"2021-01-17T23:01:11Z","scopus_import":"1","publisher":"European Mathematical Society","main_file_link":[{"url":"https://arxiv.org/abs/1906.08463","open_access":"1"}],"intvolume":"        95","isi":1,"language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","oa":1,"year":"2020","publication":"Commentarii Mathematici Helvetici","date_updated":"2023-08-24T11:11:36Z","page":"635-659","article_type":"original"},{"publisher":"Association for Computing Machinery","intvolume":"        14","main_file_link":[{"open_access":"1","url":"https://dl.acm.org/doi/10.14778/3436905.3436917"}],"type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","isi":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"ElKo"}],"date_created":"2021-01-17T23:01:13Z","scopus_import":"1","date_published":"2020-12-01T00:00:00Z","external_id":{"isi":["000658495400012"]},"date_updated":"2023-08-24T13:57:13Z","publication":"Proceedings of the VLDB Endowment","page":"586-599","article_type":"original","oa":1,"year":"2020","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"volume":14,"article_processing_charge":"No","month":"12","citation":{"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>","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.","short":"E. Kokoris Kogias, E.C. Alp, L. Gasser, P. Jovanovic, E. Syta, B. Ford, Proceedings of the VLDB Endowment 14 (2020) 586–599.","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.","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>","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>.","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>."},"day":"01","oa_version":"Published Version","publication_identifier":{"eissn":["2150-8097"]},"status":"public","publication_status":"published","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).","_id":"9011","title":"CALYPSO: Private data management for decentralized ledgers","author":[{"last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios","first_name":"Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30"},{"last_name":"Alp","full_name":"Alp, Enis Ceyhun","first_name":"Enis Ceyhun"},{"last_name":"Gasser","full_name":"Gasser, Linus","first_name":"Linus"},{"full_name":"Jovanovic, Philipp","last_name":"Jovanovic","first_name":"Philipp"},{"first_name":"Ewa","full_name":"Syta, Ewa","last_name":"Syta"},{"full_name":"Ford, Bryan","last_name":"Ford","first_name":"Bryan"}],"doi":"10.14778/3436905.3436917","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"}],"issue":"4"},{"page":"6222-6233","article_type":"original","publication":"SIAM Journal on Mathematical Analysis","date_updated":"2023-08-24T11:15:16Z","year":"2020","oa":1,"isi":1,"type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"Society for Industrial and Applied Mathematics","intvolume":"        52","external_id":{"isi":["000600695200027"]},"date_published":"2020-12-15T00:00:00Z","date_created":"2021-01-24T23:01:09Z","scopus_import":"1","department":[{"_id":"JuFi"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","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.","status":"public","publication_status":"published","ec_funded":1,"publication_identifier":{"eissn":["10957154"],"issn":["00361410"]},"project":[{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020"}],"abstract":[{"lang":"eng","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."}],"issue":"6","doi":"10.1137/20M1322182","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","last_name":"Fischer","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","first_name":"Julian L","orcid":"0000-0002-0479-558X"},{"first_name":"Tim","full_name":"Laux, Tim","last_name":"Laux"},{"last_name":"Simon","full_name":"Simon, Theresa M.","first_name":"Theresa M."}],"_id":"9039","has_accepted_license":"1","article_processing_charge":"No","volume":52,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"file_id":"9041","date_created":"2021-01-25T07:48:39Z","success":1,"date_updated":"2021-01-25T07:48:39Z","access_level":"open_access","checksum":"21aa1cf4c30a86a00cae15a984819b5d","content_type":"application/pdf","file_name":"2020_SIAM_Fischer.pdf","relation":"main_file","file_size":310655,"creator":"dernst"}],"oa_version":"Published Version","citation":{"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>.","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>.","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.","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>","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.","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."},"day":"15","month":"12","ddc":["510"],"file_date_updated":"2021-01-25T07:48:39Z"},{"scopus_import":"1","date_created":"2021-01-24T23:01:10Z","date_published":"2020-09-21T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"type":"conference","quality_controlled":"1","publisher":"TU Wien Academic Press","year":"2020","oa":1,"page":"138-147","date_updated":"2021-02-09T09:39:59Z","publication":"Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design","conference":{"name":" FMCAD: Formal Methods in Computer-Aided Design","location":"Online Conference","start_date":"2020-09-21","end_date":"2020-09-24"},"oa_version":"Published Version","file_date_updated":"2021-02-09T09:39:02Z","month":"09","ddc":["000"],"day":"21","citation":{"ieee":"P. A. Alamdari, G. Avni, T. A. Henzinger, and A. Lukina, “Formal methods with a touch of magic,” in <i>Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design</i>, Online Conference, 2020, pp. 138–147.","apa":"Alamdari, P. A., Avni, G., Henzinger, T. A., &#38; Lukina, A. (2020). Formal methods with a touch of magic. In <i>Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design</i> (pp. 138–147). Online Conference: TU Wien Academic Press. <a href=\"https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21\">https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21</a>","ama":"Alamdari PA, Avni G, Henzinger TA, Lukina A. Formal methods with a touch of magic. In: <i>Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design</i>. TU Wien Academic Press; 2020:138-147. doi:<a href=\"https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21\">10.34727/2020/isbn.978-3-85448-042-6_21</a>","ista":"Alamdari PA, Avni G, Henzinger TA, Lukina A. 2020. Formal methods with a touch of magic. Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design.  FMCAD: Formal Methods in Computer-Aided Design, 138–147.","short":"P.A. Alamdari, G. Avni, T.A. Henzinger, A. Lukina, in:, Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2020, pp. 138–147.","chicago":"Alamdari, Par Alizadeh, Guy Avni, Thomas A Henzinger, and Anna Lukina. “Formal Methods with a Touch of Magic.” In <i>Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design</i>, 138–47. TU Wien Academic Press, 2020. <a href=\"https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21\">https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21</a>.","mla":"Alamdari, Par Alizadeh, et al. “Formal Methods with a Touch of Magic.” <i>Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design</i>, TU Wien Academic Press, 2020, pp. 138–47, doi:<a href=\"https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21\">10.34727/2020/isbn.978-3-85448-042-6_21</a>."},"article_processing_charge":"No","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"access_level":"open_access","content_type":"application/pdf","checksum":"d616d549a0ade78606b16f8a9540820f","success":1,"date_updated":"2021-02-09T09:39:02Z","file_name":"2020_FMCAD_Alamdari.pdf","relation":"main_file","file_size":990999,"creator":"dernst","file_id":"9109","date_created":"2021-02-09T09:39:02Z"}],"doi":"10.34727/2020/isbn.978-3-85448-042-6_21","abstract":[{"lang":"eng","text":"Machine learning and formal methods have complimentary benefits and drawbacks. In this work, we address the controller-design problem with a combination of techniques from both fields. The use of black-box neural networks in deep reinforcement learning (deep RL) poses a challenge for such a combination. Instead of reasoning formally about the output of deep RL, which we call the wizard, we extract from it a decision-tree based model, which we refer to as the magic book. Using the extracted model as an intermediary, we are able to handle problems that are infeasible for either deep RL or formal methods by themselves. First, we suggest, for the first time, a synthesis procedure that is based on a magic book. We synthesize a stand-alone correct-by-design controller that enjoys the favorable performance of RL. Second, we incorporate a magic book in a bounded model checking (BMC) procedure. BMC allows us to find numerous traces of the plant under the control of the wizard, which a user can use to increase the trustworthiness of the wizard and direct further training."}],"_id":"9040","author":[{"full_name":"Alamdari, Par Alizadeh","last_name":"Alamdari","first_name":"Par Alizadeh"},{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy","full_name":"Avni, Guy","last_name":"Avni","orcid":"0000-0001-5588-8287"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"},{"first_name":"Anna","id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425","last_name":"Lukina","full_name":"Lukina, Anna"}],"title":"Formal methods with a touch of magic","status":"public","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","publication_status":"published","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"publication_identifier":{"eissn":["2708-7824"],"isbn":["9783854480426"]}},{"place":"Cham","publication_status":"published","status":"public","date_updated":"2021-02-05T12:19:21Z","publication_identifier":{"isbn":["9783319903064"]},"publication":"Encyclopedia of Social Insects","doi":"10.1007/978-3-319-90306-4_94-1","year":"2020","_id":"9096","editor":[{"first_name":"C","full_name":"Starr, C","last_name":"Starr"}],"author":[{"last_name":"Schmid-Hempel","full_name":"Schmid-Hempel, Paul","first_name":"Paul"},{"orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia M","last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia M"}],"title":"Parasites and Pathogens","type":"book_chapter","quality_controlled":"1","language":[{"iso":"eng"}],"article_processing_charge":"No","publisher":"Springer Nature","date_created":"2021-02-05T12:15:18Z","oa_version":"None","date_published":"2020-02-22T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"02","department":[{"_id":"SyCr"}],"day":"22","citation":{"apa":"Schmid-Hempel, P., &#38; Cremer, S. (2020). Parasites and Pathogens. In C. Starr (Ed.), <i>Encyclopedia of Social Insects</i>. Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-90306-4_94-1\">https://doi.org/10.1007/978-3-319-90306-4_94-1</a>","ieee":"P. Schmid-Hempel and S. Cremer, “Parasites and Pathogens,” in <i>Encyclopedia of Social Insects</i>, C. Starr, Ed. Cham: Springer Nature, 2020.","ama":"Schmid-Hempel P, Cremer S. Parasites and Pathogens. In: Starr C, ed. <i>Encyclopedia of Social Insects</i>. Cham: Springer Nature; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-319-90306-4_94-1\">10.1007/978-3-319-90306-4_94-1</a>","short":"P. Schmid-Hempel, S. Cremer, in:, C. Starr (Ed.), Encyclopedia of Social Insects, Springer Nature, Cham, 2020.","ista":"Schmid-Hempel P, Cremer S. 2020.Parasites and Pathogens. In: Encyclopedia of Social Insects. .","chicago":"Schmid-Hempel, Paul, and Sylvia Cremer. “Parasites and Pathogens.” In <i>Encyclopedia of Social Insects</i>, edited by C Starr. Cham: Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-319-90306-4_94-1\">https://doi.org/10.1007/978-3-319-90306-4_94-1</a>.","mla":"Schmid-Hempel, Paul, and Sylvia Cremer. “Parasites and Pathogens.” <i>Encyclopedia of Social Insects</i>, edited by C Starr, Springer Nature, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-319-90306-4_94-1\">10.1007/978-3-319-90306-4_94-1</a>."}},{"title":"Lagrangian reachtubes: The next generation","author":[{"first_name":"Sophie","full_name":"Gruenbacher, Sophie","last_name":"Gruenbacher"},{"full_name":"Cyranka, Jacek","last_name":"Cyranka","first_name":"Jacek"},{"full_name":"Lechner, Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"},{"last_name":"Islam","full_name":"Islam, Md Ariful","first_name":"Md Ariful"},{"last_name":"Smolka","full_name":"Smolka, Scott A.","first_name":"Scott A."},{"first_name":"Radu","full_name":"Grosu, Radu","last_name":"Grosu"}],"_id":"9103","abstract":[{"text":"We introduce LRT-NG, a set of techniques and an associated toolset that computes a reachtube (an over-approximation of the set of reachable states over a given time horizon) of a nonlinear dynamical system. LRT-NG significantly advances the state-of-the-art Langrangian Reachability and its associated tool LRT. From a theoretical perspective, LRT-NG is superior to LRT in three ways. First, it uses for the first time an analytically computed metric for the propagated ball which is proven to minimize the ball’s volume. We emphasize that the metric computation is the centerpiece of all bloating-based techniques. Secondly, it computes the next reachset as the intersection of two balls: one based on the Cartesian metric and the other on the new metric. While the two metrics were previously considered opposing approaches, their joint use considerably tightens the reachtubes. Thirdly, it avoids the \"wrapping effect\" associated with the validated integration of the center of the reachset, by optimally absorbing the interval approximation in the radius of the next ball. From a tool-development perspective, LRT-NG is superior to LRT in two ways. First, it is a standalone tool that no longer relies on CAPD. This required the implementation of the Lohner method and a Runge-Kutta time-propagation method. Secondly, it has an improved interface, allowing the input model and initial conditions to be provided as external input files. Our experiments on a comprehensive set of benchmarks, including two Neural ODEs, demonstrates LRT-NG’s superior performance compared to LRT, CAPD, and Flow*.","lang":"eng"}],"doi":"10.1109/CDC42340.2020.9304042","publication_identifier":{"isbn":["9781728174471"],"issn":["07431546"]},"project":[{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"status":"public","publication_status":"published","acknowledgement":"The authors would like to thank Ramin Hasani and Guillaume Berger for intellectual discussions about the research which lead to the generation of new ideas. ML was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Smolka’s research was supported by NSF grants CPS-1446832 and CCF-1918225. Gruenbacher is funded by FWF project W1255-N23. JC was partially supported by NAWA Polish Returns grant\r\nPPN/PPO/2018/1/00029.\r\n","citation":{"mla":"Gruenbacher, Sophie, et al. “Lagrangian Reachtubes: The next Generation.” <i>Proceedings of the 59th IEEE Conference on Decision and Control</i>, vol. 2020, IEEE, 2020, pp. 1556–63, doi:<a href=\"https://doi.org/10.1109/CDC42340.2020.9304042\">10.1109/CDC42340.2020.9304042</a>.","chicago":"Gruenbacher, Sophie, Jacek Cyranka, Mathias Lechner, Md Ariful Islam, Scott A. Smolka, and Radu Grosu. “Lagrangian Reachtubes: The next Generation.” In <i>Proceedings of the 59th IEEE Conference on Decision and Control</i>, 2020:1556–63. IEEE, 2020. <a href=\"https://doi.org/10.1109/CDC42340.2020.9304042\">https://doi.org/10.1109/CDC42340.2020.9304042</a>.","ieee":"S. Gruenbacher, J. Cyranka, M. Lechner, M. A. Islam, S. A. Smolka, and R. Grosu, “Lagrangian reachtubes: The next generation,” in <i>Proceedings of the 59th IEEE Conference on Decision and Control</i>, Jeju Islang, Korea (South), 2020, vol. 2020, pp. 1556–1563.","apa":"Gruenbacher, S., Cyranka, J., Lechner, M., Islam, M. A., Smolka, S. A., &#38; Grosu, R. (2020). Lagrangian reachtubes: The next generation. In <i>Proceedings of the 59th IEEE Conference on Decision and Control</i> (Vol. 2020, pp. 1556–1563). Jeju Islang, Korea (South): IEEE. <a href=\"https://doi.org/10.1109/CDC42340.2020.9304042\">https://doi.org/10.1109/CDC42340.2020.9304042</a>","ama":"Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. Lagrangian reachtubes: The next generation. In: <i>Proceedings of the 59th IEEE Conference on Decision and Control</i>. Vol 2020. IEEE; 2020:1556-1563. doi:<a href=\"https://doi.org/10.1109/CDC42340.2020.9304042\">10.1109/CDC42340.2020.9304042</a>","short":"S. Gruenbacher, J. Cyranka, M. Lechner, M.A. Islam, S.A. Smolka, R. Grosu, in:, Proceedings of the 59th IEEE Conference on Decision and Control, IEEE, 2020, pp. 1556–1563.","ista":"Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. 2020. Lagrangian reachtubes: The next generation. Proceedings of the 59th IEEE Conference on Decision and Control. CDC: Conference on Decision and Control vol. 2020, 1556–1563."},"day":"14","month":"12","oa_version":"Preprint","conference":{"end_date":"2020-12-18","start_date":"2020-12-14","location":"Jeju Islang, Korea (South)","name":"CDC: Conference on Decision and Control"},"arxiv":1,"volume":2020,"article_processing_charge":"No","oa":1,"year":"2020","publication":"Proceedings of the 59th IEEE Conference on Decision and Control","date_updated":"2021-02-09T09:20:58Z","page":"1556-1563","department":[{"_id":"ToHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2020-12-14T00:00:00Z","external_id":{"arxiv":["2012.07458"]},"date_created":"2021-02-07T23:01:14Z","scopus_import":"1","publisher":"IEEE","intvolume":"      2020","main_file_link":[{"url":"https://arxiv.org/abs/2012.07458","open_access":"1"}],"language":[{"iso":"eng"}],"quality_controlled":"1","type":"conference"},{"isi":1,"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","publisher":"Springer Nature","intvolume":"       142","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.11199"}],"date_published":"2020-11-01T00:00:00Z","external_id":{"isi":["000611879400008"],"arxiv":["1804.11199"]},"date_created":"2021-02-07T23:01:15Z","scopus_import":"1","department":[{"_id":"LaEr"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","page":"323-348","article_type":"original","publication":"Journal d'Analyse Mathematique","date_updated":"2023-08-24T11:16:03Z","year":"2020","oa":1,"volume":142,"article_processing_charge":"No","arxiv":1,"oa_version":"Preprint","citation":{"ista":"Bao Z, Erdös L, Schnelli K. 2020. On the support of the free additive convolution. Journal d’Analyse Mathematique. 142, 323–348.","short":"Z. Bao, L. Erdös, K. Schnelli, Journal d’Analyse Mathematique 142 (2020) 323–348.","ama":"Bao Z, Erdös L, Schnelli K. On the support of the free additive convolution. <i>Journal d’Analyse Mathematique</i>. 2020;142:323-348. doi:<a href=\"https://doi.org/10.1007/s11854-020-0135-2\">10.1007/s11854-020-0135-2</a>","ieee":"Z. Bao, L. Erdös, and K. Schnelli, “On the support of the free additive convolution,” <i>Journal d’Analyse Mathematique</i>, vol. 142. Springer Nature, pp. 323–348, 2020.","apa":"Bao, Z., Erdös, L., &#38; Schnelli, K. (2020). On the support of the free additive convolution. <i>Journal d’Analyse Mathematique</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11854-020-0135-2\">https://doi.org/10.1007/s11854-020-0135-2</a>","mla":"Bao, Zhigang, et al. “On the Support of the Free Additive Convolution.” <i>Journal d’Analyse Mathematique</i>, vol. 142, Springer Nature, 2020, pp. 323–48, doi:<a href=\"https://doi.org/10.1007/s11854-020-0135-2\">10.1007/s11854-020-0135-2</a>.","chicago":"Bao, Zhigang, László Erdös, and Kevin Schnelli. “On the Support of the Free Additive Convolution.” <i>Journal d’Analyse Mathematique</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s11854-020-0135-2\">https://doi.org/10.1007/s11854-020-0135-2</a>."},"day":"01","month":"11","status":"public","acknowledgement":"Supported in part by Hong Kong RGC Grant ECS 26301517.\r\nSupported in part by ERC Advanced Grant RANMAT No. 338804.\r\nSupported in part by the Knut and Alice Wallenberg Foundation and the Swedish Research Council Grant VR-2017-05195.","publication_status":"published","ec_funded":1,"publication_identifier":{"issn":["00217670"],"eissn":["15658538"]},"project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"}],"abstract":[{"lang":"eng","text":"We consider the free additive convolution of two probability measures μ and ν on the real line and show that μ ⊞ v is supported on a single interval if μ and ν each has single interval support. Moreover, the density of μ ⊞ ν is proven to vanish as a square root near the edges of its support if both μ and ν have power law behavior with exponents between −1 and 1 near their edges. In particular, these results show the ubiquity of the conditions in our recent work on optimal local law at the spectral edges for addition of random matrices [5]."}],"doi":"10.1007/s11854-020-0135-2","title":"On the support of the free additive convolution","author":[{"full_name":"Bao, Zhigang","last_name":"Bao","id":"442E6A6C-F248-11E8-B48F-1D18A9856A87","first_name":"Zhigang","orcid":"0000-0003-3036-1475"},{"orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","full_name":"Erdös, László","last_name":"Erdös"},{"orcid":"0000-0003-0954-3231","last_name":"Schnelli","full_name":"Schnelli, Kevin","first_name":"Kevin","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87"}],"_id":"9104"},{"article_type":"original","article_number":"020315","related_material":{"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/how-to-transport-microwave-quantum-information-via-optical-fiber/"}],"record":[{"status":"public","relation":"research_data","id":"13071"},{"id":"12900","relation":"dissertation_contains","status":"public"},{"id":"13175","relation":"dissertation_contains","status":"public"}]},"date_updated":"2024-10-29T09:11:05Z","publication":"PRX Quantum","year":"2020","oa":1,"quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"isi":1,"intvolume":"         1","publisher":"American Physical Society","acknowledged_ssus":[{"_id":"M-Shop"}],"date_created":"2021-02-12T10:41:28Z","external_id":{"isi":["000674680100001"]},"date_published":"2020-11-23T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"JoFi"}],"ec_funded":1,"status":"public","acknowledgement":"The authors acknowledge the support of T. Menner, A. Arslani, and T. Asenov from the Miba machine shop for machining the microwave cavity, and thank S. Barzanjeh, F. Sedlmeir, and C. Marquardt for fruitful discussions. This work is supported by IST Austria and the European Research Council under Grant No. 758053 (ERC StG QUNNECT). W.H. is the recipient of an ISTplus postdoctoral fellowship with funding from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant No. 754411.\r\nG.A. is the recipient of a DOC fellowship of the Austrian Academy of Sciences at IST Austria. J.M.F. acknowledges support from the Austrian Science Fund (FWF) through BeyondC (F71) and the European Union’s Horizon 2020 research and innovation program under Grant No. 899354 (FET Open SuperQuLAN). H.G.L.S. acknowledges support from the Aotearoa/New Zealand’s MBIE Endeavour Smart Ideas Grant No UOOX1805.","publication_status":"published","project":[{"name":"A Fiber Optic Transceiver for Superconducting Qubits","call_identifier":"H2020","grant_number":"758053","_id":"26336814-B435-11E9-9278-68D0E5697425"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"},{"grant_number":"899354","_id":"9B868D20-BA93-11EA-9121-9846C619BF3A","name":"Quantum Local Area Networks with Superconducting Qubits","call_identifier":"H2020"},{"grant_number":"F07105","_id":"26927A52-B435-11E9-9278-68D0E5697425","name":"Integrating superconducting quantum circuits","call_identifier":"FWF"},{"name":"Coherent on-chip conversion of superconducting qubit signals from microwaves to optical frequencies","_id":"2671EB66-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"issn":["2691-3399"]},"doi":"10.1103/prxquantum.1.020315","issue":"2","abstract":[{"lang":"eng","text":"Microwave photonics lends the advantages of fiber optics to electronic sensing and communication systems. In contrast to nonlinear optics, electro-optic devices so far require classical modulation fields whose variance is dominated by electronic or thermal noise rather than quantum fluctuations. Here we demonstrate bidirectional single-sideband conversion of X band microwave to C band telecom light with a microwave mode occupancy as low as 0.025 ± 0.005 and an added output noise of less than or equal to 0.074 photons. This is facilitated by radiative cooling and a triply resonant ultra-low-loss transducer operating at millikelvin temperatures. The high bandwidth of 10.7 MHz and total (internal) photon conversion\r\nefficiency of 0.03% (0.67%) combined with the extremely slow heating rate of 1.1 added output noise photons per second for the highest available pump power of 1.48 mW puts near-unity efficiency pulsed quantum transduction within reach. Together with the non-Gaussian resources of superconducting qubits this might provide the practical foundation to extend the range and scope of current quantum networks in analogy to electrical repeaters in classical fiber optic communication."}],"_id":"9114","author":[{"first_name":"William J","id":"29705398-F248-11E8-B48F-1D18A9856A87","last_name":"Hease","full_name":"Hease, William J","orcid":"0000-0001-9868-2166"},{"orcid":"0000-0001-6249-5860","full_name":"Rueda Sanchez, Alfredo R","last_name":"Rueda Sanchez","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","first_name":"Alfredo R"},{"id":"47D26E34-F248-11E8-B48F-1D18A9856A87","first_name":"Rishabh","full_name":"Sahu, Rishabh","last_name":"Sahu","orcid":"0000-0001-6264-2162"},{"first_name":"Matthias","id":"45598606-F248-11E8-B48F-1D18A9856A87","last_name":"Wulf","full_name":"Wulf, Matthias","orcid":"0000-0001-6613-1378"},{"orcid":"0000-0003-1397-7876","first_name":"Georg M","id":"3770C838-F248-11E8-B48F-1D18A9856A87","last_name":"Arnold","full_name":"Arnold, Georg M"},{"full_name":"Schwefel, Harald G.L.","last_name":"Schwefel","first_name":"Harald G.L."},{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes M","full_name":"Fink, Johannes M","last_name":"Fink","orcid":"0000-0001-8112-028X"}],"title":"Bidirectional electro-optic wavelength conversion in the quantum ground state","article_processing_charge":"No","volume":1,"has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"file_id":"9115","date_created":"2021-02-12T11:16:16Z","file_name":"2020_PRXQuantum_Hease.pdf","creator":"dernst","file_size":2146924,"relation":"main_file","access_level":"open_access","checksum":"b70b12ded6d7660d4c9037eb09bfed0c","content_type":"application/pdf","success":1,"date_updated":"2021-02-12T11:16:16Z"}],"oa_version":"Published Version","month":"11","file_date_updated":"2021-02-12T11:16:16Z","ddc":["530"],"day":"23","citation":{"short":"W.J. Hease, A.R. Rueda Sanchez, R. Sahu, M. Wulf, G.M. Arnold, H.G.L. Schwefel, J.M. Fink, PRX Quantum 1 (2020).","ama":"Hease WJ, Rueda Sanchez AR, Sahu R, et al. Bidirectional electro-optic wavelength conversion in the quantum ground state. <i>PRX Quantum</i>. 2020;1(2). doi:<a href=\"https://doi.org/10.1103/prxquantum.1.020315\">10.1103/prxquantum.1.020315</a>","ista":"Hease WJ, Rueda Sanchez AR, Sahu R, Wulf M, Arnold GM, Schwefel HGL, Fink JM. 2020. Bidirectional electro-optic wavelength conversion in the quantum ground state. PRX Quantum. 1(2), 020315.","ieee":"W. J. Hease <i>et al.</i>, “Bidirectional electro-optic wavelength conversion in the quantum ground state,” <i>PRX Quantum</i>, vol. 1, no. 2. American Physical Society, 2020.","apa":"Hease, W. J., Rueda Sanchez, A. R., Sahu, R., Wulf, M., Arnold, G. M., Schwefel, H. G. L., &#38; Fink, J. M. (2020). Bidirectional electro-optic wavelength conversion in the quantum ground state. <i>PRX Quantum</i>. American Physical Society. <a href=\"https://doi.org/10.1103/prxquantum.1.020315\">https://doi.org/10.1103/prxquantum.1.020315</a>","mla":"Hease, William J., et al. “Bidirectional Electro-Optic Wavelength Conversion in the Quantum Ground State.” <i>PRX Quantum</i>, vol. 1, no. 2, 020315, American Physical Society, 2020, doi:<a href=\"https://doi.org/10.1103/prxquantum.1.020315\">10.1103/prxquantum.1.020315</a>.","chicago":"Hease, William J, Alfredo R Rueda Sanchez, Rishabh Sahu, Matthias Wulf, Georg M Arnold, Harald G.L. Schwefel, and Johannes M Fink. “Bidirectional Electro-Optic Wavelength Conversion in the Quantum Ground State.” <i>PRX Quantum</i>. American Physical Society, 2020. <a href=\"https://doi.org/10.1103/prxquantum.1.020315\">https://doi.org/10.1103/prxquantum.1.020315</a>."}},{"publication_status":"published","status":"public","publication":"eLS","publication_identifier":{"isbn":["9780470016176","9780470015902"]},"date_updated":"2021-02-15T13:18:16Z","abstract":[{"text":"Inversions are chromosomal rearrangements where the order of genes is reversed. Inversions originate by mutation and can be under positive, negative or balancing selection. Selective effects result from potential disruptive effects on meiosis, gene disruption at inversion breakpoints and, importantly, the effects of inversions as modifiers of recombination rate: Recombination is strongly reduced in individuals heterozygous for an inversion, allowing for alleles at different loci to be inherited as a ‘block’. This may lead to a selective advantage whenever it is favourable to keep certain combinations of alleles associated, for example under local adaptation with gene flow. Inversions can cover a considerable part of a chromosome and contain numerous loci under different selection pressures, so that the resulting overall effects may be complex. Empirical data from various systems show that inversions may have a prominent role in local adaptation, speciation, parallel evolution, the maintenance of polymorphism and sex chromosome evolution.","lang":"eng"}],"year":"2020","doi":"10.1002/9780470015902.a0029007","title":"Inversions and Evolution","author":[{"last_name":"Westram","full_name":"Westram, Anja M","first_name":"Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1050-4969"},{"first_name":"Rui","last_name":"Faria","full_name":"Faria, Rui"},{"full_name":"Butlin, Roger","last_name":"Butlin","first_name":"Roger"},{"first_name":"Kerstin","last_name":"Johannesson","full_name":"Johannesson, Kerstin"}],"_id":"9123","article_processing_charge":"No","quality_controlled":"1","type":"book_chapter","language":[{"iso":"eng"}],"publisher":"Wiley","date_published":"2020-05-16T00:00:00Z","date_created":"2021-02-15T12:39:04Z","oa_version":"None","citation":{"chicago":"Westram, Anja M, Rui Faria, Roger Butlin, and Kerstin Johannesson. “Inversions and Evolution.” In <i>ELS</i>. Wiley, 2020. <a href=\"https://doi.org/10.1002/9780470015902.a0029007\">https://doi.org/10.1002/9780470015902.a0029007</a>.","mla":"Westram, Anja M., et al. “Inversions and Evolution.” <i>ELS</i>, Wiley, 2020, doi:<a href=\"https://doi.org/10.1002/9780470015902.a0029007\">10.1002/9780470015902.a0029007</a>.","apa":"Westram, A. M., Faria, R., Butlin, R., &#38; Johannesson, K. (2020). Inversions and Evolution. In <i>eLS</i>. Wiley. <a href=\"https://doi.org/10.1002/9780470015902.a0029007\">https://doi.org/10.1002/9780470015902.a0029007</a>","ieee":"A. M. Westram, R. Faria, R. Butlin, and K. Johannesson, “Inversions and Evolution,” in <i>eLS</i>, Wiley, 2020.","ista":"Westram AM, Faria R, Butlin R, Johannesson K. 2020.Inversions and Evolution. In: eLS. .","ama":"Westram AM, Faria R, Butlin R, Johannesson K. Inversions and Evolution. In: <i>ELS</i>. Wiley; 2020. doi:<a href=\"https://doi.org/10.1002/9780470015902.a0029007\">10.1002/9780470015902.a0029007</a>","short":"A.M. Westram, R. Faria, R. Butlin, K. Johannesson, in:, ELS, Wiley, 2020."},"day":"16","department":[{"_id":"NiBa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"05"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"HeEd"}],"date_created":"2021-02-17T15:12:44Z","date_published":"2020-07-21T00:00:00Z","external_id":{"arxiv":["1908.06777"]},"publisher":"De Gruyter","intvolume":"         8","type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"oa":1,"year":"2020","date_updated":"2023-10-17T12:35:10Z","publication":"Computational and Mathematical Biophysics","page":"74-88","article_type":"original","ddc":["510"],"file_date_updated":"2021-02-19T13:33:19Z","month":"07","citation":{"short":"A. Akopyan, H. Edelsbrunner, Computational and Mathematical Biophysics 8 (2020) 74–88.","ista":"Akopyan A, Edelsbrunner H. 2020. The weighted Gaussian curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 8(1), 74–88.","ama":"Akopyan A, Edelsbrunner H. The weighted Gaussian curvature derivative of a space-filling diagram. <i>Computational and Mathematical Biophysics</i>. 2020;8(1):74-88. doi:<a href=\"https://doi.org/10.1515/cmb-2020-0101\">10.1515/cmb-2020-0101</a>","ieee":"A. Akopyan and H. Edelsbrunner, “The weighted Gaussian curvature derivative of a space-filling diagram,” <i>Computational and Mathematical Biophysics</i>, vol. 8, no. 1. De Gruyter, pp. 74–88, 2020.","apa":"Akopyan, A., &#38; Edelsbrunner, H. (2020). The weighted Gaussian curvature derivative of a space-filling diagram. <i>Computational and Mathematical Biophysics</i>. De Gruyter. <a href=\"https://doi.org/10.1515/cmb-2020-0101\">https://doi.org/10.1515/cmb-2020-0101</a>","mla":"Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Gaussian Curvature Derivative of a Space-Filling Diagram.” <i>Computational and Mathematical Biophysics</i>, vol. 8, no. 1, De Gruyter, 2020, pp. 74–88, doi:<a href=\"https://doi.org/10.1515/cmb-2020-0101\">10.1515/cmb-2020-0101</a>.","chicago":"Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Gaussian Curvature Derivative of a Space-Filling Diagram.” <i>Computational and Mathematical Biophysics</i>. De Gruyter, 2020. <a href=\"https://doi.org/10.1515/cmb-2020-0101\">https://doi.org/10.1515/cmb-2020-0101</a>."},"day":"21","oa_version":"Published Version","file":[{"relation":"main_file","creator":"dernst","file_size":707452,"file_name":"2020_CompMathBiophysics_Akopyan.pdf","date_updated":"2021-02-19T13:33:19Z","success":1,"content_type":"application/pdf","checksum":"ca43a7440834eab6bbea29c59b56ef3a","access_level":"open_access","date_created":"2021-02-19T13:33:19Z","file_id":"9170"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"arxiv":1,"volume":8,"article_processing_charge":"No","has_accepted_license":"1","_id":"9156","title":"The weighted Gaussian curvature derivative of a space-filling diagram","author":[{"full_name":"Akopyan, Arseniy","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","first_name":"Arseniy","orcid":"0000-0002-2548-617X"},{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"}],"doi":"10.1515/cmb-2020-0101","abstract":[{"lang":"eng","text":"The morphometric approach [11, 14] writes the solvation free energy as a linear combination of weighted versions of the volume, area, mean curvature, and Gaussian curvature of the space-filling diagram. We give a formula for the derivative of the weighted Gaussian curvature. Together with the derivatives of the weighted volume in [7], the weighted area in [4], and the weighted mean curvature in [1], this yields the derivative of the morphometric expression of solvation free energy."}],"issue":"1","project":[{"grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Alpha Shape Theory Extended"},{"call_identifier":"FWF","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"issn":["2544-7297"]},"ec_funded":1,"publication_status":"published","status":"public","acknowledgement":"The authors of this paper thank Roland Roth for suggesting the analysis of theweighted\r\ncurvature derivatives for the purpose of improving molecular dynamics simulations. They also thank Patrice Koehl for the implementation of the formulas and for his encouragement and advise along the road. Finally, they thank two anonymous reviewers for their constructive criticism.\r\nThis project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 78818 Alpha). It is also partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF)."},{"ec_funded":1,"publication_status":"published","status":"public","acknowledgement":"The authors of this paper thank Roland Roth for suggesting the analysis of the weighted\r\ncurvature derivatives for the purpose of improving molecular dynamics simulations and for his continued encouragement. They also thank Patrice Koehl for the implementation of the formulas and for his encouragement and advise along the road. Finally, they thank two anonymous reviewers for their constructive criticism.\r\nThis project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 78818 Alpha). It is also partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF).","project":[{"name":"Alpha Shape Theory Extended","call_identifier":"H2020","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"name":"Persistence and stability of geometric complexes","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35"}],"publication_identifier":{"issn":["2544-7297"]},"doi":"10.1515/cmb-2020-0100","abstract":[{"lang":"eng","text":"Representing an atom by a solid sphere in 3-dimensional Euclidean space, we get the space-filling diagram of a molecule by taking the union. Molecular dynamics simulates its motion subject to bonds and other forces, including the solvation free energy. The morphometric approach [12, 17] writes the latter as a linear combination of weighted versions of the volume, area, mean curvature, and Gaussian curvature of the space-filling diagram. We give a formula for the derivative of the weighted mean curvature. Together with the derivatives of the weighted volume in [7], the weighted area in [3], and the weighted Gaussian curvature [1], this yields the derivative of the morphometric expression of the solvation free energy."}],"issue":"1","_id":"9157","title":"The weighted mean curvature derivative of a space-filling diagram","author":[{"orcid":"0000-0002-2548-617X","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","last_name":"Akopyan","full_name":"Akopyan, Arseniy"},{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"}],"volume":8,"article_processing_charge":"No","has_accepted_license":"1","file":[{"file_id":"9171","date_created":"2021-02-19T13:56:24Z","success":1,"date_updated":"2021-02-19T13:56:24Z","access_level":"open_access","checksum":"cea41de9937d07a3b927d71ee8b4e432","content_type":"application/pdf","file_name":"2020_CompMathBiophysics_Akopyan2.pdf","file_size":562359,"creator":"dernst","relation":"main_file"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","ddc":["510"],"month":"06","file_date_updated":"2021-02-19T13:56:24Z","citation":{"ista":"Akopyan A, Edelsbrunner H. 2020. The weighted mean curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 8(1), 51–67.","ama":"Akopyan A, Edelsbrunner H. The weighted mean curvature derivative of a space-filling diagram. <i>Computational and Mathematical Biophysics</i>. 2020;8(1):51-67. doi:<a href=\"https://doi.org/10.1515/cmb-2020-0100\">10.1515/cmb-2020-0100</a>","short":"A. Akopyan, H. Edelsbrunner, Computational and Mathematical Biophysics 8 (2020) 51–67.","apa":"Akopyan, A., &#38; Edelsbrunner, H. (2020). The weighted mean curvature derivative of a space-filling diagram. <i>Computational and Mathematical Biophysics</i>. De Gruyter. <a href=\"https://doi.org/10.1515/cmb-2020-0100\">https://doi.org/10.1515/cmb-2020-0100</a>","ieee":"A. Akopyan and H. Edelsbrunner, “The weighted mean curvature derivative of a space-filling diagram,” <i>Computational and Mathematical Biophysics</i>, vol. 8, no. 1. De Gruyter, pp. 51–67, 2020.","chicago":"Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Mean Curvature Derivative of a Space-Filling Diagram.” <i>Computational and Mathematical Biophysics</i>. De Gruyter, 2020. <a href=\"https://doi.org/10.1515/cmb-2020-0100\">https://doi.org/10.1515/cmb-2020-0100</a>.","mla":"Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Mean Curvature Derivative of a Space-Filling Diagram.” <i>Computational and Mathematical Biophysics</i>, vol. 8, no. 1, De Gruyter, 2020, pp. 51–67, doi:<a href=\"https://doi.org/10.1515/cmb-2020-0100\">10.1515/cmb-2020-0100</a>."},"day":"20","page":"51-67","article_type":"original","date_updated":"2023-10-17T12:34:51Z","publication":"Computational and Mathematical Biophysics","year":"2020","oa":1,"language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","publisher":"De Gruyter","intvolume":"         8","date_created":"2021-02-17T15:13:01Z","date_published":"2020-06-20T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"HeEd"}]},{"isi":1,"language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","publisher":"Elsevier","intvolume":"         1","date_published":"2020-05-11T00:00:00Z","external_id":{"pmid":["33367243"],"isi":["000654052800010"]},"date_created":"2021-02-18T10:18:43Z","scopus_import":"1","department":[{"_id":"EvBe"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","related_material":{"record":[{"id":"10135","status":"public","relation":"dissertation_contains"}]},"article_number":"100048","article_type":"original","publication":"Plant Communications","date_updated":"2024-03-25T23:30:26Z","year":"2020","oa":1,"has_accepted_license":"1","volume":1,"article_processing_charge":"No","file":[{"file_id":"9161","date_created":"2021-02-18T10:23:59Z","success":1,"date_updated":"2021-02-18T10:23:59Z","access_level":"open_access","checksum":"785b266d82a94b007cf40dbbe7c4847e","content_type":"application/pdf","file_name":"2020_PlantComm_Semeradova.pdf","file_size":840289,"relation":"main_file","creator":"dernst"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"oa_version":"Published Version","citation":{"chicago":"Semerádová, Hana, Juan C Montesinos López, and Eva Benková. “All Roads Lead to Auxin: Post-Translational Regulation of Auxin Transport by Multiple Hormonal Pathways.” <i>Plant Communications</i>. Elsevier, 2020. <a href=\"https://doi.org/10.1016/j.xplc.2020.100048\">https://doi.org/10.1016/j.xplc.2020.100048</a>.","mla":"Semerádová, Hana, et al. “All Roads Lead to Auxin: Post-Translational Regulation of Auxin Transport by Multiple Hormonal Pathways.” <i>Plant Communications</i>, vol. 1, no. 3, 100048, Elsevier, 2020, doi:<a href=\"https://doi.org/10.1016/j.xplc.2020.100048\">10.1016/j.xplc.2020.100048</a>.","apa":"Semerádová, H., Montesinos López, J. C., &#38; Benková, E. (2020). All roads lead to auxin: Post-translational regulation of auxin transport by multiple hormonal pathways. <i>Plant Communications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.xplc.2020.100048\">https://doi.org/10.1016/j.xplc.2020.100048</a>","ieee":"H. Semerádová, J. C. Montesinos López, and E. Benková, “All roads lead to auxin: Post-translational regulation of auxin transport by multiple hormonal pathways,” <i>Plant Communications</i>, vol. 1, no. 3. Elsevier, 2020.","ista":"Semerádová H, Montesinos López JC, Benková E. 2020. All roads lead to auxin: Post-translational regulation of auxin transport by multiple hormonal pathways. Plant Communications. 1(3), 100048.","ama":"Semerádová H, Montesinos López JC, Benková E. All roads lead to auxin: Post-translational regulation of auxin transport by multiple hormonal pathways. <i>Plant Communications</i>. 2020;1(3). doi:<a href=\"https://doi.org/10.1016/j.xplc.2020.100048\">10.1016/j.xplc.2020.100048</a>","short":"H. Semerádová, J.C. Montesinos López, E. Benková, Plant Communications 1 (2020)."},"day":"11","pmid":1,"month":"05","ddc":["580"],"file_date_updated":"2021-02-18T10:23:59Z","status":"public","acknowledgement":"H.S. is the recipient of a DOC Fellowship of the Austrian Academy of Sciences at the Institute of Science and Technology, Austria. J.C.M. is the recipient of an EMBO Long-Term Fellowship (ALTF number 710-2016). We would like to thank Jiri Friml and Carina Baskett for critical reading of the manuscript and Shutang Tan and Maciek Adamowski for helpful discussions. No conflict of interest declared.","publication_status":"published","publication_identifier":{"issn":["2590-3462"]},"project":[{"grant_number":"24746","_id":"261821BC-B435-11E9-9278-68D0E5697425","name":"Molecular mechanisms of the cytokinin regulated endomembrane trafficking to coordinate plant organogenesis."},{"name":"Molecular mechanism of auxindriven formative divisions delineating lateral root organogenesis in plants","grant_number":"ALTF710-2016","_id":"253E54C8-B435-11E9-9278-68D0E5697425"}],"abstract":[{"text":"Auxin is a key hormonal regulator, that governs plant growth and development in concert with other hormonal pathways. The unique feature of auxin is its polar, cell-to-cell transport that leads to the formation of local auxin maxima and gradients, which coordinate initiation and patterning of plant organs. The molecular machinery mediating polar auxin transport is one of the important points of interaction with other hormones. Multiple hormonal pathways converge at the regulation of auxin transport and form a regulatory network that integrates various developmental and environmental inputs to steer plant development. In this review, we discuss recent advances in understanding the mechanisms that underlie regulation of polar auxin transport by multiple hormonal pathways. Specifically, we focus on the post-translational mechanisms that contribute to fine-tuning of the abundance and polarity of auxin transporters at the plasma membrane and thereby enable rapid modification of the auxin flow to coordinate plant growth and development.","lang":"eng"}],"issue":"3","doi":"10.1016/j.xplc.2020.100048","title":"All roads lead to auxin: Post-translational regulation of auxin transport by multiple hormonal pathways","author":[{"id":"42FE702E-F248-11E8-B48F-1D18A9856A87","first_name":"Hana","full_name":"Semeradova, Hana","last_name":"Semeradova"},{"orcid":"0000-0001-9179-6099","last_name":"Montesinos López","full_name":"Montesinos López, Juan C","first_name":"Juan C","id":"310A8E3E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","last_name":"Benková","full_name":"Benková, Eva","orcid":"0000-0002-8510-9739"}],"_id":"9160"},{"year":"2020","oa":1,"article_type":"review","article_number":"020501","date_updated":"2023-08-24T11:17:48Z","publication":"Quantum Science and Technology","scopus_import":"1","date_created":"2021-02-25T08:32:29Z","date_published":"2020-03-01T00:00:00Z","external_id":{"isi":["000521449500001"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"JoFi"}],"type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"isi":1,"intvolume":"         5","publisher":"IOP Publishing","doi":"10.1088/2058-9565/ab788a","issue":"2","abstract":[{"lang":"eng","text":"Quantum transduction, the process of converting quantum signals from one form of energy to another, is an important area of quantum science and technology. The present perspective article reviews quantum transduction between microwave and optical photons, an area that has recently seen a lot of activity and progress because of its relevance for connecting superconducting quantum processors over long distances, among other applications. Our review covers the leading approaches to achieving such transduction, with an emphasis on those based on atomic ensembles, opto-electro-mechanics, and electro-optics. We briefly discuss relevant metrics from the point of view of different applications, as well as challenges for the future."}],"_id":"9194","author":[{"last_name":"Lauk","full_name":"Lauk, Nikolai","first_name":"Nikolai"},{"last_name":"Sinclair","full_name":"Sinclair, Neil","first_name":"Neil"},{"first_name":"Shabir","id":"2D25E1F6-F248-11E8-B48F-1D18A9856A87","last_name":"Barzanjeh","full_name":"Barzanjeh, Shabir","orcid":"0000-0003-0415-1423"},{"full_name":"Covey, Jacob P","last_name":"Covey","first_name":"Jacob P"},{"first_name":"Mark","last_name":"Saffman","full_name":"Saffman, Mark"},{"first_name":"Maria","full_name":"Spiropulu, Maria","last_name":"Spiropulu"},{"full_name":"Simon, Christoph","last_name":"Simon","first_name":"Christoph"}],"title":"Perspectives on quantum transduction","ec_funded":1,"acknowledgement":"During the writing of this article we became aware of another review of quantum transduction with somewhat different emphasis [99].\r\nWe would like to thank the participants of the transduction workshop at Caltech in September 2018 for helpful and stimulating discussions. We particularly thank John Bartholomew, Andrei Faraon, Johannes Fink, Jeff Holzgrafe, Linbo Shao, Marko Lončar, Daniel Oblak, and Oskar Painter.\r\nN L and N S acknowledge support from the Alliance for Quantum Technologies' (AQT) Intelligent Quantum Networks and Technologies (INQNET) research program and by DOE/HEP QuantISED program grant, QCCFP (Quantum Communication Channels for Fundamental Physics), award number DE-SC0019219. NS further acknowledges support by the Natural Sciences and Engineering Research Council of Canada (NSERC). SB acknowledges support from the Marie Skłodowska Curie fellowship number 707 438 (MSC-IF SUPEREOM). JPC acknowledges support from the Caltech PMA prize postdoctoral fellowship. MS acknowledges support from the ARL-CDQI and the National Science Foundation. CS acknowledges NSERC, Quantum Alberta, and the Alberta Major Innovation Fund.","status":"public","publication_status":"published","project":[{"call_identifier":"H2020","name":"Microwave-to-Optical Quantum Link: Quantum Teleportation and Quantum Illumination with cavity Optomechanics SUPEREOM","grant_number":"707438","_id":"258047B6-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"issn":["2058-9565"]},"oa_version":"Published Version","file_date_updated":"2021-03-02T09:47:13Z","month":"03","ddc":["530"],"day":"01","citation":{"chicago":"Lauk, Nikolai, Neil Sinclair, Shabir Barzanjeh, Jacob P Covey, Mark Saffman, Maria Spiropulu, and Christoph Simon. “Perspectives on Quantum Transduction.” <i>Quantum Science and Technology</i>. IOP Publishing, 2020. <a href=\"https://doi.org/10.1088/2058-9565/ab788a\">https://doi.org/10.1088/2058-9565/ab788a</a>.","mla":"Lauk, Nikolai, et al. “Perspectives on Quantum Transduction.” <i>Quantum Science and Technology</i>, vol. 5, no. 2, 020501, IOP Publishing, 2020, doi:<a href=\"https://doi.org/10.1088/2058-9565/ab788a\">10.1088/2058-9565/ab788a</a>.","ieee":"N. Lauk <i>et al.</i>, “Perspectives on quantum transduction,” <i>Quantum Science and Technology</i>, vol. 5, no. 2. IOP Publishing, 2020.","apa":"Lauk, N., Sinclair, N., Barzanjeh, S., Covey, J. P., Saffman, M., Spiropulu, M., &#38; Simon, C. (2020). Perspectives on quantum transduction. <i>Quantum Science and Technology</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/2058-9565/ab788a\">https://doi.org/10.1088/2058-9565/ab788a</a>","ista":"Lauk N, Sinclair N, Barzanjeh S, Covey JP, Saffman M, Spiropulu M, Simon C. 2020. Perspectives on quantum transduction. Quantum Science and Technology. 5(2), 020501.","short":"N. Lauk, N. Sinclair, S. Barzanjeh, J.P. Covey, M. Saffman, M. Spiropulu, C. Simon, Quantum Science and Technology 5 (2020).","ama":"Lauk N, Sinclair N, Barzanjeh S, et al. Perspectives on quantum transduction. <i>Quantum Science and Technology</i>. 2020;5(2). doi:<a href=\"https://doi.org/10.1088/2058-9565/ab788a\">10.1088/2058-9565/ab788a</a>"},"volume":5,"article_processing_charge":"No","has_accepted_license":"1","file":[{"file_id":"9215","date_created":"2021-03-02T09:47:13Z","file_name":"2020_QuantumScience_Lauk.pdf","file_size":974399,"relation":"main_file","creator":"dernst","access_level":"open_access","content_type":"application/pdf","checksum":"a8562c42124a66b86836fe2489eb5f4f","success":1,"date_updated":"2021-03-02T09:47:13Z"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"month":"01","ddc":["530"],"file_date_updated":"2021-03-02T12:30:03Z","citation":{"apa":"Lambert, N. J., Rueda Sanchez, A. R., Sedlmeir, F., &#38; Schwefel, H. G. L. (2020). Coherent conversion between microwave and optical photons - An overview of physical implementations. <i>Advanced Quantum Technologies</i>. Wiley. <a href=\"https://doi.org/10.1002/qute.201900077\">https://doi.org/10.1002/qute.201900077</a>","ieee":"N. J. Lambert, A. R. Rueda Sanchez, F. Sedlmeir, and H. G. L. Schwefel, “Coherent conversion between microwave and optical photons - An overview of physical implementations,” <i>Advanced Quantum Technologies</i>, vol. 3, no. 1. Wiley, 2020.","ista":"Lambert NJ, Rueda Sanchez AR, Sedlmeir F, Schwefel HGL. 2020. Coherent conversion between microwave and optical photons - An overview of physical implementations. Advanced Quantum Technologies. 3(1), 1900077.","short":"N.J. Lambert, A.R. Rueda Sanchez, F. Sedlmeir, H.G.L. Schwefel, Advanced Quantum Technologies 3 (2020).","ama":"Lambert NJ, Rueda Sanchez AR, Sedlmeir F, Schwefel HGL. Coherent conversion between microwave and optical photons - An overview of physical implementations. <i>Advanced Quantum Technologies</i>. 2020;3(1). doi:<a href=\"https://doi.org/10.1002/qute.201900077\">10.1002/qute.201900077</a>","mla":"Lambert, Nicholas J., et al. “Coherent Conversion between Microwave and Optical Photons - An Overview of Physical Implementations.” <i>Advanced Quantum Technologies</i>, vol. 3, no. 1, 1900077, Wiley, 2020, doi:<a href=\"https://doi.org/10.1002/qute.201900077\">10.1002/qute.201900077</a>.","chicago":"Lambert, Nicholas J., Alfredo R Rueda Sanchez, Florian Sedlmeir, and Harald G. L. Schwefel. “Coherent Conversion between Microwave and Optical Photons - An Overview of Physical Implementations.” <i>Advanced Quantum Technologies</i>. Wiley, 2020. <a href=\"https://doi.org/10.1002/qute.201900077\">https://doi.org/10.1002/qute.201900077</a>."},"day":"01","oa_version":"Published Version","file":[{"success":1,"date_updated":"2021-03-02T12:30:03Z","access_level":"open_access","checksum":"157e95abd6883c3b35b0fa78ae10775e","content_type":"application/pdf","file_name":"2020_AdvQuantumTech_Lambert.pdf","creator":"dernst","relation":"main_file","file_size":2410114,"file_id":"9216","date_created":"2021-03-02T12:30:03Z"}],"tmp":{"short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"article_processing_charge":"No","volume":3,"has_accepted_license":"1","_id":"9195","title":"Coherent conversion between microwave and optical photons - An overview of physical implementations","author":[{"last_name":"Lambert","full_name":"Lambert, Nicholas J.","first_name":"Nicholas J."},{"orcid":"0000-0001-6249-5860","last_name":"Rueda Sanchez","full_name":"Rueda Sanchez, Alfredo R","first_name":"Alfredo R","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Florian","last_name":"Sedlmeir","full_name":"Sedlmeir, Florian"},{"last_name":"Schwefel","full_name":"Schwefel, Harald G. L.","first_name":"Harald G. L."}],"doi":"10.1002/qute.201900077","abstract":[{"text":"Quantum information technology based on solid state qubits has created much interest in converting quantum states from the microwave to the optical domain. Optical photons, unlike microwave photons, can be transmitted by fiber, making them suitable for long distance quantum communication. Moreover, the optical domain offers access to a large set of very well‐developed quantum optical tools, such as highly efficient single‐photon detectors and long‐lived quantum memories. For a high fidelity microwave to optical transducer, efficient conversion at single photon level and low added noise is needed. Currently, the most promising approaches to build such systems are based on second‐order nonlinear phenomena such as optomechanical and electro‐optic interactions. Alternative approaches, although not yet as efficient, include magneto‐optical coupling and schemes based on isolated quantum systems like atoms, ions, or quantum dots. Herein, the necessary theoretical foundations for the most important microwave‐to‐optical conversion experiments are provided, their implementations are described, and the current limitations and future prospects are discussed.","lang":"eng"}],"issue":"1","publication_identifier":{"issn":["2511-9044"]},"publication_status":"published","acknowledgement":"The authors thank Amita Deb for useful comments on this manuscript. The authors acknowledge support from the MBIE of New Zealand Endeavour Smart Ideas fund. The reference numbers in Figure 8 were corrected in April 2020, after online publication.","status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"JoFi"}],"date_created":"2021-02-25T08:52:36Z","external_id":{"isi":["000548088300001"]},"date_published":"2020-01-01T00:00:00Z","publisher":"Wiley","intvolume":"         3","language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","isi":1,"oa":1,"year":"2020","date_updated":"2023-08-24T13:53:02Z","publication":"Advanced Quantum Technologies","article_number":"1900077","article_type":"original","related_material":{"link":[{"url":"https://doi.org/10.1002/qute.202070011","description":"Cover Page","relation":"poster"}]}},{"status":"public","publication_status":"published","publication_identifier":{"issn":["0039-3223"],"eissn":["1730-6337"]},"issue":"3","abstract":[{"lang":"eng","text":"In order to provide a local description of a regular function in a small neighbourhood of a point x, it is sufficient by Taylor’s theorem to know the value of the function as well as all of its derivatives up to the required order at the point x itself. In other words, one could say that a regular function is locally modelled by the set of polynomials. The theory of regularity structures due to Hairer generalizes this observation and provides an abstract setup, which in the application to singular SPDE extends the set of polynomials by functionals constructed from, e.g., white noise. In this context, the notion of Taylor polynomials is lifted to the notion of so-called modelled distributions. The celebrated reconstruction theorem, which in turn was inspired by Gubinelli’s \\textit {sewing lemma}, is of paramount importance for the theory. It enables one to reconstruct a modelled distribution as a true distribution on Rd which is locally approximated by this extended set of models or “monomials”. In the original work of Hairer, the error is measured by means of Hölder norms. This was then generalized to the whole scale of Besov spaces by Hairer and Labbé. It is the aim of this work to adapt the analytic part of the theory of regularity structures to the scale of Triebel–Lizorkin spaces."}],"doi":"10.4064/sm180411-11-2","author":[{"last_name":"Hensel","full_name":"Hensel, Sebastian","first_name":"Sebastian","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7252-8072"},{"first_name":"Tommaso","last_name":"Rosati","full_name":"Rosati, Tommaso"}],"title":"Modelled distributions of Triebel–Lizorkin type","_id":"9196","volume":252,"article_processing_charge":"No","arxiv":1,"oa_version":"Preprint","day":"01","citation":{"mla":"Hensel, Sebastian, and Tommaso Rosati. “Modelled Distributions of Triebel–Lizorkin Type.” <i>Studia Mathematica</i>, vol. 252, no. 3, Instytut Matematyczny, 2020, pp. 251–97, doi:<a href=\"https://doi.org/10.4064/sm180411-11-2\">10.4064/sm180411-11-2</a>.","chicago":"Hensel, Sebastian, and Tommaso Rosati. “Modelled Distributions of Triebel–Lizorkin Type.” <i>Studia Mathematica</i>. Instytut Matematyczny, 2020. <a href=\"https://doi.org/10.4064/sm180411-11-2\">https://doi.org/10.4064/sm180411-11-2</a>.","ama":"Hensel S, Rosati T. Modelled distributions of Triebel–Lizorkin type. <i>Studia Mathematica</i>. 2020;252(3):251-297. doi:<a href=\"https://doi.org/10.4064/sm180411-11-2\">10.4064/sm180411-11-2</a>","ista":"Hensel S, Rosati T. 2020. Modelled distributions of Triebel–Lizorkin type. Studia Mathematica. 252(3), 251–297.","short":"S. Hensel, T. Rosati, Studia Mathematica 252 (2020) 251–297.","ieee":"S. Hensel and T. Rosati, “Modelled distributions of Triebel–Lizorkin type,” <i>Studia Mathematica</i>, vol. 252, no. 3. Instytut Matematyczny, pp. 251–297, 2020.","apa":"Hensel, S., &#38; Rosati, T. (2020). Modelled distributions of Triebel–Lizorkin type. <i>Studia Mathematica</i>. Instytut Matematyczny. <a href=\"https://doi.org/10.4064/sm180411-11-2\">https://doi.org/10.4064/sm180411-11-2</a>"},"month":"03","article_type":"original","page":"251-297","publication":"Studia Mathematica","date_updated":"2023-10-17T09:15:53Z","year":"2020","keyword":["General Mathematics"],"isi":1,"language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","intvolume":"       252","publisher":"Instytut Matematyczny","date_published":"2020-03-01T00:00:00Z","external_id":{"isi":["000558100500002"],"arxiv":["1709.05202"]},"scopus_import":"1","date_created":"2021-02-25T08:55:03Z","department":[{"_id":"JuFi"},{"_id":"GradSch"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publication_status":"published","status":"public","acknowledgement":"This research was supported by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M 2369-N33 (Meitner fellowship).","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"grant_number":"M02369","_id":"264B3912-B435-11E9-9278-68D0E5697425","name":"Formal Methods meets Algorithmic Game Theory","call_identifier":"FWF"}],"publication_identifier":{"issn":["2159-5399"],"isbn":["9781577358350"],"eissn":["2374-3468"]},"doi":"10.1609/aaai.v34i02.5546","issue":"02","abstract":[{"lang":"eng","text":"In this paper we introduce and study all-pay bidding games, a class of two player, zero-sum games on graphs. The game proceeds as follows. We place a token on some vertex in the graph and assign budgets to the two players. Each turn, each player submits a sealed legal bid (non-negative and below their remaining budget), which is deducted from their budget and the highest bidder moves the token onto an adjacent vertex. The game ends once a sink is reached, and Player 1 pays Player 2 the outcome that is associated with the sink. The players attempt to maximize their expected outcome. Our games model settings where effort (of no inherent value) needs to be invested in an ongoing and stateful manner. On the negative side, we show that even in simple games on DAGs, optimal strategies may require a distribution over bids with infinite support. A central quantity in bidding games is the ratio of the players budgets. On the positive side, we show a simple FPTAS for DAGs, that, for each budget ratio, outputs an approximation for the optimal strategy for that ratio. We also implement it, show that it performs well, and suggests interesting properties of these games. Then, given an outcome c, we show an algorithm for finding the necessary and sufficient initial ratio for guaranteeing outcome c with probability 1 and a strategy ensuring such. Finally, while the general case has not previously been studied, solving the specific game in which Player 1 wins iff he wins the first two auctions, has been long stated as an open question, which we solve."}],"_id":"9197","author":[{"orcid":"0000-0001-5588-8287","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","full_name":"Avni, Guy"},{"orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","full_name":"Tkadlec, Josef","last_name":"Tkadlec"}],"title":"All-pay bidding games on graphs","article_processing_charge":"No","volume":34,"arxiv":1,"conference":{"start_date":"2020-02-07","location":"New York, NY, United States","end_date":"2020-02-12","name":"AAAI: Conference on Artificial Intelligence"},"oa_version":"Preprint","month":"04","day":"03","citation":{"chicago":"Avni, Guy, Rasmus Ibsen-Jensen, and Josef Tkadlec. “All-Pay Bidding Games on Graphs.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Association for the Advancement of Artificial Intelligence, 2020. <a href=\"https://doi.org/10.1609/aaai.v34i02.5546\">https://doi.org/10.1609/aaai.v34i02.5546</a>.","mla":"Avni, Guy, et al. “All-Pay Bidding Games on Graphs.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 34, no. 02, Association for the Advancement of Artificial Intelligence, 2020, pp. 1798–805, doi:<a href=\"https://doi.org/10.1609/aaai.v34i02.5546\">10.1609/aaai.v34i02.5546</a>.","short":"G. Avni, R. Ibsen-Jensen, J. Tkadlec, Proceedings of the AAAI Conference on Artificial Intelligence 34 (2020) 1798–1805.","ista":"Avni G, Ibsen-Jensen R, Tkadlec J. 2020. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 34(02), 1798–1805.","ama":"Avni G, Ibsen-Jensen R, Tkadlec J. All-pay bidding games on graphs. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. 2020;34(02):1798-1805. doi:<a href=\"https://doi.org/10.1609/aaai.v34i02.5546\">10.1609/aaai.v34i02.5546</a>","apa":"Avni, G., Ibsen-Jensen, R., &#38; Tkadlec, J. (2020). All-pay bidding games on graphs. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. New York, NY, United States: Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v34i02.5546\">https://doi.org/10.1609/aaai.v34i02.5546</a>","ieee":"G. Avni, R. Ibsen-Jensen, and J. Tkadlec, “All-pay bidding games on graphs,” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 34, no. 02. Association for the Advancement of Artificial Intelligence, pp. 1798–1805, 2020."},"article_type":"original","page":"1798-1805","date_updated":"2023-09-05T12:40:00Z","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","year":"2020","quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"intvolume":"        34","publisher":"Association for the Advancement of Artificial Intelligence","scopus_import":"1","date_created":"2021-02-25T09:05:18Z","date_published":"2020-04-03T00:00:00Z","external_id":{"arxiv":["1911.08360"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"ToHe"},{"_id":"KrCh"}]}]