131,254 research outputs found

    Ahlgren-Belisle-Lee-2019-EM processing code

    No full text
    Processing code and files that go along with the work presented in the following paper:Genomic mosaicism underlies the adaptation of marine Synechococcus ecotypes to distinct oceanic iron nichesNathan A. Ahlgren, B. Shafer Belisle, and Michael D. Lee</div

    Going Beyond Counting First Authors in Author Co-citation Analysis

    No full text
    The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed

    John D. Freeman

    No full text
    Freeman standing with L.W. Jones and Frank Ahlgren. On verso: cover 9-'51. 6-'50. U of A. John D. Freeman (LL.D.) Lewis W. Jones. Frank Ahlgren (speaker). Commencement, 1950

    MeSH term explosion and author rank improve expert recommendations

    No full text
    Information overload is an often-cited phenomenon that reduces the productivity, efficiency and efficacy of scientists. One challenge for scientists is to find appropriate collaborators in their research. The literature describes various solutions to the problem of expertise location, but most current approaches do not appear to be very suitable for expert recommendations in biomedical research. In this study, we present the development and initial evaluation of a vector space model-based algorithm to calculate researcher similarity using four inputs: 1) MeSH terms of publications; 2) MeSH terms and author rank; 3) exploded MeSH terms; and 4) exploded MeSH terms and author rank. We developed and evaluated the algorithm using a data set of 17,525 authors and their 22,542 papers. On average, our algorithms correctly predicted 2.5 of the top 5/10 coauthors of individual scientists. Exploded MeSH and author rank outperformed all other algorithms in accuracy, followed closely by MeSH and author rank. Our results show that the accuracy of MeSH term-based matching can be enhanced with other metadata such as author rank

    "Closing the R&D Gap, Evaluating the Sources of R&D Spending"

    No full text
    Both spending and tax policies have been implemented in the United States with the goal of stimulating private sector research and development (R&D). Karier questions whether current R&D policy, especially the research and experimentation tax credit, can contribute to closing the gap between nondefense expenditures on R&D in the United States and such expenditures in other countries, such as Japan and Germany. He also explores possible changes to our current R&D policy to make it more effective.

    A. D. Fricke, author

    No full text
    Black and white photograph of author, A. D. Fricke

    Dispelling the Myths Behind First-author Citation Counts

    No full text
    We conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more sophisticated methods

    Scholarly Communication and Publishing Lunch and Learn Talk #11: The ULS Open Access Author Fee Fund

    No full text
    At the May 2014 talk, you will learn about the ULS Open Access Author Fee Fund--what it is, why we do it, how it works, and how the program is going so far

    Half-integral weight Kloosterman sums and integer partitions

    No full text
    Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2026-05-01The student, Qihang Sun, accepted the attached license on 2024-04-22 at 20:45.The student, Qihang Sun, submitted this Dissertation for approval on 2024-04-22 at 20:47.This Dissertation was approved for publication on 2024-04-24 at 15:19.DSpace SAF Submission Ingestion Package generated from Vireo submission #20556 on 2024-09-16 at 00:44:22Kloosterman sums are special exponential sums which appear in many problems in number theory. Kloosterman first introduced these sums in \cite{Kloosterman1926firstdef} to investigate whether the quadratic form a1n12+a2n22+a3n32+a4n42a_1n_1^2+a_2n_2^2+a_3n_3^2+a_4n_4^2 with fixed aiNa_i\in \mathbb N represents all sufficiently large natural numbers. Another application is to estimate the shifted sum of divisor functions. Let τ(n)\tau(n) be the number of divisors of the positive integer nn and D(N,f)\defeq \sum_{n=1}^N \tau(n)\tau(n+h),\quad \text{for some fixed integer }h\geq 1. Heath-Brown \cite{HeathBrown1979ShiftedDivisor} applied the Weil bound \eqref{Weilbound standard Kl sum} of Kloosterman sums to prove that D(N,f)=\text{explicit main terms}+O(N^{\frac 56+\ep}),\quad \text{uniformly for }1\leq h\leq N^{\frac 56}. Using Kuznetsov's trace formula, Deshouillers and Iwaniec \cite{DeshouillersIwaniec1982ShiftDivisor} obtained a much better error bound O(N^{\frac 23+\ep}) for all h1h\geq 1. The integer partition function p(n)p(n), which is the number of ways to write nn as a sum of positive integers, has been researched for remarkable properties by Euler, Hardy and Ramanujan \cite{HardyRamanujan1918Asymp}. Rademacher's exact formula \cite{Rademacher1937pn} states that p(n)p(n) can be written as a sum of exponential sums. The generating function of p(n)p(n) is q124/η(z)q^{\frac1{24}}/\eta(z), where η(z)\eta(z) is Dedekind's eta function with q=e2πizq=e^{2\pi i z} and \im z>0. Since η(z)\eta(z) is a weight 12\frac12 modular form, using the definition of multiplier systems, we are able to rewrite the exponential sums in Rademacher's exact formula as generalized Kloosterman sums. The bounds on Kloosterman sums give the growth rate of errors for such approximations. There are very famous congruence properties of the partition function p(n)p(n) by Ramanujan: p(5n+4)\equiv 0\Mod 5,\quad p(7n+5)\equiv 0\Mod7, \quad p(11n+6)\equiv 0\Mod {11}. In 1944, Dyson \cite{Dyson} defined the rank of a partition of nn. If we let N(a,b;n)N(a,b;n) denote the number of partitions of nn with rank congruent to a\Mod b, then Dyson conjectured that 5N(j,5;5n+4)=p(5n+4)5N(j,5;5n+4)=p(5n+4) and 7N(j,7;7n+5)=p(7n+5)7N(j,7;7n+5)=p(7n+5) for all jj. By the work of Bringmann and Ono \cite{BrmOno2006ivt,BrmOno2010}, the generating functions for the ranks of partitions have similar properties as q124/η(z)q^{\frac1{24}}/\eta(z). The work of Bringmann and Ono in the theory of harmonic Maass forms discovers beautiful properties about the rank of partitions. For example, in \cite{BrmOno2006ivt} they proved the exact formula for the modulo 22 case, which perfected the asymptotics by Ramanujan, Dragonette \cite{Dragonette1952} and Andrews \cite{Andrews1966}. If we have better estimates for the sums of half-integral weight Kloosterman sums, we are able to obtain better tail bounds for the Rademacher-type exact formulas, which control the efficiency of their convergence. The recent work by Ahlgren and Andersen \cite{AAimrn}, Ahlgren and Dunn \cite{ahlgrendunn}, and Andersen and Wu \cite{AndersenWu2022bound36_publishedver} provide improved error bounds based on their improvement on the estimates for Kloosterman sums. The author \cite{QihangFirstAsympt,QihangSecondAsympt} generalized their work to the Kloosterman sums with a wider class of multiplier systems, which are half-integral weight and include the commonly used theta- and eta-multipliers twisted by quadratic characters. The resulting estimates give a uniform version of the general result by Goldfeld and Sarnak \cite{gs} for sums of such Kloosterman sums with a power-saving bound in the parameters mm and nn. Following the method in \cite{BrmOno2006ivt}, the author provided a detailed proof of the exact formula for the rank modulo 3 case in \cite{QihangFirstAsympt}. Then what about the exact formulae in the rank modulo 5 and 7 cases, where Ramanujan's congruences appear? Bringmann \cite{BringmannTAMS} proved the general asymptotics for all odd moduli, while the Kloosterman type sums are hard to interpret as Kloosterman sums. Thanks to the theory of vector-valued Maass forms from \cite{BrmOno2010} and the explicit transformation laws by Garvan \cite{GarvanTransformationDyson2017}, the author finds the interpretation as vector-valued Kloosterman sums. Combining with some generalization of \cite{gs}, the author finally provides the proof for the exact formula of rank modulo primes p5p\geq 5. The author also has a striking observation between the interesting cases p=5,7p=5,7, where the Kloosterman sums become identically zero (or become equal for those defined on different cusp pairs). After a long study of the cases depending on congruence properties of the Dedekind sums, the author proves this cancellation property and provides a new proof for the Dyson's conjecture 5N(a,5;5n+4)=p(5n+4)5N(a,5;5n+4)=p(5n+4) and 7N(a,7;7n+5)=p(7n+5)7N(a,7;7n+5)=p(7n+5) which implies Ramanujan's congruences

    The R&D Tax Incentives

    No full text
    This article sets out some background information and reflections of the author on the R&amp;D tax incentive schemes included in the Common Corporate Tax Base (CCTB) Proposal. In particular the author analyzes the stimulus to private R&amp;D through ad hoc tax incentives included in the CCTB Proposal and dives into the actual provisions included in the Proposal highlighting the most relevant issues connected with their design and interpretation. Moreover, the author explores the interaction between the CCTB Proposal and the granting by Member States of domestic R&amp;D tax incentives
    corecore