1,720,974 research outputs found
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe 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
Variations on the Author
Get PDF“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Get PDFWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
Get PDFWe 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
Rings of finite rank over integers
Get PDFWe study the rings and ideal classes associated to weakly divisible polynomials and other homogeneous ideals in higher projective spaces (). To a point, say, we associate a ring which we show is an integral ring and is invariant under the natural action. We show methods to compute its discriminant and construct objects to parameterize classes of said rings. We use these rings to improve on lower bounds on the number of number fields ordered by discriminant.Ph.D
koamabayili/VECTRON-author-checklist: VECTRON author checklist
No full textWe have done our best to complete the author checklist relating to the use of animals in the hut study. Note that the objective for the hut study was to evaluate the IRS treatment applications for residual efficacy against Anopheles mosquitoes, including the local An. coluzzii mosquito population. Cows were only used to attract mosquitoes into the huts and no tests were carried out directly on the cows. The author checklist is intended for use with studies where experiments are carried out on animals, which is why we have had such difficulty in completing this for the hut study, as many of the questions do not relate to how the cows were used
Applications of Fourier coefficients of modular forms
No full textLet be a modular form of even weight and level which is a normalized eigen-form for the Hecke operators, and write
for its Fourier expansion at . We assume the Fourier coefficients are rational integers. A notable example of such a form is Ramanujan's cusp form of weight 12 and level 1. In this case, the Fourier coefficients are given by the famous Ramanujan function:
In this thesis, we study applications of the Fourier coefficients , and more generally, .
First, we present a factoring algorithm that uses an oracle that outputs . We show that the algorithm runs in polynomial time for squarefree integers on average, and quasi-polynomial time for non-squarefree integers on average. We note that current factoring algorithms have sub-exponential runtimes. More importantly, when combined with Edixhoven's (conditional) polynomial time algorithm for computing , we get an equivalence between factoring and computing .
Secondly, we present an algorithm that uses an oracle that outputs for testing the squarefree-ness of an integer. This algorithm exploits the greatest common divisor of sequences of the form where is a prime and . Thirdly, we present a primality testing algorithm that uses an oracle that outputs and where is a form of weight 2 corresponding to an elliptic curve. As a corollary, we use such an oracle to compute in polynomial time the value of the M\"{o}bius function in the squarefree case.Ph.D
The Least Prime whose Frobenius is an n-cycle
Get PDFLet L/K be a Galois extension of number fields. We consider the problem of bounding the least prime ideal of K whose Frobenius lies in a fixed conjugacy class C. Under the assumption of Artin's conjecture we work with Artin L-functions directly to obtain an upper bound in terms of irreducible characters which are nonvanishing at C. As a consequence we obtain stronger upper bounds for the least prime in C when many irreducible characters vanish at C. We also prove a Deuring-Heilbronn phenomenon for Artin L-functions with nonnegative Dirichlet series coefficients as a key step.
We apply our results to the case when Gal(L/K) is the symmetric group Sn. Using classical results on the representation theory of Sn we give an upper bound for the least prime whose Frobenius is an n-cycle which is stronger than known bounds when the characters which are nonvanishing at n-cycles are unramified, as well a similar result for (n-1)-cycles. We also give stronger bounds in the case of Sn-extensions over Q which are unramified over a quadratic field. We also consider other groups and conjugacy classes where unconditional improvements are obtained.Ph.D
- …
