853 research outputs found

    Patch-based Progressive 3D Point Set Upsampling

    Full text link
    We present a detail-driven deep neural network for point set upsampling. A high-resolution point set is essential for point-based rendering and surface reconstruction. Inspired by the recent success of neural image super-resolution techniques, we progressively train a cascade of patch-based upsampling networks on different levels of detail end-to-end. We propose a series of architectural design contributions that lead to a substantial performance boost. The effect of each technical contribution is demonstrated in an ablation study. Qualitative and quantitative experiments show that our method significantly outperforms the state-of-the-art learning-based and optimazation-based approaches, both in terms of handling low-resolution inputs and revealing high-fidelity details.Comment: accepted to cvpr2019, code available at https://github.com/yifita/P3

    Shock Geometry and Spectral Breaks in Large SEP Events

    Get PDF
    Solar energetic particle (SEP) events are traditionally classified as "impulsive" or "gradual." It is now widely accepted that in gradual SEP events, particles are accelerated at coronal mass ejection-driven (CME-driven) shocks. In many of these large SEP events, particle spectra exhibit double power law or exponential rollover features, with the break energy or rollover energy ordered as (Q/A)^α, with Q being the ion charge in e and A the ion mass in units of proton mass m_p . This Q/A dependence of the spectral breaks provides an opportunity to study the underlying acceleration mechanism. In this paper, we examine how the Q/A dependence may depend on shock geometry. Using the nonlinear guiding center theory, we show that α ~ 1/5 for a quasi-perpendicular shock. Such a weak Q/A dependence is in contrast to the quasi-parallel shock case where α can reach 2. This difference in α reflects the difference of the underlying parallel and perpendicular diffusion coefficients κ_(||) and κ ⊥. We also examine the Q/A dependence of the break energy for the most general oblique shock case. Our analysis offers a possible way to remotely examine the geometry of a CME-driven shock when it is close to the Sun, where the acceleration of particle to high energies occurs

    Nonlinear reduced models for state and parameter estimation

    Full text link
    State estimation aims at approximately reconstructing the solution uu to a parametrized partial differential equation from mm linear measurements, when the parameter vector yy is unknown. Fast numerical recovery methods have been proposed based on reduced models which are linear spaces of moderate dimension nn which are tailored to approximate the solution manifold M\mathcal{M} where the solution sits. These methods can be viewed as deterministic counterparts to Bayesian estimation approaches, and are proved to be optimal when the prior is expressed by approximability of the solution with respect to the reduced model. However, they are inherently limited by their linear nature, which bounds from below their best possible performance by the Kolmogorov width dm(M)d_m(\mathcal{M}) of the solution manifold. In this paper we propose to break this barrier by using simple nonlinear reduced models that consist of a finite union of linear spaces VkV_k, each having dimension at most mm and leading to different estimators uku_k^*. A model selection mechanism based on minimizing the PDE residual over the parameter space is used to select from this collection the final estimator uu^*. Our analysis shows that uu^* meets optimal recovery benchmarks that are inherent to the solution manifold and not tied to its Kolmogorov width. The residual minimization procedure is computationally simple in the relevant case of affine parameter dependence in the PDE. In addition, it results in an estimator yy^* for the unknown parameter vector. In this setting, we also discuss an alternating minimization (coordinate descent) algorithm for joint state and parameter estimation, that potentially improves the quality of both estimators

    Extrachromosomal circles of satellite repeats and 5S ribosomal DNA in human cells

    Get PDF
    <p>Abstract</p> <p>Background</p> <p>Extrachomosomal circular DNA (eccDNA) is ubiquitous in eukaryotic organisms and was detected in every organism tested, including in humans. A two-dimensional gel electrophoresis facilitates the detection of eccDNA in preparations of genomic DNA. Using this technique we have previously demonstrated that most of eccDNA consists of exact multiples of chromosomal tandemly repeated DNA, including both coding genes and satellite DNA.</p> <p>Results</p> <p>Here we report the occurrence of eccDNA in every tested human cell line. It has heterogeneous mass ranging from less than 2 kb to over 20 kb. We describe eccDNA homologous to human alpha satellite and the <it>Sst</it>I mega satellite. Moreover, we show, for the first time, circular multimers of the human 5S ribosomal DNA (rDNA), similar to previous findings in <it>Drosophila </it>and plants. We further demonstrate structures that correspond to intermediates of rolling circle replication, which emerge from the circular multimers of 5S rDNA and <it>Sst</it>I satellite.</p> <p>Conclusions</p> <p>These findings, and previous reports, support the general notion that every chromosomal tandem repeat is prone to generate eccDNA in eukryoric organisms including humans. They suggest the possible involvement of eccDNA in the length variability observed in arrays of tandem repeats. The implications of eccDNA on genome biology may include mechanisms of centromere evolution, concerted evolution and homogenization of tandem repeats and genomic plasticity.</p

    Verification of Neural Networks Local Differential Classification Privacy

    Full text link
    Neural networks are susceptible to privacy attacks. To date, no verifier can reason about the privacy of individuals participating in the training set. We propose a new privacy property, called local differential classification privacy (LDCP), extending local robustness to a differential privacy setting suitable for black-box classifiers. Given a neighborhood of inputs, a classifier is LDCP if it classifies all inputs the same regardless of whether it is trained with the full dataset or whether any single entry is omitted. A naive algorithm is highly impractical because it involves training a very large number of networks and verifying local robustness of the given neighborhood separately for every network. We propose Sphynx, an algorithm that computes an abstraction of all networks, with a high probability, from a small set of networks, and verifies LDCP directly on the abstract network. The challenge is twofold: network parameters do not adhere to a known distribution probability, making it difficult to predict an abstraction, and predicting too large abstraction harms the verification. Our key idea is to transform the parameters into a distribution given by KDE, allowing to keep the over-approximation error small. To verify LDCP, we extend a MILP verifier to analyze an abstract network. Experimental results show that by training only 7% of the networks, Sphynx predicts an abstract network obtaining 93% verification accuracy and reducing the analysis time by 1.71041.7\cdot10^4x
    corecore