The precision of regulation in Dictyostelium discoideum: implications for cell-type proportioning in the absence of spatial pattern

We have made careful counts of the exact number of spore, stalk and basal disc cells in small fruiting bodies of Dictyostelium discoideum (undifferentiated amoebae are found only rarely and on average their fraction is 4.96 x 10(-4)). (i) Within aggregates of a given size, the relative apportioning of amoebae to the main cell types occurs with a remarkable degree of precision. In most cases the coefficient of variation (c.v.) in the mean fraction of cells that form spores is within 4.86%. The contribution of stalk and basal disc cells is highly variable when considered separately (c.v.'s upto 25% and 100%, respectively), but markedly less so when considered together. Calculations based on theoretical models indicate that purely cell-autonomous specification of cell, fate cannot account for die observed accuracy of proportioning. Cell-autonomous determination to a prestalk or prespore condition followed by cell type interconversion, and stabilised by feedbacks, suffices to explain the measured accuracy. (ii) The fraction of amoebae that differentiates into spores increases monotonically with the total number of cells. This fraction rises from an average of 73.6% for total cell numbers below 30 and reaches 86.0% for cell numbers between 170 and 200 (it remains steady thereafter at around 86%). Correspondingly, the fraction of amoebae differentiating into stalk or basal disc decreases viith total size. These trends are in accordance with evolutionary expectations and imply that a mechanism for sensing the overall size of the aggregate also plays an essential role in the determination of cell-type proportions.

On optimal timer-based distributed selection for rate-adaptive multi-user diversity systems

We develop an optimal, distributed, and low feedback timer-based selection scheme to enable next generation rate-adaptive wireless systems to exploit multi-user diversity. In our scheme, each user sets a timer depending on its signal to noise ratio (SNR) and transmits a small packet to identify itself when its timer expires. When the SNR-to-timer mapping is monotone non-decreasing, timers of users with better SNRs expire earlier. Thus, the base station (BS) simply selects the first user whose timer expiry it can detect, and transmits data to it at as high a rate as reliably possible. However, timers that expire too close to one another cannot be detected by the BS due to collisions. We characterize in detail the structure of the SNR-to-timer mapping that optimally handles these collisions to maximize the average data rate. We prove that the optimal timer values take only a discrete set of values, and that the rate adaptation policy strongly influences the optimal scheme's structure. The optimal average rate is very close to that of ideal selection in which the BS always selects highest rate user, and is much higher than that of the popular, but ad hoc, timer schemes considered in the literature.

The Asian elephants Elephas maximus of Cat Tien National Park, Vietnam: status and conservation of a vanishing population

This study updates the status and conservation of the Endangered Asian elephant Elephas maximus in Cat Tien National Park, Vietnam. Line transect indirect surveys, block surveys for elephant signs, village surveys of elephant-human conflict incidents, guard-post surveys for records of sightings, and surveys of elephant food plants were undertaken during the dry and wet seasons of 2001. A minimum of 11 elephants and a maximum of 15-17 elephants was estimated for c. 500 km2 of the Park and its vicinity. The elephants are largely confined to the southern boundary of the Park and make extensive use of the adjoining La Nga State Forest Enterprises. During the dry season the elephants depend on at least 26 species of wild and cultivated plants, chiefly the fruits of cashew. Most of the villages surveyed reported some elephant-human conflict. Two adult male elephants seem to cover a large area to raid crops, whereas the family groups restrict themselves to a few villages; overall, the conflict is not serious. Since 2001 there have been no reports of any deaths or births of elephants in the Park. We make recommendations for habitat protection and management, increasing the viability of the small population, reducing elephant-human conflicts, and improving the chances of survival of the declining elephants of this Park. The Government has now approved an Action Plan for Urgent Conservation Areas in Vietnam that calls for the establishment of three elephant conservation areas in the country, including Cat Tien National Park.

Identity, energetics, dynamics and environment of interfacial water molecules in a micellar solution

The structure and energetics of interfacial water molecules in the aqueous micelle of cesium perfluorooctanoate have been investigated, using large-scale atomistic molecular dynamics simulations, with the primary objective of classifying them. The simulations show that the water molecules at the interface fall into two broad classes: bound and free, present in a ratio of 9:1. The bound water molecules can be further categorized on the basis of the number of hydrogen bonds (one or two) that they form with the surfactant headgroups. The hydrogen bonds of the doubly hydrogen-bonded species are found to be, on the average, slightly weaker than those in the singly bonded species. The environment around interfacial water molecules is more ordered than that in the bulk. The surface water molecules have substantially lower potential energy, because of interaction with the micelle. In particular, both forms of bound water have energies that are lower by �2.5-4.0 kcal/ mol. Entropy is found to play an important role in determining the relative concentration of the species.

Hotspots of solar potential in India

Solar hotspots are the regions characterized by an exceptional solar power potential suitable for decentralized commercial exploitation of energy. Identification of solar hotspots in a vast geographical expanse with dense habitations helps to meet escalating power demand in a decentralized, efficient and sustainable manner. This communication focuses on the assessment of resource potential with variability in India derived from high resolution satellite derived insolation data. Data analysis reveals that nearly 58% of the geographical area potentially represent the solar hotspots in the country with more than 5 kWh/m(2)/day of annual average Global insolation. A techno-economic analysis of the solar power technologies and a prospective minimal utilization of the land available within these solar hotspots demonstrate their immense power generation as well as emission reduction potential. The study evaluates the progress made in solar power generation in the country especially with the inception of an ambitious National Solar Mission (NSM) also termed as `Solar India'. The organizational aspects of solar power generation with focus on existing policy elements are also addressed so as to probe the actual potential of the identified solar hotspots in meeting the NSM targets and beyond. (C) 2011 Elsevier Ltd. All rights reserved.

Site Characterization of Bangalore using Geophysical Method

A number of geophysical methods have been proposed for near-surface site characterization and measurement of shear wave velocity by using a great variety of testing configurations, processing techniques,and inversion algorithms. In particular, two widely-used techniques are SASW (Spectral Analysis of SurfaceWaves) and MASW (Multichannel Analysis of SurfaceWaves). MASW is increasingly being applied to earthquake geotechnical engineering for the local site characterization, microzonation and site response studies.A MASW is a geophysical method, which generates a shear-wave velocity (Vs) profile (i.e., Vs versus depth)by analyzing Raleigh-type surface waves on a multichannel record. MASW system consisting of 24 channels Geode seismograph with 24 geophones of 4.5 Hz frequency have been used in this investigation. For the site characterization program, the MASW field experiments consisting of 58 one-dimensional shear wave velocity tests and 20 two-dimensional shear wave tests have been carried out. The survey points have been selected in such a way that the results supposedly represent the whole metropolitan Bangalore having an area of 220 km2.The average shear wave velocity of Bangalore soils have been evaluated for depths of 5m, 10m, 15m, 20m, 25m and 30 m. The subsoil site classification has been made for seismic local site effect evaluation based on average shear wave velocity of 30m depth (Vs30) of sites using National Earthquake Hazards Reduction Program (NEHRP) and International Building Code (IBC) classification. Soil average shearwave velocity estimated based on overburden thickness from the borehole information is also presented. Mapping clearly indicates that the depth of soil obtained from MASW is closely matching with the soil layers in bore logs. Among total 55 locations of MASW survey carried out, 34 locations were very close to the SPT borehole locations and these are used to generate correlation between Vs and corrected “N” values. The SPT field “N” values are corrected by applying the NEHRP recommended corrections.

Fault-Tolerant Average Execution Time Optimization for General Purpose Multi-Processor System-on Chips

Fault-tolerance is due to the semiconductor technology development important, not only for safety-critical systems but also for general-purpose (non-safety critical) systems. However, instead of guaranteeing that deadlines always are met, it is for general-purpose systems important to minimize the average execution time (AET) while ensuring fault-tolerance. For a given job and a soft (transient) error probability, we define mathematical formulas for AET that includes bus communication overhead for both voting (active replication) and rollback-recovery with checkpointing (RRC). And, for a given multi-processor system-on-chip (MPSoC), we define integer linear programming (ILP) models that minimize AET including bus communication overhead when: (1) selecting the number of checkpoints when using RRC, (2) finding the number of processors and job-to-processor assignment when using voting, and (3) defining fault-tolerance scheme (voting or RRC) per job and defining its usage for each job. Experiments demonstrate significant savings in AET.

An optimal weighted-average congestion based pricing scheme for enhanced QoS, , LNCS 4882, 2007

Pricing is an effective tool to control congestion and achieve quality of service (QoS) provisioning for multiple differentiated levels of service. In this paper, we consider the problem of pricing for congestion control in the case of a network of nodes under a single service class and multiple queues, and present a multi-layered pricing scheme. We propose an algorithm for finding the optimal state dependent price levels for individual queues, at each node. The pricing policy used depends on a weighted average queue length at each node. This helps in reducing frequent price variations and is in the spirit of the random early detection (RED) mechanism used in TCP/IP networks. We observe in our numerical results a considerable improvement in performance using our scheme over that of a recently proposed related scheme in terms of both throughput and delay performance. In particular, our approach exhibits a throughput improvement in the range of 34 to 69 percent in all cases studied (over all routes) over the above scheme.

Distributed load adaptive scheduling for throughput and delay guarantees in fading wireless LANs

We consider a problem of providing mean delay and average throughput guarantees in random access fading wireless channels using CSMA/CA algorithm. This problem becomes much more challenging when the scheduling is distributed as is the case in a typical local area wireless network. We model the CSMA network using a novel queueing network based approach. The optimal throughput per device and throughput optimal policy in an M device network is obtained. We provide a simple contention control algorithm that adapts the attempt probability based on the network load and obtain bounds for the packet transmission delay. The information we make use of is the number of devices in the network and the queue length (delayed) at each device. The proposed algorithms stay within the requirements of the IEEE 802.11 standard.