[{"publication_status":"published","author":[{"first_name":"Jérôme","last_name":"Feret","full_name":"Feret, Jérôme"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Heinz","last_name":"Koeppl","full_name":"Koeppl, Heinz"},{"first_name":"Tatjana","last_name":"Petrov","orcid":"0000-0002-9041-0905","full_name":"Petrov, Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"ToHe"}],"publisher":"Elsevier","publist_id":"3515","doi":"10.1016/j.tcs.2011.12.059","quality_controlled":"1","_id":"3168","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"We would like to thank the anonymous reviewers for their comments on the different versions of the paper. We would also like to thank Ferdinanda Camporesi for her careful reading and the useful insights that she gave us about the paper.\r\nJérôme Feret’s contribution was partially supported by the AbstractCell ANR-Chair of Excellence. Heinz Koeppl’s research is supported by the Swiss National Science Foundation, grant no. 200020-117975/1. Tatjana Petrov’s research is supported by SystemsX.ch (the Swiss Initiative in Systems Biology).","intvolume":"       431","date_created":"2018-12-11T12:01:47Z","date_published":"2012-05-04T00:00:00Z","date_updated":"2023-02-23T11:39:40Z","status":"public","page":"137 - 164","title":"Lumpability abstractions of rule based systems","related_material":{"record":[{"id":"3719","relation":"earlier_version","status":"public"}]},"publication":"Theoretical Computer Science","abstract":[{"text":"The induction of a signaling pathway is characterized by transient complex formation and mutual posttranslational modification of proteins. To faithfully capture this combinatorial process in a mathematical model is an important challenge in systems biology. Exploiting the limited context on which most binding and modification events are conditioned, attempts have been made to reduce the combinatorial complexity by quotienting the reachable set of molecular species into species aggregates while preserving the deterministic semantics of the thermodynamic limit. Recently, we proposed a quotienting that also preserves the stochastic semantics and that is complete in the sense that the semantics of individual species can be recovered from the aggregate semantics. In this paper, we prove that this quotienting yields a sufficient condition for weak lumpability (that is to say that the quotient system is still Markovian for a given set of initial distributions) and that it gives rise to a backward Markov bisimulation between the original and aggregated transition system (which means that the conditional probability of being in a given state in the original system knowing that we are in its equivalence class is an invariant of the system). We illustrate the framework on a case study of the epidermal growth factor (EGF)/insulin receptor crosstalk.","lang":"eng"}],"day":"04","month":"05","type":"journal_article","pubrep_id":"73","year":"2012","volume":431,"scopus_import":1,"citation":{"short":"J. Feret, T.A. Henzinger, H. Koeppl, T. Petrov, Theoretical Computer Science 431 (2012) 137–164.","mla":"Feret, Jérôme, et al. “Lumpability Abstractions of Rule Based Systems.” <i>Theoretical Computer Science</i>, vol. 431, Elsevier, 2012, pp. 137–64, doi:<a href=\"https://doi.org/10.1016/j.tcs.2011.12.059\">10.1016/j.tcs.2011.12.059</a>.","ieee":"J. Feret, T. A. Henzinger, H. Koeppl, and T. Petrov, “Lumpability abstractions of rule based systems,” <i>Theoretical Computer Science</i>, vol. 431. Elsevier, pp. 137–164, 2012.","ama":"Feret J, Henzinger TA, Koeppl H, Petrov T. Lumpability abstractions of rule based systems. <i>Theoretical Computer Science</i>. 2012;431:137-164. doi:<a href=\"https://doi.org/10.1016/j.tcs.2011.12.059\">10.1016/j.tcs.2011.12.059</a>","apa":"Feret, J., Henzinger, T. A., Koeppl, H., &#38; Petrov, T. (2012). Lumpability abstractions of rule based systems. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2011.12.059\">https://doi.org/10.1016/j.tcs.2011.12.059</a>","chicago":"Feret, Jérôme, Thomas A Henzinger, Heinz Koeppl, and Tatjana Petrov. “Lumpability Abstractions of Rule Based Systems.” <i>Theoretical Computer Science</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.tcs.2011.12.059\">https://doi.org/10.1016/j.tcs.2011.12.059</a>.","ista":"Feret J, Henzinger TA, Koeppl H, Petrov T. 2012. Lumpability abstractions of rule based systems. Theoretical Computer Science. 431, 137–164."},"oa_version":"None","language":[{"iso":"eng"}]},{"title":"Parallel repetition of computationally sound protocols revisited","publication":"Journal of Cryptology","page":"116 - 135","day":"01","abstract":[{"text":"We prove a negative result concerning error reduction by parallel repetition for computationally sound protocols, e.g., interactive arguments. Our main result is a complete and computationally sound eight round interactive argument for which k-fold parallel repetition does not reduce the error below a constant for any polynomial k. The starting point for our construction is the work of Bellare, Impagliazzo and Naor (FOCS'97). For any fixed k, they construct a four round protocol for which k-fold parallel repetition does not lower the soundness error. The communication complexity of this protocol is linear in k. By using universal arguments due to Barak and Goldreich (CCC 2002), we turn this protocol into an eight-round protocol whose complexity is basically independent of k. ","lang":"eng"}],"date_published":"2012-11-01T00:00:00Z","issue":"1","date_created":"2018-12-11T12:02:12Z","date_updated":"2021-01-12T07:42:03Z","status":"public","citation":{"mla":"Pietrzak, Krzysztof Z., and Douglas Wikström. “Parallel Repetition of Computationally Sound Protocols Revisited.” <i>Journal of Cryptology</i>, vol. 25, no. 1, Springer, 2012, pp. 116–35, doi:<a href=\"https://doi.org/10.1007/s00145-010-9090-x\">10.1007/s00145-010-9090-x</a>.","ieee":"K. Z. Pietrzak and D. Wikström, “Parallel repetition of computationally sound protocols revisited,” <i>Journal of Cryptology</i>, vol. 25, no. 1. Springer, pp. 116–135, 2012.","short":"K.Z. Pietrzak, D. Wikström, Journal of Cryptology 25 (2012) 116–135.","apa":"Pietrzak, K. Z., &#38; Wikström, D. (2012). Parallel repetition of computationally sound protocols revisited. <i>Journal of Cryptology</i>. Springer. <a href=\"https://doi.org/10.1007/s00145-010-9090-x\">https://doi.org/10.1007/s00145-010-9090-x</a>","ama":"Pietrzak KZ, Wikström D. Parallel repetition of computationally sound protocols revisited. <i>Journal of Cryptology</i>. 2012;25(1):116-135. doi:<a href=\"https://doi.org/10.1007/s00145-010-9090-x\">10.1007/s00145-010-9090-x</a>","chicago":"Pietrzak, Krzysztof Z, and Douglas Wikström. “Parallel Repetition of Computationally Sound Protocols Revisited.” <i>Journal of Cryptology</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s00145-010-9090-x\">https://doi.org/10.1007/s00145-010-9090-x</a>.","ista":"Pietrzak KZ, Wikström D. 2012. Parallel repetition of computationally sound protocols revisited. Journal of Cryptology. 25(1), 116–135."},"type":"journal_article","month":"11","year":"2012","volume":25,"publisher":"Springer","doi":"10.1007/s00145-010-9090-x","publist_id":"3439","author":[{"full_name":"Krzysztof Pietrzak","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","last_name":"Pietrzak"},{"first_name":"Douglas","last_name":"Wikström","full_name":"Wikström, Douglas"}],"publication_status":"published","quality_controlled":0,"_id":"3241","intvolume":"        25","extern":1},{"file_date_updated":"2020-07-14T12:46:04Z","acknowledgement":"Funding for this project was obtained by the German Research Foundation DFG (http://www.dfg.de/en/index.jsp) as an Individual Research Grant (CR118/2-1 to SC) and the European Research Council (http://erc.europa.eu/) in form of two ERC Starting Grants (ERC-2009-StG240371-SocialVaccines to SC and ERC-2010-StG259294-LatentCauses to FJT). In addition, the Junge Akademie (Young Academy of the Berlin-Brandenburg Academy of Sciences and Humanities and the National Academy of Sciences Leopoldina (http://www.diejungeakademie.de/english/i​ndex.html) funded this joint Antnet project of SC and FJT. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.","quality_controlled":"1","intvolume":"        10","oa":1,"file":[{"relation":"main_file","date_created":"2018-12-12T10:08:28Z","file_name":"IST-2012-96-v1+1_journal.pbio.1001300.pdf","access_level":"open_access","file_size":674228,"date_updated":"2020-07-14T12:46:04Z","checksum":"4ebacefd9fbab5c68adf829124115fd1","file_id":"4689","content_type":"application/pdf","creator":"system"}],"has_accepted_license":"1","publist_id":"3434","month":"04","pubrep_id":"96","tmp":{"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)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"date_created":"2018-12-11T12:02:13Z","status":"public","publication":"PLoS Biology","related_material":{"record":[{"status":"public","id":"9755","relation":"research_data"}]},"day":"03","project":[{"_id":"25DAF0B2-B435-11E9-9278-68D0E5697425","grant_number":"CR-118/3-1","name":"Host-Parasite Coevolution"},{"_id":"25DC711C-B435-11E9-9278-68D0E5697425","name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","grant_number":"243071","call_identifier":"FP7"},{"name":"Antnet","_id":"25E0E184-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"3242","author":[{"first_name":"Matthias","last_name":"Konrad","full_name":"Konrad, Matthias","id":"46528076-F248-11E8-B48F-1D18A9856A87"},{"id":"418901AA-F248-11E8-B48F-1D18A9856A87","full_name":"Vyleta, Meghan","last_name":"Vyleta","first_name":"Meghan"},{"first_name":"Fabian","last_name":"Theis","full_name":"Theis, Fabian"},{"full_name":"Stock, Miriam","id":"42462816-F248-11E8-B48F-1D18A9856A87","first_name":"Miriam","last_name":"Stock"},{"full_name":"Tragust, Simon","id":"35A7A418-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","last_name":"Tragust"},{"last_name":"Klatt","first_name":"Martina","id":"E60F29C6-E9AE-11E9-AF6E-D190C7302F38","full_name":"Klatt, Martina"},{"last_name":"Drescher","first_name":"Verena","full_name":"Drescher, Verena"},{"full_name":"Marr, Carsten","first_name":"Carsten","last_name":"Marr"},{"last_name":"Ugelvig","first_name":"Line V","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1832-8883","full_name":"Ugelvig, Line V"},{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868","last_name":"Cremer","first_name":"Sylvia"}],"publication_status":"published","department":[{"_id":"SyCr"}],"ec_funded":1,"publisher":"Public Library of Science","doi":"10.1371/journal.pbio.1001300","type":"journal_article","scopus_import":1,"volume":10,"year":"2012","citation":{"ama":"Konrad M, Vyleta M, Theis F, et al. Social transfer of pathogenic fungus promotes active immunisation in ant colonies. <i>PLoS Biology</i>. 2012;10(4). doi:<a href=\"https://doi.org/10.1371/journal.pbio.1001300\">10.1371/journal.pbio.1001300</a>","apa":"Konrad, M., Vyleta, M., Theis, F., Stock, M., Tragust, S., Klatt, M., … Cremer, S. (2012). Social transfer of pathogenic fungus promotes active immunisation in ant colonies. <i>PLoS Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.1001300\">https://doi.org/10.1371/journal.pbio.1001300</a>","short":"M. Konrad, M. Vyleta, F. Theis, M. Stock, S. Tragust, M. Klatt, V. Drescher, C. Marr, L.V. Ugelvig, S. Cremer, PLoS Biology 10 (2012).","ieee":"M. Konrad <i>et al.</i>, “Social transfer of pathogenic fungus promotes active immunisation in ant colonies,” <i>PLoS Biology</i>, vol. 10, no. 4. Public Library of Science, 2012.","mla":"Konrad, Matthias, et al. “Social Transfer of Pathogenic Fungus Promotes Active Immunisation in Ant Colonies.” <i>PLoS Biology</i>, vol. 10, no. 4, e1001300, Public Library of Science, 2012, doi:<a href=\"https://doi.org/10.1371/journal.pbio.1001300\">10.1371/journal.pbio.1001300</a>.","ista":"Konrad M, Vyleta M, Theis F, Stock M, Tragust S, Klatt M, Drescher V, Marr C, Ugelvig LV, Cremer S. 2012. Social transfer of pathogenic fungus promotes active immunisation in ant colonies. PLoS Biology. 10(4), e1001300.","chicago":"Konrad, Matthias, Meghan Vyleta, Fabian Theis, Miriam Stock, Simon Tragust, Martina Klatt, Verena Drescher, Carsten Marr, Line V Ugelvig, and Sylvia Cremer. “Social Transfer of Pathogenic Fungus Promotes Active Immunisation in Ant Colonies.” <i>PLoS Biology</i>. Public Library of Science, 2012. <a href=\"https://doi.org/10.1371/journal.pbio.1001300\">https://doi.org/10.1371/journal.pbio.1001300</a>."},"oa_version":"Published Version","date_published":"2012-04-03T00:00:00Z","issue":"4","ddc":["570","579"],"date_updated":"2023-02-23T14:07:11Z","title":"Social transfer of pathogenic fungus promotes active immunisation in ant colonies","article_number":"e1001300","abstract":[{"lang":"eng","text":"Due to the omnipresent risk of epidemics, insect societies have evolved sophisticated disease defences at the individual and colony level. An intriguing yet little understood phenomenon is that social contact to pathogen-exposed individuals reduces susceptibility of previously naive nestmates to this pathogen. We tested whether such social immunisation in Lasius ants against the entomopathogenic fungus Metarhizium anisopliae is based on active upregulation of the immune system of nestmates following contact to an infectious individual or passive protection via transfer of immune effectors among group members—that is, active versus passive immunisation. We found no evidence for involvement of passive immunisation via transfer of antimicrobials among colony members. Instead, intensive allogrooming behaviour between naive and pathogen-exposed ants before fungal conidia firmly attached to their cuticle suggested passage of the pathogen from the exposed individuals to their nestmates. By tracing fluorescence-labelled conidia we indeed detected frequent pathogen transfer to the nestmates, where they caused low-level infections as revealed by growth of small numbers of fungal colony forming units from their dissected body content. These infections rarely led to death, but instead promoted an enhanced ability to inhibit fungal growth and an active upregulation of immune genes involved in antifungal defences (defensin and prophenoloxidase, PPO). Contrarily, there was no upregulation of the gene cathepsin L, which is associated with antibacterial and antiviral defences, and we found no increased antibacterial activity of nestmates of fungus-exposed ants. This indicates that social immunisation after fungal exposure is specific, similar to recent findings for individual-level immune priming in invertebrates. Epidemiological modeling further suggests that active social immunisation is adaptive, as it leads to faster elimination of the disease and lower death rates than passive immunisation. Interestingly, humans have also utilised the protective effect of low-level infections to fight smallpox by intentional transfer of low pathogen doses (“variolation” or “inoculation”)."}]},{"oa":1,"publist_id":"3433","article_processing_charge":"No","intvolume":"      2012","date_created":"2018-12-11T12:02:13Z","status":"public","page":"11","publication":"Büchereiperspektiven","day":"01","month":"03","article_type":"letter_note","language":[{"iso":"ger"}],"publication_status":"published","author":[{"orcid":"0000-0002-6026-4409","full_name":"Danowski, Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","first_name":"Patrick","last_name":"Danowski"}],"department":[{"_id":"E-Lib"}],"publisher":"Büchereiverband Österreichs","_id":"3243","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"1","main_file_link":[{"open_access":"1","url":"https://www.bvoe.at/sites/default/files/2022-07/BP_1_12.pdf"}],"date_published":"2012-03-01T00:00:00Z","popular_science":"1","date_updated":"2023-10-16T10:40:18Z","title":"Zwischen Technologie und Information","abstract":[{"lang":"eng","text":"Wie wandelt sich das Berufsbild in Wissenschaftlichen Bibliotheken? Patrick Danowski gibt seine Einschätzung ab. "}],"publication_identifier":{"issn":["1607-7172"]},"type":"journal_article","year":"2012","volume":2012,"oa_version":"Published Version","citation":{"ista":"Danowski P. 2012. Zwischen Technologie und Information. Büchereiperspektiven. 2012(1), 11.","chicago":"Danowski, Patrick. “Zwischen Technologie und Information.” <i>Büchereiperspektiven</i>. Büchereiverband Österreichs, 2012.","ama":"Danowski P. Zwischen Technologie und Information. <i>Büchereiperspektiven</i>. 2012;2012(1):11.","apa":"Danowski, P. (2012). Zwischen Technologie und Information. <i>Büchereiperspektiven</i>. Büchereiverband Österreichs.","mla":"Danowski, Patrick. “Zwischen Technologie und Information.” <i>Büchereiperspektiven</i>, vol. 2012, no. 1, Büchereiverband Österreichs, 2012, p. 11.","ieee":"P. Danowski, “Zwischen Technologie und Information,” <i>Büchereiperspektiven</i>, vol. 2012, no. 1. Büchereiverband Österreichs, p. 11, 2012.","short":"P. Danowski, Büchereiperspektiven 2012 (2012) 11."}},{"intvolume":"        64","article_processing_charge":"No","publist_id":"3432","oa":1,"language":[{"iso":"ger"}],"month":"04","article_type":"letter_note","day":"15","publication":"BuB - Forum Bibliothek und Information","page":"284","status":"public","date_created":"2018-12-11T12:02:13Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"3244","publisher":"Fachzeitschrift des BIB – Berufsverband Information Bibliothek","department":[{"_id":"E-Lib"}],"author":[{"orcid":"0000-0002-6026-4409","full_name":"Danowski, Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","first_name":"Patrick","last_name":"Danowski"}],"publication_status":"published","oa_version":"Published Version","citation":{"ama":"Danowski P. Die Zeit des Abwartens ist vorbei! <i>BuB - Forum Bibliothek und Information</i>. 2012;64(4):284.","apa":"Danowski, P. (2012). Die Zeit des Abwartens ist vorbei! <i>BuB - Forum Bibliothek und Information</i>. Fachzeitschrift des BIB – Berufsverband Information Bibliothek.","short":"P. Danowski, BuB - Forum Bibliothek und Information 64 (2012) 284.","mla":"Danowski, Patrick. “Die Zeit des Abwartens ist vorbei!” <i>BuB - Forum Bibliothek und Information</i>, vol. 64, no. 4, Fachzeitschrift des BIB – Berufsverband Information Bibliothek, 2012, p. 284.","ieee":"P. Danowski, “Die Zeit des Abwartens ist vorbei!,” <i>BuB - Forum Bibliothek und Information</i>, vol. 64, no. 4. Fachzeitschrift des BIB – Berufsverband Information Bibliothek, p. 284, 2012.","ista":"Danowski P. 2012. Die Zeit des Abwartens ist vorbei! BuB - Forum Bibliothek und Information. 64(4), 284.","chicago":"Danowski, Patrick. “Die Zeit des Abwartens ist vorbei!” <i>BuB - Forum Bibliothek und Information</i>. Fachzeitschrift des BIB – Berufsverband Information Bibliothek, 2012."},"volume":64,"year":"2012","type":"journal_article","publication_identifier":{"issn":["1869 -1137"]},"abstract":[{"lang":"eng","text":"Bibliothekare haben die Aufgabe, sich mit neuen Medienformen auseinanderzusetzen.\r\n"}],"title":"Die Zeit des Abwartens ist vorbei!","date_updated":"2023-10-16T10:19:14Z","date_published":"2012-04-15T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://www.b-u-b.de/fileadmin/archiv/imports/pdf_files/2012/bub_2012_04_284.pdf"}],"popular_science":"1","issue":"4"},{"scopus_import":1,"volume":22,"year":"2012","type":"journal_article","month":"01","language":[{"iso":"eng"}],"oa_version":"None","citation":{"ista":"Behrndt M, Heisenberg C-PJ. 2012. Spurred by resistance mechanosensation in collective migration. Developmental Cell. 22(1), 3–4.","chicago":"Behrndt, Martin, and Carl-Philipp J Heisenberg. “Spurred by Resistance Mechanosensation in Collective Migration.” <i>Developmental Cell</i>. Cell Press, 2012. <a href=\"https://doi.org/10.1016/j.devcel.2011.12.018\">https://doi.org/10.1016/j.devcel.2011.12.018</a>.","apa":"Behrndt, M., &#38; Heisenberg, C.-P. J. (2012). Spurred by resistance mechanosensation in collective migration. <i>Developmental Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.devcel.2011.12.018\">https://doi.org/10.1016/j.devcel.2011.12.018</a>","ama":"Behrndt M, Heisenberg C-PJ. Spurred by resistance mechanosensation in collective migration. <i>Developmental Cell</i>. 2012;22(1):3-4. doi:<a href=\"https://doi.org/10.1016/j.devcel.2011.12.018\">10.1016/j.devcel.2011.12.018</a>","short":"M. Behrndt, C.-P.J. Heisenberg, Developmental Cell 22 (2012) 3–4.","mla":"Behrndt, Martin, and Carl-Philipp J. Heisenberg. “Spurred by Resistance Mechanosensation in Collective Migration.” <i>Developmental Cell</i>, vol. 22, no. 1, Cell Press, 2012, pp. 3–4, doi:<a href=\"https://doi.org/10.1016/j.devcel.2011.12.018\">10.1016/j.devcel.2011.12.018</a>.","ieee":"M. Behrndt and C.-P. J. Heisenberg, “Spurred by resistance mechanosensation in collective migration,” <i>Developmental Cell</i>, vol. 22, no. 1. Cell Press, pp. 3–4, 2012."},"date_updated":"2021-01-12T07:42:05Z","status":"public","date_published":"2012-01-17T00:00:00Z","issue":"1","date_created":"2018-12-11T12:02:14Z","day":"17","abstract":[{"lang":"eng","text":"How cells orchestrate their behavior during collective migration is a long-standing question. Using magnetic tweezers to apply mechanical stimuli to Xenopus mesendoderm cells, Weber etal. (2012) now reveal, in this issue of Developmental Cell, a cadherin-mediated mechanosensitive response that promotes cell polarization and movement persistence during the collective mesendoderm migration in gastrulation."}],"publication":"Developmental Cell","title":"Spurred by resistance mechanosensation in collective migration","page":"3 - 4","intvolume":"        22","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3245","quality_controlled":"1","department":[{"_id":"CaHe"}],"publication_status":"published","author":[{"first_name":"Martin","last_name":"Behrndt","full_name":"Behrndt, Martin","id":"3ECECA3A-F248-11E8-B48F-1D18A9856A87"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566","last_name":"Heisenberg","first_name":"Carl-Philipp J"}],"doi":"10.1016/j.devcel.2011.12.018","publist_id":"3426","publisher":"Cell Press"},{"intvolume":"        24","acknowledgement":"This review comes from a themed issue on Cell structure and dynamics Edited by Jason Swedlow and Gaudenz Danuser","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"3246","quality_controlled":"1","doi":"10.1016/j.ceb.2011.11.006","publist_id":"3423","publisher":"Elsevier","department":[{"_id":"CaHe"}],"publication_status":"published","author":[{"last_name":"Barone","first_name":"Vanessa","id":"419EECCC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2676-3367","full_name":"Barone, Vanessa"},{"orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","last_name":"Heisenberg"}],"language":[{"iso":"eng"}],"citation":{"ista":"Barone V, Heisenberg C-PJ. 2012. Cell adhesion in embryo morphogenesis. Current Opinion in Cell Biology. 24(1), 148–153.","chicago":"Barone, Vanessa, and Carl-Philipp J Heisenberg. “Cell Adhesion in Embryo Morphogenesis.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.ceb.2011.11.006\">https://doi.org/10.1016/j.ceb.2011.11.006</a>.","apa":"Barone, V., &#38; Heisenberg, C.-P. J. (2012). Cell adhesion in embryo morphogenesis. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2011.11.006\">https://doi.org/10.1016/j.ceb.2011.11.006</a>","ama":"Barone V, Heisenberg C-PJ. Cell adhesion in embryo morphogenesis. <i>Current Opinion in Cell Biology</i>. 2012;24(1):148-153. doi:<a href=\"https://doi.org/10.1016/j.ceb.2011.11.006\">10.1016/j.ceb.2011.11.006</a>","ieee":"V. Barone and C.-P. J. Heisenberg, “Cell adhesion in embryo morphogenesis,” <i>Current Opinion in Cell Biology</i>, vol. 24, no. 1. Elsevier, pp. 148–153, 2012.","mla":"Barone, Vanessa, and Carl-Philipp J. Heisenberg. “Cell Adhesion in Embryo Morphogenesis.” <i>Current Opinion in Cell Biology</i>, vol. 24, no. 1, Elsevier, 2012, pp. 148–53, doi:<a href=\"https://doi.org/10.1016/j.ceb.2011.11.006\">10.1016/j.ceb.2011.11.006</a>.","short":"V. Barone, C.-P.J. Heisenberg, Current Opinion in Cell Biology 24 (2012) 148–153."},"oa_version":"None","scopus_import":1,"volume":24,"year":"2012","type":"journal_article","month":"02","day":"01","abstract":[{"lang":"eng","text":"Visualizing and analyzing shape changes at various scales, ranging from single molecules to whole organisms, are essential for understanding complex morphogenetic processes, such as early embryonic development. Embryo morphogenesis relies on the interplay between different tissues, the properties of which are again determined by the interaction between their constituent cells. Cell interactions, on the other hand, are controlled by various molecules, such as signaling and adhesion molecules, which in order to exert their functions need to be spatiotemporally organized within and between the interacting cells. In this review, we will focus on the role of cell adhesion functioning at different scales to organize cell, tissue and embryo morphogenesis. We will specifically ask how the subcellular distribution of adhesion molecules controls the formation of cell-cell contacts, how cell-cell contacts determine tissue shape, and how tissue interactions regulate embryo morphogenesis."}],"publication":"Current Opinion in Cell Biology","title":"Cell adhesion in embryo morphogenesis","related_material":{"record":[{"status":"public","id":"961","relation":"dissertation_contains"}]},"page":"148 - 153","status":"public","date_updated":"2023-09-07T12:05:08Z","date_published":"2012-02-01T00:00:00Z","issue":"1","date_created":"2018-12-11T12:02:14Z"},{"author":[{"last_name":"Vilaça","first_name":"Sibelle","full_name":"Vilaça, Sibelle"},{"last_name":"Fernandes Redondo","first_name":"Rodrigo A","id":"409D5C96-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5837-2793","full_name":"Fernandes Redondo, Rodrigo A"},{"first_name":"Lívia","last_name":"Lins","full_name":"Lins, Lívia"},{"full_name":"Santos, Fabrício","last_name":"Santos","first_name":"Fabrício"}],"publication_status":"published","department":[{"_id":"JoBo"}],"publisher":"Springer","doi":"10.1007/s10592-011-0262-5","publist_id":"3420","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The present study received grants from FAPEMIG, CNPq, Petrobras Ambiental and Fundação O Boticário de Conservação da Natureza, and followed all ethical guidelines and legal requirements of Brazil for sampling and studying an endangered species.\r\nWe thank the Specialist Work Group for the Conservation of Brazilian Merganser for valuable discussions and opinions on this manuscript. We also thank all the staff from Instituto Terra Brasilis and Funatura (Vivian S. Braz and Gislaine Disconzi) for collecting the samples at Serra da Canastra and Chapada dos Veadeiros, respectively; Dario A. Lijtmaerand and Pablo Tubaro for providing the samples from Argentina, Bradley C. Livezey for sending copies of his papers, and Geoff M. Hilton and Paulo de Tarso Z. Antas for useful suggestions that greatly improved this manuscript.","_id":"3247","quality_controlled":"1","intvolume":"        13","date_published":"2012-02-01T00:00:00Z","issue":"1","date_created":"2018-12-11T12:02:15Z","status":"public","date_updated":"2021-01-12T07:42:05Z","title":"Remaining genetic diversity in Brazilian Merganser (Mergus octosetaceus)","publication":"Conservation Genetics","page":"293 - 298","day":"01","abstract":[{"text":"The Brazilian Merganser is a very rare and threatened species that nowadays inhabits only a few protected areas and their surroundings in the Brazilian territory. In order to estimate the remaining genetic diversity and population structure in this species, two mitochondrial genes were sequenced in 39 individuals belonging to two populations and in one individual collected in Argentina in 1950. We found a highly significant divergence between two major remaining populations of Mergus octosetaceus, which suggests a historical population structure in this species. Furthermore, two deeply divergent lineages were found in a single location, which could due to current or historical secondary contact. Based on the available genetic data, we point out future directions which would contribute to design strategies for conservation and management of this threatened species.","lang":"eng"}],"type":"journal_article","month":"02","scopus_import":1,"year":"2012","volume":13,"citation":{"mla":"Vilaça, Sibelle, et al. “Remaining Genetic Diversity in Brazilian Merganser (Mergus Octosetaceus).” <i>Conservation Genetics</i>, vol. 13, no. 1, Springer, 2012, pp. 293–98, doi:<a href=\"https://doi.org/10.1007/s10592-011-0262-5\">10.1007/s10592-011-0262-5</a>.","ieee":"S. Vilaça, R. A. Fernandes Redondo, L. Lins, and F. Santos, “Remaining genetic diversity in Brazilian Merganser (Mergus octosetaceus),” <i>Conservation Genetics</i>, vol. 13, no. 1. Springer, pp. 293–298, 2012.","short":"S. Vilaça, R.A. Fernandes Redondo, L. Lins, F. Santos, Conservation Genetics 13 (2012) 293–298.","apa":"Vilaça, S., Fernandes Redondo, R. A., Lins, L., &#38; Santos, F. (2012). Remaining genetic diversity in Brazilian Merganser (Mergus octosetaceus). <i>Conservation Genetics</i>. Springer. <a href=\"https://doi.org/10.1007/s10592-011-0262-5\">https://doi.org/10.1007/s10592-011-0262-5</a>","ama":"Vilaça S, Fernandes Redondo RA, Lins L, Santos F. Remaining genetic diversity in Brazilian Merganser (Mergus octosetaceus). <i>Conservation Genetics</i>. 2012;13(1):293-298. doi:<a href=\"https://doi.org/10.1007/s10592-011-0262-5\">10.1007/s10592-011-0262-5</a>","chicago":"Vilaça, Sibelle, Rodrigo A Fernandes Redondo, Lívia Lins, and Fabrício Santos. “Remaining Genetic Diversity in Brazilian Merganser (Mergus Octosetaceus).” <i>Conservation Genetics</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s10592-011-0262-5\">https://doi.org/10.1007/s10592-011-0262-5</a>.","ista":"Vilaça S, Fernandes Redondo RA, Lins L, Santos F. 2012. Remaining genetic diversity in Brazilian Merganser (Mergus octosetaceus). Conservation Genetics. 13(1), 293–298."},"oa_version":"None","language":[{"iso":"eng"}]},{"volume":7,"year":"2012","scopus_import":"1","publication_identifier":{"eissn":["1861-8219"],"issn":["1861-8200"]},"type":"journal_article","citation":{"apa":"Lampert, C., &#38; Peters, J. (2012). Real-time detection of colored objects in multiple camera streams with off-the-shelf hardware components. <i>Journal of Real-Time Image Processing</i>. Springer. <a href=\"https://doi.org/10.1007/s11554-010-0168-3\">https://doi.org/10.1007/s11554-010-0168-3</a>","ama":"Lampert C, Peters J. Real-time detection of colored objects in multiple camera streams with off-the-shelf hardware components. <i>Journal of Real-Time Image Processing</i>. 2012;7(1):31-41. doi:<a href=\"https://doi.org/10.1007/s11554-010-0168-3\">10.1007/s11554-010-0168-3</a>","short":"C. Lampert, J. Peters, Journal of Real-Time Image Processing 7 (2012) 31–41.","ieee":"C. Lampert and J. Peters, “Real-time detection of colored objects in multiple camera streams with off-the-shelf hardware components,” <i>Journal of Real-Time Image Processing</i>, vol. 7, no. 1. Springer, pp. 31–41, 2012.","mla":"Lampert, Christoph, and Jan Peters. “Real-Time Detection of Colored Objects in Multiple Camera Streams with off-the-Shelf Hardware Components.” <i>Journal of Real-Time Image Processing</i>, vol. 7, no. 1, Springer, 2012, pp. 31–41, doi:<a href=\"https://doi.org/10.1007/s11554-010-0168-3\">10.1007/s11554-010-0168-3</a>.","ista":"Lampert C, Peters J. 2012. Real-time detection of colored objects in multiple camera streams with off-the-shelf hardware components. Journal of Real-Time Image Processing. 7(1), 31–41.","chicago":"Lampert, Christoph, and Jan Peters. “Real-Time Detection of Colored Objects in Multiple Camera Streams with off-the-Shelf Hardware Components.” <i>Journal of Real-Time Image Processing</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s11554-010-0168-3\">https://doi.org/10.1007/s11554-010-0168-3</a>."},"oa_version":"Submitted Version","date_updated":"2022-05-24T08:05:40Z","ddc":["000"],"issue":"1","date_published":"2012-03-01T00:00:00Z","abstract":[{"lang":"eng","text":"We describe RTblob, a high speed vision system that detects objects in cluttered scenes based on their color and shape at a speed of over 800 frames/s. Because the system is available as open-source software and relies only on off-the-shelf PC hardware components, it can provide the basis for multiple application scenarios. As an illustrative example, we show how RTblob can be used in a robotic table tennis scenario to estimate ball trajectories through 3D space simultaneously from four cameras images at a speed of 200 Hz."}],"title":"Real-time detection of colored objects in multiple camera streams with off-the-shelf hardware components","_id":"3248","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ChLa"}],"author":[{"orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert"},{"full_name":"Peters, Jan","first_name":"Jan","last_name":"Peters"}],"publication_status":"published","doi":"10.1007/s11554-010-0168-3","publisher":"Springer","article_type":"original","month":"03","language":[{"iso":"eng"}],"status":"public","date_created":"2018-12-11T12:02:15Z","day":"01","page":"31 - 41","publication":"Journal of Real-Time Image Processing","intvolume":"         7","article_processing_charge":"No","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:04Z","oa":1,"publist_id":"3417","has_accepted_license":"1","file":[{"relation":"main_file","creator":"kschuh","content_type":"application/pdf","file_id":"5958","date_updated":"2020-07-14T12:46:04Z","checksum":"241be47ea50e81a283bcf4c45b07e8cc","file_size":2933187,"date_created":"2019-02-12T10:52:25Z","file_name":"2012_Springer_Lampert.pdf","access_level":"open_access"}]},{"type":"journal_article","scopus_import":1,"volume":413,"year":"2012","oa_version":"None","citation":{"apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2012). Simulation distances. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2011.08.002\">https://doi.org/10.1016/j.tcs.2011.08.002</a>","ama":"Cerny P, Henzinger TA, Radhakrishna A. Simulation distances. <i>Theoretical Computer Science</i>. 2012;413(1):21-35. doi:<a href=\"https://doi.org/10.1016/j.tcs.2011.08.002\">10.1016/j.tcs.2011.08.002</a>","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” <i>Theoretical Computer Science</i>, vol. 413, no. 1. Elsevier, pp. 21–35, 2012.","mla":"Cerny, Pavol, et al. “Simulation Distances.” <i>Theoretical Computer Science</i>, vol. 413, no. 1, Elsevier, 2012, pp. 21–35, doi:<a href=\"https://doi.org/10.1016/j.tcs.2011.08.002\">10.1016/j.tcs.2011.08.002</a>.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 413 (2012) 21–35.","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2012. Simulation distances. Theoretical Computer Science. 413(1), 21–35.","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Simulation Distances.” <i>Theoretical Computer Science</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.tcs.2011.08.002\">https://doi.org/10.1016/j.tcs.2011.08.002</a>."},"date_published":"2012-01-06T00:00:00Z","issue":"1","date_updated":"2023-02-23T12:24:04Z","title":"Simulation distances","abstract":[{"text":"Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of &quot;fit&quot; or &quot;desirability&quot;. We extend the simulation preorder to the quantitative setting by making each player of a simulation game pay a certain price for her choices. We use the resulting games with quantitative objectives to define three different simulation distances. The correctness distance measures how much the specification must be changed in order to be satisfied by the implementation. The coverage distance measures how much the implementation restricts the degrees of freedom offered by the specification. The robustness distance measures how much a system can deviate from the implementation description without violating the specification. We consider these distances for safety as well as liveness specifications. The distances can be computed in polynomial time for safety specifications, and for liveness specifications given by weak fairness constraints. We show that the distance functions satisfy the triangle inequality, that the distance between two systems does not increase under parallel composition with a third system, and that the distance between two systems can be bounded from above and below by distances between abstractions of the two systems. These properties suggest that our simulation distances provide an appropriate basis for a quantitative theory of discrete systems. We also demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes.","lang":"eng"}],"project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FP7","name":"Design for Embedded Systems","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3249","publication_status":"published","author":[{"first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun"}],"department":[{"_id":"ToHe"}],"ec_funded":1,"publisher":"Elsevier","doi":"10.1016/j.tcs.2011.08.002","month":"01","pubrep_id":"42","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:02:15Z","status":"public","publication":"Theoretical Computer Science","related_material":{"record":[{"status":"public","id":"4393","relation":"earlier_version"},{"relation":"earlier_version","id":"5389","status":"public"}]},"page":"21 - 35","day":"06","acknowledgement":"This work was partially supported by the ERC Advanced Grant QUAREM, the FWF NFN Grant S11402-N23 (RiSE), the European Union project COMBEST and the European Network of Excellence Artist Design.","quality_controlled":"1","intvolume":"       413","publist_id":"3408"},{"publication_status":"published","author":[{"first_name":"Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"KrPi"}],"alternative_title":["LNCS"],"publisher":"Springer","doi":"10.1007/978-3-642-27660-6_9","publist_id":"3407","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3250","quality_controlled":"1","intvolume":"      7147","date_published":"2012-02-19T00:00:00Z","date_created":"2018-12-11T12:02:15Z","date_updated":"2021-01-12T07:42:07Z","status":"public","conference":{"start_date":"2012-01-21","location":"Špindlerův Mlýn, Czech Republic","name":"SOFSEM: Current Trends in Theory and Practice of Computer Science","end_date":"2012-01-27"},"title":"Cryptography from learning parity with noise","page":"99 - 114","day":"19","abstract":[{"lang":"eng","text":"The Learning Parity with Noise (LPN) problem has recently found many applications in cryptography as the hardness assumption underlying the constructions of &quot;provably secure&quot; cryptographic schemes like encryption or authentication protocols. Being provably secure means that the scheme comes with a proof showing that the existence of an efficient adversary against the scheme implies that the underlying hardness assumption is wrong. LPN based schemes are appealing for theoretical and practical reasons. On the theoretical side, LPN based schemes offer a very strong security guarantee. The LPN problem is equivalent to the problem of decoding random linear codes, a problem that has been extensively studied in the last half century. The fastest known algorithms run in exponential time and unlike most number-theoretic problems used in cryptography, the LPN problem does not succumb to known quantum algorithms. On the practical side, LPN based schemes are often extremely simple and efficient in terms of code-size as well as time and space requirements. This makes them prime candidates for light-weight devices like RFID tags, which are too weak to implement standard cryptographic primitives like the AES block-cipher. This talk will be a gentle introduction to provable security using simple LPN based schemes as examples. Starting from pseudorandom generators and symmetric key encryption, over secret-key authentication protocols, and, if time admits, touching on recent constructions of public-key identification, commitments and zero-knowledge proofs."}],"type":"conference","month":"02","scopus_import":1,"year":"2012","volume":7147,"citation":{"ista":"Pietrzak KZ. 2012. Cryptography from learning parity with noise. SOFSEM: Current Trends in Theory and Practice of Computer Science, LNCS, vol. 7147, 99–114.","chicago":"Pietrzak, Krzysztof Z. “Cryptography from Learning Parity with Noise,” 7147:99–114. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-27660-6_9\">https://doi.org/10.1007/978-3-642-27660-6_9</a>.","ama":"Pietrzak KZ. Cryptography from learning parity with noise. In: Vol 7147. Springer; 2012:99-114. doi:<a href=\"https://doi.org/10.1007/978-3-642-27660-6_9\">10.1007/978-3-642-27660-6_9</a>","apa":"Pietrzak, K. Z. (2012). Cryptography from learning parity with noise (Vol. 7147, pp. 99–114). Presented at the SOFSEM: Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic: Springer. <a href=\"https://doi.org/10.1007/978-3-642-27660-6_9\">https://doi.org/10.1007/978-3-642-27660-6_9</a>","short":"K.Z. Pietrzak, in:, Springer, 2012, pp. 99–114.","mla":"Pietrzak, Krzysztof Z. <i>Cryptography from Learning Parity with Noise</i>. Vol. 7147, Springer, 2012, pp. 99–114, doi:<a href=\"https://doi.org/10.1007/978-3-642-27660-6_9\">10.1007/978-3-642-27660-6_9</a>.","ieee":"K. Z. Pietrzak, “Cryptography from learning parity with noise,” presented at the SOFSEM: Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, 2012, vol. 7147, pp. 99–114."},"oa_version":"None","language":[{"iso":"eng"}]},{"pubrep_id":"100","month":"01","language":[{"iso":"eng"}],"status":"public","date_created":"2018-12-11T12:02:16Z","day":"01","related_material":{"record":[{"id":"1405","relation":"dissertation_contains","status":"public"}]},"conference":{"name":"VMCAI: Verification, Model Checking and Abstract Interpretation","end_date":"2012-01-24","location":"Philadelphia, PA, USA","start_date":"2012-01-22"},"page":"445 - 460","intvolume":"      7148","acknowledgement":"This research was supported in part by the European Research Council (ERC) Advanced Investigator Grant QUAREM and by the Austrian Science Fund (FWF) project S11402-N23.","file_date_updated":"2020-07-14T12:46:05Z","quality_controlled":"1","oa":1,"has_accepted_license":"1","publist_id":"3406","file":[{"relation":"main_file","creator":"system","content_type":"application/pdf","file_id":"4759","checksum":"f2f0d55efa32309ad1fe65a5fcaad90c","date_updated":"2020-07-14T12:46:05Z","file_size":217104,"access_level":"open_access","file_name":"IST-2012-100-v1+1_Ideal_abstractions_for_well-structured_transition_systems.pdf","date_created":"2018-12-12T10:09:35Z"}],"volume":7148,"year":"2012","type":"conference","citation":{"chicago":"Zufferey, Damien, Thomas Wies, and Thomas A Henzinger. “Ideal Abstractions for Well Structured Transition Systems,” 7148:445–60. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-27940-9_29\">https://doi.org/10.1007/978-3-642-27940-9_29</a>.","ista":"Zufferey D, Wies T, Henzinger TA. 2012. Ideal abstractions for well structured transition systems. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 445–460.","mla":"Zufferey, Damien, et al. <i>Ideal Abstractions for Well Structured Transition Systems</i>. Vol. 7148, Springer, 2012, pp. 445–60, doi:<a href=\"https://doi.org/10.1007/978-3-642-27940-9_29\">10.1007/978-3-642-27940-9_29</a>.","ieee":"D. Zufferey, T. Wies, and T. A. Henzinger, “Ideal abstractions for well structured transition systems,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 445–460.","short":"D. Zufferey, T. Wies, T.A. Henzinger, in:, Springer, 2012, pp. 445–460.","ama":"Zufferey D, Wies T, Henzinger TA. Ideal abstractions for well structured transition systems. In: Vol 7148. Springer; 2012:445-460. doi:<a href=\"https://doi.org/10.1007/978-3-642-27940-9_29\">10.1007/978-3-642-27940-9_29</a>","apa":"Zufferey, D., Wies, T., &#38; Henzinger, T. A. (2012). Ideal abstractions for well structured transition systems (Vol. 7148, pp. 445–460). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-27940-9_29\">https://doi.org/10.1007/978-3-642-27940-9_29</a>"},"oa_version":"Submitted Version","date_updated":"2023-09-07T11:36:36Z","date_published":"2012-01-01T00:00:00Z","ddc":["000","005"],"abstract":[{"lang":"eng","text":"Many infinite state systems can be seen as well-structured transition systems (WSTS), i.e., systems equipped with a well-quasi-ordering on states that is also a simulation relation. WSTS are an attractive target for formal analysis because there exist generic algorithms that decide interesting verification problems for this class. Among the most popular algorithms are acceleration-based forward analyses for computing the covering set. Termination of these algorithms can only be guaranteed for flattable WSTS. Yet, many WSTS of practical interest are not flattable and the question whether any given WSTS is flattable is itself undecidable. We therefore propose an analysis that computes the covering set and captures the essence of acceleration-based algorithms, but sacrifices precision for guaranteed termination. Our analysis is an abstract interpretation whose abstract domain builds on the ideal completion of the well-quasi-ordered state space, and a widening operator that mimics acceleration and controls the loss of precision of the analysis. We present instances of our framework for various classes of WSTS. Our experience with a prototype implementation indicates that, despite the inherent precision loss, our analysis often computes the precise covering set of the analyzed system."}],"title":"Ideal abstractions for well structured transition systems","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3251","department":[{"_id":"ToHe"}],"publication_status":"published","author":[{"last_name":"Zufferey","first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien"},{"full_name":"Wies, Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Wies"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"}],"doi":"10.1007/978-3-642-27940-9_29","ec_funded":1,"alternative_title":["LNCS"],"publisher":"Springer"},{"date_published":"2012-01-20T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1004.2697"}],"date_updated":"2021-01-12T07:42:08Z","title":"Synthesizing protocols for digital contract signing","abstract":[{"lang":"eng","text":"We study the automatic synthesis of fair non-repudiation protocols, a class of fair exchange protocols, used for digital contract signing. First, we show how to specify the objectives of the participating agents, the trusted third party (TTP) and the protocols as path formulas in Linear Temporal Logic (LTL) and prove that the satisfaction of the objectives of the agents and the TTP imply satisfaction of the protocol objectives. We then show that weak (co-operative) co-synthesis and classical (strictly competitive) co-synthesis fail in synthesizing these protocols, whereas assume-guarantee synthesis (AGS) succeeds. We demonstrate the success of assume-guarantee synthesis as follows: (a) any solution of assume-guarantee synthesis is attack-free; no subset of participants can violate the objectives of the other participants without violating their own objectives; (b) the Asokan-Shoup-Waidner (ASW) certified mail protocol that has known vulnerabilities is not a solution of AGS; and (c) the Kremer-Markowitch (KM) non-repudiation protocol is a solution of AGS. To our knowledge this is the first application of synthesis to fair non-repudiation protocols, and our results show how synthesis can generate correct protocols and automatically discover vulnerabilities. The solution to assume-guarantee synthesis can be computed efficiently as the secure equilibrium solution of three-player graph games. © 2012 Springer-Verlag."}],"type":"conference","scopus_import":1,"volume":7148,"year":"2012","citation":{"ista":"Chatterjee K, Raman V. 2012. Synthesizing protocols for digital contract signing. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 152–168.","chicago":"Chatterjee, Krishnendu, and Vishwanath Raman. “Synthesizing Protocols for Digital Contract Signing,” 7148:152–68. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-27940-9_11\">https://doi.org/10.1007/978-3-642-27940-9_11</a>.","ama":"Chatterjee K, Raman V. Synthesizing protocols for digital contract signing. In: Vol 7148. Springer; 2012:152-168. doi:<a href=\"https://doi.org/10.1007/978-3-642-27940-9_11\">10.1007/978-3-642-27940-9_11</a>","apa":"Chatterjee, K., &#38; Raman, V. (2012). Synthesizing protocols for digital contract signing (Vol. 7148, pp. 152–168). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-27940-9_11\">https://doi.org/10.1007/978-3-642-27940-9_11</a>","short":"K. Chatterjee, V. Raman, in:, Springer, 2012, pp. 152–168.","ieee":"K. Chatterjee and V. Raman, “Synthesizing protocols for digital contract signing,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 152–168.","mla":"Chatterjee, Krishnendu, and Vishwanath Raman. <i>Synthesizing Protocols for Digital Contract Signing</i>. Vol. 7148, Springer, 2012, pp. 152–68, doi:<a href=\"https://doi.org/10.1007/978-3-642-27940-9_11\">10.1007/978-3-642-27940-9_11</a>."},"oa_version":"Preprint","publication_status":"published","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Vishwanath","last_name":"Raman","full_name":"Raman, Vishwanath"}],"department":[{"_id":"KrCh"}],"alternative_title":["LNCS"],"ec_funded":1,"publisher":"Springer","doi":"10.1007/978-3-642-27940-9_11","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3252","date_created":"2018-12-11T12:02:16Z","status":"public","conference":{"location":"Philadelphia, PA, USA","start_date":"2012-01-22","name":"VMCAI: Verification, Model Checking and Abstract Interpretation","end_date":"2012-01-24"},"page":"152 - 168","day":"20","month":"01","language":[{"iso":"eng"}],"oa":1,"publist_id":"3405","acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No P 23499-N23 (Modern Graph Algorithmic Techniques in Formal Verification), FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.\r\nThe authors would like to thank Avik Chaudhuri for his invaluable help and feedback.","quality_controlled":"1","intvolume":"      7148"},{"language":[{"iso":"eng"}],"citation":{"ieee":"A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, “Abstract domains for automated reasoning about list manipulating programs with infinite data,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 1–22.","mla":"Bouajjani, Ahmed, et al. <i>Abstract Domains for Automated Reasoning about List Manipulating Programs with Infinite Data</i>. Vol. 7148, Springer, 2012, pp. 1–22, doi:<a href=\"https://doi.org/10.1007/978-3-642-27940-9_1\">10.1007/978-3-642-27940-9_1</a>.","short":"A. Bouajjani, C. Dragoi, C. Enea, M. Sighireanu, in:, Springer, 2012, pp. 1–22.","apa":"Bouajjani, A., Dragoi, C., Enea, C., &#38; Sighireanu, M. (2012). Abstract domains for automated reasoning about list manipulating programs with infinite data (Vol. 7148, pp. 1–22). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-27940-9_1\">https://doi.org/10.1007/978-3-642-27940-9_1</a>","ama":"Bouajjani A, Dragoi C, Enea C, Sighireanu M. Abstract domains for automated reasoning about list manipulating programs with infinite data. In: Vol 7148. Springer; 2012:1-22. doi:<a href=\"https://doi.org/10.1007/978-3-642-27940-9_1\">10.1007/978-3-642-27940-9_1</a>","chicago":"Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu. “Abstract Domains for Automated Reasoning about List Manipulating Programs with Infinite Data,” 7148:1–22. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-27940-9_1\">https://doi.org/10.1007/978-3-642-27940-9_1</a>.","ista":"Bouajjani A, Dragoi C, Enea C, Sighireanu M. 2012. Abstract domains for automated reasoning about list manipulating programs with infinite data. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 1–22."},"oa_version":"None","year":"2012","volume":7148,"type":"conference","month":"02","day":"26","abstract":[{"lang":"eng","text":"We describe a framework for reasoning about programs with lists carrying integer numerical data. We use abstract domains to describe and manipulate complex constraints on configurations of these programs mixing constraints on the shape of the heap, sizes of the lists, on the multisets of data stored in these lists, and on the data at their different positions. Moreover, we provide powerful techniques for automatic validation of Hoare-triples and invariant checking, as well as for automatic synthesis of invariants and procedure summaries using modular inter-procedural analysis. The approach has been implemented in a tool called Celia and experimented successfully on a large benchmark of programs."}],"conference":{"location":"Philadelphia, PA, USA","start_date":"2012-01-22","end_date":"2012-01-24","name":"VMCAI: Verification, Model Checking and Abstract Interpretation"},"title":"Abstract domains for automated reasoning about list manipulating programs with infinite data","page":"1 - 22","date_updated":"2021-01-12T07:42:09Z","status":"public","date_published":"2012-02-26T00:00:00Z","date_created":"2018-12-11T12:02:17Z","intvolume":"      7148","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was partly supported by the French National Research Agency (ANR) project Veridyc (ANR-09-SEGI-016).","quality_controlled":"1","_id":"3253","doi":"10.1007/978-3-642-27940-9_1","publist_id":"3404","alternative_title":["LNCS"],"publisher":"Springer","department":[{"_id":"ToHe"}],"publication_status":"published","author":[{"full_name":"Bouajjani, Ahmed","last_name":"Bouajjani","first_name":"Ahmed"},{"first_name":"Cezara","last_name":"Dragoi","full_name":"Dragoi, Cezara","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Enea, Constantin","last_name":"Enea","first_name":"Constantin"},{"last_name":"Sighireanu","first_name":"Mihaela","full_name":"Sighireanu, Mihaela"}]},{"project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3254","department":[{"_id":"KrCh"}],"publication_status":"published","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"doi":"10.1016/j.ic.2011.11.004","ec_funded":1,"publisher":"Elsevier","scopus_import":1,"year":"2012","volume":211,"type":"journal_article","oa_version":"None","citation":{"chicago":"Chatterjee, Krishnendu. “The Complexity of Stochastic Müller Games.” <i>Information and Computation</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.ic.2011.11.004\">https://doi.org/10.1016/j.ic.2011.11.004</a>.","ista":"Chatterjee K. 2012. The complexity of stochastic Müller games. Information and Computation. 211, 29–48.","short":"K. Chatterjee, Information and Computation 211 (2012) 29–48.","ieee":"K. Chatterjee, “The complexity of stochastic Müller games,” <i>Information and Computation</i>, vol. 211. Elsevier, pp. 29–48, 2012.","mla":"Chatterjee, Krishnendu. “The Complexity of Stochastic Müller Games.” <i>Information and Computation</i>, vol. 211, Elsevier, 2012, pp. 29–48, doi:<a href=\"https://doi.org/10.1016/j.ic.2011.11.004\">10.1016/j.ic.2011.11.004</a>.","ama":"Chatterjee K. The complexity of stochastic Müller games. <i>Information and Computation</i>. 2012;211:29-48. doi:<a href=\"https://doi.org/10.1016/j.ic.2011.11.004\">10.1016/j.ic.2011.11.004</a>","apa":"Chatterjee, K. (2012). The complexity of stochastic Müller games. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2011.11.004\">https://doi.org/10.1016/j.ic.2011.11.004</a>"},"date_updated":"2021-01-12T07:42:09Z","main_file_link":[{"url":"http://arise.or.at/pubpdf/The_complexity_of_stochastic_M___u_ller_games.pdf"}],"date_published":"2012-02-01T00:00:00Z","abstract":[{"lang":"eng","text":"The theory of graph games with ω-regular winning conditions is the foundation for modeling and synthesizing reactive processes. In the case of stochastic reactive processes, the corresponding stochastic graph games have three players, two of them (System and Environment) behaving adversarially, and the third (Uncertainty) behaving probabilistically. We consider two problems for stochastic graph games: the qualitative problem asks for the set of states from which a player can win with probability 1 (almost-sure winning); and the quantitative problem asks for the maximal probability of winning (optimal winning) from each state. We consider ω-regular winning conditions formalized as Müller winning conditions. We present optimal memory bounds for pure (deterministic) almost-sure winning and optimal winning strategies in stochastic graph games with Müller winning conditions. We also study the complexity of stochastic Müller games and show that both the qualitative and quantitative analysis problems are PSPACE-complete. Our results are relevant in synthesis of stochastic reactive processes."}],"title":"The complexity of stochastic Müller games","intvolume":"       211","acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No. P 23499-N23, FWF NFN Grant No. S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","quality_controlled":"1","publist_id":"3403","month":"02","language":[{"iso":"eng"}],"status":"public","date_created":"2018-12-11T12:02:17Z","day":"01","publication":"Information and Computation","page":"29 - 48"},{"doi":"10.1007/978-3-642-25929-6_3","publisher":"Springer","alternative_title":["LNCS"],"department":[{"_id":"KrCh"}],"publication_status":"published","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"}],"_id":"3255","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"abstract":[{"text":"In this paper we survey results of two-player games on graphs and Markov decision processes with parity, mean-payoff and energy objectives, and the combination of mean-payoff and energy objectives with parity objectives. These problems have applications in verification and synthesis of reactive systems in resource-constrained environments.","lang":"eng"}],"title":"Games and Markov decision processes with mean payoff parity and energy parity objectives","date_updated":"2021-01-12T07:42:10Z","ddc":["000"],"date_published":"2012-01-01T00:00:00Z","oa_version":"Submitted Version","citation":{"chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Games and Markov Decision Processes with Mean Payoff Parity and Energy Parity Objectives,” 7119:37–46. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-25929-6_3\">https://doi.org/10.1007/978-3-642-25929-6_3</a>.","ista":"Chatterjee K, Doyen L. 2012. Games and Markov decision processes with mean payoff parity and energy parity objectives. MEMICS: Mathematical and Engineering Methods in Computer Science, LNCS, vol. 7119, 37–46.","short":"K. Chatterjee, L. Doyen, in:, Springer, 2012, pp. 37–46.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Games and Markov Decision Processes with Mean Payoff Parity and Energy Parity Objectives</i>. Vol. 7119, Springer, 2012, pp. 37–46, doi:<a href=\"https://doi.org/10.1007/978-3-642-25929-6_3\">10.1007/978-3-642-25929-6_3</a>.","ieee":"K. Chatterjee and L. Doyen, “Games and Markov decision processes with mean payoff parity and energy parity objectives,” presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice, Czech Republic, 2012, vol. 7119, pp. 37–46.","apa":"Chatterjee, K., &#38; Doyen, L. (2012). Games and Markov decision processes with mean payoff parity and energy parity objectives (Vol. 7119, pp. 37–46). Presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice, Czech Republic: Springer. <a href=\"https://doi.org/10.1007/978-3-642-25929-6_3\">https://doi.org/10.1007/978-3-642-25929-6_3</a>","ama":"Chatterjee K, Doyen L. Games and Markov decision processes with mean payoff parity and energy parity objectives. In: Vol 7119. Springer; 2012:37-46. doi:<a href=\"https://doi.org/10.1007/978-3-642-25929-6_3\">10.1007/978-3-642-25929-6_3</a>"},"volume":7119,"year":"2012","scopus_import":1,"type":"conference","publist_id":"3400","has_accepted_license":"1","file":[{"relation":"main_file","date_created":"2020-05-15T12:53:12Z","access_level":"open_access","file_name":"2012_MEMICS_Chatterjee.pdf","file_size":114060,"checksum":"eed2cc1e76b160418c977e76e8899a60","date_updated":"2020-07-14T12:46:05Z","file_id":"7863","content_type":"application/pdf","creator":"dernst"}],"oa":1,"intvolume":"      7119","quality_controlled":"1","article_processing_charge":"No","file_date_updated":"2020-07-14T12:46:05Z","acknowledgement":"This work was partially supported by FWF NFN Grant S11407-N23 (RiSE) and a Microsoft faculty fellowship.","day":"01","page":"37 - 46","conference":{"name":"MEMICS: Mathematical and Engineering Methods in Computer Science","end_date":"2011-10-16","location":"Lednice, Czech Republic","start_date":"2011-10-14"},"status":"public","date_created":"2018-12-11T12:02:17Z","language":[{"iso":"eng"}],"month":"01"},{"doi":"10.1007/s00454-011-9382-4","publisher":"Springer","department":[{"_id":"HeEd"}],"author":[{"last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","first_name":"Michael","last_name":"Kerber"}],"publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3256","abstract":[{"text":"We use a distortion to define the dual complex of a cubical subdivision of ℝ n as an n-dimensional subcomplex of the nerve of the set of n-cubes. Motivated by the topological analysis of high-dimensional digital image data, we consider such subdivisions defined by generalizations of quad- and oct-trees to n dimensions. Assuming the subdivision is balanced, we show that mapping each vertex to the center of the corresponding n-cube gives a geometric realization of the dual complex in ℝ n.","lang":"eng"}],"title":"Dual complexes of cubical subdivisions of ℝn","date_updated":"2021-01-12T07:42:10Z","date_published":"2012-03-01T00:00:00Z","ddc":["000"],"issue":"2","oa_version":"Submitted Version","citation":{"ista":"Edelsbrunner H, Kerber M. 2012. Dual complexes of cubical subdivisions of ℝn. Discrete &#38; Computational Geometry. 47(2), 393–414.","chicago":"Edelsbrunner, Herbert, and Michael Kerber. “Dual Complexes of Cubical Subdivisions of ℝn.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s00454-011-9382-4\">https://doi.org/10.1007/s00454-011-9382-4</a>.","ama":"Edelsbrunner H, Kerber M. Dual complexes of cubical subdivisions of ℝn. <i>Discrete &#38; Computational Geometry</i>. 2012;47(2):393-414. doi:<a href=\"https://doi.org/10.1007/s00454-011-9382-4\">10.1007/s00454-011-9382-4</a>","apa":"Edelsbrunner, H., &#38; Kerber, M. (2012). Dual complexes of cubical subdivisions of ℝn. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-011-9382-4\">https://doi.org/10.1007/s00454-011-9382-4</a>","mla":"Edelsbrunner, Herbert, and Michael Kerber. “Dual Complexes of Cubical Subdivisions of ℝn.” <i>Discrete &#38; Computational Geometry</i>, vol. 47, no. 2, Springer, 2012, pp. 393–414, doi:<a href=\"https://doi.org/10.1007/s00454-011-9382-4\">10.1007/s00454-011-9382-4</a>.","ieee":"H. Edelsbrunner and M. Kerber, “Dual complexes of cubical subdivisions of ℝn,” <i>Discrete &#38; Computational Geometry</i>, vol. 47, no. 2. Springer, pp. 393–414, 2012.","short":"H. Edelsbrunner, M. Kerber, Discrete &#38; Computational Geometry 47 (2012) 393–414."},"scopus_import":1,"year":"2012","volume":47,"type":"journal_article","has_accepted_license":"1","publist_id":"3398","file":[{"relation":"main_file","content_type":"application/pdf","creator":"system","date_updated":"2020-07-14T12:46:05Z","checksum":"76486f3b2c9e7fd81342f3832ca387e7","file_id":"4675","file_name":"IST-2016-543-v1+1_2012-J-08-HierarchyCubeComplex.pdf","date_created":"2018-12-12T10:08:15Z","access_level":"open_access","file_size":203636}],"oa":1,"intvolume":"        47","acknowledgement":"This research is partially supported by the Defense Advanced Research Projects Agency (DARPA) under grants HR0011-05-1-0057 and HR0011-09-0065 as well as the National Science Foundation (NSF) under grant DBI-0820624.","file_date_updated":"2020-07-14T12:46:05Z","quality_controlled":"1","day":"01","publication":"Discrete & Computational Geometry","page":"393 - 414","status":"public","date_created":"2018-12-11T12:02:17Z","language":[{"iso":"eng"}],"pubrep_id":"543","month":"03"},{"external_id":{"arxiv":["1005.2305"]},"publist_id":"3397","oa":1,"quality_controlled":"1","intvolume":"       160","publication":"Discrete Applied Mathematics","related_material":{"record":[{"relation":"earlier_version","id":"2934","status":"public"}]},"page":"416 - 426","day":"01","date_created":"2018-12-11T12:02:18Z","status":"public","language":[{"iso":"eng"}],"month":"03","arxiv":1,"publisher":"Elsevier","doi":"10.1016/j.dam.2011.10.026","publication_status":"published","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir"}],"department":[{"_id":"VlKo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"3257","title":"Generalized roof duality and bisubmodular functions","abstract":[{"text":"Consider a convex relaxation f̂ of a pseudo-Boolean function f. We say that the relaxation is totally half-integral if f̂(x) is a polyhedral function with half-integral extreme points x, and this property is preserved after adding an arbitrary combination of constraints of the form x i=x j, x i=1-x j, and x i=γ where γ∈{0,1,1/2} is a constant. A well-known example is the roof duality relaxation for quadratic pseudo-Boolean functions f. We argue that total half-integrality is a natural requirement for generalizations of roof duality to arbitrary pseudo-Boolean functions. Our contributions are as follows. First, we provide a complete characterization of totally half-integral relaxations f̂ by establishing a one-to-one correspondence with bisubmodular functions. Second, we give a new characterization of bisubmodular functions. Finally, we show some relationships between general totally half-integral relaxations and relaxations based on the roof duality. On the conceptual level, our results show that bisubmodular functions provide a natural generalization of the roof duality approach to higher-order terms. This can be viewed as a non-submodular analogue of the fact that submodular functions generalize the s-t minimum cut problem with non-negative weights to higher-order terms.","lang":"eng"}],"date_published":"2012-03-01T00:00:00Z","main_file_link":[{"url":"http://arxiv.org/abs/1005.2305","open_access":"1"}],"issue":"4-5","date_updated":"2023-02-23T11:04:49Z","citation":{"short":"V. Kolmogorov, Discrete Applied Mathematics 160 (2012) 416–426.","ieee":"V. Kolmogorov, “Generalized roof duality and bisubmodular functions,” <i>Discrete Applied Mathematics</i>, vol. 160, no. 4–5. Elsevier, pp. 416–426, 2012.","mla":"Kolmogorov, Vladimir. “Generalized Roof Duality and Bisubmodular Functions.” <i>Discrete Applied Mathematics</i>, vol. 160, no. 4–5, Elsevier, 2012, pp. 416–26, doi:<a href=\"https://doi.org/10.1016/j.dam.2011.10.026\">10.1016/j.dam.2011.10.026</a>.","ama":"Kolmogorov V. Generalized roof duality and bisubmodular functions. <i>Discrete Applied Mathematics</i>. 2012;160(4-5):416-426. doi:<a href=\"https://doi.org/10.1016/j.dam.2011.10.026\">10.1016/j.dam.2011.10.026</a>","apa":"Kolmogorov, V. (2012). Generalized roof duality and bisubmodular functions. <i>Discrete Applied Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.dam.2011.10.026\">https://doi.org/10.1016/j.dam.2011.10.026</a>","chicago":"Kolmogorov, Vladimir. “Generalized Roof Duality and Bisubmodular Functions.” <i>Discrete Applied Mathematics</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.dam.2011.10.026\">https://doi.org/10.1016/j.dam.2011.10.026</a>.","ista":"Kolmogorov V. 2012. Generalized roof duality and bisubmodular functions. Discrete Applied Mathematics. 160(4–5), 416–426."},"oa_version":"Preprint","type":"journal_article","scopus_import":1,"year":"2012","volume":160},{"date_updated":"2023-09-07T11:43:52Z","issue":"4","date_published":"2012-04-01T00:00:00Z","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3617474/","open_access":"1"}],"abstract":[{"lang":"eng","text":"CA3 pyramidal neurons are important for memory formation and pattern completion in the hippocampal network. It is generally thought that proximal synapses from the mossy fibers activate these neurons most efficiently, whereas distal inputs from the perforant path have a weaker modulatory influence. We used confocally targeted patch-clamp recording from dendrites and axons to map the activation of rat CA3 pyramidal neurons at the subcellular level. Our results reveal two distinct dendritic domains. In the proximal domain, action potentials initiated in the axon backpropagate actively with large amplitude and fast time course. In the distal domain, Na+ channel–mediated dendritic spikes are efficiently initiated by waveforms mimicking synaptic events. CA3 pyramidal neuron dendrites showed a high Na+-to-K+ conductance density ratio, providing ideal conditions for active backpropagation and dendritic spike initiation. Dendritic spikes may enhance the computational power of CA3 pyramidal neurons in the hippocampal network."}],"title":"Active dendrites support efficient initiation of dendritic spikes in hippocampal CA3 pyramidal neurons","year":"2012","volume":15,"scopus_import":"1","publication_identifier":{"issn":["1546-1726"]},"type":"journal_article","oa_version":"Published Version","citation":{"ista":"Kim S, Guzmán J, Hu H, Jonas PM. 2012. Active dendrites support efficient initiation of dendritic spikes in hippocampal CA3 pyramidal neurons. Nature Neuroscience. 15(4), 600–606.","chicago":"Kim, Sooyun, José Guzmán, Hua Hu, and Peter M Jonas. “Active Dendrites Support Efficient Initiation of Dendritic Spikes in Hippocampal CA3 Pyramidal Neurons.” <i>Nature Neuroscience</i>. Nature Publishing Group, 2012. <a href=\"https://doi.org/10.1038/nn.3060\">https://doi.org/10.1038/nn.3060</a>.","apa":"Kim, S., Guzmán, J., Hu, H., &#38; Jonas, P. M. (2012). Active dendrites support efficient initiation of dendritic spikes in hippocampal CA3 pyramidal neurons. <i>Nature Neuroscience</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nn.3060\">https://doi.org/10.1038/nn.3060</a>","ama":"Kim S, Guzmán J, Hu H, Jonas PM. Active dendrites support efficient initiation of dendritic spikes in hippocampal CA3 pyramidal neurons. <i>Nature Neuroscience</i>. 2012;15(4):600-606. doi:<a href=\"https://doi.org/10.1038/nn.3060\">10.1038/nn.3060</a>","ieee":"S. Kim, J. Guzmán, H. Hu, and P. M. Jonas, “Active dendrites support efficient initiation of dendritic spikes in hippocampal CA3 pyramidal neurons,” <i>Nature Neuroscience</i>, vol. 15, no. 4. Nature Publishing Group, pp. 600–606, 2012.","mla":"Kim, Sooyun, et al. “Active Dendrites Support Efficient Initiation of Dendritic Spikes in Hippocampal CA3 Pyramidal Neurons.” <i>Nature Neuroscience</i>, vol. 15, no. 4, Nature Publishing Group, 2012, pp. 600–06, doi:<a href=\"https://doi.org/10.1038/nn.3060\">10.1038/nn.3060</a>.","short":"S. Kim, J. Guzmán, H. Hu, P.M. Jonas, Nature Neuroscience 15 (2012) 600–606."},"department":[{"_id":"PeJo"}],"author":[{"full_name":"Kim, Sooyun","id":"394AB1C8-F248-11E8-B48F-1D18A9856A87","first_name":"Sooyun","last_name":"Kim"},{"first_name":"José","last_name":"Guzmán","orcid":"0000-0003-2209-5242","full_name":"Guzmán, José","id":"30CC5506-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hu","first_name":"Hua","id":"4AC0145C-F248-11E8-B48F-1D18A9856A87","full_name":"Hu, Hua"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas","first_name":"Peter M"}],"publication_status":"published","doi":"10.1038/nn.3060","publisher":"Nature Publishing Group","pmid":1,"project":[{"_id":"25BDE9A4-B435-11E9-9278-68D0E5697425","grant_number":"SFB-TR3-TP10B","name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen"}],"_id":"3258","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","status":"public","date_created":"2018-12-11T12:02:18Z","day":"01","page":"600 - 606","publication":"Nature Neuroscience","related_material":{"record":[{"relation":"dissertation_contains","id":"2964","status":"public"}]},"month":"04","article_type":"original","language":[{"iso":"eng"}],"oa":1,"publist_id":"3390","external_id":{"pmid":["22388958"]},"intvolume":"        15","article_processing_charge":"No","quality_controlled":"1","acknowledgement":"This work was supported by the Deutsche Forschungsgemeinschaft (TR 3/B10) and the European Union (European Research Council Advanced grant to P.J.)."},{"intvolume":"        81","quality_controlled":"1","oa":1,"publist_id":"3388","external_id":{"pmid":["22120126"]},"month":"02","language":[{"iso":"eng"}],"status":"public","date_created":"2018-12-11T12:02:19Z","day":"01","page":"69 - 80","publication":"Theoretical Population Biology","related_material":{"record":[{"status":"public","id":"1400","relation":"dissertation_contains"}]},"project":[{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"pmid":1,"_id":"3260","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"publication_status":"published","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Reiter, Johannes","orcid":"0000-0002-0170-7353","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes","last_name":"Reiter"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"doi":"10.1016/j.tpb.2011.11.003","publisher":"Academic Press","ec_funded":1,"volume":81,"year":"2012","scopus_import":1,"type":"journal_article","oa_version":"Submitted Version","citation":{"apa":"Chatterjee, K., Reiter, J., &#38; Nowak, M. (2012). Evolutionary dynamics of biological auctions. <i>Theoretical Population Biology</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.tpb.2011.11.003\">https://doi.org/10.1016/j.tpb.2011.11.003</a>","ama":"Chatterjee K, Reiter J, Nowak M. Evolutionary dynamics of biological auctions. <i>Theoretical Population Biology</i>. 2012;81(1):69-80. doi:<a href=\"https://doi.org/10.1016/j.tpb.2011.11.003\">10.1016/j.tpb.2011.11.003</a>","short":"K. Chatterjee, J. Reiter, M. Nowak, Theoretical Population Biology 81 (2012) 69–80.","ieee":"K. Chatterjee, J. Reiter, and M. Nowak, “Evolutionary dynamics of biological auctions,” <i>Theoretical Population Biology</i>, vol. 81, no. 1. Academic Press, pp. 69–80, 2012.","mla":"Chatterjee, Krishnendu, et al. “Evolutionary Dynamics of Biological Auctions.” <i>Theoretical Population Biology</i>, vol. 81, no. 1, Academic Press, 2012, pp. 69–80, doi:<a href=\"https://doi.org/10.1016/j.tpb.2011.11.003\">10.1016/j.tpb.2011.11.003</a>.","ista":"Chatterjee K, Reiter J, Nowak M. 2012. Evolutionary dynamics of biological auctions. Theoretical Population Biology. 81(1), 69–80.","chicago":"Chatterjee, Krishnendu, Johannes Reiter, and Martin Nowak. “Evolutionary Dynamics of Biological Auctions.” <i>Theoretical Population Biology</i>. Academic Press, 2012. <a href=\"https://doi.org/10.1016/j.tpb.2011.11.003\">https://doi.org/10.1016/j.tpb.2011.11.003</a>."},"date_updated":"2023-09-07T11:40:43Z","issue":"1","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3279759/ "}],"date_published":"2012-02-01T00:00:00Z","abstract":[{"text":"Many scenarios in the living world, where individual organisms compete for winning positions (or resources), have properties of auctions. Here we study the evolution of bids in biological auctions. For each auction, n individuals are drawn at random from a population of size N. Each individual makes a bid which entails a cost. The winner obtains a benefit of a certain value. Costs and benefits are translated into reproductive success (fitness). Therefore, successful bidding strategies spread in the population. We compare two types of auctions. In “biological all-pay auctions”, the costs are the bid for every participating individual. In “biological second price all-pay auctions”, the cost for everyone other than the winner is the bid, but the cost for the winner is the second highest bid. Second price all-pay auctions are generalizations of the “war of attrition” introduced by Maynard Smith. We study evolutionary dynamics in both types of auctions. We calculate pairwise invasion plots and evolutionarily stable distributions over the continuous strategy space. We find that the average bid in second price all-pay auctions is higher than in all-pay auctions, but the average cost for the winner is similar in both auctions. In both cases, the average bid is a declining function of the number of participants, n. The more individuals participate in an auction the smaller is the chance of winning, and thus expensive bids must be avoided.\r\n","lang":"eng"}],"title":"Evolutionary dynamics of biological auctions"}]