1. Materials Science & Technology Division, Oak Ridge National Laboratory. Oak Ridge, TN, USA. 2. Department of Physics & Astronomy, Vanderbilt University. Nashville, TN, USA. 3. Department of Chemistry, University of Toronto. Toronto, Canada. 4. Departamento de Fisica Aplicada III, Universidad Complutense de Madrid. Madrid, Spain. 5. Department of Materials Science and Engineering, University ...

Meizhu Li, Qi Zhang, Qi Liu, 3 and Yong Deng 4, 5, ∗ School of Computer and Information Science, Southwest University, Chongqing 400715, China Center for Quantitative Sciences, Vanderbilt University School of Medicine, Nashville, TN 37232, USA Department of Biomedical Informatics, Vanderbilt University School of Medicine, Nashville, TN 37232, USA School of Automation, Northwestern Polytechnical...

We have investigated the binding of soluble tenascin-C (TN-C) to several cell lines using a radioligand binding assay. Specific binding was demonstrated to U-251MG human glioma cells and to a line of bovine aortic endothelial cells, but hamster fibroblasts showed no specific binding. Recombinant proteins corresponding to specific domains of TN-C were used to map the binding site(s) in TN-C. The...

PURPOSE Symptomatic TN accounts for up to 15% of all TN. Though there are many established "red flag" signs, it is still sometimes difficult to sift symptomatic from classic TN. We herein report two cases of isolated TN with normal neurologic examinations and then tissue proved as epidermoid cyst. CASE REPORT CASE 1 A 17-year-old girl presented with paroxysmal intense pain mixed dull backg...

??????????????????????????, ??????????????????????????????????, ??, ???????????????COD, SS, TN, TP????????????????? (EMC) ?????????????, ?????, ?????????????????????????EMC????, ??????????????????EMC??????????????, 50??????????????????5??????????????, 3????????????????????????, 1????????????????????????????EMC????????????????????????, 2????????, ????10???????????????????, ??????????????????????...

A set or sequence U in the natural numbers is defined to be avoidable if N can be partitioned into two sets A and B such that no element of U is the sum of two distinct elements of A or of two distinct elements of B. In 1980, Hoggatt [5] studied the Tribonacci sequence T = {tn} where t1 = 1, t2 = 1, t3 = 2, and tn = tn−1 + tn−2 + tn−3 for n ≥ 4, and showed that it was avoidable. Dumitriu [3] co...

For the familiar Fibonacci sequence (defined by f1 = f2 = 1, and fn = fn−1 + fn−2 for n > 2), fn increases exponentially with n at a rate given by the golden ratio (1 + √ 5)/2 = 1.61803398 . . . . But for a simple modification with both additions and subtractions — the random Fibonacci sequences defined by t1 = t2 = 1, and for n > 2, tn = ±tn−1 ± tn−2, where each ± sign is independent and eithe...

Inspired by the discussion in [5], we study the multiplicative complexity and the rank of the multiplication in the local algebras Rm;n = k[x; y]=(xm+1; yn+1) and Tn = k[x; y]=(xn+1; xny; : : : ; yn+1) of bivariate polynomials. We obtain the lower bounds (2 13 o(1)) dimRm;n and (2 12 o(1)) dim Tn for the multiplicative complexity of the multiplication in Rm;n and Tn, respectively. On the other ...