@inproceedings{1507, abstract = {The Wigner-Dyson-Gaudin-Mehta conjecture asserts that the local eigenvalue statistics of large real and complex Hermitian matrices with independent, identically distributed entries are universal in a sense that they depend only on the symmetry class of the matrix and otherwise are independent of the details of the distribution. We present the recent solution to this half-century old conjecture. We explain how stochastic tools, such as the Dyson Brownian motion, and PDE ideas, such as De Giorgi-Nash-Moser regularity theory, were combined in the solution. We also show related results for log-gases that represent a universal model for strongly correlated systems. Finally, in the spirit of Wigner’s original vision, we discuss the extensions of these universality results to more realistic physical systems such as random band matrices.}, author = {Erdös, László}, booktitle = {Proceedings of the International Congress of Mathematicians}, location = {Seoul, Korea}, pages = {214 -- 236}, publisher = {International Congress of Mathematicians}, title = {{Random matrices, log-gases and Hölder regularity}}, volume = {3}, year = {2014}, } @inproceedings{1516, abstract = {We present a rigorous derivation of the BCS gap equation for superfluid fermionic gases with point interactions. Our starting point is the BCS energy functional, whose minimizer we investigate in the limit when the range of the interaction potential goes to zero. }, author = {Bräunlich, Gerhard and Hainzl, Christian and Seiringer, Robert}, booktitle = {Proceedings of the QMath12 Conference}, location = {Berlin, Germany}, pages = {127 -- 137}, publisher = {World Scientific Publishing}, title = {{On the BCS gap equation for superfluid fermionic gases}}, doi = {10.1142/9789814618144_0007}, year = {2014}, } @article{1629, abstract = {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.}, author = {Guerrero, Paul and Jeschke, Stefan and Wimmer, Michael and Wonka, Peter}, journal = {ACM Transactions on Graphics}, number = {2}, publisher = {ACM}, title = {{Edit propagation using geometric relationship functions}}, doi = {10.1145/2591010}, volume = {33}, year = {2014}, } @inproceedings{1643, abstract = {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.}, author = {Fuchsbauer, Georg}, booktitle = {SCN 2014}, editor = {Abdalla, Michel and De Prisco, Roberto}, location = {Amalfi, Italy}, pages = {95 -- 114}, publisher = {Springer}, title = {{Constrained Verifiable Random Functions }}, doi = {10.1007/978-3-319-10879-7_7}, volume = {8642}, year = {2014}, } @inproceedings{1702, abstract = {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.}, author = {Gupta, Ashutosh and Popeea, Corneliu and Rybalchenko, Andrey}, booktitle = {Electronic Proceedings in Theoretical Computer Science, EPTCS}, location = {Vienna, Austria}, pages = {31 -- 38}, publisher = {Open Publishing Association}, title = {{Generalised interpolation by solving recursion free-horn clauses}}, doi = {10.4204/EPTCS.169.5}, volume = {169}, year = {2014}, } @inproceedings{1708, abstract = {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.}, author = {Savin, Cristina and Denève, Sophie}, location = {Montreal, Canada}, number = {January}, pages = {2024 -- 2032}, publisher = {Neural Information Processing Systems Foundation}, title = {{Spatio-temporal representations of uncertainty in spiking neural networks}}, volume = {27}, year = {2014}, } @article{1852, abstract = {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.}, author = {Sassi, Massimiliano and Ali, Olivier and Boudon, Frédéric and Cloarec, Gladys and Abad, Ursula and Cellier, Coralie and Chen, Xu and Gilles, Benjamin and Milani, Pascale and Friml, Jirí and Vernoux, Teva and Godin, Christophe and Hamant, Olivier and Traas, Jan}, journal = {Current Biology}, number = {19}, pages = {2335 -- 2342}, publisher = {Cell Press}, title = {{An auxin-mediated shift toward growth isotropy promotes organ formation at the shoot meristem in Arabidopsis}}, doi = {10.1016/j.cub.2014.08.036}, volume = {24}, year = {2014}, } @inproceedings{1853, abstract = {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.}, author = {Jha, Susmit and Tripakis, Stavros and Seshia, Sanjit and Chatterjee, Krishnendu}, location = {Cambridge, USA}, pages = {85 -- 90}, publisher = {IEEE}, title = {{Game theoretic secure localization in wireless sensor networks}}, doi = {10.1109/IOT.2014.7030120}, year = {2014}, } @article{1854, abstract = {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.}, author = {Guerrero, Paul and Auzinger, Thomas and Wimmer, Michael and Jeschke, Stefan}, journal = {Computer Graphics Forum}, number = {1}, pages = {239 -- 252}, publisher = {Wiley}, title = {{Partial shape matching using transformation parameter similarity}}, doi = {10.1111/cgf.12509}, volume = {34}, year = {2014}, } @article{1862, abstract = {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.}, author = {Chen, Xu and Grandont, Laurie and Li, Hongjiang and Hauschild, Robert and Paque, Sébastien and Abuzeineh, Anas and Rakusova, Hana and Benková, Eva and Perrot Rechenmann, Catherine and Friml, Jirí}, issn = {1476-4687}, journal = {Nature}, number = {729}, pages = {90 -- 93}, publisher = {Nature Publishing Group}, title = {{Inhibition of cell expansion by rapid ABP1-mediated auxin effect on microtubules}}, doi = {10.1038/nature13889}, volume = {516}, year = {2014}, } @inproceedings{1869, abstract = {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.}, author = {Hofferek, Georg and Gupta, Ashutosh}, booktitle = {HVC 2014}, editor = {Yahav, Eran}, location = {Haifa, Israel}, pages = {68 -- 74}, publisher = {Springer}, title = {{Suraq - a controller synthesis tool using uninterpreted functions}}, doi = {10.1007/978-3-319-13338-6_6}, volume = {8855}, year = {2014}, } @inproceedings{1870, abstract = {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.}, author = {Henzinger, Thomas A and Otop, Jan and Samanta, Roopsha}, booktitle = {Leibniz International Proceedings in Informatics, LIPIcs}, location = {Delhi, India}, pages = {431 -- 443}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Lipschitz robustness of finite-state transducers}}, doi = {10.4230/LIPIcs.FSTTCS.2014.431}, volume = {29}, year = {2014}, } @inproceedings{1872, abstract = {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.}, author = {Gupta, Ashutosh and Kovács, Laura and Kragl, Bernhard and Voronkov, Andrei}, booktitle = {ATVA 2014}, editor = {Cassez, Franck and Raskin, Jean-François}, location = {Sydney, Australia}, pages = {185 -- 200}, publisher = {Springer}, title = {{Extensional crisis and proving identity}}, doi = {10.1007/978-3-319-11936-6_14}, volume = {8837}, year = {2014}, } @inproceedings{1875, abstract = {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.}, author = {Samanta, Roopsha and Olivo, Oswaldo and Allen, Emerson}, editor = {Müller-Olm, Markus and Seidl, Helmut}, location = {Munich, Germany}, pages = {268 -- 284}, publisher = {Springer}, title = {{Cost-aware automatic program repair}}, doi = {10.1007/978-3-319-10936-7_17}, volume = {8723}, year = {2014}, } @article{1876, abstract = {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.}, author = {Dolbilin, Nikolai and Edelsbrunner, Herbert and Glazyrin, Alexey and Musin, Oleg}, issn = {1609-3321}, journal = {Moscow Mathematical Journal}, number = {3}, pages = {491 -- 504}, publisher = {Independent University of Moscow}, title = {{Functionals on triangulations of delaunay sets}}, doi = {10.17323/1609-4514-2014-14-3-491-504}, volume = {14}, year = {2014}, } @article{1877, abstract = {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.}, author = {Sixt, Michael K and Vaahtomeri, Kari}, journal = {Nature}, number = {7523}, pages = {441 -- 442}, publisher = {Springer Nature}, title = {{Physiology: Relax and come in}}, doi = {10.1038/514441a}, volume = {514}, year = {2014}, } @article{1884, abstract = {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.}, author = {Landau, Dan and Stewart, Chip and Reiter, Johannes and Lawrence, Michael and Sougnez, Carrie and Brown, Jennifer and Lopez Guillermo, Armando and Gabriel, Stacey and Lander, Eric and Neuberg, Donna and López Otín, Carlos and Campo, Elias and Getz, Gad and Wu, Catherine}, journal = {Blood}, number = {21}, pages = {1952 -- 1952}, publisher = {American Society of Hematology}, title = {{Novel putative driver gene mutations in chronic lymphocytic leukemia (CLL): results from a combined analysis of whole exome sequencing of 262 primary CLL aamples}}, volume = {124}, year = {2014}, } @article{1886, abstract = {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.}, author = {Hermundstad, Ann and Briguglio, John and Conte, Mary and Victor, Jonathan and Balasubramanian, Vijay and Tkacik, Gasper}, journal = {eLife}, number = {November}, publisher = {eLife Sciences Publications}, title = {{Variance predicts salience in central sensory processing}}, doi = {10.7554/eLife.03722}, year = {2014}, } @article{1887, author = {Cremer, Sylvia}, journal = {Zoologie}, pages = {23 -- 30}, publisher = {Deutsche Zoologische Gesellschaft}, title = {{Gemeinsame Krankheitsabwehr in Ameisengesellschaften}}, year = {2014}, } @inbook{1888, abstract = {Im Rahmen meiner Arbeit mit der kollektiven Krankheitsabwehr in Ameisengesellschaften interessiert mich vor allem, wie sich die Kolonien als Ganzes gegen Krankheiten wehren können. Warum ist dieses Thema der Krankheitsdynamik in Gruppen so wichtig? Ein Vergleich von solitär lebenden Individuen mit Individuen, die in sozialen Gruppen zusammenleben, zeigt die Kosten und die Vorteile des Gruppenlebens: Einerseits haben Individuen in sozialen Gruppen aufgrund der hohen Dichte, in der die Tiere zusammenleben, den hohen Interaktionsraten, die sie miteinander haben, und der engen Verwandtschaft, die sie verbindet, ein höheres Ansteckungsrisiko. Andererseits kann die individuelle Krankheitsabwehr durch die kollektive Abwehr in den Gruppen ergänzt werden.}, author = {Cremer, Sylvia}, booktitle = {Soziale Insekten in einer sich wandelnden Welt}, issn = {2366-2875}, pages = {65 -- 72}, publisher = {Verlag Dr. Friedrich Pfeil}, title = {{Soziale Immunität: Wie sich der Staat gegen Pathogene wehrt Bayerische Akademie der Wissenschaften}}, volume = {43}, year = {2014}, }