Distance dependence of fluorescence resonance energy transfer

Deviations from the usual R (-6) dependence of the rate of fluorescence resonance energy transfer (FRET) on the distance between the donor and the acceptor have been a common scenario in the recent times. In this paper, we present a critical analysis of the distance dependence of FRET, and try to illustrate the non R (-6) type behaviour of the rate for the case of transfer from a localized electronic excitation on the donor, a dye molecule to three different energy acceptors with delocalized electronic excitations namely, graphene,two-dimensional semiconducting sheet and the case of such a semiconducting sheet rolled to obtain a nanotube. We use simple analytic models to understand the distance dependence in each case.

The potential of certification for conservation and management of wild MAP resources

Medicinal and aromatic plants (MAPs) are an integral part of our biodiversity. In majority of MAP rich countries, wild collection practices are the livelihood options for a large number of rural peoples and MAPs play a significant role in socio-economic development of their communities. Recent concern over the alarming situation of the status of wild MAP resources, raw material quality, as well as social exploitation of rural communities, leads to the idea of certification for MAP resource conservation and management. On one hand, while MAP certification addresses environmental, social and economic perspectives of MAP resources, on the other hand, it ensures multi-stakeholder participation in improvement of the MAP sector. This paper presents an overview of MAP certification encompassing its different parameters, current scenario (Indian background), implementation strategies as well as stakeholders’ role in MAP conservation. It also highlights Indian initiatives in this direction.

The Out-of-India hypothesis: What do molecules suggest?

The remarkable geological and evolutionary history of peninsular India has generated much interest in the patterns and processes that might have shaped the current distributions of its endemic biota. In this regard the Out of India hypothesis, which proposes that rafting peninsular India carried Gondwanan forms to Asia after the break-up of Gondwana super continent, has gained prominence. Here we have reviewed molecular studies undertaken on a range of taxa of supposedly Gondwanan origin to better understand the Out-of-India scenario. This re-evaluation of published molecular studies indicates that there is mounting evidence supporting Out-of-India scenario for various Asian taxa. Nevertheless, in many studies the evidence is inconclusive due to lack of information on the age of relevant nodes. Studies also indicate that not all Gondwanan forms of peninsular India dispersed out of India. Many of these ancient lineages are confined to peninsular India and therefore are relict Gondwanan lineages. Additionally for some taxa an Into India rather than Out-of-India scenario better explains their current distribution. To identify the Out-of-India component of Asian biota it is imperative that we understand the complex biogeographical history of India. To this end, we propose three oversimplified yet explicit phylogenetic predictions. These predictions can be tested through the use of molecular phylogenetic tools in conjunction with palaeontological and geological data.

Mitochondrial and nuclear markers suggest Hanuman langur (Primates: Colobinae) polyphyly: Implications for their species status

Recent molecular studies on langurs of the Indian subcontinent suggest that the widely-distributed and morphologically variable Hanuman langurs (Semnopithecus entellus) are polyphyletic with respect to Nilgiri and urple-faced langurs. To further investigate this scenario, we have analyzed additional sequences of mitochondrial cytochrome b as well as nuclear protamine P1 genes from these species. The results confirm Hanuman langur polyphyly in the mitochondrial tree and the nuclear markers suggest that the Hanuman langurs share protamine P1 alleles with Nilgiri and purple-faced langurs. We recommend provisional splitting of the so-called Hanuman langurs into three species such that the taxonomy is consistent with their evolutionary relationships.

Computing TCP Throughput in a UMTS Network

We compute the throughput obtained by a TCP connection in a UMTS environment. For downloading data at a mobile terminal, the packets of each TCP connection are stored in separate queues at the base station (node B). Also due to fragmentation of the TCP packets into Protocol Data Units (PDU) and link layer retransmissions of PDUs there can be significant delays at the queue of the node B. In such a scenario the existing models of TCP may not be sufficient. Thus, we provide a new approximate TCP model and also obtain new closed-form expressions of mean window size. Using these we obtain the throughput of a TCP connection which matches with simulations quite well.

Dynamic simulation of activated sludge based wastewater treatment processes: Case studies with Titagarh Sewage Treatment Plant, India

STOAT has been extensively used for the dynamic simulation of an activated sludge based wastewater treatment plant in the Titagarh Sewage Treatment Plant, near Kolkata, India. Some alternative schemes were suggested. Different schemes were compared for the removal of Total Suspended Solids (TSS), b-COD, ammonia, nitrates etc. A combination of IAWQ#1 module with the Takacs module gave best results for the existing scenarios of the Titagarh Sewage Treatment Plant. The modified Bardenpho process was found most effective for reducing the mean b-COD level to as low as 31.4 mg/l, while the mean TSS level was as high as 100.98 mg/l as compared to the mean levels of TSS (92 62 mg/l) and b-COD (92.0 mg/l) in the existing plant. Scheme 2 gave a better scenario for the mean TSS level bringing it down to a mean value of 0.4 mg/l, but a higher mean value for the b-COD level at 54.89 mg/l. The Scheme Final could reduce the mean TSS level to 2.9 mg/l and the mean b-COD level to as low as 38.8 mg/l. The Final Scheme looks to be a technically viable scheme with respect to the overall effluent quality for the plant. (C) 2009 Elsevier B.V. All rights reserved.

Jointly optimal power control and routing for a single cell, dense, ad hoc wireless network

We consider a dense, ad hoc wireless network confined to a small region, such that direct communication is possible between any pair of nodes. The physical communication model is that a receiver decodes the signal from a single transmitter, while treating all other signals as interference. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organise into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first argue that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc network (described above) as a single cell, we study the optimal hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (Theta(opt) bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form d(opt)((P) over bar (t)) x Theta(opt) with d(opt) scaling as (P) over bar (1/eta)(t), where (P) over bar (t) is the available time average transmit power and eta is the path loss exponent. Under certain conditions on the fading distribution, we then provide a simple characterisation of the optimal operating point.

Link route pricing for enhanced QoS

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 multiple service classes. Our work draws upon [1] and [2] in various ways. We use the Tirupati pricing scheme in conjunction with the stochastic approximation based adaptive pricing methodology for queue control (proposed in [1]) for minimizing network congestion. However, unlike the methodology of [1] where pricing for entire routes is directly considered, we consider prices for individual link-service grade tuples. Further, we adapt the methodology proposed in [21 for a single-node scenario to the case of a network of nodes, for evaluating performance in terms of price, revenue rate and disutility. We obtain considerable performance improvements using our approach over that in [1]. In particular, our approach exhibits a throughput improvement in the range of 54 to 80 percent in all cases studied (over all routes) while exhibiting a lower packet delay in the range of 26 to 38 percent over the scheme in [1].

Enhancing sensor network lifetime using interactive communication

We are concerned with maximizing the lifetime of a data-gathering wireless sensor network consisting of set of nodes directly communicating with a base-station. We model this scenario as the m-message interactive communication between multiple correlated informants (sensor nodes) and a recipient (base-station). With this framework, we show that m-message interactive communication can indeed enhance network lifetime. Both worst-case and average-case performances are considered.

Role of information and communication in redefining unmanned aerial vehicle autonomous control levels

Autonomous mission control, unlike automatic mission control which is generally pre-programmed to execute an intended mission, is guided by the philosophy of carrying out a complete mission on its own through online sensing, information processing, and control reconfiguration. A crucial cornerstone of this philosophy is the capability of intelligence and of information sharing between unmanned aerial vehicles (UAVs) or with a central controller through secured communication links. Though several mission control algorithms, for single and multiple UAVs, have been discussed in the literature, they lack a clear definition of the various autonomous mission control levels. In the conventional system, the ground pilot issues the flight and mission control command to a UAV through a command data link and the UAV transmits intelligence information, back to the ground pilot through a communication link. Thus, the success of the mission depends entirely on the information flow through a secured communication link between ground pilot and the UAV In the past, mission success depended on the continuous interaction of ground pilot with a single UAV, while present day applications are attempting to define mission success through efficient interaction of ground pilot with multiple UAVs. However, the current trend in UAV applications is expected to lead to a futuristic scenario where mission success would depend only on interaction among UAV groups with no interaction with any ground entity. However, to reach this capability level, it is necessary to first understand the various levels of autonomy and the crucial role that information and communication plays in making these autonomy levels possible. This article presents a detailed framework of UAV autonomous mission control levels in the context of information flow and communication between UAVs and UAV groups for each level of autonomy.

Manifestation of geometric frustration on magnetic and thermodynamic properties of the pyrochlores Sm2X2O7 (X=Ti,Zr)

We present here magnetization, specific heat, and Raman studies on single-crystalline specimens of the first pyrochlore member Sm2Ti2O7 of the rare-earth titanate series. Its analogous compound Sm2Zr2O7 in the rare-earth zirconate series is also investigated in the polycrystalline form. The Sm spins in Sm2Ti2O7 remain unordered down to at least T=0.5 K. The absence of magnetic ordering is attributed to very small values of exchange (θcw∼−0.26 K) and dipolar interaction (μeff∼0.15 μB) between the Sm3+ spins in this pyrochlore. In contrast, the pyrochlore Sm2Zr2O7 is characterized by a relatively large value of Sm-Sm spin exchange (θcw∼−10 K); however, long-range ordering of the Sm3+ spins is not established at least down to T=0.67 K due to frustration of the Sm3+ spins on the pyrochlore lattice. The ground state of Sm3+ ions in both pyrochlores is a well-isolated Kramers doublet. The higher-lying crystal field excitations are observed in the low-frequency region of the Raman spectra of the two compounds recorded at T=10 K. At higher temperatures, the magnetic susceptibility of Sm2Ti2O7 shows a broad maximum at T=140 K, while that of Sm2Zr2O7 changes monotonically. Whereas Sm2Ti2O7 is a promising candidate for investigating spin fluctuations on a frustrated lattice, as indicated by our data, the properties of Sm2Zr2O7 seem to conform to a conventional scenario where geometrical frustration of the spin excludes their long-range ordering.

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.

Gasifier stoves - science, technology and field outreach

Development of a new class of single pan high efficiency, low emission stoves, named gasifier stoves, that promise constant power that can be controlled using any solid biomass fuel in the form of pellets is reported here. These stoves use battery-run fan-based air supply for gasification (primary air) and for combustion (secondary air).Design with the correct secondary air flow ensures near-stoichiometric combustion that allows attainment of peak combustion temperatures with accompanying high water boiling efficiencies (up to 50% for vessels of practical relevance) and very low emissions (of carbon monoxide, particulate matter and oxides of nitrogen). The use of high density agro-residue based pellets or coconut shell pieces ensures operational duration of about an hour or more at power levels of 3 kWth (similar to 12 g/min). The principles involved and the optimization aspects of the design are outlined. The dependence of efficiency and emissions on the design parameters are described. The field imperatives that drive the choice of the rechargeable battery source and the fan are brought out. The implications of developments of Oorja-Plus and OorjaSuper stoves to the domestic cooking scenario of India are briefly discussed. The process development, testing and internal qualification tasks were undertaken by Indian Institute of Science. Product development and the fuel pellet production were dealt with by First Energy Private Ltd.Close interaction at several times during this period has helped progress the project from the laboratory to large scale commercial operation. At this time, over four hundred thousand stoves and 30 kilotonnes fuel have been sold in four states in India.

A silicon micromachined photonic band gap cell, characteristics and an application

A novel PBG cell based on micromachining of Silicon using wet anisotropic etching has been considered. Since this is based on etching of the Silicon substrate, it is amenable to fabrication with standard Silicon processes and integration with millimeter wave circuits. We characterize this kind of PBG cell by full wave simulations using a time domain code. For the purpose of characterization, the scenario of a 50 ohm microstrip line placed on a Silicon substrate which is anisotropically etched to create patterns with sloping walls is considered. This is shown to produce the well known PBG response of stop bands in certain frequency bands. We look at the variation in the transmission coefficient (S-21) response as the number of periods, length based average fill factor and depth of micromachining are varied. One application of a low pass filter has been proposed and simulated results are given.

Machine recognition of online handwritten Devanagari characters

In this paper, we describe a system for the automatic recognition of isolated handwritten Devanagari characters obtained by linearizing consonant conjuncts. Owing to the large number of characters and resulting demands on data acquisition, we use structural recognition techniques to reduce some characters to others. The residual characters are then classified using the subspace method. Finally the results of structural recognition and feature-based matching are mapped to give final output. The proposed system Ifs evaluated for the writer dependent scenario.