TY - JOUR AB - D-cycloserine ameliorates breathing abnormalities and survival rate in a mouse model of Rett syndrome. AU - Novarino, Gaia ID - 715 IS - 405 JF - Science Translational Medicine SN - 19466234 TI - More excitation for Rett syndrome VL - 9 ER - TY - JOUR AB - Two-player games on graphs are central in many problems in formal verification and program analysis, such as synthesis and verification of open systems. In this work, we consider solving recursive game graphs (or pushdown game graphs) that model the control flow of sequential programs with recursion.While pushdown games have been studied before with qualitative objectives-such as reachability and ?-regular objectives- in this work, we study for the first time such games with the most well-studied quantitative objective, the mean-payoff objective. In pushdown games, two types of strategies are relevant: (1) global strategies, which depend on the entire global history; and (2) modular strategies, which have only local memory and thus do not depend on the context of invocation but rather only on the history of the current invocation of the module. Our main results are as follows: (1) One-player pushdown games with mean-payoff objectives under global strategies are decidable in polynomial time. (2) Two-player pushdown games with mean-payoff objectives under global strategies are undecidable. (3) One-player pushdown games with mean-payoff objectives under modular strategies are NP-hard. (4) Two-player pushdown games with mean-payoff objectives under modular strategies can be solved in NP (i.e., both one-player and two-player pushdown games with mean-payoff objectives under modular strategies are NP-complete). We also establish the optimal strategy complexity by showing that global strategies for mean-payoff objectives require infinite memory even in one-player pushdown games and memoryless modular strategies are sufficient in two-player pushdown games. Finally, we also show that all the problems have the same complexity if the stack boundedness condition is added, where along with the mean-payoff objective the player must also ensure that the stack height is bounded. AU - Chatterjee, Krishnendu AU - Velner, Yaron ID - 716 IS - 5 JF - Journal of the ACM SN - 00045411 TI - The complexity of mean-payoff pushdown games VL - 64 ER - TY - JOUR AB - We consider finite-state and recursive game graphs with multidimensional mean-payoff objectives. In recursive games two types of strategies are relevant: global strategies and modular strategies. Our contributions are: (1) We show that finite-state multidimensional mean-payoff games can be solved in polynomial time if the number of dimensions and the maximal absolute value of weights are fixed; whereas for arbitrary dimensions the problem is coNP-complete. (2) We show that one-player recursive games with multidimensional mean-payoff objectives can be solved in polynomial time. Both above algorithms are based on hyperplane separation technique. (3) For recursive games we show that under modular strategies the multidimensional problem is undecidable. We show that if the number of modules, exits, and the maximal absolute value of the weights are fixed, then one-dimensional recursive mean-payoff games under modular strategies can be solved in polynomial time, whereas for unbounded number of exits or modules the problem is NP-hard. AU - Chatterjee, Krishnendu AU - Velner, Yaron ID - 717 JF - Journal of Computer and System Sciences TI - Hyperplane separation technique for multidimensional mean-payoff games VL - 88 ER - TY - JOUR AB - The ubiquity of computation in modern machines and devices imposes a need to assert the correctness of their behavior. Especially in the case of safety-critical systems, their designers need to take measures that enforce their safe operation. Formal methods has emerged as a research field that addresses this challenge: by rigorously proving that all system executions adhere to their specifications, the correctness of an implementation under concern can be assured. To achieve this goal, a plethora of techniques are nowadays available, all of which are optimized for different system types and application domains. AU - Chatterjee, Krishnendu AU - Ehlers, Rüdiger ID - 719 IS - 6 JF - Acta Informatica SN - 00015903 TI - Special issue: Synthesis and SYNT 2014 VL - 54 ER - TY - JOUR AB - Advances in multi-unit recordings pave the way for statistical modeling of activity patterns in large neural populations. Recent studies have shown that the summed activity of all neurons strongly shapes the population response. A separate recent finding has been that neural populations also exhibit criticality, an anomalously large dynamic range for the probabilities of different population activity patterns. Motivated by these two observations, we introduce a class of probabilistic models which takes into account the prior knowledge that the neural population could be globally coupled and close to critical. These models consist of an energy function which parametrizes interactions between small groups of neurons, and an arbitrary positive, strictly increasing, and twice differentiable function which maps the energy of a population pattern to its probability. We show that: 1) augmenting a pairwise Ising model with a nonlinearity yields an accurate description of the activity of retinal ganglion cells which outperforms previous models based on the summed activity of neurons; 2) prior knowledge that the population is critical translates to prior expectations about the shape of the nonlinearity; 3) the nonlinearity admits an interpretation in terms of a continuous latent variable globally coupling the system whose distribution we can infer from data. Our method is independent of the underlying system’s state space; hence, it can be applied to other systems such as natural scenes or amino acid sequences of proteins which are also known to exhibit criticality. AU - Humplik, Jan AU - Tkacik, Gasper ID - 720 IS - 9 JF - PLoS Computational Biology SN - 1553734X TI - Probabilistic models for neural populations that naturally capture global coupling and criticality VL - 13 ER - TY - JOUR AB - Let S be a positivity-preserving symmetric linear operator acting on bounded functions. The nonlinear equation -1/m=z+Sm with a parameter z in the complex upper half-plane ℍ has a unique solution m with values in ℍ. We show that the z-dependence of this solution can be represented as the Stieltjes transforms of a family of probability measures v on ℝ. Under suitable conditions on S, we show that v has a real analytic density apart from finitely many algebraic singularities of degree at most 3. Our motivation comes from large random matrices. The solution m determines the density of eigenvalues of two prominent matrix ensembles: (i) matrices with centered independent entries whose variances are given by S and (ii) matrices with correlated entries with a translation-invariant correlation structure. Our analysis shows that the limiting eigenvalue density has only square root singularities or cubic root cusps; no other singularities occur. AU - Ajanki, Oskari H AU - Krüger, Torben H AU - Erdös, László ID - 721 IS - 9 JF - Communications on Pure and Applied Mathematics SN - 00103640 TI - Singularities of solutions to quadratic vector equations on the complex upper half plane VL - 70 ER - TY - JOUR AB - Plants are sessile organisms rooted in one place. The soil resources that plants require are often distributed in a highly heterogeneous pattern. To aid foraging, plants have evolved roots whose growth and development are highly responsive to soil signals. As a result, 3D root architecture is shaped by myriad environmental signals to ensure resource capture is optimised and unfavourable environments are avoided. The first signals sensed by newly germinating seeds — gravity and light — direct root growth into the soil to aid seedling establishment. Heterogeneous soil resources, such as water, nitrogen and phosphate, also act as signals that shape 3D root growth to optimise uptake. Root architecture is also modified through biotic interactions that include soil fungi and neighbouring plants. This developmental plasticity results in a ‘custom-made’ 3D root system that is best adapted to forage for resources in each soil environment that a plant colonises. AU - Morris, Emily AU - Griffiths, Marcus AU - Golebiowska, Agata AU - Mairhofer, Stefan AU - Burr Hersey, Jasmine AU - Goh, Tatsuaki AU - Von Wangenheim, Daniel AU - Atkinson, Brian AU - Sturrock, Craig AU - Lynch, Jonathan AU - Vissenberg, Kris AU - Ritz, Karl AU - Wells, Darren AU - Mooney, Sacha AU - Bennett, Malcolm ID - 722 IS - 17 JF - Current Biology SN - 09609822 TI - Shaping 3D root system architecture VL - 27 ER - TY - JOUR AB - Individual computations and social interactions underlying collective behavior in groups of animals are of great ethological, behavioral, and theoretical interest. While complex individual behaviors have successfully been parsed into small dictionaries of stereotyped behavioral modes, studies of collective behavior largely ignored these findings; instead, their focus was on inferring single, mode-independent social interaction rules that reproduced macroscopic and often qualitative features of group behavior. Here, we bring these two approaches together to predict individual swimming patterns of adult zebrafish in a group. We show that fish alternate between an “active” mode, in which they are sensitive to the swimming patterns of conspecifics, and a “passive” mode, where they ignore them. Using a model that accounts for these two modes explicitly, we predict behaviors of individual fish with high accuracy, outperforming previous approaches that assumed a single continuous computation by individuals and simple metric or topological weighing of neighbors’ behavior. At the group level, switching between active and passive modes is uncorrelated among fish, but correlated directional swimming behavior still emerges. Our quantitative approach for studying complex, multi-modal individual behavior jointly with emergent group behavior is readily extensible to additional behavioral modes and their neural correlates as well as to other species. AU - Harpaz, Roy AU - Tkacik, Gasper AU - Schneidman, Elad ID - 725 IS - 38 JF - PNAS SN - 00278424 TI - Discrete modes of social information processing predict individual behavior of fish in a group VL - 114 ER - TY - JOUR AB - We investigate the stationary and dynamical behavior of an Anderson localized chain coupled to a single central bound state. Although this coupling partially dilutes the Anderson localized peaks towards nearly resonant sites, the most weight of the original peaks remains unchanged. This leads to multifractal wave functions with a frozen spectrum of fractal dimensions, which is characteristic for localized phases in models with power-law hopping. Using a perturbative approach we identify two different dynamical regimes. At weak couplings to the central site, the transport of particles and information is logarithmic in time, a feature usually attributed to many-body localization. We connect such transport to the persistence of the Poisson statistics of level spacings in parts of the spectrum. In contrast, at stronger couplings the level repulsion is established in the entire spectrum, the problem can be mapped to the Fano resonance, and the transport is ballistic. AU - Hetterich, Daniel AU - Serbyn, Maksym AU - Domínguez, Fernando AU - Pollmann, Frank AU - Trauzettel, Björn ID - 724 IS - 10 JF - Physical Review B SN - 24699950 TI - Noninteracting central site model localization and logarithmic entanglement growth VL - 96 ER - TY - JOUR AB - Genetic variations in the oxytocin receptor gene affect patients with ASD and ADHD differently. AU - Novarino, Gaia ID - 731 IS - 411 JF - Science Translational Medicine SN - 19466234 TI - The science of love in ASD and ADHD VL - 9 ER - TY - JOUR AB - Inflammation, which is a highly regulated host response against danger signals, may be harmful if it is excessive and deregulated. Ideally, anti-inflammatory therapy should autonomously commence as soon as possible after the onset of inflammation, should be controllable by a physician, and should not systemically block beneficial immune response in the long term. We describe a genetically encoded anti-inflammatory mammalian cell device based on a modular engineered genetic circuit comprising a sensor, an amplifier, a “thresholder” to restrict activation of a positive-feedback loop, a combination of advanced clinically used biopharmaceutical proteins, and orthogonal regulatory elements that linked modules into the functional device. This genetic circuit was autonomously activated by inflammatory signals, including endogenous cecal ligation and puncture (CLP)-induced inflammation in mice and serum from a systemic juvenile idiopathic arthritis (sIJA) patient, and could be reset externally by a chemical signal. The microencapsulated anti-inflammatory device significantly reduced the pathology in dextran sodium sulfate (DSS)-induced acute murine colitis, demonstrating a synthetic immunological approach for autonomous anti-inflammatory therapy. AU - Smole, Anže AU - Lainšček, Duško AU - Bezeljak, Urban AU - Horvat, Simon AU - Jerala, Roman ID - 7360 IS - 1 JF - Molecular Therapy SN - 1525-0016 TI - A synthetic mammalian therapeutic gene circuit for sensing and suppressing inflammation VL - 25 ER - TY - CONF AB - Modern communication technologies allow first responders to contact thousands of potential volunteers simultaneously for support during a crisis or disaster event. However, such volunteer efforts must be well coordinated and monitored, in order to offer an effective relief to the professionals. In this paper we extend earlier work on optimally assigning volunteers to selected landmark locations. In particular, we emphasize the aspect that obtaining good assignments requires not only advanced computational tools, but also a realistic measure of distance between volunteers and landmarks. Specifically, we propose the use of the Open Street Map (OSM) driving distance instead of he previously used flight distance. We find the OSM driving distance to be better aligned with the interests of volunteers and first responders. Furthermore, we show that relying on the flying distance leads to a substantial underestimation of the number of required volunteers, causing negative side effects in case of an actual crisis situation. AU - Pielorz, Jasmin AU - Prandtstetter, Matthias AU - Straub, Markus AU - Lampert, Christoph ID - 750 SN - 978-153862714-3 T2 - 2017 IEEE International Conference on Big Data TI - Optimal geospatial volunteer allocation needs realistic distances ER - TY - JOUR AB - We introduce a common generalization of the strong Hanani–Tutte theorem and the weak Hanani–Tutte theorem: if a graph G has a drawing D in the plane where every pair of independent edges crosses an even number of times, then G has a planar drawing preserving the rotation of each vertex whose incident edges cross each other evenly in D. The theorem is implicit in the proof of the strong Hanani–Tutte theorem by Pelsmajer, Schaefer and Štefankovič. We give a new, somewhat simpler proof. AU - Fulek, Radoslav AU - Kynčl, Jan AU - Pálvölgyi, Dömötör ID - 795 IS - 3 JF - Electronic Journal of Combinatorics SN - 10778926 TI - Unified Hanani Tutte theorem VL - 24 ER - TY - JOUR AB - Phasenübergänge helfen beim Verständnis von Vielteilchensystemen in der Festkörperphysik und Fluiddynamik bis hin zur Teilchenphysik. Unserer internationalen Kollaboration ist es gelungen, einen neuartigen Phasenübergang in einem Quantensystem zu beobachten [1]. In einem Mikrowellenresonator konnte erstmals die spontane Zustandsänderung von undurchsichtig zu transparent nachgewiesen werden. AU - Fink, Johannes M ID - 797 IS - 3 JF - Physik in unserer Zeit TI - Photonenblockade aufgelöst VL - 48 ER - TY - JOUR AB - On January the 1st, 2016 a new agreement between 32 Austrian scientific libraries and the publisher Springer took its effect: this deal covers accessing the licensed content on the one hand, and publishing open access on the other hand. More than 1000 papers by Austrian authors were published open access at Springer in the first year alone. The working group "Springer Compact Evaluierung" made the data for these articles available via the platform OpenAPC and would like to use this opportunity to give a short account of what this publishing agreement actually entails and the working group intends to do. AU - Andrae, Magdalena AU - Villányi, Márton ID - 807 IS - 2 JF - Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare SN - 10222588 TI - Der Springer Compact-Deal – Ein erster Einblick in die Evaluierung einer Offsetting-Vereinbarung VL - 70 ER - TY - JOUR AB - What data is needed about data? Describing the process to answer this question for the institutional data repository IST DataRep. AU - Petritsch, Barbara ID - 825 IS - 2 JF - Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare SN - 10222588 TI - Metadata for research data in practice VL - 70 ER - TY - CHAP AB - Small molecule biosensors based on Forster resonance energy transfer (FRET) enable small molecule signaling to be monitored with high spatial and temporal resolution in complex cellular environments. FRET sensors can be constructed by fusing a pair of fluorescent proteins to a suitable recognition domain, such as a member of the solute-binding protein (SBP) superfamily. However, naturally occurring SBPs may be unsuitable for incorporation into FRET sensors due to their low thermostability, which may preclude imaging under physiological conditions, or because the positions of their N- and C-termini may be suboptimal for fusion of fluorescent proteins, which may limit the dynamic range of the resulting sensors. Here, we show how these problems can be overcome using ancestral protein reconstruction and circular permutation. Ancestral protein reconstruction, used as a protein engineering strategy, leverages phylogenetic information to improve the thermostability of proteins, while circular permutation enables the termini of an SBP to be repositioned to maximize the dynamic range of the resulting FRET sensor. We also provide a protocol for cloning the engineered SBPs into FRET sensor constructs using Golden Gate assembly and discuss considerations for in situ characterization of the FRET sensors. AU - Clifton, Ben AU - Whitfield, Jason AU - Sanchez Romero, Inmaculada AU - Herde, Michel AU - Henneberger, Christian AU - Janovjak, Harald L AU - Jackson, Colin ED - Stein, Viktor ID - 957 SN - 10643745 T2 - Synthetic Protein Switches TI - Ancestral protein reconstruction and circular permutation for improving the stability and dynamic range of FRET sensors VL - 1596 ER - TY - CONF AB - Network games are widely used as a model for selfish resource-allocation problems. In the classical model, each player selects a path connecting her source and target vertex. The cost of traversing an edge depends on the number of players that traverse it. Thus, it abstracts the fact that different users may use a resource at different times and for different durations, which plays an important role in defining the costs of the users in reality. For example, when transmitting packets in a communication network, routing traffic in a road network, or processing a task in a production system, the traversal of the network involves an inherent delay, and so sharing and congestion of resources crucially depends on time. We study timed network games , which add a time component to network games. Each vertex v in the network is associated with a cost function, mapping the load on v to the price that a player pays for staying in v for one time unit with this load. In addition, each edge has a guard, describing time intervals in which the edge can be traversed, forcing the players to spend time on vertices. Unlike earlier work that add a time component to network games, the time in our model is continuous and cannot be discretized. In particular, players have uncountably many strategies, and a game may have uncountably many pure Nash equilibria. We study properties of timed network games with cost-sharing or congestion cost functions: their stability, equilibrium inefficiency, and complexity. In particular, we show that the answer to the question whether we can restrict attention to boundary strategies, namely ones in which edges are traversed only at the boundaries of guards, is mixed. AU - Avni, Guy AU - Guha, Shibashis AU - Kupferman, Orna ID - 963 SN - 18688969 TI - Timed network games with clocks VL - 83 ER - TY - GEN AB - Across the nervous system, certain population spiking patterns are observed far more frequently than others. A hypothesis about this structure is that these collective activity patterns function as population codewords–collective modes–carrying information distinct from that of any single cell. We investigate this phenomenon in recordings of ∼150 retinal ganglion cells, the retina’s output. We develop a novel statistical model that decomposes the population response into modes; it predicts the distribution of spiking activity in the ganglion cell population with high accuracy. We found that the modes represent localized features of the visual stimulus that are distinct from the features represented by single neurons. Modes form clusters of activity states that are readily discriminated from one another. When we repeated the same visual stimulus, we found that the same mode was robustly elicited. These results suggest that retinal ganglion cells’ collective signaling is endowed with a form of error-correcting code–a principle that may hold in brain areas beyond retina. AU - Prentice, Jason AU - Marre, Olivier AU - Ioffe, Mark AU - Loback, Adrianna AU - Tkačik, Gašper AU - Berry, Michael ID - 9709 TI - Data from: Error-robust modes of the retinal population code ER - TY - JOUR AB - While we have good understanding of bacterial metabolism at the population level, we know little about the metabolic behavior of individual cells: do single cells in clonal populations sometimes specialize on different metabolic pathways? Such metabolic specialization could be driven by stochastic gene expression and could provide individual cells with growth benefits of specialization. We measured the degree of phenotypic specialization in two parallel metabolic pathways, the assimilation of glucose and arabinose. We grew Escherichia coli in chemostats, and used isotope-labeled sugars in combination with nanometer-scale secondary ion mass spectrometry and mathematical modeling to quantify sugar assimilation at the single-cell level. We found large variation in metabolic activities between single cells, both in absolute assimilation and in the degree to which individual cells specialize in the assimilation of different sugars. Analysis of transcriptional reporters indicated that this variation was at least partially based on cell-to-cell variation in gene expression. Metabolic differences between cells in clonal populations could potentially reduce metabolic incompatibilities between different pathways, and increase the rate at which parallel reactions can be performed. AU - Nikolic, Nela AU - Schreiber, Frank AU - Dal Co, Alma AU - Kiviet, Daniel AU - Bergmiller, Tobias AU - Littmann, Sten AU - Kuypers, Marcel AU - Ackermann, Martin ID - 541 IS - 12 JF - PLoS Genetics SN - 15537390 TI - Cell-to-cell variation and specialization in sugar metabolism in clonal bacterial populations VL - 13 ER -