1,168 research outputs found

    Complementary stabilization by core/sheath carbon nanofibers/spongy carbon on submicron tin oxide particles as anode for lithium-ion batteries

    Get PDF
    To limit the pulverization of tin-based anode materials during lithiation/delithiation, submicron tin oxide/tin particles are fixed on core/sheath carbon nanofiber/spongy carbon via hydrothermal and carbothermal reduction treatment in this work. During carbothermal reduction, SnO2 nanosheets are converted to spherical Sn submicron particles and simultaneously the hollow spongy carbon is produced and still enwrap on carbon nanofiber. The as-produced flexible film is used for a binder-free anode for lithium ion batteries, without the polymer binder and conductive carbon. At 0.1, 0.5, 1 and 2 A g-1, the composite electrode respectively displays a discharging capacity of 1393.0, 738.2, 583.6 and 382.6 mAh g-1. Moreover, it delivers specific capacity of 726.9 mAh g-1 and coulombic efficiency of 99.45 % after 300 cycles at 0.1 A g-1. The comparison sample of carbon nanofiber/SnOx film without the presence of spongy carbon displays much lower rate performance and worse cyclic performance. The integrated structure of carbon nanofiber/SnOx/spongy carbon results in the remarkable Li-storage performance, in which the carbon nanofiber and spongy carbon synergistically provide conductive channel and buffer zone to hinder the pulverization and peeling of SnOx particles during charging-discharging processes

    IM3D: A parallel Monte Carlo code for efficient simulations of primary radiation displacements and damage in 3D geometry

    Get PDF
    SRIM-like codes have limitations in describing general 3D geometries, for modeling radiation displacements and damage in nanostructured materials. A universal, computationally efficient and massively parallel 3D Monte Carlo code, IM3D, has been developed with excellent parallel scaling performance. IM3D is based on fast indexing of scattering integrals and the SRIM stopping power database, and allows the user a choice of Constructive Solid Geometry (CSG) or Finite Element Triangle Mesh (FETM) method for constructing 3D shapes and microstructures. For 2D films and multilayers, IM3D perfectly reproduces SRIM results, and can be āˆ¼10[superscript 2] times faster in serial execution and >ā€‰10[superscript 4] times faster using parallel computation. For 3D problems, it provides a fast approach for analyzing the spatial distributions of primary displacements and defect generation under ion irradiation. Herein we also provide a detailed discussion of our open-source collision cascade physics engine, revealing the true meaning and limitations of the ā€œQuick Kinchin-Peaseā€ and ā€œFull Cascadesā€ options. The issues of femtosecond to picosecond timescales in defining displacement versus damage, the limitation of the displacements per atom (DPA) unit in quantifying radiation damage (such as inadequacy in quantifying degree of chemical mixing), are discussed.National Natural Science Foundation (China) (Grant 11275229)National Natural Science Foundation (China) (Grant 11475215)National Natural Science Foundation (China) (Grant NSAF U1230202)National Natural Science Foundation (China) (Grant 11534012)National Basic Research Program of China (973 Program) (Grant 2012CB933702)Hefei Center for Physical Science and Technology (Grant 2012FXZY004)Chinese Academy of Sciences (Hefei Institutes of Physical Science (CASHIPS) Director Grant)National Science Foundation (U.S.) (DMR-1410636)National Science Foundation (U.S.) (DMR-1120901

    DILI: A Distribution-Driven Learned Index

    Full text link
    Targeting in-memory one-dimensional search keys, we propose a novel DIstribution-driven Learned Index tree (DILI), where a concise and computation-efficient linear regression model is used for each node. An internal node's key range is equally divided by its child nodes such that a key search enjoys perfect model prediction accuracy to find the relevant leaf node. A leaf node uses machine learning models to generate searchable data layout and thus accurately predicts the data record position for a key. To construct DILI, we first build a bottom-up tree with linear regression models according to global and local key distributions. Using the bottom-up tree, we build DILI in a top-down manner, individualizing the fanouts for internal nodes according to local distributions. DILI strikes a good balance between the number of leaf nodes and the height of the tree, two critical factors of key search time. Moreover, we design flexible algorithms for DILI to efficiently insert and delete keys and automatically adjust the tree structure when necessary. Extensive experimental results show that DILI outperforms the state-of-the-art alternatives on different kinds of workloads.Comment: PVLDB Volume 1
    • ā€¦
    corecore