[{"publist_id":"7574","ec_funded":1,"acknowledgement":"This work was financially supported by FP7 of the EU through the project “Body on a chip,” ICT-FET-296257, and the ERC Advanced Grant “NeuroCMOS” (contract 267351), as well as by an individual Ambizione Grant 142440 from the Swiss National Science Foundation for Olivier Frey. The research leading to these results also received funding from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. [291734]. We would like to thank Alexander Stettler, ETH Zurich for his expertise and support in the cleanroom, and we acknowledge the Single Cell Unit of D-BSSE, ETH Zurich for assistance in microscopy issues. M.L. is grateful to the members of the Guet and Tkačik groups, IST Austria, for valuable comments and support.","year":"2018","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"publisher":"Springer","publication_status":"published","author":[{"full_name":"Misun, Patrick","last_name":"Misun","first_name":"Patrick"},{"last_name":"Birchler","first_name":"Axel","full_name":"Birchler, Axel"},{"full_name":"Lang, Moritz","first_name":"Moritz","last_name":"Lang","id":"29E0800A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hierlemann, Andreas","last_name":"Hierlemann","first_name":"Andreas"},{"first_name":"Olivier","last_name":"Frey","full_name":"Frey, Olivier"}],"volume":1771,"date_updated":"2021-01-12T07:40:42Z","date_created":"2018-12-11T11:45:43Z","month":"01","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"quality_controlled":"1","doi":"10.1007/978-1-4939-7792-5_15","language":[{"iso":"eng"}],"type":"journal_article","alternative_title":["MIMB"],"abstract":[{"text":"The hanging-drop network (HDN) is a technology platform based on a completely open microfluidic network at the bottom of an inverted, surface-patterned substrate. The platform is predominantly used for the formation, culturing, and interaction of self-assembled spherical microtissues (spheroids) under precisely controlled flow conditions. Here, we describe design, fabrication, and operation of microfluidic hanging-drop networks.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"305","intvolume":" 1771","status":"public","title":"Fabrication and operation of microfluidic hanging drop networks","oa_version":"None","scopus_import":1,"day":"01","citation":{"chicago":"Misun, Patrick, Axel Birchler, Moritz Lang, Andreas Hierlemann, and Olivier Frey. “Fabrication and Operation of Microfluidic Hanging Drop Networks.” Methods in Molecular Biology. Springer, 2018. https://doi.org/10.1007/978-1-4939-7792-5_15.","mla":"Misun, Patrick, et al. “Fabrication and Operation of Microfluidic Hanging Drop Networks.” Methods in Molecular Biology, vol. 1771, Springer, 2018, pp. 183–202, doi:10.1007/978-1-4939-7792-5_15.","short":"P. Misun, A. Birchler, M. Lang, A. Hierlemann, O. Frey, Methods in Molecular Biology 1771 (2018) 183–202.","ista":"Misun P, Birchler A, Lang M, Hierlemann A, Frey O. 2018. Fabrication and operation of microfluidic hanging drop networks. Methods in Molecular Biology. 1771, 183–202.","ieee":"P. Misun, A. Birchler, M. Lang, A. Hierlemann, and O. Frey, “Fabrication and operation of microfluidic hanging drop networks,” Methods in Molecular Biology, vol. 1771. Springer, pp. 183–202, 2018.","apa":"Misun, P., Birchler, A., Lang, M., Hierlemann, A., & Frey, O. (2018). Fabrication and operation of microfluidic hanging drop networks. Methods in Molecular Biology. Springer. https://doi.org/10.1007/978-1-4939-7792-5_15","ama":"Misun P, Birchler A, Lang M, Hierlemann A, Frey O. Fabrication and operation of microfluidic hanging drop networks. Methods in Molecular Biology. 2018;1771:183-202. doi:10.1007/978-1-4939-7792-5_15"},"publication":"Methods in Molecular Biology","page":"183 - 202","date_published":"2018-01-01T00:00:00Z"},{"_id":"325","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 2","title":"Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs","status":"public","oa_version":"Preprint","type":"conference","issue":"POPL","abstract":[{"text":"Probabilistic programs extend classical imperative programs with real-valued random variables and random branching. The most basic liveness property for such programs is the termination property. The qualitative (aka almost-sure) termination problem asks whether a given program program terminates with probability 1. While ranking functions provide a sound and complete method for non-probabilistic programs, the extension of them to probabilistic programs is achieved via ranking supermartingales (RSMs). Although deep theoretical results have been established about RSMs, their application to probabilistic programs with nondeterminism has been limited only to programs of restricted control-flow structure. For non-probabilistic programs, lexicographic ranking functions provide a compositional and practical approach for termination analysis of real-world programs. In this work we introduce lexicographic RSMs and show that they present a sound method for almost-sure termination of probabilistic programs with nondeterminism. We show that lexicographic RSMs provide a tool for compositional reasoning about almost-sure termination, and for probabilistic programs with linear arithmetic they can be synthesized efficiently (in polynomial time). We also show that with additional restrictions even asymptotic bounds on expected termination time can be obtained through lexicographic RSMs. Finally, we present experimental results on benchmarks adapted from previous work to demonstrate the effectiveness of our approach.","lang":"eng"}],"citation":{"short":"S. Agrawal, K. Chatterjee, P. Novotný, in:, ACM, 2018.","mla":"Agrawal, Sheshansh, et al. Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs. Vol. 2, no. POPL, 34, ACM, 2018, doi:10.1145/3158122.","chicago":"Agrawal, Sheshansh, Krishnendu Chatterjee, and Petr Novotný. “Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs,” Vol. 2. ACM, 2018. https://doi.org/10.1145/3158122.","ama":"Agrawal S, Chatterjee K, Novotný P. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. In: Vol 2. ACM; 2018. doi:10.1145/3158122","apa":"Agrawal, S., Chatterjee, K., & Novotný, P. (2018). Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA: ACM. https://doi.org/10.1145/3158122","ieee":"S. Agrawal, K. Chatterjee, and P. Novotný, “Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs,” presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA, 2018, vol. 2, no. POPL.","ista":"Agrawal S, Chatterjee K, Novotný P. 2018. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. POPL: Principles of Programming Languages vol. 2, 34."},"date_published":"2018-01-01T00:00:00Z","day":"01","year":"2018","publisher":"ACM","department":[{"_id":"KrCh"}],"publication_status":"published","author":[{"last_name":"Agrawal","first_name":"Sheshansh","full_name":"Agrawal, Sheshansh"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","last_name":"Novotny","full_name":"Novotny, Petr"}],"volume":2,"date_updated":"2021-01-12T07:42:07Z","date_created":"2018-12-11T11:45:50Z","article_number":"34","publist_id":"7540","external_id":{"arxiv":["1709.04037"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1709.04037"}],"oa":1,"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"quality_controlled":"1","doi":"10.1145/3158122","conference":{"name":"POPL: Principles of Programming Languages","location":"Los Angeles, CA, USA","start_date":"2018-01-07","end_date":"2018-01-13"},"language":[{"iso":"eng"}],"month":"01"},{"year":"2018","pmid":1,"publication_status":"published","department":[{"_id":"JiFr"}],"publisher":"Springer Nature","author":[{"full_name":"Trinh, Hoang","last_name":"Trinh","first_name":"Hoang"},{"full_name":"Verstraeten, Inge","orcid":"0000-0001-7241-2328","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","last_name":"Verstraeten","first_name":"Inge"},{"first_name":"Danny","last_name":"Geelen","full_name":"Geelen, Danny"}],"date_created":"2018-12-11T11:46:18Z","date_updated":"2021-01-12T07:54:21Z","volume":1761,"publist_id":"7421","external_id":{"pmid":["29525951"]},"quality_controlled":"1","doi":"10.1007/978-1-4939-7747-5_7","language":[{"iso":"eng"}],"month":"03","publication_identifier":{"issn":["1064-3745"]},"_id":"408","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"In vitro assay for induction of adventitious rooting on intact arabidopsis hypocotyls","status":"public","intvolume":" 1761","oa_version":"None","type":"book_chapter","alternative_title":["MIMB"],"abstract":[{"text":"Adventitious roots (AR) are de novo formed roots that emerge from any part of the plant or from callus in tissue culture, except root tissue. The plant tissue origin and the method by which they are induced determine the physiological properties of emerged ARs. Hence, a standard method encompassing all types of AR does not exist. Here we describe a method for the induction and analysis of AR that emerge from the etiolated hypocotyl of dicot plants. The hypocotyl is formed during embryogenesis and shows a determined developmental pattern which usually does not involve AR formation. However, the hypocotyl shows propensity to form de novo roots under specific circumstances such as removal of the root system, high humidity or flooding, or during de-etiolation. The hypocotyl AR emerge from a pericycle-like cell layer surrounding the vascular tissue of the central cylinder, which is reminiscent to the developmental program of lateral roots. Here we propose an easy protocol for in vitro hypocotyl AR induction from etiolated Arabidopsis seedlings.","lang":"eng"}],"publication":"Root Development ","citation":{"ista":"Trinh H, Verstraeten I, Geelen D. 2018.In vitro assay for induction of adventitious rooting on intact arabidopsis hypocotyls. In: Root Development . MIMB, vol. 1761, 95–102.","ieee":"H. Trinh, I. Verstraeten, and D. Geelen, “In vitro assay for induction of adventitious rooting on intact arabidopsis hypocotyls,” in Root Development , vol. 1761, Springer Nature, 2018, pp. 95–102.","apa":"Trinh, H., Verstraeten, I., & Geelen, D. (2018). In vitro assay for induction of adventitious rooting on intact arabidopsis hypocotyls. In Root Development (Vol. 1761, pp. 95–102). Springer Nature. https://doi.org/10.1007/978-1-4939-7747-5_7","ama":"Trinh H, Verstraeten I, Geelen D. In vitro assay for induction of adventitious rooting on intact arabidopsis hypocotyls. In: Root Development . Vol 1761. Springer Nature; 2018:95-102. doi:10.1007/978-1-4939-7747-5_7","chicago":"Trinh, Hoang, Inge Verstraeten, and Danny Geelen. “In Vitro Assay for Induction of Adventitious Rooting on Intact Arabidopsis Hypocotyls.” In Root Development , 1761:95–102. Springer Nature, 2018. https://doi.org/10.1007/978-1-4939-7747-5_7.","mla":"Trinh, Hoang, et al. “In Vitro Assay for Induction of Adventitious Rooting on Intact Arabidopsis Hypocotyls.” Root Development , vol. 1761, Springer Nature, 2018, pp. 95–102, doi:10.1007/978-1-4939-7747-5_7.","short":"H. Trinh, I. Verstraeten, D. Geelen, in:, Root Development , Springer Nature, 2018, pp. 95–102."},"page":"95 - 102","date_published":"2018-03-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No"},{"language":[{"iso":"eng"}],"doi":"10.1007/978-1-4939-7747-5_10","date_published":"2018-03-11T00:00:00Z","quality_controlled":"1","page":"131 - 143","publication":"Root Development. Methods and Protocols","citation":{"short":"M. Karampelias, R. Tejos, J. Friml, S. Vanneste, in:, D. Ristova, E. Barbez (Eds.), Root Development. Methods and Protocols, Springer, 2018, pp. 131–143.","mla":"Karampelias, Michael, et al. “Optimized Whole Mount in Situ Immunolocalization for Arabidopsis Thaliana Root Meristems and Lateral Root Primordia.” Root Development. Methods and Protocols, edited by Daniela Ristova and Elke Barbez, vol. 1761, Springer, 2018, pp. 131–43, doi:10.1007/978-1-4939-7747-5_10.","chicago":"Karampelias, Michael, Ricardo Tejos, Jiří Friml, and Steffen Vanneste. “Optimized Whole Mount in Situ Immunolocalization for Arabidopsis Thaliana Root Meristems and Lateral Root Primordia.” In Root Development. Methods and Protocols, edited by Daniela Ristova and Elke Barbez, 1761:131–43. MIMB. Springer, 2018. https://doi.org/10.1007/978-1-4939-7747-5_10.","ama":"Karampelias M, Tejos R, Friml J, Vanneste S. Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia. In: Ristova D, Barbez E, eds. Root Development. Methods and Protocols. Vol 1761. MIMB. Springer; 2018:131-143. doi:10.1007/978-1-4939-7747-5_10","ieee":"M. Karampelias, R. Tejos, J. Friml, and S. Vanneste, “Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia,” in Root Development. Methods and Protocols, vol. 1761, D. Ristova and E. Barbez, Eds. Springer, 2018, pp. 131–143.","apa":"Karampelias, M., Tejos, R., Friml, J., & Vanneste, S. (2018). Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia. In D. Ristova & E. Barbez (Eds.), Root Development. Methods and Protocols (Vol. 1761, pp. 131–143). Springer. https://doi.org/10.1007/978-1-4939-7747-5_10","ista":"Karampelias M, Tejos R, Friml J, Vanneste S. 2018.Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia. In: Root Development. Methods and Protocols. Methods in Molecular Biology, vol. 1761, 131–143."},"day":"11","month":"03","series_title":"MIMB","scopus_import":1,"date_updated":"2021-01-12T07:54:34Z","date_created":"2018-12-11T11:46:20Z","oa_version":"None","volume":1761,"author":[{"full_name":"Karampelias, Michael","last_name":"Karampelias","first_name":"Michael"},{"full_name":"Tejos, Ricardo","first_name":"Ricardo","last_name":"Tejos"},{"full_name":"Friml, Jirí","last_name":"Friml","first_name":"Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Vanneste","first_name":"Steffen","full_name":"Vanneste, Steffen"}],"status":"public","title":"Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia","publication_status":"published","publisher":"Springer","department":[{"_id":"JiFr"}],"editor":[{"full_name":"Ristova, Daniela","first_name":"Daniela","last_name":"Ristova"},{"full_name":"Barbez, Elke","first_name":"Elke","last_name":"Barbez"}],"intvolume":" 1761","year":"2018","_id":"411","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Immunolocalization is a valuable tool for cell biology research that allows to rapidly determine the localization and expression levels of endogenous proteins. In plants, whole-mount in situ immunolocalization remains a challenging method, especially in tissues protected by waxy layers and complex cell wall carbohydrates. Here, we present a robust method for whole-mount in situ immunolocalization in primary root meristems and lateral root primordia in Arabidopsis thaliana. For good epitope preservation, fixation is done in an alkaline paraformaldehyde/glutaraldehyde mixture. This fixative is suitable for detecting a wide range of proteins, including integral transmembrane proteins and proteins peripherally attached to the plasma membrane. From initiation until emergence from the primary root, lateral root primordia are surrounded by several layers of differentiated tissues with a complex cell wall composition that interferes with the efficient penetration of all buffers. Therefore, immunolocalization in early lateral root primordia requires a modified method, including a strong solvent treatment for removal of hydrophobic barriers and a specific cocktail of cell wall-degrading enzymes. The presented method allows for easy, reliable, and high-quality in situ detection of the subcellular localization of endogenous proteins in primary and lateral root meristems without the need of time-consuming crosses or making translational fusions to fluorescent proteins.","lang":"eng"}],"publist_id":"7418","alternative_title":["Methods in Molecular Biology"],"type":"book_chapter"},{"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"456","year":"2018","title":"Zika-associated microcephaly: Reduce the stress and race for the treatment","publication_status":"published","status":"public","publisher":"American Association for the Advancement of Science","department":[{"_id":"GaNo"}],"intvolume":" 10","author":[{"orcid":"0000-0002-7673-7178","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","last_name":"Novarino","first_name":"Gaia","full_name":"Novarino, Gaia"}],"date_created":"2018-12-11T11:46:34Z","date_updated":"2021-01-12T07:59:42Z","oa_version":"None","volume":10,"article_number":"eaar7514","type":"journal_article","abstract":[{"lang":"eng","text":"Inhibition of the endoplasmic reticulum stress pathway may hold the key to Zika virus-associated microcephaly treatment. "}],"issue":"423","publist_id":"7365","publication":"Science Translational Medicine","citation":{"apa":"Novarino, G. (2018). Zika-associated microcephaly: Reduce the stress and race for the treatment. Science Translational Medicine. American Association for the Advancement of Science. https://doi.org/10.1126/scitranslmed.aar7514","ieee":"G. Novarino, “Zika-associated microcephaly: Reduce the stress and race for the treatment,” Science Translational Medicine, vol. 10, no. 423. American Association for the Advancement of Science, 2018.","ista":"Novarino G. 2018. Zika-associated microcephaly: Reduce the stress and race for the treatment. Science Translational Medicine. 10(423), eaar7514.","ama":"Novarino G. Zika-associated microcephaly: Reduce the stress and race for the treatment. Science Translational Medicine. 2018;10(423). doi:10.1126/scitranslmed.aar7514","chicago":"Novarino, Gaia. “Zika-Associated Microcephaly: Reduce the Stress and Race for the Treatment.” Science Translational Medicine. American Association for the Advancement of Science, 2018. https://doi.org/10.1126/scitranslmed.aar7514.","short":"G. Novarino, Science Translational Medicine 10 (2018).","mla":"Novarino, Gaia. “Zika-Associated Microcephaly: Reduce the Stress and Race for the Treatment.” Science Translational Medicine, vol. 10, no. 423, eaar7514, American Association for the Advancement of Science, 2018, doi:10.1126/scitranslmed.aar7514."},"quality_controlled":"1","date_published":"2018-01-10T00:00:00Z","doi":"10.1126/scitranslmed.aar7514","language":[{"iso":"eng"}],"scopus_import":1,"month":"01","day":"10"},{"scopus_import":1,"day":"01","has_accepted_license":"1","page":"199 - 206","publication":"VÖB Mitteilungen","citation":{"ama":"Petritsch B, Porsche J. IST PubRep and IST DataRep: the institutional repositories at IST Austria. VÖB Mitteilungen. 2018;71(1):199-206. doi:10.31263/voebm.v71i1.1993","ista":"Petritsch B, Porsche J. 2018. IST PubRep and IST DataRep: the institutional repositories at IST Austria. VÖB Mitteilungen. 71(1), 199–206.","apa":"Petritsch, B., & Porsche, J. (2018). IST PubRep and IST DataRep: the institutional repositories at IST Austria. VÖB Mitteilungen. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. https://doi.org/10.31263/voebm.v71i1.1993","ieee":"B. Petritsch and J. Porsche, “IST PubRep and IST DataRep: the institutional repositories at IST Austria,” VÖB Mitteilungen, vol. 71, no. 1. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, pp. 199–206, 2018.","mla":"Petritsch, Barbara, and Jana Porsche. “IST PubRep and IST DataRep: The Institutional Repositories at IST Austria.” VÖB Mitteilungen, vol. 71, no. 1, Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2018, pp. 199–206, doi:10.31263/voebm.v71i1.1993.","short":"B. Petritsch, J. Porsche, VÖB Mitteilungen 71 (2018) 199–206.","chicago":"Petritsch, Barbara, and Jana Porsche. “IST PubRep and IST DataRep: The Institutional Repositories at IST Austria.” VÖB Mitteilungen. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2018. https://doi.org/10.31263/voebm.v71i1.1993."},"date_published":"2018-10-01T00:00:00Z","type":"journal_article","abstract":[{"text":"In 2013, a publication repository was implemented at IST Austria and 2015 after a thorough preparation phase a data repository was implemented - both based on the Open Source Software EPrints. In this text, designed as field report, we will reflect on our experiences with Open Source Software in general and specifically with EPrints regarding technical aspects but also regarding their characteristics of the user community. The second part is a pleading for including the end users in the process of implementation, adaption and evaluation.","lang":"eng"}],"issue":"1","ddc":["020"],"status":"public","title":"IST PubRep and IST DataRep: the institutional repositories at IST Austria","intvolume":" 71","_id":"53","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"file_id":"5702","relation":"main_file","checksum":"7ac61bade5f37db011ca435ebcf86797","date_created":"2018-12-17T12:40:27Z","date_updated":"2020-07-14T12:46:38Z","access_level":"open_access","file_name":"2018_VOEB_Petritsch.pdf","creator":"dernst","content_type":"application/pdf","file_size":509434}],"month":"10","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.31263/voebm.v71i1.1993","file_date_updated":"2020-07-14T12:46:38Z","publist_id":"8001","publication_status":"published","department":[{"_id":"E-Lib"}],"publisher":"Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","year":"2018","date_created":"2018-12-11T11:44:22Z","date_updated":"2021-01-12T08:01:26Z","volume":71,"author":[{"last_name":"Petritsch","first_name":"Barbara","orcid":"0000-0003-2724-4614","id":"406048EC-F248-11E8-B48F-1D18A9856A87","full_name":"Petritsch, Barbara"},{"last_name":"Porsche","first_name":"Jana","id":"3252EDC2-F248-11E8-B48F-1D18A9856A87","full_name":"Porsche, Jana"}]},{"day":"01","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","scopus_import":1,"date_published":"2018-11-01T00:00:00Z","page":"489-501","publication":"Distributed Computing","citation":{"short":"D.-A. Alistarh, J. Aspnes, V. King, J. Saia, Distributed Computing 31 (2018) 489–501.","mla":"Alistarh, Dan-Adrian, et al. “Communication-Efficient Randomized Consensus.” Distributed Computing, vol. 31, no. 6, Springer, 2018, pp. 489–501, doi:10.1007/s00446-017-0315-1.","chicago":"Alistarh, Dan-Adrian, James Aspnes, Valerie King, and Jared Saia. “Communication-Efficient Randomized Consensus.” Distributed Computing. Springer, 2018. https://doi.org/10.1007/s00446-017-0315-1.","ama":"Alistarh D-A, Aspnes J, King V, Saia J. Communication-efficient randomized consensus. Distributed Computing. 2018;31(6):489-501. doi:10.1007/s00446-017-0315-1","apa":"Alistarh, D.-A., Aspnes, J., King, V., & Saia, J. (2018). Communication-efficient randomized consensus. Distributed Computing. Springer. https://doi.org/10.1007/s00446-017-0315-1","ieee":"D.-A. Alistarh, J. Aspnes, V. King, and J. Saia, “Communication-efficient randomized consensus,” Distributed Computing, vol. 31, no. 6. Springer, pp. 489–501, 2018.","ista":"Alistarh D-A, Aspnes J, King V, Saia J. 2018. Communication-efficient randomized consensus. Distributed Computing. 31(6), 489–501."},"abstract":[{"lang":"eng","text":"We consider the problem of consensus in the challenging classic model. In this model, the adversary is adaptive; it can choose which processors crash at any point during the course of the algorithm. Further, communication is via asynchronous message passing: there is no known upper bound on the time to send a message from one processor to another, and all messages and coin flips are seen by the adversary. We describe a new randomized consensus protocol with expected message complexity O(n2log2n) when fewer than n / 2 processes may fail by crashing. This is an almost-linear improvement over the best previously known protocol, and within logarithmic factors of a known Ω(n2) message lower bound. The protocol further ensures that no process sends more than O(nlog3n) messages in expectation, which is again within logarithmic factors of optimal. We also present a generalization of the algorithm to an arbitrary number of failures t, which uses expected O(nt+t2log2t) total messages. Our approach is to build a message-efficient, resilient mechanism for aggregating individual processor votes, implementing the message-passing equivalent of a weak shared coin. Roughly, in our protocol, a processor first announces its votes to small groups, then propagates them to increasingly larger groups as it generates more and more votes. To bound the number of messages that an individual process might have to send or receive, the protocol progressively increases the weight of generated votes. The main technical challenge is bounding the impact of votes that are still “in flight” (generated, but not fully propagated) on the final outcome of the shared coin, especially since such votes might have different weights. We achieve this by leveraging the structure of the algorithm, and a technical argument based on martingale concentration bounds. Overall, we show that it is possible to build an efficient message-passing implementation of a shared coin, and in the process (almost-optimally) solve the classic consensus problem in the asynchronous message-passing model."}],"issue":"6","type":"journal_article","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"5867","date_created":"2019-01-22T07:25:51Z","date_updated":"2020-07-14T12:46:38Z","checksum":"69b46e537acdcac745237ddb853fcbb5","file_name":"2017_DistribComp_Alistarh.pdf","access_level":"open_access","content_type":"application/pdf","file_size":595707,"creator":"dernst"}],"ddc":["000"],"status":"public","title":"Communication-efficient randomized consensus","intvolume":" 31","_id":"536","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"11","publication_identifier":{"issn":["01782770"]},"language":[{"iso":"eng"}],"doi":"10.1007/s00446-017-0315-1","quality_controlled":"1","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"file_date_updated":"2020-07-14T12:46:38Z","publist_id":"7281","date_created":"2018-12-11T11:47:01Z","date_updated":"2023-02-23T12:23:25Z","volume":31,"author":[{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"full_name":"Aspnes, James","last_name":"Aspnes","first_name":"James"},{"first_name":"Valerie","last_name":"King","full_name":"King, Valerie"},{"full_name":"Saia, Jared","first_name":"Jared","last_name":"Saia"}],"publication_status":"published","publisher":"Springer","department":[{"_id":"DaAl"}],"year":"2018"},{"publist_id":"7260","publication_status":"published","publisher":"Springer","department":[{"_id":"RoSe"}],"year":"2018","date_created":"2018-12-11T11:47:09Z","date_updated":"2021-01-12T08:02:35Z","volume":360,"author":[{"last_name":"Napiórkowski","first_name":"Marcin M","id":"4197AD04-F248-11E8-B48F-1D18A9856A87","full_name":"Napiórkowski, Marcin M"},{"first_name":"Robin","last_name":"Reuvers","full_name":"Reuvers, Robin"},{"first_name":"Jan","last_name":"Solovej","full_name":"Solovej, Jan"}],"month":"05","publication_identifier":{"issn":["00103616"]},"quality_controlled":"1","project":[{"name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","call_identifier":"FWF","grant_number":"P27533_N27","_id":"25C878CE-B435-11E9-9278-68D0E5697425"}],"oa":1,"external_id":{"arxiv":["1511.05953"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1511.05953"}],"language":[{"iso":"eng"}],"doi":"10.1007/s00220-017-3064-x","type":"journal_article","abstract":[{"text":"We analyse the canonical Bogoliubov free energy functional in three dimensions at low temperatures in the dilute limit. We prove existence of a first-order phase transition and, in the limit (Formula presented.), we determine the critical temperature to be (Formula presented.) to leading order. Here, (Formula presented.) is the critical temperature of the free Bose gas, ρ is the density of the gas and a is the scattering length of the pair-interaction potential V. We also prove asymptotic expansions for the free energy. In particular, we recover the Lee–Huang–Yang formula in the limit (Formula presented.).","lang":"eng"}],"issue":"1","status":"public","title":"The Bogoliubov free energy functional II: The dilute Limit","intvolume":" 360","_id":"554","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","scopus_import":1,"day":"01","page":"347-403","publication":"Communications in Mathematical Physics","citation":{"ista":"Napiórkowski MM, Reuvers R, Solovej J. 2018. The Bogoliubov free energy functional II: The dilute Limit. Communications in Mathematical Physics. 360(1), 347–403.","apa":"Napiórkowski, M. M., Reuvers, R., & Solovej, J. (2018). The Bogoliubov free energy functional II: The dilute Limit. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-017-3064-x","ieee":"M. M. Napiórkowski, R. Reuvers, and J. Solovej, “The Bogoliubov free energy functional II: The dilute Limit,” Communications in Mathematical Physics, vol. 360, no. 1. Springer, pp. 347–403, 2018.","ama":"Napiórkowski MM, Reuvers R, Solovej J. The Bogoliubov free energy functional II: The dilute Limit. Communications in Mathematical Physics. 2018;360(1):347-403. doi:10.1007/s00220-017-3064-x","chicago":"Napiórkowski, Marcin M, Robin Reuvers, and Jan Solovej. “The Bogoliubov Free Energy Functional II: The Dilute Limit.” Communications in Mathematical Physics. Springer, 2018. https://doi.org/10.1007/s00220-017-3064-x.","mla":"Napiórkowski, Marcin M., et al. “The Bogoliubov Free Energy Functional II: The Dilute Limit.” Communications in Mathematical Physics, vol. 360, no. 1, Springer, 2018, pp. 347–403, doi:10.1007/s00220-017-3064-x.","short":"M.M. Napiórkowski, R. Reuvers, J. Solovej, Communications in Mathematical Physics 360 (2018) 347–403."},"date_published":"2018-05-01T00:00:00Z"},{"alternative_title":["Methods in Molecular Biology"],"type":"book_chapter","abstract":[{"text":"Primary neuronal cell culture preparations are widely used to investigate synaptic functions. This chapter describes a detailed protocol for the preparation of a neuronal cell culture in which giant calyx-type synaptic terminals are formed. This chapter also presents detailed protocols for utilizing the main technical advantages provided by such a preparation, namely, labeling and imaging of synaptic organelles and electrophysiological recordings directly from presynaptic terminals.","lang":"eng"}],"title":"Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses","ddc":["570"],"status":"public","intvolume":" 1727","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"562","file":[{"file_name":"2018_NeurotrophicFactors_Dimitrov.pdf","access_level":"open_access","file_size":787407,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"7046","date_created":"2019-11-19T07:47:43Z","date_updated":"2020-07-14T12:47:09Z","checksum":"8aa174ca65a56fbb19e9f88cff3ac3fd"}],"oa_version":"Submitted Version","scopus_import":1,"day":"01","article_processing_charge":"No","has_accepted_license":"1","page":"201 - 215","publication":"Neurotrophic Factors","citation":{"ieee":"D. Dimitrov, L. Guillaud, K. Eguchi, and T. Takahashi, “Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses,” in Neurotrophic Factors, vol. 1727, S. D. Skaper, Ed. Springer, 2018, pp. 201–215.","apa":"Dimitrov, D., Guillaud, L., Eguchi, K., & Takahashi, T. (2018). Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses. In S. D. Skaper (Ed.), Neurotrophic Factors (Vol. 1727, pp. 201–215). Springer. https://doi.org/10.1007/978-1-4939-7571-6_15","ista":"Dimitrov D, Guillaud L, Eguchi K, Takahashi T. 2018.Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses. In: Neurotrophic Factors. Methods in Molecular Biology, vol. 1727, 201–215.","ama":"Dimitrov D, Guillaud L, Eguchi K, Takahashi T. Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses. In: Skaper SD, ed. Neurotrophic Factors. Vol 1727. Springer; 2018:201-215. doi:10.1007/978-1-4939-7571-6_15","chicago":"Dimitrov, Dimitar, Laurent Guillaud, Kohgaku Eguchi, and Tomoyuki Takahashi. “Culture of Mouse Giant Central Nervous System Synapses and Application for Imaging and Electrophysiological Analyses.” In Neurotrophic Factors, edited by Stephen D. Skaper, 1727:201–15. Springer, 2018. https://doi.org/10.1007/978-1-4939-7571-6_15.","short":"D. Dimitrov, L. Guillaud, K. Eguchi, T. Takahashi, in:, S.D. Skaper (Ed.), Neurotrophic Factors, Springer, 2018, pp. 201–215.","mla":"Dimitrov, Dimitar, et al. “Culture of Mouse Giant Central Nervous System Synapses and Application for Imaging and Electrophysiological Analyses.” Neurotrophic Factors, edited by Stephen D. Skaper, vol. 1727, Springer, 2018, pp. 201–15, doi:10.1007/978-1-4939-7571-6_15."},"date_published":"2018-01-01T00:00:00Z","file_date_updated":"2020-07-14T12:47:09Z","publist_id":"7252","publication_status":"published","editor":[{"first_name":"Stephen D.","last_name":"Skaper","full_name":"Skaper, Stephen D."}],"department":[{"_id":"RySh"}],"publisher":"Springer","year":"2018","pmid":1,"date_created":"2018-12-11T11:47:11Z","date_updated":"2021-01-12T08:03:05Z","volume":1727,"author":[{"first_name":"Dimitar","last_name":"Dimitrov","full_name":"Dimitrov, Dimitar"},{"full_name":"Guillaud, Laurent","last_name":"Guillaud","first_name":"Laurent"},{"orcid":"0000-0002-6170-2546","id":"2B7846DC-F248-11E8-B48F-1D18A9856A87","last_name":"Eguchi","first_name":"Kohgaku","full_name":"Eguchi, Kohgaku"},{"last_name":"Takahashi","first_name":"Tomoyuki","full_name":"Takahashi, Tomoyuki"}],"month":"01","quality_controlled":"1","oa":1,"external_id":{"pmid":["29222783"]},"language":[{"iso":"eng"}],"doi":"10.1007/978-1-4939-7571-6_15"},{"author":[{"first_name":"Roderick","last_name":"Bloem","full_name":"Bloem, Roderick"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Jobstmann, Barbara","last_name":"Jobstmann","first_name":"Barbara"}],"edition":"1","date_created":"2018-12-11T11:44:24Z","date_updated":"2021-01-12T08:05:10Z","oa_version":"None","year":"2018","_id":"59","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","title":"Graph games and reactive synthesis","status":"public","editor":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Clarke, Edmund M.","first_name":"Edmund M.","last_name":"Clarke"},{"full_name":"Veith, Helmut","first_name":"Helmut","last_name":"Veith"},{"full_name":"Bloem, Roderick","first_name":"Roderick","last_name":"Bloem"}],"publisher":"Springer","department":[{"_id":"KrCh"}],"abstract":[{"text":"Graph-based games are an important tool in computer science. They have applications in synthesis, verification, refinement, and far beyond. We review graphbased games with objectives on infinite plays. We give definitions and algorithms to solve the games and to give a winning strategy. The objectives we consider are mostly Boolean, but we also look at quantitative graph-based games and their objectives. Synthesis aims to turn temporal logic specifications into correct reactive systems. We explain the reduction of synthesis to graph-based games (or equivalently tree automata) using synthesis of LTL specifications as an example. We treat the classical approach that uses determinization of parity automata and more modern approaches.","lang":"eng"}],"publist_id":"7995","type":"book_chapter","doi":"10.1007/978-3-319-10575-8_27","date_published":"2018-05-19T00:00:00Z","language":[{"iso":"eng"}],"publication":"Handbook of Model Checking","citation":{"chicago":"Bloem, Roderick, Krishnendu Chatterjee, and Barbara Jobstmann. “Graph Games and Reactive Synthesis.” In Handbook of Model Checking, edited by Thomas A Henzinger, Edmund M. Clarke, Helmut Veith, and Roderick Bloem, 1st ed., 921–62. Springer, 2018. https://doi.org/10.1007/978-3-319-10575-8_27.","short":"R. Bloem, K. Chatterjee, B. Jobstmann, in:, T.A. Henzinger, E.M. Clarke, H. Veith, R. Bloem (Eds.), Handbook of Model Checking, 1st ed., Springer, 2018, pp. 921–962.","mla":"Bloem, Roderick, et al. “Graph Games and Reactive Synthesis.” Handbook of Model Checking, edited by Thomas A Henzinger et al., 1st ed., Springer, 2018, pp. 921–62, doi:10.1007/978-3-319-10575-8_27.","apa":"Bloem, R., Chatterjee, K., & Jobstmann, B. (2018). Graph games and reactive synthesis. In T. A. Henzinger, E. M. Clarke, H. Veith, & R. Bloem (Eds.), Handbook of Model Checking (1st ed., pp. 921–962). Springer. https://doi.org/10.1007/978-3-319-10575-8_27","ieee":"R. Bloem, K. Chatterjee, and B. Jobstmann, “Graph games and reactive synthesis,” in Handbook of Model Checking, 1st ed., T. A. Henzinger, E. M. Clarke, H. Veith, and R. Bloem, Eds. Springer, 2018, pp. 921–962.","ista":"Bloem R, Chatterjee K, Jobstmann B. 2018.Graph games and reactive synthesis. In: Handbook of Model Checking. , 921–962.","ama":"Bloem R, Chatterjee K, Jobstmann B. Graph games and reactive synthesis. In: Henzinger TA, Clarke EM, Veith H, Bloem R, eds. Handbook of Model Checking. 1st ed. Springer; 2018:921-962. doi:10.1007/978-3-319-10575-8_27"},"quality_controlled":"1","page":"921 - 962","month":"05","day":"19","publication_identifier":{"isbn":["978-3-319-10574-1"]},"scopus_import":1},{"page":"1 - 26","quality_controlled":"1","citation":{"apa":"Clarke, E., Henzinger, T. A., & Veith, H. (2018). Introduction to model checking. In T. A. Henzinger (Ed.), Handbook of Model Checking (pp. 1–26). Springer. https://doi.org/10.1007/978-3-319-10575-8_1","ieee":"E. Clarke, T. A. Henzinger, and H. Veith, “Introduction to model checking,” in Handbook of Model Checking, T. A. Henzinger, Ed. Springer, 2018, pp. 1–26.","ista":"Clarke E, Henzinger TA, Veith H. 2018.Introduction to model checking. In: Handbook of Model Checking. , 1–26.","ama":"Clarke E, Henzinger TA, Veith H. Introduction to model checking. In: Henzinger TA, ed. Handbook of Model Checking. Handbook of Model Checking. Springer; 2018:1-26. doi:10.1007/978-3-319-10575-8_1","chicago":"Clarke, Edmund, Thomas A Henzinger, and Helmut Veith. “Introduction to Model Checking.” In Handbook of Model Checking, edited by Thomas A Henzinger, 1–26. Handbook of Model Checking. Springer, 2018. https://doi.org/10.1007/978-3-319-10575-8_1.","short":"E. Clarke, T.A. Henzinger, H. Veith, in:, T.A. Henzinger (Ed.), Handbook of Model Checking, Springer, 2018, pp. 1–26.","mla":"Clarke, Edmund, et al. “Introduction to Model Checking.” Handbook of Model Checking, edited by Thomas A Henzinger, Springer, 2018, pp. 1–26, doi:10.1007/978-3-319-10575-8_1."},"publication":"Handbook of Model Checking","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-10575-8_1","date_published":"2018-05-19T00:00:00Z","series_title":"Handbook of Model Checking","scopus_import":1,"day":"19","month":"05","department":[{"_id":"ToHe"}],"editor":[{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"publisher":"Springer","status":"public","title":"Introduction to model checking","publication_status":"published","_id":"60","year":"2018","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"None","date_created":"2018-12-11T11:44:25Z","date_updated":"2021-01-12T08:05:35Z","author":[{"first_name":"Edmund","last_name":"Clarke","full_name":"Clarke, Edmund"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"full_name":"Veith, Helmut","first_name":"Helmut","last_name":"Veith"}],"type":"book_chapter","publist_id":"7994","abstract":[{"text":"Model checking is a computer-assisted method for the analysis of dynamical systems that can be modeled by state-transition systems. Drawing from research traditions in mathematical logic, programming languages, hardware design, and theoretical computer science, model checking is now widely used for the verification of hardware and software in industry. This chapter is an introduction and short survey of model checking. The chapter aims to motivate and link the individual chapters of the handbook, and to provide context for readers who are not familiar with model checking.","lang":"eng"}]},{"publication_status":"published","department":[{"_id":"MiSi"}],"publisher":"Bio-Protocol","year":"2018","acknowledgement":" FöFoLe project 947 (F.G.), the Friedrich-Baur-Stiftung project 41/16 (F.G.)","date_created":"2019-04-29T09:40:33Z","date_updated":"2021-01-12T08:07:12Z","volume":8,"author":[{"first_name":"Shuxia","last_name":"Fan","full_name":"Fan, Shuxia"},{"full_name":"Lorenz, Michael","first_name":"Michael","last_name":"Lorenz"},{"full_name":"Massberg, Steffen","first_name":"Steffen","last_name":"Massberg"},{"full_name":"Gärtner, Florian R","last_name":"Gärtner","first_name":"Florian R","orcid":"0000-0001-6120-3723","id":"397A88EE-F248-11E8-B48F-1D18A9856A87"}],"article_number":"e3018","file_date_updated":"2020-07-14T12:47:28Z","ec_funded":1,"quality_controlled":"1","project":[{"_id":"260AA4E2-B435-11E9-9278-68D0E5697425","grant_number":"747687","call_identifier":"H2020","name":"Mechanical Adaptation of Lamellipodial Actin Networks in Migrating Cells"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.21769/bioprotoc.3018","month":"09","publication_identifier":{"issn":["2331-8325"]},"title":"Platelet migration and bacterial trapping assay under flow","ddc":["570"],"status":"public","intvolume":" 8","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6354","oa_version":"Published Version","file":[{"checksum":"d4588377e789da7f360b553ae02c5119","date_updated":"2020-07-14T12:47:28Z","date_created":"2019-04-30T08:04:33Z","relation":"main_file","file_id":"6360","content_type":"application/pdf","file_size":2928337,"creator":"dernst","access_level":"open_access","file_name":"2018_BioProtocol_Fan.pdf"}],"type":"journal_article","abstract":[{"lang":"eng","text":"Blood platelets are critical for hemostasis and thrombosis, but also play diverse roles during immune responses. We have recently reported that platelets migrate at sites of infection in vitro and in vivo. Importantly, platelets use their ability to migrate to collect and bundle fibrin (ogen)-bound bacteria accomplishing efficient intravascular bacterial trapping. Here, we describe a method that allows analyzing platelet migration in vitro, focusing on their ability to collect bacteria and trap bacteria under flow."}],"issue":"18","publication":"Bio-Protocol","citation":{"mla":"Fan, Shuxia, et al. “Platelet Migration and Bacterial Trapping Assay under Flow.” Bio-Protocol, vol. 8, no. 18, e3018, Bio-Protocol, 2018, doi:10.21769/bioprotoc.3018.","short":"S. Fan, M. Lorenz, S. Massberg, F.R. Gärtner, Bio-Protocol 8 (2018).","chicago":"Fan, Shuxia, Michael Lorenz, Steffen Massberg, and Florian R Gärtner. “Platelet Migration and Bacterial Trapping Assay under Flow.” Bio-Protocol. Bio-Protocol, 2018. https://doi.org/10.21769/bioprotoc.3018.","ama":"Fan S, Lorenz M, Massberg S, Gärtner FR. Platelet migration and bacterial trapping assay under flow. Bio-Protocol. 2018;8(18). doi:10.21769/bioprotoc.3018","ista":"Fan S, Lorenz M, Massberg S, Gärtner FR. 2018. Platelet migration and bacterial trapping assay under flow. Bio-Protocol. 8(18), e3018.","apa":"Fan, S., Lorenz, M., Massberg, S., & Gärtner, F. R. (2018). Platelet migration and bacterial trapping assay under flow. Bio-Protocol. Bio-Protocol. https://doi.org/10.21769/bioprotoc.3018","ieee":"S. Fan, M. Lorenz, S. Massberg, and F. R. Gärtner, “Platelet migration and bacterial trapping assay under flow,” Bio-Protocol, vol. 8, no. 18. Bio-Protocol, 2018."},"date_published":"2018-09-20T00:00:00Z","keyword":["Platelets","Cell migration","Bacteria","Shear flow","Fibrinogen","E. coli"],"day":"20","has_accepted_license":"1"},{"file_date_updated":"2020-07-14T12:47:30Z","type":"conference_poster","author":[{"first_name":"Barbara","last_name":"Petritsch","id":"406048EC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2724-4614","full_name":"Petritsch, Barbara"}],"oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":1967778,"creator":"dernst","file_name":"Poster_Beitrag_125_Petritsch.pdf","access_level":"open_access","date_created":"2019-05-16T07:26:25Z","date_updated":"2020-07-14T12:47:30Z","checksum":"9063ab4d10ea93353c3a03bbf53fbcf1","relation":"main_file","file_id":"6460"}],"date_created":"2019-05-16T07:27:14Z","date_updated":"2020-07-14T23:06:21Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6459","year":"2018","department":[{"_id":"E-Lib"}],"publisher":"IST Austria","status":"public","ddc":["020"],"title":"Open Access at IST Austria 2009-2017","publication_status":"published","has_accepted_license":"1","day":"24","month":"09","keyword":["Open Access","Publication Analysis"],"doi":"10.5281/zenodo.1410279","date_published":"2018-09-24T00:00:00Z","conference":{"name":"Open-Access-Tage","end_date":"2018-09-26","location":"Graz, Austria","start_date":"2018-09-24"},"language":[{"iso":"eng"}],"citation":{"chicago":"Petritsch, Barbara. Open Access at IST Austria 2009-2017. IST Austria, 2018. https://doi.org/10.5281/zenodo.1410279.","mla":"Petritsch, Barbara. Open Access at IST Austria 2009-2017. IST Austria, 2018, doi:10.5281/zenodo.1410279.","short":"B. Petritsch, Open Access at IST Austria 2009-2017, IST Austria, 2018.","ista":"Petritsch B. 2018. Open Access at IST Austria 2009-2017, IST Austria,p.","apa":"Petritsch, B. (2018). Open Access at IST Austria 2009-2017. Presented at the Open-Access-Tage, Graz, Austria: IST Austria. https://doi.org/10.5281/zenodo.1410279","ieee":"B. Petritsch, Open Access at IST Austria 2009-2017. IST Austria, 2018.","ama":"Petritsch B. Open Access at IST Austria 2009-2017. IST Austria; 2018. doi:10.5281/zenodo.1410279"},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1},{"publication_status":"published","title":"Mirror symmetry with branes by equivariant verlinde formulas","status":"public","publisher":"Oxford University Press","department":[{"_id":"TaHa"}],"year":"2018","_id":"6525","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_created":"2019-06-06T12:42:01Z","date_updated":"2021-01-12T08:07:52Z","oa_version":"None","author":[{"first_name":"Tamás","last_name":"Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","full_name":"Hausel, Tamás"},{"full_name":"Mellit, Anton","id":"388D3134-F248-11E8-B48F-1D18A9856A87","first_name":"Anton","last_name":"Mellit"},{"last_name":"Pei","first_name":"Du","full_name":"Pei, Du"}],"type":"book_chapter","abstract":[{"text":"This chapter finds an agreement of equivariant indices of semi-classical homomorphisms between pairwise mirror branes in the GL2 Higgs moduli space on a Riemann surface. On one side of the agreement, components of the Lagrangian brane of U(1,1) Higgs bundles, whose mirror was proposed by Hitchin to be certain even exterior powers of the hyperholomorphic Dirac bundle on the SL2 Higgs moduli space, are present. The agreement arises from a mysterious functional equation. This gives strong computational evidence for Hitchin’s proposal.","lang":"eng"}],"quality_controlled":"1","page":"189-218","publication":"Geometry and Physics: Volume I","citation":{"ama":"Hausel T, Mellit A, Pei D. Mirror symmetry with branes by equivariant verlinde formulas. In: Geometry and Physics: Volume I. Oxford University Press; 2018:189-218. doi:10.1093/oso/9780198802013.003.0009","ieee":"T. Hausel, A. Mellit, and D. Pei, “Mirror symmetry with branes by equivariant verlinde formulas,” in Geometry and Physics: Volume I, Oxford University Press, 2018, pp. 189–218.","apa":"Hausel, T., Mellit, A., & Pei, D. (2018). Mirror symmetry with branes by equivariant verlinde formulas. In Geometry and Physics: Volume I (pp. 189–218). Oxford University Press. https://doi.org/10.1093/oso/9780198802013.003.0009","ista":"Hausel T, Mellit A, Pei D. 2018.Mirror symmetry with branes by equivariant verlinde formulas. In: Geometry and Physics: Volume I. , 189–218.","short":"T. Hausel, A. Mellit, D. Pei, in:, Geometry and Physics: Volume I, Oxford University Press, 2018, pp. 189–218.","mla":"Hausel, Tamás, et al. “Mirror Symmetry with Branes by Equivariant Verlinde Formulas.” Geometry and Physics: Volume I, Oxford University Press, 2018, pp. 189–218, doi:10.1093/oso/9780198802013.003.0009.","chicago":"Hausel, Tamás, Anton Mellit, and Du Pei. “Mirror Symmetry with Branes by Equivariant Verlinde Formulas.” In Geometry and Physics: Volume I, 189–218. Oxford University Press, 2018. https://doi.org/10.1093/oso/9780198802013.003.0009."},"language":[{"iso":"eng"}],"date_published":"2018-01-01T00:00:00Z","doi":"10.1093/oso/9780198802013.003.0009","scopus_import":1,"month":"01","day":"01","publication_identifier":{"isbn":["9780198802013","9780191840500"]}},{"month":"06","main_file_link":[{"url":"https://arxiv.org/abs/1605.08767","open_access":"1"}],"oa":1,"external_id":{"arxiv":["1605.08767"]},"quality_controlled":"1","project":[{"name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804"}],"doi":"10.1007/s00440-017-0787-8","language":[{"iso":"eng"}],"article_number":"543-616","publist_id":"7017","ec_funded":1,"year":"2018","publication_status":"published","department":[{"_id":"LaEr"}],"publisher":"Springer","author":[{"full_name":"Lee, Jii","first_name":"Jii","last_name":"Lee"},{"full_name":"Schnelli, Kevin","first_name":"Kevin","last_name":"Schnelli","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0954-3231"}],"date_created":"2018-12-11T11:47:56Z","date_updated":"2021-01-12T08:09:33Z","volume":171,"scopus_import":1,"day":"14","publication":"Probability Theory and Related Fields","citation":{"chicago":"Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random Matrices.” Probability Theory and Related Fields. Springer, 2018. https://doi.org/10.1007/s00440-017-0787-8.","short":"J. Lee, K. Schnelli, Probability Theory and Related Fields 171 (2018).","mla":"Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random Matrices.” Probability Theory and Related Fields, vol. 171, no. 1–2, 543–616, Springer, 2018, doi:10.1007/s00440-017-0787-8.","apa":"Lee, J., & Schnelli, K. (2018). Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-017-0787-8","ieee":"J. Lee and K. Schnelli, “Local law and Tracy–Widom limit for sparse random matrices,” Probability Theory and Related Fields, vol. 171, no. 1–2. Springer, 2018.","ista":"Lee J, Schnelli K. 2018. Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. 171(1–2), 543–616.","ama":"Lee J, Schnelli K. Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. 2018;171(1-2). doi:10.1007/s00440-017-0787-8"},"date_published":"2018-06-14T00:00:00Z","type":"journal_article","abstract":[{"text":"We consider spectral properties and the edge universality of sparse random matrices, the class of random matrices that includes the adjacency matrices of the Erdős–Rényi graph model G(N, p). We prove a local law for the eigenvalue density up to the spectral edges. Under a suitable condition on the sparsity, we also prove that the rescaled extremal eigenvalues exhibit GOE Tracy–Widom fluctuations if a deterministic shift of the spectral edge due to the sparsity is included. For the adjacency matrix of the Erdős–Rényi graph this establishes the Tracy–Widom fluctuations of the second largest eigenvalue when p is much larger than N−2/3 with a deterministic shift of order (Np)−1.","lang":"eng"}],"issue":"1-2","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"690","status":"public","title":"Local law and Tracy–Widom limit for sparse random matrices","intvolume":" 171","oa_version":"Preprint"},{"author":[{"last_name":"Shekhovtsov","first_name":"Alexander","full_name":"Shekhovtsov, Alexander"},{"full_name":"Swoboda, Paul","last_name":"Swoboda","first_name":"Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Bogdan","last_name":"Savchynskyy","full_name":"Savchynskyy, Bogdan"}],"volume":40,"date_updated":"2021-01-12T08:11:32Z","date_created":"2018-12-11T11:48:01Z","year":"2018","department":[{"_id":"VlKo"}],"publisher":"IEEE","publication_status":"published","publist_id":"6992","doi":"10.1109/TPAMI.2017.2730884","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1508.07902"}],"external_id":{"arxiv":["1508.07902"]},"oa":1,"quality_controlled":"1","publication_identifier":{"issn":["01628828"]},"month":"07","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"703","intvolume":" 40","status":"public","title":"Maximum persistency via iterative relaxed inference with graphical models","issue":"7","abstract":[{"text":"We consider the NP-hard problem of MAP-inference for undirected discrete graphical models. We propose a polynomial time and practically efficient algorithm for finding a part of its optimal solution. Specifically, our algorithm marks some labels of the considered graphical model either as (i) optimal, meaning that they belong to all optimal solutions of the inference problem; (ii) non-optimal if they provably do not belong to any solution. With access to an exact solver of a linear programming relaxation to the MAP-inference problem, our algorithm marks the maximal possible (in a specified sense) number of labels. We also present a version of the algorithm, which has access to a suboptimal dual solver only and still can ensure the (non-)optimality for the marked labels, although the overall number of the marked labels may decrease. We propose an efficient implementation, which runs in time comparable to a single run of a suboptimal dual solver. Our method is well-scalable and shows state-of-the-art results on computational benchmarks from machine learning and computer vision.","lang":"eng"}],"type":"journal_article","date_published":"2018-07-01T00:00:00Z","citation":{"ista":"Shekhovtsov A, Swoboda P, Savchynskyy B. 2018. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 40(7), 1668–1682.","apa":"Shekhovtsov, A., Swoboda, P., & Savchynskyy, B. (2018). Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2017.2730884","ieee":"A. Shekhovtsov, P. Swoboda, and B. Savchynskyy, “Maximum persistency via iterative relaxed inference with graphical models,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7. IEEE, pp. 1668–1682, 2018.","ama":"Shekhovtsov A, Swoboda P, Savchynskyy B. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2018;40(7):1668-1682. doi:10.1109/TPAMI.2017.2730884","chicago":"Shekhovtsov, Alexander, Paul Swoboda, and Bogdan Savchynskyy. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2018. https://doi.org/10.1109/TPAMI.2017.2730884.","mla":"Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:10.1109/TPAMI.2017.2730884.","short":"A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern Analysis and Machine Intelligence 40 (2018) 1668–1682."},"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","page":"1668-1682","day":"01","scopus_import":1},{"date_published":"2018-03-26T00:00:00Z","page":"145-156","citation":{"ama":"Grubic D, Tam L, Alistarh D-A, Zhang C. Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. In: Proceedings of the 21st International Conference on Extending Database Technology. OpenProceedings; 2018:145-156. doi:10.5441/002/EDBT.2018.14","ieee":"D. Grubic, L. Tam, D.-A. Alistarh, and C. Zhang, “Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study,” in Proceedings of the 21st International Conference on Extending Database Technology, Vienna, Austria, 2018, pp. 145–156.","apa":"Grubic, D., Tam, L., Alistarh, D.-A., & Zhang, C. (2018). Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. In Proceedings of the 21st International Conference on Extending Database Technology (pp. 145–156). Vienna, Austria: OpenProceedings. https://doi.org/10.5441/002/EDBT.2018.14","ista":"Grubic D, Tam L, Alistarh D-A, Zhang C. 2018. Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. Proceedings of the 21st International Conference on Extending Database Technology. EDBT: Conference on Extending Database Technology, 145–156.","short":"D. Grubic, L. Tam, D.-A. Alistarh, C. Zhang, in:, Proceedings of the 21st International Conference on Extending Database Technology, OpenProceedings, 2018, pp. 145–156.","mla":"Grubic, Demjan, et al. “Synchronous Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical Study.” Proceedings of the 21st International Conference on Extending Database Technology, OpenProceedings, 2018, pp. 145–56, doi:10.5441/002/EDBT.2018.14.","chicago":"Grubic, Demjan, Leo Tam, Dan-Adrian Alistarh, and Ce Zhang. “Synchronous Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical Study.” In Proceedings of the 21st International Conference on Extending Database Technology, 145–56. OpenProceedings, 2018. https://doi.org/10.5441/002/EDBT.2018.14."},"publication":"Proceedings of the 21st International Conference on Extending Database Technology","has_accepted_license":"1","article_processing_charge":"No","day":"26","scopus_import":1,"oa_version":"Published Version","file":[{"date_created":"2019-11-26T14:23:04Z","date_updated":"2020-07-14T12:47:49Z","checksum":"ec979b56abc71016d6e6adfdadbb4afe","file_id":"7118","relation":"main_file","creator":"dernst","file_size":1603204,"content_type":"application/pdf","file_name":"2018_OpenProceedings_Grubic.pdf","access_level":"open_access"}],"title":"Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study","ddc":["000"],"status":"public","_id":"7116","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Training deep learning models has received tremendous research interest recently. In particular, there has been intensive research on reducing the communication cost of training when using multiple computational devices, through reducing the precision of the underlying data representation. Naturally, such methods induce system trade-offs—lowering communication precision could de-crease communication overheads and improve scalability; but, on the other hand, it can also reduce the accuracy of training. In this paper, we study this trade-off space, and ask:Can low-precision communication consistently improve the end-to-end performance of training modern neural networks, with no accuracy loss?From the performance point of view, the answer to this question may appear deceptively easy: compressing communication through low precision should help when the ratio between communication and computation is high. However, this answer is less straightforward when we try to generalize this principle across various neural network architectures (e.g., AlexNet vs. ResNet),number of GPUs (e.g., 2 vs. 8 GPUs), machine configurations(e.g., EC2 instances vs. NVIDIA DGX-1), communication primitives (e.g., MPI vs. NCCL), and even different GPU architectures(e.g., Kepler vs. Pascal). Currently, it is not clear how a realistic realization of all these factors maps to the speed up provided by low-precision communication. In this paper, we conduct an empirical study to answer this question and report the insights.","lang":"eng"}],"type":"conference","language":[{"iso":"eng"}],"doi":"10.5441/002/EDBT.2018.14","conference":{"name":"EDBT: Conference on Extending Database Technology","location":"Vienna, Austria","start_date":"2018-03-26","end_date":"2018-03-29"},"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"publication_identifier":{"issn":["2367-2005"],"isbn":["9783893180783"]},"month":"03","date_updated":"2023-02-23T12:59:17Z","date_created":"2019-11-26T14:19:11Z","author":[{"first_name":"Demjan","last_name":"Grubic","full_name":"Grubic, Demjan"},{"full_name":"Tam, Leo","first_name":"Leo","last_name":"Tam"},{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian"},{"full_name":"Zhang, Ce","last_name":"Zhang","first_name":"Ce"}],"department":[{"_id":"DaAl"}],"publisher":"OpenProceedings","publication_status":"published","year":"2018","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","file_date_updated":"2020-07-14T12:47:49Z"},{"day":"31","article_processing_charge":"No","has_accepted_license":"1","scopus_import":1,"date_published":"2018-12-31T00:00:00Z","publication":"10th Innovations in Theoretical Computer Science Conference (ITCS 2019)","citation":{"ista":"Pietrzak KZ. 2018. Proofs of catalytic space. 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). ITCS: Innovations in theoretical Computer Science Conference, LIPIcs, vol. 124, 59:1-59:25.","apa":"Pietrzak, K. Z. (2018). Proofs of catalytic space. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019) (Vol. 124, p. 59:1-59:25). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2019.59","ieee":"K. Z. Pietrzak, “Proofs of catalytic space,” in 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), San Diego, CA, United States, 2018, vol. 124, p. 59:1-59:25.","ama":"Pietrzak KZ. Proofs of catalytic space. In: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Vol 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:59:1-59:25. doi:10.4230/LIPICS.ITCS.2019.59","chicago":"Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 124:59:1-59:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.ITCS.2019.59.","mla":"Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), vol. 124, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25, doi:10.4230/LIPICS.ITCS.2019.59.","short":"K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25."},"page":"59:1-59:25","abstract":[{"lang":"eng","text":"Proofs of space (PoS) [Dziembowski et al., CRYPTO'15] are proof systems where a prover can convince a verifier that he \"wastes\" disk space. PoS were introduced as a more ecological and economical replacement for proofs of work which are currently used to secure blockchains like Bitcoin. In this work we investigate extensions of PoS which allow the prover to embed useful data into the dedicated space, which later can be recovered. Our first contribution is a security proof for the original PoS from CRYPTO'15 in the random oracle model (the original proof only applied to a restricted class of adversaries which can store a subset of the data an honest prover would store). When this PoS is instantiated with recent constructions of maximally depth robust graphs, our proof implies basically optimal security. As a second contribution we show three different extensions of this PoS where useful data can be embedded into the space required by the prover. Our security proof for the PoS extends (non-trivially) to these constructions. We discuss how some of these variants can be used as proofs of catalytic space (PoCS), a notion we put forward in this work, and which basically is a PoS where most of the space required by the prover can be used to backup useful data. Finally we discuss how one of the extensions is a candidate construction for a proof of replication (PoR), a proof system recently suggested in the Filecoin whitepaper. "}],"type":"conference","alternative_title":["LIPIcs"],"oa_version":"Published Version","file":[{"checksum":"5cebb7f7849a3beda898f697d755dd96","date_created":"2020-02-04T08:17:52Z","date_updated":"2020-07-14T12:47:57Z","file_id":"7443","relation":"main_file","creator":"dernst","file_size":822884,"content_type":"application/pdf","access_level":"open_access","file_name":"2018_LIPIcs_Pietrzak.pdf"}],"_id":"7407","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Proofs of catalytic space","ddc":["000"],"intvolume":" 124","month":"12","publication_identifier":{"isbn":["978-3-95977-095-8"],"issn":["1868-8969"]},"conference":{"end_date":"2019-01-12","location":"San Diego, CA, United States","start_date":"2019-01-10","name":"ITCS: Innovations in theoretical Computer Science Conference"},"doi":"10.4230/LIPICS.ITCS.2019.59","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"main_file_link":[{"url":"https://eprint.iacr.org/2018/194","open_access":"1"}],"quality_controlled":"1","project":[{"name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815"}],"file_date_updated":"2020-07-14T12:47:57Z","ec_funded":1,"author":[{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z"}],"date_created":"2020-01-30T09:16:05Z","date_updated":"2021-01-12T08:13:26Z","volume":124,"year":"2018","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrPi"}]},{"abstract":[{"lang":"eng","text":"The concurrent memory reclamation problem is that of devising a way for a deallocating thread to verify that no other concurrent threads hold references to a memory block being deallocated. To date, in the absence of automatic garbage collection, there is no satisfactory solution to this problem; existing tracking methods like hazard pointers, reference counters, or epoch-based techniques like RCU are either prohibitively expensive or require significant programming expertise to the extent that implementing them efficiently can be worthy of a publication. None of the existing techniques are automatic or even semi-automated.\r\nIn this article, we take a new approach to concurrent memory reclamation. Instead of manually tracking access to memory locations as done in techniques like hazard pointers, or restricting shared accesses to specific epoch boundaries as in RCU, our algorithm, called ThreadScan, leverages operating system signaling to automatically detect which memory locations are being accessed by concurrent threads.\r\nInitial empirical evidence shows that ThreadScan scales surprisingly well and requires negligible programming effort beyond the standard use of Malloc and Free."}],"issue":"4","article_number":"18","type":"journal_article","date_updated":"2023-02-23T13:17:54Z","date_created":"2019-02-14T13:24:11Z","oa_version":"None","volume":4,"author":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"},{"full_name":"Leiserson, William","last_name":"Leiserson","first_name":"William"},{"full_name":"Matveev, Alexander","first_name":"Alexander","last_name":"Matveev"},{"first_name":"Nir","last_name":"Shavit","full_name":"Shavit, Nir"}],"related_material":{"record":[{"id":"779","relation":"earlier_version","status":"public"}]},"publication_status":"published","status":"public","title":"ThreadScan: Automatic and scalable memory reclamation","department":[{"_id":"DaAl"}],"publisher":"Association for Computing Machinery","intvolume":" 4","_id":"6001","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2018","day":"01","month":"09","publication_identifier":{"issn":["2329-4949"]},"scopus_import":1,"language":[{"iso":"eng"}],"date_published":"2018-09-01T00:00:00Z","doi":"10.1145/3201897","quality_controlled":"1","publication":"ACM Transactions on Parallel Computing","citation":{"ama":"Alistarh D-A, Leiserson W, Matveev A, Shavit N. ThreadScan: Automatic and scalable memory reclamation. ACM Transactions on Parallel Computing. 2018;4(4). doi:10.1145/3201897","ista":"Alistarh D-A, Leiserson W, Matveev A, Shavit N. 2018. ThreadScan: Automatic and scalable memory reclamation. ACM Transactions on Parallel Computing. 4(4), 18.","apa":"Alistarh, D.-A., Leiserson, W., Matveev, A., & Shavit, N. (2018). ThreadScan: Automatic and scalable memory reclamation. ACM Transactions on Parallel Computing. Association for Computing Machinery. https://doi.org/10.1145/3201897","ieee":"D.-A. Alistarh, W. Leiserson, A. Matveev, and N. Shavit, “ThreadScan: Automatic and scalable memory reclamation,” ACM Transactions on Parallel Computing, vol. 4, no. 4. Association for Computing Machinery, 2018.","mla":"Alistarh, Dan-Adrian, et al. “ThreadScan: Automatic and Scalable Memory Reclamation.” ACM Transactions on Parallel Computing, vol. 4, no. 4, 18, Association for Computing Machinery, 2018, doi:10.1145/3201897.","short":"D.-A. Alistarh, W. Leiserson, A. Matveev, N. Shavit, ACM Transactions on Parallel Computing 4 (2018).","chicago":"Alistarh, Dan-Adrian, William Leiserson, Alexander Matveev, and Nir Shavit. “ThreadScan: Automatic and Scalable Memory Reclamation.” ACM Transactions on Parallel Computing. Association for Computing Machinery, 2018. https://doi.org/10.1145/3201897."}},{"abstract":[{"lang":"eng","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."}],"file_date_updated":"2020-07-14T12:48:03Z","type":"conference","author":[{"first_name":"Antonio","last_name":"Polino","full_name":"Polino, Antonio"},{"last_name":"Pascanu","first_name":"Razvan","full_name":"Pascanu, Razvan"},{"last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"}],"date_updated":"2023-02-23T13:18:41Z","date_created":"2020-05-10T22:00:51Z","file":[{"relation":"main_file","file_id":"7894","checksum":"a4336c167978e81891970e4e4517a8c3","date_created":"2020-05-26T13:02:00Z","date_updated":"2020-07-14T12:48:03Z","access_level":"open_access","file_name":"2018_ICLR_Polino.pdf","file_size":308339,"content_type":"application/pdf","creator":"dernst"}],"oa_version":"Published Version","_id":"7812","year":"2018","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","status":"public","ddc":["000"],"title":"Model compression via distillation and quantization","department":[{"_id":"DaAl"}],"day":"01","month":"05","article_processing_charge":"No","has_accepted_license":"1","scopus_import":1,"conference":{"name":"ICLR: International Conference on Learning Representations","start_date":"2018-04-30","location":"Vancouver, Canada","end_date":"2018-05-03"},"date_published":"2018-05-01T00:00:00Z","language":[{"iso":"eng"}],"publication":"6th International Conference on Learning Representations","oa":1,"external_id":{"arxiv":["1802.05668"]},"citation":{"ama":"Polino A, Pascanu R, Alistarh D-A. Model compression via distillation and quantization. In: 6th International Conference on Learning Representations. ; 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.","ieee":"A. Polino, R. Pascanu, and D.-A. Alistarh, “Model compression via distillation and quantization,” in 6th International Conference on Learning Representations, Vancouver, Canada, 2018.","apa":"Polino, A., Pascanu, R., & Alistarh, D.-A. (2018). Model compression via distillation and quantization. In 6th International Conference on Learning Representations. Vancouver, Canada.","mla":"Polino, Antonio, et al. “Model Compression via Distillation and Quantization.” 6th International Conference on Learning Representations, 2018.","short":"A. Polino, R. Pascanu, D.-A. Alistarh, in:, 6th International Conference on Learning Representations, 2018.","chicago":"Polino, Antonio, Razvan Pascanu, and Dan-Adrian Alistarh. “Model Compression via Distillation and Quantization.” In 6th International Conference on Learning Representations, 2018."},"quality_controlled":"1"}]