36 resultados para Lymph nodes
em Indian Institute of Science - Bangalore - Índia
Resumo:
Activation of macrophages by interferon gamma (IFN- ) and the subsequent production of nitric oxide (NO) are critical for the host defence against Salmonella enterica serovar Typhimurium infection. We report here the inhibition of IFN- -induced NO production in RAW264.7 macrophages infected with wild-type Salmonella. This phenomenon was shown to be dependent on the nirC gene, which encodes a potential nitrite transporter. We observed a higher NO output from IFN- -treated macrophages infected with a nirC mutant of Salmonella. The nirC mutant also showed significantly decreased intracellular proliferation in a NO-dependent manner in activated RAW264.7 macrophages and in liver, spleen and secondary lymph nodes of mice, which was restored by complementing the gene in trans. Under acidified nitrite stress, a twofold more pronounced NO-mediated repression of SPI2 was observed in the nirC knockout strain compared to the wild-type. This enhanced SPI2 repression in the nirC knockout led to a higher level of STAT-1 phosphorylation and inducible nitric oxide synthase (iNOS) expression than seen with the wild-type strain. In iNOS knockout mice, the organ load of the nirC knockout strain was similar to that of the wild-type strain, indicating that the mutant is exclusively sensitive to the host nitrosative stress. Taken together, these results reveal that intracellular Salmonella evade killing in activated macrophages by downregulating IFN- -induced NO production, and they highlight the critical role of nirC as a virulence gene.
Resumo:
Gastrointestinal infections with Salmonella enterica serovars have different clinical outcomes that range from localized inflammation to a life-threatening systemic disease in the case of typhoid fever. Using a mouse model of systemic salmonellosis, we investigated the contribution of neutrophils to the innate immune defense against Salmonella after oral infection. Neutrophil infiltration was dependent on the bacterial burden in various infected organs (Peyer's patches, mesenteric lymph nodes, spleen, and liver). However, the massive infiltration of neutrophils did not allow clearance of an infection with wild-type Salmonella, presumably due to protection of intracellular Salmonella against neutrophil activities. A Salmonella mutant strain deficient in Salmonella pathogenicity island 2 (SPI2) was able to infect systemic sites, but its replication was highly restricted and it did not cause detectable attraction of neutrophils. Neutrophil depletion by antibody treatment of mice did not restore the virulence of SPI2 or auxotrophic mutant strains, supporting the hypothesis that attenuation of the strains is not due to greater susceptibility to neutrophil killing. Our observations reveal that neutrophils have completely different roles during systemic salmonellosis and localized gastrointestinal infections. In the latter conditions, rapid neutrophil attraction efficiently prevents the spread of the pathogen, whereas the neutrophil influx is delayed during systemic infections and cannot protect against lethal bacteremia.
Resumo:
During the course of infection, Salmonella has to face several potentially lethal environmental conditions, one such being acidic pH. The ability to sense and respond to the acidic pH is crucial for the survival and replication of Salmonella. The physiological role of one gene (STM1485) involved in this response, which is upregulated inside the host cells (by 90- to 113-fold) is functionally characterized in Salmonella pathogenesis. In vitro, the DSTM1485 neither exhibited any growth defect at pH 4.5 nor any difference in the acid tolerance response. The DSTM1485 was compromised in its capacity to proliferate inside the host cells and complementation with STM1485 gene restored its virulence. We further demonstrate that the surface translocation of Salmonella pathogenicity island-2 (SPI-2) encoded translocon proteins, SseB and SseD were reduced in the DSTM1485. The increase in co-localization of this mutant with lysosomes was also observed. In addition, the DSTM1485 displayed significantly reduced competitive indices (CI) in spleen, liver and mesenteric lymph nodes in murine typhoid model when infected by intra-gastric route. Based on these results, we conclude that the acidic pH induced STM1485 gene is essential for intracellular replication of Salmonella.
Resumo:
The natural product fumagillin exhibits potent antiproliferative and antiangiogenic properties. The semisynthetic analog PPI-2458, (3R,4S,5S,6R)-5-methoxy-4-(2R,3R)-2-methyl-3-(3-methylbut-2-enyl) oxiran-2-yl]-1-oxaspiro2.5]octan-6-yl] N-(2R)-1-amino-3-methyl-1-oxobutan-2-yl]carbamate, demonstrates rapid inactivation of its molecular target, methionine aminopeptidase-2 (MetAP2), and good efficacy in several rodent models of cancer and inflammation with oral dosing despite low apparent oral bioavailability. To probe the basis of its in vivo efficacy, the metabolism of PPI-2458 was studied in detail. Reaction phenotyping identified CYP3A4/5 as the major source of metabolism in humans. Six metabolites were isolated from liver microsomes and characterized by mass spectrometry and nuclear resonance spectroscopy, and their structures were confirmed by chemical synthesis. The synthetic metabolites showed correlated inhibition of MetAP2 enzymatic activity and vascular endothelial cell growth. In an ex vivo experiment, MetAP2 inhibition in white blood cells, thymus, and lymph nodes in rats after single dosing with PPI-2458 and the isolated metabolites was found to correlate with the in vitro activity of the individual species. In a phase 1 clinical study, PPI-2458 was administered to patients with non-Hodgkin lymphoma. At 15 mg administered orally every other day, MetAP2 in whole blood was 80% inactivated for up to 48 hours, although the exposure of the parent compound was only similar to 10% that of the summed cytochrome P450 metabolites. Taken together, the data confirm the participation of active metabolites in the in vivo efficacy of PPI-2458. The structures define a metabolic pathway for PPI-2458 that is distinct from that of TNP-470 ((3R, 4S, 5S, 6R)-5-methoxy-4-(2R, 3R)-2-methyl-3-(3-methylbut-2-enyl)oxiran-2-yl]-1-oxaspiro2.5]octan-6 -yl] N-(2-chloroacetyl)carbamate). The high level of MetAP2 inhibition achieved in vivo supports the value of fumagillin-derived therapeutics for angiogenic diseases.
Resumo:
Monte Carlo modeling of light transport in multilayered tissue (MCML) is modified to incorporate objects of various shapes (sphere, ellipsoid, cylinder, or cuboid) with a refractive-index mismatched boundary. These geometries would be useful for modeling lymph nodes, tumors, blood vessels, capillaries, bones, the head, and other body parts. Mesh-based Monte Carlo (MMC) has also been used to compare the results from the MCML with embedded objects (MCML-EO). Our simulation assumes a realistic tissue model and can also handle the transmission/reflection at the object-tissue boundary due to the mismatch of the refractive index. Simulation of MCML-EO takes a few seconds, whereas MMC takes nearly an hour for the same geometry and optical properties. Contour plots of fluence distribution from MCML-EO and MMC correlate well. This study assists one to decide on the tool to use for modeling light propagation in biological tissue with objects of regular shapes embedded in it. For irregular inhomogeneity in the model (tissue), MMC has to be used. If the embedded objects (inhomogeneity) are of regular geometry (shapes), then MCML-EO is a better option, as simulations like Raman scattering, fluorescent imaging, and optical coherence tomography are currently possible only with MCML. (C) 2014 Society of Photo-Optical Instrumentation Engineers (SPIE)
Resumo:
The distribution of black leaf nodes at each level of a linear quadtree is of significant interest in the context of estimation of time and space complexities of linear quadtree based algorithms. The maximum number of black nodes of a given level that can be fitted in a square grid of size 2n × 2n can readily be estimated from the ratio of areas. We show that the actual value of the maximum number of nodes of a level is much less than the maximum obtained from the ratio of the areas. This is due to the fact that the number of nodes possible at a level k, 0≤k≤n − 1, should consider the sum of areas occupied by the actual number of nodes present at levels k + 1, k + 2, …, n − 1.
Resumo:
Analytical models of IEEE 802.11-based WLANs are invariably based on approximations, such as the well-known mean-field approximations proposed by Bianchi for saturated nodes. In this paper, we provide a new approach for modeling the situation when the nodes are not saturated. We study a State Dependent Attempt Rate (SDAR) approximation to model M queues (one queue per node) served by the CSMA/CA protocol as standardized in the IEEE 802.11 DCF. The approximation is that, when n of the M queues are non-empty, the attempt probability of the n non-empty nodes is given by the long-term attempt probability of n saturated nodes as provided by Bianchi's model. This yields a coupled queue system. When packets arrive to the M queues according to independent Poisson processes, we provide an exact model for the coupled queue system with SDAR service. The main contribution of this paper is to provide an analysis of the coupled queue process by studying a lower dimensional process and by introducing a certain conditional independence approximation. We show that the numerical results obtained from our finite buffer analysis are in excellent agreement with the corresponding results obtained from ns-2 simulations. We replace the CSMA/CA protocol as implemented in the ns-2 simulator with the SDAR service model to show that the SDAR approximation provides an accurate model for the CSMA/CA protocol. We also report the simulation speed-ups thus obtained by our model-based simulation.
Resumo:
We study sensor networks with energy harvesting nodes. The generated energy at a node can be stored in a buffer. A sensor node periodically senses a random field and generates a packet. These packets are stored in a queue and transmitted using the energy available at that time at the node. For such networks we develop efficient energy management policies. First, for a single node, we obtain policies that are throughput optimal, i.e., the data queue stays stable for the largest possible data rate. Next we obtain energy management policies which minimize the mean delay in the queue. We also compare performance of several easily implementable suboptimal policies. A greedy policy is identified which, in low SNR regime, is throughput optimal and also minimizes mean delay. Next using the results for a single node, we develop efficient MAC policies.
Resumo:
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.
Resumo:
In this paper we present and compare the results obtained from semi-classical and quantum mechanical simulation for a Double Gate MOSFET structure to analyze the electrostatics and carrier dynamics of this device. The geometries like gate length, body, thickness of this device have been chosen according to the ITRS specification for the different technology nodes. We have shown the extent of deviation between the semi-classical and quantum mechanical results and hence the need of quantum simulations for the promising nanoscale devices in the future technology nodes predicted in ITRS.
Resumo:
The IEEE 802.1le medium access control (MAC) standard provides distributed service differentiation or Quality-of- Service (QoS) by employing a priority system. In 802.1 le networks, network traffic is classified into different priorities or access categories (ACs). Nodes maintain separate queues for each AC and packets at the head-of-line (HOL) of each queue contend for channel access using AC-specific parameters. Such a mechanism allows the provision of differentiated QoS where high priority, performance sensitive traffic such as voice and video applications will enjoy less delay, greater throughput and smaller loss, compared to low priority traffic (e. g. file transfer). The standard implicitly assumes that nodes are honest and will truthfully classify incoming traffic into its appropriate AC. However, in the absence of any additional mechanism, selfish users can gain enhanced performance by selectively classifying low priority traffic as high priority, potentially destroying the QoS capability of the system.
Resumo:
Our study concerns an important current problem, that of diffusion of information in social networks. This problem has received significant attention from the Internet research community in the recent times, driven by many potential applications such as viral marketing and sales promotions. In this paper, we focus on the target set selection problem, which involves discovering a small subset of influential players in a given social network, to perform a certain task of information diffusion. The target set selection problem manifests in two forms: 1) top-k nodes problem and 2) lambda-coverage problem. In the top-k nodes problem, we are required to find a set of k key nodes that would maximize the number of nodes being influenced in the network. The lambda-coverage problem is concerned with finding a set of k key nodes having minimal size that can influence a given percentage lambda of the nodes in the entire network. We propose a new way of solving these problems using the concept of Shapley value which is a well known solution concept in cooperative game theory. Our approach leads to algorithms which we call the ShaPley value-based Influential Nodes (SPINs) algorithms for solving the top-k nodes problem and the lambda-coverage problem. We compare the performance of the proposed SPIN algorithms with well known algorithms in the literature. Through extensive experimentation on four synthetically generated random graphs and six real-world data sets (Celegans, Jazz, NIPS coauthorship data set, Netscience data set, High-Energy Physics data set, and Political Books data set), we show that the proposed SPIN approach is more powerful and computationally efficient. Note to Practitioners-In recent times, social networks have received a high level of attention due to their proven ability in improving the performance of web search, recommendations in collaborative filtering systems, spreading a technology in the market using viral marketing techniques, etc. It is well known that the interpersonal relationships (or ties or links) between individuals cause change or improvement in the social system because the decisions made by individuals are influenced heavily by the behavior of their neighbors. An interesting and key problem in social networks is to discover the most influential nodes in the social network which can influence other nodes in the social network in a strong and deep way. This problem is called the target set selection problem and has two variants: 1) the top-k nodes problem, where we are required to identify a set of k influential nodes that maximize the number of nodes being influenced in the network and 2) the lambda-coverage problem which involves finding a set of influential nodes having minimum size that can influence a given percentage lambda of the nodes in the entire network. There are many existing algorithms in the literature for solving these problems. In this paper, we propose a new algorithm which is based on a novel interpretation of information diffusion in a social network as a cooperative game. Using this analogy, we develop an algorithm based on the Shapley value of the underlying cooperative game. The proposed algorithm outperforms the existing algorithms in terms of generality or computational complexity or both. Our results are validated through extensive experimentation on both synthetically generated and real-world data sets.
Resumo:
We consider the problem of tracking an intruder in a plane region by using a wireless sensor network comprising motes equipped with passive infrared (PIR) sensors deployed over the region. An input-output model for the PIR sensor and a method to estimate the angular speed of the target from the sensor output are proposed. With the measurement model so obtained, we study the centralized and decentralized tracking performance using the extended Kalman filter.
Resumo:
We consider a wireless sensor network whose main function is to detect certain infrequent alarm events, and to forward alarm packets to a base station, using geographical forwarding. The nodes know their locations, and they sleep-wake cycle, waking up periodically but not synchronously. In this situation, when a node has a packet to forward to the sink, there is a trade-off between how long this node waits for a suitable neighbor to wake up and the progress the packet makes towards the sink once it is forwarded to this neighbor. Hence, in choosing a relay node, we consider the problem of minimizing average delay subject to a constraint on the average progress. By constraint relaxation, we formulate this next hop relay selection problem as a Markov decision process (MDP). The exact optimal solution (BF (Best Forward)) can be found, but is computationally intensive. Next, we consider a mathematically simplified model for which the optimal policy (SF (Simplified Forward)) turns out to be a simple one-step-look-ahead rule. Simulations show that SF is very close in performance to BF, even for reasonably small node density. We then study the end-to-end performance of SF in comparison with two extremal policies: Max Forward (MF) and First Forward (FF), and an end-to-end delay minimising policy proposed by Kim et al. 1]. We find that, with appropriate choice of one hop average progress constraint, SF can be tuned to provide a favorable trade-off between end-to-end packet delay and the number of hops in the forwarding path.
Resumo:
Understanding the basis of normal heart remodeling can provide insight into the plasticity of the cardiac state, and into the potential for treating diseased tissue. In Drosophila, the adult heart arises during metamorphosis from a series of events, that include the remodeling of an existing cardiac tube, the elaboration of new inflow tracts, and the addition of a layer of longitudinal muscle fibers. We have identified genes active in all these three processes, and studied their expression in order to characterize in greater detail normal cardiac remodeling. Using a Transglutaminase-lacZ transgenic line, that is expressed in the inflow tracts of the larval and adult heart, we confirm the existence of five inflow tracts in the adult structure. In addition, expression of the Actin87E actin gene is initiated in the remodeling cardiac tube, but not in the longitudinal fibers, and we have identified an Act87E promoter fragment that recapitulates this switch in expression. We also establish that the longitudinal fibers are multinucleated, characterizing these cells as specialized skeletal muscles. Furthermore, we have defined the origin of the longitudinal fibers, as a subset of lymph gland cells associated with the larval dorsal vessel. These studies underline the myriad contributors to the formation of the adult Drosophila heart, and provide new molecular insights into the development of this complex organ. (C) 2011 Elsevier Ireland Ltd. All rights reserved.