[{"date_created":"2018-12-11T11:55:37Z","_id":"2086","volume":9,"acknowledgement":"This study was funded jointly by a grant from BBSRC, Defra, NERC, the Scottish Government and the Wellcome Trust, under the Insect Pollinators Initiative (grant numbers BB/I00097/1 and BB/I000100/1). Rothamsted Research is a national institute of bioscience strategically funded by the UK Biotechnology and Biological Sciences Research Council (BBSRC).","issue":"8","file_date_updated":"2020-07-14T12:45:28Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2023-02-23T14:11:56Z","author":[{"full_name":"Wolf, Stephan","first_name":"Stephan","last_name":"Wolf"},{"full_name":"Mcmahon, Dino","first_name":"Dino","last_name":"Mcmahon"},{"first_name":"Ka","last_name":"Lim","full_name":"Lim, Ka"},{"orcid":"0000-0003-1122-3982","full_name":"Pull, Christopher","first_name":"Christopher","last_name":"Pull","id":"3C7F4840-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Clark, Suzanne","last_name":"Clark","first_name":"Suzanne"},{"last_name":"Paxton","first_name":"Robert","full_name":"Paxton, Robert"},{"first_name":"Juliet","last_name":"Osborne","full_name":"Osborne, Juliet"}],"department":[{"_id":"SyCr"}],"month":"08","intvolume":"         9","day":"06","scopus_import":1,"pubrep_id":"437","citation":{"ieee":"S. Wolf <i>et al.</i>, “So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees,” <i>PLoS One</i>, vol. 9, no. 8. Public Library of Science, 2014.","mla":"Wolf, Stephan, et al. “So near and yet so Far: Harmonic Radar Reveals Reduced Homing Ability of Nosema Infected Honeybees.” <i>PLoS One</i>, vol. 9, no. 8, e103989, Public Library of Science, 2014, doi:<a href=\"https://doi.org/10.1371/journal.pone.0103989\">10.1371/journal.pone.0103989</a>.","short":"S. Wolf, D. Mcmahon, K. Lim, C. Pull, S. Clark, R. Paxton, J. Osborne, PLoS One 9 (2014).","apa":"Wolf, S., Mcmahon, D., Lim, K., Pull, C., Clark, S., Paxton, R., &#38; Osborne, J. (2014). So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0103989\">https://doi.org/10.1371/journal.pone.0103989</a>","ista":"Wolf S, Mcmahon D, Lim K, Pull C, Clark S, Paxton R, Osborne J. 2014. So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees. PLoS One. 9(8), e103989.","ama":"Wolf S, Mcmahon D, Lim K, et al. So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees. <i>PLoS One</i>. 2014;9(8). doi:<a href=\"https://doi.org/10.1371/journal.pone.0103989\">10.1371/journal.pone.0103989</a>","chicago":"Wolf, Stephan, Dino Mcmahon, Ka Lim, Christopher Pull, Suzanne Clark, Robert Paxton, and Juliet Osborne. “So near and yet so Far: Harmonic Radar Reveals Reduced Homing Ability of Nosema Infected Honeybees.” <i>PLoS One</i>. Public Library of Science, 2014. <a href=\"https://doi.org/10.1371/journal.pone.0103989\">https://doi.org/10.1371/journal.pone.0103989</a>."},"related_material":{"record":[{"relation":"research_data","id":"9888","status":"public"}]},"language":[{"iso":"eng"}],"article_number":"e103989","has_accepted_license":"1","oa":1,"publist_id":"4949","oa_version":"Published Version","status":"public","date_published":"2014-08-06T00:00:00Z","publication_status":"published","year":"2014","quality_controlled":"1","publisher":"Public Library of Science","ddc":["570"],"file":[{"date_created":"2018-12-12T10:13:55Z","relation":"main_file","content_type":"application/pdf","creator":"system","access_level":"open_access","checksum":"2fc62c6739eada4bddf026afbae669db","file_id":"5042","date_updated":"2020-07-14T12:45:28Z","file_name":"IST-2016-437-v1+1_journal.pone.0103989.pdf","file_size":1013386}],"title":"So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","type":"journal_article","doi":"10.1371/journal.pone.0103989","publication":"PLoS One","abstract":[{"text":"Pathogens may gain a fitness advantage through manipulation of the behaviour of their hosts. Likewise, host behavioural changes can be a defence mechanism, counteracting the impact of pathogens on host fitness. We apply harmonic radar technology to characterize the impact of an emerging pathogen - Nosema ceranae (Microsporidia) - on honeybee (Apis mellifera) flight and orientation performance in the field. Honeybees are the most important commercial pollinators. Emerging diseases have been proposed to play a prominent role in colony decline, partly through sub-lethal behavioural manipulation of their hosts. We found that homing success was significantly reduced in diseased (65.8%) versus healthy foragers (92.5%). Although lost bees had significantly reduced continuous flight times and prolonged resting times, other flight characteristics and navigational abilities showed no significant difference between infected and non-infected bees. Our results suggest that infected bees express normal flight characteristics but are constrained in their homing ability, potentially compromising the colony by reducing its resource inputs, but also counteracting the intra-colony spread of infection. We provide the first high-resolution analysis of sub-lethal effects of an emerging disease on insect flight behaviour. The potential causes and the implications for both host and parasite are discussed.","lang":"eng"}]},{"quality_controlled":0,"publisher":"ACM","author":[{"last_name":"Bermano","first_name":"Amit","full_name":"Bermano, Amit H"},{"first_name":"Derek","last_name":"Bradley","full_name":"Bradley, Derek J"},{"last_name":"Beeler","first_name":"Thabo","full_name":"Beeler, Thabo"},{"first_name":"Fabio","last_name":"Zund","full_name":"Zund, Fabio"},{"first_name":"Derek","last_name":"Nowrouzezahrai","full_name":"Nowrouzezahrai, Derek"},{"first_name":"Ilya","last_name":"Baran","full_name":"Baran, Ilya"},{"first_name":"Olga","last_name":"Sorkine Hornung","full_name":"Sorkine-Hornung, Olga"},{"last_name":"Pfister","first_name":"Hanspeter","full_name":"Pfister, Hanspeter"},{"last_name":"Sumner","first_name":"Robert","full_name":"Sumner, Robert W"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","first_name":"Bernd","full_name":"Bernd Bickel","orcid":"0000-0001-6511-9385"},{"first_name":"Markus","last_name":"Groß","full_name":"Groß, Markus S"}],"date_published":"2014-03-01T00:00:00Z","year":"2014","publication_status":"published","date_updated":"2021-01-12T06:55:24Z","volume":33,"publist_id":"4919","issue":"2","status":"public","extern":1,"date_created":"2018-12-11T11:55:48Z","_id":"2115","publication":"ACM Transactions on Graphics","abstract":[{"text":"The facial performance of an individual is inherently rich in subtle deformation and timing details. Although these subtleties make the performance realistic and compelling, they often elude both motion capture and hand animation. We present a technique for adding fine-scale details and expressiveness to low-resolution art-directed facial performances, such as those created manually using a rig, via marker-based capture, by fitting a morphable model to a video, or through Kinect reconstruction using recent faceshift technology. We employ a high-resolution facial performance capture system to acquire a representative performance of an individual in which he or she explores the full range of facial expressiveness. From the captured data, our system extracts an expressiveness model that encodes subtle spatial and temporal deformation details specific to that particular individual. Once this model has been built, these details can be transferred to low-resolution art-directed performances. We demonstrate results on various forms of input; after our enhancement, the resulting animations exhibit the same nuances and fine spatial details as the captured performance, with optional temporal enhancement to match the dynamics of the actor. Finally, we show that our technique outperforms the current state-of-the-art in example-based facial animation.","lang":"eng"}],"doi":"10.1145/2546276","citation":{"mla":"Bermano, Amit, et al. “Facial Performance Enhancement Using Dynamic Shape Space Analysis.” <i>ACM Transactions on Graphics</i>, vol. 33, no. 2, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2546276\">10.1145/2546276</a>.","apa":"Bermano, A., Bradley, D., Beeler, T., Zund, F., Nowrouzezahrai, D., Baran, I., … Groß, M. (2014). Facial performance enhancement using dynamic shape space analysis. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2546276\">https://doi.org/10.1145/2546276</a>","short":"A. Bermano, D. Bradley, T. Beeler, F. Zund, D. Nowrouzezahrai, I. Baran, O. Sorkine Hornung, H. Pfister, R. Sumner, B. Bickel, M. Groß, ACM Transactions on Graphics 33 (2014).","chicago":"Bermano, Amit, Derek Bradley, Thabo Beeler, Fabio Zund, Derek Nowrouzezahrai, Ilya Baran, Olga Sorkine Hornung, et al. “Facial Performance Enhancement Using Dynamic Shape Space Analysis.” <i>ACM Transactions on Graphics</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2546276\">https://doi.org/10.1145/2546276</a>.","ama":"Bermano A, Bradley D, Beeler T, et al. Facial performance enhancement using dynamic shape space analysis. <i>ACM Transactions on Graphics</i>. 2014;33(2). doi:<a href=\"https://doi.org/10.1145/2546276\">10.1145/2546276</a>","ista":"Bermano A, Bradley D, Beeler T, Zund F, Nowrouzezahrai D, Baran I, Sorkine Hornung O, Pfister H, Sumner R, Bickel B, Groß M. 2014. Facial performance enhancement using dynamic shape space analysis. ACM Transactions on Graphics. 33(2).","ieee":"A. Bermano <i>et al.</i>, “Facial performance enhancement using dynamic shape space analysis,” <i>ACM Transactions on Graphics</i>, vol. 33, no. 2. ACM, 2014."},"title":"Facial performance enhancement using dynamic shape space analysis","intvolume":"        33","type":"journal_article","day":"01","month":"03"},{"date_created":"2018-12-11T11:55:53Z","_id":"2131","status":"public","extern":1,"acknowledgement":"JM is supported by Rubicon grant 680-50-0901 of the Netherlands Organisation for Scientific Research (NWO). MH is supported by EPSRC grant EP/D071593/1 and by the Royal Society through a Wolfson Research Merit Award. Both MH and HW are supported by the Le","volume":67,"publist_id":"4902","oa":1,"issue":"5","publication_status":"published","year":"2014","date_updated":"2021-01-12T06:55:30Z","date_published":"2014-05-01T00:00:00Z","quality_controlled":0,"publisher":"Wiley-Blackwell","author":[{"full_name":"Hairer, Martin M","first_name":"Martin","last_name":"Hairer"},{"first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas","full_name":"Jan Maas","orcid":"0000-0002-0845-1338"},{"full_name":"Weber, Hendrik","last_name":"Weber","first_name":"Hendrik"}],"page":"776 - 870","month":"05","intvolume":"        67","title":"Approximating Rough Stochastic PDEs","day":"01","type":"journal_article","main_file_link":[{"url":"http://arxiv.org/abs/1202.3094 ","open_access":"1"}],"citation":{"mla":"Hairer, Martin, et al. “Approximating Rough Stochastic PDEs.” <i>Communications on Pure and Applied Mathematics</i>, vol. 67, no. 5, Wiley-Blackwell, 2014, pp. 776–870, doi:<a href=\"https://doi.org/10.1002/cpa.21495\">10.1002/cpa.21495</a>.","short":"M. Hairer, J. Maas, H. Weber, Communications on Pure and Applied Mathematics 67 (2014) 776–870.","apa":"Hairer, M., Maas, J., &#38; Weber, H. (2014). Approximating Rough Stochastic PDEs. <i>Communications on Pure and Applied Mathematics</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/cpa.21495\">https://doi.org/10.1002/cpa.21495</a>","ama":"Hairer M, Maas J, Weber H. Approximating Rough Stochastic PDEs. <i>Communications on Pure and Applied Mathematics</i>. 2014;67(5):776-870. doi:<a href=\"https://doi.org/10.1002/cpa.21495\">10.1002/cpa.21495</a>","ista":"Hairer M, Maas J, Weber H. 2014. Approximating Rough Stochastic PDEs. Communications on Pure and Applied Mathematics. 67(5), 776–870.","chicago":"Hairer, Martin, Jan Maas, and Hendrik Weber. “Approximating Rough Stochastic PDEs.” <i>Communications on Pure and Applied Mathematics</i>. Wiley-Blackwell, 2014. <a href=\"https://doi.org/10.1002/cpa.21495\">https://doi.org/10.1002/cpa.21495</a>.","ieee":"M. Hairer, J. Maas, and H. Weber, “Approximating Rough Stochastic PDEs,” <i>Communications on Pure and Applied Mathematics</i>, vol. 67, no. 5. Wiley-Blackwell, pp. 776–870, 2014."},"doi":"10.1002/cpa.21495","abstract":[{"text":"We study approximations to a class of vector-valued equations of Burgers type driven by a multiplicative space-time white noise. A solution theory for this class of equations has been developed recently in Probability Theory Related Fields by Hairer and Weber. The key idea was to use the theory of controlled rough paths to give definitions of weak/mild solutions and to set up a Picard iteration argument. In this article the limiting behavior of a rather large class of (spatial) approximations to these equations is studied. These approximations are shown to converge and convergence rates are given, but the limit may depend on the particular choice of approximation. This effect is a spatial analogue to the Itô-Stratonovich correction in the theory of stochastic ordinary differential equations, where it is well known that different approximation schemes may converge to different solutions.","lang":"eng"}],"publication":"Communications on Pure and Applied Mathematics"},{"abstract":[{"lang":"eng","text":"We consider discrete porous medium equations of the form ∂tρt=Δϕ(ρt), where Δ is the generator of a reversible continuous time Markov chain on a finite set χ, and ϕ is an increasing function. We show that these equations arise as gradient flows of certain entropy functionals with respect to suitable non-local transportation metrics. This may be seen as a discrete analogue of the Wasserstein gradient flow structure for porous medium equations in ℝn discovered by Otto. We present a one-dimensional counterexample to geodesic convexity and discuss Gromov-Hausdorff convergence to the Wasserstein metric."}],"publication":"Discrete and Continuous Dynamical Systems- Series A","citation":{"ieee":"M. Erbar and J. Maas, “Gradient flow structures for discrete porous medium equations,” <i>Discrete and Continuous Dynamical Systems- Series A</i>, vol. 34, no. 4. Southwest Missouri State University, pp. 1355–1374, 2014.","ista":"Erbar M, Maas J. 2014. Gradient flow structures for discrete porous medium equations. Discrete and Continuous Dynamical Systems- Series A. 34(4), 1355–1374.","ama":"Erbar M, Maas J. Gradient flow structures for discrete porous medium equations. <i>Discrete and Continuous Dynamical Systems- Series A</i>. 2014;34(4):1355-1374. doi:<a href=\"https://doi.org/10.3934/dcds.2014.34.1355  \">10.3934/dcds.2014.34.1355  </a>","chicago":"Erbar, Matthias, and Jan Maas. “Gradient Flow Structures for Discrete Porous Medium Equations.” <i>Discrete and Continuous Dynamical Systems- Series A</i>. Southwest Missouri State University, 2014. <a href=\"https://doi.org/10.3934/dcds.2014.34.1355  \">https://doi.org/10.3934/dcds.2014.34.1355  </a>.","mla":"Erbar, Matthias, and Jan Maas. “Gradient Flow Structures for Discrete Porous Medium Equations.” <i>Discrete and Continuous Dynamical Systems- Series A</i>, vol. 34, no. 4, Southwest Missouri State University, 2014, pp. 1355–74, doi:<a href=\"https://doi.org/10.3934/dcds.2014.34.1355  \">10.3934/dcds.2014.34.1355  </a>.","apa":"Erbar, M., &#38; Maas, J. (2014). Gradient flow structures for discrete porous medium equations. <i>Discrete and Continuous Dynamical Systems- Series A</i>. Southwest Missouri State University. <a href=\"https://doi.org/10.3934/dcds.2014.34.1355  \">https://doi.org/10.3934/dcds.2014.34.1355  </a>","short":"M. Erbar, J. Maas, Discrete and Continuous Dynamical Systems- Series A 34 (2014) 1355–1374."},"doi":"10.3934/dcds.2014.34.1355  ","title":"Gradient flow structures for discrete porous medium equations","intvolume":"        34","day":"01","type":"journal_article","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1212.1129"}],"month":"04","quality_controlled":0,"author":[{"full_name":"Erbar, Matthias","first_name":"Matthias","last_name":"Erbar"},{"full_name":"Jan Maas","orcid":"0000-0002-0845-1338","first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas"}],"publisher":"Southwest Missouri State University","page":"1355 - 1374","publication_status":"published","year":"2014","date_updated":"2021-01-12T06:55:30Z","date_published":"2014-04-01T00:00:00Z","status":"public","extern":1,"volume":34,"publist_id":"4903","oa":1,"issue":"4","date_created":"2018-12-11T11:55:54Z","_id":"2132"},{"publisher":"Springer","author":[{"first_name":"Eric","last_name":"Carlen","full_name":"Carlen, Eric"},{"orcid":"0000-0002-0845-1338","full_name":"Maas, Jan","first_name":"Jan","last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","page":"887 - 926","date_updated":"2021-01-12T06:55:30Z","year":"2014","publication_status":"published","date_published":"2014-11-01T00:00:00Z","status":"public","extern":"1","oa_version":"Submitted Version","publist_id":"4901","oa":1,"issue":"3","volume":331,"_id":"2133","date_created":"2018-12-11T11:55:54Z","language":[{"iso":"eng"}],"abstract":[{"text":"Let ℭ denote the Clifford algebra over ℝ𝑛, which is the von Neumann algebra generated by n self-adjoint operators Q j , j = 1,…,n satisfying the canonical anticommutation relations, Q i Q j  + Q j Q i =  2δ ij I, and let τ denote the normalized trace on ℭ. This algebra arises in quantum mechanics as the algebra of observables generated by n fermionic degrees of freedom. Let 𝔓 denote the set of all positive operators 𝜌∈ℭ such that τ(ρ) = 1; these are the non-commutative analogs of probability densities in the non-commutative probability space (ℭ,𝜏). The fermionic Fokker–Planck equation is a quantum-mechanical analog of the classical Fokker–Planck equation with which it has much in common, such as the same optimal hypercontractivity properties. In this paper we construct a Riemannian metric on 𝔓 that we show to be a natural analog of the classical 2-Wasserstein metric, and we show that, in analogy with the classical case, the fermionic Fokker–Planck equation is gradient flow in this metric for the relative entropy with respect to the ground state. We derive a number of consequences of this, such as a sharp Talagrand inequality for this metric, and we prove a number of results pertaining to this metric. Several open problems are raised.","lang":"eng"}],"publication":"Communications in Mathematical Physics","citation":{"mla":"Carlen, Eric, and Jan Maas. “An Analog of the 2-Wasserstein Metric in Non-Commutative Probability under Which the Fermionic Fokker-Planck Equation Is Gradient Flow for the Entropy.” <i>Communications in Mathematical Physics</i>, vol. 331, no. 3, Springer, 2014, pp. 887–926, doi:<a href=\"https://doi.org/10.1007/s00220-014-2124-8\">10.1007/s00220-014-2124-8</a>.","apa":"Carlen, E., &#38; Maas, J. (2014). An analog of the 2-Wasserstein metric in non-commutative probability under which the fermionic Fokker-Planck equation is gradient flow for the entropy. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-014-2124-8\">https://doi.org/10.1007/s00220-014-2124-8</a>","short":"E. Carlen, J. Maas, Communications in Mathematical Physics 331 (2014) 887–926.","ama":"Carlen E, Maas J. An analog of the 2-Wasserstein metric in non-commutative probability under which the fermionic Fokker-Planck equation is gradient flow for the entropy. <i>Communications in Mathematical Physics</i>. 2014;331(3):887-926. doi:<a href=\"https://doi.org/10.1007/s00220-014-2124-8\">10.1007/s00220-014-2124-8</a>","ista":"Carlen E, Maas J. 2014. An analog of the 2-Wasserstein metric in non-commutative probability under which the fermionic Fokker-Planck equation is gradient flow for the entropy. Communications in Mathematical Physics. 331(3), 887–926.","chicago":"Carlen, Eric, and Jan Maas. “An Analog of the 2-Wasserstein Metric in Non-Commutative Probability under Which the Fermionic Fokker-Planck Equation Is Gradient Flow for the Entropy.” <i>Communications in Mathematical Physics</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00220-014-2124-8\">https://doi.org/10.1007/s00220-014-2124-8</a>.","ieee":"E. Carlen and J. Maas, “An analog of the 2-Wasserstein metric in non-commutative probability under which the fermionic Fokker-Planck equation is gradient flow for the entropy,” <i>Communications in Mathematical Physics</i>, vol. 331, no. 3. Springer, pp. 887–926, 2014."},"doi":"10.1007/s00220-014-2124-8","day":"01","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","type":"journal_article","title":"An analog of the 2-Wasserstein metric in non-commutative probability under which the fermionic Fokker-Planck equation is gradient flow for the entropy","intvolume":"       331","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1203.5377 "}],"month":"11"},{"type":"journal_article","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"11","intvolume":"       113","title":"Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates","main_file_link":[{"url":"http://arxiv.org/abs/1308.5905","open_access":"1"}],"month":"08","abstract":[{"lang":"eng","text":"We propose a technique for engineering momentum-dependent dissipation in Bose-Einstein condensates with non-local interactions. The scheme relies on the use of momentum-dependent dark-states in close analogy to velocity-selective coherent population trapping. During the short-time dissipative dynamics, the system is driven into a particular finite-momentum phonon mode, which in real space corresponds to an ordered structure with non-local density-density correlations. Dissipation-induced ordering can be observed and studied in present-day experiments using cold atoms with dipole-dipole or off-resonant Rydberg interactions. Due to its dissipative nature, the ordering does not require artificial breaking of translational symmetry by an opticallattice or harmonic trap. This opens up a perspective of direct cooling of quantum gases into strongly-interacting phases."}],"publication":"Physical Review Letters","citation":{"short":"J. Otterbach, M. Lemeshko, Physical Review Letters 113 (2014).","apa":"Otterbach, J., &#38; Lemeshko, M. (2014). Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.113.070401\">https://doi.org/10.1103/PhysRevLett.113.070401</a>","mla":"Otterbach, Johannes, and Mikhail Lemeshko. “Dissipative Preparation of Spatial Order in Rydberg-Dressed Bose-Einstein Condensates.” <i>Physical Review Letters</i>, vol. 113, no. 7, 070401, American Physical Society, 2014, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.113.070401\">10.1103/PhysRevLett.113.070401</a>.","ista":"Otterbach J, Lemeshko M. 2014. Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates. Physical Review Letters. 113(7), 070401.","chicago":"Otterbach, Johannes, and Mikhail Lemeshko. “Dissipative Preparation of Spatial Order in Rydberg-Dressed Bose-Einstein Condensates.” <i>Physical Review Letters</i>. American Physical Society, 2014. <a href=\"https://doi.org/10.1103/PhysRevLett.113.070401\">https://doi.org/10.1103/PhysRevLett.113.070401</a>.","ama":"Otterbach J, Lemeshko M. Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates. <i>Physical Review Letters</i>. 2014;113(7). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.113.070401\">10.1103/PhysRevLett.113.070401</a>","ieee":"J. Otterbach and M. Lemeshko, “Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates,” <i>Physical Review Letters</i>, vol. 113, no. 7. American Physical Society, 2014."},"doi":"10.1103/PhysRevLett.113.070401","status":"public","extern":"1","oa_version":"Submitted Version","issue":"7","oa":1,"publist_id":"4884","acknowledgement":"This work was supported by NSF through a grant for the Institute for Theoretical Atomic, Molecular, and Optical Physics at Harvard University and Smithsonian Astrophysical Observatory as well as the Harvard Quantum Optics Center.","volume":113,"_id":"2140","article_number":"070401","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:55:56Z","author":[{"last_name":"Otterbach","first_name":"Johannes","full_name":"Otterbach, Johannes"},{"orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","first_name":"Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"}],"publisher":"American Physical Society","date_updated":"2021-01-12T06:55:33Z","year":"2014","publication_status":"published","date_published":"2014-08-11T00:00:00Z"},{"doi":"10.1145/2597631","publication":"Journal of the ACM","abstract":[{"text":"The computation of the winning set for Büchi objectives in alternating games on graphs is a central problem in computer-aided verification with a large number of applications. The long-standing best known upper bound for solving the problem is Õ(n ⋅ m), where n is the number of vertices and m is the number of edges in the graph. We are the first to break the Õ(n ⋅ m) boundary by presenting a new technique that reduces the running time to O(n2). This bound also leads to O(n2)-time algorithms for computing the set of almost-sure winning vertices for Büchi objectives (1) in alternating games with probabilistic transitions (improving an earlier bound of Õ(n ⋅ m)), (2) in concurrent graph games with constant actions (improving an earlier bound of O(n3)), and (3) in Markov decision processes (improving for m&gt;n4/3 an earlier bound of O(m ⋅ √m)). We then show how to maintain the winning set for Büchi objectives in alternating games under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per operation. Our algorithms are the first dynamic algorithms for this problem. We then consider another core graph theoretic problem in verification of probabilistic systems, namely computing the maximal end-component decomposition of a graph. We present two improved static algorithms for the maximal end-component decomposition problem. Our first algorithm is an O(m ⋅ √m)-time algorithm, and our second algorithm is an O(n2)-time algorithm which is obtained using the same technique as for alternating Büchi games. Thus, we obtain an O(min &amp;lcu;m ⋅ √m,n2})-time algorithm improving the long-standing O(n ⋅ m) time bound. Finally, we show how to maintain the maximal end-component decomposition of a graph under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per edge deletion, and O(m) worst-case time per edge insertion. Again, our algorithms are the first dynamic algorithms for this problem.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://eprints.cs.univie.ac.at/3933/"}],"type":"journal_article","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","title":"Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition","date_published":"2014-05-01T00:00:00Z","publication_status":"published","year":"2014","publisher":"ACM","quality_controlled":"1","ec_funded":1,"article_number":"a15","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3165"}]},"article_processing_charge":"No","publist_id":"4883","oa":1,"status":"public","oa_version":"Submitted Version","project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF","grant_number":"S11407"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"scopus_import":"1","citation":{"ieee":"K. Chatterjee and M. H. Henzinger, “Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition,” <i>Journal of the ACM</i>, vol. 61, no. 3. ACM, 2014.","chicago":"Chatterjee, Krishnendu, and Monika H Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.” <i>Journal of the ACM</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2597631\">https://doi.org/10.1145/2597631</a>.","ista":"Chatterjee K, Henzinger MH. 2014. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. 61(3), a15.","ama":"Chatterjee K, Henzinger MH. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. <i>Journal of the ACM</i>. 2014;61(3). doi:<a href=\"https://doi.org/10.1145/2597631\">10.1145/2597631</a>","mla":"Chatterjee, Krishnendu, and Monika H. Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.” <i>Journal of the ACM</i>, vol. 61, no. 3, a15, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2597631\">10.1145/2597631</a>.","apa":"Chatterjee, K., &#38; Henzinger, M. H. (2014). Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2597631\">https://doi.org/10.1145/2597631</a>","short":"K. Chatterjee, M.H. Henzinger, Journal of the ACM 61 (2014)."},"department":[{"_id":"KrCh"}],"month":"05","day":"01","intvolume":"        61","date_updated":"2025-06-02T08:53:48Z","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"}],"_id":"2141","date_created":"2018-12-11T11:55:57Z","issue":"3","volume":61},{"department":[{"_id":"HeEd"}],"month":"06","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","type":"conference","day":"01","title":"Induced matchings of barcodes and the algebraic stability of persistence","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1311.3681"}],"citation":{"ieee":"U. Bauer and M. Lesnick, “Induced matchings of barcodes and the algebraic stability of persistence,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 355–364.","ista":"Bauer U, Lesnick M. 2014. Induced matchings of barcodes and the algebraic stability of persistence. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 355–364.","ama":"Bauer U, Lesnick M. Induced matchings of barcodes and the algebraic stability of persistence. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:355-364. doi:<a href=\"https://doi.org/10.1145/2582112.2582168\">10.1145/2582112.2582168</a>","chicago":"Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the Algebraic Stability of Persistence.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 355–64. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582168\">https://doi.org/10.1145/2582112.2582168</a>.","apa":"Bauer, U., &#38; Lesnick, M. (2014). Induced matchings of barcodes and the algebraic stability of persistence. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 355–364). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582168\">https://doi.org/10.1145/2582112.2582168</a>","short":"U. Bauer, M. Lesnick, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 355–364.","mla":"Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the Algebraic Stability of Persistence.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 355–64, doi:<a href=\"https://doi.org/10.1145/2582112.2582168\">10.1145/2582112.2582168</a>."},"conference":{"location":"Kyoto, Japan","name":"SoCG: Symposium on Computational Geometry","start_date":"2014-06-08","end_date":"2014-06-11"},"doi":"10.1145/2582112.2582168","project":[{"name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"318493"}],"scopus_import":1,"abstract":[{"lang":"eng","text":"We define a simple, explicit map sending a morphism f : M → N of pointwise finite dimensional persistence modules to a matching between the barcodes of M and N. Our main result is that, in a precise sense, the quality of this matching is tightly controlled by the lengths of the longest intervals in the barcodes of ker f and coker f . As an immediate corollary, we obtain a new proof of the algebraic stability theorem for persistence barcodes [5, 9], a fundamental result in the theory of persistent homology. In contrast to previous proofs, ours shows explicitly how a δ-interleaving morphism between two persistence modules induces a δ-matching between the barcodes of the two modules. Our main result also specializes to a structure theorem for submodules and quotients of persistence modules. Copyright is held by the owner/author(s)."}],"publication":"Proceedings of the Annual Symposium on Computational Geometry","ec_funded":1,"_id":"2153","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:56:01Z","status":"public","oa_version":"Submitted Version","publist_id":"4853","oa":1,"date_updated":"2021-01-12T06:55:38Z","publication_status":"published","year":"2014","date_published":"2014-06-01T00:00:00Z","author":[{"full_name":"Bauer, Ulrich","orcid":"0000-0002-9683-0724","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","last_name":"Bauer","first_name":"Ulrich"},{"full_name":"Lesnick, Michael","last_name":"Lesnick","first_name":"Michael"}],"publisher":"ACM","quality_controlled":"1","page":"355 - 364"},{"issue":"1","acknowledgement":"Swiss National Science Foundation (SNF 200021-125309, 200020-138230, 200020-12507)","volume":52,"_id":"2154","date_created":"2018-12-11T11:56:01Z","author":[{"last_name":"Matoušek","first_name":"Jiří","full_name":"Matoušek, Jiří"},{"full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner"}],"date_updated":"2021-01-12T06:55:38Z","day":"01","intvolume":"        52","department":[{"_id":"UlWa"}],"month":"07","citation":{"ieee":"J. Matoušek and U. Wagner, “On Gromov’s method of selecting heavily covered points,” <i>Discrete &#38; Computational Geometry</i>, vol. 52, no. 1. Springer, pp. 1–33, 2014.","ama":"Matoušek J, Wagner U. On Gromov’s method of selecting heavily covered points. <i>Discrete &#38; Computational Geometry</i>. 2014;52(1):1-33. doi:<a href=\"https://doi.org/10.1007/s00454-014-9584-7\">10.1007/s00454-014-9584-7</a>","ista":"Matoušek J, Wagner U. 2014. On Gromov’s method of selecting heavily covered points. Discrete &#38; Computational Geometry. 52(1), 1–33.","chicago":"Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily Covered Points.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00454-014-9584-7\">https://doi.org/10.1007/s00454-014-9584-7</a>.","short":"J. Matoušek, U. Wagner, Discrete &#38; Computational Geometry 52 (2014) 1–33.","apa":"Matoušek, J., &#38; Wagner, U. (2014). On Gromov’s method of selecting heavily covered points. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-014-9584-7\">https://doi.org/10.1007/s00454-014-9584-7</a>","mla":"Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily Covered Points.” <i>Discrete &#38; Computational Geometry</i>, vol. 52, no. 1, Springer, 2014, pp. 1–33, doi:<a href=\"https://doi.org/10.1007/s00454-014-9584-7\">10.1007/s00454-014-9584-7</a>."},"project":[{"_id":"25FA3206-B435-11E9-9278-68D0E5697425","name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics","grant_number":"PP00P2_138948"}],"scopus_import":1,"status":"public","oa_version":"Submitted Version","oa":1,"publist_id":"4852","language":[{"iso":"eng"}],"publisher":"Springer","quality_controlled":"1","page":"1 - 33","year":"2014","publication_status":"published","date_published":"2014-07-01T00:00:00Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","type":"journal_article","title":"On Gromov's method of selecting heavily covered points","main_file_link":[{"url":"http://arxiv.org/abs/1102.3515","open_access":"1"}],"abstract":[{"lang":"eng","text":"A result of Boros and Füredi (d = 2) and of Bárány (arbitrary d) asserts that for every d there exists cd &gt; 0 such that for every n-point set P ⊂ ℝd, some point of ℝd is covered by at least (Formula presented.) of the d-simplices spanned by the points of P. The largest possible value of cd has been the subject of ongoing research. Recently Gromov improved the existing lower bounds considerably by introducing a new, topological proof method. We provide an exposition of the combinatorial component of Gromov's approach, in terms accessible to combinatorialists and discrete geometers, and we investigate the limits of his method. In particular, we give tighter bounds on the cofilling profiles for the (n - 1)-simplex. These bounds yield a minor improvement over Gromov's lower bounds on cd for large d, but they also show that the room for further improvement through the cofilling profiles alone is quite small. We also prove a slightly better lower bound for c3 by an approach using an additional structure besides the cofilling profiles. We formulate a combinatorial extremal problem whose solution might perhaps lead to a tight lower bound for cd."}],"publication":"Discrete & Computational Geometry","doi":"10.1007/s00454-014-9584-7"},{"date_updated":"2021-01-12T06:55:38Z","author":[{"first_name":"Ulrich","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","last_name":"Bauer","full_name":"Bauer, Ulrich","orcid":"0000-0002-9683-0724"},{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T11:56:01Z","_id":"2155","acknowledgement":"This research is partially supported by ESF under the ACAT Research Network Programme, and by the Russian Government under mega project 11.G34.31.0053","citation":{"short":"U. Bauer, H. Edelsbrunner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 484–490.","mla":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Filtrations.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 484–90, doi:<a href=\"https://doi.org/10.1145/2582112.2582167\">10.1145/2582112.2582167</a>.","apa":"Bauer, U., &#38; Edelsbrunner, H. (2014). The morse theory of Čech and Delaunay filtrations. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 484–490). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582167\">https://doi.org/10.1145/2582112.2582167</a>","chicago":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Filtrations.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 484–90. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582167\">https://doi.org/10.1145/2582112.2582167</a>.","ista":"Bauer U, Edelsbrunner H. 2014. The morse theory of Čech and Delaunay filtrations. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 484–490.","ama":"Bauer U, Edelsbrunner H. The morse theory of Čech and Delaunay filtrations. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:484-490. doi:<a href=\"https://doi.org/10.1145/2582112.2582167\">10.1145/2582112.2582167</a>","ieee":"U. Bauer and H. Edelsbrunner, “The morse theory of Čech and Delaunay filtrations,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 484–490."},"scopus_import":1,"project":[{"name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493","call_identifier":"FP7"}],"conference":{"end_date":"2014-06-11","start_date":"2014-06-08","name":"SoCG: Symposium on Computational Geometry","location":"Kyoto, Japan"},"month":"06","department":[{"_id":"HeEd"}],"day":"01","year":"2014","publication_status":"published","date_published":"2014-06-01T00:00:00Z","quality_controlled":"1","publisher":"ACM","page":"484 - 490","language":[{"iso":"eng"}],"ec_funded":1,"oa_version":"Submitted Version","status":"public","publist_id":"4851","oa":1,"doi":"10.1145/2582112.2582167","abstract":[{"text":"Given a finite set of points in Rn and a positive radius, we study the Čech, Delaunay-Čech, alpha, and wrap complexes as instances of a generalized discrete Morse theory. We prove that the latter three complexes are simple-homotopy equivalent. Our results have applications in topological data analysis and in the reconstruction of shapes from sampled data. Copyright is held by the owner/author(s).","lang":"eng"}],"publication":"Proceedings of the Annual Symposium on Computational Geometry","title":"The morse theory of Čech and Delaunay filtrations","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","type":"conference","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1312.1231"}]},{"acknowledgement":"National Science Foundation under grants CCF-1319406, CCF-1116258.","_id":"2156","date_created":"2018-12-11T11:56:02Z","author":[{"id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","last_name":"Bauer","first_name":"Ulrich","full_name":"Bauer, Ulrich","orcid":"0000-0002-9683-0724"},{"full_name":"Ge, Xiaoyin","first_name":"Xiaoyin","last_name":"Ge"},{"full_name":"Wang, Yusu","first_name":"Yusu","last_name":"Wang"}],"date_updated":"2021-01-12T06:55:39Z","day":"01","month":"06","department":[{"_id":"HeEd"}],"citation":{"mla":"Bauer, Ulrich, et al. “Measuring Distance between Reeb Graphs.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 464–73, doi:<a href=\"https://doi.org/10.1145/2582112.2582169\">10.1145/2582112.2582169</a>.","apa":"Bauer, U., Ge, X., &#38; Wang, Y. (2014). Measuring distance between Reeb graphs. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 464–473). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582169\">https://doi.org/10.1145/2582112.2582169</a>","short":"U. Bauer, X. Ge, Y. Wang, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 464–473.","chicago":"Bauer, Ulrich, Xiaoyin Ge, and Yusu Wang. “Measuring Distance between Reeb Graphs.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 464–73. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582169\">https://doi.org/10.1145/2582112.2582169</a>.","ista":"Bauer U, Ge X, Wang Y. 2014. Measuring distance between Reeb graphs. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 464–473.","ama":"Bauer U, Ge X, Wang Y. Measuring distance between Reeb graphs. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:464-473. doi:<a href=\"https://doi.org/10.1145/2582112.2582169\">10.1145/2582112.2582169</a>","ieee":"U. Bauer, X. Ge, and Y. Wang, “Measuring distance between Reeb graphs,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 464–473."},"conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2014-06-08","location":"Kyoto, Japan","end_date":"2014-06-11"},"scopus_import":1,"project":[{"grant_number":"318493","call_identifier":"FP7","name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"status":"public","oa_version":"Submitted Version","oa":1,"publist_id":"4850","ec_funded":1,"language":[{"iso":"eng"}],"publisher":"ACM","quality_controlled":"1","page":"464 - 473","publication_status":"published","year":"2014","date_published":"2014-06-01T00:00:00Z","type":"conference","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","title":"Measuring distance between Reeb graphs","main_file_link":[{"url":"http://arxiv.org/abs/1307.2839","open_access":"1"}],"abstract":[{"lang":"eng","text":"We propose a metric for Reeb graphs, called the functional distortion distance. Under this distance, the Reeb graph is stable against small changes of input functions. At the same time, it remains discriminative at differentiating input functions. In particular, the main result is that the functional distortion distance between two Reeb graphs is bounded from below by the bottleneck distance between both the ordinary and extended persistence diagrams for appropriate dimensions. As an application of our results, we analyze a natural simplification scheme for Reeb graphs, and show that persistent features in Reeb graph remains persistent under simplification. Understanding the stability of important features of the Reeb graph under simplification is an interesting problem on its own right, and critical to the practical usage of Reeb graphs. Copyright is held by the owner/author(s)."}],"publication":"Proceedings of the Annual Symposium on Computational Geometry","doi":"10.1145/2582112.2582169"},{"date_updated":"2023-09-11T13:38:49Z","year":"2014","publication_status":"published","date_published":"2014-06-01T00:00:00Z","author":[{"first_name":"Jiří","last_name":"Matoušek","full_name":"Matoušek, Jiří"},{"last_name":"Sedgwick","first_name":"Eric","full_name":"Sedgwick, Eric"},{"id":"38AC689C-F248-11E8-B48F-1D18A9856A87","last_name":"Tancer","first_name":"Martin","full_name":"Tancer, Martin","orcid":"0000-0002-1191-6714"},{"first_name":"Uli","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli"}],"publisher":"ACM","quality_controlled":"1","page":"78 - 84","_id":"2157","related_material":{"record":[{"relation":"later_version","id":"425","status":"public"}]},"language":[{"iso":"eng"}],"date_created":"2018-12-11T11:56:02Z","status":"public","oa_version":"Submitted Version","publist_id":"4849","oa":1,"acknowledgement":"ERC Advanced Grant No. 267165; Grant GRADR Eurogiga GIG/11/E023  (SNSF-PP00P2-138948); Swiss National Science Foundation  (SNSF-200020-138230).","citation":{"apa":"Matoušek, J., Sedgwick, E., Tancer, M., &#38; Wagner, U. (2014). Embeddability in the 3 sphere is decidable. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 78–84). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582137\">https://doi.org/10.1145/2582112.2582137</a>","mla":"Matoušek, Jiří, et al. “Embeddability in the 3 Sphere Is Decidable.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 78–84, doi:<a href=\"https://doi.org/10.1145/2582112.2582137\">10.1145/2582112.2582137</a>.","short":"J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 78–84.","ista":"Matoušek J, Sedgwick E, Tancer M, Wagner U. 2014. Embeddability in the 3 sphere is decidable. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 78–84.","chicago":"Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Embeddability in the 3 Sphere Is Decidable.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 78–84. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582137\">https://doi.org/10.1145/2582112.2582137</a>.","ama":"Matoušek J, Sedgwick E, Tancer M, Wagner U. Embeddability in the 3 sphere is decidable. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:78-84. doi:<a href=\"https://doi.org/10.1145/2582112.2582137\">10.1145/2582112.2582137</a>","ieee":"J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Embeddability in the 3 sphere is decidable,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 78–84."},"doi":"10.1145/2582112.2582137","conference":{"end_date":"2014-06-11","name":"SoCG: Symposium on Computational Geometry","start_date":"2014-06-08","location":"Kyoto, Japan"},"scopus_import":1,"abstract":[{"lang":"eng","text":"We show that the following algorithmic problem is decidable: given a 2-dimensional simplicial complex, can it be embedded (topologically, or equivalently, piecewise linearly) in ℝ3? By a known reduction, it suffices to decide the embeddability of a given triangulated 3-manifold X into the 3-sphere S3. The main step, which allows us to simplify X and recurse, is in proving that if X can be embedded in S3, then there is also an embedding in which X has a short meridian, i.e., an essential curve in the boundary of X bounding a disk in S3 nX with length bounded by a computable function of the number of tetrahedra of X."}],"publication":"Proceedings of the Annual Symposium on Computational Geometry","month":"06","department":[{"_id":"UlWa"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"01","type":"conference","title":"Embeddability in the 3 sphere is decidable","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1402.0815"}]},{"quality_controlled":"1","publisher":"Elsevier","page":"33 - 40","publication_status":"published","year":"2014","date_published":"2014-10-01T00:00:00Z","oa_version":"Submitted Version","status":"public","publist_id":"4848","oa":1,"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Directional guidance of migrating cells is relatively well explored in the reductionist setting of cell culture experiments. Here spatial gradients of chemical cues as well as gradients of mechanical substrate characteristics prove sufficient to attract single cells as well as their collectives. How such gradients present and act in the context of an organism is far less clear. Here we review recent advances in understanding how guidance cues emerge and operate in the physiological context."}],"publication":"Current Opinion in Cell Biology","doi":"10.1016/j.ceb.2014.05.010","title":"New paradigms in the establishment and maintenance of gradients during directed cell migration","type":"journal_article","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4177954/","open_access":"1"}],"author":[{"full_name":"Majumdar, Ritankar","last_name":"Majumdar","first_name":"Ritankar"},{"first_name":"Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K"},{"full_name":"Parent, Carole","first_name":"Carole","last_name":"Parent"}],"date_updated":"2021-01-12T06:55:40Z","volume":30,"acknowledgement":"This effort was supported by the Intramural Research Program of the Center for Cancer Research, NCI, National Institutes of Health and the European Research Council (ERC).","issue":"1","date_created":"2018-12-11T11:56:03Z","_id":"2158","external_id":{"pmid":["24959970"]},"citation":{"mla":"Majumdar, Ritankar, et al. “New Paradigms in the Establishment and Maintenance of Gradients during Directed Cell Migration.” <i>Current Opinion in Cell Biology</i>, vol. 30, no. 1, Elsevier, 2014, pp. 33–40, doi:<a href=\"https://doi.org/10.1016/j.ceb.2014.05.010\">10.1016/j.ceb.2014.05.010</a>.","apa":"Majumdar, R., Sixt, M. K., &#38; Parent, C. (2014). New paradigms in the establishment and maintenance of gradients during directed cell migration. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2014.05.010\">https://doi.org/10.1016/j.ceb.2014.05.010</a>","short":"R. Majumdar, M.K. Sixt, C. Parent, Current Opinion in Cell Biology 30 (2014) 33–40.","ista":"Majumdar R, Sixt MK, Parent C. 2014. New paradigms in the establishment and maintenance of gradients during directed cell migration. Current Opinion in Cell Biology. 30(1), 33–40.","chicago":"Majumdar, Ritankar, Michael K Sixt, and Carole Parent. “New Paradigms in the Establishment and Maintenance of Gradients during Directed Cell Migration.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.ceb.2014.05.010\">https://doi.org/10.1016/j.ceb.2014.05.010</a>.","ama":"Majumdar R, Sixt MK, Parent C. New paradigms in the establishment and maintenance of gradients during directed cell migration. <i>Current Opinion in Cell Biology</i>. 2014;30(1):33-40. doi:<a href=\"https://doi.org/10.1016/j.ceb.2014.05.010\">10.1016/j.ceb.2014.05.010</a>","ieee":"R. Majumdar, M. K. Sixt, and C. Parent, “New paradigms in the establishment and maintenance of gradients during directed cell migration,” <i>Current Opinion in Cell Biology</i>, vol. 30, no. 1. Elsevier, pp. 33–40, 2014."},"scopus_import":1,"intvolume":"        30","day":"01","pmid":1,"month":"10","department":[{"_id":"MiSi"}]},{"month":"06","department":[{"_id":"UlWa"}],"day":"08","scopus_import":1,"conference":{"start_date":"2014-06-08","name":"SoCG: Symposium on Computational Geometry","location":"Kyoto, Japan","end_date":"2014-06-11"},"pubrep_id":"534","citation":{"apa":"Mabillard, I., &#38; Wagner, U. (2014). Eliminating Tverberg points, I. An analogue of the Whitney trick. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 171–180). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582134\">https://doi.org/10.1145/2582112.2582134</a>","mla":"Mabillard, Isaac, and Uli Wagner. “Eliminating Tverberg Points, I. An Analogue of the Whitney Trick.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 171–80, doi:<a href=\"https://doi.org/10.1145/2582112.2582134\">10.1145/2582112.2582134</a>.","short":"I. Mabillard, U. Wagner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 171–180.","chicago":"Mabillard, Isaac, and Uli Wagner. “Eliminating Tverberg Points, I. An Analogue of the Whitney Trick.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 171–80. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582134\">https://doi.org/10.1145/2582112.2582134</a>.","ista":"Mabillard I, Wagner U. 2014. Eliminating Tverberg points, I. An analogue of the Whitney trick. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 171–180.","ama":"Mabillard I, Wagner U. Eliminating Tverberg points, I. An analogue of the Whitney trick. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:171-180. doi:<a href=\"https://doi.org/10.1145/2582112.2582134\">10.1145/2582112.2582134</a>","ieee":"I. Mabillard and U. Wagner, “Eliminating Tverberg points, I. An analogue of the Whitney trick,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 171–180."},"date_created":"2018-12-11T11:56:03Z","_id":"2159","acknowledgement":"Swiss National Science Foundation (Project SNSF-PP00P2-138948)","file_date_updated":"2020-07-14T12:45:30Z","date_updated":"2023-09-07T11:56:27Z","author":[{"id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","last_name":"Mabillard","first_name":"Isaac","full_name":"Mabillard, Isaac"},{"full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","first_name":"Uli"}],"file":[{"file_size":914396,"file_id":"4735","file_name":"IST-2016-534-v1+1_Eliminating_Tverberg_points_I._An_analogue_of_the_Whitney_trick.pdf","date_updated":"2020-07-14T12:45:30Z","access_level":"open_access","content_type":"application/pdf","creator":"system","checksum":"2aae223fee8ffeaf57bbabd8d92b6a2c","date_created":"2018-12-12T10:09:12Z","relation":"main_file"}],"ddc":["510"],"title":"Eliminating Tverberg points, I. An analogue of the Whitney trick","type":"conference","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","doi":"10.1145/2582112.2582134","publication":"Proceedings of the Annual Symposium on Computational Geometry","abstract":[{"lang":"eng","text":"Motivated by topological Tverberg-type problems, we consider multiple (double, triple, and higher multiplicity) selfintersection points of maps from finite simplicial complexes (compact polyhedra) into ℝd and study conditions under which such multiple points can be eliminated. The most classical case is that of embeddings (i.e., maps without double points) of a κ-dimensional complex K into ℝ2κ. For this problem, the work of van Kampen, Shapiro, and Wu provides an efficiently testable necessary condition for embeddability (namely, vanishing of the van Kampen ob-struction). For κ ≥ 3, the condition is also sufficient, and yields a polynomial-time algorithm for deciding embeddability: One starts with an arbitrary map f : K→ℝ2κ, which generically has finitely many double points; if k ≥ 3 and if the obstruction vanishes then one can successively remove these double points by local modifications of the map f. One of the main tools is the famous Whitney trick that permits eliminating pairs of double points of opposite intersection sign. We are interested in generalizing this approach to intersection points of higher multiplicity. We call a point y 2 ℝd an r-fold Tverberg point of a map f : Kκ →ℝd if y lies in the intersection f(σ1)∩. ∩f(σr) of the images of r pairwise disjoint simplices of K. The analogue of (non-)embeddability that we study is the problem Tverbergκ r→d: Given a κ-dimensional complex K, does it satisfy a Tverberg-type theorem with parameters r and d, i.e., does every map f : K κ → ℝd have an r-fold Tverberg point? Here, we show that for fixed r, κ and d of the form d = rm and k = (r-1)m, m ≥ 3, there is a polynomial-time algorithm for deciding this (based on the vanishing of a cohomological obstruction, as in the case of embeddings). Our main tool is an r-fold analogue of the Whitney trick: Given r pairwise disjoint simplices of K such that the intersection of their images contains two r-fold Tverberg points y+ and y- of opposite intersection sign, we can eliminate y+ and y- by a local isotopy of f. In a subsequent paper, we plan to develop this further and present a generalization of the classical Haeiger-Weber Theorem (which yields a necessary and sufficient condition for embeddability of κ-complexes into ℝd for a wider range of dimensions) to intersection points of higher multiplicity."}],"language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","id":"1123","relation":"dissertation_contains"}]},"has_accepted_license":"1","publist_id":"4847","oa":1,"oa_version":"Submitted Version","status":"public","date_published":"2014-06-08T00:00:00Z","year":"2014","publication_status":"published","page":"171 - 180","quality_controlled":"1","publisher":"ACM"},{"main_file_link":[{"url":"https://dl.acm.org/citation.cfm?id=3045003","open_access":"1"}],"intvolume":"        32","title":"A PAC-Bayesian bound for Lifelong Learning","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"10","type":"conference","month":"05","department":[{"_id":"ChLa"}],"abstract":[{"lang":"eng","text":"Transfer learning has received a lot of attention in the machine learning community over the last years, and several effective algorithms have been developed. However, relatively little is known about their theoretical properties, especially in the setting of lifelong learning, where the goal is to transfer information to tasks for which no data have been observed so far. In this work we study lifelong learning from a theoretical perspective. Our main result is a PAC-Bayesian generalization bound that offers a unified view on existing paradigms for transfer learning, such as the transfer of parameters or the transfer of low-dimensional representations. We also use the bound to derive two principled lifelong learning algorithms, and we show that these yield results comparable with existing methods."}],"scopus_import":"1","conference":{"start_date":"2014-06-21","name":"ICML: International Conference on Machine Learning","location":"Beijing, China","end_date":"2014-06-26"},"citation":{"ieee":"A. Pentina and C. Lampert, “A PAC-Bayesian bound for Lifelong Learning,” presented at the ICML: International Conference on Machine Learning, Beijing, China, 2014, vol. 32, pp. 991–999.","ista":"Pentina A, Lampert C. 2014. A PAC-Bayesian bound for Lifelong Learning. ICML: International Conference on Machine Learning vol. 32, 991–999.","ama":"Pentina A, Lampert C. A PAC-Bayesian bound for Lifelong Learning. In: Vol 32. ML Research Press; 2014:991-999.","chicago":"Pentina, Anastasia, and Christoph Lampert. “A PAC-Bayesian Bound for Lifelong Learning,” 32:991–99. ML Research Press, 2014.","apa":"Pentina, A., &#38; Lampert, C. (2014). A PAC-Bayesian bound for Lifelong Learning (Vol. 32, pp. 991–999). Presented at the ICML: International Conference on Machine Learning, Beijing, China: ML Research Press.","mla":"Pentina, Anastasia, and Christoph Lampert. <i>A PAC-Bayesian Bound for Lifelong Learning</i>. Vol. 32, ML Research Press, 2014, pp. 991–99.","short":"A. Pentina, C. Lampert, in:, ML Research Press, 2014, pp. 991–999."},"volume":32,"oa":1,"publist_id":"4844","oa_version":"Submitted Version","status":"public","date_created":"2018-12-11T11:56:03Z","language":[{"iso":"eng"}],"_id":"2160","article_processing_charge":"No","page":"991 - 999","quality_controlled":"1","author":[{"full_name":"Pentina, Anastasia","first_name":"Anastasia","id":"42E87FC6-F248-11E8-B48F-1D18A9856A87","last_name":"Pentina"},{"last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"publisher":"ML Research Press","date_published":"2014-05-10T00:00:00Z","year":"2014","publication_status":"published","date_updated":"2023-10-17T11:54:24Z"},{"related_material":{"record":[{"id":"9742","status":"public","relation":"research_data"}]},"language":[{"iso":"eng"}],"ec_funded":1,"article_processing_charge":"No","publist_id":"4823","oa_version":"None","status":"public","date_published":"2014-07-23T00:00:00Z","publication_identifier":{"issn":["0340-5443"]},"year":"2014","publication_status":"published","page":"1701 - 1710","quality_controlled":"1","publisher":"Springer","title":"Increased grooming after repeated brood care provides sanitary benefits in a clonal ant","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/s00265-014-1778-8","publication":"Behavioral Ecology and Sociobiology","abstract":[{"lang":"eng","text":"Repeated pathogen exposure is a common threat in colonies of social insects, posing selection pressures on colony members to respond with improved disease-defense performance. We here tested whether experience gained by repeated tending of low-level fungus-exposed (Metarhizium robertsii) larvae may alter the performance of sanitary brood care in the clonal ant, Platythyrea punctata. We trained ants individually over nine consecutive trials to either sham-treated or fungus-exposed larvae. We then compared the larval grooming behavior of naive and trained ants and measured how effectively they removed infectious fungal conidiospores from the fungus-exposed larvae. We found that the ants changed the duration of larval grooming in response to both, larval treatment and their level of experience: (1) sham-treated larvae received longer grooming than the fungus-exposed larvae and (2) trained ants performed less self-grooming but longer larval grooming than naive ants, which was true for both, ants trained to fungus-exposed and also to sham-treated larvae. Ants that groomed the fungus-exposed larvae for longer periods removed a higher number of fungal conidiospores from the surface of the fungus-exposed larvae. As experienced ants performed longer larval grooming, they were more effective in fungal removal, thus making them better caretakers under pathogen attack of the colony. By studying this clonal ant, we can thus conclude that even in the absence of genetic variation between colony members, differences in experience levels of brood care may affect performance of sanitary brood care in social insects."}],"date_created":"2018-12-11T11:56:03Z","_id":"2161","acknowledgement":"We thank Katrin Kellner for colony establishment and characterization, Mike Bidochka for the fungal strain, Meghan Vyleta for fungal strain characterization, Martina Klatt and Simon Tragust for help in the laboratory, Dimitri Missoh for developing the software BioLogic, and Mark Brown and Raphaël Jeanson for discussion and help with data analysis. The study was funded by the European Research Council (ERC Starting Grant to SC; Marie Curie IEF to LVU) and the German Research Foundation DFG (to SC and to JH), and CW received funding by the doctoral school Diversité du Vivant (Cotutelle project to CD and SC).\r\n","volume":68,"issue":"10","date_updated":"2023-02-23T14:06:46Z","author":[{"full_name":"Westhus, Claudia","last_name":"Westhus","id":"ca9c6ca9-e8aa-11ec-a586-b9471ede0494","first_name":"Claudia"},{"orcid":"0000-0003-1832-8883","full_name":"Ugelvig, Line V","last_name":"Ugelvig","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","first_name":"Line V"},{"last_name":"Tourdot","first_name":"Edouard","full_name":"Tourdot, Edouard"},{"full_name":"Heinze, Jürgen","first_name":"Jürgen","last_name":"Heinze"},{"full_name":"Doums, Claudie","first_name":"Claudie","last_name":"Doums"},{"full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","last_name":"Cremer"}],"article_type":"original","month":"07","department":[{"_id":"SyCr"}],"intvolume":"        68","day":"23","scopus_import":"1","project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734"},{"_id":"25DC711C-B435-11E9-9278-68D0E5697425","name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","call_identifier":"FP7","grant_number":"243071"},{"_id":"25DAF0B2-B435-11E9-9278-68D0E5697425","name":"Host-Parasite Coevolution","grant_number":"CR-118/3-1"}],"citation":{"ista":"Westhus C, Ugelvig LV, Tourdot E, Heinze J, Doums C, Cremer S. 2014. Increased grooming after repeated brood care provides sanitary benefits in a clonal ant. Behavioral Ecology and Sociobiology. 68(10), 1701–1710.","chicago":"Westhus, Claudia, Line V Ugelvig, Edouard Tourdot, Jürgen Heinze, Claudie Doums, and Sylvia Cremer. “Increased Grooming after Repeated Brood Care Provides Sanitary Benefits in a Clonal Ant.” <i>Behavioral Ecology and Sociobiology</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00265-014-1778-8\">https://doi.org/10.1007/s00265-014-1778-8</a>.","ama":"Westhus C, Ugelvig LV, Tourdot E, Heinze J, Doums C, Cremer S. Increased grooming after repeated brood care provides sanitary benefits in a clonal ant. <i>Behavioral Ecology and Sociobiology</i>. 2014;68(10):1701-1710. doi:<a href=\"https://doi.org/10.1007/s00265-014-1778-8\">10.1007/s00265-014-1778-8</a>","mla":"Westhus, Claudia, et al. “Increased Grooming after Repeated Brood Care Provides Sanitary Benefits in a Clonal Ant.” <i>Behavioral Ecology and Sociobiology</i>, vol. 68, no. 10, Springer, 2014, pp. 1701–10, doi:<a href=\"https://doi.org/10.1007/s00265-014-1778-8\">10.1007/s00265-014-1778-8</a>.","apa":"Westhus, C., Ugelvig, L. V., Tourdot, E., Heinze, J., Doums, C., &#38; Cremer, S. (2014). Increased grooming after repeated brood care provides sanitary benefits in a clonal ant. <i>Behavioral Ecology and Sociobiology</i>. Springer. <a href=\"https://doi.org/10.1007/s00265-014-1778-8\">https://doi.org/10.1007/s00265-014-1778-8</a>","short":"C. Westhus, L.V. Ugelvig, E. Tourdot, J. Heinze, C. Doums, S. Cremer, Behavioral Ecology and Sociobiology 68 (2014) 1701–1710.","ieee":"C. Westhus, L. V. Ugelvig, E. Tourdot, J. Heinze, C. Doums, and S. Cremer, “Increased grooming after repeated brood care provides sanitary benefits in a clonal ant,” <i>Behavioral Ecology and Sociobiology</i>, vol. 68, no. 10. Springer, pp. 1701–1710, 2014."}},{"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-02-23T12:24:48Z","issue":"Part 2","volume":8573,"_id":"2162","date_created":"2018-12-11T11:56:04Z","external_id":{"arxiv":["1404.5734"]},"conference":{"name":"ICST: International Conference on Software Testing, Verification and Validation","start_date":"2014-07-08","location":"Copenhagen, Denmark","end_date":"2014-07-11"},"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"citation":{"ieee":"K. Chatterjee and R. Ibsen-Jensen, “The complexity of ergodic mean payoff games,” presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 122–133.","short":"K. Chatterjee, R. Ibsen-Jensen, in:, Springer, 2014, pp. 122–133.","mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. <i>The Complexity of Ergodic Mean Payoff Games</i>. Vol. 8573, no. Part 2, Springer, 2014, pp. 122–33, doi:<a href=\"https://doi.org/10.1007/978-3-662-43951-7_11\">10.1007/978-3-662-43951-7_11</a>.","apa":"Chatterjee, K., &#38; Ibsen-Jensen, R. (2014). The complexity of ergodic mean payoff games (Vol. 8573, pp. 122–133). Presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark: Springer. <a href=\"https://doi.org/10.1007/978-3-662-43951-7_11\">https://doi.org/10.1007/978-3-662-43951-7_11</a>","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Ergodic Mean Payoff Games,” 8573:122–33. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-662-43951-7_11\">https://doi.org/10.1007/978-3-662-43951-7_11</a>.","ista":"Chatterjee K, Ibsen-Jensen R. 2014. The complexity of ergodic mean payoff games. ICST: International Conference on Software Testing, Verification and Validation, LNCS, vol. 8573, 122–133.","ama":"Chatterjee K, Ibsen-Jensen R. The complexity of ergodic mean payoff games. In: Vol 8573. Springer; 2014:122-133. doi:<a href=\"https://doi.org/10.1007/978-3-662-43951-7_11\">10.1007/978-3-662-43951-7_11</a>"},"arxiv":1,"day":"01","intvolume":"      8573","month":"01","department":[{"_id":"KrCh"}],"page":"122 - 133","publisher":"Springer","quality_controlled":"1","date_published":"2014-01-01T00:00:00Z","year":"2014","publication_status":"published","oa":1,"publist_id":"4822","status":"public","oa_version":"Preprint","ec_funded":1,"language":[{"iso":"eng"}],"related_material":{"record":[{"id":"5404","status":"public","relation":"earlier_version"}]},"alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"We study two-player (zero-sum) concurrent mean-payoff games played on a finite-state graph. We focus on the important sub-class of ergodic games where all states are visited infinitely often with probability 1. The algorithmic study of ergodic games was initiated in a seminal work of Hoffman and Karp in 1966, but all basic complexity questions have remained unresolved. Our main results for ergodic games are as follows: We establish (1) an optimal exponential bound on the patience of stationary strategies (where patience of a distribution is the inverse of the smallest positive probability and represents a complexity measure of a stationary strategy); (2) the approximation problem lies in FNP; (3) the approximation problem is at least as hard as the decision problem for simple stochastic games (for which NP ∩ coNP is the long-standing best known bound). We present a variant of the strategy-iteration algorithm by Hoffman and Karp; show that both our algorithm and the classical value-iteration algorithm can approximate the value in exponential time; and identify a subclass where the value-iteration algorithm is a FPTAS. We also show that the exact value can be expressed in the existential theory of the reals, and establish square-root sum hardness for a related class of games."}],"doi":"10.1007/978-3-662-43951-7_11","main_file_link":[{"url":"http://arxiv.org/abs/1404.5734","open_access":"1"}],"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The complexity of ergodic mean payoff games"},{"date_published":"2014-01-01T00:00:00Z","year":"2014","publication_status":"published","page":"110 - 121","quality_controlled":"1","publisher":"Springer","alternative_title":["LNCS"],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5418"}]},"language":[{"iso":"eng"}],"ec_funded":1,"publist_id":"4821","oa":1,"oa_version":"Preprint","status":"public","doi":"10.1007/978-3-662-43951-7_10","publication":"Lecture Notes in Computer Science","abstract":[{"text":"We consider multi-player graph games with partial-observation and parity objective. While the decision problem for three-player games with a coalition of the first and second players against the third player is undecidable in general, we present a decidability result for partial-observation games where the first and third player are in a coalition against the second player, thus where the second player is adversarial but weaker due to partial-observation. We establish tight complexity bounds in the case where player 1 is less informed than player 2, namely 2-EXPTIME-completeness for parity objectives. The symmetric case of player 1 more informed than player 2 is much more complicated, and we show that already in the case where player 1 has perfect observation, memory of size non-elementary is necessary in general for reachability objectives, and the problem is decidable for safety and reachability objectives. From our results we derive new complexity results for partial-observation stochastic games.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1404.5453"}],"title":"Games with a weak adversary","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T12:25:29Z","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"}],"date_created":"2018-12-11T11:56:04Z","_id":"2163","volume":8573,"acknowledgement":"This research was partly supported by European project Cassting (FP7-601148).\r\nTechnical Report under https://research-explorer.app.ist.ac.at/record/5418\r\n","issue":"Part 2","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"conference":{"end_date":"2014-07-11","start_date":"2014-07-08","name":"ICALP: Automata, Languages and Programming","location":"Copenhagen, Denmark"},"citation":{"ieee":"K. Chatterjee and L. Doyen, “Games with a weak adversary,” in <i>Lecture Notes in Computer Science</i>, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 110–121.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.” In <i>Lecture Notes in Computer Science</i>, 8573:110–21. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-662-43951-7_10\">https://doi.org/10.1007/978-3-662-43951-7_10</a>.","ama":"Chatterjee K, Doyen L. Games with a weak adversary. In: <i>Lecture Notes in Computer Science</i>. Vol 8573. Springer; 2014:110-121. doi:<a href=\"https://doi.org/10.1007/978-3-662-43951-7_10\">10.1007/978-3-662-43951-7_10</a>","ista":"Chatterjee K, Doyen L. 2014. Games with a weak adversary. Lecture Notes in Computer Science. ICALP: Automata, Languages and Programming, LNCS, vol. 8573, 110–121.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.” <i>Lecture Notes in Computer Science</i>, vol. 8573, no. Part 2, Springer, 2014, pp. 110–21, doi:<a href=\"https://doi.org/10.1007/978-3-662-43951-7_10\">10.1007/978-3-662-43951-7_10</a>.","apa":"Chatterjee, K., &#38; Doyen, L. (2014). Games with a weak adversary. In <i>Lecture Notes in Computer Science</i> (Vol. 8573, pp. 110–121). Copenhagen, Denmark: Springer. <a href=\"https://doi.org/10.1007/978-3-662-43951-7_10\">https://doi.org/10.1007/978-3-662-43951-7_10</a>","short":"K. Chatterjee, L. Doyen, in:, Lecture Notes in Computer Science, Springer, 2014, pp. 110–121."},"external_id":{"arxiv":["1404.5453"]},"month":"01","department":[{"_id":"KrCh"}],"arxiv":1,"intvolume":"      8573","day":"01"},{"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","type":"journal_article","day":"01","intvolume":"        24","title":"Epilepsy-induced motility of differentiated neurons","month":"08","department":[{"_id":"PeJo"}],"publication":"Cerebral Cortex","abstract":[{"text":"Neuronal ectopia, such as granule cell dispersion (GCD) in temporal lobe epilepsy (TLE), has been assumed to result from a migration defect during development. Indeed, recent studies reported that aberrant migration of neonatal-generated dentate granule cells (GCs) increased the risk to develop epilepsy later in life. On the contrary, in the present study, we show that fully differentiated GCs become motile following the induction of epileptiform activity, resulting in GCD. Hippocampal slice cultures from transgenic mice expressing green fluorescent protein in differentiated, but not in newly generated GCs, were incubated with the glutamate receptor agonist kainate (KA), which induced GC burst activity and GCD. Using real-time microscopy, we observed that KA-exposed, differentiated GCs translocated their cell bodies and changed their dendritic organization. As found in human TLE, KA application was associated with decreased expression of the extracellular matrix protein Reelin, particularly in hilar interneurons. Together these findings suggest that KA-induced motility of differentiated GCs contributes to the development of GCD and establish slice cultures as a model to study neuronal changes induced by epileptiform activity. ","lang":"eng"}],"doi":"10.1093/cercor/bht067","scopus_import":1,"citation":{"ieee":"X. Chai <i>et al.</i>, “Epilepsy-induced motility of differentiated neurons,” <i>Cerebral Cortex</i>, vol. 24, no. 8. Oxford University Press, pp. 2130–2140, 2014.","ista":"Chai X, Münzner G, Zhao S, Tinnes S, Kowalski J, Häussler U, Young C, Haas C, Frotscher M. 2014. Epilepsy-induced motility of differentiated neurons. Cerebral Cortex. 24(8), 2130–2140.","ama":"Chai X, Münzner G, Zhao S, et al. Epilepsy-induced motility of differentiated neurons. <i>Cerebral Cortex</i>. 2014;24(8):2130-2140. doi:<a href=\"https://doi.org/10.1093/cercor/bht067\">10.1093/cercor/bht067</a>","chicago":"Chai, Xuejun, Gert Münzner, Shanting Zhao, Stefanie Tinnes, Janina Kowalski, Ute Häussler, Christina Young, Carola Haas, and Michael Frotscher. “Epilepsy-Induced Motility of Differentiated Neurons.” <i>Cerebral Cortex</i>. Oxford University Press, 2014. <a href=\"https://doi.org/10.1093/cercor/bht067\">https://doi.org/10.1093/cercor/bht067</a>.","apa":"Chai, X., Münzner, G., Zhao, S., Tinnes, S., Kowalski, J., Häussler, U., … Frotscher, M. (2014). Epilepsy-induced motility of differentiated neurons. <i>Cerebral Cortex</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/cercor/bht067\">https://doi.org/10.1093/cercor/bht067</a>","short":"X. Chai, G. Münzner, S. Zhao, S. Tinnes, J. Kowalski, U. Häussler, C. Young, C. Haas, M. Frotscher, Cerebral Cortex 24 (2014) 2130–2140.","mla":"Chai, Xuejun, et al. “Epilepsy-Induced Motility of Differentiated Neurons.” <i>Cerebral Cortex</i>, vol. 24, no. 8, Oxford University Press, 2014, pp. 2130–40, doi:<a href=\"https://doi.org/10.1093/cercor/bht067\">10.1093/cercor/bht067</a>."},"issue":"8","publist_id":"4820","volume":24,"status":"public","oa_version":"None","_id":"2164","date_created":"2018-12-11T11:56:04Z","language":[{"iso":"eng"}],"page":"2130 - 2140","author":[{"full_name":"Chai, Xuejun","last_name":"Chai","first_name":"Xuejun"},{"last_name":"Münzner","first_name":"Gert","full_name":"Münzner, Gert"},{"full_name":"Zhao, Shanting","last_name":"Zhao","first_name":"Shanting"},{"full_name":"Tinnes, Stefanie","last_name":"Tinnes","first_name":"Stefanie"},{"first_name":"Janina","last_name":"Kowalski","id":"3F3CA136-F248-11E8-B48F-1D18A9856A87","full_name":"Kowalski, Janina"},{"full_name":"Häussler, Ute","first_name":"Ute","last_name":"Häussler"},{"full_name":"Young, Christina","first_name":"Christina","last_name":"Young"},{"full_name":"Haas, Carola","last_name":"Haas","first_name":"Carola"},{"last_name":"Frotscher","first_name":"Michael","full_name":"Frotscher, Michael"}],"publisher":"Oxford University Press","quality_controlled":"1","date_published":"2014-08-01T00:00:00Z","date_updated":"2021-01-12T06:55:43Z","publication_status":"published","year":"2014"},{"language":[{"iso":"eng"}],"date_created":"2018-12-11T11:56:05Z","_id":"2165","ec_funded":1,"oa_version":"Submitted Version","status":"public","extern":"1","volume":51,"publist_id":"4819","oa":1,"year":"2014","publication_status":"published","date_updated":"2021-01-12T06:55:43Z","date_published":"2014-10-01T00:00:00Z","quality_controlled":"1","publisher":"Elsevier","author":[{"first_name":"Emilie","last_name":"Morvant","id":"4BAC2A72-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8301-7240","full_name":"Morvant, Emilie"}],"page":"37-43","month":"10","title":"Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling","intvolume":"        51","type":"journal_article","day":"01","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1410.0334"}],"citation":{"ieee":"E. Morvant, “Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling,” <i>Pattern Recognition Letters</i>, vol. 51. Elsevier, pp. 37–43, 2014.","chicago":"Morvant, Emilie. “Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling.” <i>Pattern Recognition Letters</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.patrec.2014.08.013\">https://doi.org/10.1016/j.patrec.2014.08.013</a>.","ista":"Morvant E. 2014. Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling. Pattern Recognition Letters. 51, 37–43.","ama":"Morvant E. Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling. <i>Pattern Recognition Letters</i>. 2014;51:37-43. doi:<a href=\"https://doi.org/10.1016/j.patrec.2014.08.013\">10.1016/j.patrec.2014.08.013</a>","apa":"Morvant, E. (2014). Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling. <i>Pattern Recognition Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.patrec.2014.08.013\">https://doi.org/10.1016/j.patrec.2014.08.013</a>","mla":"Morvant, Emilie. “Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling.” <i>Pattern Recognition Letters</i>, vol. 51, Elsevier, 2014, pp. 37–43, doi:<a href=\"https://doi.org/10.1016/j.patrec.2014.08.013\">10.1016/j.patrec.2014.08.013</a>.","short":"E. Morvant, Pattern Recognition Letters 51 (2014) 37–43."},"project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036","call_identifier":"FP7"}],"doi":"10.1016/j.patrec.2014.08.013","abstract":[{"text":"In machine learning, the domain adaptation problem arrives when the test (tar-get) and the train (source) data are generated from different distributions.  A key applied issue is thus the design of algorithms able to generalize on a new distribution,  for which we have no label information.  We focus on learning classification models defined as a weighted majority vote over a set of real-valued functions. In this context, Germain et al. (2013) have shown that a measure of disagreement between these functions is crucial to control. The core of this measure is a theoretical bound—the C-bound (Lacasse et al., 2007)—which involves the disagreement and leads to a well performing majority vote learn-ing algorithm in usual non-adaptative supervised setting: MinCq. In this work,we propose a framework to extend MinCq to a domain adaptation scenario.This procedure takes advantage of the recent perturbed variation divergence between distributions proposed by Harel and Mannor (2012).  Justified by a theoretical bound on the target risk of the vote,  we provide to MinCq a tar-get sample labeled thanks to a perturbed variation-based self-labeling focused on the regions where the source and target marginals appear similar.  We also study the influence of our self-labeling, from which we deduce an original process for tuning the hyperparameters. Finally, our framework called PV-MinCq shows very promising results on a rotation and translation synthetic problem.","lang":"eng"}],"publication":"Pattern Recognition Letters"}]