[{"article_type":"original","page":"76 - 90","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"10894"}]},"date_updated":"2023-09-20T09:42:40Z","publication":"Journal of Symbolic Computation","year":"2017","oa":1,"quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"isi":1,"main_file_link":[{"url":"https://doi.org/10.1016/j.jsc.2016.03.008","open_access":"1"}],"intvolume":"        78","publisher":"Academic Press","scopus_import":"1","date_created":"2018-12-11T11:51:59Z","external_id":{"isi":["000384396000005"]},"date_published":"2017-01-01T00:00:00Z","publist_id":"5765","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"HeEd"}],"ec_funded":1,"status":"public","publication_status":"published","project":[{"call_identifier":"FP7","name":"Topological Complex Systems","grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"issn":[" 07477171"]},"doi":"10.1016/j.jsc.2016.03.008","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"}],"_id":"1433","author":[{"full_name":"Bauer, Ulrich","last_name":"Bauer","first_name":"Ulrich"},{"first_name":"Michael","last_name":"Kerber","full_name":"Kerber, Michael"},{"first_name":"Jan","last_name":"Reininghaus","full_name":"Reininghaus, Jan"},{"full_name":"Wagner, Hubert","last_name":"Wagner","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","first_name":"Hubert"}],"title":"Phat - Persistent homology algorithms toolbox","volume":78,"article_processing_charge":"No","oa_version":"Published Version","month":"01","day":"01","citation":{"chicago":"Bauer, Ulrich, Michael Kerber, Jan Reininghaus, and Hubert Wagner. “Phat - Persistent Homology Algorithms Toolbox.” <i>Journal of Symbolic Computation</i>. Academic Press, 2017. <a href=\"https://doi.org/10.1016/j.jsc.2016.03.008\">https://doi.org/10.1016/j.jsc.2016.03.008</a>.","mla":"Bauer, Ulrich, et al. “Phat - Persistent Homology Algorithms Toolbox.” <i>Journal of Symbolic Computation</i>, vol. 78, Academic Press, 2017, pp. 76–90, doi:<a href=\"https://doi.org/10.1016/j.jsc.2016.03.008\">10.1016/j.jsc.2016.03.008</a>.","ieee":"U. Bauer, M. Kerber, J. Reininghaus, and H. Wagner, “Phat - Persistent homology algorithms toolbox,” <i>Journal of Symbolic Computation</i>, vol. 78. Academic Press, pp. 76–90, 2017.","apa":"Bauer, U., Kerber, M., Reininghaus, J., &#38; Wagner, H. (2017). Phat - Persistent homology algorithms toolbox. <i>Journal of Symbolic Computation</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.jsc.2016.03.008\">https://doi.org/10.1016/j.jsc.2016.03.008</a>","ama":"Bauer U, Kerber M, Reininghaus J, Wagner H. Phat - Persistent homology algorithms toolbox. <i>Journal of Symbolic Computation</i>. 2017;78:76-90. doi:<a href=\"https://doi.org/10.1016/j.jsc.2016.03.008\">10.1016/j.jsc.2016.03.008</a>","short":"U. Bauer, M. Kerber, J. Reininghaus, H. Wagner, Journal of Symbolic Computation 78 (2017) 76–90.","ista":"Bauer U, Kerber M, Reininghaus J, Wagner H. 2017. Phat - Persistent homology algorithms toolbox. Journal of Symbolic Computation. 78, 76–90."}},{"file_date_updated":"2020-07-14T12:45:00Z","ddc":["530"],"month":"04","pubrep_id":"489","citation":{"short":"Z. Bao, L. Erdös, Probability Theory and Related Fields 167 (2017) 673–776.","ama":"Bao Z, Erdös L. Delocalization for a class of random block band matrices. <i>Probability Theory and Related Fields</i>. 2017;167(3-4):673-776. doi:<a href=\"https://doi.org/10.1007/s00440-015-0692-y\">10.1007/s00440-015-0692-y</a>","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.","ieee":"Z. Bao and L. Erdös, “Delocalization for a class of random block band matrices,” <i>Probability Theory and Related Fields</i>, vol. 167, no. 3–4. Springer, pp. 673–776, 2017.","apa":"Bao, Z., &#38; Erdös, L. (2017). Delocalization for a class of random block band matrices. <i>Probability Theory and Related Fields</i>. Springer. <a href=\"https://doi.org/10.1007/s00440-015-0692-y\">https://doi.org/10.1007/s00440-015-0692-y</a>","chicago":"Bao, Zhigang, and László Erdös. “Delocalization for a Class of Random Block Band Matrices.” <i>Probability Theory and Related Fields</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s00440-015-0692-y\">https://doi.org/10.1007/s00440-015-0692-y</a>.","mla":"Bao, Zhigang, and László Erdös. “Delocalization for a Class of Random Block Band Matrices.” <i>Probability Theory and Related Fields</i>, vol. 167, no. 3–4, Springer, 2017, pp. 673–776, doi:<a href=\"https://doi.org/10.1007/s00440-015-0692-y\">10.1007/s00440-015-0692-y</a>."},"day":"01","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"creator":"system","file_size":1615755,"relation":"main_file","file_name":"IST-2016-489-v1+1_s00440-015-0692-y.pdf","checksum":"67afa85ff1e220cbc1f9f477a828513c","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:00Z","date_created":"2018-12-12T10:08:05Z","file_id":"4665"}],"article_processing_charge":"Yes (via OA deal)","volume":167,"has_accepted_license":"1","_id":"1528","title":"Delocalization for a class of random block band matrices","author":[{"last_name":"Bao","full_name":"Bao, Zhigang","first_name":"Zhigang","id":"442E6A6C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3036-1475"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","full_name":"Erdös, László","last_name":"Erdös","orcid":"0000-0001-5366-9603"}],"doi":"10.1007/s00440-015-0692-y","abstract":[{"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.","lang":"eng"}],"issue":"3-4","project":[{"name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"issn":["01788051"]},"ec_funded":1,"publication_status":"published","status":"public","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.","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"5644","department":[{"_id":"LaEr"}],"date_created":"2018-12-11T11:52:32Z","scopus_import":"1","external_id":{"isi":["000398842700004"]},"date_published":"2017-04-01T00:00:00Z","publisher":"Springer","intvolume":"       167","language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","isi":1,"oa":1,"year":"2017","date_updated":"2023-09-20T09:42:12Z","publication":"Probability Theory and Related Fields","page":"673 - 776","article_type":"original"},{"doi":"10.1007/978-3-662-54577-5_26","abstract":[{"text":"Transforming deterministic ω\r\n-automata into deterministic parity automata is traditionally done using variants of appearance records. We present a more efficient variant of this approach, tailored to Rabin automata, and several optimizations applicable to all appearance records. We compare the methods experimentally and find out that our method produces smaller automata than previous approaches. Moreover, the experiments demonstrate the potential of our method for LTL synthesis, using LTL-to-Rabin translators. It leads to significantly smaller parity automata when compared to state-of-the-art approaches on complex formulae.","lang":"eng"}],"_id":"13160","title":"Index appearance record for transforming Rabin automata into parity automata","author":[{"last_name":"Kretinsky","full_name":"Kretinsky, Jan","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881"},{"first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","last_name":"Meggendorfer","full_name":"Meggendorfer, Tobias","orcid":"0000-0002-1712-2165"},{"full_name":"Waldmann, Clara","last_name":"Waldmann","first_name":"Clara"},{"last_name":"Weininger","full_name":"Weininger, Maximilian","first_name":"Maximilian"}],"status":"public","publication_status":"published","acknowledgement":"This work is partially funded by the DFG project “Verified Model Checkers” and by the Czech Science Foundation, grant No. P202/12/G061.","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783662545775"],"isbn":["9783662545768"]},"oa_version":"Preprint","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2017-04-22","location":"Uppsala, Sweden","end_date":"2017-04-29"},"month":"03","citation":{"ista":"Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. 2017. Index appearance record for transforming Rabin automata into parity automata. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10205, 443–460.","short":"J. Kretinsky, T. Meggendorfer, C. Waldmann, M. Weininger, in:, Tools and Algorithms for the Construction and Analysis of Systems, Springer, 2017, pp. 443–460.","ama":"Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. Index appearance record for transforming Rabin automata into parity automata. In: <i>Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 10205. Springer; 2017:443-460. doi:<a href=\"https://doi.org/10.1007/978-3-662-54577-5_26\">10.1007/978-3-662-54577-5_26</a>","apa":"Kretinsky, J., Meggendorfer, T., Waldmann, C., &#38; Weininger, M. (2017). Index appearance record for transforming Rabin automata into parity automata. In <i>Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 10205, pp. 443–460). Uppsala, Sweden: Springer. <a href=\"https://doi.org/10.1007/978-3-662-54577-5_26\">https://doi.org/10.1007/978-3-662-54577-5_26</a>","ieee":"J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record for transforming Rabin automata into parity automata,” in <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, Uppsala, Sweden, 2017, vol. 10205, pp. 443–460.","mla":"Kretinsky, Jan, et al. “Index Appearance Record for Transforming Rabin Automata into Parity Automata.” <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 10205, Springer, 2017, pp. 443–60, doi:<a href=\"https://doi.org/10.1007/978-3-662-54577-5_26\">10.1007/978-3-662-54577-5_26</a>.","chicago":"Kretinsky, Jan, Tobias Meggendorfer, Clara Waldmann, and Maximilian Weininger. “Index Appearance Record for Transforming Rabin Automata into Parity Automata.” In <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, 10205:443–60. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-662-54577-5_26\">https://doi.org/10.1007/978-3-662-54577-5_26</a>."},"day":"31","article_processing_charge":"No","volume":10205,"arxiv":1,"year":"2017","alternative_title":["LNCS"],"oa":1,"page":"443-460","date_updated":"2023-06-21T13:29:46Z","publication":"Tools and Algorithms for the Construction and Analysis of Systems","date_created":"2023-06-21T13:21:14Z","date_published":"2017-03-31T00:00:00Z","external_id":{"arxiv":["1701.05738"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"quality_controlled":"1","type":"conference","language":[{"iso":"eng"}],"publisher":"Springer","intvolume":"     10205","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1701.05738"}]},{"year":"2017","oa":1,"page":"681 - 713","date_updated":"2023-09-20T11:14:42Z","publication":"Algorithmica","scopus_import":"1","date_created":"2018-12-11T11:51:27Z","date_published":"2017-06-01T00:00:00Z","external_id":{"isi":["000400379500013"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"5931","department":[{"_id":"NiBa"},{"_id":"CaGu"}],"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","isi":1,"intvolume":"        78","publisher":"Springer","doi":"10.1007/s00453-016-0212-1","issue":"2","abstract":[{"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.","lang":"eng"}],"_id":"1336","author":[{"orcid":"0000-0003-2361-3953","last_name":"Paixao","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"},{"first_name":"Dirk","last_name":"Sudholt","full_name":"Sudholt, Dirk"},{"id":"42302D54-F248-11E8-B48F-1D18A9856A87","first_name":"Barbora","full_name":"Trubenova, Barbora","last_name":"Trubenova","orcid":"0000-0002-6873-2967"}],"title":"Towards a runtime comparison of natural and artificial evolution","ec_funded":1,"publication_status":"published","status":"public","project":[{"call_identifier":"FP7","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","grant_number":"618091","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"issn":["01784617"]},"oa_version":"Published Version","file_date_updated":"2020-07-14T12:44:44Z","ddc":["576"],"month":"06","day":"01","citation":{"chicago":"Paixao, Tiago, Jorge Pérez Heredia, Dirk Sudholt, and Barbora Trubenova. “Towards a Runtime Comparison of Natural and Artificial Evolution.” <i>Algorithmica</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s00453-016-0212-1\">https://doi.org/10.1007/s00453-016-0212-1</a>.","mla":"Paixao, Tiago, et al. “Towards a Runtime Comparison of Natural and Artificial Evolution.” <i>Algorithmica</i>, vol. 78, no. 2, Springer, 2017, pp. 681–713, doi:<a href=\"https://doi.org/10.1007/s00453-016-0212-1\">10.1007/s00453-016-0212-1</a>.","apa":"Paixao, T., Pérez Heredia, J., Sudholt, D., &#38; Trubenova, B. (2017). Towards a runtime comparison of natural and artificial evolution. <i>Algorithmica</i>. Springer. <a href=\"https://doi.org/10.1007/s00453-016-0212-1\">https://doi.org/10.1007/s00453-016-0212-1</a>","ieee":"T. Paixao, J. Pérez Heredia, D. Sudholt, and B. Trubenova, “Towards a runtime comparison of natural and artificial evolution,” <i>Algorithmica</i>, vol. 78, no. 2. Springer, pp. 681–713, 2017.","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.","short":"T. Paixao, J. Pérez Heredia, D. Sudholt, B. Trubenova, Algorithmica 78 (2017) 681–713.","ama":"Paixao T, Pérez Heredia J, Sudholt D, Trubenova B. Towards a runtime comparison of natural and artificial evolution. <i>Algorithmica</i>. 2017;78(2):681-713. doi:<a href=\"https://doi.org/10.1007/s00453-016-0212-1\">10.1007/s00453-016-0212-1</a>"},"pubrep_id":"658","article_processing_charge":"No","volume":78,"has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"date_created":"2018-12-12T10:10:19Z","file_id":"4805","creator":"system","file_size":710206,"relation":"main_file","file_name":"IST-2016-658-v1+1_s00453-016-0212-1.pdf","checksum":"7873f665a0c598ac747c908f34cb14b9","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:44:44Z"}]},{"has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","volume":169,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"file_name":"IST-2017-657-v1+2_s00440-016-0740-2.pdf","relation":"main_file","file_size":988843,"creator":"system","date_updated":"2020-07-14T12:44:44Z","access_level":"open_access","content_type":"application/pdf","checksum":"29f5a72c3f91e408aeb9e78344973803","file_id":"4686","date_created":"2018-12-12T10:08:25Z"}],"oa_version":"Published Version","pubrep_id":"657","citation":{"chicago":"Ajanki, Oskari H, László Erdös, and Torben H Krüger. “Universality for General Wigner-Type Matrices.” <i>Probability Theory and Related Fields</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s00440-016-0740-2\">https://doi.org/10.1007/s00440-016-0740-2</a>.","mla":"Ajanki, Oskari H., et al. “Universality for General Wigner-Type Matrices.” <i>Probability Theory and Related Fields</i>, vol. 169, no. 3–4, Springer, 2017, pp. 667–727, doi:<a href=\"https://doi.org/10.1007/s00440-016-0740-2\">10.1007/s00440-016-0740-2</a>.","short":"O.H. Ajanki, L. Erdös, T.H. Krüger, Probability Theory and Related Fields 169 (2017) 667–727.","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.","ama":"Ajanki OH, Erdös L, Krüger TH. Universality for general Wigner-type matrices. <i>Probability Theory and Related Fields</i>. 2017;169(3-4):667-727. doi:<a href=\"https://doi.org/10.1007/s00440-016-0740-2\">10.1007/s00440-016-0740-2</a>","apa":"Ajanki, O. H., Erdös, L., &#38; Krüger, T. H. (2017). Universality for general Wigner-type matrices. <i>Probability Theory and Related Fields</i>. Springer. <a href=\"https://doi.org/10.1007/s00440-016-0740-2\">https://doi.org/10.1007/s00440-016-0740-2</a>","ieee":"O. H. Ajanki, L. Erdös, and T. H. Krüger, “Universality for general Wigner-type matrices,” <i>Probability Theory and Related Fields</i>, vol. 169, no. 3–4. Springer, pp. 667–727, 2017."},"day":"01","month":"12","ddc":["510","530"],"file_date_updated":"2020-07-14T12:44:44Z","publication_status":"published","status":"public","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria).  ","ec_funded":1,"publication_identifier":{"issn":["01788051"]},"project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"abstract":[{"lang":"eng","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."}],"issue":"3-4","doi":"10.1007/s00440-016-0740-2","title":"Universality for general Wigner-type matrices","author":[{"full_name":"Ajanki, Oskari H","last_name":"Ajanki","id":"36F2FB7E-F248-11E8-B48F-1D18A9856A87","first_name":"Oskari H"},{"orcid":"0000-0001-5366-9603","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","full_name":"Erdös, László"},{"orcid":"0000-0002-4821-3297","id":"3020C786-F248-11E8-B48F-1D18A9856A87","first_name":"Torben H","full_name":"Krüger, Torben H","last_name":"Krüger"}],"_id":"1337","isi":1,"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","publisher":"Springer","intvolume":"       169","external_id":{"isi":["000414358400002"]},"date_published":"2017-12-01T00:00:00Z","date_created":"2018-12-11T11:51:27Z","scopus_import":"1","department":[{"_id":"LaEr"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"5930","page":"667 - 727","publication":"Probability Theory and Related Fields","date_updated":"2023-09-20T11:14:17Z","year":"2017","oa":1},{"project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"publication_status":"published","status":"public","ec_funded":1,"author":[{"full_name":"Cerny, Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol"},{"full_name":"Clarke, Edmund","last_name":"Clarke","first_name":"Edmund"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"},{"first_name":"Leonid","full_name":"Ryzhyk, Leonid","last_name":"Ryzhyk"},{"last_name":"Samanta","full_name":"Samanta, Roopsha","first_name":"Roopsha","id":"3D2AAC08-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-4409-8487","id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87","first_name":"Thorsten","full_name":"Tarrach, Thorsten","last_name":"Tarrach"}],"title":"From non-preemptive to preemptive scheduling using synchronization synthesis","_id":"1338","issue":"2-3","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"}],"doi":"10.1007/s10703-016-0256-5","file":[{"date_updated":"2020-07-14T12:44:44Z","access_level":"open_access","checksum":"1163dfd997e8212c789525d4178b1653","content_type":"application/pdf","file_name":"IST-2016-656-v1+1_s10703-016-0256-5.pdf","relation":"main_file","file_size":1416170,"creator":"system","file_id":"4985","date_created":"2018-12-12T10:13:05Z"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","article_processing_charge":"No","volume":50,"day":"01","pubrep_id":"656","citation":{"ieee":"P. Cerny <i>et al.</i>, “From non-preemptive to preemptive scheduling using synchronization synthesis,” <i>Formal Methods in System Design</i>, vol. 50, no. 2–3. Springer, pp. 97–139, 2017.","apa":"Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta, R., &#38; Tarrach, T. (2017). From non-preemptive to preemptive scheduling using synchronization synthesis. <i>Formal Methods in System Design</i>. Springer. <a href=\"https://doi.org/10.1007/s10703-016-0256-5\">https://doi.org/10.1007/s10703-016-0256-5</a>","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.","ama":"Cerny P, Clarke E, Henzinger TA, et al. From non-preemptive to preemptive scheduling using synchronization synthesis. <i>Formal Methods in System Design</i>. 2017;50(2-3):97-139. doi:<a href=\"https://doi.org/10.1007/s10703-016-0256-5\">10.1007/s10703-016-0256-5</a>","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.","mla":"Cerny, Pavol, et al. “From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis.” <i>Formal Methods in System Design</i>, vol. 50, no. 2–3, Springer, 2017, pp. 97–139, doi:<a href=\"https://doi.org/10.1007/s10703-016-0256-5\">10.1007/s10703-016-0256-5</a>.","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.” <i>Formal Methods in System Design</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s10703-016-0256-5\">https://doi.org/10.1007/s10703-016-0256-5</a>."},"ddc":["000"],"month":"06","file_date_updated":"2020-07-14T12:44:44Z","oa_version":"Published Version","publication":"Formal Methods in System Design","date_updated":"2023-09-20T11:13:51Z","related_material":{"record":[{"id":"1729","status":"public","relation":"earlier_version"}]},"page":"97 - 139","oa":1,"year":"2017","intvolume":"        50","publisher":"Springer","isi":1,"type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"publist_id":"5929","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2017-06-01T00:00:00Z","external_id":{"isi":["000399888900001"]},"scopus_import":"1","date_created":"2018-12-11T11:51:27Z"},{"isi":1,"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","publisher":"Springer","intvolume":"        54","date_published":"2017-12-01T00:00:00Z","external_id":{"isi":["000414343200003"]},"date_created":"2018-12-11T11:51:32Z","scopus_import":"1","department":[{"_id":"ToHe"},{"_id":"CaGu"},{"_id":"NiBa"}],"publist_id":"5898","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","related_material":{"record":[{"id":"1835","status":"public","relation":"earlier_version"}]},"page":"765 - 787","publication":"Acta Informatica","date_updated":"2025-05-28T11:57:04Z","year":"2017","oa":1,"has_accepted_license":"1","volume":54,"article_processing_charge":"No","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"date_created":"2019-01-17T15:57:29Z","file_id":"5841","checksum":"4e661d9135d7f8c342e8e258dee76f3e","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:44:46Z","creator":"dernst","relation":"main_file","file_size":755241,"file_name":"2017_ActaInformatica_Giacobbe.pdf"}],"oa_version":"Published Version","pubrep_id":"649","citation":{"chicago":"Giacobbe, Mirco, Calin C Guet, Ashutosh Gupta, Thomas A Henzinger, Tiago Paixao, and Tatjana Petrov. “Model Checking the Evolution of Gene Regulatory Networks.” <i>Acta Informatica</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s00236-016-0278-x\">https://doi.org/10.1007/s00236-016-0278-x</a>.","mla":"Giacobbe, Mirco, et al. “Model Checking the Evolution of Gene Regulatory Networks.” <i>Acta Informatica</i>, vol. 54, no. 8, Springer, 2017, pp. 765–87, doi:<a href=\"https://doi.org/10.1007/s00236-016-0278-x\">10.1007/s00236-016-0278-x</a>.","ama":"Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. Model checking the evolution of gene regulatory networks. <i>Acta Informatica</i>. 2017;54(8):765-787. doi:<a href=\"https://doi.org/10.1007/s00236-016-0278-x\">10.1007/s00236-016-0278-x</a>","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.","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,” <i>Acta Informatica</i>, vol. 54, no. 8. Springer, pp. 765–787, 2017.","apa":"Giacobbe, M., Guet, C. C., Gupta, A., Henzinger, T. A., Paixao, T., &#38; Petrov, T. (2017). Model checking the evolution of gene regulatory networks. <i>Acta Informatica</i>. Springer. <a href=\"https://doi.org/10.1007/s00236-016-0278-x\">https://doi.org/10.1007/s00236-016-0278-x</a>"},"day":"01","month":"12","ddc":["006","576"],"file_date_updated":"2020-07-14T12:44:46Z","status":"public","publication_status":"published","ec_funded":1,"publication_identifier":{"issn":["00015903"]},"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"grant_number":"618091","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"},{"call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation","_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152"}],"abstract":[{"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.","lang":"eng"}],"issue":"8","doi":"10.1007/s00236-016-0278-x","title":"Model checking the evolution of gene regulatory networks","author":[{"orcid":"0000-0001-8180-0904","first_name":"Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","last_name":"Giacobbe","full_name":"Giacobbe, Mirco"},{"full_name":"Guet, Calin C","last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C","orcid":"0000-0001-6220-2052"},{"first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta","full_name":"Gupta, Ashutosh"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"orcid":"0000-0003-2361-3953","last_name":"Paixao","full_name":"Paixao, Tiago","first_name":"Tiago","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-9041-0905","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","first_name":"Tatjana","full_name":"Petrov, Tatjana","last_name":"Petrov"}],"_id":"1351"},{"year":"2017","oa":1,"page":"312 - 337","date_updated":"2023-09-20T11:05:36Z","publication":"Computer Graphics Forum","date_created":"2018-12-11T11:51:37Z","scopus_import":"1","date_published":"2017-09-01T00:00:00Z","external_id":{"isi":["000408634200019"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"5873","department":[{"_id":"ChWo"}],"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","isi":1,"publisher":"Wiley-Blackwell","intvolume":"        36","doi":"10.1111/cgf.12941","abstract":[{"lang":"eng","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."}],"issue":"6","_id":"1367","title":"Adaptive physically based models in computer graphics","author":[{"last_name":"Manteaux","full_name":"Manteaux, Pierre","first_name":"Pierre"},{"id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","full_name":"Wojtan, Christopher J","last_name":"Wojtan","orcid":"0000-0001-6646-5546"},{"first_name":"Rahul","full_name":"Narain, Rahul","last_name":"Narain"},{"first_name":"Stéphane","last_name":"Redon","full_name":"Redon, Stéphane"},{"last_name":"Faure","full_name":"Faure, François","first_name":"François"},{"first_name":"Marie","full_name":"Cani, Marie","last_name":"Cani"}],"status":"public","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).","publication_status":"published","publication_identifier":{"issn":["01677055"]},"oa_version":"Submitted Version","month":"09","ddc":["000"],"file_date_updated":"2020-07-14T12:44:47Z","citation":{"chicago":"Manteaux, Pierre, Chris Wojtan, Rahul Narain, Stéphane Redon, François Faure, and Marie Cani. “Adaptive Physically Based Models in Computer Graphics.” <i>Computer Graphics Forum</i>. Wiley-Blackwell, 2017. <a href=\"https://doi.org/10.1111/cgf.12941\">https://doi.org/10.1111/cgf.12941</a>.","mla":"Manteaux, Pierre, et al. “Adaptive Physically Based Models in Computer Graphics.” <i>Computer Graphics Forum</i>, vol. 36, no. 6, Wiley-Blackwell, 2017, pp. 312–37, doi:<a href=\"https://doi.org/10.1111/cgf.12941\">10.1111/cgf.12941</a>.","short":"P. Manteaux, C. Wojtan, R. Narain, S. Redon, F. Faure, M. Cani, Computer Graphics Forum 36 (2017) 312–337.","ama":"Manteaux P, Wojtan C, Narain R, Redon S, Faure F, Cani M. Adaptive physically based models in computer graphics. <i>Computer Graphics Forum</i>. 2017;36(6):312-337. doi:<a href=\"https://doi.org/10.1111/cgf.12941\">10.1111/cgf.12941</a>","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.","ieee":"P. Manteaux, C. Wojtan, R. Narain, S. Redon, F. Faure, and M. Cani, “Adaptive physically based models in computer graphics,” <i>Computer Graphics Forum</i>, vol. 36, no. 6. Wiley-Blackwell, pp. 312–337, 2017.","apa":"Manteaux, P., Wojtan, C., Narain, R., Redon, S., Faure, F., &#38; Cani, M. (2017). Adaptive physically based models in computer graphics. <i>Computer Graphics Forum</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/cgf.12941\">https://doi.org/10.1111/cgf.12941</a>"},"pubrep_id":"634","day":"01","volume":36,"article_processing_charge":"No","has_accepted_license":"1","file":[{"file_id":"5208","date_created":"2018-12-12T10:16:21Z","file_name":"IST-2016-634-v1+1_starAdaptivity-cgf.pdf","file_size":1434439,"creator":"system","relation":"main_file","date_updated":"2020-07-14T12:44:47Z","access_level":"open_access","checksum":"7676e9a9ead6d58c3000988c97deb2ef","content_type":"application/pdf"}]},{"publisher":"Elsevier","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1410.5387"}],"intvolume":"        23","isi":1,"quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publist_id":"5800","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"arxiv":["1410.5387"],"isi":["000390637000014"]},"date_published":"2017-02-01T00:00:00Z","date_created":"2018-12-11T11:51:50Z","scopus_import":"1","publication":"Nonlinear Analysis: Hybrid Systems","date_updated":"2023-09-20T09:43:09Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1689"}]},"page":"230 - 253","oa":1,"year":"2017","arxiv":1,"article_processing_charge":"No","volume":23,"citation":{"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,” <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 23, no. 2. Elsevier, pp. 230–253, 2017.","apa":"Svoreňová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., &#38; Belta, C. (2017). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.nahs.2016.04.006\">https://doi.org/10.1016/j.nahs.2016.04.006</a>","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. <i>Nonlinear Analysis: Hybrid Systems</i>. 2017;23(2):230-253. doi:<a href=\"https://doi.org/10.1016/j.nahs.2016.04.006\">10.1016/j.nahs.2016.04.006</a>","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.","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.” <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.nahs.2016.04.006\">https://doi.org/10.1016/j.nahs.2016.04.006</a>.","mla":"Svoreňová, Mária, et al. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 23, no. 2, Elsevier, 2017, pp. 230–53, doi:<a href=\"https://doi.org/10.1016/j.nahs.2016.04.006\">10.1016/j.nahs.2016.04.006</a>."},"day":"01","month":"02","oa_version":"Preprint","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"status":"public","publication_status":"published","ec_funded":1,"title":"Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games","author":[{"first_name":"Mária","last_name":"Svoreňová","full_name":"Svoreňová, Mária"},{"first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881"},{"full_name":"Chmelik, Martin","last_name":"Chmelik","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Ivana","last_name":"Cěrná","full_name":"Cěrná, Ivana"},{"first_name":"Cǎlin","last_name":"Belta","full_name":"Belta, Cǎlin"}],"_id":"1407","abstract":[{"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.","lang":"eng"}],"issue":"2","doi":"10.1016/j.nahs.2016.04.006"},{"month":"02","day":"21","citation":{"mla":"Locatello, Francesco, et al. “A Unified Optimization View on Generalized Matching Pursuit and Frank-Wolfe.” <i>Proceedings of the 20th International Conference on Artificial Intelligence and Statistics</i>, vol. 54, ML Research Press, 2017, pp. 860–68.","chicago":"Locatello, Francesco, Rajiv Khanna, Michael Tschannen, and Martin Jaggi. “A Unified Optimization View on Generalized Matching Pursuit and Frank-Wolfe.” In <i>Proceedings of the 20th International Conference on Artificial Intelligence and Statistics</i>, 54:860–68. ML Research Press, 2017.","apa":"Locatello, F., Khanna, R., Tschannen, M., &#38; Jaggi, M. (2017). A unified optimization view on generalized matching pursuit and Frank-Wolfe. In <i>Proceedings of the 20th International Conference on Artificial Intelligence and Statistics</i> (Vol. 54, pp. 860–868). Fort Lauderdale, FL, United States: ML Research Press.","ieee":"F. Locatello, R. Khanna, M. Tschannen, and M. Jaggi, “A unified optimization view on generalized matching pursuit and Frank-Wolfe,” in <i>Proceedings of the 20th International Conference on Artificial Intelligence and Statistics</i>, Fort Lauderdale, FL, United States, 2017, vol. 54, pp. 860–868.","ama":"Locatello F, Khanna R, Tschannen M, Jaggi M. A unified optimization view on generalized matching pursuit and Frank-Wolfe. In: <i>Proceedings of the 20th International Conference on Artificial Intelligence and Statistics</i>. Vol 54. ML Research Press; 2017:860-868.","short":"F. Locatello, R. Khanna, M. Tschannen, M. Jaggi, in:, Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, ML Research Press, 2017, pp. 860–868.","ista":"Locatello F, Khanna R, Tschannen M, Jaggi M. 2017. A unified optimization view on generalized matching pursuit and Frank-Wolfe. Proceedings of the 20th International Conference on Artificial Intelligence and Statistics. AISTATS: Conference on Artificial Intelligence and Statistics vol. 54, 860–868."},"conference":{"name":"AISTATS: Conference on Artificial Intelligence and Statistics","location":"Fort Lauderdale, FL, United States","start_date":"2017-04-20","end_date":"2017-04-22"},"oa_version":"Preprint","arxiv":1,"article_processing_charge":"No","volume":54,"_id":"14205","author":[{"full_name":"Locatello, Francesco","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","orcid":"0000-0002-4850-0683"},{"first_name":"Rajiv","last_name":"Khanna","full_name":"Khanna, Rajiv"},{"last_name":"Tschannen","full_name":"Tschannen, Michael","first_name":"Michael"},{"full_name":"Jaggi, Martin","last_name":"Jaggi","first_name":"Martin"}],"title":"A unified optimization view on generalized matching pursuit and Frank-Wolfe","abstract":[{"text":"Two of the most fundamental prototypes of greedy optimization are the matching pursuit and Frank-Wolfe algorithms. In this paper, we take a unified view on both classes of methods, leading to the first explicit convergence rates of matching pursuit methods in an optimization sense, for general sets of atoms. We derive sublinear (1/t) convergence for both classes on general smooth objectives, and linear convergence on strongly convex objectives, as well as a clear correspondence of algorithm variants. Our presented algorithms and rates are affine invariant, and do not need any incoherence or sparsity assumptions.","lang":"eng"}],"status":"public","publication_status":"published","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"FrLo"}],"date_created":"2023-08-22T14:17:19Z","extern":"1","external_id":{"arxiv":["1702.06457"]},"date_published":"2017-02-21T00:00:00Z","intvolume":"        54","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1702.06457"}],"publisher":"ML Research Press","language":[{"iso":"eng"}],"type":"conference","quality_controlled":"1","oa":1,"year":"2017","date_updated":"2023-09-13T09:49:10Z","publication":"Proceedings of the 20th International Conference on Artificial Intelligence and Statistics","page":"860-868"},{"publication":"Advances in Neural Information Processing Systems","publication_identifier":{"isbn":["9781510860964"]},"date_updated":"2023-09-13T08:32:23Z","publication_status":"published","status":"public","author":[{"orcid":"0000-0002-4850-0683","first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","full_name":"Locatello, Francesco"},{"first_name":"Michael","last_name":"Tschannen","full_name":"Tschannen, Michael"},{"full_name":"Rätsch, Gunnar","last_name":"Rätsch","first_name":"Gunnar"},{"last_name":"Jaggi","full_name":"Jaggi, Martin","first_name":"Martin"}],"title":"Greedy algorithms for cone constrained optimization with convergence guarantees","oa":1,"_id":"14206","year":"2017","abstract":[{"text":"Greedy optimization methods such as Matching Pursuit (MP) and Frank-Wolfe (FW) algorithms regained popularity in recent years due to their simplicity, effectiveness and theoretical guarantees. MP and FW address optimization over the linear span and the convex hull of a set of atoms, respectively. In this paper, we consider the intermediate case of optimization over the convex cone, parametrized as the conic hull of a generic atom set, leading to the first principled definitions of non-negative MP algorithms for which we give explicit convergence rates and demonstrate excellent empirical performance. In particular, we derive sublinear (O(1/t)) convergence on general smooth and convex objectives, and linear convergence (O(e−t)) on strongly convex objectives, in both cases for general sets of atoms. Furthermore, we establish a clear correspondence of our algorithms to known algorithms from the MP and FW literature. Our novel algorithms and analyses target general atom sets and general objective functions, and hence are directly applicable to a large variety of learning settings.","lang":"eng"}],"arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/1705.11041","open_access":"1"}],"type":"conference","quality_controlled":"1","language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"FrLo"}],"day":"31","citation":{"chicago":"Locatello, Francesco, Michael Tschannen, Gunnar Rätsch, and Martin Jaggi. “Greedy Algorithms for Cone Constrained Optimization with Convergence Guarantees.” In <i>Advances in Neural Information Processing Systems</i>, 2017.","mla":"Locatello, Francesco, et al. “Greedy Algorithms for Cone Constrained Optimization with Convergence Guarantees.” <i>Advances in Neural Information Processing Systems</i>, 2017.","ieee":"F. Locatello, M. Tschannen, G. Rätsch, and M. Jaggi, “Greedy algorithms for cone constrained optimization with convergence guarantees,” in <i>Advances in Neural Information Processing Systems</i>, Long Beach, CA, United States, 2017.","apa":"Locatello, F., Tschannen, M., Rätsch, G., &#38; Jaggi, M. (2017). Greedy algorithms for cone constrained optimization with convergence guarantees. In <i>Advances in Neural Information Processing Systems</i>. Long Beach, CA, United States.","ama":"Locatello F, Tschannen M, Rätsch G, Jaggi M. Greedy algorithms for cone constrained optimization with convergence guarantees. In: <i>Advances in Neural Information Processing Systems</i>. ; 2017.","ista":"Locatello F, Tschannen M, Rätsch G, Jaggi M. 2017. Greedy algorithms for cone constrained optimization with convergence guarantees. Advances in Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems.","short":"F. Locatello, M. Tschannen, G. Rätsch, M. Jaggi, in:, Advances in Neural Information Processing Systems, 2017."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"05","extern":"1","date_published":"2017-05-31T00:00:00Z","external_id":{"arxiv":["1705.11041"]},"conference":{"location":"Long Beach, CA, United States","start_date":"2017-12-04","end_date":"2017-12-09","name":"NeurIPS: Neural Information Processing Systems"},"oa_version":"Preprint","date_created":"2023-08-22T14:17:38Z"},{"department":[{"_id":"HeEd"}],"publist_id":"6534","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2017-01-01T00:00:00Z","external_id":{"arxiv":["1605.07997"],"isi":["000413947300002"]},"scopus_import":"1","date_created":"2018-12-11T11:49:09Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1605.07997"}],"intvolume":"       124","publisher":"Mathematical Association of America","isi":1,"language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","oa":1,"year":"2017","publication":"The American Mathematical Monthly","date_updated":"2023-10-17T11:24:57Z","article_type":"original","page":"588 - 596","day":"01","citation":{"chicago":"Akopyan, Arseniy, and Vladislav Vysotsky. “On the Lengths of Curves Passing through Boundary Points of a Planar Convex Shape.” <i>The American Mathematical Monthly</i>. Mathematical Association of America, 2017. <a href=\"https://doi.org/10.4169/amer.math.monthly.124.7.588\">https://doi.org/10.4169/amer.math.monthly.124.7.588</a>.","mla":"Akopyan, Arseniy, and Vladislav Vysotsky. “On the Lengths of Curves Passing through Boundary Points of a Planar Convex Shape.” <i>The American Mathematical Monthly</i>, vol. 124, no. 7, Mathematical Association of America, 2017, pp. 588–96, doi:<a href=\"https://doi.org/10.4169/amer.math.monthly.124.7.588\">10.4169/amer.math.monthly.124.7.588</a>.","ieee":"A. Akopyan and V. Vysotsky, “On the lengths of curves passing through boundary points of a planar convex shape,” <i>The American Mathematical Monthly</i>, vol. 124, no. 7. Mathematical Association of America, pp. 588–596, 2017.","apa":"Akopyan, A., &#38; Vysotsky, V. (2017). On the lengths of curves passing through boundary points of a planar convex shape. <i>The American Mathematical Monthly</i>. Mathematical Association of America. <a href=\"https://doi.org/10.4169/amer.math.monthly.124.7.588\">https://doi.org/10.4169/amer.math.monthly.124.7.588</a>","short":"A. Akopyan, V. Vysotsky, The American Mathematical Monthly 124 (2017) 588–596.","ama":"Akopyan A, Vysotsky V. On the lengths of curves passing through boundary points of a planar convex shape. <i>The American Mathematical Monthly</i>. 2017;124(7):588-596. doi:<a href=\"https://doi.org/10.4169/amer.math.monthly.124.7.588\">10.4169/amer.math.monthly.124.7.588</a>","ista":"Akopyan A, Vysotsky V. 2017. On the lengths of curves passing through boundary points of a planar convex shape. The American Mathematical Monthly. 124(7), 588–596."},"month":"01","oa_version":"Submitted Version","arxiv":1,"volume":124,"article_processing_charge":"No","author":[{"orcid":"0000-0002-2548-617X","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","last_name":"Akopyan","full_name":"Akopyan, Arseniy"},{"full_name":"Vysotsky, Vladislav","last_name":"Vysotsky","first_name":"Vladislav"}],"title":"On the lengths of curves passing through boundary points of a planar convex shape","_id":"909","issue":"7","abstract":[{"lang":"eng","text":"We study the lengths of curves passing through a fixed number of points on the boundary of a convex shape in the plane. We show that, for any convex shape K, there exist four points on the boundary of K such that the length of any curve passing through these points is at least half of the perimeter of K. It is also shown that the same statement does not remain valid with the additional constraint that the points are extreme points of K. Moreover, the factor &amp;#xbd; cannot be achieved with any fixed number of extreme points. We conclude the paper with a few other inequalities related to the perimeter of a convex shape."}],"doi":"10.4169/amer.math.monthly.124.7.588","publication_identifier":{"issn":["00029890"]},"project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"status":"public","publication_status":"published","ec_funded":1},{"doi":"10.1534/genetics.117.300129","issue":"2","abstract":[{"text":"Frequency-independent selection is generally considered as a force that acts to reduce the genetic variation in evolving populations, yet rigorous arguments for this idea are scarce. When selection fluctuates in time, it is unclear whether frequency-independent selection may maintain genetic polymorphism without invoking additional mechanisms. We show that constant frequency-independent selection with arbitrary epistasis on a well-mixed haploid population eliminates genetic variation if we assume linkage equilibrium between alleles. To this end, we introduce the notion of frequency-independent selection at the level of alleles, which is sufficient to prove our claim and contains the notion of frequency-independent selection on haploids. When selection and recombination are weak but of the same order, there may be strong linkage disequilibrium; numerical calculations show that stable equilibria are highly unlikely. Using the example of a diallelic two-locus model, we then demonstrate that frequency-independent selection that fluctuates in time can maintain stable polymorphism if linkage disequilibrium changes its sign periodically. We put our findings in the context of results from the existing literature and point out those scenarios in which the possible role of frequency-independent selection in maintaining genetic variation remains unclear.\r\n","lang":"eng"}],"_id":"910","author":[{"orcid":"0000-0002-2519-824X","full_name":"Novak, Sebastian","last_name":"Novak","id":"461468AE-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian"},{"last_name":"Barton","full_name":"Barton, Nicholas H","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240"}],"title":"When does frequency-independent selection maintain genetic variation?","ec_funded":1,"status":"public","publication_status":"published","project":[{"_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","grant_number":"618091","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","call_identifier":"FP7"}],"oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:48:15Z","month":"10","ddc":["576"],"day":"01","pubrep_id":"974","citation":{"short":"S. Novak, N.H. Barton, Genetics 207 (2017) 653–668.","ama":"Novak S, Barton NH. When does frequency-independent selection maintain genetic variation? <i>Genetics</i>. 2017;207(2):653-668. doi:<a href=\"https://doi.org/10.1534/genetics.117.300129\">10.1534/genetics.117.300129</a>","ista":"Novak S, Barton NH. 2017. When does frequency-independent selection maintain genetic variation? Genetics. 207(2), 653–668.","ieee":"S. Novak and N. H. Barton, “When does frequency-independent selection maintain genetic variation?,” <i>Genetics</i>, vol. 207, no. 2. Genetics Society of America, pp. 653–668, 2017.","apa":"Novak, S., &#38; Barton, N. H. (2017). When does frequency-independent selection maintain genetic variation? <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.117.300129\">https://doi.org/10.1534/genetics.117.300129</a>","chicago":"Novak, Sebastian, and Nicholas H Barton. “When Does Frequency-Independent Selection Maintain Genetic Variation?” <i>Genetics</i>. Genetics Society of America, 2017. <a href=\"https://doi.org/10.1534/genetics.117.300129\">https://doi.org/10.1534/genetics.117.300129</a>.","mla":"Novak, Sebastian, and Nicholas H. Barton. “When Does Frequency-Independent Selection Maintain Genetic Variation?” <i>Genetics</i>, vol. 207, no. 2, Genetics Society of America, 2017, pp. 653–68, doi:<a href=\"https://doi.org/10.1534/genetics.117.300129\">10.1534/genetics.117.300129</a>."},"volume":207,"article_processing_charge":"No","has_accepted_license":"1","file":[{"access_level":"open_access","content_type":"application/pdf","checksum":"f7c32dabf52e6d9e709d9203761e39fd","date_updated":"2020-07-14T12:48:15Z","file_name":"IST-2018-974-v1+1_manuscript.pdf","relation":"main_file","creator":"system","file_size":494268,"file_id":"5264","date_created":"2018-12-12T10:17:12Z"}],"year":"2017","oa":1,"page":"653 - 668","date_updated":"2023-09-26T15:49:15Z","publication":"Genetics","scopus_import":"1","date_created":"2018-12-11T11:49:09Z","date_published":"2017-10-01T00:00:00Z","external_id":{"isi":["000412232600019"]},"publist_id":"6533","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"NiBa"}],"language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","isi":1,"intvolume":"       207","publisher":"Genetics Society of America"},{"project":[{"call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"eisbn":["190172560X"]},"ec_funded":1,"status":"public","publication_status":"published","_id":"911","author":[{"first_name":"Amélie","id":"3811D890-F248-11E8-B48F-1D18A9856A87","last_name":"Royer","full_name":"Royer, Amélie","orcid":"0000-0002-8407-0705"},{"full_name":"Kolesnikov, Alexander","last_name":"Kolesnikov","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander"},{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","full_name":"Lampert, Christoph","last_name":"Lampert"}],"title":"Probabilistic image colorization","doi":"10.5244/c.31.85","abstract":[{"text":"We develop a probabilistic technique for colorizing grayscale natural images. In light of the intrinsic uncertainty of this task, the proposed probabilistic framework has numerous desirable properties. In particular, our model is able to produce multiple plausible and vivid colorizations for a given grayscale image and is one of the first colorization models to provide a proper stochastic sampling scheme. Moreover, our training procedure is supported by a rigorous theoretical framework that does not require any ad hoc heuristics and allows for efficient modeling and learning of the joint pixel color distribution.We demonstrate strong quantitative and qualitative experimental results on the CIFAR-10 dataset and the challenging ILSVRC 2012 dataset.","lang":"eng"}],"file":[{"date_created":"2020-08-10T07:14:33Z","file_id":"8224","creator":"dernst","file_size":1625363,"relation":"main_file","file_name":"2017_BMVC_Royer.pdf","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-08-10T07:14:33Z","success":1}],"arxiv":1,"article_processing_charge":"No","has_accepted_license":"1","file_date_updated":"2020-08-10T07:14:33Z","month":"09","ddc":["000"],"day":"01","citation":{"ama":"Royer A, Kolesnikov A, Lampert C. Probabilistic image colorization. In: BMVA Press; 2017:85.1-85.12. doi:<a href=\"https://doi.org/10.5244/c.31.85\">10.5244/c.31.85</a>","ista":"Royer A, Kolesnikov A, Lampert C. 2017. Probabilistic image colorization. BMVC: British Machine Vision Conference, 85.1-85.12.","short":"A. Royer, A. Kolesnikov, C. Lampert, in:, BMVA Press, 2017, p. 85.1-85.12.","ieee":"A. Royer, A. Kolesnikov, and C. Lampert, “Probabilistic image colorization,” presented at the BMVC: British Machine Vision Conference, London, United Kingdom, 2017, p. 85.1-85.12.","apa":"Royer, A., Kolesnikov, A., &#38; Lampert, C. (2017). Probabilistic image colorization (p. 85.1-85.12). Presented at the BMVC: British Machine Vision Conference, London, United Kingdom: BMVA Press. <a href=\"https://doi.org/10.5244/c.31.85\">https://doi.org/10.5244/c.31.85</a>","chicago":"Royer, Amélie, Alexander Kolesnikov, and Christoph Lampert. “Probabilistic Image Colorization,” 85.1-85.12. BMVA Press, 2017. <a href=\"https://doi.org/10.5244/c.31.85\">https://doi.org/10.5244/c.31.85</a>.","mla":"Royer, Amélie, et al. <i>Probabilistic Image Colorization</i>. BMVA Press, 2017, p. 85.1-85.12, doi:<a href=\"https://doi.org/10.5244/c.31.85\">10.5244/c.31.85</a>."},"conference":{"name":"BMVC: British Machine Vision Conference","end_date":"2017-09-07","location":"London, United Kingdom","start_date":"2017-09-04"},"oa_version":"Published Version","date_updated":"2023-10-16T10:04:02Z","page":"85.1-85.12","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8390"}]},"oa":1,"year":"2017","publisher":"BMVA Press","language":[{"iso":"eng"}],"quality_controlled":"1","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"6532","department":[{"_id":"ChLa"}],"scopus_import":"1","date_created":"2018-12-11T11:49:09Z","date_published":"2017-09-01T00:00:00Z","external_id":{"arxiv":["1705.04258"]}},{"publisher":"AIP Publishing","main_file_link":[{"url":"https://arxiv.org/abs/1703.04616","open_access":"1"}],"intvolume":"        58","language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","isi":1,"publist_id":"6531","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"RoSe"}],"date_created":"2018-12-11T11:49:10Z","scopus_import":"1","date_published":"2017-08-01T00:00:00Z","external_id":{"isi":["000409197200015"]},"date_updated":"2024-02-28T13:07:56Z","publication":" Journal of Mathematical Physics","article_number":"081901","oa":1,"year":"2017","article_processing_charge":"No","volume":58,"month":"08","citation":{"ista":"Deuchert A. 2017. A lower bound for the BCS functional with boundary conditions at infinity.  Journal of Mathematical Physics. 58(8), 081901.","ama":"Deuchert A. A lower bound for the BCS functional with boundary conditions at infinity. <i> Journal of Mathematical Physics</i>. 2017;58(8). doi:<a href=\"https://doi.org/10.1063/1.4996580\">10.1063/1.4996580</a>","short":"A. Deuchert,  Journal of Mathematical Physics 58 (2017).","apa":"Deuchert, A. (2017). A lower bound for the BCS functional with boundary conditions at infinity. <i> Journal of Mathematical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/1.4996580\">https://doi.org/10.1063/1.4996580</a>","ieee":"A. Deuchert, “A lower bound for the BCS functional with boundary conditions at infinity,” <i> Journal of Mathematical Physics</i>, vol. 58, no. 8. AIP Publishing, 2017.","chicago":"Deuchert, Andreas. “A Lower Bound for the BCS Functional with Boundary Conditions at Infinity.” <i> Journal of Mathematical Physics</i>. AIP Publishing, 2017. <a href=\"https://doi.org/10.1063/1.4996580\">https://doi.org/10.1063/1.4996580</a>.","mla":"Deuchert, Andreas. “A Lower Bound for the BCS Functional with Boundary Conditions at Infinity.” <i> Journal of Mathematical Physics</i>, vol. 58, no. 8, 081901, AIP Publishing, 2017, doi:<a href=\"https://doi.org/10.1063/1.4996580\">10.1063/1.4996580</a>."},"day":"01","oa_version":"Submitted Version","project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","call_identifier":"H2020","name":"Analysis of quantum many-body systems"}],"publication_identifier":{"issn":["00222488"]},"ec_funded":1,"status":"public","publication_status":"published","_id":"912","title":"A lower bound for the BCS functional with boundary conditions at infinity","author":[{"first_name":"Andreas","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","last_name":"Deuchert","full_name":"Deuchert, Andreas","orcid":"0000-0003-3146-6746"}],"doi":"10.1063/1.4996580","abstract":[{"lang":"eng","text":"We consider a many-body system of fermionic atoms interacting via a local pair potential and subject to an external potential within the framework of Bardeen-Cooper-Schrieffer (BCS) theory. We measure the free energy of the whole sample with respect to the free energy of a reference state which allows us to define a BCS functional with boundary conditions at infinity. Our main result is a lower bound for this energy functional in terms of expressions that typically appear in Ginzburg-Landau functionals.\r\n"}],"issue":"8"},{"date_published":"2017-07-05T00:00:00Z","external_id":{"isi":["000406670000025"]},"scopus_import":"1","date_created":"2018-12-11T11:49:10Z","department":[{"_id":"SyCr"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"6527","isi":1,"quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"intvolume":"         4","publisher":"Royal Society, The","year":"2017","oa":1,"related_material":{"record":[{"status":"public","relation":"research_data","id":"9853"}]},"article_number":"170547","publication":"Royal Society Open Science","date_updated":"2023-09-26T15:45:47Z","oa_version":"Published Version","day":"05","citation":{"apa":"Giehr, J., Grasse, A. V., Cremer, S., Heinze, J., &#38; Schrempf, A. (2017). Ant queens increase their reproductive efforts after pathogen infection. <i>Royal Society Open Science</i>. Royal Society, The. <a href=\"https://doi.org/10.1098/rsos.170547\">https://doi.org/10.1098/rsos.170547</a>","ieee":"J. Giehr, A. V. Grasse, S. Cremer, J. Heinze, and A. Schrempf, “Ant queens increase their reproductive efforts after pathogen infection,” <i>Royal Society Open Science</i>, vol. 4, no. 7. Royal Society, The, 2017.","short":"J. Giehr, A.V. Grasse, S. Cremer, J. Heinze, A. Schrempf, Royal Society Open Science 4 (2017).","ista":"Giehr J, Grasse AV, Cremer S, Heinze J, Schrempf A. 2017. Ant queens increase their reproductive efforts after pathogen infection. Royal Society Open Science. 4(7), 170547.","ama":"Giehr J, Grasse AV, Cremer S, Heinze J, Schrempf A. Ant queens increase their reproductive efforts after pathogen infection. <i>Royal Society Open Science</i>. 2017;4(7). doi:<a href=\"https://doi.org/10.1098/rsos.170547\">10.1098/rsos.170547</a>","chicago":"Giehr, Julia, Anna V Grasse, Sylvia Cremer, Jürgen Heinze, and Alexandra Schrempf. “Ant Queens Increase Their Reproductive Efforts after Pathogen Infection.” <i>Royal Society Open Science</i>. Royal Society, The, 2017. <a href=\"https://doi.org/10.1098/rsos.170547\">https://doi.org/10.1098/rsos.170547</a>.","mla":"Giehr, Julia, et al. “Ant Queens Increase Their Reproductive Efforts after Pathogen Infection.” <i>Royal Society Open Science</i>, vol. 4, no. 7, 170547, Royal Society, The, 2017, doi:<a href=\"https://doi.org/10.1098/rsos.170547\">10.1098/rsos.170547</a>."},"pubrep_id":"849","month":"07","ddc":["576","592"],"file_date_updated":"2020-07-14T12:48:15Z","has_accepted_license":"1","article_processing_charge":"No","volume":4,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"file_name":"IST-2017-849-v1+1_2017_Grasse_Cremer_AntQueens.pdf","creator":"system","file_size":530412,"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"351ae5e7a37e6e7d9295cd41146c4190","date_updated":"2020-07-14T12:48:15Z","file_id":"4684","date_created":"2018-12-12T10:08:24Z"}],"issue":"7","abstract":[{"lang":"eng","text":"Infections with potentially lethal pathogens may negatively affect an individual’s lifespan and decrease its reproductive value. The terminal investment hypothesis predicts that individuals faced with a reduced survival should invest more into reproduction instead of maintenance and growth. Several studies suggest that individuals are indeed able to estimate their body condition and to increase their reproductive effort with approaching death, while other studies gave ambiguous results. We investigate whether queens of a perennial social insect (ant) are able to boost their reproduction following infection with an obligate killing pathogen. Social insect queens are special with regard to reproduction and aging, as they outlive conspecific non-reproductive workers. Moreover, in the ant Cardiocondyla obscurior, fecundity increases with queen age. However, it remained unclear whether this reflects negative reproductive senescence or terminal investment in response to approaching death. Here, we test whether queens of C. obscurior react to infection with the entomopathogenic fungus Metarhizium brunneum by an increased egg-laying rate. We show that a fungal infection triggers a reinforced investment in reproduction in queens. This adjustment of the reproductive rate by ant queens is consistent with predictions of the terminal investment hypothesis and is reported for the first time in a social insect."}],"doi":"10.1098/rsos.170547","author":[{"first_name":"Julia","last_name":"Giehr","full_name":"Giehr, Julia"},{"last_name":"Grasse","full_name":"Grasse, Anna V","first_name":"Anna V","id":"406F989C-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-2193-3868","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia","full_name":"Cremer, Sylvia","last_name":"Cremer"},{"first_name":"Jürgen","last_name":"Heinze","full_name":"Heinze, Jürgen"},{"first_name":"Alexandra","full_name":"Schrempf, Alexandra","last_name":"Schrempf"}],"title":"Ant queens increase their reproductive efforts after pathogen infection","_id":"914","status":"public","publication_status":"published","acknowledgement":"We thank two anonymous reviewers for helpful suggestions on the manuscript.","publication_identifier":{"issn":["20545703"]}},{"project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160"}],"publication_identifier":{"isbn":["978-153860457-1"]},"ec_funded":1,"status":"public","publication_status":"published","_id":"915","title":"A message passing algorithm for the minimum cost multicut problem","author":[{"first_name":"Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","last_name":"Swoboda","full_name":"Swoboda, Paul"},{"last_name":"Andres","full_name":"Andres, Bjoern","first_name":"Bjoern"}],"doi":"10.1109/CVPR.2017.530","abstract":[{"lang":"eng","text":"We propose a dual decomposition and linear program relaxation of the NP-hard minimum cost multicut problem. Unlike other polyhedral relaxations of the multicut polytope, it is amenable to efficient optimization by message passing. Like other polyhedral relaxations, it can be tightened efficiently by cutting planes.  We define an algorithm that alternates between message passing and efficient separation of cycle- and odd-wheel inequalities. This algorithm is more efficient than state-of-the-art algorithms based on linear programming, including algorithms written in the framework of leading commercial software, as we show in experiments with large instances of the problem from applications in computer vision, biomedical image analysis and data mining."}],"file":[{"file_id":"5849","date_created":"2019-01-18T12:52:46Z","date_updated":"2020-07-14T12:48:15Z","access_level":"open_access","content_type":"application/pdf","checksum":"7e51dacefa693574581a32da3eff63dc","file_name":"Swoboda_A_Message_Passing_CVPR_2017_paper.pdf","file_size":883264,"creator":"dernst","relation":"main_file"}],"volume":2017,"article_processing_charge":"No","has_accepted_license":"1","month":"07","file_date_updated":"2020-07-14T12:48:15Z","ddc":["000"],"citation":{"short":"P. Swoboda, B. Andres, in:, IEEE, 2017, pp. 4990–4999.","ama":"Swoboda P, Andres B. A message passing algorithm for the minimum cost multicut problem. In: Vol 2017. IEEE; 2017:4990-4999. doi:<a href=\"https://doi.org/10.1109/CVPR.2017.530\">10.1109/CVPR.2017.530</a>","ista":"Swoboda P, Andres B. 2017. A message passing algorithm for the minimum cost multicut problem. CVPR: Computer Vision and Pattern Recognition vol. 2017, 4990–4999.","ieee":"P. Swoboda and B. Andres, “A message passing algorithm for the minimum cost multicut problem,” presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 4990–4999.","apa":"Swoboda, P., &#38; Andres, B. (2017). A message passing algorithm for the minimum cost multicut problem (Vol. 2017, pp. 4990–4999). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2017.530\">https://doi.org/10.1109/CVPR.2017.530</a>","chicago":"Swoboda, Paul, and Bjoern Andres. “A Message Passing Algorithm for the Minimum Cost Multicut Problem,” 2017:4990–99. IEEE, 2017. <a href=\"https://doi.org/10.1109/CVPR.2017.530\">https://doi.org/10.1109/CVPR.2017.530</a>.","mla":"Swoboda, Paul, and Bjoern Andres. <i>A Message Passing Algorithm for the Minimum Cost Multicut Problem</i>. Vol. 2017, IEEE, 2017, pp. 4990–99, doi:<a href=\"https://doi.org/10.1109/CVPR.2017.530\">10.1109/CVPR.2017.530</a>."},"day":"01","oa_version":"Submitted Version","conference":{"end_date":"2017-07-26","location":"Honolulu, HA, United States","start_date":"2017-07-21","name":"CVPR: Computer Vision and Pattern Recognition"},"date_updated":"2023-09-26T15:43:27Z","page":"4990-4999","oa":1,"year":"2017","publisher":"IEEE","intvolume":"      2017","type":"conference","quality_controlled":"1","language":[{"iso":"eng"}],"isi":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"6526","department":[{"_id":"VlKo"}],"date_created":"2018-12-11T11:49:11Z","scopus_import":"1","date_published":"2017-07-01T00:00:00Z","external_id":{"isi":["000418371405009"]}},{"file":[{"file_name":"2017_CVPR_Swoboda2.pdf","relation":"main_file","file_size":944332,"creator":"dernst","access_level":"open_access","checksum":"e38a2740daad1ea178465843b5072906","content_type":"application/pdf","date_updated":"2020-07-14T12:48:15Z","file_id":"5848","date_created":"2019-01-18T12:49:38Z"}],"has_accepted_license":"1","volume":2017,"article_processing_charge":"No","citation":{"chicago":"Swoboda, Paul, Carsten Rother, Carsten Abu Alhaija, Dagmar Kainmueller, and Bogdan Savchynskyy. “A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching,” 2017:7062–71. IEEE, 2017. <a href=\"https://doi.org/10.1109/CVPR.2017.747\">https://doi.org/10.1109/CVPR.2017.747</a>.","mla":"Swoboda, Paul, et al. <i>A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching</i>. Vol. 2017, IEEE, 2017, pp. 7062–71, doi:<a href=\"https://doi.org/10.1109/CVPR.2017.747\">10.1109/CVPR.2017.747</a>.","ista":"Swoboda P, Rother C, Abu Alhaija C, Kainmueller D, Savchynskyy B. 2017. A study of lagrangean decompositions and dual ascent solvers for graph matching. CVPR: Computer Vision and Pattern Recognition vol. 2017, 7062–7071.","ama":"Swoboda P, Rother C, Abu Alhaija C, Kainmueller D, Savchynskyy B. A study of lagrangean decompositions and dual ascent solvers for graph matching. In: Vol 2017. IEEE; 2017:7062-7071. doi:<a href=\"https://doi.org/10.1109/CVPR.2017.747\">10.1109/CVPR.2017.747</a>","short":"P. Swoboda, C. Rother, C. Abu Alhaija, D. Kainmueller, B. Savchynskyy, in:, IEEE, 2017, pp. 7062–7071.","apa":"Swoboda, P., Rother, C., Abu Alhaija, C., Kainmueller, D., &#38; Savchynskyy, B. (2017). A study of lagrangean decompositions and dual ascent solvers for graph matching (Vol. 2017, pp. 7062–7071). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2017.747\">https://doi.org/10.1109/CVPR.2017.747</a>","ieee":"P. Swoboda, C. Rother, C. Abu Alhaija, D. Kainmueller, and B. Savchynskyy, “A study of lagrangean decompositions and dual ascent solvers for graph matching,” presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 7062–7071."},"day":"01","month":"01","ddc":["000"],"file_date_updated":"2020-07-14T12:48:15Z","oa_version":"Submitted Version","conference":{"name":"CVPR: Computer Vision and Pattern Recognition","end_date":"2017-07-26","location":"Honolulu, HA, United States","start_date":"2017-07-21"},"publication_identifier":{"isbn":["978-153860457-1"]},"project":[{"grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7"}],"status":"public","publication_status":"published","ec_funded":1,"title":"A study of lagrangean decompositions and dual ascent solvers for graph matching","author":[{"full_name":"Swoboda, Paul","last_name":"Swoboda","id":"446560C6-F248-11E8-B48F-1D18A9856A87","first_name":"Paul"},{"first_name":"Carsten","full_name":"Rother, Carsten","last_name":"Rother"},{"first_name":"Carsten","last_name":"Abu Alhaija","full_name":"Abu Alhaija, Carsten"},{"first_name":"Dagmar","full_name":"Kainmueller, Dagmar","last_name":"Kainmueller"},{"full_name":"Savchynskyy, Bogdan","last_name":"Savchynskyy","first_name":"Bogdan"}],"_id":"916","abstract":[{"text":"We study the quadratic assignment problem, in computer vision also known as graph matching. Two leading solvers for this problem optimize the Lagrange decomposition duals with sub-gradient and dual ascent (also known as message passing) updates. We explore this direction further and propose several additional Lagrangean relaxations of the graph matching problem along with corresponding algorithms, which are all based on a common dual ascent framework. Our extensive empirical evaluation gives several theoretical insights and suggests a new state-of-the-art anytime solver for the considered problem. Our improvement over state-of-the-art is particularly visible on a new dataset with large-scale sparse problem instances containing more than 500 graph nodes each.","lang":"eng"}],"doi":"10.1109/CVPR.2017.747","publisher":"IEEE","intvolume":"      2017","isi":1,"quality_controlled":"1","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"VlKo"}],"publist_id":"6525","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2017-01-01T00:00:00Z","external_id":{"isi":["000418371407018"]},"date_created":"2018-12-11T11:49:11Z","scopus_import":"1","date_updated":"2023-09-26T15:41:40Z","page":"7062-7071","oa":1,"year":"2017"},{"date_created":"2018-12-11T11:49:11Z","scopus_import":"1","external_id":{"isi":["000418371405005"]},"date_published":"2017-07-01T00:00:00Z","publist_id":"6524","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"VlKo"}],"language":[{"iso":"eng"}],"type":"conference","quality_controlled":"1","isi":1,"publisher":"IEEE","intvolume":"      2017","year":"2017","oa":1,"page":"4950-4960","date_updated":"2023-09-26T15:41:11Z","oa_version":"Submitted Version","conference":{"end_date":"2017-07-26","start_date":"2017-07-21","location":"Honolulu, HA, United States","name":"CVPR: Computer Vision and Pattern Recognition"},"month":"07","file_date_updated":"2020-07-14T12:48:15Z","ddc":["000"],"citation":{"mla":"Swoboda, Paul, et al. <i>A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems</i>. Vol. 2017, IEEE, 2017, pp. 4950–60, doi:<a href=\"https://doi.org/10.1109/CVPR.2017.526\">10.1109/CVPR.2017.526</a>.","chicago":"Swoboda, Paul, Jan Kuske, and Bogdan Savchynskyy. “A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems,” 2017:4950–60. IEEE, 2017. <a href=\"https://doi.org/10.1109/CVPR.2017.526\">https://doi.org/10.1109/CVPR.2017.526</a>.","ama":"Swoboda P, Kuske J, Savchynskyy B. A dual ascent framework for Lagrangean decomposition of combinatorial problems. In: Vol 2017. IEEE; 2017:4950-4960. doi:<a href=\"https://doi.org/10.1109/CVPR.2017.526\">10.1109/CVPR.2017.526</a>","short":"P. Swoboda, J. Kuske, B. Savchynskyy, in:, IEEE, 2017, pp. 4950–4960.","ista":"Swoboda P, Kuske J, Savchynskyy B. 2017. A dual ascent framework for Lagrangean decomposition of combinatorial problems. CVPR: Computer Vision and Pattern Recognition vol. 2017, 4950–4960.","apa":"Swoboda, P., Kuske, J., &#38; Savchynskyy, B. (2017). A dual ascent framework for Lagrangean decomposition of combinatorial problems (Vol. 2017, pp. 4950–4960). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2017.526\">https://doi.org/10.1109/CVPR.2017.526</a>","ieee":"P. Swoboda, J. Kuske, and B. Savchynskyy, “A dual ascent framework for Lagrangean decomposition of combinatorial problems,” presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 4950–4960."},"day":"01","article_processing_charge":"No","volume":2017,"has_accepted_license":"1","file":[{"file_id":"5847","date_created":"2019-01-18T12:45:55Z","file_name":"2017_CVPR_Swoboda.pdf","relation":"main_file","file_size":898652,"creator":"dernst","date_updated":"2020-07-14T12:48:15Z","access_level":"open_access","content_type":"application/pdf","checksum":"72fd291046bd8e5717961bd68f6b6f03"}],"doi":"10.1109/CVPR.2017.526","abstract":[{"text":"We  propose  a  general  dual  ascent  framework  for  Lagrangean decomposition of combinatorial problems.  Although methods of this type have shown their efficiency for a number of problems, so far there was no general algorithm applicable to multiple problem types. In this work, we propose such a general algorithm. It depends on several parameters, which can be used to optimize its performance in each particular setting. We demonstrate efficacy of our method on graph matching and multicut problems, where it outperforms state-of-the-art solvers including those based on subgradient optimization and off-the-shelf linear programming solvers.","lang":"eng"}],"_id":"917","title":"A dual ascent framework for Lagrangean decomposition of combinatorial problems","author":[{"id":"446560C6-F248-11E8-B48F-1D18A9856A87","first_name":"Paul","full_name":"Swoboda, Paul","last_name":"Swoboda"},{"first_name":"Jan","last_name":"Kuske","full_name":"Kuske, Jan"},{"first_name":"Bogdan","full_name":"Savchynskyy, Bogdan","last_name":"Savchynskyy"}],"ec_funded":1,"publication_status":"published","status":"public","project":[{"call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"isbn":["978-153860457-1"]}},{"publisher":"Institute of Science and Technology Austria","type":"dissertation","language":[{"iso":"eng"}],"department":[{"_id":"JiFr"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"6483","date_published":"2017-06-02T00:00:00Z","date_created":"2018-12-11T11:49:18Z","date_updated":"2023-09-07T12:06:09Z","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"1591"}]},"page":"117","oa":1,"alternative_title":["ISTA Thesis"],"year":"2017","degree_awarded":"PhD","file":[{"date_created":"2019-04-05T09:03:20Z","file_id":"6215","creator":"dernst","relation":"source_file","file_size":46903863,"file_name":"2017_Adamowski-Thesis_Source.docx","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","checksum":"193425764d9aaaed3ac57062a867b315","access_level":"closed","date_updated":"2020-07-14T12:48:15Z"},{"date_created":"2019-04-05T09:03:19Z","file_id":"6216","date_updated":"2020-07-14T12:48:15Z","checksum":"df5ab01be81f821e1b958596a1ec8d21","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_size":8698888,"creator":"dernst","file_name":"2017_Adamowski-Thesis.pdf"}],"has_accepted_license":"1","article_processing_charge":"No","pubrep_id":"842","citation":{"ista":"Adamowski M. 2017. Investigations into cell polarity and trafficking in the plant model Arabidopsis thaliana . Institute of Science and Technology Austria.","short":"M. Adamowski, Investigations into Cell Polarity and Trafficking in the Plant Model Arabidopsis Thaliana , Institute of Science and Technology Austria, 2017.","ama":"Adamowski M. Investigations into cell polarity and trafficking in the plant model Arabidopsis thaliana . 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_842\">10.15479/AT:ISTA:th_842</a>","ieee":"M. Adamowski, “Investigations into cell polarity and trafficking in the plant model Arabidopsis thaliana ,” Institute of Science and Technology Austria, 2017.","apa":"Adamowski, M. (2017). <i>Investigations into cell polarity and trafficking in the plant model Arabidopsis thaliana </i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_842\">https://doi.org/10.15479/AT:ISTA:th_842</a>","mla":"Adamowski, Maciek. <i>Investigations into Cell Polarity and Trafficking in the Plant Model Arabidopsis Thaliana </i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_842\">10.15479/AT:ISTA:th_842</a>.","chicago":"Adamowski, Maciek. “Investigations into Cell Polarity and Trafficking in the Plant Model Arabidopsis Thaliana .” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:th_842\">https://doi.org/10.15479/AT:ISTA:th_842</a>."},"day":"02","ddc":["581","583","580"],"month":"06","file_date_updated":"2020-07-14T12:48:15Z","oa_version":"Published Version","publication_identifier":{"issn":["2663-337X"]},"status":"public","publication_status":"published","supervisor":[{"orcid":"0000-0002-8302-7596","last_name":"Friml","full_name":"Friml, Jiří","first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"title":"Investigations into cell polarity and trafficking in the plant model Arabidopsis thaliana ","author":[{"orcid":"0000-0001-6463-5257","id":"45F536D2-F248-11E8-B48F-1D18A9856A87","first_name":"Maciek","full_name":"Adamowski, Maciek","last_name":"Adamowski"}],"_id":"938","abstract":[{"text":"The thesis encompasses several topics of plant cell biology which were studied in the model plant Arabidopsis thaliana. Chapter 1 concerns the plant hormone auxin and its polar transport through cells and tissues. The highly controlled, directional transport of auxin is facilitated by plasma membrane-localized transporters. Transporters from the PIN family direct auxin transport due to their polarized localizations at cell membranes. Substantial effort has been put into research on cellular trafficking of PIN proteins, which is thought to underlie their polar distribution. I participated in a forward genetic screen aimed at identifying novel regulators of PIN polarity. The screen yielded several genes which may be involved in PIN polarity regulation or participate in polar auxin transport by other means. Chapter 2 focuses on the endomembrane system, with particular attention to clathrin-mediated endocytosis. The project started with identification of several proteins that interact with clathrin light chains. Among them, I focused on two putative homologues of auxilin, which in non-plant systems is an endocytotic factor known for uncoating clathrin-coated vesicles in the final step of endocytosis. The body of my work consisted of an in-depth characterization of transgenic A. thaliana lines overexpressing these putative auxilins in an inducible manner. Overexpression of these proteins leads to an inhibition of endocytosis, as documented by imaging of cargoes and clathrin-related endocytic machinery. An extension of this work is an investigation into a concept of homeostatic regulation acting between distinct transport processes in the endomembrane system. With auxilin overexpressing lines, where endocytosis is blocked specifically, I made observations on the mutual relationship between two opposite trafficking processes of secretion and endocytosis. In Chapter 3, I analyze cortical microtubule arrays and their relationship to auxin signaling and polarized growth in elongating cells. In plants, microtubules are organized into arrays just below the plasma membrane, and it is thought that their function is to guide membrane-docked cellulose synthase complexes. These, in turn, influence cell wall structure and cell shape by directed deposition of cellulose fibres. In elongating cells, cortical microtubule arrays are able to reorient in relation to long cell axis, and these reorientations have been linked to cell growth and to signaling of growth-regulating factors such as auxin or light. In this chapter, I am addressing the causal relationship between microtubule array reorientation, growth, and auxin signaling. I arrive at a model where array reorientation is not guided by auxin directly, but instead is only controlled by growth, which, in turn, is regulated by auxin.","lang":"eng"}],"doi":"10.15479/AT:ISTA:th_842"}]