Rapid behavioral transitions produce chaotic mixing by a planktonic microswimmer

Despite their vast morphological diversity, many invertebrates have similar larval forms characterized by ciliary bands, innervated arrays of beating cilia that facilitate swimming and feeding. Hydrodynamics suggests that these bands should tightly constrain the behavioral strategies available to the larvae; however, their apparent ubiquity suggests that these bands also confer substantial adaptive advantages. Here, we use hydrodynamic techniques to investigate "blinking," an unusual behavioral phenomenon observed in many invertebrate larvae in which ciliary bands across the body rapidly change beating direction and produce transient rearrangement of the local flow field. Using a general theoretical model combined with quantitative experiments on starfish larvae, we find that the natural rhythm of larval blinking is hydrodynamically optimal for inducing strong mixing of the local fluid environment due to transient streamline crossing, thereby maximizing the larvae's overall feeding rate. Our results are consistent with previous hypotheses that filter feeding organisms may use chaotic mixing dynamics to overcome circulation constraints in viscous environments, and it suggests physical underpinnings for complex neurally-driven behaviors in early-divergent animals.Comment: 20 pages, 4 figure

A High Speed Particle Phase Discriminator (PPD-HS) for the classification of airborne particles, as tested in a continuous flow diffusion chamber

© Author(s) 2019. This work is distributed under the Creative Commons Attribution 4.0 License.A new instrument, the High-speed Particle Phase Discriminator (PPD-HS), developed at the University of Hertfordshire, for sizing individual cloud hydrometeors and determining their phase is described herein. PPD-HS performs an in situ analysis of the spatial intensity distribution of near-forward scattered light for individual hydrometeors yielding shape properties. Discrimination of spherical and aspherical particles is based on an analysis of the symmetry of the recorded scattering patterns. Scattering patterns are collected onto two linear detector arrays, reducing the complete 2-D scattering pattern to scattered light intensities captured onto two linear, one-dimensional strips of light sensitive pixels. Using this reduced scattering information, we calculate symmetry indicators that are used for particle shape and ultimately phase analysis. This reduction of information allows for detection rates of a few hundred particles per second. Here, we present a comprehensive analysis of instrument performance using both spherical and aspherical particles generated in a well-controlled laboratory setting using a vibrating orifice aerosol generator (VOAG) and covering a size range of approximately 3-32 μm. We use supervised machine learning to train a random forest model on the VOAG data sets that can be used to classify any particles detected by PPD-HS. Classification results show that the PPD-HS can successfully discriminate between spherical and aspherical particles, with misclassification below 5% for diameters >3μm. This phase discrimination method is subsequently applied to classify simulated cloud particles produced in a continuous flow diffusion chamber setup. We report observations of small, near-spherical ice crystals at early stages of the ice nucleation experiments, where shape analysis fails to correctly determine the particle phase. Nevertheless, in the case of simultaneous presence of cloud droplets and ice crystals, the introduced particle shape indicators allow for a clear distinction between these two classes, independent of optical particle size. From our laboratory experiments we conclude that PPD-HS constitutes a powerful new instrument to size and discriminate the phase of cloud hydrometeors. The working principle of PPD-HS forms a basis for future instruments to study microphysical properties of atmospheric mixed-phase clouds that represent a major source of uncertainty in aerosol-indirect effect for future climate projections..Peer reviewe

Evolution of histone 2A for chromatin compaction in eukaryotes.

During eukaryotic evolution, genome size has increased disproportionately to nuclear volume, necessitating greater degrees of chromatin compaction in higher eukaryotes, which have evolved several mechanisms for genome compaction. However, it is unknown whether histones themselves have evolved to regulate chromatin compaction. Analysis of histone sequences from 160 eukaryotes revealed that the H2A N-terminus has systematically acquired arginines as genomes expanded. Insertion of arginines into their evolutionarily conserved position in H2A of a small-genome organism increased linear compaction by as much as 40%, while their absence markedly diminished compaction in cells with large genomes. This effect was recapitulated in vitro with nucleosomal arrays using unmodified histones, indicating that the H2A N-terminus directly modulates the chromatin fiber likely through intra- and inter-nucleosomal arginine-DNA contacts to enable tighter nucleosomal packing. Our findings reveal a novel evolutionary mechanism for regulation of chromatin compaction and may explain the frequent mutations of the H2A N-terminus in cancer

Data Layout Optimization and Code Transformation for Paged Memory Systems

Supercomputers need not only to have fast functional units, but also to have rapid access to massive quantities of data. Virtual memory paging and physically distributed memory systems both attempt to provide this large data space, but performance of a computer system using either memory organization is highly dependent on the page reference pattern and the number of pages available locally. Despite this, surprisingly little work has been done toward using the compiler to optimize memory system performance. In this paper, we introduce compiler techniques which use a combination of data layout and code transformation to improve paging performance for compiled programs. These same techniques can also be applied manually to improve performance using existing compilers

Counting Distinct Patterns in Internal Dictionary Matching

We consider the problem of preprocessing a text $T$ of length $n$ and a dictionary $\mathcal{D}$ in order to be able to efficiently answer queries $CountDistinct(i,j)$, that is, given $i$ and $j$ return the number of patterns from $\mathcal{D}$ that occur in the fragment $T[i \mathinner{.\,.} j]$. The dictionary is internal in the sense that each pattern in $\mathcal{D}$ is given as a fragment of $T$. This way, the dictionary takes space proportional to the number of patterns $d=|\mathcal{D}|$ rather than their total length, which could be $\Theta(n\cdot d)$. An $\tilde{\mathcal{O}}(n+d)$-size data structure that answers $CountDistinct(i,j)$ queries $\mathcal{O}(\log n)$-approximately in $\tilde{\mathcal{O}}(1)$ time was recently proposed in a work that introduced internal dictionary matching [ISAAC 2019]. Here we present an $\tilde{\mathcal{O}}(n+d)$-size data structure that answers $CountDistinct(i,j)$ queries $2$-approximately in $\tilde{\mathcal{O}}(1)$ time. Using range queries, for any $m$, we give an $\tilde{\mathcal{O}}(\min(nd/m,n^2/m^2)+d)$-size data structure that answers $CountDistinct(i,j)$ queries exactly in $\tilde{\mathcal{O}}(m)$ time. We also consider the special case when the dictionary consists of all square factors of the string. We design an $\mathcal{O}(n \log^2 n)$-size data structure that allows us to count distinct squares in a text fragment $T[i \mathinner{.\,.} j]$ in $\mathcal{O}(\log n)$ time.Comment: Accepted to CPM 202

String Searching with Ranking Constraints and Uncertainty

Strings play an important role in many areas of computer science. Searching pattern in a string or string collection is one of the most classic problems. Different variations of this problem such as document retrieval, ranked document retrieval, dictionary matching has been well studied. Enormous growth of internet, large genomic projects, sensor networks, digital libraries necessitates not just efficient algorithms and data structures for the general string indexing, but indexes for texts with fuzzy information and support for queries with different constraints. This dissertation addresses some of these problems and proposes indexing solutions. One such variation is document retrieval query for included and excluded/forbidden patterns, where the objective is to retrieve all the relevant documents that contains the included patterns and does not contain the excluded patterns. We continue the previous work done on this problem and propose more efficient solution. We conjecture that any significant improvement over these results is highly unlikely. We also consider the scenario when the query consists of more than two patterns. The forbidden pattern problem suffers from the drawback that linear space (in words) solutions are unlikely to yield a solution better than O(root(n/occ)) per document reporting time, where n is the total length of the documents and occ is the number of output documents. Continuing this path, we introduce a new variation, namely document retrieval with forbidden extension query, where the forbidden pattern is an extension of the included pattern.We also address the more general top-k version of the problem, which retrieves the top k documents, where the ranking is based on PageRank relevance metric. This problem finds motivation from search applications. It also holds theoretical interest as we show that the hardness of forbidden pattern problem is alleviated in this problem. We achieve linear space and optimal query time for this variation. We also propose succinct indexes for both these problems. Position restricted pattern matching considers the scenario where only part of the text is searched. We propose succinct index for this problem with efficient query time. An important application for this problem stems from searching in genomic sequences, where only part of the gene sequence is searched for interesting patterns. The problem of computing discriminating(resp. generic) words is to report all minimal(resp. maximal) extensions of a query pattern which are contained in at most(resp. at least) a given number of documents. These problems are motivated from applications in computational biology, text mining and automated text classification. We propose succinct indexes for these problems. Strings with uncertainty and fuzzy information play an important role in increasingly many applications. We propose a general framework for indexing uncertain strings such that a deterministic query string can be searched efficiently. String matching becomes a probabilistic event when a string contains uncertainty, i.e. each position of the string can have different probable characters with associated probability of occurrence for each character. Such uncertain strings are prevalent in various applications such as biological sequence data, event monitoring and automatic ECG annotations. We consider two basic problems of string searching, namely substring searching and string listing. We formulate these well known problems for uncertain strings paradigm and propose exact and approximate solution for them. We also discuss a constrained variation of orthogonal range searching. Given a set of points, the task of orthogonal range searching is to build a data structure such that all the points inside a orthogonal query region can be reported. We introduce a new variation, namely shared constraint range searching which naturally arises in constrained pattern matching applications. Shared constraint range searching is a special four sided range reporting query problem where two constraints has sharing among them, effectively reducing the number of independent constraints. For this problem, we propose a linear space index that can match the best known bound for three dimensional dominance reporting problem. We extend our data structure in the external memory model