TY - JOUR AB - 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. AU - Petritsch, Barbara AU - Porsche, Jana ID - 53 IS - 1 JF - VÖB Mitteilungen TI - IST PubRep and IST DataRep: the institutional repositories at IST Austria VL - 71 ER - TY - JOUR AB - 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. AU - Alistarh, Dan-Adrian AU - Aspnes, James AU - King, Valerie AU - Saia, Jared ID - 536 IS - 6 JF - Distributed Computing SN - 01782770 TI - Communication-efficient randomized consensus VL - 31 ER - TY - JOUR AB - 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.). AU - Napiórkowski, Marcin M AU - Reuvers, Robin AU - Solovej, Jan ID - 554 IS - 1 JF - Communications in Mathematical Physics SN - 00103616 TI - The Bogoliubov free energy functional II: The dilute Limit VL - 360 ER - TY - CHAP AB - 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. AU - Dimitrov, Dimitar AU - Guillaud, Laurent AU - Eguchi, Kohgaku AU - Takahashi, Tomoyuki ED - Skaper, Stephen D. ID - 562 T2 - Neurotrophic Factors TI - Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses VL - 1727 ER - TY - CHAP AB - 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. AU - Bloem, Roderick AU - Chatterjee, Krishnendu AU - Jobstmann, Barbara ED - Henzinger, Thomas A ED - Clarke, Edmund M. ED - Veith, Helmut ED - Bloem, Roderick ID - 59 SN - 978-3-319-10574-1 T2 - Handbook of Model Checking TI - Graph games and reactive synthesis ER -