[{"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2018-12-12T10:10:22Z","citation":{"short":"J. O’Neill, C.N. Boccara, F. Stella, P. Schönenberger, J.L. Csicsvari, Science 355 (2017) 184–188.","ama":"O’Neill J, Boccara CN, Stella F, Schönenberger P, Csicsvari JL. Superficial layers of the medial entorhinal cortex replay independently of the hippocampus. <i>Science</i>. 2017;355(6321):184-188. doi:<a href=\"https://doi.org/10.1126/science.aag2787\">10.1126/science.aag2787</a>","mla":"O’Neill, Joseph, et al. “Superficial Layers of the Medial Entorhinal Cortex Replay Independently of the Hippocampus.” <i>Science</i>, vol. 355, no. 6321, American Association for the Advancement of Science, 2017, pp. 184–88, doi:<a href=\"https://doi.org/10.1126/science.aag2787\">10.1126/science.aag2787</a>.","ista":"O’Neill J, Boccara CN, Stella F, Schönenberger P, Csicsvari JL. 2017. Superficial layers of the medial entorhinal cortex replay independently of the hippocampus. Science. 355(6321), 184–188.","apa":"O’Neill, J., Boccara, C. N., Stella, F., Schönenberger, P., &#38; Csicsvari, J. L. (2017). Superficial layers of the medial entorhinal cortex replay independently of the hippocampus. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.aag2787\">https://doi.org/10.1126/science.aag2787</a>","chicago":"O’Neill, Joseph, Charlotte N. Boccara, Federico Stella, Philipp Schönenberger, and Jozsef L Csicsvari. “Superficial Layers of the Medial Entorhinal Cortex Replay Independently of the Hippocampus.” <i>Science</i>. American Association for the Advancement of Science, 2017. <a href=\"https://doi.org/10.1126/science.aag2787\">https://doi.org/10.1126/science.aag2787</a>.","ieee":"J. O’Neill, C. N. Boccara, F. Stella, P. Schönenberger, and J. L. Csicsvari, “Superficial layers of the medial entorhinal cortex replay independently of the hippocampus,” <i>Science</i>, vol. 355, no. 6321. American Association for the Advancement of Science, pp. 184–188, 2017."},"publist_id":"6226","publication_identifier":{"issn":["0036-8075"]},"doi":"10.1126/science.aag2787","has_accepted_license":"1","oa":1,"external_id":{"isi":["000391743700044"]},"date_updated":"2025-07-10T11:50:09Z","department":[{"_id":"JoCs"}],"publication":"Science","volume":355,"month":"01","_id":"1132","intvolume":"       355","abstract":[{"lang":"eng","text":"The hippocampus is thought to initiate systems-wide mnemonic processes through the reactivation of previously acquired spatial and episodic memory traces, which can recruit the entorhinal cortex as a first stage of memory redistribution to other brain areas. Hippocampal reactivation occurs during sharp wave-ripples, in which synchronous network firing encodes sequences of places.We investigated the coordination of this replay by recording assembly activity simultaneously in the CA1 region of the hippocampus and superficial layers of the medial entorhinal cortex. We found that entorhinal cell assemblies can replay trajectories independently of the hippocampus and sharp wave-ripples. This suggests that the hippocampus is not the sole initiator of spatial and episodic memory trace reactivation. Memory systems involved in these processes may include nonhierarchical, parallel components."}],"file":[{"creator":"system","content_type":"application/pdf","date_created":"2018-12-12T10:10:22Z","file_size":3761201,"file_id":"4809","access_level":"open_access","date_updated":"2018-12-12T10:10:22Z","relation":"main_file","file_name":"IST-2018-976-v1+1_2017Preprint_ONeill_Superficial_layers.pdf"}],"oa_version":"Submitted Version","ec_funded":1,"title":"Superficial layers of the medial entorhinal cortex replay independently of the hippocampus","article_processing_charge":"No","year":"2017","author":[{"first_name":"Joseph","full_name":"O'Neill, Joseph","id":"426376DC-F248-11E8-B48F-1D18A9856A87","last_name":"O'Neill"},{"full_name":"Boccara, Charlotte","first_name":"Charlotte","id":"3FC06552-F248-11E8-B48F-1D18A9856A87","last_name":"Boccara","orcid":"0000-0001-7237-5109"},{"first_name":"Federico","full_name":"Stella, Federico","last_name":"Stella","id":"39AF1E74-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9439-3148"},{"full_name":"Schönenberger, Philipp","first_name":"Philipp","id":"3B9D816C-F248-11E8-B48F-1D18A9856A87","last_name":"Schönenberger"},{"orcid":"0000-0002-5193-4036","last_name":"Csicsvari","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","full_name":"Csicsvari, Jozsef L"}],"project":[{"name":"Memory-related information processing in neuronal circuits of the hippocampus and entorhinal cortex","grant_number":"281511","call_identifier":"FP7","_id":"257A4776-B435-11E9-9278-68D0E5697425"}],"date_created":"2018-12-11T11:50:19Z","status":"public","publisher":"American Association for the Advancement of Science","publication_status":"published","issue":"6321","date_published":"2017-01-13T00:00:00Z","pubrep_id":"976","scopus_import":"1","language":[{"iso":"eng"}],"isi":1,"type":"journal_article","ddc":["571"],"day":"13","page":"184 - 188"},{"date_published":"2017-02-22T00:00:00Z","issue":"8","type":"journal_article","day":"22","language":[{"iso":"eng"}],"isi":1,"scopus_import":"1","year":"2017","author":[{"orcid":"0000-0001-5973-0874","last_name":"Yakaboylu","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","first_name":"Enderalp","full_name":"Yakaboylu, Enderalp"},{"last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","full_name":"Lemeshko, Mikhail","first_name":"Mikhail","orcid":"0000-0002-6990-7802"}],"arxiv":1,"ec_funded":1,"oa_version":"Submitted Version","title":"Anomalous screening of quantum impurities by a neutral environment","article_processing_charge":"No","publication_status":"published","publisher":"American Physical Society","status":"public","date_created":"2018-12-11T11:50:19Z","project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"},{"_id":"26031614-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P29902","name":"Quantum rotations in the presence of a many-body environment"}],"external_id":{"arxiv":["1612.02820"],"isi":["000394667600003"]},"date_updated":"2025-06-04T08:38:44Z","oa":1,"_id":"1133","intvolume":"       118","abstract":[{"lang":"eng","text":"It is a common knowledge that an effective interaction of a quantum impurity with an electromagnetic field can be screened by surrounding charge carriers, whether mobile or static. Here we demonstrate that very strong, \"anomalous\" screening can take place in the presence of a neutral, weakly polarizable environment, due to an exchange of orbital angular momentum between the impurity and the bath. Furthermore, we show that it is possible to generalize all phenomena related to isolated impurities in an external field to the case when a many-body environment is present, by casting the problem in terms of the angulon quasiparticle. As a result, the relevant observables such as the effective Rabi frequency, geometric phase, and impurity spatial alignment are straightforward to evaluate in terms of a single parameter: the angular-momentum-dependent screening factor."}],"month":"02","volume":118,"department":[{"_id":"MiLe"}],"publication":"Physical Review Letters","citation":{"ieee":"E. Yakaboylu and M. Lemeshko, “Anomalous screening of quantum impurities by a neutral environment,” <i>Physical Review Letters</i>, vol. 118, no. 8. American Physical Society, 2017.","apa":"Yakaboylu, E., &#38; Lemeshko, M. (2017). Anomalous screening of quantum impurities by a neutral environment. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.118.085302\">https://doi.org/10.1103/PhysRevLett.118.085302</a>","ista":"Yakaboylu E, Lemeshko M. 2017. Anomalous screening of quantum impurities by a neutral environment. Physical Review Letters. 118(8), 085302.","mla":"Yakaboylu, Enderalp, and Mikhail Lemeshko. “Anomalous Screening of Quantum Impurities by a Neutral Environment.” <i>Physical Review Letters</i>, vol. 118, no. 8, 085302, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.118.085302\">10.1103/PhysRevLett.118.085302</a>.","chicago":"Yakaboylu, Enderalp, and Mikhail Lemeshko. “Anomalous Screening of Quantum Impurities by a Neutral Environment.” <i>Physical Review Letters</i>. American Physical Society, 2017. <a href=\"https://doi.org/10.1103/PhysRevLett.118.085302\">https://doi.org/10.1103/PhysRevLett.118.085302</a>.","ama":"Yakaboylu E, Lemeshko M. Anomalous screening of quantum impurities by a neutral environment. <i>Physical Review Letters</i>. 2017;118(8). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.118.085302\">10.1103/PhysRevLett.118.085302</a>","short":"E. Yakaboylu, M. Lemeshko, Physical Review Letters 118 (2017)."},"article_number":"085302","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1612.02820"}],"quality_controlled":"1","doi":"10.1103/PhysRevLett.118.085302","publication_identifier":{"issn":["0031-9007"]},"publist_id":"6225"},{"date_published":"2017-08-01T00:00:00Z","day":"01","page":"1905 - 1914","type":"conference","isi":1,"language":[{"iso":"eng"}],"scopus_import":"1","author":[{"first_name":"Alexander","full_name":"Kolesnikov, Alexander","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87","last_name":"Kolesnikov"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","full_name":"Lampert, Christoph","first_name":"Christoph","orcid":"0000-0001-8622-7887"}],"year":"2017","arxiv":1,"title":"PixelCNN models with auxiliary variables for natural image modeling","article_processing_charge":"No","ec_funded":1,"oa_version":"Submitted Version","publication_status":"published","publisher":"JMLR","acknowledgement":"We thank Tim Salimans for spotting a mistake in our preliminary arXiv manuscript. This work was funded by the European Research Council under the European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 308036.","date_created":"2018-12-11T11:49:37Z","status":"public","project":[{"grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"date_updated":"2025-04-15T07:10:22Z","external_id":{"arxiv":["1612.08185"],"isi":["000683309501102"]},"oa":1,"abstract":[{"text":"We study probabilistic models of natural images and extend the autoregressive family of PixelCNN models by incorporating latent variables. Subsequently, we describe two new generative image models that exploit different image transformations as latent variables: a quantized grayscale view of the image or a multi-resolution image pyramid. The proposed models tackle two known shortcomings of existing PixelCNN models: 1) their tendency to focus on low-level image details, while largely ignoring high-level image information, such as object shapes, and 2) their computationally costly procedure for image sampling. We experimentally demonstrate benefits of our LatentPixelCNN models, in particular showing that they produce much more realistically looking image samples than previous state-of-the-art probabilistic models. ","lang":"eng"}],"_id":"1000","intvolume":"        70","month":"08","volume":70,"publication":"34th International Conference on Machine Learning","department":[{"_id":"ChLa"}],"citation":{"ama":"Kolesnikov A, Lampert C. PixelCNN models with auxiliary variables for natural image modeling. In: <i>34th International Conference on Machine Learning</i>. Vol 70. JMLR; 2017:1905-1914.","short":"A. Kolesnikov, C. Lampert, in:, 34th International Conference on Machine Learning, JMLR, 2017, pp. 1905–1914.","ieee":"A. Kolesnikov and C. Lampert, “PixelCNN models with auxiliary variables for natural image modeling,” in <i>34th International Conference on Machine Learning</i>, Sydney, Australia, 2017, vol. 70, pp. 1905–1914.","apa":"Kolesnikov, A., &#38; Lampert, C. (2017). PixelCNN models with auxiliary variables for natural image modeling. In <i>34th International Conference on Machine Learning</i> (Vol. 70, pp. 1905–1914). Sydney, Australia: JMLR.","mla":"Kolesnikov, Alexander, and Christoph Lampert. “PixelCNN Models with Auxiliary Variables for Natural Image Modeling.” <i>34th International Conference on Machine Learning</i>, vol. 70, JMLR, 2017, pp. 1905–14.","ista":"Kolesnikov A, Lampert C. 2017. PixelCNN models with auxiliary variables for natural image modeling. 34th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 70, 1905–1914.","chicago":"Kolesnikov, Alexander, and Christoph Lampert. “PixelCNN Models with Auxiliary Variables for Natural Image Modeling.” In <i>34th International Conference on Machine Learning</i>, 70:1905–14. JMLR, 2017."},"main_file_link":[{"url":"https://arxiv.org/abs/1612.08185","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"start_date":"2017-08-06","end_date":"2017-08-11","name":"ICML: International Conference on Machine Learning","location":"Sydney, Australia"},"quality_controlled":"1","has_accepted_license":"1","publist_id":"6398","publication_identifier":{"isbn":["978-151085514-4"]}},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2018-12-12T10:16:58Z","citation":{"chicago":"Avni, Guy, Shibashis Guha, and Orna Kupferman. “An Abstraction-Refinement Methodology for Reasoning about Network Games,” 70–76. AAAI Press, 2017. <a href=\"https://doi.org/10.24963/ijcai.2017/11\">https://doi.org/10.24963/ijcai.2017/11</a>.","ista":"Avni G, Guha S, Kupferman O. 2017. An abstraction-refinement methodology for reasoning about network games. IJCAI: International Joint Conference on Artificial Intelligence , 70–76.","apa":"Avni, G., Guha, S., &#38; Kupferman, O. (2017). An abstraction-refinement methodology for reasoning about network games (pp. 70–76). Presented at the IJCAI: International Joint Conference on Artificial Intelligence , Melbourne, Australia: AAAI Press. <a href=\"https://doi.org/10.24963/ijcai.2017/11\">https://doi.org/10.24963/ijcai.2017/11</a>","mla":"Avni, Guy, et al. <i>An Abstraction-Refinement Methodology for Reasoning about Network Games</i>. AAAI Press, 2017, pp. 70–76, doi:<a href=\"https://doi.org/10.24963/ijcai.2017/11\">10.24963/ijcai.2017/11</a>.","ieee":"G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology for reasoning about network games,” presented at the IJCAI: International Joint Conference on Artificial Intelligence , Melbourne, Australia, 2017, pp. 70–76.","short":"G. Avni, S. Guha, O. Kupferman, in:, AAAI Press, 2017, pp. 70–76.","ama":"Avni G, Guha S, Kupferman O. An abstraction-refinement methodology for reasoning about network games. In: AAAI Press; 2017:70-76. doi:<a href=\"https://doi.org/10.24963/ijcai.2017/11\">10.24963/ijcai.2017/11</a>"},"quality_controlled":"1","conference":{"location":"Melbourne, Australia","end_date":"2017-08-25","name":"IJCAI: International Joint Conference on Artificial Intelligence ","start_date":"2017-08-19"},"doi":"10.24963/ijcai.2017/11","has_accepted_license":"1","publication_identifier":{"issn":["1045-0823"]},"publist_id":"6395","external_id":{"isi":["000764137500011"]},"related_material":{"record":[{"relation":"later_version","id":"6006","status":"public"}]},"date_updated":"2025-07-10T11:49:38Z","oa":1,"month":"05","_id":"1003","abstract":[{"lang":"eng","text":"Network games (NGs) are played on directed graphs and are extensively used in network design and analysis. Search problems for NGs include finding special strategy profiles such as a Nash equilibrium and a globally optimal solution. The networks modeled by NGs may be huge. In formal verification, abstraction has proven to be an extremely effective technique for reasoning about systems with big and even infinite state spaces. We describe an abstraction-refinement methodology for reasoning about NGs. Our methodology is based on an abstraction function that maps the state space of an NG to a much smaller state space. We search for a global optimum and a Nash equilibrium by reasoning on an under- and an overapproximation defined on top of this smaller state space. When the approximations are too coarse to find such profiles, we refine the abstraction function. Our experimental results demonstrate the efficiency of the methodology."}],"file":[{"access_level":"open_access","date_updated":"2018-12-12T10:16:58Z","relation":"main_file","file_name":"IST-2017-818-v1+1_allIJCAI_CR.pdf","creator":"system","file_size":365172,"date_created":"2018-12-12T10:16:58Z","content_type":"application/pdf","file_id":"5249"}],"department":[{"_id":"ToHe"}],"year":"2017","author":[{"orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","full_name":"Avni, Guy","first_name":"Guy"},{"first_name":"Shibashis","full_name":"Guha, Shibashis","last_name":"Guha"},{"last_name":"Kupferman","first_name":"Orna","full_name":"Kupferman, Orna"}],"oa_version":"Submitted Version","article_processing_charge":"No","title":"An abstraction-refinement methodology for reasoning about network games","publisher":"AAAI Press","publication_status":"published","project":[{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"}],"status":"public","date_created":"2018-12-11T11:49:38Z","date_published":"2017-05-30T00:00:00Z","pubrep_id":"818","type":"conference","day":"30","ddc":["004"],"page":"70 - 76","scopus_import":"1","language":[{"iso":"eng"}],"isi":1},{"month":"04","file":[{"creator":"system","file_id":"5236","date_created":"2018-12-12T10:16:46Z","file_size":2379672,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-12-12T10:16:46Z","access_level":"open_access","file_name":"IST-2017-814-v1+1_s12864-017-3705-7.pdf"}],"intvolume":"        18","_id":"1006","abstract":[{"text":"Background: The phenomenon of immune priming, i.e. enhanced protection following a secondary exposure to a pathogen, has now been demonstrated in a wide range of invertebrate species. Despite accumulating phenotypic evidence, knowledge of its mechanistic underpinnings is currently very limited. Here we used the system of the red flour beetle, Tribolium castaneum and the insect pathogen Bacillus thuringiensis (Bt) to further our molecular understanding of the oral immune priming phenomenon. We addressed how ingestion of bacterial cues (derived from spore supernatants) of an orally pathogenic and non-pathogenic Bt strain affects gene expression upon later challenge exposure, using a whole-transcriptome sequencing approach. Results: Whereas gene expression of individuals primed with the orally non-pathogenic strain showed minor changes to controls, we found that priming with the pathogenic strain induced regulation of a large set of distinct genes, many of which are known immune candidates. Intriguingly, the immune repertoire activated upon priming and subsequent challenge qualitatively differed from the one mounted upon infection with Bt without previous priming. Moreover, a large subset of priming-specific genes showed an inverse regulation compared to their regulation upon challenge only. Conclusions: Our data demonstrate that gene expression upon infection is strongly affected by previous immune priming. We hypothesise that this shift in gene expression indicates activation of a more targeted and efficient response towards a previously encountered pathogen, in anticipation of potential secondary encounter.","lang":"eng"}],"publication":"BMC Genomics","department":[{"_id":"SyCr"}],"volume":18,"date_updated":"2025-07-10T11:49:40Z","related_material":{"record":[{"status":"public","id":"9859","relation":"research_data"},{"id":"9860","relation":"research_data","status":"public"}]},"external_id":{"isi":["000400625200004"]},"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"has_accepted_license":"1","doi":"10.1186/s12864-017-3705-7","publist_id":"6392","publication_identifier":{"issn":["1471-2164"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2018-12-12T10:16:46Z","citation":{"apa":"Greenwood, J., Milutinovic, B., Peuß, R., Behrens, S., Essar, D., Rosenstiel, P., … Kurtz, J. (2017). Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae. <i>BMC Genomics</i>. BioMed Central. <a href=\"https://doi.org/10.1186/s12864-017-3705-7\">https://doi.org/10.1186/s12864-017-3705-7</a>","ista":"Greenwood J, Milutinovic B, Peuß R, Behrens S, Essar D, Rosenstiel P, Schulenburg H, Kurtz J. 2017. Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae. BMC Genomics. 18(1), 329.","mla":"Greenwood, Jenny, et al. “Oral Immune Priming with Bacillus Thuringiensis Induces a Shift in the Gene Expression of Tribolium Castaneum Larvae.” <i>BMC Genomics</i>, vol. 18, no. 1, BioMed Central, 2017, p. 329, doi:<a href=\"https://doi.org/10.1186/s12864-017-3705-7\">10.1186/s12864-017-3705-7</a>.","chicago":"Greenwood, Jenny, Barbara Milutinovic, Robert Peuß, Sarah Behrens, Daniela Essar, Philip Rosenstiel, Hinrich Schulenburg, and Joachim Kurtz. “Oral Immune Priming with Bacillus Thuringiensis Induces a Shift in the Gene Expression of Tribolium Castaneum Larvae.” <i>BMC Genomics</i>. BioMed Central, 2017. <a href=\"https://doi.org/10.1186/s12864-017-3705-7\">https://doi.org/10.1186/s12864-017-3705-7</a>.","ieee":"J. Greenwood <i>et al.</i>, “Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae,” <i>BMC Genomics</i>, vol. 18, no. 1. BioMed Central, p. 329, 2017.","short":"J. Greenwood, B. Milutinovic, R. Peuß, S. Behrens, D. Essar, P. Rosenstiel, H. Schulenburg, J. Kurtz, BMC Genomics 18 (2017) 329.","ama":"Greenwood J, Milutinovic B, Peuß R, et al. Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae. <i>BMC Genomics</i>. 2017;18(1):329. doi:<a href=\"https://doi.org/10.1186/s12864-017-3705-7\">10.1186/s12864-017-3705-7</a>"},"quality_controlled":"1","day":"26","ddc":["570"],"page":"329","type":"journal_article","scopus_import":"1","isi":1,"language":[{"iso":"eng"}],"pubrep_id":"814","date_published":"2017-04-26T00:00:00Z","issue":"1","publisher":"BioMed Central","publication_status":"published","status":"public","date_created":"2018-12-11T11:49:39Z","author":[{"first_name":"Jenny","full_name":"Greenwood, Jenny","last_name":"Greenwood"},{"first_name":"Barbara","full_name":"Milutinovic, Barbara","last_name":"Milutinovic","id":"2CDC32B8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8214-4758"},{"first_name":"Robert","full_name":"Peuß, Robert","last_name":"Peuß"},{"first_name":"Sarah","full_name":"Behrens, Sarah","last_name":"Behrens"},{"last_name":"Essar","first_name":"Daniela","full_name":"Essar, Daniela"},{"first_name":"Philip","full_name":"Rosenstiel, Philip","last_name":"Rosenstiel"},{"full_name":"Schulenburg, Hinrich","first_name":"Hinrich","last_name":"Schulenburg"},{"full_name":"Kurtz, Joachim","first_name":"Joachim","last_name":"Kurtz"}],"year":"2017","title":"Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae","article_processing_charge":"No","oa_version":"Published Version"},{"pubrep_id":"813","date_published":"2017-06-01T00:00:00Z","type":"journal_article","page":"46 - 55","day":"01","ddc":["000"],"language":[{"iso":"eng"}],"isi":1,"scopus_import":"1","year":"2017","author":[{"id":"29E0800A-F248-11E8-B48F-1D18A9856A87","last_name":"Lang","first_name":"Moritz","full_name":"Lang, Moritz"},{"full_name":"Sontag, Eduardo","first_name":"Eduardo","last_name":"Sontag"}],"ec_funded":1,"oa_version":"Published Version","article_processing_charge":"Yes (in subscription journal)","title":"Zeros of nonlinear systems with input invariances","publication_status":"published","publisher":"International Federation of Automatic Control","date_created":"2018-12-11T11:49:39Z","status":"public","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"external_id":{"isi":["000403513900006"]},"date_updated":"2025-04-15T06:50:01Z","oa":1,"_id":"1007","abstract":[{"lang":"eng","text":"A nonlinear system possesses an invariance with respect to a set of transformations if its output dynamics remain invariant when transforming the input, and adjusting the initial condition accordingly. Most research has focused on invariances with respect to time-independent pointwise transformations like translational-invariance (u(t) -&gt; u(t) + p, p in R) or scale-invariance (u(t) -&gt; pu(t), p in R&gt;0). In this article, we introduce the concept of s0-invariances with respect to continuous input transformations exponentially growing/decaying over time. We show that s0-invariant systems not only encompass linear time-invariant (LTI) systems with transfer functions having an irreducible zero at s0 in R, but also that the input/output relationship of nonlinear s0-invariant systems possesses properties well known from their linear counterparts. Furthermore, we extend the concept of s0-invariances to second- and higher-order s0-invariances, corresponding to invariances with respect to transformations of the time-derivatives of the input, and encompassing LTI systems with zeros of multiplicity two or higher. Finally, we show that nth-order 0-invariant systems realize – under mild conditions – nth-order nonlinear differential operators: when excited by an input of a characteristic functional form, the system’s output converges to a constant value only depending on the nth (nonlinear) derivative of the input."}],"file":[{"access_level":"open_access","date_updated":"2018-12-12T10:11:29Z","relation":"main_file","file_name":"IST-2017-813-v1+1_ZerosOfNonlinearSystems.pdf","creator":"system","content_type":"application/pdf","file_size":1401954,"date_created":"2018-12-12T10:11:29Z","file_id":"4884"}],"month":"06","volume":"81C","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"publication":"Automatica","file_date_updated":"2018-12-12T10:11:29Z","citation":{"ama":"Lang M, Sontag E. Zeros of nonlinear systems with input invariances. <i>Automatica</i>. 2017;81C:46-55. doi:<a href=\"https://doi.org/10.1016/j.automatica.2017.03.030\">10.1016/j.automatica.2017.03.030</a>","short":"M. Lang, E. Sontag, Automatica 81C (2017) 46–55.","ieee":"M. Lang and E. Sontag, “Zeros of nonlinear systems with input invariances,” <i>Automatica</i>, vol. 81C. International Federation of Automatic Control, pp. 46–55, 2017.","chicago":"Lang, Moritz, and Eduardo Sontag. “Zeros of Nonlinear Systems with Input Invariances.” <i>Automatica</i>. International Federation of Automatic Control, 2017. <a href=\"https://doi.org/10.1016/j.automatica.2017.03.030\">https://doi.org/10.1016/j.automatica.2017.03.030</a>.","mla":"Lang, Moritz, and Eduardo Sontag. “Zeros of Nonlinear Systems with Input Invariances.” <i>Automatica</i>, vol. 81C, International Federation of Automatic Control, 2017, pp. 46–55, doi:<a href=\"https://doi.org/10.1016/j.automatica.2017.03.030\">10.1016/j.automatica.2017.03.030</a>.","apa":"Lang, M., &#38; Sontag, E. (2017). Zeros of nonlinear systems with input invariances. <i>Automatica</i>. International Federation of Automatic Control. <a href=\"https://doi.org/10.1016/j.automatica.2017.03.030\">https://doi.org/10.1016/j.automatica.2017.03.030</a>","ista":"Lang M, Sontag E. 2017. Zeros of nonlinear systems with input invariances. Automatica. 81C, 46–55."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","doi":"10.1016/j.automatica.2017.03.030","has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_identifier":{"issn":["0005-1098"]},"publist_id":"6391"},{"volume":5,"department":[{"_id":"KrCh"}],"publication":"Proceedings of the 31st AAAI Conference on Artificial Intelligence","_id":"1009","abstract":[{"lang":"eng","text":"A standard objective in partially-observable Markov decision processes (POMDPs) is to find a policy that maximizes the expected discounted-sum payoff. However, such policies may still permit unlikely but highly undesirable outcomes, which is problematic especially in safety-critical applications. Recently, there has been a surge of interest in POMDPs where the goal is to maximize the probability to ensure that the payoff is at least a given threshold, but these approaches do not consider any optimization beyond satisfying this threshold constraint. In this work we go beyond both the “expectation” and “threshold” approaches and consider a “guaranteed payoff optimization (GPO)” problem for POMDPs, where we are given a threshold t and the objective is to find a policy σ such that a) each possible outcome of σ yields a discounted-sum payoff of at least t, and b) the expected discounted-sum payoff of σ is optimal (or near-optimal) among all policies satisfying a). We present a practical approach to tackle the GPO problem and evaluate it on standard POMDP benchmarks."}],"intvolume":"         5","month":"01","oa":1,"external_id":{"isi":["000485630703107"]},"date_updated":"2025-04-14T13:51:03Z","publist_id":"6387","conference":{"name":"AAAI: Conference on Artificial Intelligence","end_date":"2017-02-10","start_date":"2017-02-04","location":"San Francisco, CA, United States"},"quality_controlled":"1","citation":{"ama":"Chatterjee K, Novotný P, Pérez G, Raskin J, Zikelic D. Optimizing expectation with guarantees in POMDPs. In: <i>Proceedings of the 31st AAAI Conference on Artificial Intelligence</i>. Vol 5. AAAI Press; 2017:3725-3732.","short":"K. Chatterjee, P. Novotný, G. Pérez, J. Raskin, D. Zikelic, in:, Proceedings of the 31st AAAI Conference on Artificial Intelligence, AAAI Press, 2017, pp. 3725–3732.","ieee":"K. Chatterjee, P. Novotný, G. Pérez, J. Raskin, and D. Zikelic, “Optimizing expectation with guarantees in POMDPs,” in <i>Proceedings of the 31st AAAI Conference on Artificial Intelligence</i>, San Francisco, CA, United States, 2017, vol. 5, pp. 3725–3732.","chicago":"Chatterjee, Krishnendu, Petr Novotný, Guillermo Pérez, Jean Raskin, and Djordje Zikelic. “Optimizing Expectation with Guarantees in POMDPs.” In <i>Proceedings of the 31st AAAI Conference on Artificial Intelligence</i>, 5:3725–32. AAAI Press, 2017.","apa":"Chatterjee, K., Novotný, P., Pérez, G., Raskin, J., &#38; Zikelic, D. (2017). Optimizing expectation with guarantees in POMDPs. In <i>Proceedings of the 31st AAAI Conference on Artificial Intelligence</i> (Vol. 5, pp. 3725–3732). San Francisco, CA, United States: AAAI Press.","mla":"Chatterjee, Krishnendu, et al. “Optimizing Expectation with Guarantees in POMDPs.” <i>Proceedings of the 31st AAAI Conference on Artificial Intelligence</i>, vol. 5, AAAI Press, 2017, pp. 3725–32.","ista":"Chatterjee K, Novotný P, Pérez G, Raskin J, Zikelic D. 2017. Optimizing expectation with guarantees in POMDPs. Proceedings of the 31st AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 5, 3725–3732."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","main_file_link":[{"open_access":"1","url":"http://www.aaai.org/ocs/index.php/AAAI/AAAI17/paper/download/14354/14092"}],"language":[{"iso":"eng"}],"isi":1,"scopus_import":"1","type":"conference","day":"01","page":"3725 - 3732","date_published":"2017-01-01T00:00:00Z","status":"public","date_created":"2018-12-11T11:49:40Z","acknowledgement":"he research leading to these results was supported by the Austrian Science Fund (FWF) NFN Grant no. S11407-N23 (RiSE/SHiNE); two ERC Starting grants (279307: Graph Games, 279499: inVEST); the Vienna Science and Tech- nology Fund (WWTF) through project ICT15-003; and the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. [291734].","project":[{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"}],"publication_status":"published","publisher":"AAAI Press","oa_version":"Submitted Version","ec_funded":1,"title":"Optimizing expectation with guarantees in POMDPs","article_processing_charge":"No","year":"2017","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Novotny, Petr","first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotny"},{"last_name":"Pérez","first_name":"Guillermo","full_name":"Pérez, Guillermo"},{"first_name":"Jean","full_name":"Raskin, Jean","last_name":"Raskin"},{"last_name":"Zikelic","first_name":"Djordje","full_name":"Zikelic, Djordje"}]},{"publist_id":"6384","publication_identifier":{"issn":["0302-9743"]},"doi":"10.1007/978-3-662-54434-1_11","quality_controlled":"1","conference":{"location":"Uppsala, Sweden","end_date":"2017-04-29","name":"ESOP: European Symposium on Programming","start_date":"2017-04-22"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1701.04914"}],"citation":{"ama":"Chatterjee K, Kragl B, Mishra S, Pavlogiannis A. Faster algorithms for weighted recursive state machines. In: Yang H, ed. Vol 10201. Springer; 2017:287-313. doi:<a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">10.1007/978-3-662-54434-1_11</a>","short":"K. Chatterjee, B. Kragl, S. Mishra, A. Pavlogiannis, in:, H. Yang (Ed.), Springer, 2017, pp. 287–313.","ieee":"K. Chatterjee, B. Kragl, S. Mishra, and A. Pavlogiannis, “Faster algorithms for weighted recursive state machines,” presented at the ESOP: European Symposium on Programming, Uppsala, Sweden, 2017, vol. 10201, pp. 287–313.","chicago":"Chatterjee, Krishnendu, Bernhard Kragl, Samarth Mishra, and Andreas Pavlogiannis. “Faster Algorithms for Weighted Recursive State Machines.” edited by Hongseok Yang, 10201:287–313. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">https://doi.org/10.1007/978-3-662-54434-1_11</a>.","apa":"Chatterjee, K., Kragl, B., Mishra, S., &#38; Pavlogiannis, A. (2017). Faster algorithms for weighted recursive state machines. In H. Yang (Ed.) (Vol. 10201, pp. 287–313). Presented at the ESOP: European Symposium on Programming, Uppsala, Sweden: Springer. <a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">https://doi.org/10.1007/978-3-662-54434-1_11</a>","mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Weighted Recursive State Machines</i>. Edited by Hongseok Yang, vol. 10201, Springer, 2017, pp. 287–313, doi:<a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">10.1007/978-3-662-54434-1_11</a>.","ista":"Chatterjee K, Kragl B, Mishra S, Pavlogiannis A. 2017. Faster algorithms for weighted recursive state machines. ESOP: European Symposium on Programming, LNCS, vol. 10201, 287–313."},"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"volume":10201,"month":"03","abstract":[{"lang":"eng","text":"Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly equivalent, are standard models for interprocedural analysis. Yet RSMs are more convenient as they (a) explicitly model function calls and returns, and (b) specify many natural parameters for algorithmic analysis, e.g., the number of entries and exits. We consider a general framework where RSM transitions are labeled from a semiring and path properties are algebraic with semiring operations, which can model, e.g., interprocedural reachability and dataflow analysis problems. Our main contributions are new algorithms for several fundamental problems. As compared to a direct translation of RSMs to PDSs and the best-known existing bounds of PDSs, our analysis algorithm improves the complexity for finite-height semirings (that subsumes reachability and standard dataflow properties). We further consider the problem of extracting distance values from the representation structures computed by our algorithm, and give efficient algorithms that distinguish the complexity of a one-time preprocessing from the complexity of each individual query. Another advantage of our algorithm is that our improvements carry over to the concurrent setting, where we improve the bestknown complexity for the context-bounded analysis of concurrent RSMs. Finally, we provide a prototype implementation that gives a significant speed-up on several benchmarks from the SLAM/SDV project."}],"_id":"1011","intvolume":"     10201","oa":1,"external_id":{"arxiv":["1701.04914"],"isi":["000681702400011"]},"date_updated":"2025-06-04T08:09:18Z","alternative_title":["LNCS"],"project":[{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"status":"public","date_created":"2018-12-11T11:49:41Z","publisher":"Springer","publication_status":"published","oa_version":"Submitted Version","ec_funded":1,"article_processing_charge":"No","title":"Faster algorithms for weighted recursive state machines","arxiv":1,"year":"2017","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-7745-9117","full_name":"Kragl, Bernhard","first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","last_name":"Kragl"},{"last_name":"Mishra","full_name":"Mishra, Samarth","first_name":"Samarth"},{"first_name":"Andreas","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722"}],"scopus_import":"1","language":[{"iso":"eng"}],"isi":1,"type":"conference","page":"287 - 313","day":"19","editor":[{"last_name":"Yang","first_name":"Hongseok","full_name":"Yang, Hongseok"}],"date_published":"2017-03-19T00:00:00Z"},{"issue":"32","date_published":"2017-03-27T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","ddc":["530"],"day":"27","oa_version":"Published Version","article_processing_charge":"No","title":"Viewpoint: Microwave quantum states beat the heat","year":"2017","author":[{"orcid":"0000-0001-8112-028X","last_name":"Fink","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","full_name":"Fink, Johannes M","first_name":"Johannes M"}],"status":"public","date_created":"2018-12-11T11:49:41Z","publication_status":"published","publisher":"American Physical Society","corr_author":"1","oa":1,"date_updated":"2024-10-09T20:57:21Z","volume":10,"department":[{"_id":"JoFi"}],"publication":"Physics","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"}],"_id":"1013","intvolume":"        10","file":[{"file_name":"2017_Physics_Fink.pdf","access_level":"open_access","date_updated":"2019-10-24T11:38:14Z","relation":"main_file","file_size":193622,"date_created":"2019-10-24T11:38:14Z","success":1,"content_type":"application/pdf","file_id":"6968","creator":"dernst"}],"article_type":"review","month":"03","quality_controlled":"1","file_date_updated":"2019-10-24T11:38:14Z","citation":{"ieee":"J. M. Fink, “Viewpoint: Microwave quantum states beat the heat,” <i>Physics</i>, vol. 10, no. 32. American Physical Society, 2017.","apa":"Fink, J. M. (2017). Viewpoint: Microwave quantum states beat the heat. <i>Physics</i>. American Physical Society. <a href=\"https://doi.org/10.1103/Physics.10.32\">https://doi.org/10.1103/Physics.10.32</a>","mla":"Fink, Johannes M. “Viewpoint: Microwave Quantum States Beat the Heat.” <i>Physics</i>, vol. 10, no. 32, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1103/Physics.10.32\">10.1103/Physics.10.32</a>.","ista":"Fink JM. 2017. Viewpoint: Microwave quantum states beat the heat. Physics. 10(32).","chicago":"Fink, Johannes M. “Viewpoint: Microwave Quantum States Beat the Heat.” <i>Physics</i>. American Physical Society, 2017. <a href=\"https://doi.org/10.1103/Physics.10.32\">https://doi.org/10.1103/Physics.10.32</a>.","ama":"Fink JM. Viewpoint: Microwave quantum states beat the heat. <i>Physics</i>. 2017;10(32). doi:<a href=\"https://doi.org/10.1103/Physics.10.32\">10.1103/Physics.10.32</a>","short":"J.M. Fink, Physics 10 (2017)."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"6382","doi":"10.1103/Physics.10.32","has_accepted_license":"1"},{"isi":1,"language":[{"iso":"eng"}],"scopus_import":"1","ddc":["539"],"day":"04","type":"journal_article","date_published":"2017-04-04T00:00:00Z","pubrep_id":"809","date_created":"2018-12-11T11:49:42Z","status":"public","publication_status":"published","publisher":"Nature Publishing Group","article_processing_charge":"No","title":"Vortices and antivortices in two-dimensional ultracold Fermi gases","oa_version":"Published Version","author":[{"full_name":"Bighin, Giacomo","first_name":"Giacomo","last_name":"Bighin","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8823-9777"},{"full_name":"Salasnich, Luca","first_name":"Luca","last_name":"Salasnich"}],"year":"2017","volume":7,"publication":"Scientific Reports","department":[{"_id":"MiLe"}],"file":[{"creator":"system","file_id":"4950","content_type":"application/pdf","date_created":"2018-12-12T10:12:32Z","file_size":478289,"relation":"main_file","access_level":"open_access","date_updated":"2018-12-12T10:12:32Z","file_name":"IST-2017-809-v1+1_srep45702.pdf"}],"intvolume":"         7","_id":"1015","abstract":[{"text":"Vortices are commonly observed in the context of classical hydrodynamics: from whirlpools after stirring the coffee in a cup to a violent atmospheric phenomenon such as a tornado, all classical vortices are characterized by an arbitrary circulation value of the local velocity field. On the other hand the appearance of vortices with quantized circulation represents one of the fundamental signatures of macroscopic quantum phenomena. In two-dimensional superfluids quantized vortices play a key role in determining finite-temperature properties, as the superfluid phase and the normal state are separated by a vortex unbinding transition, the Berezinskii-Kosterlitz-Thouless transition. Very recent experiments with two-dimensional superfluid fermions motivate the present work: we present theoretical results based on the renormalization group showing that the universal jump of the superfluid density and the critical temperature crucially depend on the interaction strength, providing a strong benchmark for forthcoming investigations.","lang":"eng"}],"month":"04","oa":1,"date_updated":"2025-07-10T11:49:43Z","external_id":{"isi":["000398148100001"]},"publication_identifier":{"issn":["2045-2322"]},"publist_id":"6380","has_accepted_license":"1","doi":"10.1038/srep45702","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"quality_controlled":"1","article_number":"45702","citation":{"short":"G. Bighin, L. Salasnich, Scientific Reports 7 (2017).","ama":"Bighin G, Salasnich L. Vortices and antivortices in two-dimensional ultracold Fermi gases. <i>Scientific Reports</i>. 2017;7. doi:<a href=\"https://doi.org/10.1038/srep45702\">10.1038/srep45702</a>","chicago":"Bighin, Giacomo, and Luca Salasnich. “Vortices and Antivortices in Two-Dimensional Ultracold Fermi Gases.” <i>Scientific Reports</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/srep45702\">https://doi.org/10.1038/srep45702</a>.","ista":"Bighin G, Salasnich L. 2017. Vortices and antivortices in two-dimensional ultracold Fermi gases. Scientific Reports. 7, 45702.","mla":"Bighin, Giacomo, and Luca Salasnich. “Vortices and Antivortices in Two-Dimensional Ultracold Fermi Gases.” <i>Scientific Reports</i>, vol. 7, 45702, Nature Publishing Group, 2017, doi:<a href=\"https://doi.org/10.1038/srep45702\">10.1038/srep45702</a>.","apa":"Bighin, G., &#38; Salasnich, L. (2017). Vortices and antivortices in two-dimensional ultracold Fermi gases. <i>Scientific Reports</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/srep45702\">https://doi.org/10.1038/srep45702</a>","ieee":"G. Bighin and L. Salasnich, “Vortices and antivortices in two-dimensional ultracold Fermi gases,” <i>Scientific Reports</i>, vol. 7. Nature Publishing Group, 2017."},"file_date_updated":"2018-12-12T10:12:32Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"doi":"10.1016/j.mcn.2017.03.002","has_accepted_license":"1","publication_identifier":{"issn":["1044-7431"]},"publist_id":"6377","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"M. Breuss, I. Leca, T. Gstrein, A.H. Hansen, D. Keays, Molecular and Cellular Neuroscience 84 (2017) 58–67.","ama":"Breuss M, Leca I, Gstrein T, Hansen AH, Keays D. Tubulins and brain development: The origins of functional specification. <i>Molecular and Cellular Neuroscience</i>. 2017;84:58-67. doi:<a href=\"https://doi.org/10.1016/j.mcn.2017.03.002\">10.1016/j.mcn.2017.03.002</a>","ista":"Breuss M, Leca I, Gstrein T, Hansen AH, Keays D. 2017. Tubulins and brain development: The origins of functional specification. Molecular and Cellular Neuroscience. 84, 58–67.","mla":"Breuss, Martin, et al. “Tubulins and Brain Development: The Origins of Functional Specification.” <i>Molecular and Cellular Neuroscience</i>, vol. 84, Academic Press, 2017, pp. 58–67, doi:<a href=\"https://doi.org/10.1016/j.mcn.2017.03.002\">10.1016/j.mcn.2017.03.002</a>.","apa":"Breuss, M., Leca, I., Gstrein, T., Hansen, A. H., &#38; Keays, D. (2017). Tubulins and brain development: The origins of functional specification. <i>Molecular and Cellular Neuroscience</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.mcn.2017.03.002\">https://doi.org/10.1016/j.mcn.2017.03.002</a>","chicago":"Breuss, Martin, Ines Leca, Thomas Gstrein, Andi H Hansen, and David Keays. “Tubulins and Brain Development: The Origins of Functional Specification.” <i>Molecular and Cellular Neuroscience</i>. Academic Press, 2017. <a href=\"https://doi.org/10.1016/j.mcn.2017.03.002\">https://doi.org/10.1016/j.mcn.2017.03.002</a>.","ieee":"M. Breuss, I. Leca, T. Gstrein, A. H. Hansen, and D. Keays, “Tubulins and brain development: The origins of functional specification,” <i>Molecular and Cellular Neuroscience</i>, vol. 84. Academic Press, pp. 58–67, 2017."},"file_date_updated":"2018-12-12T10:09:19Z","quality_controlled":"1","month":"10","_id":"1017","intvolume":"        84","abstract":[{"lang":"eng","text":"The development of the vertebrate central nervous system is reliant on a complex cascade of biological processes that include mitotic division, relocation of migrating neurons, and the extension of dendritic and axonal processes. Each of these cellular events requires the diverse functional repertoire of the microtubule cytoskeleton for the generation of forces, assembly of macromolecular complexes and transport of molecules and organelles. The tubulins are a multi-gene family that encode for the constituents of microtubules, and have been implicated in a spectrum of neurological disorders. Evidence is building that different tubulins tune the functional properties of the microtubule cytoskeleton dependent on the cell type, developmental profile and subcellular localisation. Here we review of the origins of the functional specification of the tubulin gene family in the developing brain at a transcriptional, translational, and post-transcriptional level. We remind the reader that tubulins are not just loading controls for your average Western blot."}],"file":[{"access_level":"open_access","date_updated":"2018-12-12T10:09:19Z","relation":"main_file","file_name":"IST-2017-806-v1+2_1-s2.0-S1044743116302500-main_1_.pdf","creator":"system","date_created":"2018-12-12T10:09:19Z","file_size":1436377,"content_type":"application/pdf","file_id":"4742"}],"department":[{"_id":"SiHi"}],"publication":"Molecular and Cellular Neuroscience","volume":84,"external_id":{"isi":["000415140700007"]},"date_updated":"2025-07-10T11:49:44Z","oa":1,"publisher":"Academic Press","publication_status":"published","date_created":"2018-12-11T11:49:42Z","status":"public","year":"2017","author":[{"last_name":"Breuss","first_name":"Martin","full_name":"Breuss, Martin"},{"full_name":"Leca, Ines","first_name":"Ines","last_name":"Leca"},{"last_name":"Gstrein","first_name":"Thomas","full_name":"Gstrein, Thomas"},{"full_name":"Hansen, Andi H","first_name":"Andi H","last_name":"Hansen","id":"38853E16-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Keays","first_name":"David","full_name":"Keays, David"}],"oa_version":"Published Version","article_processing_charge":"No","title":"Tubulins and brain development: The origins of functional specification","type":"journal_article","page":"58 - 67","day":"01","ddc":["571"],"scopus_import":"1","language":[{"iso":"eng"}],"isi":1,"pubrep_id":"806","date_published":"2017-10-01T00:00:00Z"},{"citation":{"short":"T. Dobisova, V. Hrdinova, C. Cuesta, S. Michlickova, I. Urbankova, R. Hejatkova, P. Zadnikova, M. Pernisová, E. Benková, J. Hejátko, Plant Physiology 174 (2017) 387–404.","ama":"Dobisova T, Hrdinova V, Cuesta C, et al. Light regulated expression of sensor histidine kinase CKI1 controls cytokinin related development. <i>Plant Physiology</i>. 2017;174(1):387-404. doi:<a href=\"https://doi.org/10.1104/pp.16.01964\">10.1104/pp.16.01964</a>","chicago":"Dobisova, Tereza, Vendula Hrdinova, Candela Cuesta, Sarka Michlickova, Ivana Urbankova, Romana Hejatkova, Petra Zadnikova, Markéta Pernisová, Eva Benková, and Jan Hejátko. “Light Regulated Expression of Sensor Histidine Kinase CKI1 Controls Cytokinin Related Development.” <i>Plant Physiology</i>. American Society of Plant Biologists, 2017. <a href=\"https://doi.org/10.1104/pp.16.01964\">https://doi.org/10.1104/pp.16.01964</a>.","apa":"Dobisova, T., Hrdinova, V., Cuesta, C., Michlickova, S., Urbankova, I., Hejatkova, R., … Hejátko, J. (2017). Light regulated expression of sensor histidine kinase CKI1 controls cytokinin related development. <i>Plant Physiology</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1104/pp.16.01964\">https://doi.org/10.1104/pp.16.01964</a>","ista":"Dobisova T, Hrdinova V, Cuesta C, Michlickova S, Urbankova I, Hejatkova R, Zadnikova P, Pernisová M, Benková E, Hejátko J. 2017. Light regulated expression of sensor histidine kinase CKI1 controls cytokinin related development. Plant Physiology. 174(1), 387–404.","mla":"Dobisova, Tereza, et al. “Light Regulated Expression of Sensor Histidine Kinase CKI1 Controls Cytokinin Related Development.” <i>Plant Physiology</i>, vol. 174, no. 1, American Society of Plant Biologists, 2017, pp. 387–404, doi:<a href=\"https://doi.org/10.1104/pp.16.01964\">10.1104/pp.16.01964</a>.","ieee":"T. Dobisova <i>et al.</i>, “Light regulated expression of sensor histidine kinase CKI1 controls cytokinin related development,” <i>Plant Physiology</i>, vol. 174, no. 1. American Society of Plant Biologists, pp. 387–404, 2017."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","quality_controlled":"1","doi":"10.1104/pp.16.01964","publist_id":"6375","external_id":{"isi":["000402057200028"]},"date_updated":"2023-09-22T09:41:48Z","_id":"1018","abstract":[{"text":"In plants, the multistep phosphorelay (MSP) pathway mediates a range of regulatory processes, including those activated by cytokinins. The crosstalk between cytokinin response and light is known for a long time. However, the molecular mechanism underlying the interactionbetween light and cytokinin signaling remains elusive. In the screen for upstream regulators we identified a LONG PALE HYPOCOTYL (LPH) gene whose activity is indispensable for spatiotemporally correct expression of CYTOKININ INDEPENDENT-1 (CKI1), encoding the constitutively active sensor histidine kinase that activates MSP signaling. lph is a new allele of HEME OXYGENASE 1 (HY1) which encodes the key protein in the biosynthesis of phytochromobilin, a cofactor of photoconvertiblephytochromes. Our analysis confirmed the light-dependent regulation oftheCKI1 expression pattern. We show that CKI1 expression is under the control of phytochrome A (phyA), functioning as a dual (both positive and negative) regulator of CKI1 expression, presumably via the phyA-regulated transcription factors PHYTOCHROME INTERACTING FACTOR 3 (PIF3) and CIRCADIAN CLOCK ASSOCIATED 1 (CCA1). Changes in CKI1 expression observed in lph/hy1-7 and phy mutants correlatewithmisregulation of MSP signaling, changedcytokinin sensitivity and developmental aberrations,previously shown to be associated with cytokinin and/or CKI1 action. Besides that, we demonstrate novel role of phyA-dependent CKI1 expression in the hypocotyl elongation and hook development during skotomorphogenesis. Based on these results, we propose that the light-dependent regulation of CKI1 provides a plausible mechanistic link underlying the well-known interaction between light- and cytokinin-controlled plant development.","lang":"eng"}],"intvolume":"       174","month":"05","volume":174,"department":[{"_id":"EvBe"}],"publication":"Plant Physiology","year":"2017","author":[{"last_name":"Dobisova","first_name":"Tereza","full_name":"Dobisova, Tereza"},{"first_name":"Vendula","full_name":"Hrdinova, Vendula","last_name":"Hrdinova"},{"orcid":"0000-0003-1923-2410","id":"33A3C818-F248-11E8-B48F-1D18A9856A87","last_name":"Cuesta","first_name":"Candela","full_name":"Cuesta, Candela"},{"last_name":"Michlickova","first_name":"Sarka","full_name":"Michlickova, Sarka"},{"full_name":"Urbankova, Ivana","first_name":"Ivana","last_name":"Urbankova"},{"last_name":"Hejatkova","full_name":"Hejatkova, Romana","first_name":"Romana"},{"last_name":"Zadnikova","full_name":"Zadnikova, Petra","first_name":"Petra"},{"full_name":"Pernisová, Markéta","first_name":"Markéta","last_name":"Pernisová"},{"orcid":"0000-0002-8510-9739","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","last_name":"Benková","first_name":"Eva","full_name":"Benková, Eva"},{"full_name":"Hejátko, Jan","first_name":"Jan","last_name":"Hejátko"}],"oa_version":"None","article_processing_charge":"No","title":"Light regulated expression of sensor histidine kinase CKI1 controls cytokinin related development","publication_status":"published","publisher":"American Society of Plant Biologists","date_created":"2018-12-11T11:49:43Z","status":"public","date_published":"2017-05-17T00:00:00Z","issue":"1","type":"journal_article","page":"387 - 404","day":"17","language":[{"iso":"eng"}],"isi":1,"scopus_import":"1"},{"author":[{"last_name":"Argyridou","full_name":"Argyridou, Eliza","first_name":"Eliza"},{"id":"4C0A3874-F248-11E8-B48F-1D18A9856A87","last_name":"Huylmans","full_name":"Huylmans, Ann K","first_name":"Ann K","orcid":"0000-0001-8871-4961"},{"last_name":"Königer","first_name":"Annabella","full_name":"Königer, Annabella"},{"full_name":"Parsch, John","first_name":"John","last_name":"Parsch"}],"year":"2017","article_processing_charge":"No","title":"X-linkage is not a general inhibitor of tissue-specific gene expression in Drosophila melanogaster","oa_version":"None","publication_status":"published","publisher":"Nature Publishing Group","date_created":"2018-12-11T11:49:43Z","status":"public","date_published":"2017-07-01T00:00:00Z","issue":"1","page":"27 - 34","day":"01","type":"journal_article","isi":1,"language":[{"iso":"eng"}],"scopus_import":"1","citation":{"short":"E. Argyridou, A.K. Huylmans, A. Königer, J. Parsch, Heredity 119 (2017) 27–34.","ama":"Argyridou E, Huylmans AK, Königer A, Parsch J. X-linkage is not a general inhibitor of tissue-specific gene expression in Drosophila melanogaster. <i>Heredity</i>. 2017;119(1):27-34. doi:<a href=\"https://doi.org/10.1038/hdy.2017.12\">10.1038/hdy.2017.12</a>","chicago":"Argyridou, Eliza, Ann K Huylmans, Annabella Königer, and John Parsch. “X-Linkage Is Not a General Inhibitor of Tissue-Specific Gene Expression in Drosophila Melanogaster.” <i>Heredity</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/hdy.2017.12\">https://doi.org/10.1038/hdy.2017.12</a>.","apa":"Argyridou, E., Huylmans, A. K., Königer, A., &#38; Parsch, J. (2017). X-linkage is not a general inhibitor of tissue-specific gene expression in Drosophila melanogaster. <i>Heredity</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/hdy.2017.12\">https://doi.org/10.1038/hdy.2017.12</a>","mla":"Argyridou, Eliza, et al. “X-Linkage Is Not a General Inhibitor of Tissue-Specific Gene Expression in Drosophila Melanogaster.” <i>Heredity</i>, vol. 119, no. 1, Nature Publishing Group, 2017, pp. 27–34, doi:<a href=\"https://doi.org/10.1038/hdy.2017.12\">10.1038/hdy.2017.12</a>.","ista":"Argyridou E, Huylmans AK, Königer A, Parsch J. 2017. X-linkage is not a general inhibitor of tissue-specific gene expression in Drosophila melanogaster. Heredity. 119(1), 27–34.","ieee":"E. Argyridou, A. K. Huylmans, A. Königer, and J. Parsch, “X-linkage is not a general inhibitor of tissue-specific gene expression in Drosophila melanogaster,” <i>Heredity</i>, vol. 119, no. 1. Nature Publishing Group, pp. 27–34, 2017."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","doi":"10.1038/hdy.2017.12","publist_id":"6374","publication_identifier":{"issn":["0018-067X"]},"related_material":{"record":[{"status":"public","relation":"research_data","id":"9861"}]},"date_updated":"2025-07-10T11:49:45Z","external_id":{"isi":["000405397800004"]},"_id":"1019","abstract":[{"lang":"eng","text":"As a consequence of its difference in copy number between males and females, the X chromosome is subject to unique evolutionary forces and gene regulatory mechanisms. Previous studies of Drosophila melanogaster have shown that the expression of X-linked, testis-specific reporter genes is suppressed in the male germline. However, it is not known whether this phenomenon is restricted to testis-expressed genes or if it is a more general property of genes with tissue-specific expression, which are also underrepresented on the X chromosome. To test this, we compared the expression of three tissue-specific reporter genes (ovary, accessory gland and Malpighian tubule) inserted at various autosomal and X-chromosomal locations. In contrast to testis-specific reporter genes, we found no reduction of X-linked expression in any of the other tissues. In accessory gland and Malpighian tubule, we detected higher expression of the X-linked reporter genes, which suggests that they are at least partially dosage compensated. We found no difference in the tissue-specificity of X-linked and autosomal reporter genes. These findings indicate that, in general, the X chromosome is not a detrimental environment for tissue-specific gene expression and that the suppression of X-linked expression is limited to the male germline."}],"intvolume":"       119","month":"07","volume":119,"publication":"Heredity","department":[{"_id":"BeVi"}]},{"date_published":"2017-03-08T00:00:00Z","issue":"9","day":"08","page":"7885 - 7890","type":"journal_article","scopus_import":"1","isi":1,"language":[{"iso":"eng"}],"author":[{"full_name":"Caixeiro, Soraya","first_name":"Soraya","last_name":"Caixeiro"},{"orcid":"0000-0002-3415-4628","full_name":"Peruzzo, Matilda","first_name":"Matilda","last_name":"Peruzzo","id":"3F920B30-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Onelli","first_name":"Olimpia","full_name":"Onelli, Olimpia"},{"last_name":"Vignolini","full_name":"Vignolini, Silvia","first_name":"Silvia"},{"last_name":"Sapienza","full_name":"Sapienza, Riccardo","first_name":"Riccardo"}],"year":"2017","article_processing_charge":"No","title":"Disordered cellulose based nanostructures for enhanced light scattering","oa_version":"Submitted Version","arxiv":1,"publisher":"American Chemical Society","publication_status":"published","acknowledgement":"This research was funded by the EPSRC (EP/M027961/1), the Leverhulme Trust (RPG-2014-238), Royal Society (RG140457), the BBSRC David Phillips fellowship (BB/K014617/1), and the European Research Council (ERC-2014-STG H2020 639088). All data created during this research are provided in full in the results section and Supporting Information. They are openly available from figshare and can be accessed at ref 30.","status":"public","date_created":"2018-12-11T11:49:44Z","date_updated":"2025-06-04T08:09:49Z","external_id":{"arxiv":["1702.01415"],"isi":["000396186000002"]},"oa":1,"month":"03","_id":"1020","abstract":[{"text":"Cellulose is the most abundant biopolymer on Earth. Cellulose fibers, such as the one extracted form cotton or woodpulp, have been used by humankind for hundreds of years to make textiles and paper. Here we show how, by engineering light-matter interaction, we can optimize light scattering using exclusively cellulose nanocrystals. The produced material is sustainable, biocompatible, and when compared to ordinary microfiber-based paper, it shows enhanced scattering strength (×4), yielding a transport mean free path as low as 3.5 μm in the visible light range. The experimental results are in a good agreement with the theoretical predictions obtained with a diffusive model for light propagation.","lang":"eng"}],"intvolume":"         9","publication":"ACS Applied Materials and Interfaces","department":[{"_id":"JoFi"}],"volume":9,"main_file_link":[{"url":"https://arxiv.org/abs/1702.01415","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"S. Caixeiro, M. Peruzzo, O. Onelli, S. Vignolini, R. Sapienza, ACS Applied Materials and Interfaces 9 (2017) 7885–7890.","ama":"Caixeiro S, Peruzzo M, Onelli O, Vignolini S, Sapienza R. Disordered cellulose based nanostructures for enhanced light scattering. <i>ACS Applied Materials and Interfaces</i>. 2017;9(9):7885-7890. doi:<a href=\"https://doi.org/10.1021/acsami.6b15986\">10.1021/acsami.6b15986</a>","mla":"Caixeiro, Soraya, et al. “Disordered Cellulose Based Nanostructures for Enhanced Light Scattering.” <i>ACS Applied Materials and Interfaces</i>, vol. 9, no. 9, American Chemical Society, 2017, pp. 7885–90, doi:<a href=\"https://doi.org/10.1021/acsami.6b15986\">10.1021/acsami.6b15986</a>.","ista":"Caixeiro S, Peruzzo M, Onelli O, Vignolini S, Sapienza R. 2017. Disordered cellulose based nanostructures for enhanced light scattering. ACS Applied Materials and Interfaces. 9(9), 7885–7890.","apa":"Caixeiro, S., Peruzzo, M., Onelli, O., Vignolini, S., &#38; Sapienza, R. (2017). Disordered cellulose based nanostructures for enhanced light scattering. <i>ACS Applied Materials and Interfaces</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acsami.6b15986\">https://doi.org/10.1021/acsami.6b15986</a>","chicago":"Caixeiro, Soraya, Matilda Peruzzo, Olimpia Onelli, Silvia Vignolini, and Riccardo Sapienza. “Disordered Cellulose Based Nanostructures for Enhanced Light Scattering.” <i>ACS Applied Materials and Interfaces</i>. American Chemical Society, 2017. <a href=\"https://doi.org/10.1021/acsami.6b15986\">https://doi.org/10.1021/acsami.6b15986</a>.","ieee":"S. Caixeiro, M. Peruzzo, O. Onelli, S. Vignolini, and R. Sapienza, “Disordered cellulose based nanostructures for enhanced light scattering,” <i>ACS Applied Materials and Interfaces</i>, vol. 9, no. 9. American Chemical Society, pp. 7885–7890, 2017."},"quality_controlled":"1","doi":"10.1021/acsami.6b15986","publication_identifier":{"issn":["1944-8244"]},"publist_id":"6372"},{"publication_status":"published","publisher":"Cambridge University Press","status":"public","date_created":"2018-12-11T11:49:44Z","project":[{"_id":"255008E4-B435-11E9-9278-68D0E5697425","name":"Information processing and computation in fish groups","grant_number":"RGP0065/2012"}],"author":[{"id":"40770848-F248-11E8-B48F-1D18A9856A87","last_name":"Lopez Alonso","first_name":"Jose M","full_name":"Lopez Alonso, Jose M","orcid":"0000-0002-0384-2022"},{"full_name":"Avila, Marc","first_name":"Marc","last_name":"Avila"}],"year":"2017","arxiv":1,"article_processing_charge":"No","title":"Boundary layer turbulence in experiments on quasi Keplerian flows","oa_version":"Submitted Version","day":"25","page":"21 - 34","type":"journal_article","isi":1,"language":[{"iso":"eng"}],"scopus_import":"1","date_published":"2017-04-25T00:00:00Z","doi":"10.1017/jfm.2017.109","publication_identifier":{"issn":["0022-1120"]},"publist_id":"6371","citation":{"chicago":"Lopez Alonso, Jose M, and Marc Avila. “Boundary Layer Turbulence in Experiments on Quasi Keplerian Flows.” <i>Journal of Fluid Mechanics</i>. Cambridge University Press, 2017. <a href=\"https://doi.org/10.1017/jfm.2017.109\">https://doi.org/10.1017/jfm.2017.109</a>.","mla":"Lopez Alonso, Jose M., and Marc Avila. “Boundary Layer Turbulence in Experiments on Quasi Keplerian Flows.” <i>Journal of Fluid Mechanics</i>, vol. 817, Cambridge University Press, 2017, pp. 21–34, doi:<a href=\"https://doi.org/10.1017/jfm.2017.109\">10.1017/jfm.2017.109</a>.","apa":"Lopez Alonso, J. M., &#38; Avila, M. (2017). Boundary layer turbulence in experiments on quasi Keplerian flows. <i>Journal of Fluid Mechanics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jfm.2017.109\">https://doi.org/10.1017/jfm.2017.109</a>","ista":"Lopez Alonso JM, Avila M. 2017. Boundary layer turbulence in experiments on quasi Keplerian flows. Journal of Fluid Mechanics. 817, 21–34.","ieee":"J. M. Lopez Alonso and M. Avila, “Boundary layer turbulence in experiments on quasi Keplerian flows,” <i>Journal of Fluid Mechanics</i>, vol. 817. Cambridge University Press, pp. 21–34, 2017.","short":"J.M. Lopez Alonso, M. Avila, Journal of Fluid Mechanics 817 (2017) 21–34.","ama":"Lopez Alonso JM, Avila M. Boundary layer turbulence in experiments on quasi Keplerian flows. <i>Journal of Fluid Mechanics</i>. 2017;817:21-34. doi:<a href=\"https://doi.org/10.1017/jfm.2017.109\">10.1017/jfm.2017.109</a>"},"main_file_link":[{"url":"https://arxiv.org/abs/1608.05527","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","_id":"1021","abstract":[{"lang":"eng","text":"Most flows in nature and engineering are turbulent because of their large velocities and spatial scales. Laboratory experiments on rotating quasi-Keplerian flows, for which the angular velocity decreases radially but the angular momentum increases, are however laminar at Reynolds numbers exceeding one million. This is in apparent contradiction to direct numerical simulations showing that in these experiments turbulence transition is triggered by the axial boundaries. We here show numerically that as the Reynolds number increases, turbulence becomes progressively confined to the boundary layers and the flow in the bulk fully relaminarizes. Our findings support that turbulence is unlikely to occur in isothermal constant-density quasi-Keplerian flows."}],"intvolume":"       817","month":"04","volume":817,"publication":"Journal of Fluid Mechanics","department":[{"_id":"BjHo"}],"date_updated":"2025-06-04T08:10:13Z","external_id":{"isi":["000398179100006"],"arxiv":["1608.05527"]},"oa":1},{"intvolume":"       465","_id":"1022","abstract":[{"lang":"eng","text":"We introduce a multiscale topological description of the Megaparsec web-like cosmic matter distribution. Betti numbers and topological persistence offer a powerful means of describing the rich connectivity structure of the cosmic web and of its multiscale arrangement of matter and galaxies. Emanating from algebraic topology and Morse theory, Betti numbers and persistence diagrams represent an extension and deepening of the cosmologically familiar topological genus measure and the related geometric Minkowski functionals. In addition to a description of the mathematical background, this study presents the computational procedure for computing Betti numbers and persistence diagrams for density field filtrations. The field may be computed starting from a discrete spatial distribution of galaxies or simulation particles. The main emphasis of this study concerns an extensive and systematic exploration of the imprint of different web-like morphologies and different levels of multiscale clustering in the corresponding computed Betti numbers and persistence diagrams. To this end, we use Voronoi clustering models as templates for a rich variety of web-like configurations and the fractal-like Soneira-Peebles models exemplify a range of multiscale configurations. We have identified the clear imprint of cluster nodes, filaments, walls, and voids in persistence diagrams, along with that of the nested hierarchy of structures in multiscale point distributions. We conclude by outlining the potential of persistent topology for understanding the connectivity structure of the cosmic web, in large simulations of cosmic structure formation and in the challenging context of the observed galaxy distribution in large galaxy surveys."}],"month":"01","volume":465,"publication":"Monthly Notices of the Royal Astronomical Society","department":[{"_id":"HeEd"}],"date_updated":"2025-06-04T08:10:31Z","external_id":{"arxiv":["1608.04519"],"isi":["000395170200039"]},"oa":1,"doi":"10.1093/mnras/stw2862","publist_id":"6373","publication_identifier":{"issn":["0035-8711"]},"citation":{"short":"P. Pranav, H. Edelsbrunner, R. Van De Weygaert, G. Vegter, M. Kerber, B. Jones, M. Wintraecken, Monthly Notices of the Royal Astronomical Society 465 (2017) 4281–4310.","ama":"Pranav P, Edelsbrunner H, Van De Weygaert R, et al. The topology of the cosmic web in terms of persistent Betti numbers. <i>Monthly Notices of the Royal Astronomical Society</i>. 2017;465(4):4281-4310. doi:<a href=\"https://doi.org/10.1093/mnras/stw2862\">10.1093/mnras/stw2862</a>","chicago":"Pranav, Pratyush, Herbert Edelsbrunner, Rien Van De Weygaert, Gert Vegter, Michael Kerber, Bernard Jones, and Mathijs Wintraecken. “The Topology of the Cosmic Web in Terms of Persistent Betti Numbers.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2017. <a href=\"https://doi.org/10.1093/mnras/stw2862\">https://doi.org/10.1093/mnras/stw2862</a>.","ista":"Pranav P, Edelsbrunner H, Van De Weygaert R, Vegter G, Kerber M, Jones B, Wintraecken M. 2017. The topology of the cosmic web in terms of persistent Betti numbers. Monthly Notices of the Royal Astronomical Society. 465(4), 4281–4310.","apa":"Pranav, P., Edelsbrunner, H., Van De Weygaert, R., Vegter, G., Kerber, M., Jones, B., &#38; Wintraecken, M. (2017). The topology of the cosmic web in terms of persistent Betti numbers. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stw2862\">https://doi.org/10.1093/mnras/stw2862</a>","mla":"Pranav, Pratyush, et al. “The Topology of the Cosmic Web in Terms of Persistent Betti Numbers.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 465, no. 4, Oxford University Press, 2017, pp. 4281–310, doi:<a href=\"https://doi.org/10.1093/mnras/stw2862\">10.1093/mnras/stw2862</a>.","ieee":"P. Pranav <i>et al.</i>, “The topology of the cosmic web in terms of persistent Betti numbers,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 465, no. 4. Oxford University Press, pp. 4281–4310, 2017."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1608.04519"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","day":"01","page":"4281 - 4310","type":"journal_article","isi":1,"language":[{"iso":"eng"}],"scopus_import":"1","date_published":"2017-01-01T00:00:00Z","issue":"4","publication_status":"published","publisher":"Oxford University Press","acknowledgement":"Part of this work has been supported by the 7th Framework Programme for Research of the European Commission, under FETOpen grant number 255827 (CGL Computational Geometry Learning) and ERC advanced grant, URSAT (Understanding Random Systems via Algebraic Topology) number 320422.","status":"public","date_created":"2018-12-11T11:49:44Z","author":[{"full_name":"Pranav, Pratyush","first_name":"Pratyush","last_name":"Pranav"},{"orcid":"0000-0002-9823-6833","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"},{"last_name":"Van De Weygaert","full_name":"Van De Weygaert, Rien","first_name":"Rien"},{"last_name":"Vegter","first_name":"Gert","full_name":"Vegter, Gert"},{"last_name":"Kerber","full_name":"Kerber, Michael","first_name":"Michael"},{"full_name":"Jones, Bernard","first_name":"Bernard","last_name":"Jones"},{"orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs","first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken"}],"year":"2017","arxiv":1,"article_processing_charge":"No","title":"The topology of the cosmic web in terms of persistent Betti numbers","oa_version":"Submitted Version"},{"date_published":"2017-02-06T00:00:00Z","pubrep_id":"802","type":"journal_article","day":"06","ddc":["510"],"language":[{"iso":"eng"}],"isi":1,"scopus_import":"1","year":"2017","author":[{"orcid":"0000-0002-7327-856X","id":"4D902E6A-F248-11E8-B48F-1D18A9856A87","last_name":"Nemish","full_name":"Nemish, Yuriy","first_name":"Yuriy"}],"oa_version":"Published Version","article_processing_charge":"No","title":"Local law for the product of independent non-Hermitian random matrices with independent entries","publication_status":"published","publisher":"Institute of Mathematical Statistics","date_created":"2018-12-11T11:49:44Z","status":"public","external_id":{"isi":["000396611900022"]},"date_updated":"2025-07-10T11:49:47Z","oa":1,"intvolume":"        22","_id":"1023","abstract":[{"text":"We consider products of independent square non-Hermitian random matrices. More precisely, let X1,…, Xn be independent N × N random matrices with independent entries (real or complex with independent real and imaginary parts) with zero mean and variance 1/N. Soshnikov-O’Rourke [19] and Götze-Tikhomirov [15] showed that the empirical spectral distribution of the product of n random matrices with iid entries converges to (equation found). We prove that if the entries of the matrices X1,…, Xn are independent (but not necessarily identically distributed) and satisfy uniform subexponential decay condition, then in the bulk the convergence of the ESD of X1,…, Xn to (0.1) holds up to the scale N–1/2+ε.","lang":"eng"}],"file":[{"file_name":"IST-2017-802-v1+1_euclid.ejp.1487991681.pdf","access_level":"open_access","date_updated":"2018-12-12T10:15:29Z","relation":"main_file","date_created":"2018-12-12T10:15:29Z","file_size":742275,"content_type":"application/pdf","file_id":"5149","creator":"system"}],"month":"02","volume":22,"department":[{"_id":"LaEr"}],"publication":"Electronic Journal of Probability","file_date_updated":"2018-12-12T10:15:29Z","citation":{"ieee":"Y. Nemish, “Local law for the product of independent non-Hermitian random matrices with independent entries,” <i>Electronic Journal of Probability</i>, vol. 22. Institute of Mathematical Statistics, 2017.","apa":"Nemish, Y. (2017). Local law for the product of independent non-Hermitian random matrices with independent entries. <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/17-EJP38\">https://doi.org/10.1214/17-EJP38</a>","mla":"Nemish, Yuriy. “Local Law for the Product of Independent Non-Hermitian Random Matrices with Independent Entries.” <i>Electronic Journal of Probability</i>, vol. 22, 22, Institute of Mathematical Statistics, 2017, doi:<a href=\"https://doi.org/10.1214/17-EJP38\">10.1214/17-EJP38</a>.","ista":"Nemish Y. 2017. Local law for the product of independent non-Hermitian random matrices with independent entries. Electronic Journal of Probability. 22, 22.","chicago":"Nemish, Yuriy. “Local Law for the Product of Independent Non-Hermitian Random Matrices with Independent Entries.” <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics, 2017. <a href=\"https://doi.org/10.1214/17-EJP38\">https://doi.org/10.1214/17-EJP38</a>.","ama":"Nemish Y. Local law for the product of independent non-Hermitian random matrices with independent entries. <i>Electronic Journal of Probability</i>. 2017;22. doi:<a href=\"https://doi.org/10.1214/17-EJP38\">10.1214/17-EJP38</a>","short":"Y. Nemish, Electronic Journal of Probability 22 (2017)."},"article_number":"22","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","doi":"10.1214/17-EJP38","has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_identifier":{"issn":["1083-6489"]},"publist_id":"6370"},{"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Heisenberg, Carl-Philipp J. “Cell Biology: Stretched Divisions.” <i>Nature</i>, vol. 543, no. 7643, Nature Publishing Group, 2017, pp. 43–44, doi:<a href=\"https://doi.org/10.1038/nature21502\">10.1038/nature21502</a>.","apa":"Heisenberg, C.-P. J. (2017). Cell biology: Stretched divisions. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature21502\">https://doi.org/10.1038/nature21502</a>","ista":"Heisenberg C-PJ. 2017. Cell biology: Stretched divisions. Nature. 543(7643), 43–44.","chicago":"Heisenberg, Carl-Philipp J. “Cell Biology: Stretched Divisions.” <i>Nature</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/nature21502\">https://doi.org/10.1038/nature21502</a>.","ieee":"C.-P. J. Heisenberg, “Cell biology: Stretched divisions,” <i>Nature</i>, vol. 543, no. 7643. Nature Publishing Group, pp. 43–44, 2017.","short":"C.-P.J. Heisenberg, Nature 543 (2017) 43–44.","ama":"Heisenberg C-PJ. Cell biology: Stretched divisions. <i>Nature</i>. 2017;543(7643):43-44. doi:<a href=\"https://doi.org/10.1038/nature21502\">10.1038/nature21502</a>"},"publication_identifier":{"issn":["0028-0836"]},"publist_id":"6367","doi":"10.1038/nature21502","corr_author":"1","external_id":{"isi":["000395671500025"]},"date_updated":"2025-07-10T11:49:49Z","department":[{"_id":"CaHe"}],"publication":"Nature","volume":543,"month":"03","_id":"1025","abstract":[{"lang":"eng","text":"Many organ surfaces are covered by a protective epithelial-cell layer. It emerges that such layers are maintained by cell stretching that triggers cell division mediated by the force-sensitive ion-channel protein Piezo1. See Letter p.118"}],"intvolume":"       543","oa_version":"None","title":"Cell biology: Stretched divisions","article_processing_charge":"No","year":"2017","author":[{"orcid":"0000-0002-0912-4566","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J"}],"status":"public","date_created":"2018-12-11T11:49:45Z","publisher":"Nature Publishing Group","publication_status":"published","issue":"7643","date_published":"2017-03-02T00:00:00Z","scopus_import":"1","language":[{"iso":"eng"}],"isi":1,"type":"journal_article","page":"43 - 44","day":"02"},{"quality_controlled":"1","conference":{"end_date":"2018-01-13","name":"POPL: Programming Languages","start_date":"2018-01-07","location":"Los Angeles, CA, United States"},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file_date_updated":"2021-12-07T08:06:28Z","citation":{"ieee":"K. Chatterjee, B. Choudhary, and A. Pavlogiannis, “Optimal Dyck reachability for data-dependence and Alias analysis,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 2, no. POPL. Association for Computing Machinery, 2017.","chicago":"Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2017. <a href=\"https://doi.org/10.1145/3158118\">https://doi.org/10.1145/3158118</a>.","apa":"Chatterjee, K., Choudhary, B., &#38; Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and Alias analysis. <i>Proceedings of the ACM on Programming Languages</i>. Los Angeles, CA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3158118\">https://doi.org/10.1145/3158118</a>","mla":"Chatterjee, Krishnendu, et al. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 2, no. POPL, 30, Association for Computing Machinery, 2017, doi:<a href=\"https://doi.org/10.1145/3158118\">10.1145/3158118</a>.","ista":"Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. 2(POPL), 30.","ama":"Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck reachability for data-dependence and Alias analysis. <i>Proceedings of the ACM on Programming Languages</i>. 2017;2(POPL). doi:<a href=\"https://doi.org/10.1145/3158118\">10.1145/3158118</a>","short":"K. Chatterjee, B. Choudhary, A. Pavlogiannis, Proceedings of the ACM on Programming Languages 2 (2017)."},"article_number":"30","publication_identifier":{"eissn":["2475-1421"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"doi":"10.1145/3158118","has_accepted_license":"1","corr_author":"1","oa":1,"external_id":{"arxiv":["1910.00241"]},"related_material":{"record":[{"id":"5455","relation":"earlier_version","status":"public"}]},"date_updated":"2025-04-15T07:26:20Z","department":[{"_id":"KrCh"}],"publication":"Proceedings of the ACM on Programming Languages","volume":2,"month":"12","article_type":"original","_id":"10416","abstract":[{"text":"A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The input is a graph where the edges are labeled with different types of opening and closing parentheses, and the reachability information is computed via paths whose parentheses are properly matched. We present new results for Dyck reachability problems with applications to alias analysis and data-dependence analysis. Our main contributions, that include improved upper bounds as well as lower bounds that establish optimality guarantees, are as follows: First, we consider Dyck reachability on bidirected graphs, which is the standard way of performing field-sensitive points-to analysis. Given a bidirected graph with n nodes and m edges, we present: (i) an algorithm with worst-case running time O(m + n · α(n)), where α(n) is the inverse Ackermann function, improving the previously known O(n2) time bound; (ii) a matching lower bound that shows that our algorithm is optimal wrt to worst-case complexity; and (iii) an optimal average-case upper bound of O(m) time, improving the previously known O(m · logn) bound. Second, we consider the problem of context-sensitive data-dependence analysis, where the task is to obtain analysis summaries of library code in the presence of callbacks. Our algorithm preprocesses libraries in almost linear time, after which the contribution of the library in the complexity of the client analysis is only linear, and only wrt the number of call sites. Third, we prove that combinatorial algorithms for Dyck reachability on general graphs with truly sub-cubic bounds cannot be obtained without obtaining sub-cubic combinatorial algorithms for Boolean Matrix Multiplication, which is a long-standing open problem. Thus we establish that the existing combinatorial algorithms for Dyck reachability are (conditionally) optimal for general graphs. We also show that the same hardness holds for graphs of constant treewidth. Finally, we provide a prototype implementation of our algorithms for both alias analysis and data-dependence analysis. Our experimental evaluation demonstrates that the new algorithms significantly outperform all existing methods on the two problems, over real-world benchmarks.","lang":"eng"}],"intvolume":"         2","file":[{"file_name":"2017_ACMProgLang_Chatterjee.pdf","relation":"main_file","access_level":"open_access","date_updated":"2021-12-07T08:06:28Z","file_id":"10421","date_created":"2021-12-07T08:06:28Z","file_size":460188,"success":1,"content_type":"application/pdf","creator":"cchlebak","checksum":"faa3f7b3fe8aab84b50ed805c26a0ee5"}],"ec_funded":1,"oa_version":"Published Version","title":"Optimal Dyck reachability for data-dependence and Alias analysis","article_processing_charge":"No","arxiv":1,"year":"2017","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Choudhary, Bhavya","first_name":"Bhavya","last_name":"Choudhary"},{"orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","first_name":"Andreas"}],"project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"date_created":"2021-12-05T23:01:48Z","status":"public","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Start grant (279307: Graph Games).\r\n","publisher":"Association for Computing Machinery","publication_status":"published","issue":"POPL","date_published":"2017-12-27T00:00:00Z","scopus_import":"1","language":[{"iso":"eng"}],"type":"journal_article","day":"27","ddc":["000"]},{"arxiv":1,"title":"A new proof rule for almost-sure termination","article_processing_charge":"No","oa_version":"Published Version","author":[{"full_name":"Mciver, Annabelle","first_name":"Annabelle","last_name":"Mciver"},{"full_name":"Morgan, Carroll","first_name":"Carroll","last_name":"Morgan"},{"first_name":"Benjamin Lucien","full_name":"Kaminski, Benjamin Lucien","last_name":"Kaminski"},{"full_name":"Katoen, Joost P","first_name":"Joost P","last_name":"Katoen","id":"4524F760-F248-11E8-B48F-1D18A9856A87"}],"year":"2017","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.","status":"public","date_created":"2021-12-05T23:01:49Z","publication_status":"published","publisher":"Association for Computing Machinery","issue":"POPL","date_published":"2017-12-07T00:00:00Z","language":[{"iso":"eng"}],"scopus_import":"1","day":"07","type":"journal_article","conference":{"location":"Los Angeles, CA, United States","start_date":"2018-01-07","name":"POPL: Programming Languages","end_date":"2018-01-13"},"quality_controlled":"1","article_number":"33","citation":{"apa":"Mciver, A., Morgan, C., Kaminski, B. L., &#38; Katoen, J. P. (2017). A new proof rule for almost-sure termination. <i>Proceedings of the ACM on Programming Languages</i>. Los Angeles, CA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3158121\">https://doi.org/10.1145/3158121</a>","mla":"Mciver, Annabelle, et al. “A New Proof Rule for Almost-Sure Termination.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 2, no. POPL, 33, Association for Computing Machinery, 2017, doi:<a href=\"https://doi.org/10.1145/3158121\">10.1145/3158121</a>.","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.","chicago":"Mciver, Annabelle, Carroll Morgan, Benjamin Lucien Kaminski, and Joost P Katoen. “A New Proof Rule for Almost-Sure Termination.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2017. <a href=\"https://doi.org/10.1145/3158121\">https://doi.org/10.1145/3158121</a>.","ieee":"A. Mciver, C. Morgan, B. L. Kaminski, and J. P. Katoen, “A new proof rule for almost-sure termination,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 2, no. POPL. Association for Computing Machinery, 2017.","short":"A. Mciver, C. Morgan, B.L. Kaminski, J.P. Katoen, Proceedings of the ACM on Programming Languages 2 (2017).","ama":"Mciver A, Morgan C, Kaminski BL, Katoen JP. A new proof rule for almost-sure termination. <i>Proceedings of the ACM on Programming Languages</i>. 2017;2(POPL). doi:<a href=\"https://doi.org/10.1145/3158121\">10.1145/3158121</a>"},"main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/3158121","open_access":"1"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publication_identifier":{"eissn":["2475-1421"]},"doi":"10.1145/3158121","oa":1,"corr_author":"1","date_updated":"2024-10-09T21:01:14Z","external_id":{"arxiv":["1711.03588"]},"volume":2,"publication":"Proceedings of the ACM on Programming Languages","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"abstract":[{"lang":"eng","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."}],"_id":"10418","intvolume":"         2","article_type":"original","month":"12"}]