[{"publisher":"Dryad","doi":"10.5061/dryad.jc402","department":[{"_id":"CaGu"}],"citation":{"ista":"Dhar R, Bergmiller T, Wagner A. 2014. Data from: Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes, Dryad, 10.5061/dryad.jc402.","mla":"Dhar, Riddhiman, et al. Data from: Increased Gene Dosage Plays a Predominant Role in the Initial Stages of Evolution of Duplicate TEM-1 Beta Lactamase Genes. Dryad, 2014, doi:10.5061/dryad.jc402.","chicago":"Dhar, Riddhiman, Tobias Bergmiller, and Andreas Wagner. “Data from: Increased Gene Dosage Plays a Predominant Role in the Initial Stages of Evolution of Duplicate TEM-1 Beta Lactamase Genes.” Dryad, 2014. https://doi.org/10.5061/dryad.jc402.","short":"R. Dhar, T. Bergmiller, A. Wagner, (2014).","ama":"Dhar R, Bergmiller T, Wagner A. Data from: Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes. 2014. doi:10.5061/dryad.jc402","ieee":"R. Dhar, T. Bergmiller, and A. Wagner, “Data from: Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes.” Dryad, 2014.","apa":"Dhar, R., Bergmiller, T., & Wagner, A. (2014). Data from: Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes. Dryad. https://doi.org/10.5061/dryad.jc402"},"date_created":"2021-08-17T09:11:40Z","_id":"9932","date_published":"2014-01-27T00:00:00Z","oa":1,"title":"Data from: Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes","date_updated":"2023-02-23T14:13:24Z","abstract":[{"text":"Gene duplication is important in evolution, because it provides new raw material for evolutionary adaptations. Several existing hypotheses about the causes of duplicate retention and diversification differ in their emphasis on gene dosage, sub-functionalization, and neo-functionalization. Little experimental data exists on the relative importance of gene expression changes and changes in coding regions for the evolution of duplicate genes. Furthermore, we do not know how strongly the environment could affect this importance. To address these questions, we performed evolution experiments with the TEM-1 beta lactamase gene in E. coli to study the initial stages of duplicate gene evolution in the laboratory. We mimicked tandem duplication by inserting two copies of the TEM-1 gene on the same plasmid. We then subjected these copies to repeated cycles of mutagenesis and selection in various environments that contained antibiotics in different combinations and concentrations. Our experiments showed that gene dosage is the most important factor in the initial stages of duplicate gene evolution, and overshadows the importance of point mutations in the coding region.","lang":"eng"}],"related_material":{"record":[{"relation":"used_in_publication","id":"9931","status":"public"}]},"main_file_link":[{"url":"https://doi.org/10.5061/dryad.jc402","open_access":"1"}],"oa_version":"Published Version","author":[{"first_name":"Riddhiman","full_name":"Dhar, Riddhiman","last_name":"Dhar"},{"full_name":"Bergmiller, Tobias","first_name":"Tobias","orcid":"0000-0001-5396-4346","last_name":"Bergmiller","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wagner","full_name":"Wagner, Andreas","first_name":"Andreas"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","day":"27","article_processing_charge":"No","year":"2014","status":"public","type":"research_data_reference","month":"01"},{"quality_controlled":"1","oa_version":"Submitted Version","publist_id":"7478","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"18","status":"public","year":"2014","language":[{"iso":"eng"}],"article_processing_charge":"No","month":"02","publication":"Journal of Nanoparticle Research","doi":"10.1007/s11051-014-2297-2","volume":16,"oa":1,"date_updated":"2021-01-12T07:43:53Z","article_type":"original","abstract":[{"text":"Herein, a colloidal synthetic route to produce highly monodisperse Cu2HgGeSe4 (CHGSe) nanoparticles (NPs) is presented in detail. The high yield of the developed procedure allowed the production of CHGSe NPs at the gram scale. A thorough analysis of their structural and optical properties is shown. CHGSe NPs displayed poly-tetrahedral morphology and narrow size distributions with average size in the range of 10–40 nm and size dispersions below 10 %. A 1.6 eV optical band gap was measured by mean of UV–Vis. By adjusting the cation ratio, an effective control of their electrical conductivity is achieved. The prepared NPs are used as building blocks for the production of CHGSe bulk nanostructured materials. The thermoelectric properties of CHGSe nanomaterials are studied in the temperature range from 300 to 730 K. CHGSe nanomaterials reached electrical conductivities up to 5 × 104 S m−1, Seebeck coefficients above 100 μV K−1, and thermal conductivities below 1.0 W m−1 K−1 which translated into thermoelectric figures of merit up to 0.34 at 730 K.","lang":"eng"}],"issue":"3","acknowledgement":"The research was supported by the European Regional Development Funds (ERDF, ‘‘FEDER Programa Competitivitat de Catalunya 2007–2013’’).","author":[{"last_name":"Li","full_name":"Li, Wenhua","first_name":"Wenhua"},{"last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","first_name":"Maria","full_name":"Ibáñez, Maria"},{"first_name":"Doris","full_name":"Cadavid, Doris","last_name":"Cadavid"},{"first_name":"Reza","full_name":"Zamani, Reza","last_name":"Zamani"},{"last_name":"Rubio Garcia","full_name":"Rubio Garcia, Javier","first_name":"Javier"},{"last_name":"Gorsse","full_name":"Gorsse, Stéphane","first_name":"Stéphane"},{"full_name":"Morante, Joan","first_name":"Joan","last_name":"Morante"},{"last_name":"Arbiol","first_name":"Jordi","full_name":"Arbiol, Jordi"},{"full_name":"Cabot, Andreu","first_name":"Andreu","last_name":"Cabot"}],"main_file_link":[{"url":"https://hal.archives-ouvertes.fr/hal-00959322/","open_access":"1"}],"type":"journal_article","intvolume":" 16","publisher":"Kluwer","date_created":"2018-12-11T11:45:58Z","citation":{"ieee":"W. Li et al., “Colloidal synthesis and functional properties of quaternary Cu based semiconductors: Cu2HgGeSe4,” Journal of Nanoparticle Research, vol. 16, no. 3. Kluwer, 2014.","ama":"Li W, Ibáñez M, Cadavid D, et al. Colloidal synthesis and functional properties of quaternary Cu based semiconductors: Cu2HgGeSe4. Journal of Nanoparticle Research. 2014;16(3). doi:10.1007/s11051-014-2297-2","apa":"Li, W., Ibáñez, M., Cadavid, D., Zamani, R., Rubio Garcia, J., Gorsse, S., … Cabot, A. (2014). Colloidal synthesis and functional properties of quaternary Cu based semiconductors: Cu2HgGeSe4. Journal of Nanoparticle Research. Kluwer. https://doi.org/10.1007/s11051-014-2297-2","mla":"Li, Wenhua, et al. “Colloidal Synthesis and Functional Properties of Quaternary Cu Based Semiconductors: Cu2HgGeSe4.” Journal of Nanoparticle Research, vol. 16, no. 3, Kluwer, 2014, doi:10.1007/s11051-014-2297-2.","chicago":"Li, Wenhua, Maria Ibáñez, Doris Cadavid, Reza Zamani, Javier Rubio Garcia, Stéphane Gorsse, Joan Morante, Jordi Arbiol, and Andreu Cabot. “Colloidal Synthesis and Functional Properties of Quaternary Cu Based Semiconductors: Cu2HgGeSe4.” Journal of Nanoparticle Research. Kluwer, 2014. https://doi.org/10.1007/s11051-014-2297-2.","short":"W. Li, M. Ibáñez, D. Cadavid, R. Zamani, J. Rubio Garcia, S. Gorsse, J. Morante, J. Arbiol, A. Cabot, Journal of Nanoparticle Research 16 (2014).","ista":"Li W, Ibáñez M, Cadavid D, Zamani R, Rubio Garcia J, Gorsse S, Morante J, Arbiol J, Cabot A. 2014. Colloidal synthesis and functional properties of quaternary Cu based semiconductors: Cu2HgGeSe4. Journal of Nanoparticle Research. 16(3)."},"publication_status":"published","extern":"1","date_published":"2014-02-18T00:00:00Z","_id":"350","title":"Colloidal synthesis and functional properties of quaternary Cu based semiconductors: Cu2HgGeSe4"},{"date_published":"2014-01-01T00:00:00Z","_id":"451","extern":1,"volume":41,"title":"Computation of cubical homology, cohomology, and (co)homological operations via chain contraction","oa":1,"date_created":"2018-12-11T11:46:33Z","citation":{"ieee":"P. Pilarczyk and P. Real, “Computation of cubical homology, cohomology, and (co)homological operations via chain contraction,” Advances in Computational Mathematics, vol. 41, no. 1. Kluwer, pp. 253–275, 2014.","ama":"Pilarczyk P, Real P. Computation of cubical homology, cohomology, and (co)homological operations via chain contraction. Advances in Computational Mathematics. 2014;41(1):253-275. doi:10.1007/s10444-014-9356-1","apa":"Pilarczyk, P., & Real, P. (2014). Computation of cubical homology, cohomology, and (co)homological operations via chain contraction. Advances in Computational Mathematics. Kluwer. https://doi.org/10.1007/s10444-014-9356-1","chicago":"Pilarczyk, Pawel, and Pedro Real. “Computation of Cubical Homology, Cohomology, and (Co)Homological Operations via Chain Contraction.” Advances in Computational Mathematics. Kluwer, 2014. https://doi.org/10.1007/s10444-014-9356-1.","mla":"Pilarczyk, Pawel, and Pedro Real. “Computation of Cubical Homology, Cohomology, and (Co)Homological Operations via Chain Contraction.” Advances in Computational Mathematics, vol. 41, no. 1, Kluwer, 2014, pp. 253–75, doi:10.1007/s10444-014-9356-1.","short":"P. Pilarczyk, P. Real, Advances in Computational Mathematics 41 (2014) 253–275.","ista":"Pilarczyk P, Real P. 2014. Computation of cubical homology, cohomology, and (co)homological operations via chain contraction. Advances in Computational Mathematics. 41(1), 253–275."},"publication_status":"published","doi":"10.1007/s10444-014-9356-1","publisher":"Kluwer","publication":"Advances in Computational Mathematics","year":"2014","status":"public","intvolume":" 41","type":"journal_article","month":"01","publist_id":"7371","day":"01","issue":"1","main_file_link":[{"open_access":"1","url":"https://idus.us.es/xmlui/handle/11441/38719"}],"author":[{"full_name":"Pawel Pilarczyk","first_name":"Pawel","id":"3768D56A-F248-11E8-B48F-1D18A9856A87","last_name":"Pilarczyk"},{"first_name":"Pedro","full_name":"Real, Pedro","last_name":"Real"}],"acknowledgement":"This research was partially supported from Fundo Europeu de Desenvolvimento Regional (FEDER) through COMPETE – Programa Operacional Factores de Compe titividade (POFC) and from the Portuguese national funds through Fundacaoparaa Ciencia e a Tecnologia (FCT) in the framework of the research project FCOMP-01-0124-FEDER-010645(ref. FCT PTDC/MAT/098871/2008), as well as from the funds distributed through the European Science Foundation (ESF) Research Networking Programme on “Applied and Computational Algebraic Topology” (ACAT). P.Real was additionally supported by the Spanish Ministry of Science and Innovation, project no. MTM2009-12716. ","date_updated":"2021-01-12T07:59:20Z","quality_controlled":0,"abstract":[{"lang":"eng","text":"We introduce algorithms for the computation of homology, cohomology, and related operations on cubical cell complexes, using the technique based on a chain contraction from the original chain complex to a reduced one that represents its homology. This work is based on previous results for simplicial complexes, and uses Serre’s diagonalization for cubical cells. An implementation in C++ of the introduced algorithms is available at http://www.pawelpilarczyk.com/chaincon/ together with some examples. The paper is self-contained as much as possible, and is written at a very elementary level, so that basic knowledge of algebraic topology should be sufficient to follow it."}],"page":"253 - 275"},{"file_date_updated":"2020-07-14T12:46:34Z","issue":"9","acknowledgement":"The study was funded by the University of Vienna (Focus of Excellence grant), the Galápagos Conservation Trust, and the Ethologische Gesellschaft e.V.","author":[{"last_name":"Cimadom","full_name":"Cimadom, Arno","first_name":"Arno"},{"first_name":"Angel","full_name":"Ulloa, Angel","last_name":"Ulloa"},{"first_name":"Patrick","full_name":"Meidl, Patrick","last_name":"Meidl","id":"4709BCE6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Markus","full_name":"Zöttl, Markus","last_name":"Zöttl"},{"full_name":"Zöttl, Elisabet","first_name":"Elisabet","last_name":"Zöttl"},{"full_name":"Fessl, Birgit","first_name":"Birgit","last_name":"Fessl"},{"last_name":"Nemeth","first_name":"Erwin","full_name":"Nemeth, Erwin"},{"first_name":"Michael","full_name":"Dvorak, Michael","last_name":"Dvorak"},{"first_name":"Francesca","full_name":"Cunninghame, Francesca","last_name":"Cunninghame"},{"last_name":"Tebbich","first_name":"Sabine","full_name":"Tebbich, Sabine"}],"date_updated":"2021-01-12T08:00:48Z","abstract":[{"text":"Invasive alien parasites and pathogens are a growing threat to biodiversity worldwide, which can contribute to the extinction of endemic species. On the Galápagos Islands, the invasive parasitic fly Philornis downsi poses a major threat to the endemic avifauna. Here, we investigated the influence of this parasite on the breeding success of two Darwin's finch species, the warbler finch (Certhidea olivacea) and the sympatric small tree finch (Camarhynchus parvulus), on Santa Cruz Island in 2010 and 2012. While the population of the small tree finch appeared to be stable, the warbler finch has experienced a dramatic decline in population size on Santa Cruz Island since 1997. We aimed to identify whether warbler finches are particularly vulnerable during different stages of the breeding cycle. Contrary to our prediction, breeding success was lower in the small tree finch than in the warbler finch. In both species P. downsi had a strong negative impact on breeding success and our data suggest that heavy rain events also lowered the fledging success. On the one hand parents might be less efficient in compensating their chicks' energy loss due to parasitism as they might be less efficient in foraging on days of heavy rain. On the other hand, intense rainfalls might lead to increased humidity and more rapid cooling of the nests. In the case of the warbler finch we found that the control of invasive plant species with herbicides had a significant additive negative impact on the breeding success. It is very likely that the availability of insects (i.e. food abundance) is lower in such controlled areas, as herbicide usage led to the removal of the entire understory. Predation seems to be a minor factor in brood loss.","lang":"eng"}],"article_number":"0107518","intvolume":" 9","type":"journal_article","ddc":["576"],"department":[{"_id":"CampIT"}],"publisher":"Public Library of Science","file":[{"file_size":489387,"file_id":"5103","creator":"system","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:46:34Z","checksum":"b24e7518ccd41effed0d7d9e2498f67f","content_type":"application/pdf","date_created":"2018-12-12T10:14:48Z","file_name":"IST-2018-954-v1+1_2014_Meidl_Invasive_parasites.PDF"}],"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"},"_id":"468","date_published":"2014-09-23T00:00:00Z","title":"Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin's finches","date_created":"2018-12-11T11:46:38Z","publication_status":"published","citation":{"ista":"Cimadom A, Ulloa A, Meidl P, Zöttl M, Zöttl E, Fessl B, Nemeth E, Dvorak M, Cunninghame F, Tebbich S. 2014. Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin’s finches. PLoS One. 9(9), 0107518.","apa":"Cimadom, A., Ulloa, A., Meidl, P., Zöttl, M., Zöttl, E., Fessl, B., … Tebbich, S. (2014). Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin’s finches. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0107518","ama":"Cimadom A, Ulloa A, Meidl P, et al. Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin’s finches. PLoS One. 2014;9(9). doi:10.1371/journal.pone.0107518","ieee":"A. Cimadom et al., “Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin’s finches,” PLoS One, vol. 9, no. 9. Public Library of Science, 2014.","short":"A. Cimadom, A. Ulloa, P. Meidl, M. Zöttl, E. Zöttl, B. Fessl, E. Nemeth, M. Dvorak, F. Cunninghame, S. Tebbich, PLoS One 9 (2014).","chicago":"Cimadom, Arno, Angel Ulloa, Patrick Meidl, Markus Zöttl, Elisabet Zöttl, Birgit Fessl, Erwin Nemeth, Michael Dvorak, Francesca Cunninghame, and Sabine Tebbich. “Invasive Parasites Habitat Change and Heavy Rainfall Reduce Breeding Success in Darwin’s Finches.” PLoS One. Public Library of Science, 2014. https://doi.org/10.1371/journal.pone.0107518.","mla":"Cimadom, Arno, et al. “Invasive Parasites Habitat Change and Heavy Rainfall Reduce Breeding Success in Darwin’s Finches.” PLoS One, vol. 9, no. 9, 0107518, Public Library of Science, 2014, doi:10.1371/journal.pone.0107518."},"scopus_import":1,"oa_version":"Published Version","has_accepted_license":"1","quality_controlled":"1","year":"2014","status":"public","language":[{"iso":"eng"}],"month":"09","publist_id":"7352","pubrep_id":"954","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"23","doi":"10.1371/journal.pone.0107518","publication":"PLoS One","volume":9,"oa":1},{"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"},"file":[{"date_created":"2018-12-12T10:17:08Z","file_name":"IST-2018-952-v1+1_2014_Rubin_First_cycle.pdf","content_type":"application/pdf","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:46:35Z","checksum":"4d7b4ab82980cca2b96ac7703992a8c8","creator":"system","file_size":100115,"file_id":"5260"}],"department":[{"_id":"KrCh"}],"publisher":"Open Publishing Association","date_created":"2018-12-11T11:46:41Z","publication_status":"published","citation":{"apa":"Aminof, B., & Rubin, S. (2014). First cycle games. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 146, pp. 83–90). Grenoble, France: Open Publishing Association. https://doi.org/10.4204/EPTCS.146.11","ama":"Aminof B, Rubin S. First cycle games. In: Electronic Proceedings in Theoretical Computer Science, EPTCS. Vol 146. Open Publishing Association; 2014:83-90. doi:10.4204/EPTCS.146.11","ieee":"B. Aminof and S. Rubin, “First cycle games,” in Electronic Proceedings in Theoretical Computer Science, EPTCS, Grenoble, France, 2014, vol. 146, pp. 83–90.","short":"B. Aminof, S. Rubin, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing Association, 2014, pp. 83–90.","chicago":"Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” In Electronic Proceedings in Theoretical Computer Science, EPTCS, 146:83–90. Open Publishing Association, 2014. https://doi.org/10.4204/EPTCS.146.11.","mla":"Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” Electronic Proceedings in Theoretical Computer Science, EPTCS, vol. 146, Open Publishing Association, 2014, pp. 83–90, doi:10.4204/EPTCS.146.11.","ista":"Aminof B, Rubin S. 2014. First cycle games. Electronic Proceedings in Theoretical Computer Science, EPTCS. SR: Strategic Reasoning, EPTCS, vol. 146, 83–90."},"title":"First cycle games","ec_funded":1,"date_published":"2014-04-01T00:00:00Z","_id":"475","abstract":[{"lang":"eng","text":"First cycle games (FCG) are played on a finite graph by two players who push a token along the edges until a vertex is repeated, and a simple cycle is formed. The winner is determined by some fixed property Y of the sequence of labels of the edges (or nodes) forming this cycle. These games are traditionally of interest because of their connection with infinite-duration games such as parity and mean-payoff games. We study the memory requirements for winning strategies of FCGs and certain associated infinite duration games. We exhibit a simple FCG that is not memoryless determined (this corrects a mistake in Memoryless determinacy of parity and mean payoff games: a simple proof by Bj⋯orklund, Sandberg, Vorobyov (2004) that claims that FCGs for which Y is closed under cyclic permutations are memoryless determined). We show that θ (n)! memory (where n is the number of nodes in the graph), which is always sufficient, may be necessary to win some FCGs. On the other hand, we identify easy to check conditions on Y (i.e., Y is closed under cyclic permutations, and both Y and its complement are closed under concatenation) that are sufficient to ensure that the corresponding FCGs and their associated infinite duration games are memoryless determined. We demonstrate that many games considered in the literature, such as mean-payoff, parity, energy, etc., satisfy these conditions. On the complexity side, we show (for efficiently computable Y) that while solving FCGs is in PSPACE, solving some families of FCGs is PSPACE-hard. "}],"page":"83 - 90","conference":{"end_date":"2014-04-06","start_date":"2014-04-05","name":"SR: Strategic Reasoning","location":"Grenoble, France"},"date_updated":"2021-01-12T08:00:53Z","author":[{"id":"4A55BD00-F248-11E8-B48F-1D18A9856A87","last_name":"Aminof","full_name":"Aminof, Benjamin","first_name":"Benjamin"},{"first_name":"Sasha","full_name":"Rubin, Sasha","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","last_name":"Rubin"}],"file_date_updated":"2020-07-14T12:46:35Z","ddc":["004"],"type":"conference","intvolume":" 146","publication":"Electronic Proceedings in Theoretical Computer Science, EPTCS","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","grant_number":"S11402-N23"},{"call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"}],"doi":"10.4204/EPTCS.146.11","volume":146,"oa":1,"quality_controlled":"1","has_accepted_license":"1","oa_version":"Published Version","scopus_import":1,"day":"01","alternative_title":["EPTCS"],"pubrep_id":"952","publist_id":"7345","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","month":"04","status":"public","year":"2014","language":[{"iso":"eng"}]},{"ec_funded":1,"title":"Polynomial-time algorithms for energy games with special weight structures","_id":"535","date_published":"2014-11-01T00:00:00Z","citation":{"ista":"Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. 2014. Polynomial-time algorithms for energy games with special weight structures. Algorithmica. 70(3), 457–492.","ama":"Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. Polynomial-time algorithms for energy games with special weight structures. Algorithmica. 2014;70(3):457-492. doi:10.1007/s00453-013-9843-7","ieee":"K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” Algorithmica, vol. 70, no. 3. Springer, pp. 457–492, 2014.","apa":"Chatterjee, K., Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2014). Polynomial-time algorithms for energy games with special weight structures. Algorithmica. Springer. https://doi.org/10.1007/s00453-013-9843-7","mla":"Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” Algorithmica, vol. 70, no. 3, Springer, 2014, pp. 457–92, doi:10.1007/s00453-013-9843-7.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” Algorithmica. Springer, 2014. https://doi.org/10.1007/s00453-013-9843-7.","short":"K. Chatterjee, M.H. Henzinger, S. Krinninger, D. Nanongkai, Algorithmica 70 (2014) 457–492."},"publication_status":"published","date_created":"2018-12-11T11:47:01Z","publisher":"Springer","department":[{"_id":"KrCh"}],"intvolume":" 70","type":"journal_article","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger"},{"first_name":"Sebastian","full_name":"Krinninger, Sebastian","last_name":"Krinninger"},{"full_name":"Nanongkai, Danupon","first_name":"Danupon","last_name":"Nanongkai"}],"main_file_link":[{"url":"https://arxiv.org/abs/1604.08234","open_access":"1"}],"issue":"3","page":"457 - 492","article_type":"original","abstract":[{"lang":"eng","text":"Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NP∩co-NP, but are not known to be in P. The existence of polynomial-time algorithms has been a major open problem for decades and apart from pseudopolynomial algorithms there is no algorithm that solves any non-trivial subclass in polynomial time. In this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and present a polynomial-time algorithm when the penalty is large. Our algorithm is the first polynomial-time algorithm on a large class of weighted graphs. It includes several worst-case instances on which previous algorithms, such as value iteration and random facet algorithms, require at least sub-exponential time. Our main technique is developing the first non-trivial approximation algorithm and showing how to convert it to an exact algorithm. Moreover, we show that in a practical case in verification where weights are clustered around a constant number of values, the energy game problem can be solved in polynomial time. We also show that the problem is still as hard as in general when the clique-width is bounded or the graph is strongly ergodic, suggesting that restricting the graph structure does not necessarily help."}],"date_updated":"2023-09-05T14:09:29Z","oa":1,"volume":70,"doi":"10.1007/s00453-013-9843-7","project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF","grant_number":"S11407"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"publication":"Algorithmica","arxiv":1,"month":"11","article_processing_charge":"No","status":"public","language":[{"iso":"eng"}],"year":"2014","day":"01","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","publist_id":"7282","oa_version":"Preprint","scopus_import":"1","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"10905"}]},"quality_controlled":"1","external_id":{"arxiv":["1604.08234"]}},{"doi":"10.1002/ece3.1150","publication":"Ecology and Evolution","volume":4,"oa":1,"scopus_import":1,"oa_version":"Published Version","has_accepted_license":"1","language":[{"iso":"eng"}],"year":"2014","status":"public","month":"07","publist_id":"7280","pubrep_id":"934","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"19","department":[{"_id":"NiBa"},{"_id":"GaTk"}],"publisher":"Wiley-Blackwell","file":[{"file_id":"4886","file_size":621582,"creator":"system","access_level":"open_access","relation":"main_file","checksum":"e32abf75a248e7a11811fd7f60858769","date_updated":"2020-07-14T12:46:38Z","content_type":"application/pdf","date_created":"2018-12-12T10:11:31Z","file_name":"IST-2018-934-v1+1_Prizak_et_al-2014-Ecology_and_Evolution.pdf"}],"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"},"_id":"537","date_published":"2014-07-19T00:00:00Z","title":"Fitness consequences of maternal and grandmaternal effects","date_created":"2018-12-11T11:47:02Z","publication_status":"published","citation":{"ista":"Prizak R, Ezard T, Hoyle R. 2014. Fitness consequences of maternal and grandmaternal effects. Ecology and Evolution. 4(15), 3139–3145.","short":"R. Prizak, T. Ezard, R. Hoyle, Ecology and Evolution 4 (2014) 3139–3145.","chicago":"Prizak, Roshan, Thomas Ezard, and Rebecca Hoyle. “Fitness Consequences of Maternal and Grandmaternal Effects.” Ecology and Evolution. Wiley-Blackwell, 2014. https://doi.org/10.1002/ece3.1150.","mla":"Prizak, Roshan, et al. “Fitness Consequences of Maternal and Grandmaternal Effects.” Ecology and Evolution, vol. 4, no. 15, Wiley-Blackwell, 2014, pp. 3139–45, doi:10.1002/ece3.1150.","apa":"Prizak, R., Ezard, T., & Hoyle, R. (2014). Fitness consequences of maternal and grandmaternal effects. Ecology and Evolution. Wiley-Blackwell. https://doi.org/10.1002/ece3.1150","ieee":"R. Prizak, T. Ezard, and R. Hoyle, “Fitness consequences of maternal and grandmaternal effects,” Ecology and Evolution, vol. 4, no. 15. Wiley-Blackwell, pp. 3139–3145, 2014.","ama":"Prizak R, Ezard T, Hoyle R. Fitness consequences of maternal and grandmaternal effects. Ecology and Evolution. 2014;4(15):3139-3145. doi:10.1002/ece3.1150"},"file_date_updated":"2020-07-14T12:46:38Z","issue":"15","author":[{"id":"4456104E-F248-11E8-B48F-1D18A9856A87","last_name":"Prizak","first_name":"Roshan","full_name":"Prizak, Roshan"},{"last_name":"Ezard","first_name":"Thomas","full_name":"Ezard, Thomas"},{"last_name":"Hoyle","full_name":"Hoyle, Rebecca","first_name":"Rebecca"}],"date_updated":"2021-01-12T08:01:30Z","page":"3139 - 3145","abstract":[{"text":"Transgenerational effects are broader than only parental relationships. Despite mounting evidence that multigenerational effects alter phenotypic and life-history traits, our understanding of how they combine to determine fitness is not well developed because of the added complexity necessary to study them. Here, we derive a quantitative genetic model of adaptation to an extraordinary new environment by an additive genetic component, phenotypic plasticity, maternal and grandmaternal effects. We show how, at equilibrium, negative maternal and negative grandmaternal effects maximize expected population mean fitness. We define negative transgenerational effects as those that have a negative effect on trait expression in the subsequent generation, that is, they slow, or potentially reverse, the expected evolutionary dynamic. When maternal effects are positive, negative grandmaternal effects are preferred. As expected under Mendelian inheritance, the grandmaternal effects have a lower impact on fitness than the maternal effects, but this dual inheritance model predicts a more complex relationship between maternal and grandmaternal effects to constrain phenotypic variance and so maximize expected population mean fitness in the offspring.","lang":"eng"}],"type":"journal_article","intvolume":" 4","ddc":["530","571"]},{"quality_controlled":"1","has_accepted_license":"1","oa_version":"Submitted Version","related_material":{"record":[{"status":"public","id":"838","relation":"dissertation_contains"}]},"day":"01","pubrep_id":"682","alternative_title":["LNCS"],"publist_id":"4955","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","month":"01","language":[{"iso":"eng"}],"year":"2014","status":"public","project":[{"name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","call_identifier":"FP7"}],"doi":"10.1007/978-3-662-44371-2_7","volume":8616,"oa":1,"page":"113 - 130","abstract":[{"text":"NMAC is a mode of operation which turns a fixed input-length keyed hash function f into a variable input-length function. A practical single-key variant of NMAC called HMAC is a very popular and widely deployed message authentication code (MAC). Security proofs and attacks for NMAC can typically be lifted to HMAC. NMAC was introduced by Bellare, Canetti and Krawczyk [Crypto'96], who proved it to be a secure pseudorandom function (PRF), and thus also a MAC, assuming that (1) f is a PRF and (2) the function we get when cascading f is weakly collision-resistant. Unfortunately, HMAC is typically instantiated with cryptographic hash functions like MD5 or SHA-1 for which (2) has been found to be wrong. To restore the provable guarantees for NMAC, Bellare [Crypto'06] showed its security based solely on the assumption that f is a PRF, albeit via a non-uniform reduction. - Our first contribution is a simpler and uniform proof for this fact: If f is an ε-secure PRF (against q queries) and a δ-non-adaptively secure PRF (against q queries), then NMAC f is an (ε+ℓqδ)-secure PRF against q queries of length at most ℓ blocks each. - We then show that this ε+ℓqδ bound is basically tight. For the most interesting case where ℓqδ ≥ ε we prove this by constructing an f for which an attack with advantage ℓqδ exists. This also violates the bound O(ℓε) on the PRF-security of NMAC recently claimed by Koblitz and Menezes. - Finally, we analyze the PRF-security of a modification of NMAC called NI [An and Bellare, Crypto'99] that differs mainly by using a compression function with an additional keying input. This avoids the constant rekeying on multi-block messages in NMAC and allows for a security proof starting by the standard switch from a PRF to a random function, followed by an information-theoretic analysis. We carry out such an analysis, obtaining a tight ℓq2/2 c bound for this step, improving over the trivial bound of ℓ2q2/2c. The proof borrows combinatorial techniques originally developed for proving the security of CBC-MAC [Bellare et al., Crypto'05].","lang":"eng"}],"conference":{"end_date":"2014-08-21","start_date":"2014-08-17","location":"Santa Barbara, USA","name":"CRYPTO: International Cryptology Conference"},"date_updated":"2023-09-07T12:02:27Z","author":[{"id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","last_name":"Gazi","first_name":"Peter","full_name":"Gazi, Peter"},{"orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"},{"last_name":"Rybar","id":"2B3E3DE8-F248-11E8-B48F-1D18A9856A87","first_name":"Michal","full_name":"Rybar, Michal"}],"file_date_updated":"2020-07-14T12:45:28Z","issue":"1","ddc":["000","004"],"editor":[{"last_name":"Garay","first_name":"Juan","full_name":"Garay, Juan"},{"last_name":"Gennaro","first_name":"Rosario","full_name":"Gennaro, Rosario"}],"type":"conference","intvolume":" 8616","file":[{"date_created":"2018-12-12T10:13:17Z","file_name":"IST-2016-682-v1+1_578.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:45:28Z","checksum":"dab6ab36a5f6af94f2b597e6404ed11d","file_size":492310,"file_id":"4999","creator":"system"}],"department":[{"_id":"KrPi"}],"publisher":"Springer","date_created":"2018-12-11T11:55:36Z","citation":{"mla":"Gazi, Peter, et al. The Exact PRF-Security of NMAC and HMAC. Edited by Juan Garay and Rosario Gennaro, vol. 8616, no. 1, Springer, 2014, pp. 113–30, doi:10.1007/978-3-662-44371-2_7.","chicago":"Gazi, Peter, Krzysztof Z Pietrzak, and Michal Rybar. “The Exact PRF-Security of NMAC and HMAC.” edited by Juan Garay and Rosario Gennaro, 8616:113–30. Springer, 2014. https://doi.org/10.1007/978-3-662-44371-2_7.","short":"P. Gazi, K.Z. Pietrzak, M. Rybar, in:, J. Garay, R. Gennaro (Eds.), Springer, 2014, pp. 113–130.","ieee":"P. Gazi, K. Z. Pietrzak, and M. Rybar, “The exact PRF-security of NMAC and HMAC,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, USA, 2014, vol. 8616, no. 1, pp. 113–130.","ama":"Gazi P, Pietrzak KZ, Rybar M. The exact PRF-security of NMAC and HMAC. In: Garay J, Gennaro R, eds. Vol 8616. Springer; 2014:113-130. doi:10.1007/978-3-662-44371-2_7","apa":"Gazi, P., Pietrzak, K. Z., & Rybar, M. (2014). The exact PRF-security of NMAC and HMAC. In J. Garay & R. Gennaro (Eds.) (Vol. 8616, pp. 113–130). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, USA: Springer. https://doi.org/10.1007/978-3-662-44371-2_7","ista":"Gazi P, Pietrzak KZ, Rybar M. 2014. The exact PRF-security of NMAC and HMAC. CRYPTO: International Cryptology Conference, LNCS, vol. 8616, 113–130."},"publication_status":"published","ec_funded":1,"title":"The exact PRF-security of NMAC and HMAC","date_published":"2014-01-01T00:00:00Z","_id":"2082"},{"ddc":["570"],"type":"journal_article","intvolume":" 68","abstract":[{"text":"Understanding the effects of sex and migration on adaptation to novel environments remains a key problem in evolutionary biology. Using a single-cell alga Chlamydomonas reinhardtii, we investigated how sex and migration affected rates of evolutionary rescue in a sink environment, and subsequent changes in fitness following evolutionary rescue. We show that sex and migration affect both the rate of evolutionary rescue and subsequent adaptation. However, their combined effects change as the populations adapt to a sink habitat. Both sex and migration independently increased rates of evolutionary rescue, but the effect of sex on subsequent fitness improvements, following initial rescue, changed with migration, as sex was beneficial in the absence of migration but constraining adaptation when combined with migration. These results suggest that sex and migration are beneficial during the initial stages of adaptation, but can become detrimental as the population adapts to its environment.","lang":"eng"}],"article_type":"original","page":"2296 - 2305","date_updated":"2023-02-23T14:06:51Z","acknowledgement":"The authors are grateful to the Leverhulme Trust (F/00 215/AW) for funding this work.","author":[{"id":"345D25EC-F248-11E8-B48F-1D18A9856A87","last_name":"Lagator","first_name":"Mato","full_name":"Lagator, Mato"},{"last_name":"Morgan","first_name":"Andrew","full_name":"Morgan, Andrew"},{"full_name":"Neve, Paul","first_name":"Paul","last_name":"Neve"},{"first_name":"Nick","full_name":"Colegrave, Nick","last_name":"Colegrave"}],"file_date_updated":"2020-07-14T12:45:28Z","issue":"8","date_created":"2018-12-11T11:55:36Z","citation":{"short":"M. Lagator, A. Morgan, P. Neve, N. Colegrave, Evolution 68 (2014) 2296–2305.","mla":"Lagator, Mato, et al. “Role of Sex and Migration in Adaptation to Sink Environments.” Evolution, vol. 68, no. 8, Wiley, 2014, pp. 2296–305, doi:10.1111/evo.12440.","chicago":"Lagator, Mato, Andrew Morgan, Paul Neve, and Nick Colegrave. “Role of Sex and Migration in Adaptation to Sink Environments.” Evolution. Wiley, 2014. https://doi.org/10.1111/evo.12440.","apa":"Lagator, M., Morgan, A., Neve, P., & Colegrave, N. (2014). Role of sex and migration in adaptation to sink environments. Evolution. Wiley. https://doi.org/10.1111/evo.12440","ieee":"M. Lagator, A. Morgan, P. Neve, and N. Colegrave, “Role of sex and migration in adaptation to sink environments,” Evolution, vol. 68, no. 8. Wiley, pp. 2296–2305, 2014.","ama":"Lagator M, Morgan A, Neve P, Colegrave N. Role of sex and migration in adaptation to sink environments. Evolution. 2014;68(8):2296-2305. doi:10.1111/evo.12440","ista":"Lagator M, Morgan A, Neve P, Colegrave N. 2014. Role of sex and migration in adaptation to sink environments. Evolution. 68(8), 2296–2305."},"publication_status":"published","title":"Role of sex and migration in adaptation to sink environments","date_published":"2014-04-25T00:00:00Z","_id":"2083","file":[{"file_size":467254,"file_id":"7845","creator":"dernst","checksum":"8d459b07e4a11bb5fde92d969184fe48","date_updated":"2020-07-14T12:45:28Z","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_name":"2014_Evolution_Lagator.pdf","date_created":"2020-05-14T16:40:31Z"}],"department":[{"_id":"CaGu"}],"publisher":"Wiley","day":"25","publist_id":"4954","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"04","status":"public","year":"2014","language":[{"iso":"eng"}],"article_processing_charge":"No","quality_controlled":"1","has_accepted_license":"1","oa_version":"Published Version","scopus_import":1,"related_material":{"record":[{"status":"public","id":"9747","relation":"research_data"}]},"volume":68,"oa":1,"publication":"Evolution","doi":"10.1111/evo.12440"},{"date_updated":"2023-09-07T12:49:09Z","abstract":[{"text":"Receptor tyrosine kinases (RTKs) are a large family of cell surface receptors that sense growth factors and hormones and regulate a variety of cell behaviours in health and disease. Contactless activation of RTKs with spatial and temporal precision is currently not feasible. Here, we generated RTKs that are insensitive to endogenous ligands but can be selectively activated by low-intensity blue light. We screened light-oxygen-voltage (LOV)-sensing domains for their ability to activate RTKs by light-activated dimerization. Incorporation of LOV domains found in aureochrome photoreceptors of stramenopiles resulted in robust activation of the fibroblast growth factor receptor 1 (FGFR1), epidermal growth factor receptor (EGFR) and rearranged during transfection (RET). In human cancer and endothelial cells, light induced cellular signalling with spatial and temporal precision. Furthermore, light faithfully mimicked complex mitogenic and morphogenic cell behaviour induced by growth factors. RTKs under optical control (Opto-RTKs) provide a powerful optogenetic approach to actuate cellular signals and manipulate cell behaviour.","lang":"eng"}],"page":"1713 - 1726","issue":"15","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4194103/","open_access":"1"}],"acknowledgement":"European Union Seventh Framework Programme; Human Frontier Science Program; Oesterreichische Nationalbank Anniversary Fund 14211; Austrian Research Promotion Agency; FemTech","author":[{"last_name":"Grusch","first_name":"Michael","full_name":"Grusch, Michael"},{"last_name":"Schelch","first_name":"Karin","full_name":"Schelch, Karin"},{"first_name":"Robert","full_name":"Riedler, Robert","last_name":"Riedler"},{"orcid":"0000-0002-7218-7738","first_name":"Eva","full_name":"Gschaider-Reichhart, Eva","last_name":"Gschaider-Reichhart","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Differ","full_name":"Differ, Christopher","first_name":"Christopher"},{"full_name":"Berger, Walter","first_name":"Walter","last_name":"Berger"},{"last_name":"Inglés Prieto","id":"2A9DB292-F248-11E8-B48F-1D18A9856A87","full_name":"Inglés Prieto, Álvaro","first_name":"Álvaro","orcid":"0000-0002-5409-8571"},{"id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","last_name":"Janovjak","full_name":"Janovjak, Harald L","first_name":"Harald L","orcid":"0000-0002-8023-9315"}],"type":"journal_article","intvolume":" 33","publisher":"Wiley-Blackwell","department":[{"_id":"HaJa"}],"publication_status":"published","citation":{"mla":"Grusch, Michael, et al. “Spatio-Temporally Precise Activation of Engineered Receptor Tyrosine Kinases by Light.” EMBO Journal, vol. 33, no. 15, Wiley-Blackwell, 2014, pp. 1713–26, doi:10.15252/embj.201387695.","chicago":"Grusch, Michael, Karin Schelch, Robert Riedler, Eva Gschaider-Reichhart, Christopher Differ, Walter Berger, Álvaro Inglés Prieto, and Harald L Janovjak. “Spatio-Temporally Precise Activation of Engineered Receptor Tyrosine Kinases by Light.” EMBO Journal. Wiley-Blackwell, 2014. https://doi.org/10.15252/embj.201387695.","short":"M. Grusch, K. Schelch, R. Riedler, E. Gschaider-Reichhart, C. Differ, W. Berger, Á. Inglés Prieto, H.L. Janovjak, EMBO Journal 33 (2014) 1713–1726.","ieee":"M. Grusch et al., “Spatio-temporally precise activation of engineered receptor tyrosine kinases by light,” EMBO Journal, vol. 33, no. 15. Wiley-Blackwell, pp. 1713–1726, 2014.","ama":"Grusch M, Schelch K, Riedler R, et al. Spatio-temporally precise activation of engineered receptor tyrosine kinases by light. EMBO Journal. 2014;33(15):1713-1726. doi:10.15252/embj.201387695","apa":"Grusch, M., Schelch, K., Riedler, R., Gschaider-Reichhart, E., Differ, C., Berger, W., … Janovjak, H. L. (2014). Spatio-temporally precise activation of engineered receptor tyrosine kinases by light. EMBO Journal. Wiley-Blackwell. https://doi.org/10.15252/embj.201387695","ista":"Grusch M, Schelch K, Riedler R, Gschaider-Reichhart E, Differ C, Berger W, Inglés Prieto Á, Janovjak HL. 2014. Spatio-temporally precise activation of engineered receptor tyrosine kinases by light. EMBO Journal. 33(15), 1713–1726."},"date_created":"2018-12-11T11:55:37Z","_id":"2084","date_published":"2014-07-01T00:00:00Z","title":"Spatio-temporally precise activation of engineered receptor tyrosine kinases by light","quality_controlled":"1","related_material":{"record":[{"id":"418","status":"public","relation":"dissertation_contains"}]},"scopus_import":1,"oa_version":"Submitted Version","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"4953","day":"01","year":"2014","status":"public","language":[{"iso":"eng"}],"month":"07","publication":"EMBO Journal","doi":"10.15252/embj.201387695","oa":1,"volume":33},{"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"4949","pubrep_id":"437","day":"06","year":"2014","status":"public","language":[{"iso":"eng"}],"month":"08","has_accepted_license":"1","quality_controlled":"1","related_material":{"record":[{"relation":"research_data","status":"public","id":"9888"}]},"scopus_import":1,"oa_version":"Published Version","oa":1,"volume":9,"publication":"PLoS One","doi":"10.1371/journal.pone.0103989","ddc":["570"],"type":"journal_article","intvolume":" 9","date_updated":"2023-02-23T14:11:56Z","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"}],"article_number":"e103989","issue":"8","file_date_updated":"2020-07-14T12:45:28Z","author":[{"last_name":"Wolf","full_name":"Wolf, Stephan","first_name":"Stephan"},{"last_name":"Mcmahon","full_name":"Mcmahon, Dino","first_name":"Dino"},{"last_name":"Lim","first_name":"Ka","full_name":"Lim, Ka"},{"last_name":"Pull","id":"3C7F4840-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher","full_name":"Pull, Christopher","orcid":"0000-0003-1122-3982"},{"full_name":"Clark, Suzanne","first_name":"Suzanne","last_name":"Clark"},{"full_name":"Paxton, Robert","first_name":"Robert","last_name":"Paxton"},{"first_name":"Juliet","full_name":"Osborne, Juliet","last_name":"Osborne"}],"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).","publication_status":"published","citation":{"mla":"Wolf, Stephan, et al. “So near and yet so Far: Harmonic Radar Reveals Reduced Homing Ability of Nosema Infected Honeybees.” PLoS One, vol. 9, no. 8, e103989, Public Library of Science, 2014, doi:10.1371/journal.pone.0103989.","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.” PLoS One. Public Library of Science, 2014. https://doi.org/10.1371/journal.pone.0103989.","short":"S. Wolf, D. Mcmahon, K. Lim, C. Pull, S. Clark, R. Paxton, J. Osborne, PLoS One 9 (2014).","ieee":"S. Wolf et al., “So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees,” PLoS One, vol. 9, no. 8. Public Library of Science, 2014.","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. PLoS One. 2014;9(8). doi:10.1371/journal.pone.0103989","apa":"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. Public Library of Science. https://doi.org/10.1371/journal.pone.0103989","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."},"date_created":"2018-12-11T11:55:37Z","date_published":"2014-08-06T00:00:00Z","_id":"2086","title":"So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees","file":[{"date_updated":"2020-07-14T12:45:28Z","checksum":"2fc62c6739eada4bddf026afbae669db","relation":"main_file","access_level":"open_access","creator":"system","file_id":"5042","file_size":1013386,"file_name":"IST-2016-437-v1+1_journal.pone.0103989.pdf","date_created":"2018-12-12T10:13:55Z","content_type":"application/pdf"}],"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"},"publisher":"Public Library of Science","department":[{"_id":"SyCr"}]},{"publist_id":"4902","day":"01","type":"journal_article","intvolume":" 67","status":"public","year":"2014","month":"05","date_updated":"2021-01-12T06:55:30Z","abstract":[{"lang":"eng","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."}],"page":"776 - 870","quality_controlled":0,"issue":"5","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1202.3094 "}],"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","author":[{"last_name":"Hairer","full_name":"Hairer, Martin M","first_name":"Martin"},{"last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","first_name":"Jan","full_name":"Jan Maas"},{"last_name":"Weber","full_name":"Weber, Hendrik","first_name":"Hendrik"}],"publication_status":"published","citation":{"ista":"Hairer M, Maas J, Weber H. 2014. Approximating Rough Stochastic PDEs. Communications on Pure and Applied Mathematics. 67(5), 776–870.","ama":"Hairer M, Maas J, Weber H. Approximating Rough Stochastic PDEs. Communications on Pure and Applied Mathematics. 2014;67(5):776-870. doi:10.1002/cpa.21495","ieee":"M. Hairer, J. Maas, and H. Weber, “Approximating Rough Stochastic PDEs,” Communications on Pure and Applied Mathematics, vol. 67, no. 5. Wiley-Blackwell, pp. 776–870, 2014.","apa":"Hairer, M., Maas, J., & Weber, H. (2014). Approximating Rough Stochastic PDEs. Communications on Pure and Applied Mathematics. Wiley-Blackwell. https://doi.org/10.1002/cpa.21495","mla":"Hairer, Martin, et al. “Approximating Rough Stochastic PDEs.” Communications on Pure and Applied Mathematics, vol. 67, no. 5, Wiley-Blackwell, 2014, pp. 776–870, doi:10.1002/cpa.21495.","chicago":"Hairer, Martin, Jan Maas, and Hendrik Weber. “Approximating Rough Stochastic PDEs.” Communications on Pure and Applied Mathematics. Wiley-Blackwell, 2014. https://doi.org/10.1002/cpa.21495.","short":"M. Hairer, J. Maas, H. Weber, Communications on Pure and Applied Mathematics 67 (2014) 776–870."},"date_created":"2018-12-11T11:55:53Z","_id":"2131","extern":1,"date_published":"2014-05-01T00:00:00Z","oa":1,"title":"Approximating Rough Stochastic PDEs","volume":67,"publication":"Communications on Pure and Applied Mathematics","doi":"10.1002/cpa.21495","publisher":"Wiley-Blackwell"},{"publication_status":"published","citation":{"short":"M. Erbar, J. Maas, Discrete and Continuous Dynamical Systems- Series A 34 (2014) 1355–1374.","mla":"Erbar, Matthias, and Jan Maas. “Gradient Flow Structures for Discrete Porous Medium Equations.” Discrete and Continuous Dynamical Systems- Series A, vol. 34, no. 4, Southwest Missouri State University, 2014, pp. 1355–74, doi:10.3934/dcds.2014.34.1355 .","chicago":"Erbar, Matthias, and Jan Maas. “Gradient Flow Structures for Discrete Porous Medium Equations.” Discrete and Continuous Dynamical Systems- Series A. Southwest Missouri State University, 2014. https://doi.org/10.3934/dcds.2014.34.1355 .","apa":"Erbar, M., & Maas, J. (2014). Gradient flow structures for discrete porous medium equations. Discrete and Continuous Dynamical Systems- Series A. Southwest Missouri State University. https://doi.org/10.3934/dcds.2014.34.1355 ","ieee":"M. Erbar and J. Maas, “Gradient flow structures for discrete porous medium equations,” Discrete and Continuous Dynamical Systems- Series A, vol. 34, no. 4. Southwest Missouri State University, pp. 1355–1374, 2014.","ama":"Erbar M, Maas J. Gradient flow structures for discrete porous medium equations. Discrete and Continuous Dynamical Systems- Series A. 2014;34(4):1355-1374. doi:10.3934/dcds.2014.34.1355 ","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."},"date_created":"2018-12-11T11:55:54Z","oa":1,"title":"Gradient flow structures for discrete porous medium equations","volume":34,"date_published":"2014-04-01T00:00:00Z","_id":"2132","extern":1,"publication":"Discrete and Continuous Dynamical Systems- Series A","doi":"10.3934/dcds.2014.34.1355 ","publisher":"Southwest Missouri State University","day":"01","publist_id":"4903","month":"04","year":"2014","status":"public","type":"journal_article","intvolume":" 34","quality_controlled":0,"abstract":[{"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.","lang":"eng"}],"page":"1355 - 1374","date_updated":"2021-01-12T06:55:30Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1212.1129"}],"author":[{"last_name":"Erbar","first_name":"Matthias","full_name":"Erbar, Matthias"},{"orcid":"0000-0002-0845-1338","first_name":"Jan","full_name":"Jan Maas","last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87"}],"issue":"4"},{"publication":"Communications in Mathematical Physics","publisher":"Springer","doi":"10.1007/s00220-014-2124-8","publication_status":"published","citation":{"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.","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.” Communications in Mathematical Physics, vol. 331, no. 3, Springer, 2014, pp. 887–926, doi:10.1007/s00220-014-2124-8.","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.” Communications in Mathematical Physics. Springer, 2014. https://doi.org/10.1007/s00220-014-2124-8.","short":"E. Carlen, J. Maas, Communications in Mathematical Physics 331 (2014) 887–926.","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,” Communications in Mathematical Physics, vol. 331, no. 3. Springer, pp. 887–926, 2014.","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. Communications in Mathematical Physics. 2014;331(3):887-926. doi:10.1007/s00220-014-2124-8","apa":"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. Springer. https://doi.org/10.1007/s00220-014-2124-8"},"date_created":"2018-12-11T11:55:54Z","oa":1,"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","volume":331,"extern":"1","_id":"2133","date_published":"2014-11-01T00:00:00Z","page":"887 - 926","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"}],"quality_controlled":"1","date_updated":"2021-01-12T06:55:30Z","author":[{"full_name":"Carlen, Eric","first_name":"Eric","last_name":"Carlen"},{"orcid":"0000-0002-0845-1338","first_name":"Jan","full_name":"Maas, Jan","last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1203.5377 "}],"oa_version":"Submitted Version","issue":"3","day":"01","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"4901","month":"11","status":"public","type":"journal_article","language":[{"iso":"eng"}],"intvolume":" 331","year":"2014"},{"abstract":[{"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.","lang":"eng"}],"article_number":"070401","date_updated":"2021-01-12T06:55:33Z","oa_version":"Submitted Version","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.","main_file_link":[{"url":"http://arxiv.org/abs/1308.5905","open_access":"1"}],"author":[{"last_name":"Otterbach","first_name":"Johannes","full_name":"Otterbach, Johannes"},{"last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","first_name":"Mikhail"}],"issue":"7","day":"11","publist_id":"4884","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","month":"08","status":"public","type":"journal_article","language":[{"iso":"eng"}],"intvolume":" 113","year":"2014","publication":"Physical Review Letters","publisher":"American Physical Society","doi":"10.1103/PhysRevLett.113.070401","date_created":"2018-12-11T11:55:56Z","citation":{"ista":"Otterbach J, Lemeshko M. 2014. Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates. Physical Review Letters. 113(7), 070401.","mla":"Otterbach, Johannes, and Mikhail Lemeshko. “Dissipative Preparation of Spatial Order in Rydberg-Dressed Bose-Einstein Condensates.” Physical Review Letters, vol. 113, no. 7, 070401, American Physical Society, 2014, doi:10.1103/PhysRevLett.113.070401.","chicago":"Otterbach, Johannes, and Mikhail Lemeshko. “Dissipative Preparation of Spatial Order in Rydberg-Dressed Bose-Einstein Condensates.” Physical Review Letters. American Physical Society, 2014. https://doi.org/10.1103/PhysRevLett.113.070401.","short":"J. Otterbach, M. Lemeshko, Physical Review Letters 113 (2014).","ieee":"J. Otterbach and M. Lemeshko, “Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates,” Physical Review Letters, vol. 113, no. 7. American Physical Society, 2014.","ama":"Otterbach J, Lemeshko M. Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates. Physical Review Letters. 2014;113(7). doi:10.1103/PhysRevLett.113.070401","apa":"Otterbach, J., & Lemeshko, M. (2014). Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.113.070401"},"publication_status":"published","title":"Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates","volume":113,"oa":1,"date_published":"2014-08-11T00:00:00Z","_id":"2140","extern":"1"},{"language":[{"iso":"eng"}],"status":"public","year":"2014","article_processing_charge":"No","month":"05","publist_id":"4883","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","day":"01","scopus_import":"1","related_material":{"record":[{"relation":"earlier_version","id":"3165","status":"public"}]},"oa_version":"Submitted Version","quality_controlled":"1","volume":61,"oa":1,"project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"doi":"10.1145/2597631","publication":"Journal of the ACM","intvolume":" 61","type":"journal_article","issue":"3","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"}],"main_file_link":[{"url":"https://eprints.cs.univie.ac.at/3933/","open_access":"1"}],"date_updated":"2025-06-02T08:53:48Z","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>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 &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"}],"article_number":"a15","_id":"2141","date_published":"2014-05-01T00:00:00Z","ec_funded":1,"title":"Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition","date_created":"2018-12-11T11:55:57Z","citation":{"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. Journal of the ACM. 2014;61(3). doi:10.1145/2597631","ieee":"K. Chatterjee and M. H. Henzinger, “Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition,” Journal of the ACM, vol. 61, no. 3. ACM, 2014.","apa":"Chatterjee, K., & Henzinger, M. H. (2014). Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. ACM. https://doi.org/10.1145/2597631","mla":"Chatterjee, Krishnendu, and Monika H. Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.” Journal of the ACM, vol. 61, no. 3, a15, ACM, 2014, doi:10.1145/2597631.","chicago":"Chatterjee, Krishnendu, and Monika H Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.” Journal of the ACM. ACM, 2014. https://doi.org/10.1145/2597631.","short":"K. Chatterjee, M.H. Henzinger, Journal of the ACM 61 (2014)."},"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"ACM"},{"month":"06","year":"2014","language":[{"iso":"eng"}],"status":"public","type":"conference","day":"01","publist_id":"4853","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","last_name":"Bauer","full_name":"Bauer, Ulrich","first_name":"Ulrich","orcid":"0000-0002-9683-0724"},{"last_name":"Lesnick","first_name":"Michael","full_name":"Lesnick, Michael"}],"oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1311.3681"}],"scopus_import":1,"abstract":[{"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).","lang":"eng"}],"quality_controlled":"1","page":"355 - 364","conference":{"start_date":"2014-06-08","end_date":"2014-06-11","name":"SoCG: Symposium on Computational Geometry","location":"Kyoto, Japan"},"date_updated":"2021-01-12T06:55:38Z","ec_funded":1,"title":"Induced matchings of barcodes and the algebraic stability of persistence","oa":1,"_id":"2153","date_published":"2014-06-01T00:00:00Z","date_created":"2018-12-11T11:56:01Z","citation":{"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.","apa":"Bauer, U., & Lesnick, M. (2014). Induced matchings of barcodes and the algebraic stability of persistence. In Proceedings of the Annual Symposium on Computational Geometry (pp. 355–364). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582168","ieee":"U. Bauer and M. Lesnick, “Induced matchings of barcodes and the algebraic stability of persistence,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 355–364.","ama":"Bauer U, Lesnick M. Induced matchings of barcodes and the algebraic stability of persistence. In: Proceedings of the Annual Symposium on Computational Geometry. ACM; 2014:355-364. doi:10.1145/2582112.2582168","short":"U. Bauer, M. Lesnick, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 355–364.","chicago":"Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the Algebraic Stability of Persistence.” In Proceedings of the Annual Symposium on Computational Geometry, 355–64. ACM, 2014. https://doi.org/10.1145/2582112.2582168.","mla":"Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the Algebraic Stability of Persistence.” Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 355–64, doi:10.1145/2582112.2582168."},"publication_status":"published","project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","name":"Topological Complex Systems","call_identifier":"FP7","grant_number":"318493"}],"department":[{"_id":"HeEd"}],"publisher":"ACM","doi":"10.1145/2582112.2582168","publication":"Proceedings of the Annual Symposium on Computational Geometry"},{"title":"On Gromov's method of selecting heavily covered points","_id":"2154","date_published":"2014-07-01T00:00:00Z","citation":{"ista":"Matoušek J, Wagner U. 2014. On Gromov’s method of selecting heavily covered points. Discrete & Computational Geometry. 52(1), 1–33.","apa":"Matoušek, J., & Wagner, U. (2014). On Gromov’s method of selecting heavily covered points. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-014-9584-7","ieee":"J. Matoušek and U. Wagner, “On Gromov’s method of selecting heavily covered points,” Discrete & Computational Geometry, vol. 52, no. 1. Springer, pp. 1–33, 2014.","ama":"Matoušek J, Wagner U. On Gromov’s method of selecting heavily covered points. Discrete & Computational Geometry. 2014;52(1):1-33. doi:10.1007/s00454-014-9584-7","short":"J. Matoušek, U. Wagner, Discrete & Computational Geometry 52 (2014) 1–33.","mla":"Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily Covered Points.” Discrete & Computational Geometry, vol. 52, no. 1, Springer, 2014, pp. 1–33, doi:10.1007/s00454-014-9584-7.","chicago":"Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily Covered Points.” Discrete & Computational Geometry. Springer, 2014. https://doi.org/10.1007/s00454-014-9584-7."},"publication_status":"published","date_created":"2018-12-11T11:56:01Z","publisher":"Springer","department":[{"_id":"UlWa"}],"intvolume":" 52","type":"journal_article","author":[{"last_name":"Matoušek","full_name":"Matoušek, Jiří","first_name":"Jiří"},{"first_name":"Uli","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner"}],"main_file_link":[{"url":"http://arxiv.org/abs/1102.3515","open_access":"1"}],"acknowledgement":"Swiss National Science Foundation (SNF 200021-125309, 200020-138230, 200020-12507)","issue":"1","page":"1 - 33","abstract":[{"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 > 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.","lang":"eng"}],"date_updated":"2021-01-12T06:55:38Z","oa":1,"volume":52,"doi":"10.1007/s00454-014-9584-7","project":[{"_id":"25FA3206-B435-11E9-9278-68D0E5697425","name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics","grant_number":"PP00P2_138948"}],"publication":"Discrete & Computational Geometry","month":"07","language":[{"iso":"eng"}],"year":"2014","status":"public","day":"01","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"4852","oa_version":"Submitted Version","scopus_import":1,"quality_controlled":"1"},{"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","author":[{"last_name":"Bauer","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","first_name":"Ulrich","full_name":"Bauer, Ulrich","orcid":"0000-0002-9683-0724"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","orcid":"0000-0002-9823-6833"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1312.1231"}],"date_updated":"2021-01-12T06:55:38Z","conference":{"name":"SoCG: Symposium on Computational Geometry","location":"Kyoto, Japan","end_date":"2014-06-11","start_date":"2014-06-08"},"page":"484 - 490","abstract":[{"lang":"eng","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)."}],"type":"conference","publisher":"ACM","department":[{"_id":"HeEd"}],"_id":"2155","date_published":"2014-06-01T00:00:00Z","title":"The morse theory of Čech and Delaunay filtrations","ec_funded":1,"publication_status":"published","citation":{"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.","ieee":"U. Bauer and H. Edelsbrunner, “The morse theory of Čech and Delaunay filtrations,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 484–490.","ama":"Bauer U, Edelsbrunner H. The morse theory of Čech and Delaunay filtrations. In: Proceedings of the Annual Symposium on Computational Geometry. ACM; 2014:484-490. doi:10.1145/2582112.2582167","apa":"Bauer, U., & Edelsbrunner, H. (2014). The morse theory of Čech and Delaunay filtrations. In Proceedings of the Annual Symposium on Computational Geometry (pp. 484–490). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582167","mla":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Filtrations.” Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 484–90, doi:10.1145/2582112.2582167.","chicago":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Filtrations.” In Proceedings of the Annual Symposium on Computational Geometry, 484–90. ACM, 2014. https://doi.org/10.1145/2582112.2582167.","short":"U. Bauer, H. Edelsbrunner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 484–490."},"date_created":"2018-12-11T11:56:01Z","scopus_import":1,"oa_version":"Submitted Version","quality_controlled":"1","year":"2014","status":"public","language":[{"iso":"eng"}],"month":"06","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"4851","day":"01","doi":"10.1145/2582112.2582167","project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","name":"Topological Complex Systems","call_identifier":"FP7","grant_number":"318493"}],"publication":"Proceedings of the Annual Symposium on Computational Geometry","oa":1},{"project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","name":"Topological Complex Systems","call_identifier":"FP7","grant_number":"318493"}],"doi":"10.1145/2582112.2582169","publication":"Proceedings of the Annual Symposium on Computational Geometry","oa":1,"oa_version":"Submitted Version","scopus_import":1,"quality_controlled":"1","month":"06","year":"2014","status":"public","language":[{"iso":"eng"}],"day":"01","publist_id":"4850","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"HeEd"}],"publisher":"ACM","title":"Measuring distance between Reeb graphs","ec_funded":1,"_id":"2156","date_published":"2014-06-01T00:00:00Z","date_created":"2018-12-11T11:56:02Z","citation":{"chicago":"Bauer, Ulrich, Xiaoyin Ge, and Yusu Wang. “Measuring Distance between Reeb Graphs.” In Proceedings of the Annual Symposium on Computational Geometry, 464–73. ACM, 2014. https://doi.org/10.1145/2582112.2582169.","mla":"Bauer, Ulrich, et al. “Measuring Distance between Reeb Graphs.” Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 464–73, doi:10.1145/2582112.2582169.","short":"U. Bauer, X. Ge, Y. Wang, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 464–473.","ama":"Bauer U, Ge X, Wang Y. Measuring distance between Reeb graphs. In: Proceedings of the Annual Symposium on Computational Geometry. ACM; 2014:464-473. doi:10.1145/2582112.2582169","ieee":"U. Bauer, X. Ge, and Y. Wang, “Measuring distance between Reeb graphs,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 464–473.","apa":"Bauer, U., Ge, X., & Wang, Y. (2014). Measuring distance between Reeb graphs. In Proceedings of the Annual Symposium on Computational Geometry (pp. 464–473). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582169","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."},"publication_status":"published","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1307.2839"}],"acknowledgement":"National Science Foundation under grants CCF-1319406, CCF-1116258.","author":[{"id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","last_name":"Bauer","orcid":"0000-0002-9683-0724","full_name":"Bauer, Ulrich","first_name":"Ulrich"},{"full_name":"Ge, Xiaoyin","first_name":"Xiaoyin","last_name":"Ge"},{"last_name":"Wang","first_name":"Yusu","full_name":"Wang, Yusu"}],"page":"464 - 473","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)."}],"conference":{"name":"SoCG: Symposium on Computational Geometry","location":"Kyoto, Japan","end_date":"2014-06-11","start_date":"2014-06-08"},"date_updated":"2021-01-12T06:55:39Z","type":"conference"}]