[{"oa_version":"Submitted Version","title":"Sociality and health: Impacts of sociality on disease susceptibility and transmission in animal and human societies","author":[{"full_name":"Kappeler, Peter","last_name":"Kappeler","first_name":"Peter"},{"orcid":"0000-0002-2193-3868","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","full_name":"Cremer, Sylvia","last_name":"Cremer"},{"first_name":"Charles","full_name":"Nunn, Charles","last_name":"Nunn"}],"day":"01","scopus_import":1,"date_created":"2018-12-11T11:54:15Z","volume":370,"intvolume":"       370","abstract":[{"text":"This paper introduces a theme issue presenting the latest developments in research on the impacts of sociality on health and fitness. The articles that follow cover research on societies ranging from insects to humans. Variation in measures of fitness (i.e. survival and reproduction) has been linked to various aspects of sociality in humans and animals alike, and variability in individual health and condition has been recognized as a key mediator of these relationships. Viewed from a broad evolutionary perspective, the evolutionary transitions from a solitary lifestyle to group living have resulted in several new health-related costs and benefits of sociality. Social transmission of parasites within groups represents a major cost of group living, but some behavioural mechanisms, such as grooming, have evolved repeatedly to reduce this cost. Group living also has created novel costs in terms of altered susceptibility to infectious and non-infectious disease as a result of the unavoidable physiological consequences of social competition and integration, which are partly alleviated by social buffering in some vertebrates. Here, we define the relevant aspects of sociality, summarize their health-related costs and benefits, and discuss possible fitness measures in different study systems. Given the pervasive effects of social factors on health and fitness, we propose a synthesis of existing conceptual approaches in disease ecology, ecological immunology and behavioural neurosciences by adding sociality as a key factor, with the goal to generate a broader framework for organismal integration of health-related research.","lang":"eng"}],"publication_status":"published","month":"05","article_number":"20140116","department":[{"_id":"SyCr"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"1669","citation":{"ama":"Kappeler P, Cremer S, Nunn C. Sociality and health: Impacts of sociality on disease susceptibility and transmission in animal and human societies. <i>Philosophical Transactions of the Royal Society of London Series B, Biological Sciences</i>. 2015;370(1669). doi:<a href=\"https://doi.org/10.1098/rstb.2014.0116\">10.1098/rstb.2014.0116</a>","ieee":"P. Kappeler, S. Cremer, and C. Nunn, “Sociality and health: Impacts of sociality on disease susceptibility and transmission in animal and human societies,” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>, vol. 370, no. 1669. Royal Society, 2015.","short":"P. Kappeler, S. Cremer, C. Nunn, Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences 370 (2015).","ista":"Kappeler P, Cremer S, Nunn C. 2015. Sociality and health: Impacts of sociality on disease susceptibility and transmission in animal and human societies. Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences. 370(1669), 20140116.","chicago":"Kappeler, Peter, Sylvia Cremer, and Charles Nunn. “Sociality and Health: Impacts of Sociality on Disease Susceptibility and Transmission in Animal and Human Societies.” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>. Royal Society, 2015. <a href=\"https://doi.org/10.1098/rstb.2014.0116\">https://doi.org/10.1098/rstb.2014.0116</a>.","apa":"Kappeler, P., Cremer, S., &#38; Nunn, C. (2015). Sociality and health: Impacts of sociality on disease susceptibility and transmission in animal and human societies. <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>. Royal Society. <a href=\"https://doi.org/10.1098/rstb.2014.0116\">https://doi.org/10.1098/rstb.2014.0116</a>","mla":"Kappeler, Peter, et al. “Sociality and Health: Impacts of Sociality on Disease Susceptibility and Transmission in Animal and Human Societies.” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>, vol. 370, no. 1669, 20140116, Royal Society, 2015, doi:<a href=\"https://doi.org/10.1098/rstb.2014.0116\">10.1098/rstb.2014.0116</a>."},"publisher":"Royal Society","doi":"10.1098/rstb.2014.0116","type":"journal_article","date_updated":"2021-01-12T06:53:29Z","_id":"1831","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4410382/"}],"external_id":{"pmid":["25870402"]},"year":"2015","publist_id":"5272","status":"public","publication":"Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences","acknowledgement":"We thank the German Research Foundation (DFG), the Ministry of Science and Culture of Lower-Saxony (MWK Hannover) and the German Primate Centre (DPZ) for their support of the 9. Göttinger Freilandtage in 2013, a conference at which most contributions to this issue were first presented, the referees of the contributions to this issue for their constructive comments, Meggan Craft for comments, and Helen Eaton for her support in producing this theme issue.","date_published":"2015-05-01T00:00:00Z","pmid":1},{"oa_version":"Published Version","title":"Aspect-oriented linearizability proofs","author":[{"last_name":"Chakraborty","full_name":"Chakraborty, Soham","first_name":"Soham"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"last_name":"Sezgin","full_name":"Sezgin, Ali","first_name":"Ali"},{"first_name":"Viktor","full_name":"Vafeiadis, Viktor","last_name":"Vafeiadis"}],"day":"01","scopus_import":1,"article_type":"original","date_created":"2018-12-11T11:54:15Z","volume":11,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)"},"license":"https://creativecommons.org/licenses/by-nd/4.0/","intvolume":"        11","abstract":[{"lang":"eng","text":"Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on the identification of the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to advanced non-blocking concurrency patterns, such as helping and optimistic updates. In response, we propose a more modular way of checking linearizability of concurrent queue algorithms that does not involve identifying linearization points. We reduce the task of proving linearizability with respect to the queue specification to establishing four basic properties, each of which can be proved independently by simpler arguments. As a demonstration of our approach, we verify the Herlihy and Wing queue, an algorithm that is challenging to verify by a simulation proof. "}],"has_accepted_license":"1","publication_status":"published","file_date_updated":"2020-07-14T12:45:17Z","month":"04","article_number":"20","file":[{"file_id":"4881","creator":"system","date_updated":"2020-07-14T12:45:17Z","date_created":"2018-12-12T10:11:27Z","file_size":380203,"checksum":"7370e164d0a731f442424a92669efc34","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2015-390-v1+1_1502.07639.pdf"}],"department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"pubrep_id":"390","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"1","citation":{"chicago":"Chakraborty, Soham, Thomas A Henzinger, Ali Sezgin, and Viktor Vafeiadis. “Aspect-Oriented Linearizability Proofs.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2015. <a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">https://doi.org/10.2168/LMCS-11(1:20)2015</a>.","ista":"Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. 2015. Aspect-oriented linearizability proofs. Logical Methods in Computer Science. 11(1), 20.","apa":"Chakraborty, S., Henzinger, T. A., Sezgin, A., &#38; Vafeiadis, V. (2015). Aspect-oriented linearizability proofs. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">https://doi.org/10.2168/LMCS-11(1:20)2015</a>","mla":"Chakraborty, Soham, et al. “Aspect-Oriented Linearizability Proofs.” <i>Logical Methods in Computer Science</i>, vol. 11, no. 1, 20, International Federation of Computational Logic, 2015, doi:<a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">10.2168/LMCS-11(1:20)2015</a>.","ama":"Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability proofs. <i>Logical Methods in Computer Science</i>. 2015;11(1). doi:<a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">10.2168/LMCS-11(1:20)2015</a>","ieee":"S. Chakraborty, T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” <i>Logical Methods in Computer Science</i>, vol. 11, no. 1. International Federation of Computational Logic, 2015.","short":"S. Chakraborty, T.A. Henzinger, A. Sezgin, V. Vafeiadis, Logical Methods in Computer Science 11 (2015)."},"publisher":"International Federation of Computational Logic","doi":"10.2168/LMCS-11(1:20)2015","article_processing_charge":"No","type":"journal_article","date_updated":"2023-02-23T10:38:13Z","_id":"1832","ddc":["000"],"quality_controlled":"1","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2328"}]},"year":"2015","publist_id":"5271","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"status":"public","publication":"Logical Methods in Computer Science","date_published":"2015-04-01T00:00:00Z","ec_funded":1},{"quality_controlled":"1","ddc":["570"],"_id":"1834","date_updated":"2023-10-18T06:47:30Z","type":"journal_article","article_processing_charge":"No","doi":"10.1177/1759091415575845","publisher":"SAGE Publications","date_published":"2015-04-13T00:00:00Z","status":"public","publication":"ASN Neuro","publist_id":"5269","year":"2015","file_date_updated":"2020-07-14T12:45:18Z","publication_status":"published","has_accepted_license":"1","license":"https://creativecommons.org/licenses/by/3.0/","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png","short":"CC BY (3.0)"},"abstract":[{"lang":"eng","text":"Huge body of evidences demonstrated that volatile anesthetics affect the hippocampal neurogenesis and neurocognitive functions, and most of them showed impairment at anesthetic dose. Here, we investigated the effect of low dose (1.8%) sevoflurane on hippocampal neurogenesis and dentate gyrus-dependent learning. Neonatal rats at postnatal day 4 to 6 (P4-6) were treated with 1.8% sevoflurane for 6 hours. Neurogenesis was quantified by bromodeoxyuridine labeling and electrophysiology recording. Four and seven weeks after treatment, the Morris water maze and contextual-fear discrimination learning tests were performed to determine the influence on spatial learning and pattern separation. A 6-hour treatment with 1.8% sevoflurane promoted hippocampal neurogenesis and increased the survival of newborn cells and the proportion of immature granular cells in the dentate gyrus of neonatal rats. Sevoflurane-treated rats performed better during the training days of the Morris water maze test and in contextual-fear discrimination learning test. These results suggest that a subanesthetic dose of sevoflurane promotes hippocampal neurogenesis in neonatal rats and facilitates their performance in dentate gyrus-dependent learning tasks."}],"intvolume":"         7","volume":7,"date_created":"2018-12-11T11:54:16Z","article_type":"original","day":"13","scopus_import":"1","author":[{"id":"3DFD581A-F248-11E8-B48F-1D18A9856A87","full_name":"Chen, Chong","last_name":"Chen","first_name":"Chong"},{"last_name":"Wang","full_name":"Wang, Chao","first_name":"Chao"},{"last_name":"Zhao","full_name":"Zhao, Xuan","first_name":"Xuan"},{"first_name":"Tao","full_name":"Zhou, Tao","last_name":"Zhou"},{"first_name":"Dao","last_name":"Xu","full_name":"Xu, Dao"},{"last_name":"Wang","full_name":"Wang, Zhi","first_name":"Zhi"},{"full_name":"Wang, Ying","last_name":"Wang","first_name":"Ying"}],"title":"Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent learning in neonatal rats","oa_version":"Published Version","citation":{"ama":"Chen C, Wang C, Zhao X, et al. Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent learning in neonatal rats. <i>ASN Neuro</i>. 2015;7(2). doi:<a href=\"https://doi.org/10.1177/1759091415575845\">10.1177/1759091415575845</a>","ieee":"C. Chen <i>et al.</i>, “Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent learning in neonatal rats,” <i>ASN Neuro</i>, vol. 7, no. 2. SAGE Publications, 2015.","short":"C. Chen, C. Wang, X. Zhao, T. Zhou, D. Xu, Z. Wang, Y. Wang, ASN Neuro 7 (2015).","ista":"Chen C, Wang C, Zhao X, Zhou T, Xu D, Wang Z, Wang Y. 2015. Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent learning in neonatal rats. ASN Neuro. 7(2).","chicago":"Chen, Chong, Chao Wang, Xuan Zhao, Tao Zhou, Dao Xu, Zhi Wang, and Ying Wang. “Low-Dose Sevoflurane Promoteshippocampal Neurogenesis and Facilitates the Development of Dentate Gyrus-Dependent Learning in Neonatal Rats.” <i>ASN Neuro</i>. SAGE Publications, 2015. <a href=\"https://doi.org/10.1177/1759091415575845\">https://doi.org/10.1177/1759091415575845</a>.","apa":"Chen, C., Wang, C., Zhao, X., Zhou, T., Xu, D., Wang, Z., &#38; Wang, Y. (2015). Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent learning in neonatal rats. <i>ASN Neuro</i>. SAGE Publications. <a href=\"https://doi.org/10.1177/1759091415575845\">https://doi.org/10.1177/1759091415575845</a>","mla":"Chen, Chong, et al. “Low-Dose Sevoflurane Promoteshippocampal Neurogenesis and Facilitates the Development of Dentate Gyrus-Dependent Learning in Neonatal Rats.” <i>ASN Neuro</i>, vol. 7, no. 2, SAGE Publications, 2015, doi:<a href=\"https://doi.org/10.1177/1759091415575845\">10.1177/1759091415575845</a>."},"issue":"2","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"language":[{"iso":"eng"}],"pubrep_id":"456","department":[{"_id":"PeJo"}],"file":[{"access_level":"open_access","content_type":"application/pdf","file_name":"IST-2016-456-v1+1_ASN_Neuro-2015-Chen-.pdf","checksum":"53e16bd3fc2ae2c0d7de9164626c37aa","relation":"main_file","date_updated":"2020-07-14T12:45:18Z","creator":"system","file_size":1146814,"date_created":"2018-12-12T10:14:08Z","file_id":"5057"}],"month":"04"},{"citation":{"apa":"Giacobbe, M., Guet, C. C., Gupta, A., Henzinger, T. A., Paixao, T., &#38; Petrov, T. (2015). Model checking gene regulatory networks. Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-662-46681-0_47\">https://doi.org/10.1007/978-3-662-46681-0_47</a>","mla":"Giacobbe, Mirco, et al. <i>Model Checking Gene Regulatory Networks</i>. Vol. 9035, Springer, 2015, pp. 469–83, doi:<a href=\"https://doi.org/10.1007/978-3-662-46681-0_47\">10.1007/978-3-662-46681-0_47</a>.","chicago":"Giacobbe, Mirco, Calin C Guet, Ashutosh Gupta, Thomas A Henzinger, Tiago Paixao, and Tatjana Petrov. “Model Checking Gene Regulatory Networks.” Lecture Notes in Computer Science. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-46681-0_47\">https://doi.org/10.1007/978-3-662-46681-0_47</a>.","ista":"Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. 2015. Model checking gene regulatory networks. 9035, 469–483.","ieee":"M. Giacobbe, C. C. Guet, A. Gupta, T. A. Henzinger, T. Paixao, and T. Petrov, “Model checking gene regulatory networks,” vol. 9035. Springer, pp. 469–483, 2015.","short":"M. Giacobbe, C.C. Guet, A. Gupta, T.A. Henzinger, T. Paixao, T. Petrov, 9035 (2015) 469–483.","ama":"Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. Model checking gene regulatory networks. 2015;9035:469-483. doi:<a href=\"https://doi.org/10.1007/978-3-662-46681-0_47\">10.1007/978-3-662-46681-0_47</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"ToHe"},{"_id":"CaGu"},{"_id":"NiBa"}],"month":"04","publication_status":"published","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 logics. 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"}],"intvolume":"      9035","volume":9035,"date_created":"2018-12-11T11:54:16Z","author":[{"first_name":"Mirco","orcid":"0000-0001-8180-0904","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","full_name":"Giacobbe, Mirco","last_name":"Giacobbe"},{"last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052","first_name":"Calin C"},{"first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh","last_name":"Gupta"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"first_name":"Tiago","orcid":"0000-0003-2361-3953","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","full_name":"Paixao, Tiago","last_name":"Paixao"},{"orcid":"0000-0002-9041-0905","first_name":"Tatjana","last_name":"Petrov","full_name":"Petrov, Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87"}],"day":"01","scopus_import":1,"title":"Model checking gene regulatory networks","oa_version":"Preprint","ec_funded":1,"conference":{"location":"London, United Kingdom","start_date":"2015-04-11","end_date":"2015-04-18","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"acknowledgement":"SNSF Early Postdoc.Mobility Fellowship, the grant number P2EZP2 148797.\r\n","date_published":"2015-04-01T00:00:00Z","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","grant_number":"618091"},{"_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation"},{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"status":"public","publist_id":"5267","year":"2015","related_material":{"record":[{"id":"1351","relation":"later_version","status":"public"}]},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1410.7704"}],"quality_controlled":"1","page":"469 - 483","date_updated":"2025-05-28T11:57:04Z","_id":"1835","type":"conference","series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-662-46681-0_47","alternative_title":["LNCS"],"publisher":"Springer"},{"publist_id":"5266","year":"2015","ec_funded":1,"conference":{"name":"ESOP: European Symposium on Programming","end_date":"2015-04-18","start_date":"2015-04-11","location":"London, United Kingdom"},"date_published":"2015-04-01T00:00:00Z","status":"public","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"_id":"1836","date_updated":"2020-08-11T10:09:32Z","series_title":"Lecture Notes in Computer Science","type":"conference","alternative_title":["LNCS"],"doi":"10.1007/978-3-662-46669-8_5","publisher":"Springer","quality_controlled":"1","page":"105 - 131","department":[{"_id":"ToHe"}],"month":"04","citation":{"ama":"Cerny P, Henzinger TA, Kovács L, Radhakrishna A, Zwirchmayr J. Segment abstraction for worst-case execution time analysis. 2015;9032:105-131. doi:<a href=\"https://doi.org/10.1007/978-3-662-46669-8_5\">10.1007/978-3-662-46669-8_5</a>","short":"P. Cerny, T.A. Henzinger, L. Kovács, A. Radhakrishna, J. Zwirchmayr, 9032 (2015) 105–131.","ieee":"P. Cerny, T. A. Henzinger, L. Kovács, A. Radhakrishna, and J. Zwirchmayr, “Segment abstraction for worst-case execution time analysis,” vol. 9032. Springer, pp. 105–131, 2015.","ista":"Cerny P, Henzinger TA, Kovács L, Radhakrishna A, Zwirchmayr J. 2015. Segment abstraction for worst-case execution time analysis. 9032, 105–131.","chicago":"Cerny, Pavol, Thomas A Henzinger, Laura Kovács, Arjun Radhakrishna, and Jakob Zwirchmayr. “Segment Abstraction for Worst-Case Execution Time Analysis.” Lecture Notes in Computer Science. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-46669-8_5\">https://doi.org/10.1007/978-3-662-46669-8_5</a>.","mla":"Cerny, Pavol, et al. <i>Segment Abstraction for Worst-Case Execution Time Analysis</i>. Vol. 9032, Springer, 2015, pp. 105–31, doi:<a href=\"https://doi.org/10.1007/978-3-662-46669-8_5\">10.1007/978-3-662-46669-8_5</a>.","apa":"Cerny, P., Henzinger, T. A., Kovács, L., Radhakrishna, A., &#38; Zwirchmayr, J. (2015). Segment abstraction for worst-case execution time analysis. Presented at the ESOP: European Symposium on Programming, London, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-662-46669-8_5\">https://doi.org/10.1007/978-3-662-46669-8_5</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"volume":9032,"date_created":"2018-12-11T11:54:16Z","scopus_import":1,"day":"01","author":[{"first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Laura","full_name":"Kovács, Laura","last_name":"Kovács"},{"first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jakob","last_name":"Zwirchmayr","full_name":"Zwirchmayr, Jakob"}],"title":"Segment abstraction for worst-case execution time analysis","oa_version":"None","publication_status":"published","abstract":[{"lang":"eng","text":"In the standard framework for worst-case execution time (WCET) analysis of programs, the main data structure is a single instance of integer linear programming (ILP) that represents the whole program. The instance of this NP-hard problem must be solved to find an estimate forWCET, and it must be refined if the estimate is not tight.We propose a new framework for WCET analysis, based on abstract segment trees (ASTs) as the main data structure. The ASTs have two advantages. First, they allow computing WCET by solving a number of independent small ILP instances. Second, ASTs store more expressive constraints, thus enabling a more efficient and precise refinement procedure. In order to realize our framework algorithmically, we develop an algorithm for WCET estimation on ASTs, and we develop an interpolation-based counterexample-guided refinement scheme for ASTs. Furthermore, we extend our framework to obtain parametric estimates of WCET. We experimentally evaluate our approach on a set of examples from WCET benchmark suites and linear-algebra packages. We show that our analysis, with comparable effort, provides WCET estimates that in many cases significantly improve those computed by existing tools."}],"intvolume":"      9032"},{"doi":"10.1017/jfm.2015.184","article_processing_charge":"No","publisher":"Cambridge University Press","date_updated":"2021-01-12T06:53:31Z","_id":"1837","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1508.06559"}],"quality_controlled":"1","year":"2015","external_id":{"arxiv":["1508.06559"]},"publist_id":"5265","project":[{"name":"Decoding the complexity of turbulence at its origin","grant_number":"306589","call_identifier":"FP7","_id":"25152F3A-B435-11E9-9278-68D0E5697425"}],"publication":"Journal of Fluid Mechanics","status":"public","ec_funded":1,"date_published":"2015-04-08T00:00:00Z","author":[{"id":"3A47AE32-F248-11E8-B48F-1D18A9856A87","full_name":"Kühnen, Jakob","last_name":"Kühnen","first_name":"Jakob","orcid":"0000-0003-4312-0179"},{"last_name":"Braunshier","full_name":"Braunshier, P","first_name":"P"},{"first_name":"M","last_name":"Schwegel","full_name":"Schwegel, M"},{"full_name":"Kuhlmann, Hendrik","last_name":"Kuhlmann","first_name":"Hendrik"},{"full_name":"Hof, Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87","last_name":"Hof","orcid":"0000-0003-2057-2754","first_name":"Björn"}],"scopus_import":1,"day":"08","oa_version":"Preprint","title":"Subcritical versus supercritical transition to turbulence in curved pipes","volume":770,"article_type":"original","date_created":"2018-12-11T11:54:17Z","abstract":[{"lang":"eng","text":"Transition to turbulence in straight pipes occurs in spite of the linear stability of the laminar Hagen-Poiseuille flow if both the amplitude of flow perturbations and the Reynolds number Re exceed a minimum threshold (subcritical transition). As the pipe curvature increases, centrifugal effects become important, modifying the basic flow as well as the most unstable linear modes. If the curvature (tube-to-coiling diameter d/D) is sufficiently large, a Hopf bifurcation (supercritical instability) is encountered before turbulence can be excited (subcritical instability). We trace the instability thresholds in the Re - d/D parameter space in the range 0.01 ≤ d/D\\ ≤ 0.1 by means of laser-Doppler velocimetry and determine the point where the subcritical and supercritical instabilities meet. Two different experimental set-ups are used: a closed system where the pipe forms an axisymmetric torus and an open system employing a helical pipe. Implications for the measurement of friction factors in curved pipes are discussed."}],"intvolume":"       770","publication_status":"published","month":"04","arxiv":1,"department":[{"_id":"BjHo"}],"article_number":"R3","oa":1,"language":[{"iso":"eng"}],"issue":"5","citation":{"apa":"Kühnen, J., Braunshier, P., Schwegel, M., Kuhlmann, H., &#38; Hof, B. (2015). Subcritical versus supercritical transition to turbulence in curved pipes. <i>Journal of Fluid Mechanics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jfm.2015.184\">https://doi.org/10.1017/jfm.2015.184</a>","mla":"Kühnen, Jakob, et al. “Subcritical versus Supercritical Transition to Turbulence in Curved Pipes.” <i>Journal of Fluid Mechanics</i>, vol. 770, no. 5, R3, Cambridge University Press, 2015, doi:<a href=\"https://doi.org/10.1017/jfm.2015.184\">10.1017/jfm.2015.184</a>.","ista":"Kühnen J, Braunshier P, Schwegel M, Kuhlmann H, Hof B. 2015. Subcritical versus supercritical transition to turbulence in curved pipes. Journal of Fluid Mechanics. 770(5), R3.","chicago":"Kühnen, Jakob, P Braunshier, M Schwegel, Hendrik Kuhlmann, and Björn Hof. “Subcritical versus Supercritical Transition to Turbulence in Curved Pipes.” <i>Journal of Fluid Mechanics</i>. Cambridge University Press, 2015. <a href=\"https://doi.org/10.1017/jfm.2015.184\">https://doi.org/10.1017/jfm.2015.184</a>.","ieee":"J. Kühnen, P. Braunshier, M. Schwegel, H. Kuhlmann, and B. Hof, “Subcritical versus supercritical transition to turbulence in curved pipes,” <i>Journal of Fluid Mechanics</i>, vol. 770, no. 5. Cambridge University Press, 2015.","short":"J. Kühnen, P. Braunshier, M. Schwegel, H. Kuhlmann, B. Hof, Journal of Fluid Mechanics 770 (2015).","ama":"Kühnen J, Braunshier P, Schwegel M, Kuhlmann H, Hof B. Subcritical versus supercritical transition to turbulence in curved pipes. <i>Journal of Fluid Mechanics</i>. 2015;770(5). doi:<a href=\"https://doi.org/10.1017/jfm.2015.184\">10.1017/jfm.2015.184</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"main_file_link":[{"url":"http://arxiv.org/abs/1411.4604","open_access":"1"}],"page":"517 - 532","type":"conference","date_updated":"2021-01-12T06:53:32Z","_id":"1838","publisher":"Springer","doi":"10.1007/978-3-662-46681-0_50","alternative_title":["LNCS"],"acknowledgement":"This work was supported by the Austrian Science Fund (FWF) through the research network RiSE (S11406-N23, S11407-N23) and grant nr. P23499-N23, by the European Commission through an ERC Start grant (279307: Graph Games) and project STANCE (317753), as well as by the German Research Foundation (DFG) through SFB/TR 14 AVACS and project ASDPS(JA 2357/2-1).","date_published":"2015-01-01T00:00:00Z","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2015-04-11","end_date":"2015-04-18","location":"London, United Kingdom"},"ec_funded":1,"project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"status":"public","publist_id":"5264","year":"2015","publication_status":"published","intvolume":"      9035","abstract":[{"text":"Synthesis of program parts is particularly useful for concurrent systems. However, most approaches do not support common design tasks, like modifying a single process without having to re-synthesize or verify the whole system. Assume-guarantee synthesis (AGS) provides robustness against modifications of system parts, but thus far has been limited to the perfect information setting. This means that local variables cannot be hidden from other processes, which renders synthesis results cumbersome or even impossible to realize.We resolve this shortcoming by defining AGS under partial information. We analyze the complexity and decidability in different settings, showing that the problem has a high worstcase complexity and is undecidable in many interesting cases. Based on these observations, we present a pragmatic algorithm based on bounded synthesis, and demonstrate its practical applicability on several examples.","lang":"eng"}],"date_created":"2018-12-11T11:54:17Z","volume":9035,"title":"Assume-guarantee synthesis for concurrent reactive programs with partial information","oa_version":"Preprint","author":[{"full_name":"Bloem, Roderick","last_name":"Bloem","first_name":"Roderick"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"last_name":"Jacobs","full_name":"Jacobs, Swen","first_name":"Swen"},{"full_name":"Könighofer, Robert","last_name":"Könighofer","first_name":"Robert"}],"day":"01","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Bloem, R., Chatterjee, K., Jacobs, S., &#38; Könighofer, R. (2015). Assume-guarantee synthesis for concurrent reactive programs with partial information (Vol. 9035, pp. 517–532). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-662-46681-0_50\">https://doi.org/10.1007/978-3-662-46681-0_50</a>","mla":"Bloem, Roderick, et al. <i>Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information</i>. Vol. 9035, Springer, 2015, pp. 517–32, doi:<a href=\"https://doi.org/10.1007/978-3-662-46681-0_50\">10.1007/978-3-662-46681-0_50</a>.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, Swen Jacobs, and Robert Könighofer. “Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information,” 9035:517–32. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-46681-0_50\">https://doi.org/10.1007/978-3-662-46681-0_50</a>.","ista":"Bloem R, Chatterjee K, Jacobs S, Könighofer R. 2015. Assume-guarantee synthesis for concurrent reactive programs with partial information. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 9035, 517–532.","ieee":"R. Bloem, K. Chatterjee, S. Jacobs, and R. Könighofer, “Assume-guarantee synthesis for concurrent reactive programs with partial information,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom, 2015, vol. 9035, pp. 517–532.","short":"R. Bloem, K. Chatterjee, S. Jacobs, R. Könighofer, in:, Springer, 2015, pp. 517–532.","ama":"Bloem R, Chatterjee K, Jacobs S, Könighofer R. Assume-guarantee synthesis for concurrent reactive programs with partial information. In: Vol 9035. Springer; 2015:517-532. doi:<a href=\"https://doi.org/10.1007/978-3-662-46681-0_50\">10.1007/978-3-662-46681-0_50</a>"},"language":[{"iso":"eng"}],"oa":1,"department":[{"_id":"KrCh"}],"month":"01"},{"department":[{"_id":"KrCh"}],"month":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Brázdil, Tomáš, et al. <i>Multigain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives</i>. Vol. 9035, Springer, 2015, pp. 181–87, doi:<a href=\"https://doi.org/10.1007/978-3-662-46681-0_12\">10.1007/978-3-662-46681-0_12</a>.","apa":"Brázdil, T., Chatterjee, K., Forejt, V., &#38; Kučera, A. (2015). Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-662-46681-0_12\">https://doi.org/10.1007/978-3-662-46681-0_12</a>","ista":"Brázdil T, Chatterjee K, Forejt V, Kučera A. 2015. Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. 9035, 181–187.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Multigain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives.” Lecture Notes in Computer Science. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-46681-0_12\">https://doi.org/10.1007/978-3-662-46681-0_12</a>.","short":"T. Brázdil, K. Chatterjee, V. Forejt, A. Kučera, 9035 (2015) 181–187.","ieee":"T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives,” vol. 9035. Springer, pp. 181–187, 2015.","ama":"Brázdil T, Chatterjee K, Forejt V, Kučera A. Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. 2015;9035:181-187. doi:<a href=\"https://doi.org/10.1007/978-3-662-46681-0_12\">10.1007/978-3-662-46681-0_12</a>"},"language":[{"iso":"eng"}],"oa":1,"date_created":"2018-12-11T11:54:18Z","volume":9035,"oa_version":"Preprint","title":"Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives","author":[{"full_name":"Brázdil, Tomáš","last_name":"Brázdil","first_name":"Tomáš"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Forejt, Vojtěch","last_name":"Forejt","first_name":"Vojtěch"},{"last_name":"Kučera","full_name":"Kučera, Antonín","first_name":"Antonín"}],"day":"01","publication_status":"published","abstract":[{"lang":"eng","text":"We present MultiGain, a tool to synthesize strategies for Markov decision processes (MDPs) with multiple mean-payoff objectives. Our models are described in PRISM, and our tool uses the existing interface and simulator of PRISM. Our tool extends PRISM by adding novel algorithms for multiple mean-payoff objectives, and also provides features such as (i) generating strategies and exploring them for simulation, and checking them with respect to other properties; and (ii) generating an approximate Pareto curve for two mean-payoff objectives. In addition, we present a new practical algorithm for the analysis of MDPs with multiple mean-payoff objectives under memoryless strategies."}],"intvolume":"      9035","publist_id":"5263","year":"2015","date_published":"2015-01-01T00:00:00Z","conference":{"start_date":"2015-04-11","end_date":"2015-04-18","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"London, United Kingdom"},"ec_funded":1,"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"status":"public","type":"conference","series_title":"Lecture Notes in Computer Science","date_updated":"2020-01-21T13:18:52Z","_id":"1839","publisher":"Springer","doi":"10.1007/978-3-662-46681-0_12","alternative_title":["LNCS"],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1501.03093"}],"page":"181 - 187"},{"publication_status":"published","publication_identifier":{"issn":["0018-9286"]},"abstract":[{"text":"In this paper, we present a method for reducing a regular, discrete-time Markov chain (DTMC) to another DTMC with a given, typically much smaller number of states. The cost of reduction is defined as the Kullback-Leibler divergence rate between a projection of the original process through a partition function and a DTMC on the correspondingly partitioned state space. Finding the reduced model with minimal cost is computationally expensive, as it requires an exhaustive search among all state space partitions, and an exact evaluation of the reduction cost for each candidate partition. Our approach deals with the latter problem by minimizing an upper bound on the reduction cost instead of minimizing the exact cost. The proposed upper bound is easy to compute and it is tight if the original chain is lumpable with respect to the partition. Then, we express the problem in the form of information bottleneck optimization, and propose using the agglomerative information bottleneck algorithm for searching a suboptimal partition greedily, rather than exhaustively. The theory is illustrated with examples and one application scenario in the context of modeling bio-molecular interactions.","lang":"eng"}],"intvolume":"        60","date_created":"2018-12-11T11:54:18Z","volume":60,"oa_version":"Preprint","title":"Optimal Kullback-Leibler aggregation via information bottleneck","scopus_import":1,"day":"01","author":[{"last_name":"Geiger","full_name":"Geiger, Bernhard","first_name":"Bernhard"},{"first_name":"Tatjana","orcid":"0000-0002-9041-0905","full_name":"Petrov, Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","last_name":"Petrov"},{"first_name":"Gernot","last_name":"Kubin","full_name":"Kubin, Gernot"},{"first_name":"Heinz","last_name":"Koeppl","full_name":"Koeppl, Heinz"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Geiger B, Petrov T, Kubin G, Koeppl H. Optimal Kullback-Leibler aggregation via information bottleneck. <i>IEEE Transactions on Automatic Control</i>. 2015;60(4):1010-1022. doi:<a href=\"https://doi.org/10.1109/TAC.2014.2364971\">10.1109/TAC.2014.2364971</a>","short":"B. Geiger, T. Petrov, G. Kubin, H. Koeppl, IEEE Transactions on Automatic Control 60 (2015) 1010–1022.","ieee":"B. Geiger, T. Petrov, G. Kubin, and H. Koeppl, “Optimal Kullback-Leibler aggregation via information bottleneck,” <i>IEEE Transactions on Automatic Control</i>, vol. 60, no. 4. IEEE, pp. 1010–1022, 2015.","chicago":"Geiger, Bernhard, Tatjana Petrov, Gernot Kubin, and Heinz Koeppl. “Optimal Kullback-Leibler Aggregation via Information Bottleneck.” <i>IEEE Transactions on Automatic Control</i>. IEEE, 2015. <a href=\"https://doi.org/10.1109/TAC.2014.2364971\">https://doi.org/10.1109/TAC.2014.2364971</a>.","ista":"Geiger B, Petrov T, Kubin G, Koeppl H. 2015. Optimal Kullback-Leibler aggregation via information bottleneck. IEEE Transactions on Automatic Control. 60(4), 1010–1022.","mla":"Geiger, Bernhard, et al. “Optimal Kullback-Leibler Aggregation via Information Bottleneck.” <i>IEEE Transactions on Automatic Control</i>, vol. 60, no. 4, IEEE, 2015, pp. 1010–22, doi:<a href=\"https://doi.org/10.1109/TAC.2014.2364971\">10.1109/TAC.2014.2364971</a>.","apa":"Geiger, B., Petrov, T., Kubin, G., &#38; Koeppl, H. (2015). Optimal Kullback-Leibler aggregation via information bottleneck. <i>IEEE Transactions on Automatic Control</i>. IEEE. <a href=\"https://doi.org/10.1109/TAC.2014.2364971\">https://doi.org/10.1109/TAC.2014.2364971</a>"},"issue":"4","language":[{"iso":"eng"}],"oa":1,"department":[{"_id":"CaGu"},{"_id":"ToHe"}],"month":"04","quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1304.6603","open_access":"1"}],"page":"1010 - 1022","type":"journal_article","_id":"1840","date_updated":"2021-01-12T06:53:33Z","publisher":"IEEE","doi":"10.1109/TAC.2014.2364971","date_published":"2015-04-01T00:00:00Z","acknowledgement":"This work was supported by the Austrian Research Association under Project 06/12684, by the Swiss National Science Foundation (SNSF) under Grant PP00P2 128503/1, by the SystemsX.ch (the Swiss Inititative for Systems Biology), and by a SNSF Early Postdoc.Mobility Fellowship grant P2EZP2_148797.\r\n","publication":"IEEE Transactions on Automatic Control","status":"public","publist_id":"5262","year":"2015"},{"publication_status":"published","intvolume":"        37","abstract":[{"lang":"eng","text":"We propose a new family of message passing techniques for MAP estimation in graphical models which we call Sequential Reweighted Message Passing (SRMP). Special cases include well-known techniques such as Min-Sum Diffusion (MSD) and a faster Sequential Tree-Reweighted Message Passing (TRW-S). Importantly, our derivation is simpler than the original derivation of TRW-S, and does not involve a decomposition into trees. This allows easy generalizations. The new family of algorithms can be viewed as a generalization of TRW-S from pairwise to higher-order graphical models. We test SRMP on several real-world problems with promising results."}],"date_created":"2018-12-11T11:54:18Z","volume":37,"oa_version":"Preprint","title":"A new look at reweighted message passing","scopus_import":1,"day":"01","author":[{"first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Kolmogorov V. A new look at reweighted message passing. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2015;37(5):919-930. doi:<a href=\"https://doi.org/10.1109/TPAMI.2014.2363465\">10.1109/TPAMI.2014.2363465</a>","short":"V. Kolmogorov, IEEE Transactions on Pattern Analysis and Machine Intelligence 37 (2015) 919–930.","ieee":"V. Kolmogorov, “A new look at reweighted message passing,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 37, no. 5. IEEE, pp. 919–930, 2015.","chicago":"Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2015. <a href=\"https://doi.org/10.1109/TPAMI.2014.2363465\">https://doi.org/10.1109/TPAMI.2014.2363465</a>.","ista":"Kolmogorov V. 2015. A new look at reweighted message passing. IEEE Transactions on Pattern Analysis and Machine Intelligence. 37(5), 919–930.","mla":"Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 37, no. 5, IEEE, 2015, pp. 919–30, doi:<a href=\"https://doi.org/10.1109/TPAMI.2014.2363465\">10.1109/TPAMI.2014.2363465</a>.","apa":"Kolmogorov, V. (2015). A new look at reweighted message passing. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/TPAMI.2014.2363465\">https://doi.org/10.1109/TPAMI.2014.2363465</a>"},"issue":"5","language":[{"iso":"eng"}],"oa":1,"department":[{"_id":"VlKo"}],"month":"05","quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1309.5655","open_access":"1"}],"page":"919 - 930","type":"journal_article","_id":"1841","date_updated":"2021-01-12T06:53:33Z","publisher":"IEEE","doi":"10.1109/TPAMI.2014.2363465","date_published":"2015-05-01T00:00:00Z","ec_funded":1,"status":"public","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"publist_id":"5261","year":"2015"},{"type":"journal_article","date_updated":"2021-10-08T09:07:34Z","_id":"1845","publisher":"Elsevier","doi":"10.1016/j.neuron.2015.03.006","article_processing_charge":"No","quality_controlled":"1","ddc":["570"],"page":"1149 - 1151","publist_id":"5256","year":"2015","date_published":"2015-03-18T00:00:00Z","publication":"Neuron","status":"public","date_created":"2018-12-11T11:54:19Z","volume":85,"title":"Excitement about inhibitory presynaptic terminals","oa_version":"Published Version","author":[{"last_name":"Vandael","id":"3AE48E0A-F248-11E8-B48F-1D18A9856A87","full_name":"Vandael, David H","first_name":"David H","orcid":"0000-0001-7577-1676"},{"full_name":"Espinoza Martinez, Claudia ","id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","last_name":"Espinoza Martinez","first_name":"Claudia ","orcid":"0000-0003-4710-2082"},{"full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","first_name":"Peter M","orcid":"0000-0001-5001-4804"}],"day":"18","scopus_import":"1","publication_status":"published","file_date_updated":"2020-07-14T12:45:19Z","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"abstract":[{"lang":"eng","text":"Based on extrapolation from excitatory synapses, it is often assumed that depletion of the releasable pool of synaptic vesicles is the main factor underlying depression at inhibitory synapses. In this issue of Neuron, using subcellular patch-clamp recording from inhibitory presynaptic terminals, Kawaguchi and Sakaba (2015) show that at Purkinje cell-deep cerebellar nuclei neuron synapses, changes in presynaptic action potential waveform substantially contribute to synaptic depression. Based on extrapolation from excitatory synapses, it is often assumed that depletion of the releasable pool of synaptic vesicles is the main factor underlying depression at inhibitory synapses. In this issue of Neuron, using subcellular patch-clamp recording from inhibitory presynaptic terminals, Kawaguchi and Sakaba (2015) show that at Purkinje cell-deep cerebellar nuclei neuron synapses, changes in presynaptic action potential waveform substantially contribute to synaptic depression."}],"intvolume":"        85","has_accepted_license":"1","file":[{"creator":"system","date_updated":"2020-07-14T12:45:19Z","file_size":411832,"date_created":"2018-12-12T10:16:07Z","file_id":"5192","content_type":"application/pdf","access_level":"open_access","file_name":"IST-2017-822-v1+1_Perspective_Fig__Final.pdf","checksum":"d1808550e376a0eca2a950fda017cfa6","relation":"main_file"},{"file_id":"5193","date_updated":"2020-07-14T12:45:19Z","creator":"system","file_size":100769,"date_created":"2018-12-12T10:16:07Z","checksum":"a279f4ae61e6c8f33d68f69a0d02097d","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"IST-2017-822-v1+2_Perspective_Final2.pdf"}],"department":[{"_id":"PeJo"}],"month":"03","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","issue":"6","citation":{"ista":"Vandael DH, Espinoza Martinez C, Jonas PM. 2015. Excitement about inhibitory presynaptic terminals. Neuron. 85(6), 1149–1151.","chicago":"Vandael, David H, Claudia  Espinoza Martinez, and Peter M Jonas. “Excitement about Inhibitory Presynaptic Terminals.” <i>Neuron</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.neuron.2015.03.006\">https://doi.org/10.1016/j.neuron.2015.03.006</a>.","mla":"Vandael, David H., et al. “Excitement about Inhibitory Presynaptic Terminals.” <i>Neuron</i>, vol. 85, no. 6, Elsevier, 2015, pp. 1149–51, doi:<a href=\"https://doi.org/10.1016/j.neuron.2015.03.006\">10.1016/j.neuron.2015.03.006</a>.","apa":"Vandael, D. H., Espinoza Martinez, C., &#38; Jonas, P. M. (2015). Excitement about inhibitory presynaptic terminals. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2015.03.006\">https://doi.org/10.1016/j.neuron.2015.03.006</a>","ama":"Vandael DH, Espinoza Martinez C, Jonas PM. Excitement about inhibitory presynaptic terminals. <i>Neuron</i>. 2015;85(6):1149-1151. doi:<a href=\"https://doi.org/10.1016/j.neuron.2015.03.006\">10.1016/j.neuron.2015.03.006</a>","short":"D.H. Vandael, C. Espinoza Martinez, P.M. Jonas, Neuron 85 (2015) 1149–1151.","ieee":"D. H. Vandael, C. Espinoza Martinez, and P. M. Jonas, “Excitement about inhibitory presynaptic terminals,” <i>Neuron</i>, vol. 85, no. 6. Elsevier, pp. 1149–1151, 2015."},"pubrep_id":"822","language":[{"iso":"eng"}],"oa":1},{"publication_status":"published","file_date_updated":"2020-07-14T12:45:19Z","has_accepted_license":"1","intvolume":"        52","abstract":[{"lang":"eng","text":"Modal transition systems (MTS) is a well-studied specification formalism of reactive systems supporting a step-wise refinement methodology. Despite its many advantages, the formalism as well as its currently known extensions are incapable of expressing some practically needed aspects in the refinement process like exclusive, conditional and persistent choices. We introduce a new model called parametric modal transition systems (PMTS) together with a general modal refinement notion that overcomes many of the limitations. We investigate the computational complexity of modal and thorough refinement checking on PMTS and its subclasses and provide a direct encoding of the modal refinement problem into quantified Boolean formulae, allowing us to employ state-of-the-art QBF solvers for modal refinement checking. The experiments we report on show that the feasibility of refinement checking is more influenced by the degree of nondeterminism rather than by the syntactic restrictions on the types of formulae allowed in the description of the PMTS."}],"volume":52,"article_type":"original","date_created":"2018-12-11T11:54:20Z","author":[{"last_name":"Beneš","full_name":"Beneš, Nikola","first_name":"Nikola"},{"orcid":"0000-0002-8122-2881","first_name":"Jan","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan"},{"first_name":"Kim","last_name":"Larsen","full_name":"Larsen, Kim"},{"first_name":"Mikael","full_name":"Möller, Mikael","last_name":"Möller"},{"first_name":"Salomon","last_name":"Sickert","full_name":"Sickert, Salomon"},{"last_name":"Srba","full_name":"Srba, Jiří","first_name":"Jiří"}],"scopus_import":1,"day":"01","oa_version":"Submitted Version","title":"Refinement checking on parametric modal transition systems","issue":"2-3","citation":{"mla":"Beneš, Nikola, et al. “Refinement Checking on Parametric Modal Transition Systems.” <i>Acta Informatica</i>, vol. 52, no. 2–3, Springer, 2015, pp. 269–97, doi:<a href=\"https://doi.org/10.1007/s00236-015-0215-4\">10.1007/s00236-015-0215-4</a>.","apa":"Beneš, N., Kretinsky, J., Larsen, K., Möller, M., Sickert, S., &#38; Srba, J. (2015). Refinement checking on parametric modal transition systems. <i>Acta Informatica</i>. Springer. <a href=\"https://doi.org/10.1007/s00236-015-0215-4\">https://doi.org/10.1007/s00236-015-0215-4</a>","chicago":"Beneš, Nikola, Jan Kretinsky, Kim Larsen, Mikael Möller, Salomon Sickert, and Jiří Srba. “Refinement Checking on Parametric Modal Transition Systems.” <i>Acta Informatica</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s00236-015-0215-4\">https://doi.org/10.1007/s00236-015-0215-4</a>.","ista":"Beneš N, Kretinsky J, Larsen K, Möller M, Sickert S, Srba J. 2015. Refinement checking on parametric modal transition systems. Acta Informatica. 52(2–3), 269–297.","short":"N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, J. Srba, Acta Informatica 52 (2015) 269–297.","ieee":"N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, and J. Srba, “Refinement checking on parametric modal transition systems,” <i>Acta Informatica</i>, vol. 52, no. 2–3. Springer, pp. 269–297, 2015.","ama":"Beneš N, Kretinsky J, Larsen K, Möller M, Sickert S, Srba J. Refinement checking on parametric modal transition systems. <i>Acta Informatica</i>. 2015;52(2-3):269-297. doi:<a href=\"https://doi.org/10.1007/s00236-015-0215-4\">10.1007/s00236-015-0215-4</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"file":[{"file_id":"7854","date_created":"2020-05-15T08:57:44Z","file_size":488482,"creator":"dernst","date_updated":"2020-07-14T12:45:19Z","relation":"main_file","checksum":"fb4037ddc4fc05f33080dd3547ede350","file_name":"2015_ActaInfo_Benes.pdf","access_level":"open_access","content_type":"application/pdf"}],"month":"04","quality_controlled":"1","page":"269 - 297","ddc":["000"],"date_updated":"2021-01-12T06:53:35Z","_id":"1846","type":"journal_article","doi":"10.1007/s00236-015-0215-4","article_processing_charge":"No","publisher":"Springer","ec_funded":1,"date_published":"2015-04-01T00:00:00Z","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"status":"public","publication":"Acta Informatica","publist_id":"5255","year":"2015"},{"quality_controlled":"1","publication_status":"published","page":"356 - 358","intvolume":"         8","volume":8,"_id":"1847","date_updated":"2021-01-12T06:53:35Z","date_created":"2018-12-11T11:54:20Z","type":"journal_article","scopus_import":1,"day":"02","author":[{"first_name":"Peter","id":"399876EC-F248-11E8-B48F-1D18A9856A87","full_name":"Grones, Peter","last_name":"Grones"},{"orcid":"0000-0002-8302-7596","first_name":"Jiřĺ","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiřĺ","last_name":"Friml"}],"doi":"10.1016/j.molp.2014.12.013","oa_version":"None","publisher":"Elsevier","title":"ABP1: Finally docking","citation":{"ama":"Grones P, Friml J. ABP1: Finally docking. <i>Molecular Plant</i>. 2015;8(3):356-358. doi:<a href=\"https://doi.org/10.1016/j.molp.2014.12.013\">10.1016/j.molp.2014.12.013</a>","short":"P. Grones, J. Friml, Molecular Plant 8 (2015) 356–358.","ieee":"P. Grones and J. Friml, “ABP1: Finally docking,” <i>Molecular Plant</i>, vol. 8, no. 3. Elsevier, pp. 356–358, 2015.","ista":"Grones P, Friml J. 2015. ABP1: Finally docking. Molecular Plant. 8(3), 356–358.","chicago":"Grones, Peter, and Jiří Friml. “ABP1: Finally Docking.” <i>Molecular Plant</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.molp.2014.12.013\">https://doi.org/10.1016/j.molp.2014.12.013</a>.","mla":"Grones, Peter, and Jiří Friml. “ABP1: Finally Docking.” <i>Molecular Plant</i>, vol. 8, no. 3, Elsevier, 2015, pp. 356–58, doi:<a href=\"https://doi.org/10.1016/j.molp.2014.12.013\">10.1016/j.molp.2014.12.013</a>.","apa":"Grones, P., &#38; Friml, J. (2015). ABP1: Finally docking. <i>Molecular Plant</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.molp.2014.12.013\">https://doi.org/10.1016/j.molp.2014.12.013</a>"},"issue":"3","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2015-03-02T00:00:00Z","acknowledgement":"This work was supported by the European Research Council (project ERC-2011-StG-20101109-PSDP), European Social Fund (CZ.1.07/2.3.00/20.0043), and the Czech Science Foundation GAČR (GA13-40637S).","status":"public","publication":"Molecular Plant","language":[{"iso":"eng"}],"department":[{"_id":"JiFr"}],"publist_id":"5254","year":"2015","month":"03"},{"year":"2015","month":"09","department":[{"_id":"JiFr"}],"publist_id":"5252","language":[{"iso":"eng"}],"publication":"Biochimica et Biophysica Acta - Molecular Cell Research","status":"public","citation":{"apa":"Himschoot, E., Beeckman, T., Friml, J., &#38; Vanneste, S. (2015). Calcium is an organizer of cell polarity in plants. <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.bbamcr.2015.02.017\">https://doi.org/10.1016/j.bbamcr.2015.02.017</a>","mla":"Himschoot, Ellie, et al. “Calcium Is an Organizer of Cell Polarity in Plants.” <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>, vol. 1853, no. 9, Elsevier, 2015, pp. 2168–72, doi:<a href=\"https://doi.org/10.1016/j.bbamcr.2015.02.017\">10.1016/j.bbamcr.2015.02.017</a>.","ista":"Himschoot E, Beeckman T, Friml J, Vanneste S. 2015. Calcium is an organizer of cell polarity in plants. Biochimica et Biophysica Acta - Molecular Cell Research. 1853(9), 2168–2172.","chicago":"Himschoot, Ellie, Tom Beeckman, Jiří Friml, and Steffen Vanneste. “Calcium Is an Organizer of Cell Polarity in Plants.” <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.bbamcr.2015.02.017\">https://doi.org/10.1016/j.bbamcr.2015.02.017</a>.","ieee":"E. Himschoot, T. Beeckman, J. Friml, and S. Vanneste, “Calcium is an organizer of cell polarity in plants,” <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>, vol. 1853, no. 9. Elsevier, pp. 2168–2172, 2015.","short":"E. Himschoot, T. Beeckman, J. Friml, S. Vanneste, Biochimica et Biophysica Acta - Molecular Cell Research 1853 (2015) 2168–2172.","ama":"Himschoot E, Beeckman T, Friml J, Vanneste S. Calcium is an organizer of cell polarity in plants. <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>. 2015;1853(9):2168-2172. doi:<a href=\"https://doi.org/10.1016/j.bbamcr.2015.02.017\">10.1016/j.bbamcr.2015.02.017</a>"},"issue":"9","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The contributing authors were supported by the Ghent University Special Research Fund (to E.H.), the Interuniversity Attraction Poles Programme (IAP VI/33 and IUAP P7/29 ‘MARS’), the European Research Council (project ERC-2011-StG-20101109-PSDP, to J.F.), and the Research Foundation Flanders (to S.V.).","date_published":"2015-09-01T00:00:00Z","day":"01","scopus_import":1,"author":[{"first_name":"Ellie","last_name":"Himschoot","full_name":"Himschoot, Ellie"},{"first_name":"Tom","full_name":"Beeckman, Tom","last_name":"Beeckman"},{"last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiřĺ","first_name":"Jiřĺ","orcid":"0000-0002-8302-7596"},{"full_name":"Vanneste, Steffen","last_name":"Vanneste","first_name":"Steffen"}],"doi":"10.1016/j.bbamcr.2015.02.017","publisher":"Elsevier","oa_version":"None","title":"Calcium is an organizer of cell polarity in plants","volume":1853,"_id":"1849","date_updated":"2021-01-12T06:53:36Z","date_created":"2018-12-11T11:54:21Z","type":"journal_article","page":"2168 - 2172","intvolume":"      1853","abstract":[{"text":"Cell polarity is a fundamental property of pro- and eukaryotic cells. It is necessary for coordination of cell division, cell morphogenesis and signaling processes. How polarity is generated and maintained is a complex issue governed by interconnected feed-back regulations between small GTPase signaling and membrane tension-based signaling that controls membrane trafficking, and cytoskeleton organization and dynamics. Here, we will review the potential role for calcium as a crucial signal that connects and coordinates the respective processes during polarization processes in plants. This article is part of a Special Issue entitled: 13th European Symposium on Calcium.","lang":"eng"}],"quality_controlled":"1","publication_status":"published"},{"date_created":"2018-12-11T11:54:21Z","volume":372,"title":"Fungal disease dynamics in insect societies: Optimal killing rates and the ambivalent effect of high social interaction rates","oa_version":"Submitted Version","scopus_import":1,"day":"07","author":[{"first_name":"Sebastian","orcid":"0000-0002-2519-824X","full_name":"Novak, Sebastian","id":"461468AE-F248-11E8-B48F-1D18A9856A87","last_name":"Novak"},{"orcid":"0000-0002-2193-3868","first_name":"Sylvia","last_name":"Cremer","full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"}],"file_date_updated":"2020-07-14T12:45:19Z","publication_status":"published","intvolume":"       372","abstract":[{"lang":"eng","text":"Entomopathogenic fungi are potent biocontrol agents that are widely used against insect pests, many of which are social insects. Nevertheless, theoretical investigations of their particular life history are scarce. We develop a model that takes into account the main distinguishing features between traditionally studied diseases and obligate killing pathogens, like the (biocontrol-relevant) insect-pathogenic fungi Metarhizium and Beauveria. First, obligate killing entomopathogenic fungi produce new infectious particles (conidiospores) only after host death and not yet on the living host. Second, the killing rates of entomopathogenic fungi depend strongly on the initial exposure dosage, thus we explicitly consider the pathogen load of individual hosts. Further, we make the model applicable not only to solitary host species, but also to group living species by incorporating social interactions between hosts, like the collective disease defences of insect societies. Our results identify the optimal killing rate for the pathogen that minimises its invasion threshold. Furthermore, we find that the rate of contact between hosts has an ambivalent effect: dense interaction networks between individuals are considered to facilitate disease outbreaks because of increased pathogen transmission. In social insects, this is compensated by their collective disease defences, i.e., social immunity. For the type of pathogens considered here, we show that even without social immunity, high contact rates between live individuals dilute the pathogen in the host colony and hence can reduce individual pathogen loads below disease-causing levels."}],"has_accepted_license":"1","file":[{"file_name":"IST-2015-329-v1+1_manuscript.pdf","access_level":"open_access","content_type":"application/pdf","relation":"main_file","checksum":"3c0dcacc900bc45cc65a453dfda4ca43","file_size":1546914,"date_created":"2018-12-12T10:18:07Z","date_updated":"2020-07-14T12:45:19Z","creator":"system","file_id":"5326"}],"department":[{"_id":"NiBa"},{"_id":"SyCr"}],"month":"05","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Novak S, Cremer S. Fungal disease dynamics in insect societies: Optimal killing rates and the ambivalent effect of high social interaction rates. <i>Journal of Theoretical Biology</i>. 2015;372(5):54-64. doi:<a href=\"https://doi.org/10.1016/j.jtbi.2015.02.018\">10.1016/j.jtbi.2015.02.018</a>","short":"S. Novak, S. Cremer, Journal of Theoretical Biology 372 (2015) 54–64.","ieee":"S. Novak and S. Cremer, “Fungal disease dynamics in insect societies: Optimal killing rates and the ambivalent effect of high social interaction rates,” <i>Journal of Theoretical Biology</i>, vol. 372, no. 5. Elsevier, pp. 54–64, 2015.","ista":"Novak S, Cremer S. 2015. Fungal disease dynamics in insect societies: Optimal killing rates and the ambivalent effect of high social interaction rates. Journal of Theoretical Biology. 372(5), 54–64.","chicago":"Novak, Sebastian, and Sylvia Cremer. “Fungal Disease Dynamics in Insect Societies: Optimal Killing Rates and the Ambivalent Effect of High Social Interaction Rates.” <i>Journal of Theoretical Biology</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.jtbi.2015.02.018\">https://doi.org/10.1016/j.jtbi.2015.02.018</a>.","mla":"Novak, Sebastian, and Sylvia Cremer. “Fungal Disease Dynamics in Insect Societies: Optimal Killing Rates and the Ambivalent Effect of High Social Interaction Rates.” <i>Journal of Theoretical Biology</i>, vol. 372, no. 5, Elsevier, 2015, pp. 54–64, doi:<a href=\"https://doi.org/10.1016/j.jtbi.2015.02.018\">10.1016/j.jtbi.2015.02.018</a>.","apa":"Novak, S., &#38; Cremer, S. (2015). Fungal disease dynamics in insect societies: Optimal killing rates and the ambivalent effect of high social interaction rates. <i>Journal of Theoretical Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jtbi.2015.02.018\">https://doi.org/10.1016/j.jtbi.2015.02.018</a>"},"issue":"5","pubrep_id":"329","language":[{"iso":"eng"}],"oa":1,"type":"journal_article","_id":"1850","date_updated":"2025-05-28T11:42:49Z","publisher":"Elsevier","doi":"10.1016/j.jtbi.2015.02.018","quality_controlled":"1","ddc":["576"],"page":"54 - 64","publist_id":"5251","year":"2015","date_published":"2015-05-07T00:00:00Z","ec_funded":1,"status":"public","publication":"Journal of Theoretical Biology","project":[{"grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425"},{"grant_number":"243071","name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","call_identifier":"FP7","_id":"25DC711C-B435-11E9-9278-68D0E5697425"}]},{"issue":"4","citation":{"ista":"Priklopil T, Kisdi E, Gyllenberg M. 2015. Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating. Evolution. 69(4), 1015–1026.","chicago":"Priklopil, Tadeas, Eva Kisdi, and Mats Gyllenberg. “Evolutionarily Stable Mating Decisions for Sequentially Searching Females and the Stability of Reproductive Isolation by Assortative Mating.” <i>Evolution</i>. Wiley, 2015. <a href=\"https://doi.org/10.1111/evo.12618\">https://doi.org/10.1111/evo.12618</a>.","mla":"Priklopil, Tadeas, et al. “Evolutionarily Stable Mating Decisions for Sequentially Searching Females and the Stability of Reproductive Isolation by Assortative Mating.” <i>Evolution</i>, vol. 69, no. 4, Wiley, 2015, pp. 1015–26, doi:<a href=\"https://doi.org/10.1111/evo.12618\">10.1111/evo.12618</a>.","apa":"Priklopil, T., Kisdi, E., &#38; Gyllenberg, M. (2015). Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating. <i>Evolution</i>. Wiley. <a href=\"https://doi.org/10.1111/evo.12618\">https://doi.org/10.1111/evo.12618</a>","ama":"Priklopil T, Kisdi E, Gyllenberg M. Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating. <i>Evolution</i>. 2015;69(4):1015-1026. doi:<a href=\"https://doi.org/10.1111/evo.12618\">10.1111/evo.12618</a>","short":"T. Priklopil, E. Kisdi, M. Gyllenberg, Evolution 69 (2015) 1015–1026.","ieee":"T. Priklopil, E. Kisdi, and M. Gyllenberg, “Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating,” <i>Evolution</i>, vol. 69, no. 4. Wiley, pp. 1015–1026, 2015."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"NiBa"},{"_id":"KrCh"}],"file":[{"relation":"main_file","checksum":"1e8be0b1d7598a78cd2623d8ee8e7798","file_name":"2015_Evolution_Priklopil.pdf","content_type":"application/pdf","access_level":"open_access","file_id":"7855","date_created":"2020-05-15T09:05:34Z","file_size":967214,"date_updated":"2020-07-14T12:45:19Z","creator":"dernst"}],"month":"02","publication_status":"published","publication_identifier":{"eissn":["1558-5646"],"issn":["0014-3820"]},"file_date_updated":"2020-07-14T12:45:19Z","has_accepted_license":"1","intvolume":"        69","abstract":[{"text":"We consider mating strategies for females who search for males sequentially during a season of limited length. We show that the best strategy rejects a given male type if encountered before a time-threshold but accepts him after. For frequency-independent benefits, we obtain the optimal time-thresholds explicitly for both discrete and continuous distributions of males, and allow for mistakes being made in assessing the correct male type. When the benefits are indirect (genes for the offspring) and the population is under frequency-dependent ecological selection, the benefits depend on the mating strategy of other females as well. This case is particularly relevant to speciation models that seek to explore the stability of reproductive isolation by assortative mating under frequency-dependent ecological selection. We show that the indirect benefits are to be quantified by the reproductive values of couples, and describe how the evolutionarily stable time-thresholds can be found. We conclude with an example based on the Levene model, in which we analyze the evolutionarily stable assortative mating strategies and the strength of reproductive isolation provided by them.","lang":"eng"}],"volume":69,"article_type":"original","date_created":"2018-12-11T11:54:21Z","author":[{"full_name":"Priklopil, Tadeas","id":"3C869AA0-F248-11E8-B48F-1D18A9856A87","last_name":"Priklopil","first_name":"Tadeas"},{"first_name":"Eva","full_name":"Kisdi, Eva","last_name":"Kisdi"},{"first_name":"Mats","last_name":"Gyllenberg","full_name":"Gyllenberg, Mats"}],"day":"09","scopus_import":"1","oa_version":"Submitted Version","title":"Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating","pmid":1,"ec_funded":1,"date_published":"2015-02-09T00:00:00Z","project":[{"call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"status":"public","publication":"Evolution","publist_id":"5249","year":"2015","external_id":{"pmid":["25662095"]},"quality_controlled":"1","page":"1015 - 1026","ddc":["570"],"date_updated":"2022-06-07T10:52:37Z","_id":"1851","type":"journal_article","doi":"10.1111/evo.12618","article_processing_charge":"No","publisher":"Wiley"},{"language":[{"iso":"eng"}],"pubrep_id":"460","oa":1,"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"mla":"Mcmahon, Dino, et al. “A Sting in the Spit: Widespread Cross-Infection of Multiple RNA Viruses across Wild and Managed Bees.” <i>Journal of Animal Ecology</i>, vol. 84, no. 3, Wiley, 2015, pp. 615–24, doi:<a href=\"https://doi.org/10.1111/1365-2656.12345\">10.1111/1365-2656.12345</a>.","apa":"Mcmahon, D., Fürst, M., Caspar, J., Theodorou, P., Brown, M., &#38; Paxton, R. (2015). A sting in the spit: Widespread cross-infection of multiple RNA viruses across wild and managed bees. <i>Journal of Animal Ecology</i>. Wiley. <a href=\"https://doi.org/10.1111/1365-2656.12345\">https://doi.org/10.1111/1365-2656.12345</a>","chicago":"Mcmahon, Dino, Matthias Fürst, Jesicca Caspar, Panagiotis Theodorou, Mark Brown, and Robert Paxton. “A Sting in the Spit: Widespread Cross-Infection of Multiple RNA Viruses across Wild and Managed Bees.” <i>Journal of Animal Ecology</i>. Wiley, 2015. <a href=\"https://doi.org/10.1111/1365-2656.12345\">https://doi.org/10.1111/1365-2656.12345</a>.","ista":"Mcmahon D, Fürst M, Caspar J, Theodorou P, Brown M, Paxton R. 2015. A sting in the spit: Widespread cross-infection of multiple RNA viruses across wild and managed bees. Journal of Animal Ecology. 84(3), 615–624.","short":"D. Mcmahon, M. Fürst, J. Caspar, P. Theodorou, M. Brown, R. Paxton, Journal of Animal Ecology 84 (2015) 615–624.","ieee":"D. Mcmahon, M. Fürst, J. Caspar, P. Theodorou, M. Brown, and R. Paxton, “A sting in the spit: Widespread cross-infection of multiple RNA viruses across wild and managed bees,” <i>Journal of Animal Ecology</i>, vol. 84, no. 3. Wiley, pp. 615–624, 2015.","ama":"Mcmahon D, Fürst M, Caspar J, Theodorou P, Brown M, Paxton R. A sting in the spit: Widespread cross-infection of multiple RNA viruses across wild and managed bees. <i>Journal of Animal Ecology</i>. 2015;84(3):615-624. doi:<a href=\"https://doi.org/10.1111/1365-2656.12345\">10.1111/1365-2656.12345</a>"},"issue":"3","month":"03","file":[{"file_id":"5350","date_created":"2018-12-12T10:18:29Z","file_size":1823045,"date_updated":"2020-07-14T12:45:19Z","creator":"system","relation":"main_file","checksum":"542a0b9b07e78050a81b35f26f0b82da","file_name":"IST-2016-460-v1+1_McMahon_et_al-2015-Journal_of_Animal_Ecology.pdf","content_type":"application/pdf","access_level":"open_access"}],"department":[{"_id":"SyCr"}],"intvolume":"        84","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"abstract":[{"text":"Summary: Declining populations of bee pollinators are a cause of concern, with major repercussions for biodiversity loss and food security. RNA viruses associated with honeybees represent a potential threat to other insect pollinators, but the extent of this threat is poorly understood. This study aims to attain a detailed understanding of the current and ongoing risk of emerging infectious disease (EID) transmission between managed and wild pollinator species across a wide range of RNA viruses. Within a structured large-scale national survey across 26 independent sites, we quantify the prevalence and pathogen loads of multiple RNA viruses in co-occurring managed honeybee (Apis mellifera) and wild bumblebee (Bombus spp.) populations. We then construct models that compare virus prevalence between wild and managed pollinators. Multiple RNA viruses associated with honeybees are widespread in sympatric wild bumblebee populations. Virus prevalence in honeybees is a significant predictor of virus prevalence in bumblebees, but we remain cautious in speculating over the principle direction of pathogen transmission. We demonstrate species-specific differences in prevalence, indicating significant variation in disease susceptibility or tolerance. Pathogen loads within individual bumblebees may be high and in the case of at least one RNA virus, prevalence is higher in wild bumblebees than in managed honeybee populations. Our findings indicate widespread transmission of RNA viruses between managed and wild bee pollinators, pointing to an interconnected network of potential disease pressures within and among pollinator species. In the context of the biodiversity crisis, our study emphasizes the importance of targeting a wide range of pathogens and defining host associations when considering potential drivers of population decline.","lang":"eng"}],"has_accepted_license":"1","file_date_updated":"2020-07-14T12:45:19Z","publication_status":"published","oa_version":"Published Version","title":"A sting in the spit: Widespread cross-infection of multiple RNA viruses across wild and managed bees","day":"03","scopus_import":"1","author":[{"first_name":"Dino","last_name":"Mcmahon","full_name":"Mcmahon, Dino"},{"first_name":"Matthias","orcid":"0000-0002-3712-925X","id":"393B1196-F248-11E8-B48F-1D18A9856A87","full_name":"Fürst, Matthias","last_name":"Fürst"},{"first_name":"Jesicca","full_name":"Caspar, Jesicca","last_name":"Caspar"},{"last_name":"Theodorou","full_name":"Theodorou, Panagiotis","first_name":"Panagiotis"},{"first_name":"Mark","last_name":"Brown","full_name":"Brown, Mark"},{"last_name":"Paxton","full_name":"Paxton, Robert","first_name":"Robert"}],"date_created":"2018-12-11T11:54:23Z","article_type":"original","volume":84,"status":"public","publication":"Journal of Animal Ecology","acknowledgement":"We thank J.R. de Miranda, L. De Smet and D. de Graaf for supplying qRT-PCR and MLPA positive controls, respectively, in the form of plasmids. This work was supported by the Insect Pollinators Initiative (IPI grants BB/1000100/1 and BB/I000151/1). The IPI is funded jointly by the Biotechnology and Biological Sciences Research Council, the Department for Environment, Food and Rural Affairs, the Natural Environment Research Council, The Scottish Government and The Wellcome Trust, under the Living with Environmental Change Partnership.","date_published":"2015-03-03T00:00:00Z","pmid":1,"related_material":{"record":[{"status":"public","relation":"research_data","id":"9720"}]},"external_id":{"pmid":["25646973"]},"year":"2015","publist_id":"5245","ddc":["570"],"page":"615 - 624","quality_controlled":"1","publisher":"Wiley","article_processing_charge":"No","doi":"10.1111/1365-2656.12345","type":"journal_article","_id":"1855","date_updated":"2023-02-23T14:06:09Z"},{"intvolume":"        62","abstract":[{"lang":"eng","text":"The traditional synthesis question given a specification asks for the automatic construction of a system that satisfies the specification, whereas often there exists a preference order among the different systems that satisfy the given specification. Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which assigns to each word a value, such that a system is preferred if it generates a higher expected value. We solve the following optimal synthesis problem: given an omega-regular specification, a Markov chain that describes the distribution of inputs, and a weighted automaton that measures how well a system satisfies the given specification under the input assumption, synthesize a system that optimizes the measured value. For safety specifications and quantitative measures that are defined by mean-payoff automata, the optimal synthesis problem reduces to finding a strategy in a Markov decision process (MDP) that is optimal for a long-run average reward objective, which can be achieved in polynomial time. For general omega-regular specifications along with mean-payoff automata, the solution rests on a new, polynomial-time algorithm for computing optimal strategies in MDPs with mean-payoff parity objectives. Our algorithm constructs optimal strategies that consist of two memoryless strategies and a counter. The counter is in general not bounded. To obtain a finite-state system, we show how to construct an ε-optimal strategy with a bounded counter, for all ε &gt; 0. Furthermore, we show how to decide in polynomial time if it is possible to construct an optimal finite-state system (i.e., a system without a counter) for a given specification. We have implemented our approach and the underlying algorithms in a tool that takes qualitative and quantitative specifications and automatically constructs a system that satisfies the qualitative specification and optimizes the quantitative specification, if such a system exists. We present some experimental results showing optimal systems that were automatically generated in this way."}],"publication_status":"published","oa_version":"Preprint","title":"Measuring and synthesizing systems in probabilistic environments","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"full_name":"Jobstmann, Barbara","last_name":"Jobstmann","first_name":"Barbara"},{"full_name":"Singh, Rohit","last_name":"Singh","first_name":"Rohit"}],"scopus_import":1,"day":"01","date_created":"2018-12-11T11:54:23Z","volume":62,"language":[{"iso":"eng"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"1","citation":{"short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, Journal of the ACM 62 (2015).","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” <i>Journal of the ACM</i>, vol. 62, no. 1. ACM, 2015.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. Measuring and synthesizing systems in probabilistic environments. <i>Journal of the ACM</i>. 2015;62(1). doi:<a href=\"https://doi.org/10.1145/2699430\">10.1145/2699430</a>","mla":"Chatterjee, Krishnendu, et al. “Measuring and Synthesizing Systems in Probabilistic Environments.” <i>Journal of the ACM</i>, vol. 62, no. 1, 9, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2699430\">10.1145/2699430</a>.","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., &#38; Singh, R. (2015). Measuring and synthesizing systems in probabilistic environments. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2699430\">https://doi.org/10.1145/2699430</a>","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2015. Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. 62(1), 9.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments.” <i>Journal of the ACM</i>. ACM, 2015. <a href=\"https://doi.org/10.1145/2699430\">https://doi.org/10.1145/2699430</a>."},"month":"02","article_number":"9","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1004.0739"}],"publisher":"ACM","doi":"10.1145/2699430","type":"journal_article","date_updated":"2023-02-23T11:46:04Z","_id":"1856","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"status":"public","publication":"Journal of the ACM","date_published":"2015-02-01T00:00:00Z","ec_funded":1,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3864"}]},"year":"2015","publist_id":"5244"},{"year":"2015","month":"06","department":[{"_id":"ChLa"}],"publist_id":"5243","oa":1,"language":[{"iso":"eng"}],"status":"public","citation":{"ama":"Pentina A, Sharmanska V, Lampert C. Curriculum learning of multiple tasks. In: IEEE; 2015:5492-5500. doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7299188\">10.1109/CVPR.2015.7299188</a>","ieee":"A. Pentina, V. Sharmanska, and C. Lampert, “Curriculum learning of multiple tasks,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States, 2015, pp. 5492–5500.","short":"A. Pentina, V. Sharmanska, C. Lampert, in:, IEEE, 2015, pp. 5492–5500.","chicago":"Pentina, Anastasia, Viktoriia Sharmanska, and Christoph Lampert. “Curriculum Learning of Multiple Tasks,” 5492–5500. IEEE, 2015. <a href=\"https://doi.org/10.1109/CVPR.2015.7299188\">https://doi.org/10.1109/CVPR.2015.7299188</a>.","ista":"Pentina A, Sharmanska V, Lampert C. 2015. Curriculum learning of multiple tasks. CVPR: Computer Vision and Pattern Recognition, 5492–5500.","apa":"Pentina, A., Sharmanska, V., &#38; Lampert, C. (2015). Curriculum learning of multiple tasks (pp. 5492–5500). Presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2015.7299188\">https://doi.org/10.1109/CVPR.2015.7299188</a>","mla":"Pentina, Anastasia, et al. <i>Curriculum Learning of Multiple Tasks</i>. IEEE, 2015, pp. 5492–500, doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7299188\">10.1109/CVPR.2015.7299188</a>."},"conference":{"start_date":"2015-06-07","end_date":"2015-06-12","name":"CVPR: Computer Vision and Pattern Recognition","location":"Boston, MA, United States"},"date_published":"2015-06-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1109/CVPR.2015.7299188","author":[{"last_name":"Pentina","full_name":"Pentina, Anastasia","id":"42E87FC6-F248-11E8-B48F-1D18A9856A87","first_name":"Anastasia"},{"full_name":"Sharmanska, Viktoriia","id":"2EA6D09E-F248-11E8-B48F-1D18A9856A87","last_name":"Sharmanska","first_name":"Viktoriia","orcid":"0000-0003-0192-9308"},{"last_name":"Lampert","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0001-8622-7887"}],"scopus_import":1,"day":"01","title":"Curriculum learning of multiple tasks","oa_version":"Preprint","publisher":"IEEE","date_updated":"2023-02-23T10:17:31Z","_id":"1857","type":"conference","date_created":"2018-12-11T11:54:23Z","page":"5492 - 5500","abstract":[{"lang":"eng","text":"Sharing information between multiple tasks enables algorithms to achieve good generalization performance even from small amounts of training data. However, in a realistic scenario of multi-task learning not all tasks are equally related to each other, hence it could be advantageous to transfer information only between the most related tasks. In this work we propose an approach that processes multiple tasks in a sequence with sharing between subsequent tasks instead of solving all tasks jointly. Subsequently, we address the question of curriculum learning of tasks, i.e. finding the best order of tasks to be learned. Our approach is based on a generalization bound criterion for choosing the task order that optimizes the average expected classification performance over all tasks. Our experimental results show that learning multiple related tasks sequentially can be more effective than learning them jointly, the order in which tasks are being solved affects the overall performance, and that our model is able to automatically discover the favourable order of tasks. "}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1412.1353"}],"publication_status":"published","quality_controlled":"1"},{"author":[{"last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","first_name":"Christoph","orcid":"0000-0001-8622-7887"}],"doi":"10.1109/CVPR.2015.7298696","day":"15","scopus_import":1,"publisher":"IEEE","oa_version":"Preprint","title":"Predicting the future behavior of a time-varying probability distribution","date_updated":"2021-01-12T06:53:40Z","_id":"1858","type":"conference","date_created":"2018-12-11T11:54:24Z","page":"942 - 950","abstract":[{"text":"We study the problem of predicting the future, though only in the probabilistic sense of estimating a future state of a time-varying probability distribution. This is not only an interesting academic problem, but solving this extrapolation problem also has many practical application, e.g. for training classifiers that have to operate under time-varying conditions. Our main contribution is a method for predicting the next step of the time-varying distribution from a given sequence of sample sets from earlier time steps. For this we rely on two recent machine learning techniques: embedding probability distributions into a reproducing kernel Hilbert space, and learning operators by vector-valued regression. We illustrate the working principles and the practical usefulness of our method by experiments on synthetic and real data. We also highlight an exemplary application: training a classifier in a domain adaptation setting without having access to examples from the test time distribution at training time.","lang":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1406.5362","open_access":"1"}],"quality_controlled":"1","publication_status":"published","year":"2015","external_id":{"arxiv":["1406.5362"]},"arxiv":1,"month":"10","department":[{"_id":"ChLa"}],"publist_id":"5241","oa":1,"language":[{"iso":"eng"}],"status":"public","citation":{"chicago":"Lampert, Christoph. “Predicting the Future Behavior of a Time-Varying Probability Distribution,” 942–50. IEEE, 2015. <a href=\"https://doi.org/10.1109/CVPR.2015.7298696\">https://doi.org/10.1109/CVPR.2015.7298696</a>.","ista":"Lampert C. 2015. Predicting the future behavior of a time-varying probability distribution. CVPR: Computer Vision and Pattern Recognition, 942–950.","apa":"Lampert, C. (2015). Predicting the future behavior of a time-varying probability distribution (pp. 942–950). Presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2015.7298696\">https://doi.org/10.1109/CVPR.2015.7298696</a>","mla":"Lampert, Christoph. <i>Predicting the Future Behavior of a Time-Varying Probability Distribution</i>. IEEE, 2015, pp. 942–50, doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7298696\">10.1109/CVPR.2015.7298696</a>.","ama":"Lampert C. Predicting the future behavior of a time-varying probability distribution. In: IEEE; 2015:942-950. doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7298696\">10.1109/CVPR.2015.7298696</a>","ieee":"C. Lampert, “Predicting the future behavior of a time-varying probability distribution,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States, 2015, pp. 942–950.","short":"C. Lampert, in:, IEEE, 2015, pp. 942–950."},"date_published":"2015-10-15T00:00:00Z","conference":{"name":"CVPR: Computer Vision and Pattern Recognition","start_date":"2015-06-07","end_date":"2015-06-12","location":"Boston, MA, United States"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"}]