Optimal Timer-Based Best Node Selection for Wireless Systems with Unknown Number of Nodes

The distributed, low-feedback, timer scheme is used in several wireless systems to select the best node from the available nodes. In it, each node sets a timer as a function of a local preference number called a metric, and transmits a packet when its timer expires. The scheme ensures that the timer of the best node, which has the highest metric, expires first. However, it fails to select the best node if another node transmits a packet within Delta s of the transmission by the best node. We derive the optimal metric-to-timer mappings for the practical scenario where the number of nodes is unknown. We consider two cases in which the probability distribution of the number of nodes is either known a priori or is unknown. In the first case, the optimal mapping maximizes the success probability averaged over the probability distribution. In the second case, a robust mapping maximizes the worst case average success probability over all possible probability distributions on the number of nodes. Results reveal that the proposed mappings deliver significant gains compared to the mappings considered in the literature.

Impact dynamics of high Weber number drops on chemically modified metallic surfaces

Hydrophobic/superhydrophobic metallic surfaces prepared via chemical treatment are encountered in many industrial scenarios involving the impingement of spray droplets. The effectiveness of such surfaces is understood through the analysis of droplet impact experiments. In the present study, three target surfaces with aluminum (Al-6061) as base material-acid-etched, Octadecyl Trichloro Silane (OTS) coated, and acid-etched plus OTS-coated-were prepared. Experiments on the impact of inertia dominated water drops on these chemically modified aluminum surfaces were carried out with the objective to highlight the effect of chemical treatment on the target surfaces on key sub-processes occurring in drop impact phenomenon. High speed videos of the entire drop impact dynamics were captured at three Weber number (We) conditions representative of high We (We > 200) regime. During the early stages of drop spreading, the drop impact resulted in ejection of secondary droplets from spreading drop front on the etched surfaces resembling prompt splash on rough surfaces whereas no such splashing was observable on untreated aluminum surface. Prominent development of undulations (fingers) were observed at the rim of drop spreading on the etched surfaces; between the etched surfaces the OTS-coated surface showed a subdued development of fingers than the uncoated surface. The impacted drops showed intense receding on OTS-coated surfaces whereas on the etched surface a highly irregular receding, with drop liquid sticking to the surface, was observed. Quantitative analyses were performed to reveal the effect of target surface characteristics on drop impact parameters such as temporal variation of spread factor of drop lamella, temporal variation of average finger length during spreading phase, maximum drop spreading, time taken to attain maximum spreading, sensitivity of maximum spreading to We, number of fingers at maximum spreading, and average receding velocity of drop lamella. Existing models for maximum drop spreading showed reasonably good agreement with the experimental measurements on the target surfaces except the acid-etched surface. (C) 2014 Elsevier B.V. All rights reserved.

Rainbow Connection Number of Graph Power and Graph Products

Rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path in which no two edges are colored the same (note that the coloring need not be proper). In this paper we study the rainbow connection number with respect to three important graph product operations (namely the Cartesian product, the lexicographic product and the strong product) and the operation of taking the power of a graph. In this direction, we show that if G is a graph obtained by applying any of the operations mentioned above on non-trivial graphs, then rc(G) a parts per thousand currency sign 2r(G) + c, where r(G) denotes the radius of G and . In general the rainbow connection number of a bridgeless graph can be as high as the square of its radius 1]. This is an attempt to identify some graph classes which have rainbow connection number very close to the obvious lower bound of diameter (and thus the radius). The bounds reported are tight up to additive constants. The proofs are constructive and hence yield polynomial time -factor approximation algorithms.

Insights into Himalayan biogeography from geckos: A molecular phylogeny of Cyrtodactylus (Squamata: Gekkonidae)

The India-Asia collision profoundly influenced the climate, topography and biodiversity of Asia, causing the formation of the biodiverse Himalayas. The species-rich gekkonid genus Cyrtodactylus is an ideal clade for exploring the biological impacts of the India-Asia collision, as previous phylogenetic hypotheses suggest basal divergences occurred within the Himalayas and Indo-Burma during the Eocene. To this end, we sampled for Cyrtodactylus across Indian areas of the Himalayas and Indo-Burma Hotspots and used three genes to reconstruct relationships and estimate divergence times. Basal divergences in Cyrtodactylus, Hemidactylus and the Palaearctic naked-toed geckos were simultaneous with or just preceded the start of the India-Asia collision. Diversification within Cyrtodactylus tracks the India-Asia collision and subsequent geological events. A number of geographically concordant clades are resolved within Indo-Burmese Cyrtodactylus. Our study reveals 17 divergent lineages that may represent undescribed species, underscoring the previously undocumented diversity of the region. The importance of rocky habitats for Cyrtodactylus indicates the Indo-Gangetic flood plains and the Garo-Rajmahal Gap are likely to have been important historical barriers for this group. (C) 2014 Elsevier Inc. All rights reserved.

Phylogeny of the freshwater crabs of the Western Ghats (Brachyura, Gecarcinucidae)

The Western Ghats mountain range in India is a biodiversity hotspot for a variety of organisms including a large number of endemic freshwater crab species and genera of the family Gecarcinucidae. The phylogenetic relationships of these taxa, however, have remained poorly understood. Here, we present a phylogeny that includes 90% of peninsular Indian genera based on mitochondrial 16S rRNA and nuclear histone H3 gene sequences. The subfamily Gecarcinucinae was found to be paraphyletic with members of two other subfamilies, Liotelphusinae and Parathelphusinae, nesting within. We identify a well-supported clade consisting of north Indian species and one clade comprising mostly south Indian species that inhabit the southern sky islands' of the Western Ghats. Relationships of early diverging genera, however, were resolved with low support. This study also includes newly sampled material from an isolated mountain plateau in the northern part of the Western Ghats, representing a new species of Gubernatoriana, which we describe here as Gubernatoriana basalticola sp. n. The new species is immediately distinguished from its congeners and the related genera Ghatiana and Inglethelphusa by its carapace and cheliped morphology, which are unique among Indian freshwater crabs. This study highlights the urgent need for continued faunistic studies to assess the true diversity of gecarcinucid crabs on the Indian subcontinent, to fully understand the basal phylogenetic relationships within the freshwater crab family Gecarcinucidae, and to evaluate the conservation threat status and biogeography of the montane freshwater crabs of the Western Ghats.

On the Maximum Number of Linearly Independent Cycles and Paths in a Network

Central to network tomography is the problem of identifiability, the ability to identify internal network characteristics uniquely from end-to-end measurements. This problem is often underconstrained even when internal network characteristics such as link delays are modeled as additive constants. While it is known that the network topology can play a role in determining the extent of identifiability, there is a lack in the fundamental understanding of being able to quantify it for a given network. In this paper, we consider the problem of identifying additive link metrics in an arbitrary undirected network using measurement nodes and establishing paths/cycles between them. For a given placement of measurement nodes, we define and derive the ``link rank'' of the network-the maximum number of linearly independent cycles/paths that may be established between the measurement nodes. We achieve this in linear time. The link rank helps quantify the exact extent of identifiability in a network. We also develop a quadratic time algorithm to compute a set of cycles/paths that achieves the maximum rank.

Equilibrium and equivariant triangulations of some small covers with minimum number of vertices

Small covers were introduced by Davis and Januszkiewicz in 1991. We introduce the notion of equilibrium triangulations for small covers. We study equilibrium and vertex minimal 4-equivariant triangulations of 2-dimensional small covers. We discuss vertex minimal equilibrium triangulations of RP3#RP3, S-1 x RP2 and a nontrivial S-1 bundle over RP2. We construct some nice equilibrium triangulations of the real projective space RPn with 2(n) + n 1 vertices. The main tool is the theory of small covers.

Behaviour of turbulent Prandtl/Schmidt number in compressible mixing layer

The behaviour of turbulent Prandtl/Schmidt number is explored through the model-free simulation results. It has been observed that compressibility affects the Reynolds scalar flux vectors. Reduced peak values are also observed for compressible convective Mach number mixing layer as compared with the incompressible convective Mach number counterpart, indicating a reduction in the mixing of enthalpy and species. Pr-t and Sc-t variations also indicate a reduction in mixing. It is observed that unlike the incompressible case, it is difficult to assign a constant value to these numbers due to their continuous variation in space. Modelling of Pr-t and Sc-t would be necessary to cater for this continuous spatial variation. However, the turbulent Lewis number is evaluated to be near unity for the compressible case, making it necessary to model only one of the Pr-t and Sc-t..

An estimate of the number of tropical tree species

The high species richness of tropical forests has long been recognized, yet there remains substantial uncertainty regarding the actual number of tropical tree species. Using a pantropical tree inventory database from closed canopy forests, consisting of 657,630 trees belonging to 11,371 species, we use a fitted value of Fisher's alpha and an approximate pantropical stem total to estimate the minimum number of tropical forest tree species to fall between similar to 40,000 and similar to 53,000, i.e., at the high end of previous estimates. Contrary to common assumption, the Indo-Pacific region was found to be as species-rich as the Neotropics, with both regions having a minimum of similar to 19,000-25,000 tree species. Continental Africa is relatively depauperate with a minimum of similar to 4,500-6,000 tree species. Very few species are shared among the African, American, and the Indo-Pacific regions. We provide a methodological framework for estimating species richness in trees that may help refine species richness estimates of tree-dependent taxa.

On the control of rapidly rotating convection by an axially varying magnetic field

The magnetic field in rapidly rotating dynamos is spatially inhomogeneous. The axial variation of the magnetic field is of particular importance because tall columnar vortices aligned with the rotation axis form at the onset of convection. The classical picture of magnetoconvection with constant or axially varying magnetic fields is that the Rayleigh number and wavenumber at onset decrease appreciably from their non-magnetic values. Nonlinear dynamo simulations show that the axial lengthscale of the self-generated azimuthal magnetic field becomes progressively smaller as we move towards a rapidly rotating regime. With a small-scale field, however, the magnetic control of convection is different from that in previous studies with a uniform or large-scale field. This study looks at the competing viscous and magnetic mode instabilities when the Ekman number E (ratio of viscous to Coriolis forces) is small. As the applied magnetic field strength (measured by the Elsasser number Lambda) increases, the critical Rayleigh number for onset of convection initially increases in a viscous branch, reaches an apex where both viscous and magnetic instabilities co-exist, and then falls in the magnetic branch. The magnetic mode of onset is notable for its dramatic suppression of convection in the bulk of the fluid layer where the field is weak. The viscous-magnetic mode transition occurs at Lambda similar to 1, which implies that small-scale convection can exist at field strengths higher than previously thought. In spherical shell dynamos with basal heating, convection near the tangent cylinder is likely to be in the magnetic mode. The wavenumber of convection is only slightly reduced by the self-generated magnetic field at Lambda similar to 1, in agreement with previous planetary dynamo models. The back reaction of the magnetic field on the flow is, however, visible in the difference in kinetic helicity between cyclonic and anticyclonic vortices.

Onset of plane layer magnetoconvection at low Ekman number

We study the onset of magnetoconvection between two infinite horizontal planes subject to a vertical magnetic field aligned with background rotation. In order to gain insight into the convection taking place in the Earth's tangent cylinder, we target regimes of asymptotically strong rotation. The critical Rayleigh number Ra-c and critical wavenumber a(c) are computed numerically by solving the linear stability problem in a systematic way, with either stress-free or no-slip kinematic boundary conditions. A parametric study is conducted, varying the Ekman number E (ratio of viscous to Coriolis forces) and the Elsasser number. (ratio of the Lorentz force to the Coriolis force). E is varied from 10(-9) to 10(-2) and. from 10(-3) to 1. For a wide range of thermal and magnetic Prandtl numbers, our results verify and confirm previous experimental and theoretical results showing the existence of two distinct unstable modes at low values of E-one being controlled by the magnetic field, the other being controlled by viscosity (often called the viscous mode). It is shown that oscillatory onset does not occur in the range of parameters we are interested in. Asymptotic scalings for the onset of these modes are numerically confirmed and their domain of validity is precisely quantified. We show that with no-slip boundary conditions, the asymptotic behavior is reached for E < 10(-6) and establish a map in the (E, Lambda) plane. We distinguish regions where convection sets in either through the magnetic mode or through the viscous mode. Our analysis gives the regime in which the transition between magnetic and viscous modes may be observed. We also show that within the asymptotic regime, the role played by the kinematic boundary conditions is minimal. (C) 2015 AIP Publishing LLC.

Upper bound on cubicity in terms of boxicity for graphs of low chromatic number

The boxicity (respectively cubicity) of a graph G is the least integer k such that G can be represented as an intersection graph of axis-parallel k-dimensional boxes (respectively k-dimensional unit cubes) and is denoted by box(G) (respectively cub(G)). It was shown by Adiga and Chandran (2010) that for any graph G, cub(G) <= box(G) log(2) alpha(G], where alpha(G) is the maximum size of an independent set in G. In this note we show that cub(G) <= 2 log(2) X (G)] box(G) + X (G) log(2) alpha(G)], where x (G) is the chromatic number of G. This result can provide a much better upper bound than that of Adiga and Chandran for graph classes with bounded chromatic number. For example, for bipartite graphs we obtain cub(G) <= 2(box(G) + log(2) alpha(G)] Moreover, we show that for every positive integer k, there exist graphs with chromatic number k such that for every epsilon > 0, the value given by our upper bound is at most (1 + epsilon) times their cubicity. Thus, our upper bound is almost tight. (c) 2015 Elsevier B.V. All rights reserved.