64 research outputs found

    Rationale and Methodology of Reprogramming for Generation of Induced Pluripotent Stem Cells and Induced Neural Progenitor Cells.

    Get PDF
    Great progress has been made regarding the capabilities to modify somatic cell fate ever since the technology for generation of induced pluripotent stem cells (iPSCs) was discovered in 2006. Later, induced neural progenitor cells (iNPCs) were generated from mouse and human cells, bypassing some of the concerns and risks of using iPSCs in neuroscience applications. To overcome the limitation of viral vector induced reprogramming, bioactive small molecules (SM) have been explored to enhance the efficiency of reprogramming or even replace transcription factors (TFs), making the reprogrammed cells more amenable to clinical application. The chemical induced reprogramming process is a simple process from a technical perspective, but the choice of SM at each step is vital during the procedure. The mechanisms underlying cell transdifferentiation are still poorly understood, although, several experimental data and insights have indicated the rationale of cell reprogramming. The process begins with the forced expression of specific TFs or activation/inhibition of cell signaling pathways by bioactive chemicals in defined culture condition, which initiates the further reactivation of endogenous gene program and an optimal stoichiometric expression of the endogenous pluri- or multi-potency genes, and finally leads to the birth of reprogrammed cells such as iPSCs and iNPCs. In this review, we first outline the rationale and discuss the methodology of iPSCs and iNPCs in a stepwise manner; and then we also discuss the chemical-based reprogramming of iPSCs and iNPCs

    Acute limb ischemia caused by floating thrombus in the aorta: a case report and literature review

    Get PDF
    This report presents a patient with rheumatoid arthritis and COVID-19 infection one month earlier who experienced embolic episodes resulting in acute lower-limb ischemia from an unusual source. The blood flow was successfully restored by femoropopliteal thromboembolectomy. In determining the source of the embolism, the patient underwent electrocardiogram, transthoracic echocardiogram, and aortic CTA. The latter revealed a large, pedunculated, and mobile thrombus arising from the aortic arch and the descending thoracic aorta. Considering the patient's general health condition, we performed anticoagulation of the floating thrombus in the aortic lumen. The mechanism of aortic floating thrombosis exhibits considerable complexity. There are no standardized treatment protocols or clinical guidelines, and its treatment mainly includes open surgery, aortic endoluminal stent -graft insertion and pharmacological anticoagulation. Treatment strategy should be based on the cause of the disease and the patient's physical condition

    GraphGAN: Graph Representation Learning with Generative Adversarial Nets

    Full text link
    The goal of graph representation learning is to embed each vertex in a graph into a low-dimensional vector space. Existing graph representation learning methods can be classified into two categories: generative models that learn the underlying connectivity distribution in the graph, and discriminative models that predict the probability of edge existence between a pair of vertices. In this paper, we propose GraphGAN, an innovative graph representation learning framework unifying above two classes of methods, in which the generative model and discriminative model play a game-theoretical minimax game. Specifically, for a given vertex, the generative model tries to fit its underlying true connectivity distribution over all other vertices and produces "fake" samples to fool the discriminative model, while the discriminative model tries to detect whether the sampled vertex is from ground truth or generated by the generative model. With the competition between these two models, both of them can alternately and iteratively boost their performance. Moreover, when considering the implementation of generative model, we propose a novel graph softmax to overcome the limitations of traditional softmax function, which can be proven satisfying desirable properties of normalization, graph structure awareness, and computational efficiency. Through extensive experiments on real-world datasets, we demonstrate that GraphGAN achieves substantial gains in a variety of applications, including link prediction, node classification, and recommendation, over state-of-the-art baselines.Comment: The 32nd AAAI Conference on Artificial Intelligence (AAAI 2018), 8 page

    RippleNet: Propagating User Preferences on the Knowledge Graph for Recommender Systems

    Full text link
    To address the sparsity and cold start problem of collaborative filtering, researchers usually make use of side information, such as social networks or item attributes, to improve recommendation performance. This paper considers the knowledge graph as the source of side information. To address the limitations of existing embedding-based and path-based methods for knowledge-graph-aware recommendation, we propose Ripple Network, an end-to-end framework that naturally incorporates the knowledge graph into recommender systems. Similar to actual ripples propagating on the surface of water, Ripple Network stimulates the propagation of user preferences over the set of knowledge entities by automatically and iteratively extending a user's potential interests along links in the knowledge graph. The multiple "ripples" activated by a user's historically clicked items are thus superposed to form the preference distribution of the user with respect to a candidate item, which could be used for predicting the final clicking probability. Through extensive experiments on real-world datasets, we demonstrate that Ripple Network achieves substantial gains in a variety of scenarios, including movie, book and news recommendation, over several state-of-the-art baselines.Comment: CIKM 201

    Deletion of astroglial CXCL10 delays clinical onset but does not affect progressive axon loss in a murine autoimmune multiple sclerosis model.

    Get PDF
    Multiple sclerosis (MS) is characterized by central nervous system (CNS) inflammation, demyelination, and axonal degeneration. CXCL10 (IP-10), a chemokine for CXCR3+ T cells, is known to regulate T cell differentiation and migration in the periphery, but effects of CXCL10 produced endogenously in the CNS on immune cell trafficking are unknown. We created floxed cxcl10 mice and crossed them with mice carrying an astrocyte-specific Cre transgene (mGFAPcre) to ablate astroglial CXCL10 synthesis. These mice, and littermate controls, were immunized with myelin oligodendrocyte glycoprotein peptide 35-55 (MOG peptide) to induce experimental autoimmune encephalomyelitis (EAE). In comparison to the control mice, spinal cord CXCL10 mRNA and protein were sharply diminished in the mGFAPcre/CXCL10fl/fl EAE mice, confirming that astroglia are chiefly responsible for EAE-induced CNS CXCL10 synthesis. Astroglial CXCL10 deletion did not significantly alter the overall composition of CD4+ lymphocytes and CD11b+ cells in the acutely inflamed CNS, but did diminish accumulation of CD4+ lymphocytes in the spinal cord perivascular spaces. Furthermore, IBA1+ microglia/macrophage accumulation within the lesions was not affected by CXCL10 deletion. Clinical deficits were milder and acute demyelination was substantially reduced in the astroglial CXCL10-deleted EAE mice, but long-term axon loss was equally severe in the two groups. We concluded that astroglial CXCL10 enhances spinal cord perivascular CD4+ lymphocyte accumulation and acute spinal cord demyelination in MOG peptide EAE, but does not play an important role in progressive axon loss in this MS model

    Influence of cutterhead system structure on load distribution and life of main bearing

    Get PDF
    Service life of main bearing represents the life of tunnel boring machine (TBM) system. It is affected by the raceway load distribution which is related to the stiffness of supporting structure, as the main bearing is not rigid. To improve the service life of main bearing, the influences of key parameters of cutterhead system structure on the uniformity of load distribution are revealed, and the structure is optimized based on that. A finite element method (FEM) model of main structure is constructed to get the accurate load distribution in the main bearing for service life calculation, and the springs with nonlinear stiffness are employed to simulate the relationships between rock and cutters on the basis of Colorado School of Mines (CSM) method. Compared with the original structure, it shows that the uniformity of axial force distribution on thrust raceway increases obviously, and the service life of the main bearing is extended
    corecore