[{"oa_version":"Submitted Version","abstract":[{"text":"Proofs of space (PoS) were suggested as more ecological and economical alternative to proofs of work, which are currently used in blockchain designs like Bitcoin. The existing PoS are based on rather sophisticated graph pebbling lower bounds. Much simpler and in several aspects more efficient schemes based on inverting random functions have been suggested, but they don’t give meaningful security guarantees due to existing time-memory trade-offs. In particular, Hellman showed that any permutation over a domain of size N can be inverted in time T by an algorithm that is given S bits of auxiliary information whenever (Formula presented). For functions Hellman gives a weaker attack with S2· T≈ N2 (e.g., S= T≈ N2/3). To prove lower bounds, one considers an adversary who has access to an oracle f: [ N] → [N] and can make T oracle queries. The best known lower bound is S· T∈ Ω(N) and holds for random functions and permutations. We construct functions that provably require more time and/or space to invert. Specifically, for any constant k we construct a function [N] → [N] that cannot be inverted unless Sk· T∈ Ω(Nk) (in particular, S= T≈ (Formula presented). Our construction does not contradict Hellman’s time-memory trade-off, because it cannot be efficiently evaluated in forward direction. However, its entire function table can be computed in time quasilinear in N, which is sufficient for the PoS application. Our simplest construction is built from a random function oracle g: [N] × [N] → [ N] and a random permutation oracle f: [N] → N] and is defined as h(x) = g(x, x′) where f(x) = π(f(x′)) with π being any involution without a fixed point, e.g. flipping all the bits. For this function we prove that any adversary who gets S bits of auxiliary information, makes at most T oracle queries, and inverts h on an ϵ fraction of outputs must satisfy S2· T∈ Ω(ϵ2N2).","lang":"eng"}],"intvolume":" 10625","month":"11","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2017/893.pdf"}],"scopus_import":1,"alternative_title":["LNCS"],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["978-331970696-2"]},"ec_funded":1,"related_material":{"record":[{"status":"public","id":"83","relation":"dissertation_contains"}]},"volume":10625,"_id":"559","status":"public","conference":{"end_date":"2017-12-07","location":"Hong Kong, China","start_date":"2017-12-03","name":"ASIACRYPT: Theory and Applications of Cryptology and Information Security"},"type":"conference","date_updated":"2023-09-07T12:30:22Z","department":[{"_id":"KrPi"}],"oa":1,"quality_controlled":"1","publisher":"Springer","day":"18","year":"2017","date_created":"2018-12-11T11:47:10Z","date_published":"2017-11-18T00:00:00Z","doi":"10.1007/978-3-319-70697-9_13","page":"357 - 379","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. 2017. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. ASIACRYPT: Theory and Applications of Cryptology and Information Security, LNCS, vol. 10625, 357–379.","chicago":"Abusalah, Hamza M, Joel F Alwen, Bram Cohen, Danylo Khilko, Krzysztof Z Pietrzak, and Leonid Reyzin. “Beyond Hellman’s Time-Memory Trade-Offs with Applications to Proofs of Space,” 10625:357–79. Springer, 2017. https://doi.org/10.1007/978-3-319-70697-9_13.","ama":"Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. In: Vol 10625. Springer; 2017:357-379. doi:10.1007/978-3-319-70697-9_13","apa":"Abusalah, H. M., Alwen, J. F., Cohen, B., Khilko, D., Pietrzak, K. Z., & Reyzin, L. (2017). Beyond Hellman’s time-memory trade-offs with applications to proofs of space (Vol. 10625, pp. 357–379). Presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China: Springer. https://doi.org/10.1007/978-3-319-70697-9_13","ieee":"H. M. Abusalah, J. F. Alwen, B. Cohen, D. Khilko, K. Z. Pietrzak, and L. Reyzin, “Beyond Hellman’s time-memory trade-offs with applications to proofs of space,” presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China, 2017, vol. 10625, pp. 357–379.","short":"H.M. Abusalah, J.F. Alwen, B. Cohen, D. Khilko, K.Z. Pietrzak, L. Reyzin, in:, Springer, 2017, pp. 357–379.","mla":"Abusalah, Hamza M., et al. Beyond Hellman’s Time-Memory Trade-Offs with Applications to Proofs of Space. Vol. 10625, Springer, 2017, pp. 357–79, doi:10.1007/978-3-319-70697-9_13."},"title":"Beyond Hellman’s time-memory trade-offs with applications to proofs of space","author":[{"last_name":"Abusalah","full_name":"Abusalah, Hamza M","first_name":"Hamza M","id":"40297222-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen","full_name":"Alwen, Joel F"},{"first_name":"Bram","full_name":"Cohen, Bram","last_name":"Cohen"},{"full_name":"Khilko, Danylo","last_name":"Khilko","first_name":"Danylo"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654"},{"first_name":"Leonid","last_name":"Reyzin","full_name":"Reyzin, Leonid"}],"publist_id":"7257"},{"oa":1,"publisher":"Institute of Mathematical Statistics","quality_controlled":"1","date_created":"2018-12-11T11:47:07Z","date_published":"2017-11-21T00:00:00Z","doi":"10.1214/17-ECP97","publication":"Electronic Communications in Probability","day":"21","year":"2017","has_accepted_license":"1","project":[{"call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804"}],"article_number":"63","title":"Singularities of the density of states of random Gram matrices","publist_id":"7265","author":[{"full_name":"Alt, Johannes","last_name":"Alt","first_name":"Johannes","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Alt, Johannes. “Singularities of the Density of States of Random Gram Matrices.” Electronic Communications in Probability. Institute of Mathematical Statistics, 2017. https://doi.org/10.1214/17-ECP97.","ista":"Alt J. 2017. Singularities of the density of states of random Gram matrices. Electronic Communications in Probability. 22, 63.","mla":"Alt, Johannes. “Singularities of the Density of States of Random Gram Matrices.” Electronic Communications in Probability, vol. 22, 63, Institute of Mathematical Statistics, 2017, doi:10.1214/17-ECP97.","apa":"Alt, J. (2017). Singularities of the density of states of random Gram matrices. Electronic Communications in Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/17-ECP97","ama":"Alt J. Singularities of the density of states of random Gram matrices. Electronic Communications in Probability. 2017;22. doi:10.1214/17-ECP97","short":"J. Alt, Electronic Communications in Probability 22 (2017).","ieee":"J. Alt, “Singularities of the density of states of random Gram matrices,” Electronic Communications in Probability, vol. 22. Institute of Mathematical Statistics, 2017."},"intvolume":" 22","month":"11","scopus_import":1,"oa_version":"Published Version","abstract":[{"text":"For large random matrices X with independent, centered entries but not necessarily identical variances, the eigenvalue density of XX* is well-approximated by a deterministic measure on ℝ. We show that the density of this measure has only square and cubic-root singularities away from zero. We also extend the bulk local law in [5] to the vicinity of these singularities.","lang":"eng"}],"ec_funded":1,"license":"https://creativecommons.org/licenses/by/4.0/","volume":22,"related_material":{"record":[{"id":"149","status":"public","relation":"dissertation_contains"}]},"language":[{"iso":"eng"}],"file":[{"file_id":"4663","checksum":"0ec05303a0de190de145654237984c79","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:08:04Z","file_name":"IST-2018-926-v1+1_euclid.ecp.1511233247.pdf","date_updated":"2020-07-14T12:47:00Z","file_size":470876,"creator":"system"}],"publication_status":"published","publication_identifier":{"issn":["1083589X"]},"pubrep_id":"926","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","_id":"550","department":[{"_id":"LaEr"}],"file_date_updated":"2020-07-14T12:47:00Z","ddc":["539"],"date_updated":"2023-09-07T12:38:08Z"},{"day":"01","has_accepted_license":"1","year":"2017","doi":"10.1007/978-3-319-65765-3_7","date_published":"2017-09-01T00:00:00Z","date_created":"2018-12-11T11:47:41Z","page":"116 - 132","publisher":"Springer","quality_controlled":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Bogomolov S, Giacobbe M, Henzinger TA, Kong H. 2017. Conic abstractions for hybrid systems. FORMATS: Formal Modelling and Analysis of Timed Systems, LNCS, vol. 10419, 116–132.","chicago":"Bogomolov, Sergiy, Mirco Giacobbe, Thomas A Henzinger, and Hui Kong. “Conic Abstractions for Hybrid Systems,” 10419:116–32. Springer, 2017. https://doi.org/10.1007/978-3-319-65765-3_7.","apa":"Bogomolov, S., Giacobbe, M., Henzinger, T. A., & Kong, H. (2017). Conic abstractions for hybrid systems (Vol. 10419, pp. 116–132). Presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany: Springer. https://doi.org/10.1007/978-3-319-65765-3_7","ama":"Bogomolov S, Giacobbe M, Henzinger TA, Kong H. Conic abstractions for hybrid systems. In: Vol 10419. Springer; 2017:116-132. doi:10.1007/978-3-319-65765-3_7","ieee":"S. Bogomolov, M. Giacobbe, T. A. Henzinger, and H. Kong, “Conic abstractions for hybrid systems,” presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 116–132.","short":"S. Bogomolov, M. Giacobbe, T.A. Henzinger, H. Kong, in:, Springer, 2017, pp. 116–132.","mla":"Bogomolov, Sergiy, et al. Conic Abstractions for Hybrid Systems. Vol. 10419, Springer, 2017, pp. 116–32, doi:10.1007/978-3-319-65765-3_7."},"title":"Conic abstractions for hybrid systems","author":[{"full_name":"Bogomolov, Sergiy","orcid":"0000-0002-0686-0365","last_name":"Bogomolov","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","first_name":"Sergiy"},{"first_name":"Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8180-0904","full_name":"Giacobbe, Mirco","last_name":"Giacobbe"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"full_name":"Kong, Hui","orcid":"0000-0002-3066-6941","last_name":"Kong","first_name":"Hui","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7129","project":[{"call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"file":[{"checksum":"faf546914ba29bcf9974ee36b6b16750","file_id":"4956","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:12:38Z","file_name":"IST-2017-831-v1+1_main.pdf","date_updated":"2020-07-14T12:47:31Z","file_size":3806864,"creator":"system"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-331965764-6"]},"publication_status":"published","volume":"10419 ","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"6894"}]},"oa_version":"Submitted Version","abstract":[{"text":"Despite researchers’ efforts in the last couple of decades, reachability analysis is still a challenging problem even for linear hybrid systems. Among the existing approaches, the most practical ones are mainly based on bounded-time reachable set over-approximations. For the purpose of unbounded-time analysis, one important strategy is to abstract the original system and find an invariant for the abstraction. In this paper, we propose an approach to constructing a new kind of abstraction called conic abstraction for affine hybrid systems, and to computing reachable sets based on this abstraction. The essential feature of a conic abstraction is that it partitions the state space of a system into a set of convex polyhedral cones which is derived from a uniform conic partition of the derivative space. Such a set of polyhedral cones is able to cut all trajectories of the system into almost straight segments so that every segment of a reach pipe in a polyhedral cone tends to be straight as well, and hence can be over-approximated tightly by polyhedra using similar techniques as HyTech or PHAVer. In particular, for diagonalizable affine systems, our approach can guarantee to find an invariant for unbounded reachable sets, which is beyond the capability of bounded-time reachability analysis tools. We implemented the approach in a tool and experiments on benchmarks show that our approach is more powerful than SpaceEx and PHAVer in dealing with diagonalizable systems.","lang":"eng"}],"month":"09","scopus_import":1,"alternative_title":["LNCS"],"ddc":["005"],"date_updated":"2023-09-07T12:53:00Z","file_date_updated":"2020-07-14T12:47:31Z","department":[{"_id":"ToHe"}],"_id":"647","status":"public","pubrep_id":"831","type":"conference","conference":{"start_date":"2017-09-05","location":"Berlin, Germany","end_date":"2017-09-07","name":"FORMATS: Formal Modelling and Analysis of Timed Systems"}},{"date_updated":"2023-09-07T12:53:00Z","ddc":["000"],"file_date_updated":"2020-07-14T12:47:27Z","department":[{"_id":"ToHe"}],"_id":"631","conference":{"end_date":"2017-04-29","location":"Uppsala, Sweden","start_date":"2017-04-22","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"type":"conference","pubrep_id":"966","status":"public","publication_status":"published","publication_identifier":{"isbn":["978-366254576-8"]},"language":[{"iso":"eng"}],"file":[{"creator":"system","date_updated":"2020-07-14T12:47:27Z","file_size":569863,"date_created":"2018-12-12T10:11:41Z","file_name":"IST-2017-741-v1+1_main.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"4897","checksum":"f395d0d20102b89aeaad8b4ef4f18f4f"},{"file_name":"IST-2018-741-v2+2_main.pdf","date_created":"2018-12-12T10:11:42Z","file_size":563276,"date_updated":"2020-07-14T12:47:27Z","creator":"system","file_id":"4898","checksum":"f416ee1ae4497b23ecdf28b1f18bb8df","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"volume":10205,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"6894"}]},"abstract":[{"lang":"eng","text":"Template polyhedra generalize intervals and octagons to polyhedra whose facets are orthogonal to a given set of arbitrary directions. They have been employed in the abstract interpretation of programs and, with particular success, in the reachability analysis of hybrid automata. While previously, the choice of directions has been left to the user or a heuristic, we present a method for the automatic discovery of directions that generalize and eliminate spurious counterexamples. We show that for the class of convex hybrid automata, i.e., hybrid automata with (possibly nonlinear) convex constraints on derivatives, such directions always exist and can be found using convex optimization. We embed our method inside a CEGAR loop, thus enabling the time-unbounded reachability analysis of an important and richer class of hybrid automata than was previously possible. We evaluate our method on several benchmarks, demonstrating also its superior efficiency for the special case of linear hybrid automata."}],"oa_version":"Submitted Version","scopus_import":1,"alternative_title":["LNCS"],"intvolume":" 10205","month":"03","citation":{"ista":"Bogomolov S, Frehse G, Giacobbe M, Henzinger TA. 2017. Counterexample guided refinement of template polyhedra. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10205, 589–606.","chicago":"Bogomolov, Sergiy, Goran Frehse, Mirco Giacobbe, and Thomas A Henzinger. “Counterexample Guided Refinement of Template Polyhedra,” 10205:589–606. Springer, 2017. https://doi.org/10.1007/978-3-662-54577-5_34.","ama":"Bogomolov S, Frehse G, Giacobbe M, Henzinger TA. Counterexample guided refinement of template polyhedra. In: Vol 10205. Springer; 2017:589-606. doi:10.1007/978-3-662-54577-5_34","apa":"Bogomolov, S., Frehse, G., Giacobbe, M., & Henzinger, T. A. (2017). Counterexample guided refinement of template polyhedra (Vol. 10205, pp. 589–606). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden: Springer. https://doi.org/10.1007/978-3-662-54577-5_34","ieee":"S. Bogomolov, G. Frehse, M. Giacobbe, and T. A. Henzinger, “Counterexample guided refinement of template polyhedra,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden, 2017, vol. 10205, pp. 589–606.","short":"S. Bogomolov, G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2017, pp. 589–606.","mla":"Bogomolov, Sergiy, et al. Counterexample Guided Refinement of Template Polyhedra. Vol. 10205, Springer, 2017, pp. 589–606, doi:10.1007/978-3-662-54577-5_34."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7162","author":[{"orcid":"0000-0002-0686-0365","full_name":"Bogomolov, Sergiy","last_name":"Bogomolov","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","first_name":"Sergiy"},{"first_name":"Goran","full_name":"Frehse, Goran","last_name":"Frehse"},{"last_name":"Giacobbe","full_name":"Giacobbe, Mirco","orcid":"0000-0001-8180-0904","first_name":"Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"title":"Counterexample guided refinement of template polyhedra","project":[{"call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"},{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"year":"2017","has_accepted_license":"1","day":"31","page":"589 - 606","date_created":"2018-12-11T11:47:36Z","doi":"10.1007/978-3-662-54577-5_34","date_published":"2017-03-31T00:00:00Z","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), by the European Commission under grant 643921 (UnCoVerCPS), and by the ARC project DP140104219 (Robust AI Planning for Hybrid Systems).","oa":1,"publisher":"Springer","quality_controlled":"1"},{"oa_version":"Published Version","abstract":[{"text":"We show that matrix elements of functions of N × N Wigner matrices fluctuate on a scale of order N−1/2 and we identify the limiting fluctuation. Our result holds for any function f of the matrix that has bounded variation thus considerably relaxing the regularity requirement imposed in [7, 11].","lang":"eng"}],"month":"01","intvolume":" 21","scopus_import":1,"file":[{"file_id":"5329","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:18:10Z","file_name":"IST-2017-747-v1+1_euclid.ecp.1483347665.pdf","date_updated":"2018-12-12T10:18:10Z","file_size":440770,"creator":"system"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":21,"related_material":{"record":[{"status":"public","id":"6179","relation":"dissertation_contains"}]},"ec_funded":1,"_id":"1144","status":"public","pubrep_id":"747","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["510"],"date_updated":"2023-09-07T12:54:12Z","file_date_updated":"2018-12-12T10:18:10Z","department":[{"_id":"LaEr"}],"acknowledgement":"Partially supported by the IST Austria Excellence Scholarship.","publisher":"Institute of Mathematical Statistics","quality_controlled":"1","oa":1,"day":"02","publication":"Electronic Communications in Probability","has_accepted_license":"1","year":"2017","doi":"10.1214/16-ECP38","date_published":"2017-01-02T00:00:00Z","date_created":"2018-12-11T11:50:23Z","article_number":"86","project":[{"grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Erdös, László, and Dominik J Schröder. “Fluctuations of Functions of Wigner Matrices.” Electronic Communications in Probability. Institute of Mathematical Statistics, 2017. https://doi.org/10.1214/16-ECP38.","ista":"Erdös L, Schröder DJ. 2017. Fluctuations of functions of Wigner matrices. Electronic Communications in Probability. 21, 86.","mla":"Erdös, László, and Dominik J. Schröder. “Fluctuations of Functions of Wigner Matrices.” Electronic Communications in Probability, vol. 21, 86, Institute of Mathematical Statistics, 2017, doi:10.1214/16-ECP38.","short":"L. Erdös, D.J. Schröder, Electronic Communications in Probability 21 (2017).","ieee":"L. Erdös and D. J. Schröder, “Fluctuations of functions of Wigner matrices,” Electronic Communications in Probability, vol. 21. Institute of Mathematical Statistics, 2017.","apa":"Erdös, L., & Schröder, D. J. (2017). Fluctuations of functions of Wigner matrices. Electronic Communications in Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/16-ECP38","ama":"Erdös L, Schröder DJ. Fluctuations of functions of Wigner matrices. Electronic Communications in Probability. 2017;21. doi:10.1214/16-ECP38"},"title":"Fluctuations of functions of Wigner matrices","author":[{"first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","full_name":"Erdös, László","orcid":"0000-0001-5366-9603"},{"first_name":"Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87","full_name":"Schröder, Dominik J","orcid":"0000-0002-2904-1856","last_name":"Schröder"}],"publist_id":"6214"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Elek, Oskar, et al. “Scattering-Aware Texture Reproduction for 3D Printing.” ACM Transactions on Graphics, vol. 36, no. 6, 241, ACM, 2017, doi:10.1145/3130800.3130890.","apa":"Elek, O., Sumin, D., Zhang, R., Weyrich, T., Myszkowski, K., Bickel, B., … Krivanek, J. (2017). Scattering-aware texture reproduction for 3D printing. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3130800.3130890","ama":"Elek O, Sumin D, Zhang R, et al. Scattering-aware texture reproduction for 3D printing. ACM Transactions on Graphics. 2017;36(6). doi:10.1145/3130800.3130890","ieee":"O. Elek et al., “Scattering-aware texture reproduction for 3D printing,” ACM Transactions on Graphics, vol. 36, no. 6. ACM, 2017.","short":"O. Elek, D. Sumin, R. Zhang, T. Weyrich, K. Myszkowski, B. Bickel, A. Wilkie, J. Krivanek, ACM Transactions on Graphics 36 (2017).","chicago":"Elek, Oskar, Denis Sumin, Ran Zhang, Tim Weyrich, Karol Myszkowski, Bernd Bickel, Alexander Wilkie, and Jaroslav Krivanek. “Scattering-Aware Texture Reproduction for 3D Printing.” ACM Transactions on Graphics. ACM, 2017. https://doi.org/10.1145/3130800.3130890.","ista":"Elek O, Sumin D, Zhang R, Weyrich T, Myszkowski K, Bickel B, Wilkie A, Krivanek J. 2017. Scattering-aware texture reproduction for 3D printing. ACM Transactions on Graphics. 36(6), 241."},"title":"Scattering-aware texture reproduction for 3D printing","author":[{"full_name":"Elek, Oskar","last_name":"Elek","first_name":"Oskar"},{"first_name":"Denis","last_name":"Sumin","full_name":"Sumin, Denis"},{"first_name":"Ran","id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3808-281X","full_name":"Zhang, Ran","last_name":"Zhang"},{"full_name":"Weyrich, Tim","last_name":"Weyrich","first_name":"Tim"},{"first_name":"Karol","last_name":"Myszkowski","full_name":"Myszkowski, Karol"},{"last_name":"Bickel","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alexander","full_name":"Wilkie, Alexander","last_name":"Wilkie"},{"first_name":"Jaroslav","full_name":"Krivanek, Jaroslav","last_name":"Krivanek"}],"publist_id":"7334","article_processing_charge":"No","article_number":"241","project":[{"_id":"2508E324-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"642841","name":"Distributed 3D Object Design"},{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"},{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"day":"20","publication":"ACM Transactions on Graphics","has_accepted_license":"1","year":"2017","doi":"10.1145/3130800.3130890","date_published":"2017-11-20T00:00:00Z","date_created":"2018-12-11T11:46:44Z","publisher":"ACM","quality_controlled":"1","oa":1,"ddc":["003","000","005"],"date_updated":"2023-09-07T13:11:15Z","department":[{"_id":"BeBi"}],"file_date_updated":"2020-07-14T12:46:35Z","_id":"486","status":"public","pubrep_id":"1052","type":"journal_article","article_type":"original","file":[{"creator":"system","file_size":107349827,"date_updated":"2020-07-14T12:46:35Z","file_name":"IST-2018-1052-v1+1_ElekSumin2017SGA.pdf","date_created":"2018-12-12T10:10:46Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"48386fa6956c3645fc89594dc898b147","file_id":"4836"},{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"21c89c28fb8d70f6602f752bf997aa0f","file_id":"7189","creator":"bbickel","date_updated":"2020-07-14T12:46:35Z","file_size":4683145,"date_created":"2019-12-16T14:48:57Z","file_name":"ElekSumin2017SGA_reduced_file_size.pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["07300301"]},"publication_status":"published","issue":"6","volume":36,"related_material":{"record":[{"id":"8386","status":"public","relation":"dissertation_contains"}]},"ec_funded":1,"oa_version":"Submitted Version","abstract":[{"text":"Color texture reproduction in 3D printing commonly ignores volumetric light transport (cross-talk) between surface points on a 3D print. Such light diffusion leads to significant blur of details and color bleeding, and is particularly severe for highly translucent resin-based print materials. Given their widely varying scattering properties, this cross-talk between surface points strongly depends on the internal structure of the volume surrounding each surface point. Existing scattering-aware methods use simplified models for light diffusion, and often accept the visual blur as an immutable property of the print medium. In contrast, our work counteracts heterogeneous scattering to obtain the impression of a crisp albedo texture on top of the 3D print, by optimizing for a fully volumetric material distribution that preserves the target appearance. Our method employs an efficient numerical optimizer on top of a general Monte-Carlo simulation of heterogeneous scattering, supported by a practical calibration procedure to obtain scattering parameters from a given set of printer materials. Despite the inherent translucency of the medium, we reproduce detailed surface textures on 3D prints. We evaluate our system using a commercial, five-tone 3D print process and compare against the printer’s native color texturing mode, demonstrating that our method preserves high-frequency features well without having to compromise on color gamut.","lang":"eng"}],"month":"11","intvolume":" 36","scopus_import":1},{"citation":{"chicago":"Jafargholi, Zahra, Chethan Kamath Hosdurg, Karen Klein, Ilan Komargodski, Krzysztof Z Pietrzak, and Daniel Wichs. “Be Adaptive Avoid Overcommitting.” edited by Jonathan Katz and Hovav Shacham, 10401:133–63. Springer, 2017. https://doi.org/10.1007/978-3-319-63688-7_5.","ista":"Jafargholi Z, Kamath Hosdurg C, Klein K, Komargodski I, Pietrzak KZ, Wichs D. 2017. Be adaptive avoid overcommitting. CRYPTO: Cryptology, LNCS, vol. 10401, 133–163.","mla":"Jafargholi, Zahra, et al. Be Adaptive Avoid Overcommitting. Edited by Jonathan Katz and Hovav Shacham, vol. 10401, Springer, 2017, pp. 133–63, doi:10.1007/978-3-319-63688-7_5.","apa":"Jafargholi, Z., Kamath Hosdurg, C., Klein, K., Komargodski, I., Pietrzak, K. Z., & Wichs, D. (2017). Be adaptive avoid overcommitting. In J. Katz & H. Shacham (Eds.) (Vol. 10401, pp. 133–163). Presented at the CRYPTO: Cryptology, Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-319-63688-7_5","ama":"Jafargholi Z, Kamath Hosdurg C, Klein K, Komargodski I, Pietrzak KZ, Wichs D. Be adaptive avoid overcommitting. In: Katz J, Shacham H, eds. Vol 10401. Springer; 2017:133-163. doi:10.1007/978-3-319-63688-7_5","short":"Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K.Z. Pietrzak, D. Wichs, in:, J. Katz, H. Shacham (Eds.), Springer, 2017, pp. 133–163.","ieee":"Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K. Z. Pietrzak, and D. Wichs, “Be adaptive avoid overcommitting,” presented at the CRYPTO: Cryptology, Santa Barbara, CA, United States, 2017, vol. 10401, pp. 133–163."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Jafargholi, Zahra","last_name":"Jafargholi","first_name":"Zahra"},{"last_name":"Kamath Hosdurg","full_name":"Kamath Hosdurg, Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","first_name":"Chethan"},{"first_name":"Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","last_name":"Klein","full_name":"Klein, Karen"},{"first_name":"Ilan","last_name":"Komargodski","full_name":"Komargodski, Ilan"},{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"},{"full_name":"Wichs, Daniel","last_name":"Wichs","first_name":"Daniel"}],"publist_id":"7151","editor":[{"first_name":"Jonathan","last_name":"Katz","full_name":"Katz, Jonathan"},{"first_name":"Hovav","full_name":"Shacham, Hovav","last_name":"Shacham"}],"title":"Be adaptive avoid overcommitting","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"year":"2017","day":"01","page":"133 - 163","date_created":"2018-12-11T11:47:38Z","doi":"10.1007/978-3-319-63688-7_5","date_published":"2017-01-01T00:00:00Z","oa":1,"publisher":"Springer","quality_controlled":"1","date_updated":"2023-09-07T13:32:11Z","department":[{"_id":"KrPi"}],"_id":"637","conference":{"start_date":"2017-07-20","location":"Santa Barbara, CA, United States","end_date":"2017-07-24","name":"CRYPTO: Cryptology"},"type":"conference","status":"public","publication_status":"published","publication_identifier":{"isbn":["978-331963687-0"]},"language":[{"iso":"eng"}],"ec_funded":1,"related_material":{"record":[{"relation":"dissertation_contains","id":"10035","status":"public"}]},"volume":10401,"abstract":[{"lang":"eng","text":"For many cryptographic primitives, it is relatively easy to achieve selective security (where the adversary commits a-priori to some of the choices to be made later in the attack) but appears difficult to achieve the more natural notion of adaptive security (where the adversary can make all choices on the go as the attack progresses). A series of several recent works shows how to cleverly achieve adaptive security in several such scenarios including generalized selective decryption (Panjwani, TCC ’07 and Fuchsbauer et al., CRYPTO ’15), constrained PRFs (Fuchsbauer et al., ASIACRYPT ’14), and Yao garbled circuits (Jafargholi and Wichs, TCC ’16b). Although the above works expressed vague intuition that they share a common technique, the connection was never made precise. In this work we present a new framework that connects all of these works and allows us to present them in a unified and simplified fashion. Moreover, we use the framework to derive a new result for adaptively secure secret sharing over access structures defined via monotone circuits. We envision that further applications will follow in the future. Underlying our framework is the following simple idea. It is well known that selective security, where the adversary commits to n-bits of information about his future choices, automatically implies adaptive security at the cost of amplifying the adversary’s advantage by a factor of up to 2n. However, in some cases the proof of selective security proceeds via a sequence of hybrids, where each pair of adjacent hybrids locally only requires some smaller partial information consisting of m ≪ n bits. The partial information needed might be completely different between different pairs of hybrids, and if we look across all the hybrids we might rely on the entire n-bit commitment. Nevertheless, the above is sufficient to prove adaptive security, at the cost of amplifying the adversary’s advantage by a factor of only 2m ≪ 2n. In all of our examples using the above framework, the different hybrids are captured by some sort of a graph pebbling game and the amount of information that the adversary needs to commit to in each pair of hybrids is bounded by the maximum number of pebbles in play at any point in time. Therefore, coming up with better strategies for proving adaptive security translates to various pebbling strategies for different types of graphs."}],"oa_version":"Submitted Version","main_file_link":[{"url":"https://eprint.iacr.org/2017/515","open_access":"1"}],"alternative_title":["LNCS"],"scopus_import":1,"intvolume":" 10401","month":"01"},{"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"564"}]},"doi":"10.17632/nw68fxzjpm.1","date_published":"2017-12-29T00:00:00Z","date_created":"2021-08-09T13:18:55Z","year":"2017","day":"29","publisher":"Mendeley Data","main_file_link":[{"url":"https://doi.org/10.17632/nw68fxzjpm.1","open_access":"1"}],"oa":1,"month":"12","abstract":[{"lang":"eng","text":"Mathematica notebooks used to generate figures."}],"oa_version":"Published Version","author":[{"first_name":"Alison","full_name":"Etheridge, Alison","last_name":"Etheridge"},{"last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H"}],"article_processing_charge":"No","department":[{"_id":"NiBa"}],"title":"Data for: Establishment in a new habitat by polygenic adaptation","date_updated":"2023-09-11T13:41:21Z","citation":{"chicago":"Etheridge, Alison, and Nicholas H Barton. “Data for: Establishment in a New Habitat by Polygenic Adaptation.” Mendeley Data, 2017. https://doi.org/10.17632/nw68fxzjpm.1.","ista":"Etheridge A, Barton NH. 2017. Data for: Establishment in a new habitat by polygenic adaptation, Mendeley Data, 10.17632/nw68fxzjpm.1.","mla":"Etheridge, Alison, and Nicholas H. Barton. Data for: Establishment in a New Habitat by Polygenic Adaptation. Mendeley Data, 2017, doi:10.17632/nw68fxzjpm.1.","ama":"Etheridge A, Barton NH. Data for: Establishment in a new habitat by polygenic adaptation. 2017. doi:10.17632/nw68fxzjpm.1","apa":"Etheridge, A., & Barton, N. H. (2017). Data for: Establishment in a new habitat by polygenic adaptation. Mendeley Data. https://doi.org/10.17632/nw68fxzjpm.1","ieee":"A. Etheridge and N. H. Barton, “Data for: Establishment in a new habitat by polygenic adaptation.” Mendeley Data, 2017.","short":"A. Etheridge, N.H. Barton, (2017)."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","type":"research_data_reference","status":"public","_id":"9842"},{"oa_version":"Published Version","abstract":[{"text":"Restriction-modification (RM) represents the simplest and possibly the most widespread mechanism of self/non-self discrimination in nature. In order to provide bacteria with immunity against bacteriophages and other parasitic genetic elements, RM systems rely on a balance between two enzymes: the restriction enzyme, which cleaves non-self DNA at specific restriction sites, and the modification enzyme, which tags the host’s DNA as self and thus protects it from cleavage. In this thesis, I use population and single-cell level experiments in combination with mathematical modeling to study different aspects of the interplay between RM systems, bacteria and bacteriophages. First, I analyze how mutations in phage restriction sites affect the probability of phage escape – an inherently stochastic process, during which phages accidently get modified instead of restricted. Next, I use single-cell experiments to show that RM systems can, with a low probability, attack the genome of their bacterial host and that this primitive form of autoimmunity leads to a tradeoff between the evolutionary cost and benefit of RM systems. Finally, I investigate the nature of interactions between bacteria, RM systems and temperate bacteriophages to find that, as a consequence of phage escape and its impact on population dynamics, RM systems can promote acquisition of symbiotic bacteriophages, rather than limit it. The results presented here uncover new fundamental biological properties of RM systems and highlight their importance in the ecology and evolution of bacteria, bacteriophages and their interactions.","lang":"eng"}],"month":"10","alternative_title":["ISTA Thesis"],"file":[{"file_id":"4710","checksum":"33cfb59674e91f82e3738396d3fb3776","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2018-916-v1+3_2017_Pleska_Maros_Thesis.pdf","date_created":"2018-12-12T10:08:48Z","creator":"system","file_size":18569590,"date_updated":"2020-07-14T12:45:24Z"},{"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","access_level":"closed","relation":"source_file","file_id":"6204","checksum":"dcc239968decb233e7f98cf1083d8c26","date_updated":"2020-07-14T12:45:24Z","file_size":2801649,"creator":"dernst","date_created":"2019-04-05T08:33:14Z","file_name":"2017_Pleska_Maros_Thesis.docx"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"publication_status":"published","degree_awarded":"PhD","related_material":{"record":[{"status":"public","id":"1243","relation":"part_of_dissertation"},{"status":"public","id":"561","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"457","status":"public"}]},"_id":"202","status":"public","pubrep_id":"916","type":"dissertation","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["576","579"],"supervisor":[{"orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C","last_name":"Guet","first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-09-15T12:04:56Z","department":[{"_id":"CaGu"}],"file_date_updated":"2020-07-14T12:45:24Z","acknowledgement":"During my PhD studies, I received help from many people, all of which unfortunately cannot be listed here. I thank them deeply and hope that I never made them regret their kindness.\r\nI would like to express my deepest gratitude to Călin Guet, who went far beyond his responsibilities as an advisor and was to me also a great mentor and a friend. Călin never questioned my potential or lacked compassion and I cannot thank him enough for cultivating in me an independent scientist. I was amazed by his ability to recognize the most fascinating scientific problems in objects of study that others would find mundane. I hope I adopted at least a fraction of this ability.\r\nI will be forever grateful to Bruce Levin for all his support and especially for giving me the best possible example of how one can practice excellent science with humor and style. Working with Bruce was a true privilege.\r\nI thank Jonathan Bollback and Gašper Tkačik for serving in my PhD committee and the Austrian Academy of Science for funding my PhD research via the DOC fellowship.\r\nI thank all our lab members: Tobias Bergmiller for his guidance, especially in the first years of my research, and for being a good friend throughout; Remy Chait for staying in the lab at unreasonable hours and for the good laughs at bad jokes we shared; Anna Staron for supportively listening to my whines whenever I had to run a gel; Magdalena Steinrück for her pioneering work in the lab; Kathrin Tomasek for keeping the entropic forces in check and for her FACS virtuosity; Isabella Tomanek for always being nice to me, no matter how much bench space I took from her.\r\nI thank all my collaborators: Reiko Okura and Yuichi Wakamoto for performing and analyzing the microfluidic experiments; Long Qian and Edo Kussell for their bioinformatics analysis; Dominik Refardt for the λ kan phage; Moritz for his help with the mathematical modeling. I thank Fabienne Jesse for her tireless editorial work on all our manuscripts.\r\nFinally, I would like to thank my family and especially my wife Edita, who sacrificed a lot so that I can pursue my goals and dreams.\r\n","publisher":"Institute of Science and Technology Austria","oa":1,"day":"01","has_accepted_license":"1","year":"2017","date_published":"2017-10-01T00:00:00Z","doi":"10.15479/AT:ISTA:th_916","date_created":"2018-12-11T11:45:10Z","page":"126","project":[{"name":"Effects of Stochasticity on the Function of Restriction-Modi cation Systems at the Single-Cell Level (DOC Fellowship)","grant_number":"24210","_id":"251D65D8-B435-11E9-9278-68D0E5697425"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ieee":"M. Pleska, “Biology of restriction-modification systems at the single-cell and population level,” Institute of Science and Technology Austria, 2017.","short":"M. Pleska, Biology of Restriction-Modification Systems at the Single-Cell and Population Level, Institute of Science and Technology Austria, 2017.","apa":"Pleska, M. (2017). Biology of restriction-modification systems at the single-cell and population level. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_916","ama":"Pleska M. Biology of restriction-modification systems at the single-cell and population level. 2017. doi:10.15479/AT:ISTA:th_916","mla":"Pleska, Maros. Biology of Restriction-Modification Systems at the Single-Cell and Population Level. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_916.","ista":"Pleska M. 2017. Biology of restriction-modification systems at the single-cell and population level. Institute of Science and Technology Austria.","chicago":"Pleska, Maros. “Biology of Restriction-Modification Systems at the Single-Cell and Population Level.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_916."},"title":"Biology of restriction-modification systems at the single-cell and population level","publist_id":"7711","author":[{"orcid":"0000-0001-7460-7479","full_name":"Pleska, Maros","last_name":"Pleska","first_name":"Maros","id":"4569785E-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No"},{"oa":1,"publisher":"Institute of Science and Technology Austria","day":"27","year":"2017","has_accepted_license":"1","date_created":"2019-04-09T15:04:32Z","doi":"10.15479/AT:ISTA:th_873","date_published":"2017-10-27T00:00:00Z","page":"86","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Nikitenko, Anton. Discrete Morse Theory for Random Complexes . Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_873.","short":"A. Nikitenko, Discrete Morse Theory for Random Complexes , Institute of Science and Technology Austria, 2017.","ieee":"A. Nikitenko, “Discrete Morse theory for random complexes ,” Institute of Science and Technology Austria, 2017.","apa":"Nikitenko, A. (2017). Discrete Morse theory for random complexes . Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_873","ama":"Nikitenko A. Discrete Morse theory for random complexes . 2017. doi:10.15479/AT:ISTA:th_873","chicago":"Nikitenko, Anton. “Discrete Morse Theory for Random Complexes .” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_873.","ista":"Nikitenko A. 2017. Discrete Morse theory for random complexes . Institute of Science and Technology Austria."},"title":"Discrete Morse theory for random complexes ","article_processing_charge":"No","author":[{"last_name":"Nikitenko","orcid":"0000-0002-0659-3201","full_name":"Nikitenko, Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","first_name":"Anton"}],"oa_version":"Published Version","abstract":[{"text":"The main objects considered in the present work are simplicial and CW-complexes with vertices forming a random point cloud. In particular, we consider a Poisson point process in R^n and study Delaunay and Voronoi complexes of the first and higher orders and weighted Delaunay complexes obtained as sections of Delaunay complexes, as well as the Čech complex. Further, we examine theDelaunay complex of a Poisson point process on the sphere S^n, as well as of a uniform point cloud, which is equivalent to the convex hull, providing a connection to the theory of random polytopes. Each of the complexes in question can be endowed with a radius function, which maps its cells to the radii of appropriately chosen circumspheres, called the radius of the cell. Applying and developing discrete Morse theory for these functions, joining it together with probabilistic and sometimes analytic machinery, and developing several integral geometric tools, we aim at getting the distributions of circumradii of typical cells. For all considered complexes, we are able to generalize and obtain up to constants the distribution of radii of typical intervals of all types. In low dimensions the constants can be computed explicitly, thus providing the explicit expressions for the expected numbers of cells. In particular, it allows to find the expected density of simplices of every dimension for a Poisson point process in R^4, whereas the result for R^3 was known already in 1970's.","lang":"eng"}],"month":"10","alternative_title":["ISTA Thesis"],"language":[{"iso":"eng"}],"file":[{"date_updated":"2020-07-14T12:47:26Z","file_size":2324870,"creator":"dernst","date_created":"2019-04-09T14:54:51Z","file_name":"2017_Thesis_Nikitenko.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"6289","checksum":"ece7e598a2f060b263c2febf7f3fe7f9"},{"checksum":"99b7ad76e317efd447af60f91e29b49b","file_id":"6290","relation":"source_file","access_level":"closed","content_type":"application/zip","file_name":"2017_Thesis_Nikitenko_source.zip","date_created":"2019-04-09T14:54:51Z","creator":"dernst","file_size":2863219,"date_updated":"2020-07-14T12:47:26Z"}],"publication_status":"published","degree_awarded":"PhD","publication_identifier":{"issn":["2663-337X"]},"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"718"},{"status":"public","id":"5678","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"87","status":"public"}]},"_id":"6287","pubrep_id":"873","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"dissertation","ddc":["514","516","519"],"date_updated":"2023-09-15T12:10:34Z","supervisor":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"file_date_updated":"2020-07-14T12:47:26Z","department":[{"_id":"HeEd"}]},{"title":"Identification of novel regulators of PIN polarity and development of novel auxin sensor","publist_id":"6233","author":[{"first_name":"Tomas","id":"3DA3BFEE-F248-11E8-B48F-1D18A9856A87","full_name":"Prat, Tomas","last_name":"Prat"}],"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Prat T. 2017. Identification of novel regulators of PIN polarity and development of novel auxin sensor. Institute of Science and Technology Austria.","chicago":"Prat, Tomas. “Identification of Novel Regulators of PIN Polarity and Development of Novel Auxin Sensor.” Institute of Science and Technology Austria, 2017.","apa":"Prat, T. (2017). Identification of novel regulators of PIN polarity and development of novel auxin sensor. Institute of Science and Technology Austria.","ama":"Prat T. Identification of novel regulators of PIN polarity and development of novel auxin sensor. 2017.","ieee":"T. Prat, “Identification of novel regulators of PIN polarity and development of novel auxin sensor,” Institute of Science and Technology Austria, 2017.","short":"T. Prat, Identification of Novel Regulators of PIN Polarity and Development of Novel Auxin Sensor, Institute of Science and Technology Austria, 2017.","mla":"Prat, Tomas. Identification of Novel Regulators of PIN Polarity and Development of Novel Auxin Sensor. Institute of Science and Technology Austria, 2017."},"publisher":"Institute of Science and Technology Austria","oa":1,"acknowledgement":"I would like to first acknowledge my supervisor Jiří Friml for support, kind advice and patience. It was a pleasure to be a part of your lab, Jiří. I will remember the atmosphere present in auxin lab at VIB in Ghent and at IST in Klosterneuburg forever. I would like to thank all past and present lab members for the friendship and friendly and scientific environment in the groups. It was so nice to cooperate with you, guys. There was always someone who helped me with experiments, troubleshoot issues coming from our work etc. At this place, I would like to thank especially to Gergo Molnár. I’m happy (and lucky) that I have met him; he naturally became my tutor and guide through my PhD. From no one else during my entire professional career, I’ve learned that much.","date_published":"2017-01-12T00:00:00Z","date_created":"2018-12-11T11:50:17Z","page":"131","day":"12","has_accepted_license":"1","year":"2017","status":"public","type":"dissertation","_id":"1127","department":[{"_id":"JiFr"}],"file_date_updated":"2021-02-22T11:52:56Z","ddc":["580"],"supervisor":[{"first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596","last_name":"Friml"}],"date_updated":"2023-09-19T10:39:33Z","month":"01","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Plant hormone auxin and its transport between cells belong to the most important\r\nmechanisms controlling plant development. Auxin itself could change localization of PINs and\r\nthereby control direction of its own flow. We performed an expression profiling experiment\r\nin Arabidopsis roots to identify potential regulators of PIN polarity which are transcriptionally\r\nregulated by auxin signalling. We identified several novel regulators and performed a detailed\r\ncharacterization of the transcription factor WRKY23 (At2g47260) and its role in auxin\r\nfeedback on PIN polarity. Gain-of-function and dominant-negative mutants revealed that\r\nWRKY23 plays a crucial role in mediating the auxin effect on PIN polarity. In concordance,\r\ntypical polar auxin transport processes such as gravitropism and leaf vascular pattern\r\nformation were disturbed by interfering with WRKY23 function.\r\nIn order to identify direct targets of WRKY23, we performed consequential expression\r\nprofiling experiments using a WRKY23 inducible gain-of-function line and dominant-negative\r\nWRKY23 line that is defunct in PIN re-arrangement. Among several genes mostly related to\r\nthe groups of cell wall and defense process regulators, we identified LYSINE-HISTIDINE\r\nTRANSPORTER 1 (LHT1; At5g40780), a small amino acid permease gene from the amino\r\nacid/auxin permease family (AAAP), we present its detailed characterisation in auxin feedback\r\non PIN repolarization, identified its transcriptional regulation, we propose a potential\r\nmechanism of its action. Moreover, we identified also a member of receptor-like protein\r\nkinase LRR-RLK (LEUCINE-RICH REPEAT TRANSMEMBRANE PROTEIN KINASE PROTEIN 1;\r\nLRRK1; At1g05700), which also affects auxin-dependent PIN re-arrangement. We described\r\nits transcriptional behaviour, subcellular localization. Based on global expression data, we\r\ntried to identify ligand responsible for mechanism of signalling and suggest signalling partner\r\nand interactors. Additionally, we described role of novel phytohormone group, strigolactone,\r\nin auxin-dependent PIN re-arrangement, that could be a fundament for future studies in this\r\nfield.\r\nOur results provide first insights into an auxin transcriptional network targeting PIN\r\nlocalization and thus regulating plant development. We highlighted WRKY23 transcriptional\r\nnetwork and characterised its mediatory role in plant development. We identified direct\r\neffectors of this network, LHT1 and LRRK1, and describe their roles in PIN re-arrangement and\r\nPIN-dependent auxin transport processes."}],"related_material":{"record":[{"id":"449","status":"public","relation":"part_of_dissertation"}]},"file":[{"date_updated":"2019-04-05T08:45:14Z","file_size":10285946,"creator":"dernst","date_created":"2019-04-05T08:45:14Z","file_name":"IST_Austria_Thesis_Tomáš_Prát.pdf","content_type":"application/pdf","access_level":"closed","relation":"main_file","checksum":"d192c7c6c5ea32c8432437286dc4909e","file_id":"6209"},{"creator":"dernst","date_updated":"2021-02-22T11:52:56Z","file_size":9802991,"date_created":"2021-02-22T11:52:56Z","file_name":"2017_Thesis_Prat.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"9185","checksum":"bab18b52cf98145926042d8ed99fdb3b","success":1}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"publication_status":"published","degree_awarded":"PhD"},{"department":[{"_id":"GaTk"}],"date_updated":"2023-09-19T15:13:27Z","status":"public","type":"journal_article","_id":"2016","volume":44,"issue":"2","related_material":{"record":[{"id":"6473","status":"public","relation":"part_of_dissertation"}]},"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["03036898"]},"intvolume":" 44","month":"06","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1410.1242"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"text":"The Ising model is one of the simplest and most famous models of interacting systems. It was originally proposed to model ferromagnetic interactions in statistical physics and is now widely used to model spatial processes in many areas such as ecology, sociology, and genetics, usually without testing its goodness-of-fit. Here, we propose an exact goodness-of-fit test for the finite-lattice Ising model. The theory of Markov bases has been developed in algebraic statistics for exact goodness-of-fit testing using a Monte Carlo approach. However, this beautiful theory has fallen short of its promise for applications, because finding a Markov basis is usually computationally intractable. We develop a Monte Carlo method for exact goodness-of-fit testing for the Ising model which avoids computing a Markov basis and also leads to a better connectivity of the Markov chain and hence to a faster convergence. We show how this method can be applied to analyze the spatial organization of receptors on the cell membrane.","lang":"eng"}],"title":"Exact goodness-of-fit testing for the Ising model","external_id":{"arxiv":["1410.1242"],"isi":["000400985000001"]},"article_processing_charge":"No","publist_id":"5060","author":[{"first_name":"Abraham","last_name":"Martin Del Campo Sanchez","full_name":"Martin Del Campo Sanchez, Abraham"},{"full_name":"Cepeda Humerez, Sarah A","last_name":"Cepeda Humerez","id":"3DEE19A4-F248-11E8-B48F-1D18A9856A87","first_name":"Sarah A"},{"last_name":"Uhler","orcid":"0000-0002-7008-0216","full_name":"Uhler, Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"apa":"Martin Del Campo Sanchez, A., Cepeda Humerez, S. A., & Uhler, C. (2017). Exact goodness-of-fit testing for the Ising model. Scandinavian Journal of Statistics. Wiley-Blackwell. https://doi.org/10.1111/sjos.12251","ama":"Martin Del Campo Sanchez A, Cepeda Humerez SA, Uhler C. Exact goodness-of-fit testing for the Ising model. Scandinavian Journal of Statistics. 2017;44(2):285-306. doi:10.1111/sjos.12251","ieee":"A. Martin Del Campo Sanchez, S. A. Cepeda Humerez, and C. Uhler, “Exact goodness-of-fit testing for the Ising model,” Scandinavian Journal of Statistics, vol. 44, no. 2. Wiley-Blackwell, pp. 285–306, 2017.","short":"A. Martin Del Campo Sanchez, S.A. Cepeda Humerez, C. Uhler, Scandinavian Journal of Statistics 44 (2017) 285–306.","mla":"Martin Del Campo Sanchez, Abraham, et al. “Exact Goodness-of-Fit Testing for the Ising Model.” Scandinavian Journal of Statistics, vol. 44, no. 2, Wiley-Blackwell, 2017, pp. 285–306, doi:10.1111/sjos.12251.","ista":"Martin Del Campo Sanchez A, Cepeda Humerez SA, Uhler C. 2017. Exact goodness-of-fit testing for the Ising model. Scandinavian Journal of Statistics. 44(2), 285–306.","chicago":"Martin Del Campo Sanchez, Abraham, Sarah A Cepeda Humerez, and Caroline Uhler. “Exact Goodness-of-Fit Testing for the Ising Model.” Scandinavian Journal of Statistics. Wiley-Blackwell, 2017. https://doi.org/10.1111/sjos.12251."},"date_created":"2018-12-11T11:55:13Z","doi":"10.1111/sjos.12251","date_published":"2017-06-01T00:00:00Z","page":"285 - 306","publication":"Scandinavian Journal of Statistics","day":"01","year":"2017","isi":1,"oa":1,"publisher":"Wiley-Blackwell","quality_controlled":"1"},{"acknowledgement":"Z. Bao was supported by ERC Advanced Grant RANMAT No. 338804; L. Erdős was partially supported by ERC Advanced Grant RANMAT No. 338804.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria). The authors are very grateful to the anonymous referees for careful reading and valuable comments, which helped to improve the organization.","quality_controlled":"1","publisher":"Springer","oa":1,"day":"01","publication":"Probability Theory and Related Fields","has_accepted_license":"1","isi":1,"year":"2017","date_published":"2017-04-01T00:00:00Z","doi":"10.1007/s00440-015-0692-y","date_created":"2018-12-11T11:52:32Z","page":"673 - 776","project":[{"name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Bao, Zhigang, and László Erdös. “Delocalization for a Class of Random Block Band Matrices.” Probability Theory and Related Fields. Springer, 2017. https://doi.org/10.1007/s00440-015-0692-y.","ista":"Bao Z, Erdös L. 2017. Delocalization for a class of random block band matrices. Probability Theory and Related Fields. 167(3–4), 673–776.","mla":"Bao, Zhigang, and László Erdös. “Delocalization for a Class of Random Block Band Matrices.” Probability Theory and Related Fields, vol. 167, no. 3–4, Springer, 2017, pp. 673–776, doi:10.1007/s00440-015-0692-y.","ieee":"Z. Bao and L. Erdös, “Delocalization for a class of random block band matrices,” Probability Theory and Related Fields, vol. 167, no. 3–4. Springer, pp. 673–776, 2017.","short":"Z. Bao, L. Erdös, Probability Theory and Related Fields 167 (2017) 673–776.","apa":"Bao, Z., & Erdös, L. (2017). Delocalization for a class of random block band matrices. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-015-0692-y","ama":"Bao Z, Erdös L. Delocalization for a class of random block band matrices. Probability Theory and Related Fields. 2017;167(3-4):673-776. doi:10.1007/s00440-015-0692-y"},"title":"Delocalization for a class of random block band matrices","author":[{"id":"442E6A6C-F248-11E8-B48F-1D18A9856A87","first_name":"Zhigang","orcid":"0000-0003-3036-1475","full_name":"Bao, Zhigang","last_name":"Bao"},{"full_name":"Erdös, László","orcid":"0000-0001-5366-9603","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László"}],"publist_id":"5644","external_id":{"isi":["000398842700004"]},"article_processing_charge":"Yes (via OA deal)","oa_version":"Published Version","abstract":[{"lang":"eng","text":"We consider N×N Hermitian random matrices H consisting of blocks of size M≥N6/7. The matrix elements are i.i.d. within the blocks, close to a Gaussian in the four moment matching sense, but their distribution varies from block to block to form a block-band structure, with an essential band width M. We show that the entries of the Green’s function G(z)=(H−z)−1 satisfy the local semicircle law with spectral parameter z=E+iη down to the real axis for any η≫N−1, using a combination of the supersymmetry method inspired by Shcherbina (J Stat Phys 155(3): 466–499, 2014) and the Green’s function comparison strategy. Previous estimates were valid only for η≫M−1. The new estimate also implies that the eigenvectors in the middle of the spectrum are fully delocalized."}],"month":"04","intvolume":" 167","scopus_import":"1","file":[{"file_id":"4665","checksum":"67afa85ff1e220cbc1f9f477a828513c","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2016-489-v1+1_s00440-015-0692-y.pdf","date_created":"2018-12-12T10:08:05Z","creator":"system","file_size":1615755,"date_updated":"2020-07-14T12:45:00Z"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["01788051"]},"publication_status":"published","issue":"3-4","volume":167,"ec_funded":1,"_id":"1528","status":"public","pubrep_id":"489","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["530"],"date_updated":"2023-09-20T09:42:12Z","department":[{"_id":"LaEr"}],"file_date_updated":"2020-07-14T12:45:00Z"},{"title":"Phat - Persistent homology algorithms toolbox","author":[{"full_name":"Bauer, Ulrich","last_name":"Bauer","first_name":"Ulrich"},{"last_name":"Kerber","full_name":"Kerber, Michael","first_name":"Michael"},{"first_name":"Jan","full_name":"Reininghaus, Jan","last_name":"Reininghaus"},{"full_name":"Wagner, Hubert","last_name":"Wagner","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","first_name":"Hubert"}],"publist_id":"5765","article_processing_charge":"No","external_id":{"isi":["000384396000005"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ama":"Bauer U, Kerber M, Reininghaus J, Wagner H. Phat - Persistent homology algorithms toolbox. Journal of Symbolic Computation. 2017;78:76-90. doi:10.1016/j.jsc.2016.03.008","apa":"Bauer, U., Kerber, M., Reininghaus, J., & Wagner, H. (2017). Phat - Persistent homology algorithms toolbox. Journal of Symbolic Computation. Academic Press. https://doi.org/10.1016/j.jsc.2016.03.008","short":"U. Bauer, M. Kerber, J. Reininghaus, H. Wagner, Journal of Symbolic Computation 78 (2017) 76–90.","ieee":"U. Bauer, M. Kerber, J. Reininghaus, and H. Wagner, “Phat - Persistent homology algorithms toolbox,” Journal of Symbolic Computation, vol. 78. Academic Press, pp. 76–90, 2017.","mla":"Bauer, Ulrich, et al. “Phat - Persistent Homology Algorithms Toolbox.” Journal of Symbolic Computation, vol. 78, Academic Press, 2017, pp. 76–90, doi:10.1016/j.jsc.2016.03.008.","ista":"Bauer U, Kerber M, Reininghaus J, Wagner H. 2017. Phat - Persistent homology algorithms toolbox. Journal of Symbolic Computation. 78, 76–90.","chicago":"Bauer, Ulrich, Michael Kerber, Jan Reininghaus, and Hubert Wagner. “Phat - Persistent Homology Algorithms Toolbox.” Journal of Symbolic Computation. Academic Press, 2017. https://doi.org/10.1016/j.jsc.2016.03.008."},"project":[{"name":"Topological Complex Systems","grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"date_published":"2017-01-01T00:00:00Z","doi":"10.1016/j.jsc.2016.03.008","date_created":"2018-12-11T11:51:59Z","page":"76 - 90","day":"01","publication":"Journal of Symbolic Computation","isi":1,"year":"2017","publisher":"Academic Press","quality_controlled":"1","oa":1,"department":[{"_id":"HeEd"}],"date_updated":"2023-09-20T09:42:40Z","status":"public","article_type":"original","type":"journal_article","_id":"1433","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"10894"}]},"volume":78,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"issn":[" 07477171"]},"publication_status":"published","month":"01","intvolume":" 78","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.jsc.2016.03.008"}],"oa_version":"Published Version","abstract":[{"text":"Phat is an open-source C. ++ library for the computation of persistent homology by matrix reduction, targeted towards developers of software for topological data analysis. We aim for a simple generic design that decouples algorithms from data structures without sacrificing efficiency or user-friendliness. We provide numerous different reduction strategies as well as data types to store and manipulate the boundary matrix. We compare the different combinations through extensive experimental evaluation and identify optimization techniques that work well in practical situations. We also compare our software with various other publicly available libraries for persistent homology.","lang":"eng"}]},{"author":[{"last_name":"Svoreňová","full_name":"Svoreňová, Mária","first_name":"Mária"},{"last_name":"Kretinsky","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","full_name":"Chmelik, Martin","last_name":"Chmelik"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Cěrná, Ivana","last_name":"Cěrná","first_name":"Ivana"},{"full_name":"Belta, Cǎlin","last_name":"Belta","first_name":"Cǎlin"}],"publist_id":"5800","article_processing_charge":"No","external_id":{"arxiv":["1410.5387"],"isi":["000390637000014"]},"title":"Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games","citation":{"chicago":"Svoreňová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” Nonlinear Analysis: Hybrid Systems. Elsevier, 2017. https://doi.org/10.1016/j.nahs.2016.04.006.","ista":"Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. 2017. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. 23(2), 230–253.","mla":"Svoreňová, Mária, et al. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” Nonlinear Analysis: Hybrid Systems, vol. 23, no. 2, Elsevier, 2017, pp. 230–53, doi:10.1016/j.nahs.2016.04.006.","ieee":"M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, and C. Belta, “Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games,” Nonlinear Analysis: Hybrid Systems, vol. 23, no. 2. Elsevier, pp. 230–253, 2017.","short":"M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, C. Belta, Nonlinear Analysis: Hybrid Systems 23 (2017) 230–253.","ama":"Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. 2017;23(2):230-253. doi:10.1016/j.nahs.2016.04.006","apa":"Svoreňová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., & Belta, C. (2017). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. Elsevier. https://doi.org/10.1016/j.nahs.2016.04.006"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"page":"230 - 253","date_published":"2017-02-01T00:00:00Z","doi":"10.1016/j.nahs.2016.04.006","date_created":"2018-12-11T11:51:50Z","isi":1,"year":"2017","day":"01","publication":"Nonlinear Analysis: Hybrid Systems","quality_controlled":"1","publisher":"Elsevier","oa":1,"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_updated":"2023-09-20T09:43:09Z","type":"journal_article","status":"public","_id":"1407","related_material":{"record":[{"id":"1689","status":"public","relation":"earlier_version"}]},"issue":"2","volume":23,"ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1410.5387"}],"month":"02","intvolume":" 23","abstract":[{"lang":"eng","text":"We consider the problem of computing the set of initial states of a dynamical system such that there exists a control strategy to ensure that the trajectories satisfy a temporal logic specification with probability 1 (almost-surely). We focus on discrete-time, stochastic linear dynamics and specifications given as formulas of the Generalized Reactivity(1) fragment of Linear Temporal Logic over linear predicates in the states of the system. We propose a solution based on iterative abstraction-refinement, and turn-based 2-player probabilistic games. While the theoretical guarantee of our algorithm after any finite number of iterations is only a partial solution, we show that if our algorithm terminates, then the result is the set of all satisfying initial states. Moreover, for any (partial) solution our algorithm synthesizes witness control strategies to ensure almost-sure satisfaction of the temporal logic specification. While the proposed algorithm guarantees progress and soundness in every iteration, it is computationally demanding. We offer an alternative, more efficient solution for the reachability properties that decomposes the problem into a series of smaller problems of the same type. All algorithms are demonstrated on an illustrative case study."}],"oa_version":"Preprint"},{"title":"Adaptive physically based models in computer graphics","publist_id":"5873","author":[{"first_name":"Pierre","full_name":"Manteaux, Pierre","last_name":"Manteaux"},{"last_name":"Wojtan","orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Narain, Rahul","last_name":"Narain","first_name":"Rahul"},{"first_name":"Stéphane","last_name":"Redon","full_name":"Redon, Stéphane"},{"full_name":"Faure, François","last_name":"Faure","first_name":"François"},{"first_name":"Marie","last_name":"Cani","full_name":"Cani, Marie"}],"article_processing_charge":"No","external_id":{"isi":["000408634200019"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Manteaux, Pierre, et al. “Adaptive Physically Based Models in Computer Graphics.” Computer Graphics Forum, vol. 36, no. 6, Wiley-Blackwell, 2017, pp. 312–37, doi:10.1111/cgf.12941.","apa":"Manteaux, P., Wojtan, C., Narain, R., Redon, S., Faure, F., & Cani, M. (2017). Adaptive physically based models in computer graphics. Computer Graphics Forum. Wiley-Blackwell. https://doi.org/10.1111/cgf.12941","ama":"Manteaux P, Wojtan C, Narain R, Redon S, Faure F, Cani M. Adaptive physically based models in computer graphics. Computer Graphics Forum. 2017;36(6):312-337. doi:10.1111/cgf.12941","short":"P. Manteaux, C. Wojtan, R. Narain, S. Redon, F. Faure, M. Cani, Computer Graphics Forum 36 (2017) 312–337.","ieee":"P. Manteaux, C. Wojtan, R. Narain, S. Redon, F. Faure, and M. Cani, “Adaptive physically based models in computer graphics,” Computer Graphics Forum, vol. 36, no. 6. Wiley-Blackwell, pp. 312–337, 2017.","chicago":"Manteaux, Pierre, Chris Wojtan, Rahul Narain, Stéphane Redon, François Faure, and Marie Cani. “Adaptive Physically Based Models in Computer Graphics.” Computer Graphics Forum. Wiley-Blackwell, 2017. https://doi.org/10.1111/cgf.12941.","ista":"Manteaux P, Wojtan C, Narain R, Redon S, Faure F, Cani M. 2017. Adaptive physically based models in computer graphics. Computer Graphics Forum. 36(6), 312–337."},"quality_controlled":"1","publisher":"Wiley-Blackwell","oa":1,"acknowledgement":"This work was partly supported by the starting grants ADAPT and BigSplash, as well as the advanced grant EXPRESSIVE from the European Research Council (ERC-2012-StG_20111012, ERC-2014-StG_638176 and ERC-2011-ADG_20110209).","doi":"10.1111/cgf.12941","date_published":"2017-09-01T00:00:00Z","date_created":"2018-12-11T11:51:37Z","page":"312 - 337","day":"01","publication":"Computer Graphics Forum","has_accepted_license":"1","isi":1,"year":"2017","status":"public","pubrep_id":"634","type":"journal_article","_id":"1367","department":[{"_id":"ChWo"}],"file_date_updated":"2020-07-14T12:44:47Z","ddc":["000"],"date_updated":"2023-09-20T11:05:36Z","month":"09","intvolume":" 36","scopus_import":"1","oa_version":"Submitted Version","abstract":[{"text":"One of the major challenges in physically based modelling is making simulations efficient. Adaptive models provide an essential solution to these efficiency goals. These models are able to self-adapt in space and time, attempting to provide the best possible compromise between accuracy and speed. This survey reviews the adaptive solutions proposed so far in computer graphics. Models are classified according to the strategy they use for adaptation, from time-stepping and freezing techniques to geometric adaptivity in the form of structured grids, meshes and particles. Applications range from fluids, through deformable bodies, to articulated solids.","lang":"eng"}],"volume":36,"issue":"6","file":[{"date_created":"2018-12-12T10:16:21Z","file_name":"IST-2016-634-v1+1_starAdaptivity-cgf.pdf","creator":"system","date_updated":"2020-07-14T12:44:47Z","file_size":1434439,"checksum":"7676e9a9ead6d58c3000988c97deb2ef","file_id":"5208","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["01677055"]},"publication_status":"published"},{"oa":1,"quality_controlled":"1","publisher":"Springer","publication":"Formal Methods in System Design","day":"01","year":"2017","isi":1,"has_accepted_license":"1","date_created":"2018-12-11T11:51:27Z","doi":"10.1007/s10703-016-0256-5","date_published":"2017-06-01T00:00:00Z","page":"97 - 139","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ama":"Cerny P, Clarke E, Henzinger TA, et al. From non-preemptive to preemptive scheduling using synchronization synthesis. Formal Methods in System Design. 2017;50(2-3):97-139. doi:10.1007/s10703-016-0256-5","apa":"Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta, R., & Tarrach, T. (2017). From non-preemptive to preemptive scheduling using synchronization synthesis. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-016-0256-5","short":"P. Cerny, E. Clarke, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, R. Samanta, T. Tarrach, Formal Methods in System Design 50 (2017) 97–139.","ieee":"P. Cerny et al., “From non-preemptive to preemptive scheduling using synchronization synthesis,” Formal Methods in System Design, vol. 50, no. 2–3. Springer, pp. 97–139, 2017.","mla":"Cerny, Pavol, et al. “From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis.” Formal Methods in System Design, vol. 50, no. 2–3, Springer, 2017, pp. 97–139, doi:10.1007/s10703-016-0256-5.","ista":"Cerny P, Clarke E, Henzinger TA, Radhakrishna A, Ryzhyk L, Samanta R, Tarrach T. 2017. From non-preemptive to preemptive scheduling using synchronization synthesis. Formal Methods in System Design. 50(2–3), 97–139.","chicago":"Cerny, Pavol, Edmund Clarke, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, and Thorsten Tarrach. “From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis.” Formal Methods in System Design. Springer, 2017. https://doi.org/10.1007/s10703-016-0256-5."},"title":"From non-preemptive to preemptive scheduling using synchronization synthesis","article_processing_charge":"No","external_id":{"isi":["000399888900001"]},"publist_id":"5929","author":[{"full_name":"Cerny, Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol"},{"last_name":"Clarke","full_name":"Clarke, Edmund","first_name":"Edmund"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna"},{"first_name":"Leonid","last_name":"Ryzhyk","full_name":"Ryzhyk, Leonid"},{"full_name":"Samanta, Roopsha","last_name":"Samanta","first_name":"Roopsha","id":"3D2AAC08-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Tarrach","orcid":"0000-0003-4409-8487","full_name":"Tarrach, Thorsten","id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87","first_name":"Thorsten"}],"oa_version":"Published Version","abstract":[{"text":"We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is implicit, inferred from the non-preemptive behavior. Let us consider sequences of calls that the program makes to an external interface. The specification requires that any such sequence produced under a preemptive scheduler should be included in the set of sequences produced under a non-preemptive scheduler. We guarantee that our synthesis does not introduce deadlocks and that the synchronization inserted is optimal w.r.t. a given objective function. The solution is based on a finitary abstraction, an algorithm for bounded language inclusion modulo an independence relation, and generation of a set of global constraints over synchronization placements. Each model of the global constraints set corresponds to a correctness-ensuring synchronization placement. The placement that is optimal w.r.t. the given objective function is chosen as the synchronization solution. We apply the approach to device-driver programming, where the driver threads call the software interface of the device and the API provided by the operating system. Our experiments demonstrate that our synthesis method is precise and efficient. The implicit specification helped us find one concurrency bug previously missed when model-checking using an explicit, user-provided specification. We implemented objective functions for coarse-grained and fine-grained locking and observed that different synchronization placements are produced for our experiments, favoring a minimal number of synchronization operations or maximum concurrency, respectively.","lang":"eng"}],"intvolume":" 50","month":"06","scopus_import":"1","language":[{"iso":"eng"}],"file":[{"file_id":"4985","checksum":"1163dfd997e8212c789525d4178b1653","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:13:05Z","file_name":"IST-2016-656-v1+1_s10703-016-0256-5.pdf","date_updated":"2020-07-14T12:44:44Z","file_size":1416170,"creator":"system"}],"publication_status":"published","ec_funded":1,"volume":50,"related_material":{"record":[{"relation":"earlier_version","id":"1729","status":"public"}]},"issue":"2-3","_id":"1338","pubrep_id":"656","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","ddc":["000"],"date_updated":"2023-09-20T11:13:51Z","file_date_updated":"2020-07-14T12:44:44Z","department":[{"_id":"ToHe"}]},{"oa":1,"quality_controlled":"1","publisher":"Springer","page":"765 - 787","date_created":"2018-12-11T11:51:32Z","date_published":"2017-12-01T00:00:00Z","doi":"10.1007/s00236-016-0278-x","year":"2017","has_accepted_license":"1","isi":1,"publication":"Acta Informatica","day":"01","project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"grant_number":"618091","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"},{"name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000414343200003"]},"article_processing_charge":"No","publist_id":"5898","author":[{"last_name":"Giacobbe","orcid":"0000-0001-8180-0904","full_name":"Giacobbe, Mirco","first_name":"Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052","last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C"},{"full_name":"Gupta, Ashutosh","last_name":"Gupta","id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","first_name":"Tiago","last_name":"Paixao","full_name":"Paixao, Tiago","orcid":"0000-0003-2361-3953"},{"id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","first_name":"Tatjana","orcid":"0000-0002-9041-0905","full_name":"Petrov, Tatjana","last_name":"Petrov"}],"title":"Model checking the evolution of gene regulatory networks","citation":{"apa":"Giacobbe, M., Guet, C. C., Gupta, A., Henzinger, T. A., Paixao, T., & Petrov, T. (2017). Model checking the evolution of gene regulatory networks. Acta Informatica. Springer. https://doi.org/10.1007/s00236-016-0278-x","ama":"Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. Model checking the evolution of gene regulatory networks. Acta Informatica. 2017;54(8):765-787. doi:10.1007/s00236-016-0278-x","short":"M. Giacobbe, C.C. Guet, A. Gupta, T.A. Henzinger, T. Paixao, T. Petrov, Acta Informatica 54 (2017) 765–787.","ieee":"M. Giacobbe, C. C. Guet, A. Gupta, T. A. Henzinger, T. Paixao, and T. Petrov, “Model checking the evolution of gene regulatory networks,” Acta Informatica, vol. 54, no. 8. Springer, pp. 765–787, 2017.","mla":"Giacobbe, Mirco, et al. “Model Checking the Evolution of Gene Regulatory Networks.” Acta Informatica, vol. 54, no. 8, Springer, 2017, pp. 765–87, doi:10.1007/s00236-016-0278-x.","ista":"Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. 2017. Model checking the evolution of gene regulatory networks. Acta Informatica. 54(8), 765–787.","chicago":"Giacobbe, Mirco, Calin C Guet, Ashutosh Gupta, Thomas A Henzinger, Tiago Paixao, and Tatjana Petrov. “Model Checking the Evolution of Gene Regulatory Networks.” Acta Informatica. Springer, 2017. https://doi.org/10.1007/s00236-016-0278-x."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","scopus_import":"1","intvolume":" 54","month":"12","abstract":[{"lang":"eng","text":"The behaviour of gene regulatory networks (GRNs) is typically analysed using simulation-based statistical testing-like methods. In this paper, we demonstrate that we can replace this approach by a formal verification-like method that gives higher assurance and scalability. We focus on Wagner’s weighted GRN model with varying weights, which is used in evolutionary biology. In the model, weight parameters represent the gene interaction strength that may change due to genetic mutations. For a property of interest, we synthesise the constraints over the parameter space that represent the set of GRNs satisfying the property. We experimentally show that our parameter synthesis procedure computes the mutational robustness of GRNs—an important problem of interest in evolutionary biology—more efficiently than the classical simulation method. We specify the property in linear temporal logic. We employ symbolic bounded model checking and SMT solving to compute the space of GRNs that satisfy the property, which amounts to synthesizing a set of linear constraints on the weights."}],"oa_version":"Published Version","ec_funded":1,"volume":54,"related_material":{"record":[{"relation":"earlier_version","id":"1835","status":"public"}]},"issue":"8","publication_status":"published","publication_identifier":{"issn":["00015903"]},"language":[{"iso":"eng"}],"file":[{"file_name":"2017_ActaInformatica_Giacobbe.pdf","date_created":"2019-01-17T15:57:29Z","file_size":755241,"date_updated":"2020-07-14T12:44:46Z","creator":"dernst","checksum":"4e661d9135d7f8c342e8e258dee76f3e","file_id":"5841","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","pubrep_id":"649","status":"public","_id":"1351","department":[{"_id":"ToHe"},{"_id":"CaGu"},{"_id":"NiBa"}],"file_date_updated":"2020-07-14T12:44:46Z","date_updated":"2023-09-20T11:06:03Z","ddc":["006","576"]},{"day":"01","publication":"Algorithmica","has_accepted_license":"1","isi":1,"year":"2017","date_published":"2017-06-01T00:00:00Z","doi":"10.1007/s00453-016-0212-1","date_created":"2018-12-11T11:51:27Z","page":"681 - 713","publisher":"Springer","quality_controlled":"1","oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Paixao, Tiago, et al. “Towards a Runtime Comparison of Natural and Artificial Evolution.” Algorithmica, vol. 78, no. 2, Springer, 2017, pp. 681–713, doi:10.1007/s00453-016-0212-1.","apa":"Paixao, T., Pérez Heredia, J., Sudholt, D., & Trubenova, B. (2017). Towards a runtime comparison of natural and artificial evolution. Algorithmica. Springer. https://doi.org/10.1007/s00453-016-0212-1","ama":"Paixao T, Pérez Heredia J, Sudholt D, Trubenova B. Towards a runtime comparison of natural and artificial evolution. Algorithmica. 2017;78(2):681-713. doi:10.1007/s00453-016-0212-1","short":"T. Paixao, J. Pérez Heredia, D. Sudholt, B. Trubenova, Algorithmica 78 (2017) 681–713.","ieee":"T. Paixao, J. Pérez Heredia, D. Sudholt, and B. Trubenova, “Towards a runtime comparison of natural and artificial evolution,” Algorithmica, vol. 78, no. 2. Springer, pp. 681–713, 2017.","chicago":"Paixao, Tiago, Jorge Pérez Heredia, Dirk Sudholt, and Barbora Trubenova. “Towards a Runtime Comparison of Natural and Artificial Evolution.” Algorithmica. Springer, 2017. https://doi.org/10.1007/s00453-016-0212-1.","ista":"Paixao T, Pérez Heredia J, Sudholt D, Trubenova B. 2017. Towards a runtime comparison of natural and artificial evolution. Algorithmica. 78(2), 681–713."},"title":"Towards a runtime comparison of natural and artificial evolution","publist_id":"5931","author":[{"last_name":"Paixao","orcid":"0000-0003-2361-3953","full_name":"Paixao, Tiago","first_name":"Tiago","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pérez Heredia, Jorge","last_name":"Pérez Heredia","first_name":"Jorge"},{"last_name":"Sudholt","full_name":"Sudholt, Dirk","first_name":"Dirk"},{"orcid":"0000-0002-6873-2967","full_name":"Trubenova, Barbora","last_name":"Trubenova","id":"42302D54-F248-11E8-B48F-1D18A9856A87","first_name":"Barbora"}],"external_id":{"isi":["000400379500013"]},"article_processing_charge":"No","project":[{"_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","grant_number":"618091"}],"file":[{"file_name":"IST-2016-658-v1+1_s00453-016-0212-1.pdf","date_created":"2018-12-12T10:10:19Z","file_size":710206,"date_updated":"2020-07-14T12:44:44Z","creator":"system","file_id":"4805","checksum":"7873f665a0c598ac747c908f34cb14b9","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["01784617"]},"publication_status":"published","issue":"2","volume":78,"ec_funded":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Evolutionary algorithms (EAs) form a popular optimisation paradigm inspired by natural evolution. In recent years the field of evolutionary computation has developed a rigorous analytical theory to analyse the runtimes of EAs on many illustrative problems. Here we apply this theory to a simple model of natural evolution. In the Strong Selection Weak Mutation (SSWM) evolutionary regime the time between occurrences of new mutations is much longer than the time it takes for a mutated genotype to take over the population. In this situation, the population only contains copies of one genotype and evolution can be modelled as a stochastic process evolving one genotype by means of mutation and selection between the resident and the mutated genotype. The probability of accepting the mutated genotype then depends on the change in fitness. We study this process, SSWM, from an algorithmic perspective, quantifying its expected optimisation time for various parameters and investigating differences to a similar evolutionary algorithm, the well-known (1+1) EA. We show that SSWM can have a moderate advantage over the (1+1) EA at crossing fitness valleys and study an example where SSWM outperforms the (1+1) EA by taking advantage of information on the fitness gradient."}],"month":"06","intvolume":" 78","scopus_import":"1","ddc":["576"],"date_updated":"2023-09-20T11:14:42Z","department":[{"_id":"NiBa"},{"_id":"CaGu"}],"file_date_updated":"2020-07-14T12:44:44Z","_id":"1336","status":"public","pubrep_id":"658","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"}},{"oa_version":"Published Version","abstract":[{"text":"We consider the local eigenvalue distribution of large self-adjoint N×N random matrices H=H∗ with centered independent entries. In contrast to previous works the matrix of variances sij=\\mathbbmE|hij|2 is not assumed to be stochastic. Hence the density of states is not the Wigner semicircle law. Its possible shapes are described in the companion paper (Ajanki et al. in Quadratic Vector Equations on the Complex Upper Half Plane. arXiv:1506.05095). We show that as N grows, the resolvent, G(z)=(H−z)−1, converges to a diagonal matrix, diag(m(z)), where m(z)=(m1(z),…,mN(z)) solves the vector equation −1/mi(z)=z+∑jsijmj(z) that has been analyzed in Ajanki et al. (Quadratic Vector Equations on the Complex Upper Half Plane. arXiv:1506.05095). We prove a local law down to the smallest spectral resolution scale, and bulk universality for both real symmetric and complex hermitian symmetry classes.","lang":"eng"}],"month":"12","intvolume":" 169","scopus_import":"1","file":[{"file_name":"IST-2017-657-v1+2_s00440-016-0740-2.pdf","date_created":"2018-12-12T10:08:25Z","creator":"system","file_size":988843,"date_updated":"2020-07-14T12:44:44Z","file_id":"4686","checksum":"29f5a72c3f91e408aeb9e78344973803","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["01788051"]},"publication_status":"published","issue":"3-4","volume":169,"ec_funded":1,"_id":"1337","status":"public","pubrep_id":"657","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["510","530"],"date_updated":"2023-09-20T11:14:17Z","department":[{"_id":"LaEr"}],"file_date_updated":"2020-07-14T12:44:44Z","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). ","quality_controlled":"1","publisher":"Springer","oa":1,"day":"01","publication":"Probability Theory and Related Fields","has_accepted_license":"1","isi":1,"year":"2017","doi":"10.1007/s00440-016-0740-2","date_published":"2017-12-01T00:00:00Z","date_created":"2018-12-11T11:51:27Z","page":"667 - 727","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Ajanki, Oskari H, László Erdös, and Torben H Krüger. “Universality for General Wigner-Type Matrices.” Probability Theory and Related Fields. Springer, 2017. https://doi.org/10.1007/s00440-016-0740-2.","ista":"Ajanki OH, Erdös L, Krüger TH. 2017. Universality for general Wigner-type matrices. Probability Theory and Related Fields. 169(3–4), 667–727.","mla":"Ajanki, Oskari H., et al. “Universality for General Wigner-Type Matrices.” Probability Theory and Related Fields, vol. 169, no. 3–4, Springer, 2017, pp. 667–727, doi:10.1007/s00440-016-0740-2.","short":"O.H. Ajanki, L. Erdös, T.H. Krüger, Probability Theory and Related Fields 169 (2017) 667–727.","ieee":"O. H. Ajanki, L. Erdös, and T. H. Krüger, “Universality for general Wigner-type matrices,” Probability Theory and Related Fields, vol. 169, no. 3–4. Springer, pp. 667–727, 2017.","ama":"Ajanki OH, Erdös L, Krüger TH. Universality for general Wigner-type matrices. Probability Theory and Related Fields. 2017;169(3-4):667-727. doi:10.1007/s00440-016-0740-2","apa":"Ajanki, O. H., Erdös, L., & Krüger, T. H. (2017). Universality for general Wigner-type matrices. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-016-0740-2"},"title":"Universality for general Wigner-type matrices","author":[{"first_name":"Oskari H","id":"36F2FB7E-F248-11E8-B48F-1D18A9856A87","last_name":"Ajanki","full_name":"Ajanki, Oskari H"},{"first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","full_name":"Erdös, László","last_name":"Erdös"},{"id":"3020C786-F248-11E8-B48F-1D18A9856A87","first_name":"Torben H","full_name":"Krüger, Torben H","orcid":"0000-0002-4821-3297","last_name":"Krüger"}],"publist_id":"5930","external_id":{"isi":["000414358400002"]},"article_processing_charge":"Yes (via OA deal)"}]