Expression of C-reactive protein in human lung epithelial cells and up-regulation by cytokines and carbon particles.

C-reactive protein (CRP) is the prototypic human acute-phase protein and is found at increased levels in the blood during episodes of inflammation. CRP was generally thought to be produced only by hepatocytes; however, several studies have shown extrahepatic synthesis of CRP. A previous study showed that PM10 and ultrafine carbon black (ufCB) were able to induce CRP expression in A549 cells. This study aims to examine the factors that lead to the production of CRP in A549 cells. A549 human lung epithelial cells were treated with cytokines (interleukin 6, tumor necrosis factor , interferon , or interleukin 1) or carbon particles (CB and ufCB) for 18 h. It was found that CRP could be expressed within the cells and that CRP was secreted from the cells particularly with tumor necrosis factor , CB and ufCB treatments. It was also found that this expression of CRP with CB and ufCB treatments was dependent on nuclear factor kappa B (NFB). The expression of CRP in A549 cells may indicate an important role for CRP expression and secretion from lung epithelial cells in response to inflammatory stimuli.

Time-dependent Hyperstar algorithm for robust vehicle navigation in time-dependent stochastic road networks.

The vehicle navigation problem studied in Bell (2009) is revisited and a time-dependent reverse Hyperstar algorithm is presented. This minimises the expected time of arrival at the destination, and all intermediate nodes, where expectation is based on a pessimistic (or risk-averse) view of unknown link delays. This may also be regarded as a hyperpath version of the Chabini and Lan (2002) algorithm, which itself is a time-dependent A* algorithm. Links are assigned undelayed travel times and maximum delays, both of which are potentially functions of the time of arrival at the respective link. The driver seeks probabilities for link use that minimise his/her maximum exposure to delay on the approach to each node, leading to the determination of the pessimistic expected time of arrival. Since the context considered is vehicle navigation where the driver is not making repeated trips, the probability of link use may be interpreted as a measure of link attractiveness, so a link with a zero probability of use is unattractive while a link with a probability of use equal to one will have no attractive alternatives. A solution algorithm is presented and proven to solve the problem provided the node potentials are feasible and a FIFO condition applies for undelayed link travel times. The paper concludes with a numerical example.