--- _id: '53' abstract: - lang: eng 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. author: - first_name: Barbara full_name: Petritsch, Barbara id: 406048EC-F248-11E8-B48F-1D18A9856A87 last_name: Petritsch orcid: 0000-0003-2724-4614 - first_name: Jana full_name: Porsche, Jana id: 3252EDC2-F248-11E8-B48F-1D18A9856A87 last_name: Porsche 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' 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' 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.' 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.' ista: 'Petritsch B, Porsche J. 2018. IST PubRep and IST DataRep: the institutional repositories at IST Austria. VÖB Mitteilungen. 71(1), 199–206.' 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. date_created: 2018-12-11T11:44:22Z date_published: 2018-10-01T00:00:00Z date_updated: 2021-01-12T08:01:26Z day: '01' ddc: - '020' department: - _id: E-Lib doi: 10.31263/voebm.v71i1.1993 file: - access_level: open_access checksum: 7ac61bade5f37db011ca435ebcf86797 content_type: application/pdf creator: dernst date_created: 2018-12-17T12:40:27Z date_updated: 2020-07-14T12:46:38Z file_id: '5702' file_name: 2018_VOEB_Petritsch.pdf file_size: 509434 relation: main_file file_date_updated: 2020-07-14T12:46:38Z has_accepted_license: '1' intvolume: ' 71' issue: '1' language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: 199 - 206 publication: VÖB Mitteilungen publication_status: published publisher: Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare publist_id: '8001' scopus_import: 1 status: public title: 'IST PubRep and IST DataRep: the institutional repositories at IST Austria' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 71 year: '2018' ... --- _id: '536' 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.' article_processing_charge: Yes (via OA deal) author: - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: James full_name: Aspnes, James last_name: Aspnes - first_name: Valerie full_name: King, Valerie last_name: King - first_name: Jared full_name: Saia, Jared last_name: Saia citation: 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 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. 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. 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. date_created: 2018-12-11T11:47:01Z date_published: 2018-11-01T00:00:00Z date_updated: 2023-02-23T12:23:25Z day: '01' ddc: - '000' department: - _id: DaAl doi: 10.1007/s00446-017-0315-1 file: - access_level: open_access checksum: 69b46e537acdcac745237ddb853fcbb5 content_type: application/pdf creator: dernst date_created: 2019-01-22T07:25:51Z date_updated: 2020-07-14T12:46:38Z file_id: '5867' file_name: 2017_DistribComp_Alistarh.pdf file_size: 595707 relation: main_file file_date_updated: 2020-07-14T12:46:38Z has_accepted_license: '1' intvolume: ' 31' issue: '6' language: - iso: eng month: '11' oa: 1 oa_version: Published Version page: 489-501 project: - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: Distributed Computing publication_identifier: issn: - '01782770' publication_status: published publisher: Springer publist_id: '7281' quality_controlled: '1' scopus_import: 1 status: public title: Communication-efficient randomized consensus tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 31 year: '2018' ... --- _id: '554' abstract: - lang: eng 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.). author: - first_name: Marcin M full_name: Napiórkowski, Marcin M id: 4197AD04-F248-11E8-B48F-1D18A9856A87 last_name: Napiórkowski - first_name: Robin full_name: Reuvers, Robin last_name: Reuvers - first_name: Jan full_name: Solovej, Jan last_name: Solovej citation: 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' 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' 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.' 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.' 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.' 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_created: 2018-12-11T11:47:09Z date_published: 2018-05-01T00:00:00Z date_updated: 2021-01-12T08:02:35Z day: '01' department: - _id: RoSe doi: 10.1007/s00220-017-3064-x external_id: arxiv: - '1511.05953' intvolume: ' 360' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1511.05953 month: '05' oa: 1 oa_version: Submitted Version page: 347-403 project: - _id: 25C878CE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P27533_N27 name: Structure of the Excitation Spectrum for Many-Body Quantum Systems publication: Communications in Mathematical Physics publication_identifier: issn: - '00103616' publication_status: published publisher: Springer publist_id: '7260' quality_controlled: '1' scopus_import: 1 status: public title: 'The Bogoliubov free energy functional II: The dilute Limit' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 360 year: '2018' ... --- _id: '562' 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. alternative_title: - Methods in Molecular Biology article_processing_charge: No author: - first_name: Dimitar full_name: Dimitrov, Dimitar last_name: Dimitrov - first_name: Laurent full_name: Guillaud, Laurent last_name: Guillaud - first_name: Kohgaku full_name: Eguchi, Kohgaku id: 2B7846DC-F248-11E8-B48F-1D18A9856A87 last_name: Eguchi orcid: 0000-0002-6170-2546 - first_name: Tomoyuki full_name: Takahashi, Tomoyuki last_name: Takahashi 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 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. 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.' 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. short: D. Dimitrov, L. Guillaud, K. Eguchi, T. Takahashi, in:, S.D. Skaper (Ed.), Neurotrophic Factors, Springer, 2018, pp. 201–215. date_created: 2018-12-11T11:47:11Z date_published: 2018-01-01T00:00:00Z date_updated: 2021-01-12T08:03:05Z day: '01' ddc: - '570' department: - _id: RySh doi: 10.1007/978-1-4939-7571-6_15 editor: - first_name: Stephen D. full_name: Skaper, Stephen D. last_name: Skaper external_id: pmid: - '29222783' file: - access_level: open_access checksum: 8aa174ca65a56fbb19e9f88cff3ac3fd content_type: application/pdf creator: dernst date_created: 2019-11-19T07:47:43Z date_updated: 2020-07-14T12:47:09Z file_id: '7046' file_name: 2018_NeurotrophicFactors_Dimitrov.pdf file_size: 787407 relation: main_file file_date_updated: 2020-07-14T12:47:09Z has_accepted_license: '1' intvolume: ' 1727' language: - iso: eng month: '01' oa: 1 oa_version: Submitted Version page: 201 - 215 pmid: 1 publication: Neurotrophic Factors publication_status: published publisher: Springer publist_id: '7252' quality_controlled: '1' scopus_import: 1 status: public title: Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 1727 year: '2018' ... --- _id: '59' 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. author: - first_name: Roderick full_name: Bloem, Roderick last_name: Bloem - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Barbara full_name: Jobstmann, Barbara last_name: Jobstmann citation: 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 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. 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.' 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. date_created: 2018-12-11T11:44:24Z date_published: 2018-05-19T00:00:00Z date_updated: 2021-01-12T08:05:10Z day: '19' department: - _id: KrCh doi: 10.1007/978-3-319-10575-8_27 edition: '1' editor: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Edmund M. full_name: Clarke, Edmund M. last_name: Clarke - first_name: Helmut full_name: Veith, Helmut last_name: Veith - first_name: Roderick full_name: Bloem, Roderick last_name: Bloem language: - iso: eng month: '05' oa_version: None page: 921 - 962 publication: Handbook of Model Checking publication_identifier: isbn: - 978-3-319-10574-1 publication_status: published publisher: Springer publist_id: '7995' quality_controlled: '1' scopus_import: 1 status: public title: Graph games and reactive synthesis type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ...