Distress call-induced gene expression in the brain of the Indian short-nosed fruit bat, Cynopterus sphinx

Individuals in distress emit audible vocalizations to either warn or inform conspecifics. The Indian short-nosed fruit bat, Cynopterus sphinx, emits distress calls soon after becoming entangled in mist nets, which appear to attract conspecifics. Phase I of these distress calls is longer and louder, and includes a secondary peak, compared to phase II. Activity-dependent expression of egr-1 was examined in free-ranging C. sphinx following the emissions and responses to a distress call. We found that the level of expression of egr-1 was higher in bats that emitted a distress call, in adults that responded, and in pups than in silent bats. Up-regulated cDNA was amplified to identify the target gene (TOE1) of the protein Egr-1. The observed expression pattern Toe1 was similar to that of egr-1. These findings suggest that the neuronal activity related to recognition of a distress call and an auditory feedback mechanism induces the expression of Egr-1. Co-expression of egr-1 with Toe1 may play a role in initial triggering of the genetic mechanism that could be involved in the consolidation or stabilization of distress call memories.

A note on the Hadwiger number of circular arc graphs

The intention of this note is to motivate the researchers to study Hadwiger's conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G, and let χ(G) denote its chromatic number. Hadwiger's conjecture states that η(G)greater-or-equal, slantedχ(G) and is one of the most important and difficult open problems in graph theory. From the point of view of researchers who are sceptical of the validity of the conjecture, it is interesting to study the conjecture for graph classes where η(G) is guaranteed not to grow too fast with respect to χ(G), since such classes of graphs are indeed a reasonable place to look for possible counterexamples. We show that in any circular arc graph G, η(G)less-than-or-equals, slant2χ(G)−1, and there is a family with equality. So, it makes sense to study Hadwiger's conjecture for this family.

Measurement of shock stand-off distance on a 120 degrees blunt cone model at hypersonic Mach number in Argon

The flow around a 120 degrees blunt cone model with a base radius of 60mm has been visualised at Mach 14.8 and 9.1 using argon as the test gas, at the newly established high speed schlieren facility in the IISc hypersonic shock tunnel HST2. The experimental shock stand off distance around the blunt cone is compared with that obtained using a commercial CFD package. The computed values of shock stand off distance of the blunt cone is found to agree reasonably well with the experimental data.

Long-lived giant number fluctuations in a swarming granular nematic

Coherently moving flocks of birds, beasts, or bacteria are examples of living matter with spontaneous orientational order. How do these systems differ from thermal equilibrium systems with such liquid crystalline order? Working with a fluidized monolayer of macroscopic rods in the nematic liquid crystalline phase, we find giant number fluctuations consistent with a standard deviation growing linearly with the mean, in contrast to any situation where the central limit theorem applies. These fluctuations are long-lived, decaying only as a logarithmic function of time. This shows that flocking, coherent motion, and large-scale inhomogeneity can appear in a system in which particles do not communicate except by contact.

Hadwiger Number and the Cartesian Product of Graphs

The Hadwiger number eta(G) of a graph G is the largest integer n for which the complete graph K-n on n vertices is a minor of G. Hadwiger conjectured that for every graph G, eta(G) >= chi(G), where chi(G) is the chromatic number of G. In this paper, we study the Hadwiger number of the Cartesian product G square H of graphs. As the main result of this paper, we prove that eta(G(1) square G(2)) >= h root 1 (1 - o(1)) for any two graphs G(1) and G(2) with eta(G(1)) = h and eta(G(2)) = l. We show that the above lower bound is asymptotically best possible when h >= l. This asymptotically settles a question of Z. Miller (1978). As consequences of our main result, we show the following: 1. Let G be a connected graph. Let G = G(1) square G(2) square ... square G(k) be the ( unique) prime factorization of G. Then G satisfies Hadwiger's conjecture if k >= 2 log log chi(G) + c', where c' is a constant. This improves the 2 log chi(G) + 3 bound in [2] 2. Let G(1) and G(2) be two graphs such that chi(G1) >= chi(G2) >= clog(1.5)(chi(G(1))), where c is a constant. Then G1 square G2 satisfies Hadwiger's conjecture. 3. Hadwiger's conjecture is true for G(d) (Cartesian product of G taken d times) for every graph G and every d >= 2. This settles a question by Chandran and Sivadasan [2]. ( They had shown that the Hadiwger's conjecture is true for G(d) if d >= 3).

Pollinator limitation and the effect of breeding systems on plant reproduction in forest fragments

Reproduction of plants in fragmented habitats may be limited because of lower diversity or abundance of pollinators, and/or variation in local plant density. We assessed natural fruit set and pollinator limitation in ten species of woody plants in natural and restored fragments in the Pondicherry region of southern India, to see whether breeding system of plants (self-compatible and self-incompatible) affected fruit set. We tested whether the number of flowering individuals in the fragments affected the fruit set and further examined the adult and sapling densities of self-compatible (SC) and self-incompatible (SI) species. We measured the natural level of fruit set and pollinator limitation (calculated as the difference in fruit set between hand cross-pollinated and naturally pollinated flowers). Our results demonstrate that there was a higher level of pollinator limitation and hence lower levels of natural fruit set in self-incompatible species as compared to self-compatible species. However, the hand cross-pollinated flowers in SC and SI species produced similar levels of fruit set,further indicating that lower fruit set was due to pollinator limitation and not due to lack of cross-compatible individuals in the fragments. There was no significant relation between number of flowering individuals and the levels of natural fruit set, except for two species Derris ovalifolia, Ixora pavetta. In these species the natural fruit set decreased with increasing population size, again indicating pollinator limitation. The adult and sapling densities in self-compatible species were significantly higher than inself-incompatible species. These findings indicate that the low reproductive output in self-incompatible species may eventually lead to lower population sizes. Restoration of pollinator services along with plant species in fragmented habitats is important for the long-term conservation of biodiversity. (C) 2009 Elsevier Masson SAS. All rights reserved.

Context-dependency of a complex fruit-frugivore mutualism: temporal variation in crop size and neighborhood effects

The quantity of fruit consumed by dispersers is highly variable among individuals within plant populations. The outcome Of Such selection operated by firugivores has been examined mostly with respect to changing spatial contexts. The influence of varying temporal contexts on frugivore choice, and their possible demographic and evolutionary consequences is poorly understood. We examined if temporal variation in fruit availability across a hierarchy of nested temporal levels (interannual, intraseasonal, 120 h, 24 h) altered frugivore choice for a complex seed dispersal system in dry tropical forests of southern India. The interactions between Phyllanthus emblica and its primary disperser (ruminants) was mediated by another frugivore (a primate),which made large quantities of fruit available on the ground to ruminants. The direction and strength of crop size and neighborhood effects on this interaction varied with changing temporal contexts.Fruit availability was higher in the first of the two study years, and at the start of the season in both years. Fruit persistence on trees,determined by primate foraging, was influenced by crop size andconspecific neighborhood densities only in the high fruit availability year. Fruit removal by ruminants was influenced by crop size in both years and neighborhood densities only in the high availability year. In both years, these effects were stronger at the start of the season.Intraseasonal reduction in fruit availability diminished inequalities in fruit removal by ruminants and the influence of crop size and fruiting neighborhoods. All trees were not equally attractive to frugivores in a P. emblica population at all points of time. Temporal asymmetry in frugivore-mediated selection could reduce potential for co-evolution between firugivores and plants by diluting selective pressures. Inter-dependencies; formed between disparate animal consumers can add additional levels of complexity to plant-frugivore mutualistic networks and have potential reproductive consequences for specific individuals within populations.

A cost effective pipelined divider for double precision floating point number

he growth of high-performance application in computer graphics, signal processing and scientific computing is a key driver for high performance, fixed latency; pipelined floating point dividers. Solutions available in the literature use large lookup table for double precision floating point operations.In this paper, we propose a cost effective, fixed latency pipelined divider using modified Taylor-series expansion for double precision floating point operations. We reduce chip area by using a smaller lookup table. We show that the latency of the proposed divider is 49.4 times the latency of a full-adder. The proposed divider reduces chip area by about 81% than the pipelined divider in [9] which is based on modified Taylor-series.

An Estimator Algorithm For Learning Automata With Changing Number Of Actions

In many problems of decision making under uncertainty the system has to acquire knowledge of its environment and learn the optimal decision through its experience. Such problems may also involve the system having to arrive at the globally optimal decision, when at each instant only a subset of the entire set of possible alternatives is available. These problems can be successfully modelled and analysed by learning automata. In this paper an estimator learning algorithm, which maintains estimates of the reward characteristics of the random environment, is presented for an automaton with changing number of actions. A learning automaton using the new scheme is shown to be e-optimal. The simulation results demonstrate the fast convergence properties of the new algorithm. The results of this study can be extended to the design of other types of estimator algorithms with good convergence properties.

Design of crosspoint-irredundant PLAs using minimal number of control inputs

The problem of determining a minimal number of control inputs for converting a programmable logic array (PLA) with undetectable faults to crosspoint-irredundant PLA for testing has been formulated as a nonstandard set covering problem. By representing subsets of sets as cubes, this problem has been reformulated as familiar problems. It is noted that this result has significance because a crosspoint-irredundant PLA can be converted to a completely testable PLA in a straightforward fashion, thus achieving very good fault coverage and easy testability.

Evolution of polyandry by reduction in progeny number variance in structured populations

When there is a variation in the quality of males in a population, multiple mating can lead to an increase in the genetic fitness of a female by reducing the variance of the progeny number. The extent of selective advantage obtainable by this process is investigated for a population subdivided into structured demes. It is seen that for a wide range of model parameters (deme size, distribution of male quality, local resource level), multiple mating leads to a considerable increase in the fitness. Frequency-dependent selection or a stable coexistence between polyandry and monandry can also result when the possible costs involved in multiple mating are taken into account.

On Finding the Natural Number of Topics with Latent Dirichlet Allocation: Some Observations

It is important to identify the ``correct'' number of topics in mechanisms like Latent Dirichlet Allocation(LDA) as they determine the quality of features that are presented as features for classifiers like SVM. In this work we propose a measure to identify the correct number of topics and offer empirical evidence in its favor in terms of classification accuracy and the number of topics that are naturally present in the corpus. We show the merit of the measure by applying it on real-world as well as synthetic data sets(both text and images). In proposing this measure, we view LDA as a matrix factorization mechanism, wherein a given corpus C is split into two matrix factors M-1 and M-2 as given by C-d*w = M1(d*t) x Q(t*w).Where d is the number of documents present in the corpus anti w is the size of the vocabulary. The quality of the split depends on ``t'', the right number of topics chosen. The measure is computed in terms of symmetric KL-Divergence of salient distributions that are derived from these matrix factors. We observe that the divergence values are higher for non-optimal number of topics - this is shown by a `dip' at the right value for `t'.

Design of speaker identification schemes for large number of speakers (A)

Design of speaker identification schemes for a small number of speakers (around 10) with a high degree of accuracy in controlled environment is a practical proposition today. When the number of speakers is large (say 50–100), many of these schemes cannot be directly extended, as both recognition error and computation time increase monotonically with population size. The feature selection problem is also complex for such schemes. Though there were earlier attempts to rank order features based on statistical distance measures, it has been observed only recently that the best two independent measurements are not the same as the combination in two's for pattern classification. We propose here a systematic approach to the problem using the decision tree or hierarchical classifier with the following objectives: (1) Design of optimal policy at each node of the tree given the tree structure i.e., the tree skeleton and the features to be used at each node. (2) Determination of the optimal feature measurement and decision policy given only the tree skeleton. Applicability of optimization procedures such as dynamic programming in the design of such trees is studied. The experimental results deal with the design of a 50 speaker identification scheme based on this approach.