[{"citation":{"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.","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","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","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.","short":"D. Dimitrov, L. Guillaud, K. Eguchi, T. Takahashi, in:, S.D. Skaper (Ed.), Neurotrophic Factors, Springer, 2018, pp. 201–215.","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Dimitar","last_name":"Dimitrov","full_name":"Dimitrov, Dimitar"},{"last_name":"Guillaud","full_name":"Guillaud, Laurent","first_name":"Laurent"},{"first_name":"Kohgaku","id":"2B7846DC-F248-11E8-B48F-1D18A9856A87","last_name":"Eguchi","orcid":"0000-0002-6170-2546","full_name":"Eguchi, Kohgaku"},{"first_name":"Tomoyuki","last_name":"Takahashi","full_name":"Takahashi, Tomoyuki"}],"publist_id":"7252","external_id":{"pmid":["29222783"]},"article_processing_charge":"No","title":"Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses","editor":[{"full_name":"Skaper, Stephen D.","last_name":"Skaper","first_name":"Stephen D."}],"has_accepted_license":"1","year":"2018","day":"01","publication":"Neurotrophic Factors","page":"201 - 215","date_published":"2018-01-01T00:00:00Z","doi":"10.1007/978-1-4939-7571-6_15","date_created":"2018-12-11T11:47:11Z","publisher":"Springer","quality_controlled":"1","oa":1,"date_updated":"2021-01-12T08:03:05Z","ddc":["570"],"department":[{"_id":"RySh"}],"file_date_updated":"2020-07-14T12:47:09Z","_id":"562","type":"book_chapter","status":"public","publication_status":"published","file":[{"creator":"dernst","file_size":787407,"date_updated":"2020-07-14T12:47:09Z","file_name":"2018_NeurotrophicFactors_Dimitrov.pdf","date_created":"2019-11-19T07:47:43Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"7046","checksum":"8aa174ca65a56fbb19e9f88cff3ac3fd"}],"language":[{"iso":"eng"}],"volume":1727,"abstract":[{"lang":"eng","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."}],"pmid":1,"oa_version":"Submitted Version","scopus_import":1,"alternative_title":["Methods in Molecular Biology"],"month":"01","intvolume":" 1727"},{"editor":[{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Clarke, Edmund M.","last_name":"Clarke","first_name":"Edmund M."},{"full_name":"Veith, Helmut","last_name":"Veith","first_name":"Helmut"},{"last_name":"Bloem","full_name":"Bloem, Roderick","first_name":"Roderick"}],"title":"Graph games and reactive synthesis","department":[{"_id":"KrCh"}],"author":[{"first_name":"Roderick","full_name":"Bloem, Roderick","last_name":"Bloem"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"}],"publist_id":"7995","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:05:10Z","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.","ista":"Bloem R, Chatterjee K, Jobstmann B. 2018.Graph games and reactive synthesis. In: Handbook of Model Checking. , 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.","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.","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.","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","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"},"status":"public","type":"book_chapter","_id":"59","date_created":"2018-12-11T11:44:24Z","date_published":"2018-05-19T00:00:00Z","doi":"10.1007/978-3-319-10575-8_27","page":"921 - 962","publication":"Handbook of Model Checking","language":[{"iso":"eng"}],"day":"19","year":"2018","publication_status":"published","publication_identifier":{"isbn":["978-3-319-10574-1"]},"month":"05","edition":"1","publisher":"Springer","scopus_import":1,"quality_controlled":"1","oa_version":"None","abstract":[{"lang":"eng","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."}]},{"status":"public","type":"book_chapter","_id":"60","series_title":"Handbook of Model Checking","editor":[{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"}],"department":[{"_id":"ToHe"}],"title":"Introduction to model checking","author":[{"full_name":"Clarke, Edmund","last_name":"Clarke","first_name":"Edmund"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Helmut","full_name":"Veith, Helmut","last_name":"Veith"}],"publist_id":"7994","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:05:35Z","citation":{"ista":"Clarke E, Henzinger TA, Veith H. 2018.Introduction to model checking. In: Handbook of Model Checking. , 1–26.","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.","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.","short":"E. Clarke, T.A. Henzinger, H. Veith, in:, T.A. Henzinger (Ed.), Handbook of Model Checking, Springer, 2018, pp. 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","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","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."},"month":"05","scopus_import":1,"quality_controlled":"1","publisher":"Springer","oa_version":"None","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"}],"date_published":"2018-05-19T00:00:00Z","doi":"10.1007/978-3-319-10575-8_1","date_created":"2018-12-11T11:44:25Z","page":"1 - 26","day":"19","language":[{"iso":"eng"}],"publication":"Handbook of Model Checking","year":"2018","publication_status":"published"},{"month":"05","publisher":"Springer","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1509.06286"}],"oa":1,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We prove that there is no strongly regular graph (SRG) with parameters (460; 153; 32; 60). The proof is based on a recent lower bound on the number of 4-cliques in a SRG and some applications of Euclidean representation of SRGs. "}],"doi":"10.1007/978-3-319-72456-0_7","date_published":"2018-05-23T00:00:00Z","date_created":"2018-12-11T11:44:25Z","page":"131 - 134","day":"23","publication":"Contemporary Computational Mathematics","language":[{"iso":"eng"}],"year":"2018","publication_status":"published","status":"public","type":"book_chapter","_id":"61","title":"There is no strongly regular graph with parameters (460; 153; 32; 60)","department":[{"_id":"TaHa"}],"publist_id":"7993","author":[{"first_name":"Andriy","last_name":"Bondarenko","full_name":"Bondarenko, Andriy"},{"id":"388D3134-F248-11E8-B48F-1D18A9856A87","first_name":"Anton","full_name":"Mellit, Anton","last_name":"Mellit"},{"full_name":"Prymak, Andriy","last_name":"Prymak","first_name":"Andriy"},{"first_name":"Danylo","last_name":"Radchenko","full_name":"Radchenko, Danylo"},{"first_name":"Maryna","last_name":"Viazovska","full_name":"Viazovska, Maryna"}],"external_id":{"arxiv":["1509.06286"]},"article_processing_charge":"No","extern":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Bondarenko A, Mellit A, Prymak A, Radchenko D, Viazovska M. 2018.There is no strongly regular graph with parameters (460; 153; 32; 60). In: Contemporary Computational Mathematics. , 131–134.","chicago":"Bondarenko, Andriy, Anton Mellit, Andriy Prymak, Danylo Radchenko, and Maryna Viazovska. “There Is No Strongly Regular Graph with Parameters (460; 153; 32; 60).” In Contemporary Computational Mathematics, 131–34. Springer, 2018. https://doi.org/10.1007/978-3-319-72456-0_7.","apa":"Bondarenko, A., Mellit, A., Prymak, A., Radchenko, D., & Viazovska, M. (2018). There is no strongly regular graph with parameters (460; 153; 32; 60). In Contemporary Computational Mathematics (pp. 131–134). Springer. https://doi.org/10.1007/978-3-319-72456-0_7","ama":"Bondarenko A, Mellit A, Prymak A, Radchenko D, Viazovska M. There is no strongly regular graph with parameters (460; 153; 32; 60). In: Contemporary Computational Mathematics. Springer; 2018:131-134. doi:10.1007/978-3-319-72456-0_7","short":"A. Bondarenko, A. Mellit, A. Prymak, D. Radchenko, M. Viazovska, in:, Contemporary Computational Mathematics, Springer, 2018, pp. 131–134.","ieee":"A. Bondarenko, A. Mellit, A. Prymak, D. Radchenko, and M. Viazovska, “There is no strongly regular graph with parameters (460; 153; 32; 60),” in Contemporary Computational Mathematics, Springer, 2018, pp. 131–134.","mla":"Bondarenko, Andriy, et al. “There Is No Strongly Regular Graph with Parameters (460; 153; 32; 60).” Contemporary Computational Mathematics, Springer, 2018, pp. 131–34, doi:10.1007/978-3-319-72456-0_7."},"date_updated":"2021-01-12T08:06:06Z"},{"day":"20","publication":"Bio-Protocol","has_accepted_license":"1","year":"2018","doi":"10.21769/bioprotoc.3018","date_published":"2018-09-20T00:00:00Z","date_created":"2019-04-29T09:40:33Z","acknowledgement":" FöFoLe project 947 (F.G.), the Friedrich-Baur-Stiftung project 41/16 (F.G.)","publisher":"Bio-Protocol","quality_controlled":"1","oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"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.","ista":"Fan S, Lorenz M, Massberg S, Gärtner FR. 2018. Platelet migration and bacterial trapping assay under flow. Bio-Protocol. 8(18), e3018.","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).","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.","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","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"},"title":"Platelet migration and bacterial trapping assay under flow","author":[{"first_name":"Shuxia","full_name":"Fan, Shuxia","last_name":"Fan"},{"first_name":"Michael","full_name":"Lorenz, Michael","last_name":"Lorenz"},{"first_name":"Steffen","full_name":"Massberg, Steffen","last_name":"Massberg"},{"last_name":"Gärtner","orcid":"0000-0001-6120-3723","full_name":"Gärtner, Florian R","first_name":"Florian R","id":"397A88EE-F248-11E8-B48F-1D18A9856A87"}],"article_number":"e3018","project":[{"call_identifier":"H2020","_id":"260AA4E2-B435-11E9-9278-68D0E5697425","name":"Mechanical Adaptation of Lamellipodial Actin Networks in Migrating Cells","grant_number":"747687"}],"file":[{"date_created":"2019-04-30T08:04:33Z","file_name":"2018_BioProtocol_Fan.pdf","creator":"dernst","date_updated":"2020-07-14T12:47:28Z","file_size":2928337,"file_id":"6360","checksum":"d4588377e789da7f360b553ae02c5119","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2331-8325"]},"publication_status":"published","issue":"18","volume":8,"ec_funded":1,"oa_version":"Published Version","abstract":[{"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.","lang":"eng"}],"month":"09","intvolume":" 8","ddc":["570"],"date_updated":"2021-01-12T08:07:12Z","file_date_updated":"2020-07-14T12:47:28Z","department":[{"_id":"MiSi"}],"_id":"6354","status":"public","keyword":["Platelets","Cell migration","Bacteria","Shear flow","Fibrinogen","E. coli"],"type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"}},{"file_date_updated":"2020-07-14T12:47:30Z","title":"Open Access at IST Austria 2009-2017","department":[{"_id":"E-Lib"}],"author":[{"first_name":"Barbara","id":"406048EC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2724-4614","full_name":"Petritsch, Barbara","last_name":"Petritsch"}],"ddc":["020"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2020-07-14T23:06:21Z","citation":{"chicago":"Petritsch, Barbara. Open Access at IST Austria 2009-2017. IST Austria, 2018. https://doi.org/10.5281/zenodo.1410279.","ista":"Petritsch B. 2018. Open Access at IST Austria 2009-2017, IST Austria,p.","mla":"Petritsch, Barbara. Open Access at IST Austria 2009-2017. IST Austria, 2018, doi:10.5281/zenodo.1410279.","ieee":"B. Petritsch, Open Access at IST Austria 2009-2017. IST Austria, 2018.","short":"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","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"},"status":"public","keyword":["Open Access","Publication Analysis"],"type":"conference_poster","conference":{"start_date":"2018-09-24","end_date":"2018-09-26","location":"Graz, Austria","name":"Open-Access-Tage"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"6459","doi":"10.5281/zenodo.1410279","date_published":"2018-09-24T00:00:00Z","date_created":"2019-05-16T07:27:14Z","day":"24","file":[{"checksum":"9063ab4d10ea93353c3a03bbf53fbcf1","file_id":"6460","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2019-05-16T07:26:25Z","file_name":"Poster_Beitrag_125_Petritsch.pdf","date_updated":"2020-07-14T12:47:30Z","file_size":1967778,"creator":"dernst"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","publication_status":"published","year":"2018","month":"09","publisher":"IST Austria","oa":1,"oa_version":"Published Version"},{"status":"public","type":"book_chapter","_id":"6525","title":"Mirror symmetry with branes by equivariant verlinde formulas","department":[{"_id":"TaHa"}],"author":[{"last_name":"Hausel","full_name":"Hausel, Tamás","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","first_name":"Tamás"},{"id":"388D3134-F248-11E8-B48F-1D18A9856A87","first_name":"Anton","last_name":"Mellit","full_name":"Mellit, Anton"},{"first_name":"Du","full_name":"Pei, Du","last_name":"Pei"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Hausel T, Mellit A, Pei D. 2018.Mirror symmetry with branes by equivariant verlinde formulas. In: Geometry and Physics: Volume I. , 189–218.","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.","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.","short":"T. Hausel, A. Mellit, D. Pei, 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","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","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."},"date_updated":"2021-01-12T08:07:52Z","month":"01","quality_controlled":"1","scopus_import":1,"publisher":"Oxford University Press","oa_version":"None","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."}],"date_created":"2019-06-06T12:42:01Z","doi":"10.1093/oso/9780198802013.003.0009","date_published":"2018-01-01T00:00:00Z","page":"189-218","publication":"Geometry and Physics: Volume I","language":[{"iso":"eng"}],"day":"01","publication_status":"published","year":"2018","publication_identifier":{"isbn":["9780198802013","9780191840500"]}},{"oa":1,"quality_controlled":"1","publisher":"Springer","date_created":"2018-12-11T11:47:56Z","doi":"10.1007/s00440-017-0787-8","date_published":"2018-06-14T00:00:00Z","year":"2018","publication":"Probability Theory and Related Fields","day":"14","project":[{"grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"article_number":"543-616","external_id":{"arxiv":["1605.08767"]},"publist_id":"7017","author":[{"full_name":"Lee, Jii","last_name":"Lee","first_name":"Jii"},{"id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","first_name":"Kevin","orcid":"0000-0003-0954-3231","full_name":"Schnelli, Kevin","last_name":"Schnelli"}],"title":"Local law and Tracy–Widom limit for sparse random matrices","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.","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.","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","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","short":"J. Lee, K. Schnelli, Probability Theory and Related Fields 171 (2018).","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1605.08767"}],"scopus_import":1,"intvolume":" 171","month":"06","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."}],"oa_version":"Preprint","ec_funded":1,"volume":171,"issue":"1-2","publication_status":"published","language":[{"iso":"eng"}],"type":"journal_article","status":"public","_id":"690","department":[{"_id":"LaEr"}],"date_updated":"2021-01-12T08:09:33Z"},{"_id":"703","type":"journal_article","status":"public","date_updated":"2021-01-12T08:11:32Z","department":[{"_id":"VlKo"}],"abstract":[{"lang":"eng","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."}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1508.07902"}],"scopus_import":1,"intvolume":" 40","month":"07","publication_status":"published","publication_identifier":{"issn":["01628828"]},"language":[{"iso":"eng"}],"volume":40,"issue":"7","citation":{"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","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","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.","short":"A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern Analysis and Machine Intelligence 40 (2018) 1668–1682.","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.","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1508.07902"]},"publist_id":"6992","author":[{"last_name":"Shekhovtsov","full_name":"Shekhovtsov, Alexander","first_name":"Alexander"},{"full_name":"Swoboda, Paul","last_name":"Swoboda","id":"446560C6-F248-11E8-B48F-1D18A9856A87","first_name":"Paul"},{"last_name":"Savchynskyy","full_name":"Savchynskyy, Bogdan","first_name":"Bogdan"}],"title":"Maximum persistency via iterative relaxed inference with graphical models","oa":1,"quality_controlled":"1","publisher":"IEEE","year":"2018","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","day":"01","page":"1668-1682","date_created":"2018-12-11T11:48:01Z","doi":"10.1109/TPAMI.2017.2730884","date_published":"2018-07-01T00:00:00Z"},{"month":"03","scopus_import":1,"oa_version":"Published Version","abstract":[{"lang":"eng","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."}],"language":[{"iso":"eng"}],"file":[{"creator":"dernst","file_size":1603204,"date_updated":"2020-07-14T12:47:49Z","file_name":"2018_OpenProceedings_Grubic.pdf","date_created":"2019-11-26T14:23:04Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"ec979b56abc71016d6e6adfdadbb4afe","file_id":"7118"}],"publication_status":"published","publication_identifier":{"isbn":["9783893180783"],"issn":["2367-2005"]},"status":"public","tmp":{"short":"CC BY-NC-ND (4.0)","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","image":"/images/cc_by_nc_nd.png"},"conference":{"start_date":"2018-03-26","location":"Vienna, Austria","end_date":"2018-03-29","name":"EDBT: Conference on Extending Database Technology"},"type":"conference","_id":"7116","department":[{"_id":"DaAl"}],"file_date_updated":"2020-07-14T12:47:49Z","ddc":["000"],"date_updated":"2023-02-23T12:59:17Z","oa":1,"quality_controlled":"1","publisher":"OpenProceedings","date_created":"2019-11-26T14:19:11Z","date_published":"2018-03-26T00:00:00Z","doi":"10.5441/002/EDBT.2018.14","page":"145-156","publication":"Proceedings of the 21st International Conference on Extending Database Technology","day":"26","year":"2018","has_accepted_license":"1","title":"Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study","article_processing_charge":"No","author":[{"first_name":"Demjan","last_name":"Grubic","full_name":"Grubic, Demjan"},{"first_name":"Leo","full_name":"Tam, Leo","last_name":"Tam"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X"},{"first_name":"Ce","last_name":"Zhang","full_name":"Zhang, Ce"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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","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","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.","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.","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."}}]