[{"status":"public","date_updated":"2026-04-09T14:26:23Z","publist_id":"5425","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4528522/"}],"isi":1,"volume":282,"month":"07","publication_status":"published","oa_version":"Submitted Version","_id":"1709","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1","related_material":{"record":[{"id":"1400","status":"public","relation":"dissertation_contains"}]},"publication":"Proceedings of the Royal Society of London Series B Biological Sciences","project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"language":[{"iso":"eng"}],"type":"journal_article","department":[{"_id":"KrCh"}],"scopus_import":"1","corr_author":"1","pmid":1,"title":"Biological auctions with multiple rewards","year":"2015","date_created":"2018-12-11T11:53:35Z","intvolume":"       282","external_id":{"isi":["000362305500021"],"pmid":["26180069"]},"citation":{"short":"J. Reiter, A. Kanodia, R. Gupta, M. Nowak, K. Chatterjee, Proceedings of the Royal Society of London Series B Biological Sciences 282 (2015).","mla":"Reiter, Johannes, et al. “Biological Auctions with Multiple Rewards.” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>, vol. 282, no. 1812, Royal Society, 2015, doi:<a href=\"https://doi.org/10.1098/rspb.2015.1041\">10.1098/rspb.2015.1041</a>.","ama":"Reiter J, Kanodia A, Gupta R, Nowak M, Chatterjee K. Biological auctions with multiple rewards. <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. 2015;282(1812). doi:<a href=\"https://doi.org/10.1098/rspb.2015.1041\">10.1098/rspb.2015.1041</a>","ieee":"J. Reiter, A. Kanodia, R. Gupta, M. Nowak, and K. Chatterjee, “Biological auctions with multiple rewards,” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>, vol. 282, no. 1812. Royal Society, 2015.","ista":"Reiter J, Kanodia A, Gupta R, Nowak M, Chatterjee K. 2015. Biological auctions with multiple rewards. Proceedings of the Royal Society of London Series B Biological Sciences. 282(1812).","apa":"Reiter, J., Kanodia, A., Gupta, R., Nowak, M., &#38; Chatterjee, K. (2015). Biological auctions with multiple rewards. <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. Royal Society. <a href=\"https://doi.org/10.1098/rspb.2015.1041\">https://doi.org/10.1098/rspb.2015.1041</a>","chicago":"Reiter, Johannes, Ayush Kanodia, Raghav Gupta, Martin Nowak, and Krishnendu Chatterjee. “Biological Auctions with Multiple Rewards.” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. Royal Society, 2015. <a href=\"https://doi.org/10.1098/rspb.2015.1041\">https://doi.org/10.1098/rspb.2015.1041</a>."},"article_processing_charge":"No","publisher":"Royal Society","abstract":[{"text":"The competition for resources among cells, individuals or species is a fundamental characteristic of evolution. Biological all-pay auctions have been used to model situations where multiple individuals compete for a single resource. However, in many situations multiple resources with various values exist and single reward auctions are not applicable. We generalize the model to multiple rewards and study the evolution of strategies. In biological all-pay auctions the bid of an individual corresponds to its strategy and is equivalent to its payment in the auction. The decreasingly ordered rewards are distributed according to the decreasingly ordered bids of the participating individuals. The reproductive success of an individual is proportional to its fitness given by the sum of the rewards won minus its payments. Hence, successful bidding strategies spread in the population. We find that the results for the multiple reward case are very different from the single reward case. While the mixed strategy equilibrium in the single reward case with more than two players consists of mostly low-bidding individuals, we show that the equilibrium can convert to many high-bidding individuals and a few low-bidding individuals in the multiple reward case. Some reward values lead to a specialization among the individuals where one subpopulation competes for the rewards and the other subpopulation largely avoids costly competitions. Whether the mixed strategy equilibrium is an evolutionarily stable strategy (ESS) depends on the specific values of the rewards.","lang":"eng"}],"day":"15","date_published":"2015-07-15T00:00:00Z","author":[{"last_name":"Reiter","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0170-7353","first_name":"Johannes","full_name":"Reiter, Johannes"},{"last_name":"Kanodia","first_name":"Ayush","full_name":"Kanodia, Ayush"},{"first_name":"Raghav","full_name":"Gupta, Raghav","last_name":"Gupta"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"},{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"article_type":"original","acknowledgement":"This work was supported by grants from the John Templeton Foundation, ERC Start Grant (279307: Graph Games), FWF NFN Grant (No S11407N23 RiSE/SHiNE), FWF Grant (No P23499N23) and a Microsoft faculty fellows award.","issue":"1812","doi":"10.1098/rspb.2015.1041"},{"date_published":"2015-07-14T00:00:00Z","oa":1,"arxiv":1,"author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","last_name":"Akopyan","first_name":"Arseniy","full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X"},{"first_name":"Alexander","full_name":"Plakhov, Alexander","last_name":"Plakhov"}],"abstract":[{"lang":"eng","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 → ∞."}],"day":"14","doi":"10.1137/140993843","issue":"4","intvolume":"        47","year":"2015","date_created":"2018-12-11T11:53:36Z","external_id":{"arxiv":["1410.3736"],"isi":["000360691500009"]},"title":"Minimal resistance of curves under the single impact assumption","citation":{"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>.","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>","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.","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.","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>.","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."},"article_processing_charge":"No","publisher":"SIAM","language":[{"iso":"eng"}],"publication":"Society for Industrial and Applied Mathematics","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7"}],"ec_funded":1,"scopus_import":"1","type":"journal_article","department":[{"_id":"HeEd"}],"publication_status":"published","volume":47,"month":"07","isi":1,"status":"public","date_updated":"2025-09-23T09:35:36Z","publist_id":"5423","main_file_link":[{"url":"http://arxiv.org/abs/1410.3736","open_access":"1"}],"quality_controlled":"1","_id":"1710","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"2754 - 2769","oa_version":"Preprint"},{"date_published":"2015-10-01T00:00:00Z","author":[{"orcid":"0000-0001-7190-0776","full_name":"Ratheesh, Aparna","first_name":"Aparna","last_name":"Ratheesh","id":"2F064CFE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Vera","full_name":"Belyaeva, Vera","id":"47F080FE-F248-11E8-B48F-1D18A9856A87","last_name":"Belyaeva"},{"last_name":"Siekhaus","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8323-8353","full_name":"Siekhaus, Daria E","first_name":"Daria E"}],"oa":1,"abstract":[{"lang":"eng","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."}],"day":"01","doi":"10.1016/j.ceb.2015.07.003","issue":"10","year":"2015","date_created":"2018-12-11T11:53:36Z","intvolume":"        36","external_id":{"isi":["000364577600011"]},"title":"Drosophila immune cell migration and adhesion during embryonic development and larval immune responses","has_accepted_license":"1","citation":{"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.","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>.","short":"A. Ratheesh, V. Belyaeva, D.E. Siekhaus, Current Opinion in Cell Biology 36 (2015) 71–79.","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>","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>."},"article_processing_charge":"No","file":[{"file_id":"5098","relation":"main_file","access_level":"open_access","checksum":"bbb1ee39ca52929aefe4f48752b166ee","creator":"system","file_name":"IST-2015-346-v1+1_Current_Opinion_Review_Ratheesh_et_al_2015.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:45:13Z","file_size":1023680,"date_created":"2018-12-12T10:14:44Z"}],"publisher":"Elsevier","file_date_updated":"2020-07-14T12:45:13Z","ddc":["573"],"pubrep_id":"346","language":[{"iso":"eng"}],"publication":"Current Opinion in Cell Biology","project":[{"name":"Investigating the role of transporters in invasive migration through junctions","_id":"2536F660-B435-11E9-9278-68D0E5697425","grant_number":"334077","call_identifier":"FP7"}],"ec_funded":1,"scopus_import":"1","corr_author":"1","type":"journal_article","department":[{"_id":"DaSi"}],"isi":1,"month":"10","publication_status":"published","volume":36,"publist_id":"5421","status":"public","date_updated":"2025-09-23T08:29:26Z","tmp":{"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)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)"},"quality_controlled":"1","oa_version":"Published Version","_id":"1712","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"71 - 79","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/"},{"type":"conference","department":[{"_id":"KrCh"}],"scopus_import":"1","publication":"Real-Time Systems Symposium","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"1714","page":"118 - 127","oa_version":"None","quality_controlled":"1","related_material":{"record":[{"relation":"earlier_version","id":"5423","status":"public"},{"id":"821","status":"public","relation":"dissertation_contains"}]},"date_updated":"2026-04-08T14:22:16Z","status":"public","publist_id":"5417","isi":1,"volume":2015,"publication_status":"published","month":"01","issue":"January","doi":"10.1109/RTSS.2014.9","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"}],"conference":{"end_date":"2014-12-05","name":"RTSS: Real-Time Systems Symposium","start_date":"2014-12-02","location":"Rome, Italy"},"day":"15","date_published":"2015-01-15T00:00:00Z","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-8943-0722","first_name":"Andreas","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alexander","full_name":"Kößler, Alexander","last_name":"Kößler"},{"first_name":"Ulrich","full_name":"Schmid, Ulrich","last_name":"Schmid"}],"citation":{"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>","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>.","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>."},"article_processing_charge":"No","publisher":"IEEE","title":"A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks","year":"2015","date_created":"2018-12-11T11:53:37Z","intvolume":"      2015","external_id":{"isi":["000569750000012"]}},{"publist_id":"5256","status":"public","date_updated":"2025-09-23T08:44:39Z","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"publication_status":"published","month":"03","volume":85,"isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"1845","oa_version":"Published Version","page":"1149 - 1151","license":"https://creativecommons.org/licenses/by-nc/4.0/","quality_controlled":"1","publication":"Neuron","pubrep_id":"822","language":[{"iso":"eng"}],"type":"journal_article","department":[{"_id":"PeJo"}],"scopus_import":"1","corr_author":"1","title":"Excitement about inhibitory presynaptic terminals","has_accepted_license":"1","intvolume":"        85","date_created":"2018-12-11T11:54:19Z","year":"2015","external_id":{"isi":["000351319000002"]},"ddc":["570"],"file_date_updated":"2020-07-14T12:45:19Z","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>","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>.","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.","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>","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>.","short":"D.H. Vandael, C. Espinoza Martinez, P.M. Jonas, Neuron 85 (2015) 1149–1151."},"article_processing_charge":"No","file":[{"date_updated":"2020-07-14T12:45:19Z","file_size":411832,"creator":"system","file_name":"IST-2017-822-v1+1_Perspective_Fig__Final.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:16:07Z","file_id":"5192","relation":"main_file","checksum":"d1808550e376a0eca2a950fda017cfa6","access_level":"open_access"},{"content_type":"application/pdf","file_name":"IST-2017-822-v1+2_Perspective_Final2.pdf","creator":"system","date_updated":"2020-07-14T12:45:19Z","file_size":100769,"date_created":"2018-12-12T10:16:07Z","file_id":"5193","access_level":"open_access","checksum":"a279f4ae61e6c8f33d68f69a0d02097d","relation":"main_file"}],"publisher":"Elsevier","abstract":[{"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.","lang":"eng"}],"day":"18","date_published":"2015-03-18T00:00:00Z","oa":1,"author":[{"last_name":"Vandael","id":"3AE48E0A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7577-1676","full_name":"Vandael, David H","first_name":"David H"},{"id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","last_name":"Espinoza Martinez","first_name":"Claudia ","full_name":"Espinoza Martinez, Claudia ","orcid":"0000-0003-4710-2082"},{"orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","first_name":"Peter M","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"issue":"6","doi":"10.1016/j.neuron.2015.03.006"},{"date_updated":"2025-09-23T10:33:12Z","status":"public","publist_id":"5255","isi":1,"volume":52,"month":"04","publication_status":"published","_id":"1846","page":"269 - 297","oa_version":"Submitted Version","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"}],"publication":"Acta Informatica","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"type":"journal_article","corr_author":"1","scopus_import":"1","ec_funded":1,"has_accepted_license":"1","title":"Refinement checking on parametric modal transition systems","external_id":{"isi":["000351160200008"]},"date_created":"2018-12-11T11:54:20Z","year":"2015","intvolume":"        52","ddc":["000"],"file_date_updated":"2020-07-14T12:45:19Z","publisher":"Springer","article_processing_charge":"No","file":[{"access_level":"open_access","checksum":"fb4037ddc4fc05f33080dd3547ede350","relation":"main_file","file_id":"7854","date_created":"2020-05-15T08:57:44Z","file_size":488482,"date_updated":"2020-07-14T12:45:19Z","content_type":"application/pdf","creator":"dernst","file_name":"2015_ActaInfo_Benes.pdf"}],"citation":{"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>","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>.","short":"N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, J. Srba, Acta Informatica 52 (2015) 269–297.","apa":"Beneš, N., Kretinsky, J., Larsen, K., Möller, M., Sickert, S., &#38; Srba, J. (2015). Refinement checking on parametric modal transition systems. <i>Acta Informatica</i>. Springer. <a href=\"https://doi.org/10.1007/s00236-015-0215-4\">https://doi.org/10.1007/s00236-015-0215-4</a>","chicago":"Beneš, Nikola, Jan Kretinsky, Kim Larsen, Mikael Möller, Salomon Sickert, and Jiří Srba. “Refinement Checking on Parametric Modal Transition Systems.” <i>Acta Informatica</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s00236-015-0215-4\">https://doi.org/10.1007/s00236-015-0215-4</a>.","ista":"Beneš N, Kretinsky J, Larsen K, Möller M, Sickert S, Srba J. 2015. Refinement checking on parametric modal transition systems. Acta Informatica. 52(2–3), 269–297.","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."},"day":"01","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."}],"author":[{"full_name":"Beneš, Nikola","first_name":"Nikola","last_name":"Beneš"},{"orcid":"0000-0002-8122-2881","first_name":"Jan","full_name":"Kretinsky, Jan","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Kim","full_name":"Larsen, Kim","last_name":"Larsen"},{"full_name":"Möller, Mikael","first_name":"Mikael","last_name":"Möller"},{"last_name":"Sickert","first_name":"Salomon","full_name":"Sickert, Salomon"},{"last_name":"Srba","first_name":"Jiří","full_name":"Srba, Jiří"}],"oa":1,"date_published":"2015-04-01T00:00:00Z","issue":"2-3","article_type":"original","doi":"10.1007/s00236-015-0215-4"},{"language":[{"iso":"eng"}],"publication":"Molecular Plant","scopus_import":"1","corr_author":"1","department":[{"_id":"JiFr"}],"type":"journal_article","isi":1,"month":"03","publication_status":"published","volume":8,"status":"public","date_updated":"2025-09-23T07:30:08Z","publist_id":"5254","quality_controlled":"1","page":"356 - 358","_id":"1847","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"None","author":[{"full_name":"Grones, Peter","first_name":"Peter","id":"399876EC-F248-11E8-B48F-1D18A9856A87","last_name":"Grones"},{"last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","first_name":"Jiřĺ","full_name":"Friml, Jiřĺ"}],"date_published":"2015-03-02T00:00:00Z","day":"02","doi":"10.1016/j.molp.2014.12.013","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).","issue":"3","external_id":{"isi":["000350813400003"]},"date_created":"2018-12-11T11:54:20Z","year":"2015","intvolume":"         8","title":"ABP1: Finally docking","publisher":"Elsevier","article_processing_charge":"No","citation":{"ista":"Grones P, Friml J. 2015. ABP1: Finally docking. Molecular Plant. 8(3), 356–358.","ieee":"P. Grones and J. Friml, “ABP1: Finally docking,” <i>Molecular Plant</i>, vol. 8, no. 3. Elsevier, pp. 356–358, 2015.","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>.","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>","short":"P. Grones, J. Friml, Molecular Plant 8 (2015) 356–358.","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>.","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>"}},{"doi":"10.1016/j.bbamcr.2015.02.017","issue":"9","acknowledgement":"The contributing authors were supported by the Ghent University Special Research Fund (to E.H.), the Interuniversity Attraction Poles Programme (IAP VI/33 and IUAP P7/29 ‘MARS’), the European Research Council (project ERC-2011-StG-20101109-PSDP, to J.F.), and the Research Foundation Flanders (to S.V.).","date_published":"2015-09-01T00:00:00Z","author":[{"first_name":"Ellie","full_name":"Himschoot, Ellie","last_name":"Himschoot"},{"full_name":"Beeckman, Tom","first_name":"Tom","last_name":"Beeckman"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","full_name":"Friml, Jiřĺ","first_name":"Jiřĺ","orcid":"0000-0002-8302-7596"},{"first_name":"Steffen","full_name":"Vanneste, Steffen","last_name":"Vanneste"}],"abstract":[{"text":"Cell polarity is a fundamental property of pro- and eukaryotic cells. It is necessary for coordination of cell division, cell morphogenesis and signaling processes. How polarity is generated and maintained is a complex issue governed by interconnected feed-back regulations between small GTPase signaling and membrane tension-based signaling that controls membrane trafficking, and cytoskeleton organization and dynamics. Here, we will review the potential role for calcium as a crucial signal that connects and coordinates the respective processes during polarization processes in plants. This article is part of a Special Issue entitled: 13th European Symposium on Calcium.","lang":"eng"}],"day":"01","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.","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.","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>.","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>","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>."},"publisher":"Elsevier","article_processing_charge":"No","intvolume":"      1853","date_created":"2018-12-11T11:54:21Z","year":"2015","external_id":{"isi":["000359960400028"]},"title":"Calcium is an organizer of cell polarity in plants","scopus_import":"1","type":"journal_article","department":[{"_id":"JiFr"}],"language":[{"iso":"eng"}],"publication":"Biochimica et Biophysica Acta - Molecular Cell Research","quality_controlled":"1","page":"2168 - 2172","_id":"1849","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"None","volume":1853,"month":"09","publication_status":"published","isi":1,"publist_id":"5252","date_updated":"2025-09-23T08:04:01Z","status":"public"},{"has_accepted_license":"1","title":"Fungal disease dynamics in insect societies: Optimal killing rates and the ambivalent effect of high social interaction rates","external_id":{"isi":["000353311700006"]},"intvolume":"       372","date_created":"2018-12-11T11:54:21Z","year":"2015","file_date_updated":"2020-07-14T12:45:19Z","ddc":["576"],"article_processing_charge":"No","file":[{"date_created":"2018-12-12T10:18:07Z","date_updated":"2020-07-14T12:45:19Z","file_size":1546914,"content_type":"application/pdf","creator":"system","file_name":"IST-2015-329-v1+1_manuscript.pdf","checksum":"3c0dcacc900bc45cc65a453dfda4ca43","access_level":"open_access","relation":"main_file","file_id":"5326"}],"publisher":"Elsevier","citation":{"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.","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>","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>.","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>."},"day":"07","abstract":[{"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.","lang":"eng"}],"oa":1,"author":[{"full_name":"Novak, Sebastian","first_name":"Sebastian","orcid":"0000-0002-2519-824X","id":"461468AE-F248-11E8-B48F-1D18A9856A87","last_name":"Novak"},{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","last_name":"Cremer","first_name":"Sylvia","full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868"}],"date_published":"2015-05-07T00:00:00Z","issue":"5","doi":"10.1016/j.jtbi.2015.02.018","date_updated":"2025-09-23T08:54:35Z","publist_id":"5251","status":"public","month":"05","volume":372,"publication_status":"published","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"1850","page":"54 - 64","oa_version":"Submitted Version","quality_controlled":"1","project":[{"name":"Limits to selection in biology and in evolutionary computation","_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"250152"},{"call_identifier":"FP7","grant_number":"243071","name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","_id":"25DC711C-B435-11E9-9278-68D0E5697425"}],"publication":"Journal of Theoretical Biology","language":[{"iso":"eng"}],"pubrep_id":"329","department":[{"_id":"NiBa"},{"_id":"SyCr"}],"type":"journal_article","scopus_import":"1","corr_author":"1","ec_funded":1},{"date_created":"2018-12-11T11:54:21Z","year":"2015","intvolume":"        69","external_id":{"isi":["000353236000014"],"pmid":["25662095"]},"publication_identifier":{"issn":["0014-3820"],"eissn":["1558-5646"]},"pmid":1,"title":"Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating","has_accepted_license":"1","citation":{"ista":"Priklopil T, Kisdi E, Gyllenberg M. 2015. Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating. Evolution. 69(4), 1015–1026.","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.","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>.","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>","short":"T. Priklopil, E. Kisdi, M. Gyllenberg, Evolution 69 (2015) 1015–1026.","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>.","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>"},"article_processing_charge":"No","publisher":"Wiley","file":[{"date_created":"2020-05-15T09:05:34Z","content_type":"application/pdf","file_name":"2015_Evolution_Priklopil.pdf","creator":"dernst","file_size":967214,"date_updated":"2020-07-14T12:45:19Z","access_level":"open_access","checksum":"1e8be0b1d7598a78cd2623d8ee8e7798","relation":"main_file","file_id":"7855"}],"ddc":["570"],"file_date_updated":"2020-07-14T12:45:19Z","date_published":"2015-02-09T00:00:00Z","author":[{"last_name":"Priklopil","id":"3C869AA0-F248-11E8-B48F-1D18A9856A87","full_name":"Priklopil, Tadeas","first_name":"Tadeas"},{"last_name":"Kisdi","full_name":"Kisdi, Eva","first_name":"Eva"},{"last_name":"Gyllenberg","full_name":"Gyllenberg, Mats","first_name":"Mats"}],"oa":1,"abstract":[{"lang":"eng","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."}],"day":"09","doi":"10.1111/evo.12618","article_type":"original","issue":"4","isi":1,"month":"02","volume":69,"publication_status":"published","date_updated":"2025-09-22T14:27:30Z","status":"public","publist_id":"5249","quality_controlled":"1","_id":"1851","page":"1015 - 1026","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"Submitted Version","language":[{"iso":"eng"}],"publication":"Evolution","project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734"}],"ec_funded":1,"corr_author":"1","scopus_import":"1","type":"journal_article","department":[{"_id":"NiBa"},{"_id":"KrCh"}]},{"date_published":"2015-03-03T00:00:00Z","oa":1,"author":[{"last_name":"Mcmahon","first_name":"Dino","full_name":"Mcmahon, Dino"},{"full_name":"Fürst, Matthias","first_name":"Matthias","orcid":"0000-0002-3712-925X","id":"393B1196-F248-11E8-B48F-1D18A9856A87","last_name":"Fürst"},{"last_name":"Caspar","full_name":"Caspar, Jesicca","first_name":"Jesicca"},{"first_name":"Panagiotis","full_name":"Theodorou, Panagiotis","last_name":"Theodorou"},{"full_name":"Brown, Mark","first_name":"Mark","last_name":"Brown"},{"last_name":"Paxton","first_name":"Robert","full_name":"Paxton, Robert"}],"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"}],"day":"03","doi":"10.1111/1365-2656.12345","article_type":"original","issue":"3","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.","intvolume":"        84","date_created":"2018-12-11T11:54:23Z","year":"2015","external_id":{"pmid":["25646973"],"isi":["000353405300004"]},"pmid":1,"title":"A sting in the spit: Widespread cross-infection of multiple RNA viruses across wild and managed bees","has_accepted_license":"1","citation":{"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.","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>.","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>","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>","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>."},"article_processing_charge":"No","file":[{"file_id":"5350","relation":"main_file","access_level":"open_access","checksum":"542a0b9b07e78050a81b35f26f0b82da","date_updated":"2020-07-14T12:45:19Z","file_size":1823045,"creator":"system","file_name":"IST-2016-460-v1+1_McMahon_et_al-2015-Journal_of_Animal_Ecology.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:18:29Z"}],"publisher":"Wiley","file_date_updated":"2020-07-14T12:45:19Z","ddc":["570"],"pubrep_id":"460","language":[{"iso":"eng"}],"publication":"Journal of Animal Ecology","scopus_import":"1","type":"journal_article","department":[{"_id":"SyCr"}],"month":"03","publication_status":"published","volume":84,"isi":1,"status":"public","publist_id":"5245","date_updated":"2025-09-23T07:26:24Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"quality_controlled":"1","related_material":{"record":[{"status":"public","id":"9720","relation":"research_data"}]},"_id":"1855","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"Published Version","page":"615 - 624"},{"language":[{"iso":"eng"}],"project":[{"call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF"},{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"publication":"Journal of the ACM","scopus_import":"1","ec_funded":1,"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"type":"journal_article","publication_status":"published","volume":62,"month":"02","isi":1,"main_file_link":[{"url":"https://arxiv.org/abs/1004.0739","open_access":"1"}],"publist_id":"5244","date_updated":"2025-09-23T09:33:01Z","status":"public","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3864"}]},"quality_controlled":"1","article_number":"9","_id":"1856","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"Preprint","oa":1,"arxiv":1,"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"last_name":"Jobstmann","full_name":"Jobstmann, Barbara","first_name":"Barbara"},{"first_name":"Rohit","full_name":"Singh, Rohit","last_name":"Singh"}],"date_published":"2015-02-01T00:00:00Z","day":"01","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"}],"doi":"10.1145/2699430","issue":"1","external_id":{"isi":["000350563000009"],"arxiv":["1004.0739"]},"intvolume":"        62","year":"2015","date_created":"2018-12-11T11:54:23Z","title":"Measuring and synthesizing systems in probabilistic environments","publisher":"ACM","article_processing_charge":"No","citation":{"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.","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2015. Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. 62(1), 9.","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>","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>.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, Journal of the ACM 62 (2015).","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>.","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>"}},{"language":[{"iso":"eng"}],"scopus_import":"1","corr_author":"1","department":[{"_id":"ChLa"}],"type":"conference","month":"06","publication_status":"published","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1412.1353"}],"publist_id":"5243","date_updated":"2025-06-11T07:19:52Z","status":"public","quality_controlled":"1","_id":"1857","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","page":"5492 - 5500","oa":1,"arxiv":1,"author":[{"full_name":"Pentina, Anastasia","first_name":"Anastasia","id":"42E87FC6-F248-11E8-B48F-1D18A9856A87","last_name":"Pentina"},{"last_name":"Sharmanska","id":"2EA6D09E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0192-9308","full_name":"Sharmanska, Viktoriia","first_name":"Viktoriia"},{"full_name":"Lampert, Christoph","first_name":"Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert"}],"date_published":"2015-06-01T00:00:00Z","day":"01","conference":{"location":"Boston, MA, United States","start_date":"2015-06-07","name":"CVPR: Computer Vision and Pattern Recognition","end_date":"2015-06-12"},"abstract":[{"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. ","lang":"eng"}],"doi":"10.1109/CVPR.2015.7299188","external_id":{"arxiv":["1412.1353"]},"year":"2015","date_created":"2018-12-11T11:54:23Z","title":"Curriculum learning of multiple tasks","publisher":"IEEE","article_processing_charge":"No","citation":{"ista":"Pentina A, Sharmanska V, Lampert C. 2015. Curriculum learning of multiple tasks. CVPR: Computer Vision and Pattern Recognition, 5492–5500.","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.","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>","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>.","short":"A. Pentina, V. Sharmanska, C. Lampert, in:, IEEE, 2015, pp. 5492–5500.","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>.","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>"}},{"publisher":"IEEE","quality_controlled":"1","citation":{"ista":"Lampert C. 2015. Predicting the future behavior of a time-varying probability distribution. CVPR: Computer Vision and Pattern Recognition, 942–950.","ieee":"C. Lampert, “Predicting the future behavior of a time-varying probability distribution,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States, 2015, pp. 942–950.","chicago":"Lampert, Christoph. “Predicting the Future Behavior of a Time-Varying Probability Distribution,” 942–50. IEEE, 2015. <a href=\"https://doi.org/10.1109/CVPR.2015.7298696\">https://doi.org/10.1109/CVPR.2015.7298696</a>.","apa":"Lampert, C. (2015). Predicting the future behavior of a time-varying probability distribution (pp. 942–950). Presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2015.7298696\">https://doi.org/10.1109/CVPR.2015.7298696</a>","short":"C. Lampert, in:, IEEE, 2015, pp. 942–950.","mla":"Lampert, Christoph. <i>Predicting the Future Behavior of a Time-Varying Probability Distribution</i>. IEEE, 2015, pp. 942–50, doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7298696\">10.1109/CVPR.2015.7298696</a>.","ama":"Lampert C. Predicting the future behavior of a time-varying probability distribution. In: IEEE; 2015:942-950. doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7298696\">10.1109/CVPR.2015.7298696</a>"},"_id":"1858","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","page":"942 - 950","publication_status":"published","month":"10","external_id":{"arxiv":["1406.5362"]},"year":"2015","date_created":"2018-12-11T11:54:24Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1406.5362"}],"title":"Predicting the future behavior of a time-varying probability distribution","status":"public","date_updated":"2024-10-09T20:56:24Z","publist_id":"5241","scopus_import":1,"corr_author":"1","doi":"10.1109/CVPR.2015.7298696","department":[{"_id":"ChLa"}],"type":"conference","oa":1,"language":[{"iso":"eng"}],"author":[{"first_name":"Christoph","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert"}],"arxiv":1,"date_published":"2015-10-15T00:00:00Z","day":"15","abstract":[{"text":"We study the problem of predicting the future, though only in the probabilistic sense of estimating a future state of a time-varying probability distribution. This is not only an interesting academic problem, but solving this extrapolation problem also has many practical application, e.g. for training classifiers that have to operate under time-varying conditions. Our main contribution is a method for predicting the next step of the time-varying distribution from a given sequence of sample sets from earlier time steps. For this we rely on two recent machine learning techniques: embedding probability distributions into a reproducing kernel Hilbert space, and learning operators by vector-valued regression. We illustrate the working principles and the practical usefulness of our method by experiments on synthetic and real data. We also highlight an exemplary application: training a classifier in a domain adaptation setting without having access to examples from the test time distribution at training time.","lang":"eng"}],"conference":{"name":"CVPR: Computer Vision and Pattern Recognition","end_date":"2015-06-12","start_date":"2015-06-07","location":"Boston, MA, United States"}},{"type":"conference","department":[{"_id":"VlKo"},{"_id":"ChLa"}],"ec_funded":1,"scopus_import":"1","corr_author":"1","project":[{"grant_number":"308036","call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425"},{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160","call_identifier":"FP7"}],"language":[{"iso":"eng"}],"_id":"1859","page":"2737 - 2745","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","quality_controlled":"1","status":"public","date_updated":"2025-06-11T07:20:12Z","publist_id":"5240","main_file_link":[{"url":"http://arxiv.org/abs/1408.6804","open_access":"1"}],"month":"06","publication_status":"published","doi":"10.1109/CVPR.2015.7298890","conference":{"location":"Boston, MA, USA","start_date":"2015-06-07","end_date":"2015-06-12","name":"CVPR: Computer Vision and Pattern Recognition"},"abstract":[{"lang":"eng","text":"Structural support vector machines (SSVMs) are amongst the best performing models for structured computer vision tasks, such as semantic image segmentation or human pose estimation. Training SSVMs, however, is computationally costly, because it requires repeated calls to a structured prediction subroutine (called \\emph{max-oracle}), which has to solve an optimization problem itself, e.g. a graph cut.\r\nIn this work, we introduce a new algorithm for SSVM training that is more efficient than earlier techniques when the max-oracle is computationally expensive, as it is frequently the case in computer vision tasks. The main idea is to (i) combine the recent stochastic Block-Coordinate Frank-Wolfe algorithm with efficient hyperplane caching, and (ii) use an automatic selection rule for deciding whether to call the exact max-oracle or to rely on an approximate one based on the cached hyperplanes.\r\nWe show experimentally that this strategy leads to faster convergence to the optimum with respect to the number of requires oracle calls, and that this translates into faster convergence with respect to the total runtime when the max-oracle is slow compared to the other steps of the algorithm. "}],"day":"01","date_published":"2015-06-01T00:00:00Z","oa":1,"arxiv":1,"author":[{"first_name":"Neel","full_name":"Shah, Neel","id":"31ABAF80-F248-11E8-B48F-1D18A9856A87","last_name":"Shah"},{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"citation":{"mla":"Shah, Neel, et al. <i>A Multi-Plane Block-Coordinate Frank-Wolfe Algorithm for Training Structural SVMs with a Costly Max-Oracle</i>. IEEE, 2015, pp. 2737–45, doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7298890\">10.1109/CVPR.2015.7298890</a>.","ama":"Shah N, Kolmogorov V, Lampert C. A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle. In: IEEE; 2015:2737-2745. doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7298890\">10.1109/CVPR.2015.7298890</a>","short":"N. Shah, V. Kolmogorov, C. Lampert, in:, IEEE, 2015, pp. 2737–2745.","apa":"Shah, N., Kolmogorov, V., &#38; Lampert, C. (2015). A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle (pp. 2737–2745). Presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, USA: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2015.7298890\">https://doi.org/10.1109/CVPR.2015.7298890</a>","chicago":"Shah, Neel, Vladimir Kolmogorov, and Christoph Lampert. “A Multi-Plane Block-Coordinate Frank-Wolfe Algorithm for Training Structural SVMs with a Costly Max-Oracle,” 2737–45. IEEE, 2015. <a href=\"https://doi.org/10.1109/CVPR.2015.7298890\">https://doi.org/10.1109/CVPR.2015.7298890</a>.","ista":"Shah N, Kolmogorov V, Lampert C. 2015. A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle. CVPR: Computer Vision and Pattern Recognition, 2737–2745.","ieee":"N. Shah, V. Kolmogorov, and C. Lampert, “A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, USA, 2015, pp. 2737–2745."},"publisher":"IEEE","article_processing_charge":"No","title":"A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle","year":"2015","date_created":"2018-12-11T11:54:24Z","external_id":{"arxiv":["1408.6804"]}},{"project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036","call_identifier":"FP7"}],"day":"01","conference":{"location":"Boston, MA, United States","start_date":"2015-06-07","end_date":"2015-06-12","name":"CVPR: Computer Vision and Pattern Recognition"},"abstract":[{"lang":"eng","text":"Classifiers for object categorization are usually evaluated by their accuracy on a set of i.i.d. test examples. This provides us with an estimate of the expected error when applying the classifiers to a single new image. In real application, however, classifiers are rarely only used for a single image and then discarded. Instead, they are applied sequentially to many images, and these are typically not i.i.d. samples from a fixed data distribution, but they carry dependencies and their class distribution varies over time. In this work, we argue that the phenomenon of correlated data at prediction time is not a nuisance, but a blessing in disguise. We describe a probabilistic method for adapting classifiers at prediction time without having to retrain them. We also introduce a framework for creating realistically distributed image sequences, which offers a way to benchmark classifier adaptation methods, such as the one we propose. Experiments on the ILSVRC2010 and ILSVRC2012 datasets show that adapting object classification systems at prediction time can significantly reduce their error rate, even with no additional human feedback."}],"author":[{"first_name":"Amélie","full_name":"Royer, Amélie","last_name":"Royer"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","full_name":"Lampert, Christoph","first_name":"Christoph","orcid":"0000-0001-8622-7887"}],"language":[{"iso":"eng"}],"oa":1,"date_published":"2015-06-01T00:00:00Z","department":[{"_id":"ChLa"}],"type":"conference","scopus_import":1,"ec_funded":1,"doi":"10.1109/CVPR.2015.7298746","main_file_link":[{"url":"http://www.cv-foundation.org/openaccess/content_cvpr_2015/papers/Royer_Classifier_Adaptation_at_2015_CVPR_paper.pdf","open_access":"1"}],"date_updated":"2021-01-12T06:53:41Z","status":"public","publist_id":"5239","title":"Classifier adaptation at prediction time","month":"06","publication_status":"published","year":"2015","date_created":"2018-12-11T11:54:24Z","page":"1401 - 1409","_id":"1860","oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IEEE","quality_controlled":"1","citation":{"short":"A. Royer, C. Lampert, in:, IEEE, 2015, pp. 1401–1409.","mla":"Royer, Amélie, and Christoph Lampert. <i>Classifier Adaptation at Prediction Time</i>. IEEE, 2015, pp. 1401–09, doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7298746\">10.1109/CVPR.2015.7298746</a>.","ama":"Royer A, Lampert C. Classifier adaptation at prediction time. In: IEEE; 2015:1401-1409. doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7298746\">10.1109/CVPR.2015.7298746</a>","ieee":"A. Royer and C. Lampert, “Classifier adaptation at prediction time,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States, 2015, pp. 1401–1409.","ista":"Royer A, Lampert C. 2015. Classifier adaptation at prediction time. CVPR: Computer Vision and Pattern Recognition, 1401–1409.","apa":"Royer, A., &#38; Lampert, C. (2015). Classifier adaptation at prediction time (pp. 1401–1409). Presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2015.7298746\">https://doi.org/10.1109/CVPR.2015.7298746</a>","chicago":"Royer, Amélie, and Christoph Lampert. “Classifier Adaptation at Prediction Time,” 1401–9. IEEE, 2015. <a href=\"https://doi.org/10.1109/CVPR.2015.7298746\">https://doi.org/10.1109/CVPR.2015.7298746</a>."}},{"author":[{"last_name":"Ruess","id":"4A245D00-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1615-3282","first_name":"Jakob","full_name":"Ruess, Jakob"},{"last_name":"Lygeros","first_name":"John","full_name":"Lygeros, John"}],"date_published":"2015-02-01T00:00:00Z","day":"01","abstract":[{"lang":"eng","text":"Continuous-time Markov chains are commonly used in practice for modeling biochemical reaction networks in which the inherent randomness of themolecular interactions cannot be ignored. This has motivated recent research effort into methods for parameter inference and experiment design for such models. The major difficulty is that such methods usually require one to iteratively solve the chemical master equation that governs the time evolution of the probability distribution of the system. This, however, is rarely possible, and even approximation techniques remain limited to relatively small and simple systems. An alternative explored in this article is to base methods on only some low-order moments of the entire probability distribution. We summarize the theory behind such moment-based methods for parameter inference and experiment design and provide new case studies where we investigate their performance."}],"doi":"10.1145/2688906","acknowledgement":"HYCON2; EC; European Commission\r\n","issue":"2","external_id":{"isi":["000354789200002"]},"year":"2015","date_created":"2018-12-11T11:54:25Z","intvolume":"        25","title":"Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks","publisher":"ACM","article_processing_charge":"No","citation":{"mla":"Ruess, Jakob, and John Lygeros. “Moment-Based Methods for Parameter Inference and Experiment Design for Stochastic Biochemical Reaction Networks.” <i>ACM Transactions on Modeling and Computer Simulation</i>, vol. 25, no. 2, 8, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2688906\">10.1145/2688906</a>.","ama":"Ruess J, Lygeros J. Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks. <i>ACM Transactions on Modeling and Computer Simulation</i>. 2015;25(2). doi:<a href=\"https://doi.org/10.1145/2688906\">10.1145/2688906</a>","short":"J. Ruess, J. Lygeros, ACM Transactions on Modeling and Computer Simulation 25 (2015).","chicago":"Ruess, Jakob, and John Lygeros. “Moment-Based Methods for Parameter Inference and Experiment Design for Stochastic Biochemical Reaction Networks.” <i>ACM Transactions on Modeling and Computer Simulation</i>. ACM, 2015. <a href=\"https://doi.org/10.1145/2688906\">https://doi.org/10.1145/2688906</a>.","apa":"Ruess, J., &#38; Lygeros, J. (2015). Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks. <i>ACM Transactions on Modeling and Computer Simulation</i>. ACM. <a href=\"https://doi.org/10.1145/2688906\">https://doi.org/10.1145/2688906</a>","ista":"Ruess J, Lygeros J. 2015. Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks. ACM Transactions on Modeling and Computer Simulation. 25(2), 8.","ieee":"J. Ruess and J. Lygeros, “Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks,” <i>ACM Transactions on Modeling and Computer Simulation</i>, vol. 25, no. 2. ACM, 2015."},"language":[{"iso":"eng"}],"publication":"ACM Transactions on Modeling and Computer Simulation","scopus_import":"1","department":[{"_id":"ToHe"},{"_id":"GaTk"}],"type":"journal_article","isi":1,"publication_status":"published","volume":25,"month":"02","publist_id":"5238","date_updated":"2025-09-23T09:36:19Z","status":"public","article_number":"8","quality_controlled":"1","_id":"1861","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"None"},{"citation":{"mla":"Erdös, László, and Antti Knowles. “The Altshuler-Shklovskii Formulas for Random Band Matrices II: The General Case.” <i>Annales Henri Poincare</i>, vol. 16, no. 3, Springer, 2015, pp. 709–99, doi:<a href=\"https://doi.org/10.1007/s00023-014-0333-5\">10.1007/s00023-014-0333-5</a>.","ama":"Erdös L, Knowles A. The Altshuler-Shklovskii formulas for random band matrices II: The general case. <i>Annales Henri Poincare</i>. 2015;16(3):709-799. doi:<a href=\"https://doi.org/10.1007/s00023-014-0333-5\">10.1007/s00023-014-0333-5</a>","short":"L. Erdös, A. Knowles, Annales Henri Poincare 16 (2015) 709–799.","chicago":"Erdös, László, and Antti Knowles. “The Altshuler-Shklovskii Formulas for Random Band Matrices II: The General Case.” <i>Annales Henri Poincare</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s00023-014-0333-5\">https://doi.org/10.1007/s00023-014-0333-5</a>.","apa":"Erdös, L., &#38; Knowles, A. (2015). The Altshuler-Shklovskii formulas for random band matrices II: The general case. <i>Annales Henri Poincare</i>. Springer. <a href=\"https://doi.org/10.1007/s00023-014-0333-5\">https://doi.org/10.1007/s00023-014-0333-5</a>","ista":"Erdös L, Knowles A. 2015. The Altshuler-Shklovskii formulas for random band matrices II: The general case. Annales Henri Poincare. 16(3), 709–799.","ieee":"L. Erdös and A. Knowles, “The Altshuler-Shklovskii formulas for random band matrices II: The general case,” <i>Annales Henri Poincare</i>, vol. 16, no. 3. Springer, pp. 709–799, 2015."},"article_processing_charge":"No","publisher":"Springer","title":"The Altshuler-Shklovskii formulas for random band matrices II: The general case","intvolume":"        16","date_created":"2018-12-11T11:54:26Z","year":"2015","external_id":{"isi":["000349364100002"],"arxiv":["1309.5107"]},"issue":"3","doi":"10.1007/s00023-014-0333-5","abstract":[{"text":"The Altshuler–Shklovskii formulas (Altshuler and Shklovskii, BZh Eksp Teor Fiz 91:200, 1986) predict, for any disordered quantum system in the diffusive regime, a universal power law behaviour for the correlation functions of the mesoscopic eigenvalue density. In this paper and its companion (Erdős and Knowles, The Altshuler–Shklovskii formulas for random band matrices I: the unimodular case, 2013), we prove these formulas for random band matrices. In (Erdős and Knowles, The Altshuler–Shklovskii formulas for random band matrices I: the unimodular case, 2013) we introduced a diagrammatic approach and presented robust estimates on general diagrams under certain simplifying assumptions. In this paper, we remove these assumptions by giving a general estimate of the subleading diagrams. We also give a precise analysis of the leading diagrams which give rise to the Altschuler–Shklovskii power laws. Moreover, we introduce a family of general random band matrices which interpolates between real symmetric (β = 1) and complex Hermitian (β = 2) models, and track the transition for the mesoscopic density–density correlation. Finally, we address the higher-order correlation functions by proving that they behave asymptotically according to a Gaussian process whose covariance is given by the Altshuler–Shklovskii formulas.\r\n","lang":"eng"}],"day":"01","date_published":"2015-03-01T00:00:00Z","oa":1,"arxiv":1,"author":[{"first_name":"László","full_name":"Erdös, László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös"},{"last_name":"Knowles","first_name":"Antti","full_name":"Knowles, Antti"}],"oa_version":"Preprint","_id":"1864","page":"709 - 799","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_updated":"2025-10-22T10:23:38Z","publist_id":"5233","main_file_link":[{"url":"http://arxiv.org/abs/1309.5107","open_access":"1"}],"volume":16,"publication_status":"published","month":"03","isi":1,"type":"journal_article","department":[{"_id":"LaEr"}],"ec_funded":1,"scopus_import":"1","publication":"Annales Henri Poincare","project":[{"call_identifier":"FP7","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}]},{"article_processing_charge":"No","publisher":"Company of Biologists","citation":{"mla":"Robert, Hélène, et al. “Plant Embryogenesis Requires AUX/LAX-Mediated Auxin Influx.” <i>Development</i>, vol. 142, no. 4, Company of Biologists, 2015, pp. 702–11, doi:<a href=\"https://doi.org/10.1242/dev.115832\">10.1242/dev.115832</a>.","ama":"Robert H, Grunewald W, Sauer M, et al. Plant embryogenesis requires AUX/LAX-mediated auxin influx. <i>Development</i>. 2015;142(4):702-711. doi:<a href=\"https://doi.org/10.1242/dev.115832\">10.1242/dev.115832</a>","short":"H. Robert, W. Grunewald, M. Sauer, B. Cannoot, M. Soriano, R. Swarup, D. Weijers, M. Bennett, K. Boutilier, J. Friml, Development 142 (2015) 702–711.","apa":"Robert, H., Grunewald, W., Sauer, M., Cannoot, B., Soriano, M., Swarup, R., … Friml, J. (2015). Plant embryogenesis requires AUX/LAX-mediated auxin influx. <i>Development</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/dev.115832\">https://doi.org/10.1242/dev.115832</a>","chicago":"Robert, Hélène, Wim Grunewald, Michael Sauer, Bernard Cannoot, Mercedes Soriano, Ranjan Swarup, Dolf Weijers, Malcolm Bennett, Kim Boutilier, and Jiří Friml. “Plant Embryogenesis Requires AUX/LAX-Mediated Auxin Influx.” <i>Development</i>. Company of Biologists, 2015. <a href=\"https://doi.org/10.1242/dev.115832\">https://doi.org/10.1242/dev.115832</a>.","ieee":"H. Robert <i>et al.</i>, “Plant embryogenesis requires AUX/LAX-mediated auxin influx,” <i>Development</i>, vol. 142, no. 4. Company of Biologists, pp. 702–711, 2015.","ista":"Robert H, Grunewald W, Sauer M, Cannoot B, Soriano M, Swarup R, Weijers D, Bennett M, Boutilier K, Friml J. 2015. Plant embryogenesis requires AUX/LAX-mediated auxin influx. Development. 142(4), 702–711."},"title":"Plant embryogenesis requires AUX/LAX-mediated auxin influx","external_id":{"isi":["000351697100011"]},"year":"2015","date_created":"2018-12-11T11:54:26Z","intvolume":"       142","acknowledgement":"W.G. is a post-doctoral fellow of the Research Foundation Flanders. H.S.R. is supported by Employment of Best Young Scientists for International Cooperation Empowerment [CZ.1.07/2.3.00/30.0037], co-financed by the European Social Fund and the state budget of the Czech Republic. Mi.S. was funded by the Ramón y Cajal program. This work was supported by the European Research Council [project ERC-2011-StG-20101109-PSDP], project ‘CEITEC – Central European Institute of Technology’ [CZ.1.05/1.1.00/02.0068], the European Social Fund [CZ.1.07/2.3.00/20.0043] and the Czech Science Foundation GACR [GA13-40637S] to J.F. We acknowledge funding from the Biological and Biotechnological Science Research Council (BBSRC) and Engineering Physics Science Research Council (EPSRC) to R.S. and M.B","issue":"4","doi":"10.1242/dev.115832","day":"15","abstract":[{"text":"The plant hormone auxin and its directional transport are known to play a crucial role in defining the embryonic axis and subsequent development of the body plan. Although the role of PIN auxin efflux transporters has been clearly assigned during embryonic shoot and root specification, the role of the auxin influx carriers AUX1 and LIKE-AUX1 (LAX) proteins is not well established. Here, we used chemical and genetic tools on Brassica napus microspore-derived embryos and Arabidopsis thaliana zygotic embryos, and demonstrate that AUX1, LAX1 and LAX2 are required for both shoot and root pole formation, in concert with PIN efflux carriers. Furthermore, we uncovered a positive-feedback loop betweenMONOPTEROS(ARF5)-dependent auxin signalling and auxin transport. ThisMONOPTEROSdependent transcriptional regulation of auxin influx (AUX1, LAX1 and LAX2) and auxin efflux (PIN1 and PIN4) carriers by MONOPTEROS helps to maintain proper auxin transport to the root tip. These results indicate that auxin-dependent cell specification during embryo development requires balanced auxin transport involving both influx and efflux mechanisms, and that this transport is maintained by a positive transcriptional feedback on auxin signalling.","lang":"eng"}],"author":[{"last_name":"Robert","first_name":"Hélène","full_name":"Robert, Hélène"},{"first_name":"Wim","full_name":"Grunewald, Wim","last_name":"Grunewald"},{"first_name":"Michael","full_name":"Sauer, Michael","last_name":"Sauer"},{"last_name":"Cannoot","first_name":"Bernard","full_name":"Cannoot, Bernard"},{"last_name":"Soriano","full_name":"Soriano, Mercedes","first_name":"Mercedes"},{"last_name":"Swarup","first_name":"Ranjan","full_name":"Swarup, Ranjan"},{"full_name":"Weijers, Dolf","first_name":"Dolf","last_name":"Weijers"},{"last_name":"Bennett","full_name":"Bennett, Malcolm","first_name":"Malcolm"},{"last_name":"Boutilier","first_name":"Kim","full_name":"Boutilier, Kim"},{"first_name":"Jirí","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml"}],"date_published":"2015-02-15T00:00:00Z","_id":"1865","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"None","page":"702 - 711","quality_controlled":"1","status":"public","date_updated":"2025-09-23T09:50:13Z","publist_id":"5231","isi":1,"month":"02","volume":142,"publication_status":"published","department":[{"_id":"JiFr"}],"type":"journal_article","scopus_import":"1","corr_author":"1","ec_funded":1,"project":[{"call_identifier":"FP7","grant_number":"282300","name":"Polarity and subcellular dynamics in plants","_id":"25716A02-B435-11E9-9278-68D0E5697425"}],"publication":"Development","language":[{"iso":"eng"}]},{"_id":"1866","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"None","page":"86-86","citation":{"ieee":"T. A. Henzinger and J. Raskin, “The equivalence problem for finite automata: Technical perspective,” <i>Communications of the ACM</i>, vol. 58, no. 2. ACM, pp. 86–86, 2015.","ista":"Henzinger TA, Raskin J. 2015. The equivalence problem for finite automata: Technical perspective. Communications of the ACM. 58(2), 86–86.","apa":"Henzinger, T. A., &#38; Raskin, J. (2015). The equivalence problem for finite automata: Technical perspective. <i>Communications of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2701001\">https://doi.org/10.1145/2701001</a>","chicago":"Henzinger, Thomas A, and Jean Raskin. “The Equivalence Problem for Finite Automata: Technical Perspective.” <i>Communications of the ACM</i>. ACM, 2015. <a href=\"https://doi.org/10.1145/2701001\">https://doi.org/10.1145/2701001</a>.","short":"T.A. Henzinger, J. Raskin, Communications of the ACM 58 (2015) 86–86.","ama":"Henzinger TA, Raskin J. The equivalence problem for finite automata: Technical perspective. <i>Communications of the ACM</i>. 2015;58(2):86-86. doi:<a href=\"https://doi.org/10.1145/2701001\">10.1145/2701001</a>","mla":"Henzinger, Thomas A., and Jean Raskin. “The Equivalence Problem for Finite Automata: Technical Perspective.” <i>Communications of the ACM</i>, vol. 58, no. 2, ACM, 2015, pp. 86–86, doi:<a href=\"https://doi.org/10.1145/2701001\">10.1145/2701001</a>."},"publisher":"ACM","article_processing_charge":"No","status":"public","publist_id":"5232","date_updated":"2025-09-23T13:49:40Z","title":"The equivalence problem for finite automata: Technical perspective","year":"2015","date_created":"2018-12-11T11:54:26Z","intvolume":"        58","external_id":{"isi":["000349299600024"]},"isi":1,"publication_status":"published","month":"01","volume":58,"type":"journal_article","department":[{"_id":"ToHe"}],"issue":"2","doi":"10.1145/2701001","scopus_import":"1","publication":"Communications of the ACM","day":"28","date_published":"2015-01-28T00:00:00Z","author":[{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Raskin","first_name":"Jean","full_name":"Raskin, Jean"}],"language":[{"iso":"eng"}]}]