Matching sender and receiver: poikilothermy and frequency tuning in a tree cricket

Animals communicate in non-ideal and noisy conditions. The primary method they use to improve communication efficiency is sender-receiver matching: the receiver's sensory mechanism filters the impinging signal based on the expected signal. In the context of acoustic communication in crickets, such a match is made in the frequency domain. The males broadcast a mate attraction signal, the calling song, in a narrow frequency band centred on the carrier frequency (CF), and the females are most sensitive to sound close to this frequency. In tree crickets, however, the CF changes with temperature. The mechanisms used by female tree crickets to accommodate this change in CF were investigated at the behavioural and biomechanical level. At the behavioural level, female tree crickets were broadly tuned and responded equally to CFs produced within the naturally occurring range of temperatures (18 to 27 degrees C). To allow such a broad response, however, the transduction mechanisms that convert sound into mechanical and then neural signals must also have a broad response. The tympana of the female tree crickets exhibited a frequency response that was even broader than suggested by the behaviour. Their tympana vibrate with equal amplitude to frequencies spanning nearly an order of magnitude. Such a flat frequency response is unusual in biological systems and cannot be modelled as a simple mechanical system. This feature of the tree cricket auditory system not only has interesting implications for mate choice and species isolation but may also prove exciting for bio-mimetic applications such as the design of miniature low frequency microphones.

Assessment of genetic diversity and identification of core collection in sandalwood germplasm using RAPDS

Sandalwood is an economically important aromatic tree belonging to the family Santalaceae. The trees are used mainly for their fragrant heartwood and oil that have immense potential for foreign exchange. Very little information is available on the genetic diversity in this species. Hence studies were initiated and genetic diversity estimated using RAPD markers in 51 genotypes of Santalum album procured from different geographcial regions of India and three exotic lines of S. spicatum from Australia. Eleven selected Operon primers (10mer) generated a total of 156 consistent and unambiguous amplification products ranging from 200bp to 4kb. Rare and genotype specific bands were identified which could be effectively used to distinguish the genotypes. Genetic relationships within the genotypes were evaluated by generating a dissimilarity matrix based on Ward's method (Squared Euclidean distance). The phenetic dendrogram and the Principal Component Analysis generated, separated the 51 Indian genotypes from the three Australian lines. The cluster analysis indicated that sandalwood germplasm within India constitutes a broad genetic base with values of genetic dissimilarity ranging from 15 to 91 %. A core collection of 21 selected individuals revealed the same diversity of the entire population. The results show that RAPD analysis is an efficient marker technology for estimating genetic diversity and relatedness, thereby enabling the formulation of appropriate strategies for conservation, germplasm management, and selection of diverse parents for sandalwood improvement programmes.

The role of competition and habitat in structuring small mammal communities in a tropical montane ecosystem in southern India

Small mammals were sampled in two natural habitats (montane stunted evergreen forests and montane grassland) and four anthropogenic habitats (tea, wattle, bluegum and pine plantation) in the Upper Nilgiris in southern India. Of the species trapped, eight were in montane evergreen forests and three were in other habitats. Habitat discrimination was studied in the rodents Rattus rattus and Mus famulus and the shrew Suncus montanus in the montane forest habitat. Multivariate tests on five variables (canopy cover, midstorey density, ground cover, tree density, canopy height) showed that R. rattus uses areas of higher tree density and lower canopy cover. Suncus montanus and M. famulus use habitat with higher tree density and ground cover and lower canopy height. Multivariate tests did not discriminate habitat use between the species. Univariate tests, however, showed that M. famulus uses areas of higher tree density than R. rattus and S. montanus. Rattus rattus was the dominant species in the montane forest, comprising 60.9% of total density, while the rodent Millardia meltada was the dominant species in the grassland. Studies of spatial interaction between these two species in habitats where they coexisted showed neither overlap nor avoidance between the species. Rattus rattus, however, did use areas of lower ground cover than did M. meltada. The analysis of spatial interactions between the species, habitat discrimination and use, and the removal experiments suggest that interspecific competition may not be a strong force in structuring these small mammal communities. There are distinct patterns in the use of different habitats by some species, but microhabitat selection and segregation is weak. Other factors such as intraspecific competition may play a more important role in these communities.

Lubricity of an oil in water emulsion in metal cutting: The effect of hydrophilic/lypophilic balance of emulsifiers

A steel disc is cut using a single point tool. The coefficient of friction of the nascent cut surface is measured by a spherical steel pin situated in close proximity of the point of cutting. The tool, disc and the friction pin are immersed in an oil in water emulsion bath during the experiment. The purpose of the experiments conducted here is to record the effect of hydrophilic/lypophilic balance (HLB) of the emulsifier on the lubricity experienced in the cutting operation. The more lypophilic emulsifiers were found to give greater lubricity than what is recorded when the emulsifier is more hydrophilic. XPS and FTIR spectroscopy are used to explore the tribofilm generated on the nascent cut surface to indicate a possible rationale for the effect. (C) 2011 Elsevier B.V. All rights reserved.

Efficient statistical modeling for the compression of tree structured intermediate code

We propose a scheme for the compression of tree structured intermediate code consisting of a sequence of trees specified by a regular tree grammar. The scheme is based on arithmetic coding, and the model that works in conjunction with the coder is automatically generated from the syntactical specification of the tree language. Experiments on data sets consisting of intermediate code trees yield compression ratios ranging from 2.5 to 8, for file sizes ranging from 167 bytes to 1 megabyte.

Tree structure for efficient data mining using rough sets

In data mining, an important goal is to generate an abstraction of the data. Such an abstraction helps in reducing the space and search time requirements of the overall decision making process. Further, it is important that the abstraction is generated from the data with a small number of disk scans. We propose a novel data structure, pattern count tree (PC-tree), that can be built by scanning the database only once. PC-tree is a minimal size complete representation of the data and it can be used to represent dynamic databases with the help of knowledge that is either static or changing. We show that further compactness can be achieved by constructing the PC-tree on segmented patterns. We exploit the flexibility offered by rough sets to realize a rough PC-tree and use it for efficient and effective rough classification. To be consistent with the sizes of the branches of the PC-tree, we use upper and lower approximations of feature sets in a manner different from the conventional rough set theory. We conducted experiments using the proposed classification scheme on a large-scale hand-written digit data set. We use the experimental results to establish the efficacy of the proposed approach. (C) 2002 Elsevier Science B.V. All rights reserved.

Synthesis, characterization, degradation of biodegradable castor oil based polyesters

A new family of castor oil based biodegradable polyesters was synthesized by catalyst free melt condensation reaction between two different diacids and castor oil with D-mannitol. The polymers synthesized were characterized by NMR spectroscopy, FF-IR and the thermal properties were analysed by DSC. The results of DSC show that the polymer is rubbery in physiological conditions. The contact angle measurement and hydration test results indicate that the surface of the polymer is hydrophilic. The mechanical properties, evaluated in the tensile mode, shows that the polymer has characteristics of a soft material. In vitro degradation of polymer in PBS solution carried out at physiological conditions indicates that the degradation goes to completion within 21 days and it was also found that the rate of degradation can be tuned by varying the curing conditions. (C) 2011 Elsevier Ltd. All rights reserved.

An O(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs

We present a fast algorithm for computing a Gomory-Hu tree or cut tree for an unweighted undirected graph G = (V,E). The expected running time of our algorithm is Õ(mc) where |E| = m and c is the maximum u-vedge connectivity, where u,v ∈ V. When the input graph is also simple (i.e., it has no parallel edges), then the u-v edge connectivity for each pair of vertices u and v is at most n-1; so the expected running time of our algorithm for simple unweighted graphs is Õ(mn).All the algorithms currently known for constructing a Gomory-Hu tree [8,9] use n-1 minimum s-t cut (i.e., max flow) subroutines. This in conjunction with the current fastest Õ(n20/9) max flow algorithm due to Karger and Levine [11] yields the current best running time of Õ(n20/9n) for Gomory-Hu tree construction on simpleunweighted graphs with m edges and n vertices. Thus we present the first Õ(mn) algorithm for constructing a Gomory-Hu tree for simple unweighted graphs.We do not use a max flow subroutine here; we present an efficient tree packing algorithm for computing Steiner edge connectivity and use this algorithm as our main subroutine. The advantage in using a tree packing algorithm for constructing a Gomory-Hu tree is that the work done in computing a minimum Steiner cut for a Steiner set S ⊆ V can be reused for computing a minimum Steiner cut for certain Steiner sets S' ⊆ S.

Decision tree design and applications in speech processing

The design and operation of the minimum cost classifier, where the total cost is the sum of the measurement cost and the classification cost, is computationally complex. Noting the difficulties associated with this approach, decision tree design directly from a set of labelled samples is proposed in this paper. The feature space is first partitioned to transform the problem to one of discrete features. The resulting problem is solved by a dynamic programming algorithm over an explicitly ordered state space of all outcomes of all feature subsets. The solution procedure is very general and is applicable to any minimum cost pattern classification problem in which each feature has a finite number of outcomes. These techniques are applied to (i) voiced, unvoiced, and silence classification of speech, and (ii) spoken vowel recognition. The resulting decision trees are operationally very efficient and yield attractive classification accuracies.