[{"scopus_import":1,"day":"01","has_accepted_license":"1","page":"199 - 206","publication":"VÖB Mitteilungen","citation":{"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.","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."},"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","title":"IST PubRep and IST DataRep: the institutional repositories at IST Austria","ddc":["020"],"status":"public","intvolume":" 71","_id":"53","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2018_VOEB_Petritsch.pdf","creator":"dernst","file_size":509434,"content_type":"application/pdf","file_id":"5702","relation":"main_file","checksum":"7ac61bade5f37db011ca435ebcf86797","date_created":"2018-12-17T12:40:27Z","date_updated":"2020-07-14T12:46:38Z"}],"month":"10","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.31263/voebm.v71i1.1993","license":"https://creativecommons.org/licenses/by/4.0/","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"},{"full_name":"Porsche, Jana","first_name":"Jana","last_name":"Porsche","id":"3252EDC2-F248-11E8-B48F-1D18A9856A87"}]},{"file_date_updated":"2020-07-14T12:46:38Z","publist_id":"7281","year":"2018","publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"Springer","author":[{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Aspnes","first_name":"James","full_name":"Aspnes, James"},{"full_name":"King, Valerie","first_name":"Valerie","last_name":"King"},{"last_name":"Saia","first_name":"Jared","full_name":"Saia, Jared"}],"date_created":"2018-12-11T11:47:01Z","date_updated":"2023-02-23T12:23:25Z","volume":31,"month":"11","publication_identifier":{"issn":["01782770"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"doi":"10.1007/s00446-017-0315-1","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"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.","lang":"eng"}],"issue":"6","_id":"536","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Communication-efficient randomized consensus","ddc":["000"],"status":"public","intvolume":" 31","file":[{"file_size":595707,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2017_DistribComp_Alistarh.pdf","checksum":"69b46e537acdcac745237ddb853fcbb5","date_created":"2019-01-22T07:25:51Z","date_updated":"2020-07-14T12:46:38Z","relation":"main_file","file_id":"5867"}],"oa_version":"Published Version","scopus_import":1,"day":"01","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","publication":"Distributed Computing","citation":{"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.","short":"D.-A. Alistarh, J. Aspnes, V. King, J. Saia, Distributed Computing 31 (2018) 489–501.","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","ista":"Alistarh D-A, Aspnes J, King V, Saia J. 2018. Communication-efficient randomized consensus. Distributed Computing. 31(6), 489–501.","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."},"page":"489-501","date_published":"2018-11-01T00:00:00Z"},{"date_published":"2018-05-01T00:00:00Z","publication":"Communications in Mathematical Physics","citation":{"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.","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.","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","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."},"page":"347-403","day":"01","scopus_import":1,"oa_version":"Submitted Version","_id":"554","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The Bogoliubov free energy functional II: The dilute Limit","status":"public","intvolume":" 360","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","type":"journal_article","doi":"10.1007/s00220-017-3064-x","language":[{"iso":"eng"}],"oa":1,"external_id":{"arxiv":["1511.05953"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1511.05953"}],"quality_controlled":"1","project":[{"_id":"25C878CE-B435-11E9-9278-68D0E5697425","grant_number":"P27533_N27","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","call_identifier":"FWF"}],"month":"05","publication_identifier":{"issn":["00103616"]},"author":[{"first_name":"Marcin M","last_name":"Napiórkowski","id":"4197AD04-F248-11E8-B48F-1D18A9856A87","full_name":"Napiórkowski, Marcin M"},{"last_name":"Reuvers","first_name":"Robin","full_name":"Reuvers, Robin"},{"full_name":"Solovej, Jan","first_name":"Jan","last_name":"Solovej"}],"date_updated":"2021-01-12T08:02:35Z","date_created":"2018-12-11T11:47:09Z","volume":360,"year":"2018","publication_status":"published","publisher":"Springer","department":[{"_id":"RoSe"}],"publist_id":"7260"},{"pmid":1,"year":"2018","editor":[{"full_name":"Skaper, Stephen D.","first_name":"Stephen D.","last_name":"Skaper"}],"department":[{"_id":"RySh"}],"publisher":"Springer","publication_status":"published","author":[{"full_name":"Dimitrov, Dimitar","last_name":"Dimitrov","first_name":"Dimitar"},{"first_name":"Laurent","last_name":"Guillaud","full_name":"Guillaud, Laurent"},{"id":"2B7846DC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6170-2546","first_name":"Kohgaku","last_name":"Eguchi","full_name":"Eguchi, Kohgaku"},{"full_name":"Takahashi, Tomoyuki","first_name":"Tomoyuki","last_name":"Takahashi"}],"volume":1727,"date_created":"2018-12-11T11:47:11Z","date_updated":"2021-01-12T08:03:05Z","publist_id":"7252","file_date_updated":"2020-07-14T12:47:09Z","external_id":{"pmid":["29222783"]},"oa":1,"quality_controlled":"1","doi":"10.1007/978-1-4939-7571-6_15","language":[{"iso":"eng"}],"month":"01","_id":"562","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 1727","title":"Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses","status":"public","ddc":["570"],"file":[{"relation":"main_file","file_id":"7046","date_created":"2019-11-19T07:47:43Z","date_updated":"2020-07-14T12:47:09Z","checksum":"8aa174ca65a56fbb19e9f88cff3ac3fd","file_name":"2018_NeurotrophicFactors_Dimitrov.pdf","access_level":"open_access","file_size":787407,"content_type":"application/pdf","creator":"dernst"}],"oa_version":"Submitted Version","type":"book_chapter","alternative_title":["Methods in Molecular Biology"],"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"}],"citation":{"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","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","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.","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.","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.","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."},"publication":"Neurotrophic Factors","page":"201 - 215","date_published":"2018-01-01T00:00:00Z","scopus_import":1,"article_processing_charge":"No","has_accepted_license":"1","day":"01"},{"department":[{"_id":"KrCh"}],"publisher":"Springer","editor":[{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Clarke, Edmund M.","first_name":"Edmund M.","last_name":"Clarke"},{"first_name":"Helmut","last_name":"Veith","full_name":"Veith, Helmut"},{"full_name":"Bloem, Roderick","first_name":"Roderick","last_name":"Bloem"}],"title":"Graph games and reactive synthesis","status":"public","publication_status":"published","_id":"59","year":"2018","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","date_created":"2018-12-11T11:44:24Z","date_updated":"2021-01-12T08:05:10Z","edition":"1","author":[{"first_name":"Roderick","last_name":"Bloem","full_name":"Bloem, Roderick"},{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Jobstmann, Barbara","last_name":"Jobstmann","first_name":"Barbara"}],"type":"book_chapter","publist_id":"7995","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"}],"page":"921 - 962","quality_controlled":"1","citation":{"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.","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.","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","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.","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","ista":"Bloem R, Chatterjee K, Jobstmann B. 2018.Graph games and reactive synthesis. In: Handbook of Model Checking. , 921–962."},"publication":"Handbook of Model Checking","language":[{"iso":"eng"}],"date_published":"2018-05-19T00:00:00Z","doi":"10.1007/978-3-319-10575-8_27","scopus_import":1,"publication_identifier":{"isbn":["978-3-319-10574-1"]},"day":"19","month":"05"},{"month":"05","day":"19","scopus_import":1,"series_title":"Handbook of Model Checking","doi":"10.1007/978-3-319-10575-8_1","date_published":"2018-05-19T00:00:00Z","language":[{"iso":"eng"}],"citation":{"ista":"Clarke E, Henzinger TA, Veith H. 2018.Introduction to model checking. In: Handbook of Model Checking. , 1–26.","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.","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","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.","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.","short":"E. Clarke, T.A. Henzinger, H. Veith, in:, T.A. Henzinger (Ed.), Handbook of Model Checking, Springer, 2018, pp. 1–26."},"publication":"Handbook of Model Checking","page":"1 - 26","quality_controlled":"1","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"}],"type":"book_chapter","author":[{"full_name":"Clarke, Edmund","last_name":"Clarke","first_name":"Edmund"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"first_name":"Helmut","last_name":"Veith","full_name":"Veith, Helmut"}],"oa_version":"None","date_updated":"2021-01-12T08:05:35Z","date_created":"2018-12-11T11:44:25Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"60","year":"2018","editor":[{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"publisher":"Springer","department":[{"_id":"ToHe"}],"status":"public","publication_status":"published","title":"Introduction to model checking"},{"language":[{"iso":"eng"}],"doi":"10.21769/bioprotoc.3018","quality_controlled":"1","project":[{"name":"Mechanical Adaptation of Lamellipodial Actin Networks in Migrating Cells","call_identifier":"H2020","grant_number":"747687","_id":"260AA4E2-B435-11E9-9278-68D0E5697425"}],"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,"month":"09","publication_identifier":{"issn":["2331-8325"]},"date_updated":"2021-01-12T08:07:12Z","date_created":"2019-04-29T09:40:33Z","volume":8,"author":[{"first_name":"Shuxia","last_name":"Fan","full_name":"Fan, Shuxia"},{"last_name":"Lorenz","first_name":"Michael","full_name":"Lorenz, Michael"},{"first_name":"Steffen","last_name":"Massberg","full_name":"Massberg, Steffen"},{"full_name":"Gärtner, Florian R","orcid":"0000-0001-6120-3723","id":"397A88EE-F248-11E8-B48F-1D18A9856A87","last_name":"Gärtner","first_name":"Florian R"}],"publication_status":"published","department":[{"_id":"MiSi"}],"publisher":"Bio-Protocol","acknowledgement":" FöFoLe project 947 (F.G.), the Friedrich-Baur-Stiftung project 41/16 (F.G.)","year":"2018","file_date_updated":"2020-07-14T12:47:28Z","ec_funded":1,"article_number":"e3018","date_published":"2018-09-20T00:00:00Z","publication":"Bio-Protocol","citation":{"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.","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.","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","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."},"day":"20","has_accepted_license":"1","keyword":["Platelets","Cell migration","Bacteria","Shear flow","Fibrinogen","E. coli"],"file":[{"file_size":2928337,"content_type":"application/pdf","creator":"dernst","file_name":"2018_BioProtocol_Fan.pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:28Z","date_created":"2019-04-30T08:04:33Z","checksum":"d4588377e789da7f360b553ae02c5119","relation":"main_file","file_id":"6360"}],"oa_version":"Published Version","ddc":["570"],"status":"public","title":"Platelet migration and bacterial trapping assay under flow","intvolume":" 8","_id":"6354","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","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","type":"journal_article"},{"month":"09","day":"24","has_accepted_license":"1","keyword":["Open Access","Publication Analysis"],"conference":{"name":"Open-Access-Tage","end_date":"2018-09-26","start_date":"2018-09-24","location":"Graz, Austria"},"doi":"10.5281/zenodo.1410279","date_published":"2018-09-24T00:00:00Z","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,"citation":{"ista":"Petritsch B. 2018. Open Access at IST Austria 2009-2017, IST Austria,p.","ieee":"B. Petritsch, Open Access at IST Austria 2009-2017. IST Austria, 2018.","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","ama":"Petritsch B. Open Access at IST Austria 2009-2017. IST Austria; 2018. doi:10.5281/zenodo.1410279","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."},"file_date_updated":"2020-07-14T12:47:30Z","type":"conference_poster","author":[{"full_name":"Petritsch, Barbara","last_name":"Petritsch","first_name":"Barbara","orcid":"0000-0003-2724-4614","id":"406048EC-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2020-07-14T23:06:21Z","date_created":"2019-05-16T07:27:14Z","oa_version":"Published Version","file":[{"checksum":"9063ab4d10ea93353c3a03bbf53fbcf1","date_created":"2019-05-16T07:26:25Z","date_updated":"2020-07-14T12:47:30Z","relation":"main_file","file_id":"6460","file_size":1967778,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"Poster_Beitrag_125_Petritsch.pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6459","year":"2018","title":"Open Access at IST Austria 2009-2017","ddc":["020"],"publication_status":"published","status":"public","department":[{"_id":"E-Lib"}],"publisher":"IST Austria"},{"_id":"6525","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2018","department":[{"_id":"TaHa"}],"publisher":"Oxford University Press","publication_status":"published","status":"public","title":"Mirror symmetry with branes by equivariant verlinde formulas","author":[{"first_name":"Tamás","last_name":"Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","full_name":"Hausel, Tamás"},{"full_name":"Mellit, Anton","last_name":"Mellit","first_name":"Anton","id":"388D3134-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Du","last_name":"Pei","full_name":"Pei, Du"}],"oa_version":"None","date_created":"2019-06-06T12:42:01Z","date_updated":"2021-01-12T08:07:52Z","type":"book_chapter","abstract":[{"lang":"eng","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."}],"citation":{"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","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.","ista":"Hausel T, Mellit A, Pei D. 2018.Mirror symmetry with branes by equivariant verlinde formulas. In: Geometry and Physics: Volume I. , 189–218.","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","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.","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."},"publication":"Geometry and Physics: Volume I","page":"189-218","quality_controlled":"1","date_published":"2018-01-01T00:00:00Z","doi":"10.1093/oso/9780198802013.003.0009","language":[{"iso":"eng"}],"scopus_import":1,"publication_identifier":{"isbn":["9780198802013","9780191840500"]},"day":"01","month":"01"},{"publist_id":"7017","ec_funded":1,"article_number":"543-616","volume":171,"date_updated":"2021-01-12T08:09:33Z","date_created":"2018-12-11T11:47:56Z","author":[{"full_name":"Lee, Jii","first_name":"Jii","last_name":"Lee"},{"id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0954-3231","first_name":"Kevin","last_name":"Schnelli","full_name":"Schnelli, Kevin"}],"publisher":"Springer","department":[{"_id":"LaEr"}],"publication_status":"published","year":"2018","month":"06","language":[{"iso":"eng"}],"doi":"10.1007/s00440-017-0787-8","project":[{"call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804"}],"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1605.08767"}],"external_id":{"arxiv":["1605.08767"]},"issue":"1-2","abstract":[{"lang":"eng","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."}],"type":"journal_article","oa_version":"Preprint","intvolume":" 171","status":"public","title":"Local law and Tracy–Widom limit for sparse random matrices","_id":"690","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"14","scopus_import":1,"date_published":"2018-06-14T00:00:00Z","citation":{"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","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.","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.","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.","short":"J. Lee, K. Schnelli, Probability Theory and Related Fields 171 (2018).","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."},"publication":"Probability Theory and Related Fields"}]