[{"oa":1,"_id":"1697","project":[{"name":"Sensitivity to higher-order statistics in natural scenes","call_identifier":"FWF","_id":"254D1A94-B435-11E9-9278-68D0E5697425","grant_number":"P 25651-N26"}],"oa_version":"Published Version","department":[{"_id":"GaTk"}],"author":[{"full_name":"Marre, Olivier","first_name":"Olivier","last_name":"Marre"},{"last_name":"Botella Soler","first_name":"Vicente","id":"421234E8-F248-11E8-B48F-1D18A9856A87","full_name":"Botella Soler, Vicente","orcid":"0000-0002-8790-1914"},{"full_name":"Simmons, Kristina","last_name":"Simmons","first_name":"Kristina"},{"first_name":"Thierry","last_name":"Mora","full_name":"Mora, Thierry"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper","last_name":"Tkacik","first_name":"Gasper"},{"first_name":"Michael","last_name":"Berry","full_name":"Berry, Michael"}],"external_id":{"isi":["000360620100016"]},"abstract":[{"lang":"eng","text":"Motion tracking is a challenge the visual system has to solve by reading out the retinal population. It is still unclear how the information from different neurons can be combined together to estimate the position of an object. Here we recorded a large population of ganglion cells in a dense patch of salamander and guinea pig retinas while displaying a bar moving diffusively. We show that the bar’s position can be reconstructed from retinal activity with a precision in the hyperacuity regime using a linear decoder acting on 100+ cells. We then took advantage of this unprecedented precision to explore the spatial structure of the retina’s population code. The classical view would have suggested that the firing rates of the cells form a moving hill of activity tracking the bar’s position. Instead, we found that most ganglion cells in the salamander fired sparsely and idiosyncratically, so that their neural image did not track the bar. Furthermore, ganglion cell activity spanned an area much larger than predicted by their receptive fields, with cells coding for motion far in their surround. As a result, population redundancy was high, and we could find multiple, disjoint subsets of neurons that encoded the trajectory with high precision. This organization allows for diverse collections of ganglion cells to represent high-accuracy motion information in a form easily read out by downstream neural circuits."}],"file_date_updated":"2020-07-14T12:45:12Z","date_updated":"2025-09-23T09:15:57Z","year":"2015","volume":11,"pubrep_id":"455","publication_status":"published","file":[{"file_name":"IST-2016-455-v1+1_journal.pcbi.1004304.pdf","relation":"main_file","file_id":"5212","content_type":"application/pdf","file_size":4673930,"date_updated":"2020-07-14T12:45:12Z","access_level":"open_access","checksum":"472b979f3f1cffb37b3e503f085115ca","date_created":"2018-12-12T10:16:25Z","creator":"system"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"date_published":"2015-07-01T00:00:00Z","citation":{"mla":"Marre, Olivier, et al. “High Accuracy Decoding of Dynamical Motion from a Large Retinal Population.” <i>PLoS Computational Biology</i>, vol. 11, no. 7, e1004304, Public Library of Science, 2015, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1004304\">10.1371/journal.pcbi.1004304</a>.","ieee":"O. Marre, V. Botella Soler, K. Simmons, T. Mora, G. Tkačik, and M. Berry, “High accuracy decoding of dynamical motion from a large retinal population,” <i>PLoS Computational Biology</i>, vol. 11, no. 7. Public Library of Science, 2015.","chicago":"Marre, Olivier, Vicente Botella Soler, Kristina Simmons, Thierry Mora, Gašper Tkačik, and Michael Berry. “High Accuracy Decoding of Dynamical Motion from a Large Retinal Population.” <i>PLoS Computational Biology</i>. Public Library of Science, 2015. <a href=\"https://doi.org/10.1371/journal.pcbi.1004304\">https://doi.org/10.1371/journal.pcbi.1004304</a>.","ama":"Marre O, Botella Soler V, Simmons K, Mora T, Tkačik G, Berry M. High accuracy decoding of dynamical motion from a large retinal population. <i>PLoS Computational Biology</i>. 2015;11(7). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1004304\">10.1371/journal.pcbi.1004304</a>","short":"O. Marre, V. Botella Soler, K. Simmons, T. Mora, G. Tkačik, M. Berry, PLoS Computational Biology 11 (2015).","ista":"Marre O, Botella Soler V, Simmons K, Mora T, Tkačik G, Berry M. 2015. High accuracy decoding of dynamical motion from a large retinal population. PLoS Computational Biology. 11(7), e1004304.","apa":"Marre, O., Botella Soler, V., Simmons, K., Mora, T., Tkačik, G., &#38; Berry, M. (2015). High accuracy decoding of dynamical motion from a large retinal population. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1004304\">https://doi.org/10.1371/journal.pcbi.1004304</a>"},"article_number":"e1004304","intvolume":"        11","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"language":[{"iso":"eng"}],"publisher":"Public Library of Science","license":"https://creativecommons.org/licenses/by/4.0/","month":"07","publication":"PLoS Computational Biology","article_processing_charge":"No","quality_controlled":"1","ddc":["570"],"scopus_import":"1","publist_id":"5447","title":"High accuracy decoding of dynamical motion from a large retinal population","issue":"7","acknowledgement":"This work was supported by grants EY 014196 and EY 017934 to MJB, ANR OPTIMA, the French State program Investissements d’Avenir managed by the Agence Nationale de la Recherche [LIFESENSES: ANR-10-LABX-65], and by a EC grant from the Human Brain Project (CLAP) to OM, the Austrian Research Foundation FWF P25651 to VBS and GT. VBS is partially supported by contracts MEC, Spain (Grant No. AYA2010- 22111-C03-02, Grant No. AYA2013-48623-C2-2 and FEDER Funds).","day":"01","type":"journal_article","has_accepted_license":"1","status":"public","date_created":"2018-12-11T11:53:31Z","doi":"10.1371/journal.pcbi.1004304"},{"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"author":[{"first_name":"Yaron","last_name":"Velner","full_name":"Velner, Yaron"},{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"last_name":"Rabinovich","first_name":"Alexander","full_name":"Rabinovich, Alexander"},{"full_name":"Raskin, Jean","last_name":"Raskin","first_name":"Jean"}],"external_id":{"isi":["000353352800008"],"arxiv":["1209.3234"]},"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"}],"page":"177 - 196","oa":1,"project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"}],"_id":"1698","ec_funded":1,"oa_version":"Preprint","year":"2015","volume":241,"publication_status":"published","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-23T13:47:20Z","language":[{"iso":"eng"}],"publisher":"Elsevier","month":"04","publication":"Information and Computation","article_processing_charge":"No","quality_controlled":"1","date_published":"2015-04-01T00:00:00Z","citation":{"short":"Y. Velner, K. Chatterjee, L. Doyen, T.A. Henzinger, A. Rabinovich, J. Raskin, Information and Computation 241 (2015) 177–196.","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>","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.","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>"},"intvolume":"       241","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).","type":"journal_article","day":"01","status":"public","main_file_link":[{"url":"http://arxiv.org/abs/1209.3234","open_access":"1"}],"date_created":"2018-12-11T11:53:32Z","doi":"10.1016/j.ic.2015.03.001","arxiv":1,"corr_author":"1","publist_id":"5443","scopus_import":"1","title":"The complexity of multi-mean-payoff and multi-energy games","issue":"4"},{"publication":"Journal of Mathematical Biology","article_processing_charge":"No","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"Springer","month":"06","intvolume":"        70","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_published":"2015-06-01T00:00:00Z","citation":{"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>.","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>","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>.","short":"H. Uecker, D. Setter, J. Hermisson, Journal of Mathematical Biology 70 (2015) 1523–1580.","ista":"Uecker H, Setter D, Hermisson J. 2015. Adaptive gene introgression after secondary contact. Journal of Mathematical Biology. 70(7), 1523–1580.","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>"},"has_accepted_license":"1","status":"public","date_created":"2018-12-11T11:53:32Z","doi":"10.1007/s00285-014-0802-y","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).","type":"journal_article","day":"01","title":"Adaptive gene introgression after secondary contact","issue":"7","corr_author":"1","ddc":["576"],"publist_id":"5442","scopus_import":"1","author":[{"last_name":"Uecker","first_name":"Hildegard","id":"2DB8F68A-F248-11E8-B48F-1D18A9856A87","full_name":"Uecker, Hildegard","orcid":"0000-0001-9435-2813"},{"first_name":"Derek","last_name":"Setter","full_name":"Setter, Derek"},{"full_name":"Hermisson, Joachim","first_name":"Joachim","last_name":"Hermisson"}],"external_id":{"isi":["000354196800003"]},"abstract":[{"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.","lang":"eng"}],"department":[{"_id":"NiBa"}],"project":[{"name":"Evolutionary rescue","_id":"25B67606-B435-11E9-9278-68D0E5697425"}],"_id":"1699","oa_version":"Published Version","page":"1523 - 1580","oa":1,"file":[{"access_level":"open_access","creator":"system","checksum":"00e3a67bda05d4cc165b3a48b41ef9ad","date_created":"2018-12-12T10:14:27Z","file_name":"IST-2016-458-v1+1_s00285-014-0802-y.pdf","file_size":1321527,"date_updated":"2020-07-14T12:45:12Z","relation":"main_file","file_id":"5079","content_type":"application/pdf"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"year":"2015","volume":70,"publication_status":"published","pubrep_id":"458","date_updated":"2025-09-23T07:31:45Z","file_date_updated":"2020-07-14T12:45:12Z"},{"month":"08","language":[{"iso":"eng"}],"publisher":"American Physical Society","article_processing_charge":"No","publication":"Physical Review B","date_published":"2015-08-10T00:00:00Z","citation":{"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.","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>","short":"E. Van Loon, M. Katsnelson, M. Lemeshko, Physical Review B 92 (2015).","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.","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>.","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>","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>."},"intvolume":"        92","article_number":"081106","type":"journal_article","day":"10","acknowledgement":"The work is supported by European Research Council (ERC) Advanced Grant No. 338957 FEMTO/NANO.","date_created":"2018-12-11T11:53:32Z","arxiv":1,"doi":"10.1103/PhysRevB.92.081106","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1506.06007"}],"status":"public","corr_author":"1","scopus_import":"1","publist_id":"5441","issue":"8","title":"Ultralong-range order in the Fermi-Hubbard model with long-range interactions","department":[{"_id":"MiLe"}],"abstract":[{"lang":"eng","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."}],"author":[{"first_name":"Erik","last_name":"Van Loon","full_name":"Van Loon, Erik"},{"full_name":"Katsnelson, Mikhail","first_name":"Mikhail","last_name":"Katsnelson"},{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","last_name":"Lemeshko","first_name":"Mikhail"}],"external_id":{"arxiv":["1506.06007"],"isi":["000359344700002"]},"oa":1,"oa_version":"Preprint","_id":"1700","publication_status":"published","volume":92,"year":"2015","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-29T10:59:26Z"},{"date_updated":"2025-09-23T14:54:27Z","year":"2015","volume":112,"publication_status":"published","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"11508 - 11513","oa":1,"project":[{"grant_number":"P 25651-N26","_id":"254D1A94-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Sensitivity to higher-order statistics in natural scenes"}],"_id":"1701","oa_version":"Submitted Version","department":[{"_id":"GaTk"}],"external_id":{"pmid":["26330611"],"isi":["000361393700038"]},"author":[{"last_name":"Tkacik","first_name":"Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455"},{"last_name":"Mora","first_name":"Thierry","full_name":"Mora, Thierry"},{"full_name":"Marre, Olivier","last_name":"Marre","first_name":"Olivier"},{"first_name":"Dario","last_name":"Amodei","full_name":"Amodei, Dario"},{"full_name":"Palmer, Stephanie","last_name":"Palmer","first_name":"Stephanie"},{"full_name":"Berry Ii, Michael","first_name":"Michael","last_name":"Berry Ii"},{"full_name":"Bialek, William","last_name":"Bialek","first_name":"William"}],"abstract":[{"lang":"eng","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. "}],"scopus_import":"1","publist_id":"5440","issue":"37","title":"Thermodynamics and signatures of criticality in a network of neurons","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.","type":"journal_article","day":"15","status":"public","date_created":"2018-12-11T11:53:33Z","doi":"10.1073/pnas.1514188112","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4577210/","open_access":"1"}],"citation":{"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.","short":"G. Tkačik, T. Mora, O. Marre, D. Amodei, S. Palmer, M. Berry Ii, W. Bialek, PNAS 112 (2015) 11508–11513.","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.","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>","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>."},"date_published":"2015-09-15T00:00:00Z","intvolume":"       112","publisher":"National Academy of Sciences","language":[{"iso":"eng"}],"pmid":1,"month":"09","publication":"PNAS","quality_controlled":"1","article_processing_charge":"No"},{"date_updated":"2025-09-23T07:51:07Z","year":"2015","volume":63,"publication_status":"published","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"455 - 466","_id":"1703","oa_version":"None","department":[{"_id":"NiBa"}],"author":[{"full_name":"Broadhurst, Linda","first_name":"Linda","last_name":"Broadhurst"},{"full_name":"Fifield, Graham","first_name":"Graham","last_name":"Fifield"},{"full_name":"Vanzella, Bindi","first_name":"Bindi","last_name":"Vanzella"},{"id":"2C78037E-F248-11E8-B48F-1D18A9856A87","full_name":"Pickup, Melinda","orcid":"0000-0001-6118-0541","last_name":"Pickup","first_name":"Melinda"}],"external_id":{"isi":["000363276500009"]},"abstract":[{"lang":"eng","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."}],"scopus_import":"1","publist_id":"5434","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","issue":"5","type":"journal_article","day":"26","status":"public","date_created":"2018-12-11T11:53:34Z","doi":"10.1071/BT15023","date_published":"2015-05-26T00:00:00Z","citation":{"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>","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>.","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.","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>","short":"L. Broadhurst, G. Fifield, B. Vanzella, M. Pickup, Australian Journal of Botany 63 (2015) 455–466."},"intvolume":"        63","language":[{"iso":"eng"}],"publisher":"CSIRO","month":"05","publication":"Australian Journal of Botany","article_processing_charge":"No","quality_controlled":"1"},{"day":"05","type":"journal_article","has_accepted_license":"1","status":"public","doi":"10.1007/s11005-015-0787-5","date_created":"2018-12-11T11:53:34Z","arxiv":1,"ddc":["510"],"corr_author":"1","publist_id":"5432","scopus_import":"1","title":"Note on a family of monotone quantum relative entropies","issue":"10","language":[{"iso":"eng"}],"publisher":"Springer","license":"https://creativecommons.org/licenses/by-nc/4.0/","month":"08","publication":"Letters in Mathematical Physics","article_processing_charge":"No","quality_controlled":"1","date_published":"2015-08-05T00:00:00Z","citation":{"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>.","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.","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>.","short":"A. Deuchert, C. Hainzl, R. Seiringer, Letters in Mathematical Physics 105 (2015) 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>","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."},"intvolume":"       105","tmp":{"short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png"},"volume":105,"year":"2015","publication_status":"published","file":[{"creator":"dernst","checksum":"fd7307282a314cc1fbbaef77b187516b","date_created":"2019-01-15T14:42:07Z","access_level":"open_access","file_size":484967,"date_updated":"2020-07-14T12:45:13Z","relation":"main_file","content_type":"application/pdf","file_id":"5836","file_name":"2015_LettersMathPhys_Deuchert.pdf"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"file_date_updated":"2020-07-14T12:45:13Z","date_updated":"2025-09-23T09:41:03Z","department":[{"_id":"RoSe"}],"author":[{"orcid":"0000-0003-3146-6746","full_name":"Deuchert, Andreas","last_name":"Deuchert","first_name":"Andreas"},{"first_name":"Christian","last_name":"Hainzl","full_name":"Hainzl, Christian"},{"last_name":"Seiringer","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert"}],"external_id":{"isi":["000361007600006"],"arxiv":["1502.07205"]},"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."}],"page":"1449 - 1466","oa":1,"_id":"1704","oa_version":"Preprint"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"volume":9355,"year":"2015","publication_status":"published","date_updated":"2025-09-23T09:36:51Z","alternative_title":["LNCS"],"external_id":{"arxiv":["1602.06531"],"isi":["000367595100013"]},"author":[{"id":"42E87FC6-F248-11E8-B48F-1D18A9856A87","full_name":"Pentina, Anastasia","last_name":"Pentina","first_name":"Anastasia"},{"first_name":"Shai","last_name":"Ben David","full_name":"Ben David, Shai"}],"abstract":[{"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.","lang":"eng"}],"department":[{"_id":"ChLa"}],"_id":"1706","ec_funded":1,"project":[{"call_identifier":"FP7","grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding"}],"oa_version":"Preprint","page":"194 - 208","oa":1,"status":"public","main_file_link":[{"url":"http://arxiv.org/abs/1602.06531","open_access":"1"}],"arxiv":1,"doi":"10.1007/978-3-319-24486-0_13","date_created":"2018-12-11T11:53:35Z","day":"01","type":"conference","title":"Multi-task and lifelong learning of kernels","scopus_import":"1","publist_id":"5430","corr_author":"1","quality_controlled":"1","article_processing_charge":"No","publisher":"Springer","language":[{"iso":"eng"}],"month":"01","intvolume":"      9355","conference":{"name":"ALT: Algorithmic Learning Theory","end_date":"2015-10-06","start_date":"2015-10-04","location":"Banff, AB, Canada"},"citation":{"short":"A. Pentina, S. Ben David, in:, Springer, 2015, pp. 194–208.","ista":"Pentina A, Ben David S. 2015. Multi-task and lifelong learning of kernels. ALT: Algorithmic Learning Theory, LNCS, vol. 9355, 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>","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>.","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.","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>"},"date_published":"2015-01-01T00:00:00Z"},{"related_material":{"record":[{"id":"1400","status":"public","relation":"dissertation_contains"}]},"isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":282,"year":"2015","publication_status":"published","date_updated":"2026-04-09T14:26:23Z","author":[{"first_name":"Johannes","last_name":"Reiter","full_name":"Reiter, Johannes","orcid":"0000-0002-0170-7353","id":"4A918E98-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kanodia","first_name":"Ayush","full_name":"Kanodia, Ayush"},{"full_name":"Gupta, Raghav","first_name":"Raghav","last_name":"Gupta"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"}],"external_id":{"isi":["000362305500021"],"pmid":["26180069"]},"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"}],"department":[{"_id":"KrCh"}],"_id":"1709","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"oa_version":"Submitted Version","article_type":"original","oa":1,"status":"public","date_created":"2018-12-11T11:53:35Z","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4528522/"}],"doi":"10.1098/rspb.2015.1041","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.","day":"15","type":"journal_article","title":"Biological auctions with multiple rewards","issue":"1812","corr_author":"1","scopus_import":"1","publist_id":"5425","publication":"Proceedings of the Royal Society of London Series B Biological Sciences","article_processing_charge":"No","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"Royal Society","month":"07","pmid":1,"intvolume":"       282","date_published":"2015-07-15T00:00:00Z","citation":{"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.","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>.","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>.","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>","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).","short":"J. Reiter, A. Kanodia, R. Gupta, M. Nowak, K. Chatterjee, Proceedings of the Royal Society of London Series B Biological Sciences 282 (2015)."}},{"month":"07","publisher":"SIAM","language":[{"iso":"eng"}],"quality_controlled":"1","article_processing_charge":"No","publication":"Society for Industrial and Applied Mathematics","citation":{"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>","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.","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>.","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.","short":"A. Akopyan, A. Plakhov, Society for Industrial and Applied Mathematics 47 (2015) 2754–2769."},"date_published":"2015-07-14T00:00:00Z","intvolume":"        47","type":"journal_article","day":"14","date_created":"2018-12-11T11:53:36Z","doi":"10.1137/140993843","arxiv":1,"main_file_link":[{"url":"http://arxiv.org/abs/1410.3736","open_access":"1"}],"status":"public","publist_id":"5423","scopus_import":"1","title":"Minimal resistance of curves under the single impact assumption","issue":"4","department":[{"_id":"HeEd"}],"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 → ∞."}],"external_id":{"isi":["000360691500009"],"arxiv":["1410.3736"]},"author":[{"last_name":"Akopyan","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy"},{"full_name":"Plakhov, Alexander","first_name":"Alexander","last_name":"Plakhov"}],"oa":1,"page":"2754 - 2769","oa_version":"Preprint","_id":"1710","project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"publication_status":"published","volume":47,"year":"2015","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-23T09:35:36Z"},{"publist_id":"5421","scopus_import":"1","corr_author":"1","ddc":["573"],"issue":"10","title":"Drosophila immune cell migration and adhesion during embryonic development and larval immune responses","day":"01","type":"journal_article","status":"public","has_accepted_license":"1","date_created":"2018-12-11T11:53:36Z","doi":"10.1016/j.ceb.2015.07.003","citation":{"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>","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>.","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.","short":"A. Ratheesh, V. Belyaeva, D.E. Siekhaus, Current Opinion in Cell Biology 36 (2015) 71–79.","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>"},"date_published":"2015-10-01T00:00:00Z","intvolume":"        36","tmp":{"short":"CC BY-NC-ND (4.0)","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"},"publisher":"Elsevier","language":[{"iso":"eng"}],"month":"10","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","publication":"Current Opinion in Cell Biology","quality_controlled":"1","article_processing_charge":"No","file_date_updated":"2020-07-14T12:45:13Z","date_updated":"2025-09-23T08:29:26Z","volume":36,"year":"2015","publication_status":"published","pubrep_id":"346","file":[{"date_created":"2018-12-12T10:14:44Z","checksum":"bbb1ee39ca52929aefe4f48752b166ee","creator":"system","access_level":"open_access","file_id":"5098","content_type":"application/pdf","relation":"main_file","date_updated":"2020-07-14T12:45:13Z","file_size":1023680,"file_name":"IST-2015-346-v1+1_Current_Opinion_Review_Ratheesh_et_al_2015.pdf"}],"isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"71 - 79","oa":1,"_id":"1712","ec_funded":1,"project":[{"name":"Investigating the role of transporters in invasive migration through junctions","_id":"2536F660-B435-11E9-9278-68D0E5697425","grant_number":"334077","call_identifier":"FP7"}],"oa_version":"Published Version","department":[{"_id":"DaSi"}],"external_id":{"isi":["000364577600011"]},"author":[{"last_name":"Ratheesh","first_name":"Aparna","id":"2F064CFE-F248-11E8-B48F-1D18A9856A87","full_name":"Ratheesh, Aparna","orcid":"0000-0001-7190-0776"},{"first_name":"Vera","last_name":"Belyaeva","full_name":"Belyaeva, Vera","id":"47F080FE-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-8323-8353","full_name":"Siekhaus, Daria E","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","first_name":"Daria E","last_name":"Siekhaus"}],"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"}]},{"intvolume":"      2015","conference":{"location":"Rome, Italy","start_date":"2014-12-02","end_date":"2014-12-05","name":"RTSS: Real-Time Systems Symposium"},"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.","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>.","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>.","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>","short":"K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, in:, Real-Time Systems Symposium, IEEE, 2015, pp. 118–127."},"date_published":"2015-01-15T00:00:00Z","publication":"Real-Time Systems Symposium","quality_controlled":"1","article_processing_charge":"No","publisher":"IEEE","language":[{"iso":"eng"}],"month":"01","title":"A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks","issue":"January","scopus_import":"1","publist_id":"5417","status":"public","doi":"10.1109/RTSS.2014.9","date_created":"2018-12-11T11:53:37Z","day":"15","type":"conference","_id":"1714","oa_version":"None","page":"118 - 127","external_id":{"isi":["000569750000012"]},"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","last_name":"Pavlogiannis"},{"full_name":"Kößler, Alexander","last_name":"Kößler","first_name":"Alexander"},{"full_name":"Schmid, Ulrich","last_name":"Schmid","first_name":"Ulrich"}],"abstract":[{"lang":"eng","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."}],"department":[{"_id":"KrCh"}],"date_updated":"2026-04-08T14:22:16Z","related_material":{"record":[{"id":"5423","status":"public","relation":"earlier_version"},{"id":"821","relation":"dissertation_contains","status":"public"}]},"isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2015","volume":2015,"publication_status":"published"},{"volume":6,"year":"2015","publication_status":"published","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_updated":"2026-05-19T09:52:55Z","external_id":{"pmid":["25833741"]},"author":[{"full_name":"Cohen, Michael","first_name":"Michael","last_name":"Cohen"},{"id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","full_name":"Kicheva, Anna","orcid":"0000-0003-4509-4998","last_name":"Kicheva","first_name":"Anna"},{"full_name":"Ribeiro, Ana","last_name":"Ribeiro","first_name":"Ana"},{"full_name":"Blassberg, Robert","first_name":"Robert","last_name":"Blassberg"},{"last_name":"Page","first_name":"Karen","full_name":"Page, Karen"},{"last_name":"Barnes","first_name":"Chris","full_name":"Barnes, Chris"},{"first_name":"James","last_name":"Briscoe","full_name":"Briscoe, James"}],"abstract":[{"text":"In the vertebrate neural tube, the morphogen Sonic Hedgehog (Shh) establishes a characteristic pattern of gene expression. Here we quantify the Shh gradient in the developing mouse neural tube and show that while the amplitude of the gradient increases over time, the activity of the pathway transcriptional effectors, Gli proteins, initially increases but later decreases. Computational analysis of the pathway suggests three mechanisms that could contribute to this adaptation: transcriptional upregulation of the inhibitory receptor Ptch1, transcriptional downregulation of Gli and the differential stability of active and inactive Gli isoforms. Consistent with this, Gli2 protein expression is downregulated during neural tube patterning and adaptation continues when the pathway is stimulated downstream of Ptch1. Moreover, the Shh-induced upregulation of Gli2 transcription prevents Gli activity levels from adapting in a different cell type, NIH3T3 fibroblasts, despite the upregulation of Ptch1. Multiple mechanisms therefore contribute to the intracellular dynamics of Shh signalling, resulting in different signalling dynamics in different cell types.","lang":"eng"}],"extern":"1","article_type":"original","oa":1,"_id":"1728","oa_version":"Published Version","acknowledgement":"C.P.B. gratefully acknowledges funding from the Wellcome Trust through a Research Career Development Fellowship (097319/Z/11/Z). This work was supported by the Medical Research Council (U117560541) and Wellcome Trust (WT098326MA, WT098325MA).","DOAJ_listed":"1","day":"02","type":"journal_article","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1038/ncomms7709"}],"doi":"10.1038/ncomms7709","date_created":"2018-12-11T11:53:42Z","publication_identifier":{"eissn":["2041-1723"]},"publist_id":"5399","scopus_import":"1","title":"Ptch1 and Gli regulate Shh signalling dynamics via multiple mechanisms","OA_type":"gold","OA_place":"publisher","publisher":"Springer Nature","language":[{"iso":"eng"}],"month":"04","pmid":1,"publication":"Nature Communications","quality_controlled":"1","article_processing_charge":"No","citation":{"ama":"Cohen M, Kicheva A, Ribeiro A, et al. Ptch1 and Gli regulate Shh signalling dynamics via multiple mechanisms. <i>Nature Communications</i>. 2015;6. doi:<a href=\"https://doi.org/10.1038/ncomms7709\">10.1038/ncomms7709</a>","chicago":"Cohen, Michael, Anna Kicheva, Ana Ribeiro, Robert Blassberg, Karen Page, Chris Barnes, and James Briscoe. “Ptch1 and Gli Regulate Shh Signalling Dynamics via Multiple Mechanisms.” <i>Nature Communications</i>. Springer Nature, 2015. <a href=\"https://doi.org/10.1038/ncomms7709\">https://doi.org/10.1038/ncomms7709</a>.","ieee":"M. Cohen <i>et al.</i>, “Ptch1 and Gli regulate Shh signalling dynamics via multiple mechanisms,” <i>Nature Communications</i>, vol. 6. Springer Nature, 2015.","mla":"Cohen, Michael, et al. “Ptch1 and Gli Regulate Shh Signalling Dynamics via Multiple Mechanisms.” <i>Nature Communications</i>, vol. 6, 6709, Springer Nature, 2015, doi:<a href=\"https://doi.org/10.1038/ncomms7709\">10.1038/ncomms7709</a>.","ista":"Cohen M, Kicheva A, Ribeiro A, Blassberg R, Page K, Barnes C, Briscoe J. 2015. Ptch1 and Gli regulate Shh signalling dynamics via multiple mechanisms. Nature Communications. 6, 6709.","apa":"Cohen, M., Kicheva, A., Ribeiro, A., Blassberg, R., Page, K., Barnes, C., &#38; Briscoe, J. (2015). Ptch1 and Gli regulate Shh signalling dynamics via multiple mechanisms. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/ncomms7709\">https://doi.org/10.1038/ncomms7709</a>","short":"M. Cohen, A. Kicheva, A. Ribeiro, R. Blassberg, K. Page, C. Barnes, J. Briscoe, Nature Communications 6 (2015)."},"date_published":"2015-04-02T00:00:00Z","article_number":"6709","intvolume":"         6","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"conference":{"name":"CAV: Computer Aided Verification","end_date":"2015-07-24","location":"San Francisco, CA, United States","start_date":"2015-07-18"},"date_published":"2015-07-01T00:00:00Z","citation":{"mla":"Cerny, Pavol, et al. <i>From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis</i>. Vol. 9207, Springer, 2015, pp. 180–97, doi:<a href=\"https://doi.org/10.1007/978-3-319-21668-3_11\">10.1007/978-3-319-21668-3_11</a>.","ama":"Cerny P, Clarke E, Henzinger TA, et al. From non-preemptive to preemptive scheduling using synchronization synthesis. 2015;9207:180-197. doi:<a href=\"https://doi.org/10.1007/978-3-319-21668-3_11\">10.1007/978-3-319-21668-3_11</a>","ieee":"P. Cerny <i>et al.</i>, “From non-preemptive to preemptive scheduling using synchronization synthesis,” vol. 9207. Springer, pp. 180–197, 2015.","chicago":"Cerny, Pavol, Edmund Clarke, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, and Thorsten Tarrach. “From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis.” Lecture Notes in Computer Science. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-21668-3_11\">https://doi.org/10.1007/978-3-319-21668-3_11</a>.","short":"P. Cerny, E. Clarke, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, R. Samanta, T. Tarrach, 9207 (2015) 180–197.","apa":"Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta, R., &#38; Tarrach, T. (2015). From non-preemptive to preemptive scheduling using synchronization synthesis. Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-319-21668-3_11\">https://doi.org/10.1007/978-3-319-21668-3_11</a>","ista":"Cerny P, Clarke E, Henzinger TA, Radhakrishna A, Ryzhyk L, Samanta R, Tarrach T. 2015. From non-preemptive to preemptive scheduling using synchronization synthesis. 9207, 180–197."},"intvolume":"      9207","language":[{"iso":"eng"}],"OA_place":"repository","publisher":"Springer","month":"07","article_processing_charge":"No","quality_controlled":"1","ddc":["000"],"publist_id":"5398","scopus_import":"1","OA_type":"green","title":"From non-preemptive to preemptive scheduling using synchronization synthesis","day":"01","type":"conference","has_accepted_license":"1","status":"public","doi":"10.1007/978-3-319-21668-3_11","date_created":"2018-12-11T11:53:42Z","page":"180 - 197","oa":1,"ec_funded":1,"_id":"1729","project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"}],"oa_version":"Submitted Version","department":[{"_id":"ToHe"}],"author":[{"first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Clarke","first_name":"Edmund","full_name":"Clarke, Edmund"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","first_name":"Arjun"},{"full_name":"Ryzhyk, Leonid","first_name":"Leonid","last_name":"Ryzhyk"},{"id":"3D2AAC08-F248-11E8-B48F-1D18A9856A87","full_name":"Samanta, Roopsha","last_name":"Samanta","first_name":"Roopsha"},{"last_name":"Tarrach","first_name":"Thorsten","id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4409-8487","full_name":"Tarrach, Thorsten"}],"external_id":{"isi":["000491470400011"]},"abstract":[{"text":"We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is implicit, inferred from the non-preemptive behavior. Let us consider sequences of calls that the program makes to an external interface. The specification requires that any such sequence produced under a preemptive scheduler should be included in the set of such sequences produced under a non-preemptive scheduler. The solution is based on a finitary abstraction, an algorithm for bounded language inclusion modulo an independence relation, and rules for inserting synchronization. We apply the approach to device-driver programming, where the driver threads call the software interface of the device and the API provided by the operating system. Our experiments demonstrate that our synthesis method is precise and efficient, and, since it does not require explicit specifications, is more practical than the conventional approach based on user-provided assertions.","lang":"eng"}],"alternative_title":["LNCS"],"file_date_updated":"2025-06-26T07:12:35Z","date_updated":"2026-04-09T10:54:00Z","series_title":"Lecture Notes in Computer Science","year":"2015","volume":9207,"publication_status":"published","pubrep_id":"336","file":[{"creator":"system","checksum":"6ff58ac220e2f20cb001ba35d4924495","date_created":"2018-12-12T10:08:53Z","access_level":"open_access","date_updated":"2025-06-26T07:12:35Z","file_size":481922,"relation":"main_file","file_id":"4715","content_type":"application/pdf","file_name":"IST-2015-336-v1+1_long_version.pdf"}],"related_material":{"record":[{"id":"1338","relation":"later_version","status":"public"},{"id":"1130","status":"public","relation":"dissertation_contains"}]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1},{"intvolume":"        53","date_published":"2015-04-02T00:00:00Z","citation":{"short":"É. Colin De Verdière, A. Hubard, A.N. de Mesmay, Discrete &#38; Computational Geometry 53 (2015) 587–620.","apa":"Colin De Verdière, É., Hubard, A., &#38; de Mesmay, A. N. (2015). Discrete systolic inequalities and decompositions of triangulated surfaces. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-015-9679-9\">https://doi.org/10.1007/s00454-015-9679-9</a>","ista":"Colin De Verdière É, Hubard A, de Mesmay AN. 2015. Discrete systolic inequalities and decompositions of triangulated surfaces. Discrete &#38; Computational Geometry. 53(3), 587–620.","mla":"Colin De Verdière, Éric, et al. “Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces.” <i>Discrete &#38; Computational Geometry</i>, vol. 53, no. 3, Springer, 2015, pp. 587–620, doi:<a href=\"https://doi.org/10.1007/s00454-015-9679-9\">10.1007/s00454-015-9679-9</a>.","ama":"Colin De Verdière É, Hubard A, de Mesmay AN. Discrete systolic inequalities and decompositions of triangulated surfaces. <i>Discrete &#38; Computational Geometry</i>. 2015;53(3):587-620. doi:<a href=\"https://doi.org/10.1007/s00454-015-9679-9\">10.1007/s00454-015-9679-9</a>","ieee":"É. Colin De Verdière, A. Hubard, and A. N. de Mesmay, “Discrete systolic inequalities and decompositions of triangulated surfaces,” <i>Discrete &#38; Computational Geometry</i>, vol. 53, no. 3. Springer, pp. 587–620, 2015.","chicago":"Colin De Verdière, Éric, Alfredo Hubard, and Arnaud N de Mesmay. “Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s00454-015-9679-9\">https://doi.org/10.1007/s00454-015-9679-9</a>."},"article_processing_charge":"No","quality_controlled":"1","publication":"Discrete & Computational Geometry","month":"04","language":[{"iso":"eng"}],"publisher":"Springer","issue":"3","title":"Discrete systolic inequalities and decompositions of triangulated surfaces","publist_id":"5397","scopus_import":"1","main_file_link":[{"url":"http://arxiv.org/abs/1408.4036","open_access":"1"}],"date_created":"2018-12-11T11:53:42Z","doi":"10.1007/s00454-015-9679-9","arxiv":1,"status":"public","day":"02","type":"journal_article","oa_version":"Preprint","_id":"1730","oa":1,"page":"587 - 620","abstract":[{"text":"How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given combinatorial map in triangulated combinatorial surfaces (or their dual cross-metric counterpart). Our work builds upon Riemannian systolic inequalities, which bound the minimum length of non-trivial closed curves in terms of the genus and the area of the surface. We first describe a systematic way to translate Riemannian systolic inequalities to a discrete setting, and vice-versa. This implies a conjecture by Przytycka and Przytycki (Graph structure theory. Contemporary Mathematics, vol. 147, 1993), a number of new systolic inequalities in the discrete setting, and the fact that a theorem of Hutchinson on the edge-width of triangulated surfaces and Gromov’s systolic inequality for surfaces are essentially equivalent. We also discuss how these proofs generalize to higher dimensions. Then we focus on topological decompositions of surfaces. Relying on ideas of Buser, we prove the existence of pants decompositions of length O(g^(3/2)n^(1/2)) for any triangulated combinatorial surface of genus g with n triangles, and describe an O(gn)-time algorithm to compute such a decomposition. Finally, we consider the problem of embedding a cut graph (or more generally a cellular graph) with a given combinatorial map on a given surface. Using random triangulations, we prove (essentially) that, for any choice of a combinatorial map, there are some surfaces on which any cellular embedding with that combinatorial map has length superlinear in the number of triangles of the triangulated combinatorial surface. There is also a similar result for graphs embedded on polyhedral triangulations.","lang":"eng"}],"author":[{"first_name":"Éric","last_name":"Colin De Verdière","full_name":"Colin De Verdière, Éric"},{"first_name":"Alfredo","last_name":"Hubard","full_name":"Hubard, Alfredo"},{"id":"3DB2F25C-F248-11E8-B48F-1D18A9856A87","full_name":"De Mesmay, Arnaud N","last_name":"De Mesmay","first_name":"Arnaud N"}],"external_id":{"isi":["000353895200006"],"arxiv":["1408.4036"]},"department":[{"_id":"UlWa"}],"date_updated":"2025-09-23T08:27:38Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"publication_status":"published","volume":53,"year":"2015"},{"month":"12","language":[{"iso":"eng"}],"publisher":"Elsevier","article_processing_charge":"No","quality_controlled":"1","publication":"Information and Computation","date_published":"2015-12-01T00:00:00Z","citation":{"mla":"Chatterjee, Krishnendu, et al. “Randomness for Free.” <i>Information and Computation</i>, vol. 245, no. 12, Elsevier, 2015, pp. 3–16, doi:<a href=\"https://doi.org/10.1016/j.ic.2015.06.003\">10.1016/j.ic.2015.06.003</a>.","ieee":"K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” <i>Information and Computation</i>, vol. 245, no. 12. Elsevier, pp. 3–16, 2015.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free.” <i>Information and Computation</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ic.2015.06.003\">https://doi.org/10.1016/j.ic.2015.06.003</a>.","ama":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. Randomness for free. <i>Information and Computation</i>. 2015;245(12):3-16. doi:<a href=\"https://doi.org/10.1016/j.ic.2015.06.003\">10.1016/j.ic.2015.06.003</a>","short":"K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, Information and Computation 245 (2015) 3–16.","ista":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2015. Randomness for free. Information and Computation. 245(12), 3–16.","apa":"Chatterjee, K., Doyen, L., Gimbert, H., &#38; Henzinger, T. A. (2015). Randomness for free. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2015.06.003\">https://doi.org/10.1016/j.ic.2015.06.003</a>"},"intvolume":"       245","day":"01","type":"journal_article","date_created":"2018-12-11T11:53:42Z","doi":"10.1016/j.ic.2015.06.003","arxiv":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1006.0673"}],"status":"public","corr_author":"1","publist_id":"5395","scopus_import":"1","title":"Randomness for free","issue":"12","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"abstract":[{"lang":"eng","text":"We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided complete-observation (one player has complete observation); and (c) complete-observation (both players have complete view of the game). On the basis of mode of interaction we have the following classification: (a) concurrent (both players interact simultaneously); and (b) turn-based (both players interact in turn). The two sources of randomness in these games are randomness in transition function and randomness in strategies. In general, randomized strategies are more powerful than deterministic strategies, and randomness in transitions gives more general classes of games. In this work we present a complete characterization for the classes of games where randomness is not helpful in: (a) the transition function probabilistic transition can be simulated by deterministic transition); and (b) strategies (pure strategies are as powerful as randomized strategies). As consequence of our characterization we obtain new undecidability results for these games. "}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"full_name":"Gimbert, Hugo","last_name":"Gimbert","first_name":"Hugo"},{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"isi":["000368899100002"],"arxiv":["1006.0673"]},"oa":1,"page":"3 - 16","oa_version":"Preprint","_id":"1731","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Design for Embedded Systems","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"ec_funded":1,"publication_status":"published","volume":245,"year":"2015","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","related_material":{"record":[{"id":"3856","status":"public","relation":"earlier_version"}]},"date_updated":"2025-09-23T10:32:00Z"},{"language":[{"iso":"eng"}],"publisher":"IEEE","month":"01","quality_controlled":"1","conference":{"name":"ICRA: International Conference on Robotics and Automation","end_date":"2015-05-30","location":"Seattle, WA, United States","start_date":"2015-05-26"},"date_published":"2015-01-01T00:00:00Z","citation":{"ama":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. In: IEEE; 2015:325-330. doi:<a href=\"https://doi.org/10.1109/ICRA.2015.7139019\">10.1109/ICRA.2015.7139019</a>","ieee":"K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Qualitative analysis of POMDPs with temporal logic specifications for robotics applications,” presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States, 2015, pp. 325–330.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications,” 325–30. IEEE, 2015. <a href=\"https://doi.org/10.1109/ICRA.2015.7139019\">https://doi.org/10.1109/ICRA.2015.7139019</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications</i>. IEEE, 2015, pp. 325–30, doi:<a href=\"https://doi.org/10.1109/ICRA.2015.7139019\">10.1109/ICRA.2015.7139019</a>.","apa":"Chatterjee, K., Chmelik, M., Gupta, R., &#38; Kanodia, A. (2015). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications (pp. 325–330). Presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States: IEEE. <a href=\"https://doi.org/10.1109/ICRA.2015.7139019\">https://doi.org/10.1109/ICRA.2015.7139019</a>","ista":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2015. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. ICRA: International Conference on Robotics and Automation, 325–330.","short":"K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, in:, IEEE, 2015, pp. 325–330."},"day":"01","type":"conference","status":"public","arxiv":1,"doi":"10.1109/ICRA.2015.7139019","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1409.3360"}],"date_created":"2018-12-11T11:53:43Z","scopus_import":1,"publist_id":"5394","title":"Qualitative analysis of POMDPs with temporal logic specifications for robotics applications","department":[{"_id":"KrCh"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Martin","last_name":"Chmelik","full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Raghav","last_name":"Gupta","full_name":"Gupta, Raghav"},{"full_name":"Kanodia, Ayush","first_name":"Ayush","last_name":"Kanodia"}],"external_id":{"arxiv":["1409.3360"]},"abstract":[{"text":"We consider partially observable Markov decision processes (POMDPs), that are a standard framework for robotics applications to model uncertainties present in the real world, with temporal logic specifications. All temporal logic specifications in linear-time temporal logic (LTL) can be expressed as parity objectives. We study the qualitative analysis problem for POMDPs with parity objectives that asks whether there is a controller (policy) to ensure that the objective holds with probability 1 (almost-surely). While the qualitative analysis of POMDPs with parity objectives is undecidable, recent results show that when restricted to finite-memory policies the problem is EXPTIME-complete. While the problem is intractable in theory, we present a practical approach to solve the qualitative analysis problem. We designed several heuristics to deal with the exponential complexity, and have used our implementation on a number of well-known POMDP examples for robotics applications. Our results provide the first practical approach to solve the qualitative analysis of robot motion planning with LTL properties in the presence of uncertainty.","lang":"eng"}],"page":"325 - 330","oa":1,"_id":"1732","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"ec_funded":1,"oa_version":"Preprint","year":"2015","publication_status":"published","related_material":{"record":[{"id":"5424","relation":"earlier_version","status":"public"},{"id":"5426","relation":"earlier_version","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T12:25:52Z"},{"date_updated":"2025-09-23T10:32:38Z","volume":34,"year":"2015","publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"page":"709 - 733","_id":"1734","oa_version":"None","department":[{"_id":"BeBi"}],"external_id":{"isi":["000358326600063"]},"author":[{"full_name":"Klehm, Oliver","first_name":"Oliver","last_name":"Klehm"},{"first_name":"Fabrice","last_name":"Rousselle","full_name":"Rousselle, Fabrice"},{"full_name":"Papas, Marios","last_name":"Papas","first_name":"Marios"},{"last_name":"Bradley","first_name":"Derek","full_name":"Bradley, Derek"},{"last_name":"Hery","first_name":"Christophe","full_name":"Hery, Christophe"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","last_name":"Bickel","first_name":"Bernd"},{"last_name":"Jarosz","first_name":"Wojciech","full_name":"Jarosz, Wojciech"},{"full_name":"Beeler, Thabo","last_name":"Beeler","first_name":"Thabo"}],"abstract":[{"text":"Facial appearance capture is now firmly established within academic research and used extensively across various application domains, perhaps most prominently in the entertainment industry through the design of virtual characters in video games and films. While significant progress has occurred over the last two decades, no single survey currently exists that discusses the similarities, differences, and practical considerations of the available appearance capture techniques as applied to human faces. A central difficulty of facial appearance capture is the way light interacts with skin-which has a complex multi-layered structure-and the interactions that occur below the skin surface can, by definition, only be observed indirectly. In this report, we distinguish between two broad strategies for dealing with this complexity. &quot;Image-based methods&quot; try to exhaustively capture the exact face appearance under different lighting and viewing conditions, and then render the face through weighted image combinations. &quot;Parametric methods&quot; instead fit the captured reflectance data to some parametric appearance model used during rendering, allowing for a more lightweight and flexible representation but at the cost of potentially increased rendering complexity or inexact reproduction. The goal of this report is to provide an overview that can guide practitioners and researchers in assessing the tradeoffs between current approaches and identifying directions for future advances in facial appearance capture.","lang":"eng"}],"publist_id":"5391","scopus_import":"1","issue":"2","title":"Recent advances in facial appearance capture","type":"journal_article","day":"01","status":"public","main_file_link":[{"url":"https://graphics.ethz.ch/~mpapas/publications/fac_star.pdf"}],"date_created":"2018-12-11T11:53:43Z","doi":"10.1111/cgf.12594","citation":{"short":"O. Klehm, F. Rousselle, M. Papas, D. Bradley, C. Hery, B. Bickel, W. Jarosz, T. Beeler, Computer Graphics Forum 34 (2015) 709–733.","ista":"Klehm O, Rousselle F, Papas M, Bradley D, Hery C, Bickel B, Jarosz W, Beeler T. 2015. Recent advances in facial appearance capture. Computer Graphics Forum. 34(2), 709–733.","apa":"Klehm, O., Rousselle, F., Papas, M., Bradley, D., Hery, C., Bickel, B., … Beeler, T. (2015). Recent advances in facial appearance capture. <i>Computer Graphics Forum</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/cgf.12594\">https://doi.org/10.1111/cgf.12594</a>","mla":"Klehm, Oliver, et al. “Recent Advances in Facial Appearance Capture.” <i>Computer Graphics Forum</i>, vol. 34, no. 2, Wiley-Blackwell, 2015, pp. 709–33, doi:<a href=\"https://doi.org/10.1111/cgf.12594\">10.1111/cgf.12594</a>.","ama":"Klehm O, Rousselle F, Papas M, et al. Recent advances in facial appearance capture. <i>Computer Graphics Forum</i>. 2015;34(2):709-733. doi:<a href=\"https://doi.org/10.1111/cgf.12594\">10.1111/cgf.12594</a>","ieee":"O. Klehm <i>et al.</i>, “Recent advances in facial appearance capture,” <i>Computer Graphics Forum</i>, vol. 34, no. 2. Wiley-Blackwell, pp. 709–733, 2015.","chicago":"Klehm, Oliver, Fabrice Rousselle, Marios Papas, Derek Bradley, Christophe Hery, Bernd Bickel, Wojciech Jarosz, and Thabo Beeler. “Recent Advances in Facial Appearance Capture.” <i>Computer Graphics Forum</i>. Wiley-Blackwell, 2015. <a href=\"https://doi.org/10.1111/cgf.12594\">https://doi.org/10.1111/cgf.12594</a>."},"date_published":"2015-05-01T00:00:00Z","intvolume":"        34","publisher":"Wiley-Blackwell","language":[{"iso":"eng"}],"month":"05","publication":"Computer Graphics Forum","quality_controlled":"1","article_processing_charge":"No"},{"abstract":[{"lang":"eng","text":"This work presents a method for efficiently simplifying the pressure projection step in a liquid simulation. We first devise a straightforward dimension reduction technique that dramatically reduces the cost of solving the pressure projection. Next, we introduce a novel change of basis that satisfies free-surface boundary conditions exactly, regardless of the accuracy of the pressure solve. When combined, these ideas greatly reduce the computational complexity of the pressure solve without compromising free surface boundary conditions at the highest level of detail. Our techniques are easy to parallelize, and they effectively eliminate the computational bottleneck for large liquid simulations."}],"external_id":{"isi":["000358326600045"]},"author":[{"first_name":"Ryoichi","last_name":"Ando","full_name":"Ando, Ryoichi"},{"last_name":"Thürey","first_name":"Nils","full_name":"Thürey, Nils"},{"full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","last_name":"Wojtan"}],"department":[{"_id":"ChWo"}],"oa_version":"Submitted Version","_id":"1735","oa":1,"page":"473 - 480","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","file":[{"creator":"system","date_created":"2018-12-12T10:16:30Z","checksum":"590752bf977855b337a80f78a9bc2404","access_level":"open_access","file_size":6312352,"date_updated":"2020-07-14T12:45:15Z","content_type":"application/pdf","file_id":"5218","relation":"main_file","file_name":"IST-2016-607-v1+1_coarsegrid.pdf"}],"pubrep_id":"607","publication_status":"published","volume":34,"year":"2015","date_updated":"2025-09-22T14:29:19Z","file_date_updated":"2020-07-14T12:45:15Z","quality_controlled":"1","article_processing_charge":"No","publication":"Computer Graphics Forum","month":"05","publisher":"Wiley","language":[{"iso":"eng"}],"intvolume":"        34","citation":{"short":"R. Ando, N. Thürey, C. Wojtan, Computer Graphics Forum 34 (2015) 473–480.","ista":"Ando R, Thürey N, Wojtan C. 2015. A dimension-reduced pressure solver for liquid simulations. Computer Graphics Forum. 34(2), 473–480.","apa":"Ando, R., Thürey, N., &#38; Wojtan, C. (2015). A dimension-reduced pressure solver for liquid simulations. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.12576\">https://doi.org/10.1111/cgf.12576</a>","mla":"Ando, Ryoichi, et al. “A Dimension-Reduced Pressure Solver for Liquid Simulations.” <i>Computer Graphics Forum</i>, vol. 34, no. 2, Wiley, 2015, pp. 473–80, doi:<a href=\"https://doi.org/10.1111/cgf.12576\">10.1111/cgf.12576</a>.","ama":"Ando R, Thürey N, Wojtan C. A dimension-reduced pressure solver for liquid simulations. <i>Computer Graphics Forum</i>. 2015;34(2):473-480. doi:<a href=\"https://doi.org/10.1111/cgf.12576\">10.1111/cgf.12576</a>","chicago":"Ando, Ryoichi, Nils Thürey, and Chris Wojtan. “A Dimension-Reduced Pressure Solver for Liquid Simulations.” <i>Computer Graphics Forum</i>. Wiley, 2015. <a href=\"https://doi.org/10.1111/cgf.12576\">https://doi.org/10.1111/cgf.12576</a>.","ieee":"R. Ando, N. Thürey, and C. Wojtan, “A dimension-reduced pressure solver for liquid simulations,” <i>Computer Graphics Forum</i>, vol. 34, no. 2. Wiley, pp. 473–480, 2015."},"date_published":"2015-05-01T00:00:00Z","doi":"10.1111/cgf.12576","date_created":"2018-12-11T11:53:44Z","status":"public","has_accepted_license":"1","type":"journal_article","day":"01","acknowledgement":"The first author was supported by a JSPS Postdoctoral Fellowship for Research Abroad","title":"A dimension-reduced pressure solver for liquid simulations","issue":"2","scopus_import":"1","publist_id":"5389","ddc":["000"]},{"scopus_import":"1","publication_identifier":{"issn":["0035-8711","1365-2966"]},"issue":"3","title":"A reduced orbital period for the supermassive black hole binary candidate in the quasar PG 1302-102?","type":"journal_article","day":"24","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1093/mnras/stv1457"}],"doi":"10.1093/mnras/stv1457","date_created":"2024-09-05T13:31:30Z","date_published":"2015-07-24T00:00:00Z","citation":{"mla":"D’Orazio, D. J., et al. “A Reduced Orbital Period for the Supermassive Black Hole Binary Candidate in the Quasar PG 1302-102?” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 452, no. 3, Oxford University Press, 2015, pp. 2540–45, doi:<a href=\"https://doi.org/10.1093/mnras/stv1457\">10.1093/mnras/stv1457</a>.","ama":"D’Orazio DJ, Haiman Z, Duffell P, Farris BD, MacFadyen AI. A reduced orbital period for the supermassive black hole binary candidate in the quasar PG 1302-102? <i>Monthly Notices of the Royal Astronomical Society</i>. 2015;452(3):2540-2545. doi:<a href=\"https://doi.org/10.1093/mnras/stv1457\">10.1093/mnras/stv1457</a>","chicago":"D’Orazio, D. J., Zoltán Haiman, P. Duffell, B. D. Farris, and A. I. MacFadyen. “A Reduced Orbital Period for the Supermassive Black Hole Binary Candidate in the Quasar PG 1302-102?” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2015. <a href=\"https://doi.org/10.1093/mnras/stv1457\">https://doi.org/10.1093/mnras/stv1457</a>.","ieee":"D. J. D’Orazio, Z. Haiman, P. Duffell, B. D. Farris, and A. I. MacFadyen, “A reduced orbital period for the supermassive black hole binary candidate in the quasar PG 1302-102?,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 452, no. 3. Oxford University Press, pp. 2540–2545, 2015.","short":"D.J. D’Orazio, Z. Haiman, P. Duffell, B.D. Farris, A.I. MacFadyen, Monthly Notices of the Royal Astronomical Society 452 (2015) 2540–2545.","ista":"D’Orazio DJ, Haiman Z, Duffell P, Farris BD, MacFadyen AI. 2015. A reduced orbital period for the supermassive black hole binary candidate in the quasar PG 1302-102? Monthly Notices of the Royal Astronomical Society. 452(3), 2540–2545.","apa":"D’Orazio, D. J., Haiman, Z., Duffell, P., Farris, B. D., &#38; MacFadyen, A. I. (2015). A reduced orbital period for the supermassive black hole binary candidate in the quasar PG 1302-102? <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stv1457\">https://doi.org/10.1093/mnras/stv1457</a>"},"intvolume":"       452","language":[{"iso":"eng"}],"publisher":"Oxford University Press","month":"07","publication":"Monthly Notices of the Royal Astronomical Society","article_processing_charge":"No","quality_controlled":"1","date_updated":"2024-09-24T07:58:52Z","year":"2015","volume":452,"publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"2540-2545","article_type":"original","oa":1,"_id":"17615","oa_version":"Published Version","author":[{"last_name":"D'Orazio","first_name":"D. J.","full_name":"D'Orazio, D. J."},{"full_name":"Haiman, Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","first_name":"Zoltán","last_name":"Haiman"},{"full_name":"Duffell, P.","first_name":"P.","last_name":"Duffell"},{"last_name":"Farris","first_name":"B. D.","full_name":"Farris, B. D."},{"first_name":"A. I.","last_name":"MacFadyen","full_name":"MacFadyen, A. I."}],"abstract":[{"text":"Graham et al. have detected a 5.2 yr periodic optical variability of the quasar PG 1302-102 at redshift z = 0.3, which they interpret as the redshifted orbital period (1 + z)tbin of a putative supermassive black hole binary (SMBHB). Here, we consider the implications of a 3–8 times shorter orbital period, suggested by hydrodynamical simulations of circumbinary discs (CBDs) with nearly equal-mass SMBHBs (q ≡ M2/M1 ≳ 0.3). With the corresponding 2–4 times tighter binary separation, PG 1302 would be undergoing gravitational wave dominated inspiral, and serve as a proof that the BHs can be fuelled and produce bright emission even in this late stage of the merger. The expected fraction of binaries with the shorter tbin, among bright quasars, would be reduced by one to two orders of magnitude, compared to the 5.2 yr period, in better agreement with the rarity of candidates reported by Graham et al. Finally, shorter periods would imply higher binary speeds, possibly imprinting periodicity on the light curves from relativistic beaming, as well as measurable relativistic effects on the Fe K α line. The CBD model predicts additional periodic variability on time-scales of tbin and ≈0.5tbin, as well as periodic variation of broad line widths and offsets relative to the narrow lines, which are consistent with the observations. Future observations will be able to test these predictions and hence the binary+CBD hypothesis for PG 1302.","lang":"eng"}],"extern":"1"}]