Age-associated murine cardiac lesions are attenuated by the mitochondria-targeted antioxidant SkQ1

Age-related changes in mammalian hearts often result in cardiac hypertrophy and fibrosis that are preceded by inflammatory infiltration. In this paper, we show that lifelong treatment of BALB/c and C57BL/6 mice with the mitochondria-targeted antioxidant SkQ1 retards senescence-associated myocardial disease (cardiomyopathy), cardiac hypertrophy, and diffuse myocardial fibrosis. To investigate the molecular basis of the action of SkQ1, we have applied DNA microarray analysis. The global gene expression profile in heart tissues was not significantly affected by administration of SkQ1. However, we found some small but statistically significant modifications of the pathways related to cellto-cell contact, adhesion, and leukocyte infiltration. Probably, SkQ1-induced decrease in leukocyte and mesenchymal cell adhesion and/or infiltration lead to a reduction in age-related inflammation and subsequent fibrosis. The data indicate a causative role of mitochondrial reactive oxygen species in cardiovascular aging and imply that SkQ1 has poteential as a drug against age-related cardiac dysfunction

The Maximum Resource Bin Packing Problem

Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. This paper presents results for the opposite problems, where we would like to maximize the number of bins used or minimize the number or total size of accepted items. We consider off-line and on-line variants of the problems. For the off-line variant, we require that there be an ordering of the bins, so that no item in a later bin fits in an earlier bin. We find the approximation ratios of two natural approximation algorithms, First-Fit-Increasing and First-Fit-Decreasing for the maximum resource variant of classical bin packing. For the on-line variant, we define maximum resource variants of classical and dual bin packing. For dual bin packing, no on-line algorithm is competitive. For classical bin packing, we find the competitive ratio of various natural algorithms. We study the general versions of the problems as well as the parameterized versions where on the item sizes, for some integer k. there is an upper bound of 1/