@article{2766, abstract = {We consider Hermitian and symmetric random band matrices H in d ≥ dimensions. The matrix elements Hxy, indexed by x,y ∈ Λ ⊂ ℤd are independent and their variances satisfy σ2xy:= E{pipe}Hxy{pipe}2 = W-d f((x-y)/W for some probability density f. We assume that the law of each matrix element Hxy is symmetric and exhibits subexponential decay. We prove that the time evolution of a quantum particle subject to the Hamiltonian H is diffusive on time scales ≪ Wd/3. We also show that the localization length of the eigenvectors of H is larger than a factor Wd/6 times the band width W. All results are uniform in the size {pipe}Λ{pipe} of the matrix. This extends our recent result (Erdo{double acute}s and Knowles in Commun. Math. Phys., 2011) to general band matrices. As another consequence of our proof we show that, for a larger class of random matrices satisfying Σx σ2xy for all y, the largest eigenvalue of H is bounded with high probability by 2+M-2/3+e{open} for any e{open} > 0, where M:= 1/(maxx,y σ2xy).}, author = {László Erdös and Knowles, Antti}, journal = {Annales Henri Poincare}, number = {7}, pages = {1227 -- 1319}, publisher = {Birkhäuser}, title = {{Quantum diffusion and delocalization for band matrices with general distribution}}, doi = {10.1007/s00023-011-0104-5}, volume = {12}, year = {2011}, } @article{2799, abstract = {Shear flows undergo a sudden transition from laminar to turbulent motion as the velocity increases, and the onset of turbulence radically changes transport efficiency and mixing properties. Even for the well-studied case of pipe flow, it has not been possible to determine at what Reynolds number the motion will be either persistently turbulent or ultimately laminar. We show that in pipes, turbulence that is transient at low Reynolds numbers becomes sustained at a distinct critical point. Through extensive experiments and computer simulations, we were able to identify and characterize the processes ultimately responsible for sustaining turbulence. In contrast to the classical Landau-Ruelle-Takens view that turbulence arises from an increase in the temporal complexity of fluid motion, here, spatial proliferation of chaotic domains is the decisive process and intrinsic to the nature of fluid turbulence.}, author = {Avila, Kerstin and Moxey, David and de Lózar, Alberto and Avila, Marc and Barkley, Dwight and Björn Hof}, journal = {Science}, number = {6039}, pages = {192 -- 196}, publisher = {American Association for the Advancement of Science}, title = {{The onset of turbulence in pipe flow}}, doi = {10.1126/science.1203223}, volume = {333}, year = {2011}, } @article{2800, abstract = {In shear flows, turbulence first occurs in the form of localized structures (puffs/spots) surrounded by laminar fluid. We here investigate such spatially intermittent flows in a pipe experiment showing that turbulent puffs have a well-defined interaction distance, which sets their minimum spacing as well as the maximum observable turbulent fraction. Two methodologies are employed. Starting from a laminar flow, puffs are first created by locally injecting a jet of fluid through the pipe wall. When the perturbation is applied periodically at low frequencies, as expected, a regular sequence of puffs is observed where the puff spacing is given by the ratio of the mean flow speed to the perturbation frequency. At large frequencies however puffs are found to interact and annihilate each other. Varying the perturbation frequency, an interaction distance is determined which sets the highest possible turbulence fraction. This enables us to establish an upper bound for the friction factor in the transitional regime, which provides a well-defined link between the Blasius and the Hagen-Poiseuille friction laws. In the second set of experiments, the Reynolds number is reduced suddenly from fully turbulent to the intermittent regime. The resulting flow reorganizes itself to a sequence of constant size puffs which, unlike in Couette and Taylor–Couette flow are randomly spaced. The minimum distance between the turbulent patches is identical to the puff interaction length. The puff interaction length is found to be in agreement with the wavelength of regular stripe and spiral patterns in plane Couette and Taylor–Couette flow.}, author = {Samanta, Devranjan and de Lózar, Alberto and Björn Hof}, journal = {Journal of Fluid Mechanics}, pages = {193 -- 204}, publisher = {Cambridge University Press}, title = {{Experimental investigation of laminar turbulent intermittency in pipe flow}}, doi = {10.1017/jfm.2011.189}, volume = {681}, year = {2011}, } @inproceedings{2801, abstract = {Turbulent puffs in pipe flow are characterized by a sharp laminar-turbulent interface at the trailing edge and a more diffused leading interface. It is known that these laminar-turbulent interfaces propagate at a speed that is approximately equal to the flow rate. Our results from direct numerical simulation show that, locally, the interface velocity relative to the fluid (i) counteracts the advection due to the laminar velocity profile so that the puff can preserve its characteristic overall shape, (ii) is very small in magnitude, but involves a large interface area so that the global propagation velocity relative to the mean flow can be large and (iii) is determined by both inertial and viscous effects. The analysis provides some new insights into the mechanisms that sustain or expand localized turbulence and might be relevant for the design of new control strategies.}, author = {Holzner, Markus and Avila, Marc and de Lózar, Alberto and Björn Hof}, number = {5}, publisher = {IOP Publishing Ltd.}, title = {{A Lagrangian approach to the interface velocity of turbulent puffs in pipe flow}}, doi = {10.1088/1742-6596/318/5/052031}, volume = {318}, year = {2011}, } @article{2871, abstract = {Despite their relatively simple appearance, roots are incredibly complex organs that are highly adapted to differing environments. Many aspects of root development are co-ordinated by subtle spatial differences in the concentrations of the phytohormones auxin and cytokinin. Events from the formation of a root during embryogenesis to the determination of the network of lateral roots are controlled by interactions between these hormones. Recently, interactions have been defined where auxin signaling promotes the expression of cytokinin signaling inhibitors, cytokinin signaling promotes the expression of auxin signaling inhibitors and finally where cytokinin signaling regulates the complex network of auxin transport proteins to position zones of high auxin signaling. We are witnessing a period of discovery in which we are beginning to understand how these hormonal pathways communicate to regulate root formation.}, author = {Bishopp, Anthony and Eva Benková and Helariutta, Ykä}, journal = {Current Opinion in Plant Biology}, number = {1}, pages = {10 -- 16}, publisher = {Elsevier}, title = {{Sending mixed messages: Auxin-cytokinin crosstalk in roots}}, doi = {10.1016/j.pbi.2010.08.014}, volume = {14}, year = {2011}, } @article{2874, abstract = {The apical hook develops in the upper part of the hypocotyl when seeds buried in the soil germinate, and serves to protect cotyledons and the shoot apical meristem from possible damage caused by pushing through the soil. The curvature is formed through differential cell growth that occurs at the two opposite sides of the hypocotyl, and it is established by a gradient of auxin activity and refined by the coordinated action of auxin and ethylene. Here we show that gibberellins (GAs) promote hook development through the transcriptional regulation of several genes of the ethylene and auxin pathways in Arabidopsis. The level of GA activity determines the speed of hook formation and the extent of the curvature during the formation phase independently of ethylene, probably by modulating auxin transport and response through HLS1, PIN3, and PIN7. Moreover, GAs cooperate with ethylene in preventing hook opening, in part through the induction of ethylene production mediated by ACS5/ETO2 and ACS8.}, author = {Gallego-Bartolomé, Javier and Arana, María V and Vandenbussche, Filip and Žádníková, Petra and Minguet, Eugenio G and Guardiola, Vicente and Van Der Straeten, Dominique and Eva Benková and Alabadí, David and Blázquez, Miguel A}, journal = {Plant Journal}, number = {4}, pages = {622 -- 634}, publisher = {Wiley-Blackwell}, title = {{Hierarchy of hormone action controlling apical hook development in Arabidopsis}}, doi = {10.1111/j.1365-313X.2011.04621.x}, volume = {67}, year = {2011}, } @article{2897, author = {Tiago Paixao and Azevedo, Ricardo B}, journal = {PLoS Computational Biology}, number = {7}, publisher = {Public Library of Science}, title = {{Redundancy and the Evolution of Cis Regulatory Element Multiplicity}}, doi = {10.1371/journal.pcbi.1000848}, volume = {6}, year = {2011}, } @article{2898, abstract = {Sex allocation theory has been remarkably successful at explaining the prevalence of even sex ratios in natural populations and at identifying specific conditions that can result in biased sex ratios. Much of this theory focuses on parental sex determination (SD) strategies. Here, we consider instead the evolutionary causes and consequences of mixed offspring SD strategies, in which the genotype of an individual determines not its sex, but the probability of developing one of multiple sexes. We find that alleles specifying mixed offspring SD strategies can generally outcompete alleles that specify pure strategies, but generate constraints that may prevent a population from reaching an even sex ratio. We use our model to analyze sex ratios in natural populations of Tetrahymena thermophila, a ciliate with seven sexes determined by mixed SD alleles. We show that probabilistic SD is sufficient to account for the occurrence of skewed sex ratios in natural populations of T. thermophila, provided that their effective population sizes are small. Our results highlight the importance of genetic drift in sex ratio evolution and suggest that mixed offspring SD strategies should be more common than currently thought.}, author = {Tiago Paixao and Phadke, Sujal S and Azevedo, Ricardo B and Zufall, Rebecca A}, journal = {Evolution; International Journal of Organic Evolution}, number = {7}, pages = {2050 -- 2060}, publisher = {Wiley-Blackwell}, title = {{Sex ratio evolution under probabilistic sex determination}}, doi = {10.1111/j.1558-5646.2011.01266.x}, volume = {65}, year = {2011}, } @inbook{2922, author = {Vicente, Sara and Vladimir Kolmogorov and Rother, Carsten}, booktitle = {Markov Random Fields for Vision and Image Processing}, editor = {Blake, Andrew and Kohli, Pushmeet and Rother, Carsten}, publisher = {Massachusetts Institute of Technology Press}, title = {{Graph-cut Based Image Segmentation with Connectivity Priors}}, year = {2011}, } @inbook{2923, author = {Kumar, M Pawan and Vladimir Kolmogorov and Torr, Philip H}, booktitle = {Markov Random Fields for Vision and Image Processing}, editor = {Blake, Andrew and Kohli, Pushmeet and Rother, Carsten}, publisher = {Massachusetts Institute of Technology Press}, title = {{Analyzing Convex Relaxations for MAP Estimation}}, year = {2011}, } @inbook{2924, author = {Criminisi, Antonio and Cross, Geoffrey and Blake, Andrew and Vladimir Kolmogorov}, booktitle = {Markov Random Fields for Vision and Image Processing}, editor = {Blake, Andrew and Kohli, Pushmeet and Rother, Carsten}, publisher = {Massachusetts Institute of Technology Press}, title = {{Bilayer Segmentation of Video}}, year = {2011}, } @inbook{2925, author = {Rother, Carsten and Vladimir Kolmogorov and Boykov, Yuri and Blake, Andrew}, booktitle = {Markov Random Fields for Vision and Image Processing}, editor = {Blake, Andrew and Kohli, Pushmeet and Rother, Carsten}, publisher = {Massachusetts Institute of Technology Press}, title = {{Interactive Foreground Extraction using graph cut}}, year = {2011}, } @inbook{2935, author = {Boykov, Yuri and Vladimir Kolmogorov}, booktitle = {Markov Random Fields for Vision and Image Processing}, editor = {Blake, Andrew and Kohli, Pushmeet and Rother, Carsten}, pages = {31 -- 50}, publisher = {Massachusetts Institute of Technology Press}, title = {{Basic graph cut algorithms}}, year = {2011}, } @inproceedings{2960, abstract = {Traditional statistical methods for the confidentiality protection for statistical databases do not scale well to deal with GWAS (genome-wide association studies) databases and external information on them. The more recent concept of differential privacy, introduced by the cryptographic community, is an approach which provides a rigorous definition of privacy with meaningful privacy guarantees in the presence of arbitrary external information. Building on such notions, we propose new methods to release aggregate GWAS data without compromising an individual's privacy. We present methods for releasing differentially private minor allele frequencies, chi-square statistics and p-values. We compare these approaches on simulated data and on a GWAS study of canine hair length involving 685 dogs. We also propose a privacy-preserving method for finding genome-wide associations based on a differentially private approach to penalized logistic regression.}, author = {Fienberg, Stephen E and Slavkovic, Aleksandra and Caroline Uhler}, publisher = {IEEE}, title = {{Privacy Preserving GWAS Data Sharing}}, doi = {10.1109/ICDMW.2011.140}, year = {2011}, } @article{2961, abstract = {Rapid research progress in genotyping techniques have allowed large genome-wide association studies. Existing methods often focus on determining associations between single loci and a specic phenotype. However, a particular phenotype is usually the result of complex relationships between multiple loci and the environment. In this paper, we describe a two-stage method for detecting epistasis by combining the traditionally used single-locus search with a search for multiway interactions. Our method is based on an extended version of Fisher's exact test. To perform this test, a Markov chain is constructed on the space of multidimensional contingency tables using the elements of a Markov basis as moves. We test our method on simulated data and compare it to a two-stage logistic regression method and to a fully Bayesian method, showing that we are able to detect the interacting loci when other methods fail to do so. Finally, we apply our method to a genome-wide data set consisting of 685 dogs and identify epistasis associated with canine hair length for four pairs of single nucleotide polymorphisms (SNPs).}, author = {Malaspinas, Anna-Sapfo and Caroline Uhler}, journal = {Journal of Algebraic Statistics}, number = {1}, pages = {36 -- 53}, publisher = {Public Knowledge Project}, title = {{Detecting epistasis via Markov bases}}, doi = {http://dx.doi.org/10.18409/jas.v2i1.27}, volume = {2}, year = {2011}, } @inproceedings{2975, abstract = {Zero-knowledge proofs of knowledge (ZK-PoK) for discrete logarithms and related problems are indispensable for practical cryptographic protocols. Recently, Camenisch, Kiayias, and Yung provided a specification language (the CKY-language) for such protocols which allows for a modular design and protocol analysis: for every zero-knowledge proof specified in this language, protocol designers are ensured that there exists an efficient protocol which indeed proves the specified statement. However, the protocols resulting from their compilation techniques only satisfy the classical notion of ZK-PoK, which is not retained are when they used as building blocks for higher-level applications or composed with other protocols. This problem can be tackled by moving to the Universal Composability (UC) framework, which guarantees retention of security when composing protocols in arbitrary ways. While there exist generic transformations from $\Sigma$-protocols to UC-secure protocols, these transformation are often too inefficient for practice. In this paper we introduce a specification language akin to the CKY-language and a compiler such that the resulting protocols are UC-secure and efficient. To this end, we propose an extension of the UC-framework addressing the issue that UC-secure zero-knowledge proofs are by definition proofs of knowledge, and state a special composition theorem which allows one to use the weaker -- but more efficient and often sufficient -- notion of proofs of membership in the UC-framework. We believe that our contributions enable the design of practically efficient protocols that are UC-secure and thus themselves can be used as building blocks.}, author = {Camenisch, Jan and Stephan Krenn and Shoup, Victor}, editor = {Lee, Dong Hoon and Wang, Xiaoyun}, pages = {449 -- 467}, publisher = {Springer}, title = {{A Framework for Practical Universally Composable Zero-Knowledge Protocols}}, doi = {10.1007/978-3-642-25385-0}, volume = {7073}, year = {2011}, } @inproceedings{2976, abstract = {Side channel attacks on cryptographic systems exploit information gained from physical implementations rather than theoretical weaknesses of a scheme. In recent years, major achievements were made for the class of so called access-driven cache attacks. Such attacks exploit the leakage of the memory locations accessed by a victim process. In this paper we consider the AES block cipher and present an attack which is capable of recovering the full secret key in almost realtime for AES-128, requiring only a very limited number of observed encryptions. Unlike previous attacks, we do not require any information about the plaintext (such as its distribution, etc.). Moreover, for the first time, we also show how the plaintext can be recovered without having access to the ciphertext at all. It is the first working attack on AES implementations using compressed tables. There, no efficient techniques to identify the beginning of AES rounds is known, which is the fundamental assumption underlying previous attacks. We have a fully working implementation of our attack which is able to recover AES keys after observing as little as 100 encryptions. It works against the OpenSSL 0.9.8n implementation of AES on Linux systems. Our spy process does not require any special privileges beyond those of a standard Linux user. A contribution of probably independent interest is a denial of service attack on the task scheduler of current Linux systems (CFS), which allows one to observe (on average) every single memory access of a victim process.}, author = {Gullasch, David and Bangerter, Endre and Stephan Krenn}, pages = {490 -- 505}, publisher = {IEEE}, title = {{Cache Games - Bringing Access-Based Cache Attacks on AES to Practice}}, doi = {10.1109/SP.2011.22}, year = {2011}, } @inproceedings{2977, abstract = {Cryptographic two-party protocols are used ubiquitously in everyday life. While some of these protocols are easy to understand and implement (e.g., key exchange or transmission of encrypted data), many of them are much more complex (e.g., e-banking and e-voting applications, or anonymous authentication and credential systems). For a software engineer without appropriate cryptographic skills the implementation of such protocols is often difficult, time consuming and error-prone. For this reason, a number of compilers supporting programmers have been published in recent years. However, they are either designed for very specific cryptographic primitives (e.g., zero-knowledge proofs of knowledge), or they only offer a very low level of abstraction and thus again demand substantial mathematical and cryptographic skills from the programmer. Finally, some of the existing compilers do not produce executable code, but only metacode which has to be instantiated with mathematical libraries, encryption routines, etc. before it can actually be used. In this paper we present a cryptographically aware compiler which is equally useful to cryptographers who want to benchmark protocols designed on paper, and to programmers who want to implement complex security sensitive protocols without having to understand all subtleties. Our tool offers a high level of abstraction and outputs well-structured and documented Java code. We believe that our compiler can contribute to shortening the development cycles of cryptographic applications and to reducing their error-proneness.}, author = {Bangerter, Endre and Stephan Krenn and Seifriz, Martial and Ultes-Nitsche, Ulrich}, editor = {Venter, Hein S. and Coetzee, Marijke and Loock, Marianne}, publisher = {IEEE}, title = {{cPLC - A Cryptographic Programming Language and Compiler}}, doi = {10.1109/ISSA.2011.6027533}, year = {2011}, } @article{3082, abstract = {Shoot branching is one of the major determinants of plant architecture. Polar auxin transport in stems is necessary for the control of bud outgrowth by a dominant apex. Here, we show that following decapitation in pea (Pisum sativum L.), the axillary buds establish directional auxin export by subcellular polarization of PIN auxin transporters. Apical auxin application on the decapitated stem prevents this PIN polarization and canalization of laterally applied auxin. These results support a model in which the apical and lateral auxin sources compete for primary channels of auxin transport in the stem to control the outgrowth of axillary buds.}, author = {Balla, Jozef and Kalousek, Petr and Reinöhl, Vilém and Jirí Friml and Procházka, Stanislav}, journal = {Plant Journal}, number = {4}, pages = {571 -- 577}, publisher = {Wiley-Blackwell}, title = {{Competitive canalization of PIN dependent auxin flow from axillary buds controls pea bud outgrowth}}, doi = {10.1111/j.1365-313X.2010.04443.x}, volume = {65}, year = {2011}, } @article{3083, author = {Robinson, David G and Scheuring, David and Naramoto, Satoshi and Jirí Friml}, journal = {Plant Cell}, number = {3}, pages = {846 -- 849}, publisher = {American Society of Plant Biologists}, title = {{ARF1 localizes to the golgi and the trans Golgi network}}, doi = {10.1105/tpc.110.082099}, volume = {23}, year = {2011}, }