TY - GEN
AB - We consider partially observable Markov decision processes (POMDPs) with a set of target states and every transition is associated with an integer cost. The optimization objective we study asks to minimize the expected total cost till the target set is reached, while ensuring that the target set is reached almost-surely (with probability 1). We show that for integer costs approximating the optimal cost is undecidable. For positive costs, our results are as follows: (i) we establish matching lower and upper bounds for the optimal cost and the bound is double exponential; (ii) we show that the problem of approximating the optimal cost is decidable and present approximation algorithms developing on the existing algorithms for POMDPs with finite-horizon objectives. While the worst-case running time of our algorithm is double exponential, we also present efficient stopping criteria for the algorithm and show experimentally that it performs well in many examples of interest.
AU - Anonymous, 1
AU - Anonymous, 2
AU - Anonymous, 3
AU - Anonymous, 4
ID - 5425
SN - 2664-1690
TI - Optimal cost almost-sure reachability in POMDPs
ER -
TY - GEN
AB - We consider partially observable Markov decision processes (POMDPs), that are a standard framework for robotics applications to model uncertainties present in the real world, with temporal logic specifications. All temporal logic specifications in linear-time temporal logic (LTL) can be expressed as parity objectives. We study the qualitative analysis problem for POMDPs with parity objectives that asks whether there is a controller (policy) to ensure that the objective holds with probability 1 (almost-surely). While the qualitative analysis of POMDPs with parity objectives is undecidable, recent results show that when restricted to finite-memory policies the problem is EXPTIME-complete. While the problem is intractable in theory, we present a practical approach to solve the qualitative analysis problem. We designed several heuristics to deal with the exponential complexity, and have used our implementation on a number of well-known POMDP examples for robotics applications. Our results provide the first practical approach to solve the qualitative analysis of robot motion planning with LTL properties in the presence of uncertainty.
AU - Chatterjee, Krishnendu
AU - Chmelik, Martin
AU - Gupta, Raghav
AU - Kanodia, Ayush
ID - 5426
SN - 2664-1690
TI - Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
ER -
TY - GEN
AB - We consider graphs with n nodes together with their tree-decomposition that has b = O ( n ) bags and width t , on the standard RAM computational model with wordsize W = Θ (log n ) . Our contributions are two-fold: Our first contribution is an algorithm that given a graph and its tree-decomposition as input, computes a binary and balanced tree-decomposition of width at most 4 · t + 3 of the graph in O ( b ) time and space, improving a long-standing (from 1992) bound of O ( n · log n ) time for constant treewidth graphs. Our second contribution is on reachability queries for low treewidth graphs. We build on our tree-balancing algorithm and present a data-structure for graph reachability that requires O ( n · t 2 ) preprocessing time, O ( n · t ) space, and O ( d t/ log n e ) time for pair queries, and O ( n · t · log t/ log n ) time for single-source queries. For constant t our data-structure uses O ( n ) time for preprocessing, O (1) time for pair queries, and O ( n/ log n ) time for single-source queries. This is (asymptotically) optimal and is faster than DFS/BFS when answering more than a constant number of single-source queries.
AU - Chatterjee, Krishnendu
AU - Ibsen-Jensen, Rasmus
AU - Pavlogiannis, Andreas
ID - 5427
SN - 2664-1690
TI - Optimal tree-decomposition balancing and reachability on low treewidth graphs
ER -
TY - GEN
AB - Simulation is an attractive alternative for language inclusion for automata as it is an under-approximation of language inclusion, but usually has much lower complexity. For non-deterministic automata, while language inclusion is PSPACE-complete, simulation can be computed in polynomial time. Simulation has also been extended in two orthogonal directions, namely, (1) fair simulation, for simulation over specified set of infinite runs; and (2) quantitative simulation, for simulation between weighted automata. Again, while fair trace inclusion is PSPACE-complete, fair simulation can be computed in polynomial time. For weighted automata, the (quantitative) language inclusion problem is undecidable for mean-payoff automata and the decidability is open for discounted-sum automata, whereas the (quantitative) simulation reduce to mean-payoff games and discounted-sum games, which admit pseudo-polynomial time algorithms.
In this work, we study (quantitative) simulation for weighted automata with Büchi acceptance conditions, i.e., we generalize fair simulation from non-weighted automata to weighted automata. We show that imposing Büchi acceptance conditions on weighted automata changes many fundamental properties of the simulation games. For example, whereas for mean-payoff and discounted-sum games, the players do not need memory to play optimally; we show in contrast that for simulation games with Büchi acceptance conditions, (i) for mean-payoff objectives, optimal strategies for both players require infinite memory in general, and (ii) for discounted-sum objectives, optimal strategies need not exist for both players. While the simulation games with Büchi acceptance conditions are more complicated (e.g., due to infinite-memory requirements for mean-payoff objectives) as compared to their counterpart without Büchi acceptance conditions, we still present pseudo-polynomial time algorithms to solve simulation games with Büchi acceptance conditions for both weighted mean-payoff and weighted discounted-sum automata.
AU - Chatterjee, Krishnendu
AU - Henzinger, Thomas A
AU - Otop, Jan
AU - Velner, Yaron
ID - 5428
SN - 2664-1690
TI - Quantitative fair simulation games
ER -
TY - CONF
AB - A discrete spherical geodesic path between two voxels s and t lying on a discrete sphere is a/the 1-connected shortest path from s to t, comprising voxels of the discrete sphere intersected by the real plane passing through s, t, and the center of the sphere. We show that the set of sphere voxels intersected by the aforesaid real plane always contains a 1-connected cycle passing through s and t, and each voxel in this set lies within an isothetic distance of 32 from the concerned plane. Hence, to compute the path, the algorithm starts from s, and iteratively computes each voxel p of the path from the predecessor of p. A novel number-theoretic property and the 48-symmetry of discrete sphere are used for searching the 1-connected voxels comprising the path. The algorithm is output-sensitive, having its time and space complexities both linear in the length of the path. It can be extended for constructing 1-connected discrete 3D circles of arbitrary orientations, specified by a few appropriate input parameters. Experimental results and related analysis demonstrate its efficiency and versatility.
AU - Biswas, Ranita
AU - Bhowmick, Partha
ID - 5810
SN - 0302-9743
TI - On Finding Spherical Geodesic Paths and Circles in ℤ3
VL - 8668
ER -
TY - JOUR
AB - We consider homogeneous Bose gas in a large cubic box with periodic boundary conditions, at zero temperature. We analyze its excitation spectrum in a certain kind of a mean-field infinite-volume limit. We prove that under appropriate conditions the excitation spectrum has the form predicted by the Bogoliubov approximation. Our result can be viewed as an extension of the result of Seiringer (Commun. Math. Phys.306:565–578, 2011) to large volumes.
AU - Dereziński, Jan
AU - Napiórkowski, Marcin M
ID - 5813
IS - 12
JF - Annales Henri Poincaré
SN - 1424-0637
TI - Excitation spectrum of interacting bosons in the Mean-Field Infinite-Volume limit
VL - 15
ER -
TY - JOUR
AB - We demonstrate a many-atom-cavity system with a high-finesse dual-wavelength standing wave cavity in which all participating rubidium atoms are nearly identically coupled to a 780-nm cavity mode. This homogeneous coupling is enforced by a one-dimensional optical lattice formed by the field of a 1560-nm cavity mode.
AU - Lee, Jongmin
AU - Vrijsen, Geert
AU - Teper, Igor
AU - Onur Hosten
AU - Kasevich, Mark A
ID - 589
IS - 13
JF - Optics Letters
TI - Many-atom-cavity QED system with homogeneous atom-cavity coupling
VL - 39
ER -
TY - JOUR
AU - Linneweber, Gerit A.
AU - Jacobson, Jake
AU - Busch, Karl Emanuel
AU - Hudry, Bruno
AU - Christov, Christo P.
AU - Dormann, Dirk
AU - Yuan, Michaela
AU - Otani, Tomoki
AU - Knust, Elisabeth
AU - de Bono, Mario
AU - Miguel-Aliaga, Irene
ID - 6122
IS - 1-2
JF - Cell
SN - 0092-8674
TI - Neuronal control of metabolism through nutrient-dependent modulation of tracheal branching
VL - 156
ER -
TY - JOUR
AB - Despite the importance of G-protein coupled receptors (GPCRs) their biogenesis is poorly understood. Like vertebrates, C. elegans uses a large family of GPCRs as chemoreceptors. A subset of these receptors, such as ODR-10, requires the odr-4 and odr-8 genes to be appropriately localized to sensory cilia. The odr-4 gene encodes a conserved tail-anchored transmembrane protein; the molecular identity of odr-8 is unknown. Here, we show that odr-8 encodes the C. elegans ortholog of Ufm1-specific protease 2 (UfSP2). UfSPs are cysteine proteases identified biochemically by their ability to liberate the ubiquitin-like modifier Ufm1 from its pro-form and protein conjugates. ODR-8/UfSP2 and ODR-4 are expressed in the same set of twelve chemosensory neurons, and physically interact at the ER membrane. ODR-4 also binds ODR-10, suggesting that an ODR-4/ODR-8 complex promotes GPCR folding, maturation, or export from the ER. The physical interaction between human ODR4 and UfSP2 suggests that this complex's role in GPCR biogenesis may be evolutionarily conserved. Unexpectedly, mutant versions of ODR-8/UfSP2 lacking catalytic residues required for protease activity can rescue all odr-8 mutant phenotypes tested. Moreover, deleting C. elegans ufm-1 does not alter chemoreceptor traffic to cilia, either in wild type or in odr-8 mutants. Thus, UfSP2 proteins have protease- and Ufm1-independent functions in GPCR biogenesis.
AU - Chen, Changchun
AU - Itakura, Eisuke
AU - Weber, Katherine P.
AU - Hegde, Ramanujan S.
AU - de Bono, Mario
ID - 6124
IS - 3
JF - PLoS Genetics
SN - 1553-7404
TI - An ER complex of ODR-4 and ODR-8/Ufm1 specific protease 2 promotes GPCR maturation by a Ufm1-independent mechanism
VL - 10
ER -
TY - JOUR
AB - Aerobic animals constantly monitor and adapt to changes in O2 levels. The molecular mechanisms involved in sensing O2 are, however, incompletely understood. Previous studies showed that a hexacoordinated globin called GLB-5 tunes the dynamic range of O2-sensing neurons in natural C. elegans isolates, but is defective in the N2 lab reference strain (McGrath et al., 2009; Persson et al., 2009). GLB-5 enables a sharp behavioral switch when O2 changes between 21 and 17%. Here, we show that GLB-5 also confers rapid behavioral and cellular recovery from exposure to hypoxia. Hypoxia reconfigures O2-evoked Ca2+ responses in the URX O2 sensors, and GLB-5 enables rapid recovery of these responses upon re-oxygenation. Forward genetic screens indicate that GLB-5's effects on O2 sensing require PDL-1, the C. elegans ortholog of mammalian PrBP/PDE6δ protein. In mammals, PDE6δ regulates the traffic and activity of prenylated proteins (Zhang et al., 2004; Norton et al., 2005). PDL-1 promotes localization of GCY-33 and GCY-35, atypical soluble guanylate cyclases that act as O2 sensors, to the dendritic endings of URX and BAG neurons, where they colocalize with GLB-5. Both GCY-33 and GCY-35 are predicted to be prenylated. Dendritic localization is not essential for GCY-35 to function as an O2 sensor, but disrupting pdl-1 alters the URX neuron's O2 response properties. Functional GLB-5 can restore dendritic localization of GCY-33 in pdl-1 mutants, suggesting GCY-33 and GLB-5 are in a complex. Our data suggest GLB-5 and the soluble guanylate cyclases operate in close proximity to sculpt O2 responses.
AU - Gross, E.
AU - Soltesz, Z.
AU - Oda, S.
AU - Zelmanovich, V.
AU - Abergel, Z.
AU - de Bono, Mario
ID - 6126
IS - 50
JF - Journal of Neuroscience
SN - 0270-6474
TI - GLOBIN-5-dependent O2 responses are regulated by PDL-1/PrBP that targets prenylated soluble guanylate cyclases to dendritic endings
VL - 34
ER -
TY - CHAP
AB - Mechanically coupled cells can generate forces driving cell and tissue morphogenesis during development. Visualization and measuring of these forces is of major importance to better understand the complexity of the biomechanic processes that shape cells and tissues. Here, we describe how UV laser ablation can be utilized to quantitatively assess mechanical tension in different tissues of the developing zebrafish and in cultures of primary germ layer progenitor cells ex vivo.
AU - Smutny, Michael
AU - Behrndt, Martin
AU - Campinho, Pedro
AU - Ruprecht, Verena
AU - Heisenberg, Carl-Philipp J
ED - Nelson, Celeste
ID - 6178
SN - 1064-3745
T2 - Tissue Morphogenesis
TI - UV laser ablation to measure cell and tissue-generated forces in the zebrafish embryo in vivo and ex vivo
VL - 1189
ER -
TY - JOUR
AB - We prove the universality of the β-ensembles with convex analytic potentials and for any β >
0, i.e. we show that the spacing distributions of log-gases at any inverse temperature β coincide with those of the Gaussian β-ensembles.
AU - Erdös, László
AU - Bourgade, Paul
AU - Yau, Horng
ID - 2699
IS - 6
JF - Duke Mathematical Journal
TI - Universality of general β-ensembles
VL - 163
ER -
TY - JOUR
AB - Multi-dimensional mean-payoff and energy games provide the mathematical foundation for the quantitative study of reactive systems, and play a central role in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express ω ω -regular conditions. While in general, the winning strategies in such games may require infinite memory, for synthesis the most relevant problem is the construction of a finite-memory winning strategy (if one exists). Our main contributions are as follows. First, we show a tight exponential bound (matching upper and lower bounds) on the memory required for finite-memory winning strategies in both multi-dimensional mean-payoff and energy games along with parity objectives. This significantly improves the triple exponential upper bound for multi energy games (without parity) that could be derived from results in literature for games on vector addition systems with states. Second, we present an optimal symbolic and incremental algorithm to compute a finite-memory winning strategy (if one exists) in such games. Finally, we give a complete characterization of when finite memory of strategies can be traded off for randomness. In particular, we show that for one-dimension mean-payoff parity games, randomized memoryless strategies are as powerful as their pure finite-memory counterparts.
AU - Chatterjee, Krishnendu
AU - Randour, Mickael
AU - Raskin, Jean
ID - 2716
IS - 3-4
JF - Acta Informatica
TI - Strategy synthesis for multi-dimensional quantitative objectives
VL - 51
ER -
TY - JOUR
AB - A robust combiner for hash functions takes two candidate implementations and constructs a hash function which is secure as long as at least one of the candidates is secure. So far, hash function combiners only aim at preserving a single property such as collision-resistance or pseudorandomness. However, when hash functions are used in protocols like TLS they are often required to provide several properties simultaneously. We therefore put forward the notion of robust multi-property combiners and elaborate on different definitions for such combiners. We then propose a combiner that provably preserves (target) collision-resistance, pseudorandomness, and being a secure message authentication code. This combiner satisfies the strongest notion we propose, which requires that the combined function satisfies every security property which is satisfied by at least one of the underlying hash function. If the underlying hash functions have output length n, the combiner has output length 2 n. This basically matches a known lower bound for black-box combiners for collision-resistance only, thus the other properties can be achieved without penalizing the length of the hash values. We then propose a combiner which also preserves the property of being indifferentiable from a random oracle, slightly increasing the output length to 2 n+ω(log n). Moreover, we show how to augment our constructions in order to make them also robust for the one-wayness property, but in this case require an a priory upper bound on the input length.
AU - Fischlin, Marc
AU - Lehmann, Anja
AU - Pietrzak, Krzysztof Z
ID - 2852
IS - 3
JF - Journal of Cryptology
TI - Robust multi-property combiners for hash functions
VL - 27
ER -
TY - CONF
AB - Persistent homology is a recent grandchild of homology that has found use in
science and engineering as well as in mathematics. This paper surveys the method as well
as the applications, neglecting completeness in favor of highlighting ideas and directions.
AU - Edelsbrunner, Herbert
AU - Morozovy, Dmitriy
ID - 2905
TI - Persistent homology: Theory and practice
ER -
TY - JOUR
AB - Nous étudions le comportement asymptotique du nombre de variétés dans une certaine classe ne satisfaisant pas le principe de Hasse. Cette étude repose sur des résultats récemmentobtenus par Colliot-Thélène.
AU - Bretèche, Régis de la
AU - Browning, Timothy D
ID - 6319
IS - 1
JF - Journal de Théorie des Nombres de Bordeaux
SN - 1246-7405
TI - Contre-exemples au principe de Hasse pour certains tores coflasques
VL - 26
ER -
TY - JOUR
AB - We explore the relationship between polar and RM codes and we describe a coding scheme which improves upon the performance of the standard polar code at practical block lengths. Our starting point is the experimental observation that RM codes have a smaller error probability than polar codes under MAP decoding. This motivates us to introduce a family of codes that “interpolates” between RM and polar codes, call this family C inter = {C α : α ∈ [0, 1j}, where C α|α=1 is the original polar code, and C α|α=0 is an RM code. Based on numerical observations, we remark that the error probability under MAP decoding is an increasing function of α. MAP decoding has in general exponential complexity, but empirically the performance of polar codes at finite block lengths is boosted by moving along the family Cinter even under low-complexity decoding schemes such as, for instance, belief propagation or successive cancellation list decoder. We demonstrate the performance gain via numerical simulations for transmission over the erasure channel as well as the Gaussian channel.
AU - Mondelli, Marco
AU - Hassani, Hamed
AU - Urbanke, Rudiger
ID - 6739
IS - 9
JF - IEEE Transactions on Communications
SN - 0090-6778
TI - From polar to Reed-Muller codes: A technique to improve the finite-length performance
VL - 62
ER -
TY - CONF
AB - We describe coding techniques that achieve the capacity of a discrete memoryless asymmetric channel. To do so, we discuss how recent advances in coding for symmetric channels yield more efficient solutions also for the asymmetric case. In more detail, we consider three basic approaches. The first one is Gallager's scheme that concatenates a linear code with a non-linear mapper, in order to bias the input distribution. We explicitly show that both polar codes and spatially coupled codes can be employed in this scenario. Further, we derive a scaling law between the gap to capacity, the cardinality of channel input and output alphabets, and the required size of the mapper. The second one is an integrated approach in which the coding scheme is used both for source coding, in order to create codewords with the capacity-achieving distribution, and for channel coding, in order to provide error protection. Such a technique has been recently introduced by Honda and Yamamoto in the context of polar codes, and we show how to apply it also to the design of sparse graph codes. The third approach is based on an idea due to Böcherer and Mathar and separates completely the two tasks of source coding and channel coding by “chaining” together several codewords. We prove that we can combine any suitable source code with any suitable channel code in order to provide optimal schemes for asymmetric channels. In particular, polar codes and spatially coupled codes fulfill the required conditions.
AU - Mondelli, Marco
AU - Urbanke, Rudiger
AU - Hassani, Hamed
ID - 6740
T2 - 52nd Annual Allerton Conference on Communication, Control, and Computing
TI - How to achieve the capacity of asymmetric channels
ER -
TY - JOUR
AB - With the aim of extending the coverage and improving the performance of impulse radio ultra-wideband (UWB) systems, this paper focuses on developing a novel single differential encoded decode and forward (DF) non-cooperative relaying scheme (NCR). To favor simple receiver structures, differential noncoherent detection is employed which enables effective energy capture without any channel estimation. Putting emphasis on the general case of multi-hop relaying, we illustrate an original algorithm for the joint power allocation and path selection (JPAPS), minimizing an approximate expression of the overall bit error rate (BER). In particular, after deriving a closed-form power allocation strategy, the optimal path selection is reduced to a shortest path problem on a connected graph, which can be solved without any topology information with complexity O(N 3 ), N being the number of available relays of the network. An approximate scheme is also presented, which reduces the complexity to O(N 2 ) while showing a negligible performance loss, and for benchmarking purposes, an exhaustive-search based multi-hop DF cooperative strategy is derived. Simulation results for various network setups corroborate the effectiveness of the proposed low-complexity JPAPS algorithm, which favorably compares to existing AF and DF relaying methods.
AU - Mondelli, Marco
AU - Zhou, Qi
AU - Lottici, Vincenzo
AU - Ma, Xiaoli
ID - 6744
IS - 3
JF - IEEE Transactions on Wireless Communications
TI - Joint power allocation and path selection for multi-hop noncoherent decode and forward UWB communications
VL - 13
ER -
TY - BOOK
AB - This monograph presents a short course in computational geometry and topology. In the first part the book covers Voronoi diagrams and Delaunay triangulations, then it presents the theory of alpha complexes which play a crucial role in biology. The central part of the book is the homology theory and their computation, including the theory of persistence which is indispensable for applications, e.g. shape reconstruction. The target audience comprises researchers and practitioners in mathematics, biology, neuroscience and computer science, but the book may also be beneficial to graduate students of these fields.
AU - Edelsbrunner, Herbert
ID - 6853
SN - 2191-530X
TI - A Short Course in Computational Geometry and Topology
ER -
TY - GEN
AU - Huszár, Kristóf
AU - Rolinek, Michal
ID - 7038
TI - Playful Math - An introduction to mathematical games
ER -
TY - JOUR
AB - Spin and orbital quantum numbers play a key role in the physics of Mott insulators, but in most systems they are connected only indirectly—via the Pauli exclusion principle and the Coulomb interaction. Iridium-based oxides (iridates) introduce strong spin–orbit coupling directly, such that these numbers become entwined together and the Mott physics attains a strong orbital character. In the layered honeycomb iridates this is thought to generate highly spin–anisotropic magnetic interactions, coupling the spin to a given spatial direction of exchange and leading to strongly frustrated magnetism. Here we report a new iridate structure that has the same local connectivity as the layered honeycomb and exhibits striking evidence for highly spin–anisotropic exchange. The basic structural units of this material suggest that a new family of three-dimensional structures could exist, the ‘harmonic honeycomb’ iridates, of which the present compound is the first example.
AU - Modic, Kimberly A
AU - Smidt, Tess E.
AU - Kimchi, Itamar
AU - Breznay, Nicholas P.
AU - Biffin, Alun
AU - Choi, Sungkyun
AU - Johnson, Roger D.
AU - Coldea, Radu
AU - Watkins-Curry, Pilanda
AU - McCandless, Gregory T.
AU - Chan, Julia Y.
AU - Gandara, Felipe
AU - Islam, Z.
AU - Vishwanath, Ashvin
AU - Shekhter, Arkady
AU - McDonald, Ross D.
AU - Analytis, James G.
ID - 7071
JF - Nature Communications
SN - 2041-1723
TI - Realization of a three-dimensional spin–anisotropic harmonic honeycomb iridate
VL - 5
ER -
TY - JOUR
AB - We investigate the structural and magnetic properties of two molecule-based magnets synthesized from the same starting components. Their different structural motifs promote contrasting exchange pathways and consequently lead to markedly different magnetic ground states. Through examination of their structural and magnetic properties we show that [Cu(pyz)(H2O)(gly)2](ClO4)2 may be considered a quasi-one-dimensional quantum Heisenberg antiferromagnet whereas the related compound [Cu(pyz)(gly)](ClO4), which is formed from dimers of antiferromagnetically interacting Cu2+ spins, remains disordered down to at least 0.03 K in zero field but shows a field-temperature phase diagram reminiscent of that seen in materials showing a Bose-Einstein condensation of magnons.
AU - Lancaster, T.
AU - Goddard, P. A.
AU - Blundell, S. J.
AU - Foronda, F. R.
AU - Ghannadzadeh, S.
AU - Möller, J. S.
AU - Baker, P. J.
AU - Pratt, F. L.
AU - Baines, C.
AU - Huang, L.
AU - Wosnitza, J.
AU - McDonald, R. D.
AU - Modic, Kimberly A
AU - Singleton, J.
AU - Topping, C. V.
AU - Beale, T. A. W.
AU - Xiao, F.
AU - Schlueter, J. A.
AU - Barton, A. M.
AU - Cabrera, R. D.
AU - Carreiro, K. E.
AU - Tran, H. E.
AU - Manson, J. L.
ID - 7072
IS - 20
JF - Physical Review Letters
SN - 0031-9007
TI - Controlling magnetic order and quantum disorder in molecule-based magnets
VL - 112
ER -
TY - JOUR
AB - We propose a method for propagating edit operations in 2D vector graphics, based on geometric relationship functions. These functions quantify the geometric relationship of a point to a polygon, such as the distance to the boundary or the direction to the closest corner vertex. The level sets of the relationship functions describe points with the same relationship to a polygon. For a given query point, we first determine a set of relationships to local features, construct all level sets for these relationships, and accumulate them. The maxima of the resulting distribution are points with similar geometric relationships. We show extensions to handle mirror symmetries, and discuss the use of relationship functions as local coordinate systems. Our method can be applied, for example, to interactive floorplan editing, and it is especially useful for large layouts, where individual edits would be cumbersome. We demonstrate populating 2D layouts with tens to hundreds of objects by propagating relatively few edit operations.
AU - Guerrero, Paul
AU - Jeschke, Stefan
AU - Wimmer, Michael
AU - Wonka, Peter
ID - 1629
IS - 2
JF - ACM Transactions on Graphics
TI - Edit propagation using geometric relationship functions
VL - 33
ER -
TY - CONF
AB - We extend the notion of verifiable random functions (VRF) to constrained VRFs, which generalize the concept of constrained pseudorandom functions, put forward by Boneh and Waters (Asiacrypt’13), and independently by Kiayias et al. (CCS’13) and Boyle et al. (PKC’14), who call them delegatable PRFs and functional PRFs, respectively. In a standard VRF the secret key sk allows one to evaluate a pseudorandom function at any point of its domain; in addition, it enables computation of a non-interactive proof that the function value was computed correctly. In a constrained VRF from the key sk one can derive constrained keys skS for subsets S of the domain, which allow computation of function values and proofs only at points in S. After formally defining constrained VRFs, we derive instantiations from the multilinear-maps-based constrained PRFs by Boneh and Waters, yielding a VRF with constrained keys for any set that can be decided by a polynomial-size circuit. Our VRFs have the same function values as the Boneh-Waters PRFs and are proved secure under the same hardness assumption, showing that verifiability comes at no cost. Constrained (functional) VRFs were stated as an open problem by Boyle et al.
AU - Fuchsbauer, Georg
ED - Abdalla, Michel
ED - De Prisco, Roberto
ID - 1643
T2 - SCN 2014
TI - Constrained Verifiable Random Functions
VL - 8642
ER -
TY - CONF
AB - In this paper we present INTERHORN, a solver for recursion-free Horn clauses. The main application domain of INTERHORN lies in solving interpolation problems arising in software verification. We show how a range of interpolation problems, including path, transition, nested, state/transition and well-founded interpolation can be handled directly by INTERHORN. By detailing these interpolation problems and their Horn clause representations, we hope to encourage the emergence of a common back-end interpolation interface useful for diverse verification tools.
AU - Gupta, Ashutosh
AU - Popeea, Corneliu
AU - Rybalchenko, Andrey
ID - 1702
T2 - Electronic Proceedings in Theoretical Computer Science, EPTCS
TI - Generalised interpolation by solving recursion free-horn clauses
VL - 169
ER -
TY - CONF
AB - It has been long argued that, because of inherent ambiguity and noise, the brain needs to represent uncertainty in the form of probability distributions. The neural encoding of such distributions remains however highly controversial. Here we present a novel circuit model for representing multidimensional real-valued distributions using a spike based spatio-temporal code. Our model combines the computational advantages of the currently competing models for probabilistic codes and exhibits realistic neural responses along a variety of classic measures. Furthermore, the model highlights the challenges associated with interpreting neural activity in relation to behavioral uncertainty and points to alternative population-level approaches for the experimental validation of distributed representations.
AU - Savin, Cristina
AU - Denève, Sophie
ID - 1708
IS - January
TI - Spatio-temporal representations of uncertainty in spiking neural networks
VL - 3
ER -
TY - JOUR
AB - The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a distance for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intuitively, tolerating errors (while counting them) in the alternating simulation game. We show that the interface simulation distance satisfies the triangle inequality, that the distance between two interfaces does not increase under parallel composition with a third interface, that the distance between two interfaces can be bounded from above and below by distances between abstractions of the two interfaces, and how to synthesize an interface from incompatible requirements. We illustrate the framework, and the properties of the distances under composition of interfaces, with two case studies.
AU - Cerny, Pavol
AU - Chmelik, Martin
AU - Henzinger, Thomas A
AU - Radhakrishna, Arjun
ID - 1733
IS - 3
JF - Theoretical Computer Science
TI - Interface simulation distances
VL - 560
ER -
TY - JOUR
AB - Metal silicides formed by means of thermal annealing processes are employed as contact materials in microelectronics. Control of the structure of silicide/silicon interfaces becomes a critical issue when the characteristic size of the device is reduced below a few tens of nanometers. Here, we report on silicide clustering occurring within the channel of PtSi/Si/PtSi Schottky-barrier transistors. This phenomenon is investigated through atomistic simulations and low-temperature resonant-tunneling spectroscopy. Our results provide evidence for the segregation of a PtSi cluster with a diameter of a few nanometers from the silicide contact. The cluster acts as a metallic quantum dot giving rise to distinct signatures of quantum transport through its discrete energy states.
AU - Mongillo, Massimo
AU - Spathis, Panayotis N
AU - Georgios Katsaros
AU - De Franceschi, Silvano
AU - Gentile, Pascal
AU - Rurali, Riccardo
AU - Cartoixà, Xavier
ID - 1761
IS - 4
JF - Physical Review X
TI - PtSi clustering in silicon probed by transport spectroscopy
VL - 3
ER -
TY - JOUR
AB - Acute gene inactivation using short hairpin RNA (shRNA, knockdown) in developing brain is a powerful technique to study genetic function; however, discrepancies between knockdown and knockout murine phenotypes have left unanswered questions. For example, doublecortin (Dcx) knockdown but not knockout shows a neocortical neuronal migration phenotype. Here we report that in utero electroporation of shRNA, but not siRNA or miRNA, to Dcx demonstrates a migration phenotype in Dcx knockouts akin to the effect in wild-type mice, suggestingshRNA-mediated off-target toxicity. This effect wasnot limited to Dcx, as it was observed in Dclk1 knockouts, as well as with a fraction of scrambled shRNAs, suggesting a sequence-dependent but not sequence-specific effect. Profiling RNAs from electroporated cells showed a defect in endogenous let7 miRNA levels, and disruption of let7 or Dicer recapitulated the migration defect. The results suggest that shRNA-mediated knockdown can produce untoward migration effects by altering endogenous miRNA pathways.
AU - Baek, SeungTae
AU - Kerjan, Géraldine
AU - Bielas, Stephanie L
AU - Lee, Jieun
AU - Fenstermaker, Ali G
AU - Gaia Novarino
AU - Gleeson, Joseph G
ID - 1791
IS - 6
JF - Neuron
TI - Off-target effect of doublecortin family shRNA on neuronal migration associated with endogenous MicroRNA dysregulation
VL - 82
ER -
TY - CHAP
AB - The generation of asymmetry, at both cellular and tissue level, is one of the most essential capabilities of all eukaryotic organisms. It mediates basically all multicellular development ranging from embryogenesis and de novo organ formation till responses to various environmental stimuli. In plants, the awe-inspiring number of such processes is regulated by phytohormone auxin and its directional, cell-to-cell transport. The mediators of this transport, PIN auxin transporters, are asymmetrically localized at the plasma membrane, and this polar localization determines the directionality of intercellular auxin flow. Thus, auxin transport contributes crucially to the generation of local auxin gradients or maxima, which instruct given cell to change its developmental program. Here, we introduce and discuss the molecular components and cellular mechanisms regulating the generation and maintenance of cellular PIN polarity, as the general hallmarks of cell polarity in plants.
AU - Baster, Pawel
AU - Friml, Jiří
ED - Zažímalová, Eva
ED - Petrášek, Jan
ED - Benková, Eva
ID - 1806
T2 - Auxin and Its Role in Plant Development
TI - Auxin on the road navigated by cellular PIN polarity
ER -
TY - JOUR
AB - Watermarking techniques for vector graphics dislocate vertices in order to embed imperceptible, yet detectable, statistical features into the input data. The embedding process may result in a change of the topology of the input data, e.g., by introducing self-intersections, which is undesirable or even disastrous for many applications. In this paper we present a watermarking framework for two-dimensional vector graphics that employs conventional watermarking techniques but still provides the guarantee that the topology of the input data is preserved. The geometric part of this framework computes so-called maximum perturbation regions (MPR) of vertices. We propose two efficient algorithms to compute MPRs based on Voronoi diagrams and constrained triangulations. Furthermore, we present two algorithms to conditionally correct the watermarked data in order to increase the watermark embedding capacity and still guarantee topological correctness. While we focus on the watermarking of input formed by straight-line segments, one of our approaches can also be extended to circular arcs. We conclude the paper by demonstrating and analyzing the applicability of our framework in conjunction with two well-known watermarking techniques.
AU - Huber, Stefan
AU - Held, Martin
AU - Meerwald, Peter
AU - Kwitt, Roland
ID - 1816
IS - 1
JF - International Journal of Computational Geometry and Applications
TI - Topology-preserving watermarking of vector graphics
VL - 24
ER -
TY - JOUR
AB - We review recent progress towards a rigorous understanding of the Bogoliubov approximation for bosonic quantum many-body systems. We focus, in particular, on the excitation spectrum of a Bose gas in the mean-field (Hartree) limit. A list of open problems will be discussed at the end.
AU - Seiringer, Robert
ID - 1821
IS - 7
JF - Journal of Mathematical Physics
TI - Bose gases, Bose-Einstein condensation, and the Bogoliubov approximation
VL - 55
ER -
TY - JOUR
AU - Jakšić, Vojkan
AU - Pillet, Claude
AU - Seiringer, Robert
ID - 1822
IS - 7
JF - Journal of Mathematical Physics
TI - Introduction
VL - 55
ER -
TY - CHAP
AB - Hitting and batting tasks, such as tennis forehands, ping-pong strokes, or baseball batting, depend on predictions where the ball can be intercepted and how it can properly be returned to the opponent. These predictions get more accurate over time, hence the behaviors need to be continuously modified. As a result, movement templates with a learned global shape need to be adapted during the execution so that the racket reaches a target position and velocity that will return the ball over to the other side of the net or court. It requires altering learned movements to hit a varying target with the necessary velocity at a specific instant in time. Such a task cannot be incorporated straightforwardly in most movement representations suitable for learning. For example, the standard formulation of the dynamical system based motor primitives (introduced by Ijspeert et al (2002b)) does not satisfy this property despite their flexibility which has allowed learning tasks ranging from locomotion to kendama. In order to fulfill this requirement, we reformulate the Ijspeert framework to incorporate the possibility of specifying a desired hitting point and a desired hitting velocity while maintaining all advantages of the original formulation.We show that the proposed movement template formulation works well in two scenarios, i.e., for hitting a ball on a string with a table tennis racket at a specified velocity and for returning balls launched by a ball gun successfully over the net using forehand movements.
AU - Muelling, Katharina
AU - Kroemer, Oliver
AU - Lampert, Christoph
AU - Schölkopf, Bernhard
ED - Kober, Jens
ED - Peters, Jan
ID - 1829
T2 - Learning Motor Skills
TI - Movement templates for learning of hitting and batting
VL - 97
ER -
TY - JOUR
AB - We prove polynomial upper bounds of geometric Ramsey numbers of pathwidth-2 outerplanar triangulations in both convex and general cases. We also prove that the geometric Ramsey numbers of the ladder graph on 2n vertices are bounded by O(n3) and O(n10), in the convex and general case, respectively. We then apply similar methods to prove an (Formula presented.) upper bound on the Ramsey number of a path with n ordered vertices.
AU - Cibulka, Josef
AU - Gao, Pu
AU - Krcál, Marek
AU - Valla, Tomáš
AU - Valtr, Pavel
ID - 1842
IS - 1
JF - Discrete & Computational Geometry
TI - On the geometric ramsey number of outerplanar graphs
VL - 53
ER -
TY - JOUR
AB - Local protein interactions ("molecular context" effects) dictate amino acid replacements and can be described in terms of site-specific, energetic preferences for any different amino acid. It has been recently debated whether these preferences remain approximately constant during evolution or whether, due to coevolution of sites, they change strongly. Such research highlights an unresolved and fundamental issue with far-reaching implications for phylogenetic analysis and molecular evolution modeling. Here, we take advantage of the recent availability of phenotypically supported laboratory resurrections of Precambrian thioredoxins and β-lactamases to experimentally address the change of site-specific amino acid preferences over long geological timescales. Extensive mutational analyses support the notion that evolutionary adjustment to a new amino acid may occur, but to a large extent this is insufficient to erase the primitive preference for amino acid replacements. Generally, site-specific amino acid preferences appear to remain conserved throughout evolutionary history despite local sequence divergence. We show such preference conservation to be readily understandable in molecular terms and we provide crystallographic evidence for an intriguing structural-switch mechanism: Energetic preference for an ancestral amino acid in a modern protein can be linked to reorganization upon mutation to the ancestral local structure around the mutated site. Finally, we point out that site-specific preference conservation naturally leads to one plausible evolutionary explanation for the existence of intragenic global suppressor mutations.
AU - Risso, Valeria
AU - Manssour Triedo, Fadia
AU - Delgado Delgado, Asuncion
AU - Arco, Rocio
AU - Barroso Deljesús, Alicia
AU - Inglés Prieto, Álvaro
AU - Godoy Ruiz, Raquel
AU - Gavira, Josè
AU - Gaucher, Eric
AU - Ibarra Molero, Beatriz
AU - Sánchez Ruiz, Jose
ID - 1844
IS - 2
JF - Molecular Biology and Evolution
TI - Mutational studies on resurrected ancestral proteins reveal conservation of site-specific amino acid preferences throughout evolutionary history
VL - 32
ER -
TY - JOUR
AB - To control morphogenesis, molecular regulatory networks have to interfere with the mechanical properties of the individual cells of developing organs and tissues, but how this is achieved is not well known. We study this issue here in the shoot meristem of higher plants, a group of undifferentiated cells where complex changes in growth rates and directions lead to the continuous formation of new organs [1, 2]. Here, we show that the plant hormone auxin plays an important role in this process via a dual, local effect on the extracellular matrix, the cell wall, which determines cell shape. Our study reveals that auxin not only causes a limited reduction in wall stiffness but also directly interferes with wall anisotropy via the regulation of cortical microtubule dynamics. We further show that to induce growth isotropy and organ outgrowth, auxin somehow interferes with the cortical microtubule-ordering activity of a network of proteins, including AUXIN BINDING PROTEIN 1 and KATANIN 1. Numerical simulations further indicate that the induced isotropy is sufficient to amplify the effects of the relatively minor changes in wall stiffness to promote organogenesis and the establishment of new growth axes in a robust manner.
AU - Sassi, Massimiliano
AU - Ali, Olivier
AU - Boudon, Frédéric
AU - Cloarec, Gladys
AU - Abad, Ursula
AU - Cellier, Coralie
AU - Chen, Xu
AU - Gilles, Benjamin
AU - Milani, Pascale
AU - Friml, Jirí
AU - Vernoux, Teva
AU - Godin, Christophe
AU - Hamant, Olivier
AU - Traas, Jan
ID - 1852
IS - 19
JF - Current Biology
TI - An auxin-mediated shift toward growth isotropy promotes organ formation at the shoot meristem in Arabidopsis
VL - 24
ER -
TY - CONF
AB - Wireless sensor networks (WSNs) composed of low-power, low-cost sensor nodes are expected to form the backbone of future intelligent networks for a broad range of civil, industrial and military applications. These sensor nodes are often deployed through random spreading, and function in dynamic environments. Many applications of WSNs such as pollution tracking, forest fire detection, and military surveillance require knowledge of the location of constituent nodes. But the use of technologies such as GPS on all nodes is prohibitive due to power and cost constraints. So, the sensor nodes need to autonomously determine their locations. Most localization techniques use anchor nodes with known locations to determine the position of remaining nodes. Localization techniques have two conflicting requirements. On one hand, an ideal localization technique should be computationally simple and on the other hand, it must be resistant to attacks that compromise anchor nodes. In this paper, we propose a computationally light-weight game theoretic secure localization technique and demonstrate its effectiveness in comparison to existing techniques.
AU - Jha, Susmit
AU - Tripakis, Stavros
AU - Seshia, Sanjit
AU - Chatterjee, Krishnendu
ID - 1853
TI - Game theoretic secure localization in wireless sensor networks
ER -
TY - JOUR
AB - In this paper, we present a method for non-rigid, partial shape matching in vector graphics. Given a user-specified query region in a 2D shape, similar regions are found, even if they are non-linearly distorted. Furthermore, a non-linear mapping is established between the query regions and these matches, which allows the automatic transfer of editing operations such as texturing. This is achieved by a two-step approach. First, pointwise correspondences between the query region and the whole shape are established. The transformation parameters of these correspondences are registered in an appropriate transformation space. For transformations between similar regions, these parameters form surfaces in transformation space, which are extracted in the second step of our method. The extracted regions may be related to the query region by a non-rigid transform, enabling non-rigid shape matching. In this paper, we present a method for non-rigid, partial shape matching in vector graphics. Given a user-specified query region in a 2D shape, similar regions are found, even if they are non-linearly distorted. Furthermore, a non-linear mapping is established between the query regions and these matches, which allows the automatic transfer of editing operations such as texturing. This is achieved by a two-step approach. First, pointwise correspondences between the query region and the whole shape are established. The transformation parameters of these correspondences are registered in an appropriate transformation space. For transformations between similar regions, these parameters form surfaces in transformation space, which are extracted in the second step of our method. The extracted regions may be related to the query region by a non-rigid transform, enabling non-rigid shape matching.
AU - Guerrero, Paul
AU - Auzinger, Thomas
AU - Wimmer, Michael
AU - Jeschke, Stefan
ID - 1854
IS - 1
JF - Computer Graphics Forum
TI - Partial shape matching using transformation parameter similarity
VL - 34
ER -
TY - JOUR
AB - The prominent and evolutionarily ancient role of the plant hormone auxin is the regulation of cell expansion. Cell expansion requires ordered arrangement of the cytoskeleton but molecular mechanisms underlying its regulation by signalling molecules including auxin are unknown. Here we show in the model plant Arabidopsis thaliana that in elongating cells exogenous application of auxin or redistribution of endogenous auxin induces very rapid microtubule re-orientation from transverse to longitudinal, coherent with the inhibition of cell expansion. This fast auxin effect requires auxin binding protein 1 (ABP1) and involves a contribution of downstream signalling components such as ROP6 GTPase, ROP-interactive protein RIC1 and the microtubule-severing protein katanin. These components are required for rapid auxin-and ABP1-mediated re-orientation of microtubules to regulate cell elongation in roots and dark-grown hypocotyls as well as asymmetric growth during gravitropic responses.
AU - Chen, Xu
AU - Grandont, Laurie
AU - Li, Hongjiang
AU - Hauschild, Robert
AU - Paque, Sébastien
AU - Abuzeineh, Anas
AU - Rakusová, Hana
AU - Benková, Eva
AU - Perrot Rechenmann, Catherine
AU - Friml, Jirí
ID - 1862
IS - 729
JF - Nature
TI - Inhibition of cell expansion by rapid ABP1-mediated auxin effect on microtubules
VL - 516
ER -
TY - CONF
AB - Boolean controllers for systems with complex datapaths are often very difficult to implement correctly, in particular when concurrency is involved. Yet, in many instances it is easy to formally specify correctness. For example, the specification for the controller of a pipelined processor only has to state that the pipelined processor gives the same results as a non-pipelined reference design. This makes such controllers a good target for automated synthesis. However, an efficient abstraction for the complex datapath elements is needed, as a bit-precise description is often infeasible. We present Suraq, the first controller synthesis tool which uses uninterpreted functions for the abstraction. Quantified firstorder formulas (with specific quantifier structure) serve as the specification language from which Suraq synthesizes Boolean controllers. Suraq transforms the specification into an unsatisfiable SMT formula, and uses Craig interpolation to compute its results. Using Suraq, we were able to synthesize a controller (consisting of two Boolean signals) for a five-stage pipelined DLX processor in roughly one hour and 15 minutes.
AU - Hofferek, Georg
AU - Gupta, Ashutosh
ED - Yahav, Eran
ID - 1869
T2 - HVC 2014
TI - Suraq - a controller synthesis tool using uninterpreted functions
VL - 8855
ER -
TY - CONF
AB - We investigate the problem of checking if a finite-state transducer is robust to uncertainty in its input. Our notion of robustness is based on the analytic notion of Lipschitz continuity - a transducer is K-(Lipschitz) robust if the perturbation in its output is at most K times the perturbation in its input. We quantify input and output perturbation using similarity functions. We show that K-robustness is undecidable even for deterministic transducers. We identify a class of functional transducers, which admits a polynomial time automata-theoretic decision procedure for K-robustness. This class includes Mealy machines and functional letter-to-letter transducers. We also study K-robustness of nondeterministic transducers. Since a nondeterministic transducer generates a set of output words for each input word, we quantify output perturbation using setsimilarity functions. We show that K-robustness of nondeterministic transducers is undecidable, even for letter-to-letter transducers. We identify a class of set-similarity functions which admit decidable K-robustness of letter-to-letter transducers.
AU - Henzinger, Thomas A
AU - Otop, Jan
AU - Samanta, Roopsha
ID - 1870
T2 - Leibniz International Proceedings in Informatics, LIPIcs
TI - Lipschitz robustness of finite-state transducers
VL - 29
ER -
TY - CONF
AB - Extensionality axioms are common when reasoning about data collections, such as arrays and functions in program analysis, or sets in mathematics. An extensionality axiom asserts that two collections are equal if they consist of the same elements at the same indices. Using extensionality is often required to show that two collections are equal. A typical example is the set theory theorem (∀x)(∀y)x∪y = y ∪x. Interestingly, while humans have no problem with proving such set identities using extensionality, they are very hard for superposition theorem provers because of the calculi they use. In this paper we show how addition of a new inference rule, called extensionality resolution, allows first-order theorem provers to easily solve problems no modern first-order theorem prover can solve. We illustrate this by running the VAMPIRE theorem prover with extensionality resolution on a number of set theory and array problems. Extensionality resolution helps VAMPIRE to solve problems from the TPTP library of first-order problems that were never solved before by any prover.
AU - Gupta, Ashutosh
AU - Kovács, Laura
AU - Kragl, Bernhard
AU - Voronkov, Andrei
ED - Cassez, Franck
ED - Raskin, Jean-François
ID - 1872
T2 - ATVA 2014
TI - Extensional crisis and proving identity
VL - 8837
ER -
TY - CONF
AB - We present a formal framework for repairing infinite-state, imperative, sequential programs, with (possibly recursive) procedures and multiple assertions; the framework can generate repaired programs by modifying the original erroneous program in multiple program locations, and can ensure the readability of the repaired program using user-defined expression templates; the framework also generates a set of inductive assertions that serve as a proof of correctness of the repaired program. As a step toward integrating programmer intent and intuition in automated program repair, we present a cost-aware formulation - given a cost function associated with permissible statement modifications, the goal is to ensure that the total program modification cost does not exceed a given repair budget. As part of our predicate abstractionbased solution framework, we present a sound and complete algorithm for repair of Boolean programs. We have developed a prototype tool based on SMT solving and used it successfully to repair diverse errors in benchmark C programs.
AU - Samanta, Roopsha
AU - Olivo, Oswaldo
AU - Allen, Emerson
ED - Müller-Olm, Markus
ED - Seidl, Helmut
ID - 1875
TI - Cost-aware automatic program repair
VL - 8723
ER -
TY - JOUR
AB - We study densities of functionals over uniformly bounded triangulations of a Delaunay set of vertices, and prove that the minimum is attained for the Delaunay triangulation if this is the case for finite sets.
AU - Dolbilin, Nikolai
AU - Edelsbrunner, Herbert
AU - Glazyrin, Alexey
AU - Musin, Oleg
ID - 1876
IS - 3
JF - Moscow Mathematical Journal
TI - Functionals on triangulations of delaunay sets
VL - 14
ER -
TY - JOUR
AB - During inflammation, lymph nodes swell with an influx of immune cells. New findings identify a signalling pathway that induces relaxation in the contractile cells that give structure to these organs.
AU - Sixt, Michael K
AU - Vaahtomeri, Kari
ID - 1877
IS - 7523
JF - Nature
TI - Physiology: Relax and come in
VL - 514
ER -
TY - JOUR
AB - Unbiased high-throughput massively parallel sequencing methods have transformed the process of discovery of novel putative driver gene mutations in cancer. In chronic lymphocytic leukemia (CLL), these methods have yielded several unexpected findings, including the driver genes SF3B1, NOTCH1 and POT1. Recent analysis, utilizing down-sampling of existing datasets, has shown that the discovery process of putative drivers is far from complete across cancer. In CLL, while driver gene mutations affecting >10% of patients were efficiently discovered with previously published CLL cohorts of up to 160 samples subjected to whole exome sequencing (WES), this sample size has only 0.78 power to detect drivers affecting 5% of patients, and only 0.12 power for drivers affecting 2% of patients. These calculations emphasize the need to apply unbiased WES to larger patient cohorts.
AU - Landau, Dan
AU - Stewart, Chip
AU - Reiter, Johannes
AU - Lawrence, Michael
AU - Sougnez, Carrie
AU - Brown, Jennifer
AU - Lopez Guillermo, Armando
AU - Gabriel, Stacey
AU - Lander, Eric
AU - Neuberg, Donna
AU - López Otín, Carlos
AU - Campo, Elias
AU - Getz, Gad
AU - Wu, Catherine
ID - 1884
IS - 21
JF - Blood
TI - Novel putative driver gene mutations in chronic lymphocytic leukemia (CLL): results from a combined analysis of whole exome sequencing of 262 primary CLL aamples
VL - 124
ER -
TY - JOUR
AB - Information processing in the sensory periphery is shaped by natural stimulus statistics. In the periphery, a transmission bottleneck constrains performance; thus efficient coding implies that natural signal components with a predictably wider range should be compressed. In a different regime—when sampling limitations constrain performance—efficient coding implies that more resources should be allocated to informative features that are more variable. We propose that this regime is relevant for sensory cortex when it extracts complex features from limited numbers of sensory samples. To test this prediction, we use central visual processing as a model: we show that visual sensitivity for local multi-point spatial correlations, described by dozens of independently-measured parameters, can be quantitatively predicted from the structure of natural images. This suggests that efficient coding applies centrally, where it extends to higher-order sensory features and operates in a regime in which sensitivity increases with feature variability.
AU - Hermundstad, Ann
AU - Briguglio, John
AU - Conte, Mary
AU - Victor, Jonathan
AU - Balasubramanian, Vijay
AU - Tkacik, Gasper
ID - 1886
IS - November
JF - eLife
TI - Variance predicts salience in central sensory processing
ER -
TY - JOUR
AU - Cremer, Sylvia
ID - 1887
JF - Zoologie
TI - Gemeinsame Krankheitsabwehr in Ameisengesellschaften
ER -