@article{2304,
abstract = {This extended abstract is concerned with the irregularities of distribution of one-dimensional permuted van der Corput sequences that are generated from linear permutations. We show how to obtain upper bounds for the discrepancy and diaphony of these sequences, by relating them to Kronecker sequences and applying earlier results of Faure and Niederreiter.},
author = {Pausinger, Florian},
journal = {Electronic Notes in Discrete Mathematics},
pages = {43 -- 50},
publisher = {Elsevier},
title = {{Van der Corput sequences and linear permutations}},
doi = {10.1016/j.endm.2013.07.008},
volume = {43},
year = {2013},
}
@inproceedings{2305,
abstract = {We study the complexity of central controller synthesis problems for finite-state Markov decision processes, where the objective is to optimize both the expected mean-payoff performance of the system and its stability. e argue that the basic theoretical notion of expressing the stability in terms of the variance of the mean-payoff (called global variance in our paper) is not always sufficient, since it ignores possible instabilities on respective runs. For this reason we propose alernative definitions of stability, which we call local and hybrid variance, and which express how rewards on each run deviate from the run's own mean-payoff and from the expected mean-payoff, respectively. We show that a strategy ensuring both the expected mean-payoff and the variance below given bounds requires randomization and memory, under all the above semantics of variance. We then look at the problem of determining whether there is a such a strategy. For the global variance, we show that the problem is in PSPACE, and that the answer can be approximated in pseudo-polynomial time. For the hybrid variance, the analogous decision problem is in NP, and a polynomial-time approximating algorithm also exists. For local variance, we show that the decision problem is in NP. Since the overall performance can be traded for stability (and vice versa), we also present algorithms for approximating the associated Pareto curve in all the three cases. Finally, we study a special case of the decision problems, where we require a given expected mean-payoff together with zero variance. Here we show that the problems can be all solved in polynomial time.},
author = {Brázdil, Tomáš and Chatterjee, Krishnendu and Forejt, Vojtěch and Kučera, Antonín},
booktitle = {28th Annual ACM/IEEE Symposium},
location = {New Orleans, LA, United States},
pages = {331 -- 340},
publisher = {IEEE},
title = {{Trading performance for stability in Markov decision processes}},
doi = {10.1109/LICS.2013.39},
year = {2013},
}
@book{2306,
abstract = {Das Buch ist sowohl eine Einführung in die Themen Linked Data, Open Data und Open Linked Data als es auch den konkreten Bezug auf Bibliotheken behandelt. Hierzu werden konkrete Anwendungsprojekte beschrieben. Der Band wendet sich dabei sowohl an Personen aus der Bibliothekspraxis als auch an Personen aus dem Bibliotheksmanagement, die noch nicht mit dem Thema vertraut sind.},
author = {Danowski, Patrick and Pohl, Adrian},
publisher = {De Gruyter},
title = {{(Open) Linked Data in Bibliotheken}},
doi = {10.1515/9783110278736},
volume = {50},
year = {2013},
}
@inproceedings{2327,
abstract = {We define the model-measuring problem: given a model M and specification φ, what is the maximal distance ρ such that all models M′ within distance ρ from M satisfy (or violate) φ. The model measuring problem presupposes a distance function on models. We concentrate on automatic distance functions, which are defined by weighted automata. The model-measuring problem subsumes several generalizations of the classical model-checking problem, in particular, quantitative model-checking problems that measure the degree of satisfaction of a specification, and robustness problems that measure how much a model can be perturbed without violating the specification. We show that for automatic distance functions, and ω-regular linear-time and branching-time specifications, the model-measuring problem can be solved. We use automata-theoretic model-checking methods for model measuring, replacing the emptiness question for standard word and tree automata by the optimal-weight question for the weighted versions of these automata. We consider weighted automata that accumulate weights by maximizing, summing, discounting, and limit averaging. We give several examples of using the model-measuring problem to compute various notions of robustness and quantitative satisfaction for temporal specifications.},
author = {Henzinger, Thomas A and Otop, Jan},
location = {Buenos Aires, Argentina},
pages = {273 -- 287},
publisher = {Springer},
title = {{From model checking to model measuring}},
doi = {10.1007/978-3-642-40184-8_20},
volume = {8052},
year = {2013},
}
@inproceedings{2328,
abstract = {Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on identifying the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to advanced non-blocking concurrency patterns, such as helping and optimistic updates.
In response, we propose a more modular way of checking linearizability of concurrent queue algorithms that does not involve identifying linearization points. We reduce the task of proving linearizability with respect to the queue specification to establishing four basic properties, each of which can be proved independently by simpler arguments. As a demonstration of our approach, we verify the Herlihy and Wing queue, an algorithm that is challenging to verify by a simulation proof.},
author = {Henzinger, Thomas A and Sezgin, Ali and Vafeiadis, Viktor},
location = {Buenos Aires, Argentina},
pages = {242 -- 256},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
title = {{Aspect-oriented linearizability proofs}},
doi = {10.1007/978-3-642-40184-8_18},
volume = {8052},
year = {2013},
}
@inproceedings{2329,
abstract = {Two-player games on graphs are central in many problems in formal verification and program analysis such as synthesis and verification of open systems. In this work, we consider both finite-state game graphs, and recursive game graphs (or pushdown game graphs) that model the control flow of sequential programs with recursion. The objectives we study are multidimensional mean-payoff objectives, where the goal of player 1 is to ensure that the mean-payoff is non-negative in all dimensions. In pushdown games two types of strategies are relevant: (1) global strategies, that depend on the entire global history; and (2) modular strategies, that have only local memory and thus do not depend on the context of invocation. Our main contributions are as follows: (1) We show that finite-state multidimensional mean-payoff games can be solved in polynomial time if the number of dimensions and the maximal absolute value of the weights are fixed; whereas if the number of dimensions is arbitrary, then the problem is known to be coNP-complete. (2) We show that pushdown graphs with multidimensional mean-payoff objectives can be solved in polynomial time. For both (1) and (2) our algorithms are based on hyperplane separation technique. (3) For pushdown games under global strategies both one and multidimensional mean-payoff objectives problems are known to be undecidable, and we show that under modular strategies the multidimensional problem is also undecidable; under modular strategies the one-dimensional problem is NP-complete. We show that if the number of modules, the number of exits, and the maximal absolute value of the weights are fixed, then pushdown games under modular strategies with one-dimensional mean-payoff objectives can be solved in polynomial time, and if either the number of exits or the number of modules is unbounded, then the problem is NP-hard. (4) Finally we show that a fixed parameter tractable algorithm for finite-state multidimensional mean-payoff games or pushdown games under modular strategies with one-dimensional mean-payoff objectives would imply the fixed parameter tractability of parity games.},
author = {Chatterjee, Krishnendu and Velner, Yaron},
location = {Buenos Aires, Argentinia},
pages = {500 -- 515},
publisher = {Springer},
title = {{Hyperplane separation technique for multidimensional mean-payoff games}},
doi = {10.1007/978-3-642-40184-8_35},
volume = {8052},
year = {2013},
}
@article{2410,
abstract = {Here, we describe a novel virulent bacteriophage that infects Bacillus weihenstephanensis, isolated from soil in Austria. It is the first phage to be discovered that infects this species. Here, we present the complete genome sequence of this podovirus. },
author = {Fernandes Redondo, Rodrigo A and Kupczok, Anne and Stift, Gertraud and Bollback, Jonathan P},
journal = {Genome Announcements},
number = {3},
publisher = {American Society for Microbiology},
title = {{Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis}},
doi = {10.1128/genomeA.00216-13},
volume = {1},
year = {2013},
}
@article{2412,
abstract = {Background: The CRISPR/Cas system is known to act as an adaptive and heritable immune system in Eubacteria and Archaea. Immunity is encoded in an array of spacer sequences. Each spacer can provide specific immunity to invasive elements that carry the same or a similar sequence. Even in closely related strains, spacer content is very dynamic and evolves quickly. Standard models of nucleotide evolutioncannot be applied to quantify its rate of change since processes other than single nucleotide changes determine its evolution.Methods We present probabilistic models that are specific for spacer content evolution. They account for the different processes of insertion and deletion. Insertions can be constrained to occur on one end only or are allowed to occur throughout the array. One deletion event can affect one spacer or a whole fragment of adjacent spacers. Parameters of the underlying models are estimated for a pair of arrays by maximum likelihood using explicit ancestor enumeration.Results Simulations show that parameters are well estimated on average under the models presented here. There is a bias in the rate estimation when including fragment deletions. The models also estimate times between pairs of strains. But with increasing time, spacer overlap goes to zero, and thus there is an upper bound on the distance that can be estimated. Spacer content similarities are displayed in a distance based phylogeny using the estimated times.We use the presented models to analyze different Yersinia pestis data sets and find that the results among them are largely congruent. The models also capture the variation in diversity of spacers among the data sets. A comparison of spacer-based phylogenies and Cas gene phylogenies shows that they resolve very different time scales for this data set.Conclusions The simulations and data analyses show that the presented models are useful for quantifying spacer content evolution and for displaying spacer content similarities of closely related strains in a phylogeny. This allows for comparisons of different CRISPR arrays or for comparisons between CRISPR arrays and nucleotide substitution rates.},
author = {Kupczok, Anne and Bollback, Jonathan P},
journal = {BMC Evolutionary Biology},
number = {1},
pages = {54 -- 54},
publisher = {BioMed Central},
title = {{Probabilistic models for CRISPR spacer content evolution }},
doi = {10.1186/1471-2148-13-54},
volume = {13},
year = {2013},
}
@inbook{2413,
abstract = {Progress in understanding the global brain dynamics has remained slow to date in large part because of the highly multiscale nature of brain activity. Indeed, normal brain dynamics is characterized by complex interactions between multiple levels: from the microscopic scale of single neurons to the mesoscopic level of local groups of neurons, and finally to the macroscopic level of the whole brain. Among the most difficult tasks are those of identifying which scales are significant for a given particular function and describing how the scales affect each other. It is important to realize that the scales of time and space are linked together, or even intertwined, and that causal inference is far more ambiguous between than within levels. We approach this problem from the perspective of our recent work on simultaneous recording from micro- and macroelectrodes in the human brain. We propose a physiological description of these multilevel interactions, based on phase–amplitude coupling of neuronal oscillations that operate at multiple frequencies and on different spatial scales. Specifically, the amplitude of the oscillations on a particular spatial scale is modulated by phasic variations in neuronal excitability induced by lower frequency oscillations that emerge on a larger spatial scale. Following this general principle, it is possible to scale up or scale down the multiscale brain dynamics. It is expected that large-scale network oscillations in the low-frequency range, mediating downward effects, may play an important role in attention and consciousness.},
author = {Valderrama, Mario and Botella Soler, Vicente and Le Van Quyen, Michel},
booktitle = {Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain},
editor = {Meyer, Misha and Pesenson, Z.},
isbn = {9783527411986 },
publisher = {Wiley-VCH},
title = {{Neuronal oscillations scale up and scale down the brain dynamics }},
doi = {10.1002/9783527671632.ch08},
year = {2013},
}
@article{2443,
abstract = {The mode of action of auxin is based on its non-uniform distribution within tissues and organs. Despite the wide use of several auxin analogues in research and agriculture, little is known about the specificity of different auxin-related transport and signalling processes towards these compounds. Using seedlings of Arabidopsis thaliana and suspension-cultured cells of Nicotiana tabacum (BY-2), the physiological activity of several auxin analogues was investigated, together with their capacity to induce auxin-dependent gene expression, to inhibit endocytosis and to be transported across the plasma membrane. This study shows that the specificity criteria for different auxin-related processes vary widely. Notably, the special behaviour of some synthetic auxin analogues suggests that they might be useful tools in investigations of the molecular mechanism of auxin action. Thus, due to their differential stimulatory effects on DR5 expression, indole-3-propionic (IPA) and 2,4,5-trichlorophenoxy acetic (2,4,5-T) acids can serve in studies of TRANSPORT INHIBITOR RESPONSE 1/AUXIN SIGNALLING F-BOX (TIR1/AFB)-mediated auxin signalling, and 5-fluoroindole-3-acetic acid (5-F-IAA) can help to discriminate between transcriptional and non-transcriptional pathways of auxin signalling. The results demonstrate that the major determinants for the auxin-like physiological potential of a particular compound are very complex and involve its chemical and metabolic stability, its ability to distribute in tissues in a polar manner and its activity towards auxin signalling machinery.},
author = {Simon, Sibu and Kubeš, Martin and Baster, Pawel and Robert, Stéphanie and Dobrev, Petre and Friml, Jirí and Petrášek, Jan and Zažímalová, Eva},
journal = {New Phytologist},
number = {4},
pages = {1034 -- 1048},
publisher = {Wiley-Blackwell},
title = {{Defining the selectivity of processes along the auxin response chain: A study using auxin analogues}},
doi = {10.1111/nph.12437},
volume = {200},
year = {2013},
}
@inproceedings{2444,
abstract = {We consider two core algorithmic problems for probabilistic verification: the maximal end-component decomposition and the almost-sure reachability set computation for Markov decision processes (MDPs). For MDPs with treewidth k, we present two improved static algorithms for both the problems that run in time O(n·k 2.38·2k ) and O(m·logn· k), respectively, where n is the number of states and m is the number of edges, significantly improving the previous known O(n·k·√n· k) bound for low treewidth. We also present decremental algorithms for both problems for MDPs with constant treewidth that run in amortized logarithmic time, which is a huge improvement over the previously known algorithms that require amortized linear time.},
author = {Chatterjee, Krishnendu and Ła̧Cki, Jakub},
location = {St. Petersburg, Russia},
pages = {543 -- 558},
publisher = {Springer},
title = {{Faster algorithms for Markov decision processes with low treewidth}},
doi = {10.1007/978-3-642-39799-8_36},
volume = {8044},
year = {2013},
}
@inproceedings{2446,
abstract = {The model-checking problem for probabilistic systems crucially relies on the translation of LTL to deterministic Rabin automata (DRW). Our recent Safraless translation [KE12, GKE12] for the LTL(F,G) fragment produces smaller automata as compared to the traditional approach. In this work, instead of DRW we consider deterministic automata with acceptance condition given as disjunction of generalized Rabin pairs (DGRW). The Safraless translation of LTL(F,G) formulas to DGRW results in smaller automata as compared to DRW. We present algorithms for probabilistic model-checking as well as game solving for DGRW conditions. Our new algorithms lead to improvement both in terms of theoretical bounds as well as practical evaluation. We compare PRISM with and without our new translation, and show that the new translation leads to significant improvements.},
author = {Chatterjee, Krishnendu and Gaiser, Andreas and Kretinsky, Jan},
location = {St. Petersburg, Russia},
pages = {559 -- 575},
publisher = {Springer},
title = {{Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis}},
doi = {10.1007/978-3-642-39799-8_37},
volume = {8044},
year = {2013},
}
@inproceedings{2447,
abstract = {Separation logic (SL) has gained widespread popularity because of its ability to succinctly express complex invariants of a program’s heap configurations. Several specialized provers have been developed for decidable SL fragments. However, these provers cannot be easily extended or combined with solvers for other theories that are important in program verification, e.g., linear arithmetic. In this paper, we present a reduction of decidable SL fragments to a decidable first-order theory that fits well into the satisfiability modulo theories (SMT) framework. We show how to use this reduction to automate satisfiability, entailment, frame inference, and abduction problems for separation logic using SMT solvers. Our approach provides a simple method of integrating separation logic into existing verification tools that provide SMT backends, and an elegant way of combining SL fragments with other decidable first-order theories. We implemented this approach in a verification tool and applied it to heap-manipulating programs whose verification involves reasoning in theory combinations.
},
author = {Piskac, Ruzica and Wies, Thomas and Zufferey, Damien},
location = {St. Petersburg, Russia},
pages = {773 -- 789},
publisher = {Springer},
title = {{Automating separation logic using SMT}},
doi = {10.1007/978-3-642-39799-8_54},
volume = {8044},
year = {2013},
}
@article{2448,
abstract = {Cell-to-cell directional flow of the phytohormone auxin is primarily established by polar localization of the PIN auxin transporters, a process tightly regulated at multiple levels by auxin itself. We recently reported that, in the context of strong auxin flows, activity of the vacuolar ZIFL1.1 transporter is required for fine-tuning of polar auxin transport rates in the Arabidopsis root. In particular, ZIFL1.1 function protects plasma-membrane stability of the PIN2 carrier in epidermal root tip cells under conditions normally triggering PIN2 degradation. Here, we show that ZIFL1.1 activity at the root tip also promotes PIN1 plasma-membrane abundance in central cylinder cells, thus supporting the notion that ZIFL1.1 acts as a general positive modulator of polar auxin transport in roots.},
author = {Remy, Estelle and Baster, Pawel and Friml, Jirí and Duque, Paula},
journal = {Plant Signaling & Behavior},
number = {10},
publisher = {Landes Bioscience},
title = {{ZIFL1.1 transporter modulates polar auxin transport by stabilizing membrane abundance of multiple PINs in Arabidopsis root tip}},
doi = {10.4161/psb.25688},
volume = {8},
year = {2013},
}
@article{2449,
abstract = {Intracellular protein routing is mediated by vesicular transport which is tightly regulated in eukaryotes. The protein and lipid homeostasis depends on coordinated delivery of de novo synthesized or recycled cargoes to the plasma membrane by exocytosis and their subsequent removal by rerouting them for recycling or degradation. Here, we report the characterization of protein affected trafficking 3 (pat3) mutant that we identified by an epifluorescence-based forward genetic screen for mutants defective in subcellular distribution of Arabidopsis auxin transporter PIN1–GFP. While pat3 displays largely normal plant morphology and development in nutrient-rich conditions, it shows strong ectopic intracellular accumulations of different plasma membrane cargoes in structures that resemble prevacuolar compartments (PVC) with an aberrant morphology. Genetic mapping revealed that pat3 is defective in vacuolar protein sorting 35A (VPS35A), a putative subunit of the retromer complex that mediates retrograde trafficking between the PVC and trans-Golgi network. Similarly, a mutant defective in another retromer subunit, vps29, shows comparable subcellular defects in PVC morphology and protein accumulation. Thus, our data provide evidence that the retromer components VPS35A and VPS29 are essential for normal PVC morphology and normal trafficking of plasma membrane proteins in plants. In addition, we show that, out of the three VPS35 retromer subunits present in Arabidopsis thaliana genome, the VPS35 homolog A plays a prevailing role in trafficking to the lytic vacuole, presenting another level of complexity in the retromer-dependent vacuolar sorting. },
author = {Nodzyński, Tomasz and Feraru, Murguel and Hirsch, Sibylle and De Rycke, Riet and Nicuales, Claudiu and Van Leene, Jelle and De Jaeger, Geert and Vanneste, Steffen and Friml, Jirí},
journal = {Molecular Plant},
number = {6},
pages = {1849 -- 1862},
publisher = {Cell Press},
title = {{Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis}},
doi = {10.1093/mp/sst044},
volume = {6},
year = {2013},
}
@article{2466,
abstract = {We introduce a new method for efficiently simulating liquid with extreme amounts of spatial adaptivity. Our method combines several key components to drastically speed up the simulation of large-scale fluid phenomena: We leverage an alternative Eulerian tetrahedral mesh discretization to significantly reduce the complexity of the pressure solve while increasing the robustness with respect to element quality and removing the possibility of locking. Next, we enable subtle free-surface phenomena by deriving novel second-order boundary conditions consistent with our discretization. We couple this discretization with a spatially adaptive Fluid-Implicit Particle (FLIP) method, enabling efficient, robust, minimally-dissipative simulations that can undergo sharp changes in spatial resolution while minimizing artifacts. Along the way, we provide a new method for generating a smooth and detailed surface from a set of particles with variable sizes. Finally, we explore several new sizing functions for determining spatially adaptive simulation resolutions, and we show how to couple them to our simulator. We combine each of these elements to produce a simulation algorithm that is capable of creating animations at high maximum resolutions while avoiding common pitfalls like inaccurate boundary conditions and inefficient computation.},
author = {Ando, Ryoichi and Thuerey, Nils and Wojtan, Christopher J},
journal = {ACM Transactions on Graphics},
number = {4},
publisher = {ACM},
title = {{Highly adaptive liquid simulations on tetrahedral meshes}},
doi = {10.1145/2461912.2461982},
volume = {32},
year = {2013},
}
@article{2467,
abstract = {This paper presents a method for computing topology changes for triangle meshes in an interactive geometric modeling environment. Most triangle meshes in practice do not exhibit desirable geometric properties, so we develop a solution that is independent of standard assumptions and robust to geometric errors. Specifically, we provide the first method for topology change applicable to arbitrary non-solid, non-manifold, non-closed, self-intersecting surfaces. We prove that this new method for topology change produces the expected conventional results when applied to solid (closed, manifold, non-self-intersecting) surfaces---that is, we prove a backwards-compatibility property relative to prior work. Beyond solid surfaces, we present empirical evidence that our method remains tolerant to a variety of surface aberrations through the incorporation of a novel error correction scheme. Finally, we demonstrate how topology change applied to non-solid objects enables wholly new and useful behaviors.},
author = {Bernstein, Gilbert and Wojtan, Christopher J},
journal = {ACM Transactions on Graphics},
number = {4},
publisher = {ACM},
title = {{Putting holes in holey geometry: Topology change for arbitrary surfaces}},
doi = {10.1145/2461912.2462027},
volume = {32},
year = {2013},
}
@article{2468,
abstract = {Our work concerns the combination of an Eulerian liquid simulation with a high-resolution surface tracker (e.g. the level set method or a Lagrangian triangle mesh). The naive application of a high-resolution surface tracker to a low-resolution velocity field can produce many visually disturbing physical and topological artifacts that limit their use in practice. We address these problems by defining an error function which compares the current state of the surface tracker to the set of physically valid surface states. By reducing this error with a gradient descent technique, we introduce a novel physics-based surface fairing method. Similarly, by treating this error function as a potential energy, we derive a new surface correction force that mimics the vortex sheet equations. We demonstrate our results with both level set and mesh-based surface trackers.},
author = {Bojsen-Hansen, Morten and Wojtan, Christopher J},
journal = {ACM Transactions on Graphics},
number = {4},
publisher = {ACM},
title = {{Liquid surface tracking with error compensation}},
doi = {10.1145/2461912.2461991},
volume = {32},
year = {2013},
}
@article{2469,
abstract = {Cadherins are transmembrane proteins that mediate cell–cell adhesion in animals. By regulating contact formation and stability, cadherins play a crucial role in tissue morphogenesis and homeostasis. Here, we review the three major unctions of cadherins in cell–cell contact formation and stability. Two of those functions lead to a decrease in interfacial ension at the forming cell–cell contact, thereby promoting contact expansion — first, by providing adhesion tension that lowers interfacial tension at the cell–cell contact, and second, by signaling to the actomyosin cytoskeleton in order to reduce cortex tension and thus interfacial tension at the contact. The third function of cadherins in cell–cell contact formation is to stabilize the contact by resisting mechanical forces that pull on the contact.},
author = {Maître, Jean-Léon and Heisenberg, Carl-Philipp J},
journal = {Current Biology},
number = {14},
pages = {R626 -- R633},
publisher = {Cell Press},
title = {{Three functions of cadherins in cell adhesion}},
doi = {10.1016/j.cub.2013.06.019},
volume = {23},
year = {2013},
}
@article{2470,
abstract = {Background:Auxin binding protein 1 (ABP1) is a putative auxin receptor and its function is indispensable for plant growth and development. ABP1 has been shown to be involved in auxin-dependent regulation of cell division and expansion, in plasma-membrane-related processes such as changes in transmembrane potential, and in the regulation of clathrin-dependent endocytosis. However, the ABP1-regulated downstream pathway remains elusive.Methodology/Principal Findings:Using auxin transport assays and quantitative analysis of cellular morphology we show that ABP1 regulates auxin efflux from tobacco BY-2 cells. The overexpression of ABP1can counterbalance increased auxin efflux and auxin starvation phenotypes caused by the overexpression of PIN auxin efflux carrier. Relevant mechanism involves the ABP1-controlled vesicle trafficking processes, including positive regulation of endocytosis of PIN auxin efflux carriers, as indicated by fluorescence recovery after photobleaching (FRAP) and pharmacological manipulations.Conclusions/Significance:The findings indicate the involvement of ABP1 in control of rate of auxin transport across plasma membrane emphasizing the role of ABP1 in regulation of PIN activity at the plasma membrane, and highlighting the relevance of ABP1 for the formation of developmentally important, PIN-dependent auxin gradients.},
author = {Čovanová, Milada and Sauer, Michael and Rychtář, Jan and Friml, Jirí and Petrášek, Jan and Zažímalová, Eva},
journal = {PLoS One},
number = {7},
publisher = {Public Library of Science},
title = {{Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport in tobacco cells}},
doi = {10.1371/journal.pone.0070050},
volume = {8},
year = {2013},
}
@article{2471,
abstract = {The impact of disulfide bonds on protein stability goes beyond simple equilibrium thermodynamics effects associated with the conformational entropy of the unfolded state. Indeed, disulfide crosslinks may play a role in the prevention of dysfunctional association and strongly affect the rates of irreversible enzyme inactivation, highly relevant in biotechnological applications. While these kinetic-stability effects remain poorly understood, by analogy with proposed mechanisms for processes of protein aggregation and fibrillogenesis, we propose that they may be determined by the properties of sparsely-populated, partially-unfolded intermediates. Here we report the successful design, on the basis of high temperature molecular-dynamics simulations, of six thermodynamically and kinetically stabilized variants of phytase from Citrobacter braakii (a biotechnologically important enzyme) with one, two or three engineered disulfides. Activity measurements and 3D crystal structure determination demonstrate that the engineered crosslinks do not cause dramatic alterations in the native structure. The inactivation kinetics for all the variants displays a strongly non-Arrhenius temperature dependence, with the time-scale for the irreversible denaturation process reaching a minimum at a given temperature within the range of the denaturation transition. We show this striking feature to be a signature of a key role played by a partially unfolded, intermediate state/ensemble. Energetic and mutational analyses confirm that the intermediate is highly unfolded (akin to a proposed critical intermediate in the misfolding of the prion protein), a result that explains the observed kinetic stabilization. Our results provide a rationale for the kinetic-stability consequences of disulfide-crosslink engineering and an experimental methodology to arrive at energetic/structural descriptions of the sparsely populated and elusive intermediates that play key roles in irreversible protein denaturation.},
author = {Sanchez Romero, Inmaculada and Ariza, Antonio and Wilson, Keith and Skjøt, Michael and Vind, Jesper and De Maria, Leonardo and Skov, Lars and Sánchez Ruiz, Jose},
journal = {PLoS One},
number = {7},
publisher = {Public Library of Science},
title = {{Mechanism of protein kinetic stabilization by engineered disulfide crosslinks}},
doi = {10.1371/journal.pone.0070013},
volume = {8},
year = {2013},
}
@article{2472,
abstract = {Plant-specific PIN-formed (PIN) efflux transporters for the plant hormone auxin are required for tissue-specific directional auxin transport and cellular auxin homeostasis. The Arabidopsis PIN protein family has been shown to play important roles in developmental processes such as embryogenesis, organogenesis, vascular tissue differentiation, root meristem patterning and tropic growth. Here we analyzed roles of the less characterised Arabidopsis PIN6 auxin transporter. PIN6 is auxin-inducible and is expressed during multiple auxin-regulated developmental processes. Loss of pin6 function interfered with primary root growth and lateral root development. Misexpression of PIN6 affected auxin transport and interfered with auxin homeostasis in other growth processes such as shoot apical dominance, lateral root primordia development, adventitious root formation, root hair outgrowth and root waving. These changes in auxin-regulated growth correlated with a reduction in total auxin transport as well as with an altered activity of DR5-GUS auxin response reporter. Overall, the data indicate that PIN6 regulates auxin homeostasis during plant development.},
author = {Cazzonelli, Christopher and Vanstraelen, Marleen and Simon, Sibu and Yin, Kuide and Carron Arthur, Ashley and Nisar, Nazia and Tarle, Gauri and Cuttriss, Abby and Searle, Iain and Benková, Eva and Mathesius, Ulrike and Masle, Josette and Friml, Jirí and Pogson, Barry},
journal = {PLoS One},
number = {7},
publisher = {Public Library of Science},
title = {{Role of the Arabidopsis PIN6 auxin transporter in auxin homeostasis and auxin-mediated development}},
doi = {10.1371/journal.pone.0070069},
volume = {8},
year = {2013},
}
@article{2473,
abstract = {When a mutation with selective advantage s spreads through a panmictic population, it may cause two lineages at a linked locus to coalesce; the probability of coalescence is exp(−2rT), where T∼log(2Ns)/s is the time to fixation, N is the number of haploid individuals, and r is the recombination rate. Population structure delays fixation, and so weakens the effect of a selective sweep. However, favourable alleles spread through a spatially continuous population behind a narrow wavefront; ancestral lineages are confined at the tip of this front, and so coalesce rapidly. In extremely dense populations, coalescence is dominated by rare fluctuations ahead of the front. However, we show that for moderate densities, a simple quasi-deterministic approximation applies: the rate of coalescence within the front is λ∼2g(η)/(ρℓ), where ρ is the population density and is the characteristic scale of the wavefront; g(η) depends only on the strength of random drift, . The net effect of a sweep on coalescence also depends crucially on whether two lineages are ever both within the wavefront at the same time: even in the extreme case when coalescence within the front is instantaneous, the net rate of coalescence may be lower than in a single panmictic population. Sweeps can also have a substantial impact on the rate of gene flow. A single lineage will jump to a new location when it is hit by a sweep, with mean square displacement ; this can be substantial if the species’ range, L, is large, even if the species-wide rate of sweeps per map length, Λ/R, is small. This effect is half as strong in two dimensions. In contrast, the rate of coalescence between lineages, at random locations in space and on the genetic map, is proportional to (c/L)(Λ/R), where c is the wavespeed: thus, on average, one-dimensional structure is likely to reduce coalescence due to sweeps, relative to panmixis. In two dimensions, genes must move along the front before they can coalesce; this process is rapid, being dominated by rare fluctuations. This leads to a dramatically higher rate of coalescence within the wavefront than if lineages simply diffused along the front. Nevertheless, the net rate of coalescence due to a sweep through a two-dimensional population is likely to be lower than it would be with panmixis.},
author = {Barton, Nicholas H and Etheridge, Alison and Kelleher, Jerome and Véber, Amandine},
journal = {Theoretical Population Biology},
number = {8},
pages = {75 -- 89},
publisher = {Elsevier},
title = {{Genetic hitch-hiking in spatially extended populations}},
doi = {10.1016/j.tpb.2012.12.001},
volume = {87},
year = {2013},
}
@article{2516,
abstract = {We study the problem of object recognition for categories for which we have no training examples, a task also called zero-data or zero-shot learning. This situation has hardly been studied in computer vision research, even though it occurs frequently: the world contains tens of thousands of different object classes and for only few of them image collections have been formed and suitably annotated. To tackle the problem we introduce attribute-based classification: objects are identified based on a high-level description that is phrased in terms of semantic attributes, such as the object's color or shape. Because the identification of each such property transcends the specific learning task at hand, the attribute classifiers can be pre-learned independently, e.g. from existing image datasets unrelated to the current task. Afterwards, new classes can be detected based on their attribute representation, without the need for a new training phase. In this paper we also introduce a new dataset, Animals with Attributes, of over 30,000 images of 50 animal classes, annotated with 85 semantic attributes. Extensive experiments on this and two more datasets show that attribute-based classification indeed is able to categorize images without access to any training images of the target classes.},
author = {Lampert, Christoph and Nickisch, Hannes and Harmeling, Stefan},
journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
number = {3},
pages = {453 -- 465},
publisher = {IEEE},
title = {{Attribute-based classification for zero-shot learning of object categories}},
doi = {10.1109/TPAMI.2013.140},
volume = {36},
year = {2013},
}
@inproceedings{2517,
abstract = {Traditional formal methods are based on a Boolean satisfaction notion: a reactive system satisfies, or not, a given specification. We generalize formal methods to also address the quality of systems. As an adequate specification formalism we introduce the linear temporal logic LTL[F]. The satisfaction value of an LTL[F] formula is a number between 0 and 1, describing the quality of the satisfaction. The logic generalizes traditional LTL by augmenting it with a (parameterized) set F of arbitrary functions over the interval [0,1]. For example, F may contain the maximum or minimum between the satisfaction values of subformulas, their product, and their average. The classical decision problems in formal methods, such as satisfiability, model checking, and synthesis, are generalized to search and optimization problems in the quantitative setting. For example, model checking asks for the quality in which a specification is satisfied, and synthesis returns a system satisfying the specification with the highest quality. Reasoning about quality gives rise to other natural questions, like the distance between specifications. We formalize these basic questions and study them for LTL[F]. By extending the automata-theoretic approach for LTL to a setting that takes quality into an account, we are able to solve the above problems and show that reasoning about LTL[F] has roughly the same complexity as reasoning about traditional LTL.},
author = {Almagor, Shaull and Boker, Udi and Kupferman, Orna},
location = {Riga, Latvia},
number = {Part 2},
pages = {15 -- 27},
publisher = {Springer},
title = {{Formalizing and reasoning about quality}},
doi = {10.1007/978-3-642-39212-2_3},
volume = {7966},
year = {2013},
}
@inproceedings{2518,
abstract = {A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued constraint language, a fixed set of cost functions on a finite domain. An instance of the problem is specified by a sum of cost functions from the language with the goal to minimise the sum. We study which classes of finite-valued languages can be solved exactly by the basic linear programming relaxation (BLP). Thapper and Živný showed [20] that if BLP solves the language then the language admits a binary commutative fractional polymorphism. We prove that the converse is also true. This leads to a necessary and a sufficient condition which can be checked in polynomial time for a given language. In contrast, the previous necessary and sufficient condition due to [20] involved infinitely many inequalities. More recently, Thapper and Živný [21] showed (using, in particular, a technique introduced in this paper) that core languages that do not satisfy our condition are NP-hard. Taken together, these results imply that a finite-valued language can either be solved using Linear Programming or is NP-hard.},
author = {Kolmogorov, Vladimir},
location = {Riga, Latvia},
number = {1},
pages = {625 -- 636},
publisher = {Springer},
title = {{The power of linear programming for finite-valued CSPs: A constructive characterization}},
doi = {10.1007/978-3-642-39206-1_53},
volume = {7965},
year = {2013},
}
@inproceedings{2520,
abstract = {We propose a probabilistic model to infer supervised latent variables in
the Hamming space from observed data. Our model allows simultaneous
inference of the number of binary latent variables, and their values. The
latent variables preserve neighbourhood structure of the data in a sense
that objects in the same semantic concept have similar latent values, and
objects in different concepts have dissimilar latent values. We formulate
the supervised infinite latent variable problem based on an intuitive
principle of pulling objects together if they are of the same type, and
pushing them apart if they are not. We then combine this principle with a
flexible Indian Buffet Process prior on the latent variables. We show that
the inferred supervised latent variables can be directly used to perform a
nearest neighbour search for the purpose of retrieval. We introduce a new
application of dynamically extending hash codes, and show how to
effectively couple the structure of the hash codes with continuously
growing structure of the neighbourhood preserving infinite latent feature
space.},
author = {Quadrianto, Novi and Sharmanska, Viktoriia and Knowles, David and Ghahramani, Zoubin},
booktitle = {Proceedings of the 29th conference uncertainty in Artificial Intelligence},
isbn = {9780974903996},
location = {Bellevue, WA, United States},
pages = {527 -- 536},
publisher = {AUAI Press},
title = {{The supervised IBP: Neighbourhood preserving infinite latent feature models}},
year = {2013},
}
@article{2698,
abstract = {We consider non-interacting particles subject to a fixed external potential V and a self-generated magnetic field B. The total energy includes the field energy β∫B2 and we minimize over all particle states and magnetic fields. In the case of spin-1/2 particles this minimization leads to the coupled Maxwell-Pauli system. The parameter β tunes the coupling strength between the field and the particles and it effectively determines the strength of the field. We investigate the stability and the semiclassical asymptotics, h→0, of the total ground state energy E(β,h,V). The relevant parameter measuring the field strength in the semiclassical limit is κ=βh. We are not able to give the exact leading order semiclassical asymptotics uniformly in κ or even for fixed κ. We do however give upper and lower bounds on E with almost matching dependence on κ. In the simultaneous limit h→0 and κ→∞ we show that the standard non-magnetic Weyl asymptotics holds. The same result also holds for the spinless case, i.e. where the Pauli operator is replaced by the Schrödinger operator.},
author = {Erdös, László and Fournais, Søren and Solovej, Jan},
journal = {Journal of the European Mathematical Society},
number = {6},
pages = {2093 -- 2113},
publisher = {European Mathematical Society},
title = {{Stability and semiclassics in self-generated fields}},
doi = {10.4171/JEMS/416},
volume = {15},
year = {2013},
}
@inproceedings{2718,
abstract = {Even though both population and quantitative genetics, and evolutionary computation, deal with the same questions, they have developed largely independently of each other. I review key results from each field, emphasising those that apply independently of the (usually unknown) relation between genotype and phenotype. The infinitesimal model provides a simple framework for predicting the response of complex traits to selection, which in biology has proved remarkably successful. This allows one to choose the schedule of population sizes and selection intensities that will maximise the response to selection, given that the total number of individuals realised, C = ∑t Nt, is constrained. This argument shows that for an additive trait (i.e., determined by the sum of effects of the genes), the optimum population size and the maximum possible response (i.e., the total change in trait mean) are both proportional to √C.},
author = {Barton, Nicholas H and Paixao, Tiago},
booktitle = {Proceedings of the 15th annual conference on Genetic and evolutionary computation},
location = {Amsterdam, Netherlands},
pages = {1573 -- 1580},
publisher = {ACM},
title = {{Can quantitative and population genetics help us understand evolutionary computation?}},
doi = {10.1145/2463372.2463568},
year = {2013},
}
@inproceedings{2719,
abstract = {Prediction of the evolutionary process is a long standing problem both in the theory of evolutionary biology and evolutionary computation (EC). It has long been realized that heritable variation is crucial to both the response to selection and the success of genetic algorithms. However, not all variation contributes in the same way to the response. Quantitative genetics has developed a large body of work trying to estimate and understand how different components of the variance in fitness in the population contribute to the response to selection. We illustrate how to apply some concepts of quantitative genetics to the analysis of genetic algorithms. In particular, we derive estimates for the short term prediction of the response to selection and we use variance decomposition to gain insight on local aspects of the landscape. Finally, we propose a new population based genetic algorithm that uses these methods to improve its operation.},
author = {Paixao, Tiago and Barton, Nicholas H},
booktitle = {Proceedings of the 15th annual conference on Genetic and evolutionary computation},
location = {Amsterdam, Netherlands},
pages = {845 -- 852},
publisher = {ACM},
title = {{A variance decomposition approach to the analysis of genetic algorithms}},
doi = {10.1145/2463372.2463470},
year = {2013},
}
@article{2720,
abstract = {Knowledge of the rate and fitness effects of mutations is essential for understanding the process of evolution. Mutations are inherently difficult to study because they are rare and are frequently eliminated by natural selection. In the ciliate Tetrahymena thermophila, mutations can accumulate in the germline genome without being exposed to selection. We have conducted a mutation accumulation (MA) experiment in this species. Assuming that all mutations are deleterious and have the same effect, we estimate that the deleterious mutation rate per haploid germline genome per generation is U = 0.0047 (95% credible interval: 0.0015, 0.0125), and that germline mutations decrease fitness by s = 11% when expressed in a homozygous state (95% CI: 4.4%, 27%). We also estimate that deleterious mutations are partially recessive on average (h = 0.26; 95% CI: –0.022, 0.62) and that the rate of lethal mutations is <10% of the deleterious mutation rate. Comparisons between the observed evolutionary responses in the germline and somatic genomes and the results from individual-based simulations of MA suggest that the two genomes have similar mutational parameters. These are the first estimates of the deleterious mutation rate and fitness effects from the eukaryotic supergroup Chromalveolata and are within the range of those of other eukaryotes.},
author = {Long, Hongan and Paixao, Tiago and Azevedo, Ricardo and Zufall, Rebecca},
journal = {Genetics},
number = {2},
pages = {527--540},
publisher = {Genetics Society of America},
title = {{Accumulation of spontaneous mutations in the ciliate Tetrahymena thermophila}},
doi = {10.1534/genetics.113.153536},
volume = {195},
year = {2013},
}
@article{2782,
abstract = {We consider random n×n matrices of the form (XX*+YY*)^{-1/2}YY*(XX*+YY*)^{-1/2}, where X and Y have independent entries with zero mean and variance one. These matrices are the natural generalization of the Gaussian case, which are known as MANOVA matrices and which have joint eigenvalue density given by the third classical ensemble, the Jacobi ensemble. We show that, away from the spectral edge, the eigenvalue density converges to the limiting density of the Jacobi ensemble even on the shortest possible scales of order 1/n (up to log n factors). This result is the analogue of the local Wigner semicircle law and the local Marchenko-Pastur law for general MANOVA matrices.},
author = {Erdös, László and Farrell, Brendan},
journal = {Journal of Statistical Physics},
number = {6},
pages = {1003 -- 1032},
publisher = {Springer},
title = {{Local eigenvalue density for general MANOVA matrices}},
doi = {10.1007/s10955-013-0807-8},
volume = {152},
year = {2013},
}
@article{2806,
abstract = {A novel Taylor-Couette system has been constructed for investigations of transitional as well as high Reynolds number turbulent flows in very large aspect ratios. The flexibility of the setup enables studies of a variety of problems regarding hydrodynamic instabilities and turbulence in rotating flows. The inner and outer cylinders and the top and bottom endplates can be rotated independently with rotation rates of up to 30 Hz, thereby covering five orders of magnitude in Reynolds numbers (Re = 101-106). The radius ratio can be easily changed, the highest realized one is η = 0.98 corresponding to an aspect ratio of 260 gap width in the vertical and 300 in the azimuthal direction. For η < 0.98 the aspect ratio can be dynamically changed during measurements and complete transparency in the radial direction over the full length of the cylinders is provided by the usage of a precision glass inner cylinder. The temperatures of both cylinders are controlled independently. Overall this apparatus combines an unmatched variety in geometry, rotation rates, and temperatures, which is provided by a sophisticated high-precision bearing system. Possible applications are accurate studies of the onset of turbulence and spatio-temporal intermittent flow patterns in very large domains, transport processes of turbulence at high Re, the stability of Keplerian flows for different boundary conditions, and studies of baroclinic instabilities.},
author = {Avila, Kerstin and Hof, Björn},
journal = {Review of Scientific Instruments},
number = {6},
publisher = {American Institute of Physics},
title = {{High-precision Taylor-Couette experiment to study subcritical transitions and the role of boundary conditions and size effects}},
doi = {10.1063/1.4807704},
volume = {84},
year = {2013},
}
@inproceedings{2807,
abstract = {We consider several basic problems of algebraic topology, with connections to combinatorial and geometric questions, from the point of view of computational complexity. The extension problem asks, given topological spaces X; Y , a subspace A ⊆ X, and a (continuous) map f : A → Y , whether f can be extended to a map X → Y . For computational purposes, we assume that X and Y are represented as finite simplicial complexes, A is a subcomplex of X, and f is given as a simplicial map. In this generality the problem is undecidable, as follows from Novikov's result from the 1950s on uncomputability of the fundamental group π1(Y ). We thus study the problem under the assumption that, for some k ≥ 2, Y is (k - 1)-connected; informally, this means that Y has \no holes up to dimension k-1" (a basic example of such a Y is the sphere Sk). We prove that, on the one hand, this problem is still undecidable for dimX = 2k. On the other hand, for every fixed k ≥ 2, we obtain an algorithm that solves the extension problem in polynomial time assuming Y (k - 1)-connected and dimX ≤ 2k - 1. For dimX ≤ 2k - 2, the algorithm also provides a classification of all extensions up to homotopy (continuous deformation). This relies on results of our SODA 2012 paper, and the main new ingredient is a machinery of objects with polynomial-time homology, which is a polynomial-time analog of objects with effective homology developed earlier by Sergeraert et al. We also consider the computation of the higher homotopy groups πk(Y ), k ≥ 2, for a 1-connected Y . Their computability was established by Brown in 1957; we show that πk(Y ) can be computed in polynomial time for every fixed k ≥ 2. On the other hand, Anick proved in 1989 that computing πk(Y ) is #P-hard if k is a part of input, where Y is a cell complex with certain rather compact encoding. We strengthen his result to #P-hardness for Y given as a simplicial complex. },
author = {Čadek, Martin and Krcál, Marek and Matoušek, Jiří and Vokřínek, Lukáš and Wagner, Uli},
booktitle = {45th Annual ACM Symposium on theory of computing},
location = {Palo Alto, CA, United States},
pages = {595 -- 604},
publisher = {ACM},
title = {{Extending continuous maps: Polynomiality and undecidability}},
doi = {10.1145/2488608.2488683},
year = {2013},
}
@article{2808,
abstract = {In order to establish a reference for analysis of the function of auxin and the auxin biosynthesis regulators SHORT INTERNODE/ STYLISH (SHI/STY) during Physcomitrella patens reproductive development, we have described male (antheridial) and female (archegonial) development in detail, including temporal and positional information of organ initiation. This has allowed us to define discrete stages of organ morphogenesis and to show that reproductive organ development in P. patens is highly organized and that organ phyllotaxis differs between vegetative and reproductive development. Using the PpSHI1 and PpSHI2 reporter and knockout lines, the auxin reporters GmGH3pro:GUS and PpPINApro:GFP-GUS, and the auxin-conjugating transgene PpSHI2pro:IAAL, we could show that the PpSHI genes, and by inference also auxin, play important roles for reproductive organ development in moss. The PpSHI genes are required for the apical opening of the reproductive organs, the final differentiation of the egg cell, and the progression of canal cells into a cell death program. The apical cells of the archegonium, the canal cells, and the egg cell are also sites of auxin responsiveness and are affected by reduced levels of active auxin, suggesting that auxin mediates PpSHI function in the reproductive organs.},
author = {Landberg, Katarina and Pederson, Eric and Viaene, Tom and Bozorg, Behruz and Friml, Jirí and Jönsson, Henrik and Thelander, Mattias and Sundberg, Eva},
journal = {Plant Physiology},
number = {3},
pages = {1406 -- 1419},
publisher = {American Society of Plant Biologists},
title = {{The moss physcomitrella patens reproductive organ development is highly organized, affected by the two SHI/STY genes and by the level of active auxin in the SHI/STY expression domain}},
doi = {10.1104/pp.113.214023},
volume = {162},
year = {2013},
}
@article{2810,
abstract = {The epistatic interactions that underlie evolutionary constraint have mainly been studied for constant external conditions. However, environmental changes may modulate epistasis and hence affect genetic constraints. Here we investigate genetic constraints in the adaptive evolution of a novel regulatory function in variable environments, using the lac repressor, LacI, as a model system. We have systematically reconstructed mutational trajectories from wild type LacI to three different variants that each exhibit an inverse response to the inducing ligand IPTG, and analyzed the higher-order interactions between genetic and environmental changes. We find epistasis to depend strongly on the environment. As a result, mutational steps essential to inversion but inaccessible by positive selection in one environment, become accessible in another. We present a graphical method to analyze the observed complex higher-order interactions between multiple mutations and environmental change, and show how the interactions can be explained by a combination of mutational effects on allostery and thermodynamic stability. This dependency of genetic constraint on the environment should fundamentally affect evolutionary dynamics and affects the interpretation of phylogenetic data.},
author = {De Vos, Marjon and Poelwijk, Frank and Battich, Nico and Ndika, Joseph and Tans, Sander},
journal = {PLoS Genetics},
number = {6},
publisher = {Public Library of Science},
title = {{Environmental dependence of genetic constraint}},
doi = {10.1371/journal.pgen.1003580},
volume = {9},
year = {2013},
}
@article{2811,
abstract = {In pipe, channel, and boundary layer flows turbulence first occurs intermittently in space and time: at moderate Reynolds numbers domains of disordered turbulent motion are separated by quiescent laminar regions. Based on direct numerical simulations of pipe flow we argue here that the spatial intermittency has its origin in a nearest neighbor interaction between turbulent regions. We further show that in this regime turbulent flows are intrinsically intermittent with a well-defined equilibrium turbulent fraction but without ever assuming a steady pattern. This transition scenario is analogous to that found in simple models such as coupled map lattices. The scaling observed implies that laminar intermissions of the turbulent flow will persist to arbitrarily large Reynolds numbers.},
author = {Avila, Marc and Hof, Björn},
journal = {Physical Review E},
number = {6},
publisher = {American Institute of Physics},
title = {{Nature of laminar-turbulence intermittency in shear flows}},
doi = {10.1103/PhysRevE.87.063012},
volume = {87},
year = {2013},
}
@inproceedings{2812,
abstract = {We consider the problem of deciding whether the persistent homology group of a simplicial pair (K, L) can be realized as the homology H* (X) of some complex X with L ⊂ X ⊂ K. We show that this problem is NP-complete even if K is embedded in ℝ3. As a consequence, we show that it is NP-hard to simplify level and sublevel sets of scalar functions on S3 within a given tolerance constraint. This problem has relevance to the visualization of medical images by isosurfaces. We also show an implication to the theory of well groups of scalar functions: not every well group can be realized by some level set, and deciding whether a well group can be realized is NP-hard.},
author = {Attali, Dominique and Bauer, Ulrich and Devillers, Olivier and Glisse, Marc and Lieutier, André},
booktitle = {Proceedings of the 29th annual symposium on Computational Geometry},
location = {Rio de Janeiro, Brazil},
pages = {117 -- 125},
publisher = {ACM},
title = {{Homological reconstruction and simplification in R3}},
doi = {10.1145/2462356.2462373},
year = {2013},
}
@article{2813,
abstract = {Turbulence is ubiquitous in nature, yet even for the case of ordinary Newtonian fluids like water, our understanding of this phenomenon is limited. Many liquids of practical importance are more complicated (e.g., blood, polymer melts, paints), however; they exhibit elastic as well as viscous characteristics, and the relation between stress and strain is nonlinear. We demonstrate here for a model system of such complex fluids that at high shear rates, turbulence is not simply modified as previously believed but is suppressed and replaced by a different type of disordered motion, elasto-inertial turbulence. Elasto-inertial turbulence is found to occur at much lower Reynolds numbers than Newtonian turbulence, and the dynamical properties differ significantly. The friction scaling observed coincides with the so-called "maximum drag reduction" asymptote, which is exhibited by a wide range of viscoelastic fluids.},
author = {Samanta, Devranjan and Dubief, Yves and Holzner, Markus and Schäfer, Christof and Morozov, Alexander and Wagner, Christian and Hof, Björn},
journal = {PNAS},
number = {26},
pages = {10557 -- 10562},
publisher = {National Academy of Sciences},
title = {{Elasto-inertial turbulence}},
doi = {10.1073/pnas.1219666110},
volume = {110},
year = {2013},
}
@article{2814,
abstract = {We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between the tester and the system, where the system state space is partitioned according to some coverage criterion and the objective of the tester is to maximize the set of partitions (or coverage goals) visited during the game. We show the complexity of the maximal coverage problem for non-deterministic systems is PSPACE-complete, but is NP-complete for deterministic systems. For the special case of non-deterministic systems with a re-initializing "reset" action, which represent running a new test input on a re-initialized system, we show that the complexity is coNP-complete. Our proof technique for reset games uses randomized testing strategies that circumvent the exponentially large memory requirement of deterministic testing strategies. We also discuss the memory requirement for deterministic strategies and extensions of our results to other models, such as pushdown systems and timed systems.},
author = {Chatterjee, Krishnendu and Alfaro, Luca and Majumdar, Ritankar},
journal = {International Journal of Foundations of Computer Science},
number = {2},
pages = {165 -- 185},
publisher = {World Scientific Publishing},
title = {{The complexity of coverage}},
doi = {10.1142/S0129054113400066},
volume = {24},
year = {2013},
}
@article{2815,
abstract = {The fact that a sum of isotropic Gaussian kernels can have more modes than kernels is surprising. Extra (ghost) modes do not exist in ℝ1 and are generally not well studied in higher dimensions. We study a configuration of n+1 Gaussian kernels for which there are exactly n+2 modes. We show that all modes lie on a finite set of lines, which we call axes, and study the restriction of the Gaussian mixture to these axes in order to discover that there are an exponential number of critical points in this configuration. Although the existence of ghost modes remained unknown due to the difficulty of finding examples in ℝ2, we show that the resilience of ghost modes grows like the square root of the dimension. In addition, we exhibit finite configurations of isotropic Gaussian kernels with superlinearly many modes.},
author = {Edelsbrunner, Herbert and Fasy, Brittany Terese and Rote, Günter},
journal = {Discrete & Computational Geometry},
number = {4},
pages = {797 -- 822},
publisher = {Springer},
title = {{Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions}},
doi = {10.1007/s00454-013-9517-x},
volume = {49},
year = {2013},
}
@article{2816,
abstract = {In solid tumors, targeted treatments can lead to dramatic regressions, but responses are often short-lived because resistant cancer cells arise. The major strategy proposed for overcoming resistance is combination therapy. We present a mathematical model describing the evolutionary dynamics of lesions in response to treatment. We first studied 20 melanoma patients receiving vemurafenib. We then applied our model to an independent set of pancreatic, colorectal, and melanoma cancer patients with metastatic disease. We find that dual therapy results in long-term disease control for most patients, if there are no single mutations that cause cross-resistance to both drugs; in patients with large disease burden, triple therapy is needed. We also find that simultaneous therapy with two drugs is much more effective than sequential therapy. Our results provide realistic expectations for the efficacy of new drug combinations and inform the design of trials for new cancer therapeutics.},
author = {Božić, Ivana and Reiter, Johannes and Allen, Benjamin and Antal, Tibor and Chatterjee, Krishnendu and Shah, Preya and Moon, Yo and Yaqubie, Amin and Kelly, Nicole and Le, Dung and Lipson, Evan and Chapman, Paul and Diaz, Luis and Vogelstein, Bert and Nowak, Martin},
journal = {eLife},
publisher = {eLife Sciences Publications},
title = {{Evolutionary dynamics of cancer in response to targeted combination therapy}},
doi = {10.7554/eLife.00747},
volume = {2},
year = {2013},
}
@article{2817,
abstract = {The basic idea of evolutionary game theory is that payoff determines reproductive rate. Successful individuals have a higher payoff and produce more offspring. But in evolutionary and ecological situations there is not only reproductive rate but also carrying capacity. Individuals may differ in their exposure to density limiting effects. Here we explore an alternative approach to evolutionary game theory by assuming that the payoff from the game determines the carrying capacity of individual phenotypes. Successful strategies are less affected by density limitation (crowding) and reach higher equilibrium abundance. We demonstrate similarities and differences between our framework and the standard replicator equation. Our equation is defined on the positive orthant, instead of the simplex, but has the same equilibrium points as the replicator equation. Linear stability analysis produces the classical conditions for asymptotic stability of pure strategies, but the stability properties of internal equilibria can differ in the two frameworks. For example, in a two-strategy game with an internal equilibrium that is always stable under the replicator equation, the corresponding equilibrium can be unstable in the new framework resulting in a limit cycle.},
author = {Novak, Sebastian and Chatterjee, Krishnendu and Nowak, Martin},
journal = {Journal of Theoretical Biology},
pages = {26 -- 34},
publisher = {Elsevier},
title = {{Density games}},
doi = {10.1016/j.jtbi.2013.05.029},
volume = {334},
year = {2013},
}
@article{2818,
abstract = {Models of neural responses to stimuli with complex spatiotemporal correlation structure often assume that neurons are selective for only a small number of linear projections of a potentially high-dimensional input. In this review, we explore recent modeling approaches where the neural response depends on the quadratic form of the input rather than on its linear projection, that is, the neuron is sensitive to the local covariance structure of the signal preceding the spike. To infer this quadratic dependence in the presence of arbitrary (e.g., naturalistic) stimulus distribution, we review several inference methods, focusing in particular on two information theory–based approaches (maximization of stimulus energy and of noise entropy) and two likelihood-based approaches (Bayesian spike-triggered covariance and extensions of generalized linear models). We analyze the formal relationship between the likelihood-based and information-based approaches to demonstrate how they lead to consistent inference. We demonstrate the practical feasibility of these procedures by using model neurons responding to a flickering variance stimulus.},
author = {Rajan, Kanaka and Marre, Olivier and Tkacik, Gasper},
journal = {Neural Computation},
number = {7},
pages = {1661 -- 1692},
publisher = {MIT Press },
title = {{Learning quadratic receptive fields from neural responses to natural stimuli}},
doi = {10.1162/NECO_a_00463},
volume = {25},
year = {2013},
}
@inproceedings{2819,
abstract = {We introduce quantatitive timed refinement metrics and quantitative timed simulation functions, incorporating zenoness checks, for timed systems. These functions assign positive real numbers between zero and infinity which quantify the timing mismatches between two timed systems, amongst non-zeno runs. We quantify timing mismatches in three ways: (1) the maximum timing mismatch that can arise, (2) the "steady-state" maximum timing mismatches, where initial transient timing mismatches are ignored; and (3) the (long-run) average timing mismatches amongst two systems. These three kinds of mismatches constitute three important types of timing differences. Our event times are the global times, measured from the start of the system execution, not just the time durations of individual steps. We present algorithms over timed automata for computing the three quantitative simulation functions to within any desired degree of accuracy. In order to compute the values of the quantitative simulation functions, we use a game theoretic formulation. We introduce two new kinds of objectives for two player games on finite state game graphs: (1) eventual debit-sum level objectives, and (2) average debit-sum level objectives. We present algorithms for computing the optimal values for these objectives for player 1, and then use these algorithms to compute the values of the quantitative timed simulation functions. },
author = {Chatterjee, Krishnendu and Prabhu, Vinayak},
booktitle = {Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control},
location = {Philadelphia, PA USA},
pages = {273 -- 282},
publisher = {Springer},
title = {{Quantitative timed simulation functions and refinement metrics for real-time systems}},
doi = {10.1145/2461328.2461370},
volume = {1},
year = {2013},
}
@inproceedings{2820,
abstract = {In this paper, we introduce the powerful framework of graph games for the analysis of real-time scheduling with firm deadlines. We introduce a novel instance of a partial-observation game that is suitable for this purpose, and prove decidability of all the involved decision problems. We derive a graph game that allows the automated computation of the competitive ratio (along with an optimal witness algorithm for the competitive ratio) and establish an NP-completeness proof for the graph game problem. For a given on-line algorithm, we present polynomial time solution for computing (i) the worst-case utility; (ii) the worst-case utility ratio w.r.t. a clairvoyant off-line algorithm; and (iii) the competitive ratio. A major strength of the proposed approach lies in its flexibility w.r.t. incorporating additional constraints on the adversary and/or the algorithm, including limited maximum or average load, finiteness of periods of overload, etc., which are easily added by means of additional instances of standard objective functions for graph games. },
author = {Chatterjee, Krishnendu and Kößler, Alexander and Schmid, Ulrich},
booktitle = {Proceedings of the 16th International conference on Hybrid systems: Computation and control},
isbn = {978-1-4503-1567-8 },
location = {Philadelphia, PA, United States},
pages = {163 -- 172},
publisher = {ACM},
title = {{Automated analysis of real-time scheduling using graph games}},
doi = {10.1145/2461328.2461356},
year = {2013},
}
@article{2821,
abstract = {Many key aspects of plant development are regulated by the polarized transport of the phytohormone auxin. Cellular auxin efflux, the rate-limiting step in this process, has been shown to rely on the coordinated action of PIN-formed (PIN) and B-type ATP binding cassette (ABCB) carriers. Here, we report that polar auxin transport in the Arabidopsis thaliana root also requires the action of a Major Facilitator Superfamily (MFS) transporter, Zinc-Induced Facilitator-Like 1 (ZIFL1). Sequencing, promoter-reporter, and fluorescent protein fusion experiments indicate that the full-length ZIFL1.1 protein and a truncated splice isoform, ZIFL1.3, localize to the tonoplast of root cells and the plasma membrane of leaf stomatal guard cells, respectively. Using reverse genetics, we show that the ZIFL1.1 transporter regulates various root auxin-related processes, while the ZIFL1.3 isoform mediates drought tolerance by regulating stomatal closure. Auxin transport and immunolocalization assays demonstrate that ZIFL1.1 indirectly modulates cellular auxin efflux during shootward auxin transport at the root tip, likely by regulating plasma membrane PIN2 abundance. Finally, heterologous expression in yeast revealed that ZIFL1.1 and ZIFL1.3 share H+-coupled K+ transport activity. Thus, by determining the subcellular and tissue distribution of two isoforms, alternative splicing dictates a dual function for the ZIFL1 transporter. We propose that this MFS carrier regulates stomatal movements and polar auxin transport by modulating potassium and proton fluxes in Arabidopsis cells.},
author = {Remy, Estelle and Cabrito, Tânia and Baster, Pawel and Batista, Rita and Teixeira, Miguel and Friml, Jirí and Sá Correia, Isabel and Duque, Paula},
journal = {Plant Cell},
number = {3},
pages = {901 -- 926},
publisher = {American Society of Plant Biologists},
title = {{A major facilitator superfamily transporter plays a dual role in polar auxin transport and drought stress tolerance in Arabidopsis}},
doi = {10.1105/tpc.113.110353},
volume = {25},
year = {2013},
}
@article{2822,
abstract = {Identification of genes that control root system architecture in crop plants requires innovations that enable high-throughput and accurate measurements of root system architecture through time. We demonstrate the ability of a semiautomated 3D in vivo imaging and digital phenotyping pipeline to interrogate the quantitative genetic basis of root system growth in a rice biparental mapping population, Bala x Azucena. We phenotyped >1,400 3D root models and >57,000 2D images for a suite of 25 traits that quantified the distribution, shape, extent of exploration, and the intrinsic size of root networks at days 12, 14, and 16 of growth in a gellan gum medium. From these data we identified 89 quantitative trait loci, some of which correspond to those found previously in soil-grown plants, and provide evidence for genetic tradeoffs in root growth allocations, such as between the extent and thoroughness of exploration. We also developed a multivariate method for generating and mapping central root architecture phenotypes and used it to identify five major quantitative trait loci (r2 = 24-37%), two of which were not identified by our univariate analysis. Our imaging and analytical platform provides a means to identify genes with high potential for improving root traits and agronomic qualities of crops.},
author = {Topp, Christopher and Iyer Pascuzzi, Anjali and Anderson, Jill and Lee, Cheng and Zurek, Paul and Symonova, Olga and Zheng, Ying and Bucksch, Alexander and Mileyko, Yuriy and Galkovskyi, Taras and Moore, Brad and Harer, John and Edelsbrunner, Herbert and Mitchell Olds, Thomas and Weitz, Joshua and Benfey, Philip},
journal = {PNAS},
number = {18},
pages = {E1695 -- E1704},
publisher = {National Academy of Sciences},
title = {{3D phenotyping and quantitative trait locus mapping identify core regions of the rice genome controlling root architecture}},
doi = {10.1073/pnas.1304354110},
volume = {110},
year = {2013},
}
@article{2823,
abstract = {The primary goal of restoration is to create self-sustaining ecological communities that are resilient to periodic disturbance. Currently, little is known about how restored communities respond to disturbance events such as fire and how this response compares to remnant vegetation. Following the 2003 fires in south-eastern Australia we examined the post-fire response of revegetation plantings and compared this to remnant vegetation. Ten burnt and 10 unburnt (control) sites were assessed for each of three types of vegetation (direct seeding revegetation, revegetation using nursery seedlings (tubestock) and remnant woodland). Sixty sampling sites were surveyed 6months after fire to quantify the initial survival of mid- and overstorey plant species in each type of vegetation. Three and 5years after fire all sites were resurveyed to assess vegetation structure, species diversity and vigour, as well as indicators of soil function. Overall, revegetation showed high (>60%) post-fire survival, but this varied among species depending on regeneration strategy (obligate seeder or resprouter). The native ground cover, mid- and overstorey in both types of plantings showed rapid recovery of vegetation structure and cover within 3years of fire. This recovery was similar to the burnt remnant woodlands. Non-native (exotic) ground cover initially increased after fire, but was no different in burnt and unburnt sites 5years after fire. Fire had no effect on species richness, but burnt direct seeding sites had reduced species diversity (Simpson's Diversity Index) while diversity was higher in burnt remnant woodlands. Indices of soil function in all types of vegetation had recovered to levels found in unburnt sites 5years after fire. These results indicate that even young revegetation (stands <10years old) showed substantial recovery from disturbance by fire. This suggests that revegetation can provide an important basis for restoring woodland communities in the fire-prone Australian environment.},
author = {Pickup, Melinda and Wilson, Susie and Freudenberger, David and Nicholls, Nick and Gould, Lori and Hnatiuk, Sarah and Delandre, Jeni},
journal = {Austral Ecology},
number = {3},
pages = {300 -- 312},
publisher = {Wiley-Blackwell},
title = {{Post-fire recovery of revegetated woodland communities in south-eastern Australia}},
doi = {10.1111/j.1442-9993.2012.02404.x},
volume = {38},
year = {2013},
}
@article{2824,
abstract = {We study synthesis of controllers for real-time systems, where the objective is to stay in a given safe set. The problem is solved by obtaining winning strategies in the setting of concurrent two player timed automaton games with safety objectives. To prevent a player from winning by blocking time, we restrict each player to strategies that ensure that the player cannot be responsible for causing a Zeno run. We construct winning strategies for the controller which require access only to (1) the system clocks (thus, controllers which require their own internal infinitely precise clocks are not necessary), and (2) a logarithmic (in the number of clocks) number of memory bits (i.e. a linear number of memory states). Precisely, we show that for safety objectives, a memory of size (3 + lg (| C | + 1)) bits suffices for winning controller strategies, where C is the set of clocks of the timed automaton game, significantly improving the previous known exponential memory states bound. We also settle the open question of whether winning region-based strategies require memory for safety objectives by showing with an example the necessity of memory for such strategies to win for safety objectives. Finally, we show that the decision problem of determining if there exists a receptive player-1 winning strategy for safety objectives is EXPTIME-complete over timed automaton games.},
author = {Chatterjee, Krishnendu and Prabhu, Vinayak},
journal = {Information and Computation},
pages = {83--119},
publisher = {Elsevier},
title = {{Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems}},
doi = {10.1016/j.ic.2013.04.003},
volume = {228-229},
year = {2013},
}