[{"volume":77,"pubrep_id":"896","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file_date_updated":"2020-07-14T12:47:41Z","publist_id":"7033","intvolume":"        77","status":"public","article_number":"49","date_created":"2018-12-11T11:47:54Z","month":"06","conference":{"end_date":"2017-07-07","name":"SoCG: Symposium on Computational Geometry","location":"Brisbane, Australia","start_date":"2017-07-04"},"author":[{"first_name":"Anna","last_name":"Lubiw","full_name":"Lubiw, Anna"},{"orcid":"0000-0002-6660-1322","full_name":"Masárová, Zuzana","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","last_name":"Masárová","first_name":"Zuzana"},{"orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","last_name":"Wagner"}],"quality_controlled":"1","citation":{"apa":"Lubiw, A., Masárová, Z., &#38; Wagner, U. (2017). A proof of the orbit conjecture for flipping edge labelled triangulations (Vol. 77). Presented at the SoCG: Symposium on Computational Geometry, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.49\">https://doi.org/10.4230/LIPIcs.SoCG.2017.49</a>","mla":"Lubiw, Anna, et al. <i>A Proof of the Orbit Conjecture for Flipping Edge Labelled Triangulations</i>. Vol. 77, 49, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.49\">10.4230/LIPIcs.SoCG.2017.49</a>.","ista":"Lubiw A, Masárová Z, Wagner U. 2017. A proof of the orbit conjecture for flipping edge labelled triangulations. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 77, 49.","short":"A. Lubiw, Z. Masárová, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","chicago":"Lubiw, Anna, Zuzana Masárová, and Uli Wagner. “A Proof of the Orbit Conjecture for Flipping Edge Labelled Triangulations,” Vol. 77. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.49\">https://doi.org/10.4230/LIPIcs.SoCG.2017.49</a>.","ama":"Lubiw A, Masárová Z, Wagner U. A proof of the orbit conjecture for flipping edge labelled triangulations. In: Vol 77. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.49\">10.4230/LIPIcs.SoCG.2017.49</a>","ieee":"A. Lubiw, Z. Masárová, and U. Wagner, “A proof of the orbit conjecture for flipping edge labelled triangulations,” presented at the SoCG: Symposium on Computational Geometry, Brisbane, Australia, 2017, vol. 77."},"year":"2017","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"related_material":{"record":[{"relation":"later_version","status":"public","id":"5986"}]},"oa":1,"ddc":["514","516"],"_id":"683","title":"A proof of the orbit conjecture for flipping edge labelled triangulations","publication_status":"published","abstract":[{"text":"Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a convex quadrilateral, and replaces e by the opposite diagonal of the quadrilateral. It is well known that any triangulation of a point set can be reconfigured to any other triangulation by some sequence of flips. We explore this question in the setting where each edge of a triangulation has a label, and a flip transfers the label of the removed edge to the new edge. It is not true that every labelled triangulation of a point set can be reconfigured to every other labelled triangulation via a sequence of flips, but we characterize when this is possible. There is an obvious necessary condition: for each label l, if edge e has label l in the first triangulation and edge f has label l in the second triangulation, then there must be some sequence of flips that moves label l from e to f, ignoring all other labels. Bose, Lubiw, Pathak and Verdonschot formulated the Orbit Conjecture, which states that this necessary condition is also sufficient, i.e. that all labels can be simultaneously mapped to their destination if and only if each label individually can be mapped to its destination. We prove this conjecture. Furthermore, we give a polynomial-time algorithm to find a sequence of flips to reconfigure one labelled triangulation to another, if such a sequence exists, and we prove an upper bound of O(n7) on the length of the flip sequence. Our proof uses the topological result that the sets of pairwise non-crossing edges on a planar point set form a simplicial complex that is homeomorphic to a high-dimensional ball (this follows from a result of Orden and Santos; we give a different proof based on a shelling argument). The dual cell complex of this simplicial ball, called the flip complex, has the usual flip graph as its 1-skeleton. We use properties of the 2-skeleton of the flip complex to prove the Orbit Conjecture.","lang":"eng"}],"date_published":"2017-06-01T00:00:00Z","file":[{"file_id":"5265","date_updated":"2020-07-14T12:47:41Z","access_level":"open_access","file_name":"IST-2017-896-v1+1_LIPIcs-SoCG-2017-49.pdf","checksum":"24fdde981cc513352a78dcf9b0660ae9","date_created":"2018-12-12T10:17:12Z","relation":"main_file","file_size":710007,"creator":"system","content_type":"application/pdf"}],"scopus_import":1,"alternative_title":["LIPIcs"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","date_updated":"2023-09-05T15:01:43Z","type":"conference","oa_version":"Published Version","license":"https://creativecommons.org/licenses/by/4.0/","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.SoCG.2017.49","has_accepted_license":"1","department":[{"_id":"UlWa"}]},{"main_file_link":[{"url":"https://arxiv.org/abs/1206.5174","open_access":"1"}],"citation":{"short":"K. Chatterjee, N. Piterman, Journal of Symbolic Logic 82 (2017) 420–452.","chicago":"Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.” <i>Journal of Symbolic Logic</i>. Cambridge University Press, 2017. <a href=\"https://doi.org/10.1017/jsl.2016.71\">https://doi.org/10.1017/jsl.2016.71</a>.","ista":"Chatterjee K, Piterman N. 2017. Obligation blackwell games and p-automata. Journal of Symbolic Logic. 82(2), 420–452.","ama":"Chatterjee K, Piterman N. Obligation blackwell games and p-automata. <i>Journal of Symbolic Logic</i>. 2017;82(2):420-452. doi:<a href=\"https://doi.org/10.1017/jsl.2016.71\">10.1017/jsl.2016.71</a>","ieee":"K. Chatterjee and N. Piterman, “Obligation blackwell games and p-automata,” <i>Journal of Symbolic Logic</i>, vol. 82, no. 2. Cambridge University Press, pp. 420–452, 2017.","mla":"Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.” <i>Journal of Symbolic Logic</i>, vol. 82, no. 2, Cambridge University Press, 2017, pp. 420–52, doi:<a href=\"https://doi.org/10.1017/jsl.2016.71\">10.1017/jsl.2016.71</a>.","apa":"Chatterjee, K., &#38; Piterman, N. (2017). Obligation blackwell games and p-automata. <i>Journal of Symbolic Logic</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jsl.2016.71\">https://doi.org/10.1017/jsl.2016.71</a>"},"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Piterman","first_name":"Nir","full_name":"Piterman, Nir"}],"quality_controlled":"1","year":"2017","publication":"Journal of Symbolic Logic","title":"Obligation blackwell games and p-automata","oa":1,"_id":"684","publication_status":"published","abstract":[{"lang":"eng","text":"We generalize winning conditions in two-player games by adding a structural acceptance condition called obligations. Obligations are orthogonal to the linear winning conditions that define whether a play is winning. Obligations are a declaration that player 0 can achieve a certain value from a configuration. If the obligation is met, the value of that configuration for player 0 is 1. We define the value in such games and show that obligation games are determined. For Markov chains with Borel objectives and obligations, and finite turn-based stochastic parity games with obligations we give an alternative and simpler characterization of the value function. Based on this simpler definition we show that the decision problem of winning finite turn-based stochastic parity games with obligations is in NP∩co-NP. We also show that obligation games provide a game framework for reasoning about p-automata. © 2017 The Association for Symbolic Logic."}],"issue":"2","volume":82,"publisher":"Cambridge University Press","intvolume":"        82","publist_id":"7026","date_created":"2018-12-11T11:47:54Z","month":"06","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","type":"journal_article","date_updated":"2021-04-16T12:10:53Z","oa_version":"Submitted Version","day":"01","language":[{"iso":"eng"}],"doi":"10.1017/jsl.2016.71","department":[{"_id":"KrCh"}],"date_published":"2017-06-01T00:00:00Z","page":"420 - 452","publication_identifier":{"issn":["0022-4812"],"eissn":["1943-5886"]},"scopus_import":"1"},{"oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"ChLa"}],"_id":"6841","publication":"5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings","title":"Extrapolation and learning equations","ec_funded":1,"publication_status":"published","abstract":[{"text":"In classical machine learning, regression is treated as a black box process of identifying a suitable function from a hypothesis set without attempting to gain insight into the mechanism connecting inputs and outputs. In the natural sciences, however, finding an interpretable function for a phenomenon is the prime goal as it allows to understand and generalize results. This paper proposes a novel type of function learning network, called equation learner (EQL), that can learn analytical expressions and is able to extrapolate to unseen domains. It is implemented as an end-to-end differentiable feed-forward network and allows for efficient gradient based training. Due to sparsity regularization concise interpretable expressions can be obtained. Often the true underlying source expression is identified.","lang":"eng"}],"project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","author":[{"last_name":"Martius","first_name":"Georg S","id":"3A276B68-F248-11E8-B48F-1D18A9856A87","full_name":"Martius, Georg S"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","last_name":"Lampert","first_name":"Christoph"}],"citation":{"ieee":"G. S. Martius and C. Lampert, “Extrapolation and learning equations,” in <i>5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings</i>, Toulon, France, 2017.","ama":"Martius GS, Lampert C. Extrapolation and learning equations. In: <i>5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings</i>. International Conference on Learning Representations; 2017.","short":"G.S. Martius, C. Lampert, in:, 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings, International Conference on Learning Representations, 2017.","chicago":"Martius, Georg S, and Christoph Lampert. “Extrapolation and Learning Equations.” In <i>5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings</i>. International Conference on Learning Representations, 2017.","ista":"Martius GS, Lampert C. 2017. Extrapolation and learning equations. 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings. ICLR: International Conference on Learning Representations.","mla":"Martius, Georg S., and Christoph Lampert. “Extrapolation and Learning Equations.” <i>5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings</i>, International Conference on Learning Representations, 2017.","apa":"Martius, G. S., &#38; Lampert, C. (2017). Extrapolation and learning equations. In <i>5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings</i>. Toulon, France: International Conference on Learning Representations."},"main_file_link":[{"url":"https://arxiv.org/abs/1610.02995","open_access":"1"}],"day":"21","year":"2017","type":"conference","date_updated":"2021-01-12T08:09:17Z","oa_version":"Preprint","scopus_import":1,"status":"public","date_created":"2019-09-01T22:01:00Z","conference":{"start_date":"2017-04-24","location":"Toulon, France","end_date":"2017-04-26","name":"ICLR: International Conference on Learning Representations"},"arxiv":1,"month":"02","date_published":"2017-02-21T00:00:00Z","external_id":{"arxiv":["1610.02995"]},"publisher":"International Conference on Learning Representations"},{"oa":1,"ddc":["571"],"_id":"685","publication":"Mechanisms of Development","title":"The physics of development 100 years after D'Arcy Thompson's “on growth and form”","pmid":1,"publication_status":"published","abstract":[{"text":"By applying methods and principles from the physical sciences to biological problems, D'Arcy Thompson's On Growth and Form demonstrated how mathematical reasoning reveals elegant, simple explanations for seemingly complex processes. This has had a profound influence on subsequent generations of developmental biologists. We discuss how this influence can be traced through twentieth century morphologists, embryologists and theoreticians to current research that explores the molecular and cellular mechanisms of tissue growth and patterning, including our own studies of the vertebrate neural tube.","lang":"eng"}],"project":[{"call_identifier":"H2020","_id":"B6FC0238-B512-11E9-945C-1524E6697425","name":"Coordination of Patterning And Growth In the Spinal Cord","grant_number":"680037"}],"author":[{"full_name":"Briscoe, James","first_name":"James","last_name":"Briscoe"},{"full_name":"Kicheva, Anna","orcid":"0000-0003-4509-4998","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","last_name":"Kicheva","first_name":"Anna"}],"quality_controlled":"1","citation":{"apa":"Briscoe, J., &#38; Kicheva, A. (2017). The physics of development 100 years after D’Arcy Thompson’s “on growth and form.” <i>Mechanisms of Development</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.mod.2017.03.005\">https://doi.org/10.1016/j.mod.2017.03.005</a>","mla":"Briscoe, James, and Anna Kicheva. “The Physics of Development 100 Years after D’Arcy Thompson’s ‘on Growth and Form.’” <i>Mechanisms of Development</i>, vol. 145, Elsevier, 2017, pp. 26–31, doi:<a href=\"https://doi.org/10.1016/j.mod.2017.03.005\">10.1016/j.mod.2017.03.005</a>.","ieee":"J. Briscoe and A. Kicheva, “The physics of development 100 years after D’Arcy Thompson’s ‘on growth and form,’” <i>Mechanisms of Development</i>, vol. 145. Elsevier, pp. 26–31, 2017.","ama":"Briscoe J, Kicheva A. The physics of development 100 years after D’Arcy Thompson’s “on growth and form.” <i>Mechanisms of Development</i>. 2017;145:26-31. doi:<a href=\"https://doi.org/10.1016/j.mod.2017.03.005\">10.1016/j.mod.2017.03.005</a>","ista":"Briscoe J, Kicheva A. 2017. The physics of development 100 years after D’Arcy Thompson’s “on growth and form”. Mechanisms of Development. 145, 26–31.","chicago":"Briscoe, James, and Anna Kicheva. “The Physics of Development 100 Years after D’Arcy Thompson’s ‘on Growth and Form.’” <i>Mechanisms of Development</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.mod.2017.03.005\">https://doi.org/10.1016/j.mod.2017.03.005</a>.","short":"J. Briscoe, A. Kicheva, Mechanisms of Development 145 (2017) 26–31."},"year":"2017","publist_id":"7025","intvolume":"       145","status":"public","date_created":"2018-12-11T11:47:55Z","month":"06","volume":145,"pubrep_id":"985","publisher":"Elsevier","file_date_updated":"2020-07-14T12:47:42Z","doi":"10.1016/j.mod.2017.03.005","language":[{"iso":"eng"}],"has_accepted_license":"1","department":[{"_id":"AnKi"}],"ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","date_updated":"2021-01-12T08:09:20Z","type":"journal_article","oa_version":"Submitted Version","publication_identifier":{"issn":["09254773"]},"scopus_import":1,"page":"26 - 31","date_published":"2017-06-01T00:00:00Z","external_id":{"pmid":["28366718"]},"file":[{"file_id":"6335","date_updated":"2020-07-14T12:47:42Z","file_name":"2017_Briscoe_Kicheva_and_DArcy_accepted_version.pdf","checksum":"727043d2e4199fbef6b3704e6d1ac105","access_level":"open_access","relation":"main_file","date_created":"2019-04-17T07:58:48Z","file_size":652313,"content_type":"application/pdf","creator":"dernst"}]},{"publisher":"Elsevier","volume":145,"page":"32 - 37","date_published":"2017-06-01T00:00:00Z","status":"public","month":"06","date_created":"2018-12-11T11:47:55Z","scopus_import":1,"publist_id":"7024","publication_identifier":{"issn":["09254773"]},"intvolume":"       145","year":"2017","day":"01","oa_version":"None","date_updated":"2021-01-12T08:09:23Z","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","author":[{"last_name":"Heisenberg","first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J"}],"citation":{"mla":"Heisenberg, Carl-Philipp J. “D’Arcy Thompson’s ‘on Growth and Form’: From Soap Bubbles to Tissue Self Organization.” <i>Mechanisms of Development</i>, vol. 145, Elsevier, 2017, pp. 32–37, doi:<a href=\"https://doi.org/10.1016/j.mod.2017.03.006\">10.1016/j.mod.2017.03.006</a>.","apa":"Heisenberg, C.-P. J. (2017). D’Arcy Thompson’s ‘on growth and form’: From soap bubbles to tissue self organization. <i>Mechanisms of Development</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.mod.2017.03.006\">https://doi.org/10.1016/j.mod.2017.03.006</a>","ama":"Heisenberg C-PJ. D’Arcy Thompson’s ‘on growth and form’: From soap bubbles to tissue self organization. <i>Mechanisms of Development</i>. 2017;145:32-37. doi:<a href=\"https://doi.org/10.1016/j.mod.2017.03.006\">10.1016/j.mod.2017.03.006</a>","ieee":"C.-P. J. Heisenberg, “D’Arcy Thompson’s ‘on growth and form’: From soap bubbles to tissue self organization,” <i>Mechanisms of Development</i>, vol. 145. Elsevier, pp. 32–37, 2017.","short":"C.-P.J. Heisenberg, Mechanisms of Development 145 (2017) 32–37.","chicago":"Heisenberg, Carl-Philipp J. “D’Arcy Thompson’s ‘on Growth and Form’: From Soap Bubbles to Tissue Self Organization.” <i>Mechanisms of Development</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.mod.2017.03.006\">https://doi.org/10.1016/j.mod.2017.03.006</a>.","ista":"Heisenberg C-PJ. 2017. D’Arcy Thompson’s ‘on growth and form’: From soap bubbles to tissue self organization. Mechanisms of Development. 145, 32–37."},"abstract":[{"lang":"eng","text":"Tissues are thought to behave like fluids with a given surface tension. Differences in tissue surface tension (TST) have been proposed to trigger cell sorting and tissue envelopment. D'Arcy Thompson in his seminal book ‘On Growth and Form’ has introduced this concept of differential TST as a key physical mechanism dictating tissue formation and organization within the developing organism. Over the past century, many studies have picked up the concept of differential TST and analyzed the role and cell biological basis of TST in development, underlining the importance and influence of this concept in developmental biology."}],"publication_status":"published","department":[{"_id":"CaHe"}],"_id":"686","language":[{"iso":"eng"}],"doi":"10.1016/j.mod.2017.03.006","title":"D'Arcy Thompson's ‘on growth and form’: From soap bubbles to tissue self organization","publication":"Mechanisms of Development"},{"ec_funded":1,"department":[{"_id":"TaHa"}],"language":[{"iso":"eng"}],"doi":"10.1093/qmath/haw053","oa_version":"Submitted Version","type":"journal_article","date_updated":"2021-01-12T08:09:24Z","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"publication_identifier":{"issn":["00335606"]},"date_published":"2017-06-01T00:00:00Z","page":"635 - 703","project":[{"grant_number":"320593","name":"Arithmetic and physics of Higgs moduli spaces","_id":"25E549F4-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"abstract":[{"text":"Pursuing the similarity between the Kontsevich-Soibelman construction of the cohomological Hall algebra (CoHA) of BPS states and Lusztig's construction of canonical bases for quantum enveloping algebras, and the similarity between the integrality conjecture for motivic Donaldson-Thomas invariants and the PBW theorem for quantum enveloping algebras, we build a coproduct on the CoHA associated to a quiver with potential. We also prove a cohomological dimensional reduction theorem, further linking a special class of CoHAs with Yangians, and explaining how to connect the study of character varieties with the study of CoHAs.","lang":"eng"}],"publication_status":"published","publication":"Quarterly Journal of Mathematics","title":"The critical CoHA of a quiver with potential","_id":"687","oa":1,"year":"2017","main_file_link":[{"url":"https://arxiv.org/abs/1311.7172","open_access":"1"}],"citation":{"ista":"Davison B. 2017. The critical CoHA of a quiver with potential. Quarterly Journal of Mathematics. 68(2), 635–703.","short":"B. Davison, Quarterly Journal of Mathematics 68 (2017) 635–703.","chicago":"Davison, Ben. “The Critical CoHA of a Quiver with Potential.” <i>Quarterly Journal of Mathematics</i>. Oxford University Press, 2017. <a href=\"https://doi.org/10.1093/qmath/haw053\">https://doi.org/10.1093/qmath/haw053</a>.","ama":"Davison B. The critical CoHA of a quiver with potential. <i>Quarterly Journal of Mathematics</i>. 2017;68(2):635-703. doi:<a href=\"https://doi.org/10.1093/qmath/haw053\">10.1093/qmath/haw053</a>","ieee":"B. Davison, “The critical CoHA of a quiver with potential,” <i>Quarterly Journal of Mathematics</i>, vol. 68, no. 2. Oxford University Press, pp. 635–703, 2017.","mla":"Davison, Ben. “The Critical CoHA of a Quiver with Potential.” <i>Quarterly Journal of Mathematics</i>, vol. 68, no. 2, Oxford University Press, 2017, pp. 635–703, doi:<a href=\"https://doi.org/10.1093/qmath/haw053\">10.1093/qmath/haw053</a>.","apa":"Davison, B. (2017). The critical CoHA of a quiver with potential. <i>Quarterly Journal of Mathematics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/qmath/haw053\">https://doi.org/10.1093/qmath/haw053</a>"},"quality_controlled":"1","author":[{"first_name":"Ben","last_name":"Davison","id":"4634AB1E-F248-11E8-B48F-1D18A9856A87","full_name":"Davison, Ben","orcid":"0000-0002-8944-4390"}],"month":"06","date_created":"2018-12-11T11:47:55Z","status":"public","intvolume":"        68","publist_id":"7022","publisher":"Oxford University Press","volume":68,"issue":"2"},{"day":"01","type":"conference","date_updated":"2021-01-12T08:09:26Z","oa_version":"Published Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.SoCG.2017.39","department":[{"_id":"HeEd"},{"_id":"UlWa"}],"has_accepted_license":"1","page":"391-3916","date_published":"2017-06-01T00:00:00Z","file":[{"file_id":"4856","date_updated":"2020-07-14T12:47:42Z","access_level":"open_access","checksum":"067ab0cb3f962bae6c3af6bf0094e0f3","file_name":"IST-2017-895-v1+1_LIPIcs-SoCG-2017-39.pdf","date_created":"2018-12-12T10:11:03Z","relation":"main_file","file_size":990546,"creator":"system","content_type":"application/pdf"}],"publication_identifier":{"issn":["18688969"]},"scopus_import":1,"alternative_title":["LIPIcs"],"year":"2017","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner"},{"first_name":"Hubert","last_name":"Wagner","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Hubert"}],"quality_controlled":"1","citation":{"ama":"Edelsbrunner H, Wagner H. Topological data analysis with Bregman divergences. In: Vol 77. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017:391-3916. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.39\">10.4230/LIPIcs.SoCG.2017.39</a>","ieee":"H. Edelsbrunner and H. Wagner, “Topological data analysis with Bregman divergences,” presented at the Symposium on Computational Geometry, SoCG, Brisbane, Australia, 2017, vol. 77, pp. 391–3916.","ista":"Edelsbrunner H, Wagner H. 2017. Topological data analysis with Bregman divergences. Symposium on Computational Geometry, SoCG, LIPIcs, vol. 77, 391–3916.","short":"H. Edelsbrunner, H. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, pp. 391–3916.","chicago":"Edelsbrunner, Herbert, and Hubert Wagner. “Topological Data Analysis with Bregman Divergences,” 77:391–3916. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.39\">https://doi.org/10.4230/LIPIcs.SoCG.2017.39</a>.","apa":"Edelsbrunner, H., &#38; Wagner, H. (2017). Topological data analysis with Bregman divergences (Vol. 77, pp. 391–3916). Presented at the Symposium on Computational Geometry, SoCG, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.39\">https://doi.org/10.4230/LIPIcs.SoCG.2017.39</a>","mla":"Edelsbrunner, Herbert, and Hubert Wagner. <i>Topological Data Analysis with Bregman Divergences</i>. Vol. 77, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, pp. 391–3916, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.39\">10.4230/LIPIcs.SoCG.2017.39</a>."},"publication_status":"published","abstract":[{"text":"We show that the framework of topological data analysis can be extended from metrics to general Bregman divergences, widening the scope of possible applications. Examples are the Kullback - Leibler divergence, which is commonly used for comparing text and images, and the Itakura - Saito divergence, popular for speech and sound. In particular, we prove that appropriately generalized čech and Delaunay (alpha) complexes capture the correct homotopy type, namely that of the corresponding union of Bregman balls. Consequently, their filtrations give the correct persistence diagram, namely the one generated by the uniformly growing Bregman balls. Moreover, we show that unlike the metric setting, the filtration of Vietoris-Rips complexes may fail to approximate the persistence diagram. We propose algorithms to compute the thus generalized čech, Vietoris-Rips and Delaunay complexes and experimentally test their efficiency. Lastly, we explain their surprisingly good performance by making a connection with discrete Morse theory. ","lang":"eng"}],"ddc":["514","516"],"oa":1,"_id":"688","title":"Topological data analysis with Bregman divergences","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file_date_updated":"2020-07-14T12:47:42Z","volume":77,"pubrep_id":"895","status":"public","date_created":"2018-12-11T11:47:56Z","conference":{"location":"Brisbane, Australia","start_date":"2017-07-04","end_date":"2017-07-07","name":"Symposium on Computational Geometry, SoCG"},"month":"06","publist_id":"7021","intvolume":"        77"},{"publisher":"American Association for the Advancement of Science","date_published":"2017-06-07T00:00:00Z","issue":"393","volume":9,"date_created":"2018-12-11T11:47:56Z","month":"06","status":"public","article_number":"eaan8196","intvolume":"         9","publist_id":"7019","publication_identifier":{"issn":["19466234"]},"scopus_import":1,"type":"journal_article","date_updated":"2021-01-12T08:09:29Z","oa_version":"None","day":"07","year":"2017","citation":{"short":"G. Novarino, Science Translational Medicine 9 (2017).","chicago":"Novarino, Gaia. “Rett Syndrome Modeling Goes Simian.” <i>Science Translational Medicine</i>. American Association for the Advancement of Science, 2017. <a href=\"https://doi.org/10.1126/scitranslmed.aan8196\">https://doi.org/10.1126/scitranslmed.aan8196</a>.","ista":"Novarino G. 2017. Rett syndrome modeling goes simian. Science Translational Medicine. 9(393), eaan8196.","ama":"Novarino G. Rett syndrome modeling goes simian. <i>Science Translational Medicine</i>. 2017;9(393). doi:<a href=\"https://doi.org/10.1126/scitranslmed.aan8196\">10.1126/scitranslmed.aan8196</a>","ieee":"G. Novarino, “Rett syndrome modeling goes simian,” <i>Science Translational Medicine</i>, vol. 9, no. 393. American Association for the Advancement of Science, 2017.","mla":"Novarino, Gaia. “Rett Syndrome Modeling Goes Simian.” <i>Science Translational Medicine</i>, vol. 9, no. 393, eaan8196, American Association for the Advancement of Science, 2017, doi:<a href=\"https://doi.org/10.1126/scitranslmed.aan8196\">10.1126/scitranslmed.aan8196</a>.","apa":"Novarino, G. (2017). Rett syndrome modeling goes simian. <i>Science Translational Medicine</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/scitranslmed.aan8196\">https://doi.org/10.1126/scitranslmed.aan8196</a>"},"quality_controlled":"1","author":[{"first_name":"Gaia","last_name":"Novarino","full_name":"Novarino, Gaia","orcid":"0000-0002-7673-7178","id":"3E57A680-F248-11E8-B48F-1D18A9856A87"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publication_status":"published","abstract":[{"lang":"eng","text":"Rett syndrome modeling in monkey mirrors the human disorder."}],"title":"Rett syndrome modeling goes simian","publication":"Science Translational Medicine","language":[{"iso":"eng"}],"doi":"10.1126/scitranslmed.aan8196","_id":"689","department":[{"_id":"GaNo"}]},{"page":"1905 - 1914","external_id":{"isi":["000683309501102"],"arxiv":["1612.08185"]},"date_published":"2017-08-01T00:00:00Z","scopus_import":"1","publication_identifier":{"isbn":["978-151085514-4"]},"arxiv":1,"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"01","oa_version":"Submitted Version","date_updated":"2023-09-22T09:50:41Z","type":"conference","department":[{"_id":"ChLa"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"ec_funded":1,"acknowledgement":"We thank Tim Salimans for spotting a mistake in our preliminary arXiv manuscript. This work was funded by the European Research Council under the European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 308036.","volume":70,"publisher":"JMLR","isi":1,"publist_id":"6398","intvolume":"        70","status":"public","month":"08","conference":{"name":"ICML: International Conference on Machine Learning","end_date":"2017-08-11","start_date":"2017-08-06","location":"Sydney, Australia"},"date_created":"2018-12-11T11:49:37Z","quality_controlled":"1","author":[{"id":"2D157DB6-F248-11E8-B48F-1D18A9856A87","full_name":"Kolesnikov, Alexander","first_name":"Alexander","last_name":"Kolesnikov"},{"last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"citation":{"apa":"Kolesnikov, A., &#38; Lampert, C. (2017). PixelCNN models with auxiliary variables for natural image modeling. In <i>34th International Conference on Machine Learning</i> (Vol. 70, pp. 1905–1914). Sydney, Australia: JMLR.","mla":"Kolesnikov, Alexander, and Christoph Lampert. “PixelCNN Models with Auxiliary Variables for Natural Image Modeling.” <i>34th International Conference on Machine Learning</i>, vol. 70, JMLR, 2017, pp. 1905–14.","ista":"Kolesnikov A, Lampert C. 2017. PixelCNN models with auxiliary variables for natural image modeling. 34th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 70, 1905–1914.","short":"A. Kolesnikov, C. Lampert, in:, 34th International Conference on Machine Learning, JMLR, 2017, pp. 1905–1914.","chicago":"Kolesnikov, Alexander, and Christoph Lampert. “PixelCNN Models with Auxiliary Variables for Natural Image Modeling.” In <i>34th International Conference on Machine Learning</i>, 70:1905–14. JMLR, 2017.","ieee":"A. Kolesnikov and C. Lampert, “PixelCNN models with auxiliary variables for natural image modeling,” in <i>34th International Conference on Machine Learning</i>, Sydney, Australia, 2017, vol. 70, pp. 1905–1914.","ama":"Kolesnikov A, Lampert C. PixelCNN models with auxiliary variables for natural image modeling. In: <i>34th International Conference on Machine Learning</i>. Vol 70. JMLR; 2017:1905-1914."},"main_file_link":[{"url":"https://arxiv.org/abs/1612.08185","open_access":"1"}],"year":"2017","_id":"1000","oa":1,"publication":"34th International Conference on Machine Learning","title":"PixelCNN models with auxiliary variables for natural image modeling","abstract":[{"text":"We study probabilistic models of natural images and extend the autoregressive family of PixelCNN models by incorporating latent variables. Subsequently, we describe two new generative image models that exploit different image transformations as latent variables: a quantized grayscale view of the image or a multi-resolution image pyramid. The proposed models tackle two known shortcomings of existing PixelCNN models: 1) their tendency to focus on low-level image details, while largely ignoring high-level image information, such as object shapes, and 2) their computationally costly procedure for image sampling. We experimentally demonstrate benefits of our LatentPixelCNN models, in particular showing that they produce much more realistically looking image samples than previous state-of-the-art probabilistic models. ","lang":"eng"}],"publication_status":"published","project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036"}]},{"date_published":"2017-01-01T00:00:00Z","file":[{"file_id":"4811","date_updated":"2018-12-12T10:10:24Z","access_level":"open_access","file_name":"IST-2018-1053-v1+1_CurveUp.pdf","date_created":"2018-12-12T10:10:24Z","relation":"main_file","file_size":36159696,"content_type":"application/pdf","creator":"system"}],"external_id":{"isi":["000406432100032"]},"alternative_title":["ACM Transactions on Graphics"],"date_updated":"2023-09-22T09:49:58Z","type":"conference","oa_version":"Submitted Version","day":"01","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ec_funded":1,"doi":"10.1145/3072959.3073709","language":[{"iso":"eng"}],"department":[{"_id":"BeBi"}],"has_accepted_license":"1","file_date_updated":"2018-12-12T10:10:24Z","publisher":"ACM","issue":"4","volume":36,"pubrep_id":"1053","date_created":"2018-12-11T11:49:38Z","conference":{"start_date":"2017-08-19","location":"Los Angeles, CA, United States","end_date":"2017-08-25","name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques"},"month":"01","article_number":"64","status":"public","intvolume":"        36","publist_id":"6397","isi":1,"year":"2017","citation":{"short":"R. Guseinov, E. Miguel, B. Bickel, in:, ACM, 2017.","chicago":"Guseinov, Ruslan, Eder Miguel, and Bernd Bickel. “CurveUps: Shaping Objects from Flat Plates with Tension-Actuated Curvature,” Vol. 36. ACM, 2017. <a href=\"https://doi.org/10.1145/3072959.3073709\">https://doi.org/10.1145/3072959.3073709</a>.","ista":"Guseinov R, Miguel E, Bickel B. 2017. CurveUps: Shaping objects from flat plates with tension-actuated curvature. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, ACM Transactions on Graphics, vol. 36, 64.","ieee":"R. Guseinov, E. Miguel, and B. Bickel, “CurveUps: Shaping objects from flat plates with tension-actuated curvature,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States, 2017, vol. 36, no. 4.","ama":"Guseinov R, Miguel E, Bickel B. CurveUps: Shaping objects from flat plates with tension-actuated curvature. In: Vol 36. ACM; 2017. doi:<a href=\"https://doi.org/10.1145/3072959.3073709\">10.1145/3072959.3073709</a>","mla":"Guseinov, Ruslan, et al. <i>CurveUps: Shaping Objects from Flat Plates with Tension-Actuated Curvature</i>. Vol. 36, no. 4, 64, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3072959.3073709\">10.1145/3072959.3073709</a>.","apa":"Guseinov, R., Miguel, E., &#38; Bickel, B. (2017). CurveUps: Shaping objects from flat plates with tension-actuated curvature (Vol. 36). Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States: ACM. <a href=\"https://doi.org/10.1145/3072959.3073709\">https://doi.org/10.1145/3072959.3073709</a>"},"author":[{"orcid":"0000-0001-9819-5077","full_name":"Guseinov, Ruslan","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","last_name":"Guseinov","first_name":"Ruslan"},{"full_name":"Miguel, Eder","first_name":"Eder","last_name":"Miguel"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel"}],"quality_controlled":"1","project":[{"name":"Soft-bodied intelligence for Manipulation","grant_number":"645599","_id":"25082902-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","abstract":[{"lang":"eng","text":"We present a computational approach for designing CurveUps, curvy shells that form from an initially flat state. They consist of small rigid tiles that are tightly held together by two pre-stretched elastic sheets attached to them. Our method allows the realization of smooth, doubly curved surfaces that can be fabricated as a flat piece. Once released, the restoring forces of the pre-stretched sheets support the object to take shape in 3D. CurveUps are structurally stable in their target configuration. The design process starts with a target surface. Our method generates a tile layout in 2D and optimizes the distribution, shape, and attachment areas of the tiles to obtain a configuration that is fabricable and in which the curved up state closely matches the target. Our approach is based on an efficient approximate model and a local optimization strategy for an otherwise intractable nonlinear optimization problem. We demonstrate the effectiveness of our approach for a wide range of shapes, all realized as physical prototypes."}],"title":"CurveUps: Shaping objects from flat plates with tension-actuated curvature","oa":1,"related_material":{"record":[{"id":"8366","relation":"dissertation_contains","status":"public"}]},"ddc":["003","004"],"_id":"1001"},{"date_published":"2017-06-01T00:00:00Z","external_id":{"isi":["000406432100049"]},"file":[{"date_created":"2018-12-12T10:09:05Z","relation":"main_file","content_type":"application/pdf","creator":"system","file_size":25463895,"file_id":"4728","date_updated":"2018-12-12T10:09:05Z","access_level":"open_access","file_name":"IST-2018-1050-v1+1_MechRet.pdf"}],"alternative_title":["ACM Transactions on Graphics"],"publication_identifier":{"issn":["07300301"]},"scopus_import":"1","date_updated":"2023-09-22T09:49:31Z","type":"conference","oa_version":"Submitted Version","day":"01","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ec_funded":1,"language":[{"iso":"eng"}],"doi":"10.1145/3072959.3073710","has_accepted_license":"1","department":[{"_id":"BeBi"}],"file_date_updated":"2018-12-12T10:09:05Z","publisher":"ACM","volume":36,"issue":"4","pubrep_id":"1050","date_created":"2018-12-11T11:49:38Z","conference":{"location":"Los Angeles, CA, United States ","start_date":"2017-07-30","end_date":"2017-08-03","name":"SIGGRAPH: Computer Graphics and Interactive Techniques"},"month":"06","article_number":"81","status":"public","intvolume":"        36","publist_id":"6396","isi":1,"year":"2017","citation":{"mla":"Zhang, Ran, et al. <i>Functionality-Aware Retargeting of Mechanisms to 3D Shapes</i>. Vol. 36, no. 4, 81, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3072959.3073710\">10.1145/3072959.3073710</a>.","apa":"Zhang, R., Auzinger, T., Ceylan, D., Li, W., &#38; Bickel, B. (2017). Functionality-aware retargeting of mechanisms to 3D shapes (Vol. 36). Presented at the SIGGRAPH: Computer Graphics and Interactive Techniques, Los Angeles, CA, United States : ACM. <a href=\"https://doi.org/10.1145/3072959.3073710\">https://doi.org/10.1145/3072959.3073710</a>","ista":"Zhang R, Auzinger T, Ceylan D, Li W, Bickel B. 2017. Functionality-aware retargeting of mechanisms to 3D shapes. SIGGRAPH: Computer Graphics and Interactive Techniques, ACM Transactions on Graphics, vol. 36, 81.","chicago":"Zhang, Ran, Thomas Auzinger, Duygu Ceylan, Wilmot Li, and Bernd Bickel. “Functionality-Aware Retargeting of Mechanisms to 3D Shapes,” Vol. 36. ACM, 2017. <a href=\"https://doi.org/10.1145/3072959.3073710\">https://doi.org/10.1145/3072959.3073710</a>.","short":"R. Zhang, T. Auzinger, D. Ceylan, W. Li, B. Bickel, in:, ACM, 2017.","ama":"Zhang R, Auzinger T, Ceylan D, Li W, Bickel B. Functionality-aware retargeting of mechanisms to 3D shapes. In: Vol 36. ACM; 2017. doi:<a href=\"https://doi.org/10.1145/3072959.3073710\">10.1145/3072959.3073710</a>","ieee":"R. Zhang, T. Auzinger, D. Ceylan, W. Li, and B. Bickel, “Functionality-aware retargeting of mechanisms to 3D shapes,” presented at the SIGGRAPH: Computer Graphics and Interactive Techniques, Los Angeles, CA, United States , 2017, vol. 36, no. 4."},"quality_controlled":"1","author":[{"id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3808-281X","full_name":"Zhang, Ran","first_name":"Ran","last_name":"Zhang"},{"full_name":"Auzinger, Thomas","orcid":"0000-0002-1546-3265","id":"4718F954-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Auzinger"},{"first_name":"Duygu","last_name":"Ceylan","full_name":"Ceylan, Duygu"},{"full_name":"Li, Wilmot","last_name":"Li","first_name":"Wilmot"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel","first_name":"Bernd"}],"project":[{"name":"Distributed 3D Object Design","grant_number":"642841","call_identifier":"H2020","_id":"2508E324-B435-11E9-9278-68D0E5697425"},{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}],"publication_status":"published","abstract":[{"text":"  We present an interactive design system to create functional mechanical  objects. Our computational approach allows novice users to retarget an  existing mechanical template to a user-specified input shape. Our proposed  representation for a mechanical template encodes a parameterized mechanism,  mechanical constraints that ensure a physically valid configuration, spatial relationships of mechanical parts to the user-provided shape, and functional constraints that specify an intended functionality. We provide an intuitive interface and optimization-in-the-loop approach for finding a valid  configuration of the mechanism and the shape to ensure that higher-level  functional goals are met. Our algorithm interactively optimizes the mechanism  while the user manipulates the placement of mechanical components and the shape. Our system allows users to efficiently explore various design choices and to synthesize customized mechanical objects that can be fabricated with rapid prototyping technologies. We demonstrate the efficacy of our approach by retargeting various mechanical templates to different shapes and fabricating the resulting functional mechanical objects.\r\n","lang":"eng"}],"title":"Functionality-aware retargeting of mechanisms to 3D shapes","ddc":["003","004"],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8386"}]},"oa":1,"_id":"1002"},{"language":[{"iso":"eng"}],"doi":"10.24963/ijcai.2017/11","has_accepted_license":"1","department":[{"_id":"ToHe"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","day":"30","type":"conference","date_updated":"2023-09-22T09:49:00Z","oa_version":"Submitted Version","publication_identifier":{"issn":["10450823"]},"scopus_import":"1","page":"70 - 76","date_published":"2017-05-30T00:00:00Z","external_id":{"isi":["000764137500011"]},"file":[{"file_id":"5249","date_updated":"2018-12-12T10:16:58Z","file_name":"IST-2017-818-v1+1_allIJCAI_CR.pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:16:58Z","file_size":365172,"creator":"system","content_type":"application/pdf"}],"oa":1,"related_material":{"record":[{"relation":"later_version","status":"public","id":"6006"}]},"ddc":["004"],"_id":"1003","title":"An abstraction-refinement methodology for reasoning about network games","publication_status":"published","abstract":[{"text":"Network games (NGs) are played on directed graphs and are extensively used in network design and analysis. Search problems for NGs include finding special strategy profiles such as a Nash equilibrium and a globally optimal solution. The networks modeled by NGs may be huge. In formal verification, abstraction has proven to be an extremely effective technique for reasoning about systems with big and even infinite state spaces. We describe an abstraction-refinement methodology for reasoning about NGs. Our methodology is based on an abstraction function that maps the state space of an NG to a much smaller state space. We search for a global optimum and a Nash equilibrium by reasoning on an under- and an overapproximation defined on top of this smaller state space. When the approximations are too coarse to find such profiles, we refine the abstraction function. Our experimental results demonstrate the efficiency of the methodology.","lang":"eng"}],"project":[{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"author":[{"last_name":"Avni","first_name":"Guy","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Shibashis","last_name":"Guha","full_name":"Guha, Shibashis"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"}],"quality_controlled":"1","citation":{"ista":"Avni G, Guha S, Kupferman O. 2017. An abstraction-refinement methodology for reasoning about network games. IJCAI: International Joint Conference on Artificial Intelligence , 70–76.","short":"G. Avni, S. Guha, O. Kupferman, in:, AAAI Press, 2017, pp. 70–76.","chicago":"Avni, Guy, Shibashis Guha, and Orna Kupferman. “An Abstraction-Refinement Methodology for Reasoning about Network Games,” 70–76. AAAI Press, 2017. <a href=\"https://doi.org/10.24963/ijcai.2017/11\">https://doi.org/10.24963/ijcai.2017/11</a>.","ama":"Avni G, Guha S, Kupferman O. An abstraction-refinement methodology for reasoning about network games. In: AAAI Press; 2017:70-76. doi:<a href=\"https://doi.org/10.24963/ijcai.2017/11\">10.24963/ijcai.2017/11</a>","ieee":"G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology for reasoning about network games,” presented at the IJCAI: International Joint Conference on Artificial Intelligence , Melbourne, Australia, 2017, pp. 70–76.","apa":"Avni, G., Guha, S., &#38; Kupferman, O. (2017). An abstraction-refinement methodology for reasoning about network games (pp. 70–76). Presented at the IJCAI: International Joint Conference on Artificial Intelligence , Melbourne, Australia: AAAI Press. <a href=\"https://doi.org/10.24963/ijcai.2017/11\">https://doi.org/10.24963/ijcai.2017/11</a>","mla":"Avni, Guy, et al. <i>An Abstraction-Refinement Methodology for Reasoning about Network Games</i>. AAAI Press, 2017, pp. 70–76, doi:<a href=\"https://doi.org/10.24963/ijcai.2017/11\">10.24963/ijcai.2017/11</a>."},"year":"2017","publist_id":"6395","isi":1,"status":"public","date_created":"2018-12-11T11:49:38Z","conference":{"location":"Melbourne, Australia","start_date":"2017-08-19","name":"IJCAI: International Joint Conference on Artificial Intelligence ","end_date":"2017-08-25"},"month":"05","pubrep_id":"818","publisher":"AAAI Press","file_date_updated":"2018-12-12T10:16:58Z"},{"date_published":"2017-08-01T00:00:00Z","file":[{"file_id":"6336","date_updated":"2019-04-17T08:00:36Z","success":1,"access_level":"open_access","file_name":"Otvos_Benkova_CurOpDevBiol_2017.pdf","date_created":"2019-04-17T08:00:36Z","relation":"main_file","content_type":"application/pdf","creator":"dernst","file_size":364133}],"external_id":{"isi":["000404880400013"],"pmid":["28391060"]},"page":"82 - 89","publication_identifier":{"issn":["0959437X"]},"scopus_import":"1","date_updated":"2023-09-22T09:48:15Z","type":"journal_article","oa_version":"Submitted Version","day":"01","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","doi":"10.1016/j.gde.2017.03.010","language":[{"iso":"eng"}],"has_accepted_license":"1","department":[{"_id":"EvBe"}],"file_date_updated":"2019-04-17T08:00:36Z","publisher":"Elsevier","volume":45,"pubrep_id":"1017","date_created":"2018-12-11T11:49:38Z","month":"08","status":"public","intvolume":"        45","publist_id":"6394","isi":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"year":"2017","citation":{"apa":"Ötvös, K., &#38; Benková, E. (2017). Spatiotemporal mechanisms of root branching. <i>Current Opinion in Genetics &#38; Development</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.gde.2017.03.010\">https://doi.org/10.1016/j.gde.2017.03.010</a>","mla":"Ötvös, Krisztina, and Eva Benková. “Spatiotemporal Mechanisms of Root Branching.” <i>Current Opinion in Genetics &#38; Development</i>, vol. 45, Elsevier, 2017, pp. 82–89, doi:<a href=\"https://doi.org/10.1016/j.gde.2017.03.010\">10.1016/j.gde.2017.03.010</a>.","ama":"Ötvös K, Benková E. Spatiotemporal mechanisms of root branching. <i>Current Opinion in Genetics &#38; Development</i>. 2017;45:82-89. doi:<a href=\"https://doi.org/10.1016/j.gde.2017.03.010\">10.1016/j.gde.2017.03.010</a>","ieee":"K. Ötvös and E. Benková, “Spatiotemporal mechanisms of root branching,” <i>Current Opinion in Genetics &#38; Development</i>, vol. 45. Elsevier, pp. 82–89, 2017.","short":"K. Ötvös, E. Benková, Current Opinion in Genetics &#38; Development 45 (2017) 82–89.","chicago":"Ötvös, Krisztina, and Eva Benková. “Spatiotemporal Mechanisms of Root Branching.” <i>Current Opinion in Genetics &#38; Development</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.gde.2017.03.010\">https://doi.org/10.1016/j.gde.2017.03.010</a>.","ista":"Ötvös K, Benková E. 2017. Spatiotemporal mechanisms of root branching. Current Opinion in Genetics &#38; Development. 45, 82–89."},"author":[{"last_name":"Ötvös","first_name":"Krisztina","full_name":"Ötvös, Krisztina","orcid":"0000-0002-5503-4983","id":"29B901B0-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Benková","first_name":"Eva","full_name":"Benková, Eva","orcid":"0000-0002-8510-9739","id":"38F4F166-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","project":[{"_id":"2542D156-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I 1774-B16","name":"Hormone cross-talk drives nutrient dependent plant development"}],"publication_status":"published","abstract":[{"text":"The fundamental tasks of the root system are, besides anchoring, mediating interactions between plant and soil and providing the plant with water and nutrients. The architecture of the root system is controlled by endogenous mechanisms that constantly integrate environmental signals, such as availability of nutrients and water. Extremely important for efficient soil exploitation and survival under less favorable conditions is the developmental flexibility of the root system that is largely determined by its postembryonic branching capacity. Modulation of initiation and outgrowth of lateral roots provides roots with an exceptional plasticity, allows optimal adjustment to underground heterogeneity, and enables effective soil exploitation and use of resources. Here we discuss recent advances in understanding the molecular mechanisms that shape the plant root system and integrate external cues to adapt to the changing environment.","lang":"eng"}],"title":"Spatiotemporal mechanisms of root branching","publication":"Current Opinion in Genetics & Development","pmid":1,"oa":1,"ddc":["575"],"_id":"1004"},{"file":[{"file_name":"IST-2017-814-v1+1_s12864-017-3705-7.pdf","access_level":"open_access","date_updated":"2018-12-12T10:16:46Z","file_id":"5236","file_size":2379672,"creator":"system","content_type":"application/pdf","relation":"main_file","date_created":"2018-12-12T10:16:46Z"}],"external_id":{"isi":["000400625200004"]},"date_published":"2017-04-26T00:00:00Z","page":"329","scopus_import":"1","publication_identifier":{"issn":["14712164"]},"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","date_updated":"2023-09-22T09:47:44Z","type":"journal_article","day":"26","department":[{"_id":"SyCr"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"doi":"10.1186/s12864-017-3705-7","pubrep_id":"814","issue":"1","volume":18,"file_date_updated":"2018-12-12T10:16:46Z","publisher":"BioMed Central","intvolume":"        18","isi":1,"publist_id":"6392","month":"04","date_created":"2018-12-11T11:49:39Z","status":"public","citation":{"apa":"Greenwood, J., Milutinovic, B., Peuß, R., Behrens, S., Essar, D., Rosenstiel, P., … Kurtz, J. (2017). Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae. <i>BMC Genomics</i>. BioMed Central. <a href=\"https://doi.org/10.1186/s12864-017-3705-7\">https://doi.org/10.1186/s12864-017-3705-7</a>","mla":"Greenwood, Jenny, et al. “Oral Immune Priming with Bacillus Thuringiensis Induces a Shift in the Gene Expression of Tribolium Castaneum Larvae.” <i>BMC Genomics</i>, vol. 18, no. 1, BioMed Central, 2017, p. 329, doi:<a href=\"https://doi.org/10.1186/s12864-017-3705-7\">10.1186/s12864-017-3705-7</a>.","ista":"Greenwood J, Milutinovic B, Peuß R, Behrens S, Essar D, Rosenstiel P, Schulenburg H, Kurtz J. 2017. Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae. BMC Genomics. 18(1), 329.","short":"J. Greenwood, B. Milutinovic, R. Peuß, S. Behrens, D. Essar, P. Rosenstiel, H. Schulenburg, J. Kurtz, BMC Genomics 18 (2017) 329.","chicago":"Greenwood, Jenny, Barbara Milutinovic, Robert Peuß, Sarah Behrens, Daniela Essar, Philip Rosenstiel, Hinrich Schulenburg, and Joachim Kurtz. “Oral Immune Priming with Bacillus Thuringiensis Induces a Shift in the Gene Expression of Tribolium Castaneum Larvae.” <i>BMC Genomics</i>. BioMed Central, 2017. <a href=\"https://doi.org/10.1186/s12864-017-3705-7\">https://doi.org/10.1186/s12864-017-3705-7</a>.","ieee":"J. Greenwood <i>et al.</i>, “Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae,” <i>BMC Genomics</i>, vol. 18, no. 1. BioMed Central, p. 329, 2017.","ama":"Greenwood J, Milutinovic B, Peuß R, et al. Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae. <i>BMC Genomics</i>. 2017;18(1):329. doi:<a href=\"https://doi.org/10.1186/s12864-017-3705-7\">10.1186/s12864-017-3705-7</a>"},"quality_controlled":"1","author":[{"full_name":"Greenwood, Jenny","last_name":"Greenwood","first_name":"Jenny"},{"last_name":"Milutinovic","first_name":"Barbara","orcid":"0000-0002-8214-4758","full_name":"Milutinovic, Barbara","id":"2CDC32B8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Robert","last_name":"Peuß","full_name":"Peuß, Robert"},{"last_name":"Behrens","first_name":"Sarah","full_name":"Behrens, Sarah"},{"first_name":"Daniela","last_name":"Essar","full_name":"Essar, Daniela"},{"last_name":"Rosenstiel","first_name":"Philip","full_name":"Rosenstiel, Philip"},{"full_name":"Schulenburg, Hinrich","first_name":"Hinrich","last_name":"Schulenburg"},{"last_name":"Kurtz","first_name":"Joachim","full_name":"Kurtz, Joachim"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2017","publication":"BMC Genomics","title":"Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae","_id":"1006","ddc":["570"],"related_material":{"record":[{"id":"9859","status":"public","relation":"research_data"},{"id":"9860","status":"public","relation":"research_data"}]},"oa":1,"abstract":[{"text":"Background: The phenomenon of immune priming, i.e. enhanced protection following a secondary exposure to a pathogen, has now been demonstrated in a wide range of invertebrate species. Despite accumulating phenotypic evidence, knowledge of its mechanistic underpinnings is currently very limited. Here we used the system of the red flour beetle, Tribolium castaneum and the insect pathogen Bacillus thuringiensis (Bt) to further our molecular understanding of the oral immune priming phenomenon. We addressed how ingestion of bacterial cues (derived from spore supernatants) of an orally pathogenic and non-pathogenic Bt strain affects gene expression upon later challenge exposure, using a whole-transcriptome sequencing approach. Results: Whereas gene expression of individuals primed with the orally non-pathogenic strain showed minor changes to controls, we found that priming with the pathogenic strain induced regulation of a large set of distinct genes, many of which are known immune candidates. Intriguingly, the immune repertoire activated upon priming and subsequent challenge qualitatively differed from the one mounted upon infection with Bt without previous priming. Moreover, a large subset of priming-specific genes showed an inverse regulation compared to their regulation upon challenge only. Conclusions: Our data demonstrate that gene expression upon infection is strongly affected by previous immune priming. We hypothesise that this shift in gene expression indicates activation of a more targeted and efficient response towards a previously encountered pathogen, in anticipation of potential secondary encounter.","lang":"eng"}],"publication_status":"published"},{"isi":1,"publist_id":"6391","month":"06","date_created":"2018-12-11T11:49:39Z","status":"public","pubrep_id":"813","volume":"81C","file_date_updated":"2018-12-12T10:11:29Z","publisher":"International Federation of Automatic Control","publication":"Automatica","title":"Zeros of nonlinear systems with input invariances","_id":"1007","ddc":["000"],"oa":1,"project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"abstract":[{"text":"A nonlinear system possesses an invariance with respect to a set of transformations if its output dynamics remain invariant when transforming the input, and adjusting the initial condition accordingly. Most research has focused on invariances with respect to time-independent pointwise transformations like translational-invariance (u(t) -&gt; u(t) + p, p in R) or scale-invariance (u(t) -&gt; pu(t), p in R&gt;0). In this article, we introduce the concept of s0-invariances with respect to continuous input transformations exponentially growing/decaying over time. We show that s0-invariant systems not only encompass linear time-invariant (LTI) systems with transfer functions having an irreducible zero at s0 in R, but also that the input/output relationship of nonlinear s0-invariant systems possesses properties well known from their linear counterparts. Furthermore, we extend the concept of s0-invariances to second- and higher-order s0-invariances, corresponding to invariances with respect to transformations of the time-derivatives of the input, and encompassing LTI systems with zeros of multiplicity two or higher. Finally, we show that nth-order 0-invariant systems realize – under mild conditions – nth-order nonlinear differential operators: when excited by an input of a characteristic functional form, the system’s output converges to a constant value only depending on the nth (nonlinear) derivative of the input.","lang":"eng"}],"publication_status":"published","citation":{"mla":"Lang, Moritz, and Eduardo Sontag. “Zeros of Nonlinear Systems with Input Invariances.” <i>Automatica</i>, vol. 81C, International Federation of Automatic Control, 2017, pp. 46–55, doi:<a href=\"https://doi.org/10.1016/j.automatica.2017.03.030\">10.1016/j.automatica.2017.03.030</a>.","apa":"Lang, M., &#38; Sontag, E. (2017). Zeros of nonlinear systems with input invariances. <i>Automatica</i>. International Federation of Automatic Control. <a href=\"https://doi.org/10.1016/j.automatica.2017.03.030\">https://doi.org/10.1016/j.automatica.2017.03.030</a>","short":"M. Lang, E. Sontag, Automatica 81C (2017) 46–55.","chicago":"Lang, Moritz, and Eduardo Sontag. “Zeros of Nonlinear Systems with Input Invariances.” <i>Automatica</i>. International Federation of Automatic Control, 2017. <a href=\"https://doi.org/10.1016/j.automatica.2017.03.030\">https://doi.org/10.1016/j.automatica.2017.03.030</a>.","ista":"Lang M, Sontag E. 2017. Zeros of nonlinear systems with input invariances. Automatica. 81C, 46–55.","ama":"Lang M, Sontag E. Zeros of nonlinear systems with input invariances. <i>Automatica</i>. 2017;81C:46-55. doi:<a href=\"https://doi.org/10.1016/j.automatica.2017.03.030\">10.1016/j.automatica.2017.03.030</a>","ieee":"M. Lang and E. Sontag, “Zeros of nonlinear systems with input invariances,” <i>Automatica</i>, vol. 81C. International Federation of Automatic Control, pp. 46–55, 2017."},"author":[{"id":"29E0800A-F248-11E8-B48F-1D18A9856A87","full_name":"Lang, Moritz","first_name":"Moritz","last_name":"Lang"},{"first_name":"Eduardo","last_name":"Sontag","full_name":"Sontag, Eduardo"}],"quality_controlled":"1","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2017","scopus_import":"1","publication_identifier":{"issn":["0005-1098"]},"external_id":{"isi":["000403513900006"]},"file":[{"date_updated":"2018-12-12T10:11:29Z","file_id":"4884","file_name":"IST-2017-813-v1+1_ZerosOfNonlinearSystems.pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:11:29Z","file_size":1401954,"creator":"system","content_type":"application/pdf"}],"date_published":"2017-06-01T00:00:00Z","page":"46 - 55","ec_funded":1,"department":[{"_id":"CaGu"},{"_id":"GaTk"}],"has_accepted_license":"1","doi":"10.1016/j.automatica.2017.03.030","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"Yes (in subscription journal)","oa_version":"Published Version","type":"journal_article","date_updated":"2023-10-17T08:51:18Z","day":"01"},{"department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"ec_funded":1,"acknowledgement":"he research leading to these results was supported by the Austrian Science Fund (FWF) NFN Grant no. S11407-N23 (RiSE/SHiNE); two ERC Starting grants (279307: Graph Games, 279499: inVEST); the Vienna Science and Tech- nology Fund (WWTF) through project ICT15-003; and the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. [291734].","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","day":"01","oa_version":"Submitted Version","date_updated":"2025-06-02T08:53:49Z","type":"conference","scopus_import":"1","page":"3725 - 3732","external_id":{"isi":["000485630703107"]},"date_published":"2017-01-01T00:00:00Z","_id":"1009","oa":1,"title":"Optimizing expectation with guarantees in POMDPs","publication":"Proceedings of the 31st AAAI Conference on Artificial Intelligence","abstract":[{"text":"A standard objective in partially-observable Markov decision processes (POMDPs) is to find a policy that maximizes the expected discounted-sum payoff. However, such policies may still permit unlikely but highly undesirable outcomes, which is problematic especially in safety-critical applications. Recently, there has been a surge of interest in POMDPs where the goal is to maximize the probability to ensure that the payoff is at least a given threshold, but these approaches do not consider any optimization beyond satisfying this threshold constraint. In this work we go beyond both the “expectation” and “threshold” approaches and consider a “guaranteed payoff optimization (GPO)” problem for POMDPs, where we are given a threshold t and the objective is to find a policy σ such that a) each possible outcome of σ yields a discounted-sum payoff of at least t, and b) the expected discounted-sum payoff of σ is optimal (or near-optimal) among all policies satisfying a). We present a practical approach to tackle the GPO problem and evaluate it on standard POMDP benchmarks.","lang":"eng"}],"publication_status":"published","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"quality_controlled":"1","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Petr","last_name":"Novotny","full_name":"Novotny, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pérez, Guillermo","first_name":"Guillermo","last_name":"Pérez"},{"full_name":"Raskin, Jean","last_name":"Raskin","first_name":"Jean"},{"first_name":"Djordje","last_name":"Zikelic","full_name":"Zikelic, Djordje"}],"citation":{"apa":"Chatterjee, K., Novotný, P., Pérez, G., Raskin, J., &#38; Zikelic, D. (2017). Optimizing expectation with guarantees in POMDPs. In <i>Proceedings of the 31st AAAI Conference on Artificial Intelligence</i> (Vol. 5, pp. 3725–3732). San Francisco, CA, United States: AAAI Press.","mla":"Chatterjee, Krishnendu, et al. “Optimizing Expectation with Guarantees in POMDPs.” <i>Proceedings of the 31st AAAI Conference on Artificial Intelligence</i>, vol. 5, AAAI Press, 2017, pp. 3725–32.","ista":"Chatterjee K, Novotný P, Pérez G, Raskin J, Zikelic D. 2017. Optimizing expectation with guarantees in POMDPs. Proceedings of the 31st AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 5, 3725–3732.","short":"K. Chatterjee, P. Novotný, G. Pérez, J. Raskin, D. Zikelic, in:, Proceedings of the 31st AAAI Conference on Artificial Intelligence, AAAI Press, 2017, pp. 3725–3732.","chicago":"Chatterjee, Krishnendu, Petr Novotný, Guillermo Pérez, Jean Raskin, and Djordje Zikelic. “Optimizing Expectation with Guarantees in POMDPs.” In <i>Proceedings of the 31st AAAI Conference on Artificial Intelligence</i>, 5:3725–32. AAAI Press, 2017.","ieee":"K. Chatterjee, P. Novotný, G. Pérez, J. Raskin, and D. Zikelic, “Optimizing expectation with guarantees in POMDPs,” in <i>Proceedings of the 31st AAAI Conference on Artificial Intelligence</i>, San Francisco, CA, United States, 2017, vol. 5, pp. 3725–3732.","ama":"Chatterjee K, Novotný P, Pérez G, Raskin J, Zikelic D. Optimizing expectation with guarantees in POMDPs. In: <i>Proceedings of the 31st AAAI Conference on Artificial Intelligence</i>. Vol 5. AAAI Press; 2017:3725-3732."},"main_file_link":[{"open_access":"1","url":"http://www.aaai.org/ocs/index.php/AAAI/AAAI17/paper/download/14354/14092"}],"year":"2017","isi":1,"publist_id":"6387","intvolume":"         5","status":"public","month":"01","conference":{"end_date":"2017-02-10","name":"AAAI: Conference on Artificial Intelligence","location":"San Francisco, CA, United States","start_date":"2017-02-04"},"date_created":"2018-12-11T11:49:40Z","volume":5,"publisher":"AAAI Press"},{"abstract":[{"lang":"eng","text":"We prove a local law in the bulk of the spectrum for random Gram matrices XX∗, a generalization of sample covariance matrices, where X is a large matrix with independent, centered entries with arbitrary variances. The limiting eigenvalue density that generalizes the Marchenko-Pastur law is determined by solving a system of nonlinear equations. Our entrywise and averaged local laws are on the optimal scale with the optimal error bounds. They hold both in the square case (hard edge) and in the properly rectangular case (soft edge). In the latter case we also establish a macroscopic gap away from zero in the spectrum of XX∗. "}],"publication_status":"published","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems"}],"_id":"1010","ddc":["510","539"],"oa":1,"related_material":{"record":[{"id":"149","relation":"dissertation_contains","status":"public"}]},"publication":"Electronic Journal of Probability","title":"Local law for random Gram matrices","year":"2017","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"author":[{"first_name":"Johannes","last_name":"Alt","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","full_name":"Alt, Johannes"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László","orcid":"0000-0001-5366-9603","first_name":"László","last_name":"Erdös"},{"first_name":"Torben H","last_name":"Krüger","id":"3020C786-F248-11E8-B48F-1D18A9856A87","full_name":"Krüger, Torben H","orcid":"0000-0002-4821-3297"}],"quality_controlled":"1","citation":{"ama":"Alt J, Erdös L, Krüger TH. Local law for random Gram matrices. <i>Electronic Journal of Probability</i>. 2017;22. doi:<a href=\"https://doi.org/10.1214/17-EJP42\">10.1214/17-EJP42</a>","ieee":"J. Alt, L. Erdös, and T. H. Krüger, “Local law for random Gram matrices,” <i>Electronic Journal of Probability</i>, vol. 22. Institute of Mathematical Statistics, 2017.","short":"J. Alt, L. Erdös, T.H. Krüger, Electronic Journal of Probability 22 (2017).","chicago":"Alt, Johannes, László Erdös, and Torben H Krüger. “Local Law for Random Gram Matrices.” <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics, 2017. <a href=\"https://doi.org/10.1214/17-EJP42\">https://doi.org/10.1214/17-EJP42</a>.","ista":"Alt J, Erdös L, Krüger TH. 2017. Local law for random Gram matrices. Electronic Journal of Probability. 22, 25.","apa":"Alt, J., Erdös, L., &#38; Krüger, T. H. (2017). Local law for random Gram matrices. <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/17-EJP42\">https://doi.org/10.1214/17-EJP42</a>","mla":"Alt, Johannes, et al. “Local Law for Random Gram Matrices.” <i>Electronic Journal of Probability</i>, vol. 22, 25, Institute of Mathematical Statistics, 2017, doi:<a href=\"https://doi.org/10.1214/17-EJP42\">10.1214/17-EJP42</a>."},"article_number":"25","status":"public","month":"03","date_created":"2018-12-11T11:49:40Z","isi":1,"publist_id":"6386","intvolume":"        22","publisher":"Institute of Mathematical Statistics","file_date_updated":"2018-12-12T10:13:39Z","pubrep_id":"807","volume":22,"has_accepted_license":"1","department":[{"_id":"LaEr"}],"language":[{"iso":"eng"}],"doi":"10.1214/17-EJP42","ec_funded":1,"day":"08","oa_version":"Published Version","type":"journal_article","date_updated":"2023-09-22T09:45:23Z","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","arxiv":1,"scopus_import":"1","publication_identifier":{"issn":["10836489"]},"external_id":{"isi":["000396611900025"],"arxiv":["1606.07353"]},"file":[{"date_updated":"2018-12-12T10:13:39Z","file_id":"5024","file_name":"IST-2017-807-v1+1_euclid.ejp.1488942016.pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:13:39Z","file_size":639384,"content_type":"application/pdf","creator":"system"}],"date_published":"2017-03-08T00:00:00Z"},{"doi":"10.1007/978-3-662-54434-1_11","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"ec_funded":1,"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"19","type":"conference","date_updated":"2023-09-22T09:44:50Z","oa_version":"Submitted Version","publication_identifier":{"issn":["03029743"]},"scopus_import":"1","alternative_title":["LNCS"],"page":"287 - 313","date_published":"2017-03-19T00:00:00Z","external_id":{"isi":["000681702400011"]},"oa":1,"_id":"1011","title":"Faster algorithms for weighted recursive state machines","publication_status":"published","abstract":[{"lang":"eng","text":"Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly equivalent, are standard models for interprocedural analysis. Yet RSMs are more convenient as they (a) explicitly model function calls and returns, and (b) specify many natural parameters for algorithmic analysis, e.g., the number of entries and exits. We consider a general framework where RSM transitions are labeled from a semiring and path properties are algebraic with semiring operations, which can model, e.g., interprocedural reachability and dataflow analysis problems. Our main contributions are new algorithms for several fundamental problems. As compared to a direct translation of RSMs to PDSs and the best-known existing bounds of PDSs, our analysis algorithm improves the complexity for finite-height semirings (that subsumes reachability and standard dataflow properties). We further consider the problem of extracting distance values from the representation structures computed by our algorithm, and give efficient algorithms that distinguish the complexity of a one-time preprocessing from the complexity of each individual query. Another advantage of our algorithm is that our improvements carry over to the concurrent setting, where we improve the bestknown complexity for the context-bounded analysis of concurrent RSMs. Finally, we provide a prototype implementation that gives a significant speed-up on several benchmarks from the SLAM/SDV project."}],"project":[{"call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"quality_controlled":"1","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117","id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard","last_name":"Kragl"},{"full_name":"Mishra, Samarth","last_name":"Mishra","first_name":"Samarth"},{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","last_name":"Pavlogiannis"}],"main_file_link":[{"url":"https://arxiv.org/abs/1701.04914","open_access":"1"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Weighted Recursive State Machines</i>. Edited by Hongseok Yang, vol. 10201, Springer, 2017, pp. 287–313, doi:<a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">10.1007/978-3-662-54434-1_11</a>.","apa":"Chatterjee, K., Kragl, B., Mishra, S., &#38; Pavlogiannis, A. (2017). Faster algorithms for weighted recursive state machines. In H. Yang (Ed.) (Vol. 10201, pp. 287–313). Presented at the ESOP: European Symposium on Programming, Uppsala, Sweden: Springer. <a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">https://doi.org/10.1007/978-3-662-54434-1_11</a>","ama":"Chatterjee K, Kragl B, Mishra S, Pavlogiannis A. Faster algorithms for weighted recursive state machines. In: Yang H, ed. Vol 10201. Springer; 2017:287-313. doi:<a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">10.1007/978-3-662-54434-1_11</a>","ieee":"K. Chatterjee, B. Kragl, S. Mishra, and A. Pavlogiannis, “Faster algorithms for weighted recursive state machines,” presented at the ESOP: European Symposium on Programming, Uppsala, Sweden, 2017, vol. 10201, pp. 287–313.","ista":"Chatterjee K, Kragl B, Mishra S, Pavlogiannis A. 2017. Faster algorithms for weighted recursive state machines. ESOP: European Symposium on Programming, LNCS, vol. 10201, 287–313.","chicago":"Chatterjee, Krishnendu, Bernhard Kragl, Samarth Mishra, and Andreas Pavlogiannis. “Faster Algorithms for Weighted Recursive State Machines.” edited by Hongseok Yang, 10201:287–313. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">https://doi.org/10.1007/978-3-662-54434-1_11</a>.","short":"K. Chatterjee, B. Kragl, S. Mishra, A. Pavlogiannis, in:, H. Yang (Ed.), Springer, 2017, pp. 287–313."},"year":"2017","publist_id":"6384","isi":1,"intvolume":"     10201","status":"public","date_created":"2018-12-11T11:49:41Z","conference":{"location":"Uppsala, Sweden","start_date":"2017-04-22","name":"ESOP: European Symposium on Programming","end_date":"2017-04-29"},"month":"03","volume":10201,"publisher":"Springer","editor":[{"first_name":"Hongseok","last_name":"Yang","full_name":"Yang, Hongseok"}]},{"publication_identifier":{"issn":["0006-3495"]},"date_published":"2017-02-03T00:00:00Z","keyword":["biophysics"],"doi":"10.1016/j.bpj.2016.11.2123","language":[{"iso":"eng"}],"day":"03","type":"journal_article","date_updated":"2021-11-03T10:02:45Z","oa_version":"Published Version","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","status":"public","article_number":"391a","date_created":"2021-10-12T07:47:55Z","month":"02","intvolume":"       112","publisher":"Elsevier ","article_type":"letter_note","issue":"3","volume":112,"publication_status":"published","oa":1,"_id":"10126","title":"Curvature mediated interactions in highly curved membranes","publication":"Biophysical Journal","year":"2017","extern":"1","author":[{"first_name":"Afshin","last_name":"Vahid Belarghou","full_name":"Vahid Belarghou, Afshin"},{"id":"bf63d406-f056-11eb-b41d-f263a6566d8b","full_name":"Šarić, Anđela","orcid":"0000-0002-7854-2139","first_name":"Anđela","last_name":"Šarić"},{"first_name":"Timon","last_name":"Idema","full_name":"Idema, Timon"}],"quality_controlled":"1","citation":{"apa":"Vahid Belarghou, A., Šarić, A., &#38; Idema, T. (2017). Curvature mediated interactions in highly curved membranes. <i>Biophysical Journal</i>. Elsevier . <a href=\"https://doi.org/10.1016/j.bpj.2016.11.2123\">https://doi.org/10.1016/j.bpj.2016.11.2123</a>","mla":"Vahid Belarghou, Afshin, et al. “Curvature Mediated Interactions in Highly Curved Membranes.” <i>Biophysical Journal</i>, vol. 112, no. 3, 391a, Elsevier , 2017, doi:<a href=\"https://doi.org/10.1016/j.bpj.2016.11.2123\">10.1016/j.bpj.2016.11.2123</a>.","chicago":"Vahid Belarghou, Afshin, Anđela Šarić, and Timon Idema. “Curvature Mediated Interactions in Highly Curved Membranes.” <i>Biophysical Journal</i>. Elsevier , 2017. <a href=\"https://doi.org/10.1016/j.bpj.2016.11.2123\">https://doi.org/10.1016/j.bpj.2016.11.2123</a>.","short":"A. Vahid Belarghou, A. Šarić, T. Idema, Biophysical Journal 112 (2017).","ista":"Vahid Belarghou A, Šarić A, Idema T. 2017. Curvature mediated interactions in highly curved membranes. Biophysical Journal. 112(3), 391a.","ieee":"A. Vahid Belarghou, A. Šarić, and T. Idema, “Curvature mediated interactions in highly curved membranes,” <i>Biophysical Journal</i>, vol. 112, no. 3. Elsevier , 2017.","ama":"Vahid Belarghou A, Šarić A, Idema T. Curvature mediated interactions in highly curved membranes. <i>Biophysical Journal</i>. 2017;112(3). doi:<a href=\"https://doi.org/10.1016/j.bpj.2016.11.2123\">10.1016/j.bpj.2016.11.2123</a>"},"main_file_link":[{"url":"https://www.cell.com/biophysj/fulltext/S0006-3495(16)33153-8","open_access":"1"}]},{"department":[{"_id":"JoFi"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"doi":"10.1103/Physics.10.32","oa_version":"Published Version","date_updated":"2022-06-07T10:58:31Z","type":"journal_article","day":"27","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","file":[{"file_size":193622,"creator":"dernst","content_type":"application/pdf","relation":"main_file","date_created":"2019-10-24T11:38:14Z","file_name":"2017_Physics_Fink.pdf","access_level":"open_access","success":1,"file_id":"6968","date_updated":"2019-10-24T11:38:14Z"}],"date_published":"2017-03-27T00:00:00Z","abstract":[{"text":"From microwave ovens to satellite television to the GPS and data services on our mobile phones, microwave technology is everywhere today. But one technology that has so far failed to prove its worth in this wavelength regime is quantum communication that uses the states of single photons as information carriers. This is because single microwave photons, as opposed to classical microwave signals, are extremely vulnerable to noise from thermal excitations in the channels through which they travel. Two new independent studies, one by Ze-Liang Xiang at Technische Universität Wien (Vienna), Austria, and colleagues [1] and another by Benoît Vermersch at the University of Innsbruck, also in Austria, and colleagues [2] now describe a theoretical protocol for microwave quantum communication that is resilient to thermal and other types of noise. Their approach could become a powerful technique to establish fast links between superconducting data processors in a future all-microwave quantum network.","lang":"eng"}],"publication_status":"published","title":"Viewpoint: Microwave quantum states beat the heat","publication":"Physics","_id":"1013","ddc":["530"],"oa":1,"year":"2017","citation":{"ieee":"J. M. Fink, “Viewpoint: Microwave quantum states beat the heat,” <i>Physics</i>, vol. 10, no. 32. American Physical Society, 2017.","ama":"Fink JM. Viewpoint: Microwave quantum states beat the heat. <i>Physics</i>. 2017;10(32). doi:<a href=\"https://doi.org/10.1103/Physics.10.32\">10.1103/Physics.10.32</a>","chicago":"Fink, Johannes M. “Viewpoint: Microwave Quantum States Beat the Heat.” <i>Physics</i>. American Physical Society, 2017. <a href=\"https://doi.org/10.1103/Physics.10.32\">https://doi.org/10.1103/Physics.10.32</a>.","short":"J.M. Fink, Physics 10 (2017).","ista":"Fink JM. 2017. Viewpoint: Microwave quantum states beat the heat. Physics. 10(32).","apa":"Fink, J. M. (2017). Viewpoint: Microwave quantum states beat the heat. <i>Physics</i>. American Physical Society. <a href=\"https://doi.org/10.1103/Physics.10.32\">https://doi.org/10.1103/Physics.10.32</a>","mla":"Fink, Johannes M. “Viewpoint: Microwave Quantum States Beat the Heat.” <i>Physics</i>, vol. 10, no. 32, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1103/Physics.10.32\">10.1103/Physics.10.32</a>."},"author":[{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","full_name":"Fink, Johannes M","orcid":"0000-0001-8112-028X","last_name":"Fink","first_name":"Johannes M"}],"quality_controlled":"1","month":"03","date_created":"2018-12-11T11:49:41Z","status":"public","intvolume":"        10","publist_id":"6382","file_date_updated":"2019-10-24T11:38:14Z","publisher":"American Physical Society","article_type":"review","volume":10,"issue":"32"}]