297 research outputs found
Effects of Exercise on Cardiac Myocytes in the Hamster Model of Dilated Hypertrophic Cardiomyopathy
No full textThe Bio14.6 strain of cardiomyopathy Syrian hamsters (Bio14.6), which have the 5' deletion of the 8 sarcoglycan gene, has been used as a representative model of human dilated hypertrophic cardiomyopathy (DHCM). We evaluated the influence of exercise on cardiac myocytes in the Bio14.6 at the hypertrophic (23 weeks old) and dilated (41 weeks old) stages. The Bio14.6, and age-matched congenic normal hamsters (CN) as control, were divided into 3 groups: A, swimming in young (3-9 weeks) ; B, swimming in young adults (16～22 weeks); and Cont, sedentary. The results showed that (1) In the 23-week-old hamsters, cardiac hypertrophy had a predominantly greater effect in group A of Bio14.6 (Bio-A) than in any other group. (2) The mRNA expression of the 13-myosin heavy chain in Bio-A surviving until 41 weeks, was 25.7 ± 5.5% which was as low as that observed in the CN groups. (3) Cases of sudden death and of death by congestive heart failure were seen in Bio-A and Bio-B. (4) No relation between the expression of the mRNA of cardiotrophin-1 (CT-1) and clinical phases in Bio14.6 was found. Despite the existence of genetic abnormality, appropriate exercise in the young may play a contributory role to improve the pathogenesis of DHCM
Aging Skeletal Muscle Is Associated with Increased Adipognesis and Impaired Inflammation
No full textNew Insights on the (Non-)Hardness of Circuit Minimization and Related Problems
No full textThe Minimum Circuit Size Problem (MCSP) and a related problem (MKTP) that deals with time-bounded Kolmogorov complexity are prominent candidates for NP-intermediate status. We show that, under very modest cryptographic assumptions (such as the existence of one-way functions), the problem of approximating the minimum circuit size (or time-bounded Kolmogorov complexity) within a factor of n1−o(1) is indeed NP-intermediate. To the best of our knowledge, these problems are the first natural NP-intermediate problems under the existence of an arbitrary one-way function.
We also prove that MKTP is hard for the complexity class DET under non-uniform NC0 reductions.
This is surprising, since prior work on MCSP and MKTP had highlighted weaknesses of “local” reductions such as NC0-many-one reductions. We exploit this local reduction to obtain several new consequences:
* MKTP is not in AC0[p].
* Circuit size lower bounds are equivalent to hardness of a relativized version MKTPA of MKTP under a class of uniform AC0 reductions, for a large class of sets A.
* Hardness of MCSPA implies hardness of MKTPA for a wide class of sets A. This is the first result directly relating the complexity of MCSPA and MKTPA, for any A.Paper presented at the 42nd International Symposium on Mathematical Foundations of Computer Science, August 21-25, 2017, Aalborg, Denmark. This is the Author’s Original, a longer and more complete version of the paper published in: Larsen, K.G., Bodlaender, H.L., & Raskin, J.-F. (Eds.). (2017). Proceedings from 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. (Leibniz International Proceedings in Informatics (LIPIcs)). DOI: 10.4230/LIPIcs.MFCS.2017.54.Peer reviewed
New insights on the (non-)hardness of circuit minimization and related problems
No full textThe Minimum Circuit Size Problem (MCSP) and a related problem (MKTP) that deals with time-bounded Kolmogorov complexity are prominent candidates for NP-intermediate status. We show that, under very modest cryptographic assumptions (such as the existence of one-way functions), the problem of approximating the minimum circuit size (or time-b^ounded Kolmogorov complexity) within a factor of n^{1−o(1)} is indeed NPintermediate. To the best of our knowledge, these problems are the first natural NP-intermediate problems under the existence of an arbitrary one-way function. Our technique is quite general; we use it also to show that approximating the size of the largest clique in a graph within a factor of n^{1−o(1)} is also NP-intermediate unless NP ⊆ P/poly.
We also prove that MKTP is hard for the complexity class DET under non-uniform NC0 reductions. This
is surprising, since prior work on MCSP and MKTP had highlighted weaknesses of “local” reductions such as NC0 reductions . We exploit this local reduction to obtain several new consequences:
—MKTP is not in AC0[p].
—Circuit size lower bounds are equivalent to hardness of a relativized version MKTP^A of MKTP under a class of uniform AC0 reductions, for a significant class of sets A.
—Hardness of MCSP^A implies hardness of MKTP^A for a significant class of sets A. This is the first result directly relating the complexity of MCSP^A and MKTP^A, for any A.Peer reviewed© ACM, 2019. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Transactions on Computation Theory (TOCT), {Vol.11, Iss.4, (September 2019)} http://doi.acm.org/10.1145/3349616
The Roles of Satellite Cells and Hematopoietic Stem Cells in Impaired Regeneration of Skeletal Muscle in Old Rats
No full textInterleukin-6 Causes Dose dependent Increase In Proliferative Potential Of Satellite Cells In Vitro
No full text<b>Changes in FOXO and proinflammatory cytokines in the late stage of immobilized fast and slow muscle atr</b><b>ophy </b>
No full text
Alterations of macrophage and neutrophil content in skeletal muscle of aged versus young mice
No full text- …
