[{"_id":"659","quality_controlled":"1","citation":{"mla":"Kage, Frieda, et al. “FMNL Formins Boost Lamellipodial Force Generation.” <i>Nature Communications</i>, vol. 8, 14832, Nature Publishing Group, 2017, doi:<a href=\"https://doi.org/10.1038/ncomms14832\">10.1038/ncomms14832</a>.","apa":"Kage, F., Winterhoff, M., Dimchev, V., Müller, J., Thalheim, T., Freise, A., … Rottner, K. (2017). FMNL formins boost lamellipodial force generation. <i>Nature Communications</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncomms14832\">https://doi.org/10.1038/ncomms14832</a>","chicago":"Kage, Frieda, Moritz Winterhoff, Vanessa Dimchev, Jan Müller, Tobias Thalheim, Anika Freise, Stefan Brühmann, et al. “FMNL Formins Boost Lamellipodial Force Generation.” <i>Nature Communications</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/ncomms14832\">https://doi.org/10.1038/ncomms14832</a>.","short":"F. Kage, M. Winterhoff, V. Dimchev, J. Müller, T. Thalheim, A. Freise, S. Brühmann, J. Kollasser, J. Block, G.A. Dimchev, M. Geyer, H. Schnittler, C. Brakebusch, T. Stradal, M. Carlier, M.K. Sixt, J. Käs, J. Faix, K. Rottner, Nature Communications 8 (2017).","ista":"Kage F, Winterhoff M, Dimchev V, Müller J, Thalheim T, Freise A, Brühmann S, Kollasser J, Block J, Dimchev GA, Geyer M, Schnittler H, Brakebusch C, Stradal T, Carlier M, Sixt MK, Käs J, Faix J, Rottner K. 2017. FMNL formins boost lamellipodial force generation. Nature Communications. 8, 14832.","ieee":"F. Kage <i>et al.</i>, “FMNL formins boost lamellipodial force generation,” <i>Nature Communications</i>, vol. 8. Nature Publishing Group, 2017.","ama":"Kage F, Winterhoff M, Dimchev V, et al. FMNL formins boost lamellipodial force generation. <i>Nature Communications</i>. 2017;8. doi:<a href=\"https://doi.org/10.1038/ncomms14832\">10.1038/ncomms14832</a>"},"publication_identifier":{"issn":["20411723"]},"type":"journal_article","file_date_updated":"2020-07-14T12:47:34Z","scopus_import":1,"abstract":[{"text":"Migration frequently involves Rac-mediated protrusion of lamellipodia, formed by Arp2/3 complex-dependent branching thought to be crucial for force generation and stability of these networks. The formins FMNL2 and FMNL3 are Cdc42 effectors targeting to the lamellipodium tip and shown here to nucleate and elongate actin filaments with complementary activities in vitro. In migrating B16-F1 melanoma cells, both formins contribute to the velocity of lamellipodium protrusion. Loss of FMNL2/3 function in melanoma cells and fibroblasts reduces lamellipodial width, actin filament density and -bundling, without changing patterns of Arp2/3 complex incorporation. Strikingly, in melanoma cells, FMNL2/3 gene inactivation almost completely abolishes protrusion forces exerted by lamellipodia and modifies their ultrastructural organization. Consistently, CRISPR/Cas-mediated depletion of FMNL2/3 in fibroblasts reduces both migration and capability of cells to move against viscous media. Together, we conclude that force generation in lamellipodia strongly depends on FMNL formin activity, operating in addition to Arp2/3 complex-dependent filament branching.","lang":"eng"}],"publication_status":"published","file":[{"file_id":"5072","content_type":"application/pdf","creator":"system","file_size":9523746,"relation":"main_file","checksum":"dae30190291c3630e8102d8714a8d23e","access_level":"open_access","file_name":"IST-2017-902-v1+1_Kage_et_al-2017-Nature_Communications.pdf","date_created":"2018-12-12T10:14:21Z","date_updated":"2020-07-14T12:47:34Z"}],"title":"FMNL formins boost lamellipodial force generation","author":[{"last_name":"Kage","first_name":"Frieda","full_name":"Kage, Frieda"},{"last_name":"Winterhoff","first_name":"Moritz","full_name":"Winterhoff, Moritz"},{"last_name":"Dimchev","first_name":"Vanessa","full_name":"Dimchev, Vanessa"},{"full_name":"Müller, Jan","id":"AD07FDB4-0F61-11EA-8158-C4CC64CEAA8D","first_name":"Jan","last_name":"Müller"},{"full_name":"Thalheim, Tobias","first_name":"Tobias","last_name":"Thalheim"},{"full_name":"Freise, Anika","first_name":"Anika","last_name":"Freise"},{"first_name":"Stefan","last_name":"Brühmann","full_name":"Brühmann, Stefan"},{"first_name":"Jana","last_name":"Kollasser","full_name":"Kollasser, Jana"},{"first_name":"Jennifer","last_name":"Block","full_name":"Block, Jennifer"},{"last_name":"Dimchev","first_name":"Georgi A","full_name":"Dimchev, Georgi A"},{"last_name":"Geyer","first_name":"Matthias","full_name":"Geyer, Matthias"},{"full_name":"Schnittler, Hams","last_name":"Schnittler","first_name":"Hams"},{"last_name":"Brakebusch","first_name":"Cord","full_name":"Brakebusch, Cord"},{"full_name":"Stradal, Theresia","last_name":"Stradal","first_name":"Theresia"},{"last_name":"Carlier","first_name":"Marie","full_name":"Carlier, Marie"},{"first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","last_name":"Sixt","full_name":"Sixt, Michael K"},{"full_name":"Käs, Josef","last_name":"Käs","first_name":"Josef"},{"full_name":"Faix, Jan","first_name":"Jan","last_name":"Faix"},{"first_name":"Klemens","last_name":"Rottner","full_name":"Rottner, Klemens"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","publisher":"Nature Publishing Group","language":[{"iso":"eng"}],"pubrep_id":"902","article_processing_charge":"No","publist_id":"7075","department":[{"_id":"MiSi"}],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2018-12-11T11:47:46Z","ddc":["570"],"day":"22","status":"public","volume":8,"oa_version":"Published Version","doi":"10.1038/ncomms14832","publication":"Nature Communications","date_updated":"2021-01-12T08:08:06Z","oa":1,"month":"03","intvolume":"         8","date_published":"2017-03-22T00:00:00Z","article_number":"14832","year":"2017"},{"publication_status":"published","abstract":[{"text":"Growing microtubules are protected from depolymerization by the presence of a GTP or GDP/Pi cap. End-binding proteins of the EB1 family bind to the stabilizing cap, allowing monitoring of its size in real time. The cap size has been shown to correlate with instantaneous microtubule stability. Here we have quantitatively characterized the properties of cap size fluctuations during steadystate growth and have developed a theory predicting their timescale and amplitude from the kinetics of microtubule growth and cap maturation. In contrast to growth speed fluctuations, cap size fluctuations show a characteristic timescale, which is defined by the lifetime of the cap sites. Growth fluctuations affect the amplitude of cap size fluctuations; however, cap size does not affect growth speed, indicating that microtubules are far from instability during most of their time of growth. Our theory provides the basis for a quantitative understanding of microtubule stability fluctuations during steady-state growth.","lang":"eng"}],"scopus_import":1,"type":"journal_article","publication_identifier":{"issn":["00278424"]},"citation":{"apa":"Rickman, J., Düllberg, C. F., Cade, N., Griffin, L., &#38; Surrey, T. (2017). Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1620274114\">https://doi.org/10.1073/pnas.1620274114</a>","mla":"Rickman, Jamie, et al. “Steady State EB Cap Size Fluctuations Are Determined by Stochastic Microtubule Growth and Maturation.” <i>PNAS</i>, vol. 114, no. 13, National Academy of Sciences, 2017, pp. 3427–32, doi:<a href=\"https://doi.org/10.1073/pnas.1620274114\">10.1073/pnas.1620274114</a>.","ista":"Rickman J, Düllberg CF, Cade N, Griffin L, Surrey T. 2017. Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation. PNAS. 114(13), 3427–3432.","ieee":"J. Rickman, C. F. Düllberg, N. Cade, L. Griffin, and T. Surrey, “Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation,” <i>PNAS</i>, vol. 114, no. 13. National Academy of Sciences, pp. 3427–3432, 2017.","short":"J. Rickman, C.F. Düllberg, N. Cade, L. Griffin, T. Surrey, PNAS 114 (2017) 3427–3432.","ama":"Rickman J, Düllberg CF, Cade N, Griffin L, Surrey T. Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation. <i>PNAS</i>. 2017;114(13):3427-3432. doi:<a href=\"https://doi.org/10.1073/pnas.1620274114\">10.1073/pnas.1620274114</a>","chicago":"Rickman, Jamie, Christian F Düllberg, Nicholas Cade, Lewis Griffin, and Thomas Surrey. “Steady State EB Cap Size Fluctuations Are Determined by Stochastic Microtubule Growth and Maturation.” <i>PNAS</i>. National Academy of Sciences, 2017. <a href=\"https://doi.org/10.1073/pnas.1620274114\">https://doi.org/10.1073/pnas.1620274114</a>."},"quality_controlled":"1","_id":"660","publist_id":"7073","department":[{"_id":"MaLo"}],"language":[{"iso":"eng"}],"publisher":"National Academy of Sciences","title":"Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation","author":[{"last_name":"Rickman","first_name":"Jamie","full_name":"Rickman, Jamie"},{"full_name":"Düllberg, Christian F","first_name":"Christian F","id":"459064DC-F248-11E8-B48F-1D18A9856A87","last_name":"Düllberg","orcid":"0000-0001-6335-9748"},{"last_name":"Cade","first_name":"Nicholas","full_name":"Cade, Nicholas"},{"first_name":"Lewis","last_name":"Griffin","full_name":"Griffin, Lewis"},{"full_name":"Surrey, Thomas","last_name":"Surrey","first_name":"Thomas"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"PNAS","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5380103/"}],"doi":"10.1073/pnas.1620274114","oa_version":"Submitted Version","volume":114,"pmid":1,"status":"public","day":"28","date_created":"2018-12-11T11:47:46Z","page":"3427 - 3432","external_id":{"pmid":["28280102"]},"year":"2017","acknowledgement":"We thank Philippe Cluzel for helpful discussions and Gunnar Pruessner for data analysis advice. This work was supported by the Francis Crick Institute, which receives its core funding from Cancer Research UK Grant FC001163, Medical Research Council Grant FC001163, and Wellcome Trust Grant FC001163. This work was also supported by European Research Council Advanced Grant Project 323042 (to C.D. and T.S.).","date_published":"2017-03-28T00:00:00Z","intvolume":"       114","month":"03","oa":1,"issue":"13","date_updated":"2021-01-12T08:08:09Z"},{"publication":"Nature Cell Biology","main_file_link":[{"url":"https://europepmc.org/articles/pmc5635970","open_access":"1"}],"doi":"10.1038/ncb3492","related_material":{"record":[{"id":"50","relation":"dissertation_contains","status":"public"},{"relation":"dissertation_contains","status":"public","id":"8350"}]},"ec_funded":1,"oa_version":"Submitted Version","volume":19,"pmid":1,"date_created":"2018-12-11T11:47:46Z","day":"27","status":"public","page":"306 - 317","external_id":{"pmid":["28346437"]},"year":"2017","date_published":"2017-03-27T00:00:00Z","month":"03","intvolume":"        19","date_updated":"2024-03-25T23:30:21Z","acknowledged_ssus":[{"_id":"SSU"}],"oa":1,"project":[{"grant_number":"306589","call_identifier":"FP7","name":"Decoding the complexity of turbulence at its origin","_id":"25152F3A-B435-11E9-9278-68D0E5697425"},{"name":"Control of Epithelial Cell Layer Spreading in Zebrafish","_id":"252ABD0A-B435-11E9-9278-68D0E5697425","grant_number":"I 930-B20","call_identifier":"FWF"}],"publication_status":"published","publication_identifier":{"issn":["14657392"]},"citation":{"apa":"Smutny, M., Ákos, Z., Grigolon, S., Shamipour, S., Ruprecht, V., Capek, D., … Heisenberg, C.-P. J. (2017). Friction forces position the neural anlage. <i>Nature Cell Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncb3492\">https://doi.org/10.1038/ncb3492</a>","mla":"Smutny, Michael, et al. “Friction Forces Position the Neural Anlage.” <i>Nature Cell Biology</i>, vol. 19, Nature Publishing Group, 2017, pp. 306–17, doi:<a href=\"https://doi.org/10.1038/ncb3492\">10.1038/ncb3492</a>.","ama":"Smutny M, Ákos Z, Grigolon S, et al. Friction forces position the neural anlage. <i>Nature Cell Biology</i>. 2017;19:306-317. doi:<a href=\"https://doi.org/10.1038/ncb3492\">10.1038/ncb3492</a>","ista":"Smutny M, Ákos Z, Grigolon S, Shamipour S, Ruprecht V, Capek D, Behrndt M, Papusheva E, Tada M, Hof B, Vicsek T, Salbreux G, Heisenberg C-PJ. 2017. Friction forces position the neural anlage. Nature Cell Biology. 19, 306–317.","short":"M. Smutny, Z. Ákos, S. Grigolon, S. Shamipour, V. Ruprecht, D. Capek, M. Behrndt, E. Papusheva, M. Tada, B. Hof, T. Vicsek, G. Salbreux, C.-P.J. Heisenberg, Nature Cell Biology 19 (2017) 306–317.","ieee":"M. Smutny <i>et al.</i>, “Friction forces position the neural anlage,” <i>Nature Cell Biology</i>, vol. 19. Nature Publishing Group, pp. 306–317, 2017.","chicago":"Smutny, Michael, Zsuzsa Ákos, Silvia Grigolon, Shayan Shamipour, Verena Ruprecht, Daniel Capek, Martin Behrndt, et al. “Friction Forces Position the Neural Anlage.” <i>Nature Cell Biology</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/ncb3492\">https://doi.org/10.1038/ncb3492</a>."},"abstract":[{"lang":"eng","text":"During embryonic development, mechanical forces are essential for cellular rearrangements driving tissue morphogenesis. Here, we show that in the early zebrafish embryo, friction forces are generated at the interface between anterior axial mesoderm (prechordal plate, ppl) progenitors migrating towards the animal pole and neurectoderm progenitors moving in the opposite direction towards the vegetal pole of the embryo. These friction forces lead to global rearrangement of cells within the neurectoderm and determine the position of the neural anlage. Using a combination of experiments and simulations, we show that this process depends on hydrodynamic coupling between neurectoderm and ppl as a result of E-cadherin-mediated adhesion between those tissues. Our data thus establish the emergence of friction forces at the interface between moving tissues as a critical force-generating process shaping the embryo."}],"scopus_import":1,"type":"journal_article","_id":"661","quality_controlled":"1","department":[{"_id":"CaHe"},{"_id":"BjHo"},{"_id":"Bio"}],"publist_id":"7074","language":[{"iso":"eng"}],"publisher":"Nature Publishing Group","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Smutny, Michael","last_name":"Smutny","orcid":"0000-0002-5920-9090","first_name":"Michael","id":"3FE6E4E8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ákos, Zsuzsa","last_name":"Ákos","first_name":"Zsuzsa"},{"full_name":"Grigolon, Silvia","first_name":"Silvia","last_name":"Grigolon"},{"full_name":"Shamipour, Shayan","id":"40B34FE2-F248-11E8-B48F-1D18A9856A87","first_name":"Shayan","last_name":"Shamipour"},{"full_name":"Ruprecht, Verena","last_name":"Ruprecht","first_name":"Verena"},{"full_name":"Capek, Daniel","orcid":"0000-0001-5199-9940","last_name":"Capek","first_name":"Daniel","id":"31C42484-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Behrndt","id":"3ECECA3A-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","full_name":"Behrndt, Martin"},{"full_name":"Papusheva, Ekaterina","id":"41DB591E-F248-11E8-B48F-1D18A9856A87","first_name":"Ekaterina","last_name":"Papusheva"},{"full_name":"Tada, Masazumi","last_name":"Tada","first_name":"Masazumi"},{"full_name":"Hof, Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87","first_name":"Björn","last_name":"Hof","orcid":"0000-0003-2057-2754"},{"full_name":"Vicsek, Tamás","first_name":"Tamás","last_name":"Vicsek"},{"first_name":"Guillaume","last_name":"Salbreux","full_name":"Salbreux, Guillaume"},{"orcid":"0000-0002-0912-4566","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J"}],"title":"Friction forces position the neural anlage"},{"page":"76 - 90","external_id":{"isi":["000384396000005"]},"year":"2017","intvolume":"        78","month":"01","date_published":"2017-01-01T00:00:00Z","date_updated":"2023-09-20T09:42:40Z","oa":1,"doi":"10.1016/j.jsc.2016.03.008","main_file_link":[{"url":"https://doi.org/10.1016/j.jsc.2016.03.008","open_access":"1"}],"publication":"Journal of Symbolic Computation","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"10894"}]},"isi":1,"ec_funded":1,"oa_version":"Published Version","volume":78,"date_created":"2018-12-11T11:51:59Z","status":"public","day":"01","article_processing_charge":"No","publist_id":"5765","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"article_type":"original","publisher":"Academic Press","author":[{"last_name":"Bauer","first_name":"Ulrich","full_name":"Bauer, Ulrich"},{"full_name":"Kerber, Michael","first_name":"Michael","last_name":"Kerber"},{"last_name":"Reininghaus","first_name":"Jan","full_name":"Reininghaus, Jan"},{"full_name":"Wagner, Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","first_name":"Hubert","last_name":"Wagner"}],"title":"Phat - Persistent homology algorithms toolbox","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"call_identifier":"FP7","grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425","name":"Topological Complex Systems"}],"publication_status":"published","citation":{"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>.","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>","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>.","ista":"Bauer U, Kerber M, Reininghaus J, Wagner H. 2017. Phat - Persistent homology algorithms toolbox. Journal of Symbolic Computation. 78, 76–90.","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.","short":"U. Bauer, M. Kerber, J. Reininghaus, H. Wagner, Journal of Symbolic Computation 78 (2017) 76–90.","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>"},"publication_identifier":{"issn":[" 07477171"]},"type":"journal_article","scopus_import":"1","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","quality_controlled":"1"},{"language":[{"iso":"eng"}],"article_type":"original","pubrep_id":"489","article_processing_charge":"Yes (via OA deal)","publist_id":"5644","department":[{"_id":"LaEr"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"id":"442E6A6C-F248-11E8-B48F-1D18A9856A87","first_name":"Zhigang","orcid":"0000-0003-3036-1475","last_name":"Bao","full_name":"Bao, Zhigang"},{"full_name":"Erdös, László","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","orcid":"0000-0001-5366-9603"}],"title":"Delocalization for a class of random block band matrices","file":[{"date_created":"2018-12-12T10:08:05Z","date_updated":"2020-07-14T12:45:00Z","file_name":"IST-2016-489-v1+1_s00440-015-0692-y.pdf","checksum":"67afa85ff1e220cbc1f9f477a828513c","access_level":"open_access","relation":"main_file","file_id":"4665","content_type":"application/pdf","creator":"system","file_size":1615755}],"has_accepted_license":"1","publisher":"Springer","project":[{"grant_number":"338804","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","_id":"1528","quality_controlled":"1","citation":{"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>.","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>","short":"Z. Bao, L. Erdös, Probability Theory and Related Fields 167 (2017) 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.","ista":"Bao Z, Erdös L. 2017. Delocalization for a class of random block band matrices. Probability Theory and Related Fields. 167(3–4), 673–776.","mla":"Bao, Zhigang, and László Erdös. “Delocalization for a Class of Random Block Band Matrices.” <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>.","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>"},"publication_identifier":{"issn":["01788051"]},"scopus_import":"1","abstract":[{"lang":"eng","text":"We consider N×N Hermitian random matrices H consisting of blocks of size M≥N6/7. The matrix elements are i.i.d. within the blocks, close to a Gaussian in the four moment matching sense, but their distribution varies from block to block to form a block-band structure, with an essential band width M. We show that the entries of the Green’s function G(z)=(H−z)−1 satisfy the local semicircle law with spectral parameter z=E+iη down to the real axis for any η≫N−1, using a combination of the supersymmetry method inspired by Shcherbina (J Stat Phys 155(3): 466–499, 2014) and the Green’s function comparison strategy. Previous estimates were valid only for η≫M−1. The new estimate also implies that the eigenvectors in the middle of the spectrum are fully delocalized."}],"file_date_updated":"2020-07-14T12:45:00Z","type":"journal_article","year":"2017","external_id":{"isi":["000398842700004"]},"page":"673 - 776","date_updated":"2023-09-20T09:42:12Z","oa":1,"issue":"3-4","date_published":"2017-04-01T00:00:00Z","intvolume":"       167","month":"04","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.","ec_funded":1,"oa_version":"Published Version","isi":1,"publication":"Probability Theory and Related Fields","doi":"10.1007/s00440-015-0692-y","ddc":["530"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2018-12-11T11:52:32Z","day":"01","status":"public","volume":167},{"volume":10205,"date_created":"2023-06-21T13:21:14Z","day":"31","status":"public","publication":"Tools and Algorithms for the Construction and Analysis of Systems","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1701.05738","open_access":"1"}],"doi":"10.1007/978-3-662-54577-5_26","oa_version":"Preprint","date_published":"2017-03-31T00:00:00Z","alternative_title":["LNCS"],"intvolume":"     10205","month":"03","acknowledgement":"This work is partially funded by the DFG project “Verified Model Checkers” and by the Czech Science Foundation, grant No. P202/12/G061.","date_updated":"2023-06-21T13:29:46Z","oa":1,"external_id":{"arxiv":["1701.05738"]},"page":"443-460","conference":{"location":"Uppsala, Sweden","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2017-04-29","start_date":"2017-04-22"},"year":"2017","citation":{"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>","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>.","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.","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.","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.","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>","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>."},"publication_identifier":{"isbn":["9783662545768"],"eisbn":["9783662545775"],"eissn":["1611-3349"],"issn":["0302-9743"]},"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"}],"arxiv":1,"type":"conference","_id":"13160","quality_controlled":"1","publication_status":"published","publisher":"Springer","title":"Index appearance record for transforming Rabin automata into parity automata","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Kretinsky, Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Kretinsky","orcid":"0000-0002-8122-2881"},{"full_name":"Meggendorfer, Tobias","orcid":"0000-0002-1712-2165","last_name":"Meggendorfer","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","first_name":"Tobias"},{"full_name":"Waldmann, Clara","first_name":"Clara","last_name":"Waldmann"},{"first_name":"Maximilian","last_name":"Weininger","full_name":"Weininger, Maximilian"}],"article_processing_charge":"No","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}]},{"volume":78,"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2018-12-11T11:51:27Z","ddc":["576"],"status":"public","day":"01","doi":"10.1007/s00453-016-0212-1","publication":"Algorithmica","isi":1,"oa_version":"Published Version","ec_funded":1,"month":"06","intvolume":"        78","date_published":"2017-06-01T00:00:00Z","date_updated":"2023-09-20T11:14:42Z","issue":"2","oa":1,"page":"681 - 713","external_id":{"isi":["000400379500013"]},"year":"2017","publication_identifier":{"issn":["01784617"]},"citation":{"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>","short":"T. Paixao, J. Pérez Heredia, D. Sudholt, B. Trubenova, Algorithmica 78 (2017) 681–713.","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.","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.","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>.","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>","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>."},"type":"journal_article","file_date_updated":"2020-07-14T12:44:44Z","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"}],"scopus_import":"1","_id":"1336","quality_controlled":"1","project":[{"grant_number":"618091","call_identifier":"FP7","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation"}],"publication_status":"published","has_accepted_license":"1","publisher":"Springer","file":[{"checksum":"7873f665a0c598ac747c908f34cb14b9","access_level":"open_access","relation":"main_file","file_id":"4805","content_type":"application/pdf","file_size":710206,"creator":"system","date_created":"2018-12-12T10:10:19Z","date_updated":"2020-07-14T12:44:44Z","file_name":"IST-2016-658-v1+1_s00453-016-0212-1.pdf"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"last_name":"Paixao","orcid":"0000-0003-2361-3953","first_name":"Tiago","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","full_name":"Paixao, Tiago"},{"full_name":"Pérez Heredia, Jorge","last_name":"Pérez Heredia","first_name":"Jorge"},{"last_name":"Sudholt","first_name":"Dirk","full_name":"Sudholt, Dirk"},{"full_name":"Trubenova, Barbora","last_name":"Trubenova","orcid":"0000-0002-6873-2967","id":"42302D54-F248-11E8-B48F-1D18A9856A87","first_name":"Barbora"}],"title":"Towards a runtime comparison of natural and artificial evolution","article_processing_charge":"No","publist_id":"5931","department":[{"_id":"NiBa"},{"_id":"CaGu"}],"language":[{"iso":"eng"}],"pubrep_id":"658"},{"page":"667 - 727","external_id":{"isi":["000414358400002"]},"year":"2017","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria).  ","month":"12","intvolume":"       169","date_published":"2017-12-01T00:00:00Z","issue":"3-4","oa":1,"date_updated":"2023-09-20T11:14:17Z","doi":"10.1007/s00440-016-0740-2","publication":"Probability Theory and Related Fields","isi":1,"ec_funded":1,"oa_version":"Published Version","volume":169,"status":"public","day":"01","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["510","530"],"date_created":"2018-12-11T11:51:27Z","publist_id":"5930","department":[{"_id":"LaEr"}],"article_processing_charge":"Yes (via OA deal)","pubrep_id":"657","language":[{"iso":"eng"}],"publisher":"Springer","has_accepted_license":"1","file":[{"relation":"main_file","access_level":"open_access","checksum":"29f5a72c3f91e408aeb9e78344973803","file_id":"4686","content_type":"application/pdf","file_size":988843,"creator":"system","date_created":"2018-12-12T10:08:25Z","date_updated":"2020-07-14T12:44:44Z","file_name":"IST-2017-657-v1+2_s00440-016-0740-2.pdf"}],"author":[{"full_name":"Ajanki, Oskari H","last_name":"Ajanki","id":"36F2FB7E-F248-11E8-B48F-1D18A9856A87","first_name":"Oskari H"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","orcid":"0000-0001-5366-9603","last_name":"Erdös","full_name":"Erdös, László"},{"full_name":"Krüger, Torben H","id":"3020C786-F248-11E8-B48F-1D18A9856A87","first_name":"Torben H","orcid":"0000-0002-4821-3297","last_name":"Krüger"}],"title":"Universality for general Wigner-type matrices","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_status":"published","project":[{"call_identifier":"FP7","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"file_date_updated":"2020-07-14T12:44:44Z","type":"journal_article","abstract":[{"text":"We consider the local eigenvalue distribution of large self-adjoint N×N random matrices H=H∗ with centered independent entries. In contrast to previous works the matrix of variances sij=\\mathbbmE|hij|2 is not assumed to be stochastic. Hence the density of states is not the Wigner semicircle law. Its possible shapes are described in the companion paper (Ajanki et al. in Quadratic Vector Equations on the Complex Upper Half Plane. arXiv:1506.05095). We show that as N grows, the resolvent, G(z)=(H−z)−1, converges to a diagonal matrix, diag(m(z)), where m(z)=(m1(z),…,mN(z)) solves the vector equation −1/mi(z)=z+∑jsijmj(z) that has been analyzed in Ajanki et al. (Quadratic Vector Equations on the Complex Upper Half Plane. arXiv:1506.05095). We prove a local law down to the smallest spectral resolution scale, and bulk universality for both real symmetric and complex hermitian symmetry classes.","lang":"eng"}],"scopus_import":"1","publication_identifier":{"issn":["01788051"]},"citation":{"short":"O.H. Ajanki, L. Erdös, T.H. Krüger, Probability Theory and Related Fields 169 (2017) 667–727.","ieee":"O. H. Ajanki, L. Erdös, and T. H. Krüger, “Universality for general Wigner-type matrices,” <i>Probability Theory and Related Fields</i>, vol. 169, no. 3–4. Springer, pp. 667–727, 2017.","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>","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>.","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>","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>."},"quality_controlled":"1","_id":"1337"},{"language":[{"iso":"eng"}],"pubrep_id":"656","article_processing_charge":"No","department":[{"_id":"ToHe"}],"publist_id":"5929","title":"From non-preemptive to preemptive scheduling using synchronization synthesis","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol"},{"first_name":"Edmund","last_name":"Clarke","full_name":"Clarke, Edmund"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna"},{"full_name":"Ryzhyk, Leonid","first_name":"Leonid","last_name":"Ryzhyk"},{"last_name":"Samanta","id":"3D2AAC08-F248-11E8-B48F-1D18A9856A87","first_name":"Roopsha","full_name":"Samanta, Roopsha"},{"full_name":"Tarrach, Thorsten","first_name":"Thorsten","id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4409-8487","last_name":"Tarrach"}],"file":[{"file_name":"IST-2016-656-v1+1_s10703-016-0256-5.pdf","date_updated":"2020-07-14T12:44:44Z","date_created":"2018-12-12T10:13:05Z","file_size":1416170,"creator":"system","content_type":"application/pdf","file_id":"4985","access_level":"open_access","relation":"main_file","checksum":"1163dfd997e8212c789525d4178b1653"}],"has_accepted_license":"1","publisher":"Springer","project":[{"grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"publication_status":"published","_id":"1338","quality_controlled":"1","citation":{"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>","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>.","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.","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.","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.","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>."},"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"}],"scopus_import":"1","type":"journal_article","file_date_updated":"2020-07-14T12:44:44Z","year":"2017","page":"97 - 139","external_id":{"isi":["000399888900001"]},"date_updated":"2023-09-20T11:13:51Z","oa":1,"issue":"2-3","date_published":"2017-06-01T00:00:00Z","intvolume":"        50","month":"06","related_material":{"record":[{"id":"1729","status":"public","relation":"earlier_version"}]},"ec_funded":1,"oa_version":"Published Version","isi":1,"publication":"Formal Methods in System Design","doi":"10.1007/s10703-016-0256-5","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["000"],"date_created":"2018-12-11T11:51:27Z","status":"public","day":"01","volume":50},{"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1835"}]},"oa_version":"Published Version","ec_funded":1,"isi":1,"publication":"Acta Informatica","doi":"10.1007/s00236-016-0278-x","ddc":["006","576"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2018-12-11T11:51:32Z","day":"01","status":"public","volume":54,"year":"2017","external_id":{"isi":["000414343200003"]},"page":"765 - 787","date_updated":"2025-05-28T11:57:04Z","oa":1,"issue":"8","date_published":"2017-12-01T00:00:00Z","intvolume":"        54","month":"12","project":[{"grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211"},{"call_identifier":"FP7","grant_number":"618091","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425"},{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7"},{"_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7","grant_number":"250152"}],"publication_status":"published","_id":"1351","quality_controlled":"1","publication_identifier":{"issn":["00015903"]},"citation":{"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>.","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>","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>.","short":"M. Giacobbe, C.C. Guet, A. Gupta, T.A. Henzinger, T. Paixao, T. Petrov, Acta Informatica 54 (2017) 765–787.","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.","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.","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>"},"scopus_import":"1","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"}],"file_date_updated":"2020-07-14T12:44:46Z","type":"journal_article","language":[{"iso":"eng"}],"pubrep_id":"649","article_processing_charge":"No","department":[{"_id":"ToHe"},{"_id":"CaGu"},{"_id":"NiBa"}],"publist_id":"5898","author":[{"full_name":"Giacobbe, Mirco","last_name":"Giacobbe","orcid":"0000-0001-8180-0904","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","first_name":"Mirco"},{"full_name":"Guet, Calin C","first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","last_name":"Guet","orcid":"0000-0001-6220-2052"},{"full_name":"Gupta, Ashutosh","first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"orcid":"0000-0003-2361-3953","last_name":"Paixao","first_name":"Tiago","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","full_name":"Paixao, Tiago"},{"full_name":"Petrov, Tatjana","first_name":"Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","last_name":"Petrov","orcid":"0000-0002-9041-0905"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Model checking the evolution of gene regulatory networks","file":[{"file_name":"2017_ActaInformatica_Giacobbe.pdf","date_created":"2019-01-17T15:57:29Z","date_updated":"2020-07-14T12:44:46Z","content_type":"application/pdf","file_id":"5841","creator":"dernst","file_size":755241,"access_level":"open_access","checksum":"4e661d9135d7f8c342e8e258dee76f3e","relation":"main_file"}],"has_accepted_license":"1","publisher":"Springer"},{"file":[{"file_name":"IST-2016-634-v1+1_starAdaptivity-cgf.pdf","date_created":"2018-12-12T10:16:21Z","date_updated":"2020-07-14T12:44:47Z","creator":"system","file_size":1434439,"content_type":"application/pdf","file_id":"5208","checksum":"7676e9a9ead6d58c3000988c97deb2ef","relation":"main_file","access_level":"open_access"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Adaptive physically based models in computer graphics","author":[{"first_name":"Pierre","last_name":"Manteaux","full_name":"Manteaux, Pierre"},{"first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","last_name":"Wojtan","full_name":"Wojtan, Christopher J"},{"first_name":"Rahul","last_name":"Narain","full_name":"Narain, Rahul"},{"last_name":"Redon","first_name":"Stéphane","full_name":"Redon, Stéphane"},{"first_name":"François","last_name":"Faure","full_name":"Faure, François"},{"full_name":"Cani, Marie","last_name":"Cani","first_name":"Marie"}],"has_accepted_license":"1","publisher":"Wiley-Blackwell","language":[{"iso":"eng"}],"pubrep_id":"634","article_processing_charge":"No","publist_id":"5873","department":[{"_id":"ChWo"}],"_id":"1367","quality_controlled":"1","citation":{"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>","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.","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.","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>","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>."},"publication_identifier":{"issn":["01677055"]},"file_date_updated":"2020-07-14T12:44:47Z","type":"journal_article","abstract":[{"text":"One of the major challenges in physically based modelling is making simulations efficient. Adaptive models provide an essential solution to these efficiency goals. These models are able to self-adapt in space and time, attempting to provide the best possible compromise between accuracy and speed. This survey reviews the adaptive solutions proposed so far in computer graphics. Models are classified according to the strategy they use for adaptation, from time-stepping and freezing techniques to geometric adaptivity in the form of structured grids, meshes and particles. Applications range from fluids, through deformable bodies, to articulated solids.","lang":"eng"}],"scopus_import":"1","publication_status":"published","date_updated":"2023-09-20T11:05:36Z","issue":"6","oa":1,"month":"09","intvolume":"        36","date_published":"2017-09-01T00:00:00Z","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).","year":"2017","page":"312 - 337","external_id":{"isi":["000408634200019"]},"date_created":"2018-12-11T11:51:37Z","ddc":["000"],"status":"public","day":"01","volume":36,"isi":1,"oa_version":"Submitted Version","doi":"10.1111/cgf.12941","publication":"Computer Graphics Forum"},{"quality_controlled":"1","_id":"1407","scopus_import":"1","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"}],"arxiv":1,"type":"journal_article","citation":{"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>.","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>","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>.","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>","short":"M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, C. Belta, Nonlinear Analysis: Hybrid Systems 23 (2017) 230–253.","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.","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."},"publication_status":"published","project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","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"},{"full_name":"Kretinsky, Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Kretinsky","orcid":"0000-0002-8122-2881"},{"last_name":"Chmelik","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Ivana","last_name":"Cěrná","full_name":"Cěrná, Ivana"},{"full_name":"Belta, Cǎlin","last_name":"Belta","first_name":"Cǎlin"}],"publisher":"Elsevier","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publist_id":"5800","article_processing_charge":"No","day":"01","status":"public","date_created":"2018-12-11T11:51:50Z","volume":23,"ec_funded":1,"oa_version":"Preprint","isi":1,"related_material":{"record":[{"id":"1689","relation":"earlier_version","status":"public"}]},"publication":"Nonlinear Analysis: Hybrid Systems","main_file_link":[{"url":"http://arxiv.org/abs/1410.5387","open_access":"1"}],"doi":"10.1016/j.nahs.2016.04.006","oa":1,"issue":"2","date_updated":"2023-09-20T09:43:09Z","date_published":"2017-02-01T00:00:00Z","month":"02","intvolume":"        23","year":"2017","page":"230 - 253","external_id":{"isi":["000390637000014"],"arxiv":["1410.5387"]}},{"oa":1,"date_updated":"2023-09-13T09:49:10Z","month":"02","intvolume":"        54","date_published":"2017-02-21T00:00:00Z","year":"2017","conference":{"name":"AISTATS: Conference on Artificial Intelligence and Statistics","start_date":"2017-04-20","end_date":"2017-04-22","location":"Fort Lauderdale, FL, United States"},"page":"860-868","external_id":{"arxiv":["1702.06457"]},"status":"public","day":"21","date_created":"2023-08-22T14:17:19Z","volume":54,"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1702.06457"}],"publication":"Proceedings of the 20th International Conference on Artificial Intelligence and Statistics","title":"A unified optimization view on generalized matching pursuit and Frank-Wolfe","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","last_name":"Locatello","first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"last_name":"Khanna","first_name":"Rajiv","full_name":"Khanna, Rajiv"},{"first_name":"Michael","last_name":"Tschannen","full_name":"Tschannen, Michael"},{"full_name":"Jaggi, Martin","first_name":"Martin","last_name":"Jaggi"}],"publisher":"ML Research Press","language":[{"iso":"eng"}],"department":[{"_id":"FrLo"}],"article_processing_charge":"No","quality_controlled":"1","_id":"14205","type":"conference","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"}],"arxiv":1,"extern":"1","citation":{"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.","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.","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.","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.","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.","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."},"publication_status":"published"},{"date_published":"2017-05-31T00:00:00Z","month":"05","date_updated":"2023-09-13T08:32:23Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Greedy algorithms for cone constrained optimization with convergence guarantees","author":[{"first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco"},{"full_name":"Tschannen, Michael","last_name":"Tschannen","first_name":"Michael"},{"last_name":"Rätsch","first_name":"Gunnar","full_name":"Rätsch, Gunnar"},{"first_name":"Martin","last_name":"Jaggi","full_name":"Jaggi, Martin"}],"oa":1,"article_processing_charge":"No","external_id":{"arxiv":["1705.11041"]},"conference":{"location":"Long Beach, CA, United States","name":"NeurIPS: Neural Information Processing Systems","start_date":"2017-12-04","end_date":"2017-12-09"},"department":[{"_id":"FrLo"}],"language":[{"iso":"eng"}],"year":"2017","publication_identifier":{"isbn":["9781510860964"]},"citation":{"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.","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.","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.","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.","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.","mla":"Locatello, Francesco, et al. “Greedy Algorithms for Cone Constrained Optimization with Convergence Guarantees.” <i>Advances in Neural Information Processing Systems</i>, 2017."},"extern":"1","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,"type":"conference","date_created":"2023-08-22T14:17:38Z","_id":"14206","status":"public","quality_controlled":"1","day":"31","publication":"Advances in Neural Information Processing Systems","main_file_link":[{"url":"https://arxiv.org/abs/1705.11041","open_access":"1"}],"publication_status":"published","oa_version":"Preprint"},{"publication_status":"published","project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7"}],"scopus_import":"1","arxiv":1,"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."}],"type":"journal_article","citation":{"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>.","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>","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>.","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.","short":"A. Akopyan, V. Vysotsky, The American Mathematical Monthly 124 (2017) 588–596.","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.","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>"},"publication_identifier":{"issn":["00029890"]},"quality_controlled":"1","_id":"909","publist_id":"6534","department":[{"_id":"HeEd"}],"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"publisher":"Mathematical Association of America","author":[{"first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","last_name":"Akopyan","full_name":"Akopyan, Arseniy"},{"last_name":"Vysotsky","first_name":"Vladislav","full_name":"Vysotsky, Vladislav"}],"title":"On the lengths of curves passing through boundary points of a planar convex shape","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"The American Mathematical Monthly","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1605.07997"}],"doi":"10.4169/amer.math.monthly.124.7.588","oa_version":"Submitted Version","ec_funded":1,"isi":1,"volume":124,"status":"public","day":"01","date_created":"2018-12-11T11:49:09Z","external_id":{"isi":["000413947300002"],"arxiv":["1605.07997"]},"page":"588 - 596","year":"2017","date_published":"2017-01-01T00:00:00Z","month":"01","intvolume":"       124","oa":1,"issue":"7","date_updated":"2023-10-17T11:24:57Z"},{"project":[{"grant_number":"618091","call_identifier":"FP7","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation"}],"publication_status":"published","citation":{"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>","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>.","ista":"Novak S, Barton NH. 2017. When does frequency-independent selection maintain genetic variation? Genetics. 207(2), 653–668.","short":"S. Novak, N.H. Barton, Genetics 207 (2017) 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.","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>","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>."},"type":"journal_article","file_date_updated":"2020-07-14T12:48:15Z","abstract":[{"lang":"eng","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"}],"scopus_import":"1","_id":"910","quality_controlled":"1","article_processing_charge":"No","department":[{"_id":"NiBa"}],"publist_id":"6533","language":[{"iso":"eng"}],"pubrep_id":"974","has_accepted_license":"1","publisher":"Genetics Society of America","file":[{"date_updated":"2020-07-14T12:48:15Z","date_created":"2018-12-12T10:17:12Z","file_name":"IST-2018-974-v1+1_manuscript.pdf","relation":"main_file","checksum":"f7c32dabf52e6d9e709d9203761e39fd","access_level":"open_access","file_id":"5264","content_type":"application/pdf","creator":"system","file_size":494268}],"title":"When does frequency-independent selection maintain genetic variation?","author":[{"id":"461468AE-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian","last_name":"Novak","orcid":"0000-0002-2519-824X","full_name":"Novak, Sebastian"},{"orcid":"0000-0002-8548-5240","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","full_name":"Barton, Nicholas H"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","doi":"10.1534/genetics.117.300129","publication":"Genetics","isi":1,"oa_version":"Submitted Version","ec_funded":1,"volume":207,"ddc":["576"],"date_created":"2018-12-11T11:49:09Z","status":"public","day":"01","external_id":{"isi":["000412232600019"]},"page":"653 - 668","year":"2017","intvolume":"       207","month":"10","date_published":"2017-10-01T00:00:00Z","date_updated":"2023-09-26T15:49:15Z","issue":"2","oa":1},{"ec_funded":1,"oa_version":"Published Version","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8390"}]},"doi":"10.5244/c.31.85","status":"public","day":"01","date_created":"2018-12-11T11:49:09Z","ddc":["000"],"year":"2017","conference":{"start_date":"2017-09-04","end_date":"2017-09-07","name":"BMVC: British Machine Vision Conference","location":"London, United Kingdom"},"page":"85.1-85.12","external_id":{"arxiv":["1705.04258"]},"oa":1,"date_updated":"2023-10-16T10:04:02Z","date_published":"2017-09-01T00:00:00Z","month":"09","publication_status":"published","project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036","call_identifier":"FP7"}],"quality_controlled":"1","_id":"911","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"}],"scopus_import":"1","arxiv":1,"type":"conference","file_date_updated":"2020-08-10T07:14:33Z","citation":{"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>.","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>","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.","ista":"Royer A, Kolesnikov A, Lampert C. 2017. Probabilistic image colorization. BMVC: British Machine Vision Conference, 85.1-85.12.","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>.","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>"},"publication_identifier":{"eisbn":["190172560X"]},"language":[{"iso":"eng"}],"department":[{"_id":"ChLa"}],"publist_id":"6532","article_processing_charge":"No","title":"Probabilistic image colorization","author":[{"full_name":"Royer, Amélie","orcid":"0000-0002-8407-0705","last_name":"Royer","first_name":"Amélie","id":"3811D890-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kolesnikov, Alexander","last_name":"Kolesnikov","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander"},{"full_name":"Lampert, Christoph","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","last_name":"Lampert"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_created":"2020-08-10T07:14:33Z","date_updated":"2020-08-10T07:14:33Z","file_name":"2017_BMVC_Royer.pdf","success":1,"relation":"main_file","access_level":"open_access","file_size":1625363,"creator":"dernst","content_type":"application/pdf","file_id":"8224"}],"publisher":"BMVA Press","has_accepted_license":"1"},{"article_number":"081901","date_published":"2017-08-01T00:00:00Z","intvolume":"        58","month":"08","oa":1,"issue":"8","date_updated":"2024-02-28T13:07:56Z","external_id":{"isi":["000409197200015"]},"year":"2017","volume":58,"status":"public","day":"01","date_created":"2018-12-11T11:49:10Z","publication":" Journal of Mathematical Physics","doi":"10.1063/1.4996580","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1703.04616"}],"oa_version":"Submitted Version","ec_funded":1,"isi":1,"publisher":"AIP Publishing","title":"A lower bound for the BCS functional with boundary conditions at infinity","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Andreas","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","last_name":"Deuchert","orcid":"0000-0003-3146-6746","full_name":"Deuchert, Andreas"}],"department":[{"_id":"RoSe"}],"publist_id":"6531","article_processing_charge":"No","language":[{"iso":"eng"}],"scopus_import":"1","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"}],"type":"journal_article","publication_identifier":{"issn":["00222488"]},"citation":{"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>","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>.","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>","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.","ista":"Deuchert A. 2017. A lower bound for the BCS functional with boundary conditions at infinity.  Journal of Mathematical Physics. 58(8), 081901.","short":"A. Deuchert,  Journal of Mathematical Physics 58 (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>."},"quality_controlled":"1","_id":"912","publication_status":"published","project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","grant_number":"694227","call_identifier":"H2020"}]},{"article_processing_charge":"No","department":[{"_id":"SyCr"}],"publist_id":"6527","language":[{"iso":"eng"}],"pubrep_id":"849","has_accepted_license":"1","publisher":"Royal Society, The","title":"Ant queens increase their reproductive efforts after pathogen infection","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Giehr, Julia","last_name":"Giehr","first_name":"Julia"},{"id":"406F989C-F248-11E8-B48F-1D18A9856A87","first_name":"Anna V","last_name":"Grasse","full_name":"Grasse, Anna V"},{"first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","last_name":"Cremer","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia"},{"full_name":"Heinze, Jürgen","last_name":"Heinze","first_name":"Jürgen"},{"last_name":"Schrempf","first_name":"Alexandra","full_name":"Schrempf, Alexandra"}],"file":[{"content_type":"application/pdf","file_id":"4684","file_size":530412,"creator":"system","checksum":"351ae5e7a37e6e7d9295cd41146c4190","access_level":"open_access","relation":"main_file","file_name":"IST-2017-849-v1+1_2017_Grasse_Cremer_AntQueens.pdf","date_created":"2018-12-12T10:08:24Z","date_updated":"2020-07-14T12:48:15Z"}],"publication_status":"published","publication_identifier":{"issn":["20545703"]},"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>","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>.","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>."},"scopus_import":"1","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."}],"file_date_updated":"2020-07-14T12:48:15Z","type":"journal_article","_id":"914","quality_controlled":"1","external_id":{"isi":["000406670000025"]},"year":"2017","date_published":"2017-07-05T00:00:00Z","month":"07","intvolume":"         4","acknowledgement":"We thank two anonymous reviewers for helpful suggestions on the manuscript.","article_number":"170547","date_updated":"2023-09-26T15:45:47Z","oa":1,"issue":"7","publication":"Royal Society Open Science","doi":"10.1098/rsos.170547","related_material":{"record":[{"status":"public","relation":"research_data","id":"9853"}]},"oa_version":"Published Version","isi":1,"volume":4,"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2018-12-11T11:49:10Z","ddc":["576","592"],"status":"public","day":"05"},{"volume":2017,"ddc":["000"],"date_created":"2018-12-11T11:49:11Z","day":"01","status":"public","doi":"10.1109/CVPR.2017.530","isi":1,"oa_version":"Submitted Version","ec_funded":1,"month":"07","intvolume":"      2017","date_published":"2017-07-01T00:00:00Z","date_updated":"2023-09-26T15:43:27Z","oa":1,"external_id":{"isi":["000418371405009"]},"page":"4990-4999","conference":{"end_date":"2017-07-26","start_date":"2017-07-21","name":"CVPR: Computer Vision and Pattern Recognition","location":"Honolulu, HA, United States"},"year":"2017","citation":{"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.","short":"P. Swoboda, B. Andres, in:, IEEE, 2017, pp. 4990–4999.","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.","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>","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>.","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>","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>."},"publication_identifier":{"isbn":["978-153860457-1"]},"type":"conference","file_date_updated":"2020-07-14T12:48:15Z","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."}],"scopus_import":"1","_id":"915","quality_controlled":"1","project":[{"call_identifier":"FP7","grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","has_accepted_license":"1","publisher":"IEEE","file":[{"file_size":883264,"creator":"dernst","content_type":"application/pdf","file_id":"5849","relation":"main_file","checksum":"7e51dacefa693574581a32da3eff63dc","access_level":"open_access","file_name":"Swoboda_A_Message_Passing_CVPR_2017_paper.pdf","date_created":"2019-01-18T12:52:46Z","date_updated":"2020-07-14T12:48:15Z"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"A message passing algorithm for the minimum cost multicut problem","author":[{"full_name":"Swoboda, Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","first_name":"Paul","last_name":"Swoboda"},{"last_name":"Andres","first_name":"Bjoern","full_name":"Andres, Bjoern"}],"article_processing_charge":"No","publist_id":"6526","department":[{"_id":"VlKo"}],"language":[{"iso":"eng"}]}]