[{"_id":"10874","date_published":"2019-01-02T00:00:00Z","title":"Modular invariants for genus 3 hyperelliptic curves","date_created":"2022-03-18T12:09:48Z","publication_status":"published","citation":{"ieee":"S. Ionica <i>et al.</i>, “Modular invariants for genus 3 hyperelliptic curves,” <i>Research in Number Theory</i>, vol. 5. Springer Nature, 2019.","ama":"Ionica S, Kılıçer P, Lauter K, et al. Modular invariants for genus 3 hyperelliptic curves. <i>Research in Number Theory</i>. 2019;5. doi:<a href=\"https://doi.org/10.1007/s40993-018-0146-6\">10.1007/s40993-018-0146-6</a>","apa":"Ionica, S., Kılıçer, P., Lauter, K., Lorenzo García, E., Manzateanu, M.-A., Massierer, M., &#38; Vincent, C. (2019). Modular invariants for genus 3 hyperelliptic curves. <i>Research in Number Theory</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s40993-018-0146-6\">https://doi.org/10.1007/s40993-018-0146-6</a>","chicago":"Ionica, Sorina, Pınar Kılıçer, Kristin Lauter, Elisa Lorenzo García, Maria-Adelina Manzateanu, Maike Massierer, and Christelle Vincent. “Modular Invariants for Genus 3 Hyperelliptic Curves.” <i>Research in Number Theory</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/s40993-018-0146-6\">https://doi.org/10.1007/s40993-018-0146-6</a>.","mla":"Ionica, Sorina, et al. “Modular Invariants for Genus 3 Hyperelliptic Curves.” <i>Research in Number Theory</i>, vol. 5, 9, Springer Nature, 2019, doi:<a href=\"https://doi.org/10.1007/s40993-018-0146-6\">10.1007/s40993-018-0146-6</a>.","short":"S. Ionica, P. Kılıçer, K. Lauter, E. Lorenzo García, M.-A. Manzateanu, M. Massierer, C. Vincent, Research in Number Theory 5 (2019).","ista":"Ionica S, Kılıçer P, Lauter K, Lorenzo García E, Manzateanu M-A, Massierer M, Vincent C. 2019. Modular invariants for genus 3 hyperelliptic curves. Research in Number Theory. 5, 9."},"department":[{"_id":"TiBr"}],"publisher":"Springer Nature","intvolume":"         5","type":"journal_article","publication_identifier":{"eissn":["2363-9555"],"issn":["2522-0160"]},"author":[{"last_name":"Ionica","first_name":"Sorina","full_name":"Ionica, Sorina"},{"last_name":"Kılıçer","full_name":"Kılıçer, Pınar","first_name":"Pınar"},{"first_name":"Kristin","full_name":"Lauter, Kristin","last_name":"Lauter"},{"last_name":"Lorenzo García","full_name":"Lorenzo García, Elisa","first_name":"Elisa"},{"first_name":"Maria-Adelina","full_name":"Manzateanu, Maria-Adelina","id":"be8d652e-a908-11ec-82a4-e2867729459c","last_name":"Manzateanu"},{"last_name":"Massierer","first_name":"Maike","full_name":"Massierer, Maike"},{"last_name":"Vincent","first_name":"Christelle","full_name":"Vincent, Christelle"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1807.08986"}],"acknowledgement":"The authors would like to thank the Lorentz Center in Leiden for hosting the Women in Numbers Europe 2 workshop and providing a productive and enjoyable environment for our initial work on this project. We are grateful to the organizers of WIN-E2, Irene Bouw, Rachel Newton and Ekin Ozman, for making this conference and this collaboration possible. We\r\nthank Irene Bouw and Christophe Ritzenhaler for helpful discussions. Ionica acknowledges support from the Thomas Jefferson Fund of the Embassy of France in the United States and the FACE Foundation. Most of Kılıçer’s work was carried out during her stay in Universiteit Leiden and Carl von Ossietzky Universität Oldenburg. Massierer was supported by the Australian Research Council (DP150101689). Vincent is supported by the National Science Foundation under Grant No. DMS-1802323 and by the Thomas Jefferson Fund of the Embassy of France in the United States and the FACE Foundation. ","date_updated":"2023-09-05T15:39:31Z","abstract":[{"text":"In this article we prove an analogue of a theorem of Lachaud, Ritzenthaler, and Zykin, which allows us to connect invariants of binary octics to Siegel modular forms of genus 3. We use this connection to show that certain modular functions, when restricted to the hyperelliptic locus, assume values whose denominators are products of powers of primes of bad reduction for the associated hyperelliptic curves. We illustrate our theorem with explicit computations. This work is motivated by the study of the values of these modular functions at CM points of the Siegel upper half-space, which, if their denominators are known, can be used to effectively compute models of (hyperelliptic, in our case) curves with CM.","lang":"eng"}],"article_number":"9","article_type":"original","volume":5,"oa":1,"keyword":["Algebra and Number Theory"],"doi":"10.1007/s40993-018-0146-6","arxiv":1,"publication":"Research in Number Theory","year":"2019","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","month":"01","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"02","scopus_import":"1","oa_version":"Preprint","external_id":{"arxiv":["1807.08986"]},"quality_controlled":"1"},{"date_published":"2019-05-25T00:00:00Z","_id":"10877","title":"ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics","date_created":"2022-03-18T12:29:23Z","publication_status":"published","citation":{"ista":"Frehse G, Abate A, Adzkiya D, Becchi A, Bu L, Cimatti A, Giacobbe M, Griggio A, Mover S, Mufid MS, Riouak I, Tonetta S, Zaffanella E. 2019. ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics. ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems, EPiC Series in Computing, vol. 61, 1–13.","mla":"Frehse, Goran, et al. “ARCH-COMP19 Category Report: Hybrid Systems with Piecewise Constant Dynamics.” <i>ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems</i>, edited by Goran Frehse and Matthias Althoff, vol. 61, EasyChair, 2019, pp. 1–13, doi:<a href=\"https://doi.org/10.29007/rjwn\">10.29007/rjwn</a>.","chicago":"Frehse, Goran, Alessandro Abate, Dieky Adzkiya, Anna Becchi, Lei Bu, Alessandro Cimatti, Mirco Giacobbe, et al. “ARCH-COMP19 Category Report: Hybrid Systems with Piecewise Constant Dynamics.” In <i>ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems</i>, edited by Goran Frehse and Matthias Althoff, 61:1–13. EasyChair, 2019. <a href=\"https://doi.org/10.29007/rjwn\">https://doi.org/10.29007/rjwn</a>.","short":"G. Frehse, A. Abate, D. Adzkiya, A. Becchi, L. Bu, A. Cimatti, M. Giacobbe, A. Griggio, S. Mover, M.S. Mufid, I. Riouak, S. Tonetta, E. Zaffanella, in:, G. Frehse, M. Althoff (Eds.), ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, EasyChair, 2019, pp. 1–13.","ieee":"G. Frehse <i>et al.</i>, “ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics,” in <i>ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems</i>, Montreal, Canada, 2019, vol. 61, pp. 1–13.","ama":"Frehse G, Abate A, Adzkiya D, et al. ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics. In: Frehse G, Althoff M, eds. <i>ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems</i>. Vol 61. EasyChair; 2019:1-13. doi:<a href=\"https://doi.org/10.29007/rjwn\">10.29007/rjwn</a>","apa":"Frehse, G., Abate, A., Adzkiya, D., Becchi, A., Bu, L., Cimatti, A., … Zaffanella, E. (2019). ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics. In G. Frehse &#38; M. Althoff (Eds.), <i>ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems</i> (Vol. 61, pp. 1–13). Montreal, Canada: EasyChair. <a href=\"https://doi.org/10.29007/rjwn\">https://doi.org/10.29007/rjwn</a>"},"department":[{"_id":"ToHe"}],"publisher":"EasyChair","file":[{"content_type":"application/pdf","file_name":"2019_EPiCs_Frehse.pdf","date_created":"2022-05-17T06:55:49Z","file_id":"11391","success":1,"file_size":346415,"creator":"dernst","date_updated":"2022-05-17T06:55:49Z","checksum":"4b92e333db7b4e2349501a804dfede69","access_level":"open_access","relation":"main_file"}],"intvolume":"        61","type":"conference","editor":[{"first_name":"Goran","full_name":"Frehse, Goran","last_name":"Frehse"},{"last_name":"Althoff","first_name":"Matthias","full_name":"Althoff, Matthias"}],"publication_identifier":{"issn":["2398-7340"]},"ddc":["000"],"file_date_updated":"2022-05-17T06:55:49Z","author":[{"first_name":"Goran","full_name":"Frehse, Goran","last_name":"Frehse"},{"last_name":"Abate","first_name":"Alessandro","full_name":"Abate, Alessandro"},{"last_name":"Adzkiya","first_name":"Dieky","full_name":"Adzkiya, Dieky"},{"first_name":"Anna","full_name":"Becchi, Anna","last_name":"Becchi"},{"full_name":"Bu, Lei","first_name":"Lei","last_name":"Bu"},{"last_name":"Cimatti","full_name":"Cimatti, Alessandro","first_name":"Alessandro"},{"last_name":"Giacobbe","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","full_name":"Giacobbe, Mirco","first_name":"Mirco","orcid":"0000-0001-8180-0904"},{"full_name":"Griggio, Alberto","first_name":"Alberto","last_name":"Griggio"},{"last_name":"Mover","first_name":"Sergio","full_name":"Mover, Sergio"},{"first_name":"Muhammad Syifa'ul","full_name":"Mufid, Muhammad Syifa'ul","last_name":"Mufid"},{"last_name":"Riouak","full_name":"Riouak, Idriss","first_name":"Idriss"},{"last_name":"Tonetta","full_name":"Tonetta, Stefano","first_name":"Stefano"},{"last_name":"Zaffanella","first_name":"Enea","full_name":"Zaffanella, Enea"}],"acknowledgement":"The authors gratefully acknowledge \fnancial support by the European Commission project\r\nUnCoVerCPS under grant number 643921. Lei Bu is supported by the National Natural Science\r\nFoundation of China (No.61572249).","date_updated":"2022-05-17T07:09:47Z","abstract":[{"lang":"eng","text":"This report presents the results of a friendly competition for formal verification of continuous and hybrid systems with piecewise constant dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In this third edition, six tools have been applied to solve five different benchmark problems in the category for piecewise constant dynamics: BACH, Lyse, Hy- COMP, PHAVer/SX, PHAVerLite, and VeriSiMPL. Compared to last year, a new tool has participated (HyCOMP) and PHAVerLite has replaced PHAVer-lite. The result is a snap- shot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results probably provide the most complete assessment of tools for the safety verification of continuous and hybrid systems with piecewise constant dynamics up to this date."}],"page":"1-13","conference":{"name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","location":"Montreal, Canada","end_date":"2019-04-15","start_date":"2019-04-15"},"volume":61,"oa":1,"doi":"10.29007/rjwn","publication":"ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems","language":[{"iso":"eng"}],"year":"2019","status":"public","article_processing_charge":"No","month":"05","alternative_title":["EPiC Series in Computing"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"25","scopus_import":"1","oa_version":"Published Version","has_accepted_license":"1","quality_controlled":"1"},{"date_created":"2022-03-18T12:33:34Z","publication_status":"published","citation":{"chicago":"Flandoli, Franco, Enrico Priola, and Giovanni A Zanco. “A Mean-Field Model with Discontinuous Coefficients for Neurons with Spatial Interaction.” <i>Discrete and Continuous Dynamical Systems</i>. American Institute of Mathematical Sciences, 2019. <a href=\"https://doi.org/10.3934/dcds.2019126\">https://doi.org/10.3934/dcds.2019126</a>.","mla":"Flandoli, Franco, et al. “A Mean-Field Model with Discontinuous Coefficients for Neurons with Spatial Interaction.” <i>Discrete and Continuous Dynamical Systems</i>, vol. 39, no. 6, American Institute of Mathematical Sciences, 2019, pp. 3037–67, doi:<a href=\"https://doi.org/10.3934/dcds.2019126\">10.3934/dcds.2019126</a>.","short":"F. Flandoli, E. Priola, G.A. Zanco, Discrete and Continuous Dynamical Systems 39 (2019) 3037–3067.","ieee":"F. Flandoli, E. Priola, and G. A. Zanco, “A mean-field model with discontinuous coefficients for neurons with spatial interaction,” <i>Discrete and Continuous Dynamical Systems</i>, vol. 39, no. 6. American Institute of Mathematical Sciences, pp. 3037–3067, 2019.","ama":"Flandoli F, Priola E, Zanco GA. A mean-field model with discontinuous coefficients for neurons with spatial interaction. <i>Discrete and Continuous Dynamical Systems</i>. 2019;39(6):3037-3067. doi:<a href=\"https://doi.org/10.3934/dcds.2019126\">10.3934/dcds.2019126</a>","apa":"Flandoli, F., Priola, E., &#38; Zanco, G. A. (2019). A mean-field model with discontinuous coefficients for neurons with spatial interaction. <i>Discrete and Continuous Dynamical Systems</i>. American Institute of Mathematical Sciences. <a href=\"https://doi.org/10.3934/dcds.2019126\">https://doi.org/10.3934/dcds.2019126</a>","ista":"Flandoli F, Priola E, Zanco GA. 2019. A mean-field model with discontinuous coefficients for neurons with spatial interaction. Discrete and Continuous Dynamical Systems. 39(6), 3037–3067."},"title":"A mean-field model with discontinuous coefficients for neurons with spatial interaction","date_published":"2019-06-01T00:00:00Z","_id":"10878","department":[{"_id":"JaMa"}],"publisher":"American Institute of Mathematical Sciences","publication_identifier":{"issn":["1553-5231"]},"intvolume":"        39","type":"journal_article","article_type":"original","page":"3037-3067","abstract":[{"lang":"eng","text":"Starting from a microscopic model for a system of neurons evolving in time which individually follow a stochastic integrate-and-fire type model, we study a mean-field limit of the system. Our model is described by a system of SDEs with discontinuous coefficients for the action potential of each neuron and takes into account the (random) spatial configuration of neurons allowing the interaction to depend on it. In the limit as the number of particles tends to infinity, we obtain a nonlinear Fokker-Planck type PDE in two variables, with derivatives only with respect to one variable and discontinuous coefficients. We also study strong well-posedness of the system of SDEs and prove the existence and uniqueness of a weak measure-valued solution to the PDE, obtained as the limit of the laws of the empirical measures for the system of particles."}],"date_updated":"2023-09-08T11:34:45Z","acknowledgement":"The second author has been partially supported by INdAM through the GNAMPA Research\r\nProject (2017) “Sistemi stocastici singolari: buona posizione e problemi di controllo”. The third\r\nauthor was partly funded by the Austrian Science Fund (FWF) project F 65.","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1708.04156"}],"author":[{"last_name":"Flandoli","full_name":"Flandoli, Franco","first_name":"Franco"},{"full_name":"Priola, Enrico","first_name":"Enrico","last_name":"Priola"},{"first_name":"Giovanni A","full_name":"Zanco, Giovanni A","id":"47491882-F248-11E8-B48F-1D18A9856A87","last_name":"Zanco"}],"issue":"6","volume":39,"oa":1,"arxiv":1,"publication":"Discrete and Continuous Dynamical Systems","isi":1,"project":[{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504"}],"keyword":["Applied Mathematics","Discrete Mathematics and Combinatorics","Analysis"],"doi":"10.3934/dcds.2019126","day":"01","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","month":"06","status":"public","language":[{"iso":"eng"}],"year":"2019","article_processing_charge":"No","quality_controlled":"1","external_id":{"arxiv":["1708.04156"],"isi":["000459954800003"]},"oa_version":"Preprint","scopus_import":"1"},{"citation":{"ama":"Dietlein AM, Gebert M, Müller P. Perturbations of continuum random Schrödinger operators with applications to Anderson orthogonality and the spectral shift function. <i>Journal of Spectral Theory</i>. 2019;9(3):921-965. doi:<a href=\"https://doi.org/10.4171/jst/267\">10.4171/jst/267</a>","ieee":"A. M. Dietlein, M. Gebert, and P. Müller, “Perturbations of continuum random Schrödinger operators with applications to Anderson orthogonality and the spectral shift function,” <i>Journal of Spectral Theory</i>, vol. 9, no. 3. European Mathematical Society Publishing House, pp. 921–965, 2019.","apa":"Dietlein, A. M., Gebert, M., &#38; Müller, P. (2019). Perturbations of continuum random Schrödinger operators with applications to Anderson orthogonality and the spectral shift function. <i>Journal of Spectral Theory</i>. European Mathematical Society Publishing House. <a href=\"https://doi.org/10.4171/jst/267\">https://doi.org/10.4171/jst/267</a>","chicago":"Dietlein, Adrian M, Martin Gebert, and Peter Müller. “Perturbations of Continuum Random Schrödinger Operators with Applications to Anderson Orthogonality and the Spectral Shift Function.” <i>Journal of Spectral Theory</i>. European Mathematical Society Publishing House, 2019. <a href=\"https://doi.org/10.4171/jst/267\">https://doi.org/10.4171/jst/267</a>.","mla":"Dietlein, Adrian M., et al. “Perturbations of Continuum Random Schrödinger Operators with Applications to Anderson Orthogonality and the Spectral Shift Function.” <i>Journal of Spectral Theory</i>, vol. 9, no. 3, European Mathematical Society Publishing House, 2019, pp. 921–65, doi:<a href=\"https://doi.org/10.4171/jst/267\">10.4171/jst/267</a>.","short":"A.M. Dietlein, M. Gebert, P. Müller, Journal of Spectral Theory 9 (2019) 921–965.","ista":"Dietlein AM, Gebert M, Müller P. 2019. Perturbations of continuum random Schrödinger operators with applications to Anderson orthogonality and the spectral shift function. Journal of Spectral Theory. 9(3), 921–965."},"publication_status":"published","date_created":"2022-03-18T12:36:42Z","title":"Perturbations of continuum random Schrödinger operators with applications to Anderson orthogonality and the spectral shift function","date_published":"2019-03-01T00:00:00Z","_id":"10879","publisher":"European Mathematical Society Publishing House","department":[{"_id":"LaEr"}],"publication_identifier":{"issn":["1664-039X"]},"intvolume":"         9","type":"journal_article","abstract":[{"lang":"eng","text":"We study effects of a bounded and compactly supported perturbation on multidimensional continuum random Schrödinger operators in the region of complete localisation. Our main emphasis is on Anderson orthogonality for random Schrödinger operators. Among others, we prove that Anderson orthogonality does occur for Fermi energies in the region of complete localisation with a non-zero probability. This partially confirms recent non-rigorous findings [V. Khemani et al., Nature Phys. 11 (2015), 560–565]. The spectral shift function plays an important role in our analysis of Anderson orthogonality. We identify it with the index of the corresponding pair of spectral projections and explore the consequences thereof. All our results rely on the main technical estimate of this paper which guarantees separate exponential decay of the disorder-averaged Schatten p-norm of χa(f(H)−f(Hτ))χb in a and b. Here, Hτ is a perturbation of the random Schrödinger operator H, χa is the multiplication operator corresponding to the indicator function of a unit cube centred about a∈Rd, and f is in a suitable class of functions of bounded variation with distributional derivative supported in the region of complete localisation for H."}],"article_type":"original","page":"921-965","date_updated":"2023-09-08T11:35:31Z","acknowledgement":"M.G. was supported by the DFG under grant GE 2871/1-1.","author":[{"id":"317CB464-F248-11E8-B48F-1D18A9856A87","last_name":"Dietlein","full_name":"Dietlein, Adrian M","first_name":"Adrian M"},{"last_name":"Gebert","full_name":"Gebert, Martin","first_name":"Martin"},{"full_name":"Müller, Peter","first_name":"Peter","last_name":"Müller"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1701.02956"}],"issue":"3","oa":1,"volume":9,"publication":"Journal of Spectral Theory","arxiv":1,"isi":1,"doi":"10.4171/jst/267","keyword":["Random Schrödinger operators","spectral shift function","Anderson orthogonality"],"day":"01","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","month":"03","article_processing_charge":"No","year":"2019","language":[{"iso":"eng"}],"status":"public","quality_controlled":"1","external_id":{"isi":["000484709400006"],"arxiv":["1701.02956"]},"oa_version":"Preprint","scopus_import":"1"},{"issue":"Suppl. 1","main_file_link":[{"url":"https://www.intrinsicactivity.org/2019/7/S1/A3.27/","open_access":"1"}],"acknowledgement":"This work was supported by the ERC and EU Horizon 2020 (ERC 692692; MSC-IF 708497) and FWF Z 312-B27 Wittgenstein award; W 1205-B09).","author":[{"full_name":"Kim, Olena","first_name":"Olena","id":"3F8ABDDA-F248-11E8-B48F-1D18A9856A87","last_name":"Kim"},{"id":"4305C450-F248-11E8-B48F-1D18A9856A87","last_name":"Borges Merjane","full_name":"Borges Merjane, Carolina","first_name":"Carolina","orcid":"0000-0003-0005-401X"},{"orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas"}],"date_updated":"2024-03-25T23:30:04Z","article_number":"A3.27","conference":{"location":"Innsbruck, Austria","name":"ANA: Austrian Neuroscience Association ; APHAR: Austrian Pharmacological Society","end_date":"2019-09-27","start_date":"2019-09-25"},"type":"conference_abstract","intvolume":"         7","publication_identifier":{"issn":["2309-8503"]},"department":[{"_id":"PeJo"}],"publisher":"Austrian Pharmacological Society","_id":"11222","date_published":"2019-09-11T00:00:00Z","title":"Functional analysis of the docked vesicle pool in hippocampal mossy fiber terminals by electron microscopy","ec_funded":1,"date_created":"2022-04-20T15:06:05Z","citation":{"ista":"Kim O, Borges Merjane C, Jonas PM. 2019. Functional analysis of the docked vesicle pool in hippocampal mossy fiber terminals by electron microscopy. Intrinsic Activity. ANA: Austrian Neuroscience Association ; APHAR: Austrian Pharmacological Society vol. 7, A3.27.","apa":"Kim, O., Borges Merjane, C., &#38; Jonas, P. M. (2019). Functional analysis of the docked vesicle pool in hippocampal mossy fiber terminals by electron microscopy. In <i>Intrinsic Activity</i> (Vol. 7). Innsbruck, Austria: Austrian Pharmacological Society. <a href=\"https://doi.org/10.25006/ia.7.s1-a3.27\">https://doi.org/10.25006/ia.7.s1-a3.27</a>","ama":"Kim O, Borges Merjane C, Jonas PM. Functional analysis of the docked vesicle pool in hippocampal mossy fiber terminals by electron microscopy. In: <i>Intrinsic Activity</i>. Vol 7. Austrian Pharmacological Society; 2019. doi:<a href=\"https://doi.org/10.25006/ia.7.s1-a3.27\">10.25006/ia.7.s1-a3.27</a>","ieee":"O. Kim, C. Borges Merjane, and P. M. Jonas, “Functional analysis of the docked vesicle pool in hippocampal mossy fiber terminals by electron microscopy,” in <i>Intrinsic Activity</i>, Innsbruck, Austria, 2019, vol. 7, no. Suppl. 1.","short":"O. Kim, C. Borges Merjane, P.M. Jonas, in:, Intrinsic Activity, Austrian Pharmacological Society, 2019.","mla":"Kim, Olena, et al. “Functional Analysis of the Docked Vesicle Pool in Hippocampal Mossy Fiber Terminals by Electron Microscopy.” <i>Intrinsic Activity</i>, vol. 7, no. Suppl. 1, A3.27, Austrian Pharmacological Society, 2019, doi:<a href=\"https://doi.org/10.25006/ia.7.s1-a3.27\">10.25006/ia.7.s1-a3.27</a>.","chicago":"Kim, Olena, Carolina Borges Merjane, and Peter M Jonas. “Functional Analysis of the Docked Vesicle Pool in Hippocampal Mossy Fiber Terminals by Electron Microscopy.” In <i>Intrinsic Activity</i>, Vol. 7. Austrian Pharmacological Society, 2019. <a href=\"https://doi.org/10.25006/ia.7.s1-a3.27\">https://doi.org/10.25006/ia.7.s1-a3.27</a>."},"publication_status":"published","related_material":{"record":[{"relation":"dissertation_contains","id":"11196","status":"public"}]},"oa_version":"Published Version","quality_controlled":"1","status":"public","language":[{"iso":"eng"}],"year":"2019","article_processing_charge":"No","month":"09","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","day":"11","project":[{"call_identifier":"H2020","grant_number":"692692","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","name":"Biophysics and circuit function of a giant cortical glumatergic synapse"},{"grant_number":"708497","call_identifier":"H2020","name":"Presynaptic calcium channels distribution and impact on coupling at the hippocampal mossy fiber synapse","_id":"25BAF7B2-B435-11E9-9278-68D0E5697425"},{"grant_number":"W01205","call_identifier":"FWF","name":"Zellkommunikation in Gesundheit und Krankheit","_id":"25C3DBB6-B435-11E9-9278-68D0E5697425"},{"name":"The Wittgenstein Prize","_id":"25C5A090-B435-11E9-9278-68D0E5697425","grant_number":"Z00312","call_identifier":"FWF"}],"keyword":["hippocampus","mossy fibers","readily releasable pool","electron microscopy"],"doi":"10.25006/ia.7.s1-a3.27","publication":"Intrinsic Activity","volume":7,"oa":1},{"type":"journal_article","intvolume":"        31","ddc":["519"],"file_date_updated":"2020-07-14T12:44:39Z","issue":"2","author":[{"first_name":"Franco","full_name":"Flandoli, Franco","last_name":"Flandoli"},{"first_name":"Francesco","full_name":"Russo, Francesco","last_name":"Russo"},{"first_name":"Giovanni A","full_name":"Zanco, Giovanni A","id":"47491882-F248-11E8-B48F-1D18A9856A87","last_name":"Zanco"}],"acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). The second named author benefited partially from the support of the “FMJH Program Gaspard Monge in Optimization and Operations Research” (Project 2014-1607H). He is also grateful for the invitation to the Department of Mathematics of the University of Pisa. The third named author is grateful for the invitation to ENSTA.","date_updated":"2021-01-12T06:49:09Z","abstract":[{"text":"Two generalizations of Itô formula to infinite-dimensional spaces are given.\r\nThe first one, in Hilbert spaces, extends the classical one by taking advantage of\r\ncancellations when they occur in examples and it is applied to the case of a group\r\ngenerator. The second one, based on the previous one and a limit procedure, is an Itô\r\nformula in a special class of Banach spaces having a product structure with the noise\r\nin a Hilbert component; again the key point is the extension due to a cancellation. This\r\nextension to Banach spaces and in particular the specific cancellation are motivated\r\nby path-dependent Itô calculus.","lang":"eng"}],"page":"789-826","date_published":"2018-06-01T00:00:00Z","_id":"1215","title":"Infinite-dimensional calculus under weak spatial regularity of the processes","date_created":"2018-12-11T11:50:45Z","citation":{"ama":"Flandoli F, Russo F, Zanco GA. Infinite-dimensional calculus under weak spatial regularity of the processes. <i>Journal of Theoretical Probability</i>. 2018;31(2):789-826. doi:<a href=\"https://doi.org/10.1007/s10959-016-0724-2\">10.1007/s10959-016-0724-2</a>","ieee":"F. Flandoli, F. Russo, and G. A. Zanco, “Infinite-dimensional calculus under weak spatial regularity of the processes,” <i>Journal of Theoretical Probability</i>, vol. 31, no. 2. Springer, pp. 789–826, 2018.","apa":"Flandoli, F., Russo, F., &#38; Zanco, G. A. (2018). Infinite-dimensional calculus under weak spatial regularity of the processes. <i>Journal of Theoretical Probability</i>. Springer. <a href=\"https://doi.org/10.1007/s10959-016-0724-2\">https://doi.org/10.1007/s10959-016-0724-2</a>","mla":"Flandoli, Franco, et al. “Infinite-Dimensional Calculus under Weak Spatial Regularity of the Processes.” <i>Journal of Theoretical Probability</i>, vol. 31, no. 2, Springer, 2018, pp. 789–826, doi:<a href=\"https://doi.org/10.1007/s10959-016-0724-2\">10.1007/s10959-016-0724-2</a>.","chicago":"Flandoli, Franco, Francesco Russo, and Giovanni A Zanco. “Infinite-Dimensional Calculus under Weak Spatial Regularity of the Processes.” <i>Journal of Theoretical Probability</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s10959-016-0724-2\">https://doi.org/10.1007/s10959-016-0724-2</a>.","short":"F. Flandoli, F. Russo, G.A. Zanco, Journal of Theoretical Probability 31 (2018) 789–826.","ista":"Flandoli F, Russo F, Zanco GA. 2018. Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. 31(2), 789–826."},"publication_status":"published","department":[{"_id":"JaMa"}],"publisher":"Springer","file":[{"date_updated":"2020-07-14T12:44:39Z","checksum":"47686d58ec21c164540f1a980ff2163f","relation":"main_file","access_level":"open_access","creator":"system","file_id":"5266","file_size":671125,"file_name":"IST-2016-712-v1+1_s10959-016-0724-2.pdf","date_created":"2018-12-12T10:17:13Z","content_type":"application/pdf"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2018","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"Yes (via OA deal)","month":"06","pubrep_id":"712","publist_id":"6119","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"01","scopus_import":1,"oa_version":"Published Version","has_accepted_license":"1","quality_controlled":"1","volume":31,"oa":1,"project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"doi":"10.1007/s10959-016-0724-2","publication":"Journal of Theoretical Probability"},{"type":"journal_article","intvolume":"        37","ddc":["004"],"author":[{"last_name":"Alderighi","first_name":"Thomas","full_name":"Alderighi, Thomas"},{"full_name":"Malomo, Luigi","first_name":"Luigi","last_name":"Malomo"},{"first_name":"Daniela","full_name":"Giorgi, Daniela","last_name":"Giorgi"},{"last_name":"Pietroni","first_name":"Nico","full_name":"Pietroni, Nico"},{"first_name":"Bernd","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Cignoni","full_name":"Cignoni, Paolo","first_name":"Paolo"}],"file_date_updated":"2020-07-14T12:44:43Z","issue":"4","article_number":"136","abstract":[{"lang":"eng","text":"We propose a new method for fabricating digital objects through reusable silicone molds. Molds are generated by casting liquid silicone into custom 3D printed containers called metamolds. Metamolds automatically define the cuts that are needed to extract the cast object from the silicone mold. The shape of metamolds is designed through a novel segmentation technique, which takes into account both geometric and topological constraints involved in the process of mold casting. Our technique is simple, does not require changing the shape or topology of the input objects, and only requires off-the- shelf materials and technologies. We successfully tested our method on a set of challenging examples with complex shapes and rich geometric detail. © 2018 Association for Computing Machinery."}],"date_updated":"2023-09-13T08:56:07Z","ec_funded":1,"title":"Metamolds: Computational design of silicone molds","_id":"13","date_published":"2018-08-04T00:00:00Z","date_created":"2018-12-11T11:44:09Z","citation":{"ista":"Alderighi T, Malomo L, Giorgi D, Pietroni N, Bickel B, Cignoni P. 2018. Metamolds: Computational design of silicone molds. ACM Trans. Graph. 37(4), 136.","ieee":"T. Alderighi, L. Malomo, D. Giorgi, N. Pietroni, B. Bickel, and P. Cignoni, “Metamolds: Computational design of silicone molds,” <i>ACM Trans. Graph.</i>, vol. 37, no. 4. ACM, 2018.","ama":"Alderighi T, Malomo L, Giorgi D, Pietroni N, Bickel B, Cignoni P. Metamolds: Computational design of silicone molds. <i>ACM Trans Graph</i>. 2018;37(4). doi:<a href=\"https://doi.org/10.1145/3197517.3201381\">10.1145/3197517.3201381</a>","apa":"Alderighi, T., Malomo, L., Giorgi, D., Pietroni, N., Bickel, B., &#38; Cignoni, P. (2018). Metamolds: Computational design of silicone molds. <i>ACM Trans. Graph.</i> ACM. <a href=\"https://doi.org/10.1145/3197517.3201381\">https://doi.org/10.1145/3197517.3201381</a>","mla":"Alderighi, Thomas, et al. “Metamolds: Computational Design of Silicone Molds.” <i>ACM Trans. Graph.</i>, vol. 37, no. 4, 136, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3197517.3201381\">10.1145/3197517.3201381</a>.","chicago":"Alderighi, Thomas, Luigi Malomo, Daniela Giorgi, Nico Pietroni, Bernd Bickel, and Paolo Cignoni. “Metamolds: Computational Design of Silicone Molds.” <i>ACM Trans. Graph.</i> ACM, 2018. <a href=\"https://doi.org/10.1145/3197517.3201381\">https://doi.org/10.1145/3197517.3201381</a>.","short":"T. Alderighi, L. Malomo, D. Giorgi, N. Pietroni, B. Bickel, P. Cignoni, ACM Trans. Graph. 37 (2018)."},"publication_status":"published","department":[{"_id":"BeBi"}],"publisher":"ACM","file":[{"creator":"system","file_size":91939066,"file_id":"5374","relation":"main_file","access_level":"open_access","checksum":"61d46273dca4de626accef1d17a0aaad","date_updated":"2020-07-14T12:44:43Z","content_type":"application/pdf","date_created":"2018-12-12T10:18:52Z","file_name":"IST-2018-1038-v1+1_metamolds_authorversion.pdf"}],"month":"08","year":"2018","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","day":"04","pubrep_id":"1038","publist_id":"8043","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Submitted Version","scopus_import":"1","related_material":{"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/metamolds-molding-a-mold/"}]},"quality_controlled":"1","has_accepted_license":"1","external_id":{"isi":["000448185000097"]},"volume":37,"oa":1,"project":[{"grant_number":"715767","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"doi":"10.1145/3197517.3201381","publication":"ACM Trans. Graph.","isi":1},{"month":"10","article_processing_charge":"No","status":"public","type":"research_data_reference","year":"2018","ddc":["570"],"day":"23","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","author":[{"last_name":"Stroeymeyt","full_name":"Stroeymeyt, Nathalie","first_name":"Nathalie"},{"id":"406F989C-F248-11E8-B48F-1D18A9856A87","last_name":"Grasse","first_name":"Anna V","full_name":"Grasse, Anna V"},{"last_name":"Crespi","first_name":"Alessandro","full_name":"Crespi, Alessandro"},{"last_name":"Mersch","full_name":"Mersch, Danielle","first_name":"Danielle"},{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","last_name":"Cremer","orcid":"0000-0002-2193-3868","first_name":"Sylvia","full_name":"Cremer, Sylvia"},{"last_name":"Keller","full_name":"Keller, Laurent","first_name":"Laurent"}],"main_file_link":[{"url":"https://doi.org/10.5281/zenodo.1480665","open_access":"1"}],"related_material":{"record":[{"relation":"used_in_publication","id":"7","status":"public"}]},"abstract":[{"text":"Dataset for manuscript 'Social network plasticity decreases disease transmission in a eusocial insect'\r\nCompared to previous versions: - raw image files added\r\n                                                     - correction of URLs within README.txt file\r\n","lang":"eng"}],"date_updated":"2023-10-17T11:50:04Z","oa":1,"title":"Social network plasticity decreases disease transmission in a eusocial insect","date_published":"2018-10-23T00:00:00Z","_id":"13055","citation":{"ista":"Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. 2018. Social network plasticity decreases disease transmission in a eusocial insect, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.1322669\">10.5281/ZENODO.1322669</a>.","short":"N. Stroeymeyt, A.V. Grasse, A. Crespi, D. Mersch, S. Cremer, L. Keller, (2018).","mla":"Stroeymeyt, Nathalie, et al. <i>Social Network Plasticity Decreases Disease Transmission in a Eusocial Insect</i>. Zenodo, 2018, doi:<a href=\"https://doi.org/10.5281/ZENODO.1322669\">10.5281/ZENODO.1322669</a>.","chicago":"Stroeymeyt, Nathalie, Anna V Grasse, Alessandro Crespi, Danielle Mersch, Sylvia Cremer, and Laurent Keller. “Social Network Plasticity Decreases Disease Transmission in a Eusocial Insect.” Zenodo, 2018. <a href=\"https://doi.org/10.5281/ZENODO.1322669\">https://doi.org/10.5281/ZENODO.1322669</a>.","apa":"Stroeymeyt, N., Grasse, A. V., Crespi, A., Mersch, D., Cremer, S., &#38; Keller, L. (2018). Social network plasticity decreases disease transmission in a eusocial insect. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.1322669\">https://doi.org/10.5281/ZENODO.1322669</a>","ama":"Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. Social network plasticity decreases disease transmission in a eusocial insect. 2018. doi:<a href=\"https://doi.org/10.5281/ZENODO.1322669\">10.5281/ZENODO.1322669</a>","ieee":"N. Stroeymeyt, A. V. Grasse, A. Crespi, D. Mersch, S. Cremer, and L. Keller, “Social network plasticity decreases disease transmission in a eusocial insect.” Zenodo, 2018."},"date_created":"2023-05-23T13:24:51Z","doi":"10.5281/ZENODO.1322669","publisher":"Zenodo","department":[{"_id":"SyCr"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"abstract":[{"text":"This dataset contains a GitHub repository containing all the data, analysis, Nextflow workflows and Jupyter notebooks to replicate the manuscript titled \"Fast and accurate large multiple sequence alignments with a root-to-leaf regressive method\".\r\nIt also contains the Multiple Sequence Alignments (MSAs) generated and well as the main figures and tables from the manuscript.\r\nThe repository is also available at GitHub (https://github.com/cbcrg/dpa-analysis) release `v1.2`.\r\nFor details on how to use the regressive alignment algorithm, see the T-Coffee software suite (https://github.com/cbcrg/tcoffee).","lang":"eng"}],"date_updated":"2023-09-06T14:32:51Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.3271452"}],"oa_version":"Published Version","author":[{"full_name":"Garriga, Edgar","first_name":"Edgar","last_name":"Garriga"},{"first_name":"Paolo","full_name":"di Tommaso, Paolo","last_name":"di Tommaso"},{"last_name":"Magis","full_name":"Magis, Cedrik","first_name":"Cedrik"},{"full_name":"Erb, Ionas","first_name":"Ionas","last_name":"Erb"},{"first_name":"Leila","full_name":"Mansouri, Leila","last_name":"Mansouri"},{"last_name":"Baltzis","first_name":"Athanasios","full_name":"Baltzis, Athanasios"},{"last_name":"Laayouni","full_name":"Laayouni, Hafid","first_name":"Hafid"},{"first_name":"Fyodor","full_name":"Kondrashov, Fyodor","orcid":"0000-0001-8243-4694","last_name":"Kondrashov","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Floden, Evan","first_name":"Evan","last_name":"Floden"},{"first_name":"Cedric","full_name":"Notredame, Cedric","last_name":"Notredame"}],"related_material":{"record":[{"id":"7181","status":"public","relation":"used_in_publication"}]},"day":"07","ddc":["570"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"12","year":"2018","type":"research_data_reference","status":"public","article_processing_charge":"No","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"FyKo"}],"publisher":"Zenodo","doi":"10.5281/ZENODO.2025846","date_created":"2023-05-23T16:08:20Z","citation":{"short":"E. Garriga, P. di Tommaso, C. Magis, I. Erb, L. Mansouri, A. Baltzis, H. Laayouni, F. Kondrashov, E. Floden, C. Notredame, (2018).","mla":"Garriga, Edgar, et al. <i>Fast and Accurate Large Multiple Sequence Alignments with a Root-to-Leaf Regressive Method</i>. Zenodo, 2018, doi:<a href=\"https://doi.org/10.5281/ZENODO.2025846\">10.5281/ZENODO.2025846</a>.","chicago":"Garriga, Edgar, Paolo di Tommaso, Cedrik Magis, Ionas Erb, Leila Mansouri, Athanasios Baltzis, Hafid Laayouni, Fyodor Kondrashov, Evan Floden, and Cedric Notredame. “Fast and Accurate Large Multiple Sequence Alignments with a Root-to-Leaf Regressive Method.” Zenodo, 2018. <a href=\"https://doi.org/10.5281/ZENODO.2025846\">https://doi.org/10.5281/ZENODO.2025846</a>.","apa":"Garriga, E., di Tommaso, P., Magis, C., Erb, I., Mansouri, L., Baltzis, A., … Notredame, C. (2018). Fast and accurate large multiple sequence alignments with a root-to-leaf regressive method. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.2025846\">https://doi.org/10.5281/ZENODO.2025846</a>","ama":"Garriga E, di Tommaso P, Magis C, et al. Fast and accurate large multiple sequence alignments with a root-to-leaf regressive method. 2018. doi:<a href=\"https://doi.org/10.5281/ZENODO.2025846\">10.5281/ZENODO.2025846</a>","ieee":"E. Garriga <i>et al.</i>, “Fast and accurate large multiple sequence alignments with a root-to-leaf regressive method.” Zenodo, 2018.","ista":"Garriga E, di Tommaso P, Magis C, Erb I, Mansouri L, Baltzis A, Laayouni H, Kondrashov F, Floden E, Notredame C. 2018. Fast and accurate large multiple sequence alignments with a root-to-leaf regressive method, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.2025846\">10.5281/ZENODO.2025846</a>."},"title":"Fast and accurate large multiple sequence alignments with a root-to-leaf regressive method","oa":1,"_id":"13059","date_published":"2018-12-07T00:00:00Z"},{"publication_status":"published","citation":{"chicago":"Picard, Marion A L, Celine Cosseau, Sabrina Ferré, Thomas Quack, Christoph Grevelding, Yohann Couté, and Beatriz Vicoso. “Evolution of Gene Dosage on the Z-Chromosome of Schistosome Parasites.” <i>ELife</i>. eLife Sciences Publications, 2018. <a href=\"https://doi.org/10.7554/eLife.35684\">https://doi.org/10.7554/eLife.35684</a>.","mla":"Picard, Marion A. L., et al. “Evolution of Gene Dosage on the Z-Chromosome of Schistosome Parasites.” <i>ELife</i>, vol. 7, e35684, eLife Sciences Publications, 2018, doi:<a href=\"https://doi.org/10.7554/eLife.35684\">10.7554/eLife.35684</a>.","short":"M.A.L. Picard, C. Cosseau, S. Ferré, T. Quack, C. Grevelding, Y. Couté, B. Vicoso, ELife 7 (2018).","ieee":"M. A. L. Picard <i>et al.</i>, “Evolution of gene dosage on the Z-chromosome of schistosome parasites,” <i>eLife</i>, vol. 7. eLife Sciences Publications, 2018.","ama":"Picard MAL, Cosseau C, Ferré S, et al. Evolution of gene dosage on the Z-chromosome of schistosome parasites. <i>eLife</i>. 2018;7. doi:<a href=\"https://doi.org/10.7554/eLife.35684\">10.7554/eLife.35684</a>","apa":"Picard, M. A. L., Cosseau, C., Ferré, S., Quack, T., Grevelding, C., Couté, Y., &#38; Vicoso, B. (2018). Evolution of gene dosage on the Z-chromosome of schistosome parasites. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.35684\">https://doi.org/10.7554/eLife.35684</a>","ista":"Picard MAL, Cosseau C, Ferré S, Quack T, Grevelding C, Couté Y, Vicoso B. 2018. Evolution of gene dosage on the Z-chromosome of schistosome parasites. eLife. 7, e35684."},"date_created":"2018-12-11T11:44:47Z","date_published":"2018-08-13T00:00:00Z","_id":"131","title":"Evolution of gene dosage on the Z-chromosome of schistosome parasites","file":[{"content_type":"application/pdf","file_name":"2018_eLife_Picard.pdf","date_created":"2018-12-17T11:55:05Z","creator":"dernst","file_id":"5695","file_size":3158125,"checksum":"d6331d4385b1fffd6b47b45d5949d841","date_updated":"2020-07-14T12:44:43Z","relation":"main_file","access_level":"open_access"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"eLife Sciences Publications","department":[{"_id":"BeVi"}],"ddc":["570"],"type":"journal_article","intvolume":"         7","date_updated":"2024-02-21T13:45:12Z","article_number":"e35684","abstract":[{"text":"XY systems usually show chromosome-wide compensation of X-linked genes, while in many ZW systems, compensation is restricted to a minority of dosage-sensitive genes. Why such differences arose is still unclear. Here, we combine comparative genomics, transcriptomics and proteomics to obtain a complete overview of the evolution of gene dosage on the Z-chromosome of Schistosoma parasites. We compare the Z-chromosome gene content of African (Schistosoma mansoni and S. haematobium) and Asian (S. japonicum) schistosomes and describe lineage-specific evolutionary strata. We use these to assess gene expression evolution following sex-linkage. The resulting patterns suggest a reduction in expression of Z-linked genes in females, combined with upregulation of the Z in both sexes, in line with the first step of Ohno’s classic model of dosage compensation evolution. Quantitative proteomics suggest that post-transcriptional mechanisms do not play a major role in balancing the expression of Z-linked genes. ","lang":"eng"}],"article_type":"original","file_date_updated":"2020-07-14T12:44:43Z","author":[{"full_name":"Picard, Marion A","first_name":"Marion A","orcid":"0000-0002-8101-2518","id":"2C921A7A-F248-11E8-B48F-1D18A9856A87","last_name":"Picard"},{"last_name":"Cosseau","full_name":"Cosseau, Celine","first_name":"Celine"},{"first_name":"Sabrina","full_name":"Ferré, Sabrina","last_name":"Ferré"},{"first_name":"Thomas","full_name":"Quack, Thomas","last_name":"Quack"},{"full_name":"Grevelding, Christoph","first_name":"Christoph","last_name":"Grevelding"},{"first_name":"Yohann","full_name":"Couté, Yohann","last_name":"Couté"},{"full_name":"Vicoso, Beatriz","first_name":"Beatriz","orcid":"0000-0002-4579-8306","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","last_name":"Vicoso"}],"acknowledgement":"We are grateful to Lu Dabing (Soochow University, Suzhou, China) for providing Schistosoma japonicum samples, to Ariana Macon (IST Austria) and Georgette Stovall (JLU Giessen) for technical assistance, to IT support at IST Austria for providing optimal environment to bioinformatic analyses, and to the Vicoso lab for comments on the manuscript.","oa":1,"volume":7,"isi":1,"publication":"eLife","doi":"10.7554/eLife.35684","project":[{"_id":"250ED89C-B435-11E9-9278-68D0E5697425","name":"Sex chromosome evolution under male- and female- heterogamety","call_identifier":"FWF","grant_number":"P28842-B22"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"7792","day":"13","article_processing_charge":"No","year":"2018","status":"public","language":[{"iso":"eng"}],"month":"08","external_id":{"isi":["000441388200001"]},"has_accepted_license":"1","quality_controlled":"1","scopus_import":"1","related_material":{"record":[{"id":"5586","status":"public","relation":"popular_science"}]},"oa_version":"Published Version"},{"title":"Defining lineage potential and fate behavior of precursors during pancreas development","_id":"132","date_published":"2018-08-06T00:00:00Z","publication_status":"published","citation":{"apa":"Sznurkowska, M., Hannezo, E. B., Azzarelli, R., Rulands, S., Nestorowa, S., Hindley, C., … Simons, B. (2018). Defining lineage potential and fate behavior of precursors during pancreas development. <i>Developmental Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.devcel.2018.06.028\">https://doi.org/10.1016/j.devcel.2018.06.028</a>","ama":"Sznurkowska M, Hannezo EB, Azzarelli R, et al. Defining lineage potential and fate behavior of precursors during pancreas development. <i>Developmental Cell</i>. 2018;46(3):360-375. doi:<a href=\"https://doi.org/10.1016/j.devcel.2018.06.028\">10.1016/j.devcel.2018.06.028</a>","ieee":"M. Sznurkowska <i>et al.</i>, “Defining lineage potential and fate behavior of precursors during pancreas development,” <i>Developmental Cell</i>, vol. 46, no. 3. Cell Press, pp. 360–375, 2018.","short":"M. Sznurkowska, E.B. Hannezo, R. Azzarelli, S. Rulands, S. Nestorowa, C. Hindley, J. Nichols, B. Göttgens, M. Huch, A. Philpott, B. Simons, Developmental Cell 46 (2018) 360–375.","chicago":"Sznurkowska, Magdalena, Edouard B Hannezo, Roberta Azzarelli, Steffen Rulands, Sonia Nestorowa, Christopher Hindley, Jennifer Nichols, et al. “Defining Lineage Potential and Fate Behavior of Precursors during Pancreas Development.” <i>Developmental Cell</i>. Cell Press, 2018. <a href=\"https://doi.org/10.1016/j.devcel.2018.06.028\">https://doi.org/10.1016/j.devcel.2018.06.028</a>.","mla":"Sznurkowska, Magdalena, et al. “Defining Lineage Potential and Fate Behavior of Precursors during Pancreas Development.” <i>Developmental Cell</i>, vol. 46, no. 3, Cell Press, 2018, pp. 360–75, doi:<a href=\"https://doi.org/10.1016/j.devcel.2018.06.028\">10.1016/j.devcel.2018.06.028</a>.","ista":"Sznurkowska M, Hannezo EB, Azzarelli R, Rulands S, Nestorowa S, Hindley C, Nichols J, Göttgens B, Huch M, Philpott A, Simons B. 2018. Defining lineage potential and fate behavior of precursors during pancreas development. Developmental Cell. 46(3), 360–375."},"date_created":"2018-12-11T11:44:48Z","publisher":"Cell Press","department":[{"_id":"EdHa"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"access_level":"open_access","relation":"main_file","checksum":"78d2062b9e3c3b90fe71545aeb6d2f65","date_updated":"2020-07-14T12:44:43Z","file_size":8948384,"file_id":"5694","creator":"dernst","date_created":"2018-12-17T10:49:49Z","file_name":"2018_DevelopmentalCell_Sznurkowska.pdf","content_type":"application/pdf"}],"type":"journal_article","intvolume":"        46","ddc":["570"],"acknowledgement":"E.H. is funded by a Junior Research Fellowship from Trinity College, Cam-bridge, a Sir Henry Wellcome Fellowship from the Wellcome Trust, and theBettencourt-Schueller Young Researcher Prize for support.","author":[{"full_name":"Sznurkowska, Magdalena","first_name":"Magdalena","last_name":"Sznurkowska"},{"last_name":"Hannezo","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","full_name":"Hannezo, Edouard B","first_name":"Edouard B","orcid":"0000-0001-6005-1561"},{"full_name":"Azzarelli, Roberta","first_name":"Roberta","last_name":"Azzarelli"},{"full_name":"Rulands, Steffen","first_name":"Steffen","last_name":"Rulands"},{"last_name":"Nestorowa","full_name":"Nestorowa, Sonia","first_name":"Sonia"},{"last_name":"Hindley","first_name":"Christopher","full_name":"Hindley, Christopher"},{"first_name":"Jennifer","full_name":"Nichols, Jennifer","last_name":"Nichols"},{"first_name":"Berthold","full_name":"Göttgens, Berthold","last_name":"Göttgens"},{"full_name":"Huch, Meritxell","first_name":"Meritxell","last_name":"Huch"},{"last_name":"Philpott","first_name":"Anna","full_name":"Philpott, Anna"},{"last_name":"Simons","full_name":"Simons, Benjamin","first_name":"Benjamin"}],"issue":"3","file_date_updated":"2020-07-14T12:44:43Z","page":"360 - 375","abstract":[{"text":"Pancreas development involves a coordinated process in which an early phase of cell segregation is followed by a longer phase of lineage restriction, expansion, and tissue remodeling. By combining clonal tracing and whole-mount reconstruction with proliferation kinetics and single-cell transcriptional profiling, we define the functional basis of pancreas morphogenesis. We show that the large-scale organization of mouse pancreas can be traced to the activity of self-renewing precursors positioned at the termini of growing ducts, which act collectively to drive serial rounds of stochastic ductal bifurcation balanced by termination. During this phase of branching morphogenesis, multipotent precursors become progressively fate-restricted, giving rise to self-renewing acinar-committed precursors that are conveyed with growing ducts, as well as ductal progenitors that expand the trailing ducts and give rise to delaminating endocrine cells. These findings define quantitatively how the functional behavior and lineage progression of precursor pools determine the large-scale patterning of pancreatic sub-compartments.","lang":"eng"}],"article_type":"original","date_updated":"2023-09-11T12:52:41Z","oa":1,"volume":46,"doi":"10.1016/j.devcel.2018.06.028","publication":"Developmental Cell","isi":1,"month":"08","article_processing_charge":"No","year":"2018","language":[{"iso":"eng"}],"status":"public","day":"06","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"7791","oa_version":"Published Version","scopus_import":"1","quality_controlled":"1","external_id":{"isi":["000441327300012"]},"has_accepted_license":"1"},{"scopus_import":1,"related_material":{"record":[{"relation":"earlier_version","id":"6426","status":"public"},{"relation":"dissertation_contains","id":"8332","status":"public"}]},"oa_version":"Published Version","has_accepted_license":"1","quality_controlled":"1","status":"public","year":"2018","language":[{"iso":"eng"}],"month":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LIPIcs"],"publist_id":"7790","pubrep_id":"1039","day":"13","doi":"10.4230/LIPIcs.CONCUR.2018.21","project":[{"name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms"}],"oa":1,"volume":118,"file_date_updated":"2020-07-14T12:44:44Z","author":[{"orcid":"0000-0001-7745-9117","first_name":"Bernhard","full_name":"Kragl, Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","last_name":"Kragl"},{"last_name":"Qadeer","full_name":"Qadeer, Shaz","first_name":"Shaz"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-09-07T13:18:00Z","conference":{"name":"CONCUR: International Conference on Concurrency Theory","location":"Beijing, China","start_date":"2018-09-04","end_date":"2018-09-07"},"abstract":[{"text":"Synchronous programs are easy to specify because the side effects of an operation are finished by the time the invocation of the operation returns to the caller. Asynchronous programs, on the other hand, are difficult to specify because there are side effects due to pending computation scheduled as a result of the invocation of an operation. They are also difficult to verify because of the large number of possible interleavings of concurrent computation threads. We present synchronization, a new proof rule that simplifies the verification of asynchronous programs by introducing the fiction, for proof purposes, that asynchronous operations complete synchronously. Synchronization summarizes an asynchronous computation as immediate atomic effect. Modular verification is enabled via pending asynchronous calls in atomic summaries, and a complementary proof rule that eliminates pending asynchronous calls when components and their specifications are composed. We evaluate synchronization in the context of a multi-layer refinement verification methodology on a collection of benchmark programs.","lang":"eng"}],"article_number":"21","intvolume":"       118","type":"conference","publication_identifier":{"issn":["18688969"]},"ddc":["000"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"}],"file":[{"content_type":"application/pdf","date_created":"2018-12-12T10:18:46Z","file_name":"IST-2018-853-v2+2_concur2018.pdf","file_id":"5368","file_size":745438,"creator":"system","access_level":"open_access","relation":"main_file","checksum":"c90895f4c5fafc18ddc54d1c8848077e","date_updated":"2020-07-14T12:44:44Z"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"_id":"133","date_published":"2018-08-13T00:00:00Z","title":"Synchronizing the asynchronous","citation":{"ama":"Kragl B, Qadeer S, Henzinger TA. Synchronizing the asynchronous. In: Vol 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.21\">10.4230/LIPIcs.CONCUR.2018.21</a>","ieee":"B. Kragl, S. Qadeer, and T. A. Henzinger, “Synchronizing the asynchronous,” presented at the CONCUR: International Conference on Concurrency Theory, Beijing, China, 2018, vol. 118.","apa":"Kragl, B., Qadeer, S., &#38; Henzinger, T. A. (2018). Synchronizing the asynchronous (Vol. 118). Presented at the CONCUR: International Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.21\">https://doi.org/10.4230/LIPIcs.CONCUR.2018.21</a>","mla":"Kragl, Bernhard, et al. <i>Synchronizing the Asynchronous</i>. Vol. 118, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.21\">10.4230/LIPIcs.CONCUR.2018.21</a>.","chicago":"Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Synchronizing the Asynchronous,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.21\">https://doi.org/10.4230/LIPIcs.CONCUR.2018.21</a>.","short":"B. Kragl, S. Qadeer, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","ista":"Kragl B, Qadeer S, Henzinger TA. 2018. Synchronizing the asynchronous. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 118, 21."},"publication_status":"published","date_created":"2018-12-11T11:44:48Z"},{"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"content_type":"application/pdf","date_created":"2018-12-17T12:55:31Z","file_name":"2018_Plos_Chaudhry.pdf","file_id":"5706","file_size":4007095,"creator":"dernst","access_level":"open_access","relation":"main_file","checksum":"527076f78265cd4ea192cd1569851587","date_updated":"2020-07-14T12:48:10Z"}],"publisher":"Public Library of Science","department":[{"_id":"CaGu"}],"citation":{"ieee":"W. Chaudhry <i>et al.</i>, “Leaky resistance and the conditions for the existence of lytic bacteriophage,” <i>PLoS Biology</i>, vol. 16, no. 8. Public Library of Science, 2018.","ama":"Chaudhry W, Pleska M, Shah N, et al. Leaky resistance and the conditions for the existence of lytic bacteriophage. <i>PLoS Biology</i>. 2018;16(8). doi:<a href=\"https://doi.org/10.1371/journal.pbio.2005971\">10.1371/journal.pbio.2005971</a>","apa":"Chaudhry, W., Pleska, M., Shah, N., Weiss, H., Mccall, I., Meyer, J., … Levin, B. (2018). Leaky resistance and the conditions for the existence of lytic bacteriophage. <i>PLoS Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.2005971\">https://doi.org/10.1371/journal.pbio.2005971</a>","chicago":"Chaudhry, Waqas, Maros Pleska, Nilang Shah, Howard Weiss, Ingrid Mccall, Justin Meyer, Animesh Gupta, Calin C Guet, and Bruce Levin. “Leaky Resistance and the Conditions for the Existence of Lytic Bacteriophage.” <i>PLoS Biology</i>. Public Library of Science, 2018. <a href=\"https://doi.org/10.1371/journal.pbio.2005971\">https://doi.org/10.1371/journal.pbio.2005971</a>.","mla":"Chaudhry, Waqas, et al. “Leaky Resistance and the Conditions for the Existence of Lytic Bacteriophage.” <i>PLoS Biology</i>, vol. 16, no. 8, 2005971, Public Library of Science, 2018, doi:<a href=\"https://doi.org/10.1371/journal.pbio.2005971\">10.1371/journal.pbio.2005971</a>.","short":"W. Chaudhry, M. Pleska, N. Shah, H. Weiss, I. Mccall, J. Meyer, A. Gupta, C.C. Guet, B. Levin, PLoS Biology 16 (2018).","ista":"Chaudhry W, Pleska M, Shah N, Weiss H, Mccall I, Meyer J, Gupta A, Guet CC, Levin B. 2018. Leaky resistance and the conditions for the existence of lytic bacteriophage. PLoS Biology. 16(8), 2005971."},"publication_status":"published","date_created":"2018-12-11T11:44:32Z","title":"Leaky resistance and the conditions for the existence of lytic bacteriophage","date_published":"2018-08-16T00:00:00Z","_id":"82","abstract":[{"lang":"eng","text":"In experimental cultures, when bacteria are mixed with lytic (virulent) bacteriophage, bacterial cells resistant to the phage commonly emerge and become the dominant population of bacteria. Following the ascent of resistant mutants, the densities of bacteria in these simple communities become limited by resources rather than the phage. Despite the evolution of resistant hosts, upon which the phage cannot replicate, the lytic phage population is most commonly maintained in an apparently stable state with the resistant bacteria. Several mechanisms have been put forward to account for this result. Here we report the results of population dynamic/evolution experiments with a virulent mutant of phage Lambda, λVIR, and Escherichia coli in serial transfer cultures. We show that, following the ascent of λVIR-resistant bacteria, λVIRis maintained in the majority of cases in maltose-limited minimal media and in all cases in nutrient-rich broth. Using mathematical models and experiments, we show that the dominant mechanism responsible for maintenance of λVIRin these resource-limited populations dominated by resistant E. coli is a high rate of either phenotypic or genetic transition from resistance to susceptibility—a hitherto undemonstrated mechanism we term &quot;leaky resistance.&quot; We discuss the implications of leaky resistance to our understanding of the conditions for the maintenance of phage in populations of bacteria—their “existence conditions.”."}],"article_number":"2005971","date_updated":"2023-09-13T08:45:41Z","author":[{"first_name":"Waqas","full_name":"Chaudhry, Waqas","last_name":"Chaudhry"},{"orcid":"0000-0001-7460-7479","first_name":"Maros","full_name":"Pleska, Maros","last_name":"Pleska","id":"4569785E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Shah, Nilang","first_name":"Nilang","last_name":"Shah"},{"first_name":"Howard","full_name":"Weiss, Howard","last_name":"Weiss"},{"last_name":"Mccall","first_name":"Ingrid","full_name":"Mccall, Ingrid"},{"last_name":"Meyer","full_name":"Meyer, Justin","first_name":"Justin"},{"last_name":"Gupta","first_name":"Animesh","full_name":"Gupta, Animesh"},{"orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C","first_name":"Calin C","last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Levin","full_name":"Levin, Bruce","first_name":"Bruce"}],"issue":"8","file_date_updated":"2020-07-14T12:48:10Z","ddc":["570"],"intvolume":"        16","type":"journal_article","publication":"PLoS Biology","isi":1,"doi":"10.1371/journal.pbio.2005971","oa":1,"volume":16,"quality_controlled":"1","external_id":{"isi":["000443383300024"]},"has_accepted_license":"1","oa_version":"Published Version","scopus_import":"1","related_material":{"record":[{"id":"9810","status":"public","relation":"research_data"}]},"day":"16","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"7972","month":"08","article_processing_charge":"Yes","year":"2018","status":"public","language":[{"iso":"eng"}]},{"month":"09","status":"public","year":"2018","language":[{"iso":"eng"}],"article_processing_charge":"No","day":"05","publist_id":"7971","pubrep_id":"1046","alternative_title":["ISTA Thesis"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","related_material":{"record":[{"id":"1229","status":"public","relation":"part_of_dissertation"},{"id":"1235","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"1236","status":"public"},{"relation":"part_of_dissertation","id":"559","status":"public"}]},"has_accepted_license":"1","supervisor":[{"last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z"}],"oa":1,"project":[{"call_identifier":"FP7","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography"},{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","grant_number":"682815"}],"doi":"10.15479/AT:ISTA:TH_1046","type":"dissertation","ddc":["004"],"publication_identifier":{"issn":["2663-337X"]},"author":[{"last_name":"Abusalah","id":"40297222-F248-11E8-B48F-1D18A9856A87","full_name":"Abusalah, Hamza M","first_name":"Hamza M"}],"file_date_updated":"2020-07-14T12:48:11Z","page":"59","abstract":[{"lang":"eng","text":"A proof system is a protocol between a prover and a verifier over a common input in which an honest prover convinces the verifier of the validity of true statements. Motivated by the success of decentralized cryptocurrencies, exemplified by Bitcoin, the focus of this thesis will be on proof systems which found applications in some sustainable alternatives to Bitcoin, such as the Spacemint and Chia cryptocurrencies. In particular, we focus on proofs of space and proofs of sequential work.\r\nProofs of space (PoSpace) were suggested as more ecological, economical, and egalitarian alternative to the energy-wasteful proof-of-work mining of Bitcoin. However, the state-of-the-art constructions of PoSpace are based on sophisticated graph pebbling lower bounds, and are therefore complex. Moreover, when these PoSpace are used in cryptocurrencies like Spacemint, miners can only start mining after ensuring that a commitment to their space is already added in a special transaction to the blockchain. Proofs of sequential work (PoSW) are proof systems in which a prover, upon receiving a statement x and a time parameter T, computes a proof which convinces the verifier that T time units had passed since x was received. Whereas Spacemint assumes synchrony to retain some interesting Bitcoin dynamics, Chia requires PoSW with unique proofs, i.e., PoSW in which it is hard to come up with more than one accepting proof for any true statement. In this thesis we construct simple and practically-efficient PoSpace and PoSW. When using our PoSpace in cryptocurrencies, miners can start mining on the fly, like in Bitcoin, and unlike current constructions of PoSW, which either achieve efficient verification of sequential work, or faster-than-recomputing verification of correctness of proofs, but not both at the same time, ours achieve the best of these two worlds."}],"date_updated":"2023-09-07T12:30:23Z","title":"Proof systems for sustainable decentralized cryptocurrencies","ec_funded":1,"date_published":"2018-09-05T00:00:00Z","_id":"83","date_created":"2018-12-11T11:44:32Z","publication_status":"published","citation":{"ista":"Abusalah HM. 2018. Proof systems for sustainable decentralized cryptocurrencies. Institute of Science and Technology Austria.","chicago":"Abusalah, Hamza M. “Proof Systems for Sustainable Decentralized Cryptocurrencies.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:TH_1046\">https://doi.org/10.15479/AT:ISTA:TH_1046</a>.","mla":"Abusalah, Hamza M. <i>Proof Systems for Sustainable Decentralized Cryptocurrencies</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH_1046\">10.15479/AT:ISTA:TH_1046</a>.","short":"H.M. Abusalah, Proof Systems for Sustainable Decentralized Cryptocurrencies, Institute of Science and Technology Austria, 2018.","ieee":"H. M. Abusalah, “Proof systems for sustainable decentralized cryptocurrencies,” Institute of Science and Technology Austria, 2018.","ama":"Abusalah HM. Proof systems for sustainable decentralized cryptocurrencies. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH_1046\">10.15479/AT:ISTA:TH_1046</a>","apa":"Abusalah, H. M. (2018). <i>Proof systems for sustainable decentralized cryptocurrencies</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:TH_1046\">https://doi.org/10.15479/AT:ISTA:TH_1046</a>"},"department":[{"_id":"KrPi"}],"publisher":"Institute of Science and Technology Austria","degree_awarded":"PhD","file":[{"date_updated":"2020-07-14T12:48:11Z","checksum":"c4b5f7d111755d1396787f41886fc674","relation":"main_file","access_level":"open_access","creator":"dernst","file_id":"6245","file_size":876241,"file_name":"2018_Thesis_Abusalah.pdf","date_created":"2019-04-09T06:43:41Z","content_type":"application/pdf"},{"creator":"dernst","file_size":2029190,"file_id":"6246","date_updated":"2020-07-14T12:48:11Z","checksum":"0f382ac56b471c48fd907d63eb87dafe","relation":"source_file","access_level":"closed","content_type":"application/x-gzip","file_name":"2018_Thesis_Abusalah_source.tar.gz","date_created":"2019-04-09T06:43:41Z"}]},{"type":"conference","intvolume":"     11014","ddc":["000"],"publication_identifier":{"issn":["03029743"]},"author":[{"last_name":"Gilad","full_name":"Gilad, Eran","first_name":"Eran"},{"full_name":"Brown, Trevor A","first_name":"Trevor A","last_name":"Brown","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Oskin, Mark","first_name":"Mark","last_name":"Oskin"},{"last_name":"Etsion","first_name":"Yoav","full_name":"Etsion, Yoav"}],"acknowledgement":"Trevor Brown was supported in part by the ISF (grants 2005/17 & 1749/14) and by a NSERC post-doctoral fellowship.","file_date_updated":"2020-07-14T12:48:14Z","conference":{"start_date":"2018-08-27","end_date":"2018-08-31","location":"Turin, Italy","name":"Euro-Par: European Conference on Parallel Processing"},"abstract":[{"text":"Concurrent accesses to shared data structures must be synchronized to avoid data races. Coarse-grained synchronization, which locks the entire data structure, is easy to implement but does not scale. Fine-grained synchronization can scale well, but can be hard to reason about. Hand-over-hand locking, in which operations are pipelined as they traverse the data structure, combines fine-grained synchronization with ease of use. However, the traditional implementation suffers from inherent overheads. This paper introduces snapshot-based synchronization (SBS), a novel hand-over-hand locking mechanism. SBS decouples the synchronization state from the data, significantly improving cache utilization. Further, it relies on guarantees provided by pipelining to minimize synchronization that requires cross-thread communication. Snapshot-based synchronization thus scales much better than traditional hand-over-hand locking, while maintaining the same ease of use.","lang":"eng"}],"page":"465 - 479","date_updated":"2023-09-18T09:32:36Z","title":"Snapshot based synchronization: A fast replacement for Hand-over-Hand locking","date_published":"2018-08-01T00:00:00Z","_id":"85","publication_status":"published","citation":{"mla":"Gilad, Eran, et al. <i>Snapshot Based Synchronization: A Fast Replacement for Hand-over-Hand Locking</i>. Vol. 11014, Springer, 2018, pp. 465–79, doi:<a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">10.1007/978-3-319-96983-1_33</a>.","chicago":"Gilad, Eran, Trevor A Brown, Mark Oskin, and Yoav Etsion. “Snapshot Based Synchronization: A Fast Replacement for Hand-over-Hand Locking,” 11014:465–79. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">https://doi.org/10.1007/978-3-319-96983-1_33</a>.","short":"E. Gilad, T.A. Brown, M. Oskin, Y. Etsion, in:, Springer, 2018, pp. 465–479.","ieee":"E. Gilad, T. A. Brown, M. Oskin, and Y. Etsion, “Snapshot based synchronization: A fast replacement for Hand-over-Hand locking,” presented at the Euro-Par: European Conference on Parallel Processing, Turin, Italy, 2018, vol. 11014, pp. 465–479.","ama":"Gilad E, Brown TA, Oskin M, Etsion Y. Snapshot based synchronization: A fast replacement for Hand-over-Hand locking. In: Vol 11014. Springer; 2018:465-479. doi:<a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">10.1007/978-3-319-96983-1_33</a>","apa":"Gilad, E., Brown, T. A., Oskin, M., &#38; Etsion, Y. (2018). Snapshot based synchronization: A fast replacement for Hand-over-Hand locking (Vol. 11014, pp. 465–479). Presented at the Euro-Par: European Conference on Parallel Processing, Turin, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">https://doi.org/10.1007/978-3-319-96983-1_33</a>","ista":"Gilad E, Brown TA, Oskin M, Etsion Y. 2018. Snapshot based synchronization: A fast replacement for Hand-over-Hand locking. Euro-Par: European Conference on Parallel Processing, LNCS, vol. 11014, 465–479."},"date_created":"2018-12-11T11:44:33Z","publisher":"Springer","department":[{"_id":"DaAl"}],"file":[{"access_level":"open_access","relation":"main_file","checksum":"13a3f250be8878405e791b53c19722ad","date_updated":"2020-07-14T12:48:14Z","file_size":665372,"file_id":"5954","creator":"dernst","date_created":"2019-02-12T07:40:40Z","file_name":"2018_Brown.pdf","content_type":"application/pdf"}],"month":"08","article_processing_charge":"No","year":"2018","status":"public","language":[{"iso":"eng"}],"day":"01","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","alternative_title":["LNCS"],"publist_id":"7969","oa_version":"Preprint","scopus_import":"1","quality_controlled":"1","external_id":{"isi":["000851042300031"]},"has_accepted_license":"1","oa":1,"volume":11014,"doi":"10.1007/978-3-319-96983-1_33","project":[{"_id":"26450934-B435-11E9-9278-68D0E5697425","name":"NSERC Postdoctoral fellowship"}],"isi":1},{"month":"12","article_processing_charge":"No","status":"public","year":"2018","type":"preprint","language":[{"iso":"eng"}],"day":"13","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","author":[{"first_name":"Alfredo","full_name":"Llorca, Alfredo","last_name":"Llorca"},{"full_name":"Ciceri, Gabriele","first_name":"Gabriele","last_name":"Ciceri"},{"last_name":"Beattie","id":"2E26DF60-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8483-8753","first_name":"Robert J","full_name":"Beattie, Robert J"},{"first_name":"Fong K.","full_name":"Wong, Fong K.","last_name":"Wong"},{"full_name":"Diana, Giovanni","first_name":"Giovanni","last_name":"Diana"},{"first_name":"Eleni","full_name":"Serafeimidou, Eleni","last_name":"Serafeimidou"},{"last_name":"Fernández-Otero","full_name":"Fernández-Otero, Marian","first_name":"Marian"},{"full_name":"Streicher, Carmen","first_name":"Carmen","last_name":"Streicher","id":"36BCB99C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Arnold","full_name":"Arnold, Sebastian J.","first_name":"Sebastian J."},{"last_name":"Meyer","full_name":"Meyer, Martin","first_name":"Martin"},{"first_name":"Simon","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Maravall, Miguel","first_name":"Miguel","last_name":"Maravall"},{"full_name":"Marín, Oscar","first_name":"Oscar","last_name":"Marín"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/494088"}],"acknowledgement":"We thank I. Andrew and S.E. Bae for excellent technical assistance, F. Gage for plasmids, and K. Nave (Nex-Cre) for mouse colonies. We thank members of the Marín and Rico laboratories for stimulating discussions and ideas. Our research on this topic is supported by grants from the European Research Council (ERC-2017-AdG 787355 to O.M and ERC2016-CoG 725780 to S.H.) and Wellcome Trust (103714MA) to O.M. L.L. was the recipient of an EMBO long-term postdoctoral fellowship, R.B. received support from FWF Lise-Meitner program (M 2416) and F.K.W. was supported by an EMBO postdoctoral fellowship and is currently a Marie Skłodowska-Curie Fellow from the European Commission under the H2020 Programme.","abstract":[{"lang":"eng","text":"The cerebral cortex contains multiple hierarchically organized areas with distinctive cytoarchitectonical patterns, but the cellular mechanisms underlying the emergence of this diversity remain unclear. Here, we have quantitatively investigated the neuronal output of individual progenitor cells in the ventricular zone of the developing mouse neocortex using a combination of methods that together circumvent the biases and limitations of individual approaches. We found that individual cortical progenitor cells show a high degree of stochasticity and generate pyramidal cell lineages that adopt a wide range of laminar configurations. Mathematical modelling these lineage data suggests that a small number of progenitor cell populations, each generating pyramidal cells following different stochastic developmental programs, suffice to generate the heterogenous complement of pyramidal cell lineages that collectively build the complex cytoarchitecture of the neocortex."}],"date_updated":"2021-01-12T08:20:00Z","oa":1,"title":"Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture","ec_funded":1,"date_published":"2018-12-13T00:00:00Z","_id":"8547","citation":{"ista":"Llorca A, Ciceri G, Beattie RJ, Wong FK, Diana G, Serafeimidou E, Fernández-Otero M, Streicher C, Arnold SJ, Meyer M, Hippenmeyer S, Maravall M, Marín O. Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture. bioRxiv, <a href=\"https://doi.org/10.1101/494088\">10.1101/494088</a>.","apa":"Llorca, A., Ciceri, G., Beattie, R. J., Wong, F. K., Diana, G., Serafeimidou, E., … Marín, O. (n.d.). Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture. <i>bioRxiv</i>. Cold Spring Harbor Laboratory. <a href=\"https://doi.org/10.1101/494088\">https://doi.org/10.1101/494088</a>","ieee":"A. Llorca <i>et al.</i>, “Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture,” <i>bioRxiv</i>. Cold Spring Harbor Laboratory.","ama":"Llorca A, Ciceri G, Beattie RJ, et al. Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture. <i>bioRxiv</i>. doi:<a href=\"https://doi.org/10.1101/494088\">10.1101/494088</a>","short":"A. Llorca, G. Ciceri, R.J. Beattie, F.K. Wong, G. Diana, E. Serafeimidou, M. Fernández-Otero, C. Streicher, S.J. Arnold, M. Meyer, S. Hippenmeyer, M. Maravall, O. Marín, BioRxiv (n.d.).","chicago":"Llorca, Alfredo, Gabriele Ciceri, Robert J Beattie, Fong K. Wong, Giovanni Diana, Eleni Serafeimidou, Marian Fernández-Otero, et al. “Heterogeneous Progenitor Cell Behaviors Underlie the Assembly of Neocortical Cytoarchitecture.” <i>BioRxiv</i>. Cold Spring Harbor Laboratory, n.d. <a href=\"https://doi.org/10.1101/494088\">https://doi.org/10.1101/494088</a>.","mla":"Llorca, Alfredo, et al. “Heterogeneous Progenitor Cell Behaviors Underlie the Assembly of Neocortical Cytoarchitecture.” <i>BioRxiv</i>, Cold Spring Harbor Laboratory, doi:<a href=\"https://doi.org/10.1101/494088\">10.1101/494088</a>."},"publication_status":"submitted","date_created":"2020-09-21T12:01:50Z","publisher":"Cold Spring Harbor Laboratory","doi":"10.1101/494088","department":[{"_id":"SiHi"}],"project":[{"grant_number":"725780","call_identifier":"H2020","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","_id":"260018B0-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"M02416","_id":"264E56E2-B435-11E9-9278-68D0E5697425","name":"Molecular Mechanisms Regulating Gliogenesis in the Cerebral Cortex"}],"publication":"bioRxiv"},{"_id":"86","date_published":"2018-07-20T00:00:00Z","title":"Computing average response time","ec_funded":1,"date_created":"2018-12-11T11:44:33Z","publication_status":"published","citation":{"ista":"Chatterjee K, Henzinger TA, Otop J. 2018.Computing average response time. In: Principles of Modeling. LNCS, vol. 10760, 143–161.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, M. Lohstroh, P. Derler, M. Sirjani (Eds.), Principles of Modeling, Springer, 2018, pp. 143–161.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average Response Time.” In <i>Principles of Modeling</i>, edited by Marten Lohstroh, Patricia Derler, and Marjan Sirjani, 10760:143–61. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">https://doi.org/10.1007/978-3-319-95246-8_9</a>.","mla":"Chatterjee, Krishnendu, et al. “Computing Average Response Time.” <i>Principles of Modeling</i>, edited by Marten Lohstroh et al., vol. 10760, Springer, 2018, pp. 143–61, doi:<a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">10.1007/978-3-319-95246-8_9</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2018). Computing average response time. In M. Lohstroh, P. Derler, &#38; M. Sirjani (Eds.), <i>Principles of Modeling</i> (Vol. 10760, pp. 143–161). Springer. <a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">https://doi.org/10.1007/978-3-319-95246-8_9</a>","ama":"Chatterjee K, Henzinger TA, Otop J. Computing average response time. In: Lohstroh M, Derler P, Sirjani M, eds. <i>Principles of Modeling</i>. Vol 10760. Springer; 2018:143-161. doi:<a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">10.1007/978-3-319-95246-8_9</a>","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Computing average response time,” in <i>Principles of Modeling</i>, vol. 10760, M. Lohstroh, P. Derler, and M. Sirjani, Eds. Springer, 2018, pp. 143–161."},"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"Springer","file":[{"file_id":"7053","file_size":516307,"creator":"dernst","access_level":"open_access","relation":"main_file","checksum":"9995c6ce6957333baf616fc4f20be597","date_updated":"2020-07-14T12:48:14Z","content_type":"application/pdf","date_created":"2019-11-19T08:22:18Z","file_name":"2018_PrinciplesModeling_Chatterjee.pdf"}],"type":"book_chapter","intvolume":"     10760","editor":[{"full_name":"Lohstroh, Marten","first_name":"Marten","last_name":"Lohstroh"},{"last_name":"Derler","first_name":"Patricia","full_name":"Derler, Patricia"},{"last_name":"Sirjani","first_name":"Marjan","full_name":"Sirjani, Marjan"}],"ddc":["000"],"file_date_updated":"2020-07-14T12:48:14Z","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23, S11407-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund (WWTF) through project ICT15-003 and by the National Science Centre (NCN), Poland under grant 2014/15/D/ST6/04543.","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","first_name":"Jan","full_name":"Otop, Jan"}],"date_updated":"2021-01-12T08:20:14Z","abstract":[{"text":"Responsiveness—the requirement that every request to a system be eventually handled—is one of the fundamental liveness properties of a reactive system. Average response time is a quantitative measure for the responsiveness requirement used commonly in performance evaluation. We show how average response time can be computed on state-transition graphs, on Markov chains, and on game graphs. In all three cases, we give polynomial-time algorithms.","lang":"eng"}],"page":"143 - 161","volume":10760,"oa":1,"project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"}],"doi":"10.1007/978-3-319-95246-8_9","publication":"Principles of Modeling","language":[{"iso":"eng"}],"year":"2018","status":"public","month":"07","alternative_title":["LNCS"],"publist_id":"7968","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"20","scopus_import":1,"oa_version":"Submitted Version","has_accepted_license":"1","quality_controlled":"1"},{"publication_identifier":{"issn":["2045-2322"]},"ddc":["570"],"type":"journal_article","intvolume":"         8","date_updated":"2023-09-19T15:04:49Z","article_type":"original","abstract":[{"text":"The reversibly switchable fluorescent proteins (RSFPs) commonly used for RESOLFT nanoscopy have been developed from fluorescent proteins of the GFP superfamily. These proteins are bright, but exhibit several drawbacks such as relatively large size, oxygen-dependence, sensitivity to low pH, and limited switching speed. Therefore, RSFPs from other origins with improved properties need to be explored. Here, we report the development of two RSFPs based on the LOV domain of the photoreceptor protein YtvA from Bacillus subtilis. LOV domains obtain their fluorescence by association with the abundant cellular cofactor flavin mononucleotide (FMN). Under illumination with blue and ultraviolet light, they undergo a photocycle, making these proteins inherently photoswitchable. Our first improved variant, rsLOV1, can be used for RESOLFT imaging, whereas rsLOV2 proved useful for STED nanoscopy of living cells with a resolution of down to 50 nm. In addition to their smaller size compared to GFP-related proteins (17 kDa instead of 27 kDa) and their usability at low pH, rsLOV1 and rsLOV2 exhibit faster switching kinetics, switching on and off 3 times faster than rsEGFP2, the fastest-switching RSFP reported to date. Therefore, LOV-domain-based RSFPs have potential for applications where the switching speed of GFP-based proteins is limiting.","lang":"eng"}],"article_number":"2724","file_date_updated":"2020-10-06T16:35:16Z","author":[{"last_name":"Gregor","full_name":"Gregor, Carola","first_name":"Carola"},{"last_name":"Sidenstein","first_name":"Sven C.","full_name":"Sidenstein, Sven C."},{"full_name":"Andresen, Martin","first_name":"Martin","last_name":"Andresen"},{"first_name":"Steffen J.","full_name":"Sahl, Steffen J.","last_name":"Sahl"},{"id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","last_name":"Danzl","full_name":"Danzl, Johann G","first_name":"Johann G","orcid":"0000-0001-8559-3973"},{"first_name":"Stefan W.","full_name":"Hell, Stefan W.","last_name":"Hell"}],"date_created":"2020-10-06T16:33:37Z","citation":{"chicago":"Gregor, Carola, Sven C. Sidenstein, Martin Andresen, Steffen J. Sahl, Johann G Danzl, and Stefan W. Hell. “Novel Reversibly Switchable Fluorescent Proteins for RESOLFT and STED Nanoscopy Engineered from the Bacterial Photoreceptor YtvA.” <i>Scientific Reports</i>. Springer Nature, 2018. <a href=\"https://doi.org/10.1038/s41598-018-19947-1\">https://doi.org/10.1038/s41598-018-19947-1</a>.","mla":"Gregor, Carola, et al. “Novel Reversibly Switchable Fluorescent Proteins for RESOLFT and STED Nanoscopy Engineered from the Bacterial Photoreceptor YtvA.” <i>Scientific Reports</i>, vol. 8, 2724, Springer Nature, 2018, doi:<a href=\"https://doi.org/10.1038/s41598-018-19947-1\">10.1038/s41598-018-19947-1</a>.","short":"C. Gregor, S.C. Sidenstein, M. Andresen, S.J. Sahl, J.G. Danzl, S.W. Hell, Scientific Reports 8 (2018).","ama":"Gregor C, Sidenstein SC, Andresen M, Sahl SJ, Danzl JG, Hell SW. Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA. <i>Scientific Reports</i>. 2018;8. doi:<a href=\"https://doi.org/10.1038/s41598-018-19947-1\">10.1038/s41598-018-19947-1</a>","ieee":"C. Gregor, S. C. Sidenstein, M. Andresen, S. J. Sahl, J. G. Danzl, and S. W. Hell, “Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA,” <i>Scientific Reports</i>, vol. 8. Springer Nature, 2018.","apa":"Gregor, C., Sidenstein, S. C., Andresen, M., Sahl, S. J., Danzl, J. G., &#38; Hell, S. W. (2018). Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA. <i>Scientific Reports</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41598-018-19947-1\">https://doi.org/10.1038/s41598-018-19947-1</a>","ista":"Gregor C, Sidenstein SC, Andresen M, Sahl SJ, Danzl JG, Hell SW. 2018. Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA. Scientific Reports. 8, 2724."},"publication_status":"published","_id":"8618","date_published":"2018-02-09T00:00:00Z","title":"Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA","file":[{"access_level":"open_access","relation":"main_file","date_updated":"2020-10-06T16:35:16Z","checksum":"e642080fcbde9584c63544f587c74f03","file_size":2818077,"file_id":"8619","success":1,"creator":"dernst","date_created":"2020-10-06T16:35:16Z","file_name":"2018_ScientificReports_Gregor.pdf","content_type":"application/pdf"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"JoDa"}],"publisher":"Springer Nature","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","pmid":1,"day":"09","language":[{"iso":"eng"}],"status":"public","year":"2018","article_processing_charge":"No","month":"02","has_accepted_license":"1","external_id":{"isi":["000424630400037"],"pmid":["29426833"]},"quality_controlled":"1","oa_version":"Published Version","volume":8,"oa":1,"isi":1,"publication":"Scientific Reports","keyword":["Multidisciplinary"],"doi":"10.1038/s41598-018-19947-1"},{"project":[{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","call_identifier":"FWF","grant_number":"I02979-N35"}],"doi":"10.1214/18-AAP1389","isi":1,"arxiv":1,"publication":"Annals of Applied Probability","volume":28,"oa":1,"related_material":{"record":[{"status":"public","id":"6287","relation":"dissertation_contains"}]},"scopus_import":"1","oa_version":"Preprint","external_id":{"arxiv":["1705.02870"],"isi":["000442893500018"]},"quality_controlled":"1","language":[{"iso":"eng"}],"year":"2018","status":"public","article_processing_charge":"No","month":"10","publist_id":"7967","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"01","department":[{"_id":"HeEd"}],"publisher":"Institute of Mathematical Statistics","date_published":"2018-10-01T00:00:00Z","_id":"87","title":"Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics","date_created":"2018-12-11T11:44:33Z","publication_status":"published","citation":{"short":"H. Edelsbrunner, A. Nikitenko, Annals of Applied Probability 28 (2018) 3215–3238.","mla":"Edelsbrunner, Herbert, and Anton Nikitenko. “Random Inscribed Polytopes Have Similar Radius Functions as Poisson-Delaunay Mosaics.” <i>Annals of Applied Probability</i>, vol. 28, no. 5, Institute of Mathematical Statistics, 2018, pp. 3215–38, doi:<a href=\"https://doi.org/10.1214/18-AAP1389\">10.1214/18-AAP1389</a>.","chicago":"Edelsbrunner, Herbert, and Anton Nikitenko. “Random Inscribed Polytopes Have Similar Radius Functions as Poisson-Delaunay Mosaics.” <i>Annals of Applied Probability</i>. Institute of Mathematical Statistics, 2018. <a href=\"https://doi.org/10.1214/18-AAP1389\">https://doi.org/10.1214/18-AAP1389</a>.","apa":"Edelsbrunner, H., &#38; Nikitenko, A. (2018). Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics. <i>Annals of Applied Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/18-AAP1389\">https://doi.org/10.1214/18-AAP1389</a>","ama":"Edelsbrunner H, Nikitenko A. Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics. <i>Annals of Applied Probability</i>. 2018;28(5):3215-3238. doi:<a href=\"https://doi.org/10.1214/18-AAP1389\">10.1214/18-AAP1389</a>","ieee":"H. Edelsbrunner and A. Nikitenko, “Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics,” <i>Annals of Applied Probability</i>, vol. 28, no. 5. Institute of Mathematical Statistics, pp. 3215–3238, 2018.","ista":"Edelsbrunner H, Nikitenko A. 2018. Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics. Annals of Applied Probability. 28(5), 3215–3238."},"issue":"5","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.02870"}],"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert"},{"last_name":"Nikitenko","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0659-3201","first_name":"Anton","full_name":"Nikitenko, Anton"}],"date_updated":"2023-09-15T12:10:35Z","page":"3215 - 3238","article_type":"original","abstract":[{"text":"Using the geodesic distance on the n-dimensional sphere, we study the expected radius function of the Delaunay mosaic of a random set of points. Specifically, we consider the partition of the mosaic into intervals of the radius function and determine the expected number of intervals whose radii are less than or equal to a given threshold. We find that the expectations are essentially the same as for the Poisson–Delaunay mosaic in n-dimensional Euclidean space. Assuming the points are not contained in a hemisphere, the Delaunay mosaic is isomorphic to the boundary complex of the convex hull in Rn+1, so we also get the expected number of faces of a random inscribed polytope. As proved in Antonelli et al. [Adv. in Appl. Probab. 9–12 (1977–1980)], an orthant section of the n-sphere is isometric to the standard n-simplex equipped with the Fisher information metric. It follows that the latter space has similar stochastic properties as the n-dimensional Euclidean space. Our results are therefore relevant in information geometry and in population genetics.","lang":"eng"}],"type":"journal_article","intvolume":"        28"},{"date_updated":"2023-09-07T12:43:10Z","page":"96","abstract":[{"lang":"eng","text":"Immune cells migrating to the sites of infection navigate through diverse tissue architectures and switch their migratory mechanisms upon demand. However, little is known about systemic regulators that could allow the acquisition of these mechanisms. We performed a genetic screen in Drosophila melanogaster to identify regulators of germband invasion by embryonic macrophages into the confined space between the ectoderm and mesoderm. We have found that bZIP circadian transcription factors (TFs) Kayak (dFos) and Vrille (dNFIL3) have opposite effects on macrophage germband infiltration: Kayak facilitated and Vrille inhibited it. These TFs are enriched in the macrophages during migration and genetically interact to control it. Kayak sets a less coordinated mode of migration of the macrophage group and increases the probability and length of Levy walks. Intriguingly, the motility of kayak mutant macrophages was also strongly affected during initial germband invasion but not along another less confined route. Inhibiting Rho1 signaling within the tail ectoderm partially rescued the Kayak mutant phenotype, strongly suggesting that migrating macrophages have to overcome a barrier imposed by the stiffness of the ectoderm. Also, Kayak appeared to be important for the maintenance of the round cell shape and the rear edge translocation of the macrophages invading the germband. Complementary to this, the cortical actin cytoskeleton of Kayak- deficient macrophages was strongly affected. RNA sequencing revealed the filamin Cheerio and tetraspanin TM4SF to be downstream of Kayak. Chromatin immunoprecipitation and immunostaining revealed that the formin Diaphanous is another downstream target of Kayak. Immunostaining revealed that the formin Diaphanous is another downstream target of Kayak. Indeed, Cheerio, TM4SF and Diaphanous are required within macrophages for germband invasion, and expression of constitutively active Diaphanous in macrophages was able to rescue the kayak mutant phenotype. Moreover, Cher and Diaphanous are also reduced in the macrophages overexpressing Vrille. We hypothesize that Kayak, through its targets, increases actin polymerization and cortical tension in macrophages and thus allows extra force generation necessary for macrophage dissemination and migration through confined stiff tissues, while Vrille counterbalances it."}],"file_date_updated":"2021-02-11T11:17:16Z","author":[{"last_name":"Belyaeva","id":"47F080FE-F248-11E8-B48F-1D18A9856A87","full_name":"Belyaeva, Vera","first_name":"Vera"}],"publication_identifier":{"issn":["2663-337X"]},"ddc":["570"],"type":"dissertation","file":[{"date_created":"2019-04-08T14:13:12Z","file_name":"2018_Thesis_Belyaeva_source.docx","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","relation":"source_file","access_level":"closed","embargo_to":"open_access","date_updated":"2020-07-14T12:48:14Z","checksum":"d27b2465cb70d0c9678a0381b9b6ced1","creator":"dernst","file_id":"6243","file_size":102737483},{"file_name":"2018_Thesis_Belyaeva.pdf","date_created":"2019-04-08T14:14:08Z","content_type":"application/pdf","checksum":"a2939b61bde2de7b8ced77bbae0eaaed","date_updated":"2021-02-11T11:17:16Z","access_level":"open_access","embargo":"2019-11-19","relation":"main_file","file_size":88077843,"file_id":"6244","creator":"dernst"}],"degree_awarded":"PhD","department":[{"_id":"DaSi"}],"publisher":"Institute of Science and Technology Austria","date_created":"2018-12-11T11:44:08Z","citation":{"ista":"Belyaeva V. 2018. Transcriptional regulation of macrophage migration in the Drosophila melanogaster embryo . Institute of Science and Technology Austria.","short":"V. Belyaeva, Transcriptional Regulation of Macrophage Migration in the Drosophila Melanogaster Embryo , Institute of Science and Technology Austria, 2018.","chicago":"Belyaeva, Vera. “Transcriptional Regulation of Macrophage Migration in the Drosophila Melanogaster Embryo .” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:th1064\">https://doi.org/10.15479/AT:ISTA:th1064</a>.","mla":"Belyaeva, Vera. <i>Transcriptional Regulation of Macrophage Migration in the Drosophila Melanogaster Embryo </i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th1064\">10.15479/AT:ISTA:th1064</a>.","apa":"Belyaeva, V. (2018). <i>Transcriptional regulation of macrophage migration in the Drosophila melanogaster embryo </i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th1064\">https://doi.org/10.15479/AT:ISTA:th1064</a>","ama":"Belyaeva V. Transcriptional regulation of macrophage migration in the Drosophila melanogaster embryo . 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th1064\">10.15479/AT:ISTA:th1064</a>","ieee":"V. Belyaeva, “Transcriptional regulation of macrophage migration in the Drosophila melanogaster embryo ,” Institute of Science and Technology Austria, 2018."},"publication_status":"published","_id":"9","date_published":"2018-07-01T00:00:00Z","title":"Transcriptional regulation of macrophage migration in the Drosophila melanogaster embryo ","has_accepted_license":"1","oa_version":"Published Version","alternative_title":["ISTA Thesis"],"pubrep_id":"1064","publist_id":"8047","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"01","year":"2018","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","month":"07","doi":"10.15479/AT:ISTA:th1064","supervisor":[{"orcid":"0000-0001-8323-8353","full_name":"Siekhaus, Daria E","first_name":"Daria E","last_name":"Siekhaus","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87"}],"oa":1}]