TY - CONF
AB - We consider two-player infinite games played on graphs. The games are concurrent, in that at each state the players choose their moves simultaneously and independently, and stochastic, in that the moves determine a probability distribution for the successor state. The value of a game is the maximal probability with which a player can guarantee the satisfaction of her objective. We show that the values of concurrent games with w-regular objectives expressed as parity conditions can be decided in NP boolean AND coNP. This result substantially improves the best known previous bound of 3EXPTIME. It also shows that the full class of concurrent parity games is no harder than the special case of turn-based stochastic reachability games, for which NP boolean AND coNP is the best known bound. While the previous, more restricted NP boolean AND coNP results for graph games relied on the existence of particularly simple (pure memoryless) optimal strategies, in concurrent games with parity objectives optimal strategies may not exist, and epsilon-optimal strategies (which achieve the value of the game within a parameter epsilon > 0) require in general both randomization and infinite memory. Hence our proof must rely on a more detailed analysis of strategies and, in addition to the main result, yields two results that are interesting on their own. First, we show that there exist epsilon-optimal strategies that in the limit coincide with memoryless strategies; this parallels the celebrated result of Mertens-Neyman for concurrent games with limit-average objectives. Second, we complete the characterization of the memory requirements for epsilon-optimal strategies for concurrent games with parity conditions, by showing that memoryless strategies suffice for epsilon-optimality for coBachi conditions.
AU - Krishnendu Chatterjee
AU - de Alfaro, Luca
AU - Thomas Henzinger
ID - 3890
TI - The complexity of quantitative concurrent parity games
ER -
TY - CONF
AB - We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about the history of a play, namely, on the past sequence of observations. Such games occur in the synthesis of a controller that does not see the private state of the plant. Our main results are twofold. First, we give a fixed-point algorithm for computing the set of states from which a player can win with a deterministic observation-based strategy for any omega-regular objective. The fixed point is computed in the lattice of antichains of state sets. This algorithm has the advantages of being directed by the objective and of avoiding an explicit subset construction on the game graph. Second, we give an algorithm for computing the set of states from which a player can win with probability 1 with a randomized observation-based strategy for a Buchi objective. This set is of interest because in the absence of perfect information, randomized strategies are more powerful than deterministic ones. We show that our algorithms are optimal by proving matching lower bounds.
AU - Krishnendu Chatterjee
AU - Doyen, Laurent
AU - Thomas Henzinger
AU - Raskin, Jean-François
ID - 3889
TI - Algorithms for omega-regular games with imperfect information
VL - 4207
ER -
TY - CONF
AB - We study infinite stochastic games played by two-players over a finite state space, with objectives specified by sets of infinite traces. The games are concurrent (players make moves simultaneously and independently), stochastic (the next state is determined by a probability distribution that depends on the current state and chosen moves of the players) and infinite (proceeds for infinite number of rounds). The analysis of concurrent stochastic games can be classified into: quantitative analysis, analyzing the optimum value of the game; and qualitative analysis, analyzing the set of states with optimum value 1. We consider concurrent games with tail objectives, i.e., objectives that are independent of the finite-prefix of traces, and show that the class of tail objectives are strictly richer than the omega-regular objectives. We develop new proof techniques to extend several properties of concurrent games with omega-regular objectives to concurrent games with tail objectives. We prove the positive limit-one property for tail objectives, that states for all concurrent games if the optimum value for a player is positive for a tail objective Phi at some state, then there is a state where the optimum value is 1 for Phi, for the player. We also show that the optimum values of zero-sum (strictly conflicting objectives) games with tail objectives can be related to equilibrium values of nonzero-sum (not strictly conflicting objectives) games with simpler reachability objectives. A consequence of our analysis presents a polynomial time reduction of the quantitative analysis of tail objectives to the qualitative analysis for the sub-class of one-player stochastic games (Markov decision processes).
AU - Krishnendu Chatterjee
ID - 3891
TI - Concurrent games with tail objectives
VL - 4207
ER -
TY - CONF
AB - A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with omega-regular winning conditions specified as Rabin or Streett objectives. These games are NP-complete and coNP-complete, respectively. The value of the game for a player at a state s given an objective Phi is the maximal probability with which the player can guarantee the satisfaction of Phi from s. We present a strategy-improvement algorithm to compute values in stochastic Rabin games, where an improvement step involves solving Markov decision processes (MDPs) and nonstochastic Rabin games. The algorithm also computes values for stochastic Streett games but does not directly yield an optimal strategy for Streett objectives. We then show how to obtain an optimal strategy for Streett objectives by solving certain nonstochastic Streett games.
AU - Krishnendu Chatterjee
AU - Thomas Henzinger
ID - 3888
TI - Strategy improvement for stochastic Rabin and Streett games
VL - 4137
ER -
TY - JOUR
AB - It is commonly believed that both the average length and the frequency of microsatellites correlate with genome size. We have estimated the frequency and the average length for 69 perfect dinucleotide microsatellites in an insect with an exceptionally large genome: Chorthippus biguttulus (Orthoptera, Acrididae). Dinucleotide microsatellites are not more frequent in C. biguttulus, but repeat arrays are 1.4 to 2 times longer than in other insect species. The average repeat number in C. biguttulus lies in the range of higher vertebrates. Natural populations are highly variable. At least 30 alleles per locus were found and the expected heterozygosity is above 0.95 at all three loci studied. In contrast, the observed heterozygosity is much lower (≤0.51), which could be caused by long null alleles.
AU - Ustinova, Jana
AU - Achmann, Roland
AU - Cremer, Sylvia
AU - Mayer, Frieder
ID - 3908
IS - 2
JF - Journal of Molecular Evolution
TI - Long repeats in a huge gemome: microsatellite loci in the grasshopper Chorthippus biguttulus
VL - 62
ER -
TY - JOUR
AB - T cells develop in the thymus in a highly specialized cellular and extracellular microenvironment. The basement membrane molecule, laminin-5 (LN-5), is predominantly found in the medulla of the human thymic lobules. Using high-resolution light microscopy, we show here that LN-5 is localized in a bi-membranous conduit-like structure, together with other typical basement membrane components including collagen type IV, nidogen and perlecan. Other interstitial matrix components, such as fibrillin-1 or -2, tenascin-C or fibrillar collagen types, were also associated with these structures. Three-dimensional (3D) confocal microscopy suggested a tubular structure, whereas immunoelectron and transmission electron microscopy showed that the core of these tubes contained fibrillar collagens enwrapped by the LN-5-containing membrane. These medullary conduits are surrounded by thymic epithelial cells, which in vitro were found to bind LN-5, but also fibrillin and tenascin-C. Dendritic cells were also detected in close vicinity to the conduits. Both of these stromal cell types express major histocompatibility complex (MHC) class II molecules capable of antigen presentation. The conduits are connected to blood vessels but, with an average diameter of 2 mum, they are too small to transport cells. However, evidence is provided that smaller molecules such as a 10 kDa dextran, but not large molecules (>500 kDa), can be transported in the conduits. These results clearly demonstrate that a conduit system, which is also known from secondary lymphatic organs such as lymph nodes and spleen, is present in the medulla of the human thymus, and that it might serve to transport small blood-borne molecules or chemokines to defined locations within the medulla.
AU - Drumea-Mirancea, Mihaela
AU - Wessels, Johannes T
AU - Müller, Claudia A
AU - Essl, Mike
AU - Eble, Johannes A
AU - Tolosa, Eva
AU - Koch, Manuel
AU - Reinhardt, Dieter P
AU - Michael Sixt
AU - Sorokin, Lydia
AU - Stierhof, York-Dieter
AU - Schwarz, Heinz
AU - Klein, Gerd
ID - 3934
IS - Pt 7
JF - Journal of Cell Science
TI - Characterization of a conduit system containing laminin-5 in the human thymus: a potential transport system for small molecules
VL - 119
ER -
TY - JOUR
AB - Integrins regulate cell behavior through the assembly of multiprotein complexes at the site of cell adhesion. Parvins are components of such a multiprotein complex. They consist of three members (alpha-, beta-, and gamma-parvin), form a functional complex with integrin-linked kinase (ILK) and PINCH, and link integrins to the actin cytoskeleton. Whereas alpha- and beta-parvins are widely expressed, gamma-parvin has been reported to be expressed in hematopoietic organs. In the present study, we report the expression pattern of the parvins in hematopoietic cells and the phenotypic analysis of gamma-parvin-deficient mice. Whereas alpha-parvin is not expressed in hematopoietic cells, beta-parvin is only found in myeloid cells and gamma-parvin is present in both cells of the myeloid and lymphoid lineages, where it binds ILK. Surprisingly, loss of gamma-parvin expression had no effect on blood cell differentiation, proliferation, and survival and no consequence for the T-cell-dependent antibody response and lymphocyte and dendritic cell migration. These data indicate that despite the high expression of gamma-parvin in hematopoietic cells it must play a more subtle role for blood cell homeostasis.
AU - Chu, Haiyan
AU - Thievessen, Ingo
AU - Michael Sixt
AU - Lämmermann, Tim
AU - Waisman, Ari
AU - Braun, Attila
AU - Noegel, Angelika A
AU - Fässler, Reinhard
ID - 3935
IS - 5
JF - Molecular and Cellular Biology
TI - γ-Parvin is dispensable for hematopoiesis, leukocyte trafficking, and T-cell-dependent antibody response
VL - 26
ER -
TY - JOUR
AB - At least eight of the twelve known members of the beta1 integrin family are expressed on hematopoietic cells. Among these, the VCAM-1 receptor alpha4beta1 has received most attention as a main factor mediating firm adhesion to the endothelium during blood cell extravasation. Therapeutic trials are ongoing into the use of antibodies and small molecule inhibitors to target this interaction and hence obtain anti-inflammatory effects. However, extravasation is only one possible process that is mediated by beta1 integrins and there is evidence that they also mediate leukocyte retention and positioning in the tissue, lymphocyte activation and possibly migration within the interstitium. Genetic mouse models where integrins are selectively deleted on blood cells have been used to investigate these functions and further studies will be invaluable to critically evaluate therapeutic trials.
AU - Michael Sixt
AU - Bauer, Martina
AU - Lämmermann, Tim
AU - Fässler, Reinhard
ID - 3936
IS - 5
JF - Current Opinion in Cell Biology
TI - β1 integrins: zip codes and signaling relay for blood cells
VL - 18
ER -
TY - JOUR
AB - Wnt11 is a key signal, determining cell polarization and migration during vertebrate gastrulation. It is known that Wnt11 functionally interacts with several signaling components, the homologues of which control planar cell polarity in Drosophila melanogaster. Although in D. melanogaster these components are thought to polarize cells by asymmetrically localizing at the plasma membrane, it is not yet clear whether their subcellular localization plays a similarly important role in vertebrates. We show that in zebrafish embryonic cells, Wnt11 locally functions at the plasma membrane by accumulating its receptor, Frizzled 7, on adjacent sites of cell contacts. Wnt11-induced Frizzled 7 accumulations recruit the intracellular Wnt signaling mediator Dishevelled, as well as Wnt11 itself, and locally increase cell contact persistence. This increase in cell contact persistence is mediated by the local interaction of Wnt11, Frizzled 7, and the atypical cadherin Flamingo at the plasma membrane, and it does not require the activity of further downstream effectors of Wnt11 signaling, such as RhoA and Rok2. We propose that Wnt11, by interacting with Frizzled 7 and Flamingo, modulates local cell contact persistence to coordinate cell movements during gastrulation.
AU - Witzel, Sabine
AU - Zimyanin, Vitaly
AU - Carreira Barbosa, Filipa
AU - Tada, Masazumi
AU - Heisenberg, Carl-Philipp J
ID - 4140
IS - 5
JF - Journal of Cell Biology
TI - Wnt11 controls cell contact persistence by local accumulation of Frizzled 7 at the plasma membrane
VL - 175
ER -
TY - JOUR
AB - The detection of microRNAs (miRNAs) at single-cell resolution is important for studying the role of these posttranscriptional regulators. Here, we use a dual-fluorescent green fluorescent protein (GFP)-reporter/monomeric red fluorescent protein (mRFP)-sensor (DFRS) plasmid, injected into zebrafish blastomeres or electroporated into defined tissues of mouse embryos in utero or ex utero, to monitor the dynamics of specific miRNAs in individual live cells. This approach reveals, for example, that in the developing mouse central nervous system,, miR-124a is expressed not only in postmitotic neurons but also in neuronal progenitor cells. Collectively, our results demonstrate that acute administration of DFRS plasmids.offers an alternative to previous in situ hybridization and transgenic approaches and allows the monitoring of miRNA appearance and disappearance in defined cell lineages during vertebrate development.
AU - Tonelli, Davide
AU - Calegari, Frederico
AU - Fei, Ji
AU - Nomura, Tadashi
AU - Osumi, Noriko
AU - Heisenberg, Carl-Philipp J
AU - Huttner, Wieland
ID - 4145
IS - 6
JF - Biotechniques
TI - Single-cell detection of microRNAs in developing vertebrate embryos after acute administration of a dual-fluorescence reporter/sensor plasmid
VL - 41
ER -
TY - JOUR
AB - During vertebrate gastrulation, a well-orchestrated series of morphogenetic changes leads to the formation of the three germ layers: the ectoderm, mesoderm and endoderm. The analysis of gene expression patterns during gastrulation has been central to the identification of genes involved in germ layer formation. However, many proteins are regulated on a translational or post-translational level and are thus undetectable by gene expression analysis. Therefore, we developed a 2D-gel-based comparative proteomic approach to target proteins involved in germ layer morphogenesis during zebrafish gastrulation. Proteomes of ectodermal and mesendodermal progenitor cells were compared and 35 significantly regulated proteins were identified by mass spectrometry, including several proteins with predicted functions in cytoskeletal organization. A comparison of our proteomic results with data obtained in an accompanying microarray-based gene expression analysis revealed no significant overlap, confirming the complementary nature of proteomics and transcriptomics. The regulation of ezrin2, which was identified based on a reduction in spot intensity in mesendodermal cells, was independently validated. Furthermore, we show that ezrin2 is activated by phosphorylation in mesendodermal cells and is required for proper germ layer morphogenesis. We demonstrate the feasibility of proteomics in zebrafish, concluding that proteomics is a valuable tool for analysis of early development.
AU - Link, Vinzenz
AU - Carvalho, Lara
AU - Castanon, Irinka
AU - Stockinger, Petra
AU - Shevchenko, Andrej
AU - Heisenberg, Carl-Philipp J
ID - 4176
IS - 10
JF - Journal of Cell Science
TI - Identification of regulators of germ layer morphogenesis using proteomics in zebrafish
VL - 119
ER -
TY - JOUR
AB - Background: Zebrafish (D. rerio) has become a powerful and widely used model system for the analysis of vertebrate embryogenesis and organ development. While genetic methods are readily available in zebrafish, protocols for two dimensional (2D) gel electrophoresis and proteomics have yet to be developed. Results: As a prerequisite to carry out proteomic experiments with early zebrafish embryos, we developed a method to efficiently remove the yolk from large batches of embryos. This method enabled high resolution 2D gel electrophoresis and improved Western blotting considerably. Here, we provide detailed protocols for proteomics in zebrafish from sample preparation to mass spectrometry (MS), including a comparison of databases for MS identification of zebrafish proteins. Conclusion: The provided protocols for proteomic analysis of early embryos enable research to be taken in novel directions in embryogenesis.
AU - Link, Vinzenz
AU - Shevchenko, Andrej
AU - Heisenberg, Carl-Philipp J
ID - 4173
JF - BMC Developmental Biology
TI - Proteomics of early zebrafish embryos
VL - 6
ER -
TY - JOUR
AB - Detailed reconstruction of the spatiotemporal history of embryonic cells is key to understanding tissue formation processes but is often complicated by the large number of cells involved, particularly so in vertebrates. Through a combination of high-resolution time-lapse lineage tracing and antibody staining, we have analyzed the movement of mesencephalic and metencephalic cell populations in the early zebrafish embryo. To facilitate the analysis of our cell tracking data, we have created TracePilot, a software tool that allows interactive manipulation and visualization of tracking data. We demonstrate its utility by showing novel visualizations of cell movement in the developing zebrafish brain. TracePilot (http://www.mpi-cbg.de/tracepilot) is Java-based, available free of charge, and has a program structure that allows the incorporation of additional analysis tools.
AU - Langenberg, Tobias
AU - Dracz, Tadeusz
AU - Oates, Andrew
AU - Heisenberg, Carl-Philipp J
AU - Brand, Michael
ID - 4178
IS - 4
JF - Developmental Dynamics
TI - Analysis and visualization of cell movement in the developing zebrafish brain
VL - 235
ER -
TY - JOUR
AB - Epithelial morphogenesis depends on coordinated changes in cell shape, a process that is still poorly understood. During zebrafish epiboly and Drosophila dorsal closure, cell-shape changes at the epithelial margin are of critical importance. Here evidence is provided for a conserved mechanism of local actin and myosin 2 recruitment during theses events. It was found that during epiboly of the zebrafish embryo, the movement of the outer epithelium (enveloping layer) over the yolk cell surface involves the constriction of marginal cells. This process depends on the recruitment of actin and myosin 2 within the yolk cytoplasm along the margin of the enveloping layer. Actin and myosin 2 recruitment within the yolk cytoplasm requires the Ste20-like kinase Msn1, an orthologue of Drosophila Misshapen. Similarly, in Drosophila, actin and myosin 2 localization and cell constriction at the margin of the epidermis mediate dorsal closure and are controlled by Misshapen. Thus, this study has characterized a conserved mechanism underlying coordinated cell-shape changes during epithelial morphogenesis.
AU - Köppen, Mathias
AU - Fernández, Beatriz
AU - Carvalho, Lara
AU - Jacinto, António
AU - Heisenberg, Carl-Philipp J
ID - 4184
IS - 14
JF - Development
TI - Coordinated cell-shape changes control epithelial movement in zebrafish and Drosophila
VL - 133
ER -
TY - JOUR
AB - The molecular and cellular mechanisms governing cell motility and directed migration in response to the chemokine SDF-1 are largely unknown. Here, we demonstrate that zebrafish primordial germ cells whose migration is guided by SDF-1 generate bleb-like protrusions that are powered by cytoplasmic flow. Protrusions are formed at sites of higher levels of free calcium where activation of myosin contraction occurs. Separation of the acto-myosin cortex from the plasma membrane at these sites is followed by a flow of cytoplasm into the forming bleb. We propose that polarized activation of the receptor CXCR4 leads to a rise in free calcium that in turn activates myosin contraction in the part of the cell responding to higher levels of the ligand SDF-1. The biased formation of new protrusions in a particular region of the cell in response to SDF-1 defines the leading edge and the direction of cell migration.
AU - Blaser, Heiko
AU - Reichman Fried, Michal
AU - Castanon, Irinka
AU - Dumstrei, Karin
AU - Marlow, Florence
AU - Kawakami, Koichi
AU - Solnica Krezel, Lilianna
AU - Heisenberg, Carl-Philipp J
AU - Raz, Erez
ID - 4218
IS - 5
JF - Developmental Cell
TI - Migration of zebrafish primordial germ cells: A role for myosin contraction and cytoplasmic flow
VL - 11
ER -
TY - JOUR
AB - The growth function of populations is central in biomathematics. The main dogma is the existence of density-dependence mechanisms, which can be modelled with distinct functional forms that depend on the size of the Population. One important class of regulatory functions is the theta-logistic, which generalizes the logistic equation. Using this model as a motivation, this paper introduces a simple dynamical reformulation that generalizes many growth functions. The reformulation consists of two equations, one for population size, and one for the growth rate. Furthermore, the model shows that although population is density-dependent, the dynamics of the growth rate does not depend either on population size, nor on the carrying capacity. Actually, the growth equation is uncoupled from the population size equation, and the model has only two parameters, a Malthusian parameter rho and a competition coefficient theta. Distinct sign combinations of these parameters reproduce not only the family of theta-logistics, but also the van Bertalanffy, Gompertz and Potential Growth equations, among other possibilities. It is also shown that, except for two critical points, there is a general size-scaling relation that includes those appearing in the most important allometric theories, including the recently proposed Metabolic Theory of Ecology. With this model, several issues of general interest are discussed such as the growth of animal population, extinctions, cell growth and allometry, and the effect of environment over a population. (c) 2005 Elsevier Ltd. All rights reserved.
AU - de Vladar, Harold
ID - 4237
IS - 2
JF - Journal of Theoretical Biology
TI - Density-dependence as a size-independent regulatory mechanism
VL - 238
ER -
TY - JOUR
AU - Harold Vladar
AU - González,J. A
ID - 4235
JF - Journal of Theoretical Biology
TI - Dynamic response of cancer under the influence of immunological activity and therapy
ER -
TY - JOUR
AB - In finite populations, genetic drift generates interference between selected loci, causing advantageous alleles to be found more often on different chromosomes than on the same chromosome, which reduces the rate of adaptation. This “Hill–Robertson effect” generates indirect selection to increase recombination rates. We present a new method to quantify the strength of this selection. Our model represents a new beneficial allele (A) entering a population as a single copy, while another beneficial allele (B) is sweeping at another locus. A third locus affects the recombination rate between selected loci. Using a branching process model, we calculate the probability distribution of the number of copies of A on the different genetic backgrounds, after it is established but while it is still rare. Then, we use a deterministic model to express the change in frequency of the recombination modifier, due to hitchhiking, as A goes to fixation. We show that this method can give good estimates of selection for recombination. Moreover, it shows that recombination is selected through two different effects: it increases the fixation probability of new alleles, and it accelerates selective sweeps. The relative importance of these two effects depends on the relative times of occurrence of the beneficial alleles.
AU - Roze, Denis
AU - Nicholas Barton
ID - 4248
IS - 3
JF - Genetics
TI - The Hill-Robertson effect and the evolution of recombination
VL - 173
ER -
TY - GEN
AB - A recent analysis has shown that divergence between human and chimpanzee varies greatly across the genome. Although this is consistent with ‘hybridisation’ between the diverging human and chimp lineages, such observations can be explained more simply by the null model of allopatric speciation.
AU - Nicholas Barton
ID - 4250
IS - 16
T2 - Current Biology
TI - Evolutionary Biology: How did the human species form?
VL - 16
ER -
TY - CONF
AU - Thomas Wies
AU - Kuncak, Viktor
AU - Lam,Patrick
AU - Podelski,Andreas
AU - Rinard,Martin
ID - 4359
TI - Field Constraint Analysis
ER -
TY - CONF
AU - Maler, Oded
AU - Dejan Nickovic
AU - Pnueli,Amir
ID - 4373
TI - Real Time Temporal Logic: Past, Present, Future
ER -
TY - CONF
AU - Maler, Oded
AU - Dejan Nickovic
AU - Pnueli,Amir
ID - 4374
TI - From MITL to Timed Automata
ER -
TY - CONF
AB - We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction to explicitly determinize the automaton, we keep the determinization step implicit. Our algorithm computes the least fixed point of a monotone function on the lattice of antichains of state sets. We evaluate the performance of our algorithm experimentally using the random automaton model recently proposed by Tabakov and Vardi. We show that on the difficult instances of this probabilistic model, the antichain algorithm outperforms the standard one by several orders of magnitude. We also show how variations of the antichain method can be used for solving the language-inclusion problem for nondeterministic finite automata, and the emptiness problem for alternating finite automata.
AU - De Wulf, Martin
AU - Doyen, Laurent
AU - Thomas Henzinger
AU - Raskin, Jean-François
ID - 4406
TI - Antichains: A new algorithm for checking universality of finite automata
VL - 4144
ER -
TY - CONF
AU - Alur, Rajeev
AU - Pavol Cerny
AU - Zdancewic,Steve
ID - 4401
TI - Preserving Secrecy Under Refinement
ER -
TY - CONF
AB - The synthesis of reactive systems requires the solution of two-player games on graphs with ω-regular objectives. When the objective is specified by a linear temporal logic formula or nondeterministic Büchi automaton, then previous algorithms for solving the game require the construction of an equivalent deterministic automaton. However, determinization for automata on infinite words is extremely complicated, and current implementations fail to produce deterministic automata even for relatively small inputs. We show how to construct, from a given nondeterministic Büchi automaton, an equivalent nondeterministic parity automaton that is good for solving games with objective . The main insight is that a nondeterministic automaton is good for solving games if it fairly simulates the equivalent deterministic automaton. In this way, we omit the determinization step in game solving and reactive synthesis. The fact that our automata are nondeterministic makes them surprisingly simple, amenable to symbolic implementation, and allows an incremental search for winning strategies.
AU - Thomas Henzinger
AU - Piterman, Nir
ID - 4437
TI - Solving games without determinization
VL - 4207
ER -
TY - CONF
AB - We present an assume-guarantee interface algebra for real-time components. In our formalism a component implements a set of task sequences that share a resource. A component interface consists of an arrival rate function and a latency for each task sequence, and a capacity function for the shared resource. The interface specifies that the component guarantees certain task latencies depending on assumptions about task arrival rates and allocated resource capacities. Our algebra defines compatibility and refinement relations on interfaces. Interface compatibility can be checked on partial designs, even when some component interfaces are yet unknown. In this case interface composition computes as new assumptions the weakest constraints on the unknown components that are necessary to satisfy the specified guarantees. Interface refinement is defined in a way that ensures that compatible interfaces can be refined and implemented independently. Our algebra thus formalizes an interface-based design methodology that supports both the incremental addition of new components and the independent stepwise refinement of existing components. We demonstrate the flexibility and efficiency of the framework through simulation experiments.
AU - Thomas Henzinger
AU - Matic, Slobodan
ID - 4436
TI - An interface algebra for real-time components
ER -
TY - CONF
AB - We add freeze quantifiers to the game logic ATL in order to specify real-time objectives for games played on timed structures. We define the semantics of the resulting logic TATL by restricting the players to physically meaningful strategies, which do not prevent time from diverging. We show that TATL can be model checked over timed automaton games. We also specify timed optimization problems for physically meaningful strategies, and we show that for timed automaton games, the optimal answers can be approximated to within any degree of precision.
AU - Thomas Henzinger
AU - Prabhu, Vinayak S
ID - 4432
TI - Timed alternating-time temporal logic
VL - 4202
ER -
TY - CONF
AB - We summarize some current trends in embedded systems design and point out some of their characteristics, such as the chasm between analytical and computational models, and the gap between safety-critical and best-effort engineering practices. We call for a coherent scientific foundation for embedded systems design, and we discuss a few key demands on such a foundation: the need for encompassing several manifestations of heterogeneity, and the need for constructivity in design. We believe that the development of a satisfactory Embedded Systems Design Science provides a timely challenge and opportunity for reinvigorating computer science.
AU - Thomas Henzinger
AU - Sifakis, Joseph
ID - 4431
TI - The embedded systems design challenge
VL - 4085
ER -
TY - JOUR
AB - One source of complexity in the μ-calculus is its ability to specify an unbounded number of switches between universal (AX) and existential (EX) branching modes. We therefore study the problems of satisfiability, validity, model checking, and implication for the universal and existential fragments of the μ-calculus, in which only one branching mode is allowed. The universal fragment is rich enough to express most specifications of interest, and therefore improved algorithms are of practical importance. We show that while the satisfiability and validity problems become indeed simpler for the existential and universal fragments, this is, unfortunately, not the case for model checking and implication. We also show the corresponding results for the alternation-free fragment of the μ-calculus, where no alternations between least and greatest fixed points are allowed. Our results imply that efforts to find a polynomial-time model-checking algorithm for the μ-calculus can be replaced by efforts to find such an algorithm for the universal or existential fragment.
AU - Thomas Henzinger
AU - Kupferman, Orna
AU - Majumdar, Ritankar S
ID - 4451
IS - 2
JF - Theoretical Computer Science
TI - On the universal and existential fragments of the mu-calculus
VL - 354
ER -
TY - CONF
AB - We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and for these programs the property checking problem is undecidable. Two broad approaches to property checking are testing and verification. Testing tries to find inputs and executions which demonstrate violations of the property. Verification tries to construct a formal proof which shows that all executions of the program satisfy the property. Testing works best when errors are easy to find, but it is often difficult to achieve sufficient coverage for correct programs. On the other hand, verification methods are most successful when proofs are easy to find, but they are often inefficient at discovering errors. We propose a new algorithm, Synergy, which combines testing and verification. Synergy unifies several ideas from the literature, including counterexample-guided model checking, directed testing, and partition refinement.This paper presents a description of the Synergy algorithm, its theoretical properties, a comparison with related algorithms, and a prototype implementation called Yogi.
AU - Gulavani, Bhargav S
AU - Thomas Henzinger
AU - Kannan, Yamini
AU - Nori, Aditya V
AU - Rajamani, Sriram K
ID - 4523
TI - Synergy: A new algorithm for property checking
ER -
TY - CONF
AB - We designed and implemented a new programming language called Hierarchical Timing Language (HTL) for hard realtime systems. Critical timing constraints are specified within the language,and ensured by the compiler. Programs in HTL are extensible in two dimensions without changing their timing behavior: new program modules can be added, and individual program tasks can be refined. The mechanism supporting time invariance under parallel composition is that different program modules communicate at specified instances of time. Time invariance under refinement is achieved by conservative scheduling of the top level. HTL is a coordination language, in that individual tasks can be implemented in "foreign" languages. As a case study, we present a distributed HTL implementation of an automotive steer-by-wire controller.
AU - Ghosal, Arkadeb
AU - Thomas Henzinger
AU - Iercan, Daniel
AU - Kirsch, Christoph M
AU - Sangiovanni-Vincentelli, Alberto
ID - 4526
TI - A hierarchical coordination language for interacting real-time tasks
ER -
TY - CONF
AB - Computational modeling of biological systems is becoming increasingly common as scientists attempt to understand biological phenomena in their full complexity. Here we distinguish between two types of biological models mathematical and computational - according to their different representations of biological phenomena and their diverse potential. We call the approach of constructing computational models of biological systems executable biology, as it focuses on the design of executable computer algorithms that mimic biological phenomena. We give an overview of the main modeling efforts in this direction, and discuss some of the new challenges that executable biology poses for computer science and biology. We argue that for executable biology to reach its full potential as a mainstream biological technique, formal and algorithmic approaches must be integrated into biological research, driving biology towards a more precise engineering discipline.
AU - Fisher, Jasmin
AU - Thomas Henzinger
ID - 4528
TI - Executable biology
ER -
TY - CONF
AB - Games on graphs with ω-regular objectives provide a model for the control and synthesis of reactive systems. Every ω-regular objective can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens “eventually.” Two main strengths of the classical, infinite-limit formulation of liveness are robustness (independence from the granularity of transitions) and simplicity (abstraction of complicated time bounds). However, the classical liveness formulation suffers from the drawback that the time until something good happens may be unbounded. A stronger formulation of liveness, so-called finitary liveness, overcomes this drawback, while still retaining robustness and simplicity. Finitary liveness requires that there exists an unknown, fixed bound b such that something good happens within b transitions. While for one-shot liveness (reachability) objectives, classical and finitary liveness coincide, for repeated liveness (Büchi) objectives, the finitary formulation is strictly stronger. In this work we study games with finitary parity and Streett (fairness) objectives. We prove the determinacy of these games, present algorithms for solving these games, and characterize the memory requirements of winning strategies. Our algorithms can be used, for example, for synthesizing controllers that do not let the response time of a system increase without bound.
AU - Krishnendu Chatterjee
AU - Thomas Henzinger
ID - 4539
TI - Finitary winning in omega-regular games
VL - 3920
ER -
TY - CONF
AB - A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with ω-regular winning conditions specified as parity objectives. These games lie in NP ∩ coNP. We present a strategy improvement algorithm for stochastic parity games; this is the first non-brute-force algorithm for solving these games. From the strategy improvement algorithm we obtain a randomized subexponential-time algorithm to solve such games.
AU - Krishnendu Chatterjee
AU - Thomas Henzinger
ID - 4538
TI - Strategy improvement and randomized subexponential algorithms for stochastic parity games
VL - 3884
ER -
TY - CONF
AB - We consider Markov decision processes (MDPs) with multiple discounted reward objectives. Such MDPs occur in design problems where one wishes to simultaneously optimize several criteria, for example, latency and power. The possible trade-offs between the different objectives are characterized by the Pareto curve. We show that every Pareto-optimal point can be achieved by a memoryless strategy; however, unlike in the single-objective case, the memoryless strategy may require randomization. Moreover, we show that the Pareto curve can be approximated in polynomial time in the size of the MDP. Additionally, we study the problem if a given value vector is realizable by any strategy, and show that it can be decided in polynomial time; but the question whether it is realizable by a deterministic memoryless strategy is NP-complete. These results provide efficient algorithms for design exploration in MDP models with multiple objectives.
This research was supported in part by the AFOSR MURI grant F49620-00-1-0327, and the NSF grants CCR-0225610, CCR-0234690, and CCR-0427202.
AU - Krishnendu Chatterjee
AU - Majumdar, Ritankar S
AU - Thomas Henzinger
ID - 4551
TI - Markov decision processes with multiple objectives
VL - 3884
ER -
TY - JOUR
AB - In 2-player non-zero-sum games, Nash equilibria capture the options for rational behavior if each player attempts to maximize her payoff. In contrast to classical game theory, we consider lexicographic objectives: first, each player tries to maximize her own payoff, and then, the player tries to minimize the opponent's payoff. Such objectives arise naturally in the verification of systems with multiple components. There, instead of proving that each component satisfies its specification no matter how the other components behave, it sometimes suffices to prove that each component satisfies its specification provided that the other components satisfy their specifications. We say that a Nash equilibrium is secure if it is an equilibrium with respect to the lexicographic objectives of both players. We prove that in graph games with Borel winning conditions, which include the games that arise in verification, there may be several Nash equilibria, but there is always a unique maximal payoff profile of a secure equilibrium. We show how this equilibrium can be computed in the case of ω-regular winning conditions, and we characterize the memory requirements of strategies that achieve the equilibrium.
AU - Krishnendu Chatterjee
AU - Thomas Henzinger
AU - Jurdziński, Marcin
ID - 4550
IS - 1-2
JF - Theoretical Computer Science
TI - Games with secure equilibria
VL - 365
ER -
TY - CONF
AB - We present a compositional theory of system verification, where specifications assign real-numbered costs to systems. These costs can express a wide variety of quantitative system properties, such as resource consumption, price, or a measure of how well a system satisfies its specification. The theory supports the composition of systems and specifications, and the hiding of variables. Boolean refinement relations are replaced by real-numbered distances between descriptions of a system at different levels of detail. We show that the classical Boolean rules for compositional reasoning have quantitative counterparts in our setting. While our general theory allows costs to be specified by arbitrary cost functions, we also consider a class of linear cost functions, which give rise to an instance of our framework where all operations are computable in polynomial time.
AU - Krishnendu Chatterjee
AU - de Alfaro, Luca
AU - Faella, Marco
AU - Thomas Henzinger
AU - Majumdar, Ritankar S
AU - Stoelinga, Mariëlle
ID - 4549
TI - Compositional quantitative reasoning
ER -
TY - CONF
AB - A concurrent reachability game is a two-player game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a probability distribution over the successor states. The objective for player 1 consists in reaching a set of target states; the objective for player 2 is to prevent this, so that the game is zero-sum. Our contributions are two-fold. First, we present a simple proof of the fact that in concurrent reachability games, for all epsilon > 0, memoryless epsilon-optimal strategies exist. A memoryless strategy is independent of the history of plays, and an epsilon-optimal strategy achieves the objective with probability within epsilon of the value of the game. In contrast to previous proofs of this fact, which rely on the limit behavior of discounted games using advanced Puisieux series analysis, our proof is elementary and combinatorial. Second, we present a strategy-improvement (a.k.a. policy-iteration) algorithm for concurrent games with reachability objectives.
AU - Krishnendu Chatterjee
AU - de Alfaro, Luca
AU - Thomas Henzinger
ID - 4552
TI - Strategy improvement for concurrent reachability games
ER -
TY - CONF
AB - Many software model checkers are based on predicate abstraction. If the verification goal depends on pointer structures, the approach does not work well, because it is difficult to find adequate predicate abstractions for the heap. In contrast, shape analysis, which uses graph-based heap abstractions, can provide a compact representation of recursive data structures. We integrate shape analysis into the software model checker Blast. Because shape analysis is expensive, we do not apply it globally. Instead, we ensure that, like predicates, shape graphs are computed and stored locally, only where necessary for proving the verification goal. To achieve this, we extend lazy abstraction refinement, which so far has been used only for predicate abstractions, to three-valued logical structures. This approach does not only increase the precision of model checking, but it also increases the efficiency of shape analysis. We implemented the technique by extending Blast with calls to Tvla.
AU - Beyer, Dirk
AU - Thomas Henzinger
AU - Théoduloz, Grégory
ID - 4574
TI - Lazy shape analysis
VL - 4144
ER -
TY - GEN
AB - Mitchison and Jozsa recently suggested that the "chained-Zeno" counterfactual computation protocol recently proposed by Hosten et al. is counterfactual for only one output of the computer. This claim was based on the existing abstract algebraic definition of counterfactual computation, and indeed according to this definition, their argument is correct. However, a more general definition (physically adequate) for counterfactual computation is implicitly assumed by Hosten et. al. Here we explain in detail why the protocol is counterfactual and how the "history tracking" method of the existing description inadequately represents the physics underlying the protocol. Consequently, we propose a modified definition of counterfactual computation. Finally, we comment on one of the most interesting aspects of the error-correcting protocol.
AU - Hosten, Onur
AU - Rakher, Matthew
AU - Barreiro, Julio
AU - Peters, Nicholas
AU - Kwiat, Paul
ID - 573
TI - Counterfactual computation revisited
ER -
TY - GEN
AB - Vaidman, in a recent article adopts the method of 'quantum weak measurements in pre- and postselected ensembles' to ascertain whether or not the chained-Zeno counterfactual computation scheme proposed by Hosten et al. is counterfactual; which has been the topic of a debate on the definition of counterfactuality. We disagree with his conclusion, which brings up some interesting aspects of quantum weak measurements and some concerns about the way they are interpreted.
AU - Hosten, Onur
AU - Kwiat, Paul
ID - 574
TI - Weak measurements and counterfactual computation
ER -
TY - CONF
AB - A source of single photons allows secure quantum key distribution, in addition, to being a critical resource for linear optics quantum computing. We describe our progress on deterministically creating single photons from spontaneous parametric downconversion, an extension of the Pittman, Jacobs and Franson scheme [Phys. Rev A, v66, 042303 (2002)]. Their idea was to conditionally prepare single photons by measuring one member of a spontaneously emitted photon pair and storing the remaining conditionally prepared photon until a predetermined time, when it would be "deterministically" released from storage. Our approach attempts to improve upon this by recycling the pump pulse in order to decrease the possibility of multiple-pair generation, while maintaining a high probability of producing a single pair. Many of the challenges we discuss are central to other quantum information technologies, including the need for low-loss optical storage, switching and detection, and fast feed-forward control.
AU - Peters, Nicholas A
AU - Arnold, Keith J
AU - VanDevender, Aaron P
AU - Jeffrey, Evan R
AU - Rangarajan, Radhika
AU - Onur Hosten
AU - Barreiro, Julio T
AU - Altepeter, Joseph B
AU - Kwiat, Paul G
ID - 578
TI - Towards a quasi-deterministic single-photon source
VL - 6305
ER -
TY - CONF
AB - Visible light photon counters (VLPCs) and solid-state photomultipliers (SSPMs) are high-efficiency single-photon detectors which have multi-photon counting capability. While both the VLPCs and the SSPMs have inferred internal quantum efficiencies above 93%, the actual measured values for both the detectors were in fact limited to less than 88%, attributed to in-coupling losses. We are currently improving this overall detection efficiency via a) custom anti-reflection coating the detectors and the in-coupling fibers, b) implementing a novel cryogenic design to reduce transmission losses and, c) using low-noise electronics to obtain a better signal-to-noise ratio.
AU - Rangarajan, Radhika
AU - Altepeter, Joseph B
AU - Jeffrey, Evan R
AU - Stoutimore, Micah J
AU - Peters, Nicholas A
AU - Onur Hosten
AU - Kwiat, Paul G
ID - 577
TI - High-efficiency single-photon detectors
VL - 6372
ER -
TY - JOUR
AB - The logic underlying the coherent nature of quantum information processing often deviates from intuitive reasoning, leading to surprising effects. Counterfactual computation constitutes a striking example: the potential outcome of a quantum computation can be inferred, even if the computer is not run 1. Relying on similar arguments to interaction-free measurements 2 (or quantum interrogation3), counterfactual computation is accomplished by putting the computer in a superposition of 'running' and 'not running' states, and then interfering the two histories. Conditional on the as-yet-unknown outcome of the computation, it is sometimes possible to counterfactually infer information about the solution. Here we demonstrate counterfactual computation, implementing Grover's search algorithm with an all-optical approach4. It was believed that the overall probability of such counterfactual inference is intrinsically limited1,5, so that it could not perform better on average than random guesses. However, using a novel 'chained' version of the quantum Zeno effect6, we show how to boost the counterfactual inference probability to unity, thereby beating the random guessing limit. Our methods are general and apply to any physical system, as illustrated by a discussion of trapped-ion systems. Finally, we briefly show that, in certain circumstances, counterfactual computation can eliminate errors induced by decoherence.
AU - Onur Hosten
AU - Rakher, Matthew T
AU - Barreiro, Julio T
AU - Peters, Nicholas A
AU - Kwiat, Paul G
ID - 579
IS - 7079
JF - Nature
TI - Counterfactual quantum computation through quantum interrogation
VL - 439
ER -
TY - CONF
AB - Visible light photon counters (VLPCs) and solid-state photomultipliers (SSPMs) facilitate efficient single-photon detection. We are attempting to improve their efficiency, previously limited to < 88% by coupling losses, via anti-reflection coatings, better electronics and cryogenics.
AU - Rangarajan, Radhika
AU - Peters, Nicholas A
AU - Onur Hosten
AU - Altepeter, Joseph B
AU - Jeffrey, Evan R
AU - Kwiat, Paul G
ID - 583
TI - Improved single-photon detection
ER -
TY - JOUR
AU - Salecker, Iris
AU - Häusser, Michael
AU - de Bono, Mario
ID - 6151
IS - 6
JF - EMBO reports
SN - 1469-221X
TI - On the axonal road to circuit function and behaviour: Workshop on the assembly and function of neuronal circuits
VL - 7
ER -
TY - JOUR
AU - Rogers, Candida
AU - Persson, Annelie
AU - Cheung, Benny
AU - de Bono, Mario
ID - 6152
IS - 7
JF - Current Biology
SN - 0960-9822
TI - Behavioral motifs and neural pathways coordinating O2 responses and aggregation in C. elegans
VL - 16
ER -
TY - JOUR
AB - An experimental technique for measuring the current density distribution with a resolution smaller than the channel/rib scale of the flow field in polymer electrolyte fuel cells (PEFCs) is presented. The electron conductors in a plane perpendicular to the channel direction are considered as two-dimensional resistors. Hence, the current density is obtained from the solution of Laplace's equation with the potentials at current collector and reaction layer as boundary conditions. Using ohmic drop for calculating the local current, detailed knowledge of all resistances involved is of prime importance. In particular, the contact resistance between the gas diffusion layer (GDL) and flow field rib, as well as GDL bulk conductivity, are strongly dependent on clamping pressure. They represent a substantial amount of the total ohmic drop and therefore require careful consideration. The detailed experimental setup as well as the concise procedure for quantitative data evaluation is described. Finally, the method is applied successfully to a cell operated on pure oxygen and air up to high current densities. The results show that electrical and ionic resistances seem to govern the current distribution at low current regimes, whereas mass transport limitations locally hamper the current production at high loads.
AU - Freunberger, Stefan Alexander
AU - Reum, Mathias
AU - Evertz, Jörg
AU - Wokaun, Alexander
AU - Büchi, Felix N.
ID - 7328
IS - 11
JF - Journal of The Electrochemical Society
SN - 0013-4651
TI - Measuring the current distribution in PEFCs with sub-millimeter resolution
VL - 153
ER -
TY - JOUR
AB - Propagation of performance changes to adjacent cells in polymer electrolyte fuel cell stacks is studied by means of voltage monitoring and local current density measurements in peripheral cells of the stack. A technical fuel cell stack has been modified by implementing two independent reactant and coolant supplies in order to deliberately change the performance of one cell (anomalous cell) and study the coupling phenomena to adjacent cells (coupling cells), while keeping the working conditions of the later cell-group unaltered.
Two anomalies are studied: (i) air starvation and (ii) thermal anomaly, in a single anomalous cell in the stack and their coupling to adjacent cells. The results have shown that anomalies inducing considerable changes in the local current density of the anomalous cell (such as air starvation) propagate to adjacent cells affecting their performance. The propagation of local current density changes takes place via the common bipolar plate due to its finite thickness and in-plane conductivity. Consequently, anomalies which do not strongly influence the local current density distribution (such as a thermal anomaly under the studied working conditions) do not propagate to adjacent cells.
AU - Santis, Marco
AU - Freunberger, Stefan Alexander
AU - Papra, Matthias
AU - Wokaun, Alexander
AU - Büchi, Felix N.
ID - 7327
IS - 2
JF - Journal of Power Sources
SN - 0378-7753
TI - Experimental investigation of coupling phenomena in polymer electrolyte fuel cell stacks
VL - 161
ER -
TY - CONF
AB - Often the properties of a single cell are considered as representative for a complete polymer electrolyte fuel cell stack or even a fuel cell system. In some cases this comes close, however, in many real cases differences on several scales become important. Cell interaction phenomena in fuel cell stacks that arise from inequalities between adjacent cells are investigated in detail experimentally. For that, a specialized 2-cell stack with advanced localized diagnostics was developed. The results show that inequalities propagate by electrical coupling, inhomogeneous cell polarization and inducing in-plane current in the common bipolar plate. The effects of the different loss-mechanisms are analyzed and quantified.
AU - Büchi, Felix N.
AU - Freunberger, Stefan Alexander
AU - Santis, Marco
ID - 7326
IS - 1
T2 - ECS Transactions
TI - What is learned beyond the scale of single cells?
VL - 3
ER -
TY - JOUR
AB - A novel measurement principle for measuring the current distribution in polymer electrolyte fuel cells (PEFCs) is introduced. It allows, in contrast to all other known techniques, for the first time for a resolution smaller than the channel/rib scale of the flow field in PEFCs. The current density is obtained by considering the electron conductors in the cell as a two-dimensional resistor with the voltage drop caused by the current. The method was applied to a cell operated on oxygen up to high current densities. The results show that the ohmic resistances govern the current distribution in the low current regime, whereas mass transport limitations hamper the current production under the land at high loads.
AU - Freunberger, Stefan Alexander
AU - Reum, Mathias
AU - Wokaun, Alexander
AU - Büchi, Felix N.
ID - 7329
IS - 9
JF - Electrochemistry Communications
SN - 1388-2481
TI - Expanding current distribution measurement in PEFCs to sub-millimeter resolution
VL - 8
ER -
TY - JOUR
AB - Polymer electrolyte fuel cells (PE fuel cells) working with air at low stoichiometries (<2.0) and standard electrochemical components show a high degree of inhomogeneity in the current density distribution over the active area. An inhomogeneous current density distribution leads to a non-uniform utilization of the active area, which could negatively affect the time of life of the cells. Furthermore, it is also believed to lower cell performance. In this work, the homogenization of the current density, realized by means of tailored cathodes with along-the-air-channel redistributed catalyst loadings, is investigated. The air stoichiometry range for which a homogenization of the current density is achieved depends upon the gradient with which the catalyst is redistributed along the air channel. A gentle increasing catalyst loading profile homogenizes the current density at relatively higher air stoichiometries, while a steeper profile is suited better for lower air stoichiometries. The results show that a homogenization of the current density by means of redistributed catalyst loading has negative effects on cell performance. Model calculations corroborate the experimental findings on homogenization of the current density and deliver an explanation for the decrease in cell performance.
AU - Santis, M.
AU - Freunberger, Stefan Alexander
AU - Reiner, A.
AU - Büchi, F.N.
ID - 7330
IS - 25
JF - Electrochimica Acta
SN - 0013-4686
TI - Homogenization of the current density in polymer electrolyte fuel cells by in-plane cathode catalyst gradients
VL - 51
ER -
TY - JOUR
AB - A quasi-two-dimensional, along-the-channel mass and heat-transfer model for a proton exchange membrane fuel cell (PEFC) is described and validated against experimental current distribution data. The model is formulated in a dimensional manner, i.e., local transport phenomena are treated one-dimensional in through-plane direction and coupled in-plane by convective transport in the gas and coolant channels. Thus, a two-dimensional slice running through the repetitive unit of a cell from the anode channel via membrane-electrode assembly (MEA) and cathode channel to the coolant channel and from inlet to outlet is modeled. The aim of the work is to elucidate the influence of operating conditions such as feed gas humidities and stoichiometric ratios on the along-the-channel current density distribution and to identify the distinct underlying voltage loss mechanisms. Furthermore, a complicated technical flow field is modeled by a combination of co- and counterflow subdomains and compared with experimental current densities.
AU - Freunberger, Stefan Alexander
AU - Santis, Marco
AU - Schneider, Ingo A.
AU - Wokaun, Alexander
AU - Büchi, Felix N.
ID - 7332
IS - 2
JF - Journal of The Electrochemical Society
SN - 0013-4651
TI - In-plane effects in large-scale PEMFCs
VL - 153
ER -
TY - JOUR
AB - A previously developed mathematical model for water management and current density distribution in a polymer electrolyte fuel cell (PEFCs) is employed to investigate the effects of cooling strategies on cell performance. The model describes a two-dimensional slice through the cell along the channels and through the entire cell sandwich including the coolant channels and the bipolar plate. Arbitrary flow arrangements of fuel, oxidant, and coolant stream directions can be described. Due to the serious impact of temperature on all processes in the PEFC, both the relative direction of the coolant stream to the gas streams and its mass flow turns out to significantly affect the cell performance. Besides influencing the electrochemical reaction and all kinds of mass transfer temperature, variations predominantly alter the local membrane hydration distribution and subseqently its conductivity.
AU - Freunberger, Stefan Alexander
AU - Wokaun, Alexander
AU - Büchi, Felix N.
ID - 7331
IS - 5
JF - Journal of The Electrochemical Society
SN - 0013-4651
TI - In-plane effects in large-scale PEFCs: II. The influence of cooling strategy on cell performance
VL - 153
ER -
TY - JOUR
AB - Phylogenetic relationships between the extinct woolly mammoth (Mammuthus primigenius), and the Asian (Elephas maximus) and African savanna (Loxodonta africana) elephants remain unresolved. Here, we report the sequence of the complete mitochondrial genome (16,842 base pairs) of a woolly mammoth extracted from permafrost-preserved remains from the Pleistocene epoch - the oldest mitochondrial genome sequence determined to date. We demonstrate that well-preserved mitochondrial genome fragments, as long as ∼1,600-1700 base pairs, can be retrieved from pre-Holocene remains of an extinct species. Phylogenetic reconstruction of the Elephantinae clade suggests that M. primigenius and E. maximus are sister species that diverged soon after their common ancestor split from the L. africana lineage. Low nucleotide diversity found between independently determined mitochondrial genomic sequences of woolly mammoths separated geographically and in time suggests that north-eastern Siberia was occupied by a relatively homogeneous population of M. primigenius throughout the late Pleistocene.
AU - Rogaev, Evgeny I
AU - Moliaka, Yuri K
AU - Malyarchuk, Boris A
AU - Fyodor Kondrashov
AU - Derenko, Miroslava V
AU - Chumakov, Ilya M
AU - Grigorenko, Anastasia P
ID - 854
IS - 3
JF - PLoS Biology
TI - Complete mitochondrial genome and phylogeny of pleistocene mammoth Mammuthus primigenius
VL - 4
ER -
TY - JOUR
AB - Background: The glyoxylate cycle is thought to be present in bacteria, protists, plants, fungi, and nematodes, but not in other Metazoa. However, activity of the glyoxylate cycle enzymes, malate synthase (MS) and isocitrate lyase (ICL), in animal tissues has been reported. In order to clarify the status of the MS and ICL genes in animals and get an insight into their evolution, we undertook a comparative-genomic study. Results: Using sequence similarity searches, we identified MS genes in arthropods, echinoderms, and vertebrates, including platypus and opossum, but not in the numerous sequenced genomes of placental mammals. The regions of the placental mammals' genomes expected to code for malate synthase, as determined by comparison of the gene orders in vertebrate genomes, show clear similarity to the opossum MS sequence but contain stop codons, indicating that the MS gene became a pseudogene in placental mammals. By contrast, the ICL gene is undetectable in animals other than the nematodes that possess a bifunctional, fused ICL-MS gene. Examination of phylogenetic trees of MS and ICL suggests multiple horizontal gene transfer events that probably went in both directions between several bacterial and eukaryotic lineages. The strongest evidence was obtained for the acquisition of the bifunctional ICL-MS gene from an as yet unknown bacterial source with the corresponding operonic organization by the common ancestor of the nematodes. Conclusion: The distribution of the MS and ICL genes in animals suggests that either they encode alternative enzymes of the glyoxylate cycle that are not orthologous to the known MS and ICL or the animal MS acquired a new function that remains to be characterized. Regardless of the ultimate solution to this conundrum, the genes for the glyoxylate cycle enzymes present a remarkable variety of evolutionary events including unusual horizontal gene transfer from bacteria to animals.
AU - Fyodor Kondrashov
AU - Koonin, Eugene V
AU - Morgunov, Igor G
AU - Finogenova, Tatiana V
AU - Kondrashova, Marie N
ID - 868
JF - Biology Direct
TI - Evolution of glyoxylate cycle enzymes in Metazoa Evidence of multiple horizontal transfer events and pseudogene formation
VL - 1
ER -
TY - JOUR
AB - New genes commonly appear through complete or partial duplications of pre-existing genes. Duplications of long DNA segments are constantly produced by rare mutations, may become fixed in a population by selection or random drift, and are subject to divergent evolution of the paralogous sequences after fixation, although gene conversion can impede this process. New data shed some light on each of these processes. Mutations which involve duplications can occur through at least two different mechanisms, backward strand slippage during DNA replication and unequal crossing-over. The background rate of duplication of a complete gene in humans is 10-9-10-10 per generation, although many genes located within hot-spots of large-scale mutation are duplicated much more often. Many gene duplications affect fitness strongly, and are responsible, through gene dosage effects, for a number of genetic diseases. However, high levels of intrapopulation polymorphism caused by presence or absence of long, gene-containing DNA segments imply that some duplications are not under strong selection. The polymorphism to fixation ratios appear to be approximately the same for gene duplications and for presumably selectively neutral nucleotide substitutions, which, according to the McDonald-Kreitman test, is consistent with selective neutrality of duplications. However, this pattern can also be due to negative selection against most of segregating duplications and positive selection for at least some duplications which become fixed. Patterns in post-fixation evolution of duplicated genes do not easily reveal the causes of fixations. Many gene duplications which became fixed recently in a variety of organisms were positively selected because the increased expression of the corresponding genes was beneficial. The effects of gene dosage provide a unified framework for studying all phases of the life history of a gene duplication. Application of well-known methods of evolutionary genetics to accumulating data on new, polymorphic, and fixed duplication will enhance our understanding of the role of natural selection in the evolution by gene duplication.
AU - Fyodor Kondrashov
AU - Kondrashov, Alexey S
ID - 873
IS - 2
JF - Journal of Theoretical Biology
TI - Role of selection in fixation of gene duplications
VL - 239
ER -
TY - JOUR
AB - Structure elucidation of proteins by either NMR or X‐ray crystallography often requires the screening of a large number of samples for promising protein constructs and optimum solution conditions. For large‐scale screening of protein samples in solution, robust methods are needed that allow a rapid assessment of the folding of a polypeptide under diverse sample conditions. Here we present HET‐SOFAST NMR, a highly sensitive new method for semi‐quantitative characterization of the structural compactness and heterogeneity of polypeptide chains in solution. On the basis of one‐dimensional 1H HET‐SOFAST NMR data, obtained on well‐folded, molten globular, partially‐ and completely unfolded proteins, we define empirical thresholds that can be used as quantitative benchmarks for protein compactness. For 15N‐enriched protein samples, two‐dimensional 1H‐15N HET‐SOFAST correlation spectra provide site‐specific information about the structural heterogeneity along the polypeptide chain.
AU - Schanda, Paul
AU - Forge, Vincent
AU - Brutscher, Bernhard
ID - 8489
IS - S1
JF - Magnetic Resonance in Chemistry
SN - 0749-1581
TI - HET-SOFAST NMR for fast detection of structural compactness and heterogeneity along polypeptide chains
VL - 44
ER -
TY - JOUR
AB - We demonstrate for different protein samples that three-dimensional HNCO and HNCA correlation spectra may be recorded in a few minutes acquisition time using the band-selective excitation short-transient sequences presented here. This opens new perspectives for the NMR structural investigation of unstable protein samples and real-time site-resolved studies of protein kinetics.
AU - Schanda, Paul
AU - Van Melckebeke, Hélène
AU - Brutscher, Bernhard
ID - 8488
IS - 28
JF - Journal of the American Chemical Society
KW - Colloid and Surface Chemistry
KW - Biochemistry
KW - General Chemistry
KW - Catalysis
SN - 0002-7863
TI - Speeding up three-dimensional protein NMR experiments to a few minutes
VL - 128
ER -
TY - JOUR
AB - We demonstrate the feasibility of recording 1H–15N correlation spectra of proteins in only one second of acquisition time. The experiment combines recently proposed SOFAST-HMQC with Hadamard-type 15N frequency encoding. This allows site-resolved real-time NMR studies of kinetic processes in proteins with an increased time resolution. The sensitivity of the experiment is sufficient to be applicable to a wide range of molecular systems available at millimolar concentration on a high magnetic field spectrometer.
AU - Schanda, Paul
AU - Brutscher, Bernhard
ID - 8490
IS - 2
JF - Journal of Magnetic Resonance
KW - Nuclear and High Energy Physics
KW - Biophysics
KW - Biochemistry
KW - Condensed Matter Physics
SN - 1090-7807
TI - Hadamard frequency-encoded SOFAST-HMQC for ultrafast two-dimensional protein NMR
VL - 178
ER -
TY - JOUR
AB - We study the extent to which the Hausdorff dimension of a compact subset of an infinite-dimensional Banach space is affected by a typical mapping into a finite-dimensional space. It is possible that the dimension drops under all such mappings, but the amount by which it typically drops is controlled by the ‘thickness exponent’ of the set, which was defined by Hunt and Kaloshin (Nonlinearity12 (1999), 1263–1275). More precisely, let $X$ be a compact subset of a Banach space $B$ with thickness exponent $\tau$ and Hausdorff dimension $d$. Let $M$ be any subspace of the (locally) Lipschitz functions from $B$ to $\mathbb{R}^{m}$ that contains the space of bounded linear functions. We prove that for almost every (in the sense of prevalence) function $f \in M$, the Hausdorff dimension of $f(X)$ is at least $\min\{ m, d / (1 + \tau) \}$. We also prove an analogous result for a certain part of the dimension spectra of Borel probability measures supported on $X$. The factor $1 / (1 + \tau)$ can be improved to $1 / (1 + \tau / 2)$ if $B$ is a Hilbert space. Since dimension cannot increase under a (locally) Lipschitz function, these theorems become dimension preservation results when $\tau = 0$. We conjecture that many of the attractors associated with the evolution equations of mathematical physics have thickness exponent zero. We also discuss the sharpness of our results in the case $\tau > 0$.
AU - OTT, WILLIAM
AU - HUNT, BRIAN
AU - Kaloshin, Vadim
ID - 8514
IS - 3
JF - Ergodic Theory and Dynamical Systems
SN - 0143-3857
TI - The effect of projections on fractal sets and measures in Banach spaces
VL - 26
ER -
TY - CONF
AB - We consider the evolution of a set carried by a space periodic incompressible stochastic flow in a Euclidean space. We
report on three main results obtained in [8, 9, 10] concerning long time behaviour for a typical realization of the stochastic flow. First, at time t most of the particles are at a distance of order √t away from the origin. Moreover, we prove a Central Limit Theorem for the evolution of a measure carried by the flow, which holds for almost every realization of the flow. Second, we show the existence of a zero measure full Hausdorff dimension set of points, which
escape to infinity at a linear rate. Third, in the 2-dimensional case, we study the set of points visited by the original set by time t. Such a set, when scaled down by the factor of t, has a limiting non random shape.
AU - Kaloshin, Vadim
AU - DOLGOPYAT, D.
AU - KORALOV, L.
ID - 8515
SN - 9789812562012
T2 - XIVth International Congress on Mathematical Physics
TI - Long time behaviour of periodic stochastic flows
ER -
TY - JOUR
AU - Kaloshin, Vadim
AU - Saprykina, Maria
ID - 8513
IS - 2
JF - Discrete & Continuous Dynamical Systems - A
SN - 1553-5231
TI - Generic 3-dimensional volume-preserving diffeomorphisms with superexponential growth of number of periodic orbits
VL - 15
ER -
TY - JOUR
AB - The impact of synonymous nucleotide substitutions on fitness in mammals remains controversial. Despite some indications of selective constraint, synonymous sites are often assumed to be neutral, and the rate of their evolution is used as a proxy for mutation rate. We subdivide all sites into four classes in terms of the mutable CpG context, nonCpG, postC, preG, and postCpreG, and compare four-fold synonymous sites and intron sites residing outside transposable elements. The distribution of the rate of evolution across all synonymous sites is trimodal. Rate of evolution at nonCpG synonymous sites, not preceded by C and not followed by G, is ∼10% below that at such intron sites. In contrast, rate of evolution at postCpreG synonymous sites is ∼30% above that at such intron sites. Finally, synonymous and intron postC and preG sites evolve at similar rates. The relationship between the levels of polymorphism at the corresponding synonymous and intron sites is very similar to that between their rates of evolution. Within every class, synonymous sites are occupied by G or C much more often than intron sites, whose nucleotide composition is consistent with neutral mutation-drift equilibrium. These patterns suggest that synonymous sites are under weak selection in favor of G and C, with the average coefficient s∼0.25/Ne∼10-5, where Ne is the effective population size. Such selection decelerates evolution and reduces variability at sites with symmetric mutation, but has the opposite effects at sites where the favored nucleotides are more mutable. The amino-acid composition of proteins dictates that many synonymous sites are CpGprone, which causes them, on average, to evolve faster and to be more polymorphic than intron sites. An average genotype carries ∼107 suboptimal nucleotides at synonymous sites, implying synergistic epistasis in selection against them.
AU - Fyodor Kondrashov
AU - Ogurtsov, Aleksey Yu
AU - Kondrashov, Alexey S
ID - 869
IS - 4
JF - Journal of Theoretical Biology
TI - Selection in favor of nucleotides G and C diversifies evolution rates and levels of polymorphism at mammalian synonymous sites
VL - 240
ER -
TY - JOUR
AB - Background: Carcinogenesis typically involves multiple somatic mutations in caretaker (DNA repair) and gatekeeper (tumor suppressors and oncogenes) genes. Analysis of mutation spectra of the tumor suppressor that is most commonly mutated in human cancers, p53, unexpectedly suggested that somatic evolution of the p53 gene during tumorigenesis is dominated by positive selection for gain of function. This conclusion is supported by accumulating experimental evidence of evolution of new functions of p53 in tumors. These findings prompted a genome-wide analysis of possible positive selection during tumor evolution. Methods: A comprehensive analysis of probable somatic mutations in the sequences of Expressed Sequence Tags (ESTs) from malignant tumors and normal tissues was performed in order to access the prevalence of positive selection in cancer evolution. For each EST, the numbers of synonymous and non-synonymous substitutions were calculated. In order to identify genes with a signature of positive selection in cancers, these numbers were compared to: i) expected numbers and ii) the numbers for the respective genes in the ESTs from normal tissues. Results: We identified 112 genes with a signature of positive selection in cancers, i.e., a significantly elevated ratio of non-synonymous to synonymous substitutions, in tumors as compared to 37 such genes in an approximately equal-sized EST collection from normal tissues. A substantial fraction of the tumor-specific positive-selection candidates have experimentally demonstrated or strongly predicted links to cancer. Conclusion: The results of EST analysis should be interpreted with extreme caution given the noise introduced by sequencing errors and undetected polymorphisms. Furthermore, an inherent limitation of EST analysis is that multiple mutations amenable to statistical analysis can be detected only in relatively highly expressed genes. Nevertheless, the present results suggest that positive selection might affect a substantial number of genes during tumorigenic somatic evolution.
AU - Babenko, Vladimir N
AU - Basu, Malay K
AU - Fyodor Kondrashov
AU - Rogozin, Igor B
AU - Koonin, Eugene V
ID - 903
JF - BMC Cancer
TI - Signs of positive selection of somatic mutations in human cancers detected by EST sequence analysis
VL - 6
ER -
TY - JOUR
AB - Cytosine methylation, a common form of DNA modification that antagonizes transcription, is found at transposons and repeats in vertebrates, plants and fungi. Here we have mapped DNA methylation in the entire Arabidopsis thaliana genome at high resolution. DNA methylation covers transposons and is present within a large fraction of A. thaliana genes. Methylation within genes is conspicuously biased away from gene ends, suggesting a dependence on RNA polymerase transit. Genic methylation is strongly influenced by transcription: moderately transcribed genes are most likely to be methylated, whereas genes at either extreme are least likely. In turn, transcription is influenced by methylation: short methylated genes are poorly expressed, and loss of methylation in the body of a gene leads to enhanced transcription. Our results indicate that genic transcription and DNA methylation are closely interwoven processes.
AU - Zilberman, Daniel
AU - Gehring, Mary
AU - Tran, Robert K.
AU - Ballinger, Tracy
AU - Henikoff, Steven
ID - 9505
IS - 1
JF - Nature Genetics
SN - 1061-4036
TI - Genome-wide analysis of Arabidopsis thaliana DNA methylation uncovers an interdependence between methylation and transcription
VL - 39
ER -
TY - JOUR
AB - Dynamic self-assembly (DySA) processes occurring outside of thermodynamic equilibrium underlie many forms of adaptive and intellligent behaviors in natural systems. Relatively little, however, is known about the principles that govern DySA and the ways in which it can be extended to artificial ensembles. This article discusses recent advances in both the theory and the practice of nonequilibrium self-assembly. It is argued that a union of ideas from thermodynamics and dynamic systems' theory can provide a general description of DySA. In parallel, heuristic design rules can be used to construct DySA systems of increasing complexities based on a variety of suitable interactions/potentials on length scales from nanoscopic to macroscopic. Applications of these rules to magnetohydrodynamic DySA are also discussed.
AU - Fialkowski, Marcin
AU - Bishop, Kyle J. M.
AU - Klajn, Rafal
AU - Smoukov, Stoyan K.
AU - Campbell, Christopher J.
AU - Grzybowski, Bartosz A.
ID - 13430
IS - 6
JF - The Journal of Physical Chemistry B
KW - Materials Chemistry
KW - Surfaces
KW - Coatings and Films
KW - Physical and Theoretical Chemistry
SN - 1520-6106
TI - Principles and implementations of dissipative (dynamic) self-assembly
VL - 110
ER -
TY - JOUR
AB - Mixtures of oppositely charged nanoparticles of various sizes and charge ratios precipitate only at the point of electroneutrality. This phenomenonspecific to the nanoscale and reminiscent of threshold precipitation of ionsis a consequence of the formation of core-and-shell nanoparticle aggregates, in which the shells are composed of like-charged particles and are stabilized by efficient electrostatic screening.
AU - Kalsin, Alexander M.
AU - Kowalczyk, Bartlomiej
AU - Smoukov, Stoyan K.
AU - Klajn, Rafal
AU - Grzybowski, Bartosz A.
ID - 13428
IS - 47
JF - Journal of the American Chemical Society
KW - Colloid and Surface Chemistry
KW - Biochemistry
KW - General Chemistry
KW - Catalysis
SN - 0002-7863
TI - Ionic-like behavior of oppositely charged nanoparticles
VL - 128
ER -
TY - JOUR
AB - The fruitful core: Organic syntheses reported in the literature from 1850 to 2004 are analyzed with mathematical tools from network theory and statistical physics. There is a set of substances (the core) from which the majority of other organic compounds can be made (see picture; red: core, blue: periphery, green: islands). Search algorithms are used to identify small optimal sets of maximally useful chemicals.
AU - Bishop, Kyle J. M.
AU - Klajn, Rafal
AU - Grzybowski, Bartosz A.
ID - 13429
IS - 32
JF - Angewandte Chemie International Edition
KW - General Chemistry
KW - Catalysis
SN - 1433-7851
TI - The core and most useful molecules in organic chemistry
VL - 45
ER -
TY - JOUR
AB - The nuclear envelope (NE) is a highly specialized membrane that delineates the eukaryotic cell nucleus. It is composed of the inner and outer nuclear membranes, nuclear pore complexes (NPCs) and, in metazoa, the lamina. The NE not only regulates the trafficking of macromolecules between nucleoplasm and cytosol but also provides anchoring sites for chromatin and the cytoskeleton. Through these interactions, the NE helps position the nucleus within the cell and chromosomes within the nucleus, thereby regulating the expression of certain genes. The NE is not static, rather it is continuously remodeled during cell division. The most dramatic example of NE reorganization occurs during mitosis in metazoa when the NE undergoes a complete cycle of disassembly and reformation. Despite the importance of the NE for eukaryotic cell life, relatively little is known about its biogenesis or many of its functions. We thus are far from understanding the molecular etiology of a diverse group of NE-associated diseases.
AU - HETZER, Martin W
AU - Walther, Tobias C.
AU - Mattaj, Iain W.
ID - 11120
JF - Annual Review of Cell and Developmental Biology
KW - Cell Biology
KW - Developmental Biology
SN - 1081-0706
TI - Pushing the envelope: Structure, function, and dynamics of the nuclear periphery
VL - 21
ER -
TY - CONF
AB - We give a short survey of the use of hyperlink analysis in web search engine ranking and sketch other applications of hyperlink analysis in the web space.
AU - Henzinger, Monika H
ID - 11698
KW - Hyperlink Analysis
KW - World Wide Web
SN - 9781595931689
T2 - Proceedings of the 16th ACM conference on Hypertext and hypermedia
TI - Hyperlink analysis on the world wide web
ER -
TY - JOUR
AB - Many daily activities present information in the form of a stream of text, and often people can benefit from additional information on the topic discussed. TV broadcast news can be treated as one such stream of text; in this paper we discuss finding news articles on the web that are relevant to news currently being broadcast.
We evaluated a variety of algorithms for this problem, looking at the impact of inverse document frequency, stemming, compounds, history, and query length on the relevance and coverage of news articles returned in real time during a broadcast. We also evaluated several postprocessing techniques for improving the precision, including reranking using additional terms, reranking by document similarity, and filtering on document similarity. For the best algorithm, 84–91% of the articles found were relevant, with at least 64% of the articles being on the exact topic of the broadcast. In addition, a relevant article was found for at least 70% of the topics.
AU - Henzinger, Monika H
AU - Chang, Bay-Wei
AU - Milch, Brian
AU - Brin, Sergey
ID - 11904
IS - 2
JF - World Wide Web
SN - 1386-145X
TI - Query-free news search
VL - 8
ER -
TY - JOUR
AB - We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of requests accepted by the optimum offline algorithm to the expected number of requests accepted by our algorithm is O((log n + log log M)(log n + log M) log n), where M is the number of multicast groups and n is the number of nodes in the graph. We show that this is close to optimum by presenting an
Ω(log n log M) lower bound on this ratio for any randomized online algorithm against an oblivious adversary, when M is much larger than the link capacities. Our lower bound applies even in the restricted case where the link capacities are much larger than bandwidth requested by a single multicast. We also present a simple proof showing that it is impossible to be competitive against an adaptive online adversary.
As in the previous online routing algorithms, our algorithm uses edge-costs when deciding on which is the best path to use. In contrast to the previous competitive algorithms in the throughput model, our cost is not a direct function of the edge load. The new cost definition allows us to decouple the effects of routing and admission decisions of different multicast groups.
AU - Goel, Ashish
AU - Henzinger, Monika H
AU - Plotkin, Serge
ID - 11763
IS - 1
JF - Journal of Algorithms
SN - 0196-6774
TI - An online throughput-competitive algorithm for multicast routing and admission control
VL - 55
ER -
TY - JOUR
AB - An enhanced temperature-index glacier melt model, incorporating incoming shortwave radiation and albedo, is presented. The model is an attempt to combine the high temporal resolution and accuracy of physically based melt models with the lower data requirements and computational simplicity of empirical melt models, represented by the ‘degree-day’ method and its variants. The model is run with both measured and modelled radiation data, to test its applicability to glaciers with differing data availability. Five automatic weather stations were established on Haut Glacier d’Arolla, Switzerland, between May and September 2001. Reference surface melt rates were calculated using a physically based energy-balance melt model. The performance of the enhanced temperature-index model was tested at each of the four validation stations by comparing predicted hourly melt rates with reference melt rates. Predictions made with three other temperature-index models were evaluated in the same way for comparison. The enhanced temperature-index model offers significant improvements over the other temperature-index models, and accounts for 90–95% of the variation in the reference melt rate. The improvement is lower, but still significant, when the model is forced by modelled shortwave radiation data, thus offering a better alternative to existing models that require only temperature data input.
AU - Pellicciotti, Francesca
AU - Brock, Ben
AU - Strasser, Ulrich
AU - Burlando, Paolo
AU - Funk, Martin
AU - Corripio, Javier
ID - 12657
IS - 175
JF - Journal of Glaciology
SN - 0022-1430
TI - An enhanced temperature-index glacier melt model including the shortwave radiation balance: Development and testing for Haut Glacier d’Arolla, Switzerland
VL - 51
ER -
TY - JOUR
AB - Genetically encoded fluorescent probes of neural activity represent new promising tools for systems neuroscience. Here, we present a comparative in vivo analysis of 10 different genetically encoded calcium indicators, as well as the pH-sensitive synapto-pHluorin. We analyzed their fluorescence changes in presynaptic boutons of the Drosophila larval neuromuscular junction. Robust neural activity did not result in any or noteworthy fluorescence changes when Flash-Pericam, Camgaroo-1, and Camgaroo-2 were expressed. However, calculated on the raw data, fractional fluorescence changes up to 18% were reported by synapto-pHluorin, Yellow Cameleon 2.0, 2.3, and 3.3, Inverse-Pericam, GCaMP1.3, GCaMP1.6, and the troponin C-based calcium sensor TN-L15. The response characteristics of all of these indicators differed considerably from each other, with GCaMP1.6 reporting high rates of neural activity with the largest and fastest fluorescence changes. However, GCaMP1.6 suffered from photobleaching, whereas the fluorescence signals of the double-chromophore indicators were in general smaller but more photostable and reproducible, with TN-L15 showing the fastest rise of the signals at lower activity rates. We show for GCaMP1.3 and YC3.3 that an expanded range of neural activity evoked fairly linear fluorescence changes and a corresponding linear increase in the signal-to-noise ratio (SNR). The expression level of the indicator biased the signal kinetics and SNR, whereas the signal amplitude was independent. The presented data will be useful for in vivo experiments with respect to the selection of an appropriate indicator, as well as for the correct interpretation of the optical signals.
AU - Reiff, Dierk F
AU - Ihring, Alexandra
AU - Guerrero, Giovanna
AU - Isacoff, Ehud Y
AU - Maximilian Jösch
AU - Nakai, Junichi
AU - Borst, Alexander
ID - 1298
IS - 19
JF - Journal of Neuroscience
TI - In vivo performance of genetically encoded indicators of neural activity in flies
VL - 25
ER -
TY - JOUR
AB - Building on a recent paper [8], here we argue that the combinatorics of matroids are intimately related to the geometry and topology of toric hyperkähler varieties. We show that just like toric varieties occupy a central role in Stanley’s proof for the necessity of McMullen’s conjecture (or g-inequalities) about the classification of face vectors of simplicial polytopes, the topology of toric hyperkähler varieties leads to new restrictions on face vectors of matroid complexes. Namely in this paper we will give two proofs that the injectivity part of the Hard Lefschetz theorem survives for toric hyperkähler varieties. We explain how this implies the g-inequalities for rationally representable matroids. We show how the geometrical intuition in the first proof, coupled with results of Chari [3], leads to a proof of the g-inequalities for general matroid complexes, which is a recent result of Swartz [20]. The geometrical idea in the second proof will show that a pure O-sequence should satisfy the g-inequalities, thus showing that our result is in fact a consequence of a long-standing conjecture of Stanley.
AU - Tamas Hausel
ID - 1447
IS - 1
JF - Open Mathematics
TI - Quaternionic geometry of matroids
VL - 3
ER -
TY - CHAP
AB - The paper surveys the mirror symmetry conjectures of Hausel-Thaddeus and Hausel-Rodriguez-Villegas concerning the equality of certain Hodge numbers of SL(n, ℂ) vs. PGL(n, ℂ) flat connections and character varieties for curves, respectively. Several new results and conjectures and their relations to works of Hitchin, Gothen, Garsia-Haiman and Earl-Kirwan are explained. These use the representation theory of finite groups of Lie-type via the arithmetic of character varieties and lead to an unexpected conjecture for a Hard Lefschetz theorem for their cohomology.
AU - Tamas Hausel
ID - 1444
T2 - Geometric Methods in Algebra and Number Theory
TI - Mirror symmetry and Langlands duality in the non-Abelian Hodge theory of a curve
VL - 235
ER -
TY - JOUR
AB - We study an integration theory in circle equivariant cohomology in order to prove a theorem relating the cohomology ring of a hyperkähler quotient to the cohomology ring of the quotient by a maximal abelian subgroup, analogous to a theorem of Martin for symplectic quotients. We discuss applications of this theorem to quiver varieties, and compute as an example the ordinary and equivariant cohomology rings of a hyperpolygon space.
AU - Tamas Hausel
AU - Proudfoot, Nicholas J
ID - 1463
IS - 1
JF - Topology
TI - Abelianization for hyperkähler quotients
VL - 44
ER -
TY - JOUR
AB - The effects of substrate temperature, growth rate, and postgrowth annealing on the composition of Ge islands grown on Si(001) were investigated with a combination of selective wet chemical etching and atomic force microscopy. A simple kinetic model comprising only surface diffusion processes can explain all the experimentally observed compositional profiles for pyramid and dome islands grown in the 560-620°C range. From this model three-dimensional compositional maps were extracted. By performing annealing experiments a change in the composition of the domes was observed. This could be explained as the result of the islands' movement induced by alloying-driven energy minimization. Also in this case kinetically hindered bulk diffusion processes are not needed to explain the experimental observations.
AU - Georgios Katsaros
AU - Costantini, Giovanni
AU - Stoffel, Mathieu
AU - Esteban, Rubén
AU - Bittner, Alexander M
AU - Rastelli, Armando
AU - Denker, Ulrich
AU - Schmidt, Oliver G
AU - Kern, Klaus
ID - 1742
IS - 19
JF - Physical Review B - Condensed Matter and Materials Physics
TI - Kinetic origin of island intermixing during the growth of Ge on Si (001)
VL - 72
ER -
TY - JOUR
AB - A systematic study of the morphology of self-organized islands in the InAs/GaAs(0 0 1) and Ge/Si(0 0 1) systems is presented, based on high-resolution scanning tunneling microscopy measurements. We demonstrate that in both cases two main island families coexist: smaller pyramids bound by one type of shallow facets and larger multifaceted domes. Their structure and facet orientation are precisely determined, thus solving a highly debated argument in the case of InAs/GaAs(0 0 1). The comparison between the two material systems reveals the existence of striking similarities that extend even to the nature of island precursors and to the islands that form when depositing InGaAs or GeSi alloys. The implications of these observations on a possible universal description of the Stranski-Krastanow growth mode are discussed with respect to recent theoretical results.
AU - Costantini, Giovanni
AU - Rastelli, Armando
AU - Manzano, Carlos
AU - Acosta-Diaz, P
AU - Georgios Katsaros
AU - Songmuang, Rudeeson
AU - Schmidt, Oliver G
AU - Von Känel, Hans
AU - Kern, Klaus
ID - 1740
IS - 1-4
JF - Journal of Crystal Growth
TI - Pyramids and domes in the InAs/GaAs (0 0 1) and Ge/Si (0 0 1) systems
VL - 278
ER -
TY - JOUR
AB - Laterally aligned multilayer GeSiSi islands grown on a patterned Si (001) substrate are disclosed by selective etching of Si in a KOH solution. This procedure allows us to visualize the vertical alignment of the islands in a three-dimensional perspective. Our technique reveals that partly coalesced double islands in the initial layer do not merge together, but instead gradually reproduce into well-separated double islands in upper layers. We attribute this effect to very thin spacer layers, which efficiently transfer the strain modulation of each island through the spacer layer to the surface. The etching rate of Si is reduced in tensile strained regions, which helps to preserve sufficient Si between the stacked islands to form a periodic array of freestanding and vertically modulated heterostructure pillars.
AU - Zhong, Zheyang
AU - Georgios Katsaros
AU - Stoffel, Mathieu
AU - Costantini, Giovanni
AU - Kern, Klaus
AU - Schmidt, Oliver G
AU - Jin-Phillipp, Neng Y
AU - Bauer, Günther
ID - 1743
IS - 26
JF - Applied Physics Letters
TI - Periodic pillar structures by Si etching of multilayer GeSi/Si islands
VL - 87
ER -
TY - JOUR
AB - This paper presents optical duobinary and dicode signalling, as alternatives to the binary format, in order to improve the transmission performance in the presense of non-linear effects in a dense wavelength division multiplex (WDM) optical system. Duobinary signalling is applied to an optical system to explore the reduction of stimulated Brillouin scattering (SBS) effects. Duobinary signalling suppresses the SBS effects, and an eye-opening improvement of 0.25 to 1.2 dB is achieved relative to binary transmission over a range of input power levels. An experimental study demonstrates that duobinary modulation suppresses the four wave mixing (FWM) products of a dense WDM system by a maximum of 3 dB. The suppression is maintained over a range of channel spacings. An investigation of the impact of fibre dispersion on FWM products under binary, duobinary and dicode modulation in a dense WDM system is then performed, with interchannel spacing and optical power variation. This leads to the development of a set of guidelines for the application areas, in which it is appropriate to use duobinary or dicode modulation in WDM systems as a means of mitigating the impact of FWM.
AU - Georgios Katsaros
AU - Darwazeh, Izzat Z
AU - Lane, Phil M
ID - 1744
IS - 6
JF - IEE Proceedings - Optoelectronics
TI - Non linear transmission effects in duobinary and dicode optical systems
VL - 152
ER -
TY - JOUR
AB - SiGe islands move laterally on a Si(001) substrate during in situ postgrowth annealing. This surprising behavior is revealed by an analysis of the substrate surface morphology after island removal using wet chemical etching. We explain the island motion by asymmetric surface-mediated alloying. Material leaves one side of the island by surface diffusion, and mixes with additional Si from the surrounding surface as it redeposits on the other side. Thus the island moves laterally while becoming larger and more dilute.
AU - Denker, Ulrich
AU - Rastelli, Armando
AU - Stoffel, Mathieu
AU - Tersoff, Jerry
AU - Georgios Katsaros
AU - Costantini, Giovanni
AU - Kern, Klaus
AU - Jin-Phillipp, Neng Y
AU - Jesson, David E
AU - Schmidt, Oliver G
ID - 1741
IS - 21
JF - Physical Review Letters
TI - Lateral motion of SiGe islands driven by surface-mediated alloying
VL - 94
ER -
TY - JOUR
AB - Background: Murine leukemia virus (MLV) vector particles can be pseudotyped with a truncated variant of the human immunodeficiency virus type 1 (HIV-1) envelope protein (Env) and selectively target gene transfer to human cells expressing both CD4 and an appropriate co-receptor. Vector transduction mimics the HIV-1 entry process and is therefore a safe tool to study HIV-1 entry. Results: Using FLY cells, which express the MLV gag and pol genes, we generated stable producer cell lines that express the HIV-1 envelope gene and a retroviral vector genome encoding the green fluorescent protein (GFP). The BH10 or 89.6 P HIV-1 Env was expressed from a bicistronic vector which allowed the rapid selection of stable cell lines. A codon-usage-optimized synthetic env gene permitted high, Rev-independent Env expression. Vectors generated by these producer cells displayed different sensitivity to entry inhibitors. Conclusion: These data illustrate that MLV/HIV-1 vectors are a valuable screening system for entry inhibitors or neutralizing antisera generated by vaccines.
AU - Sandra Siegert
AU - Thaler, Sonja
AU - Wagner, Ralf
AU - Schnierle, Barbara S
ID - 1795
IS - 1
JF - AIDS Research and Therapy
TI - Assessment of HIV-1 entry inhibitors by MLV/HIV-1 pseudotyped vectors
VL - 2
ER -
TY - JOUR
AB -
Complex I of respiratory chains plays a central role in bioenergetics and is implicated in many human neurodegenerative diseases. An understanding of its mechanism requires a knowledge of the organization of redox centers. The arrangement of iron-sulfur clusters in the hydrophilic domain of complex I from Thermus thermophilus has been determined with the use of x-ray crystallography. One binuclear and six tetranuclear clusters are arranged, maximally 14 angstroms apart, in an 84-angstrom-long electron transfer chain. The binuclear cluster N1a and the tetranuclear cluster N7 are not in this pathway. Cluster N1a may play a role in the prevention of oxidative damage. The structure provides a framework for the interpretation of the large amounts of data accumulated on complex I.
AU - Hinchliffe, Philip
AU - Leonid Sazanov
ID - 1962
IS - 5735
JF - Science
TI - Biochemistry: Organization of iron-sulfur clusters in respiratory complex I
VL - 309
ER -
TY - BOOK
AB - Harold Davenport was one of the truly great mathematicians of the twentieth century. Based on lectures he gave at the University of Michigan in the early 1960s, this book is concerned with the use of analytic methods in the study of integer solutions to Diophantine equations and Diophantine inequalities. It provides an excellent introduction to a timeless area of number theory that is still as widely researched today as it was when the book originally appeared. The three main themes of the book are Waring's problem and the representation of integers by diagonal forms, the solubility in integers of systems of forms in many variables, and the solubility in integers of diagonal inequalities. For the second edition of the book a comprehensive foreword has been added in which three prominent authorities describe the modern context and recent developments. A thorough bibliography has also been added.
AU - Davenport, Harold
AU - Browning, Timothy D
ID - 210
TI - Analytic Methods for Diophantine Equations and Diophantine Inequalities
ER -
TY - JOUR
AB - Let f ∈ ℤ[x] be a polynomial of degree d. The paucity of non-trivial positive integer solutions to the equation f(x1)+f(x 2)=f(x3)+f(x4) is established, provided that d ≤ 7$. Also the corresponding situation is investigated for equal sums of three like polynomials.
AU - Timothy Browning
ID - 211
IS - 6
JF - Bulletin of the London Mathematical Society
TI - Equal sums of like polynomials
VL - 37
ER -
TY - JOUR
AB - For any n ≧ 2, let F ∈ ℤ [ x 1, … , xn ] be a form of degree d≧ 2, which produces a geometrically irreducible hypersurface in ℙn–1. This paper is concerned with the number N(F;B) of rational points on F = 0 which have height at most B. For any ε > 0 we establish the estimate N(F; B) = O(B n− 2+ ε ), whenever either n ≦ 5 or the hypersurface is not a union of lines. Here the implied constant depends at most upon d, n and ε.
AU - Timothy Browning
AU - Heath-Brown, Roger
ID - 212
IS - 584
JF - Journal fur die Reine und Angewandte Mathematik
TI - Counting rational points on hypersurfaces
ER -
TY - JOUR
AB - Given an absolutely irreducible ternary form F, the purpose of this paper is to produce better upper bounds for the number of integer solutions to the equation F=0, that are restricted to lie in very lopsided boxes. As an application of the main result, a new paucity estimate is obtained for equal sums of two like powers.
AU - Timothy Browning
AU - Heath-Brown, Roger
ID - 214
IS - 2
JF - Mathematische Zeitschrift
TI - Plane curves in boxes and equal sums of two powers
VL - 251
ER -
TY - JOUR
AB - We show that the number of nontrivial rational points of height at most B, which lie on the cubic surface x1 x2 x3 = x4 (x1 + x2 + x3)2, has order of magnitude B (log B)6. This agrees with Manin's conjecture.
AU - Timothy Browning
ID - 217
IS - 2
JF - Journal of Number Theory
TI - The density of rational points on a certain singular cubic surface
VL - 119
ER -
TY - JOUR
AB - The human norepinephrine (NE) transporter (hNET) attenuates neuronal signaling by rapid NE clearance from the synaptic cleft, and NET is a target for cocaine and amphetamines as well as therapeutics for depression, obsessive-compulsive disorder, and post-traumatic stress disorder. In spite of its central importance in the nervous system, little is known about how NET substrates, such as NE, 1-methyl-4-tetrahydropyridinium (MPP+), or amphetamine, interact with NET at the molecular level. Nor do we understand the mechanisms behind the transport rate. Previously we introduced a fluorescent substrate similar to MPP+, which allowed separate and simultaneous binding and transport measurement (Schwartz, J. W., Blakely, R. D., and DeFelice, L. J. (2003) J. Biol. Chem. 278, 9768-9777). Here we use this substrate, 4-(4-(dimethylamino)styrl)-N-methyl-pyridinium (ASP+), in combination with green fluorescent protein-tagged hNETs to measure substrate-transporter stoichiometry and substrate binding kinetics. Calibrated confocal microscopy and fluorescence correlation spectroscopy reveal that hNETs, which are homo-multimers, bind one substrate molecule per transporter subunit. Substrate residence at the transporter, obtained from rapid on-off kinetics revealed in fluorescence correlation spectroscopy, is 526 μs. Substrate residence obtained by infinite dilution is 1000 times slower. This novel examination of substrate-transporter kinetics indicates that a single ASP + molecule binds and unbinds thousands of times before being transported or ultimately dissociated from hNET. Calibrated fluorescent images combined with mass spectroscopy give a transport rate of 0.06 ASP +/hNET-protein/s, thus 36,000 on-off binding events (and 36 actual departures) occur for one transport event. Therefore binding has a low probability of resulting in transport. We interpret these data to mean that inefficient binding could contribute to slow transport rates.
AU - Schwartz, Joel W
AU - Gaia Novarino
AU - Piston, David W
AU - DeFelice, Louis J
ID - 2307
IS - 19
JF - Journal of Biological Chemistry
TI - Substrate binding stoichiometry and kinetics of the norepinephrine transporter
VL - 280
ER -
TY - BOOK
AB - This book contains a unique survey of the mathematically rigorous results about the quantum-mechanical many-body problem that have been obtained by the authors in the past seven years. It addresses a topic that is not only rich mathematically, using a large variety of techniques in mathematical analysis, but is also one with strong ties to current experiments on ultra-cold Bose gases and Bose-Einstein condensation. The book provides a pedagogical entry into an active area of ongoing research for both graduate students and researchers. It is an outgrowth of a course given by the authors for graduate students and post-doctoral researchers at the Oberwolfach Research Institute in 2004. The book also provides a coherent summary of the field and a reference for mathematicians and physicists active in research on quantum mechanics.
AU - Lieb, Élliott
AU - Seiringer, Robert
AU - Solovej, Jan
AU - Yngvason, Jakob
ID - 2335
SN - 978-3-7643-7336-8
TI - The Mathematics of the Bose gas and its Condensation
VL - 34
ER -
TY - CHAP
AB -
Now that the low temperature properties of quantum-mechanical many-body systems (bosons) at low density, ρ, can be examined experimentally it is appropriate to revisit some of the formulas deduced by many authors 4–5 decades ago, and to explore new regimes not treated before. For systems with repulsive (i.e. positive) interaction potentials the experimental low temperature state and the ground state are effectively synonymous — and this fact is used in all modeling. In such cases, the leading term in the energy/particle is 2πħ2 aρ/m where a is the scattering length of the two-body potential. Owing to the delicate and peculiar nature of bosonic correlations (such as the strange N 7/5 law for charged bosons), four decades of research failed to establish this plausible formula rigorously. The only previous lower bound for the energy was found by Dyson in 1957, but it was 14 times too small. The correct asymptotic formula has been obtained by us and this work will be presented. The reason behind the mathematical difficulties will be emphasized. A different formula, postulated as late as 1971 by Schick, holds in two dimensions and this, too, will be shown to be correct. With the aid of the methodology developed to prove the lower bound for the homogeneous gas, several other problems have been successfully addressed. One is the proof by us that the Gross-Pitaevskii equation correctly describes the ground state in the ‘traps’ actually used in the experiments. For this system it is also possible to prove complete Bose condensation and superfluidity as we have shown. On the frontier of experimental developments is the possibility that a dilute gas in an elongated trap will behave like a one-dimensional system; we have proved this mathematically. Another topic is a proof that Foldy’s 1961 theory of a high density Bose gas of charged particles correctly describes its ground state energy; using this we can also prove the N 7/5 formula for the ground state energy of the two-component charged Bose gas proposed by Dyson in 1967. All of this is quite recent work and it is hoped that the mathematical methodology might be useful, ultimately, to solve more complex problems connected with these interesting systems.
AU - Lieb, Élliott H
AU - Robert Seiringer
AU - Solovej, Jan P
AU - Yngvason, Jakob
ED - Benedicks, Michael
ED - Jones, Peter W
ED - Smirnov, Stanislav
ED - Winckler, Björn
ID - 2336
T2 - Perspectives in Analysis
TI - The quantum-mechanical many-body problem: The Bose gas
VL - 27
ER -
TY - JOUR
AB - The validity of substituting a c-number z for the k = 0 mode operator a0 is established rigorously in full generality, thereby verifying one aspect of Bogoliubov's 1947 theory. This substitution not only yields the correct value of thermodynamic quantities such as the pressure or ground state energy, but also the value of |z|2 that maximizes the partition function equals the true amount of condensation in the presence of a gauge-symmetry-breaking term. This point had previously been elusive.
AU - Lieb, Élliott H
AU - Robert Seiringer
AU - Yngvason, Jakob
ID - 2359
IS - 8
JF - Physical Review Letters
TI - Justification of c-number substitutions in bosonic hamiltonians
VL - 94
ER -
TY - JOUR
AB - Recent developments in the physics of low-density trapped gases make it worthwhile to verify old, well-known results that, while plausible, were based on perturbation theory and assumptions about pseudopotentials. We use and extend recently developed techniques to give a rigorous derivation of the asymptotic formula for the ground-state energy of a dilute gas of N fermions interacting with a short-range, positive potential of scattering length a. For spin-12 fermions, this is E∼E0+(22m)2πNa, where E0 is the energy of the noninteracting system and is the density. A similar formula holds in two dimensions (2D), with a replaced by ln(a2). Obviously this 2D energy is not the expectation value of a density-independent pseudopotential.
AU - Lieb, Élliott H
AU - Robert Seiringer
AU - Solovej, Jan P
ID - 2362
IS - 5
JF - Physical Review A - Atomic, Molecular, and Optical Physics
TI - Ground state energy of the low density Fermi gas
VL - 71
ER -
TY - JOUR
AB - The strong subadditivity of entropy plays a key role in several areas of physics and mathematics. It states that the entropy S[±]=- Tr(Ï±lnÏ±) of a density matrix Ï±123 on the product of three Hilbert spaces satisfies S[Ï±123]- S[Ï±12]≤S[Ï±23]-S[Ï±2]. We strengthen this to S[Ï±123]-S[Ï±12] ≤αnα(S[Ï±23α]-S[Ï±2α]), where the nα are weights and the Ï±23α are partitions of Ï±23. Correspondingly, there is a strengthening of the theorem that the map A|Trexp[L+lnA] is concave. As applications we prove some monotonicity and convexity properties of the Wehrl coherent state entropy and entropy inequalities for quantum gases.
AU - Lieb, Élliott H
AU - Robert Seiringer
ID - 2361
IS - 6
JF - Physical Review A - Atomic, Molecular, and Optical Physics
TI - Stronger subadditivity of entropy
VL - 71
ER -
TY - CONF
AB - We consider an online version of the conflict-free coloring of a set of points on the line, where each newly inserted point must be assigned a color upon insertion, and at all times the coloring has to be conflict-free, in the sense that in every interval I there is a color that appears exactly once in I. We present several deterministic and randomized algorithms for achieving this goal, and analyze their performance, that is, the maximum number of colors that they need to use, as a function of the number n of inserted points. We first show that a natural and simple (deterministic) approach may perform rather poorly, requiring Ω(√n) colors in the worst case. We then modify this approach, to obtain an efficient deterministic algorithm that uses a maximum of Θ(log 2 n) colors. Next, we present two randomized solutions. The first algorithm requires an expected number of at most O(log 2 n) colors, and produces a coloring which is valid with high probability, and the second one, which is a variant of our efficient deterministic algorithm, requires an expected number of at most O(log n log log n) colors but always produces a valid coloring. We also analyze the performance of the simplest proposed algorithm when the points are inserted in a random order, and present an incomplete analysis that indicates that, with high probability, it uses only O(log n) colors. Finally, we show that in the extension of this problem to two dimensions, where the relevant ranges are disks, n colors may be required in the worst case. The average-case behavior for disks, and cases involving other planar ranges, are still open.
AU - Fiat, Amos
AU - Levy, Meital B
AU - Matoušek, Jiří
AU - Pach, Elchanan M
AU - Sharir, Micha
AU - Smorodinsky, Shakhar
AU - Uli Wagner
AU - Welzl, Emo
ID - 2428
TI - Online conflict-free coloring for intervals
ER -
TY - JOUR
AB - Intersection graphs of disks and of line segments, respectively, have been well studied, because of both practical applications and theoretically interesting properties of these graphs. Despite partial results, the complexity status of the Clique problem for these two graph classes is still open. Here, we consider the Clique problem for intersection graphs of ellipses, which, in a sense, interpolate between disks and line segments, and show that the problem is APX-hard in that case. Moreover, this holds even if for all ellipses, the ratio of the larger over the smaller radius is some prescribed number. Furthermore, the reduction immediately carries over to intersection graphs of triangles. To our knowledge, this is the first hardness result for the Clique problem in intersection graphs of convex objects with finite description complexity. We also describe a simple approximation algorithm for the case of ellipses for which the ratio of radii is bounded.
AU - Ambühl, Christoph
AU - Uli Wagner
ID - 2427
IS - 3
JF - Theory of Computing Systems
TI - The Clique problem in intersection graphs of ellipses and triangles
VL - 38
ER -
TY - JOUR
AB - Local accumulation of the plant growth regulator auxin mediates pattern formation in Arabidopsis roots and influences outgrowth and development of lateral root- and shoot-derived primordia. However, it has remained unclear how auxin can simultaneously regulate patterning and organ outgrowth and how its distribution is stabilized in a primordium-specif ic manner. Here we show that five PIN genes collectively control auxin distribution to regulate cell division and cell expansion in the primary root. Furthermore, the joint action of these genes has an important role in pattern formation by focusing the auxin maximum and restricting the expression domain of PLETHORA (PLT) genes, major determinants for root stem cell specification. In turn, PLT genes are required for PIN gene transcription to stabilize the auxin maximum at the distal root tip. Our data reveal an interaction network of auxin transport facilitators and root fate determinants that control patterning and growth of the root primordium.
AU - Billou, Ikram
AU - Xu, Jian
AU - Wildwater, Marjolein
AU - Willemsen, Viola
AU - Paponov, Ivan A
AU - Jirí Friml
AU - Heldstra, Renze
AU - Aida, Mitsuhiro
AU - Palme, Klaus J
AU - Scheres, Ben
ID - 2455
IS - 7021
JF - Nature
TI - The PIN auxin efflux facilitator network controls growth and patterning in Arabidopsis roots
VL - 433
ER -
TY - CHAP
AU - Jirí Friml
AU - Wiśniewska, Justyna
ED - Fleming, Andrew J.
ID - 2464
T2 - Intercellular Communication in Plants
TI - Auxin as an intercellular signal
VL - 16
ER -