[{"scopus_import":"1","publisher":"Academic Press","main_file_link":[{"url":"https://arxiv.org/abs/1508.07594","open_access":"1"}],"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734"}],"date_created":"2018-12-11T11:50:34Z","volume":308,"abstract":[{"lang":"eng","text":"In this article we define an algebraic vertex of a generalized polyhedron and show that the set of algebraic vertices is the smallest set of points needed to define the polyhedron. We prove that the indicator function of a generalized polytope P is a linear combination of indicator functions of simplices whose vertices are algebraic vertices of P. We also show that the indicator function of any generalized polyhedron is a linear combination, with integer coefficients, of indicator functions of cones with apices at algebraic vertices and line-cones. The concept of an algebraic vertex is closely related to the Fourier–Laplace transform. We show that a point v is an algebraic vertex of a generalized polyhedron P if and only if the tangent cone of P, at v, has non-zero Fourier–Laplace transform."}],"date_published":"2017-02-21T00:00:00Z","author":[{"last_name":"Akopyan","first_name":"Arseniy","orcid":"0000-0002-2548-617X","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","full_name":"Akopyan, Arseniy"},{"last_name":"Bárány","first_name":"Imre","full_name":"Bárány, Imre"},{"last_name":"Robins","first_name":"Sinai","full_name":"Robins, Sinai"}],"ec_funded":1,"day":"21","year":"2017","language":[{"iso":"eng"}],"publication":"Advances in Mathematics","status":"public","type":"journal_article","title":"Algebraic vertices of non-convex polyhedra","isi":1,"citation":{"ieee":"A. Akopyan, I. Bárány, and S. Robins, “Algebraic vertices of non-convex polyhedra,” <i>Advances in Mathematics</i>, vol. 308. Academic Press, pp. 627–644, 2017.","ista":"Akopyan A, Bárány I, Robins S. 2017. Algebraic vertices of non-convex polyhedra. Advances in Mathematics. 308, 627–644.","chicago":"Akopyan, Arseniy, Imre Bárány, and Sinai Robins. “Algebraic Vertices of Non-Convex Polyhedra.” <i>Advances in Mathematics</i>. Academic Press, 2017. <a href=\"https://doi.org/10.1016/j.aim.2016.12.026\">https://doi.org/10.1016/j.aim.2016.12.026</a>.","ama":"Akopyan A, Bárány I, Robins S. Algebraic vertices of non-convex polyhedra. <i>Advances in Mathematics</i>. 2017;308:627-644. doi:<a href=\"https://doi.org/10.1016/j.aim.2016.12.026\">10.1016/j.aim.2016.12.026</a>","short":"A. Akopyan, I. Bárány, S. Robins, Advances in Mathematics 308 (2017) 627–644.","mla":"Akopyan, Arseniy, et al. “Algebraic Vertices of Non-Convex Polyhedra.” <i>Advances in Mathematics</i>, vol. 308, Academic Press, 2017, pp. 627–44, doi:<a href=\"https://doi.org/10.1016/j.aim.2016.12.026\">10.1016/j.aim.2016.12.026</a>.","apa":"Akopyan, A., Bárány, I., &#38; Robins, S. (2017). Algebraic vertices of non-convex polyhedra. <i>Advances in Mathematics</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.aim.2016.12.026\">https://doi.org/10.1016/j.aim.2016.12.026</a>"},"article_processing_charge":"No","department":[{"_id":"HeEd"}],"quality_controlled":"1","_id":"1180","page":"627 - 644","intvolume":"       308","doi":"10.1016/j.aim.2016.12.026","external_id":{"isi":["000409292900015"]},"date_updated":"2023-09-20T11:21:27Z","publication_identifier":{"issn":["00018708"]},"publication_status":"published","oa":1,"publist_id":"6173","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","month":"02","oa_version":"Submitted Version"},{"project":[{"call_identifier":"H2020","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks"},{"name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","call_identifier":"FP7"}],"article_type":"original","date_created":"2018-12-11T11:50:37Z","scopus_import":"1","file":[{"date_updated":"2020-07-14T12:44:37Z","content_type":"application/pdf","file_name":"2017_JournalCrypto_Kiltz.pdf","file_size":516959,"access_level":"open_access","file_id":"7843","date_created":"2020-05-14T16:30:17Z","creator":"dernst","relation":"main_file","checksum":"c647520d115b772a1682fc06fa273eb1"}],"publisher":"Springer","ec_funded":1,"publication":"Journal of Cryptology","language":[{"iso":"eng"}],"year":"2017","day":"01","author":[{"last_name":"Kiltz","first_name":"Eike","full_name":"Kiltz, Eike"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654"},{"last_name":"Venturi","first_name":"Daniele","full_name":"Venturi, Daniele"},{"first_name":"David","last_name":"Cash","full_name":"Cash, David"},{"full_name":"Jain, Abhishek","first_name":"Abhishek","last_name":"Jain"}],"date_published":"2017-10-01T00:00:00Z","volume":30,"abstract":[{"text":"We construct efficient authentication protocols and message authentication codes (MACs) whose security can be reduced to the learning parity with noise (LPN) problem. Despite a large body of work—starting with the (Formula presented.) protocol of Hopper and Blum in 2001—until now it was not even known how to construct an efficient authentication protocol from LPN which is secure against man-in-the-middle attacks. A MAC implies such a (two-round) protocol.","lang":"eng"}],"file_date_updated":"2020-07-14T12:44:37Z","issue":"4","quality_controlled":"1","department":[{"_id":"KrPi"}],"external_id":{"isi":["000410788600007"]},"doi":"10.1007/s00145-016-9247-3","intvolume":"        30","page":"1238 - 1275","_id":"1187","title":"Efficient authentication from hard learning problems","status":"public","type":"journal_article","citation":{"apa":"Kiltz, E., Pietrzak, K. Z., Venturi, D., Cash, D., &#38; Jain, A. (2017). Efficient authentication from hard learning problems. <i>Journal of Cryptology</i>. Springer. <a href=\"https://doi.org/10.1007/s00145-016-9247-3\">https://doi.org/10.1007/s00145-016-9247-3</a>","mla":"Kiltz, Eike, et al. “Efficient Authentication from Hard Learning Problems.” <i>Journal of Cryptology</i>, vol. 30, no. 4, Springer, 2017, pp. 1238–75, doi:<a href=\"https://doi.org/10.1007/s00145-016-9247-3\">10.1007/s00145-016-9247-3</a>.","ama":"Kiltz E, Pietrzak KZ, Venturi D, Cash D, Jain A. Efficient authentication from hard learning problems. <i>Journal of Cryptology</i>. 2017;30(4):1238-1275. doi:<a href=\"https://doi.org/10.1007/s00145-016-9247-3\">10.1007/s00145-016-9247-3</a>","chicago":"Kiltz, Eike, Krzysztof Z Pietrzak, Daniele Venturi, David Cash, and Abhishek Jain. “Efficient Authentication from Hard Learning Problems.” <i>Journal of Cryptology</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s00145-016-9247-3\">https://doi.org/10.1007/s00145-016-9247-3</a>.","short":"E. Kiltz, K.Z. Pietrzak, D. Venturi, D. Cash, A. Jain, Journal of Cryptology 30 (2017) 1238–1275.","ista":"Kiltz E, Pietrzak KZ, Venturi D, Cash D, Jain A. 2017. Efficient authentication from hard learning problems. Journal of Cryptology. 30(4), 1238–1275.","ieee":"E. Kiltz, K. Z. Pietrzak, D. Venturi, D. Cash, and A. Jain, “Efficient authentication from hard learning problems,” <i>Journal of Cryptology</i>, vol. 30, no. 4. Springer, pp. 1238–1275, 2017."},"article_processing_charge":"No","isi":1,"oa":1,"publication_status":"published","date_updated":"2023-09-20T11:20:58Z","ddc":["000"],"month":"10","oa_version":"Submitted Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"3238"}]},"publist_id":"6166","has_accepted_license":"1"},{"publication_status":"published","oa":1,"date_updated":"2025-05-28T11:42:46Z","month":"03","oa_version":"Preprint","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"6160","acknowledgement":"We thank Nick Barton, Katarína Bod’ová, and Sr\r\n-\r\ndan Sarikas for constructive feed-\r\nback and support. Furthermore, we would like to express our deep gratitude to the anonymous referees (one\r\nof whom, Jimmy Garnier, agreed to reveal his identity) and the editor Max Souza, for very helpful and\r\ndetailed comments and suggestions that significantly helped us to improve the manuscript. This project has\r\nreceived funding from the European Union’s Seventh Framework Programme for research, technological\r\ndevelopment and demonstration under Grant Agreement 618091 Speed of Adaptation in Population Genet-\r\nics and Evolutionary Computation (SAGE) and the European Research Council (ERC) Grant No. 250152\r\n(SN), from the Scientific Grant Agency of the Slovak Republic under the Grant 1/0459/13 and by the Slovak\r\nResearch and Development Agency under the Contract No. APVV-14-0378 (RK). RK would also like to\r\nthank IST Austria for its hospitality during the work on this project.","quality_controlled":"1","department":[{"_id":"NiBa"}],"doi":"10.1007/s11538-016-0244-3","_id":"1191","page":"525-559","intvolume":"        79","title":"Existence of traveling waves for the generalized F–KPP equation","status":"public","type":"journal_article","citation":{"ieee":"R. Kollár and S. Novak, “Existence of traveling waves for the generalized F–KPP equation,” <i>Bulletin of Mathematical Biology</i>, vol. 79, no. 3. Springer, pp. 525–559, 2017.","ista":"Kollár R, Novak S. 2017. Existence of traveling waves for the generalized F–KPP equation. Bulletin of Mathematical Biology. 79(3), 525–559.","short":"R. Kollár, S. Novak, Bulletin of Mathematical Biology 79 (2017) 525–559.","ama":"Kollár R, Novak S. Existence of traveling waves for the generalized F–KPP equation. <i>Bulletin of Mathematical Biology</i>. 2017;79(3):525-559. doi:<a href=\"https://doi.org/10.1007/s11538-016-0244-3\">10.1007/s11538-016-0244-3</a>","chicago":"Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the Generalized F–KPP Equation.” <i>Bulletin of Mathematical Biology</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s11538-016-0244-3\">https://doi.org/10.1007/s11538-016-0244-3</a>.","apa":"Kollár, R., &#38; Novak, S. (2017). Existence of traveling waves for the generalized F–KPP equation. <i>Bulletin of Mathematical Biology</i>. Springer. <a href=\"https://doi.org/10.1007/s11538-016-0244-3\">https://doi.org/10.1007/s11538-016-0244-3</a>","mla":"Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the Generalized F–KPP Equation.” <i>Bulletin of Mathematical Biology</i>, vol. 79, no. 3, Springer, 2017, pp. 525–59, doi:<a href=\"https://doi.org/10.1007/s11538-016-0244-3\">10.1007/s11538-016-0244-3</a>."},"ec_funded":1,"publication":"Bulletin of Mathematical Biology","day":"01","year":"2017","language":[{"iso":"eng"}],"author":[{"full_name":"Kollár, Richard","last_name":"Kollár","first_name":"Richard"},{"id":"461468AE-F248-11E8-B48F-1D18A9856A87","full_name":"Novak, Sebastian","first_name":"Sebastian","last_name":"Novak","orcid":"0000-0002-2519-824X"}],"volume":79,"abstract":[{"text":"Variation in genotypes may be responsible for differences in dispersal rates, directional biases, and growth rates of individuals. These traits may favor certain genotypes and enhance their spatiotemporal spreading into areas occupied by the less advantageous genotypes. We study how these factors influence the speed of spreading in the case of two competing genotypes under the assumption that spatial variation of the total population is small compared to the spatial variation of the frequencies of the genotypes in the population. In that case, the dynamics of the frequency of one of the genotypes is approximately described by a generalized Fisher–Kolmogorov–Petrovskii–Piskunov (F–KPP) equation. This generalized F–KPP equation with (nonlinear) frequency-dependent diffusion and advection terms admits traveling wave solutions that characterize the invasion of the dominant genotype. Our existence results generalize the classical theory for traveling waves for the F–KPP with constant coefficients. Moreover, in the particular case of the quadratic (monostable) nonlinear growth–decay rate in the generalized F–KPP we study in detail the influence of the variance in diffusion and mean displacement rates of the two genotypes on the minimal wave propagation speed.","lang":"eng"}],"date_published":"2017-03-01T00:00:00Z","issue":"3","date_created":"2018-12-11T11:50:38Z","project":[{"_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","grant_number":"618091","call_identifier":"FP7"},{"call_identifier":"FP7","grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation","_id":"25B07788-B435-11E9-9278-68D0E5697425"}],"scopus_import":1,"publisher":"Springer","main_file_link":[{"url":"https://arxiv.org/abs/1607.00944","open_access":"1"}]},{"status":"public","type":"conference","title":"Even delta-matroids and the complexity of planar Boolean CSPs","isi":1,"citation":{"apa":"Kazda, A., Kolmogorov, V., &#38; Rolinek, M. (2017). Even delta-matroids and the complexity of planar Boolean CSPs (pp. 307–326). Presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain: SIAM. <a href=\"https://doi.org/10.1137/1.9781611974782.20\">https://doi.org/10.1137/1.9781611974782.20</a>","mla":"Kazda, Alexandr, et al. <i>Even Delta-Matroids and the Complexity of Planar Boolean CSPs</i>. SIAM, 2017, pp. 307–26, doi:<a href=\"https://doi.org/10.1137/1.9781611974782.20\">10.1137/1.9781611974782.20</a>.","chicago":"Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs,” 307–26. SIAM, 2017. <a href=\"https://doi.org/10.1137/1.9781611974782.20\">https://doi.org/10.1137/1.9781611974782.20</a>.","ama":"Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar Boolean CSPs. In: SIAM; 2017:307-326. doi:<a href=\"https://doi.org/10.1137/1.9781611974782.20\">10.1137/1.9781611974782.20</a>","short":"A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326.","ieee":"A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar Boolean CSPs,” presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain, 2017, pp. 307–326.","ista":"Kazda A, Kolmogorov V, Rolinek M. 2017. Even delta-matroids and the complexity of planar Boolean CSPs. SODA: Symposium on Discrete Algorithms, 307–326."},"article_processing_charge":"No","department":[{"_id":"VlKo"}],"quality_controlled":"1","_id":"1192","page":"307 - 326","doi":"10.1137/1.9781611974782.20","external_id":{"isi":["000426965800020"]},"date_updated":"2023-09-20T11:20:26Z","publication_identifier":{"isbn":["978-161197478-2"]},"oa":1,"publication_status":"published","conference":{"end_date":"2017-01019","name":"SODA: Symposium on Discrete Algorithms","start_date":"2017-01-16","location":"Barcelona, Spain"},"related_material":{"record":[{"status":"public","id":"6032","relation":"later_version"}]},"publist_id":"6159","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","month":"01","oa_version":"Submitted Version","publisher":"SIAM","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.03124"}],"project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160","call_identifier":"FP7"}],"date_created":"2018-12-11T11:50:38Z","abstract":[{"text":"The main result of this paper is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all constraints are even Δ-matroid relations (represented by lists of tuples). As a consequence of this, we settle the complexity classification of planar Boolean CSPs started by Dvorak and Kupec. Knowing that edge CSP is tractable for even Δ-matroid constraints allows us to extend the tractability result to a larger class of Δ-matroids that includes many classes that were known to be tractable before, namely co-independent, compact, local and binary.","lang":"eng"}],"date_published":"2017-01-01T00:00:00Z","author":[{"first_name":"Alexandr","last_name":"Kazda","full_name":"Kazda, Alexandr","id":"3B32BAA8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kolmogorov","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Michal","last_name":"Rolinek","full_name":"Rolinek, Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87"}],"ec_funded":1,"day":"01","language":[{"iso":"eng"}],"year":"2017"},{"external_id":{"isi":["000408311200013"]},"doi":"10.1145/3009837.3009873","intvolume":"        52","_id":"1194","page":"145 - 160","quality_controlled":"1","department":[{"_id":"KrCh"}],"article_processing_charge":"No","citation":{"ista":"Chatterjee K, Novotný P, Zikelic D. 2017. Stochastic invariants for probabilistic termination. POPL: Principles of Programming Languages, ACM SIGPLAN Notices, vol. 52, 145–160.","ieee":"K. Chatterjee, P. Novotný, and D. Zikelic, “Stochastic invariants for probabilistic termination,” presented at the POPL: Principles of Programming Languages, Paris, France, 2017, vol. 52, no. 1, pp. 145–160.","short":"K. Chatterjee, P. Novotný, D. Zikelic, in:, ACM, 2017, pp. 145–160.","chicago":"Chatterjee, Krishnendu, Petr Novotný, and Djordje Zikelic. “Stochastic Invariants for Probabilistic Termination,” 52:145–60. ACM, 2017. <a href=\"https://doi.org/10.1145/3009837.3009873\">https://doi.org/10.1145/3009837.3009873</a>.","ama":"Chatterjee K, Novotný P, Zikelic D. Stochastic invariants for probabilistic termination. In: Vol 52. ACM; 2017:145-160. doi:<a href=\"https://doi.org/10.1145/3009837.3009873\">10.1145/3009837.3009873</a>","apa":"Chatterjee, K., Novotný, P., &#38; Zikelic, D. (2017). Stochastic invariants for probabilistic termination (Vol. 52, pp. 145–160). Presented at the POPL: Principles of Programming Languages, Paris, France: ACM. <a href=\"https://doi.org/10.1145/3009837.3009873\">https://doi.org/10.1145/3009837.3009873</a>","mla":"Chatterjee, Krishnendu, et al. <i>Stochastic Invariants for Probabilistic Termination</i>. Vol. 52, no. 1, ACM, 2017, pp. 145–60, doi:<a href=\"https://doi.org/10.1145/3009837.3009873\">10.1145/3009837.3009873</a>."},"isi":1,"title":"Stochastic invariants for probabilistic termination","type":"conference","status":"public","oa_version":"Submitted Version","month":"01","related_material":{"record":[{"id":"14539","relation":"dissertation_contains","status":"public"}]},"publist_id":"6157","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","conference":{"location":"Paris, France","start_date":"2017-01-15","end_date":"2017-01-21","name":"POPL: Principles of Programming Languages"},"oa":1,"publication_status":"published","publication_identifier":{"issn":["07308566"]},"date_updated":"2025-07-14T09:09:58Z","alternative_title":["ACM SIGPLAN Notices"],"date_created":"2018-12-11T11:50:39Z","project":[{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734"}],"main_file_link":[{"url":"https://arxiv.org/abs/1611.01063","open_access":"1"}],"publisher":"ACM","scopus_import":"1","language":[{"iso":"eng"}],"year":"2017","day":"01","ec_funded":1,"issue":"1","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotny, Petr","first_name":"Petr","last_name":"Novotny"},{"first_name":"Djordje","last_name":"Zikelic","full_name":"Zikelic, Djordje"}],"date_published":"2017-01-01T00:00:00Z","volume":52,"abstract":[{"text":"Termination is one of the basic liveness properties, and we study the termination problem for probabilistic programs with real-valued variables. Previous works focused on the qualitative problem that asks whether an input program terminates with probability~1 (almost-sure termination). A powerful approach for this qualitative problem is the notion of ranking supermartingales with respect to a given set of invariants. The quantitative problem (probabilistic termination) asks for bounds on the termination probability. A fundamental and conceptual drawback of the existing approaches to address probabilistic termination is that even though the supermartingales consider the probabilistic behavior of the programs, the invariants are obtained completely ignoring the probabilistic aspect. In this work we address the probabilistic termination problem for linear-arithmetic probabilistic programs with nondeterminism. We define the notion of {\\em stochastic invariants}, which are constraints along with a probability bound that the constraints hold. We introduce a concept of {\\em repulsing supermartingales}. First, we show that repulsing supermartingales can be used to obtain bounds on the probability of the stochastic invariants. Second, we show the effectiveness of repulsing supermartingales in the following three ways: (1)~With a combination of ranking and repulsing supermartingales we can compute lower bounds on the probability of termination; (2)~repulsing supermartingales provide witnesses for refutation of almost-sure termination; and (3)~with a combination of ranking and repulsing supermartingales we can establish persistence properties of probabilistic programs. We also present results on related computational problems and an experimental evaluation of our approach on academic examples. ","lang":"eng"}]},{"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211"}],"date_created":"2018-12-11T11:50:39Z","publisher":"Elsevier","scopus_import":"1","publication":"Nonlinear Analysis: Hybrid Systems","year":"2017","language":[{"iso":"eng"}],"day":"01","ec_funded":1,"author":[{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jan","last_name":"Otop","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2017-02-01T00:00:00Z","volume":23,"abstract":[{"lang":"eng","text":"We define the . model-measuring problem: given a model . M and specification . ϕ, what is the maximal distance . ρ such that all models . M' within distance . ρ from . M satisfy (or violate) . ϕ. The model-measuring problem presupposes a distance function on models. We concentrate on . automatic distance functions, which are defined by weighted automata. The model-measuring problem subsumes several generalizations of the classical model-checking problem, in particular, quantitative model-checking problems that measure the degree of satisfaction of a specification; robustness problems that measure how much a model can be perturbed without violating the specification; and parameter synthesis for hybrid systems. We show that for automatic distance functions, and (a) . ω-regular linear-time, (b) . ω-regular branching-time, and (c) hybrid specifications, the model-measuring problem can be solved.We use automata-theoretic model-checking methods for model measuring, replacing the emptiness question for word, tree, and hybrid automata by the . optimal-value question for the weighted versions of these automata. For automata over words and trees, we consider weighted automata that accumulate weights by maximizing, summing, discounting, and limit averaging. For hybrid automata, we consider monotonic (parametric) hybrid automata, a hybrid counterpart of (discrete) weighted automata.We give several examples of using the model-measuring problem to compute various notions of robustness and quantitative satisfaction for temporal specifications. Further, we propose the modeling framework for model measuring to ease the specification and reduce the likelihood of errors in modeling.Finally, we present a variant of the model-measuring problem, called the . model-repair problem. The model-repair problem applies to models that do not satisfy the specification; it can be used to derive restrictions, under which the model satisfies the specification, i.e., to repair the model."}],"external_id":{"isi":["000390637000011"]},"doi":"10.1016/j.nahs.2016.09.001","intvolume":"        23","_id":"1196","page":"166 - 190","quality_controlled":"1","acknowledgement":"This research was supported in part by the European Research Council (ERC) under grant 267989 (QUAREM), by the Austrian Science Fund1 (FWF) under grants S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), and by the National Science Centre (NCN), Poland under grant 2014/15/D/ST6/04543.\r\nA Technical Report of this article is available via: https://repository.ist.ac.at/171/","department":[{"_id":"ToHe"}],"article_processing_charge":"No","citation":{"apa":"Henzinger, T. A., &#38; Otop, J. (2017). Model measuring for discrete and hybrid systems. <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.nahs.2016.09.001\">https://doi.org/10.1016/j.nahs.2016.09.001</a>","mla":"Henzinger, Thomas A., and Jan Otop. “Model Measuring for Discrete and Hybrid Systems.” <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 23, Elsevier, 2017, pp. 166–90, doi:<a href=\"https://doi.org/10.1016/j.nahs.2016.09.001\">10.1016/j.nahs.2016.09.001</a>.","short":"T.A. Henzinger, J. Otop, Nonlinear Analysis: Hybrid Systems 23 (2017) 166–190.","chicago":"Henzinger, Thomas A, and Jan Otop. “Model Measuring for Discrete and Hybrid Systems.” <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.nahs.2016.09.001\">https://doi.org/10.1016/j.nahs.2016.09.001</a>.","ama":"Henzinger TA, Otop J. Model measuring for discrete and hybrid systems. <i>Nonlinear Analysis: Hybrid Systems</i>. 2017;23:166-190. doi:<a href=\"https://doi.org/10.1016/j.nahs.2016.09.001\">10.1016/j.nahs.2016.09.001</a>","ieee":"T. A. Henzinger and J. Otop, “Model measuring for discrete and hybrid systems,” <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 23. Elsevier, pp. 166–190, 2017.","ista":"Henzinger TA, Otop J. 2017. Model measuring for discrete and hybrid systems. Nonlinear Analysis: Hybrid Systems. 23, 166–190."},"isi":1,"title":"Model measuring for discrete and hybrid systems","type":"journal_article","status":"public","oa_version":"None","month":"02","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"6154","publication_status":"published","date_updated":"2023-09-20T11:18:50Z"},{"date_created":"2018-12-11T11:50:40Z","project":[{"name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","_id":"25C878CE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P27533_N27"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"scopus_import":"1","publisher":"Springer","file":[{"creator":"system","date_created":"2018-12-12T10:17:40Z","checksum":"c0c835def162c1bc52f978fad26e3c2f","relation":"main_file","file_id":"5296","file_name":"IST-2016-723-v1+1_s11005-016-0915-x.pdf","access_level":"open_access","file_size":587207,"date_updated":"2020-07-14T12:44:38Z","content_type":"application/pdf"}],"year":"2017","language":[{"iso":"eng"}],"day":"01","publication":"Letters in Mathematical Physics","date_published":"2017-03-01T00:00:00Z","abstract":[{"text":"We consider a model of fermions interacting via point interactions, defined via a certain weighted Dirichlet form. While for two particles the interaction corresponds to infinite scattering length, the presence of further particles effectively decreases the interaction strength. We show that the model becomes trivial in the thermodynamic limit, in the sense that the free energy density at any given particle density and temperature agrees with the corresponding expression for non-interacting particles.","lang":"eng"}],"volume":107,"author":[{"last_name":"Moser","first_name":"Thomas","id":"2B5FC9A4-F248-11E8-B48F-1D18A9856A87","full_name":"Moser, Thomas"},{"last_name":"Seiringer","first_name":"Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert"}],"issue":"3","file_date_updated":"2020-07-14T12:44:38Z","department":[{"_id":"RoSe"}],"quality_controlled":"1","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). ","intvolume":"       107","page":" 533 - 552","_id":"1198","external_id":{"isi":["000394280200007"]},"doi":"10.1007/s11005-016-0915-x","pubrep_id":"723","status":"public","type":"journal_article","title":"Triviality of a model of particles with point interactions in the thermodynamic limit","tmp":{"short":"CC BY (4.0)","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)"},"isi":1,"citation":{"ista":"Moser T, Seiringer R. 2017. Triviality of a model of particles with point interactions in the thermodynamic limit. Letters in Mathematical Physics. 107(3), 533–552.","ieee":"T. Moser and R. Seiringer, “Triviality of a model of particles with point interactions in the thermodynamic limit,” <i>Letters in Mathematical Physics</i>, vol. 107, no. 3. Springer, pp. 533–552, 2017.","ama":"Moser T, Seiringer R. Triviality of a model of particles with point interactions in the thermodynamic limit. <i>Letters in Mathematical Physics</i>. 2017;107(3):533-552. doi:<a href=\"https://doi.org/10.1007/s11005-016-0915-x\">10.1007/s11005-016-0915-x</a>","short":"T. Moser, R. Seiringer, Letters in Mathematical Physics 107 (2017) 533–552.","chicago":"Moser, Thomas, and Robert Seiringer. “Triviality of a Model of Particles with Point Interactions in the Thermodynamic Limit.” <i>Letters in Mathematical Physics</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s11005-016-0915-x\">https://doi.org/10.1007/s11005-016-0915-x</a>.","mla":"Moser, Thomas, and Robert Seiringer. “Triviality of a Model of Particles with Point Interactions in the Thermodynamic Limit.” <i>Letters in Mathematical Physics</i>, vol. 107, no. 3, Springer, 2017, pp. 533–52, doi:<a href=\"https://doi.org/10.1007/s11005-016-0915-x\">10.1007/s11005-016-0915-x</a>.","apa":"Moser, T., &#38; Seiringer, R. (2017). Triviality of a model of particles with point interactions in the thermodynamic limit. <i>Letters in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s11005-016-0915-x\">https://doi.org/10.1007/s11005-016-0915-x</a>"},"article_processing_charge":"Yes (via OA deal)","publication_identifier":{"issn":["03779017"]},"ddc":["510","539"],"date_updated":"2023-09-20T11:18:13Z","oa":1,"publication_status":"published","publist_id":"6152","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"52"}]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","month":"03","has_accepted_license":"1"},{"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5176114/"}],"publisher":"Nature Publishing Group","date_created":"2018-12-11T11:50:40Z","project":[{"_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","call_identifier":"FP7"}],"author":[{"orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2017-01-01T00:00:00Z","volume":118,"abstract":[{"lang":"eng","text":"Much of quantitative genetics is based on the ‘infinitesimal model’, under which selection has a negligible effect on the genetic variance. This is typically justified by assuming a very large number of loci with additive effects. However, it applies even when genes interact, provided that the number of loci is large enough that selection on each of them is weak relative to random drift. In the long term, directional selection will change allele frequencies, but even then, the effects of epistasis on the ultimate change in trait mean due to selection may be modest. Stabilising selection can maintain many traits close to their optima, even when the underlying alleles are weakly selected. However, the number of traits that can be optimised is apparently limited to ~4Ne by the ‘drift load’, and this is hard to reconcile with the apparent complexity of many organisms. Just as for the mutation load, this limit can be evaded by a particular form of negative epistasis. A more robust limit is set by the variance in reproductive success. This suggests that selection accumulates information most efficiently in the infinitesimal regime, when selection on individual alleles is weak, and comparable with random drift. A review of evidence on selection strength suggests that although most variance in fitness may be because of alleles with large Nes, substantial amounts of adaptation may be because of alleles in the infinitesimal regime, in which epistasis has modest effects."}],"ec_funded":1,"publication":"Heredity","language":[{"iso":"eng"}],"year":"2017","day":"01","title":"How does epistasis influence the response to selection?","type":"journal_article","status":"public","citation":{"apa":"Barton, N. H. (2017). How does epistasis influence the response to selection? <i>Heredity</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/hdy.2016.109\">https://doi.org/10.1038/hdy.2016.109</a>","mla":"Barton, Nicholas H. “How Does Epistasis Influence the Response to Selection?” <i>Heredity</i>, vol. 118, Nature Publishing Group, 2017, pp. 96–109, doi:<a href=\"https://doi.org/10.1038/hdy.2016.109\">10.1038/hdy.2016.109</a>.","short":"N.H. Barton, Heredity 118 (2017) 96–109.","chicago":"Barton, Nicholas H. “How Does Epistasis Influence the Response to Selection?” <i>Heredity</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/hdy.2016.109\">https://doi.org/10.1038/hdy.2016.109</a>.","ama":"Barton NH. How does epistasis influence the response to selection? <i>Heredity</i>. 2017;118:96-109. doi:<a href=\"https://doi.org/10.1038/hdy.2016.109\">10.1038/hdy.2016.109</a>","ieee":"N. H. Barton, “How does epistasis influence the response to selection?,” <i>Heredity</i>, vol. 118. Nature Publishing Group, pp. 96–109, 2017.","ista":"Barton NH. 2017. How does epistasis influence the response to selection? Heredity. 118, 96–109."},"article_processing_charge":"No","isi":1,"quality_controlled":"1","department":[{"_id":"NiBa"}],"external_id":{"isi":["000392229100011"]},"doi":"10.1038/hdy.2016.109","intvolume":"       118","_id":"1199","page":"96 - 109","oa":1,"publication_status":"published","date_updated":"2025-05-28T11:42:47Z","oa_version":"Submitted Version","month":"01","publist_id":"6151","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","related_material":{"record":[{"id":"9710","relation":"research_data","status":"public"}]}},{"ec_funded":1,"day":"01","language":[{"iso":"eng"}],"year":"2017","publication":"Communications in Mathematical Physics","abstract":[{"text":"The eigenvalue distribution of the sum of two large Hermitian matrices, when one of them is conjugated by a Haar distributed unitary matrix, is asymptotically given by the free convolution of their spectral distributions. We prove that this convergence also holds locally in the bulk of the spectrum, down to the optimal scales larger than the eigenvalue spacing. The corresponding eigenvectors are fully delocalized. Similar results hold for the sum of two real symmetric matrices, when one is conjugated by Haar orthogonal matrix.","lang":"eng"}],"volume":349,"date_published":"2017-02-01T00:00:00Z","author":[{"id":"442E6A6C-F248-11E8-B48F-1D18A9856A87","full_name":"Bao, Zhigang","last_name":"Bao","first_name":"Zhigang","orcid":"0000-0003-3036-1475"},{"orcid":"0000-0001-5366-9603","first_name":"László","last_name":"Erdös","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-0954-3231","last_name":"Schnelli","first_name":"Kevin","full_name":"Schnelli, Kevin","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87"}],"issue":"3","file_date_updated":"2020-07-14T12:44:39Z","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","call_identifier":"FP7"}],"date_created":"2018-12-11T11:50:43Z","scopus_import":"1","publisher":"Springer","file":[{"checksum":"ddff79154c3daf27237de5383b1264a9","relation":"main_file","date_created":"2018-12-12T10:14:47Z","creator":"system","file_id":"5102","file_size":1033743,"access_level":"open_access","file_name":"IST-2016-722-v1+1_s00220-016-2805-6.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:44:39Z"}],"ddc":["530"],"date_updated":"2023-09-20T11:16:57Z","publication_identifier":{"issn":["00103616"]},"publication_status":"published","oa":1,"publist_id":"6141","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","month":"02","has_accepted_license":"1","department":[{"_id":"LaEr"}],"quality_controlled":"1","page":"947 - 990","_id":"1207","intvolume":"       349","doi":"10.1007/s00220-016-2805-6","external_id":{"isi":["000393696700005"]},"type":"journal_article","status":"public","pubrep_id":"722","title":"Local law of addition of random matrices on optimal scale","tmp":{"short":"CC BY (4.0)","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)"},"isi":1,"citation":{"mla":"Bao, Zhigang, et al. “Local Law of Addition of Random Matrices on Optimal Scale.” <i>Communications in Mathematical Physics</i>, vol. 349, no. 3, Springer, 2017, pp. 947–90, doi:<a href=\"https://doi.org/10.1007/s00220-016-2805-6\">10.1007/s00220-016-2805-6</a>.","apa":"Bao, Z., Erdös, L., &#38; Schnelli, K. (2017). Local law of addition of random matrices on optimal scale. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-016-2805-6\">https://doi.org/10.1007/s00220-016-2805-6</a>","short":"Z. Bao, L. Erdös, K. Schnelli, Communications in Mathematical Physics 349 (2017) 947–990.","ama":"Bao Z, Erdös L, Schnelli K. Local law of addition of random matrices on optimal scale. <i>Communications in Mathematical Physics</i>. 2017;349(3):947-990. doi:<a href=\"https://doi.org/10.1007/s00220-016-2805-6\">10.1007/s00220-016-2805-6</a>","chicago":"Bao, Zhigang, László Erdös, and Kevin Schnelli. “Local Law of Addition of Random Matrices on Optimal Scale.” <i>Communications in Mathematical Physics</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s00220-016-2805-6\">https://doi.org/10.1007/s00220-016-2805-6</a>.","ieee":"Z. Bao, L. Erdös, and K. Schnelli, “Local law of addition of random matrices on optimal scale,” <i>Communications in Mathematical Physics</i>, vol. 349, no. 3. Springer, pp. 947–990, 2017.","ista":"Bao Z, Erdös L, Schnelli K. 2017. Local law of addition of random matrices on optimal scale. Communications in Mathematical Physics. 349(3), 947–990."},"article_processing_charge":"Yes (via OA deal)"},{"quality_controlled":"1","department":[{"_id":"CaUh"}],"doi":"10.1111/rssb.12217","external_id":{"isi":["000411712300012"]},"_id":"1208","page":"1269 - 1292","intvolume":"        79","title":"Maximum likelihood estimation for linear Gaussian covariance models","status":"public","type":"journal_article","citation":{"short":"P. Zwiernik, C. Uhler, D. Richards, Journal of the Royal Statistical Society. Series B: Statistical Methodology 79 (2017) 1269–1292.","chicago":"Zwiernik, Piotr, Caroline Uhler, and Donald Richards. “Maximum Likelihood Estimation for Linear Gaussian Covariance Models.” <i>Journal of the Royal Statistical Society. Series B: Statistical Methodology</i>. Wiley-Blackwell, 2017. <a href=\"https://doi.org/10.1111/rssb.12217\">https://doi.org/10.1111/rssb.12217</a>.","ama":"Zwiernik P, Uhler C, Richards D. Maximum likelihood estimation for linear Gaussian covariance models. <i>Journal of the Royal Statistical Society Series B: Statistical Methodology</i>. 2017;79(4):1269-1292. doi:<a href=\"https://doi.org/10.1111/rssb.12217\">10.1111/rssb.12217</a>","apa":"Zwiernik, P., Uhler, C., &#38; Richards, D. (2017). Maximum likelihood estimation for linear Gaussian covariance models. <i>Journal of the Royal Statistical Society. Series B: Statistical Methodology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/rssb.12217\">https://doi.org/10.1111/rssb.12217</a>","mla":"Zwiernik, Piotr, et al. “Maximum Likelihood Estimation for Linear Gaussian Covariance Models.” <i>Journal of the Royal Statistical Society. Series B: Statistical Methodology</i>, vol. 79, no. 4, Wiley-Blackwell, 2017, pp. 1269–92, doi:<a href=\"https://doi.org/10.1111/rssb.12217\">10.1111/rssb.12217</a>.","ieee":"P. Zwiernik, C. Uhler, and D. Richards, “Maximum likelihood estimation for linear Gaussian covariance models,” <i>Journal of the Royal Statistical Society. Series B: Statistical Methodology</i>, vol. 79, no. 4. Wiley-Blackwell, pp. 1269–1292, 2017.","ista":"Zwiernik P, Uhler C, Richards D. 2017. Maximum likelihood estimation for linear Gaussian covariance models. Journal of the Royal Statistical Society. Series B: Statistical Methodology. 79(4), 1269–1292."},"article_processing_charge":"No","isi":1,"oa":1,"publication_status":"published","date_updated":"2023-09-20T11:17:21Z","publication_identifier":{"issn":["13697412"]},"month":"09","oa_version":"Submitted Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"6142","project":[{"_id":"2530CA10-B435-11E9-9278-68D0E5697425","name":"Gaussian Graphical Models: Theory and Applications","grant_number":"Y 903-N35","call_identifier":"FWF"}],"date_created":"2018-12-11T11:50:43Z","scopus_import":"1","publisher":"Wiley-Blackwell","main_file_link":[{"url":"https://arxiv.org/abs/1408.5604","open_access":"1"}],"publication":"Journal of the Royal Statistical Society. Series B: Statistical Methodology","day":"01","language":[{"iso":"eng"}],"year":"2017","author":[{"full_name":"Zwiernik, Piotr","last_name":"Zwiernik","first_name":"Piotr"},{"orcid":"0000-0002-7008-0216","last_name":"Uhler","first_name":"Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","full_name":"Uhler, Caroline"},{"first_name":"Donald","last_name":"Richards","full_name":"Richards, Donald"}],"abstract":[{"lang":"eng","text":"We study parameter estimation in linear Gaussian covariance models, which are p-dimensional Gaussian models with linear constraints on the covariance matrix. Maximum likelihood estimation for this class of models leads to a non-convex optimization problem which typically has many local maxima. Using recent results on the asymptotic distribution of extreme eigenvalues of the Wishart distribution, we provide sufficient conditions for any hill climbing method to converge to the global maximum. Although we are primarily interested in the case in which n≫p, the proofs of our results utilize large sample asymptotic theory under the scheme n/p→γ&gt;1. Remarkably, our numerical simulations indicate that our results remain valid for p as small as 2. An important consequence of this analysis is that, for sample sizes n≃14p, maximum likelihood estimation for linear Gaussian covariance models behaves as if it were a convex optimization problem. © 2016 The Royal Statistical Society and Blackwell Publishing Ltd."}],"volume":79,"date_published":"2017-09-01T00:00:00Z","issue":"4"},{"oa_version":"Submitted Version","month":"05","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"6136","oa":1,"publication_status":"published","date_updated":"2021-01-12T06:49:07Z","ddc":["530"],"has_accepted_license":"1","doi":"10.1007/s10955-016-1672-z","page":"636-655","_id":"1211","intvolume":"       167","acknowledgement":"This work was supported by the family of late G. Robinson, Jr. and NSF Grant DMS-1211827. ","quality_controlled":"1","department":[{"_id":"BjHo"}],"citation":{"apa":"Budanur, N. B., &#38; Cvitanović, P. (2017). Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. <i>Journal of Statistical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s10955-016-1672-z\">https://doi.org/10.1007/s10955-016-1672-z</a>","mla":"Budanur, Nazmi B., and Predrag Cvitanović. “Unstable Manifolds of Relative Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky System.” <i>Journal of Statistical Physics</i>, vol. 167, no. 3–4, Springer, 2017, pp. 636–55, doi:<a href=\"https://doi.org/10.1007/s10955-016-1672-z\">10.1007/s10955-016-1672-z</a>.","short":"N.B. Budanur, P. Cvitanović, Journal of Statistical Physics 167 (2017) 636–655.","chicago":"Budanur, Nazmi B, and Predrag Cvitanović. “Unstable Manifolds of Relative Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky System.” <i>Journal of Statistical Physics</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s10955-016-1672-z\">https://doi.org/10.1007/s10955-016-1672-z</a>.","ama":"Budanur NB, Cvitanović P. Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. <i>Journal of Statistical Physics</i>. 2017;167(3-4):636-655. doi:<a href=\"https://doi.org/10.1007/s10955-016-1672-z\">10.1007/s10955-016-1672-z</a>","ieee":"N. B. Budanur and P. Cvitanović, “Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system,” <i>Journal of Statistical Physics</i>, vol. 167, no. 3–4. Springer, pp. 636–655, 2017.","ista":"Budanur NB, Cvitanović P. 2017. Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal of Statistical Physics. 167(3–4), 636–655."},"title":"Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system","status":"public","type":"journal_article","pubrep_id":"782","publication":"Journal of Statistical Physics","day":"01","language":[{"iso":"eng"}],"year":"2017","file_date_updated":"2020-07-14T12:44:39Z","issue":"3-4","author":[{"id":"3EA1010E-F248-11E8-B48F-1D18A9856A87","full_name":"Budanur, Nazmi B","orcid":"0000-0003-0423-5010","first_name":"Nazmi B","last_name":"Budanur"},{"full_name":"Cvitanović, Predrag","last_name":"Cvitanović","first_name":"Predrag"}],"volume":167,"abstract":[{"lang":"eng","text":"Systems such as fluid flows in channels and pipes or the complex Ginzburg–Landau system, defined over periodic domains, exhibit both continuous symmetries, translational and rotational, as well as discrete symmetries under spatial reflections or complex conjugation. The simplest, and very common symmetry of this type is the equivariance of the defining equations under the orthogonal group O(2). We formulate a novel symmetry reduction scheme for such systems by combining the method of slices with invariant polynomial methods, and show how it works by applying it to the Kuramoto–Sivashinsky system in one spatial dimension. As an example, we track a relative periodic orbit through a sequence of bifurcations to the onset of chaos. Within the symmetry-reduced state space we are able to compute and visualize the unstable manifolds of relative periodic orbits, their torus bifurcations, a transition to chaos via torus breakdown, and heteroclinic connections between various relative periodic orbits. It would be very hard to carry through such analysis in the full state space, without a symmetry reduction such as the one we present here."}],"date_published":"2017-05-01T00:00:00Z","date_created":"2018-12-11T11:50:44Z","publisher":"Springer","file":[{"file_size":2820207,"access_level":"open_access","file_name":"IST-2017-782-v1+1_BudCvi15.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:44:39Z","checksum":"3e971d09eb167761aa0888ed415b0056","relation":"main_file","creator":"system","date_created":"2018-12-12T10:18:01Z","file_id":"5319"}],"scopus_import":1},{"author":[{"full_name":"Baranova, Natalia","id":"38661662-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3086-9124","last_name":"Baranova","first_name":"Natalia"},{"id":"462D4284-F248-11E8-B48F-1D18A9856A87","full_name":"Loose, Martin","first_name":"Martin","last_name":"Loose","orcid":"0000-0001-7309-9724"}],"date_published":"2017-12-01T00:00:00Z","abstract":[{"lang":"eng","text":"Bacterial cytokinesis is commonly initiated by the Z-ring, a dynamic cytoskeletal structure that assembles at the site of division. Its primary component is FtsZ, a tubulin-like GTPase, that like its eukaryotic relative forms protein filaments in the presence of GTP. Since the discovery of the Z-ring 25 years ago, various models for the role of FtsZ have been suggested. However, important information about the architecture and dynamics of FtsZ filaments during cytokinesis is still missing. One reason for this lack of knowledge has been the small size of bacteria, which has made it difficult to resolve the orientation and dynamics of individual FtsZ filaments in the Z-ring. While superresolution microscopy experiments have helped to gain more information about the organization of the Z-ring in the dividing cell, they were not yet able to elucidate a mechanism of how FtsZ filaments reorganize during assembly and disassembly of the Z-ring. In this chapter, we explain how to use an in vitro reconstitution approach to investigate the self-organization of FtsZ filaments recruited to a biomimetic lipid bilayer by its membrane anchor FtsA. We show how to perform single-molecule experiments to study the behavior of individual FtsZ monomers during the constant reorganization of the FtsZ-FtsA filament network. We describe how to analyze the dynamics of single molecules and explain why this information can help to shed light onto possible mechanism of Z-ring constriction. We believe that similar experimental approaches will be useful to study the mechanism of membrane-based polymerization of other cytoskeletal systems, not only from prokaryotic but also eukaryotic origin."}],"volume":137,"ec_funded":1,"publication":"Cytokinesis","year":"2017","language":[{"iso":"eng"}],"day":"01","scopus_import":"1","publisher":"Academic Press","project":[{"name":"Synthesis of bacterial cell wall","_id":"2596EAB6-B435-11E9-9278-68D0E5697425","grant_number":"ALTF 2015-1163"},{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7"}],"date_created":"2018-12-11T11:50:45Z","alternative_title":["Methods in Cell Biology"],"publication_status":"published","publication_identifier":{"issn":["0091679X"]},"date_updated":"2023-09-20T11:16:30Z","month":"12","oa_version":"None","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"6134","title":"Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers","type":"book_chapter","status":"public","citation":{"mla":"Baranova, Natalia S., and Martin Loose. “Single-Molecule Measurements to Study Polymerization Dynamics of FtsZ-FtsA Copolymers.” <i>Cytokinesis</i>, edited by Arnaud  Echard, vol. 137, Academic Press, 2017, pp. 355–70, doi:<a href=\"https://doi.org/10.1016/bs.mcb.2016.03.036\">10.1016/bs.mcb.2016.03.036</a>.","apa":"Baranova, N. S., &#38; Loose, M. (2017). Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers. In A. Echard (Ed.), <i>Cytokinesis</i> (Vol. 137, pp. 355–370). Academic Press. <a href=\"https://doi.org/10.1016/bs.mcb.2016.03.036\">https://doi.org/10.1016/bs.mcb.2016.03.036</a>","short":"N.S. Baranova, M. Loose, in:, A. Echard (Ed.), Cytokinesis, Academic Press, 2017, pp. 355–370.","ama":"Baranova NS, Loose M. Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers. In: Echard A, ed. <i>Cytokinesis</i>. Vol 137. Academic Press; 2017:355-370. doi:<a href=\"https://doi.org/10.1016/bs.mcb.2016.03.036\">10.1016/bs.mcb.2016.03.036</a>","chicago":"Baranova, Natalia S., and Martin Loose. “Single-Molecule Measurements to Study Polymerization Dynamics of FtsZ-FtsA Copolymers.” In <i>Cytokinesis</i>, edited by Arnaud  Echard, 137:355–70. Academic Press, 2017. <a href=\"https://doi.org/10.1016/bs.mcb.2016.03.036\">https://doi.org/10.1016/bs.mcb.2016.03.036</a>.","ieee":"N. S. Baranova and M. Loose, “Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers,” in <i>Cytokinesis</i>, vol. 137, A. Echard, Ed. Academic Press, 2017, pp. 355–370.","ista":"Baranova NS, Loose M. 2017.Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers. In: Cytokinesis. Methods in Cell Biology, vol. 137, 355–370."},"article_processing_charge":"No","acknowledged_ssus":[{"_id":"Bio"}],"isi":1,"quality_controlled":"1","acknowledgement":"Natalia Baranova is supported by an EMBO Long-Term Fellowship (EMBO ALTF 1163-2015) and Martin Loose by an ERC Starting Grant (ERCStG-2015-SelfOrganiCell).","editor":[{"first_name":"Arnaud ","last_name":"Echard","full_name":"Echard, Arnaud "}],"department":[{"_id":"MaLo"}],"external_id":{"isi":["000403542900022"]},"doi":"10.1016/bs.mcb.2016.03.036","intvolume":"       137","page":"355 - 370","_id":"1213"},{"article_type":"original","date_created":"2023-01-16T09:18:05Z","pmid":1,"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7611288/","open_access":"1"}],"publisher":"Nature Research","scopus_import":"1","publication":"Nature Genetics","year":"2017","language":[{"iso":"eng"}],"day":"18","keyword":["Genetics"],"issue":"1","author":[{"last_name":"Walker","first_name":"James","full_name":"Walker, James"},{"last_name":"Gao","first_name":"Hongbo","full_name":"Gao, Hongbo"},{"last_name":"Zhang","first_name":"Jingyi","full_name":"Zhang, Jingyi"},{"first_name":"Billy","last_name":"Aldridge","full_name":"Aldridge, Billy"},{"full_name":"Vickers, Martin","first_name":"Martin","last_name":"Vickers"},{"full_name":"Higgins, James D.","first_name":"James D.","last_name":"Higgins"},{"orcid":"0000-0002-4008-1234","first_name":"Xiaoqi","last_name":"Feng","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","full_name":"Feng, Xiaoqi"}],"date_published":"2017-12-18T00:00:00Z","abstract":[{"lang":"eng","text":"DNA methylation regulates eukaryotic gene expression and is extensively reprogrammed during animal development. However, whether developmental methylation reprogramming during the sporophytic life cycle of flowering plants regulates genes is presently unknown. Here we report a distinctive gene-targeted RNA-directed DNA methylation (RdDM) activity in the Arabidopsis thaliana male sexual lineage that regulates gene expression in meiocytes. Loss of sexual-lineage-specific RdDM causes mis-splicing of the MPS1 gene (also known as PRD2), thereby disrupting meiosis. Our results establish a regulatory paradigm in which de novo methylation creates a cell-lineage-specific epigenetic signature that controls gene expression and contributes to cellular function in flowering plants."}],"volume":50,"external_id":{"pmid":["29255257"]},"doi":"10.1038/s41588-017-0008-5","intvolume":"        50","page":"130-137","_id":"12193","quality_controlled":"1","acknowledgement":"We thank Daniel Zilberman for intellectual contributions to this work and assistance with manuscript preparation. We also thank Caroline Dean, Kirsten Bomblies, Vinod Kumar, Siobhan Brady and Sophien Kamoun for comments on the manuscript, Hugh Dickinson and Josephine Hellberg for developing the meiocyte isolation method, Giles Oldroyd for the pGWB13-Bar vector, Elisa Fiume for the pMDC107-NTF vector, Matthew Hartley, Matthew Couchman and Tjelvar Sten Gunnar Olsson for bioinformatics support, and the John Innes Centre Bioimaging Facility (Elaine Barclay and Grant Calder) for their assistance with microscopy. This work was funded by a Biotechnology and Biological Sciences Research Council (BBSRC) David Phillips Fellowship (BBL0250431) to X.F., a BBSRC grant (BBM01973X1) to J.H., and a Sainsbury PhD Studentship to J.W.","department":[{"_id":"XiFe"}],"citation":{"chicago":"Walker, James, Hongbo Gao, Jingyi Zhang, Billy Aldridge, Martin Vickers, James D. Higgins, and Xiaoqi Feng. “Sexual-Lineage-Specific DNA Methylation Regulates Meiosis in Arabidopsis.” <i>Nature Genetics</i>. Nature Research, 2017. <a href=\"https://doi.org/10.1038/s41588-017-0008-5\">https://doi.org/10.1038/s41588-017-0008-5</a>.","short":"J. Walker, H. Gao, J. Zhang, B. Aldridge, M. Vickers, J.D. Higgins, X. Feng, Nature Genetics 50 (2017) 130–137.","ama":"Walker J, Gao H, Zhang J, et al. Sexual-lineage-specific DNA methylation regulates meiosis in Arabidopsis. <i>Nature Genetics</i>. 2017;50(1):130-137. doi:<a href=\"https://doi.org/10.1038/s41588-017-0008-5\">10.1038/s41588-017-0008-5</a>","mla":"Walker, James, et al. “Sexual-Lineage-Specific DNA Methylation Regulates Meiosis in Arabidopsis.” <i>Nature Genetics</i>, vol. 50, no. 1, Nature Research, 2017, pp. 130–37, doi:<a href=\"https://doi.org/10.1038/s41588-017-0008-5\">10.1038/s41588-017-0008-5</a>.","apa":"Walker, J., Gao, H., Zhang, J., Aldridge, B., Vickers, M., Higgins, J. D., &#38; Feng, X. (2017). Sexual-lineage-specific DNA methylation regulates meiosis in Arabidopsis. <i>Nature Genetics</i>. Nature Research. <a href=\"https://doi.org/10.1038/s41588-017-0008-5\">https://doi.org/10.1038/s41588-017-0008-5</a>","ieee":"J. Walker <i>et al.</i>, “Sexual-lineage-specific DNA methylation regulates meiosis in Arabidopsis,” <i>Nature Genetics</i>, vol. 50, no. 1. Nature Research, pp. 130–137, 2017.","ista":"Walker J, Gao H, Zhang J, Aldridge B, Vickers M, Higgins JD, Feng X. 2017. Sexual-lineage-specific DNA methylation regulates meiosis in Arabidopsis. Nature Genetics. 50(1), 130–137."},"article_processing_charge":"No","title":"Sexual-lineage-specific DNA methylation regulates meiosis in Arabidopsis","type":"journal_article","status":"public","month":"12","oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publication_status":"published","publication_identifier":{"issn":["1061-4036"],"eissn":["1546-1718"]},"date_updated":"2023-10-18T07:21:53Z"},{"oa":1,"publication_status":"published","date_updated":"2023-09-20T11:16:01Z","ddc":["616"],"oa_version":"Published Version","month":"01","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"6106","has_accepted_license":"1","quality_controlled":"1","acknowledgement":"This work was supported by grants of the Austrian Science Fund (FWF) P23585B09 to M.W. and F3506 to H.H.S. and the “Wiener Wissenschafts-, Forschungs- und Technologiefonds” (Vienna Science and Technology Fund; WWTF) CS15-033 to M.W.","department":[{"_id":"GaNo"}],"external_id":{"pmid":["27690184"],"isi":["000392487100005"]},"doi":"10.1111/ejn.13418","intvolume":"        45","page":"45 - 57","_id":"1228","tmp":{"short":"CC BY (4.0)","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)"},"title":"Are reprogrammed cells a useful tool for studying dopamine dysfunction in psychotic disorders? A review of the current evidence","pubrep_id":"738","type":"journal_article","status":"public","citation":{"ista":"Sauerzopf U, Sacco R, Novarino G, Niello M, Weidenauer A, Praschak Rieder N, Sitte H, Willeit M. 2017. Are reprogrammed cells a useful tool for studying dopamine dysfunction in psychotic disorders? A review of the current evidence. European Journal of Neuroscience. 45(1), 45–57.","ieee":"U. Sauerzopf <i>et al.</i>, “Are reprogrammed cells a useful tool for studying dopamine dysfunction in psychotic disorders? A review of the current evidence,” <i>European Journal of Neuroscience</i>, vol. 45, no. 1. Wiley-Blackwell, pp. 45–57, 2017.","ama":"Sauerzopf U, Sacco R, Novarino G, et al. Are reprogrammed cells a useful tool for studying dopamine dysfunction in psychotic disorders? A review of the current evidence. <i>European Journal of Neuroscience</i>. 2017;45(1):45-57. doi:<a href=\"https://doi.org/10.1111/ejn.13418\">10.1111/ejn.13418</a>","short":"U. Sauerzopf, R. Sacco, G. Novarino, M. Niello, A. Weidenauer, N. Praschak Rieder, H. Sitte, M. Willeit, European Journal of Neuroscience 45 (2017) 45–57.","chicago":"Sauerzopf, Ulrich, Roberto Sacco, Gaia Novarino, Marco Niello, Ana Weidenauer, Nicole Praschak Rieder, Harald Sitte, and Matthaeus Willeit. “Are Reprogrammed Cells a Useful Tool for Studying Dopamine Dysfunction in Psychotic Disorders? A Review of the Current Evidence.” <i>European Journal of Neuroscience</i>. Wiley-Blackwell, 2017. <a href=\"https://doi.org/10.1111/ejn.13418\">https://doi.org/10.1111/ejn.13418</a>.","mla":"Sauerzopf, Ulrich, et al. “Are Reprogrammed Cells a Useful Tool for Studying Dopamine Dysfunction in Psychotic Disorders? A Review of the Current Evidence.” <i>European Journal of Neuroscience</i>, vol. 45, no. 1, Wiley-Blackwell, 2017, pp. 45–57, doi:<a href=\"https://doi.org/10.1111/ejn.13418\">10.1111/ejn.13418</a>.","apa":"Sauerzopf, U., Sacco, R., Novarino, G., Niello, M., Weidenauer, A., Praschak Rieder, N., … Willeit, M. (2017). Are reprogrammed cells a useful tool for studying dopamine dysfunction in psychotic disorders? A review of the current evidence. <i>European Journal of Neuroscience</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/ejn.13418\">https://doi.org/10.1111/ejn.13418</a>"},"article_processing_charge":"No","isi":1,"publication":"European Journal of Neuroscience","language":[{"iso":"eng"}],"year":"2017","day":"01","author":[{"full_name":"Sauerzopf, Ulrich","first_name":"Ulrich","last_name":"Sauerzopf"},{"last_name":"Sacco","first_name":"Roberto","full_name":"Sacco, Roberto","id":"42C9F57E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Gaia","last_name":"Novarino","orcid":"0000-0002-7673-7178","full_name":"Novarino, Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Niello, Marco","first_name":"Marco","last_name":"Niello"},{"last_name":"Weidenauer","first_name":"Ana","full_name":"Weidenauer, Ana"},{"first_name":"Nicole","last_name":"Praschak Rieder","full_name":"Praschak Rieder, Nicole"},{"full_name":"Sitte, Harald","first_name":"Harald","last_name":"Sitte"},{"full_name":"Willeit, Matthaeus","last_name":"Willeit","first_name":"Matthaeus"}],"date_published":"2017-01-01T00:00:00Z","abstract":[{"text":"Since 2006, reprogrammed cells have increasingly been used as a biomedical research technique in addition to neuro-psychiatric methods. These rapidly evolving techniques allow for the generation of neuronal sub-populations, and have sparked interest not only in monogenetic neuro-psychiatric diseases, but also in poly-genetic and poly-aetiological disorders such as schizophrenia (SCZ) and bipolar disorder (BPD). This review provides a summary of 19 publications on reprogrammed adult somatic cells derived from patients with SCZ, and five publications using this technique in patients with BPD. As both disorders are complex and heterogeneous, there is a plurality of hypotheses to be tested in vitro. In SCZ, data on alterations of dopaminergic transmission in vitro are sparse, despite the great explanatory power of the so-called DA hypothesis of SCZ. Some findings correspond to perturbations of cell energy metabolism, and observations in reprogrammed cells suggest neuro-developmental alterations. Some studies also report on the efficacy of medicinal compounds to revert alterations observed in cellular models. However, due to the paucity of replication studies, no comprehensive conclusions can be drawn from studies using reprogrammed cells at the present time. In the future, findings from cell culture methods need to be integrated with clinical, epidemiological, pharmacological and imaging data in order to generate a more comprehensive picture of SCZ and BPD.","lang":"eng"}],"volume":45,"file_date_updated":"2020-07-14T12:44:39Z","issue":"1","article_type":"review","date_created":"2018-12-11T11:50:50Z","scopus_import":"1","pmid":1,"file":[{"file_name":"IST-2017-738-v1+1_Sauerzopf_et_al-2017-European_Journal_of_Neuroscience.pdf","access_level":"open_access","file_size":169145,"date_updated":"2020-07-14T12:44:39Z","content_type":"application/pdf","date_created":"2018-12-12T10:10:48Z","creator":"system","checksum":"c572cf02be8fbb7020cfcfb892182e4c","relation":"main_file","file_id":"4838"}],"publisher":"Wiley-Blackwell"},{"department":[{"_id":"ScienComp"}],"page":"28","_id":"12905","date_created":"2023-05-05T12:58:53Z","status":"public","type":"conference_abstract","title":"Scientific Computing at IST Austria","file":[{"success":1,"creator":"dernst","date_created":"2023-05-16T07:20:50Z","relation":"main_file","checksum":"7bcc499479d4f4c5ce6c0071c24ca6c6","file_id":"12969","file_name":"2017_AHPC_Schloegl.pdf","access_level":"open_access","file_size":1005486,"date_updated":"2023-05-16T07:20:50Z","content_type":"application/pdf"}],"publisher":"FSP Scientific Computing","citation":{"ieee":"A. Schlögl and J. Kiss, “Scientific Computing at IST Austria,” in <i>AHPC17 – Austrian HPC Meeting 2017</i>, Grundlsee, Austria, 2017, p. 28.","ista":"Schlögl A, Kiss J. 2017. Scientific Computing at IST Austria. AHPC17 – Austrian HPC Meeting 2017. AHPC: Austrian HPC Meeting, 28.","mla":"Schlögl, Alois, and Janos Kiss. “Scientific Computing at IST Austria.” <i>AHPC17 – Austrian HPC Meeting 2017</i>, FSP Scientific Computing, 2017, p. 28.","apa":"Schlögl, A., &#38; Kiss, J. (2017). Scientific Computing at IST Austria. In <i>AHPC17 – Austrian HPC Meeting 2017</i> (p. 28). Grundlsee, Austria: FSP Scientific Computing.","chicago":"Schlögl, Alois, and Janos Kiss. “Scientific Computing at IST Austria.” In <i>AHPC17 – Austrian HPC Meeting 2017</i>, 28. FSP Scientific Computing, 2017.","short":"A. Schlögl, J. Kiss, in:, AHPC17 – Austrian HPC Meeting 2017, FSP Scientific Computing, 2017, p. 28.","ama":"Schlögl A, Kiss J. Scientific Computing at IST Austria. In: <i>AHPC17 – Austrian HPC Meeting 2017</i>. FSP Scientific Computing; 2017:28."},"main_file_link":[{"url":"https://vsc.ac.at/fileadmin/user_upload/vsc/conferences/ahpc17/BOOKLET_AHPC17.pdf","open_access":"1"}],"article_processing_charge":"No","ddc":["000"],"date_updated":"2023-05-16T07:22:23Z","oa":1,"publication_status":"published","conference":{"start_date":"2017-03-01","name":"AHPC: Austrian HPC Meeting","end_date":"2017-03-03","location":"Grundlsee, Austria"},"day":"03","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2017","language":[{"iso":"eng"}],"publication":"AHPC17 – Austrian HPC Meeting 2017","oa_version":"Published Version","month":"03","date_published":"2017-03-03T00:00:00Z","author":[{"orcid":"0000-0002-5621-8100","last_name":"Schlögl","first_name":"Alois","full_name":"Schlögl, Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87"},{"id":"3D3A06F8-F248-11E8-B48F-1D18A9856A87","full_name":"Kiss, Janos","last_name":"Kiss","first_name":"Janos"}],"has_accepted_license":"1","file_date_updated":"2023-05-16T07:20:50Z"},{"has_accepted_license":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"6009","related_material":{"record":[{"relation":"earlier_version","id":"2305","status":"public"}]},"month":"03","oa_version":"Published Version","date_updated":"2023-09-20T11:15:31Z","ddc":["004","006"],"oa":1,"publication_status":"published","isi":1,"article_processing_charge":"No","citation":{"ieee":"T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Trading performance for stability in Markov decision processes,” <i>Journal of Computer and System Sciences</i>, vol. 84. Elsevier, pp. 144–170, 2017.","ista":"Brázdil T, Chatterjee K, Forejt V, Kučera A. 2017. Trading performance for stability in Markov decision processes. Journal of Computer and System Sciences. 84, 144–170.","mla":"Brázdil, Tomáš, et al. “Trading Performance for Stability in Markov Decision Processes.” <i>Journal of Computer and System Sciences</i>, vol. 84, Elsevier, 2017, pp. 144–70, doi:<a href=\"https://doi.org/10.1016/j.jcss.2016.09.009\">10.1016/j.jcss.2016.09.009</a>.","apa":"Brázdil, T., Chatterjee, K., Forejt, V., &#38; Kučera, A. (2017). Trading performance for stability in Markov decision processes. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jcss.2016.09.009\">https://doi.org/10.1016/j.jcss.2016.09.009</a>","short":"T. Brázdil, K. Chatterjee, V. Forejt, A. Kučera, Journal of Computer and System Sciences 84 (2017) 144–170.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Trading Performance for Stability in Markov Decision Processes.” <i>Journal of Computer and System Sciences</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.jcss.2016.09.009\">https://doi.org/10.1016/j.jcss.2016.09.009</a>.","ama":"Brázdil T, Chatterjee K, Forejt V, Kučera A. Trading performance for stability in Markov decision processes. <i>Journal of Computer and System Sciences</i>. 2017;84:144-170. doi:<a href=\"https://doi.org/10.1016/j.jcss.2016.09.009\">10.1016/j.jcss.2016.09.009</a>"},"type":"journal_article","status":"public","pubrep_id":"717","tmp":{"short":"CC BY (4.0)","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)"},"title":"Trading performance for stability in Markov decision processes","_id":"1294","page":"144 - 170","intvolume":"        84","doi":"10.1016/j.jcss.2016.09.009","external_id":{"isi":["000388430000011"]},"department":[{"_id":"KrCh"}],"quality_controlled":"1","file_date_updated":"2020-07-14T12:44:42Z","abstract":[{"lang":"eng","text":"We study controller synthesis problems for finite-state Markov decision processes, where the objective is to optimize the expected mean-payoff performance and stability (also known as variability in the literature). We argue that the basic notion of expressing the stability using the statistical variance of the mean payoff is sometimes insufficient, and propose an alternative definition. We show that a strategy ensuring both the expected mean payoff and the variance below given bounds requires randomization and memory, under both the above definitions. We then show that the problem of finding such a strategy can be expressed as a set of constraints."}],"volume":84,"date_published":"2017-03-01T00:00:00Z","author":[{"full_name":"Brázdil, Tomáš","last_name":"Brázdil","first_name":"Tomáš"},{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Forejt, Vojtěch","last_name":"Forejt","first_name":"Vojtěch"},{"first_name":"Antonín","last_name":"Kučera","full_name":"Kučera, Antonín"}],"day":"01","year":"2017","language":[{"iso":"eng"}],"publication":"Journal of Computer and System Sciences","ec_funded":1,"publisher":"Elsevier","file":[{"file_name":"IST-2016-717-v1+1_1-s2.0-S0022000016300897-main.pdf","access_level":"open_access","file_size":708657,"date_updated":"2020-07-14T12:44:42Z","content_type":"application/pdf","creator":"system","date_created":"2018-12-12T10:11:30Z","relation":"main_file","checksum":"91271b23cf884d7c06d33bef0cd623b1","file_id":"4885"}],"scopus_import":"1","project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF","grant_number":"S11407"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"date_created":"2018-12-11T11:51:12Z"},{"main_file_link":[{"url":"https://doi.org/10.5061/dryad.pk16b","open_access":"1"}],"citation":{"chicago":"Riccio, Paul, Christina Cebrián, Hui Zong, Simon Hippenmeyer, and Frank Costantini. “Data from: Ret and Etv4 Promote Directed Movements of Progenitor Cells during Renal Branching Morphogenesis.” Dryad, 2017. <a href=\"https://doi.org/10.5061/dryad.pk16b\">https://doi.org/10.5061/dryad.pk16b</a>.","ama":"Riccio P, Cebrián C, Zong H, Hippenmeyer S, Costantini F. Data from: Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis. 2017. doi:<a href=\"https://doi.org/10.5061/dryad.pk16b\">10.5061/dryad.pk16b</a>","short":"P. Riccio, C. Cebrián, H. Zong, S. Hippenmeyer, F. Costantini, (2017).","mla":"Riccio, Paul, et al. <i>Data from: Ret and Etv4 Promote Directed Movements of Progenitor Cells during Renal Branching Morphogenesis</i>. Dryad, 2017, doi:<a href=\"https://doi.org/10.5061/dryad.pk16b\">10.5061/dryad.pk16b</a>.","apa":"Riccio, P., Cebrián, C., Zong, H., Hippenmeyer, S., &#38; Costantini, F. (2017). Data from: Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis. Dryad. <a href=\"https://doi.org/10.5061/dryad.pk16b\">https://doi.org/10.5061/dryad.pk16b</a>","ieee":"P. Riccio, C. Cebrián, H. Zong, S. Hippenmeyer, and F. Costantini, “Data from: Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis.” Dryad, 2017.","ista":"Riccio P, Cebrián C, Zong H, Hippenmeyer S, Costantini F. 2017. Data from: Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis, Dryad, <a href=\"https://doi.org/10.5061/dryad.pk16b\">10.5061/dryad.pk16b</a>."},"article_processing_charge":"No","publisher":"Dryad","status":"public","type":"research_data_reference","title":"Data from: Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis","_id":"9707","date_created":"2021-07-23T09:39:34Z","doi":"10.5061/dryad.pk16b","department":[{"_id":"SiHi"}],"date_published":"2017-01-14T00:00:00Z","abstract":[{"text":"Branching morphogenesis of the epithelial ureteric bud forms the renal collecting duct system and is critical for normal nephron number, while low nephron number is implicated in hypertension and renal disease. Ureteric bud growth and branching requires GDNF signaling from the surrounding mesenchyme to cells at the ureteric bud tips, via the Ret receptor tyrosine kinase and coreceptor Gfrα1; Ret signaling up-regulates transcription factors Etv4 and Etv5, which are also critical for branching. Despite extensive knowledge of the genetic control of these events, it is not understood, at the cellular level, how renal branching morphogenesis is achieved or how Ret signaling influences epithelial cell behaviors to promote this process. Analysis of chimeric embryos previously suggested a role for Ret signaling in promoting cell rearrangements in the nephric duct, but this method was unsuited to study individual cell behaviors during ureteric bud branching. Here, we use Mosaic Analysis with Double Markers (MADM), combined with organ culture and time-lapse imaging, to trace the movements and divisions of individual ureteric bud tip cells. We first examine wild-type clones and then Ret or Etv4 mutant/wild-type clones in which the mutant and wild-type sister cells are differentially and heritably marked by green and red fluorescent proteins. We find that, in normal kidneys, most individual tip cells behave as self-renewing progenitors, some of whose progeny remain at the tips while others populate the growing UB trunks. In Ret or Etv4 MADM clones, the wild-type cells generated at a UB tip are much more likely to remain at, or move to, the new tips during branching and elongation, while their Ret−/− or Etv4−/− sister cells tend to lag behind and contribute only to the trunks. By tracking successive mitoses in a cell lineage, we find that Ret signaling has little effect on proliferation, in contrast to its effects on cell movement. Our results show that Ret/Etv4 signaling promotes directed cell movements in the ureteric bud tips, and suggest a model in which these cell movements mediate branching morphogenesis.","lang":"eng"}],"author":[{"full_name":"Riccio, Paul","first_name":"Paul","last_name":"Riccio"},{"full_name":"Cebrián, Christina","last_name":"Cebrián","first_name":"Christina"},{"last_name":"Zong","first_name":"Hui","full_name":"Zong, Hui"},{"full_name":"Hippenmeyer, Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer","first_name":"Simon","orcid":"0000-0003-2279-1061"},{"full_name":"Costantini, Frank","last_name":"Costantini","first_name":"Frank"}],"year":"2017","day":"14","related_material":{"record":[{"status":"deleted","relation":"used_in_publication","id":"9702"}]},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa_version":"Published Version","month":"01","date_updated":"2022-08-25T13:34:55Z","oa":1},{"year":"2017","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","day":"18","related_material":{"record":[{"relation":"used_in_publication","id":"1197","status":"public"}]},"oa_version":"Published Version","month":"10","date_updated":"2023-02-21T16:34:41Z","oa":1,"date_published":"2017-10-18T00:00:00Z","abstract":[{"lang":"eng","text":"Across the nervous system, certain population spiking patterns are observed far more frequently than others. A hypothesis about this structure is that these collective activity patterns function as population codewords–collective modes–carrying information distinct from that of any single cell. We investigate this phenomenon in recordings of ∼150 retinal ganglion cells, the retina’s output. We develop a novel statistical model that decomposes the population response into modes; it predicts the distribution of spiking activity in the ganglion cell population with high accuracy. We found that the modes represent localized features of the visual stimulus that are distinct from the features represented by single neurons. Modes form clusters of activity states that are readily discriminated from one another. When we repeated the same visual stimulus, we found that the same mode was robustly elicited. These results suggest that retinal ganglion cells’ collective signaling is endowed with a form of error-correcting code–a principle that may hold in brain areas beyond retina."}],"author":[{"full_name":"Prentice, Jason","first_name":"Jason","last_name":"Prentice"},{"full_name":"Marre, Olivier","first_name":"Olivier","last_name":"Marre"},{"last_name":"Ioffe","first_name":"Mark","full_name":"Ioffe, Mark"},{"first_name":"Adrianna","last_name":"Loback","full_name":"Loback, Adrianna"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkačik, Gašper","orcid":"0000-0002-6699-1455","last_name":"Tkačik","first_name":"Gašper"},{"full_name":"Berry, Michael","last_name":"Berry","first_name":"Michael"}],"_id":"9709","date_created":"2021-07-23T11:34:34Z","doi":"10.5061/dryad.1f1rc","department":[{"_id":"GaTk"}],"article_processing_charge":"No","citation":{"mla":"Prentice, Jason, et al. <i>Data from: Error-Robust Modes of the Retinal Population Code</i>. Dryad, 2017, doi:<a href=\"https://doi.org/10.5061/dryad.1f1rc\">10.5061/dryad.1f1rc</a>.","apa":"Prentice, J., Marre, O., Ioffe, M., Loback, A., Tkačik, G., &#38; Berry, M. (2017). Data from: Error-robust modes of the retinal population code. Dryad. <a href=\"https://doi.org/10.5061/dryad.1f1rc\">https://doi.org/10.5061/dryad.1f1rc</a>","ama":"Prentice J, Marre O, Ioffe M, Loback A, Tkačik G, Berry M. Data from: Error-robust modes of the retinal population code. 2017. doi:<a href=\"https://doi.org/10.5061/dryad.1f1rc\">10.5061/dryad.1f1rc</a>","chicago":"Prentice, Jason, Olivier Marre, Mark Ioffe, Adrianna Loback, Gašper Tkačik, and Michael Berry. “Data from: Error-Robust Modes of the Retinal Population Code.” Dryad, 2017. <a href=\"https://doi.org/10.5061/dryad.1f1rc\">https://doi.org/10.5061/dryad.1f1rc</a>.","short":"J. Prentice, O. Marre, M. Ioffe, A. Loback, G. Tkačik, M. Berry, (2017).","ieee":"J. Prentice, O. Marre, M. Ioffe, A. Loback, G. Tkačik, and M. Berry, “Data from: Error-robust modes of the retinal population code.” Dryad, 2017.","ista":"Prentice J, Marre O, Ioffe M, Loback A, Tkačik G, Berry M. 2017. Data from: Error-robust modes of the retinal population code, Dryad, <a href=\"https://doi.org/10.5061/dryad.1f1rc\">10.5061/dryad.1f1rc</a>."},"main_file_link":[{"url":"https://doi.org/10.5061/dryad.1f1rc","open_access":"1"}],"publisher":"Dryad","type":"research_data_reference","status":"public","title":"Data from: Error-robust modes of the retinal population code"},{"department":[{"_id":"NiBa"}],"doi":"10.17632/nw68fxzjpm.1","date_created":"2021-08-09T13:18:55Z","_id":"9842","title":"Data for: Establishment in a new habitat by polygenic adaptation","type":"research_data_reference","status":"public","citation":{"chicago":"Etheridge, Alison, and Nicholas H Barton. “Data for: Establishment in a New Habitat by Polygenic Adaptation.” Mendeley Data, 2017. <a href=\"https://doi.org/10.17632/nw68fxzjpm.1\">https://doi.org/10.17632/nw68fxzjpm.1</a>.","short":"A. Etheridge, N.H. Barton, (2017).","ama":"Etheridge A, Barton NH. Data for: Establishment in a new habitat by polygenic adaptation. 2017. doi:<a href=\"https://doi.org/10.17632/nw68fxzjpm.1\">10.17632/nw68fxzjpm.1</a>","apa":"Etheridge, A., &#38; Barton, N. H. (2017). Data for: Establishment in a new habitat by polygenic adaptation. Mendeley Data. <a href=\"https://doi.org/10.17632/nw68fxzjpm.1\">https://doi.org/10.17632/nw68fxzjpm.1</a>","mla":"Etheridge, Alison, and Nicholas H. Barton. <i>Data for: Establishment in a New Habitat by Polygenic Adaptation</i>. Mendeley Data, 2017, doi:<a href=\"https://doi.org/10.17632/nw68fxzjpm.1\">10.17632/nw68fxzjpm.1</a>.","ieee":"A. Etheridge and N. H. Barton, “Data for: Establishment in a new habitat by polygenic adaptation.” Mendeley Data, 2017.","ista":"Etheridge A, Barton NH. 2017. Data for: Establishment in a new habitat by polygenic adaptation, Mendeley Data, <a href=\"https://doi.org/10.17632/nw68fxzjpm.1\">10.17632/nw68fxzjpm.1</a>."},"main_file_link":[{"url":"https://doi.org/10.17632/nw68fxzjpm.1","open_access":"1"}],"article_processing_charge":"No","publisher":"Mendeley Data","oa":1,"date_updated":"2025-05-28T11:56:59Z","oa_version":"Published Version","month":"12","year":"2017","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","day":"29","related_material":{"record":[{"status":"public","id":"564","relation":"used_in_publication"}]},"author":[{"first_name":"Alison","last_name":"Etheridge","full_name":"Etheridge, Alison"},{"orcid":"0000-0002-8548-5240","first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"}],"date_published":"2017-12-29T00:00:00Z","abstract":[{"text":"Mathematica notebooks used to generate figures.","lang":"eng"}]},{"_id":"9844","doi":"10.1371/journal.pgen.1007122.s018","date_created":"2021-08-09T13:27:16Z","department":[{"_id":"CaGu"}],"publisher":"Public Library of Science","article_processing_charge":"No","citation":{"ieee":"N. Nikolic <i>et al.</i>, “Source data for figures and tables.” Public Library of Science, 2017.","ista":"Nikolic N, Schreiber F, Dal Co A, Kiviet D, Bergmiller T, Littmann S, Kuypers M, Ackermann M. 2017. Source data for figures and tables, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pgen.1007122.s018\">10.1371/journal.pgen.1007122.s018</a>.","short":"N. Nikolic, F. Schreiber, A. Dal Co, D. Kiviet, T. Bergmiller, S. Littmann, M. Kuypers, M. Ackermann, (2017).","ama":"Nikolic N, Schreiber F, Dal Co A, et al. Source data for figures and tables. 2017. doi:<a href=\"https://doi.org/10.1371/journal.pgen.1007122.s018\">10.1371/journal.pgen.1007122.s018</a>","chicago":"Nikolic, Nela, Frank Schreiber, Alma Dal Co, Daniel Kiviet, Tobias Bergmiller, Sten Littmann, Marcel Kuypers, and Martin Ackermann. “Source Data for Figures and Tables.” Public Library of Science, 2017. <a href=\"https://doi.org/10.1371/journal.pgen.1007122.s018\">https://doi.org/10.1371/journal.pgen.1007122.s018</a>.","apa":"Nikolic, N., Schreiber, F., Dal Co, A., Kiviet, D., Bergmiller, T., Littmann, S., … Ackermann, M. (2017). Source data for figures and tables. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pgen.1007122.s018\">https://doi.org/10.1371/journal.pgen.1007122.s018</a>","mla":"Nikolic, Nela, et al. <i>Source Data for Figures and Tables</i>. Public Library of Science, 2017, doi:<a href=\"https://doi.org/10.1371/journal.pgen.1007122.s018\">10.1371/journal.pgen.1007122.s018</a>."},"status":"public","type":"research_data_reference","title":"Source data for figures and tables","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","related_material":{"record":[{"id":"541","relation":"used_in_publication","status":"public"}]},"day":"18","year":"2017","month":"12","oa_version":"Published Version","date_updated":"2023-02-23T12:25:04Z","date_published":"2017-12-18T00:00:00Z","author":[{"orcid":"0000-0001-9068-6090","last_name":"Nikolic","first_name":"Nela","id":"42D9CABC-F248-11E8-B48F-1D18A9856A87","full_name":"Nikolic, Nela"},{"full_name":"Schreiber, Frank","first_name":"Frank","last_name":"Schreiber"},{"last_name":"Dal Co","first_name":"Alma","full_name":"Dal Co, Alma"},{"full_name":"Kiviet, Daniel","first_name":"Daniel","last_name":"Kiviet"},{"full_name":"Bergmiller, Tobias","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5396-4346","last_name":"Bergmiller","first_name":"Tobias"},{"full_name":"Littmann, Sten","first_name":"Sten","last_name":"Littmann"},{"last_name":"Kuypers","first_name":"Marcel","full_name":"Kuypers, Marcel"},{"first_name":"Martin","last_name":"Ackermann","full_name":"Ackermann, Martin"}]}]