110,860 research outputs found

    Spinal compression fractures: no additional pain relief with use of back braces

    Get PDF
    A critical appraisal and clinical application of Li M, Law SW, Cheng J, Kee HM, Wong MS. A comparison study on the efficacy of SpinoMed® and soft lumbar orthosis for osteoporotic vertebral fracture. J. Prosthet. Orthot. Int. 2015;39(4):270-276. doi: 10.1177/030936461452820

    On Searching a Table Consistent with Division Poset

    Get PDF
    Suppose Pn={1,2,...,n}P_n=\{1,2,...,n\} is a partially ordered set with the partial order defined by divisibility, that is, for any two distinct elements i,jPni,j\in P_n satisfying ii divides jj, i<Pnji<_{P_n} j. A table An={aii=1,2,...,n}A_n=\{a_i|i=1,2,...,n\} of distinct real numbers is said to be \emph{consistent} with PnP_n, provided for any two distinct elements i,j{1,2,...,n}i,j\in \{1,2,...,n\} satisfying ii divides jj, ai<aja_i< a_j. Given an real number xx, we want to determine whether xAnx\in A_n, by comparing xx with as few entries of AnA_n as possible. In this paper we investigate the complexity τ(n)\tau(n), measured in the number of comparisons, of the above search problem. We present a 55n72+O(ln2n)\frac{55n}{72}+O(\ln^2 n) search algorithm for AnA_n and prove a lower bound (3/4+17/2160)n+O(1)({3/4}+{17/2160})n+O(1) on τ(n)\tau(n) by using an adversary argument.Comment: 16 pages, no figure; same results, representation improved, add reference

    Algebra diagrams: a HANDi introduction

    Get PDF
    A diagrammatic notation for algebra is presented – Hierarchical Al- gebra Network Diagrams, HANDi. The notation uses a 2D network notation with systematically designed icons to explicitly and coherently encode the fun- damental concepts of algebra. The structure of the diagrams is described and the rules for making derivations are presented. The key design features of HANDi are discussed and compared with the conventional formula notation in order demonstrate that the new notation is a more logical codification of intro- ductory algebra

    COUPLED-CLUSTER CALCULATIONS FOR LOW-LYING ELECTRONIC STATES OF HEAVY-METAL CONTAINING MOLECULES

    Get PDF
    Coupled-cluster calculations of low-lying electronic states for heavy-metal containing diatomic molecules (e.g., PtH, ThO+^+, ThN, BaO+^+, CsF+^+) are reported. Recently-developed relativistic quantum-chemical techniques have been used, including an atomic mean-field approach for efficent construction of spin-orbit integrals [1], a perturbative approach for treating spin-orbit coupling within exact-two-component equation-of-motion coupled-cluster methods [2], and a new implementation of two-component coupled-cluster methods for non-perturbative treatments of spin-orbit coupling [3]. Bond lengths, vibrational frequencies, and dipole moments of these molecules containing heavy metals are compared with experimental data to assess the accuracy and usefulness of the computational methods. \begin{thebibliography}{comment} \bibitem{Ref1} J. Liu and L. Cheng, J. Chem. Phys. submitted. \bibitem{Ref2} L. Cheng, F. Wang, J. F. Stanton, and J. Gauss, J. Chem. Phys. \textbf{148}, 044108 (2018). \bibitem{Ref3} J. Liu, Y. Shen, A. Asthana, and L. Cheng, J. Chem. Phys. \textbf{148}, 034106 (2018). \end{thebibliography

    Weighted Shift Matrices: Unitary Equivalence, Reducibility and Numerical Ranges

    Full text link
    An nn-by-nn (n3n\ge 3) weighted shift matrix AA is one of the form [{array}{cccc}0 & a_1 & & & 0 & \ddots & & & \ddots & a_{n-1} a_n & & & 0{array}], where the aja_j's, called the weights of AA, are complex numbers. Assume that all aja_j's are nonzero and BB is an nn-by-nn weighted shift matrix with weights b1,...,bnb_1,..., b_n. We show that BB is unitarily equivalent to AA if and only if b1...bn=a1...anb_1... b_n=a_1...a_n and, for some fixed kk, 1kn1\le k \le n, bj=ak+j|b_j| = |a_{k+j}| (an+jaja_{n+j}\equiv a_j) for all jj. Next, we show that AA is reducible if and only if AA has periodic weights, that is, for some fixed kk, 1kn/21\le k \le \lfloor n/2\rfloor, nn is divisible by kk, and aj=ak+j|a_j|=|a_{k+j}| for all 1jnk1\le j\le n-k. Finally, we prove that AA and BB have the same numerical range if and only if a1...an=b1...bna_1...a_n=b_1...b_n and Sr(a12,...,an2)=Sr(b12,...,bn2)S_r(|a_1|^2,..., |a_n|^2)=S_r(|b_1|^2,..., |b_n|^2) for all 1rn/21\le r\le \lfloor n/2\rfloor, where SrS_r's are the circularly symmetric functions.Comment: 27 page
    corecore