9,226 research outputs found

    Pairing Properties of Symmetric Nuclear Matter in Relativistic Mean Field Theory

    Full text link
    The properties of pairing correlations in symmetric nuclear matter are studied in the relativistic mean field (RMF) theory with the effective interaction PK1. Considering well-known problem that the pairing gap at Fermi surface calculated with RMF effective interactions are three times larger than that with Gogny force, an effective factor in the particle-particle channel is introduced. For the RMF calculation with PK1, an effective factor 0.76 give a maximum pairing gap 3.2 MeV at Fermi momentum 0.9 fm−1^{-1}, which are consistent with the result with Gogny force.Comment: 14 pages, 6 figures

    Learning a Dilated Residual Network for SAR Image Despeckling

    Full text link
    In this paper, to break the limit of the traditional linear models for synthetic aperture radar (SAR) image despeckling, we propose a novel deep learning approach by learning a non-linear end-to-end mapping between the noisy and clean SAR images with a dilated residual network (SAR-DRN). SAR-DRN is based on dilated convolutions, which can both enlarge the receptive field and maintain the filter size and layer depth with a lightweight structure. In addition, skip connections and residual learning strategy are added to the despeckling model to maintain the image details and reduce the vanishing gradient problem. Compared with the traditional despeckling methods, the proposed method shows superior performance over the state-of-the-art methods on both quantitative and visual assessments, especially for strong speckle noise.Comment: 18 pages, 13 figures, 7 table

    On the Separability of Stochastic Geometric Objects, with Applications

    Get PDF
    In this paper, we study the linear separability problem for stochastic geometric objects under the well-known unipoint/multipoint uncertainty models. Let S=S_R U S_B be a given set of stochastic bichromatic points, and define n = min{|S_R|, |S_B|} and N = max{|S_R|, |S_B|}. We show that the separable-probability (SP) of S can be computed in O(nN^{d-1}) time for d >= 3 and O(min{nN log N, N^2}) time for d=2, while the expected separation-margin (ESM) of S can be computed in O(nN^d) time for d >= 2. In addition, we give an Omega(nN^{d-1}) witness-based lower bound for computing SP, which implies the optimality of our algorithm among all those in this category. Also, a hardness result for computing ESM is given to show the difficulty of further improving our algorithm. As an extension, we generalize the same problems from points to general geometric objects, i.e., polytopes and/or balls, and extend our algorithms to solve the generalized SP and ESM problems in O(nN^d) and O(nN^{d+1}) time, respectively. Finally, we present some applications of our algorithms to stochastic convex-hull related problems
    • …
    corecore