Interspecies and intraspecies interactions in social amoebae

The stable co-existence of individuals of different genotypes and reproductive division of labour within heterogeneous groups are issues of fundamental interest from the viewpoint of evolution. Cellular slime moulds are convenient organisms in which to address both issues. Strains of a species co-occur, as do different species; social groups are often genetically heterogeneous. Intra- and interspecies 1:1 mixes of wild isolates of Dictyostelium giganteum and D.purpureum form chimaeric aggregates, following which they segregate to varying extents. Intraspecies aggregates develop in concert and give rise to chimaeric fruiting bodies that usually contain more spores (reproductives) of one component than the other. Reproductive skew and variance in the proportion of reproductives are positively correlated. Interspecies aggregates exhibit almost complete sorting; most spores in a fruiting body come from a single species. Between strains, somatic compatibility correlates weakly with sexual compatibility. It is highest within clones, lower between strains of a species and lowest between strains of different species. Trade-offs among fitness-related traits (between compatible strains), sorting out (between incompatible strains) and avoidance (between species) appear to lie behind coexistence.

Note on modelling directionality in piezoresistivity

When computing the change in electrical resistivity of a piezoresistive cubic material embedded in a deforming structure, the piezoresistive and the stress tensors should be in the same coordinate system. While the stress tensor is usually calculated in a coordinate system aligned with the principal axes of a regular structure, the specified piezoresistive coefficients may not be in that coordinate system. For instance, piezoresistive coefficients are usually given in an orthogonal cartesian coordinate system aligned with the <100> crystallographic directions and designers sometimes deliberately orient a crystallographic direction other than <100> along the principal directions of the structure to increase the gauge factor. In such structures, it is advantageous to calculate the piezoresistivity tensor in the coordinate system along which the stress tensors are known rather than the other way around. This is because the transformation of stress will have to be done at every point in the structure but piezoresistivity tensor needs to be transformed only once. Here, using tensor transformation relations, we show how to calculate the piezoresistive tensor along any arbitrary Cartesian coordinate system from the piezoresistive coefficients for the <100> coordinate system. Some of the software packages that simulate the piezoresistive effect do not have interfaces for calculation of the entire piezoresistive tensor for arbitrary directions. This warrants additional work for the user because not considering the complete piezoresisitive tensor can lead to large errors. This is illustrated with an example where the error is as high as 33%. Additionally, for elastic analysis, we used hybrid finite element formulation that estimates stresses more accurately than displacement-based formulation. Therefore, as shown in an example where the change in resistance can be calculated analytically, the percentage error of our piezoresistive program is an order of magnitude lower relative to displacement-based finite element method.

Spatial variation of seismicity parameters across India and adjoining areas

An attempt has been made to quantify the variability in the seismic activity rate across the whole of India and adjoining areas (0–45°N and 60–105°E) using earthquake database compiled from various sources. Both historical and instrumental data were compiled and the complete catalog of Indian earthquakes till 2010 has been prepared. Region-specific earthquake magnitude scaling relations correlating different magnitude scales were achieved to develop a homogenous earthquake catalog for the region in unified moment magnitude scale. The dependent events (75.3%) in the raw catalog have been removed and the effect of aftershocks on the variation of b value has been quantified. The study area was divided into 2,025 grid points (1°91°) and the spatial variation of the seismicity across the region have been analyzed considering all the events within 300 km radius from each grid point. A significant decrease in seismic b value was seen when declustered catalog was used which illustrates that a larger proportion of dependent events in the earthquake catalog are related to lower magnitude events. A list of 203,448 earth- quakes (including aftershocks and foreshocks) occurred in the region covering the period from 250 B.C. to 2010 A.D. with all available details is uploaded in the website http://www.civil.iisc.ernet.in/*sreevals/resource.htm.

Multimodal therapy for complete regression of malignant melanoma using constrained nonlinear optimal dynamic inversion

Using a realistic nonlinear mathematical model for melanoma dynamics and the technique of optimal dynamic inversion (exact feedback linearization with static optimization), a multimodal automatic drug dosage strategy is proposed in this paper for complete regression of melanoma cancer in humans. The proposed strategy computes different drug dosages and gives a nonlinear state feedback solution for driving the number of cancer cells to zero. However, it is observed that when tumor is regressed to certain value, then there is no need of external drug dosages as immune system and other therapeutic states are able to regress tumor at a sufficiently fast rate which is more than exponential rate. As model has three different drug dosages, after applying dynamic inversion philosophy, drug dosages can be selected in optimized manner without crossing their toxicity limits. The combination of drug dosages is decided by appropriately selecting the control design parameter values based on physical constraints. The process is automated for all possible combinations of the chemotherapy and immunotherapy drug dosages with preferential emphasis of having maximum possible variety of drug inputs at any given point of time. Simulation study with a standard patient model shows that tumor cells are regressed from 2 x 107 to order of 105 cells because of external drug dosages in 36.93 days. After this no external drug dosages are required as immune system and other therapeutic states are able to regress tumor at greater than exponential rate and hence, tumor goes to zero (less than 0.01) in 48.77 days and healthy immune system of the patient is restored. Study with different chemotherapy drug resistance value is also carried out. (C) 2014 Elsevier Ltd. All rights reserved.

BELIEF PROPAGATION FOR OPTIMAL EDGE COVER IN THE RANDOM COMPLETE GRAPH

We apply the objective method of Aldous to the problem of finding the minimum-cost edge cover of the complete graph with random independent and identically distributed edge costs. The limit, as the number of vertices goes to infinity, of the expected minimum cost for this problem is known via a combinatorial approach of Hessler and Wastlund. We provide a proof of this result using the machinery of the objective method and local weak convergence, which was used to prove the (2) limit of the random assignment problem. A proof via the objective method is useful because it provides us with more information on the nature of the edge's incident on a typical root in the minimum-cost edge cover. We further show that a belief propagation algorithm converges asymptotically to the optimal solution. This can be applied in a computational linguistics problem of semantic projection. The belief propagation algorithm yields a near optimal solution with lesser complexity than the known best algorithms designed for optimality in worst-case settings.

Estimating the volume of glaciers in the Himalayan-Karakoram region using different methods

Ice volume estimates are crucial for assessing water reserves stored in glaciers. Due to its large glacier coverage, such estimates are of particular interest for the Himalayan-Karakoram (HK) region. In this study, different existing methodologies are used to estimate the ice reserves: three area-volume relations, one slope-dependent volume estimation method, and two ice-thickness distribution models are applied to a recent, detailed, and complete glacier inventory of the HK region, spanning over the period 2000-2010 and revealing an ice coverage of 40 775 km(2). An uncertainty and sensitivity assessment is performed to investigate the influence of the observed glacier area and important model parameters on the resulting total ice volume. Results of the two ice-thickness distribution models are validated with local ice-thickness measurements at six glaciers. The resulting ice volumes for the entire HK region range from 2955 to 4737 km(3), depending on the approach. This range is lower than most previous estimates. Results from the ice thickness distribution models and the slope-dependent thickness estimations agree well with measured local ice thicknesses. However, total volume estimates from area-related relations are larger than those from other approaches. The study provides evidence on the significant effect of the selected method on results and underlines the importance of a careful and critical evaluation.

LOWER BOUNDS FOR BOXICITY

An axis-parallel b-dimensional box is a Cartesian product R-1 x R-2 x ... x R-b where R-i is a closed interval of the form a(i),b(i)] on the real line. For a graph G, its boxicity box(G) is the minimum dimension b, such that G is representable as the intersection graph of boxes in b-dimensional space. Although boxicity was introduced in 1969 and studied extensively, there are no significant results on lower bounds for boxicity. In this paper, we develop two general methods for deriving lower bounds. Applying these methods we give several results, some of which are listed below: 1. The boxicity of a graph on n vertices with no universal vertices and minimum degree delta is at least n/2(n-delta-1). 2. Consider the g(n,p) model of random graphs. Let p <= 1 - 40logn/n(2.) Then with high `` probability, box(G) = Omega(np(1 - p)). On setting p = 1/2 we immediately infer that almost all graphs have boxicity Omega(n). Another consequence of this result is as follows: For any positive constant c < 1, almost all graphs on n vertices and m <= c((n)(2)) edges have boxicity Omega(m/n). 3. Let G be a connected k-regular graph on n vertices. Let lambda be the second largest eigenvalue in absolute value of the adjacency matrix of G. Then, the boxicity of G is a least (kappa(2)/lambda(2)/log(1+kappa(2)/lambda(2))) (n-kappa-1/2n). 4. For any positive constant c 1, almost all balanced bipartite graphs on 2n vertices and m <= cn(2) edges have boxicity Omega(m/n).

Energy-efficient, delay-constrained, QoS-aware broadcast for cooperative wireless sensor networks

The problem of delay-constrained, energy-efficient broadcast in cooperative wireless networks is NP-complete. While centralised setting allows some heuristic solutions, designing heuristics in distributed implementation poses significant challenges. This is more so in wireless sensor networks (WSNs) where nodes are deployed randomly and topology changes dynamically due to node failure/join and environment conditions. This paper demonstrates that careful design of network infrastructure can achieve guaranteed delay bounds and energy-efficiency, and even meet quality of service requirements during broadcast. The paper makes three prime contributions. First, we present an optimal lower bound on energy consumption for broadcast that is tighter than what has been previously proposed. Next, iSteiner, a lightweight, distributed and deterministic algorithm for creation of network infrastructure is discussed. iPercolate is the algorithm that exploits this structure to cooperatively broadcast information with guaranteed delivery and delay bounds, while allowing real-time traffic to pass undisturbed.

On the Communication Complexity of Secret Key Generation in the Multiterminal Source Model

Communication complexity refers to the minimum rate of public communication required for generating a maximal-rate secret key (SK) in the multiterminal source model of Csiszar and Narayan. Tyagi recently characterized this communication complexity for a two-terminal system. We extend the ideas in Tyagi's work to derive a lower bound on communication complexity in the general multiterminal setting. In the important special case of the complete graph pairwise independent network (PIN) model, our bound allows us to determine the exact linear communication complexity, i.e., the communication complexity when the communication and SK are restricted to be linear functions of the randomness available at the terminals.

High Temperatures Result in Smaller Nurseries which Lower Reproduction of Pollinators and Parasites in a Brood Site Pollination Mutualism

In a nursery pollination mutualism, we asked whether environmental factors affected reproduction of mutualistic pollinators, non-mutualistic parasites and seed production via seasonal changes in plant traits such as inflorescence size and within-tree reproductive phenology. We examined seasonal variation in reproduction in Ficus racemosa community members that utilise enclosed inflorescences called syconia as nurseries. Temperature, relative humidity and rainfall defined four seasons: winter; hot days, cold nights; summer and wet seasons. Syconium volumes were highest in winter and lowest in summer, and affected syconium contents positively across all seasons. Greater transpiration from the nurseries was possibly responsible for smaller syconia in summer. The 3-5 degrees C increase in mean temperatures between the cooler seasons and summer reduced fig wasp reproduction and increased seed production nearly two-fold. Yet, seed and pollinator progeny production were never negatively related in any season confirming the mutualistic fig-pollinator association across seasons. Non-pollinator parasites affected seed production negatively in some seasons, but had a surprisingly positive relationship with pollinators in most seasons. While within-tree reproductive phenology did not vary across seasons, its effect on syconium inhabitants varied with season. In all seasons, within-tree reproductive asynchrony affected parasite reproduction negatively, whereas it had a positive effect on pollinator reproduction in winter and a negative effect in summer. Seasonally variable syconium volumes probably caused the differential effect of within-tree reproductive phenology on pollinator reproduction. Within-tree reproductive asynchrony itself was positively affected by intra-tree variation in syconium contents and volume, creating a unique feedback loop which varied across seasons. Therefore, nursery size affected fig wasp reproduction, seed production and within-tree reproductive phenology via the feedback cycle in this system. Climatic factors affecting plant reproductive traits cause biotic relationships between plants, mutualists and parasites to vary seasonally and must be accorded greater attention, especially in the context of climate change.

Belief propagation for minimum weight many-to-one matchings in the random complete graph

In a complete bipartite graph with vertex sets of cardinalities n and n', assign random weights from exponential distribution with mean 1, independently to each edge. We show that, as n -> infinity, with n' = n/alpha] for any fixed alpha > 1, the minimum weight of many-to-one matchings converges to a constant (depending on alpha). Many-to-one matching arises as an optimization step in an algorithm for genome sequencing and as a measure of distance between finite sets. We prove that a belief propagation (BP) algorithm converges asymptotically to the optimal solution. We use the objective method of Aldous to prove our results. We build on previous works on minimum weight matching and minimum weight edge cover problems to extend the objective method and to further the applicability of belief propagation to random combinatorial optimization problems.

Lower bounds for testing triangle-freeness in Boolean functions

Given a Boolean function , we say a triple (x, y, x + y) is a triangle in f if . A triangle-free function contains no triangle. If f differs from every triangle-free function on at least points, then f is said to be -far from triangle-free. In this work, we analyze the query complexity of testers that, with constant probability, distinguish triangle-free functions from those -far from triangle-free. Let the canonical tester for triangle-freeness denotes the algorithm that repeatedly picks x and y uniformly and independently at random from , queries f(x), f(y) and f(x + y), and checks whether f(x) = f(y) = f(x + y) = 1. Green showed that the canonical tester rejects functions -far from triangle-free with constant probability if its query complexity is a tower of 2's whose height is polynomial in . Fox later improved the height of the tower in Green's upper bound to . A trivial lower bound of on the query complexity is immediate. In this paper, we give the first non-trivial lower bound for the number of queries needed. We show that, for every small enough , there exists an integer such that for all there exists a function depending on all n variables which is -far from being triangle-free and requires queries for the canonical tester. We also show that the query complexity of any general (possibly adaptive) one-sided tester for triangle-freeness is at least square root of the query complexity of the corresponding canonical tester. Consequently, this means that any one-sided tester for triangle-freeness must make at least queries.

Lower bounds on Ricci flow invariant curvatures and geometric applications

We consider Ricci flow invariant cones C in the space of curvature operators lying between the cones ``nonnegative Ricci curvature'' and ``nonnegative curvature operator''. Assuming some mild control on the scalar curvature of the Ricci flow, we show that if a solution to the Ricci flow has its curvature operator which satisfies R + epsilon I is an element of C at the initial time, then it satisfies R + epsilon I is an element of C on some time interval depending only on the scalar curvature control. This allows us to link Gromov-Hausdorff convergence and Ricci flow convergence when the limit is smooth and R + I is an element of C along the sequence of initial conditions. Another application is a stability result for manifolds whose curvature operator is almost in C. Finally, we study the case where C is contained in the cone of operators whose sectional curvature is nonnegative. This allows us to weaken the assumptions of the previously mentioned applications. In particular, we construct a Ricci flow for a class of (not too) singular Alexandrov spaces.

Lower-Bound Axisymmetric Formulation for Geomechanics Problems Using Nonlinear Optimization

A lower-bound limit analysis formulation, by using two-dimensional finite elements, the three-dimensional Mohr-Coulomb yield criterion, and nonlinear optimization, has been given to deal with an axisymmetric geomechanics stability problem. The optimization was performed using an interior point method based on the logarithmic barrier function. The yield surface was smoothened (1) by removing the tip singularity at the apex of the pyramid in the meridian plane and (2) by eliminating the stress discontinuities at the corners of the yield hexagon in the pi-plane. The circumferential stress (sigma(theta)) need not be assumed. With the proposed methodology, for a circular footing, the bearing-capacity factors N-c, N-q, and N-gamma for different values of phi have been computed. For phi = 0, the variation of N-c with changes in the factor m, which accounts for a linear increase of cohesion with depth, has been evaluated. Failure patterns for a few cases have also been drawn. The results from the formulation provide a good match with the solutions available from the literature. (C) 2014 American Society of Civil Engineers.

Bearing capacity of circular footings over rock mass by using axisymmetric quasi lower bound finite element limit analysis

The ultimate bearing capacity of a circular footing, placed over rock mass, is evaluated by using the lower bound theorem of the limit analysis in conjunction with finite elements and nonlinear optimization. The generalized Hoek-Brown (HB) failure criterion, but by keeping a constant value of the exponent, alpha = 0.5, was used. The failure criterion was smoothened both in the meridian and pi planes. The nonlinear optimization was carried out by employing an interior point method based on the logarithmic barrier function. The results for the obtained bearing capacity were presented in a non-dimensional form for different values of GSI, m(i), sigma(ci)/(gamma b) and q/sigma(ci). Failure patterns were also examined for a few cases. For validating the results, computations were also performed for a strip footing as well. The results obtained from the analysis compare well with the data reported in literature. Since the equilibrium conditions are precisely satisfied only at the centroids of the elements, not everywhere in the domain, the obtained lower bound solution will be approximate not true. (C) 2015 Elsevier Ltd. All rights reserved.