3,108 research outputs found
On co-authorship for author disambiguation
No full textAuthor name disambiguation deals with clustering the same-name authors into different individuals. To attack the problem, many studies have employed a variety of disambiguation features such as coauthors, titles of papers/publications, topics of articles, emails/affiliations, etc. Among these, co-authorship is the most easily accessible and influential, since inter-person acquaintances represented by co-authorship could discriminate the identities of authors more clearly than other features. This study attempts to explore the net effects of co-authorship on author clustering in bibliographic data. First, to handle the shortage of explicit coauthors listed in known citations, a web-assisted technique of acquiring implicit coauthors of the target author to be disambiguated is proposed. Then, a coauthor disambiguation hypothesis that the identity of an author can be determined by his/her coauthors is examined and confirmed through a variety of author disambiguation experiments. (C) 2008 Elsevier Ltd. All rights reserved.X1174sciescopu
Hydraulic lift: Ecological implications of water efflux from roots
No full textCaldwell MM, Richards JH, Beyschlag W. Hydraulic lift: Ecological implications of water efflux from roots. In: Atkinson D, ed. Plant Root Systems: Their Effects on Ecosystem Composition. Special Publication Number 10 of the British Ecological Society. Oxford: Blackwell; 1991: 423-436
The distance-regular graphs such that all of its second largest local eigenvalues are at most one
No full textIn this paper, we classify distance-regular graphs such that all of its second largest local eigenvalues are at most one. Also we discuss the consequences for the smallest eigenvalue of a distance-regular graph. These extend a result by the first author, who classified the distance-regular graphs with smallest eigenvalue -1 - b(1)/2. (C) 2011 Elsevier Inc. All rights reserved.X1154sciescopu
The concomitant use of second-generation antipsychotics and long-term antiretroviral therapy may be associated with increased cardiovascular risk
No full textTo study the effect of concurrent use of second-generation antipsychotics (SGAs) on metabolic syndrome (MetS) components conferring increased cardiovascular risk in a sample of human immunodeficiency virus (HIV)-infected adults taking antiretroviral therapy (ART). A retrospective study of participants consecutively recruited at the UCSD HIV Neurobehavioral Research Program examined effects of combined ART and SGAs on body mass index (BMI), nonfasting serum lipids, diabetes mellitus (DM) incidence, and mean arterial pressure (MAP). Metabolic outcome variables and covariates were compared using t-tests, Chi-squared or Fisher's exact tests. Linear and logistic multivariable models explored metabolic outcomes for participants taking (SGA+) or not taking (SGA-) concomitant SGAs, after controlling for demographic and HIV disease- and ART-related covariates. Of 2229 HIV-infected participants, 12% (N=258) were treated with SGAs. In multivariable models adjusted for relevant covariates, the SGA+ group had significantly higher mean triglycerides, significantly higher odds of DM, significantly higher MAPs and marginally higher BMI. The use of SGAs in HIV-infected adults taking ART was independently associated with worse indicators of MetS and cardiovascular risk. Aggressive monitoring for the metabolic complications from concurrent SGA and ART is indicated in all patients receiving these medication combinations. (C) 2014 Elsevier Ireland Ltd. All rights reserved
On geometric distance-regular graphs with diameter three
No full textIn this paper we study distance-regular graphs with intersection array {(t + 1)s. ts. (t - 1)(s + 1 - psi); 1, 2, (t + 1)psi} (1) where s. t. psi are integers satisfying t >= 2 and 1 = 2, there are only finitely many distance-regular graphs of order (s, t) with mallest eigenvalue -t -1, diameter D = 3 and intersection number c(2) = 2 except for Hamming graphs with diameter three. Moreover, we will show that if a distance-regular graph with intersection array (1) for t = 2 exists then (s, psi) = (15, 9). As Gavrilyuk and Makhnev (2013)[9] proved that the case (s, psi) = (15, 9) does not exist, this enables us to finish the classification of geometric distance-regular graphs with smallest eigenvalue -3, diameter D >= 3 and c(2) >= 2 which was started by the first author (Bang, 2013)[1]. (C) 2013 Elsevier Ltd. All rights reserved.X1121Ysciescopu
fast
No full textfast[I] sent him to Atkinson Pond for the traps, but he found the pond fast.W.J. KIRWIN DEC 1972 JH DEC 1972PRINTED ITEM DNE-citUsed IUsed IUsed
Capsule-like voids in SiC single crystal: Phase contrast imaging and computer simulations
No full textThe results of observation of capsule-like voids in silicon carbide (6H-SiC) single crystal by means of a phase contrast imaging technique with synchrotron radiation at the Pohang Light Source as well as computer simulations of such images are presented. A pink beam and a monochromated beam were used. The latter gives more pronounced images but they still are smoothed due to a finite detector resolution and the spatial coherence of the beam. Sizes and a structure of far field images are different from these of the objects. The computer simulations allow us to reproduce a shape and a size of the capsule-like void. (C) 2014 Author(s).open1111sciescopu
- …
