150,317 research outputs found

    Elastic Properties of Carbon Nanotubes and Nanoropes

    Get PDF
    Elastic properties of carbon nanotubes and nanoropes are investigated using an empirical force-constant model. For single and multi-wall nanotubes the elastic moduli are shown to be insensitive to details of the structure such as the helicity, the tube radius and the number of layers. The tensile Young's modulus and the torsion shear modulus calculated are comparable to that of the diamond, while the the bulk modulus is smaller. Nanoropes composed of single-wall nanotubes possess the ideal elastic properties of high tensile elastic modulus, flexible, and light weight.Comment: 10 page

    Unavoidable Multicoloured Families of Configurations

    Full text link
    Balogh and Bollob\'as [{\em Combinatorica 25, 2005}] prove that for any kk there is a constant f(k)f(k) such that any set system with at least f(k)f(k) sets reduces to a kk-star, an kk-costar or an kk-chain. They proved f(k)<(2k)2kf(k)<(2k)^{2^k}. Here we improve it to f(k)<2ck2f(k)<2^{ck^2} for some constant c>0c>0. This is a special case of the following result on the multi-coloured forbidden configurations at 2 colours. Let rr be given. Then there exists a constant crc_r so that a matrix with entries drawn from {0,1,...,r−1}\{0,1,...,r-1\} with at least 2crk22^{c_rk^2} different columns will have a k×kk\times k submatrix that can have its rows and columns permuted so that in the resulting matrix will be either Ik(a,b)I_k(a,b) or Tk(a,b)T_k(a,b) (for some a≠b∈{0,1,...,r−1}a\ne b\in \{0,1,..., r-1\}), where Ik(a,b)I_k(a,b) is the k×kk\times k matrix with aa's on the diagonal and bb's else where, Tk(a,b)T_k(a,b) the k×kk\times k matrix with aa's below the diagonal and bb's elsewhere. We also extend to considering the bound on the number of distinct columns, given that the number of rows is mm, when avoiding a tk×kt k\times k matrix obtained by taking any one of the k×kk \times k matrices above and repeating each column tt times. We use Ramsey Theory.Comment: 16 pages, add two application

    Fast Ridge Regression with Randomized Principal Component Analysis and Gradient Descent

    Full text link
    We propose a new two stage algorithm LING for large scale regression problems. LING has the same risk as the well known Ridge Regression under the fixed design setting and can be computed much faster. Our experiments have shown that LING performs well in terms of both prediction accuracy and computational efficiency compared with other large scale regression algorithms like Gradient Descent, Stochastic Gradient Descent and Principal Component Regression on both simulated and real datasets

    A process yields large quantities of pure ribosome subunits

    Get PDF
    Development of process for in-vitro protein synthesis from living cells followed by dissociation of ribosomes into subunits is discussed. Process depends on dialysis or use of chelating agents. Operation of process and advantages over previous methods are outlined
    • …
    corecore