Aminoglycoside-Resistance Mechanisms in Multidrug-Resistant Staphylococcus aureus Clinical Isolates

Aminoglycoside resistance in six clinically isolated Staphylococcus aureus was evaluated. Genotypical examination revealed that three isolates (HLGR-10, HLGR-12, and MSSA-21) have aminoglycoside-modifying enzyme (AME) coding genes and another three (GRSA-2, GRSA-4, and GRSA-6) lacked these genes in their genome. Whereas isolates HLGR-10 and HLGR-14 possessed bifunctional AME coding gene aac(6′)-aph(2′′), and aph(3′)-III and showed high-level resistance to gentamycin and streptomycin, MSSA-21 possessed aph(3′)-III and exhibited low resistance to gentamycin, streptomycin, and kanamycin. The remaining three isolates (GRSA-2, GRSA-4, and GRSA-6) exhibited low resistance to all the aminoglycosides because they lack aminoglycoside-modifying enzyme coding genes in their genome. The transmission electron microscopy of the three isolates revealed changes in cell size, shape, and septa formation, supporting the view that the phenomenon of adaptive resistance is operative in these isolates.

Broadcast in Ad hoc Wireless Networks with Selfish Nodes: A Bayesian Incentive Compatibility Approach

We consider the incentive compatible broadcast (ICB) problem in ad hoc wireless networks with selfish nodes. We design a Bayesian incentive compatible Broadcast (BIC-B) protocol to address this problem. VCG mechanism based schemes have been popularly used in the literature to design dominant strategy incentive compatible (DSIC) protocols for ad hoe wireless networks. VCG based mechanisms have two critical limitations: (i) the network is required to he bi-connected, (ii) the resulting protocol is not budget balanced. Our proposed BIC-B protocol overcomes these difficulties. We also prove the optimality of the proposed scheme.

Differential Mechanisms of Binding of Anti-Sigma Factors Escherichia coli Rsd and Bacteriophage T4 AsiA to E. coli RNA Polymerase Lead to Diverse Physiological Consequences

Anti-sigma factors Escherichia coli Rsd and bacteriophage T4 AsiA bind to the essential housekeeping sigma factor, sigma(70), of E. coli. Though both factors are known to interact with the C-terminal region of sigma(70), the physiological consequences of these interactions are very different. This study was undertaken for the purpose of deciphering the mechanisms by which E. coli Rsd and bacteriophage T4 AsiA inhibit or modulate the activity of E. coli RNA polymerase, which leads to the inhibition of E. coli cell growth to different amounts. It was found that AsiA is the more potent inhibitor of in vivo transcription and thus causes higher inhibition of E. coli cell growth. Measurements of affinity constants by surface plasmon resonance experiments showed that Rsd and AsiA bind to or 70 with similar affinity. Data obtained from in vivo and in vitro binding experiments clearly demonstrated that the major difference between AsiA and Rsd is the ability of AsiA to form a stable ternary complex with RNA polymerase. The binding patterns of AsiA and Rsd with sigma(70) studied by using the yeast two-hybrid system revealed that region 4 of sigma(70) is involved in binding to both of these anti-sigma factors; however, Rsd interacts with other regions of sigma(70) as well. Taken together, these results suggest that the higher inhibition of E. coli growth by AsiA expression is probably due to the ability of the AsiA protein to trap the holoenzyme RNA polymerase rather than its higher binding affinity to sigma(70).

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.

Interactive Distributed Source Coding in Asymmetric Communication Scenarios

We provide a new unified framework, called "multiple correlated informants - single recipient" communication, to address the variations of the traditional Distributed Source Coding (DSC) problem. Different combinations of the assumptions about the communication scenarios and the objectives of communication result in different variations of the DSC problem. For each of these variations, the complexities of communication and computation of the optimal solution is determined by the combination of the underlying assumptions. In the proposed framework, we address the asymmetric, interactive, and lossless variant of the DSC problem, with various objectives of communication and provide optimal solutions for those. Also, we consider both, the worst-case and average-case scenarios.

Mechanisms of formation of the Arabian Sea mini warm pool in a high-resolution Ocean General Circulation Model

An Ocean General Circulation Model of the Indian Ocean with high horizontal (0.25 degrees x 0.25 degrees) and vertical (40 levels) resolutions is used to study the dynamics and thermodynamics of the Arabian Sea mini warm pool (ASMWP), the warmest region in the northern Indian Ocean during January-April. The model simulates the seasonal cycle of temperature, salinity and currents as well as the winter time temperature inversions in the southeastern Arabian Sea (SEAS) quite realistically with climatological forcing. An experiment which maintained uniform salinity of 35 psu over the entire model domain reproduces the ASMWP similar to the control run with realistic salinity and this is contrary to the existing theories that stratification caused by the intrusion of low-salinity water from the Bay of Bengal into the SEAS is crucial for the formation of ASMWP. The contribution from temperature inversions to the warming of the SEAS is found to be negligible. Experiments with modified atmospheric forcing over the SEAS show that the low latent heat loss over the SEAS compared to the surroundings, resulting from the low winds due to the orographic effect of Western Ghats, plays an important role in setting up the sea surface temperature (SST) distribution over the SEAS during November March. During March-May, the SEAS responds quickly to the air-sea fluxes and the peak SST during April-May is independent of the SST evolution during previous months. The SEAS behaves as a low wind, heat-dominated regime during November-May and, therefore, the formation and maintenance of the ASMWP is not dependent on the near surface stratification.

On the Average Case Communication Complexity for Detection in Sensor Networks

The problem of sensor-network-based distributed intrusion detection in the presence of clutter is considered. It is argued that sensing is best regarded as a local phenomenon in that only sensors in the immediate vicinity of an intruder are triggered. In such a setting, lack of knowledge of intruder location gives rise to correlated sensor readings. A signal-space viewpoint is introduced in which the noise-free sensor readings associated to intruder and clutter appear as surfaces $\mathcal{S_I}$ and $\mathcal{S_C}$ and the problem reduces to one of determining in distributed fashion, whether the current noisy sensor reading is best classified as intruder or clutter. Two approaches to distributed detection are pursued. In the first, a decision surface separating $\mathcal{S_I}$ and $\mathcal{S_C}$ is identified using Neyman-Pearson criteria. Thereafter, the individual sensor nodes interactively exchange bits to determine whether the sensor readings are on one side or the other of the decision surface. Bounds on the number of bits needed to be exchanged are derived, based on communication complexity (CC) theory. A lower bound derived for the two-party average case CC of general functions is compared against the performance of a greedy algorithm. The average case CC of the relevant greater-than (GT) function is characterized within two bits. In the second approach, each sensor node broadcasts a single bit arising from appropriate two-level quantization of its own sensor reading, keeping in mind the fusion rule to be subsequently applied at a local fusion center. The optimality of a threshold test as a quantization rule is proved under simplifying assumptions. Finally, results from a QualNet simulation of the algorithms are presented that include intruder tracking using a naive polynomial-regression algorithm.

Uplink Power Control and Base Station Association in Multichannel Cellular Networks

A combined base station association and power control problem is studied for the uplink of multichannel multicell cellular networks, in which each channel is used by exactly one cell (i.e., base station). A distributed association and power update algorithm is proposed and shown to converge to a Nash equilibrium of a noncooperative game. We consider network models with discrete mobiles (yielding an atomic congestion game), as well as a continuum of mobiles (yielding a population game). We find that the equilibria need not be Pareto efficient, nor need they be system optimal. To address the lack of system optimality, we propose pricing mechanisms. It is shown that these mechanisms can be implemented in a distributed fashion.

Splitting Algorithms for Fast Relay Selection: Generalizations, Analysis, and a Unified View

Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting considerable attention. While several criteria have been proposed for selecting one or more relays, distributed mechanisms that perform the selection have received relatively less attention. In this paper, we develop a novel, yet simple, asymptotic analysis of a splitting-based multiple access selection algorithm to find the single best relay. The analysis leads to simpler and alternate expressions for the average number of slots required to find the best user. By introducing a new contention load' parameter, the analysis shows that the parameter settings used in the existing literature can be improved upon. New and simple bounds are also derived. Furthermore, we propose a new algorithm that addresses the general problem of selecting the best Q >= 1 relays, and analyze and optimize it. Even for a large number of relays, the scalable algorithm selects the best two relays within 4.406 slots and the best three within 6.491 slots, on average. We also propose a new and simple scheme for the practically relevant case of discrete metrics. Altogether, our results develop a unifying perspective about the general problem of distributed selection in cooperative systems and several other multi-node systems.

Stability of scheduled multi-access communication over quasi-static flat fading channels with random coding and independent decoding

The stability of scheduled multiaccess communication with random coding and independent decoding of messages is investigated. The number of messages that may be scheduled for simultaneous transmission is limited to a given maximum value, and the channels from transmitters to receiver are quasistatic, flat, and have independent fades. Requests for message transmissions are assumed to arrive according to an i.i.d. arrival process. Then, we show the following: (1) in the limit of large message alphabet size, the stability region has an interference limited information-theoretic capacity interpretation, (2) state-independent scheduling policies achieve this asymptotic stability region, and (3) in the asymptotic limit corresponding to immediate access, the stability region for non-idling scheduling policies is shown to be identical irrespective of received signal powers.

In vitro protection of umbilical cord blood–derived primitive hematopoietic stem progenitor cell pool by mannose-specific lectins via antioxidant mechanisms

BACKGROUND: Earlier we reported that an oral administration of two mannose-specific dietary lectins, banana lectin (BL) and garlic lectin (GL), led to an enhancement of hematopoietic stem and progenitor cell (HSPC) pool in mice. STUDY DESIGN AND METHODS: Cord blood–derived CD34+ HSPCs were incubated with BL, GL, Dolichos lectin (DL), or artocarpin lectin (AL) for various time periods in a serum- and growth factor–free medium and were subjected to various functional assays. Reactive oxygen species (ROS) levels were detected by using DCHFDA method. Cell fractionation was carried out using lectin-coupled paramagnetic beads. RESULTS: CD34+ cells incubated with the lectins for 10 days gave rise to a significantly higher number of colonies compared to the controls, indicating that all four lectins possessed the capacity to protect HSPCs in vitro. Comparative analyses showed that the protective ability of BL and GL was better than AL and DL and, therefore, further experiments were carried out with them. The output of long-term culture-initiating cell (LTC-IC) and extended LTC-IC assays indicated that both BL and GL protected primitive stem cells up to 30 days. The cells incubated with BL or GL showed a substantial reduction in the ROS levels, indicating that these lectins protect the HSPCs via antioxidant mechanisms. The mononuclear cell fraction isolated by lectin-coupled beads got enriched for primitive HSPCs, as reflected in the output of phenotypic and functional assays. CONCLUSION: The data show that both BL and GL protect the primitive HSPCs in vitro and may also serve as cost-effective HSPC enrichment tools.

Optimal threshold policies for admission control in communication networks via discrete parameter stochastic approximation

The problem of admission control of packets in communication networks is studied in the continuous time queueing framework under different classes of service and delayed information feedback. We develop and use a variant of a simulation based two timescale simultaneous perturbation stochastic approximation (SPSA) algorithm for finding an optimal feedback policy within the class of threshold type policies. Even though SPSA has originally been designed for continuous parameter optimization, its variant for the discrete parameter case is seen to work well. We give a proof of the hypothesis needed to show convergence of the algorithm on our setting along with a sketch of the convergence analysis. Extensive numerical experiments with the algorithm are illustrated for different parameter specifications. In particular, we study the effect of feedback delays on the system performance.

Singularity and controllability analysis of parallel manipulators and closed-loop mechanisms

This paper presents a study of kinematic and force singularities in parallel manipulators and closed-loop mechanisms and their relationship to accessibility and controllability of such manipulators and closed-loop mechanisms, Parallel manipulators and closed-loop mechanisms are classified according to their degrees of freedom, number of output Cartesian variables used to describe their motion and the number of actuated joint inputs. The singularities in the workspace are obtained by considering the force transformation matrix which maps the forces and torques in joint space to output forces and torques ill Cartesian space. The regions in the workspace which violate the small time local controllability (STLC) and small time local accessibility (STLA) condition are obtained by deriving the equations of motion in terms of Cartesian variables and by using techniques from Lie algebra.We show that for fully actuated manipulators when the number ofactuated joint inputs is equal to the number of output Cartesian variables, and the force transformation matrix loses rank, the parallel manipulator does not meet the STLC requirement. For the case where the number of joint inputs is less than the number of output Cartesian variables, if the constraint forces and torques (represented by the Lagrange multipliers) become infinite, the force transformation matrix loses rank. Finally, we show that the singular and non-STLC regions in the workspace of a parallel manipulator and closed-loop mechanism can be reduced by adding redundant joint actuators and links. The results are illustrated with the help of numerical examples where we plot the singular and non-STLC/non-STLA regions of parallel manipulators and closed-loop mechanisms belonging to the above mentioned classes. (C) 2000 Elsevier Science Ltd. All rights reserved.