A mechanism for the west-north-west movement of monsoon depressions

The monsoon depressions intensify over the Bay of Bengal, move in a west-north-west (WNW) direction and dissipate over the Indian continent. No convincing physical explanation for their observed movement has so far been arrived at, but here, I suggest why the maximum precipitation occurs in the western sector of the depression and propose a feedback mechanism for the WNW movement of the depressions. We assume that a heat source is created over the Bay of Bengal due to organization of cumulus convection by the initial instability. In a linear sense, heating at this latitude (20° N), produces an atmospheric response mainly in the form of a stationary Rossby–gravity wave to the west of the heat source. The low-level vorticity (hence the frictional convergence) and the vertical velocity associated with the steady-state response is such that the maximum moisture convergence (and precipitation) is expected to occur in the WNW sector at a later time. Thus, the heat source moves to the WNW sector at a later time and the feedback continues resulting in the WNW movement of the depressions.

Distributed Scheduling for Multi-Hop Wireless Networks

We study the performance of greedy scheduling in multihop wireless networks where the objective is aggregate utility maximization. Following standard approaches, we consider the dual of the original optimization problem. Optimal scheduling requires selecting independent sets of maximum aggregate price, but this problem is known to be NP-hard. We propose and evaluate a simple greedy heuristic. We suggest how the greedy heuristic can be implemented in a distributed manner. We evaluate an analytical bound in detail, for the special case of a line graph and also provide a loose bound on the greedy heuristic for the case of an arbitrary graph.

Ionophore-mediated transmembrane movement of divalent cations in small unilamellar liposomes: An evaluation of the chlortetracycline fluorescence technique and correlations with black lipid membrane studies

Conceptual advances in the field of membrane transport have, in the main, utilized artificial membranes, both planar and vesicular. Systems of biological interest,viz., cells and organelles, resemble vesicles in size and geometry. Methods are, therefore, required to extend the results obtained with planar membranes to liposome systems. In this report we present an analysis of a fluorescence technique, using the divalent cation probe chlortetracycline, in small, unilamellar vesicles, for the study of divalent cation fluxes. An ion carrier (X537 A) and a pore former (alamethicin) have been studied. The rate of rise of fluorescence signal and the transmembrane ion gradient have been related to transmembrane current and potential, respectively. A second power dependence of ion conduction-including the electrically silent portion thereof — on X537 A concentration, has been observed. An exponential dependence of ldquocurrentrdquo on ldquotransmembrane potentialrdquo in the case of alamethicin is also confirmed. Possible errors in the technique are discussed.

A note on the movement of single large liquid bubbles in vertical tubes

The flow of single large liquid bubbles under gravity in closed tubes is studied here for the case when the liquid bubble exhibits micropolar behaviour. The film thickness, velocity profile in the bubble and film, and nonNewtonian effects are studied and compared with those for the correspondingNewtonian fluid. The investigation is restricted to the case where the bubble length is far greater than the tube radius.

Delay Optimal Scheduling in a Two-Hop Vehicular Relay Network

We study a scheduling problem in a wireless network where vehicles are used as store-and-forward relays, a situation that might arise, for example, in practical rural communication networks. A fixed source node wants to transfer a file to a fixed destination node, located beyond its communication range. In the absence of any infrastructure connecting the two nodes, we consider the possibility of communication using vehicles passing by. Vehicles arrive at the source node at renewal instants and are known to travel towards the destination node with average speed v sampled from a given probability distribution. Th source node communicates data packets (or fragments) of the file to the destination node using these vehicles as relays. We assume that the vehicles communicate with the source node and the destination node only, and hence, every packet communication involves two hops. In this setup, we study the source node's sequential decision problem of transferring packets of the file to vehicles as they pass by, with the objective of minimizing delay in the network. We study both the finite file size case and the infinite file size case. In the finite file size case, we aim to minimize the expected file transfer delay, i.e. expected value of the maximum of the packet sojourn times. In the infinite file size case, we study the average packet delay minimization problem as well as the optimal tradeoff achievable between the average queueing delay at the source node buffer and the average transit delay in the relay vehicle.

DMT of Multi-hop Cooperative Networks-Part II: Layered and Multi-Antenna Networks

We consider single-source, single-sink (ss-ss) multi-hop relay networks, with slow-fading Rayleigh links. This two part paper aims at giving explicit protocols and codes to achieve the optimal diversity-multiplexing tradeoff (DMT) of two classes of multi-hop networks: K-parallel-path (KPP) networks and Layered networks. While single-antenna KPP networks were the focus of the first part, we consider layered and multi-antenna networks in this second part. We prove that a linear DMT between the maximum diversity d(max). and the maximum multiplexing gain of 1 is achievable for single-antenna fully-connected layered networks under the half-duplex constraint. This is shown to be equal to the optimal DMT if the number of relaying layers is less than 4. For the multiple-antenna case, we provide an achievable DMT, which is significantly better than known lower bounds for half duplex networks. Along the way, we compute the DMT of parallel MIMO channels in terms of the DMT of the component channel. For arbitrary ss-ss single-antenna directed acyclic networks with full-duplex relays, we prove that a linear tradeoff between maximum diversity and maximum multiplexing gain is achievable using an amplify-and-forward (AF) protocol. Explicit short-block-length codes are provided for all the proposed protocols. Two key implications of the results in the two-part paper are that the half-duplex constraint does not necessarily entail rate loss by a factor of two as previously believed and that simple AN protocols are often sufficient to attain the best possible DMT.

DMT of Multi-hop Cooperative Networks-Part I: K-Parallel-Path Networks

We consider single-source, single-sink multi-hop relay networks, with slow-fading Rayleigh fading links and single-antenna relay nodes operating under the half-duplex constraint. While two hop relay networks have been studied in great detail in terms of the diversity-multiplexing tradeoff (DMT), few results are available for more general networks. In this two-part paper, we identify two families of networks that are multi-hop generalizations of the two hop network: K-Parallel-Path (KPP) networks and Layered networks. In the first part, we initially consider KPP networks, which can be viewed as the union of K node-disjoint parallel paths, each of length > 1. The results are then generalized to KPP(I) networks, which permit interference between paths and to KPP(D) networks, which possess a direct link from source to sink. We characterize the optimal DMT of KPP(D) networks with K >= 4, and KPP(I) networks with K >= 3. Along the way, we derive lower bounds for the DMT of triangular channel matrices, which are useful in DMT computation of various protocols. As a special case, the DMT of two-hop relay network without direct link is obtained. Two key implications of the results in the two-part paper are that the half-duplex constraint does not necessarily entail rate loss by a factor of two, as previously believed and that, simple AF protocols are often sufficient to attain the best possible DMT.

Voluntary Control of Multisaccade Gaze Shifts During Movement Preparation and Execution

Ramakrishnan A, Chokhandre S, Murthy A. Voluntary control of multisaccade gaze shifts during movement preparation and execution. J Neurophysiol 103: 2400-2416, 2010. First published February 17, 2010; doi: 10.1152/jn.00843.2009. Although the nature of gaze control regulating single saccades is relatively well documented, how such control is implemented to regulate multisaccade gaze shifts is not known. We used highly eccentric targets to elicit multisaccade gaze shifts and tested the ability of subjects to control the saccade sequence by presenting a second target on random trials. Their response allowed us to test the nature of control at many levels: before, during, and between saccades. Although the saccade sequence could be inhibited before it began, we observed clear signs of truncation of the first saccade, which confirmed that it could be inhibited in midflight as well. Using a race model that explains the control of single saccades, we estimated that it took about 100 ms to inhibit a planned saccade but took about 150 ms to inhibit a saccade during its execution. Although the time taken to inhibit was different, the high subject-wise correlation suggests a unitary inhibitory control acting at different levels in the oculomotor system. We also frequently observed responses that consisted of hypometric initial saccades, followed by secondary saccades to the initial target. Given the estimates of the inhibitory process provided by the model that also took into account the variances of the processes as well, the secondary saccades (average latency similar to 215 ms) should have been inhibited. Failure to inhibit the secondary saccade suggests that the intersaccadic interval in a multisaccade response is a ballistic stage. Collectively, these data indicate that the oculomotor system can control a response until a very late stage in its execution. However, if the response consists of multiple movements then the preparation of the second movement becomes refractory to new visual input, either because it is part of a preprogrammed sequence or as a consequence of being a corrective response to a motor error.

Ecology of the Asian Elephant in Southern India. I. Movement and Habitat Utilization Patterns

The movement and habitat utilization patterns were studied in an Asian elephant population during 1981-83 within a 1130 km2 area in southern India (110 30' N to 120 0' N and 760 50' E to 770 15' E). The study area encompasses a diversity of vegetation types from dry thorn forest (250-400 m) through deciduous forest (400-1400 m) to stunted evergreen shola forest and grassland (1400-1800 m). Home range sizes of some identified elephants were between 105 and 320 km2. Based on the dry season distribution, five different elephant clans, each consisting of between 50 and 200 individuals and having overlapping home ranges, could be defined within the study area. Seaso- nal habitat preferences were related to the availability of water and the palatability of food plants. During the dry months (January-April) elephants congregated at high densities of up to five individuals kM-2 in river valleys where browse plants had a much higher protein content than the coarse tall grasses on hill slopes. With the onset of rains of the first wet season (May- August) they dispersed over a wider area at lower densities, largely into the tall grass forests, to feed on the fresh grasses, which then had a high protein value. During the second wet season (September-December), when the tall grasses became fibrous, they moved into lower elevation short grass open forests. The normal movement pattern could be upset during years of adverse environmental con- ditions. However, the movement pattern of elephants in this region has not basically changed for over a century, as inferred from descriptions recorded during the nineteenth century.

Interaction of Sesbania mosaic virus movement protein with the coat protein - implications for viral spread

Sesbania mosaic virus (SeMV) is a single-stranded positive-sense RNA plant virus belonging to the genus Sobemovirus. The movement protein (MP) encoded by SeMV ORF1 showed no significant sequence similarity with MPs of other genera, but showed 32% identity with the MP of Southern bean mosaic virus within the Sobemovirus genus. With a view to understanding the mechanism of cell-to-cell movement in sobemoviruses, the SeMV MP gene was cloned, over-expressed in Escherichia coli and purified. Interaction of the recombinant MP with the native virus (NV) was investigated by ELISA and pull-down assays. It was observed that SeMV MP interacted with NV in a concentration- and pH-dependent manner. Analysis of N- and C-terminal deletion mutants of the MP showed that SeMV MP interacts with the NV through the N- terminal 49 amino acid segment. Yeast two-hybrid assays confirmed the in vitro observations, and suggested that SeMV might belong to the class of viruses that require MP and NV/coat protein for cell-to-cell movement.

Interaction of Sesbania Mosaic Virus Movement Protein with VPg and P10: Implication to Specificity of Genome Recognition

Sesbania mosaic virus (SeMV) is a single strand positive-sense RNA plant virus that belongs to the genus Sobemovirus. The mechanism of cell-to-cell movement in sobemoviruses has not been well studied. With a view to identify the viral encoded ancillary proteins of SeMV that may assist in cell-to-cell movement of the virus, all the proteins encoded by SeMV genome were cloned into yeast Matchmaker system 3 and interaction studies were performed. Two proteins namely, viral protein genome linked (VPg) and a 10-kDa protein (P10) c v gft encoded by OFR 2a, were identified as possible interacting partners in addition to the viral coat protein (CP). Further characterization of these interactions revealed that the movement protein (MP) recognizes cognate RNA through interaction with VPg, which is covalently linked to the 59 end of the RNA. Analysis of the deletion mutants delineated the domains of MP involved in the interaction with VPg and P10. This study implicates for the first time that VPg might play an important role in specific recognition of viral genome by MP in SeMV and shed light on the possible role of P10 in the viral movement.

Crystal structure of Salmonella typhimurium 2-methylcitrate synthase: Insights on domain movement and substrate specificity

2-Methylcitric acid (2-MCA) cycle is one of the well studied pathways for the utilization of propionate as a source of carbon and energy in bacteria such as Salmonella typhimurium and Escherichia coli. 2-Methylcitrate synthase (2-MCS) catalyzes the conversion of oxaloacetate and propionyl-CoA to 2-methylcitrate and CoA in the second step of 2-MCA cycle. Here, we report the X-ray crystal structure of S. typhimurium 2-MCS (StPrpC) at 2.4 A resolution and its functional characterization. StPrpC was found to utilize propionyl-CoA more efficiently than acetyl-CoA or butyryl-CoA. The polypeptide fold and the catalytic residues of StPrpC are conserved in citrate synthases (CSs) suggesting similarities in their functional mechanisms. In the triclinic P1 cell, StPrpC molecules were organized as decamers composed of five identical dimer units. In solution, StPrpC was in a dimeric form at low concentrations and was converted to larger oligomers at higher concentrations. CSs are usually dimeric proteins. In Gram-negative bacteria, a hexameric form, believed to be important for regulation of activity by NADH, is also observed. Structural comparisons with hexameric E. coil CS suggested that the key residues involved in NADH binding are not conserved in StPrpC. Structural comparison with the ligand free and bound states of CSs showed that StPrpC is in a nearly closed conformation despite the absence of bound ligands. It was found that the Tyr197 and Leu324 of StPrpC are structurally equivalent to the ligand binding residues His and Val, respectively, of CSs. These substitutions might determine the specificities for acyl-CoAs of these enzymes. (C) 2010 Elsevier Inc. All rights reserved.

Delay and energy optimal two-hop relaying in delay tolerant networks

We study the trade-off between delivery delay and energy consumption in delay tolerant mobile wireless networks that use two-hop relaying. The source may not have perfect knowledge of the delivery status at every instant. We formulate the problem as a stochastic control problem with partial information, and study structural properties of the optimal policy. We also propose a simple suboptimal policy. We then compare the performance of the suboptimal policy against that of the optimal control with perfect information. These are bounds on the performance of the proposed policy with partial information. Several other related open loop policies are also compared with these bounds.