[{"oa":1,"doi":"10.1109/ISIT.2018.8437654","year":"2018","day":"16","scopus_import":"1","publist_id":"7946","intvolume":"      2018","citation":{"ieee":"M. Obremski and M. Skórski, “Inverted leftover hash lemma,” presented at the ISIT: International Symposium on Information Theory, Vail, CO, USA, 2018, vol. 2018.","chicago":"Obremski, Marciej, and Maciej Skórski. “Inverted Leftover Hash Lemma,” Vol. 2018. IEEE, 2018. <a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">https://doi.org/10.1109/ISIT.2018.8437654</a>.","ista":"Obremski M, Skórski M. 2018. Inverted leftover hash lemma. ISIT: International Symposium on Information Theory, ISIT Proceedings, vol. 2018.","ama":"Obremski M, Skórski M. Inverted leftover hash lemma. In: Vol 2018. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">10.1109/ISIT.2018.8437654</a>","apa":"Obremski, M., &#38; Skórski, M. (2018). Inverted leftover hash lemma (Vol. 2018). Presented at the ISIT: International Symposium on Information Theory, Vail, CO, USA: IEEE. <a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">https://doi.org/10.1109/ISIT.2018.8437654</a>","short":"M. Obremski, M. Skórski, in:, IEEE, 2018.","mla":"Obremski, Marciej, and Maciej Skórski. <i>Inverted Leftover Hash Lemma</i>. Vol. 2018, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">10.1109/ISIT.2018.8437654</a>."},"department":[{"_id":"KrPi"}],"date_updated":"2023-09-13T08:23:18Z","alternative_title":["ISIT Proceedings"],"external_id":{"isi":["000448139300368"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","isi":1,"publication_status":"published","abstract":[{"text":"Universal hashing found a lot of applications in computer science. In cryptography the most important fact about universal families is the so called Leftover Hash Lemma, proved by Impagliazzo, Levin and Luby. In the language of modern cryptography it states that almost universal families are good extractors. In this work we provide a somewhat surprising characterization in the opposite direction. Namely, every extractor with sufficiently good parameters yields a universal family on a noticeable fraction of its inputs. Our proof technique is based on tools from extremal graph theory applied to the \\'collision graph\\' induced by the extractor, and may be of independent interest. We discuss possible applications to the theory of randomness extractors and non-malleable codes.","lang":"eng"}],"title":"Inverted leftover hash lemma","date_published":"2018-08-16T00:00:00Z","publisher":"IEEE","type":"conference","_id":"108","date_created":"2018-12-11T11:44:40Z","status":"public","main_file_link":[{"url":"https://eprint.iacr.org/2017/507","open_access":"1"}],"conference":{"location":"Vail, CO, USA","name":"ISIT: International Symposium on Information Theory","start_date":"2018-06-17 ","end_date":"2018-06-22"},"oa_version":"Submitted Version","quality_controlled":"1","author":[{"full_name":"Obremski, Marciej","last_name":"Obremski","first_name":"Marciej"},{"first_name":"Maciej","last_name":"Skorski","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","full_name":"Skorski, Maciej"}],"month":"08","volume":2018,"article_processing_charge":"No","language":[{"iso":"eng"}]},{"publication":"Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science","arxiv":1,"intvolume":"        16","scopus_import":"1","editor":[{"first_name":"J","last_name":"Czelakowski","full_name":"Czelakowski, J"}],"doi":"10.1007/978-3-319-74772-9_7","day":"21","year":"2018","page":"203-220","acknowledgement":"The second author was supported by National Science Center grant DEC-2011-/01/B/ST6/01006.","oa":1,"title":"Absorption and directed Jónsson terms","date_published":"2018-03-21T00:00:00Z","publisher":"Springer Nature","series_title":"OCTR","publication_status":"published","abstract":[{"lang":"eng","text":"We prove that every congruence distributive variety has directed Jónsson terms, and every congruence modular variety has directed Gumm terms. The directed terms we construct witness every case of absorption witnessed by the original Jónsson or Gumm terms. This result is equivalent to a pair of claims about absorption for admissible preorders in congruence distributive and congruence modular varieties, respectively. For finite algebras, these absorption theorems have already seen significant applications, but until now, it was not clear if the theorems hold for general algebras as well. Our method also yields a novel proof of a result by P. Lipparini about the existence of a chain of terms (which we call Pixley terms) in varieties that are at the same time congruence distributive and k-permutable for some k."}],"external_id":{"arxiv":["1502.01072"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"short":"A. Kazda, M. Kozik, R. McKenzie, M. Moore, in:, J. Czelakowski (Ed.), Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science, Springer Nature, Cham, 2018, pp. 203–220.","mla":"Kazda, Alexandr, et al. “Absorption and Directed Jónsson Terms.” <i>Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science</i>, edited by J Czelakowski, vol. 16, Springer Nature, 2018, pp. 203–20, doi:<a href=\"https://doi.org/10.1007/978-3-319-74772-9_7\">10.1007/978-3-319-74772-9_7</a>.","ieee":"A. Kazda, M. Kozik, R. McKenzie, and M. Moore, “Absorption and directed Jónsson terms,” in <i>Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science</i>, vol. 16, J. Czelakowski, Ed. Cham: Springer Nature, 2018, pp. 203–220.","apa":"Kazda, A., Kozik, M., McKenzie, R., &#38; Moore, M. (2018). Absorption and directed Jónsson terms. In J. Czelakowski (Ed.), <i>Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science</i> (Vol. 16, pp. 203–220). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-74772-9_7\">https://doi.org/10.1007/978-3-319-74772-9_7</a>","chicago":"Kazda, Alexandr, Marcin Kozik, Ralph McKenzie, and Matthew Moore. “Absorption and Directed Jónsson Terms.” In <i>Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science</i>, edited by J Czelakowski, 16:203–20. OCTR. Cham: Springer Nature, 2018. <a href=\"https://doi.org/10.1007/978-3-319-74772-9_7\">https://doi.org/10.1007/978-3-319-74772-9_7</a>.","ama":"Kazda A, Kozik M, McKenzie R, Moore M. Absorption and directed Jónsson terms. In: Czelakowski J, ed. <i>Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science</i>. Vol 16. OCTR. Cham: Springer Nature; 2018:203-220. doi:<a href=\"https://doi.org/10.1007/978-3-319-74772-9_7\">10.1007/978-3-319-74772-9_7</a>","ista":"Kazda A, Kozik M, McKenzie R, Moore M. 2018.Absorption and directed Jónsson terms. In: Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science. vol. 16, 203–220."},"department":[{"_id":"VlKo"}],"date_updated":"2023-09-05T15:37:18Z","status":"public","publication_identifier":{"issn":["2211-2758"],"eissn":["2211-2766"],"eisbn":["9783319747729"],"isbn":["9783319747712"]},"main_file_link":[{"url":"https://arxiv.org/abs/1502.01072","open_access":"1"}],"type":"book_chapter","_id":"10864","date_created":"2022-03-18T10:30:32Z","volume":16,"article_processing_charge":"No","language":[{"iso":"eng"}],"month":"03","author":[{"full_name":"Kazda, Alexandr","id":"3B32BAA8-F248-11E8-B48F-1D18A9856A87","last_name":"Kazda","first_name":"Alexandr"},{"last_name":"Kozik","first_name":"Marcin","full_name":"Kozik, Marcin"},{"first_name":"Ralph","last_name":"McKenzie","full_name":"McKenzie, Ralph"},{"full_name":"Moore, Matthew","last_name":"Moore","first_name":"Matthew"}],"place":"Cham","oa_version":"Preprint","quality_controlled":"1"},{"title":"Significance of whole-genome duplications on the emergence of evolutionary novelties","publisher":"Oxford University Press","date_published":"2018-09-01T00:00:00Z","pmid":1,"isi":1,"abstract":[{"text":"Acquisition of evolutionary novelties is a fundamental process for adapting to the external environment and invading new niches and results in the diversification of life, which we can see in the world today. How such novel phenotypic traits are acquired in the course of evolution and are built up in developing embryos has been a central question in biology. Whole-genome duplication (WGD) is a process of genome doubling that supplies raw genetic materials and increases genome complexity. Recently, it has been gradually revealed that WGD and subsequent fate changes of duplicated genes can facilitate phenotypic evolution. Here, we review the current understanding of the relationship between WGD and the acquisition of evolutionary novelties. We show some examples of this link and discuss how WGD and subsequent duplicated genes can facilitate phenotypic evolution as well as when such genomic doubling can be advantageous for adaptation.","lang":"eng"}],"publication_status":"published","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"pmid":["29579140"],"isi":["000456054400004"]},"citation":{"mla":"Yuuta, Moriyama, and Kazuko Koshiba-Takeuchi. “Significance of Whole-Genome Duplications on the Emergence of Evolutionary Novelties.” <i>Briefings in Functional Genomics</i>, vol. 17, no. 5, Oxford University Press, 2018, pp. 329–38, doi:<a href=\"https://doi.org/10.1093/bfgp/ely007\">10.1093/bfgp/ely007</a>.","short":"M. Yuuta, K. Koshiba-Takeuchi, Briefings in Functional Genomics 17 (2018) 329–338.","chicago":"Yuuta, Moriyama, and Kazuko Koshiba-Takeuchi. “Significance of Whole-Genome Duplications on the Emergence of Evolutionary Novelties.” <i>Briefings in Functional Genomics</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/bfgp/ely007\">https://doi.org/10.1093/bfgp/ely007</a>.","ama":"Yuuta M, Koshiba-Takeuchi K. Significance of whole-genome duplications on the emergence of evolutionary novelties. <i>Briefings in Functional Genomics</i>. 2018;17(5):329-338. doi:<a href=\"https://doi.org/10.1093/bfgp/ely007\">10.1093/bfgp/ely007</a>","ista":"Yuuta M, Koshiba-Takeuchi K. 2018. Significance of whole-genome duplications on the emergence of evolutionary novelties. Briefings in Functional Genomics. 17(5), 329–338.","apa":"Yuuta, M., &#38; Koshiba-Takeuchi, K. (2018). Significance of whole-genome duplications on the emergence of evolutionary novelties. <i>Briefings in Functional Genomics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/bfgp/ely007\">https://doi.org/10.1093/bfgp/ely007</a>","ieee":"M. Yuuta and K. Koshiba-Takeuchi, “Significance of whole-genome duplications on the emergence of evolutionary novelties,” <i>Briefings in Functional Genomics</i>, vol. 17, no. 5. Oxford University Press, pp. 329–338, 2018."},"date_updated":"2023-09-19T15:11:22Z","department":[{"_id":"CaHe"}],"publication":"Briefings in Functional Genomics","intvolume":"        17","keyword":["Genetics","Molecular Biology","Biochemistry","General Medicine"],"scopus_import":"1","day":"01","doi":"10.1093/bfgp/ely007","year":"2018","page":"329-338","acknowledgement":"This work was supported by JSPS overseas research fellowships (Y.M.) and SENSHIN Medical Research Foundation (K.K.T.).","oa":1,"article_processing_charge":"No","volume":17,"language":[{"iso":"eng"}],"issue":"5","month":"09","author":[{"full_name":"Yuuta, Moriyama","id":"4968E7C8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2853-8051","first_name":"Moriyama","last_name":"Yuuta"},{"last_name":"Koshiba-Takeuchi","first_name":"Kazuko","full_name":"Koshiba-Takeuchi, Kazuko"}],"oa_version":"Published Version","quality_controlled":"1","status":"public","main_file_link":[{"url":"https://doi.org/10.1093/bfgp/ely007","open_access":"1"}],"publication_identifier":{"eissn":["2041-2657"],"issn":["2041-2649"]},"_id":"10880","type":"journal_article","article_type":"original","date_created":"2022-03-18T12:40:35Z"},{"isi":1,"publication_status":"published","abstract":[{"lang":"eng","text":"Strigolactones (SLs) are a relatively recent addition to the list of plant hormones that control different aspects of plant development. SL signalling is perceived by an α/β hydrolase, DWARF 14 (D14). A close homolog of D14, KARRIKIN INSENSTIVE2 (KAI2), is involved in perception of an uncharacterized molecule called karrikin (KAR). Recent studies in Arabidopsis identified the SUPPRESSOR OF MAX2 1 (SMAX1) and SMAX1-LIKE 7 (SMXL7) to be potential SCF–MAX2 complex-mediated proteasome targets of KAI2 and D14, respectively. Genetic studies on SMXL7 and SMAX1 demonstrated distinct developmental roles for each, but very little is known about these repressors in terms of their sequence features. In this study, we performed an extensive comparative analysis of SMXLs and determined their phylogenetic and evolutionary history in the plant lineage. Our results show that SMXL family members can be sub-divided into four distinct phylogenetic clades/classes, with an ancient SMAX1. Further, we identified the clade-specific motifs that have evolved and that might act as determinants of SL-KAR signalling specificity. These specificities resulted from functional diversities among the clades. Our results suggest that a gradual co-evolution of SMXL members with their upstream receptors D14/KAI2 provided an increased specificity to both the SL perception and response in land plants."}],"title":"Molecular evolution and diversification of the SMXL gene family","pmid":1,"publisher":"Oxford University Press","date_published":"2018-04-13T00:00:00Z","citation":{"short":"T.R. Moturu, S. Thula, R.K. Singh, T. Nodzyński, R.S. Vařeková, J. Friml, S. Simon, Journal of Experimental Botany 69 (2018) 2367–2378.","mla":"Moturu, Taraka Ramji, et al. “Molecular Evolution and Diversification of the SMXL Gene Family.” <i>Journal of Experimental Botany</i>, vol. 69, no. 9, Oxford University Press, 2018, pp. 2367–78, doi:<a href=\"https://doi.org/10.1093/jxb/ery097\">10.1093/jxb/ery097</a>.","ista":"Moturu TR, Thula S, Singh RK, Nodzyński T, Vařeková RS, Friml J, Simon S. 2018. Molecular evolution and diversification of the SMXL gene family. Journal of Experimental Botany. 69(9), 2367–2378.","ama":"Moturu TR, Thula S, Singh RK, et al. Molecular evolution and diversification of the SMXL gene family. <i>Journal of Experimental Botany</i>. 2018;69(9):2367-2378. doi:<a href=\"https://doi.org/10.1093/jxb/ery097\">10.1093/jxb/ery097</a>","chicago":"Moturu, Taraka Ramji, Sravankumar Thula, Ravi Kumar Singh, Tomasz Nodzyński, Radka Svobodová Vařeková, Jiří Friml, and Sibu Simon. “Molecular Evolution and Diversification of the SMXL Gene Family.” <i>Journal of Experimental Botany</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/jxb/ery097\">https://doi.org/10.1093/jxb/ery097</a>.","apa":"Moturu, T. R., Thula, S., Singh, R. K., Nodzyński, T., Vařeková, R. S., Friml, J., &#38; Simon, S. (2018). Molecular evolution and diversification of the SMXL gene family. <i>Journal of Experimental Botany</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/jxb/ery097\">https://doi.org/10.1093/jxb/ery097</a>","ieee":"T. R. Moturu <i>et al.</i>, “Molecular evolution and diversification of the SMXL gene family,” <i>Journal of Experimental Botany</i>, vol. 69, no. 9. Oxford University Press, pp. 2367–2378, 2018."},"department":[{"_id":"JiFr"}],"date_updated":"2025-05-07T11:12:33Z","external_id":{"pmid":["29538714"],"isi":["000430727000016"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","scopus_import":"1","keyword":["Plant Science","Physiology"],"publication":"Journal of Experimental Botany","intvolume":"        69","year":"2018","doi":"10.1093/jxb/ery097","page":"2367-2378","day":"13","acknowledgement":"This project received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Actions and it is co-financed by the South Moravian Region under grant agreement No. 665860 (SS). Access to computing and storage facilities owned by parties and projects contributing to the national grid infrastructure, MetaCentrum, provided under the program ‘Projects of Large Infrastructure for Research, Development, and Innovations’ (LM2010005) was greatly appreciated (RSV). The project was funded by The Ministry of Education, Youth and Sports/MES of the Czech Republic under the project CEITEC 2020 (LQ1601) (TN, TRM). JF was supported by the European Research Council (project ERC-2011-StG 20101109-PSDP) and the Czech Science Foundation GAČR (GA13-40637S). We thank Dr Kamel Chibani for active discussions on the evolutionary analysis and Nandan Mysore Vardarajan for his critical comments on the manuscript. This article reflects\r\nonly the authors’ views, and the EU is not responsible for any use that may be made of the information it contains. ","issue":"9","month":"04","volume":69,"article_processing_charge":"No","language":[{"iso":"eng"}],"oa_version":"None","project":[{"name":"Polarity and subcellular dynamics in plants","_id":"25716A02-B435-11E9-9278-68D0E5697425","grant_number":"282300","call_identifier":"FP7"}],"quality_controlled":"1","author":[{"full_name":"Moturu, Taraka Ramji","last_name":"Moturu","first_name":"Taraka Ramji"},{"full_name":"Thula, Sravankumar","last_name":"Thula","first_name":"Sravankumar"},{"first_name":"Ravi Kumar","last_name":"Singh","full_name":"Singh, Ravi Kumar"},{"full_name":"Nodzyński, Tomasz","first_name":"Tomasz","last_name":"Nodzyński"},{"full_name":"Vařeková, Radka Svobodová","first_name":"Radka Svobodová","last_name":"Vařeková"},{"orcid":"0000-0002-8302-7596","last_name":"Friml","first_name":"Jiří","full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Simon, Sibu","first_name":"Sibu","last_name":"Simon"}],"ec_funded":1,"article_type":"original","type":"journal_article","_id":"10881","date_created":"2022-03-18T12:43:22Z","status":"public","publication_identifier":{"issn":["0022-0957"],"eissn":["1460-2431"]}},{"quality_controlled":"1","oa_version":"Preprint","author":[{"first_name":"Jasper","last_name":"Uijlings","full_name":"Uijlings, Jasper"},{"last_name":"Konyushkova","first_name":"Ksenia","full_name":"Konyushkova, Ksenia"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887"},{"last_name":"Ferrari","first_name":"Vittorio","full_name":"Ferrari, Vittorio"}],"month":"12","language":[{"iso":"eng"}],"article_processing_charge":"No","date_created":"2022-03-18T12:45:09Z","_id":"10882","type":"conference","publication_identifier":{"eissn":["2575-7075"],"isbn":["9781538664209"]},"status":"public","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.1712.08087"}],"conference":{"location":"Salt Lake City, UT, United States","name":"CVF: Conference on Computer Vision and Pattern Recognition","end_date":"2018-06-23","start_date":"2018-06-18"},"date_updated":"2023-09-19T15:11:49Z","department":[{"_id":"ChLa"}],"citation":{"chicago":"Uijlings, Jasper, Ksenia Konyushkova, Christoph Lampert, and Vittorio Ferrari. “Learning Intelligent Dialogs for Bounding Box Annotation.” In <i>2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, 9175–84. IEEE, 2018. <a href=\"https://doi.org/10.1109/cvpr.2018.00956\">https://doi.org/10.1109/cvpr.2018.00956</a>.","ama":"Uijlings J, Konyushkova K, Lampert C, Ferrari V. Learning intelligent dialogs for bounding box annotation. In: <i>2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>. IEEE; 2018:9175-9184. doi:<a href=\"https://doi.org/10.1109/cvpr.2018.00956\">10.1109/cvpr.2018.00956</a>","ista":"Uijlings J, Konyushkova K, Lampert C, Ferrari V. 2018. Learning intelligent dialogs for bounding box annotation. 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVF: Conference on Computer Vision and Pattern Recognition, 9175–9184.","apa":"Uijlings, J., Konyushkova, K., Lampert, C., &#38; Ferrari, V. (2018). Learning intelligent dialogs for bounding box annotation. In <i>2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i> (pp. 9175–9184). Salt Lake City, UT, United States: IEEE. <a href=\"https://doi.org/10.1109/cvpr.2018.00956\">https://doi.org/10.1109/cvpr.2018.00956</a>","ieee":"J. Uijlings, K. Konyushkova, C. Lampert, and V. Ferrari, “Learning intelligent dialogs for bounding box annotation,” in <i>2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, Salt Lake City, UT, United States, 2018, pp. 9175–9184.","short":"J. Uijlings, K. Konyushkova, C. Lampert, V. Ferrari, in:, 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 9175–9184.","mla":"Uijlings, Jasper, et al. “Learning Intelligent Dialogs for Bounding Box Annotation.” <i>2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, IEEE, 2018, pp. 9175–84, doi:<a href=\"https://doi.org/10.1109/cvpr.2018.00956\">10.1109/cvpr.2018.00956</a>."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"arxiv":["1712.08087"],"isi":["000457843609036"]},"abstract":[{"lang":"eng","text":"We introduce Intelligent Annotation Dialogs for bounding box annotation. We train an agent to automatically choose a sequence of actions for a human annotator to produce a bounding box in a minimal amount of time. Specifically, we consider two actions: box verification [34], where the annotator verifies a box generated by an object detector, and manual box drawing. We explore two kinds of agents, one based on predicting the probability that a box will be positively verified, and the other based on reinforcement learning. We demonstrate that (1) our agents are able to learn efficient annotation strategies in several scenarios, automatically adapting to the image difficulty, the desired quality of the boxes, and the detector strength; (2) in all scenarios the resulting annotation dialogs speed up annotation compared to manual box drawing alone and box verification alone, while also outperforming any fixed combination of verification and drawing in most scenarios; (3) in a realistic scenario where the detector is iteratively re-trained, our agents evolve a series of strategies that reflect the shifting trade-off between verification and drawing as the detector grows stronger."}],"publication_status":"published","isi":1,"date_published":"2018-12-17T00:00:00Z","publisher":"IEEE","title":"Learning intelligent dialogs for bounding box annotation","oa":1,"day":"17","doi":"10.1109/cvpr.2018.00956","page":"9175-9184","year":"2018","scopus_import":"1","arxiv":1,"publication":"2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition"},{"external_id":{"arxiv":["1909.04983"]},"alternative_title":["EPiC Series in Computing"],"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","department":[{"_id":"KrCh"}],"date_updated":"2022-07-29T09:24:31Z","citation":{"short":"K. Chatterjee, W. Dvořák, M.H. Henzinger, A. Svozil, in:, 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, EasyChair, 2018, pp. 233–253.","mla":"Chatterjee, Krishnendu, et al. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” <i>22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning</i>, vol. 57, EasyChair, 2018, pp. 233–53, doi:<a href=\"https://doi.org/10.29007/5z5k\">10.29007/5z5k</a>.","ama":"Chatterjee K, Dvořák W, Henzinger MH, Svozil A. Quasipolynomial set-based symbolic algorithms for parity games. In: <i>22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning</i>. Vol 57. EasyChair; 2018:233-253. doi:<a href=\"https://doi.org/10.29007/5z5k\">10.29007/5z5k</a>","ista":"Chatterjee K, Dvořák W, Henzinger MH, Svozil A. 2018. Quasipolynomial set-based symbolic algorithms for parity games. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning, EPiC Series in Computing, vol. 57, 233–253.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvořák, Monika H Henzinger, and Alexander Svozil. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” In <i>22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning</i>, 57:233–53. EasyChair, 2018. <a href=\"https://doi.org/10.29007/5z5k\">https://doi.org/10.29007/5z5k</a>.","apa":"Chatterjee, K., Dvořák, W., Henzinger, M. H., &#38; Svozil, A. (2018). Quasipolynomial set-based symbolic algorithms for parity games. In <i>22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning</i> (Vol. 57, pp. 233–253). Awassa, Ethiopia: EasyChair. <a href=\"https://doi.org/10.29007/5z5k\">https://doi.org/10.29007/5z5k</a>","ieee":"K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Quasipolynomial set-based symbolic algorithms for parity games,” in <i>22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning</i>, Awassa, Ethiopia, 2018, vol. 57, pp. 233–253."},"publisher":"EasyChair","file_date_updated":"2022-05-17T07:51:08Z","date_published":"2018-10-23T00:00:00Z","title":"Quasipolynomial set-based symbolic algorithms for parity games","publication_status":"published","abstract":[{"lang":"eng","text":"Solving parity games, which are equivalent to modal μ-calculus model checking, is a central algorithmic problem in formal methods, with applications in reactive synthesis, program repair, verification of branching-time properties, etc. Besides the standard compu- tation model with the explicit representation of games, another important theoretical model of computation is that of set-based symbolic algorithms. Set-based symbolic algorithms use basic set operations and one-step predecessor operations on the implicit description of games, rather than the explicit representation. The significance of symbolic algorithms is that they provide scalable algorithms for large finite-state systems, as well as for infinite-state systems with finite quotient. Consider parity games on graphs with n vertices and parity conditions with d priorities. While there is a rich literature of explicit algorithms for parity games, the main results for set-based symbolic algorithms are as follows: (a) the basic algorithm that requires O(nd) symbolic operations and O(d) symbolic space; and (b) an improved algorithm that requires O(nd/3+1) symbolic operations and O(n) symbolic space. In this work, our contributions are as follows: (1) We present a black-box set-based symbolic algorithm based on the explicit progress measure algorithm. Two important consequences of our algorithm are as follows: (a) a set-based symbolic algorithm for parity games that requires quasi-polynomially many symbolic operations and O(n) symbolic space; and (b) any future improvement in progress measure based explicit algorithms immediately imply an efficiency improvement in our set-based symbolic algorithm for parity games. (2) We present a set-based symbolic algorithm that requires quasi-polynomially many symbolic operations and O(d · log n) symbolic space. Moreover, for the important special case of d ≤ log n, our algorithm requires only polynomially many symbolic operations and poly-logarithmic symbolic space."}],"ddc":["000"],"acknowledgement":"A. S. is fully supported by the Vienna Science and Technology Fund (WWTF) through project ICT15-003. K.C. is supported by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Starting grant (279307: Graph Games). For M.H the research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) /ERC Grant Agreement no. 340506.","page":"233-253","year":"2018","doi":"10.29007/5z5k","day":"23","oa":1,"arxiv":1,"intvolume":"        57","publication":"22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning","scopus_import":"1","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"last_name":"Dvořák","first_name":"Wolfgang","full_name":"Dvořák, Wolfgang"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H"},{"first_name":"Alexander","last_name":"Svozil","full_name":"Svozil, Alexander"}],"quality_controlled":"1","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"}],"oa_version":"Published Version","language":[{"iso":"eng"}],"volume":57,"article_processing_charge":"No","month":"10","has_accepted_license":"1","file":[{"access_level":"open_access","file_size":720893,"checksum":"1229aa8640bd6db610c85decf2265480","file_id":"11392","creator":"dernst","relation":"main_file","success":1,"file_name":"2018_EPiCs_Chatterjee.pdf","date_created":"2022-05-17T07:51:08Z","date_updated":"2022-05-17T07:51:08Z","content_type":"application/pdf"}],"publication_identifier":{"issn":["2398-7340"]},"status":"public","date_created":"2022-03-18T12:46:32Z","_id":"10883","type":"conference","conference":{"end_date":"2018-11-21","start_date":"2018-11-17","name":"LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning","location":"Awassa, Ethiopia"},"ec_funded":1},{"publication_status":"published","abstract":[{"lang":"eng","text":"We report on a novel strategy to derive mean-field limits of quantum mechanical systems in which a large number of particles weakly couple to a second-quantized radiation field. The technique combines the method of counting and the coherent state approach to study the growth of the correlations among the particles and in the radiation field. As an instructional example, we derive the Schrödinger–Klein–Gordon system of equations from the Nelson model with ultraviolet cutoff and possibly massless scalar field. In particular, we prove the convergence of the reduced density matrices (of the nonrelativistic particles and the field bosons) associated with the exact time evolution to the projectors onto the solutions of the Schrödinger–Klein–Gordon equations in trace norm. Furthermore, we derive explicit bounds on the rate of convergence of the one-particle reduced density matrix of the nonrelativistic particles in Sobolev norm."}],"publisher":"Springer","date_published":"2018-10-27T00:00:00Z","title":"Mean-field limits of particles in interaction with quantised radiation fields","department":[{"_id":"RoSe"}],"date_updated":"2021-01-12T06:48:16Z","citation":{"short":"N.K. Leopold, P. Pickl, in:, Springer, 2018, pp. 185–214.","mla":"Leopold, Nikolai K., and Peter Pickl. <i>Mean-Field Limits of Particles in Interaction with Quantised Radiation Fields</i>. Vol. 270, Springer, 2018, pp. 185–214, doi:<a href=\"https://doi.org/10.1007/978-3-030-01602-9_9\">10.1007/978-3-030-01602-9_9</a>.","ieee":"N. K. Leopold and P. Pickl, “Mean-field limits of particles in interaction with quantised radiation fields,” presented at the MaLiQS: Macroscopic Limits of Quantum Systems, Munich, Germany, 2018, vol. 270, pp. 185–214.","chicago":"Leopold, Nikolai K, and Peter Pickl. “Mean-Field Limits of Particles in Interaction with Quantised Radiation Fields,” 270:185–214. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-01602-9_9\">https://doi.org/10.1007/978-3-030-01602-9_9</a>.","ista":"Leopold NK, Pickl P. 2018. Mean-field limits of particles in interaction with quantised radiation fields. MaLiQS: Macroscopic Limits of Quantum Systems vol. 270, 185–214.","ama":"Leopold NK, Pickl P. Mean-field limits of particles in interaction with quantised radiation fields. In: Vol 270. Springer; 2018:185-214. doi:<a href=\"https://doi.org/10.1007/978-3-030-01602-9_9\">10.1007/978-3-030-01602-9_9</a>","apa":"Leopold, N. K., &#38; Pickl, P. (2018). Mean-field limits of particles in interaction with quantised radiation fields (Vol. 270, pp. 185–214). Presented at the MaLiQS: Macroscopic Limits of Quantum Systems, Munich, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-030-01602-9_9\">https://doi.org/10.1007/978-3-030-01602-9_9</a>"},"external_id":{"arxiv":["1806.10843"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"arxiv":1,"publist_id":"8045","intvolume":"       270","oa":1,"year":"2018","doi":"10.1007/978-3-030-01602-9_9","day":"27","page":"185 - 214","month":"10","language":[{"iso":"eng"}],"volume":270,"project":[{"call_identifier":"H2020","grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems"}],"quality_controlled":"1","oa_version":"Preprint","author":[{"id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","full_name":"Leopold, Nikolai K","last_name":"Leopold","first_name":"Nikolai K","orcid":"0000-0002-0495-6822"},{"last_name":"Pickl","first_name":"Peter","full_name":"Pickl, Peter"}],"conference":{"end_date":"2017-04-01","start_date":"2017-03-30","location":"Munich, Germany","name":"MaLiQS: Macroscopic Limits of Quantum Systems"},"ec_funded":1,"date_created":"2018-12-11T11:44:08Z","_id":"11","type":"conference","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1806.10843"}],"status":"public"},{"project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa_version":"Submitted Version","author":[{"first_name":"Alexey","last_name":"Bakhirkin","full_name":"Bakhirkin, Alexey"},{"orcid":"0000-0001-5199-3143","first_name":"Thomas","last_name":"Ferrere","full_name":"Ferrere, Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dejan","last_name":"Nickovic","full_name":"Nickovic, Dejan"},{"full_name":"Maler, Oded","first_name":"Oded","last_name":"Maler"},{"full_name":"Asarin, Eugene","first_name":"Eugene","last_name":"Asarin"}],"has_accepted_license":"1","month":"08","file":[{"file_id":"7831","checksum":"436b7574934324cfa7d1d3986fddc65b","creator":"dernst","access_level":"open_access","file_size":374851,"relation":"main_file","file_name":"2018_LNCS_Bakhirkin.pdf","content_type":"application/pdf","date_created":"2020-05-14T11:34:34Z","date_updated":"2020-07-14T12:48:03Z"}],"language":[{"iso":"eng"}],"volume":11022,"article_processing_charge":"No","date_created":"2018-12-11T11:44:31Z","type":"conference","_id":"78","status":"public","publication_identifier":{"isbn":["978-3-030-00150-6"]},"conference":{"end_date":"2018-09-06","start_date":"2018-09-04","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","location":"Bejing, China"},"department":[{"_id":"ToHe"}],"date_updated":"2023-09-13T09:35:46Z","citation":{"chicago":"Bakhirkin, Alexey, Thomas Ferrere, Dejan Nickovic, Oded Maler, and Eugene Asarin. “Online Timed Pattern Matching Using Automata,” 11022:215–32. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-00151-3_13\">https://doi.org/10.1007/978-3-030-00151-3_13</a>.","ista":"Bakhirkin A, Ferrere T, Nickovic D, Maler O, Asarin E. 2018. Online timed pattern matching using automata. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 11022, 215–232.","ama":"Bakhirkin A, Ferrere T, Nickovic D, Maler O, Asarin E. Online timed pattern matching using automata. In: Vol 11022. Springer; 2018:215-232. doi:<a href=\"https://doi.org/10.1007/978-3-030-00151-3_13\">10.1007/978-3-030-00151-3_13</a>","apa":"Bakhirkin, A., Ferrere, T., Nickovic, D., Maler, O., &#38; Asarin, E. (2018). Online timed pattern matching using automata (Vol. 11022, pp. 215–232). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China: Springer. <a href=\"https://doi.org/10.1007/978-3-030-00151-3_13\">https://doi.org/10.1007/978-3-030-00151-3_13</a>","ieee":"A. Bakhirkin, T. Ferrere, D. Nickovic, O. Maler, and E. Asarin, “Online timed pattern matching using automata,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China, 2018, vol. 11022, pp. 215–232.","short":"A. Bakhirkin, T. Ferrere, D. Nickovic, O. Maler, E. Asarin, in:, Springer, 2018, pp. 215–232.","mla":"Bakhirkin, Alexey, et al. <i>Online Timed Pattern Matching Using Automata</i>. Vol. 11022, Springer, 2018, pp. 215–32, doi:<a href=\"https://doi.org/10.1007/978-3-030-00151-3_13\">10.1007/978-3-030-00151-3_13</a>."},"alternative_title":["LNCS"],"external_id":{"isi":["000884993200013"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_status":"published","abstract":[{"lang":"eng","text":"We provide a procedure for detecting the sub-segments of an incrementally observed Boolean signal ω that match a given temporal pattern ϕ. As a pattern specification language, we use timed regular expressions, a formalism well-suited for expressing properties of concurrent asynchronous behaviors embedded in metric time. We construct a timed automaton accepting the timed language denoted by ϕ and modify it slightly for the purpose of matching. We then apply zone-based reachability computation to this automaton while it reads ω, and retrieve all the matching segments from the results. Since the procedure is automaton based, it can be applied to patterns specified by other formalisms such as timed temporal logics reducible to timed automata or directly encoded as timed automata. The procedure has been implemented and its performance on synthetic examples is demonstrated."}],"isi":1,"ddc":["000"],"file_date_updated":"2020-07-14T12:48:03Z","date_published":"2018-08-26T00:00:00Z","publisher":"Springer","title":"Online timed pattern matching using automata","oa":1,"doi":"10.1007/978-3-030-00151-3_13","day":"26","page":"215 - 232","year":"2018","scopus_import":"1","publist_id":"7976","intvolume":"     11022"},{"quality_controlled":"1","department":[{"_id":"DaAl"}],"date_updated":"2023-02-23T13:18:41Z","oa_version":"Published Version","citation":{"short":"A. Polino, R. Pascanu, D.-A. Alistarh, in:, 6th International Conference on Learning Representations, 2018.","mla":"Polino, Antonio, et al. “Model Compression via Distillation and Quantization.” <i>6th International Conference on Learning Representations</i>, 2018.","ieee":"A. Polino, R. Pascanu, and D.-A. Alistarh, “Model compression via distillation and quantization,” in <i>6th International Conference on Learning Representations</i>, Vancouver, Canada, 2018.","chicago":"Polino, Antonio, Razvan Pascanu, and Dan-Adrian Alistarh. “Model Compression via Distillation and Quantization.” In <i>6th International Conference on Learning Representations</i>, 2018.","ista":"Polino A, Pascanu R, Alistarh D-A. 2018. Model compression via distillation and quantization. 6th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","ama":"Polino A, Pascanu R, Alistarh D-A. Model compression via distillation and quantization. In: <i>6th International Conference on Learning Representations</i>. ; 2018.","apa":"Polino, A., Pascanu, R., &#38; Alistarh, D.-A. (2018). Model compression via distillation and quantization. In <i>6th International Conference on Learning Representations</i>. Vancouver, Canada."},"author":[{"full_name":"Polino, Antonio","last_name":"Polino","first_name":"Antonio"},{"full_name":"Pascanu, Razvan","first_name":"Razvan","last_name":"Pascanu"},{"last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"}],"external_id":{"arxiv":["1802.05668"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"05","has_accepted_license":"1","publication_status":"published","abstract":[{"text":"Deep neural networks (DNNs) continue to make significant advances, solving tasks from image classification to translation or reinforcement learning. One aspect of the field receiving considerable attention is efficiently executing deep models in resource-constrained environments, such as mobile or embedded devices. This paper focuses on this problem, and proposes two new compression methods, which jointly leverage weight quantization and distillation of larger teacher networks into smaller student networks. The first method we propose is called quantized distillation and leverages distillation during the training process, by incorporating distillation loss, expressed with respect to the teacher, into the training of a student network whose weights are quantized to a limited set of levels. The second method,  differentiable quantization, optimizes the location of quantization points through stochastic gradient descent, to better fit the behavior of the teacher model.  We validate both methods through experiments on convolutional and recurrent architectures. We show that quantized shallow students can reach similar accuracy levels to full-precision teacher models, while providing order of magnitude compression, and inference speedup that is linear in the depth reduction. In sum, our results enable DNNs for resource-constrained environments to leverage architecture and accuracy advances developed on more powerful devices.","lang":"eng"}],"file":[{"checksum":"a4336c167978e81891970e4e4517a8c3","file_id":"7894","creator":"dernst","access_level":"open_access","file_size":308339,"relation":"main_file","file_name":"2018_ICLR_Polino.pdf","content_type":"application/pdf","date_created":"2020-05-26T13:02:00Z","date_updated":"2020-07-14T12:48:03Z"}],"ddc":["000"],"file_date_updated":"2020-07-14T12:48:03Z","language":[{"iso":"eng"}],"date_published":"2018-05-01T00:00:00Z","title":"Model compression via distillation and quantization","article_processing_charge":"No","oa":1,"date_created":"2020-05-10T22:00:51Z","type":"conference","_id":"7812","status":"public","year":"2018","day":"01","scopus_import":1,"arxiv":1,"conference":{"location":"Vancouver, Canada","name":"ICLR: International Conference on Learning Representations","end_date":"2018-05-03","start_date":"2018-04-30"},"publication":"6th International Conference on Learning Representations"},{"date_created":"2018-12-11T11:44:31Z","type":"conference","_id":"79","status":"public","main_file_link":[{"url":"https://arxiv.org/abs/1806.05126","open_access":"1"}],"conference":{"end_date":"2018-09-07","start_date":"2018-09-04","name":"QEST: Quantitative Evaluation of Systems","location":"Beijing, China"},"quality_controlled":"1","oa_version":"Preprint","author":[{"last_name":"Arming","first_name":"Sebastian","full_name":"Arming, Sebastian"},{"first_name":"Ezio","last_name":"Bartocci","full_name":"Bartocci, Ezio"},{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"id":"4524F760-F248-11E8-B48F-1D18A9856A87","full_name":"Katoen, Joost P","first_name":"Joost P","last_name":"Katoen"},{"last_name":"Sokolova","first_name":"Ana","full_name":"Sokolova, Ana"}],"month":"08","language":[{"iso":"eng"}],"article_processing_charge":"No","volume":11024,"oa":1,"day":"15","page":"53-70","year":"2018","doi":"10.1007/978-3-319-99154-2_4","scopus_import":"1","intvolume":"     11024","publist_id":"7975","arxiv":1,"date_updated":"2023-09-13T09:38:28Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"citation":{"ieee":"S. Arming, E. Bartocci, K. Chatterjee, J. P. Katoen, and A. Sokolova, “Parameter-independent strategies for pMDPs via POMDPs,” presented at the QEST: Quantitative Evaluation of Systems, Beijing, China, 2018, vol. 11024, pp. 53–70.","apa":"Arming, S., Bartocci, E., Chatterjee, K., Katoen, J. P., &#38; Sokolova, A. (2018). Parameter-independent strategies for pMDPs via POMDPs (Vol. 11024, pp. 53–70). Presented at the QEST: Quantitative Evaluation of Systems, Beijing, China: Springer. <a href=\"https://doi.org/10.1007/978-3-319-99154-2_4\">https://doi.org/10.1007/978-3-319-99154-2_4</a>","ista":"Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. 2018. Parameter-independent strategies for pMDPs via POMDPs. QEST: Quantitative Evaluation of Systems, LNCS, vol. 11024, 53–70.","chicago":"Arming, Sebastian, Ezio Bartocci, Krishnendu Chatterjee, Joost P Katoen, and Ana Sokolova. “Parameter-Independent Strategies for PMDPs via POMDPs,” 11024:53–70. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-99154-2_4\">https://doi.org/10.1007/978-3-319-99154-2_4</a>.","ama":"Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. Parameter-independent strategies for pMDPs via POMDPs. In: Vol 11024. Springer; 2018:53-70. doi:<a href=\"https://doi.org/10.1007/978-3-319-99154-2_4\">10.1007/978-3-319-99154-2_4</a>","mla":"Arming, Sebastian, et al. <i>Parameter-Independent Strategies for PMDPs via POMDPs</i>. Vol. 11024, Springer, 2018, pp. 53–70, doi:<a href=\"https://doi.org/10.1007/978-3-319-99154-2_4\">10.1007/978-3-319-99154-2_4</a>.","short":"S. Arming, E. Bartocci, K. Chatterjee, J.P. Katoen, A. Sokolova, in:, Springer, 2018, pp. 53–70."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"arxiv":["1806.05126"],"isi":["000548912200004"]},"alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Markov Decision Processes (MDPs) are a popular class of models suitable for solving control decision problems in probabilistic reactive systems. We consider parametric MDPs (pMDPs) that include parameters in some of the transition probabilities to account for stochastic uncertainties of the environment such as noise or input disturbances. We study pMDPs with reachability objectives where the parameter values are unknown and impossible to measure directly during execution, but there is a probability distribution known over the parameter values. We study for the first time computing parameter-independent strategies that are expectation optimal, i.e., optimize the expected reachability probability under the probability distribution over the parameters. We present an encoding of our problem to partially observable MDPs (POMDPs), i.e., a reduction of our problem to computing optimal strategies in POMDPs. We evaluate our method experimentally on several benchmarks: a motivating (repeated) learner model; a series of benchmarks of varying configurations of a robot moving on a grid; and a consensus protocol."}],"publication_status":"published","isi":1,"publisher":"Springer","date_published":"2018-08-15T00:00:00Z","title":"Parameter-independent strategies for pMDPs via POMDPs"},{"date_created":"2018-12-11T11:48:36Z","type":"journal_article","_id":"806","publication_identifier":{"issn":["1545-4487"]},"status":"public","month":"01","language":[{"iso":"eng"}],"volume":63,"article_processing_charge":"No","quality_controlled":"1","oa_version":"None","author":[{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","full_name":"Cremer, Sylvia","last_name":"Cremer","first_name":"Sylvia","orcid":"0000-0002-2193-3868"},{"id":"3C7F4840-F248-11E8-B48F-1D18A9856A87","full_name":"Pull, Christopher","first_name":"Christopher","last_name":"Pull","orcid":"0000-0003-1122-3982"},{"orcid":"0000-0002-3712-925X","last_name":"Fürst","first_name":"Matthias","full_name":"Fürst, Matthias","id":"393B1196-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":"1","related_material":{"record":[{"relation":"dissertation_contains","id":"819","status":"public"}]},"publist_id":"6844","intvolume":"        63","publication":"Annual Review of Entomology","year":"2018","page":"105 - 123","day":"07","doi":"10.1146/annurev-ento-020117-043110","publication_status":"published","abstract":[{"text":"Social insect colonies have evolved many collectively performed adaptations that reduce the impact of infectious disease and that are expected to maximize their fitness. This colony-level protection is termed social immunity, and it enhances the health and survival of the colony. In this review, we address how social immunity emerges from its mechanistic components to produce colony-level disease avoidance, resistance, and tolerance. To understand the evolutionary causes and consequences of social immunity, we highlight the need for studies that evaluate the effects of social immunity on colony fitness. We discuss the role that host life history and ecology have on predicted eco-evolutionary dynamics, which differ among the social insect lineages. Throughout the review, we highlight current gaps in our knowledge and promising avenues for future research, which we hope will bring us closer to an integrated understanding of socio-eco-evo-immunology.","lang":"eng"}],"isi":1,"publisher":"Annual Reviews","date_published":"2018-01-07T00:00:00Z","title":"Social immunity: Emergence and evolution of colony-level disease protection","department":[{"_id":"SyCr"}],"date_updated":"2023-09-19T09:29:45Z","citation":{"ista":"Cremer S, Pull C, Fürst M. 2018. Social immunity: Emergence and evolution of colony-level disease protection. Annual Review of Entomology. 63, 105–123.","chicago":"Cremer, Sylvia, Christopher Pull, and Matthias Fürst. “Social Immunity: Emergence and Evolution of Colony-Level Disease Protection.” <i>Annual Review of Entomology</i>. Annual Reviews, 2018. <a href=\"https://doi.org/10.1146/annurev-ento-020117-043110\">https://doi.org/10.1146/annurev-ento-020117-043110</a>.","ama":"Cremer S, Pull C, Fürst M. Social immunity: Emergence and evolution of colony-level disease protection. <i>Annual Review of Entomology</i>. 2018;63:105-123. doi:<a href=\"https://doi.org/10.1146/annurev-ento-020117-043110\">10.1146/annurev-ento-020117-043110</a>","apa":"Cremer, S., Pull, C., &#38; Fürst, M. (2018). Social immunity: Emergence and evolution of colony-level disease protection. <i>Annual Review of Entomology</i>. Annual Reviews. <a href=\"https://doi.org/10.1146/annurev-ento-020117-043110\">https://doi.org/10.1146/annurev-ento-020117-043110</a>","ieee":"S. Cremer, C. Pull, and M. Fürst, “Social immunity: Emergence and evolution of colony-level disease protection,” <i>Annual Review of Entomology</i>, vol. 63. Annual Reviews, pp. 105–123, 2018.","mla":"Cremer, Sylvia, et al. “Social Immunity: Emergence and Evolution of Colony-Level Disease Protection.” <i>Annual Review of Entomology</i>, vol. 63, Annual Reviews, 2018, pp. 105–23, doi:<a href=\"https://doi.org/10.1146/annurev-ento-020117-043110\">10.1146/annurev-ento-020117-043110</a>.","short":"S. Cremer, C. Pull, M. Fürst, Annual Review of Entomology 63 (2018) 105–123."},"external_id":{"isi":["000424633700008"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"scopus_import":"1","publist_id":"7973","intvolume":"     11022","oa":1,"day":"26","doi":"10.1007/978-3-030-00151-3_4","page":"53 - 70","year":"2018","publication_status":"published","abstract":[{"text":"We solve the offline monitoring problem for timed propositional temporal logic (TPTL), interpreted over dense-time Boolean signals. The variant of TPTL we consider extends linear temporal logic (LTL) with clock variables and reset quantifiers, providing a mechanism to specify real-time constraints. We first describe a general monitoring algorithm based on an exhaustive computation of the set of satisfying clock assignments as a finite union of zones. We then propose a specialized monitoring algorithm for the one-variable case using a partition of the time domain based on the notion of region equivalence, whose complexity is linear in the length of the signal, thereby generalizing a known result regarding the monitoring of metric temporal logic (MTL). The region and zone representations of time constraints are known from timed automata verification and can also be used in the discrete-time case. Our prototype implementation appears to outperform previous discrete-time implementations of TPTL monitoring,","lang":"eng"}],"isi":1,"ddc":["000"],"date_published":"2018-08-26T00:00:00Z","publisher":"Springer","file_date_updated":"2020-10-09T06:24:21Z","title":"Monitoring temporal logic with clock variables","department":[{"_id":"ToHe"}],"date_updated":"2023-09-13T08:58:34Z","citation":{"ista":"Elgyütt A, Ferrere T, Henzinger TA. 2018. Monitoring temporal logic with clock variables. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 11022, 53–70.","chicago":"Elgyütt, Adrian, Thomas Ferrere, and Thomas A Henzinger. “Monitoring Temporal Logic with Clock Variables,” 11022:53–70. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-00151-3_4\">https://doi.org/10.1007/978-3-030-00151-3_4</a>.","ama":"Elgyütt A, Ferrere T, Henzinger TA. Monitoring temporal logic with clock variables. In: Vol 11022. Springer; 2018:53-70. doi:<a href=\"https://doi.org/10.1007/978-3-030-00151-3_4\">10.1007/978-3-030-00151-3_4</a>","apa":"Elgyütt, A., Ferrere, T., &#38; Henzinger, T. A. (2018). Monitoring temporal logic with clock variables (Vol. 11022, pp. 53–70). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Beijing, China: Springer. <a href=\"https://doi.org/10.1007/978-3-030-00151-3_4\">https://doi.org/10.1007/978-3-030-00151-3_4</a>","ieee":"A. Elgyütt, T. Ferrere, and T. A. Henzinger, “Monitoring temporal logic with clock variables,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Beijing, China, 2018, vol. 11022, pp. 53–70.","mla":"Elgyütt, Adrian, et al. <i>Monitoring Temporal Logic with Clock Variables</i>. Vol. 11022, Springer, 2018, pp. 53–70, doi:<a href=\"https://doi.org/10.1007/978-3-030-00151-3_4\">10.1007/978-3-030-00151-3_4</a>.","short":"A. Elgyütt, T. Ferrere, T.A. Henzinger, in:, Springer, 2018, pp. 53–70."},"alternative_title":["LNCS"],"external_id":{"isi":["000884993200004"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","conference":{"end_date":"2018-09-06","start_date":"2018-09-04","location":"Beijing, China","name":"FORMATS: Formal Modeling and Analysis of Timed Systems"},"date_created":"2018-12-11T11:44:31Z","type":"conference","_id":"81","status":"public","has_accepted_license":"1","month":"08","file":[{"content_type":"application/pdf","date_updated":"2020-10-09T06:24:21Z","date_created":"2020-10-09T06:24:21Z","file_name":"2018_LNCS_Elgyuett.pdf","relation":"main_file","success":1,"creator":"dernst","checksum":"e5d81c9b50a6bd9d8a2c16953aad7e23","file_id":"8638","file_size":537219,"access_level":"open_access"}],"language":[{"iso":"eng"}],"volume":11022,"article_processing_charge":"No","quality_controlled":"1","project":[{"call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms"},{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"oa_version":"Submitted Version","author":[{"id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87","full_name":"Elgyütt, Adrian","last_name":"Elgyütt","first_name":"Adrian"},{"orcid":"0000-0001-5199-3143","first_name":"Thomas","last_name":"Ferrere","full_name":"Ferrere, Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"}]},{"oa_version":"Published Version","quality_controlled":"1","author":[{"first_name":"Waqas","last_name":"Chaudhry","full_name":"Chaudhry, Waqas"},{"full_name":"Pleska, Maros","id":"4569785E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7460-7479","last_name":"Pleska","first_name":"Maros"},{"full_name":"Shah, Nilang","last_name":"Shah","first_name":"Nilang"},{"last_name":"Weiss","first_name":"Howard","full_name":"Weiss, Howard"},{"full_name":"Mccall, Ingrid","first_name":"Ingrid","last_name":"Mccall"},{"full_name":"Meyer, Justin","first_name":"Justin","last_name":"Meyer"},{"first_name":"Animesh","last_name":"Gupta","full_name":"Gupta, Animesh"},{"last_name":"Guet","first_name":"Calin C","orcid":"0000-0001-6220-2052","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","full_name":"Guet, Calin C"},{"full_name":"Levin, Bruce","first_name":"Bruce","last_name":"Levin"}],"issue":"8","file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:48:10Z","date_created":"2018-12-17T12:55:31Z","file_name":"2018_Plos_Chaudhry.pdf","relation":"main_file","creator":"dernst","checksum":"527076f78265cd4ea192cd1569851587","file_id":"5706","file_size":4007095,"access_level":"open_access"}],"article_number":"2005971","has_accepted_license":"1","month":"08","article_processing_charge":"Yes","volume":16,"language":[{"iso":"eng"}],"type":"journal_article","_id":"82","date_created":"2018-12-11T11:44:32Z","license":"https://creativecommons.org/licenses/by/4.0/","status":"public","citation":{"short":"W. Chaudhry, M. Pleska, N. Shah, H. Weiss, I. Mccall, J. Meyer, A. Gupta, C.C. Guet, B. Levin, PLoS Biology 16 (2018).","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>.","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>.","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.","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>","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."},"date_updated":"2023-09-13T08:45:41Z","department":[{"_id":"CaGu"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"external_id":{"isi":["000443383300024"]},"ddc":["570"],"isi":1,"abstract":[{"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.”.","lang":"eng"}],"publication_status":"published","title":"Leaky resistance and the conditions for the existence of lytic bacteriophage","file_date_updated":"2020-07-14T12:48:10Z","publisher":"Public Library of Science","date_published":"2018-08-16T00:00:00Z","oa":1,"year":"2018","day":"16","doi":"10.1371/journal.pbio.2005971","related_material":{"record":[{"relation":"research_data","id":"9810","status":"public"}]},"scopus_import":"1","publication":"PLoS Biology","intvolume":"        16","publist_id":"7972"},{"author":[{"id":"40297222-F248-11E8-B48F-1D18A9856A87","full_name":"Abusalah, Hamza M","last_name":"Abusalah","first_name":"Hamza M"}],"oa_version":"Published Version","project":[{"name":"Provable Security for Physical Cryptography","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:48:11Z","date_created":"2019-04-09T06:43:41Z","file_name":"2018_Thesis_Abusalah.pdf","relation":"main_file","creator":"dernst","checksum":"c4b5f7d111755d1396787f41886fc674","file_id":"6245","file_size":876241,"access_level":"open_access"},{"file_name":"2018_Thesis_Abusalah_source.tar.gz","date_updated":"2020-07-14T12:48:11Z","date_created":"2019-04-09T06:43:41Z","content_type":"application/x-gzip","file_size":2029190,"access_level":"closed","creator":"dernst","file_id":"6246","checksum":"0f382ac56b471c48fd907d63eb87dafe","relation":"source_file"}],"has_accepted_license":"1","month":"09","status":"public","publication_identifier":{"issn":["2663-337X"]},"type":"dissertation","_id":"83","date_created":"2018-12-11T11:44:32Z","ec_funded":1,"pubrep_id":"1046","alternative_title":["ISTA Thesis"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","degree_awarded":"PhD","citation":{"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.","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>","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>","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>.","ieee":"H. M. Abusalah, “Proof systems for sustainable decentralized cryptocurrencies,” Institute of Science and Technology Austria, 2018."},"department":[{"_id":"KrPi"}],"date_updated":"2023-09-07T12:30:23Z","title":"Proof systems for sustainable decentralized cryptocurrencies","date_published":"2018-09-05T00:00:00Z","file_date_updated":"2020-07-14T12:48:11Z","publisher":"Institute of Science and Technology Austria","ddc":["004"],"publication_status":"published","abstract":[{"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.","lang":"eng"}],"page":"59","year":"2018","doi":"10.15479/AT:ISTA:TH_1046","day":"05","oa":1,"publist_id":"7971","supervisor":[{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654"}],"related_material":{"record":[{"id":"1229","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"1235","status":"public"},{"status":"public","id":"1236","relation":"part_of_dissertation"},{"status":"public","id":"559","relation":"part_of_dissertation"}]}},{"quality_controlled":"1","project":[{"name":"NSERC Postdoctoral fellowship","_id":"26450934-B435-11E9-9278-68D0E5697425"}],"oa_version":"Preprint","author":[{"full_name":"Gilad, Eran","last_name":"Gilad","first_name":"Eran"},{"first_name":"Trevor A","last_name":"Brown","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","full_name":"Brown, Trevor A"},{"last_name":"Oskin","first_name":"Mark","full_name":"Oskin, Mark"},{"last_name":"Etsion","first_name":"Yoav","full_name":"Etsion, Yoav"}],"has_accepted_license":"1","month":"08","file":[{"date_updated":"2020-07-14T12:48:14Z","date_created":"2019-02-12T07:40:40Z","content_type":"application/pdf","file_name":"2018_Brown.pdf","relation":"main_file","file_size":665372,"access_level":"open_access","creator":"dernst","checksum":"13a3f250be8878405e791b53c19722ad","file_id":"5954"}],"language":[{"iso":"eng"}],"volume":11014,"article_processing_charge":"No","date_created":"2018-12-11T11:44:33Z","type":"conference","_id":"85","status":"public","publication_identifier":{"issn":["03029743"]},"conference":{"location":"Turin, Italy","name":"Euro-Par: European Conference on Parallel Processing","end_date":"2018-08-31","start_date":"2018-08-27"},"department":[{"_id":"DaAl"}],"date_updated":"2023-09-18T09:32:36Z","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>.","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.","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.","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>.","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>"},"alternative_title":["LNCS"],"external_id":{"isi":["000851042300031"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_status":"published","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"}],"isi":1,"ddc":["000"],"date_published":"2018-08-01T00:00:00Z","file_date_updated":"2020-07-14T12:48:14Z","publisher":"Springer","title":"Snapshot based synchronization: A fast replacement for Hand-over-Hand locking","oa":1,"acknowledgement":"Trevor Brown was supported in part by the ISF (grants 2005/17 & 1749/14) and by a NSERC post-doctoral fellowship.","day":"01","doi":"10.1007/978-3-319-96983-1_33","page":"465 - 479","year":"2018","scopus_import":"1","publist_id":"7969","intvolume":"     11014"},{"publication_status":"submitted","month":"12","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."}],"title":"Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture","article_processing_charge":"No","language":[{"iso":"eng"}],"date_published":"2018-12-13T00:00:00Z","publisher":"Cold Spring Harbor Laboratory","oa_version":"Preprint","citation":{"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.).","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>.","ieee":"A. Llorca <i>et al.</i>, “Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture,” <i>bioRxiv</i>. Cold Spring Harbor Laboratory.","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>","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>","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>.","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>."},"department":[{"_id":"SiHi"}],"project":[{"call_identifier":"H2020","grant_number":"725780","_id":"260018B0-B435-11E9-9278-68D0E5697425","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development"},{"grant_number":"M02416","_id":"264E56E2-B435-11E9-9278-68D0E5697425","name":"Molecular Mechanisms Regulating Gliogenesis in the Cerebral Cortex","call_identifier":"FWF"}],"date_updated":"2021-01-12T08:20:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Alfredo","last_name":"Llorca","full_name":"Llorca, Alfredo"},{"full_name":"Ciceri, Gabriele","first_name":"Gabriele","last_name":"Ciceri"},{"id":"2E26DF60-F248-11E8-B48F-1D18A9856A87","full_name":"Beattie, Robert J","first_name":"Robert J","last_name":"Beattie","orcid":"0000-0002-8483-8753"},{"last_name":"Wong","first_name":"Fong K.","full_name":"Wong, Fong K."},{"last_name":"Diana","first_name":"Giovanni","full_name":"Diana, Giovanni"},{"full_name":"Serafeimidou, Eleni","first_name":"Eleni","last_name":"Serafeimidou"},{"first_name":"Marian","last_name":"Fernández-Otero","full_name":"Fernández-Otero, Marian"},{"full_name":"Streicher, Carmen","id":"36BCB99C-F248-11E8-B48F-1D18A9856A87","first_name":"Carmen","last_name":"Streicher"},{"full_name":"Arnold, Sebastian J.","last_name":"Arnold","first_name":"Sebastian J."},{"first_name":"Martin","last_name":"Meyer","full_name":"Meyer, Martin"},{"last_name":"Hippenmeyer","first_name":"Simon","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","full_name":"Hippenmeyer, Simon"},{"last_name":"Maravall","first_name":"Miguel","full_name":"Maravall, Miguel"},{"full_name":"Marín, Oscar","last_name":"Marín","first_name":"Oscar"}],"publication":"bioRxiv","ec_funded":1,"type":"preprint","_id":"8547","date_created":"2020-09-21T12:01:50Z","oa":1,"doi":"10.1101/494088","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/494088"}],"status":"public","day":"13","year":"2018","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."},{"citation":{"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.","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>","ista":"Chatterjee K, Henzinger TA, Otop J. 2018.Computing average response time. In: Principles of Modeling. LNCS, vol. 10760, 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>.","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>","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, M. Lohstroh, P. Derler, M. Sirjani (Eds.), Principles of Modeling, Springer, 2018, pp. 143–161.","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>."},"date_updated":"2021-01-12T08:20:14Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"ddc":["000"],"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"}],"publication_status":"published","title":"Computing average response time","file_date_updated":"2020-07-14T12:48:14Z","publisher":"Springer","date_published":"2018-07-20T00:00:00Z","oa":1,"page":"143 - 161","year":"2018","doi":"10.1007/978-3-319-95246-8_9","day":"20","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.","scopus_import":1,"editor":[{"full_name":"Lohstroh, Marten","first_name":"Marten","last_name":"Lohstroh"},{"full_name":"Derler, Patricia","first_name":"Patricia","last_name":"Derler"},{"full_name":"Sirjani, Marjan","first_name":"Marjan","last_name":"Sirjani"}],"publication":"Principles of Modeling","intvolume":"     10760","publist_id":"7968","oa_version":"Submitted Version","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"}],"quality_controlled":"1","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"first_name":"Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan"}],"file":[{"file_name":"2018_PrinciplesModeling_Chatterjee.pdf","date_created":"2019-11-19T08:22:18Z","date_updated":"2020-07-14T12:48:14Z","content_type":"application/pdf","access_level":"open_access","file_size":516307,"checksum":"9995c6ce6957333baf616fc4f20be597","file_id":"7053","creator":"dernst","relation":"main_file"}],"has_accepted_license":"1","month":"07","volume":10760,"language":[{"iso":"eng"}],"type":"book_chapter","_id":"86","date_created":"2018-12-11T11:44:33Z","status":"public","ec_funded":1},{"author":[{"first_name":"Carola","last_name":"Gregor","full_name":"Gregor, Carola"},{"full_name":"Sidenstein, Sven C.","last_name":"Sidenstein","first_name":"Sven C."},{"last_name":"Andresen","first_name":"Martin","full_name":"Andresen, Martin"},{"full_name":"Sahl, Steffen J.","last_name":"Sahl","first_name":"Steffen J."},{"full_name":"Danzl, Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8559-3973","last_name":"Danzl","first_name":"Johann G"},{"last_name":"Hell","first_name":"Stefan W.","full_name":"Hell, Stefan W."}],"oa_version":"Published Version","quality_controlled":"1","volume":8,"article_processing_charge":"No","language":[{"iso":"eng"}],"article_number":"2724","file":[{"content_type":"application/pdf","date_created":"2020-10-06T16:35:16Z","date_updated":"2020-10-06T16:35:16Z","file_name":"2018_ScientificReports_Gregor.pdf","relation":"main_file","success":1,"checksum":"e642080fcbde9584c63544f587c74f03","file_id":"8619","creator":"dernst","access_level":"open_access","file_size":2818077}],"month":"02","has_accepted_license":"1","publication_identifier":{"issn":["2045-2322"]},"status":"public","article_type":"original","type":"journal_article","_id":"8618","date_created":"2020-10-06T16:33:37Z","external_id":{"pmid":["29426833"],"isi":["000424630400037"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"citation":{"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>","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>","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>.","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.","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.","short":"C. Gregor, S.C. Sidenstein, M. Andresen, S.J. Sahl, J.G. Danzl, S.W. Hell, Scientific Reports 8 (2018).","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>."},"department":[{"_id":"JoDa"}],"date_updated":"2023-09-19T15:04:49Z","title":"Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA","pmid":1,"date_published":"2018-02-09T00:00:00Z","file_date_updated":"2020-10-06T16:35:16Z","publisher":"Springer Nature","ddc":["570"],"isi":1,"publication_status":"published","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"}],"year":"2018","doi":"10.1038/s41598-018-19947-1","day":"09","oa":1,"publication":"Scientific Reports","intvolume":"         8","keyword":["Multidisciplinary"]},{"publication":"Annals of Applied Probability","publist_id":"7967","arxiv":1,"intvolume":"        28","scopus_import":"1","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"6287"}]},"page":"3215 - 3238","year":"2018","doi":"10.1214/18-AAP1389","day":"01","oa":1,"title":"Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics","publisher":"Institute of Mathematical Statistics","date_published":"2018-10-01T00:00:00Z","isi":1,"publication_status":"published","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"}],"external_id":{"isi":["000442893500018"],"arxiv":["1705.02870"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","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>.","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>","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>.","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.","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."},"department":[{"_id":"HeEd"}],"date_updated":"2023-09-15T12:10:35Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.02870"}],"status":"public","article_type":"original","type":"journal_article","_id":"87","date_created":"2018-12-11T11:44:33Z","volume":28,"article_processing_charge":"No","language":[{"iso":"eng"}],"issue":"5","month":"10","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"first_name":"Anton","last_name":"Nikitenko","orcid":"0000-0002-0659-3201","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","full_name":"Nikitenko, Anton"}],"oa_version":"Preprint","quality_controlled":"1","project":[{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","call_identifier":"FWF"}]},{"supervisor":[{"full_name":"Siekhaus, Daria E","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8323-8353","first_name":"Daria E","last_name":"Siekhaus"}],"publist_id":"8047","oa":1,"doi":"10.15479/AT:ISTA:th1064","day":"01","year":"2018","page":"96","ddc":["570"],"abstract":[{"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.","lang":"eng"}],"publication_status":"published","title":"Transcriptional regulation of macrophage migration in the Drosophila melanogaster embryo ","publisher":"Institute of Science and Technology Austria","date_published":"2018-07-01T00:00:00Z","file_date_updated":"2021-02-11T11:17:16Z","citation":{"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>.","short":"V. Belyaeva, Transcriptional Regulation of Macrophage Migration in the Drosophila Melanogaster Embryo , Institute of Science and Technology Austria, 2018.","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>","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>.","ista":"Belyaeva V. 2018. Transcriptional regulation of macrophage migration in the Drosophila melanogaster embryo . Institute of Science and Technology Austria.","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."},"date_updated":"2023-09-07T12:43:10Z","department":[{"_id":"DaSi"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","alternative_title":["ISTA Thesis"],"degree_awarded":"PhD","pubrep_id":"1064","_id":"9","type":"dissertation","date_created":"2018-12-11T11:44:08Z","publication_identifier":{"issn":["2663-337X"]},"status":"public","file":[{"relation":"source_file","access_level":"closed","file_size":102737483,"checksum":"d27b2465cb70d0c9678a0381b9b6ced1","file_id":"6243","creator":"dernst","date_created":"2019-04-08T14:13:12Z","date_updated":"2020-07-14T12:48:14Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","embargo_to":"open_access","file_name":"2018_Thesis_Belyaeva_source.docx"},{"relation":"main_file","embargo":"2019-11-19","checksum":"a2939b61bde2de7b8ced77bbae0eaaed","file_id":"6244","creator":"dernst","access_level":"open_access","file_size":88077843,"content_type":"application/pdf","date_created":"2019-04-08T14:14:08Z","date_updated":"2021-02-11T11:17:16Z","file_name":"2018_Thesis_Belyaeva.pdf"}],"month":"07","has_accepted_license":"1","article_processing_charge":"No","language":[{"iso":"eng"}],"oa_version":"Published Version","author":[{"last_name":"Belyaeva","first_name":"Vera","id":"47F080FE-F248-11E8-B48F-1D18A9856A87","full_name":"Belyaeva, Vera"}]}]