TY - JOUR
AB - Bradykinin (BK), a component of the kallikrein-kininogen-kinin system exerts multiple effects via B1 and B2 receptor activation. In the cardiovascular system, bradykinin has cardioprotective and vasodilator properties. We investigated the effect of BK on cardiac-projecting neurons of nucleus ambiguus, a key site for the parasympathetic cardiac regulation. BK produced a dose-dependent increase in cytosolic Ca2+ concentration. Pretreatment with HOE140, a B2 receptor antagonist, but not with R715, a B1 receptor antagonist, abolished the response to BK. A selective B2 receptor agonist, but not a B1 receptor agonist, elicited an increase in cytosolic Ca2+ similarly to BK. Inhibition of N-type voltage-gated Ca2+ channels with ω-conotoxin GVIA had no effect on the Ca2+ signal produced by BK, while pretreatment with ω-conotoxin MVIIC, a blocker of P/Q-type of Ca2+ channels, significantly diminished the effect of BK. Pretreatment with xestospongin C and 2-aminoethoxydiphenyl borate, antagonists of inositol 1,4,5-trisphosphate receptors, abolished the response to BK. Inhibition of ryanodine receptors reduced the BK-induced Ca2+ increase, while disruption of lysosomal Ca2+ stores with bafilomycin A1 did not affect the response. BK produced a dose-dependent depolarization of nucleus ambiguus neurons, which was prevented by the B2 receptor antagonist. In vivo studies indicate that microinjection of BK into nucleus ambiguus elicited bradycardia in conscious rats via B2 receptors. In summary, in cardiac vagal neurons of nucleus ambiguus, BK activates B2 receptors promoting Ca2+ influx and Ca2+ release from endoplasmic reticulum, and membrane depolarization; these effects are translated in vivo by bradycardia.
AU - Brǎiloiu, Eugen
AU - Mcguire, Matthew
AU - Shuler, Shadaria
AU - Deliu, Elena
AU - Barr, Jeffrey
AU - Abood, Mary
AU - Brailoiu, Gabriela
ID - 747
JF - Neuroscience
SN - 03064522
TI - Modulation of cardiac vagal tone by bradykinin acting on nucleus ambiguus
VL - 365
ER -
TY - JOUR
AB - Synaptotagmin 7 (Syt7) is thought to be a Ca2+ sensor that mediates asynchronous transmitter release and facilitation at synapses. However, Syt7 is strongly expressed in fast-spiking, parvalbumin-expressing GABAergic interneurons, and the output synapses of these neurons produce only minimal asynchronous release and show depression rather than facilitation. To resolve this apparent contradiction, we examined the effects of genetic elimination of Syt7 on synaptic transmission at the GABAergic basket cell (BC)-Purkinje cell (PC) synapse in cerebellum. Our results indicate that at the BC-PC synapse, Syt7 contributes to asynchronous release, pool replenishment, and facilitation. In combination, these three effects ensure efficient transmitter release during high-frequency activity and guarantee frequency independence of inhibition. Our results identify a distinct function of Syt7: ensuring the efficiency of high-frequency inhibitory synaptic transmission
AU - Chen, Chong
AU - Satterfield, Rachel
AU - Young, Samuel
AU - Jonas, Peter M
ID - 749
IS - 8
JF - Cell Reports
SN - 22111247
TI - Triple function of Synaptotagmin 7 ensures efficiency of high-frequency transmission at central GABAergic synapses
VL - 21
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 - The basement membrane (BM) is a thin layer of extracellular matrix (ECM) beneath nearly all epithelial cell types that is critical for cellular and tissue function. It is composed of numerous components conserved among all bilaterians [1]; however, it is unknown how all of these components are generated and subsequently constructed to form a fully mature BM in the living animal. Although BM formation is thought to simply involve a process of self-assembly [2], this concept suffers from a number of logistical issues when considering its construction in vivo. First, incorporation of BM components appears to be hierarchical [3-5], yet it is unclear whether their production during embryogenesis must also be regulated in a temporal fashion. Second, many BM proteins are produced not only by the cells residing on the BM but also by surrounding cell types [6-9], and it is unclear how large, possibly insoluble protein complexes [10] are delivered into the matrix. Here we exploit our ability to live image and genetically dissect de novo BM formation during Drosophila development. This reveals that there is a temporal hierarchy of BM protein production that is essential for proper component incorporation. Furthermore, we show that BM components require secretion by migrating macrophages (hemocytes) during their developmental dispersal, which is critical for embryogenesis. Indeed, hemocyte migration is essential to deliver a subset of ECM components evenly throughout the embryo. This reveals that de novo BM construction requires a combination of both production and distribution logistics allowing for the timely delivery of core components.
AU - Matsubayashi, Yutaka
AU - Louani, Adam
AU - Dragu, Anca
AU - Sanchez Sanchez, Besaiz
AU - Serna Morales, Eduardo
AU - Yolland, Lawrence
AU - György, Attila
AU - Vizcay, Gema
AU - Fleck, Roland
AU - Heddleston, John
AU - Chew, Teng
AU - Siekhaus, Daria E
AU - Stramer, Brian
ID - 751
IS - 22
JF - Current Biology
SN - 09609822
TI - A moving source of matrix components is essential for De Novo basement membrane formation
VL - 27
ER -
TY - CONF
AB - Consider the following random process: we are given n queues, into which elements of increasing labels are inserted uniformly at random. To remove an element, we pick two queues at random, and remove the element of lower label (higher priority) among the two. The cost of a removal is the rank of the label removed, among labels still present in any of the queues, that is, the distance from the optimal choice at each step. Variants of this strategy are prevalent in state-of-the-art concurrent priority queue implementations. Nonetheless, it is not known whether such implementations provide any rank guarantees, even in a sequential model. We answer this question, showing that this strategy provides surprisingly strong guarantees: Although the single-choice process, where we always insert and remove from a single randomly chosen queue, has degrading cost, going to infinity as we increase the number of steps, in the two choice process, the expected rank of a removed element is O(n) while the expected worst-case cost is O(n log n). These bounds are tight, and hold irrespective of the number of steps for which we run the process. The argument is based on a new technical connection between "heavily loaded" balls-into-bins processes and priority scheduling. Our analytic results inspire a new concurrent priority queue implementation, which improves upon the state of the art in terms of practical performance.
AU - Alistarh, Dan-Adrian
AU - Kopinsky, Justin
AU - Li, Jerry
AU - Nadiradze, Giorgi
ID - 791
SN - 978-145034992-5
T2 - Proceedings of the ACM Symposium on Principles of Distributed Computing
TI - The power of choice in priority scheduling
VL - Part F129314
ER -
TY - JOUR
AB - The chaotic dynamics of low-dimensional systems, such as Lorenz or Rössler flows, is guided by the infinity of periodic orbits embedded in their strange attractors. Whether this is also the case for the infinite-dimensional dynamics of Navier–Stokes equations has long been speculated, and is a topic of ongoing study. Periodic and relative periodic solutions have been shown to be involved in transitions to turbulence. Their relevance to turbulent dynamics – specifically, whether periodic orbits play the same role in high-dimensional nonlinear systems like the Navier–Stokes equations as they do in lower-dimensional systems – is the focus of the present investigation. We perform here a detailed study of pipe flow relative periodic orbits with energies and mean dissipations close to turbulent values. We outline several approaches to reduction of the translational symmetry of the system. We study pipe flow in a minimal computational cell at Re=2500, and report a library of invariant solutions found with the aid of the method of slices. Detailed study of the unstable manifolds of a sample of these solutions is consistent with the picture that relative periodic orbits are embedded in the chaotic saddle and that they guide the turbulent dynamics.
AU - Budanur, Nazmi B
AU - Short, Kimberly
AU - Farazmand, Mohammad
AU - Willis, Ashley
AU - Cvitanović, Predrag
ID - 792
JF - Journal of Fluid Mechanics
SN - 00221120
TI - Relative periodic orbits form the backbone of turbulent pipe flow
VL - 833
ER -
TY - JOUR
AB - Let P be a finite point set in the plane. A cordinary triangle in P is a subset of P consisting of three non-collinear points such that each of the three lines determined by the three points contains at most c points of P . Motivated by a question of Erdös, and answering a question of de Zeeuw, we prove that there exists a constant c > 0such that P contains a c-ordinary triangle, provided that P is not contained in the union of two lines. Furthermore, the number of c-ordinary triangles in P is Ω(| P |).
AU - Fulek, Radoslav
AU - Mojarrad, Hossein
AU - Naszódi, Márton
AU - Solymosi, József
AU - Stich, Sebastian
AU - Szedlák, May
ID - 793
JF - Computational Geometry: Theory and Applications
SN - 09257721
TI - On the existence of ordinary triangles
VL - 66
ER -
TY - JOUR
AB - We show that c-planarity is solvable in quadratic time for flat clustered graphs with three clusters if the combinatorial embedding of the underlying graph is fixed. In simpler graph-theoretical terms our result can be viewed as follows. Given a graph G with the vertex set partitioned into three parts embedded on a 2-sphere, our algorithm decides if we can augment G by adding edges without creating an edge-crossing so that in the resulting spherical graph the vertices of each part induce a connected sub-graph. We proceed by a reduction to the problem of testing the existence of a perfect matching in planar bipartite graphs. We formulate our result in a slightly more general setting of cyclic clustered graphs, i.e., the simple graph obtained by contracting each cluster, where we disregard loops and multi-edges, is a cycle.
AU - Fulek, Radoslav
ID - 794
JF - Computational Geometry: Theory and Applications
TI - C-planarity of embedded cyclic c-graphs
VL - 66
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 - We investigate transient behaviors induced by magnetic fields on the dynamics of the flow of a ferrofluid in the gap between two concentric, independently rotating cylinders. Without applying any magnetic fields, we uncover emergence of flow states constituted by a combination of a localized spiral state (SPIl) in the top and bottom of the annulus and different multi-cell flow states (SPI2v, SPI3v) with toroidally closed vortices in the interior of the bulk (SPIl+2v = SPIl + SPI2v and SPIl+3v = SPIl + SPI3v). However, when a magnetic field is presented, we observe the transient behaviors between multi-cell states passing through two critical thresholds in a strength of an axial (transverse) magnetic field. Before the first critical threshold of a magnetic field strength, multi-stable states with different number of cells could be observed. After the first critical threshold, we find the transient behavior between the three- and two-cell flow states. For more strength of magnetic field or after the second critical threshold, we discover that multi-cell states are disappeared and a localized spiral state remains to be stimulated. The studied transient behavior could be understood by the investigation of various quantities including a modal kinetic energy, a mode amplitude of the radial velocity, wavenumber, angular momentum, and torque. In addition, the emergence of new flow states and the transient behavior between their states in ferrofluidic flows indicate that richer and potentially controllable dynamics through magnetic fields could be possible in ferrofluic flow.
AU - Altmeyer, Sebastian
AU - Do, Younghae
AU - Ryu, Soorok
ID - 463
IS - 11
JF - Chaos
SN - 10541500
TI - Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow
VL - 27
ER -
TY - JOUR
AB - The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formedness of specifications, and the synthesis of reactive systems. We show how to compute the winning set on n vertices for (1) parity-3 (aka one-pair Streett) objectives in game graphs in time O(n5/2) and for (2) k-pair Streett objectives in graphs in time O(n2+nklogn). For both problems this gives faster algorithms for dense graphs and represents the first improvement in asymptotic running time in 15 years.
AU - Chatterjee, Krishnendu
AU - Henzinger, Monika
AU - Loitzenbauer, Veronika
ID - 464
IS - 3
JF - Logical Methods in Computer Science
SN - 18605974
TI - Improved algorithms for parity and Streett objectives
VL - 13
ER -
TY - JOUR
AB - The edit distance between two words w 1 , w 2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w 1 to w 2 . The edit distance generalizes to languages L 1 , L 2 , where the edit distance from L 1 to L 2 is the minimal number k such that for every word from L 1 there exists a word in L 2 with edit distance at most k . We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for the following problems: (1) deciding whether, for a given threshold k , the edit distance from a pushdown automaton to a finite automaton is at most k , and (2) deciding whether the edit distance from a pushdown automaton to a finite automaton is finite.
AU - Chatterjee, Krishnendu
AU - Henzinger, Thomas A
AU - Ibsen-Jensen, Rasmus
AU - Otop, Jan
ID - 465
IS - 3
JF - Logical Methods in Computer Science
SN - 18605974
TI - Edit distance for pushdown automata
VL - 13
ER -
TY - JOUR
AB - We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem.
AU - Chatterjee, Krishnendu
AU - Křetínská, Zuzana
AU - Kretinsky, Jan
ID - 466
IS - 2
JF - Logical Methods in Computer Science
SN - 18605974
TI - Unifying two views on multiple mean-payoff objectives in Markov decision processes
VL - 13
ER -
TY - JOUR
AB - Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata or in any other known decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata, which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in runtime verification. We establish an almost-complete decidability picture for the basic decision problems about nested weighted automata and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties.
AU - Chatterjee, Krishnendu
AU - Henzinger, Thomas A
AU - Otop, Jan
ID - 467
IS - 4
JF - ACM Transactions on Computational Logic (TOCL)
SN - 15293785
TI - Nested weighted automata
VL - 18
ER -
TY - JOUR
AB - This paper presents a method for simulating water surface waves as a displacement field on a 2D domain. Our method relies on Lagrangian particles that carry packets of water wave energy; each packet carries information about an entire group of wave trains, as opposed to only a single wave crest. Our approach is unconditionally stable and can simulate high resolution geometric details. This approach also presents a straightforward interface for artistic control, because it is essentially a particle system with intuitive parameters like wavelength and amplitude. Our implementation parallelizes well and runs in real time for moderately challenging scenarios.
AU - Jeschke, Stefan
AU - Wojtan, Christopher J
ID - 470
IS - 4
JF - ACM Transactions on Graphics
SN - 07300301
TI - Water wave packets
VL - 36
ER -
TY - JOUR
AB - We present a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, including full linear temporal logic. The main idea is that we monitor each simulation run on the fly, in order to detect quickly if a bottom strongly connected component is entered with high probability, in which case the simulation run can be terminated early. As a result, our simulation runs are often much shorter than required by termination bounds that are computed a priori for a desired level of confidence on a large state space. In comparison to previous algorithms for statistical model checking our method is not only faster in many cases but also requires less information about the system, namely, only the minimum transition probability that occurs in the Markov chain. In addition, our method can be generalised to unbounded quantitative properties such as mean-payoff bounds.
AU - Daca, Przemyslaw
AU - Henzinger, Thomas A
AU - Kretinsky, Jan
AU - Petrov, Tatjana
ID - 471
IS - 2
JF - ACM Transactions on Computational Logic (TOCL)
SN - 15293785
TI - Faster statistical model checking for unbounded temporal properties
VL - 18
ER -
TY - JOUR
AB - We introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist. Using our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings.
AU - Biedl, Therese
AU - Huber, Stefan
AU - Palfrader, Peter
ID - 481
IS - 3-4
JF - International Journal of Computational Geometry and Applications
TI - Planar matchings for weighted straight skeletons
VL - 26
ER -
TY - JOUR
AB - We prove the universality for the eigenvalue gap statistics in the bulk of the spectrum for band matrices, in the regime where the band width is comparable with the dimension of the matrix, W ~ N. All previous results concerning universality of non-Gaussian random matrices are for mean-field models. By relying on a new mean-field reduction technique, we deduce universality from quantum unique ergodicity for band matrices.
AU - Bourgade, Paul
AU - Erdös, László
AU - Yau, Horng
AU - Yin, Jun
ID - 483
IS - 3
JF - Advances in Theoretical and Mathematical Physics
SN - 10950761
TI - Universality for a class of random band matrices
VL - 21
ER -
TY - JOUR
AB - We consider the dynamics of a large quantum system of N identical bosons in 3D interacting via a two-body potential of the form N3β-1w(Nβ(x - y)). For fixed 0 = β < 1/3 and large N, we obtain a norm approximation to the many-body evolution in the Nparticle Hilbert space. The leading order behaviour of the dynamics is determined by Hartree theory while the second order is given by Bogoliubov theory.
AU - Nam, Phan
AU - Napiórkowski, Marcin M
ID - 484
IS - 3
JF - Advances in Theoretical and Mathematical Physics
SN - 10950761
TI - Bogoliubov correction to the mean-field dynamics of interacting bosons
VL - 21
ER -
TY - CONF
AB - We present results on nonlinear electro-optical conversion of microwave radiation into the optical telecommunication band with more than 0.1% photon number conversion efficiency with MHz bandwidth, in a crystalline whispering gallery mode resonator
AU - Rueda Sanchez, Alfredo R
AU - Sedlmeir, Florian
AU - Collodo, Michele
AU - Vogl, Ulrich
AU - Stiller, Birgit
AU - Schunk, Gerhard
AU - Strekalov, Dmitry
AU - Marquardt, Christoph
AU - Fink, Johannes M
AU - Painter, Oskar
AU - Leuchs, Gerd
AU - Schwefel, Harald
ID - 485
SN - 978-155752820-9
TI - Single sideband microwave to optical photon conversion-an-electro-optic-realization
VL - F54
ER -
TY - JOUR
AB - Color texture reproduction in 3D printing commonly ignores volumetric light transport (cross-talk) between surface points on a 3D print. Such light diffusion leads to significant blur of details and color bleeding, and is particularly severe for highly translucent resin-based print materials. Given their widely varying scattering properties, this cross-talk between surface points strongly depends on the internal structure of the volume surrounding each surface point. Existing scattering-aware methods use simplified models for light diffusion, and often accept the visual blur as an immutable property of the print medium. In contrast, our work counteracts heterogeneous scattering to obtain the impression of a crisp albedo texture on top of the 3D print, by optimizing for a fully volumetric material distribution that preserves the target appearance. Our method employs an efficient numerical optimizer on top of a general Monte-Carlo simulation of heterogeneous scattering, supported by a practical calibration procedure to obtain scattering parameters from a given set of printer materials. Despite the inherent translucency of the medium, we reproduce detailed surface textures on 3D prints. We evaluate our system using a commercial, five-tone 3D print process and compare against the printer’s native color texturing mode, demonstrating that our method preserves high-frequency features well without having to compromise on color gamut.
AU - Elek, Oskar
AU - Sumin, Denis
AU - Zhang, Ran
AU - Weyrich, Tim
AU - Myszkowski, Karol
AU - Bickel, Bernd
AU - Wilkie, Alexander
AU - Krivanek, Jaroslav
ID - 486
IS - 6
JF - ACM Transactions on Graphics
SN - 07300301
TI - Scattering-aware texture reproduction for 3D printing
VL - 36
ER -
TY - CONF
AB - In this paper we study network architecture for unlicensed cellular networking for outdoor coverage in TV white spaces. The main technology proposed for TV white spaces is 802.11af, a Wi-Fi variant adapted for TV frequencies. However, 802.11af is originally designed for improved indoor propagation. We show that long links, typical for outdoor use, exacerbate known Wi-Fi issues, such as hidden and exposed terminal, and significantly reduce its efficiency. Instead, we propose CellFi, an alternative architecture based on LTE. LTE is designed for long-range coverage and throughput efficiency, but it is also designed to operate in tightly controlled and centrally managed networks. CellFi overcomes these problems by designing an LTE-compatible spectrum database component, mandatory for TV white space networking, and introducing an interference management component for distributed coordination. CellFi interference management is compatible with existing LTE mechanisms, requires no explicit communication between base stations, and is more efficient than CSMA for long links. We evaluate our design through extensive real world evaluation on of-the-shelf LTE equipment and simulations. We show that, compared to 802.11af, it increases coverage by 40% and reduces median flow completion times by 2.3x.
AU - Baig, Ghufran
AU - Radunovic, Bozidar
AU - Alistarh, Dan-Adrian
AU - Balkwill, Matthew
AU - Karagiannis, Thomas
AU - Qiu, Lili
ID - 487
SN - 978-145035422-6
T2 - Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies
TI - Towards unlicensed cellular networks in TV white spaces
ER -
TY - JOUR
AB - The fixation probability is the probability that a new mutant introduced in a homogeneous population eventually takes over the entire population. The fixation probability is a fundamental quantity of natural selection, and known to depend on the population structure. Amplifiers of natural selection are population structures which increase the fixation probability of advantageous mutants, as compared to the baseline case of well-mixed populations. In this work we focus on symmetric population structures represented as undirected graphs. In the regime of undirected graphs, the strongest amplifier known has been the Star graph, and the existence of undirected graphs with stronger amplification properties has remained open for over a decade. In this work we present the Comet and Comet-swarm families of undirected graphs. We show that for a range of fitness values of the mutants, the Comet and Cometswarm graphs have fixation probability strictly larger than the fixation probability of the Star graph, for fixed population size and at the limit of large populations, respectively.
AU - Pavlogiannis, Andreas
AU - Tkadlec, Josef
AU - Chatterjee, Krishnendu
AU - Nowak, Martin
ID - 512
IS - 1
JF - Scientific Reports
SN - 20452322
TI - Amplification on undirected population structures: Comets beat stars
VL - 7
ER -
TY - JOUR
AB - We present an experimental setup that creates a shear flow with zero mean advection velocity achieved by counterbalancing the nonzero streamwise pressure gradient by moving boundaries, which generates plane Couette-Poiseuille flow. We obtain experimental results in the transitional regime for this flow. Using flow visualization, we characterize the subcritical transition to turbulence in Couette-Poiseuille flow and show the existence of turbulent spots generated by a permanent perturbation. Due to the zero mean advection velocity of the base profile, these turbulent structures are nearly stationary. We distinguish two regions of the turbulent spot: the active turbulent core, which is characterized by waviness of the streaks similar to traveling waves, and the surrounding region, which includes in addition the weak undisturbed streaks and oblique waves at the laminar-turbulent interface. We also study the dependence of the size of these two regions on Reynolds number. Finally, we show that the traveling waves move in the downstream (Poiseuille) direction.
AU - Klotz, Lukasz
AU - Lemoult, Grégoire M
AU - Frontczak, Idalia
AU - Tuckerman, Laurette
AU - Wesfreid, José
ID - 513
IS - 4
JF - Physical Review Fluids
TI - Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence
VL - 2
ER -
TY - JOUR
AB - Orientation in space is represented in specialized brain circuits. Persistent head direction signals are transmitted from anterior thalamus to the presubiculum, but the identity of the presubicular target neurons, their connectivity and function in local microcircuits are unknown. Here, we examine how thalamic afferents recruit presubicular principal neurons and Martinotti interneurons, and the ensuing synaptic interactions between these cells. Pyramidal neuron activation of Martinotti cells in superficial layers is strongly facilitating such that high-frequency head directional stimulation efficiently unmutes synaptic excitation. Martinotti-cell feedback plays a dual role: precisely timed spikes may not inhibit the firing of in-tune head direction cells, while exerting lateral inhibition. Autonomous attractor dynamics emerge from a modelled network implementing wiring motifs and timing sensitive synaptic interactions in the pyramidal - Martinotti-cell feedback loop. This inhibitory microcircuit is therefore tuned to refine and maintain head direction information in the presubiculum.
AU - Simonnet, Jean
AU - Nassar, Mérie
AU - Stella, Federico
AU - Cohen, Ivan
AU - Mathon, Bertrand
AU - Boccara, Charlotte
AU - Miles, Richard
AU - Fricker, Desdemona
ID - 514
JF - Nature Communications
SN - 20411723
TI - Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum
VL - 8
ER -
TY - JOUR
AB - The oxidative phosphorylation electron transport chain (OXPHOS-ETC) of the inner mitochondrial membrane is composed of five large protein complexes, named CI-CV. These complexes convert energy from the food we eat into ATP, a small molecule used to power a multitude of essential reactions throughout the cell. OXPHOS-ETC complexes are organized into supercomplexes (SCs) of defined stoichiometry: CI forms a supercomplex with CIII2 and CIV (SC I+III2+IV, known as the respirasome), as well as with CIII2 alone (SC I+III2). CIII2 forms a supercomplex with CIV (SC III2+IV) and CV forms dimers (CV2). Recent cryo-EM studies have revealed the structures of SC I+III2+IV and SC I+III2. Furthermore, recent work has shed light on the assembly and function of the SCs. Here we review and compare these recent studies and discuss how they have advanced our understanding of mitochondrial electron transport.
AU - Letts, James A
AU - Sazanov, Leonid A
ID - 515
IS - 10
JF - Nature Structural and Molecular Biology
SN - 15459993
TI - Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain
VL - 24
ER -
TY - JOUR
AB - Cyanobacteria are mostly engineered to be sustainable cell-factories by genetic manipulations alone. Here, by modulating the concentration of allosteric effectors, we focus on increasing product formation without further burdening the cells with increased expression of enzymes. Resorting to a novel 96-well microplate cultivation system for cyanobacteria, and using lactate-producing strains of Synechocystis PCC6803 expressing different l-lactate dehydrogenases (LDH), we titrated the effect of 2,5-anhydro-mannitol supplementation. The latter acts in cells as a nonmetabolizable analogue of fructose 1,6-bisphosphate, a known allosteric regulator of one of the tested LDHs. In this strain (SAA023), we achieved over 2-fold increase of lactate productivity. Furthermore, we observed that as carbon is increasingly deviated during growth toward product formation, there is an increased fixation rate in the population of spontaneous mutants harboring an impaired production pathway. This is a challenge in the development of green cell factories, which may be countered by the incorporation in biotechnological processes of strategies such as the one pioneered here.
AU - Du, Wei
AU - Angermayr, Andreas
AU - Jongbloets, Joeri
AU - Molenaar, Douwe
AU - Bachmann, Herwig
AU - Hellingwerf, Klaas
AU - Branco Dos Santos, Filipe
ID - 520
IS - 3
JF - ACS Synthetic Biology
SN - 21615063
TI - Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803
VL - 6
ER -
TY - JOUR
AB - Let X and Y be proper metric spaces. We show that a coarsely n-to-1 map f:X→Y induces an n-to-1 map of Higson coronas. This viewpoint turns out to be successful in showing that the classical dimension raising theorems hold in large scale; that is, if f:X→Y is a coarsely n-to-1 map between proper metric spaces X and Y then asdim(Y)≤asdim(X)+n−1. Furthermore we introduce coarsely open coarsely n-to-1 maps, which include the natural quotient maps via a finite group action, and prove that they preserve the asymptotic dimension.
AU - Austin, Kyle
AU - Virk, Ziga
ID - 521
JF - Topology and its Applications
SN - 01668641
TI - Higson compactification and dimension raising
VL - 215
ER -
TY - JOUR
AB - We investigate the complexity of finding an embedded non-orientable surface of Euler genus g in a triangulated 3-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance of embeddability of complexes into 3-manifolds. We prove that the problem is NP-hard, thus adding to the relatively few hardness results that are currently known in 3-manifold topology. In addition, we show that the problem lies in NP when the Euler genus g is odd, and we give an explicit algorithm in this case.
AU - Burton, Benjamin
AU - De Mesmay, Arnaud N
AU - Wagner, Uli
ID - 534
IS - 4
JF - Discrete & Computational Geometry
SN - 01795376
TI - Finding non-orientable surfaces in 3-Manifolds
VL - 58
ER -
TY - JOUR
AB - Optogenetik und Photopharmakologie ermöglichen präzise räumliche und zeitliche Kontrolle von Proteinwechselwirkung und -funktion in Zellen und Tieren. Optogenetische Methoden, die auf grünes Licht ansprechen und zum Trennen von Proteinkomplexen geeignet sind, sind nichtweitläufig verfügbar, würden jedoch mehrfarbige Experimente zur Beantwortung von biologischen Fragestellungen ermöglichen. Hier demonstrieren wir die Verwendung von Cobalamin(Vitamin B12)-bindenden Domänen von bakteriellen CarH-Transkriptionsfaktoren zur Grünlicht-induzierten Dissoziation von Rezeptoren. Fusioniert mit dem Fibroblasten-W achstumsfaktor-Rezeptor 1 führten diese im Dunkeln in kultivierten Zellen zu Signalaktivität durch Oligomerisierung, welche durch Beleuchten umgehend aufgehoben wurde. In Zebrafischembryonen, die einen derartigen Rezeptor exprimieren, ermöglichte grünes Licht die Kontrolle über abnormale Signalaktivität während der Embryonalentwicklung.
AU - Kainrath, Stephanie
AU - Stadler, Manuela
AU - Gschaider-Reichhart, Eva
AU - Distel, Martin
AU - Janovjak, Harald L
ID - 538
IS - 16
JF - Angewandte Chemie
TI - Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen
VL - 129
ER -
TY - JOUR
AB - RNA-dependent RNA polymerases (RdRps) play a key role in the life cycle of RNA viruses and impact their immunobiology. The arenavirus lymphocytic choriomeningitis virus (LCMV) strain Clone 13 provides a benchmark model for studying chronic infection. A major genetic determinant for its ability to persist maps to a single amino acid exchange in the viral L protein, which exhibits RdRp activity, yet its functional consequences remain elusive. To unravel the L protein interactions with the host proteome, we engineered infectious L protein-tagged LCMV virions by reverse genetics. A subsequent mass-spectrometric analysis of L protein pulldowns from infected human cells revealed a comprehensive network of interacting host proteins. The obtained LCMV L protein interactome was bioinformatically integrated with known host protein interactors of RdRps from other RNA viruses, emphasizing interconnected modules of human proteins. Functional characterization of selected interactors highlighted proviral (DDX3X) as well as antiviral (NKRF, TRIM21) host factors. To corroborate these findings, we infected Trim21-/-mice with LCMV and found impaired virus control in chronic infection. These results provide insights into the complex interactions of the arenavirus LCMV and other viral RdRps with the host proteome and contribute to a better molecular understanding of how chronic viruses interact with their host.
AU - Khamina, Kseniya
AU - Lercher, Alexander
AU - Caldera, Michael
AU - Schliehe, Christopher
AU - Vilagos, Bojan
AU - Sahin, Mehmet
AU - Kosack, Lindsay
AU - Bhattacharya, Anannya
AU - Májek, Peter
AU - Stukalov, Alexey
AU - Sacco, Roberto
AU - James, Leo
AU - Pinschewer, Daniel
AU - Bennett, Keiryn
AU - Menche, Jörg
AU - Bergthaler, Andreas
ID - 540
IS - 12
JF - PLoS Pathogens
SN - 15537366
TI - Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein
VL - 13
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 -
TY - CHAP
AB - Development of vascular tissue is a remarkable example of intercellular communication and coordinated development involving hormonal signaling and tissue polarity. Thus far, studies on vascular patterning and regeneration have been conducted mainly in trees—woody plants—with a well-developed layer of vascular cambium and secondary tissues. Trees are difficult to use as genetic models, i.e., due to long generation time, unstable environmental conditions, and lack of available mutants and transgenic lines. Therefore, the use of the main genetic model plant Arabidopsis thaliana (L.) Heynh., with a wealth of available marker and transgenic lines, provides a unique opportunity to address molecular mechanism of vascular tissue formation and regeneration. With specific treatments, the tiny weed Arabidopsis can serve as a model to understand the growth of mighty trees and interconnect a tree physiology with molecular genetics and cell biology of Arabidopsis.
AU - Mazur, Ewa
AU - Friml, Jirí
ED - Jurić, Snježana
ID - 545
T2 - Plant Engineering
TI - Vascular tissue development and regeneration in the model plant arabidopsis
ER -
TY - GEN
AB - In this report the implementation of the institutional data repository IST DataRep at IST Austria will be covered: Starting with the research phase when requirements for a repository were established, the procedure of choosing a repository-software and its customization based on the results of user-testings will be discussed. Followed by reflections on the marketing strategies in regard of impact, and at the end sharing some experiences of one year operating IST DataRep.
AU - Barbara Petritsch
ID - 5450
TI - Implementing the institutional data repository IST DataRep
ER -
TY - GEN
AB - A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The input is a graphwhere the edges are labeled with different types of opening and closing parentheses, and the reachabilityinformation is computed via paths whose parentheses are properly matched. We present new results for Dyckreachability problems with applications to alias analysis and data-dependence analysis. Our main contributions,that include improved upper bounds as well as lower bounds that establish optimality guarantees, are asfollows:First, we consider Dyck reachability on bidirected graphs, which is the standard way of performing field-sensitive points-to analysis. Given a bidirected graph withnnodes andmedges, we present: (i) an algorithmwith worst-case running timeO(m+n·α(n)), whereα(n)is the inverse Ackermann function, improving thepreviously knownO(n2)time bound; (ii) a matching lower bound that shows that our algorithm is optimalwrt to worst-case complexity; and (iii) an optimal average-case upper bound ofO(m)time, improving thepreviously knownO(m·logn)bound.Second, we consider the problem of context-sensitive data-dependence analysis, where the task is to obtainanalysis summaries of library code in the presence of callbacks. Our algorithm preprocesses libraries in almostlinear time, after which the contribution of the library in the complexity of the client analysis is only linear,and only wrt the number of call sites.Third, we prove that combinatorial algorithms for Dyck reachability on general graphs with truly sub-cubic bounds cannot be obtained without obtaining sub-cubic combinatorial algorithms for Boolean MatrixMultiplication, which is a long-standing open problem. Thus we establish that the existing combinatorialalgorithms for Dyck reachability are (conditionally) optimal for general graphs. We also show that the samehardness holds for graphs of constant treewidth.Finally, we provide a prototype implementation of our algorithms for both alias analysis and data-dependenceanalysis. Our experimental evaluation demonstrates that the new algorithms significantly outperform allexisting methods on the two problems, over real-world benchmarks.
AU - Chatterjee, Krishnendu
AU - Choudhary, Bhavya
AU - Pavlogiannis, Andreas
ID - 5455
SN - 2664-1690
TI - Optimal Dyck reachability for data-dependence and alias analysis
ER -
TY - GEN
AB - We present a new dynamic partial-order reduction method for stateless model checking of concurrent programs. A common approach for exploring program behaviors relies on enumerating the traces of the program, without storing the visited states (aka stateless exploration). As the number of distinct traces grows exponentially, dynamic partial-order reduction (DPOR) techniques have been successfully used to partition the space of traces into equivalence classes (Mazurkiewicz partitioning), with the goal of exploring only few representative traces from each class.
We introduce a new equivalence on traces under sequential consistency semantics, which we call the observation equivalence. Two traces are observationally equivalent if every read event observes the same write event in both traces. While the traditional Mazurkiewicz equivalence is control-centric, our new definition is data-centric. We show that our observation equivalence is coarser than the Mazurkiewicz equivalence, and in many cases even exponentially coarser. We devise a DPOR exploration of the trace space, called data-centric DPOR, based on the observation equivalence.
1. For acyclic architectures, our algorithm is guaranteed to explore exactly one representative trace from each observation class, while spending polynomial time per class. Hence, our algorithm is optimal wrt the observation equivalence, and in several cases explores exponentially fewer traces than any enumerative method based on the Mazurkiewicz equivalence.
2. For cyclic architectures, we consider an equivalence between traces which is finer than the observation equivalence; but coarser than the Mazurkiewicz equivalence, and in some cases is exponentially coarser. Our data-centric DPOR algorithm remains optimal under this trace equivalence.
Finally, we perform a basic experimental comparison between the existing Mazurkiewicz-based DPOR and our data-centric DPOR on a set of academic benchmarks. Our results show a significant reduction in both running time and the number of explored equivalence classes.
AU - Chalupa, Marek
AU - Chatterjee, Krishnendu
AU - Pavlogiannis, Andreas
AU - Sinha, Nishant
AU - Vaidya, Kapil
ID - 5456
SN - 2664-1690
TI - Data-centric dynamic partial order reduction
ER -
TY - JOUR
AB - In this work maximum entropy distributions in the space of steady states of metabolic networks are considered upon constraining the first and second moments of the growth rate. Coexistence of fast and slow phenotypes, with bimodal flux distributions, emerges upon considering control on the average growth (optimization) and its fluctuations (heterogeneity). This is applied to the carbon catabolic core of Escherichia coli where it quantifies the metabolic activity of slow growing phenotypes and it provides a quantitative map with metabolic fluxes, opening the possibility to detect coexistence from flux data. A preliminary analysis on data for E. coli cultures in standard conditions shows degeneracy for the inferred parameters that extend in the coexistence region.
AU - De Martino, Daniele
ID - 548
IS - 6
JF - Physical Review E
SN - 24700045
TI - Maximum entropy modeling of metabolic networks by constraining growth-rate moments predicts coexistence of phenotypes
VL - 96
ER -
TY - CONF
AB - Model checking is usually based on a comprehensive traversal of the state space. Causality-based model checking is a radically different approach that instead analyzes the cause-effect relationships in a program. We give an overview on a new class of model checking algorithms that capture the causal relationships in a special data structure called concurrent traces. Concurrent traces identify key events in an execution history and link them through their cause-effect relationships. The model checker builds a tableau of concurrent traces, where the case splits represent different causal explanations of a hypothetical error. Causality-based model checking has been implemented in the ARCTOR tool, and applied to previously intractable multi-threaded benchmarks.
AU - Finkbeiner, Bernd
AU - Kupriyanov, Andrey
ID - 549
SN - 20752180
T2 - Electronic Proceedings in Theoretical Computer Science
TI - Causality-based model checking
VL - 259
ER -
TY - JOUR
AB - For large random matrices X with independent, centered entries but not necessarily identical variances, the eigenvalue density of XX* is well-approximated by a deterministic measure on ℝ. We show that the density of this measure has only square and cubic-root singularities away from zero. We also extend the bulk local law in [5] to the vicinity of these singularities.
AU - Alt, Johannes
ID - 550
JF - Electronic Communications in Probability
SN - 1083589X
TI - Singularities of the density of states of random Gram matrices
VL - 22
ER -
TY - CONF
AB - Evolutionary graph theory studies the evolutionary dynamics in a population structure given as a connected graph. Each node of the graph represents an individual of the population, and edges determine how offspring are placed. We consider the classical birth-death Moran process where there are two types of individuals, namely, the residents with fitness 1 and mutants with fitness r. The fitness indicates the reproductive strength. The evolutionary dynamics happens as follows: in the initial step, in a population of all resident individuals a mutant is introduced, and then at each step, an individual is chosen proportional to the fitness of its type to reproduce, and the offspring replaces a neighbor uniformly at random. The process stops when all individuals are either residents or mutants. The probability that all individuals in the end are mutants is called the fixation probability, which is a key factor in the rate of evolution. We consider the problem of approximating the fixation probability. The class of algorithms that is extremely relevant for approximation of the fixation probabilities is the Monte-Carlo simulation of the process. Previous results present a polynomial-time Monte-Carlo algorithm for undirected graphs when r is given in unary. First, we present a simple modification: instead of simulating each step, we discard ineffective steps, where no node changes type (i.e., either residents replace residents, or mutants replace mutants). Using the above simple modification and our result that the number of effective steps is concentrated around the expected number of effective steps, we present faster polynomial-time Monte-Carlo algorithms for undirected graphs. Our algorithms are always at least a factor O(n2/ log n) faster as compared to the previous algorithms, where n is the number of nodes, and is polynomial even if r is given in binary. We also present lower bounds showing that the upper bound on the expected number of effective steps we present is asymptotically tight for undirected graphs.
AU - Chatterjee, Krishnendu
AU - Ibsen-Jensen, Rasmus
AU - Nowak, Martin
ID - 551
SN - 978-395977046-0
T2 - Leibniz International Proceedings in Informatics
TI - Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs
VL - 83
ER -
TY - CONF
AB - Graph games provide the foundation for modeling and synthesis of reactive processes. Such games are played over graphs where the vertices are controlled by two adversarial players. We consider graph games where the objective of the first player is the conjunction of a qualitative objective (specified as a parity condition) and a quantitative objective (specified as a meanpayoff condition). There are two variants of the problem, namely, the threshold problem where the quantitative goal is to ensure that the mean-payoff value is above a threshold, and the value problem where the quantitative goal is to ensure the optimal mean-payoff value; in both cases ensuring the qualitative parity objective. The previous best-known algorithms for game graphs with n vertices, m edges, parity objectives with d priorities, and maximal absolute reward value W for mean-payoff objectives, are as follows: O(nd+1 . m . w) for the threshold problem, and O(nd+2 · m · W) for the value problem. Our main contributions are faster algorithms, and the running times of our algorithms are as follows: O(nd-1 · m ·W) for the threshold problem, and O(nd · m · W · log(n · W)) for the value problem. For mean-payoff parity objectives with two priorities, our algorithms match the best-known bounds of the algorithms for mean-payoff games (without conjunction with parity objectives). Our results are relevant in synthesis of reactive systems with both functional requirement (given as a qualitative objective) and performance requirement (given as a quantitative objective).
AU - Chatterjee, Krishnendu
AU - Henzinger, Monika
AU - Svozil, Alexander
ID - 552
SN - 978-395977046-0
T2 - Leibniz International Proceedings in Informatics
TI - Faster algorithms for mean payoff parity games
VL - 83
ER -
TY - CONF
AB - We consider two player, zero-sum, finite-state concurrent reachability games, played for an infinite number of rounds, where in every round, each player simultaneously and independently of the other players chooses an action, whereafter the successor state is determined by a probability distribution given by the current state and the chosen actions. Player 1 wins iff a designated goal state is eventually visited. We are interested in the complexity of stationary strategies measured by their patience, which is defined as the inverse of the smallest non-zero probability employed. Our main results are as follows: We show that: (i) the optimal bound on the patience of optimal and -optimal strategies, for both players is doubly exponential; and (ii) even in games with a single non-absorbing state exponential (in the number of actions) patience is necessary.
AU - Chatterjee, Krishnendu
AU - Hansen, Kristofer
AU - Ibsen-Jensen, Rasmus
ID - 553
SN - 978-395977046-0
T2 - Leibniz International Proceedings in Informatics
TI - Strategy complexity of concurrent safety games
VL - 83
ER -
TY - DATA
AB - Strong amplifiers of natural selection
AU - Pavlogiannis, Andreas
AU - Tkadlec, Josef
AU - Chatterjee, Krishnendu
AU - Nowak , Martin
ID - 5559
KW - natural selection
TI - Strong amplifiers of natural selection
ER -
TY - DATA
AB - This repository contains the data collected for the manuscript "Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity".
The data is compressed into a single archive. Within the archive, different folders correspond to figures of the main text and the SI of the related publication.
Data is saved as plain text, with each folder containing a separate readme file describing the format. Typically, the data is from fluorescence microscopy measurements of single cells growing in a microfluidic "mother machine" device, and consists of relevant values (primarily arbitrary unit or normalized fluorescence measurements, and division times / growth rates) after raw microscopy images have been processed, segmented, and their features extracted, as described in the methods section of the related publication.
AU - Bergmiller, Tobias
AU - Andersson, Anna M
AU - Tomasek, Kathrin
AU - Balleza, Enrique
AU - Kiviet, Daniel
AU - Hauschild, Robert
AU - Tkacik, Gasper
AU - Guet, Calin C
ID - 5560
KW - single cell microscopy
KW - mother machine microfluidic device
KW - AcrAB-TolC pump
KW - multi-drug efflux
KW - Escherichia coli
TI - Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity
ER -
TY - DATA
AB - Graph matching problems as described in "Active Graph Matching for Automatic Joint Segmentation and Annotation of C. Elegans." by Kainmueller, Dagmar and Jug, Florian and Rother, Carsten and Myers, Gene, MICCAI 2014. Problems are in OpenGM2 hdf5 format (see http://hciweb2.iwr.uni-heidelberg.de/opengm/) and a custom text format used by the feature matching solver described in "Feature Correspondence via Graph Matching: Models and Global Optimization." by Lorenzo Torresani, Vladimir Kolmogorov and Carsten Rother, ECCV 2008, code at http://pub.ist.ac.at/~vnk/software/GraphMatching-v1.02.src.zip.
AU - Kainmueller, Dagmar
AU - Jug, Florian
AU - Rother, Carsten
AU - Meyers, Gene
ID - 5561
KW - graph matching
KW - feature matching
KW - QAP
KW - MAP-inference
TI - Graph matching problems for annotating C. Elegans
ER -
TY - DATA
AB - This data was collected as part of the study [1]. It consists of preprocessed multi-electrode array recording from 160 salamander retinal ganglion cells responding to 297 repeats of a 19 s natural movie. The data is available in two formats: (1) a .mat file containing an array with dimensions “number of repeats” x “number of neurons” x “time in a repeat”; (2) a zipped .txt file containing the same data represented as an array with dimensions “number of neurons” x “number of samples”, where the number of samples is equal to the product of the number of repeats and timebins within a repeat. The time dimension is divided into 20 ms time windows, and the array is binary indicating whether a given cell elicited at least one spike in a given time window during a particular repeat. See the reference below for details regarding collection and preprocessing:
[1] Tkačik G, Marre O, Amodei D, Schneidman E, Bialek W, Berry MJ II. Searching for Collective Behavior in a Large Network of Sensory Neurons. PLoS Comput Biol. 2014;10(1):e1003408.
AU - Marre, Olivier
AU - Tkacik, Gasper
AU - Amodei, Dario
AU - Schneidman, Elad
AU - Bialek, William
AU - Berry, Michael
ID - 5562
KW - multi-electrode recording
KW - retinal ganglion cells
TI - Multi-electrode array recording from salamander retinal ganglion cells
ER -
TY - DATA
AB - MATLAB code and processed datasets available for reproducing the results in:
Lukačišin, M.*, Landon, M.*, Jajoo, R*. (2016) Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.
*equal contributions
AU - Lukacisin, Martin
ID - 5563
TI - MATLAB analysis code for 'Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast'
ER -
TY - DATA
AB - Compressed Fastq files with whole-genome sequencing data of IS-wt strain D and clones from four evolved populations (A11, C08, C10, D08). Information on this data collection is available in the Methods Section of the primary publication.
AU - Steinrück, Magdalena
AU - Guet, Calin C
ID - 5564
TI - Fastq files for "Complex chromosomal neighborhood effects determine the adaptive potential of a gene under selection"
ER -
TY - DATA
AB - One of the key questions in understanding plant development is how single cells behave in a larger context of the tissue. Therefore, it requires the observation of the whole organ with a high spatial- as well as temporal resolution over prolonged periods of time, which may cause photo-toxic effects. This protocol shows a plant sample preparation method for light-sheet microscopy, which is characterized by mounting the plant vertically on the surface of a gel. The plant is mounted in such a way that the roots are submerged in a liquid medium while the leaves remain in the air. In order to ensure photosynthetic activity of the plant, a custom-made lighting system illuminates the leaves. To keep the roots in darkness the water surface is covered with sheets of black plastic foil. This method allows long-term imaging of plant organ development in standardized conditions.
The Video is licensed under a CC BY NC ND license.
AU - Von Wangenheim, Daniel
AU - Hauschild, Robert
AU - Friml, Jirí
ID - 5565
TI - Light Sheet Fluorescence microscopy of plant roots growing on the surface of a gel
ER -
TY - DATA
AB - Current minimal version of TipTracker
AU - Hauschild, Robert
ID - 5566
KW - tool
KW - tracking
KW - confocal microscopy
TI - Live tracking of moving samples in confocal microscopy for vertically grown roots
ER -