Porphyromonas gingivalis lipopolysaccharide alters atherosclerotic-related gene expression in oxidized low-density-lipoprotein-induced macrophages and foam cells

The molecular mechanism between atherosclerosis formation and periodontal pathogens is not clear although positive correlation between periodontal infections and cardiovascular diseases has been reported. Objective: To determine if atherosclerosis related genes were affected in foam cells during and after its formation by P. gingivalis lipopolysaccharide (LPS) stimulation. Methods: Macrophages from human THP-1 monocytes were treated with oxidized low density lipoprotein (oxLDL) to induce the formation of foam cells. P. gingivalis LPS was added to cultures of either oxLDL-induced macrophages or foam cells. The expression of atherosclerosis related genes was assayed by quantitative real time PCR and the protein production of granulocyte-macrophage colony-stimulating factor（GM-CSF）, monocyte chemotactic protein-1 (MCP-1), IL-1β, IL-10 and IL-12 was determined by ELISA. Nuclear translocation of NF-κB P65 was detected by immunocytochemistry and western blot was used to evaluate IKB-α degradation to confirm the NF-κB pathway activation. Results: P. gingivalis LPS stimulated atherosclerosis related gene expression in foam cells and increased oxLDL induced expression of chemokines, adhesion molecules, growth factors, apoptotic genes, and nuclear receptors in macrophages. Transcription of the pro-inflammatory cytokines IL-1β and IL-12 was elevated in response to LPS in both macrophages and foam cells, whereas the anti-inflammatory cytokine IL-10 was not affected. Increased NF-κB pathway activation was also observed in LPS and oxLDL co-stimulated macrophages. Conclusion: P. gingivalis LPS appears to be an important factor in the development of atherosclerosis by stimulation of atherosclerosis related gene expression in both macrophages and foam cells via activation of the NF-κB pathway.

Cell density alters matrix accumulation in two distinct fractions and the mechanical integrity of alginate-chondrocyte constructs

Chondrocyte density in articular cartilage is known to change with the development and growth of the tissue and may play an important role in the formation of a functional extracellular matrix (ECM). The objective of this study was to determine how initial chondrocyte density in an alginate hydrogel affects the matrix composition, its distribution between the cell-associated (CM) and further removed matrix (FRM) fractions, and the tensile mechanical properties of the developing engineered cartilage. Alginate constructs containing primary bovine chondrocytes at densities of 0, 4, 16, and 64 million cells/ml were fabricated and cultured for 1 or 2 weeks, at which time structural, biochemical, and mechanical properties were analyzed. Both matrix content and distribution varied with the initial cell density. Increasing cell density resulted in an increasing content of collagen and sulfated-glycosaminoglycan (GAG) and an increasing proportion of these molecules localized in the CM. While the equilibrium tensile modulus of cell-free alginate did not change with time in culture, the constructs with highest cell density were 116% stiffer than cell-free controls after 2 weeks of culture. The equilibrium tensile modulus was positively correlated with total collagen (r2 = 0.47, p < 0.001) and GAG content (r2 = 0.68, p < 0.001), and these relationships were enhanced when analyzing only those matrix molecules in the CM fraction (r2 = 0.60 and 0.72 for collagen and GAG, respectively, each p < 0.001). Overall, the results of this study indicate that initial cell density has a considerable effect on the developing composition, structure, and function of alginate–chondrocyte constructs.

High-density lipoprotein and the risk of recurrent venous thromboembolism

BACKGROUND - High-density lipoprotein (HDL) protects against arterial atherothrombosis, but it is unknown whether it protects against recurrent venous thromboembolism. METHODS AND RESULTS - We studied 772 patients after a first spontaneous venous thromboembolism (average follow-up 48 months) and recorded the end point of symptomatic recurrent venous thromboembolism, which developed in 100 of the 772 patients. The relationship between plasma lipoprotein parameters and recurrence was evaluated. Plasma apolipoproteins AI and B were measured by immunoassays for all subjects. Compared with those without recurrence, patients with recurrence had lower mean (±SD) levels of apolipoprotein AI (1.12±0.22 versus 1.23±0.27 mg/mL, P<0.001) but similar apolipoprotein B levels. The relative risk of recurrence was 0.87 (95% CI, 0.80 to 0.94) for each increase of 0.1 mg/mL in plasma apolipoprotein AI. Compared with patients with apolipoprotein AI levels in the lowest tertile (<1.07 mg/mL), the relative risk of recurrence was 0.46 (95% CI, 0.27 to 0.77) for the highest-tertile patients (apolipoprotein AI >1.30 mg/mL) and 0.78 (95% CI, 0.50 to 1.22) for midtertile patients (apolipoprotein AI of 1.07 to 1.30 mg/mL). Using nuclear magnetic resonance, we determined the levels of 10 major lipoprotein subclasses and HDL cholesterol for 71 patients with recurrence and 142 matched patients without recurrence. We found a strong trend for association between recurrence and low levels of HDL particles and HDL cholesterol. CONCLUSIONS - Patients with high levels of apolipoprotein AI and HDL have a decreased risk of recurrent venous thromboembolism. © 2007 American Heart Association, Inc.

High-density lipoprotein deficiency and dyslipoproteinemia associated with venous thrombosis in men

Background-Although dyslipoproteinemia is associated with arterial atherothrombosis, little is known about plasma lipoproteins in venous thrombosis patients. Methods and Results-We determined plasma lipoprotein subclass concentrations using nuclear magnetic resonance spectroscopy and antigenic levels of apolipoproteins AI and B in blood samples from 49 male venous thrombosis patients and matched controls aged <55 years. Venous thrombosis patients had significantly lower levels of HDL particles, large HDL particles, HDL cholesterol, and apolipoprotein AI and significantly higher levels of LDL particles and small LDL particles. The quartile-based odds ratios for decreased HDL particle and apolipoprotein AI levels in patients compared with controls were 6.5 and 6.0 (95% CI, 2.3 to 19 and 2.1 to 17), respectively. Odds ratios for apolipoprotein B/apolipoprotein AI ratio and LDL cholesterol/HDL cholesterol ratio were 6.3 and 2.7 (95% CI, 1.9 to 21 and 1.1 to 6.5), respectively. When polymorphisms in genes for hepatic lipase, endothelial lipase, and cholesteryl ester transfer protein were analyzed, patients differed significantly from controls in the allelic frequency for the TaqI B1/B2 polymorphism in cholesteryl ester transfer protein, consistent with the observed pattern of lower HDL and higher LDL. Conclusions-Venous thrombosis in men aged <55 years old is associated with dyslipoproteinemia involving lower levels of HDL particles, elevated levels of small LDL particles, and an elevated ratio of apolipoprotein B/apolipoprotein AI. This dyslipoproteinemia seems associated with a related cholesteryl ester transfer protein genotype difference. © 2005 American Heart Association, Inc.

Infinite-horizon policy-gradient estimation

Gradient-based approaches to direct policy search in reinforcement learning have received much recent attention as a means to solve problems of partial observability and to avoid some of the problems associated with policy degradation in value-function methods. In this paper we introduce GPOMDP, a simulation-based algorithm for generating a biased estimate of the gradient of the average reward in Partially Observable Markov Decision Processes (POMDPs) controlled by parameterized stochastic policies. A similar algorithm was proposed by Kimura, Yamamura, and Kobayashi (1995). The algorithm's chief advantages are that it requires storage of only twice the number of policy parameters, uses one free parameter β ∈ [0,1) (which has a natural interpretation in terms of bias-variance trade-off), and requires no knowledge of the underlying state. We prove convergence of GPOMDP, and show how the correct choice of the parameter β is related to the mixing time of the controlled POMDP. We briefly describe extensions of GPOMDP to controlled Markov chains, continuous state, observation and control spaces, multiple-agents, higher-order derivatives, and a version for training stochastic policies with internal states. In a companion paper (Baxter, Bartlett, & Weaver, 2001) we show how the gradient estimates generated by GPOMDP can be used in both a traditional stochastic gradient algorithm and a conjugate-gradient procedure to find local optima of the average reward. ©2001 AI Access Foundation and Morgan Kaufmann Publishers. All rights reserved.

Exponentiated gradient algorithms for conditional random fields and max-margin Markov Networks

Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of parameters in these models is therefore an important problem, and becomes a key factor when learning from very large data sets. This paper describes exponentiated gradient (EG) algorithms for training such models, where EG updates are applied to the convex dual of either the log-linear or max-margin objective function; the dual in both the log-linear and max-margin cases corresponds to minimizing a convex function with simplex constraints. We study both batch and online variants of the algorithm, and provide rates of convergence for both cases. In the max-margin case, O(1/ε) EG updates are required to reach a given accuracy ε in the dual; in contrast, for log-linear models only O(log(1/ε)) updates are required. For both the max-margin and log-linear cases, our bounds suggest that the online EG algorithm requires a factor of n less computation to reach a desired accuracy than the batch EG algorithm, where n is the number of training examples. Our experiments confirm that the online algorithms are much faster than the batch algorithms in practice. We describe how the EG updates factor in a convenient way for structured prediction problems, allowing the algorithms to be efficiently applied to problems such as sequence learning or natural language parsing. We perform extensive evaluation of the algorithms, comparing them to L-BFGS and stochastic gradient descent for log-linear models, and to SVM-Struct for max-margin models. The algorithms are applied to a multi-class problem as well as to a more complex large-scale parsing task. In all these settings, the EG algorithms presented here outperform the other methods.

Exponentiated gradient algorithms for large-margin structured classification

We consider the problem of structured classification, where the task is to predict a label y from an input x, and y has meaningful internal structure. Our framework includes supervised training of Markov random fields and weighted context-free grammars as special cases. We describe an algorithm that solves the large-margin optimization problem defined in [12], using an exponential-family (Gibbs distribution) representation of structured objects. The algorithm is efficient—even in cases where the number of labels y is exponential in size—provided that certain expectations under Gibbs distributions can be calculated efficiently. The method for structured labels relies on a more general result, specifically the application of exponentiated gradient updates [7, 8] to quadratic programs.

Adaptive online gradient descent

We study the rates of growth of the regret in online convex optimization. First, we show that a simple extension of the algorithm of Hazan et al eliminates the need for a priori knowledge of the lower bound on the second derivatives of the observed functions. We then provide an algorithm, Adaptive Online Gradient Descent, which interpolates between the results of Zinkevich for linear functions and of Hazan et al for strongly convex functions, achieving intermediate rates between [square root T] and [log T]. Furthermore, we show strong optimality of the algorithm. Finally, we provide an extension of our results to general norms.