Prevalence of multidrug-resistant Staphylococcus aureus in diabetics clinical samples

Antibiotic resistance in 40 Staphylococcus aureus clinical isolates from 110 diabetic patients (36%) was evaluated. Of these, 32 (80%) of the isolates showed multidrug-resistance to more than eight antibiotics and 35% isolates were found to be methicillin resistant S. aureus (MRSA). All 40 S. aureus strains (100%) screened from diabetic clinical specimens were resistant to penicillin, 63% to ampicillin, 55% to streptomycin, 50% to tetracycline and 50% to gentamicin. Where as low resistance rate was observed to ciprofloxacin (20%) and rifampicin (8%). In contrast, all (100%) S. aureus strains recorded susceptibility to teicoplanin, which was followed by vancomycin (95%). Genotypical examination revealed that 80% of the aminoglycoside resistant S. aureus (ARSA) have aminoglycoside modifying enzyme (AME) coding genes; however, 20% of ARSA which showed non-AME mediated (adaptive) aminoglycoside resistance lacked these genes in their genome. In contrast all MRSA isolates possessed mecA, femA genetic determinants in their genome.

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.

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.

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.

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.

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.

Detection,amplification and sequence homology of sodC in clinical isolates of Salmonella sp

Background & objectives: Periplasmic copper and zinc superoxide dismutase (Cu,Zn-SOD or SodC) is an important component of the antioxidant shield which protects bacteria from the phagocytic oxidative burst. Cu,Zn-SODs protect Gram-negative bacteria against oxygen damage which have also been shown to contribute to the pathogenicity of these bacterial species. We report the presence of SodC in drug resistant Salmonella sp. isolated from patients suffering from enteric fever. Further sodC was amplified, cloned into Escherichia coli and the nucleotide sequence and amino acid sequence homology were compared with the standard strain Salmonella Typhimurium 14028. Methods: Salmonella enterica serovar Typhi (S. Typhi) and Salmonellaenterica serovar Paratyphi (S. Paratyphi) were isolated and identified from blood samples of the patients. The isolates were screened for the presence of Cu, Zn-SOD by PAGE using KCN as inhibitor of Cu,Zn-SOD. The gene (sodC) was amplified by PCR, cloned and sequenced. The nucleotide and amino acid sequences of sodC were compared using CLUSTAL X.Results: SodC was detected in 35 per cent of the Salmonella isolates. Amplification of the genomic DNA of S. Typhi and S. Paratyphi with sodC specific primers resulted in 519 and 515 bp amplicons respectively. Single mutational difference at position 489 was observed between thesodC of S. Typhi and S. Paratyphi while they differed at 6 positions with the sodC of S. Typhimurium 14028. The SodC amino acid sequences of the two isolates were homologous but 3 amino acid difference was observed with that of standard strain S. Typhimurium 14028.Interpretation & conclusions: The presence of SodC in pathogenic bacteria could be a novel candidate as phylogenetic marker.