1,720,962 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
Ensembles de petite somme et ensembles de Sidon, étude de deux extrêmes
No full textNotre projet se situe dans le domaine de la combinatoire additive. Il s’agit plus précisément de déterminer la taille maximale d’un sous-ensemble A d’un groupe fini G qui ne contient pas de triplets (a,a+d,a+2d) d’éléments distincts. On dit alors que A est sans progression arithmétique. Une telle progression (PA3) est en fait un exemple à la fois simple et naturel de structure additive que l’on s’attend à trouver dans un ensemble « assez gros ». Toute la difficulté consiste à déterminer ce que « assez gros » signifie ici. La recherche de la taille maximale d’un ensemble sans progression arithmétique est un problème désormais classique en combinatoire additive. Elle a donné lieu à des travaux célèbres des meilleurs spécialistes du domaine. On distingue deux aspects du problème : la détermination d’une taille au-delà de laquelle on est assuré que A possède des PA3, ce qui donne une majoration de la taille maximale d’un ensemble sans PA3, et la construction de gros ensembles sans PA3, ce qui en donne une minoration. Nous insisterons plus particulièrement sur la construction d’ensembles sans PA3 dans les groupes finis Z_q^n avec q petit. On commencera par une optimisation numérique des ensembles de base utilisés dans les constructions déjà connues et une généralisation à d’autres entiers q. On cherchera également à adapter une construction de Ruzsa à ce contexte. Cela permettra d‘aborder les difficultés de manière progressive en commençant par des manipulations combinatoires sur un groupe de base de petit cardinal autorisant donc une approche numérique.Our project lies in the field of additive combinatorics. More precisely, we seek the maximal size of a progression free subset of a finite group G, meaning a subset with no three distinct elements of the form a, a+d, a+2d (called a 3AP for 3 arithmetic progression). A 3AP is a simple and natural pattern that we expect to find in a 'large enough' set and we shall try to precise what 'large enough' means here. Trying to determine the maximal size of a progression free set is now a classical problem in additive combinatorics, on which many of the best experts have worked. There are two different aspects in this problem : to determine a minimal size for A which assures the existence of 3AP in A, this gives an upper bound for the maximal size of a progression free set; to build some large progression free sets, this gives a lower bound for this maximal size. We will insist on the constructive part in the context of groups Z_q^n with small q. We shall also try to adapt a construction by Ruzsa to this context. The progression of this work should be from some combinatorial constructions, allowing numerical approach, to more theoretical concepts
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
Ensembles de Sidon dans des unions d'intervalles d'entiers
No full textWe study the maximum size of Sidon sets in unions of integers intervals. If A ⊂ N is the union of two intervals and if |A| = n (where |A| denotes the cardinality of A), we prove that A contains a Sidon set of size at least 0, 876 √ n. On the other hand, by using the small differences technique, we establish a bound of the maximum size of Sidon sets in the union of k intervals
Ensembles de Sidon dans des unions d'intervalles d'entiers
No full textWe study the maximum size of Sidon sets in unions of integers intervals. If A ⊂ N is the union of two intervals and if |A| = n (where |A| denotes the cardinality of A), we prove that A contains a Sidon set of size at least 0, 876 √ n. On the other hand, by using the small differences technique, we establish a bound of the maximum size of Sidon sets in the union of k intervals
- …
