Reduction and uptake of methylene blue from rat air spaces

The use of methylene blue (MB) to estimate dilution of epithelial lining fluid, which occurs during bronchoalveolar lavage (BAL), is complicated by loss of this redox dye from the air spaces. The rate of MB uptake from the air spaces of isolated rat lungs and the effects of oxidation and reduction on this process were investigated in this study. Movement of MB from the air spaces to perfusate was compared with the corresponding transport of 125I-labeled albumin, [14C]-dextran, 99mTc-labeled diethylenetriaminepentaacetate, [3H]-sucrose, and 3H2O. By the end of 2 min, MB concentrations in the BAL had fallen by 58 +/- 4% (SE; n = 11) and 3H2O by 78 +/- 2% (n = 13), whereas concentrations of the other indicators decreased by approximately 6%. All but 10% of the 3H2O lost from the air spaces was found in the perfusate, whereas 19% of the lost MB was not recovered in the perfusate, suggesting retention of MB in the pulmonary tissues. Absorption of MB from the air spaces was slowed by 20% when the lungs were left unperfused, and absorption was accelerated threefold by reduction of MB to leukomethylene blue with Na2S2O4. In contrast, MB losses from the air space were slowed by the oxidizing agent K3Fe(CN)6 and by addition of superoxide dismutase or ascorbic oxidase. It is therefore possible that ascorbic acid and O2- entering the air spaces reduce MB to the uncharged leuko form. Lowering the pH of the BAL fluid to 3.5 also slowed MB reabsorption. This suggests that acid aspiration may stimulate release of oxidants into the air spaces.     

Stop-flow studies of solute uptake in rat lungs

Stop-flow studies were used to characterize solute uptake in isolated rat lungs. These lungs were perfused at 8 or 34 ml/min for 10-28 s with solutions containing 125I-albumin and two or more of the following diffusible indicators: [3H]mannitol, [14C]urea, 3HOH, 201Tl+, or 86Rb+. After this loading period, flow was stopped for 10-300 s and then resumed to flush out the perfusate that remained in the pulmonary vasculature during the stop interval. Concentrations of 201Tl+ and 86Rb+ in the venous outflow decreased after the stop interval, indicating uptake from exchange vessels during the stop interval. The amount of these K+ analogs lost from the circulation during the stop interval was greater when the intervals were longer. However, losses of 201T1+ at 90 s approached those at 300 s. Because extraction continued after the vasculature had been flushed, vascular levels had presumably fallen to negligible levels during the stop interval. By 90 s of stop flow the vascular volume that was cleared of 201T1+ averaged 0.657 +/- 0.034 (SE) ml in the experiments perfused at 8 ml/min and 0.629 +/- 0.108 ml in those perfused at 34 ml/min. Increases in perfusate K+ decreased the cleared volumes of 201T1+ and 86Rb+. Uptake of [3H]mannitol, [14C]urea, and 3HOH during the stop intervals was observed only when the lungs were loaded at high flow for short intervals. Decreases in 201T1+ and 86Rb+ concentrations in the pulmonary outflow can be used to identify the fraction of the collected samples that were within exchange vessels of the lung during the stop interval and may help determine the distribution of solute and water exchange along the pulmonary vasculature.     

Weighted universal image compression

We describe a general coding strategy leading to a family of universal image compression systems designed to give good performance in applications where the statistics of the source to be compressed are not available at design time or vary over time or space. The basic approach considered uses a two-stage structure in which the single source code of traditional image compression systems is replaced with a family of codes designed to cover a large class of possible sources. To illustrate this approach, we consider the optimal design and use of two-stage codes containing collections of vector quantizers (weighted universal vector quantization), bit allocations for JPEG-style coding (weighted universal bit allocation), and transform codes (weighted universal transform coding). Further, we demonstrate the benefits to be gained from the inclusion of perceptual distortion measures and optimal parsing. The strategy yields two-stage codes that significantly outperform their single-stage predecessors. On a sequence of medical images, weighted universal vector quantization outperforms entropy coded vector quantization by over 9 dB. On the same data sequence, weighted universal bit allocation outperforms a JPEG-style code by over 2.5 dB. On a collection of mixed test and image data, weighted universal transform coding outperforms a single, data-optimized transform code (which gives performance almost identical to that of JPEG) by over 6 dB.     

Loss of CD28 expression on T lymphocytes: a marker of replicative senescence

A massive accumulation of neutrophils, mainly due to enhanced interleukin-8 (IL-8) levels, is believed to contribute to the deleterious effects of Pseudomonas aeruginosa lung infection, e.g., in cystic fibrosis (CF). Antibodies to phospholipase C, an exoenzyme of P. aeruginosa, are detected early and at high levels in CF patients. However, P. aeruginosa produces at least two types of phospholipase C (PLC), one haemolytic (PLC-H) and the other non-haemolytic (PLC-N), both with mol.wts of c. 77 kDa. Experiments were performed to evaluate the potential contribution of P. aeruginosa PLC to neutrophil accumulation during infection. Therefore, P. aeruginosa PLC-H and PLC-N were compared with regard to IL-8 generation from human monocytes. Purified PLC-H as well as culture supernates (mol.wt > 50 kDa) of a P. aeruginosa strain capable of producing both PLC-H and PLC-N, and mutant strains deficient in the production of one or other phospholipase, or both, were examined. Purified PLC-H (only at low concentrations up to 1 unit/4 x 10(5) monocytes), induced a dose-dependent increase in IL-8 release and IL-8-specific mRNA expression over that of unstimulated cells (at 4-, 12- and 24-h incubation times). Higher concentrations of PLC-H led to a decrease in IL-8 release and IL-8-specific mRNA expression. These findings were confirmed by the results obtained with the supernates of cultures of mutant strains of P. aeruginosa PAO1 that produced either a PLC-H or PLC-N or neither. Stimulation and inhibition of IL-8 release and mRNA expression were associated with a culture supernate fraction of mol. wt > 50 kDa and containing PLC-H. These results contribute to the understanding of the role of both P. aeruginosa PLC in IL-8 generation during their interaction with human monocytes.     

Polynomial time algorithms for multicast network code construction

The famous max-flow min-cut theorem states that a source node s can send information through a network (V, E) to a sink node t at a rate determined by the min-cut separating s and t. Recently, it has been shown that this rate can also be achieved for multicasting to several sinks provided that the intermediate nodes are allowed to re-encode the information they receive. We demonstrate examples of networks where the achievable rates obtained by coding at intermediate nodes are arbitrarily larger than if coding is not allowed. We give deterministic polynomial time algorithms and even faster randomized algorithms for designing linear codes for directed acyclic graphs with edges of unit capacity. We extend these algorithms to integer capacities and to codes that are tolerant to edge failures.     

A Practical Scheme for Wireless Network Operation

In many problems in wireline networks, it is known that achieving capacity on each link or subnetwork is optimal for the entire network operation. In this paper, we present examples of wireless networks in which decoding and achieving capacity on certain links or subnetworks gives us lower rates than other simple schemes, like forwarding. This implies that the separation of channel and network coding that holds for many classes of wireline networks does not, in general, hold for wireless networks. Next, we consider Gaussian and erasure wireless networks where nodes are permitted only two possible operations: nodes can either decode what they receive (and then re-encode and transmit the message) or simply forward it. We present a simple greedy algorithm that returns the optimal scheme from the exponential-sized set of possible schemes. This algorithm will go over each node at most once to determine its operation, and hence, is very efficient. We also present a decentralized algorithm whose performance can approach the optimum arbitrarily closely in an iterative fashion     

Resilient Network Coding in the Presence of Byzantine Adversaries

Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a malicious node can end up contaminating all the information reaching a destination, preventing decoding. This paper introduces distributed polynomial-time rate-optimal network codes that work in the presence of Byzantine nodes. We present algorithms that target adversaries with different attacking capabilities. When the adversary can eavesdrop on all links and jam links, our first algorithm achieves a rate of , where is the network capacity. In contrast, when the adversary has limited eavesdropping capabilities, we provide algorithms that achieve the higher rate of . Our algorithms attain the optimal rate given the strength of the adversary. They are information-theoretically secure. They operate in a distributed manner, assume no knowledge of the topology, and can be designed and implemented in polynomial time. Furthermore, only the source and destination need to be modified; nonmalicious nodes inside the network are oblivious to the presence of adversaries and implement a classical distributed network code. Finally, our algorithms work over wired and wireless networks.     

Low-Complexity Approaches to Slepian–Wolf Near-Lossless Distributed Data Compression

This paper discusses the Slepian-Wolf problem of distributed near-lossless compression of correlated sources. We introduce practical new tools for communicating at all rates in the achievable region. The technique employs a simple "source-splitting" strategy that does not require common sources of randomness at the encoders and decoders. This approach allows for pipelined encoding and decoding so that the system operates with the complexity of a single user encoder and decoder. Moreover, when this splitting approach is used in conjunction with iterative decoding methods, it produces a significant simplification of the decoding process. We demonstrate this approach for synthetically generated data. Finally, we consider the Slepian-Wolf problem when linear codes are used as syndrome-formers and consider a linear programming relaxation to maximum-likelihood (ML) sequence decoding. We note that the fractional vertices of the relaxed polytope compete with the optimal solution in a manner analogous to that observed when the "min-sum" iterative decoding algorithm is applied. This relaxation exhibits the ML-certificate property: if an integral solution is found, it is the ML solution. For symmetric binary joint distributions, we show that selecting easily constructable "expander"-style low-density parity check codes (LDPCs) as syndrome-formers admits a positive error exponent and therefore provably good performance