[{"arxiv":1,"article_processing_charge":"No","title":"The complexity of multi-mean-payoff and multi-energy games","oa_version":"Preprint","date_created":"2018-12-11T11:53:32Z","publication_status":"published","issue":"4","page":"177 - 196","abstract":[{"text":"In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always nonnegative. Multi-mean-payoff and multi-energy games replace individual weights by tuples, and the limit average (resp., running sum) of each coordinate must be (resp., remain) nonnegative. We prove finite-memory determinacy of multi-energy games and show inter-reducibility of multi-mean-payoff and multi-energy games for finite-memory strategies. We improve the computational complexity for solving both classes with finite-memory strategies: we prove coNP-completeness improving the previous known EXPSPACE bound. For memoryless strategies, we show that deciding the existence of a winning strategy for the protagonist is NP-complete. We present the first solution of multi-mean-payoff games with infinite-memory strategies: we show that mean-payoff-sup objectives can be decided in NP∩coNP, whereas mean-payoff-inf objectives are coNP-complete.","lang":"eng"}],"external_id":{"arxiv":["1209.3234"],"isi":["000353352800008"]},"isi":1,"publisher":"Elsevier","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"corr_author":"1","author":[{"first_name":"Yaron","last_name":"Velner","full_name":"Velner, Yaron"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rabinovich","first_name":"Alexander","full_name":"Rabinovich, Alexander"},{"last_name":"Raskin","first_name":"Jean","full_name":"Raskin, Jean"}],"project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"scopus_import":"1","oa":1,"status":"public","day":"01","main_file_link":[{"url":"http://arxiv.org/abs/1209.3234","open_access":"1"}],"date_published":"2015-04-01T00:00:00Z","doi":"10.1016/j.ic.2015.03.001","publication":"Information and Computation","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 and S11402-N23 (RiSE), ERC Start grant (279307: Graph Games), Microsoft faculty fellows award, the ERC Advanced Grant QUAREM (267989: Quantitative Reactive Modeling), European project Cassting (FP7-601148), ERC Start grant (279499: inVEST).","intvolume":"       241","quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","citation":{"short":"Y. Velner, K. Chatterjee, L. Doyen, T.A. Henzinger, A. Rabinovich, J. Raskin, Information and Computation 241 (2015) 177–196.","ama":"Velner Y, Chatterjee K, Doyen L, Henzinger TA, Rabinovich A, Raskin J. The complexity of multi-mean-payoff and multi-energy games. <i>Information and Computation</i>. 2015;241(4):177-196. doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.001\">10.1016/j.ic.2015.03.001</a>","mla":"Velner, Yaron, et al. “The Complexity of Multi-Mean-Payoff and Multi-Energy Games.” <i>Information and Computation</i>, vol. 241, no. 4, Elsevier, 2015, pp. 177–96, doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.001\">10.1016/j.ic.2015.03.001</a>.","chicago":"Velner, Yaron, Krishnendu Chatterjee, Laurent Doyen, Thomas A Henzinger, Alexander Rabinovich, and Jean Raskin. “The Complexity of Multi-Mean-Payoff and Multi-Energy Games.” <i>Information and Computation</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ic.2015.03.001\">https://doi.org/10.1016/j.ic.2015.03.001</a>.","ieee":"Y. Velner, K. Chatterjee, L. Doyen, T. A. Henzinger, A. Rabinovich, and J. Raskin, “The complexity of multi-mean-payoff and multi-energy games,” <i>Information and Computation</i>, vol. 241, no. 4. Elsevier, pp. 177–196, 2015.","ista":"Velner Y, Chatterjee K, Doyen L, Henzinger TA, Rabinovich A, Raskin J. 2015. The complexity of multi-mean-payoff and multi-energy games. Information and Computation. 241(4), 177–196.","apa":"Velner, Y., Chatterjee, K., Doyen, L., Henzinger, T. A., Rabinovich, A., &#38; Raskin, J. (2015). The complexity of multi-mean-payoff and multi-energy games. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2015.03.001\">https://doi.org/10.1016/j.ic.2015.03.001</a>"},"volume":241,"ec_funded":1,"month":"04","publist_id":"5443","year":"2015","date_updated":"2025-09-23T13:47:20Z","_id":"1698","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"day":"01","date_published":"2015-06-01T00:00:00Z","doi":"10.1007/s00285-014-0802-y","intvolume":"        70","publication":"Journal of Mathematical Biology","acknowledgement":"This work was made possible with financial support by the Vienna Science and Technology Fund (WWTF), by the Deutsche Forschungsgemeinschaft (DFG), Research Unit 1078 Natural selection in structured populations, by the Austrian Science Fund (FWF) via funding for the Vienna Graduate School for Population Genetics, and by a “For Women in Science” fellowship (L’Oréal Österreich in cooperation with the Austrian Commission for UNESCO and the Austrian Academy of Sciences with financial support from the Federal Ministry for Science and Research Austria).","language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","citation":{"ieee":"H. Uecker, D. Setter, and J. Hermisson, “Adaptive gene introgression after secondary contact,” <i>Journal of Mathematical Biology</i>, vol. 70, no. 7. Springer, pp. 1523–1580, 2015.","chicago":"Uecker, Hildegard, Derek Setter, and Joachim Hermisson. “Adaptive Gene Introgression after Secondary Contact.” <i>Journal of Mathematical Biology</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s00285-014-0802-y\">https://doi.org/10.1007/s00285-014-0802-y</a>.","mla":"Uecker, Hildegard, et al. “Adaptive Gene Introgression after Secondary Contact.” <i>Journal of Mathematical Biology</i>, vol. 70, no. 7, Springer, 2015, pp. 1523–80, doi:<a href=\"https://doi.org/10.1007/s00285-014-0802-y\">10.1007/s00285-014-0802-y</a>.","short":"H. Uecker, D. Setter, J. Hermisson, Journal of Mathematical Biology 70 (2015) 1523–1580.","ama":"Uecker H, Setter D, Hermisson J. Adaptive gene introgression after secondary contact. <i>Journal of Mathematical Biology</i>. 2015;70(7):1523-1580. doi:<a href=\"https://doi.org/10.1007/s00285-014-0802-y\">10.1007/s00285-014-0802-y</a>","apa":"Uecker, H., Setter, D., &#38; Hermisson, J. (2015). Adaptive gene introgression after secondary contact. <i>Journal of Mathematical Biology</i>. Springer. <a href=\"https://doi.org/10.1007/s00285-014-0802-y\">https://doi.org/10.1007/s00285-014-0802-y</a>","ista":"Uecker H, Setter D, Hermisson J. 2015. Adaptive gene introgression after secondary contact. Journal of Mathematical Biology. 70(7), 1523–1580."},"ddc":["576"],"volume":70,"publist_id":"5442","month":"06","year":"2015","date_updated":"2025-09-23T07:31:45Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"1699","title":"Adaptive gene introgression after secondary contact","article_processing_charge":"No","pubrep_id":"458","oa_version":"Published Version","publication_status":"published","date_created":"2018-12-11T11:53:32Z","issue":"7","file_date_updated":"2020-07-14T12:45:12Z","external_id":{"isi":["000354196800003"]},"abstract":[{"lang":"eng","text":"By hybridization and backcrossing, alleles can surmount species boundaries and be incorporated into the genome of a related species. This introgression of genes is of particular evolutionary relevance if it involves the transfer of adaptations between populations. However, any beneficial allele will typically be associated with other alien alleles that are often deleterious and hamper the introgression process. In order to describe the introgression of an adaptive allele, we set up a stochastic model with an explicit genetic makeup of linked and unlinked deleterious alleles. Based on the theory of reducible multitype branching processes, we derive a recursive expression for the establishment probability of the beneficial allele after a single hybridization event. We furthermore study the probability that slightly deleterious alleles hitchhike to fixation. The key to the analysis is a split of the process into a stochastic phase in which the advantageous alleles establishes and a deterministic phase in which it sweeps to fixation. We thereafter apply the theory to a set of biologically relevant scenarios such as introgression in the presence of many unlinked or few closely linked deleterious alleles. A comparison to computer simulations shows that the approximations work well over a large parameter range."}],"page":"1523 - 1580","file":[{"date_updated":"2020-07-14T12:45:12Z","file_id":"5079","file_size":1321527,"creator":"system","content_type":"application/pdf","file_name":"IST-2016-458-v1+1_s00285-014-0802-y.pdf","relation":"main_file","date_created":"2018-12-12T10:14:27Z","access_level":"open_access","checksum":"00e3a67bda05d4cc165b3a48b41ef9ad"}],"isi":1,"department":[{"_id":"NiBa"}],"publisher":"Springer","project":[{"name":"Evolutionary rescue","_id":"25B67606-B435-11E9-9278-68D0E5697425"}],"corr_author":"1","author":[{"full_name":"Uecker, Hildegard","orcid":"0000-0001-9435-2813","id":"2DB8F68A-F248-11E8-B48F-1D18A9856A87","first_name":"Hildegard","last_name":"Uecker"},{"first_name":"Derek","last_name":"Setter","full_name":"Setter, Derek"},{"full_name":"Hermisson, Joachim","last_name":"Hermisson","first_name":"Joachim"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa":1,"scopus_import":"1","has_accepted_license":"1","status":"public"},{"scopus_import":"1","oa":1,"status":"public","isi":1,"publisher":"American Physical Society","department":[{"_id":"MiLe"}],"corr_author":"1","author":[{"full_name":"Van Loon, Erik","first_name":"Erik","last_name":"Van Loon"},{"first_name":"Mikhail","last_name":"Katsnelson","full_name":"Katsnelson, Mikhail"},{"orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","last_name":"Lemeshko","first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"text":"We use the dual boson approach to reveal the phase diagram of the Fermi-Hubbard model with long-range dipole-dipole interactions. By using a large-scale finite-temperature calculation on a 64×64 square lattice we demonstrate the existence of a novel phase, possessing an &quot;ultralong-range&quot; order. The fingerprint of this phase - the density correlation function - features a nontrivial behavior on a scale of tens of lattice sites. We study the properties and the stability of the ultralong-range-ordered phase, and show that it is accessible in modern experiments with ultracold polar molecules and magnetic atoms.","lang":"eng"}],"external_id":{"isi":["000359344700002"],"arxiv":["1506.06007"]},"arxiv":1,"article_processing_charge":"No","title":"Ultralong-range order in the Fermi-Hubbard model with long-range interactions","oa_version":"Preprint","date_created":"2018-12-11T11:53:32Z","publication_status":"published","issue":"8","year":"2015","date_updated":"2025-09-29T10:59:26Z","_id":"1700","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"08","publist_id":"5441","acknowledgement":"The work is supported by European Research Council (ERC) Advanced Grant No. 338957 FEMTO/NANO.","publication":"Physical Review B","intvolume":"        92","language":[{"iso":"eng"}],"type":"journal_article","citation":{"apa":"Van Loon, E., Katsnelson, M., &#38; Lemeshko, M. (2015). Ultralong-range order in the Fermi-Hubbard model with long-range interactions. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.92.081106\">https://doi.org/10.1103/PhysRevB.92.081106</a>","ista":"Van Loon E, Katsnelson M, Lemeshko M. 2015. Ultralong-range order in the Fermi-Hubbard model with long-range interactions. Physical Review B. 92(8), 081106.","ieee":"E. Van Loon, M. Katsnelson, and M. Lemeshko, “Ultralong-range order in the Fermi-Hubbard model with long-range interactions,” <i>Physical Review B</i>, vol. 92, no. 8. American Physical Society, 2015.","short":"E. Van Loon, M. Katsnelson, M. Lemeshko, Physical Review B 92 (2015).","ama":"Van Loon E, Katsnelson M, Lemeshko M. Ultralong-range order in the Fermi-Hubbard model with long-range interactions. <i>Physical Review B</i>. 2015;92(8). doi:<a href=\"https://doi.org/10.1103/PhysRevB.92.081106\">10.1103/PhysRevB.92.081106</a>","chicago":"Van Loon, Erik, Mikhail Katsnelson, and Mikhail Lemeshko. “Ultralong-Range Order in the Fermi-Hubbard Model with Long-Range Interactions.” <i>Physical Review B</i>. American Physical Society, 2015. <a href=\"https://doi.org/10.1103/PhysRevB.92.081106\">https://doi.org/10.1103/PhysRevB.92.081106</a>.","mla":"Van Loon, Erik, et al. “Ultralong-Range Order in the Fermi-Hubbard Model with Long-Range Interactions.” <i>Physical Review B</i>, vol. 92, no. 8, 081106, American Physical Society, 2015, doi:<a href=\"https://doi.org/10.1103/PhysRevB.92.081106\">10.1103/PhysRevB.92.081106</a>."},"volume":92,"day":"10","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1506.06007"}],"date_published":"2015-08-10T00:00:00Z","article_number":"081106","doi":"10.1103/PhysRevB.92.081106"},{"language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"       112","publication":"PNAS","acknowledgement":"Research was supported in part by National Science Foundation Grants PHY-1305525, PHY-1451171, and CCF-0939370, by National Institutes of Health Grant R01 EY14196, and by Austrian Science Foundation Grant FWF P25651. Additional support was provided by the\r\nFannie and John Hertz Foundation, by the Swartz Foundation, by the W. M. Keck Foundation, and by the Simons Foundation.","volume":112,"type":"journal_article","citation":{"ieee":"G. Tkačik <i>et al.</i>, “Thermodynamics and signatures of criticality in a network of neurons,” <i>PNAS</i>, vol. 112, no. 37. National Academy of Sciences, pp. 11508–11513, 2015.","mla":"Tkačik, Gašper, et al. “Thermodynamics and Signatures of Criticality in a Network of Neurons.” <i>PNAS</i>, vol. 112, no. 37, National Academy of Sciences, 2015, pp. 11508–13, doi:<a href=\"https://doi.org/10.1073/pnas.1514188112\">10.1073/pnas.1514188112</a>.","chicago":"Tkačik, Gašper, Thierry Mora, Olivier Marre, Dario Amodei, Stephanie Palmer, Michael Berry Ii, and William Bialek. “Thermodynamics and Signatures of Criticality in a Network of Neurons.” <i>PNAS</i>. National Academy of Sciences, 2015. <a href=\"https://doi.org/10.1073/pnas.1514188112\">https://doi.org/10.1073/pnas.1514188112</a>.","ama":"Tkačik G, Mora T, Marre O, et al. Thermodynamics and signatures of criticality in a network of neurons. <i>PNAS</i>. 2015;112(37):11508-11513. doi:<a href=\"https://doi.org/10.1073/pnas.1514188112\">10.1073/pnas.1514188112</a>","short":"G. Tkačik, T. Mora, O. Marre, D. Amodei, S. Palmer, M. Berry Ii, W. Bialek, PNAS 112 (2015) 11508–11513.","apa":"Tkačik, G., Mora, T., Marre, O., Amodei, D., Palmer, S., Berry Ii, M., &#38; Bialek, W. (2015). Thermodynamics and signatures of criticality in a network of neurons. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1514188112\">https://doi.org/10.1073/pnas.1514188112</a>","ista":"Tkačik G, Mora T, Marre O, Amodei D, Palmer S, Berry Ii M, Bialek W. 2015. Thermodynamics and signatures of criticality in a network of neurons. PNAS. 112(37), 11508–11513."},"date_published":"2015-09-15T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4577210/"}],"day":"15","doi":"10.1073/pnas.1514188112","year":"2015","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"1701","date_updated":"2025-09-23T14:54:27Z","publist_id":"5440","month":"09","pmid":1,"abstract":[{"text":"The activity of a neural network is defined by patterns of spiking and silence from the individual neurons. Because spikes are (relatively) sparse, patterns of activity with increasing numbers of spikes are less probable, but, with more spikes, the number of possible patterns increases. This tradeoff between probability and numerosity is mathematically equivalent to the relationship between entropy and energy in statistical physics. We construct this relationship for populations of up to N = 160 neurons in a small patch of the vertebrate retina, using a combination of direct and model-based analyses of experiments on the response of this network to naturalistic movies. We see signs of a thermodynamic limit, where the entropy per neuron approaches a smooth function of the energy per neuron as N increases. The form of this function corresponds to the distribution of activity being poised near an unusual kind of critical point. We suggest further tests of criticality, and give a brief discussion of its functional significance. ","lang":"eng"}],"external_id":{"pmid":["26330611"],"isi":["000361393700038"]},"page":"11508 - 11513","publication_status":"published","oa_version":"Submitted Version","date_created":"2018-12-11T11:53:33Z","article_processing_charge":"No","title":"Thermodynamics and signatures of criticality in a network of neurons","issue":"37","oa":1,"scopus_import":"1","status":"public","department":[{"_id":"GaTk"}],"publisher":"National Academy of Sciences","isi":1,"project":[{"_id":"254D1A94-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 25651-N26","name":"Sensitivity to higher-order statistics in natural scenes"}],"author":[{"last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gasper","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper"},{"first_name":"Thierry","last_name":"Mora","full_name":"Mora, Thierry"},{"full_name":"Marre, Olivier","first_name":"Olivier","last_name":"Marre"},{"last_name":"Amodei","first_name":"Dario","full_name":"Amodei, Dario"},{"first_name":"Stephanie","last_name":"Palmer","full_name":"Palmer, Stephanie"},{"first_name":"Michael","last_name":"Berry Ii","full_name":"Berry Ii, Michael"},{"last_name":"Bialek","first_name":"William","full_name":"Bialek, William"}]},{"status":"public","scopus_import":"1","author":[{"last_name":"Broadhurst","first_name":"Linda","full_name":"Broadhurst, Linda"},{"last_name":"Fifield","first_name":"Graham","full_name":"Fifield, Graham"},{"first_name":"Bindi","last_name":"Vanzella","full_name":"Vanzella, Bindi"},{"last_name":"Pickup","id":"2C78037E-F248-11E8-B48F-1D18A9856A87","first_name":"Melinda","orcid":"0000-0001-6118-0541","full_name":"Pickup, Melinda"}],"isi":1,"department":[{"_id":"NiBa"}],"publisher":"CSIRO","page":"455 - 466","abstract":[{"text":"Vegetation clearing and land-use change have depleted many natural plant communities to the point where restoration is required. A major impediment to the success of rebuilding complex vegetation communities is having regular access to sufficient quantities of high-quality seed. Seed-production areas (SPAs) can help generate this seed, but these must be underpinned by a broad genetic base to maximise the evolutionary potential of restored populations. However, genetic bottlenecks can occur at the collection, establishment and production stages in SPAs, requiring genetic evaluation. This is especially relevant for species that may take many years before a return on SPA investment is realised. Two recently established yellow box (Eucalyptus melliodora A.Cunn. ex Schauer, Myrtaceae) SPAs were evaluated to determine whether genetic bottlenecks had occurred between seed collection and SPA establishment. No evidence was found to suggest that a significant loss of genetic diversity had occurred at this stage, although there was a significant difference in diversity between the two SPAs. Complex population genetic structure was also observed in the seed used to source the SPAs, with up to eight groups identified. Plant survival in the SPAs was influenced by seed collection location but not by SPA location and was not associated with genetic diversity. There were also no associations between genetic diversity and plant growth. These data highlighted the importance of chance events when establishing SPAs and indicated that the two yellow box SPAs are likely to provide genetically diverse seed sources for future restoration projects, especially by pooling seed from both SPAs.","lang":"eng"}],"external_id":{"isi":["000363276500009"]},"issue":"5","article_processing_charge":"No","title":"An evaluation of the genetic structure of seed sources and the maintenance of genetic diversity during establishment of two yellow box (Eucalyptus melliodora) seed-production areas","oa_version":"None","date_created":"2018-12-11T11:53:34Z","publication_status":"published","date_updated":"2025-09-23T07:51:07Z","_id":"1703","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2015","publist_id":"5434","month":"05","citation":{"apa":"Broadhurst, L., Fifield, G., Vanzella, B., &#38; Pickup, M. (2015). An evaluation of the genetic structure of seed sources and the maintenance of genetic diversity during establishment of two yellow box (Eucalyptus melliodora) seed-production areas. <i>Australian Journal of Botany</i>. CSIRO. <a href=\"https://doi.org/10.1071/BT15023\">https://doi.org/10.1071/BT15023</a>","ista":"Broadhurst L, Fifield G, Vanzella B, Pickup M. 2015. An evaluation of the genetic structure of seed sources and the maintenance of genetic diversity during establishment of two yellow box (Eucalyptus melliodora) seed-production areas. Australian Journal of Botany. 63(5), 455–466.","ieee":"L. Broadhurst, G. Fifield, B. Vanzella, and M. Pickup, “An evaluation of the genetic structure of seed sources and the maintenance of genetic diversity during establishment of two yellow box (Eucalyptus melliodora) seed-production areas,” <i>Australian Journal of Botany</i>, vol. 63, no. 5. CSIRO, pp. 455–466, 2015.","chicago":"Broadhurst, Linda, Graham Fifield, Bindi Vanzella, and Melinda Pickup. “An Evaluation of the Genetic Structure of Seed Sources and the Maintenance of Genetic Diversity during Establishment of Two Yellow Box (Eucalyptus Melliodora) Seed-Production Areas.” <i>Australian Journal of Botany</i>. CSIRO, 2015. <a href=\"https://doi.org/10.1071/BT15023\">https://doi.org/10.1071/BT15023</a>.","mla":"Broadhurst, Linda, et al. “An Evaluation of the Genetic Structure of Seed Sources and the Maintenance of Genetic Diversity during Establishment of Two Yellow Box (Eucalyptus Melliodora) Seed-Production Areas.” <i>Australian Journal of Botany</i>, vol. 63, no. 5, CSIRO, 2015, pp. 455–66, doi:<a href=\"https://doi.org/10.1071/BT15023\">10.1071/BT15023</a>.","short":"L. Broadhurst, G. Fifield, B. Vanzella, M. Pickup, Australian Journal of Botany 63 (2015) 455–466.","ama":"Broadhurst L, Fifield G, Vanzella B, Pickup M. An evaluation of the genetic structure of seed sources and the maintenance of genetic diversity during establishment of two yellow box (Eucalyptus melliodora) seed-production areas. <i>Australian Journal of Botany</i>. 2015;63(5):455-466. doi:<a href=\"https://doi.org/10.1071/BT15023\">10.1071/BT15023</a>"},"type":"journal_article","volume":63,"publication":"Australian Journal of Botany","intvolume":"        63","quality_controlled":"1","language":[{"iso":"eng"}],"doi":"10.1071/BT15023","day":"26","date_published":"2015-05-26T00:00:00Z"},{"file_date_updated":"2020-07-14T12:45:13Z","abstract":[{"lang":"eng","text":"Given a convex function (Formula presented.) and two hermitian matrices A and B, Lewin and Sabin study in (Lett Math Phys 104:691–705, 2014) the relative entropy defined by (Formula presented.). Among other things, they prove that the so-defined quantity is monotone if and only if (Formula presented.) is operator monotone. The monotonicity is then used to properly define (Formula presented.) for bounded self-adjoint operators acting on an infinite-dimensional Hilbert space by a limiting procedure. More precisely, for an increasing sequence of finite-dimensional projections (Formula presented.) with (Formula presented.) strongly, the limit (Formula presented.) is shown to exist and to be independent of the sequence of projections (Formula presented.). The question whether this sequence converges to its &quot;obvious&quot; limit, namely (Formula presented.), has been left open. We answer this question in principle affirmatively and show that (Formula presented.). If the operators A and B are regular enough, that is (A − B), (Formula presented.) and (Formula presented.) are trace-class, the identity (Formula presented.) holds."}],"external_id":{"isi":["000361007600006"],"arxiv":["1502.07205"]},"page":"1449 - 1466","license":"https://creativecommons.org/licenses/by-nc/4.0/","file":[{"date_updated":"2020-07-14T12:45:13Z","file_id":"5836","file_size":484967,"creator":"dernst","file_name":"2015_LettersMathPhys_Deuchert.pdf","relation":"main_file","content_type":"application/pdf","date_created":"2019-01-15T14:42:07Z","access_level":"open_access","checksum":"fd7307282a314cc1fbbaef77b187516b"}],"article_processing_charge":"No","title":"Note on a family of monotone quantum relative entropies","arxiv":1,"date_created":"2018-12-11T11:53:34Z","publication_status":"published","oa_version":"Preprint","issue":"10","tmp":{"short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"oa":1,"scopus_import":"1","has_accepted_license":"1","status":"public","isi":1,"department":[{"_id":"RoSe"}],"publisher":"Springer","author":[{"first_name":"Andreas","last_name":"Deuchert","full_name":"Deuchert, Andreas","orcid":"0000-0003-3146-6746"},{"last_name":"Hainzl","first_name":"Christian","full_name":"Hainzl, Christian"},{"full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer"}],"corr_author":"1","intvolume":"       105","publication":"Letters in Mathematical Physics","language":[{"iso":"eng"}],"quality_controlled":"1","citation":{"ista":"Deuchert A, Hainzl C, Seiringer R. 2015. Note on a family of monotone quantum relative entropies. Letters in Mathematical Physics. 105(10), 1449–1466.","apa":"Deuchert, A., Hainzl, C., &#38; Seiringer, R. (2015). Note on a family of monotone quantum relative entropies. <i>Letters in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s11005-015-0787-5\">https://doi.org/10.1007/s11005-015-0787-5</a>","chicago":"Deuchert, Andreas, Christian Hainzl, and Robert Seiringer. “Note on a Family of Monotone Quantum Relative Entropies.” <i>Letters in Mathematical Physics</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s11005-015-0787-5\">https://doi.org/10.1007/s11005-015-0787-5</a>.","mla":"Deuchert, Andreas, et al. “Note on a Family of Monotone Quantum Relative Entropies.” <i>Letters in Mathematical Physics</i>, vol. 105, no. 10, Springer, 2015, pp. 1449–66, doi:<a href=\"https://doi.org/10.1007/s11005-015-0787-5\">10.1007/s11005-015-0787-5</a>.","short":"A. Deuchert, C. Hainzl, R. Seiringer, Letters in Mathematical Physics 105 (2015) 1449–1466.","ama":"Deuchert A, Hainzl C, Seiringer R. Note on a family of monotone quantum relative entropies. <i>Letters in Mathematical Physics</i>. 2015;105(10):1449-1466. doi:<a href=\"https://doi.org/10.1007/s11005-015-0787-5\">10.1007/s11005-015-0787-5</a>","ieee":"A. Deuchert, C. Hainzl, and R. Seiringer, “Note on a family of monotone quantum relative entropies,” <i>Letters in Mathematical Physics</i>, vol. 105, no. 10. Springer, pp. 1449–1466, 2015."},"type":"journal_article","ddc":["510"],"volume":105,"day":"05","date_published":"2015-08-05T00:00:00Z","doi":"10.1007/s11005-015-0787-5","year":"2015","date_updated":"2025-09-23T09:41:03Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"1704","publist_id":"5432","month":"08"},{"isi":1,"department":[{"_id":"ChLa"}],"publisher":"Springer","alternative_title":["LNCS"],"project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036","call_identifier":"FP7"}],"author":[{"full_name":"Pentina, Anastasia","first_name":"Anastasia","id":"42E87FC6-F248-11E8-B48F-1D18A9856A87","last_name":"Pentina"},{"full_name":"Ben David, Shai","first_name":"Shai","last_name":"Ben David"}],"corr_author":"1","oa":1,"conference":{"start_date":"2015-10-04","location":"Banff, AB, Canada","name":"ALT: Algorithmic Learning Theory","end_date":"2015-10-06"},"scopus_import":"1","status":"public","article_processing_charge":"No","title":"Multi-task and lifelong learning of kernels","arxiv":1,"oa_version":"Preprint","publication_status":"published","date_created":"2018-12-11T11:53:35Z","external_id":{"arxiv":["1602.06531"],"isi":["000367595100013"]},"abstract":[{"lang":"eng","text":"We consider a problem of learning kernels for use in SVM classification in the multi-task and lifelong scenarios and provide generalization bounds on the error of a large margin classifier. Our results show that, under mild conditions on the family of kernels used for learning, solving several related tasks simultaneously is beneficial over single task learning. In particular, as the number of observed tasks grows, assuming that in the considered family of kernels there exists one that yields low approximation error on all tasks, the overhead associated with learning such a kernel vanishes and the complexity converges to that of learning when this good kernel is given to the learner."}],"page":"194 - 208","ec_funded":1,"publist_id":"5430","month":"01","year":"2015","date_updated":"2025-09-23T09:36:51Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"1706","day":"01","date_published":"2015-01-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1602.06531"}],"doi":"10.1007/978-3-319-24486-0_13","intvolume":"      9355","language":[{"iso":"eng"}],"quality_controlled":"1","type":"conference","citation":{"ieee":"A. Pentina and S. Ben David, “Multi-task and lifelong learning of kernels,” presented at the ALT: Algorithmic Learning Theory, Banff, AB, Canada, 2015, vol. 9355, pp. 194–208.","mla":"Pentina, Anastasia, and Shai Ben David. <i>Multi-Task and Lifelong Learning of Kernels</i>. Vol. 9355, Springer, 2015, pp. 194–208, doi:<a href=\"https://doi.org/10.1007/978-3-319-24486-0_13\">10.1007/978-3-319-24486-0_13</a>.","chicago":"Pentina, Anastasia, and Shai Ben David. “Multi-Task and Lifelong Learning of Kernels,” 9355:194–208. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-24486-0_13\">https://doi.org/10.1007/978-3-319-24486-0_13</a>.","ama":"Pentina A, Ben David S. Multi-task and lifelong learning of kernels. In: Vol 9355. Springer; 2015:194-208. doi:<a href=\"https://doi.org/10.1007/978-3-319-24486-0_13\">10.1007/978-3-319-24486-0_13</a>","short":"A. Pentina, S. Ben David, in:, Springer, 2015, pp. 194–208.","apa":"Pentina, A., &#38; Ben David, S. (2015). Multi-task and lifelong learning of kernels (Vol. 9355, pp. 194–208). Presented at the ALT: Algorithmic Learning Theory, Banff, AB, Canada: Springer. <a href=\"https://doi.org/10.1007/978-3-319-24486-0_13\">https://doi.org/10.1007/978-3-319-24486-0_13</a>","ista":"Pentina A, Ben David S. 2015. Multi-task and lifelong learning of kernels. ALT: Algorithmic Learning Theory, LNCS, vol. 9355, 194–208."},"volume":9355},{"issue":"4","title":"Minimal resistance of curves under the single impact assumption","article_processing_charge":"No","arxiv":1,"oa_version":"Preprint","date_created":"2018-12-11T11:53:36Z","publication_status":"published","abstract":[{"text":"We consider the hollow on the half-plane {(x, y) : y ≤ 0} ⊂ ℝ2 defined by a function u : (-1, 1) → ℝ, u(x) &lt; 0, and a vertical flow of point particles incident on the hollow. It is assumed that u satisfies the so-called single impact condition (SIC): each incident particle is elastically reflected by graph(u) and goes away without hitting the graph of u anymore. We solve the problem: find the function u minimizing the force of resistance created by the flow. We show that the graph of the minimizer is formed by two arcs of parabolas symmetric to each other with respect to the y-axis. Assuming that the resistance of u ≡ 0 equals 1, we show that the minimal resistance equals π/2 - 2arctan(1/2) ≈ 0.6435. This result completes the previously obtained result [SIAM J. Math. Anal., 46 (2014), pp. 2730-2742] stating in particular that the minimal resistance of a hollow in higher dimensions equals 0.5. We additionally consider a similar problem of minimal resistance, where the hollow in the half-space {(x1,...,xd,y) : y ≤ 0} ⊂ ℝd+1 is defined by a radial function U satisfying the SIC, U(x) = u(|x|), with x = (x1,...,xd), u(ξ) &lt; 0 for 0 ≤ ξ &lt; 1, and u(ξ) = 0 for ξ ≥ 1, and the flow is parallel to the y-axis. The minimal resistance is greater than 0.5 (and coincides with 0.6435 when d = 1) and converges to 0.5 as d → ∞.","lang":"eng"}],"external_id":{"arxiv":["1410.3736"],"isi":["000360691500009"]},"page":"2754 - 2769","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"author":[{"orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy","last_name":"Akopyan","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Plakhov","first_name":"Alexander","full_name":"Plakhov, Alexander"}],"isi":1,"department":[{"_id":"HeEd"}],"publisher":"SIAM","status":"public","oa":1,"scopus_import":"1","doi":"10.1137/140993843","day":"14","date_published":"2015-07-14T00:00:00Z","main_file_link":[{"url":"http://arxiv.org/abs/1410.3736","open_access":"1"}],"type":"journal_article","citation":{"ista":"Akopyan A, Plakhov A. 2015. Minimal resistance of curves under the single impact assumption. Society for Industrial and Applied Mathematics. 47(4), 2754–2769.","apa":"Akopyan, A., &#38; Plakhov, A. (2015). Minimal resistance of curves under the single impact assumption. <i>Society for Industrial and Applied Mathematics</i>. SIAM. <a href=\"https://doi.org/10.1137/140993843\">https://doi.org/10.1137/140993843</a>","ama":"Akopyan A, Plakhov A. Minimal resistance of curves under the single impact assumption. <i>Society for Industrial and Applied Mathematics</i>. 2015;47(4):2754-2769. doi:<a href=\"https://doi.org/10.1137/140993843\">10.1137/140993843</a>","short":"A. Akopyan, A. Plakhov, Society for Industrial and Applied Mathematics 47 (2015) 2754–2769.","chicago":"Akopyan, Arseniy, and Alexander Plakhov. “Minimal Resistance of Curves under the Single Impact Assumption.” <i>Society for Industrial and Applied Mathematics</i>. SIAM, 2015. <a href=\"https://doi.org/10.1137/140993843\">https://doi.org/10.1137/140993843</a>.","mla":"Akopyan, Arseniy, and Alexander Plakhov. “Minimal Resistance of Curves under the Single Impact Assumption.” <i>Society for Industrial and Applied Mathematics</i>, vol. 47, no. 4, SIAM, 2015, pp. 2754–69, doi:<a href=\"https://doi.org/10.1137/140993843\">10.1137/140993843</a>.","ieee":"A. Akopyan and A. Plakhov, “Minimal resistance of curves under the single impact assumption,” <i>Society for Industrial and Applied Mathematics</i>, vol. 47, no. 4. SIAM, pp. 2754–2769, 2015."},"volume":47,"intvolume":"        47","publication":"Society for Industrial and Applied Mathematics","language":[{"iso":"eng"}],"quality_controlled":"1","publist_id":"5423","month":"07","ec_funded":1,"date_updated":"2025-09-23T09:35:36Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"1710","year":"2015"},{"abstract":[{"text":"The majority of immune cells in Drosophila melanogaster are plasmatocytes; they carry out similar functions to vertebrate macrophages, influencing development as well as protecting against infection and cancer. Plasmatocytes, sometimes referred to with the broader term of hemocytes, migrate widely during embryonic development and cycle in the larvae between sessile and circulating positions. Here we discuss the similarities of plasmatocyte developmental migration and its functions to that of vertebrate macrophages, considering the recent controversy regarding the functions of Drosophila PDGF/VEGF related ligands. We also examine recent findings on the significance of adhesion for plasmatocyte migration in the embryo, as well as proliferation, trans-differentiation, and tumor responses in the larva. We spotlight parallels throughout to vertebrate immune responses.","lang":"eng"}],"external_id":{"isi":["000364577600011"]},"page":"71 - 79","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","file":[{"date_updated":"2020-07-14T12:45:13Z","file_size":1023680,"file_id":"5098","relation":"main_file","content_type":"application/pdf","file_name":"IST-2015-346-v1+1_Current_Opinion_Review_Ratheesh_et_al_2015.pdf","creator":"system","checksum":"bbb1ee39ca52929aefe4f48752b166ee","access_level":"open_access","date_created":"2018-12-12T10:14:44Z"}],"file_date_updated":"2020-07-14T12:45:13Z","issue":"10","title":"Drosophila immune cell migration and adhesion during embryonic development and larval immune responses","article_processing_charge":"No","pubrep_id":"346","oa_version":"Published Version","date_created":"2018-12-11T11:53:36Z","publication_status":"published","status":"public","has_accepted_license":"1","tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"oa":1,"scopus_import":"1","project":[{"grant_number":"334077","name":"Investigating the role of transporters in invasive migration through junctions","call_identifier":"FP7","_id":"2536F660-B435-11E9-9278-68D0E5697425"}],"corr_author":"1","author":[{"full_name":"Ratheesh, Aparna","orcid":"0000-0001-7190-0776","id":"2F064CFE-F248-11E8-B48F-1D18A9856A87","first_name":"Aparna","last_name":"Ratheesh"},{"full_name":"Belyaeva, Vera","first_name":"Vera","id":"47F080FE-F248-11E8-B48F-1D18A9856A87","last_name":"Belyaeva"},{"last_name":"Siekhaus","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","first_name":"Daria E","full_name":"Siekhaus, Daria E","orcid":"0000-0001-8323-8353"}],"isi":1,"publisher":"Elsevier","department":[{"_id":"DaSi"}],"type":"journal_article","citation":{"ista":"Ratheesh A, Belyaeva V, Siekhaus DE. 2015. Drosophila immune cell migration and adhesion during embryonic development and larval immune responses. Current Opinion in Cell Biology. 36(10), 71–79.","apa":"Ratheesh, A., Belyaeva, V., &#38; Siekhaus, D. E. (2015). Drosophila immune cell migration and adhesion during embryonic development and larval immune responses. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2015.07.003\">https://doi.org/10.1016/j.ceb.2015.07.003</a>","chicago":"Ratheesh, Aparna, Vera Belyaeva, and Daria E Siekhaus. “Drosophila Immune Cell Migration and Adhesion during Embryonic Development and Larval Immune Responses.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ceb.2015.07.003\">https://doi.org/10.1016/j.ceb.2015.07.003</a>.","mla":"Ratheesh, Aparna, et al. “Drosophila Immune Cell Migration and Adhesion during Embryonic Development and Larval Immune Responses.” <i>Current Opinion in Cell Biology</i>, vol. 36, no. 10, Elsevier, 2015, pp. 71–79, doi:<a href=\"https://doi.org/10.1016/j.ceb.2015.07.003\">10.1016/j.ceb.2015.07.003</a>.","ama":"Ratheesh A, Belyaeva V, Siekhaus DE. Drosophila immune cell migration and adhesion during embryonic development and larval immune responses. <i>Current Opinion in Cell Biology</i>. 2015;36(10):71-79. doi:<a href=\"https://doi.org/10.1016/j.ceb.2015.07.003\">10.1016/j.ceb.2015.07.003</a>","short":"A. Ratheesh, V. Belyaeva, D.E. Siekhaus, Current Opinion in Cell Biology 36 (2015) 71–79.","ieee":"A. Ratheesh, V. Belyaeva, and D. E. Siekhaus, “Drosophila immune cell migration and adhesion during embryonic development and larval immune responses,” <i>Current Opinion in Cell Biology</i>, vol. 36, no. 10. Elsevier, pp. 71–79, 2015."},"ddc":["573"],"volume":36,"intvolume":"        36","publication":"Current Opinion in Cell Biology","language":[{"iso":"eng"}],"quality_controlled":"1","doi":"10.1016/j.ceb.2015.07.003","day":"01","date_published":"2015-10-01T00:00:00Z","date_updated":"2025-09-23T08:29:26Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"1712","year":"2015","publist_id":"5421","month":"10","ec_funded":1},{"status":"public","conference":{"start_date":"2014-12-02","location":"Rome, Italy","name":"RTSS: Real-Time Systems Symposium","end_date":"2014-12-05"},"scopus_import":"1","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722"},{"last_name":"Kößler","first_name":"Alexander","full_name":"Kößler, Alexander"},{"last_name":"Schmid","first_name":"Ulrich","full_name":"Schmid, Ulrich"}],"department":[{"_id":"KrCh"}],"publisher":"IEEE","isi":1,"page":"118 - 127","abstract":[{"text":"We present a flexible framework for the automated competitive analysis of on-line scheduling algorithms for firm-deadline real-time tasks based on multi-objective graphs: Given a task set and an on-line scheduling algorithm specified as a labeled transition system, along with some optional safety, liveness, and/or limit-average constraints for the adversary, we automatically compute the competitive ratio of the algorithm w.r.t. A clairvoyant scheduler. We demonstrate the flexibility and power of our approach by comparing the competitive ratio of several on-line algorithms, including Dover, that have been proposed in the past, for various task sets. Our experimental results reveal that none of these algorithms is universally optimal, in the sense that there are task sets where other schedulers provide better performance. Our framework is hence a very useful design tool for selecting optimal algorithms for a given application.","lang":"eng"}],"external_id":{"isi":["000569750000012"]},"issue":"January","related_material":{"record":[{"id":"5423","relation":"earlier_version","status":"public"},{"relation":"dissertation_contains","status":"public","id":"821"}]},"publication_status":"published","oa_version":"None","date_created":"2018-12-11T11:53:37Z","article_processing_charge":"No","title":"A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks","_id":"1714","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2026-04-08T14:22:16Z","year":"2015","publist_id":"5417","month":"01","volume":2015,"citation":{"short":"K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, in:, Real-Time Systems Symposium, IEEE, 2015, pp. 118–127.","ama":"Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. In: <i>Real-Time Systems Symposium</i>. Vol 2015. IEEE; 2015:118-127. doi:<a href=\"https://doi.org/10.1109/RTSS.2014.9\">10.1109/RTSS.2014.9</a>","mla":"Chatterjee, Krishnendu, et al. “A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks.” <i>Real-Time Systems Symposium</i>, vol. 2015, no. January, IEEE, 2015, pp. 118–27, doi:<a href=\"https://doi.org/10.1109/RTSS.2014.9\">10.1109/RTSS.2014.9</a>.","chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks.” In <i>Real-Time Systems Symposium</i>, 2015:118–27. IEEE, 2015. <a href=\"https://doi.org/10.1109/RTSS.2014.9\">https://doi.org/10.1109/RTSS.2014.9</a>.","ieee":"K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks,” in <i>Real-Time Systems Symposium</i>, Rome, Italy, 2015, vol. 2015, no. January, pp. 118–127.","ista":"Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2015. A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. Real-Time Systems Symposium. RTSS: Real-Time Systems Symposium vol. 2015, 118–127.","apa":"Chatterjee, K., Pavlogiannis, A., Kößler, A., &#38; Schmid, U. (2015). A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. In <i>Real-Time Systems Symposium</i> (Vol. 2015, pp. 118–127). Rome, Italy: IEEE. <a href=\"https://doi.org/10.1109/RTSS.2014.9\">https://doi.org/10.1109/RTSS.2014.9</a>"},"type":"conference","quality_controlled":"1","language":[{"iso":"eng"}],"publication":"Real-Time Systems Symposium","intvolume":"      2015","doi":"10.1109/RTSS.2014.9","date_published":"2015-01-15T00:00:00Z","day":"15"},{"file_date_updated":"2020-07-14T12:45:19Z","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."}],"external_id":{"isi":["000351319000002"]},"page":"1149 - 1151","file":[{"date_created":"2018-12-12T10:16:07Z","access_level":"open_access","checksum":"d1808550e376a0eca2a950fda017cfa6","creator":"system","content_type":"application/pdf","relation":"main_file","file_name":"IST-2017-822-v1+1_Perspective_Fig__Final.pdf","file_id":"5192","file_size":411832,"date_updated":"2020-07-14T12:45:19Z"},{"file_size":100769,"file_id":"5193","date_updated":"2020-07-14T12:45:19Z","checksum":"a279f4ae61e6c8f33d68f69a0d02097d","access_level":"open_access","date_created":"2018-12-12T10:16:07Z","relation":"main_file","file_name":"IST-2017-822-v1+2_Perspective_Final2.pdf","content_type":"application/pdf","creator":"system"}],"article_processing_charge":"No","title":"Excitement about inhibitory presynaptic terminals","pubrep_id":"822","publication_status":"published","oa_version":"Published Version","date_created":"2018-12-11T11:54:19Z","issue":"6","tmp":{"short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"oa":1,"scopus_import":"1","status":"public","has_accepted_license":"1","isi":1,"publisher":"Elsevier","department":[{"_id":"PeJo"}],"author":[{"full_name":"Vandael, David H","orcid":"0000-0001-7577-1676","last_name":"Vandael","first_name":"David H","id":"3AE48E0A-F248-11E8-B48F-1D18A9856A87"},{"id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","first_name":"Claudia ","last_name":"Espinoza Martinez","orcid":"0000-0003-4710-2082","full_name":"Espinoza Martinez, Claudia "},{"first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M"}],"corr_author":"1","intvolume":"        85","publication":"Neuron","language":[{"iso":"eng"}],"quality_controlled":"1","citation":{"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>","ista":"Vandael DH, Espinoza Martinez C, Jonas PM. 2015. Excitement about inhibitory presynaptic terminals. Neuron. 85(6), 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.","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>.","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."},"type":"journal_article","ddc":["570"],"volume":85,"day":"18","date_published":"2015-03-18T00:00:00Z","doi":"10.1016/j.neuron.2015.03.006","year":"2015","date_updated":"2025-09-23T08:44:39Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"1845","month":"03","publist_id":"5256"},{"month":"04","publist_id":"5255","ec_funded":1,"date_updated":"2025-09-23T10:33:12Z","_id":"1846","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2015","doi":"10.1007/s00236-015-0215-4","day":"01","date_published":"2015-04-01T00:00:00Z","citation":{"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>","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.","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.","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>.","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>.","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>","short":"N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, J. Srba, Acta Informatica 52 (2015) 269–297."},"type":"journal_article","volume":52,"ddc":["000"],"publication":"Acta Informatica","intvolume":"        52","quality_controlled":"1","language":[{"iso":"eng"}],"author":[{"full_name":"Beneš, Nikola","last_name":"Beneš","first_name":"Nikola"},{"full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","last_name":"Kretinsky","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Larsen","first_name":"Kim","full_name":"Larsen, Kim"},{"full_name":"Möller, Mikael","last_name":"Möller","first_name":"Mikael"},{"full_name":"Sickert, Salomon","last_name":"Sickert","first_name":"Salomon"},{"full_name":"Srba, Jiří","last_name":"Srba","first_name":"Jiří"}],"corr_author":"1","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"isi":1,"publisher":"Springer","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"has_accepted_license":"1","status":"public","scopus_import":"1","oa":1,"issue":"2-3","article_processing_charge":"No","title":"Refinement checking on parametric modal transition systems","date_created":"2018-12-11T11:54:20Z","oa_version":"Submitted Version","publication_status":"published","page":"269 - 297","external_id":{"isi":["000351160200008"]},"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."}],"file":[{"access_level":"open_access","date_created":"2020-05-15T08:57:44Z","checksum":"fb4037ddc4fc05f33080dd3547ede350","relation":"main_file","content_type":"application/pdf","file_name":"2015_ActaInfo_Benes.pdf","creator":"dernst","file_id":"7854","file_size":488482,"date_updated":"2020-07-14T12:45:19Z"}],"file_date_updated":"2020-07-14T12:45:19Z","article_type":"original"},{"year":"2015","_id":"1847","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-23T07:30:08Z","month":"03","publist_id":"5254","quality_controlled":"1","language":[{"iso":"eng"}],"publication":"Molecular Plant","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).","intvolume":"         8","volume":8,"type":"journal_article","citation":{"short":"P. Grones, J. Friml, Molecular Plant 8 (2015) 356–358.","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>","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>.","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.","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>"},"date_published":"2015-03-02T00:00:00Z","day":"02","doi":"10.1016/j.molp.2014.12.013","scopus_import":"1","status":"public","department":[{"_id":"JiFr"}],"publisher":"Elsevier","isi":1,"author":[{"full_name":"Grones, Peter","id":"399876EC-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Grones"},{"full_name":"Friml, Jiřĺ","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiřĺ","last_name":"Friml"}],"corr_author":"1","page":"356 - 358","external_id":{"isi":["000350813400003"]},"oa_version":"None","publication_status":"published","date_created":"2018-12-11T11:54:20Z","article_processing_charge":"No","title":"ABP1: Finally docking","issue":"3"},{"oa":1,"scopus_import":"1","status":"public","publisher":"Wiley","department":[{"_id":"LifeSc"}],"isi":1,"author":[{"last_name":"Schwamb","first_name":"Bettina","full_name":"Schwamb, Bettina"},{"full_name":"Pick, Robert","last_name":"Pick","first_name":"Robert"},{"first_name":"Sara","last_name":"Fernández","full_name":"Fernández, Sara"},{"full_name":"Völp, Kirsten","first_name":"Kirsten","last_name":"Völp"},{"first_name":"Jan","last_name":"Heering","full_name":"Heering, Jan"},{"full_name":"Dötsch, Volker","first_name":"Volker","last_name":"Dötsch"},{"full_name":"Bösser, Susanne","last_name":"Bösser","first_name":"Susanne"},{"full_name":"Jung, Jennifer","first_name":"Jennifer","last_name":"Jung"},{"last_name":"Beinoravičiute Kellner","first_name":"Rasa","full_name":"Beinoravičiute Kellner, Rasa"},{"first_name":"Josephine","last_name":"Wesely","full_name":"Wesely, Josephine"},{"last_name":"Zörnig","first_name":"Inka","full_name":"Zörnig, Inka"},{"last_name":"Hammerschmidt","first_name":"Matthias","full_name":"Hammerschmidt, Matthias"},{"full_name":"Nowak, Matthias","last_name":"Nowak","first_name":"Matthias","id":"30845DAA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Penzel, Roland","last_name":"Penzel","first_name":"Roland"},{"full_name":"Zatloukal, Kurt","last_name":"Zatloukal","first_name":"Kurt"},{"full_name":"Joos, Stefan","last_name":"Joos","first_name":"Stefan"},{"full_name":"Rieker, Ralf","first_name":"Ralf","last_name":"Rieker"},{"full_name":"Agaimy, Abbas","first_name":"Abbas","last_name":"Agaimy"},{"full_name":"Söder, Stephan","last_name":"Söder","first_name":"Stephan"},{"full_name":"Reid Lombardo, Kmarie","first_name":"Kmarie","last_name":"Reid Lombardo"},{"full_name":"Kendrick, Michael","first_name":"Michael","last_name":"Kendrick"},{"full_name":"Bardsley, Michael","first_name":"Michael","last_name":"Bardsley"},{"full_name":"Hayashi, Yujiro","last_name":"Hayashi","first_name":"Yujiro"},{"full_name":"Asuzu, David","first_name":"David","last_name":"Asuzu"},{"first_name":"Sabriya","last_name":"Syed","full_name":"Syed, Sabriya"},{"last_name":"Ördög","first_name":"Tamás","full_name":"Ördög, Tamás"},{"first_name":"Martin","last_name":"Zörnig","full_name":"Zörnig, Martin"}],"article_type":"original","pmid":1,"abstract":[{"text":"The ability to escape apoptosis is a hallmark of cancer-initiating cells and a key factor of resistance to oncolytic therapy. Here, we identify FAM96A as a ubiquitous, evolutionarily conserved apoptosome-activating protein and investigate its potential pro-apoptotic tumor suppressor function in gastrointestinal stromal tumors (GISTs). Interaction between FAM96A and apoptotic peptidase activating factor 1 (APAF1) was identified in yeast two-hybrid screen and further studied by deletion mutants, glutathione-S-transferase pull-down, co-immunoprecipitation and immunofluorescence. Effects of FAM96A overexpression and knock-down on apoptosis sensitivity were examined in cancer cells and zebrafish embryos. Expression of FAM96A in GISTs and histogenetically related cells including interstitial cells of Cajal (ICCs), “fibroblast-like cells” (FLCs) and ICC stem cells (ICC-SCs) was investigated by Northern blotting, reverse transcription—polymerase chain reaction, immunohistochemistry and Western immunoblotting. Tumorigenicity of GIST cells and transformed murine ICC-SCs stably transduced to re-express FAM96A was studied by xeno- and allografting into immunocompromised mice. FAM96A was found to bind APAF1 and to enhance the induction of mitochondrial apoptosis. FAM96A protein or mRNA was dramatically reduced or lost in 106 of 108 GIST samples representing three independent patient cohorts. Whereas ICCs, ICC-SCs and FLCs, the presumed normal counterparts of GIST, were found to robustly express FAM96A protein and mRNA, FAM96A expression was much reduced in tumorigenic ICC-SCs. Re-expression of FAM96A in GIST cells and transformed ICC-SCs increased apoptosis sensitivity and diminished tumorigenicity. Our data suggest FAM96A is a novel pro-apoptotic tumor suppressor that is lost during GIST tumorigenesis.","lang":"eng"}],"external_id":{"pmid":["25716227"],"isi":["000357808900012"]},"page":"1318 - 1329","date_created":"2018-12-11T11:54:20Z","oa_version":"Submitted Version","publication_status":"published","title":"FAM96A is a novel pro-apoptotic tumor suppressor in gastrointestinal stromal tumors","article_processing_charge":"No","issue":"6","year":"2015","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"1848","date_updated":"2025-09-23T08:46:31Z","month":"09","publist_id":"5253","language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"       137","publication":"International Journal of Cancer","volume":137,"type":"journal_article","citation":{"apa":"Schwamb, B., Pick, R., Fernández, S., Völp, K., Heering, J., Dötsch, V., … Zörnig, M. (2015). FAM96A is a novel pro-apoptotic tumor suppressor in gastrointestinal stromal tumors. <i>International Journal of Cancer</i>. Wiley. <a href=\"https://doi.org/10.1002/ijc.29498\">https://doi.org/10.1002/ijc.29498</a>","ista":"Schwamb B, Pick R, Fernández S, Völp K, Heering J, Dötsch V, Bösser S, Jung J, Beinoravičiute Kellner R, Wesely J, Zörnig I, Hammerschmidt M, Nowak M, Penzel R, Zatloukal K, Joos S, Rieker R, Agaimy A, Söder S, Reid Lombardo K, Kendrick M, Bardsley M, Hayashi Y, Asuzu D, Syed S, Ördög T, Zörnig M. 2015. FAM96A is a novel pro-apoptotic tumor suppressor in gastrointestinal stromal tumors. International Journal of Cancer. 137(6), 1318–1329.","ieee":"B. Schwamb <i>et al.</i>, “FAM96A is a novel pro-apoptotic tumor suppressor in gastrointestinal stromal tumors,” <i>International Journal of Cancer</i>, vol. 137, no. 6. Wiley, pp. 1318–1329, 2015.","short":"B. Schwamb, R. Pick, S. Fernández, K. Völp, J. Heering, V. Dötsch, S. Bösser, J. Jung, R. Beinoravičiute Kellner, J. Wesely, I. Zörnig, M. Hammerschmidt, M. Nowak, R. Penzel, K. Zatloukal, S. Joos, R. Rieker, A. Agaimy, S. Söder, K. Reid Lombardo, M. Kendrick, M. Bardsley, Y. Hayashi, D. Asuzu, S. Syed, T. Ördög, M. Zörnig, International Journal of Cancer 137 (2015) 1318–1329.","ama":"Schwamb B, Pick R, Fernández S, et al. FAM96A is a novel pro-apoptotic tumor suppressor in gastrointestinal stromal tumors. <i>International Journal of Cancer</i>. 2015;137(6):1318-1329. doi:<a href=\"https://doi.org/10.1002/ijc.29498\">10.1002/ijc.29498</a>","mla":"Schwamb, Bettina, et al. “FAM96A Is a Novel Pro-Apoptotic Tumor Suppressor in Gastrointestinal Stromal Tumors.” <i>International Journal of Cancer</i>, vol. 137, no. 6, Wiley, 2015, pp. 1318–29, doi:<a href=\"https://doi.org/10.1002/ijc.29498\">10.1002/ijc.29498</a>.","chicago":"Schwamb, Bettina, Robert Pick, Sara Fernández, Kirsten Völp, Jan Heering, Volker Dötsch, Susanne Bösser, et al. “FAM96A Is a Novel Pro-Apoptotic Tumor Suppressor in Gastrointestinal Stromal Tumors.” <i>International Journal of Cancer</i>. Wiley, 2015. <a href=\"https://doi.org/10.1002/ijc.29498\">https://doi.org/10.1002/ijc.29498</a>."},"date_published":"2015-09-01T00:00:00Z","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4497860/","open_access":"1"}],"day":"01","doi":"10.1002/ijc.29498"},{"scopus_import":"1","status":"public","isi":1,"department":[{"_id":"JiFr"}],"publisher":"Elsevier","author":[{"full_name":"Himschoot, Ellie","last_name":"Himschoot","first_name":"Ellie"},{"full_name":"Beeckman, Tom","first_name":"Tom","last_name":"Beeckman"},{"last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiřĺ","full_name":"Friml, Jiřĺ","orcid":"0000-0002-8302-7596"},{"full_name":"Vanneste, Steffen","first_name":"Steffen","last_name":"Vanneste"}],"external_id":{"isi":["000359960400028"]},"abstract":[{"lang":"eng","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."}],"page":"2168 - 2172","title":"Calcium is an organizer of cell polarity in plants","article_processing_charge":"No","date_created":"2018-12-11T11:54:21Z","publication_status":"published","oa_version":"None","issue":"9","year":"2015","date_updated":"2025-09-23T08:04:01Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"1849","publist_id":"5252","month":"09","intvolume":"      1853","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.).","publication":"Biochimica et Biophysica Acta - Molecular Cell Research","language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","citation":{"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.","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>","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>","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>.","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>.","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."},"volume":1853,"day":"01","date_published":"2015-09-01T00:00:00Z","doi":"10.1016/j.bbamcr.2015.02.017"},{"ddc":["576"],"volume":372,"type":"journal_article","citation":{"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>","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.","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.","short":"S. Novak, S. Cremer, Journal of Theoretical Biology 372 (2015) 54–64.","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>","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>.","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>."},"language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"       372","publication":"Journal of Theoretical Biology","doi":"10.1016/j.jtbi.2015.02.018","date_published":"2015-05-07T00:00:00Z","day":"07","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"1850","date_updated":"2025-09-23T08:54:35Z","year":"2015","publist_id":"5251","month":"05","ec_funded":1,"file":[{"file_name":"IST-2015-329-v1+1_manuscript.pdf","content_type":"application/pdf","relation":"main_file","creator":"system","checksum":"3c0dcacc900bc45cc65a453dfda4ca43","access_level":"open_access","date_created":"2018-12-12T10:18:07Z","date_updated":"2020-07-14T12:45:19Z","file_size":1546914,"file_id":"5326"}],"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."}],"external_id":{"isi":["000353311700006"]},"page":"54 - 64","file_date_updated":"2020-07-14T12:45:19Z","issue":"5","publication_status":"published","oa_version":"Submitted Version","date_created":"2018-12-11T11:54:21Z","title":"Fungal disease dynamics in insect societies: Optimal killing rates and the ambivalent effect of high social interaction rates","article_processing_charge":"No","pubrep_id":"329","status":"public","has_accepted_license":"1","oa":1,"scopus_import":"1","project":[{"call_identifier":"FP7","grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation","_id":"25B07788-B435-11E9-9278-68D0E5697425"},{"name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","grant_number":"243071","call_identifier":"FP7","_id":"25DC711C-B435-11E9-9278-68D0E5697425"}],"corr_author":"1","author":[{"full_name":"Novak, Sebastian","orcid":"0000-0002-2519-824X","last_name":"Novak","id":"461468AE-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian"},{"first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","last_name":"Cremer","full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868"}],"department":[{"_id":"NiBa"},{"_id":"SyCr"}],"publisher":"Elsevier","isi":1},{"publist_id":"5249","month":"02","ec_funded":1,"publication_identifier":{"issn":["0014-3820"],"eissn":["1558-5646"]},"_id":"1851","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-22T14:27:30Z","year":"2015","doi":"10.1111/evo.12618","date_published":"2015-02-09T00:00:00Z","day":"09","volume":69,"ddc":["570"],"citation":{"short":"T. Priklopil, E. Kisdi, M. Gyllenberg, Evolution 69 (2015) 1015–1026.","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>","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>.","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.","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.","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>"},"type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"publication":"Evolution","intvolume":"        69","author":[{"last_name":"Priklopil","first_name":"Tadeas","id":"3C869AA0-F248-11E8-B48F-1D18A9856A87","full_name":"Priklopil, Tadeas"},{"last_name":"Kisdi","first_name":"Eva","full_name":"Kisdi, Eva"},{"full_name":"Gyllenberg, Mats","last_name":"Gyllenberg","first_name":"Mats"}],"corr_author":"1","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"NiBa"},{"_id":"KrCh"}],"publisher":"Wiley","isi":1,"has_accepted_license":"1","status":"public","scopus_import":"1","oa":1,"issue":"4","oa_version":"Submitted Version","publication_status":"published","date_created":"2018-12-11T11:54:21Z","title":"Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating","article_processing_charge":"No","file":[{"date_updated":"2020-07-14T12:45:19Z","file_id":"7855","file_size":967214,"creator":"dernst","relation":"main_file","content_type":"application/pdf","file_name":"2015_Evolution_Priklopil.pdf","date_created":"2020-05-15T09:05:34Z","access_level":"open_access","checksum":"1e8be0b1d7598a78cd2623d8ee8e7798"}],"pmid":1,"page":"1015 - 1026","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"}],"external_id":{"pmid":["25662095"],"isi":["000353236000014"]},"file_date_updated":"2020-07-14T12:45:19Z","article_type":"original"},{"author":[{"full_name":"Mcmahon, Dino","last_name":"Mcmahon","first_name":"Dino"},{"full_name":"Fürst, Matthias","orcid":"0000-0002-3712-925X","id":"393B1196-F248-11E8-B48F-1D18A9856A87","first_name":"Matthias","last_name":"Fürst"},{"last_name":"Caspar","first_name":"Jesicca","full_name":"Caspar, Jesicca"},{"first_name":"Panagiotis","last_name":"Theodorou","full_name":"Theodorou, Panagiotis"},{"first_name":"Mark","last_name":"Brown","full_name":"Brown, Mark"},{"last_name":"Paxton","first_name":"Robert","full_name":"Paxton, Robert"}],"publisher":"Wiley","department":[{"_id":"SyCr"}],"isi":1,"status":"public","has_accepted_license":"1","scopus_import":"1","oa":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"issue":"3","related_material":{"record":[{"relation":"research_data","status":"public","id":"9720"}]},"oa_version":"Published Version","date_created":"2018-12-11T11:54:23Z","publication_status":"published","pubrep_id":"460","title":"A sting in the spit: Widespread cross-infection of multiple RNA viruses across wild and managed bees","article_processing_charge":"No","file":[{"file_name":"IST-2016-460-v1+1_McMahon_et_al-2015-Journal_of_Animal_Ecology.pdf","content_type":"application/pdf","relation":"main_file","creator":"system","access_level":"open_access","date_created":"2018-12-12T10:18:29Z","checksum":"542a0b9b07e78050a81b35f26f0b82da","date_updated":"2020-07-14T12:45:19Z","file_id":"5350","file_size":1823045}],"pmid":1,"page":"615 - 624","external_id":{"isi":["000353405300004"],"pmid":["25646973"]},"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"}],"file_date_updated":"2020-07-14T12:45:19Z","article_type":"original","publist_id":"5245","month":"03","_id":"1855","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-23T07:26:24Z","year":"2015","doi":"10.1111/1365-2656.12345","date_published":"2015-03-03T00:00:00Z","day":"03","volume":84,"ddc":["570"],"type":"journal_article","citation":{"short":"D. Mcmahon, M. Fürst, J. Caspar, P. Theodorou, M. Brown, R. Paxton, Journal of Animal Ecology 84 (2015) 615–624.","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>","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>.","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>.","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.","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.","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>"},"quality_controlled":"1","language":[{"iso":"eng"}],"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.","publication":"Journal of Animal Ecology","intvolume":"        84"},{"abstract":[{"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.","lang":"eng"}],"external_id":{"arxiv":["1004.0739"],"isi":["000350563000009"]},"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3864"}]},"publication_status":"published","date_created":"2018-12-11T11:54:23Z","oa_version":"Preprint","title":"Measuring and synthesizing systems in probabilistic environments","article_processing_charge":"No","arxiv":1,"issue":"1","oa":1,"scopus_import":"1","status":"public","publisher":"ACM","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"isi":1,"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"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"name":"Game Theory","grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"},{"full_name":"Singh, Rohit","last_name":"Singh","first_name":"Rohit"}],"language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"        62","publication":"Journal of the ACM","volume":62,"type":"journal_article","citation":{"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.","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.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, Journal of the ACM 62 (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>.","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>."},"article_number":"9","date_published":"2015-02-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1004.0739"}],"day":"01","doi":"10.1145/2699430","year":"2015","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"1856","date_updated":"2025-09-23T09:33:01Z","ec_funded":1,"publist_id":"5244","month":"02"},{"publication_status":"published","date_created":"2018-12-11T11:54:23Z","oa_version":"Preprint","article_processing_charge":"No","title":"Curriculum learning of multiple tasks","arxiv":1,"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. "}],"external_id":{"arxiv":["1412.1353"]},"page":"5492 - 5500","corr_author":"1","author":[{"full_name":"Pentina, Anastasia","first_name":"Anastasia","id":"42E87FC6-F248-11E8-B48F-1D18A9856A87","last_name":"Pentina"},{"orcid":"0000-0003-0192-9308","full_name":"Sharmanska, Viktoriia","id":"2EA6D09E-F248-11E8-B48F-1D18A9856A87","first_name":"Viktoriia","last_name":"Sharmanska"},{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"ChLa"}],"publisher":"IEEE","status":"public","oa":1,"conference":{"location":"Boston, MA, United States","start_date":"2015-06-07","name":"CVPR: Computer Vision and Pattern Recognition","end_date":"2015-06-12"},"scopus_import":"1","doi":"10.1109/CVPR.2015.7299188","date_published":"2015-06-01T00:00:00Z","main_file_link":[{"url":"http://arxiv.org/abs/1412.1353","open_access":"1"}],"day":"01","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>","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>.","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>.","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.","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>"},"type":"conference","language":[{"iso":"eng"}],"quality_controlled":"1","publist_id":"5243","month":"06","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1857","date_updated":"2025-06-11T07:19:52Z","year":"2015"}]