Finding the right solution

A guide to option appraisal

Determinants of self-reported smoking and misclassification during pregnancy, and analysis of optimal cut-off points for urinary cotinine: a cross-sectional study

10 p.

Ca2+ Influx and Tyrosine Kinases Trigger Bordetella Adenylate Cyclase Toxin (ACT) Endocytosis. Cell Physiology and Expression of the CD11b/CD18 Integrin Major Determinants of the Entry Route

Humans infected with Bordetella pertussis, the whooping cough bacterium, show evidences of impaired host defenses. This pathogenic bacterium produces a unique adenylate cyclase toxin (ACT) which enters human phagocytes and catalyzes the unregulated formation of cAMP, hampering important bactericidal functions of these immune cells that eventually cause cell death by apoptosis and/or necrosis. Additionally, ACT permeabilizes cells through pore formation in the target cell membrane. Recently, we demonstrated that ACT is internalised into macrophages together with other membrane components, such as the integrin CD11b/CD18 (CR3), its receptor in these immune cells, and GM1. The goal of this study was to determine whether ACT uptake is restricted to receptor-bearing macrophages or on the contrary may also take place into cells devoid of receptor and gain more insights on the signalling involved. Here, we show that ACT is rapidly eliminated from the cell membrane of either CR3-positive as negative cells, though through different entry routes, which depends in part, on the target cell physiology and characteristics. ACT-induced Ca2+ influx and activation of non-receptor Tyr kinases into the target cell appear to be common master denominators in the different endocytic strategies activated by this toxin. Very importantly, we show that, upon incubation with ACT, target cells are capable of repairing the cell membrane, which suggests the mounting of an anti-toxin cell repair-response, very likely involving the toxin elimination from the cell surface.

A block SPP algorithm for multidimensional tridiagonal equations with optimal message vector length

A parallel strategy for solving multidimensional tridiagonal equations is investigated in this paper. We present in detail an improved version of single parallel partition (SPP) algorithm in conjunction with message vectorization, which aggregates several communication messages into one to reduce the communication cost. We show the resulting block SPP can achieve good speedup for a wide range of message vector length (MVL), especially when the number of grid points in the divided direction is large. Instead of only using the largest possible MVL, we adopt numerical tests and modeling analysis to determine an optimal MVL so that significant improvement in speedup can be obtained.

On optimal message vector length for block single parallel partition algorithm in a three-dimensional ADI solver

It has long been recognized that many direct parallel tridiagonal solvers are only efficient for solving a single tridiagonal equation of large sizes, and they become inefficient when naively used in a three-dimensional ADI solver. In order to improve the parallel efficiency of an ADI solver using a direct parallel solver, we implement the single parallel partition (SPP) algorithm in conjunction with message vectorization, which aggregates several communication messages into one to reduce the communication costs. The measured performances show that the longest allowable message vector length (MVL) is not necessarily the best choice. To understand this observation and optimize the performance, we propose an improved model that takes the cache effect into consideration. The optimal MVL for achieving the best performance is shown to depend on number of processors and grid sizes. Similar dependence of the optimal MVL is also found for the popular block pipelined method.