789 research outputs found

    Transarterial detachable coil embolization of direct carotid-cavernous fistula: Immediate and long-term outcomes

    Get PDF
    AbstractBackgroundTransarterial embolization is a standard method for management of direct carotid-cavernous fistula (DCCF). The purpose of this study was to report our experiences, and immediate and long-term outcomes of endovascular embolization of DCCFs by using detachable coils (DCs).MethodsOver 8 years, 24 patients with 25 DCCFs underwent endovascular DC embolization. There were 15 men and nine women; age ranged from 8 to 82 years (mean, 39 years). Immediate and long-term angiographic as well as clinical outcomes after endovascular DC embolization were retrospectively analyzed. The number and the length of DCs used to occlude the fistula were also evaluated.ResultsEighteen DCCFs were successfully occluded by single-session endovascular embolization with preservation of the parent artery. Retreatments by transvenous (n = 5) and/ or transorbital routes (n = 3) had to be performed in seven patients because of residual fistula (n = 4) or recurrent fistula (n = 4) occurring within 3 weeks after embolization. The average numbers and length of coils to occlude the fistulas were 14 (range, 2–31) and 189 cm (range, 16–756 cm), respectively. Four patients had small residual fistulas with spontaneous thrombosis on follow-up angiography. Three patients had transient cranial nerve impairment of the third (n = 1) or sixth (n = 2) nerve. There was no significant procedure-related neurological complication. The follow-up period was 3–48 months (mean, 19 months)ConclusionEndovascular DC embolization of DCCFs was proved both efficacious and safe in managing high-flow fistulas with sustained angiographic and clinical effects, particularly in those DCCFs with small fistula track and/or cavernous sinus. However, retreatment via various routes may be necessary in some patients because of residual or recurrent fistulas

    Denoising Individual Bias for Fairer Binary Submatrix Detection

    Get PDF
    Low rank representation of binary matrix is powerful in disentangling sparse individual-attribute associations, and has received wide applications. Existing binary matrix factorization (BMF) or co-clustering (CC) methods often assume i.i.d background noise. However, this assumption could be easily violated in real data, where heterogeneous row- or column-wise probability of binary entries results in disparate element-wise background distribution, and paralyzes the rationality of existing methods. We propose a binary data denoising framework, namely BIND, which optimizes the detection of true patterns by estimating the row- or column-wise mixture distribution of patterns and disparate background, and eliminating the binary attributes that are more likely from the background. BIND is supported by thoroughly derived mathematical property of the row- and column-wise mixture distributions. Our experiment on synthetic and real-world data demonstrated BIND effectively removes background noise and drastically increases the fairness and accuracy of state-of-the arts BMF and CC methods

    Association between copy number variation of complement component C4 and Graves' disease

    Get PDF
    <p>Abstract</p> <p>Background</p> <p>Gene copy number of complement component <it>C4</it>, which varies among individuals, may determine the intrinsic strength of the classical complement pathway. Presuming a major role of complement as an effecter in peptide-mediated inflammation and phagocytosis, we hypothesized that <it>C4 </it>genetic diversity may partially explain the development of Graves' disease (GD) and the variation in its outcomes.</p> <p>Methods</p> <p>A case-control study including 624 patients with GD and 160 healthy individuals were enrolled. CNV of <it>C4 </it>isotypes (<it>C4A </it>and <it>C4B</it>) genes were performed by quantitative real-time polymerase chain reaction analysis. Statistical comparison and identification of CNV of total <it>C4, C4 </it>isotypes (<it>C4A </it>and <it>C4B</it>) and <it>C4 </it>polymorphisms were estimated according to the occurrence of GD and its associated clinical features.</p> <p>Results</p> <p>Individuals with 4, 2, and 2 copies of <it>C4</it>, <it>C4A </it>and <it>C4B </it>genes, especially those with A2B2 polymorphism may associate with the development of GD (p = 0.001, OR = 10.994, 95% CI: 6.277-19.255; p = 0.008, OR = 1.732, 95% CI: 1.190-2.520; p = 2.420 × 10-5, OR = 2.621, 95% CI: 1.791-3.835; and <it>p </it>= 1.395 × 10<sup>-4</sup>, OR = 2.671, 95% CI: 1.761-4.052, respectively). Although the distribution of copy number for total <it>C4</it>, <it>C4 </it>isotypes as well as <it>C4 </it>polymorphisms did not associate with the occurrence of goiter, nodular hyperplasia, GO and myxedema, <2 copies of <it>C4A </it>may associate with high risk toward vitiligo in patients with GD (<it>p </it>= 0.001, OR = 5.579, 95% CI: 1.659-18.763).</p> <p>Conclusions</p> <p>These results may be further estimated for its clinical application on GD and the vitiligo in patients with GD.</p

    Geometric All-way Boolean Tensor Decomposition

    Get PDF
    Boolean tensor has been broadly utilized in representing high dimensional logical data collected on spatial, temporal and/or other relational domains. Boolean Tensor Decomposition (BTD) factorizes a binary tensor into the Boolean sum of multiple rank-1 tensors, which is an NP-hard problem. Existing BTD methods have been limited by their high computational cost, in applications to large scale or higher order tensors. In this work, we presented a computationally efficient BTD algorithm, namely Geometric Expansion for all-order Tensor Factorization (GETF), that sequentially identifies the rank-1 basis components for a tensor from a geometric perspective. We conducted rigorous theoretical analysis on the validity as well as algorithemic efficiency of GETF in decomposing all-order tensor. Experiments on both synthetic and real-world data demonstrated that GETF has significantly improved performance in reconstruction accuracy, extraction of latent structures and it is an order of magnitude faster than other state-of-the-art methods

    Significance of Coronary Calcification for Prediction of Coronary Artery Disease and Cardiac Events Based on 64-Slice Coronary Computed Tomography Angiography

    Get PDF
    This work aims to validate the clinical significance of coronary artery calcium score (CACS) in predicting coronary artery disease(CAD) and cardiac events in 100 symptomatic patients (aged 37–87 years, mean 62.5, 81 males) that were followed up for a mean of 5 years. Our results showed that patients with CAD and cardiac events had significantly higher CACS than those without CAD and cardiac events, respectively. The corresponding data were 1450.42 ± 3471.24 versus 130 ± 188.29 (P 1000. Increased CACS (>100)was also associated with an increased frequency of multi-vessel disease. Nonetheless, 3 (20%) out of 15 patients with zero CACS had single-vessel disease. Significant correlation (P < 0.001) was observed between CACS and CAD on a vessel-based analysis for coronary arteries. It is concluded that CACS is significantly correlated with CAD and cardiac events

    M3S: a comprehensive model selection for multi-modal single-cell RNA sequencing data

    Get PDF
    Background Various statistical models have been developed to model the single cell RNA-seq expression profiles, capture its multimodality, and conduct differential gene expression test. However, for expression data generated by different experimental design and platforms, there is currently lack of capability to determine the most proper statistical model. Results We developed an R package, namely Multi-Modal Model Selection (M3S), for gene-wise selection of the most proper multi-modality statistical model and downstream analysis, useful in a single-cell or large scale bulk tissue transcriptomic data. M3S is featured with (1) gene-wise selection of the most parsimonious model among 11 most commonly utilized ones, that can best fit the expression distribution of the gene, (2) parameter estimation of a selected model, and (3) differential gene expression test based on the selected model. Conclusion A comprehensive evaluation suggested that M3S can accurately capture the multimodality on simulated and real single cell data. An open source package and is available through GitHub at https://github.com/zy26/M3S

    Utilized mass spectrometry-based protein profiling system to identify potential biomarkers of hepatocellular carcinoma

    Get PDF
    AbstractHepatocellular carcinoma (HCC) is the most common malignant liver tumor. The purpose of this study is to characterize proteins secreted from the HepG2 cells, which may relate to cell differentiation and tumor metastasis. In the proteomic analysis, the secretome was identified by nano-high–performance liquid chromatography/electrospray ionization tandem mass spectrometry (nano-HPLC/ESIMS/MS) followed by peptide fragmentation pattern analysis. In this study, three proteins, p130Cas-associated protein (p130Cas/BCAR1), TAR DNA-binding protein 43 (TDP43/TARDBP) and translationally controlled tumor protein (TCTP/TPT1), were identified and confirmed by Western blotting, which showed significantly differential expression compared with the normal liver cells. Analyzing differential protein expressions in HepG2 cell by proteomic approaches suggests that p130Cas/BCAR1, TDP43/TARDBP and TCTP/TPT1 as key proteins and may serve as biomarkers for HCC

    Fast and Efficient Boolean Matrix Factorization by Geometric Segmentation

    Get PDF
    Boolean matrix has been used to represent digital information in many fields, including bank transaction, crime records, natural language processing, protein-protein interaction, etc. Boolean matrix factorization (BMF) aims to find an approximation of a binary matrix as the Boolean product of two low rank Boolean matrices, which could generate vast amount of information for the patterns of relationships between the features and samples. Inspired by binary matrix permutation theories and geometric segmentation, we developed a fast and efficient BMF approach, called MEBF (Median Expansion for Boolean Factorization). Overall, MEBF adopted a heuristic approach to locate binary patterns presented as submatrices that are dense in 1's. At each iteration, MEBF permutates the rows and columns such that the permutated matrix is approximately Upper Triangular-Like (UTL) with so-called Simultaneous Consecutive-ones Property (SC1P). The largest submatrix dense in 1 would lie on the upper triangular area of the permutated matrix, and its location was determined based on a geometric segmentation of a triangular. We compared MEBF with other state of the art approaches on data scenarios with different density and noise levels. MEBF demonstrated superior performances in lower reconstruction error, and higher computational efficiency, as well as more accurate density patterns than popular methods such as ASSO, PANDA and Message Passing. We demonstrated the application of MEBF on both binary and non-binary data sets, and revealed its further potential in knowledge retrieving and data denoising

    Viewpoint switching in multiview videos using SP-frames

    Full text link
    The distinguishing feature of multiview video lies in the interactivity, which allows users to select their favourite viewpoint. It switches bitstream at a particular view when necessary instead of transmitting all the views. The new SP-frame in H.264 is originally developed for multiple bit-rate streaming with the support of seamless switching. The SP-frame can also be directly employed in the viewpoint switching of multiview videos. Notwithstanding the guarantee of seamless switching using SP-frames, the cost is the bulky size of secondary SP-frames. This induces a significant amount of additional space or bandwidth for storage or transmission, especially for the multiview scenario. For this reason, a new motion estimation and compensation technique operating in the quantized transform (QDCT) domain is designed for coding secondary SP-frame in this paper. Our proposed work aims at keeping the secondary SP-frames as small as possible without affecting the size of primary SP-frames by incorporating QDCT-domain motion estimation and compensation in the secondary SP-frame coding. Simulation results show that the size of secondary SP-frames can be reduced remarkably in viewpoint switching. Index Terms — Multiview, viewpoint switching, SP-frame, QDCT-domain, motion estimatio
    • 

    corecore