[{"abstract":[{"lang":"eng","text":"The aim of this short note is to expound one particular issue that was discussed during the talk [10] given at the symposium ”Researches on isometries as preserver problems and related topics” at Kyoto RIMS. That is, the role of Dirac masses by describing the isometry group of various metric spaces of probability measures. This article is of survey character, and it does not contain any essentially new results.From an isometric point of view, in some cases, metric spaces of measures are similar to C(K)-type function spaces. Similarity means here that their isometries are driven by some nice transformations of the underlying space. Of course, it depends on the particular choice of the metric how nice these transformations should be. Sometimes, as we will see, being a homeomorphism is enough to generate an isometry. But sometimes we need more: the transformation must preserve the underlying distance as well. Statements claiming that isometries in questions are necessarily induced by homeomorphisms are called Banach-Stone-type results, while results asserting that the underlying transformation is necessarily an isometry are termed as isometric rigidity results.As Dirac masses can be considered as building bricks of the set of all Borel measures, a natural question arises:Is it enough to understand how an isometry acts on the set of Dirac masses? Does this action extend uniquely to all measures?In what follows, we will thoroughly investigate this question."}],"oa_version":"Submitted Version","oa":1,"main_file_link":[{"url":"http://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/contents/2125.html","open_access":"1"}],"publisher":"Research Institute for Mathematical Sciences, Kyoto University","quality_controlled":"1","intvolume":" 2125","month":"01","publication_status":"published","year":"2019","language":[{"iso":"eng"}],"publication":"Kyoto RIMS Kôkyûroku","day":"30","page":"34-41","date_created":"2019-11-18T15:39:53Z","date_published":"2019-01-30T00:00:00Z","volume":2125,"_id":"7035","conference":{"location":"Kyoto, Japan","end_date":"2019-01-30","start_date":"2019-01-28","name":"Research on isometries as preserver problems and related topics"},"type":"conference","status":"public","citation":{"ista":"Geher GP, Titkos T, Virosztek D. 2019. Dirac masses and isometric rigidity. Kyoto RIMS Kôkyûroku. Research on isometries as preserver problems and related topics vol. 2125, 34–41.","chicago":"Geher, Gyorgy Pal, Tamas Titkos, and Daniel Virosztek. “Dirac Masses and Isometric Rigidity.” In Kyoto RIMS Kôkyûroku, 2125:34–41. Research Institute for Mathematical Sciences, Kyoto University, 2019.","short":"G.P. Geher, T. Titkos, D. Virosztek, in:, Kyoto RIMS Kôkyûroku, Research Institute for Mathematical Sciences, Kyoto University, 2019, pp. 34–41.","ieee":"G. P. Geher, T. Titkos, and D. Virosztek, “Dirac masses and isometric rigidity,” in Kyoto RIMS Kôkyûroku, Kyoto, Japan, 2019, vol. 2125, pp. 34–41.","apa":"Geher, G. P., Titkos, T., & Virosztek, D. (2019). Dirac masses and isometric rigidity. In Kyoto RIMS Kôkyûroku (Vol. 2125, pp. 34–41). Kyoto, Japan: Research Institute for Mathematical Sciences, Kyoto University.","ama":"Geher GP, Titkos T, Virosztek D. Dirac masses and isometric rigidity. In: Kyoto RIMS Kôkyûroku. Vol 2125. Research Institute for Mathematical Sciences, Kyoto University; 2019:34-41.","mla":"Geher, Gyorgy Pal, et al. “Dirac Masses and Isometric Rigidity.” Kyoto RIMS Kôkyûroku, vol. 2125, Research Institute for Mathematical Sciences, Kyoto University, 2019, pp. 34–41."},"date_updated":"2021-01-12T08:11:33Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"first_name":"Gyorgy Pal","full_name":"Geher, Gyorgy Pal","last_name":"Geher"},{"first_name":"Tamas","last_name":"Titkos","full_name":"Titkos, Tamas"},{"last_name":"Virosztek","full_name":"Virosztek, Daniel","orcid":"0000-0003-1109-5511","id":"48DB45DA-F248-11E8-B48F-1D18A9856A87","first_name":"Daniel"}],"title":"Dirac masses and isometric rigidity","department":[{"_id":"LaEr"}]},{"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"mla":"Kersting, Kristian, et al., editors. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt. 1st ed., Springer Nature, 2019, doi:10.1007/978-3-658-26763-6.","ama":"Kersting K, Lampert C, Rothkopf C, eds. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt. 1st ed. Wiesbaden: Springer Nature; 2019. doi:10.1007/978-3-658-26763-6","apa":"Kersting, K., Lampert, C., & Rothkopf, C. (Eds.). (2019). Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt (1st ed.). Wiesbaden: Springer Nature. https://doi.org/10.1007/978-3-658-26763-6","ieee":"K. Kersting, C. Lampert, and C. Rothkopf, Eds., Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt, 1st ed. Wiesbaden: Springer Nature, 2019.","short":"K. Kersting, C. Lampert, C. Rothkopf, eds., Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt, 1st ed., Springer Nature, Wiesbaden, 2019.","chicago":"Kersting, Kristian, Christoph Lampert, and Constantin Rothkopf, eds. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt. 1st ed. Wiesbaden: Springer Nature, 2019. https://doi.org/10.1007/978-3-658-26763-6.","ista":"Kersting K, Lampert C, Rothkopf C eds. 2019. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt 1st ed., Wiesbaden: Springer Nature, XIV, 245p."},"date_updated":"2021-12-22T14:40:58Z","department":[{"_id":"ChLa"}],"title":"Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt","editor":[{"first_name":"Kristian","full_name":"Kersting, Kristian","last_name":"Kersting"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert"},{"first_name":"Constantin","full_name":"Rothkopf, Constantin","last_name":"Rothkopf"}],"article_processing_charge":"No","_id":"7171","status":"public","type":"book_editor","language":[{"iso":"ger"}],"day":"30","year":"2019","publication_status":"published","publication_identifier":{"isbn":["978-3-658-26762-9"],"eisbn":["978-3-658-26763-6"]},"date_created":"2019-12-11T14:15:56Z","related_material":{"link":[{"description":"News on IST Website","relation":"press_release","url":"https://ist.ac.at/en/news/book-release-how-machines-learn/"}]},"doi":"10.1007/978-3-658-26763-6","date_published":"2019-10-30T00:00:00Z","page":"XIV, 245","oa_version":"None","abstract":[{"lang":"ger","text":"Wissen Sie, was sich hinter künstlicher Intelligenz und maschinellem Lernen verbirgt? \r\nDieses Sachbuch erklärt Ihnen leicht verständlich und ohne komplizierte Formeln die grundlegenden Methoden und Vorgehensweisen des maschinellen Lernens. Mathematisches Vorwissen ist dafür nicht nötig. Kurzweilig und informativ illustriert Lisa, die Protagonistin des Buches, diese anhand von Alltagssituationen. \r\nEin Buch für alle, die in Diskussionen über Chancen und Risiken der aktuellen Entwicklung der künstlichen Intelligenz und des maschinellen Lernens mit Faktenwissen punkten möchten. Auch für Schülerinnen und Schüler geeignet!"}],"month":"10","place":"Wiesbaden","edition":"1","quality_controlled":"1","publisher":"Springer Nature"},{"project":[{"call_identifier":"FWF","_id":"261FA626-B435-11E9-9278-68D0E5697425","name":"Eliminating intersections in drawings of graphs","grant_number":"M02281"}],"article_number":"39","author":[{"orcid":"0000-0001-8485-1774","full_name":"Fulek, Radoslav","last_name":"Fulek","first_name":"Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kyncl","full_name":"Kyncl, Jan","first_name":"Jan"}],"article_processing_charge":"No","external_id":{"arxiv":["1903.08637"]},"title":"Z_2-Genus of graphs and minimum rank of partial symmetric matrices","citation":{"chicago":"Fulek, Radoslav, and Jan Kyncl. “Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices.” In 35th International Symposium on Computational Geometry (SoCG 2019), Vol. 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.SOCG.2019.39.","ista":"Fulek R, Kyncl J. 2019. Z_2-Genus of graphs and minimum rank of partial symmetric matrices. 35th International Symposium on Computational Geometry (SoCG 2019). SoCG: Symposium on Computational Geometry, LIPIcs, vol. 129, 39.","mla":"Fulek, Radoslav, and Jan Kyncl. “Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices.” 35th International Symposium on Computational Geometry (SoCG 2019), vol. 129, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.SOCG.2019.39.","ama":"Fulek R, Kyncl J. Z_2-Genus of graphs and minimum rank of partial symmetric matrices. In: 35th International Symposium on Computational Geometry (SoCG 2019). Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.SOCG.2019.39","apa":"Fulek, R., & Kyncl, J. (2019). Z_2-Genus of graphs and minimum rank of partial symmetric matrices. In 35th International Symposium on Computational Geometry (SoCG 2019) (Vol. 129). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SOCG.2019.39","ieee":"R. Fulek and J. Kyncl, “Z_2-Genus of graphs and minimum rank of partial symmetric matrices,” in 35th International Symposium on Computational Geometry (SoCG 2019), Portland, OR, United States, 2019, vol. 129.","short":"R. Fulek, J. Kyncl, in:, 35th International Symposium on Computational Geometry (SoCG 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"date_published":"2019-06-01T00:00:00Z","doi":"10.4230/LIPICS.SOCG.2019.39","date_created":"2020-01-29T16:17:05Z","has_accepted_license":"1","year":"2019","day":"01","publication":"35th International Symposium on Computational Geometry (SoCG 2019)","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"SoCG: Symposium on Computational Geometry","location":"Portland, OR, United States","end_date":"2019-06-21","start_date":"2019-06-18"},"status":"public","_id":"7401","file_date_updated":"2020-07-14T12:47:57Z","department":[{"_id":"UlWa"}],"date_updated":"2021-01-12T08:13:24Z","ddc":["000"],"scopus_import":1,"alternative_title":["LIPIcs"],"month":"06","intvolume":" 129","abstract":[{"text":"The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface M_g of genus g. A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the drawing crosses an even number of times. The Z_2-genus of a graph G, denoted by g_0(G), is the minimum g such that G has an independently even drawing on M_g. By a result of Battle, Harary, Kodama and Youngs from 1962, the graph genus is additive over 2-connected blocks. In 2013, Schaefer and Stefankovic proved that the Z_2-genus of a graph is additive over 2-connected blocks as well, and asked whether this result can be extended to so-called 2-amalgamations, as an analogue of results by Decker, Glover, Huneke, and Stahl for the genus. We give the following partial answer. If G=G_1 cup G_2, G_1 and G_2 intersect in two vertices u and v, and G-u-v has k connected components (among which we count the edge uv if present), then |g_0(G)-(g_0(G_1)+g_0(G_2))|<=k+1. For complete bipartite graphs K_{m,n}, with n >= m >= 3, we prove that g_0(K_{m,n})/g(K_{m,n})=1-O(1/n). Similar results are proved also for the Euler Z_2-genus. We express the Z_2-genus of a graph using the minimum rank of partial symmetric matrices over Z_2; a problem that might be of independent interest. ","lang":"eng"}],"oa_version":"Published Version","volume":129,"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-104-7"]},"publication_status":"published","file":[{"creator":"dernst","date_updated":"2020-07-14T12:47:57Z","file_size":628347,"date_created":"2020-02-04T09:14:31Z","file_name":"2019_LIPIcs_Fulek.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"aac37b09118cc0ab58cf77129e691f8c","file_id":"7445"}],"language":[{"iso":"eng"}]},{"project":[{"grant_number":"S11402-N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"title":"Continuous-time models for system design and analysis","editor":[{"full_name":"Steffen, Bernhard","last_name":"Steffen","first_name":"Bernhard"},{"last_name":"Woeginger","full_name":"Woeginger, Gerhard","first_name":"Gerhard"}],"article_processing_charge":"No","author":[{"full_name":"Alur, Rajeev","last_name":"Alur","first_name":"Rajeev"},{"last_name":"Giacobbe","full_name":"Giacobbe, Mirco","orcid":"0000-0001-8180-0904","first_name":"Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"full_name":"Larsen, Kim G.","last_name":"Larsen","first_name":"Kim G."},{"last_name":"Mikučionis","full_name":"Mikučionis, Marius","first_name":"Marius"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Alur, Rajeev, et al. “Continuous-Time Models for System Design and Analysis.” Computing and Software Science, edited by Bernhard Steffen and Gerhard Woeginger, vol. 10000, Springer Nature, 2019, pp. 452–77, doi:10.1007/978-3-319-91908-9_22.","ieee":"R. Alur, M. Giacobbe, T. A. Henzinger, K. G. Larsen, and M. Mikučionis, “Continuous-time models for system design and analysis,” in Computing and Software Science, vol. 10000, B. Steffen and G. Woeginger, Eds. Springer Nature, 2019, pp. 452–477.","short":"R. Alur, M. Giacobbe, T.A. Henzinger, K.G. Larsen, M. Mikučionis, in:, B. Steffen, G. Woeginger (Eds.), Computing and Software Science, Springer Nature, 2019, pp. 452–477.","apa":"Alur, R., Giacobbe, M., Henzinger, T. A., Larsen, K. G., & Mikučionis, M. (2019). Continuous-time models for system design and analysis. In B. Steffen & G. Woeginger (Eds.), Computing and Software Science (Vol. 10000, pp. 452–477). Springer Nature. https://doi.org/10.1007/978-3-319-91908-9_22","ama":"Alur R, Giacobbe M, Henzinger TA, Larsen KG, Mikučionis M. Continuous-time models for system design and analysis. In: Steffen B, Woeginger G, eds. Computing and Software Science. Vol 10000. LNCS. Springer Nature; 2019:452-477. doi:10.1007/978-3-319-91908-9_22","chicago":"Alur, Rajeev, Mirco Giacobbe, Thomas A Henzinger, Kim G. Larsen, and Marius Mikučionis. “Continuous-Time Models for System Design and Analysis.” In Computing and Software Science, edited by Bernhard Steffen and Gerhard Woeginger, 10000:452–77. LNCS. Springer Nature, 2019. https://doi.org/10.1007/978-3-319-91908-9_22.","ista":"Alur R, Giacobbe M, Henzinger TA, Larsen KG, Mikučionis M. 2019.Continuous-time models for system design and analysis. In: Computing and Software Science. Lecture Notes in Computer Science, vol. 10000, 452–477."},"oa":1,"publisher":"Springer Nature","quality_controlled":"1","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23(RiSE/SHiNE) and Z211-N23 (Wittgenstein Award). This research has received funding from the Sino-Danish Basic Research Centre, IDEA4CPS, funded by the Danish National Research Foundation and the National Science Foundation, China, the Innovation Fund Denmark centre DiCyPS, as well as the ERC Advanced Grant LASSO.","date_created":"2020-02-05T10:51:44Z","doi":"10.1007/978-3-319-91908-9_22","date_published":"2019-10-05T00:00:00Z","page":"452-477","publication":"Computing and Software Science","day":"05","year":"2019","status":"public","type":"book_chapter","_id":"7453","series_title":"LNCS","department":[{"_id":"ToHe"}],"date_updated":"2022-09-06T08:25:52Z","intvolume":" 10000","month":"10","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/978-3-319-91908-9_22"}],"scopus_import":"1","alternative_title":["Lecture Notes in Computer Science"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We illustrate the ingredients of the state-of-the-art of model-based approach for the formal design and verification of cyber-physical systems. To capture the interaction between a discrete controller and its continuously evolving environment, we use the formal models of timed and hybrid automata. We explain the steps of modeling and verification in the tools Uppaal and SpaceEx using a case study based on a dual-chamber implantable pacemaker monitoring a human heart. We show how to design a model as a composition of components, how to construct models at varying levels of detail, how to establish that one model is an abstraction of another, how to specify correctness requirements using temporal logic, and how to verify that a model satisfies a logical requirement."}],"volume":10000,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eisbn":["9783319919089"],"isbn":["9783319919072"],"eissn":["0302-9743"],"issn":["1611-3349"]}},{"abstract":[{"lang":"eng","text":"We consider an optimal control problem for an abstract nonlinear dissipative evolution equation. The differential constraint is penalized by augmenting the target functional by a nonnegative global-in-time functional which is null-minimized in the evolution equation is satisfied. Different variational settings are presented, leading to the convergence of the penalization method for gradient flows, noncyclic and semimonotone flows, doubly nonlinear evolutions, and GENERIC systems. "}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.1910.10050"}],"intvolume":" 28","month":"10","publication_status":"published","publication_identifier":{"issn":["1343-4373"]},"language":[{"iso":"eng"}],"issue":"2","volume":28,"_id":"7550","article_type":"original","type":"journal_article","status":"public","date_updated":"2022-06-17T07:52:41Z","department":[{"_id":"JaMa"}],"acknowledgement":"This work is supported by Vienna Science and Technology Fund (WWTF) through Project MA14-009 and by the Austrian Science Fund (FWF) projects F 65 and I 2375.","oa":1,"quality_controlled":"1","publisher":"Gakko Tosho","year":"2019","publication":"Advances in Mathematical Sciences and Applications","day":"22","page":"425-447","date_created":"2020-02-28T10:54:41Z","date_published":"2019-10-22T00:00:00Z","project":[{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems"}],"citation":{"apa":"Portinale, L., & Stefanelli, U. (2019). Penalization via global functionals of optimal-control problems for dissipative evolution. Advances in Mathematical Sciences and Applications. Gakko Tosho.","ama":"Portinale L, Stefanelli U. Penalization via global functionals of optimal-control problems for dissipative evolution. Advances in Mathematical Sciences and Applications. 2019;28(2):425-447.","short":"L. Portinale, U. Stefanelli, Advances in Mathematical Sciences and Applications 28 (2019) 425–447.","ieee":"L. Portinale and U. Stefanelli, “Penalization via global functionals of optimal-control problems for dissipative evolution,” Advances in Mathematical Sciences and Applications, vol. 28, no. 2. Gakko Tosho, pp. 425–447, 2019.","mla":"Portinale, Lorenzo, and Ulisse Stefanelli. “Penalization via Global Functionals of Optimal-Control Problems for Dissipative Evolution.” Advances in Mathematical Sciences and Applications, vol. 28, no. 2, Gakko Tosho, 2019, pp. 425–47.","ista":"Portinale L, Stefanelli U. 2019. Penalization via global functionals of optimal-control problems for dissipative evolution. Advances in Mathematical Sciences and Applications. 28(2), 425–447.","chicago":"Portinale, Lorenzo, and Ulisse Stefanelli. “Penalization via Global Functionals of Optimal-Control Problems for Dissipative Evolution.” Advances in Mathematical Sciences and Applications. Gakko Tosho, 2019."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1910.10050"]},"article_processing_charge":"No","author":[{"first_name":"Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","full_name":"Portinale, Lorenzo","last_name":"Portinale"},{"first_name":"Ulisse","last_name":"Stefanelli","full_name":"Stefanelli, Ulisse"}],"title":"Penalization via global functionals of optimal-control problems for dissipative evolution"},{"language":[{"iso":"eng"}],"publication":"arXiv:1912.08579","day":"18","publication_status":"submitted","year":"2019","date_created":"2020-02-28T10:57:08Z","date_published":"2019-12-18T00:00:00Z","page":"5","oa_version":"Preprint","abstract":[{"text":"There is increasing evidence that protein binding to specific sites along DNA can activate the reading out of genetic information without coming into direct physical contact with the gene. There also is evidence that these distant but interacting sites are embedded in a liquid droplet of proteins which condenses out of the surrounding solution. We argue that droplet-mediated interactions can account for crucial features of gene regulation only if the droplet is poised at a non-generic point in its phase diagram. We explore a minimal model that embodies this idea, show that this model has a natural mechanism for self-tuning, and suggest direct experimental tests. ","lang":"eng"}],"month":"12","main_file_link":[{"url":"https://arxiv.org/abs/1912.08579","open_access":"1"}],"oa":1,"publisher":"ArXiv","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"W. Bialek, T. Gregor, and G. Tkačik, “Action at a distance in transcriptional regulation,” arXiv:1912.08579. ArXiv.","short":"W. Bialek, T. Gregor, G. Tkačik, ArXiv:1912.08579 (n.d.).","ama":"Bialek W, Gregor T, Tkačik G. Action at a distance in transcriptional regulation. arXiv:191208579.","apa":"Bialek, W., Gregor, T., & Tkačik, G. (n.d.). Action at a distance in transcriptional regulation. arXiv:1912.08579. ArXiv.","mla":"Bialek, William, et al. “Action at a Distance in Transcriptional Regulation.” ArXiv:1912.08579, ArXiv.","ista":"Bialek W, Gregor T, Tkačik G. Action at a distance in transcriptional regulation. arXiv:1912.08579, .","chicago":"Bialek, William, Thomas Gregor, and Gašper Tkačik. “Action at a Distance in Transcriptional Regulation.” ArXiv:1912.08579. ArXiv, n.d."},"date_updated":"2021-01-12T08:14:09Z","department":[{"_id":"GaTk"}],"title":"Action at a distance in transcriptional regulation","external_id":{"arxiv":["1912.08579"]},"article_processing_charge":"No","author":[{"last_name":"Bialek","full_name":"Bialek, William","first_name":"William"},{"full_name":"Gregor, Thomas","last_name":"Gregor","first_name":"Thomas"},{"orcid":"0000-0002-6699-1455","full_name":"Tkačik, Gašper","last_name":"Tkačik","first_name":"Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"}],"_id":"7552","project":[{"_id":"254E9036-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Biophysics of information processing in gene regulation","grant_number":"P28844-B27"}],"status":"public","type":"preprint"},{"scopus_import":1,"month":"05","intvolume":" 61","abstract":[{"text":"We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In this year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. They are applied to solve reachability analysis problems on four benchmark problems, one of them with hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools.","lang":"eng"}],"oa_version":"Published Version","volume":61,"publication_identifier":{"eissn":["23987340"]},"publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"9138977a06fcd6a95976eb4bca875f0c","file_id":"7617","creator":"dernst","file_size":1934830,"date_updated":"2020-07-14T12:48:00Z","file_name":"2019_ARCH19_Immler.pdf","date_created":"2020-03-24T07:36:36Z"}],"language":[{"iso":"eng"}],"type":"conference","conference":{"name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","start_date":"2019-04-15","end_date":"2019-04-15","location":"Montreal, Canada"},"status":"public","_id":"7576","file_date_updated":"2020-07-14T12:48:00Z","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T08:14:17Z","ddc":["000"],"quality_controlled":"1","publisher":"EasyChair Publications","oa":1,"page":"41-61","date_published":"2019-05-25T00:00:00Z","doi":"10.29007/m75b","date_created":"2020-03-08T23:00:49Z","has_accepted_license":"1","year":"2019","day":"25","publication":"EPiC Series in Computing","author":[{"full_name":"Immler, Fabian","last_name":"Immler","first_name":"Fabian"},{"full_name":"Althoff, Matthias","last_name":"Althoff","first_name":"Matthias"},{"first_name":"Luis","last_name":"Benet","full_name":"Benet, Luis"},{"full_name":"Chapoutot, Alexandre","last_name":"Chapoutot","first_name":"Alexandre"},{"first_name":"Xin","last_name":"Chen","full_name":"Chen, Xin"},{"first_name":"Marcelo","last_name":"Forets","full_name":"Forets, Marcelo"},{"first_name":"Luca","full_name":"Geretti, Luca","last_name":"Geretti"},{"full_name":"Kochdumper, Niklas","last_name":"Kochdumper","first_name":"Niklas"},{"last_name":"Sanders","full_name":"Sanders, David P.","first_name":"David P."},{"full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065","last_name":"Schilling","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","first_name":"Christian"}],"article_processing_charge":"No","title":"ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics","citation":{"ista":"Immler F, Althoff M, Benet L, Chapoutot A, Chen X, Forets M, Geretti L, Kochdumper N, Sanders DP, Schilling C. 2019. ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 61, 41–61.","chicago":"Immler, Fabian, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin Chen, Marcelo Forets, Luca Geretti, Niklas Kochdumper, David P. Sanders, and Christian Schilling. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” In EPiC Series in Computing, 61:41–61. EasyChair Publications, 2019. https://doi.org/10.29007/m75b.","ieee":"F. Immler et al., “ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics,” in EPiC Series in Computing, Montreal, Canada, 2019, vol. 61, pp. 41–61.","short":"F. Immler, M. Althoff, L. Benet, A. Chapoutot, X. Chen, M. Forets, L. Geretti, N. Kochdumper, D.P. Sanders, C. Schilling, in:, EPiC Series in Computing, EasyChair Publications, 2019, pp. 41–61.","apa":"Immler, F., Althoff, M., Benet, L., Chapoutot, A., Chen, X., Forets, M., … Schilling, C. (2019). ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. In EPiC Series in Computing (Vol. 61, pp. 41–61). Montreal, Canada: EasyChair Publications. https://doi.org/10.29007/m75b","ama":"Immler F, Althoff M, Benet L, et al. ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. In: EPiC Series in Computing. Vol 61. EasyChair Publications; 2019:41-61. doi:10.29007/m75b","mla":"Immler, Fabian, et al. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” EPiC Series in Computing, vol. 61, EasyChair Publications, 2019, pp. 41–61, doi:10.29007/m75b."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publication":"Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics","day":"01","year":"2019","date_created":"2020-07-26T22:01:04Z","date_published":"2019-07-01T00:00:00Z","acknowledgement":"D.B. is especially grateful to Patrik Ferrari for suggesting simplifications in Section 3 and\r\nto Alessandra Occelli for suggesting the name for the models of Section 2.\r\n","oa":1,"quality_controlled":"1","publisher":"Formal Power Series and Algebraic Combinatorics","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Betea, D., Bouttier, J., Nejjar, P., & Vuletíc, M. (2019). New edge asymptotics of skew Young diagrams via free boundaries. In Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics. Ljubljana, Slovenia: Formal Power Series and Algebraic Combinatorics.","ama":"Betea D, Bouttier J, Nejjar P, Vuletíc M. New edge asymptotics of skew Young diagrams via free boundaries. In: Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics. Formal Power Series and Algebraic Combinatorics; 2019.","short":"D. Betea, J. Bouttier, P. Nejjar, M. Vuletíc, in:, Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics, Formal Power Series and Algebraic Combinatorics, 2019.","ieee":"D. Betea, J. Bouttier, P. Nejjar, and M. Vuletíc, “New edge asymptotics of skew Young diagrams via free boundaries,” in Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics, Ljubljana, Slovenia, 2019.","mla":"Betea, Dan, et al. “New Edge Asymptotics of Skew Young Diagrams via Free Boundaries.” Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics, 34, Formal Power Series and Algebraic Combinatorics, 2019.","ista":"Betea D, Bouttier J, Nejjar P, Vuletíc M. 2019. New edge asymptotics of skew Young diagrams via free boundaries. Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics. FPSAC: International Conference on Formal Power Series and Algebraic Combinatorics, 34.","chicago":"Betea, Dan, Jérémie Bouttier, Peter Nejjar, and Mirjana Vuletíc. “New Edge Asymptotics of Skew Young Diagrams via Free Boundaries.” In Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics. Formal Power Series and Algebraic Combinatorics, 2019."},"title":"New edge asymptotics of skew Young diagrams via free boundaries","external_id":{"arxiv":["1902.08750"]},"article_processing_charge":"No","author":[{"first_name":"Dan","last_name":"Betea","full_name":"Betea, Dan"},{"first_name":"Jérémie","last_name":"Bouttier","full_name":"Bouttier, Jérémie"},{"full_name":"Nejjar, Peter","last_name":"Nejjar","id":"4BF426E2-F248-11E8-B48F-1D18A9856A87","first_name":"Peter"},{"first_name":"Mirjana","last_name":"Vuletíc","full_name":"Vuletíc, Mirjana"}],"article_number":"34","project":[{"call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems"},{"_id":"256E75B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics","grant_number":"716117"}],"language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We study edge asymptotics of poissonized Plancherel-type measures on skew Young diagrams (integer partitions). These measures can be seen as generalizations of those studied by Baik--Deift--Johansson and Baik--Rains in resolving Ulam's problem on longest increasing subsequences of random permutations and the last passage percolation (corner growth) discrete versions thereof. Moreover they interpolate between said measures and the uniform measure on partitions. In the new KPZ-like 1/3 exponent edge scaling limit with logarithmic corrections, we find new probability distributions generalizing the classical Tracy--Widom GUE, GOE and GSE distributions from the theory of random matrices."}],"month":"07","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1902.08750"}],"scopus_import":"1","date_updated":"2021-01-12T08:17:18Z","department":[{"_id":"LaEr"}],"_id":"8175","status":"public","conference":{"name":"FPSAC: International Conference on Formal Power Series and Algebraic Combinatorics","location":"Ljubljana, Slovenia","end_date":"2019-07-05","start_date":"2019-07-01"},"type":"conference"},{"type":"conference","conference":{"location":"Montreal, Canada","end_date":"2019-04-15","start_date":"2019-04-15","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems"},"status":"public","_id":"8570","author":[{"first_name":"Matthias","last_name":"Althoff","full_name":"Althoff, Matthias"},{"first_name":"Stanley","full_name":"Bak, Stanley","last_name":"Bak"},{"first_name":"Marcelo","full_name":"Forets, Marcelo","last_name":"Forets"},{"first_name":"Goran","full_name":"Frehse, Goran","last_name":"Frehse"},{"first_name":"Niklas","full_name":"Kochdumper, Niklas","last_name":"Kochdumper"},{"first_name":"Rajarshi","last_name":"Ray","full_name":"Ray, Rajarshi"},{"first_name":"Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3658-1065","full_name":"Schilling, Christian","last_name":"Schilling"},{"first_name":"Stefan","full_name":"Schupp, Stefan","last_name":"Schupp"}],"article_processing_charge":"No","department":[{"_id":"ToHe"}],"title":"ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics","citation":{"mla":"Althoff, Matthias, et al. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Linear Continuous Dynamics.” EPiC Series in Computing, vol. 61, EasyChair, 2019, pp. 14–40, doi:10.29007/bj1w.","ama":"Althoff M, Bak S, Forets M, et al. ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics. In: EPiC Series in Computing. Vol 61. EasyChair; 2019:14-40. doi:10.29007/bj1w","apa":"Althoff, M., Bak, S., Forets, M., Frehse, G., Kochdumper, N., Ray, R., … Schupp, S. (2019). ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics. In EPiC Series in Computing (Vol. 61, pp. 14–40). Montreal, Canada: EasyChair. https://doi.org/10.29007/bj1w","short":"M. Althoff, S. Bak, M. Forets, G. Frehse, N. Kochdumper, R. Ray, C. Schilling, S. Schupp, in:, EPiC Series in Computing, EasyChair, 2019, pp. 14–40.","ieee":"M. Althoff et al., “ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics,” in EPiC Series in Computing, Montreal, Canada, 2019, vol. 61, pp. 14–40.","chicago":"Althoff, Matthias, Stanley Bak, Marcelo Forets, Goran Frehse, Niklas Kochdumper, Rajarshi Ray, Christian Schilling, and Stefan Schupp. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Linear Continuous Dynamics.” In EPiC Series in Computing, 61:14–40. EasyChair, 2019. https://doi.org/10.29007/bj1w.","ista":"Althoff M, Bak S, Forets M, Frehse G, Kochdumper N, Ray R, Schilling C, Schupp S. 2019. ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 61, 14–40."},"date_updated":"2021-01-12T08:20:05Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"EasyChair","oa":1,"main_file_link":[{"open_access":"1","url":"https://easychair.org/publications/open/1gbP"}],"month":"05","intvolume":" 61","abstract":[{"text":"This report presents the results of a friendly competition for formal verification of continuous and hybrid systems with linear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In its third edition, seven tools have been applied to solve six different benchmark problems in the category for linear continuous dynamics (in alphabetical order): CORA, CORA/SX, HyDRA, Hylaa, JuliaReach, SpaceEx, and XSpeed. This report is a snapshot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results provide one of the most complete assessments of tools for the safety verification of continuous and hybrid systems with linear continuous dynamics up to this date.","lang":"eng"}],"oa_version":"Published Version","page":"14-40","date_published":"2019-05-25T00:00:00Z","doi":"10.29007/bj1w","volume":61,"date_created":"2020-09-26T14:23:54Z","publication_identifier":{"eissn":["23987340"]},"publication_status":"published","year":"2019","day":"25","publication":"EPiC Series in Computing","language":[{"iso":"eng"}]},{"scopus_import":1,"intvolume":" 12","month":"08","abstract":[{"lang":"eng","text":"Glyphosate (N-phosphonomethyl glycine) and its commercial herbicide formulations have been shown to exert toxicity via various mechanisms. It has been asserted that glyphosate substitutes for glycine in polypeptide chains leading to protein misfolding and toxicity. However, as no direct evidence exists for glycine to glyphosate substitution in proteins, including in mammalian organisms, we tested this claim by conducting a proteomics analysis of MDA-MB-231 human breast cancer cells grown in the presence of 100 mg/L glyphosate for 6 days. Protein extracts from three treated and three untreated cell cultures were analysed as one TMT-6plex labelled sample, to highlight a specific pattern (+/+/+/−/−/−) of reporter intensities for peptides bearing true glyphosate treatment induced-post translational modifications as well as allowing an investigation of the total proteome."}],"pmid":1,"oa_version":"Published Version","volume":12,"related_material":{"record":[{"relation":"research_data","status":"public","id":"9784"}]},"publication_status":"published","publication_identifier":{"eissn":["1756-0500"]},"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"4a2bb7994b7f2c432bf44f5127ea3102","file_id":"6829","date_updated":"2020-07-14T12:47:40Z","file_size":1177482,"creator":"dernst","date_created":"2019-08-23T11:10:35Z","file_name":"2019_BMC_Antoniou.pdf"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","status":"public","_id":"6819","department":[{"_id":"LifeSc"}],"file_date_updated":"2020-07-14T12:47:40Z","date_updated":"2023-02-23T14:08:14Z","ddc":["570"],"oa":1,"quality_controlled":"1","publisher":"BioMed Central","date_created":"2019-08-18T22:00:39Z","date_published":"2019-08-08T00:00:00Z","doi":"10.1186/s13104-019-4534-3","year":"2019","has_accepted_license":"1","publication":"BMC Research Notes","day":"08","article_number":"494","article_processing_charge":"No","external_id":{"pmid":["31395095"]},"author":[{"full_name":"Antoniou, Michael N.","last_name":"Antoniou","first_name":"Michael N."},{"full_name":"Nicolas, Armel","last_name":"Nicolas","first_name":"Armel","id":"2A103192-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mesnage, Robin","last_name":"Mesnage","first_name":"Robin"},{"first_name":"Martina","last_name":"Biserni","full_name":"Biserni, Martina"},{"first_name":"Francesco V.","last_name":"Rao","full_name":"Rao, Francesco V."},{"first_name":"Cristina Vazquez","full_name":"Martin, Cristina Vazquez","last_name":"Martin"}],"title":"Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells","citation":{"chicago":"Antoniou, Michael N., Armel Nicolas, Robin Mesnage, Martina Biserni, Francesco V. Rao, and Cristina Vazquez Martin. “Glyphosate Does Not Substitute for Glycine in Proteins of Actively Dividing Mammalian Cells.” BMC Research Notes. BioMed Central, 2019. https://doi.org/10.1186/s13104-019-4534-3.","ista":"Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. 2019. Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. BMC Research Notes. 12, 494.","mla":"Antoniou, Michael N., et al. “Glyphosate Does Not Substitute for Glycine in Proteins of Actively Dividing Mammalian Cells.” BMC Research Notes, vol. 12, 494, BioMed Central, 2019, doi:10.1186/s13104-019-4534-3.","apa":"Antoniou, M. N., Nicolas, A., Mesnage, R., Biserni, M., Rao, F. V., & Martin, C. V. (2019). Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. BMC Research Notes. BioMed Central. https://doi.org/10.1186/s13104-019-4534-3","ama":"Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. BMC Research Notes. 2019;12. doi:10.1186/s13104-019-4534-3","ieee":"M. N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F. V. Rao, and C. V. Martin, “Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells,” BMC Research Notes, vol. 12. BioMed Central, 2019.","short":"M.N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F.V. Rao, C.V. Martin, BMC Research Notes 12 (2019)."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"year":"2019","day":"09","date_published":"2019-08-09T00:00:00Z","doi":"10.6084/m9.figshare.9411761.v1","related_material":{"record":[{"id":"6819","status":"public","relation":"used_in_publication"}]},"date_created":"2021-08-06T08:14:05Z","abstract":[{"lang":"eng","text":"Additional file 1: Table S1. Kinetics of MDA-MB-231 cell growth in either the presence or absence of 100Â mg/L glyphosate. Cell counts are given at day-1 of seeding flasks and following 6-days of continuous culture. Note: no differences in cell numbers were observed between negative control and glyphosate treated cultures."}],"oa_version":"Published Version","publisher":"Springer Nature","main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.9411761.v1"}],"oa":1,"month":"08","date_updated":"2023-02-23T12:52:29Z","citation":{"chicago":"Antoniou, Michael N., Armel Nicolas, Robin Mesnage, Martina Biserni, Francesco V. Rao, and Cristina Vazquez Martin. “MOESM1 of Glyphosate Does Not Substitute for Glycine in Proteins of Actively Dividing Mammalian Cells.” Springer Nature, 2019. https://doi.org/10.6084/m9.figshare.9411761.v1.","ista":"Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. 2019. MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells, Springer Nature, 10.6084/m9.figshare.9411761.v1.","mla":"Antoniou, Michael N., et al. MOESM1 of Glyphosate Does Not Substitute for Glycine in Proteins of Actively Dividing Mammalian Cells. Springer Nature, 2019, doi:10.6084/m9.figshare.9411761.v1.","apa":"Antoniou, M. N., Nicolas, A., Mesnage, R., Biserni, M., Rao, F. V., & Martin, C. V. (2019). MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. Springer Nature. https://doi.org/10.6084/m9.figshare.9411761.v1","ama":"Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. 2019. doi:10.6084/m9.figshare.9411761.v1","short":"M.N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F.V. Rao, C.V. Martin, (2019).","ieee":"M. N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F. V. Rao, and C. V. Martin, “MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells.” Springer Nature, 2019."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","author":[{"first_name":"Michael N.","full_name":"Antoniou, Michael N.","last_name":"Antoniou"},{"full_name":"Nicolas, Armel","last_name":"Nicolas","id":"2A103192-F248-11E8-B48F-1D18A9856A87","first_name":"Armel"},{"full_name":"Mesnage, Robin","last_name":"Mesnage","first_name":"Robin"},{"first_name":"Martina","last_name":"Biserni","full_name":"Biserni, Martina"},{"full_name":"Rao, Francesco V.","last_name":"Rao","first_name":"Francesco V."},{"full_name":"Martin, Cristina Vazquez","last_name":"Martin","first_name":"Cristina Vazquez"}],"article_processing_charge":"No","department":[{"_id":"LifeSc"}],"title":"MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells","_id":"9784","type":"research_data_reference","status":"public"},{"related_material":{"record":[{"relation":"used_in_publication","id":"315","status":"public"}]},"date_published":"2019-06-22T00:00:00Z","doi":"10.5061/dryad.5vv37","date_created":"2021-08-09T13:07:28Z","day":"22","year":"2019","month":"06","publisher":"Dryad","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.5vv37"}],"oa":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"More than 100 years after Grigg’s influential analysis of species’ borders, the causes of limits to species’ ranges still represent a puzzle that has never been understood with clarity. The topic has become especially important recently as many scientists have become interested in the potential for species’ ranges to shift in response to climate change—and yet nearly all of those studies fail to recognise or incorporate evolutionary genetics in a way that relates to theoretical developments. I show that range margins can be understood based on just two measurable parameters: (i) the fitness cost of dispersal—a measure of environmental heterogeneity—and (ii) the strength of genetic drift, which reduces genetic diversity. Together, these two parameters define an ‘expansion threshold’: adaptation fails when genetic drift reduces genetic diversity below that required for adaptation to a heterogeneous environment. When the key parameters drop below this expansion threshold locally, a sharp range margin forms. When they drop below this threshold throughout the species’ range, adaptation collapses everywhere, resulting in either extinction or formation of a fragmented metapopulation. Because the effects of dispersal differ fundamentally with dimension, the second parameter—the strength of genetic drift—is qualitatively different compared to a linear habitat. In two-dimensional habitats, genetic drift becomes effectively independent of selection. It decreases with ‘neighbourhood size’—the number of individuals accessible by dispersal within one generation. Moreover, in contrast to earlier predictions, which neglected evolution of genetic variance and/or stochasticity in two dimensions, dispersal into small marginal populations aids adaptation. This is because the reduction of both genetic and demographic stochasticity has a stronger effect than the cost of dispersal through increased maladaptation. The expansion threshold thus provides a novel, theoretically justified, and testable prediction for formation of the range margin and collapse of the species’ range."}],"department":[{"_id":"NiBa"}],"title":"Data from: Is the sky the limit? On the expansion threshold of a species' range","author":[{"id":"3BBFB084-F248-11E8-B48F-1D18A9856A87","first_name":"Jitka","last_name":"Polechova","orcid":"0000-0003-0951-3112","full_name":"Polechova, Jitka"}],"article_processing_charge":"No","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"apa":"Polechova, J. (2019). Data from: Is the sky the limit? On the expansion threshold of a species’ range. Dryad. https://doi.org/10.5061/dryad.5vv37","ama":"Polechova J. Data from: Is the sky the limit? On the expansion threshold of a species’ range. 2019. doi:10.5061/dryad.5vv37","ieee":"J. Polechova, “Data from: Is the sky the limit? On the expansion threshold of a species’ range.” Dryad, 2019.","short":"J. Polechova, (2019).","mla":"Polechova, Jitka. Data from: Is the Sky the Limit? On the Expansion Threshold of a Species’ Range. Dryad, 2019, doi:10.5061/dryad.5vv37.","ista":"Polechova J. 2019. Data from: Is the sky the limit? On the expansion threshold of a species’ range, Dryad, 10.5061/dryad.5vv37.","chicago":"Polechova, Jitka. “Data from: Is the Sky the Limit? On the Expansion Threshold of a Species’ Range.” Dryad, 2019. https://doi.org/10.5061/dryad.5vv37."},"date_updated":"2023-02-23T11:14:30Z","status":"public","type":"research_data_reference","_id":"9839"},{"article_number":"2019/1015","_id":"8305","status":"public","type":"preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Kokoris Kogias, E., Spiegelman, A., Malkhi, D., & Abraham, I. (n.d.). Bootstrapping consensus without trusted setup: fully asynchronous distributed key generation. Cryptology ePrint Archive.","ama":"Kokoris Kogias E, Spiegelman A, Malkhi D, Abraham I. Bootstrapping consensus without trusted setup: fully asynchronous distributed key generation. Cryptology ePrint Archive.","ieee":"E. Kokoris Kogias, A. Spiegelman, D. Malkhi, and I. Abraham, “Bootstrapping consensus without trusted setup: fully asynchronous distributed key generation,” Cryptology ePrint Archive. .","short":"E. Kokoris Kogias, A. Spiegelman, D. Malkhi, I. Abraham, Cryptology EPrint Archive (n.d.).","mla":"Kokoris Kogias, Eleftherios, et al. “Bootstrapping Consensus without Trusted Setup: Fully Asynchronous Distributed Key Generation.” Cryptology EPrint Archive, 2019/1015.","ista":"Kokoris Kogias E, Spiegelman A, Malkhi D, Abraham I. Bootstrapping consensus without trusted setup: fully asynchronous distributed key generation. Cryptology ePrint Archive, 2019/1015.","chicago":"Kokoris Kogias, Eleftherios, Alexander Spiegelman, Dahlia Malkhi, and Ittai Abraham. “Bootstrapping Consensus without Trusted Setup: Fully Asynchronous Distributed Key Generation.” Cryptology EPrint Archive, n.d."},"date_updated":"2023-05-10T09:27:54Z","title":"Bootstrapping consensus without trusted setup: fully asynchronous distributed key generation","author":[{"first_name":"Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","last_name":"KOKORIS KOGIAS","full_name":"KOKORIS KOGIAS, Eleftherios"},{"first_name":"Alexander","full_name":"Spiegelman, Alexander","last_name":"Spiegelman"},{"first_name":"Dahlia","last_name":"Malkhi","full_name":"Malkhi, Dahlia"},{"first_name":"Ittai","last_name":"Abraham","full_name":"Abraham, Ittai"}],"article_processing_charge":"No","oa_version":"Preprint","abstract":[{"lang":"eng","text":"In this paper, we present the first fully asynchronous distributed key generation (ADKG) algorithm as well as the first distributed key generation algorithm that can create keys with a dual (f,2f+1)−threshold that are necessary for scalable consensus (which so far needs a trusted dealer assumption). In order to create a DKG with a dual (f,2f+1)− threshold we first answer in the affirmative the open question posed by Cachin et al. how to create an AVSS protocol with recovery thresholds f+1AHPC19 - Austrian HPC Meeting 2019 , Institut für Mathematik und wissenschaftliches Rechnen der Universität Graz, 2019, p. 25.","ama":"Schlögl A, Kiss J, Elefante S. Is Debian suitable for running an HPC Cluster? In: AHPC19 - Austrian HPC Meeting 2019 . Institut für Mathematik und wissenschaftliches Rechnen der Universität Graz; 2019:25.","apa":"Schlögl, A., Kiss, J., & Elefante, S. (2019). Is Debian suitable for running an HPC Cluster? In AHPC19 - Austrian HPC Meeting 2019 (p. 25). Grundlsee, Austria: Institut für Mathematik und wissenschaftliches Rechnen der Universität Graz.","short":"A. Schlögl, J. Kiss, S. Elefante, in:, AHPC19 - Austrian HPC Meeting 2019 , Institut für Mathematik und wissenschaftliches Rechnen der Universität Graz, 2019, p. 25.","ieee":"A. Schlögl, J. Kiss, and S. Elefante, “Is Debian suitable for running an HPC Cluster?,” in AHPC19 - Austrian HPC Meeting 2019 , Grundlsee, Austria, 2019, p. 25.","chicago":"Schlögl, Alois, Janos Kiss, and Stefano Elefante. “Is Debian Suitable for Running an HPC Cluster?” In AHPC19 - Austrian HPC Meeting 2019 , 25. Institut für Mathematik und wissenschaftliches Rechnen der Universität Graz, 2019.","ista":"Schlögl A, Kiss J, Elefante S. 2019. Is Debian suitable for running an HPC Cluster? AHPC19 - Austrian HPC Meeting 2019 . AHPC: Austrian HPC Meeting, 25."},"date_updated":"2023-05-16T07:29:32Z","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","citation":{"chicago":"Aichholzer, Oswin, Hugo A Akitaya, Kenneth C Cheung, Erik D Demaine, Martin L Demaine, Sandor P Fekete, Linda Kleist, et al. “Folding Polyominoes with Holes into a Cube.” In Proceedings of the 31st Canadian Conference on Computational Geometry, 164–70. Canadian Conference on Computational Geometry, 2019.","ista":"Aichholzer O, Akitaya HA, Cheung KC, Demaine ED, Demaine ML, Fekete SP, Kleist L, Kostitsyna I, Löffler M, Masárová Z, Mundilova K, Schmidt C. 2019. Folding polyominoes with holes into a cube. Proceedings of the 31st Canadian Conference on Computational Geometry. CCCG: Canadian Conference in Computational Geometry, 164–170.","mla":"Aichholzer, Oswin, et al. “Folding Polyominoes with Holes into a Cube.” Proceedings of the 31st Canadian Conference on Computational Geometry, Canadian Conference on Computational Geometry, 2019, pp. 164–70.","apa":"Aichholzer, O., Akitaya, H. A., Cheung, K. C., Demaine, E. D., Demaine, M. L., Fekete, S. P., … Schmidt, C. (2019). Folding polyominoes with holes into a cube. In Proceedings of the 31st Canadian Conference on Computational Geometry (pp. 164–170). Edmonton, Canada: Canadian Conference on Computational Geometry.","ama":"Aichholzer O, Akitaya HA, Cheung KC, et al. Folding polyominoes with holes into a cube. In: Proceedings of the 31st Canadian Conference on Computational Geometry. Canadian Conference on Computational Geometry; 2019:164-170.","short":"O. Aichholzer, H.A. Akitaya, K.C. Cheung, E.D. Demaine, M.L. Demaine, S.P. Fekete, L. Kleist, I. Kostitsyna, M. Löffler, Z. Masárová, K. Mundilova, C. Schmidt, in:, Proceedings of the 31st Canadian Conference on Computational Geometry, Canadian Conference on Computational Geometry, 2019, pp. 164–170.","ieee":"O. Aichholzer et al., “Folding polyominoes with holes into a cube,” in Proceedings of the 31st Canadian Conference on Computational Geometry, Edmonton, Canada, 2019, pp. 164–170."},"date_updated":"2023-08-04T10:57:42Z","title":"Folding polyominoes with holes into a cube","department":[{"_id":"HeEd"}],"external_id":{"arxiv":["1910.09917"]},"article_processing_charge":"No","author":[{"first_name":"Oswin","last_name":"Aichholzer","full_name":"Aichholzer, Oswin"},{"last_name":"Akitaya","full_name":"Akitaya, Hugo A","first_name":"Hugo A"},{"first_name":"Kenneth C","full_name":"Cheung, Kenneth C","last_name":"Cheung"},{"last_name":"Demaine","full_name":"Demaine, Erik D","first_name":"Erik D"},{"full_name":"Demaine, Martin L","last_name":"Demaine","first_name":"Martin L"},{"first_name":"Sandor P","last_name":"Fekete","full_name":"Fekete, Sandor P"},{"full_name":"Kleist, Linda","last_name":"Kleist","first_name":"Linda"},{"first_name":"Irina","last_name":"Kostitsyna","full_name":"Kostitsyna, Irina"},{"full_name":"Löffler, Maarten","last_name":"Löffler","first_name":"Maarten"},{"id":"45CFE238-F248-11E8-B48F-1D18A9856A87","first_name":"Zuzana","orcid":"0000-0002-6660-1322","full_name":"Masárová, Zuzana","last_name":"Masárová"},{"full_name":"Mundilova, Klara","last_name":"Mundilova","first_name":"Klara"},{"first_name":"Christiane","last_name":"Schmidt","full_name":"Schmidt, Christiane"}],"_id":"6989","status":"public","conference":{"name":"CCCG: Canadian Conference in Computational Geometry","start_date":"2019-08-08","location":"Edmonton, Canada","end_date":"2019-08-10"},"type":"conference","publication":"Proceedings of the 31st Canadian Conference on Computational Geometry","language":[{"iso":"eng"}],"day":"01","publication_status":"published","year":"2019","date_created":"2019-11-04T16:46:11Z","date_published":"2019-08-01T00:00:00Z","related_material":{"record":[{"relation":"extended_version","status":"public","id":"8317"}]},"page":"164-170","acknowledgement":"This research was performed in part at the 33rd BellairsWinter Workshop on Computational Geometry. Wethank all other participants for a fruitful atmosphere.","oa_version":"Published Version","abstract":[{"text":"When can a polyomino piece of paper be folded into a unit cube? Prior work studied tree-like polyominoes, but polyominoes with holes remain an intriguing open problem. We present sufficient conditions for a polyomino with hole(s) to fold into a cube, and conditions under which cube folding is impossible. In particular, we show that all but five special simple holes guarantee foldability. ","lang":"eng"}],"month":"08","main_file_link":[{"open_access":"1","url":"https://cccg.ca/proceedings/2019/proceedings.pdf"}],"oa":1,"quality_controlled":"1","scopus_import":"1","publisher":"Canadian Conference on Computational Geometry"},{"abstract":[{"text":"In two-player games on graphs, the players move a token through a graph to produce a finite or infinite path, which determines the qualitative winner or quantitative payoff of the game. We study bidding games in which the players bid for the right to move the token. Several bidding rules were studied previously. In Richman bidding, in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Poorman bidding is similar except that the winner of the bidding pays the \"bank\" rather than the other player. Taxman bidding spans the spectrum between Richman and poorman bidding. They are parameterized by a constant tau in [0,1]: portion tau of the winning bid is paid to the other player, and portion 1-tau to the bank. While finite-duration (reachability) taxman games have been studied before, we present, for the first time, results on infinite-duration taxman games. It was previously shown that both Richman and poorman infinite-duration games with qualitative objectives reduce to reachability games, and we show a similar result here. Our most interesting results concern quantitative taxman games, namely mean-payoff games, where poorman and Richman bidding differ significantly. A central quantity in these games is the ratio between the two players' initial budgets. While in poorman mean-payoff games, the optimal payoff of a player depends on the initial ratio, in Richman bidding, the payoff depends only on the structure of the game. In both games the optimal payoffs can be found using (different) probabilistic connections with random-turn games in which in each turn, instead of bidding, a coin is tossed to determine which player moves. While the value with Richman bidding equals the value of a random-turn game with an un-biased coin, with poorman bidding, the bias in the coin is the initial ratio of the budgets. We give a complete classification of mean-payoff taxman games that is based on a probabilistic connection: the value of a taxman bidding game with parameter tau and initial ratio r, equals the value of a random-turn game that uses a coin with bias F(tau, r) = (r+tau * (1-r))/(1+tau). Thus, we show that Richman bidding is the exception; namely, for every tau <1, the value of the game depends on the initial ratio. Our proof technique simplifies and unifies the previous proof techniques for both Richman and poorman bidding. ","lang":"eng"}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"scopus_import":1,"month":"08","intvolume":" 138","publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"6346e116a4f4ed1414174d96d2c4fbd7","file_id":"6913","creator":"kschuh","file_size":554457,"date_updated":"2020-07-14T12:47:42Z","file_name":"2019_LIPIcs_Avni.pdf","date_created":"2019-09-27T11:45:15Z"}],"language":[{"iso":"eng"}],"volume":138,"related_material":{"record":[{"id":"9239","status":"public","relation":"later_version"}]},"ec_funded":1,"_id":"6884","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"location":"Aachen, Germany","end_date":"2019-08-30","start_date":"2019-08-26","name":"MFCS: nternational Symposium on Mathematical Foundations of Computer Science"},"status":"public","date_updated":"2023-08-07T14:08:34Z","ddc":["004"],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:42Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"has_accepted_license":"1","year":"2019","day":"01","date_published":"2019-08-01T00:00:00Z","doi":"10.4230/LIPICS.MFCS.2019.11","date_created":"2019-09-18T08:04:26Z","article_number":"11","project":[{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"},{"_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal Methods meets Algorithmic Game Theory","grant_number":"M02369"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"},{"name":"Rigorous Systems Engineering","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"}],"citation":{"ista":"Avni G, Henzinger TA, Zikelic D. 2019. Bidding mechanisms in graph games. MFCS: nternational Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 138, 11.","chicago":"Avni, Guy, Thomas A Henzinger, and Dorde Zikelic. “Bidding Mechanisms in Graph Games,” Vol. 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.MFCS.2019.11.","short":"G. Avni, T.A. Henzinger, D. Zikelic, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ieee":"G. Avni, T. A. Henzinger, and D. Zikelic, “Bidding mechanisms in graph games,” presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany, 2019, vol. 138.","ama":"Avni G, Henzinger TA, Zikelic D. Bidding mechanisms in graph games. In: Vol 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.MFCS.2019.11","apa":"Avni, G., Henzinger, T. A., & Zikelic, D. (2019). Bidding mechanisms in graph games (Vol. 138). Presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.MFCS.2019.11","mla":"Avni, Guy, et al. Bidding Mechanisms in Graph Games. Vol. 138, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.MFCS.2019.11."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde","last_name":"Zikelic"}],"external_id":{"arxiv":["1905.03835"]},"title":"Bidding mechanisms in graph games"},{"abstract":[{"text":"A detailed description of the two stochastic models, table of parameters, supplementary data for Figures 4 and 5, parameter dependence of the results, and an analysis on motors with different force–velocity functions (PDF)","lang":"eng"}],"oa_version":"Published Version","publisher":"American Chemical Society ","month":"12","year":"2019","day":"19","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"7166"}]},"doi":"10.1021/acs.nanolett.9b04445.s001","date_published":"2019-12-19T00:00:00Z","date_created":"2021-07-27T09:51:46Z","_id":"9726","type":"research_data_reference","status":"public","citation":{"ieee":"M. C. Ucar and R. Lipowsky, “Supplementary information - Collective force generation by molecular motors is determined by strain-induced unbinding.” American Chemical Society , 2019.","short":"M.C. Ucar, R. Lipowsky, (2019).","ama":"Ucar MC, Lipowsky R. Supplementary information - Collective force generation by molecular motors is determined by strain-induced unbinding. 2019. doi:10.1021/acs.nanolett.9b04445.s001","apa":"Ucar, M. C., & Lipowsky, R. (2019). Supplementary information - Collective force generation by molecular motors is determined by strain-induced unbinding. American Chemical Society . https://doi.org/10.1021/acs.nanolett.9b04445.s001","mla":"Ucar, Mehmet C., and Reinhard Lipowsky. Supplementary Information - Collective Force Generation by Molecular Motors Is Determined by Strain-Induced Unbinding. American Chemical Society , 2019, doi:10.1021/acs.nanolett.9b04445.s001.","ista":"Ucar MC, Lipowsky R. 2019. Supplementary information - Collective force generation by molecular motors is determined by strain-induced unbinding, American Chemical Society , 10.1021/acs.nanolett.9b04445.s001.","chicago":"Ucar, Mehmet C, and Reinhard Lipowsky. “Supplementary Information - Collective Force Generation by Molecular Motors Is Determined by Strain-Induced Unbinding.” American Chemical Society , 2019. https://doi.org/10.1021/acs.nanolett.9b04445.s001."},"date_updated":"2023-08-17T14:07:52Z","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","author":[{"last_name":"Ucar","orcid":"0000-0003-0506-4217","full_name":"Ucar, Mehmet C","first_name":"Mehmet C","id":"50B2A802-6007-11E9-A42B-EB23E6697425"},{"first_name":"Reinhard","last_name":"Lipowsky","full_name":"Lipowsky, Reinhard"}],"article_processing_charge":"No","department":[{"_id":"EdHa"}],"title":"Supplementary information - Collective force generation by molecular motors is determined by strain-induced unbinding"},{"oa":1,"quality_controlled":"1","publisher":"Springer Nature","page":"29–58","date_created":"2019-07-24T08:37:29Z","doi":"10.1007/s41468-019-00029-8","date_published":"2019-06-01T00:00:00Z","year":"2019","has_accepted_license":"1","publication":"Journal of Applied and Computational Topology","day":"01","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"article_processing_charge":"Yes (via OA deal)","author":[{"last_name":"Boissonnat","full_name":"Boissonnat, Jean-Daniel","first_name":"Jean-Daniel"},{"full_name":"Lieutier, André","last_name":"Lieutier","first_name":"André"},{"id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs","last_name":"Wintraecken","orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs"}],"title":"The reach, metric distortion, geodesic convexity and the variation of tangent spaces","citation":{"ista":"Boissonnat J-D, Lieutier A, Wintraecken M. 2019. The reach, metric distortion, geodesic convexity and the variation of tangent spaces. Journal of Applied and Computational Topology. 3(1–2), 29–58.","chicago":"Boissonnat, Jean-Daniel, André Lieutier, and Mathijs Wintraecken. “The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces.” Journal of Applied and Computational Topology. Springer Nature, 2019. https://doi.org/10.1007/s41468-019-00029-8.","ama":"Boissonnat J-D, Lieutier A, Wintraecken M. The reach, metric distortion, geodesic convexity and the variation of tangent spaces. Journal of Applied and Computational Topology. 2019;3(1-2):29–58. doi:10.1007/s41468-019-00029-8","apa":"Boissonnat, J.-D., Lieutier, A., & Wintraecken, M. (2019). The reach, metric distortion, geodesic convexity and the variation of tangent spaces. Journal of Applied and Computational Topology. Springer Nature. https://doi.org/10.1007/s41468-019-00029-8","ieee":"J.-D. Boissonnat, A. Lieutier, and M. Wintraecken, “The reach, metric distortion, geodesic convexity and the variation of tangent spaces,” Journal of Applied and Computational Topology, vol. 3, no. 1–2. Springer Nature, pp. 29–58, 2019.","short":"J.-D. Boissonnat, A. Lieutier, M. Wintraecken, Journal of Applied and Computational Topology 3 (2019) 29–58.","mla":"Boissonnat, Jean-Daniel, et al. “The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces.” Journal of Applied and Computational Topology, vol. 3, no. 1–2, Springer Nature, 2019, pp. 29–58, doi:10.1007/s41468-019-00029-8."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 3","month":"06","abstract":[{"text":"In this paper we discuss three results. The first two concern general sets of positive reach: we first characterize the reach of a closed set by means of a bound on the metric distortion between the distance measured in the ambient Euclidean space and the shortest path distance measured in the set. Secondly, we prove that the intersection of a ball with radius less than the reach with the set is geodesically convex, meaning that the shortest path between any two points in the intersection lies itself in the intersection. For our third result we focus on manifolds with positive reach and give a bound on the angle between tangent spaces at two different points in terms of the reach and the distance between the two points.","lang":"eng"}],"oa_version":"Published Version","ec_funded":1,"issue":"1-2","volume":3,"publication_status":"published","publication_identifier":{"eissn":["2367-1734"],"issn":["2367-1726"]},"language":[{"iso":"eng"}],"file":[{"file_name":"2019_JournAppliedComputTopol_Boissonnat.pdf","date_created":"2019-07-31T08:09:56Z","file_size":2215157,"date_updated":"2020-07-14T12:47:36Z","creator":"dernst","file_id":"6741","checksum":"a5b244db9f751221409cf09c97ee0935","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","status":"public","_id":"6671","department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:47:36Z","date_updated":"2023-08-22T12:37:47Z","ddc":["000"]},{"volume":129,"issue":"3","language":[{"iso":"eng"}],"publication_status":"published","intvolume":" 129","month":"03","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1611.04177"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"text":"A representation formula for solutions of stochastic partial differential equations with Dirichlet boundary conditions is proved. The scope of our setting is wide enough to cover the general situation when the backward characteristics that appear in the usual formulation are not even defined in the Itô sense.","lang":"eng"}],"department":[{"_id":"JaMa"}],"date_updated":"2023-08-24T14:20:49Z","status":"public","article_type":"original","type":"journal_article","_id":"301","date_created":"2018-12-11T11:45:42Z","doi":"10.1016/j.spa.2018.04.003","date_published":"2019-03-01T00:00:00Z","page":"995-1012","publication":"Stochastic Processes and their Applications","day":"01","year":"2019","isi":1,"oa":1,"quality_controlled":"1","publisher":"Elsevier","title":"A Feynman–Kac formula for stochastic Dirichlet problems","article_processing_charge":"No","external_id":{"arxiv":["1611.04177"],"isi":["000458945300012"]},"author":[{"first_name":"Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","full_name":"Gerencser, Mate","last_name":"Gerencser"},{"first_name":"István","last_name":"Gyöngy","full_name":"Gyöngy, István"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Gerencser, Mate, and István Gyöngy. “A Feynman–Kac Formula for Stochastic Dirichlet Problems.” Stochastic Processes and Their Applications, vol. 129, no. 3, Elsevier, 2019, pp. 995–1012, doi:10.1016/j.spa.2018.04.003.","short":"M. Gerencser, I. Gyöngy, Stochastic Processes and Their Applications 129 (2019) 995–1012.","ieee":"M. Gerencser and I. Gyöngy, “A Feynman–Kac formula for stochastic Dirichlet problems,” Stochastic Processes and their Applications, vol. 129, no. 3. Elsevier, pp. 995–1012, 2019.","apa":"Gerencser, M., & Gyöngy, I. (2019). A Feynman–Kac formula for stochastic Dirichlet problems. Stochastic Processes and Their Applications. Elsevier. https://doi.org/10.1016/j.spa.2018.04.003","ama":"Gerencser M, Gyöngy I. A Feynman–Kac formula for stochastic Dirichlet problems. Stochastic Processes and their Applications. 2019;129(3):995-1012. doi:10.1016/j.spa.2018.04.003","chicago":"Gerencser, Mate, and István Gyöngy. “A Feynman–Kac Formula for Stochastic Dirichlet Problems.” Stochastic Processes and Their Applications. Elsevier, 2019. https://doi.org/10.1016/j.spa.2018.04.003.","ista":"Gerencser M, Gyöngy I. 2019. A Feynman–Kac formula for stochastic Dirichlet problems. Stochastic Processes and their Applications. 129(3), 995–1012."}},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"ista":"Deuchert A, Seiringer R, Yngvason J. 2019. Bose–Einstein condensation in a dilute, trapped gas at positive temperature. Communications in Mathematical Physics. 368(2), 723–776.","chicago":"Deuchert, Andreas, Robert Seiringer, and Jakob Yngvason. “Bose–Einstein Condensation in a Dilute, Trapped Gas at Positive Temperature.” Communications in Mathematical Physics. Springer, 2019. https://doi.org/10.1007/s00220-018-3239-0.","ama":"Deuchert A, Seiringer R, Yngvason J. Bose–Einstein condensation in a dilute, trapped gas at positive temperature. Communications in Mathematical Physics. 2019;368(2):723-776. doi:10.1007/s00220-018-3239-0","apa":"Deuchert, A., Seiringer, R., & Yngvason, J. (2019). Bose–Einstein condensation in a dilute, trapped gas at positive temperature. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-018-3239-0","short":"A. Deuchert, R. Seiringer, J. Yngvason, Communications in Mathematical Physics 368 (2019) 723–776.","ieee":"A. Deuchert, R. Seiringer, and J. Yngvason, “Bose–Einstein condensation in a dilute, trapped gas at positive temperature,” Communications in Mathematical Physics, vol. 368, no. 2. Springer, pp. 723–776, 2019.","mla":"Deuchert, Andreas, et al. “Bose–Einstein Condensation in a Dilute, Trapped Gas at Positive Temperature.” Communications in Mathematical Physics, vol. 368, no. 2, Springer, 2019, pp. 723–76, doi:10.1007/s00220-018-3239-0."},"title":"Bose–Einstein condensation in a dilute, trapped gas at positive temperature","publist_id":"7974","author":[{"full_name":"Deuchert, Andreas","orcid":"0000-0003-3146-6746","last_name":"Deuchert","first_name":"Andreas","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","last_name":"Seiringer"},{"first_name":"Jakob","last_name":"Yngvason","full_name":"Yngvason, Jakob"}],"external_id":{"isi":["000467796800007"]},"article_processing_charge":"Yes (via OA deal)","project":[{"name":"Analysis of quantum many-body systems","grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"FWF","_id":"25C878CE-B435-11E9-9278-68D0E5697425","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","grant_number":"P27533_N27"}],"day":"01","publication":"Communications in Mathematical Physics","isi":1,"has_accepted_license":"1","year":"2019","doi":"10.1007/s00220-018-3239-0","date_published":"2019-06-01T00:00:00Z","date_created":"2018-12-11T11:44:31Z","page":"723-776","quality_controlled":"1","publisher":"Springer","oa":1,"ddc":["530"],"date_updated":"2023-08-24T14:27:51Z","file_date_updated":"2020-07-14T12:48:07Z","department":[{"_id":"RoSe"}],"_id":"80","status":"public","type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file":[{"file_id":"5688","checksum":"c7e9880b43ac726712c1365e9f2f73a6","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-17T10:34:06Z","file_name":"2018_CommunMathPhys_Deuchert.pdf","creator":"dernst","date_updated":"2020-07-14T12:48:07Z","file_size":893902}],"language":[{"iso":"eng"}],"publication_status":"published","issue":"2","volume":368,"ec_funded":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We consider an interacting, dilute Bose gas trapped in a harmonic potential at a positive temperature. The system is analyzed in a combination of a thermodynamic and a Gross–Pitaevskii (GP) limit where the trap frequency ω, the temperature T, and the particle number N are related by N∼ (T/ ω) 3→ ∞ while the scattering length is so small that the interaction energy per particle around the center of the trap is of the same order of magnitude as the spectral gap in the trap. We prove that the difference between the canonical free energy of the interacting gas and the one of the noninteracting system can be obtained by minimizing the GP energy functional. We also prove Bose–Einstein condensation in the following sense: The one-particle density matrix of any approximate minimizer of the canonical free energy functional is to leading order given by that of the noninteracting gas but with the free condensate wavefunction replaced by the GP minimizer."}],"month":"06","intvolume":" 368","scopus_import":"1"}]