Universality class of the reversible-irreversible transition in sheared suspensions

Collections of non-Brownian particles suspended in a viscous fluid and subjected to oscillatory shear at very low Reynolds number have recently been shown to exhibit a remarkable dynamical phase transition separating reversible from irreversible behavior as the strain amplitude or volume fraction are increased. We present a simple model for this phenomenon, based on which we argue that this transition lies in the universality class of the conserved directed percolation models. This leads to predictions for the scaling behavior of a large number of experimental observables. Non-Brownian suspensions under oscillatory shear may thus constitute the first experimental realization of an inactive-active phase transition which is not in the universality class of conventional directed percolation.

The Mechanics and Statistics of Active Matter

Active particles contain internal degrees of freedom with the ability to take in and dissipate energy and, in the process, execute systematic movement. Examples include all living organisms and their motile constituents such as molecular motors. This article reviews recent progress in applying the principles of nonequilibrium statistical mechanics and hydrodynamics to form a systematic theory of the behavior of collections of active particles-active matter-with only minimal regard to microscopic details. A unified view of the many kinds of active matter is presented, encompassing not only living systems but inanimate analogs. Theory and experiment are discussed side by side.

Generalized frequent episodes in Event Sequences

Discovering patterns in temporal data is an important task in Data Mining. A successful method for this was proposed by Mannila et al. [1] in 1997. In their framework, mining for temporal patterns in a database of sequences of events is done by discovering the so called frequent episodes. These episodes characterize interesting collections of events occurring relatively close to each other in some partial order. However, in this framework(and in many others for finding patterns in event sequences), the ordering of events in an event sequence is the only allowed temporal information. But there are many applications where the events are not instantaneous; they have time durations. Interesting episodesthat we want to discover may need to contain information regarding event durations etc. In this paper we extend Mannila et al.’s framework to tackle such issues. In our generalized formulation, episodes are defined so that much more temporal information about events can be incorporated into the structure of an episode. This significantly enhances the expressive capability of the rules that can be discovered in the frequent episode framework. We also present algorithms for discovering such generalized frequent episodes.

A digital herbarium for the flora of Karnataka

A herbarium-based database (virtual herbarium) is a referral system for plants that maximizes the usefulness of the collections. The information content of such a database is essentially built on the voucher specimens that the herbarium has in its care. The present article reports on the construction of a `virtual herbarium' for the state-wide collection of flowering plants in the Herbarium JCB housed at the Centre for Ecological Sciences, Indian Institute of Science, Bangalore, that is expected to be launched soon. The taxonomic data on each species include all information presented on the herbarium specimen label, namely species name, author citation, sub-species if any, variety if any, family, subfamily, collection number, locations, date of collection, habitat and the collector's name. The data further comprise `flora' in which the species are described. Additional information includes the nomenclature update according to `The Plant List', a detailed description, phenology, species distribution, threat status and comments on any special features of the taxon. The live images of the species provided in the database form an information synergy on the species. This initiative is the first of its kind for herbaria in peninsular India.

On the taxonomic status of Gegeneophis nadkarnii Bhatta & Prashanth, 2004 (Amphibia: Gymnophiona: Indotyphlidae)

Examination of type material and new collections from Goa, southern Maharashtra and northern Karnataka, leads to the conclusion that Gegeneophis nadkarnii Bhatta & Prashanth, 2004 is a subjective junior synonym of Gegeneophis danieli Giri, Wilkinson & Gower, 2003. The purported differences between these species are very minor and attributable to normal individual variation, except for some features of the dentition that are peculiar to the exceptionally abnormal paratype of G. nadkarnii. This taxonomic revision extends the known geographic range of G. danieli and suggests it could be transferred from Data Deficient to Least Concern status in the IUCN Red List.

Revision of the scolopendrid centipede digitipes Attems, 1930, from India (Chilopoda: Scolopendromorpha): reconciling molecular and morphological estimates of species diversity

Recent work on molecular phylogenetics of Scolopendridae from the Western Ghats, Peninsular India, has suggested the presence of six cryptic species of the otostigmine Digitipes Attems, 1930, together with three species described in previous taxonomic work by Jangi and Dass (1984). Digitipes is the correct generic attribution for a monophyletic group of Indian species, these being united with three species from tropical Africa (including the type) that share a distomedial process on the ultimate leg femur of males that is otherwise unknown in Otostigminae. Second maxillary characters previously used in the diagnosis of Digitipes are dismissed because Indian species do not possess the putatively diagnostic character states. Two new species from the Western Ghats that correspond to groupings identified based on monophyly, sequence divergence and coalescent analysis using molecular data are diagnosed based on distinct morphological characters. They are D. jangii and D. periyarensis n. spp. Three species named by Jangi and Dass (Digitipes barnabasi, D. coonoorensis and D. indicus) are revised based on new collections; D. indicus is a junior subjective synonym of Arthrorhabdus jonesii Verhoeff, 1938, the combination becoming Digitipes jonesii (Verhoeff, 1938) n. comb. The presence of Arthrorhabdus in India is accordingly refuted. Three putative species delimited by molecular and ecological data remain cryptic from the perspective of diagnostic morphological characters and are presently retained in D. barnabasi, D. jangii and D. jonesii. A molecularly-delimited species that resolved as sister group to a well-supported clade of Indian Digitipes is identified as Otostigmus ruficeps Pocock, 1890, originally described from a single specimen and revised herein. One Indian species originally assigned to Digitipes, D. gravelyi, deviates from confidently-assigned Digitipes with respect to several characters and is reassigned to Otostigmus, as O. gravelyi (Jangi and Dass, 1984) n. comb.

Hydrodynamics of soft active matter

This review summarizes theoretical progress in the field of active matter, placing it in the context of recent experiments. This approach offers a unified framework for the mechanical and statistical properties of living matter: biofilaments and molecular motors in vitro or in vivo, collections of motile microorganisms, animal flocks, and chemical or mechanical imitations. A major goal of this review is to integrate several approaches proposed in the literature, from semimicroscopic to phenomenological. In particular, first considered are ``dry'' systems, defined as those where momentum is not conserved due to friction with a substrate or an embedding porous medium. The differences and similarities between two types of orientationally ordered states, the nematic and the polar, are clarified. Next, the active hydrodynamics of suspensions or ``wet'' systems is discussed and the relation with and difference from the dry case, as well as various large-scale instabilities of these nonequilibrium states of matter, are highlighted. Further highlighted are various large-scale instabilities of these nonequilibrium states of matter. Various semimicroscopic derivations of the continuum theory are discussed and connected, highlighting the unifying and generic nature of the continuum model. Throughout the review, the experimental relevance of these theories for describing bacterial swarms and suspensions, the cytoskeleton of living cells, and vibrated granular material is discussed. Promising extensions toward greater realism in specific contexts from cell biology to animal behavior are suggested, and remarks are given on some exotic active-matter analogs. Last, the outlook for a quantitative understanding of active matter, through the interplay of detailed theory with controlled experiments on simplified systems, with living or artificial constituents, is summarized.

Delay optimal scheduling of a discrete-time batch service queue for point-to-point channel code rate selection

We consider the problem of characterizing the minimum average delay, or equivalently the minimum average queue length, of message symbols randomly arriving to the transmitter queue of a point-to-point link which dynamically selects a (n, k) block code from a given collection. The system is modeled by a discrete time queue with an IID batch arrival process and batch service. We obtain a lower bound on the minimum average queue length, which is the optimal value for a linear program, using only the mean (λ) and variance (σ2) of the batch arrivals. For a finite collection of (n, k) codes the minimum achievable average queue length is shown to be Θ(1/ε) as ε ↓ 0 where ε is the difference between the maximum code rate and λ. We obtain a sufficient condition for code rate selection policies to achieve this optimal growth rate. A simple family of policies that use only one block code each as well as two other heuristic policies are shown to be weakly optimal in the sense of achieving the 1/ε growth rate. An appropriate selection from the family of policies that use only one block code each is also shown to achieve the optimal coefficient σ2/2 of the 1/ε growth rate. We compare the performance of the heuristic policies with the minimum achievable average queue length and the lower bound numerically. For a countable collection of (n, k) codes, the optimal average queue length is shown to be Ω(1/ε). We illustrate the selectivity among policies of the growth rate optimality criterion for both finite and countable collections of (n, k) block codes.

Mining Unit Tests for Discovery and Migration of Math APIs

Today's programming languages are supported by powerful third-party APIs. For a given application domain, it is common to have many competing APIs that provide similar functionality. Programmer productivity therefore depends heavily on the programmer's ability to discover suitable APIs both during an initial coding phase, as well as during software maintenance. The aim of this work is to support the discovery and migration of math APIs. Math APIs are at the heart of many application domains ranging from machine learning to scientific computations. Our approach, called MATHFINDER, combines executable specifications of mathematical computations with unit tests (operational specifications) of API methods. Given a math expression, MATHFINDER synthesizes pseudo-code comprised of API methods to compute the expression by mining unit tests of the API methods. We present a sequential version of our unit test mining algorithm and also design a more scalable data-parallel version. We perform extensive evaluation of MATHFINDER (1) for API discovery, where math algorithms are to be implemented from scratch and (2) for API migration, where client programs utilizing a math API are to be migrated to another API. We evaluated the precision and recall of MATHFINDER on a diverse collection of math expressions, culled from algorithms used in a wide range of application areas such as control systems and structural dynamics. In a user study to evaluate the productivity gains obtained by using MATHFINDER for API discovery, the programmers who used MATHFINDER finished their programming tasks twice as fast as their counterparts who used the usual techniques like web and code search, IDE code completion, and manual inspection of library documentation. For the problem of API migration, as a case study, we used MATHFINDER to migrate Weka, a popular machine learning library. Overall, our evaluation shows that MATHFINDER is easy to use, provides highly precise results across several math APIs and application domains even with a small number of unit tests per method, and scales to large collections of unit tests.