[{"doi":"10.1103/Physics.10.32","language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","month":"03","author":[{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X","first_name":"Johannes M","last_name":"Fink","full_name":"Fink, Johannes M"}],"date_updated":"2022-06-07T10:58:31Z","date_created":"2018-12-11T11:49:41Z","volume":10,"year":"2017","publication_status":"published","publisher":"American Physical Society","department":[{"_id":"JoFi"}],"file_date_updated":"2019-10-24T11:38:14Z","publist_id":"6382","date_published":"2017-03-27T00:00:00Z","publication":"Physics","citation":{"ista":"Fink JM. 2017. Viewpoint: Microwave quantum states beat the heat. Physics. 10(32).","apa":"Fink, J. M. (2017). Viewpoint: Microwave quantum states beat the heat. Physics. American Physical Society. https://doi.org/10.1103/Physics.10.32","ieee":"J. M. Fink, “Viewpoint: Microwave quantum states beat the heat,” Physics, vol. 10, no. 32. American Physical Society, 2017.","ama":"Fink JM. Viewpoint: Microwave quantum states beat the heat. Physics. 2017;10(32). doi:10.1103/Physics.10.32","chicago":"Fink, Johannes M. “Viewpoint: Microwave Quantum States Beat the Heat.” Physics. American Physical Society, 2017. https://doi.org/10.1103/Physics.10.32.","mla":"Fink, Johannes M. “Viewpoint: Microwave Quantum States Beat the Heat.” Physics, vol. 10, no. 32, American Physical Society, 2017, doi:10.1103/Physics.10.32.","short":"J.M. Fink, Physics 10 (2017)."},"article_type":"review","day":"27","has_accepted_license":"1","article_processing_charge":"No","file":[{"file_size":193622,"content_type":"application/pdf","creator":"dernst","file_name":"2017_Physics_Fink.pdf","access_level":"open_access","date_updated":"2019-10-24T11:38:14Z","date_created":"2019-10-24T11:38:14Z","success":1,"relation":"main_file","file_id":"6968"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1013","status":"public","ddc":["530"],"title":"Viewpoint: Microwave quantum states beat the heat","intvolume":" 10","abstract":[{"text":"From microwave ovens to satellite television to the GPS and data services on our mobile phones, microwave technology is everywhere today. But one technology that has so far failed to prove its worth in this wavelength regime is quantum communication that uses the states of single photons as information carriers. This is because single microwave photons, as opposed to classical microwave signals, are extremely vulnerable to noise from thermal excitations in the channels through which they travel. Two new independent studies, one by Ze-Liang Xiang at Technische Universität Wien (Vienna), Austria, and colleagues [1] and another by Benoît Vermersch at the University of Innsbruck, also in Austria, and colleagues [2] now describe a theoretical protocol for microwave quantum communication that is resilient to thermal and other types of noise. Their approach could become a powerful technique to establish fast links between superconducting data processors in a future all-microwave quantum network.","lang":"eng"}],"issue":"32","type":"journal_article"},{"volume":2,"date_updated":"2021-12-07T08:04:14Z","date_created":"2021-12-05T23:01:49Z","author":[{"full_name":"Mciver, Annabelle","first_name":"Annabelle","last_name":"Mciver"},{"full_name":"Morgan, Carroll","last_name":"Morgan","first_name":"Carroll"},{"last_name":"Kaminski","first_name":"Benjamin Lucien","full_name":"Kaminski, Benjamin Lucien"},{"first_name":"Joost P","last_name":"Katoen","id":"4524F760-F248-11E8-B48F-1D18A9856A87","full_name":"Katoen, Joost P"}],"publisher":"Association for Computing Machinery","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","acknowledgement":"McIver and Morgan are grateful to David Basin and the Information Security Group at ETH Zürich for hosting a six-month stay in Switzerland, during part of which this work began. And thanks particularly to Andreas Lochbihler, who shared with us the probabilistic termination problem that led to it. They acknowledge the support of ARC grant DP140101119. Part of this work was carried out during the Workshop on Probabilistic Programming Semantics\r\nat McGill University’s Bellairs Research Institute on Barbados organised by Alexandra Silva and\r\nPrakash Panangaden. Kaminski and Katoen are grateful to Sebastian Junges for spotting a flaw in §5.4.","year":"2017","article_number":"33","language":[{"iso":"eng"}],"doi":"10.1145/3158121","conference":{"end_date":"2018-01-13","start_date":"2018-01-07","location":"Los Angeles, CA, United States","name":"POPL: Programming Languages"},"quality_controlled":"1","external_id":{"arxiv":["1711.03588"]},"main_file_link":[{"open_access":"1","url":"https://dl.acm.org/doi/10.1145/3158121"}],"oa":1,"publication_identifier":{"eissn":["2475-1421"]},"month":"12","oa_version":"Published Version","intvolume":" 2","status":"public","title":"A new proof rule for almost-sure termination","_id":"10418","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","issue":"POPL","abstract":[{"text":"We present a new proof rule for proving almost-sure termination of probabilistic programs, including those that contain demonic non-determinism. An important question for a probabilistic program is whether the probability mass of all its diverging runs is zero, that is that it terminates \"almost surely\". Proving that can be hard, and this paper presents a new method for doing so. It applies directly to the program's source code, even if the program contains demonic choice. Like others, we use variant functions (a.k.a. \"super-martingales\") that are real-valued and decrease randomly on each loop iteration; but our key innovation is that the amount as well as the probability of the decrease are parametric. We prove the soundness of the new rule, indicate where its applicability goes beyond existing rules, and explain its connection to classical results on denumerable (non-demonic) Markov chains.","lang":"eng"}],"type":"journal_article","date_published":"2017-12-07T00:00:00Z","article_type":"original","citation":{"chicago":"Mciver, Annabelle, Carroll Morgan, Benjamin Lucien Kaminski, and Joost P Katoen. “A New Proof Rule for Almost-Sure Termination.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158121.","short":"A. Mciver, C. Morgan, B.L. Kaminski, J.P. Katoen, Proceedings of the ACM on Programming Languages 2 (2017).","mla":"Mciver, Annabelle, et al. “A New Proof Rule for Almost-Sure Termination.” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 33, Association for Computing Machinery, 2017, doi:10.1145/3158121.","ieee":"A. Mciver, C. Morgan, B. L. Kaminski, and J. P. Katoen, “A new proof rule for almost-sure termination,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.","apa":"Mciver, A., Morgan, C., Kaminski, B. L., & Katoen, J. P. (2017). A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158121","ista":"Mciver A, Morgan C, Kaminski BL, Katoen JP. 2017. A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. 2(POPL), 33.","ama":"Mciver A, Morgan C, Kaminski BL, Katoen JP. A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. 2017;2(POPL). doi:10.1145/3158121"},"publication":"Proceedings of the ACM on Programming Languages","article_processing_charge":"No","day":"07","scopus_import":"1"},{"month":"01","publication_identifier":{"issn":["18688969"]},"conference":{"name":"ITCS: Innovations in Theoretical Computer Science","end_date":"2017-01-11","location":"Berkeley, CA, United States","start_date":"2017-01-09"},"doi":"10.4230/LIPIcs.ITCS.2017.38","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","file_date_updated":"2020-07-14T12:44:37Z","publist_id":"6179","license":"https://creativecommons.org/licenses/by/4.0/","author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F","last_name":"Alwen","full_name":"Alwen, Joel F"},{"last_name":"De Rezende","first_name":"Susanna","full_name":"De Rezende, Susanna"},{"full_name":"Nordstrom, Jakob","first_name":"Jakob","last_name":"Nordstrom"},{"last_name":"Vinyals","first_name":"Marc","full_name":"Vinyals, Marc"}],"date_updated":"2021-01-12T06:48:51Z","date_created":"2018-12-11T11:50:33Z","volume":67,"year":"2017","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrPi"}],"editor":[{"full_name":"Papadimitriou, Christos","first_name":"Christos","last_name":"Papadimitriou"}],"day":"01","has_accepted_license":"1","scopus_import":1,"date_published":"2017-01-01T00:00:00Z","citation":{"mla":"Alwen, Joel F., et al. Cumulative Space in Black-White Pebbling and Resolution. Edited by Christos Papadimitriou, vol. 67, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21, doi:10.4230/LIPIcs.ITCS.2017.38.","short":"J.F. Alwen, S. De Rezende, J. Nordstrom, M. Vinyals, in:, C. Papadimitriou (Ed.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21.","chicago":"Alwen, Joel F, Susanna De Rezende, Jakob Nordstrom, and Marc Vinyals. “Cumulative Space in Black-White Pebbling and Resolution.” edited by Christos Papadimitriou, 67:38:1-38-21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.ITCS.2017.38.","ama":"Alwen JF, De Rezende S, Nordstrom J, Vinyals M. Cumulative space in black-white pebbling and resolution. In: Papadimitriou C, ed. Vol 67. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017:38:1-38-21. doi:10.4230/LIPIcs.ITCS.2017.38","ista":"Alwen JF, De Rezende S, Nordstrom J, Vinyals M. 2017. Cumulative space in black-white pebbling and resolution. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 67, 38:1-38-21.","ieee":"J. F. Alwen, S. De Rezende, J. Nordstrom, and M. Vinyals, “Cumulative space in black-white pebbling and resolution,” presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States, 2017, vol. 67, p. 38:1-38-21.","apa":"Alwen, J. F., De Rezende, S., Nordstrom, J., & Vinyals, M. (2017). Cumulative space in black-white pebbling and resolution. In C. Papadimitriou (Ed.) (Vol. 67, p. 38:1-38-21). Presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2017.38"},"page":"38:1-38-21","abstract":[{"text":"We study space complexity and time-space trade-offs with a focus not on peak memory usage but on overall memory consumption throughout the computation. Such a cumulative space measure was introduced for the computational model of parallel black pebbling by [Alwen and Serbinenko ’15] as a tool for obtaining results in cryptography. We consider instead the non- deterministic black-white pebble game and prove optimal cumulative space lower bounds and trade-offs, where in order to minimize pebbling time the space has to remain large during a significant fraction of the pebbling. We also initiate the study of cumulative space in proof complexity, an area where other space complexity measures have been extensively studied during the last 10–15 years. Using and extending the connection between proof complexity and pebble games in [Ben-Sasson and Nordström ’08, ’11] we obtain several strong cumulative space results for (even parallel versions of) the resolution proof system, and outline some possible future directions of study of this, in our opinion, natural and interesting space measure.","lang":"eng"}],"type":"conference","alternative_title":["LIPIcs"],"pubrep_id":"927","file":[{"file_id":"5263","relation":"main_file","date_created":"2018-12-12T10:17:11Z","date_updated":"2020-07-14T12:44:37Z","checksum":"dbc94810be07c2fb1945d5c2a6130e6c","file_name":"IST-2018-927-v1+1_LIPIcs-ITCS-2017-38.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":557769}],"oa_version":"Published Version","_id":"1175","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Cumulative space in black-white pebbling and resolution","status":"public","ddc":["005","600"],"intvolume":" 67"},{"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1607.00944"}],"quality_controlled":"1","project":[{"name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","call_identifier":"FP7","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","grant_number":"618091"},{"_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7"}],"doi":"10.1007/s11538-016-0244-3","language":[{"iso":"eng"}],"month":"03","acknowledgement":"We thank Nick Barton, Katarína Bod’ová, and Sr\r\n-\r\ndan Sarikas for constructive feed-\r\nback and support. Furthermore, we would like to express our deep gratitude to the anonymous referees (one\r\nof whom, Jimmy Garnier, agreed to reveal his identity) and the editor Max Souza, for very helpful and\r\ndetailed comments and suggestions that significantly helped us to improve the manuscript. This project has\r\nreceived funding from the European Union’s Seventh Framework Programme for research, technological\r\ndevelopment and demonstration under Grant Agreement 618091 Speed of Adaptation in Population Genet-\r\nics and Evolutionary Computation (SAGE) and the European Research Council (ERC) Grant No. 250152\r\n(SN), from the Scientific Grant Agency of the Slovak Republic under the Grant 1/0459/13 and by the Slovak\r\nResearch and Development Agency under the Contract No. APVV-14-0378 (RK). RK would also like to\r\nthank IST Austria for its hospitality during the work on this project.","year":"2017","publication_status":"published","department":[{"_id":"NiBa"}],"publisher":"Springer","author":[{"last_name":"Kollár","first_name":"Richard","full_name":"Kollár, Richard"},{"first_name":"Sebastian","last_name":"Novak","id":"461468AE-F248-11E8-B48F-1D18A9856A87","full_name":"Novak, Sebastian"}],"date_updated":"2021-01-12T06:48:58Z","date_created":"2018-12-11T11:50:38Z","volume":79,"publist_id":"6160","ec_funded":1,"publication":"Bulletin of Mathematical Biology","citation":{"chicago":"Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the Generalized F–KPP Equation.” Bulletin of Mathematical Biology. Springer, 2017. https://doi.org/10.1007/s11538-016-0244-3.","mla":"Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the Generalized F–KPP Equation.” Bulletin of Mathematical Biology, vol. 79, no. 3, Springer, 2017, pp. 525–59, doi:10.1007/s11538-016-0244-3.","short":"R. Kollár, S. Novak, Bulletin of Mathematical Biology 79 (2017) 525–559.","ista":"Kollár R, Novak S. 2017. Existence of traveling waves for the generalized F–KPP equation. Bulletin of Mathematical Biology. 79(3), 525–559.","ieee":"R. Kollár and S. Novak, “Existence of traveling waves for the generalized F–KPP equation,” Bulletin of Mathematical Biology, vol. 79, no. 3. Springer, pp. 525–559, 2017.","apa":"Kollár, R., & Novak, S. (2017). Existence of traveling waves for the generalized F–KPP equation. Bulletin of Mathematical Biology. Springer. https://doi.org/10.1007/s11538-016-0244-3","ama":"Kollár R, Novak S. Existence of traveling waves for the generalized F–KPP equation. Bulletin of Mathematical Biology. 2017;79(3):525-559. doi:10.1007/s11538-016-0244-3"},"page":"525-559","date_published":"2017-03-01T00:00:00Z","scopus_import":1,"day":"01","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"1191","status":"public","title":"Existence of traveling waves for the generalized F–KPP equation","intvolume":" 79","oa_version":"Preprint","type":"journal_article","abstract":[{"text":"Variation in genotypes may be responsible for differences in dispersal rates, directional biases, and growth rates of individuals. These traits may favor certain genotypes and enhance their spatiotemporal spreading into areas occupied by the less advantageous genotypes. We study how these factors influence the speed of spreading in the case of two competing genotypes under the assumption that spatial variation of the total population is small compared to the spatial variation of the frequencies of the genotypes in the population. In that case, the dynamics of the frequency of one of the genotypes is approximately described by a generalized Fisher–Kolmogorov–Petrovskii–Piskunov (F–KPP) equation. This generalized F–KPP equation with (nonlinear) frequency-dependent diffusion and advection terms admits traveling wave solutions that characterize the invasion of the dominant genotype. Our existence results generalize the classical theory for traveling waves for the F–KPP with constant coefficients. Moreover, in the particular case of the quadratic (monostable) nonlinear growth–decay rate in the generalized F–KPP we study in detail the influence of the variance in diffusion and mean displacement rates of the two genotypes on the minimal wave propagation speed.","lang":"eng"}],"issue":"3"},{"month":"05","language":[{"iso":"eng"}],"doi":"10.1007/s10955-016-1672-z","quality_controlled":"1","oa":1,"publist_id":"6136","file_date_updated":"2020-07-14T12:44:39Z","volume":167,"date_updated":"2021-01-12T06:49:07Z","date_created":"2018-12-11T11:50:44Z","author":[{"full_name":"Budanur, Nazmi B","first_name":"Nazmi B","last_name":"Budanur","id":"3EA1010E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0423-5010"},{"last_name":"Cvitanović","first_name":"Predrag","full_name":"Cvitanović, Predrag"}],"department":[{"_id":"BjHo"}],"publisher":"Springer","publication_status":"published","year":"2017","acknowledgement":"This work was supported by the family of late G. Robinson, Jr. and NSF Grant DMS-1211827. ","has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2017-05-01T00:00:00Z","page":"636-655","citation":{"chicago":"Budanur, Nazmi B, and Predrag Cvitanović. “Unstable Manifolds of Relative Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky System.” Journal of Statistical Physics. Springer, 2017. https://doi.org/10.1007/s10955-016-1672-z.","short":"N.B. Budanur, P. Cvitanović, Journal of Statistical Physics 167 (2017) 636–655.","mla":"Budanur, Nazmi B., and Predrag Cvitanović. “Unstable Manifolds of Relative Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky System.” Journal of Statistical Physics, vol. 167, no. 3–4, Springer, 2017, pp. 636–55, doi:10.1007/s10955-016-1672-z.","ieee":"N. B. Budanur and P. Cvitanović, “Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system,” Journal of Statistical Physics, vol. 167, no. 3–4. Springer, pp. 636–655, 2017.","apa":"Budanur, N. B., & Cvitanović, P. (2017). Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal of Statistical Physics. Springer. https://doi.org/10.1007/s10955-016-1672-z","ista":"Budanur NB, Cvitanović P. 2017. Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal of Statistical Physics. 167(3–4), 636–655.","ama":"Budanur NB, Cvitanović P. Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal of Statistical Physics. 2017;167(3-4):636-655. doi:10.1007/s10955-016-1672-z"},"publication":"Journal of Statistical Physics","issue":"3-4","abstract":[{"text":"Systems such as fluid flows in channels and pipes or the complex Ginzburg–Landau system, defined over periodic domains, exhibit both continuous symmetries, translational and rotational, as well as discrete symmetries under spatial reflections or complex conjugation. The simplest, and very common symmetry of this type is the equivariance of the defining equations under the orthogonal group O(2). We formulate a novel symmetry reduction scheme for such systems by combining the method of slices with invariant polynomial methods, and show how it works by applying it to the Kuramoto–Sivashinsky system in one spatial dimension. As an example, we track a relative periodic orbit through a sequence of bifurcations to the onset of chaos. Within the symmetry-reduced state space we are able to compute and visualize the unstable manifolds of relative periodic orbits, their torus bifurcations, a transition to chaos via torus breakdown, and heteroclinic connections between various relative periodic orbits. It would be very hard to carry through such analysis in the full state space, without a symmetry reduction such as the one we present here.","lang":"eng"}],"type":"journal_article","file":[{"relation":"main_file","file_id":"5319","date_updated":"2020-07-14T12:44:39Z","date_created":"2018-12-12T10:18:01Z","checksum":"3e971d09eb167761aa0888ed415b0056","file_name":"IST-2017-782-v1+1_BudCvi15.pdf","access_level":"open_access","file_size":2820207,"content_type":"application/pdf","creator":"system"}],"oa_version":"Submitted Version","pubrep_id":"782","intvolume":" 167","title":"Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system","status":"public","ddc":["530"],"_id":"1211","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"file_date_updated":"2019-10-24T10:54:37Z","publist_id":"6254","ec_funded":1,"year":"2017","publication_status":"published","department":[{"_id":"UlWa"}],"publisher":"Brown University","author":[{"id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8485-1774","first_name":"Radoslav","last_name":"Fulek","full_name":"Fulek, Radoslav"},{"full_name":"Pelsmajer, Michael","last_name":"Pelsmajer","first_name":"Michael"},{"full_name":"Schaefer, Marcus","first_name":"Marcus","last_name":"Schaefer"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1164"},{"id":"1595","status":"public","relation":"earlier_version"}]},"date_updated":"2023-02-23T10:05:57Z","date_created":"2018-12-11T11:50:13Z","volume":21,"month":"01","oa":1,"external_id":{"arxiv":["1608.08662"]},"quality_controlled":"1","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"doi":"10.7155/jgaa.00408","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"text":"A drawing of a graph G is radial if the vertices of G are placed on concentric circles C 1 , . . . , C k with common center c , and edges are drawn radially : every edge intersects every circle centered at c at most once. G is radial planar if it has a radial embedding, that is, a crossing-free radial drawing. If the vertices of G are ordered or partitioned into ordered levels (as they are for leveled graphs), we require that the assignment of vertices to circles corresponds to the given ordering or leveling. We show that a graph G is radial planar if G has a radial drawing in which every two edges cross an even number of times; the radial embedding has the same leveling as the radial drawing. In other words, we establish the weak variant of the Hanani-Tutte theorem for radial planarity. This generalizes a result by Pach and Toth.","lang":"eng"}],"issue":"1","_id":"1113","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Hanani-Tutte for radial planarity","ddc":["510"],"intvolume":" 21","file":[{"file_name":"2017_JournalGraphAlgorithms_Fulek.pdf","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":573623,"file_id":"6967","relation":"main_file","date_created":"2019-10-24T10:54:37Z","date_updated":"2019-10-24T10:54:37Z","success":1}],"oa_version":"Published Version","scopus_import":1,"day":"01","has_accepted_license":"1","article_processing_charge":"No","publication":"Journal of Graph Algorithms and Applications","citation":{"ista":"Fulek R, Pelsmajer M, Schaefer M. 2017. Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. 21(1), 135–154.","ieee":"R. Fulek, M. Pelsmajer, and M. Schaefer, “Hanani-Tutte for radial planarity,” Journal of Graph Algorithms and Applications, vol. 21, no. 1. Brown University, pp. 135–154, 2017.","apa":"Fulek, R., Pelsmajer, M., & Schaefer, M. (2017). Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. Brown University. https://doi.org/10.7155/jgaa.00408","ama":"Fulek R, Pelsmajer M, Schaefer M. Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. 2017;21(1):135-154. doi:10.7155/jgaa.00408","chicago":"Fulek, Radoslav, Michael Pelsmajer, and Marcus Schaefer. “Hanani-Tutte for Radial Planarity.” Journal of Graph Algorithms and Applications. Brown University, 2017. https://doi.org/10.7155/jgaa.00408.","mla":"Fulek, Radoslav, et al. “Hanani-Tutte for Radial Planarity.” Journal of Graph Algorithms and Applications, vol. 21, no. 1, Brown University, 2017, pp. 135–54, doi:10.7155/jgaa.00408.","short":"R. Fulek, M. Pelsmajer, M. Schaefer, Journal of Graph Algorithms and Applications 21 (2017) 135–154."},"article_type":"original","page":"135 - 154","date_published":"2017-01-01T00:00:00Z"},{"type":"journal_article","abstract":[{"text":"Most kinesin motors move in only one direction along microtubules. Members of the kinesin-5 subfamily were initially described as unidirectional plus-end-directed motors and shown to produce piconewton forces. However, some fungal kinesin-5 motors are bidirectional. The force production of a bidirectional kinesin-5 has not yet been measured. Therefore, it remains unknown whether the mechanism of the unconventional minus-end-directed motility differs fundamentally from that of plus-end-directed stepping. Using force spectroscopy, we have measured here the forces that ensembles of purified budding yeast kinesin-5 Cin8 produce in microtubule gliding assays in both plus- and minus-end direction. Correlation analysis of pause forces demonstrated that individual Cin8 molecules produce additive forces in both directions of movement. In ensembles, Cin8 motors were able to produce single-motor forces up to a magnitude of ∼1.5 pN. Hence, these properties appear to be conserved within the kinesin-5 subfamily. Force production was largely independent of the directionality of movement, indicating similarities between the motility mechanisms for both directions. These results provide constraints for the development of models for the bidirectional motility mechanism of fission yeast kinesin-5 and provide insight into the function of this mitotic motor.","lang":"eng"}],"issue":"9","status":"public","ddc":["570"],"title":"Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement","intvolume":" 113","_id":"453","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"file_size":977192,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2018-965-v1+1_2017_Duellberg_Ensembles_of.pdf","checksum":"99a2474088e20ac74b1882c4fbbb45b1","date_created":"2018-12-12T10:14:03Z","date_updated":"2020-07-14T12:46:31Z","relation":"main_file","file_id":"5052"}],"pubrep_id":"965","day":"07","article_processing_charge":"No","has_accepted_license":"1","article_type":"original","page":"2055 - 2067","publication":"Biophysical Journal","citation":{"chicago":"Fallesen, Todd, Johanna Roostalu, Christian F Düllberg, Gunnar Pruessner, and Thomas Surrey. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces in Both Directions of Movement.” Biophysical Journal. Biophysical Society, 2017. https://doi.org/10.1016/j.bpj.2017.09.006.","short":"T. Fallesen, J. Roostalu, C.F. Düllberg, G. Pruessner, T. Surrey, Biophysical Journal 113 (2017) 2055–2067.","mla":"Fallesen, Todd, et al. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces in Both Directions of Movement.” Biophysical Journal, vol. 113, no. 9, Biophysical Society, 2017, pp. 2055–67, doi:10.1016/j.bpj.2017.09.006.","ieee":"T. Fallesen, J. Roostalu, C. F. Düllberg, G. Pruessner, and T. Surrey, “Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement,” Biophysical Journal, vol. 113, no. 9. Biophysical Society, pp. 2055–2067, 2017.","apa":"Fallesen, T., Roostalu, J., Düllberg, C. F., Pruessner, G., & Surrey, T. (2017). Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. Biophysical Society. https://doi.org/10.1016/j.bpj.2017.09.006","ista":"Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. 2017. Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. 113(9), 2055–2067.","ama":"Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. 2017;113(9):2055-2067. doi:10.1016/j.bpj.2017.09.006"},"date_published":"2017-11-07T00:00:00Z","file_date_updated":"2020-07-14T12:46:31Z","publist_id":"7369","publication_status":"published","department":[{"_id":"MaLo"}],"publisher":"Biophysical Society","acknowledgement":"The plasmid for full-length kinesin-1 was a gift from G. Holzwarth and J. Macosko with permission from J. Howard. We thank I. Lueke and N. I. Cade for technical assistance. G.P. thanks the Francis Crick Institute, and in particular the Surrey and Salbreux groups, for their hospitality during his sabbatical stay, as well as Imperial College London for making it possible. This work was supported by the Francis Crick Institute, which receives its core funding from Cancer Research UK (FC001163), the United Kingdom Medical Research Council (FC001163), and the Wellcome Trust (FC001163), and by Imperial College London. J.R. was also supported by a Sir Henry Wellcome Postdoctoral Fellowship (100145/Z/12/Z) and T.S. by the European Research Council (Advanced Grant, project 323042). ","year":"2017","date_updated":"2021-01-12T07:59:28Z","date_created":"2018-12-11T11:46:33Z","volume":113,"author":[{"first_name":"Todd","last_name":"Fallesen","full_name":"Fallesen, Todd"},{"full_name":"Roostalu, Johanna","first_name":"Johanna","last_name":"Roostalu"},{"full_name":"Düllberg, Christian F","orcid":"0000-0001-6335-9748","id":"459064DC-F248-11E8-B48F-1D18A9856A87","last_name":"Düllberg","first_name":"Christian F"},{"full_name":"Pruessner, Gunnar","first_name":"Gunnar","last_name":"Pruessner"},{"full_name":"Surrey, Thomas","last_name":"Surrey","first_name":"Thomas"}],"month":"11","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.1016/j.bpj.2017.09.006"},{"type":"journal_article","abstract":[{"text":"The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formedness of specifications, and the synthesis of reactive systems. We show how to compute the winning set on n vertices for (1) parity-3 (aka one-pair Streett) objectives in game graphs in time O(n5/2) and for (2) k-pair Streett objectives in graphs in time O(n2+nklogn). For both problems this gives faster algorithms for dense graphs and represents the first improvement in asymptotic running time in 15 years.","lang":"eng"}],"issue":"3","title":"Improved algorithms for parity and Streett objectives","ddc":["004"],"status":"public","intvolume":" 13","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"464","file":[{"access_level":"open_access","file_name":"IST-2018-956-v1+1_2017_Chatterjee_Improved_algorithms.pdf","file_size":582940,"content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"5010","checksum":"12d469ae69b80361333d7dead965cf5d","date_updated":"2020-07-14T12:46:32Z","date_created":"2018-12-12T10:13:27Z"}],"oa_version":"Published Version","pubrep_id":"956","scopus_import":"1","day":"26","has_accepted_license":"1","article_processing_charge":"No","publication":"Logical Methods in Computer Science","citation":{"ama":"Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:26)2017","ista":"Chatterjee K, Henzinger MH, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26.","apa":"Chatterjee, K., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:26)2017","ieee":"K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.","mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science, vol. 13, no. 3, 26, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:26)2017.","short":"K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:26)2017."},"date_published":"2017-09-26T00:00:00Z","article_number":"26","license":"https://creativecommons.org/licenses/by-nd/4.0/","file_date_updated":"2020-07-14T12:46:32Z","ec_funded":1,"publist_id":"7357","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"International Federation of Computational Logic","year":"2017","date_created":"2018-12-11T11:46:37Z","date_updated":"2023-02-23T10:08:55Z","volume":13,"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"last_name":"Loitzenbauer","first_name":"Veronika","full_name":"Loitzenbauer, Veronika"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1661"}]},"month":"09","publication_identifier":{"issn":["1860-5974"]},"quality_controlled":"1","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"oa":1,"external_id":{"arxiv":["1410.0833"]},"language":[{"iso":"eng"}],"doi":"10.23638/LMCS-13(3:26)2017"},{"article_number":"103","ec_funded":1,"publist_id":"7350","file_date_updated":"2020-07-14T12:46:34Z","year":"2017","department":[{"_id":"ChWo"}],"publisher":"ACM","publication_status":"published","author":[{"full_name":"Jeschke, Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","last_name":"Jeschke","first_name":"Stefan"},{"last_name":"Wojtan","first_name":"Christopher J","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J"}],"volume":36,"date_updated":"2023-02-23T12:20:26Z","date_created":"2018-12-11T11:46:39Z","publication_identifier":{"issn":["07300301"]},"month":"07","oa":1,"project":[{"call_identifier":"H2020","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.1145/3072959.3073678","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"type":"journal_article","issue":"4","abstract":[{"lang":"eng","text":"This paper presents a method for simulating water surface waves as a displacement field on a 2D domain. Our method relies on Lagrangian particles that carry packets of water wave energy; each packet carries information about an entire group of wave trains, as opposed to only a single wave crest. Our approach is unconditionally stable and can simulate high resolution geometric details. This approach also presents a straightforward interface for artistic control, because it is essentially a particle system with intuitive parameters like wavelength and amplitude. Our implementation parallelizes well and runs in real time for moderately challenging scenarios."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"470","intvolume":" 36","status":"public","ddc":["006"],"title":"Water wave packets","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"wavepackets_final.pdf","content_type":"application/pdf","file_size":13131683,"creator":"wojtan","relation":"main_file","file_id":"7359","checksum":"82a3b2bfeee4ddef16ecc21675d1a48a","date_created":"2020-01-24T09:32:35Z","date_updated":"2020-07-14T12:46:34Z"}],"scopus_import":1,"has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","day":"01","citation":{"ama":"Jeschke S, Wojtan C. Water wave packets. ACM Transactions on Graphics. 2017;36(4). doi:10.1145/3072959.3073678","ista":"Jeschke S, Wojtan C. 2017. Water wave packets. ACM Transactions on Graphics. 36(4), 103.","ieee":"S. Jeschke and C. Wojtan, “Water wave packets,” ACM Transactions on Graphics, vol. 36, no. 4. ACM, 2017.","apa":"Jeschke, S., & Wojtan, C. (2017). Water wave packets. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3072959.3073678","mla":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions on Graphics, vol. 36, no. 4, 103, ACM, 2017, doi:10.1145/3072959.3073678.","short":"S. Jeschke, C. Wojtan, ACM Transactions on Graphics 36 (2017).","chicago":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions on Graphics. ACM, 2017. https://doi.org/10.1145/3072959.3073678."},"publication":"ACM Transactions on Graphics","article_type":"original","date_published":"2017-07-01T00:00:00Z"},{"quality_controlled":"1","project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1504.05739","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1145/3060139","month":"05","publication_identifier":{"issn":["15293785"]},"publication_status":"published","publisher":"ACM","department":[{"_id":"ToHe"}],"year":"2017","date_updated":"2023-02-21T16:48:11Z","date_created":"2018-12-11T11:46:39Z","volume":18,"author":[{"full_name":"Daca, Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","last_name":"Daca"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Kretinsky, Jan","first_name":"Jan","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881"},{"first_name":"Tatjana","last_name":"Petrov","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9041-0905","full_name":"Petrov, Tatjana"}],"related_material":{"record":[{"id":"1234","relation":"earlier_version","status":"public"}]},"article_number":"12","publist_id":"7349","ec_funded":1,"publication":"ACM Transactions on Computational Logic (TOCL)","citation":{"ama":"Daca P, Henzinger TA, Kretinsky J, Petrov T. Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). 2017;18(2). doi:10.1145/3060139","ista":"Daca P, Henzinger TA, Kretinsky J, Petrov T. 2017. Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). 18(2), 12.","ieee":"P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Faster statistical model checking for unbounded temporal properties,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 2. ACM, 2017.","apa":"Daca, P., Henzinger, T. A., Kretinsky, J., & Petrov, T. (2017). Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3060139","mla":"Daca, Przemyslaw, et al. “Faster Statistical Model Checking for Unbounded Temporal Properties.” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 2, 12, ACM, 2017, doi:10.1145/3060139.","short":"P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, ACM Transactions on Computational Logic (TOCL) 18 (2017).","chicago":"Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Faster Statistical Model Checking for Unbounded Temporal Properties.” ACM Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3060139."},"date_published":"2017-05-01T00:00:00Z","scopus_import":1,"day":"01","title":"Faster statistical model checking for unbounded temporal properties","status":"public","intvolume":" 18","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"471","oa_version":"Submitted Version","type":"journal_article","abstract":[{"lang":"eng","text":"We present a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, including full linear temporal logic. The main idea is that we monitor each simulation run on the fly, in order to detect quickly if a bottom strongly connected component is entered with high probability, in which case the simulation run can be terminated early. As a result, our simulation runs are often much shorter than required by termination bounds that are computed a priori for a desired level of confidence on a large state space. In comparison to previous algorithms for statistical model checking our method is not only faster in many cases but also requires less information about the system, namely, only the minimum transition probability that occurs in the Markov chain. In addition, our method can be generalised to unbounded quantitative properties such as mean-payoff bounds. "}],"issue":"2"},{"scopus_import":1,"day":"13","has_accepted_license":"1","page":"211 - 229","publication":"International Journal of Computational Geometry and Applications","citation":{"chicago":"Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” International Journal of Computational Geometry and Applications. World Scientific Publishing, 2017. https://doi.org/10.1142/S0218195916600050.","short":"T. Biedl, S. Huber, P. Palfrader, International Journal of Computational Geometry and Applications 26 (2017) 211–229.","mla":"Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” International Journal of Computational Geometry and Applications, vol. 26, no. 3–4, World Scientific Publishing, 2017, pp. 211–29, doi:10.1142/S0218195916600050.","ieee":"T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” International Journal of Computational Geometry and Applications, vol. 26, no. 3–4. World Scientific Publishing, pp. 211–229, 2017.","apa":"Biedl, T., Huber, S., & Palfrader, P. (2017). Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. World Scientific Publishing. https://doi.org/10.1142/S0218195916600050","ista":"Biedl T, Huber S, Palfrader P. 2017. Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. 26(3–4), 211–229.","ama":"Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. 2017;26(3-4):211-229. doi:10.1142/S0218195916600050"},"date_published":"2017-04-13T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"We introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist. Using our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings."}],"issue":"3-4","title":"Planar matchings for weighted straight skeletons","ddc":["004","514","516"],"status":"public","intvolume":" 26","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"481","oa_version":"Published Version","file":[{"file_name":"IST-2018-949-v1+1_2016_huber_PLanar_matchings.pdf","access_level":"open_access","file_size":769296,"content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"4758","date_created":"2018-12-12T10:09:34Z","date_updated":"2020-07-14T12:46:35Z","checksum":"f79e8558bfe4b368dfefeb8eec2e3a5e"}],"pubrep_id":"949","month":"04","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1142/S0218195916600050","file_date_updated":"2020-07-14T12:46:35Z","publist_id":"7338","publication_status":"published","publisher":"World Scientific Publishing","department":[{"_id":"HeEd"}],"year":"2017","acknowledgement":"Supported by NSERC and the Ross and Muriel Cheriton Fellowship. Research supported by Austrian Science Fund (FWF): P25816-N15.","date_created":"2018-12-11T11:46:43Z","date_updated":"2023-02-21T16:06:22Z","volume":26,"author":[{"full_name":"Biedl, Therese","first_name":"Therese","last_name":"Biedl"},{"full_name":"Huber, Stefan","orcid":"0000-0002-8871-5814","id":"4700A070-F248-11E8-B48F-1D18A9856A87","last_name":"Huber","first_name":"Stefan"},{"full_name":"Palfrader, Peter","first_name":"Peter","last_name":"Palfrader"}],"related_material":{"record":[{"id":"10892","relation":"earlier_version","status":"public"}]}},{"ec_funded":1,"publist_id":"7336","publication_status":"published","department":[{"_id":"RoSe"}],"publisher":"International Press","year":"2017","date_created":"2018-12-11T11:46:43Z","date_updated":"2021-01-12T08:00:58Z","volume":21,"author":[{"full_name":"Nam, Phan","last_name":"Nam","first_name":"Phan","id":"404092F4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Marcin M","last_name":"Napiórkowski","id":"4197AD04-F248-11E8-B48F-1D18A9856A87","full_name":"Napiórkowski, Marcin M"}],"month":"01","publication_identifier":{"issn":["10950761"]},"quality_controlled":"1","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"},{"call_identifier":"FWF","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","_id":"25C878CE-B435-11E9-9278-68D0E5697425","grant_number":"P27533_N27"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1509.04631"}],"language":[{"iso":"eng"}],"doi":"10.4310/ATMP.2017.v21.n3.a4","type":"journal_article","abstract":[{"text":"We consider the dynamics of a large quantum system of N identical bosons in 3D interacting via a two-body potential of the form N3β-1w(Nβ(x - y)). For fixed 0 = β < 1/3 and large N, we obtain a norm approximation to the many-body evolution in the Nparticle Hilbert space. The leading order behaviour of the dynamics is determined by Hartree theory while the second order is given by Bogoliubov theory.","lang":"eng"}],"issue":"3","status":"public","title":"Bogoliubov correction to the mean-field dynamics of interacting bosons","intvolume":" 21","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"484","oa_version":"Submitted Version","scopus_import":1,"day":"01","page":"683 - 738","publication":"Advances in Theoretical and Mathematical Physics","citation":{"ama":"Nam P, Napiórkowski MM. Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. 2017;21(3):683-738. doi:10.4310/ATMP.2017.v21.n3.a4","ista":"Nam P, Napiórkowski MM. 2017. Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. 21(3), 683–738.","apa":"Nam, P., & Napiórkowski, M. M. (2017). Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. International Press. https://doi.org/10.4310/ATMP.2017.v21.n3.a4","ieee":"P. Nam and M. M. Napiórkowski, “Bogoliubov correction to the mean-field dynamics of interacting bosons,” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3. International Press, pp. 683–738, 2017.","mla":"Nam, Phan, and Marcin M. Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3, International Press, 2017, pp. 683–738, doi:10.4310/ATMP.2017.v21.n3.a4.","short":"P. Nam, M.M. Napiórkowski, Advances in Theoretical and Mathematical Physics 21 (2017) 683–738.","chicago":"Nam, Phan, and Marcin M Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics. International Press, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a4."},"date_published":"2017-01-01T00:00:00Z"},{"month":"08","publication_identifier":{"issn":["10950761"]},"doi":"10.4310/ATMP.2017.v21.n3.a5","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1602.02312","open_access":"1"}],"oa":1,"quality_controlled":"1","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems"}],"ec_funded":1,"publist_id":"7337","author":[{"full_name":"Bourgade, Paul","first_name":"Paul","last_name":"Bourgade"},{"orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","first_name":"László","full_name":"Erdös, László"},{"last_name":"Yau","first_name":"Horng","full_name":"Yau, Horng"},{"first_name":"Jun","last_name":"Yin","full_name":"Yin, Jun"}],"date_updated":"2021-01-12T08:00:57Z","date_created":"2018-12-11T11:46:43Z","volume":21,"year":"2017","publication_status":"published","department":[{"_id":"LaEr"}],"publisher":"International Press","day":"25","scopus_import":1,"date_published":"2017-08-25T00:00:00Z","publication":"Advances in Theoretical and Mathematical Physics","citation":{"mla":"Bourgade, Paul, et al. “Universality for a Class of Random Band Matrices.” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3, International Press, 2017, pp. 739–800, doi:10.4310/ATMP.2017.v21.n3.a5.","short":"P. Bourgade, L. Erdös, H. Yau, J. Yin, Advances in Theoretical and Mathematical Physics 21 (2017) 739–800.","chicago":"Bourgade, Paul, László Erdös, Horng Yau, and Jun Yin. “Universality for a Class of Random Band Matrices.” Advances in Theoretical and Mathematical Physics. International Press, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a5.","ama":"Bourgade P, Erdös L, Yau H, Yin J. Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. 2017;21(3):739-800. doi:10.4310/ATMP.2017.v21.n3.a5","ista":"Bourgade P, Erdös L, Yau H, Yin J. 2017. Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. 21(3), 739–800.","ieee":"P. Bourgade, L. Erdös, H. Yau, and J. Yin, “Universality for a class of random band matrices,” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3. International Press, pp. 739–800, 2017.","apa":"Bourgade, P., Erdös, L., Yau, H., & Yin, J. (2017). Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. International Press. https://doi.org/10.4310/ATMP.2017.v21.n3.a5"},"page":"739 - 800","abstract":[{"text":"We prove the universality for the eigenvalue gap statistics in the bulk of the spectrum for band matrices, in the regime where the band width is comparable with the dimension of the matrix, W ~ N. All previous results concerning universality of non-Gaussian random matrices are for mean-field models. By relying on a new mean-field reduction technique, we deduce universality from quantum unique ergodicity for band matrices.","lang":"eng"}],"issue":"3","type":"journal_article","oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"483","title":"Universality for a class of random band matrices","status":"public","intvolume":" 21"},{"scopus_import":1,"has_accepted_license":"1","day":"01","citation":{"short":"J. Simonnet, M. Nassar, F. Stella, I. Cohen, B. Mathon, C.N. Boccara, R. Miles, D. Fricker, Nature Communications 8 (2017).","mla":"Simonnet, Jean, et al. “Activity Dependent Feedback Inhibition May Maintain Head Direction Signals in Mouse Presubiculum.” Nature Communications, vol. 8, 16032, Nature Publishing Group, 2017, doi:10.1038/ncomms16032.","chicago":"Simonnet, Jean, Mérie Nassar, Federico Stella, Ivan Cohen, Bertrand Mathon, Charlotte N. Boccara, Richard Miles, and Desdemona Fricker. “Activity Dependent Feedback Inhibition May Maintain Head Direction Signals in Mouse Presubiculum.” Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/ncomms16032.","ama":"Simonnet J, Nassar M, Stella F, et al. Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. Nature Communications. 2017;8. doi:10.1038/ncomms16032","ieee":"J. Simonnet et al., “Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum,” Nature Communications, vol. 8. Nature Publishing Group, 2017.","apa":"Simonnet, J., Nassar, M., Stella, F., Cohen, I., Mathon, B., Boccara, C. N., … Fricker, D. (2017). Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms16032","ista":"Simonnet J, Nassar M, Stella F, Cohen I, Mathon B, Boccara CN, Miles R, Fricker D. 2017. Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. Nature Communications. 8, 16032."},"publication":"Nature Communications","date_published":"2017-07-01T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"Orientation in space is represented in specialized brain circuits. Persistent head direction signals are transmitted from anterior thalamus to the presubiculum, but the identity of the presubicular target neurons, their connectivity and function in local microcircuits are unknown. Here, we examine how thalamic afferents recruit presubicular principal neurons and Martinotti interneurons, and the ensuing synaptic interactions between these cells. Pyramidal neuron activation of Martinotti cells in superficial layers is strongly facilitating such that high-frequency head directional stimulation efficiently unmutes synaptic excitation. Martinotti-cell feedback plays a dual role: precisely timed spikes may not inhibit the firing of in-tune head direction cells, while exerting lateral inhibition. Autonomous attractor dynamics emerge from a modelled network implementing wiring motifs and timing sensitive synaptic interactions in the pyramidal - Martinotti-cell feedback loop. This inhibitory microcircuit is therefore tuned to refine and maintain head direction information in the presubiculum."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"514","intvolume":" 8","title":"Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum","ddc":["571"],"status":"public","pubrep_id":"937","oa_version":"Published Version","file":[{"file_id":"5083","relation":"main_file","date_updated":"2020-07-14T12:46:36Z","date_created":"2018-12-12T10:14:31Z","checksum":"76d8a2b72a58e56adb410ec37dfa7eee","file_name":"IST-2018-937-v1+1_2017_Stella_Activity_dependent.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":2948357}],"publication_identifier":{"issn":["20411723"]},"month":"07","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","doi":"10.1038/ncomms16032","language":[{"iso":"eng"}],"article_number":"16032","publist_id":"7305","file_date_updated":"2020-07-14T12:46:36Z","year":"2017","publisher":"Nature Publishing Group","department":[{"_id":"JoCs"}],"publication_status":"published","author":[{"full_name":"Simonnet, Jean","first_name":"Jean","last_name":"Simonnet"},{"first_name":"Mérie","last_name":"Nassar","full_name":"Nassar, Mérie"},{"first_name":"Federico","last_name":"Stella","id":"39AF1E74-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9439-3148","full_name":"Stella, Federico"},{"full_name":"Cohen, Ivan","first_name":"Ivan","last_name":"Cohen"},{"full_name":"Mathon, Bertrand","first_name":"Bertrand","last_name":"Mathon"},{"full_name":"Boccara, Charlotte","first_name":"Charlotte","last_name":"Boccara","id":"3FC06552-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7237-5109"},{"last_name":"Miles","first_name":"Richard","full_name":"Miles, Richard"},{"full_name":"Fricker, Desdemona","first_name":"Desdemona","last_name":"Fricker"}],"volume":8,"date_created":"2018-12-11T11:46:54Z","date_updated":"2021-01-12T08:01:16Z"},{"publication_identifier":{"issn":["15459993"]},"month":"10","doi":"10.1038/nsmb.3460","language":[{"iso":"eng"}],"oa":1,"project":[{"call_identifier":"H2020","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)","_id":"2590DB08-B435-11E9-9278-68D0E5697425","grant_number":"701309"}],"quality_controlled":"1","ec_funded":1,"publist_id":"7304","file_date_updated":"2020-07-14T12:46:36Z","author":[{"full_name":"Letts, James A","first_name":"James A","last_name":"Letts","id":"322DA418-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9864-3586"},{"id":"338D39FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0977-7989","first_name":"Leonid A","last_name":"Sazanov","full_name":"Sazanov, Leonid A"}],"volume":24,"date_updated":"2021-01-12T08:01:17Z","date_created":"2018-12-11T11:46:54Z","year":"2017","department":[{"_id":"LeSa"}],"publisher":"Nature Publishing Group","publication_status":"published","has_accepted_license":"1","day":"05","scopus_import":1,"date_published":"2017-10-05T00:00:00Z","citation":{"ieee":"J. A. Letts and L. A. Sazanov, “Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain,” Nature Structural and Molecular Biology, vol. 24, no. 10. Nature Publishing Group, pp. 800–808, 2017.","apa":"Letts, J. A., & Sazanov, L. A. (2017). Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. Nature Structural and Molecular Biology. Nature Publishing Group. https://doi.org/10.1038/nsmb.3460","ista":"Letts JA, Sazanov LA. 2017. Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. Nature Structural and Molecular Biology. 24(10), 800–808.","ama":"Letts JA, Sazanov LA. Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. Nature Structural and Molecular Biology. 2017;24(10):800-808. doi:10.1038/nsmb.3460","chicago":"Letts, James A, and Leonid A Sazanov. “Clarifying the Supercomplex: The Higher-Order Organization of the Mitochondrial Electron Transport Chain.” Nature Structural and Molecular Biology. Nature Publishing Group, 2017. https://doi.org/10.1038/nsmb.3460.","short":"J.A. Letts, L.A. Sazanov, Nature Structural and Molecular Biology 24 (2017) 800–808.","mla":"Letts, James A., and Leonid A. Sazanov. “Clarifying the Supercomplex: The Higher-Order Organization of the Mitochondrial Electron Transport Chain.” Nature Structural and Molecular Biology, vol. 24, no. 10, Nature Publishing Group, 2017, pp. 800–08, doi:10.1038/nsmb.3460."},"publication":"Nature Structural and Molecular Biology","page":"800 - 808","article_type":"original","issue":"10","abstract":[{"text":"The oxidative phosphorylation electron transport chain (OXPHOS-ETC) of the inner mitochondrial membrane is composed of five large protein complexes, named CI-CV. These complexes convert energy from the food we eat into ATP, a small molecule used to power a multitude of essential reactions throughout the cell. OXPHOS-ETC complexes are organized into supercomplexes (SCs) of defined stoichiometry: CI forms a supercomplex with CIII2 and CIV (SC I+III2+IV, known as the respirasome), as well as with CIII2 alone (SC I+III2). CIII2 forms a supercomplex with CIV (SC III2+IV) and CV forms dimers (CV2). Recent cryo-EM studies have revealed the structures of SC I+III2+IV and SC I+III2. Furthermore, recent work has shed light on the assembly and function of the SCs. Here we review and compare these recent studies and discuss how they have advanced our understanding of mitochondrial electron transport.","lang":"eng"}],"type":"journal_article","file":[{"date_created":"2019-11-07T12:51:07Z","date_updated":"2020-07-14T12:46:36Z","checksum":"9bc7e8c41b43636dd7566289e511f096","relation":"main_file","file_id":"6993","file_size":4118385,"content_type":"application/pdf","creator":"lsazanov","file_name":"29893_2_merged_1501257589_red.pdf","access_level":"open_access"}],"oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"515","intvolume":" 24","status":"public","ddc":["572"],"title":"Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain"},{"day":"01","month":"04","scopus_import":1,"language":[{"iso":"eng"}],"doi":"10.1103/PhysRevFluids.2.043904","date_published":"2017-04-01T00:00:00Z","quality_controlled":"1","publication":"Physical Review Fluids","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1704.02619"}],"citation":{"ista":"Klotz L, Lemoult GM, Frontczak I, Tuckerman L, Wesfreid J. 2017. Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. Physical Review Fluids. 2(4), 043904.","ieee":"L. Klotz, G. M. Lemoult, I. Frontczak, L. Tuckerman, and J. Wesfreid, “Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence,” Physical Review Fluids, vol. 2, no. 4. American Physical Society, 2017.","apa":"Klotz, L., Lemoult, G. M., Frontczak, I., Tuckerman, L., & Wesfreid, J. (2017). Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. Physical Review Fluids. American Physical Society. https://doi.org/10.1103/PhysRevFluids.2.043904","ama":"Klotz L, Lemoult GM, Frontczak I, Tuckerman L, Wesfreid J. Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. Physical Review Fluids. 2017;2(4). doi:10.1103/PhysRevFluids.2.043904","chicago":"Klotz, Lukasz, Grégoire M Lemoult, Idalia Frontczak, Laurette Tuckerman, and José Wesfreid. “Couette-Poiseuille Flow Experiment with Zero Mean Advection Velocity: Subcritical Transition to Turbulence.” Physical Review Fluids. American Physical Society, 2017. https://doi.org/10.1103/PhysRevFluids.2.043904.","mla":"Klotz, Lukasz, et al. “Couette-Poiseuille Flow Experiment with Zero Mean Advection Velocity: Subcritical Transition to Turbulence.” Physical Review Fluids, vol. 2, no. 4, 043904, American Physical Society, 2017, doi:10.1103/PhysRevFluids.2.043904.","short":"L. Klotz, G.M. Lemoult, I. Frontczak, L. Tuckerman, J. Wesfreid, Physical Review Fluids 2 (2017)."},"oa":1,"abstract":[{"text":"We present an experimental setup that creates a shear flow with zero mean advection velocity achieved by counterbalancing the nonzero streamwise pressure gradient by moving boundaries, which generates plane Couette-Poiseuille flow. We obtain experimental results in the transitional regime for this flow. Using flow visualization, we characterize the subcritical transition to turbulence in Couette-Poiseuille flow and show the existence of turbulent spots generated by a permanent perturbation. Due to the zero mean advection velocity of the base profile, these turbulent structures are nearly stationary. We distinguish two regions of the turbulent spot: the active turbulent core, which is characterized by waviness of the streaks similar to traveling waves, and the surrounding region, which includes in addition the weak undisturbed streaks and oblique waves at the laminar-turbulent interface. We also study the dependence of the size of these two regions on Reynolds number. Finally, we show that the traveling waves move in the downstream (Poiseuille) direction.","lang":"eng"}],"issue":"4","publist_id":"7306","article_number":"043904","type":"journal_article","date_updated":"2021-01-12T08:01:16Z","date_created":"2018-12-11T11:46:54Z","oa_version":"Preprint","volume":2,"author":[{"first_name":"Lukasz","last_name":"Klotz","id":"2C9AF1C2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1740-7635","full_name":"Klotz, Lukasz"},{"last_name":"Lemoult","first_name":"Grégoire M","id":"4787FE80-F248-11E8-B48F-1D18A9856A87","full_name":"Lemoult, Grégoire M"},{"full_name":"Frontczak, Idalia","first_name":"Idalia","last_name":"Frontczak"},{"full_name":"Tuckerman, Laurette","last_name":"Tuckerman","first_name":"Laurette"},{"last_name":"Wesfreid","first_name":"José","full_name":"Wesfreid, José"}],"title":"Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence","status":"public","publication_status":"published","department":[{"_id":"BjHo"}],"publisher":"American Physical Society","intvolume":" 2","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"513","year":"2017"},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1608.03954v1"}],"oa":1,"citation":{"chicago":"Austin, Kyle, and Ziga Virk. “Higson Compactification and Dimension Raising.” Topology and Its Applications. Elsevier, 2017. https://doi.org/10.1016/j.topol.2016.10.005.","short":"K. Austin, Z. Virk, Topology and Its Applications 215 (2017) 45–57.","mla":"Austin, Kyle, and Ziga Virk. “Higson Compactification and Dimension Raising.” Topology and Its Applications, vol. 215, Elsevier, 2017, pp. 45–57, doi:10.1016/j.topol.2016.10.005.","ieee":"K. Austin and Z. Virk, “Higson compactification and dimension raising,” Topology and its Applications, vol. 215. Elsevier, pp. 45–57, 2017.","apa":"Austin, K., & Virk, Z. (2017). Higson compactification and dimension raising. Topology and Its Applications. Elsevier. https://doi.org/10.1016/j.topol.2016.10.005","ista":"Austin K, Virk Z. 2017. Higson compactification and dimension raising. Topology and its Applications. 215, 45–57.","ama":"Austin K, Virk Z. Higson compactification and dimension raising. Topology and its Applications. 2017;215:45-57. doi:10.1016/j.topol.2016.10.005"},"publication":"Topology and its Applications","page":"45 - 57","quality_controlled":"1","date_published":"2017-01-01T00:00:00Z","doi":"10.1016/j.topol.2016.10.005","language":[{"iso":"eng"}],"publication_identifier":{"issn":["01668641"]},"month":"01","day":"01","_id":"521","year":"2017","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Elsevier","department":[{"_id":"HeEd"}],"intvolume":" 215","title":"Higson compactification and dimension raising","status":"public","publication_status":"published","author":[{"full_name":"Austin, Kyle","last_name":"Austin","first_name":"Kyle"},{"id":"2E36B656-F248-11E8-B48F-1D18A9856A87","last_name":"Virk","first_name":"Ziga","full_name":"Virk, Ziga"}],"oa_version":"Submitted Version","volume":215,"date_created":"2018-12-11T11:46:56Z","date_updated":"2021-01-12T08:01:21Z","type":"journal_article","publist_id":"7299","abstract":[{"text":"Let X and Y be proper metric spaces. We show that a coarsely n-to-1 map f:X→Y induces an n-to-1 map of Higson coronas. This viewpoint turns out to be successful in showing that the classical dimension raising theorems hold in large scale; that is, if f:X→Y is a coarsely n-to-1 map between proper metric spaces X and Y then asdim(Y)≤asdim(X)+n−1. Furthermore we introduce coarsely open coarsely n-to-1 maps, which include the natural quotient maps via a finite group action, and prove that they preserve the asymptotic dimension.","lang":"eng"}]},{"publisher":"Springer","department":[{"_id":"UlWa"}],"publication_status":"published","year":"2017","volume":58,"date_created":"2018-12-11T11:47:01Z","date_updated":"2023-02-21T17:01:34Z","related_material":{"record":[{"id":"1379","relation":"earlier_version","status":"public"}]},"author":[{"full_name":"Burton, Benjamin","last_name":"Burton","first_name":"Benjamin"},{"id":"3DB2F25C-F248-11E8-B48F-1D18A9856A87","first_name":"Arnaud N","last_name":"De Mesmay","full_name":"De Mesmay, Arnaud N"},{"full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","first_name":"Uli"}],"publist_id":"7283","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.07907"}],"oa":1,"external_id":{"arxiv":["1602.07907"]},"language":[{"iso":"eng"}],"doi":"10.1007/s00454-017-9900-0","publication_identifier":{"issn":["01795376"]},"month":"06","intvolume":" 58","title":"Finding non-orientable surfaces in 3-Manifolds","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"534","oa_version":"Preprint","type":"journal_article","issue":"4","abstract":[{"text":"We investigate the complexity of finding an embedded non-orientable surface of Euler genus g in a triangulated 3-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance of embeddability of complexes into 3-manifolds. We prove that the problem is NP-hard, thus adding to the relatively few hardness results that are currently known in 3-manifold topology. In addition, we show that the problem lies in NP when the Euler genus g is odd, and we give an explicit algorithm in this case.","lang":"eng"}],"page":"871 - 888","article_type":"original","citation":{"chicago":"Burton, Benjamin, Arnaud N de Mesmay, and Uli Wagner. “Finding Non-Orientable Surfaces in 3-Manifolds.” Discrete & Computational Geometry. Springer, 2017. https://doi.org/10.1007/s00454-017-9900-0.","short":"B. Burton, A.N. de Mesmay, U. Wagner, Discrete & Computational Geometry 58 (2017) 871–888.","mla":"Burton, Benjamin, et al. “Finding Non-Orientable Surfaces in 3-Manifolds.” Discrete & Computational Geometry, vol. 58, no. 4, Springer, 2017, pp. 871–88, doi:10.1007/s00454-017-9900-0.","ieee":"B. Burton, A. N. de Mesmay, and U. Wagner, “Finding non-orientable surfaces in 3-Manifolds,” Discrete & Computational Geometry, vol. 58, no. 4. Springer, pp. 871–888, 2017.","apa":"Burton, B., de Mesmay, A. N., & Wagner, U. (2017). Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-017-9900-0","ista":"Burton B, de Mesmay AN, Wagner U. 2017. Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. 58(4), 871–888.","ama":"Burton B, de Mesmay AN, Wagner U. Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. 2017;58(4):871-888. doi:10.1007/s00454-017-9900-0"},"publication":"Discrete & Computational Geometry","date_published":"2017-06-09T00:00:00Z","scopus_import":1,"article_processing_charge":"No","day":"09"},{"issue":"16","abstract":[{"text":"Optogenetik und Photopharmakologie ermöglichen präzise räumliche und zeitliche Kontrolle von Proteinwechselwirkung und -funktion in Zellen und Tieren. Optogenetische Methoden, die auf grünes Licht ansprechen und zum Trennen von Proteinkomplexen geeignet sind, sind nichtweitläufig verfügbar, würden jedoch mehrfarbige Experimente zur Beantwortung von biologischen Fragestellungen ermöglichen. Hier demonstrieren wir die Verwendung von Cobalamin(Vitamin B12)-bindenden Domänen von bakteriellen CarH-Transkriptionsfaktoren zur Grünlicht-induzierten Dissoziation von Rezeptoren. Fusioniert mit dem Fibroblasten-W achstumsfaktor-Rezeptor 1 führten diese im Dunkeln in kultivierten Zellen zu Signalaktivität durch Oligomerisierung, welche durch Beleuchten umgehend aufgehoben wurde. In Zebrafischembryonen, die einen derartigen Rezeptor exprimieren, ermöglichte grünes Licht die Kontrolle über abnormale Signalaktivität während der Embryonalentwicklung. ","lang":"ger"}],"type":"journal_article","file":[{"access_level":"open_access","file_name":"IST-2018-932-v1+1_Kainrath_et_al-2017-Angewandte_Chemie.pdf","creator":"system","file_size":1668557,"content_type":"application/pdf","file_id":"5007","relation":"main_file","checksum":"d66fee867e7cdbfa3fe276c2fb0778bb","date_updated":"2020-07-14T12:46:39Z","date_created":"2018-12-12T10:13:24Z"}],"oa_version":"Published Version","pubrep_id":"932","intvolume":" 129","title":"Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen","ddc":["571"],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"538","has_accepted_license":"1","day":"20","date_published":"2017-05-20T00:00:00Z","page":"4679 - 4682","citation":{"chicago":"Kainrath, Stephanie, Manuela Stadler, Eva Gschaider-Reichhart, Martin Distel, and Harald L Janovjak. “Grünlicht-Induzierte Rezeptorinaktivierung Durch Cobalamin-Bindende Domänen.” Angewandte Chemie. Wiley, 2017. https://doi.org/10.1002/ange.201611998.","mla":"Kainrath, Stephanie, et al. “Grünlicht-Induzierte Rezeptorinaktivierung Durch Cobalamin-Bindende Domänen.” Angewandte Chemie, vol. 129, no. 16, Wiley, 2017, pp. 4679–82, doi:10.1002/ange.201611998.","short":"S. Kainrath, M. Stadler, E. Gschaider-Reichhart, M. Distel, H.L. Janovjak, Angewandte Chemie 129 (2017) 4679–4682.","ista":"Kainrath S, Stadler M, Gschaider-Reichhart E, Distel M, Janovjak HL. 2017. Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. Angewandte Chemie. 129(16), 4679–4682.","ieee":"S. Kainrath, M. Stadler, E. Gschaider-Reichhart, M. Distel, and H. L. Janovjak, “Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen,” Angewandte Chemie, vol. 129, no. 16. Wiley, pp. 4679–4682, 2017.","apa":"Kainrath, S., Stadler, M., Gschaider-Reichhart, E., Distel, M., & Janovjak, H. L. (2017). Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. Angewandte Chemie. Wiley. https://doi.org/10.1002/ange.201611998","ama":"Kainrath S, Stadler M, Gschaider-Reichhart E, Distel M, Janovjak HL. Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. Angewandte Chemie. 2017;129(16):4679-4682. doi:10.1002/ange.201611998"},"publication":"Angewandte Chemie","ec_funded":1,"publist_id":"7279","file_date_updated":"2020-07-14T12:46:39Z","volume":129,"date_created":"2018-12-11T11:47:02Z","date_updated":"2021-01-12T08:01:33Z","author":[{"first_name":"Stephanie","last_name":"Kainrath","id":"32CFBA64-F248-11E8-B48F-1D18A9856A87","full_name":"Kainrath, Stephanie"},{"first_name":"Manuela","last_name":"Stadler","full_name":"Stadler, Manuela"},{"full_name":"Gschaider-Reichhart, Eva","last_name":"Gschaider-Reichhart","first_name":"Eva","orcid":"0000-0002-7218-7738","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martin","last_name":"Distel","full_name":"Distel, Martin"},{"full_name":"Janovjak, Harald L","last_name":"Janovjak","first_name":"Harald L","orcid":"0000-0002-8023-9315","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"CaGu"},{"_id":"HaJa"}],"publisher":"Wiley","publication_status":"published","year":"2017","month":"05","language":[{"iso":"eng"}],"doi":"10.1002/ange.201611998","project":[{"_id":"25548C20-B435-11E9-9278-68D0E5697425","grant_number":"303564","name":"Microbial Ion Channels for Synthetic Neurobiology","call_identifier":"FP7"},{"grant_number":"W1232-B24","_id":"255A6082-B435-11E9-9278-68D0E5697425","name":"Molecular Drug Targets","call_identifier":"FWF"}],"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"}},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","doi":"10.1371/journal.ppat.1006758","language":[{"iso":"eng"}],"month":"12","publication_identifier":{"issn":["15537366"]},"year":"2017","publication_status":"published","publisher":"Public Library of Science","department":[{"_id":"GaNo"}],"author":[{"full_name":"Khamina, Kseniya","first_name":"Kseniya","last_name":"Khamina"},{"full_name":"Lercher, Alexander","last_name":"Lercher","first_name":"Alexander"},{"first_name":"Michael","last_name":"Caldera","full_name":"Caldera, Michael"},{"full_name":"Schliehe, Christopher","first_name":"Christopher","last_name":"Schliehe"},{"full_name":"Vilagos, Bojan","last_name":"Vilagos","first_name":"Bojan"},{"first_name":"Mehmet","last_name":"Sahin","full_name":"Sahin, Mehmet"},{"full_name":"Kosack, Lindsay","first_name":"Lindsay","last_name":"Kosack"},{"full_name":"Bhattacharya, Anannya","first_name":"Anannya","last_name":"Bhattacharya"},{"full_name":"Májek, Peter","last_name":"Májek","first_name":"Peter"},{"last_name":"Stukalov","first_name":"Alexey","full_name":"Stukalov, Alexey"},{"id":"42C9F57E-F248-11E8-B48F-1D18A9856A87","first_name":"Roberto","last_name":"Sacco","full_name":"Sacco, Roberto"},{"first_name":"Leo","last_name":"James","full_name":"James, Leo"},{"last_name":"Pinschewer","first_name":"Daniel","full_name":"Pinschewer, Daniel"},{"full_name":"Bennett, Keiryn","first_name":"Keiryn","last_name":"Bennett"},{"last_name":"Menche","first_name":"Jörg","full_name":"Menche, Jörg"},{"full_name":"Bergthaler, Andreas","last_name":"Bergthaler","first_name":"Andreas"}],"date_updated":"2021-01-12T08:01:48Z","date_created":"2018-12-11T11:47:03Z","volume":13,"article_number":"e1006758","file_date_updated":"2020-07-14T12:46:44Z","publist_id":"7276","publication":"PLoS Pathogens","citation":{"ista":"Khamina K, Lercher A, Caldera M, Schliehe C, Vilagos B, Sahin M, Kosack L, Bhattacharya A, Májek P, Stukalov A, Sacco R, James L, Pinschewer D, Bennett K, Menche J, Bergthaler A. 2017. Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. PLoS Pathogens. 13(12), e1006758.","apa":"Khamina, K., Lercher, A., Caldera, M., Schliehe, C., Vilagos, B., Sahin, M., … Bergthaler, A. (2017). Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. PLoS Pathogens. Public Library of Science. https://doi.org/10.1371/journal.ppat.1006758","ieee":"K. Khamina et al., “Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein,” PLoS Pathogens, vol. 13, no. 12. Public Library of Science, 2017.","ama":"Khamina K, Lercher A, Caldera M, et al. Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. PLoS Pathogens. 2017;13(12). doi:10.1371/journal.ppat.1006758","chicago":"Khamina, Kseniya, Alexander Lercher, Michael Caldera, Christopher Schliehe, Bojan Vilagos, Mehmet Sahin, Lindsay Kosack, et al. “Characterization of Host Proteins Interacting with the Lymphocytic Choriomeningitis Virus L Protein.” PLoS Pathogens. Public Library of Science, 2017. https://doi.org/10.1371/journal.ppat.1006758.","mla":"Khamina, Kseniya, et al. “Characterization of Host Proteins Interacting with the Lymphocytic Choriomeningitis Virus L Protein.” PLoS Pathogens, vol. 13, no. 12, e1006758, Public Library of Science, 2017, doi:10.1371/journal.ppat.1006758.","short":"K. Khamina, A. Lercher, M. Caldera, C. Schliehe, B. Vilagos, M. Sahin, L. Kosack, A. Bhattacharya, P. Májek, A. Stukalov, R. Sacco, L. James, D. Pinschewer, K. Bennett, J. Menche, A. Bergthaler, PLoS Pathogens 13 (2017)."},"date_published":"2017-12-01T00:00:00Z","scopus_import":1,"day":"01","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"540","status":"public","title":"Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein","ddc":["576","616"],"intvolume":" 13","pubrep_id":"931","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"IST-2018-931-v1+1_journal.ppat.1006758.pdf","file_size":4106772,"content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"4944","checksum":"1aa20f19a1e90664fadce6e7d5284fdc","date_updated":"2020-07-14T12:46:44Z","date_created":"2018-12-12T10:12:26Z"}],"type":"journal_article","abstract":[{"lang":"eng","text":"RNA-dependent RNA polymerases (RdRps) play a key role in the life cycle of RNA viruses and impact their immunobiology. The arenavirus lymphocytic choriomeningitis virus (LCMV) strain Clone 13 provides a benchmark model for studying chronic infection. A major genetic determinant for its ability to persist maps to a single amino acid exchange in the viral L protein, which exhibits RdRp activity, yet its functional consequences remain elusive. To unravel the L protein interactions with the host proteome, we engineered infectious L protein-tagged LCMV virions by reverse genetics. A subsequent mass-spectrometric analysis of L protein pulldowns from infected human cells revealed a comprehensive network of interacting host proteins. The obtained LCMV L protein interactome was bioinformatically integrated with known host protein interactors of RdRps from other RNA viruses, emphasizing interconnected modules of human proteins. Functional characterization of selected interactors highlighted proviral (DDX3X) as well as antiviral (NKRF, TRIM21) host factors. To corroborate these findings, we infected Trim21-/-mice with LCMV and found impaired virus control in chronic infection. These results provide insights into the complex interactions of the arenavirus LCMV and other viral RdRps with the host proteome and contribute to a better molecular understanding of how chronic viruses interact with their host."}],"issue":"12"}]