87 research outputs found

    Investigation of Hepatoprotective Activity of Induced Pluripotent Stem Cells in the Mouse Model of Liver Injury

    Get PDF
    To date liver transplantation is the only effective treatment for end-stage liver diseases. Considering the potential of pluripotency and differentiation into tridermal lineages, induced pluripotent stem cells (iPSCs) may serve as an alternative of cell-based therapy. Herein, we investigated the effect of iPSC transplantation on thioacetamide- (TAA-) induced acute/fulminant hepatic failure (AHF) in mice. Firstly, we demonstrated that iPSCs had the capacity to differentiate into hepatocyte-like cells (iPSC-Heps) that expressed various hepatic markers, including albumin, α-fetoprotein, and hepatocyte nuclear factor-3β, and exhibited biological functions. Intravenous transplantation of iPSCs effectively reduced the hepatic necrotic area, improved liver functions and motor activity, and rescued TAA-treated mice from lethal AHF. 1,1′-dioctadecyl-3,3,3′,3′-tetramethylindocarbocyanine perchlorate cell labeling revealed that iPSCs potentially mobilized to the damaged liver area. Taken together, iPSCs can effectively rescue experimental AHF and represent a potentially favorable cell source of cell-based therapy

    Improvement of Carbon Tetrachloride-Induced Acute Hepatic Failure by Transplantation of Induced Pluripotent Stem Cells without Reprogramming Factor c-Myc

    Get PDF
    The only curative treatment for hepatic failure is liver transplantation. Unfortunately, this treatment has several major limitations, as for example donor organ shortage. A previous report demonstrated that transplantation of induced pluripotent stem cells without reprogramming factor c-Myc (3-genes iPSCs) attenuates thioacetamide-induced hepatic failure with minimal incidence of tumorigenicity. In this study, we investigated whether 3-genes iPSC transplantation is capable of rescuing carbon tetrachloride (CCl4)-induced fulminant hepatic failure and hepatic encephalopathy in mice. Firstly, we demonstrated that 3-genes iPSCs possess the capacity to differentiate into hepatocyte-like cells (iPSC-Heps) that exhibit biological functions and express various hepatic specific markers. 3-genes iPSCs also exhibited several antioxidant enzymes that prevented CCl4-induced reactive oxygen species production and cell death. Intraperitoneal transplantation of either 3-genes iPSCs or 3-genes iPSC-Heps significantly reduced hepatic necrotic areas, improved hepatic functions, and survival rate in CCl4-treated mice. CCl4-induced hepatic encephalopathy was also improved by 3-genes iPSC transplantation. Hoechst staining confirmed the successful engraftment of both 3-genes iPSCs and 3-genes iPSC-Heps, indicating the homing properties of these cells. The most pronounced hepatoprotective effect of iPSCs appeared to originate from the highest antioxidant activity of 3-gene iPSCs among all transplanted cells. In summary, our findings demonstrated that 3-genes iPSCs serve as an available cell source for the treatment of an experimental model of acute liver diseases

    Phosphatized Polar Lobe-Forming Embryos from the Precambrian of Southwest China

    Get PDF
    In developing embryos of some extant spiralian animals, polar lobe formation is one of the symmetry-breaking mechanisms for segregation of maternal cytoplasmic substances to certain blastomeres and not others. Polar lobe formation leads to unique early cleavage morphologies that include trilobed, J-shaped, and five-lobed structures. Fossil embryos similar to modern lobeforming embryos are recognized from the Precambrian Doushantuo Formation phosphates, Weng'an, Guizhou Province, China. These embryos are abundant and form a developmental sequence comparable to different developing stages observed in lobe-forming embryos of extant spiralians. These data imply that lobe formation is an evolutionarily ancient process of embryonic specification

    Web-based tools can be used reliably to detect patients with major depressive disorder and subsyndromal depressive symptoms

    Get PDF
    BACKGROUND: Although depression has been regarded as a major public health problem, many individuals with depression still remain undetected or untreated. Despite the potential for Internet-based tools to greatly improve the success rate of screening for depression, their reliability and validity has not been well studied. Therefore the aim of this study was to evaluate the test-retest reliability and criterion validity of a Web-based system, the Internet-based Self-assessment Program for Depression (ISP-D). METHODS: The ISP-D to screen for major depressive disorder (MDD), minor depressive disorder (MinD), and subsyndromal depressive symptoms (SSD) was developed in traditional Chinese. Volunteers, 18 years and older, were recruited via the Internet and then assessed twice on the online ISP-D system to investigate the test-retest reliability of the test. They were subsequently prompted to schedule face-to-face interviews. The interviews were performed by the research psychiatrists using the Mini-International Neuropsychiatric Interview and the diagnoses made according to DSM-IV diagnostic criteria were used for the statistics of criterion validity. Kappa (κ) values were calculated to assess test-retest reliability. RESULTS: A total of 579 volunteer subjects were administered the test. Most of the subjects were young (mean age: 26.2 ± 6.6 years), female (77.7%), single (81.6%), and well educated (61.9% college or higher). The distributions of MDD, MinD, SSD and no depression specified were 30.9%, 7.4%, 15.2%, and 46.5%, respectively. The mean time to complete the ISP-D was 8.89 ± 6.77 min. One hundred and eighty-four of the respondents completed the retest (response rate: 31.8%). Our analysis revealed that the 2-week test-retest reliability for ISP-D was excellent (weighted κ = 0.801). Fifty-five participants completed the face-to-face interview for the validity study. The sensitivity, specificity, positive, and negative predictive values for major depressive disorder were 81.8% and 72.7%, 66.7%, and 85.7% respectively. The overall accuracy was 76.4%. CONCLUSION: The evidence indicates the ISP-D is a reliable and valid online tool for assessing depression. Further studies should test the ISP-D in clinical settings to increase its applications in clinical environments with different populations and in a larger sample size

    Epstein–Barr Virus DNase (BGLF5) induces genomic instability in human epithelial cells

    Get PDF
    Epstein–Barr Virus (EBV) DNase (BGLF5) is an alkaline nuclease and has been suggested to be important in the viral life cycle. However, its effect on host cells remains unknown. Serological and histopathological studies implied that EBV DNase seems to be correlated with carcinogenesis. Therefore, we investigate the effect of EBV DNase on epithelial cells. Here, we report that expression of EBV DNase induces increased formation of micronucleus, an indicator of genomic instability, in human epithelial cells. We also demonstrate, using γH2AX formation and comet assay, that EBV DNase induces DNA damage. Furthermore, using host cell reactivation assay, we find that EBV DNase expression repressed damaged DNA repair in various epithelial cells. Western blot and quantitative PCR analyses reveal that expression of repair-related genes is reduced significantly in cells expressing EBV DNase. Host shut-off mutants eliminate shut-off expression of repair genes and repress damaged DNA repair, suggesting that shut-off function of BGLF5 contributes to repression of DNA repair. In addition, EBV DNase caused chromosomal aberrations and increased the microsatellite instability (MSI) and frequency of genetic mutation in human epithelial cells. Together, we propose that EBV DNase induces genomic instability in epithelial cells, which may be through induction of DNA damage and also repression of DNA repair, subsequently increases MSI and genetic mutations, and may contribute consequently to the carcinogenesis of human epithelial cells

    Analysis of a Class of Distributed Randomized Algorithms on Randomly Changing Network Graphs

    Get PDF
    Dynamical connection graph changes are inherent in networks such as peer-to-peer networks, wireless ad hoc networks, and wireless sensor networks. Considering the influence of the frequent graph changes is thus essential for precisely assessing the performance of applications and algorithms on such networks. With two-fold states, stochastic hybrid systems (SHSs) can effectively model the dynamics of the execution of algorithms on a network with random and frequent graph changes. In this report, using SHSs, we analyze the performance of an epidemic-like algorithm, DRG (Distributed Random Grouping), for average aggregate computation on a wireless sensor network with dynamical graph changes. The convergence criteria and the upper bounds on the running time of the DRG algorithm for three representative types of random graph-changing models are derived. Numerical results are presented to illustrate our analysis

    Robust computation of aggregates in wireless sensor networks: Distributed randomized algorithms and analyses

    No full text
    A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in a hostile environment that is prone to link and node failures. Consequently, the algorithms developed on a sensor network have to be prudent on energy cost, scalable to network size, and robust to frequent topology changes. Among the operations on a sensor network, computing aggregates such as average, minimum, maximum and sum over the data stored in the sensor nodes is not only an important application in itself but also fundamental to various other functions such as system monitoring, data querying, and collaborative information processing. In this work, we present a class of distributed randomized algorithms to efficiently compute aggregates in a sensor network. The proposed algorithms are energy-efficient, scalable, and robust to frequent topology changes. Our analyses and experimental results show that they outperform other representative distributed algorithms for the aggregates computation in wireless sensor networks

    Robust and Distributed Computation of Aggregates in Wireless Sensor Networks

    Get PDF
    corecore