[{"_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":{"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.","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.","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.","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.","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.","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."},"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"},{"full_name":"Titkos, Tamas","last_name":"Titkos","first_name":"Tamas"},{"last_name":"Virosztek","orcid":"0000-0003-1109-5511","full_name":"Virosztek, Daniel","first_name":"Daniel","id":"48DB45DA-F248-11E8-B48F-1D18A9856A87"}],"title":"Dirac masses and isometric rigidity","department":[{"_id":"LaEr"}],"abstract":[{"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.","lang":"eng"}],"oa_version":"Submitted Version","oa":1,"main_file_link":[{"open_access":"1","url":"http://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/contents/2125.html"}],"publisher":"Research Institute for Mathematical Sciences, Kyoto University","quality_controlled":"1","intvolume":" 2125","month":"01","publication_status":"published","year":"2019","publication":"Kyoto RIMS Kôkyûroku","language":[{"iso":"eng"}],"day":"30","page":"34-41","date_created":"2019-11-18T15:39:53Z","volume":2125,"date_published":"2019-01-30T00:00:00Z"},{"status":"public","type":"book_editor","_id":"7171","title":"Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt","department":[{"_id":"ChLa"}],"editor":[{"last_name":"Kersting","full_name":"Kersting, Kristian","first_name":"Kristian"},{"first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","last_name":"Lampert"},{"first_name":"Constantin","full_name":"Rothkopf, Constantin","last_name":"Rothkopf"}],"article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"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.","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.","short":"K. Kersting, C. Lampert, C. Rothkopf, eds., Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt, 1st ed., Springer Nature, Wiesbaden, 2019.","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.","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","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"},"date_updated":"2021-12-22T14:40:58Z","place":"Wiesbaden","month":"10","publisher":"Springer Nature","quality_controlled":"1","edition":"1","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!"}],"date_published":"2019-10-30T00:00:00Z","related_material":{"link":[{"url":"https://ist.ac.at/en/news/book-release-how-machines-learn/","relation":"press_release","description":"News on IST Website"}]},"doi":"10.1007/978-3-658-26763-6","date_created":"2019-12-11T14:15:56Z","page":"XIV, 245","day":"30","language":[{"iso":"ger"}],"publication_identifier":{"eisbn":["978-3-658-26763-6"],"isbn":["978-3-658-26762-9"]},"year":"2019","publication_status":"published"},{"article_number":"39","project":[{"_id":"261FA626-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"M02281","name":"Eliminating intersections in drawings of graphs"}],"citation":{"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.","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","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.","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Fulek","full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774","first_name":"Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kyncl, Jan","last_name":"Kyncl","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","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"has_accepted_license":"1","year":"2019","day":"01","publication":"35th International Symposium on Computational Geometry (SoCG 2019)","doi":"10.4230/LIPICS.SOCG.2019.39","date_published":"2019-06-01T00:00:00Z","date_created":"2020-01-29T16:17:05Z","_id":"7401","type":"conference","conference":{"location":"Portland, OR, United States","end_date":"2019-06-21","start_date":"2019-06-18","name":"SoCG: Symposium on Computational Geometry"},"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)"},"status":"public","date_updated":"2021-01-12T08:13:24Z","ddc":["000"],"department":[{"_id":"UlWa"}],"file_date_updated":"2020-07-14T12:47:57Z","abstract":[{"lang":"eng","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. "}],"oa_version":"Published Version","scopus_import":1,"alternative_title":["LIPIcs"],"month":"06","intvolume":" 129","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-104-7"]},"publication_status":"published","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"7445","checksum":"aac37b09118cc0ab58cf77129e691f8c","file_size":628347,"date_updated":"2020-07-14T12:47:57Z","creator":"dernst","file_name":"2019_LIPIcs_Fulek.pdf","date_created":"2020-02-04T09:14:31Z"}],"language":[{"iso":"eng"}],"volume":129,"license":"https://creativecommons.org/licenses/by/4.0/"},{"_id":"7453","series_title":"LNCS","status":"public","type":"book_chapter","date_updated":"2022-09-06T08:25:52Z","department":[{"_id":"ToHe"}],"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."}],"month":"10","intvolume":" 10000","alternative_title":["Lecture Notes in Computer Science"],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/978-3-319-91908-9_22"}],"language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["9783319919089"],"isbn":["9783319919072"],"eissn":["0302-9743"],"issn":["1611-3349"]},"publication_status":"published","volume":10000,"project":[{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S11402-N23"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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","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","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.","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."},"title":"Continuous-time models for system design and analysis","editor":[{"last_name":"Steffen","full_name":"Steffen, Bernhard","first_name":"Bernhard"},{"first_name":"Gerhard","full_name":"Woeginger, Gerhard","last_name":"Woeginger"}],"author":[{"full_name":"Alur, Rajeev","last_name":"Alur","first_name":"Rajeev"},{"full_name":"Giacobbe, Mirco","orcid":"0000-0001-8180-0904","last_name":"Giacobbe","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","first_name":"Mirco"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Kim G.","full_name":"Larsen, Kim G.","last_name":"Larsen"},{"full_name":"Mikučionis, Marius","last_name":"Mikučionis","first_name":"Marius"}],"article_processing_charge":"No","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.","publisher":"Springer Nature","quality_controlled":"1","oa":1,"day":"05","publication":"Computing and Software Science","year":"2019","date_published":"2019-10-05T00:00:00Z","doi":"10.1007/978-3-319-91908-9_22","date_created":"2020-02-05T10:51:44Z","page":"452-477"},{"project":[{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504"}],"citation":{"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.","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.","short":"L. Portinale, U. Stefanelli, Advances in Mathematical Sciences and Applications 28 (2019) 425–447.","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.","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.","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1910.10050"]},"article_processing_charge":"No","author":[{"full_name":"Portinale, Lorenzo","last_name":"Portinale","first_name":"Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ulisse","full_name":"Stefanelli, Ulisse","last_name":"Stefanelli"}],"title":"Penalization via global functionals of optimal-control problems for dissipative evolution","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","_id":"7550","type":"journal_article","article_type":"original","status":"public","date_updated":"2022-06-17T07:52:41Z","department":[{"_id":"JaMa"}],"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"}],"volume":28,"issue":"2"}]