On the Cubicity of AT-Free Graphs and Circular-Arc Graphs

A unit cube in k dimensions (k-cube) is defined as the Cartesian product R-1 x R-2 x ... x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), a(i) + 1] on the real line. A graph G on n nodes is said to be representable as the intersection of k-cubes (cube representation in k dimensions) if each vertex of C can be mapped to a k-cube such that two vertices are adjacent in G if and only if their corresponding k-cubes have a non-empty intersection. The cubicity of G denoted as cub(G) is the minimum k for which G can be represented as the intersection of k-cubes. An interesting aspect about cubicity is that many problems known to be NP-complete for general graphs have polynomial time deterministic algorithms or have good approximation ratios in graphs of low cubicity. In most of these algorithms, computing a low dimensional cube representation of the given graph is usually the first step. We give an O(bw . n) algorithm to compute the cube representation of a general graph G in bw + 1 dimensions given a bandwidth ordering of the vertices of G, where bw is the bandwidth of G. As a consequence, we get O(Delta) upper bounds on the cubicity of many well-known graph classes such as AT-free graphs, circular-arc graphs and cocomparability graphs which have O(Delta) bandwidth. Thus we have: 1. cub(G) <= 3 Delta - 1, if G is an AT-free graph. 2. cub(G) <= 2 Delta + 1, if G is a circular-arc graph. 3. cub(G) <= 2 Delta, if G is a cocomparability graph. Also for these graph classes, there axe constant factor approximation algorithms for bandwidth computation that generate orderings of vertices with O(Delta) width. We can thus generate the cube representation of such graphs in O(Delta) dimensions in polynomial time.

Why do birds participate in mixed-species foraging flocks? A large-scale synthesis

Mixed-species flocks of foraging birds have been documented from terrestrial habitats all over the world and are thought to form for either improved feeding efficiency or better protection from predators. Two kinds of flock participants are recognized: those that join other species ('followers') and are therefore likely to be the recipients of the benefits of flock participation and those that are joined ('leaders'). Through comparative analyses, using a large sample of flocks from around the world, we show that (1) 'followers' tend to be smaller, more insectivorous, and feed in higher strata than matched species that participate in flocks to a lesser extent and (2) 'leaders' tend to be cooperative breeders more often than matched species that are not known to lead flocks. Furthermore, meta-analyses of published results from across the world showed that bird species in terrestrial mixed-species flocks increase foraging rates and reduce vigilance compared to when they are solitary or in conspecific groups. Moreover, the increase in foraging rates is seen only with flock followers and not flock leaders. These findings suggest a role for predation in the evolution of mixed-species flocking. Species that are vulnerable to predation follow species whose vigilance they can exploit. By doing so, they are able to reduce their own vigilance and forage at higher rates. (C) 2009 The Association for the Study of Animal Behaviour. Published by Elsevier Ltd. All rights reserved.

Free vibration and wave propagation analysis of uniform and tapered rotating beams using spectrally formulated finite elements

This paper presents a formulation of an approximate spectral element for uniform and tapered rotating Euler-Bernoulli beams. The formulation takes into account the varying centrifugal force, mass and bending stiffness. The dynamic stiffness matrix is constructed using the weak form of the governing differential equation in the frequency domain, where two different interpolating functions for the transverse displacement are used for the element formulation. Both free vibration and wave propagation analysis is performed using the formulated elements. The studies show that the formulated element predicts results, that compare well with the solution available in the literature, at a fraction of the computational effort. In addition, for wave propagation analysis, the element shows superior convergence. (C) 2007 Elsevier Ltd. All rights reserved.

Energy identities in water wave theory for free-surface boundary condition with higher-order derivatives

A modified form of Green's integral theorem is employed to derive the energy identity in any water wave diffraction problem in a single-layer fluid for free-surface boundary condition with higher-order derivatives. For a two-layer fluid with free-surface boundary condition involving higher-order derivatives, two forms of energy identities involving transmission and reflection coefficients for any wave diffraction problem are also derived here by the same method. Based on this modified Green's theorem, hydrodynamic relations such as the energy-conservation principle and modified Haskind–Hanaoka relation are derived for radiation and diffraction problems in a single as well as two-layer fluid.

Nanoscale Heterostructures with Molecular-Scale Single-Crystal Metal Wires

Creating nanoscale heterostructures with molecular-scale (<2 nm) metal wires is critical for many applications and remains a challenge. Here, we report the first time synthesis of nanoscale heterostructures with single-crystal molecular-scale Au nanowires attached to different nanostructure substrates. Our method involves the formation of Au nanoparticle seeds by the reduction of rocksalt AuCl nanocubes heterogeneously nucleated on the Substrates and subsequent nanowire growth by oriented attachment of Au nanoparticles from the Solution phase. Nanoscale heterostructures fabricated by such site-specific nucleation and growth are attractive for many applications including nanoelectronic device wiring, catalysis, and sensing.

PROBESYNC: Platform Based Synchronization for Enhanced Life of Large Scale Wireless Sensor Networks

Optimization in energy consumption of the existing synchronization mechanisms can lead to substantial gains in terms of network life in Wireless Sensor Networks (WSNs). In this paper, we analyze ERBS and TPSN, two existing synchronization algorithms for WSNs which use widely different approach, and compare their performance in large scale WSNs each of which consists of different type of platform and has varying node density. We, then, propose a novel algorithm, PROBESYNC, which takes advantage of differences in power required to transmit and receive a message on ERBS and TPSN and leverages the shortcomings of each of these algorithms. This leads to considerable improvement in energy conservation and enhanced life of large scale WSNs.

Specific Small-Molecule Activator of Aurora Kinase A Induces Autophosphorylation in a Cell-Free System

Aurora kinases are essential for chromosomal segregation and cell division and thereby important for maintaining the proper genomic integrity. There are three classes of aurora kinases in humans: A, B, and C. Aurora kinase A is frequently overexpressed in various cancers. The link of the overexpression and tumorigenesis is yet to be understood. By employing virtual screening, we have found that anacardic acid, a pentadecane aliphatic chain containing hydroxylcarboxylic acid, from cashew nut shell liquid could be docked in Aurora kinases A and B. Remarkably, we found that anacardic acid could potently activate the Aurora kinase A mediated phosphorylation of histone H3, but at a similar concentration the activity of aurora kinase B remained unaffected in vitro. Mechanistically, anacardic acid induces the structural changes and also the autophosphorylation of the aurora kinase A to enhance the enzyme activity. This data thus indicate anacardic acid as the first small-molecule activator of Aurora kinase, which could be highly useful for probing the function of hyperactive (overexpressed) Aurora kinase A.

Scale-up criteria of square tank surface aerator

Oxygen transfer rate and the corresponding power requirement to operate the rotor are vital for design and scale-up of surface aerators. Present study develops simulation or scale-up criterion correlating the oxygen transsimulation fer coefficient and power number along with a parameter governing theoretical power per unit volume (X, which is defined as equal to (FR1/3)-R-4/3, where F and R are impellers' Fronde and Reynolds number, respectively). Based on such scale-up criteria, design considerations are developed to save energy requirements while designing square tank surface aerators. It has been demonstrated that energy can be saved substantially if the aeration tanks are run at relatively higher input powers. It is also demonstrated that smaller sized tanks are more energy conservative and economical when compared to big sized tanks, while aerating the same volume of water, and at the same time by maintaining a constant input power in all the tanks irrespective of their size. An example illustrating how energy can be reduced while designing different sized aerators is given. The results presented have a wide application in biotechnology and bioengineering areas with a particular emphasis on the design of appropriate surface aeration systems.

Scale-up criteria of square tank surface aerator

Oxygen transfer rate and the corresponding power requirement to operate the rotor are vital for design and scale-up of surface aerators. Present study develops simulation or scale-up criterion correlating the oxygen transsimulation fer coefficient and power number along with a parameter governing theoretical power per unit volume (X, which is defined as equal to (FR1/3)-R-4/3, where F and R are impellers' Fronde and Reynolds number, respectively). Based on such scale-up criteria, design considerations are developed to save energy requirements while designing square tank surface aerators. It has been demonstrated that energy can be saved substantially if the aeration tanks are run at relatively higher input powers. It is also demonstrated that smaller sized tanks are more energy conservative and economical when compared to big sized tanks, while aerating the same volume of water, and at the same time by maintaining a constant input power in all the tanks irrespective of their size. An example illustrating how energy can be reduced while designing different sized aerators is given. The results presented have a wide application in biotechnology and bioengineering areas with a particular emphasis on the design of appropriate surface aeration systems.

Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks

We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a function of the measurements and communicating it to an operator station. We restrict ourselves to the class of type-threshold functions (as defined in the work of Giridhar and Kumar, 2005), of which max, min, and indicator functions are important examples: our discussions are couched in terms of the max function. We view the problem as one of message-passing distributed computation over a geometric random graph. The network is assumed to be synchronous, and the sensors synchronously measure values and then collaborate to compute and deliver the function computed with these values to the operator station. Computation algorithms differ in (1) the communication topology assumed and (2) the messages that the nodes need to exchange in order to carry out the computation. The focus of our paper is to establish (in probability) scaling laws for the time and energy complexity of the distributed function computation over random wireless networks, under the assumption of centralized contention-free scheduling of packet transmissions. First, without any constraint on the computation algorithm, we establish scaling laws for the computation time and energy expenditure for one-time maximum computation. We show that for an optimal algorithm, the computation time and energy expenditure scale, respectively, as Theta(radicn/log n) and Theta(n) asymptotically as the number of sensors n rarr infin. Second, we analyze the performance of three specific computation algorithms that may be used in specific practical situations, namely, the tree algorithm, multihop transmission, and the Ripple algorithm (a type of gossip algorithm), and obtain scaling laws for the computation time and energy expenditure as n rarr infin. In particular, we show that the computation time for these algorithms scales as Theta(radicn/lo- g n), Theta(n), and Theta(radicn log n), respectively, whereas the energy expended scales as , Theta(n), Theta(radicn/log n), and Theta(radicn log n), respectively. Finally, simulation results are provided to show that our analysis indeed captures the correct scaling. The simulations also yield estimates of the constant multipliers in the scaling laws. Our analyses throughout assume a centralized optimal scheduler, and hence, our results can be viewed as providing bounds for the performance with practical distributed schedulers.

Non local scale effects on ultrasonic wave characteristics nanorods

In this paper, the nonlocal elasticity theory has been incorporated into classical Euler-Bernoulli rod model to capture unique features of the nanorods under the umbrella of continuum mechanics theory. The strong effect of the nonlocal scale has been obtained which leads to substantially different wave behaviors of nanorods from those of macroscopic rods. Nonlocal Euler-Bernoulli bar model is developed for nanorods. Explicit expressions are derived for wavenumbers and wave speeds of nanorods. The analysis shows that the wave characteristics are highly over estimated by the classical rod model, which ignores the effect of small-length scale. The studies also shows that the nonlocal scale parameter introduces certain band gap region in axial wave mode where no wave propagation occurs. This is manifested in the spectrum cures as the region where the wavenumber tends to infinite (or wave speed tends to zero). The results can provide useful guidance for the study and design of the next generation of nanodevices that make use of the wave propagation properties of single-walled carbon nanotubes. (C) 2010 Elsevier B.V. All rights reserved.

Observation of a chiral smectic phase in azobenzene-linked bolaamphiphiles containing free sugars

Amphiphilic sugars exhibit both lyotropic and thermotropic liquid-crystalline behavior. Interestingly, in spite of the abundance of chiral centers in amphiphilic sugars, their liquid-crystalline phases do not exhibit macroscopic chirality. Herein, we report on the first observation of macroscopic chirality in sugar-based bolaamphiphiles containing free hydroxyl groups. The manifestation of the chiral smectic C* phase in these bolaamphiphiles has been observed to be critically dependent on the presence of the azobenzene moiety and the suitable length of the methylene spacer. These results imply that by suitable selection of linker groups, mesogenic bolaamphiphiles possessing macroscopic chirality can be designed using a variety of naturally available sugar derivatives.

Influence lines for bending under a ring load of a free shell, a shell embedded in a soft medium and a shell containing a soft core

Theoretical expressions for stresses and displacements have been derived for bending under a ring load of a free shell, a shell embedded in a soft medium, and a shell containing a soft core. Numerical work has been done for typical cases with an Elliot 803 Digital Computer and influence lines are drawn therefrom.

Free convection heat transfer from vertical cylinders and wires

Free convection heat transfer from vertical long cylinders and wires were investigated experimentally. The experiments were designed to check the analytical results and the radius of curvature criteria formulated by the same authors. The results for water, the fluid medium used in the present set of experiments, are in excellent agreement with the theory. The results of Hama, Recesso and Christiaens, Kyte, Madden and Piret, in air are also shown to be in close agreement with proposed correlations.

Boxicity and cubicity of asteroidal triple free graphs

The boxicity of a graph G, denoted box(G), is the least integer d such that G is the intersection graph of a family of d-dimensional (axis-parallel) boxes. The cubicity, denoted cub(G), is the least dsuch that G is the intersection graph of a family of d-dimensional unit cubes. An independent set of three vertices is an asteroidal triple if any two are joined by a path avoiding the neighbourhood of the third. A graph is asteroidal triple free (AT-free) if it has no asteroidal triple. The claw number psi(G) is the number of edges in the largest star that is an induced subgraph of G. For an AT-free graph G with chromatic number chi(G) and claw number psi(G), we show that box(G) <= chi(C) and that this bound is sharp. We also show that cub(G) <= box(G)([log(2) psi(G)] + 2) <= chi(G)([log(2) psi(G)] + 2). If G is an AT-free graph having girth at least 5, then box(G) <= 2, and therefore cub(G) <= 2 [log(2) psi(G)] + 4. (c) 2010 Elsevier B.V. All rights reserved.