1,721,221 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
Search Games on Hypergraphs
No full textThe main motivation behind this thesis is a certain type of win-lose games that are played on hypergraphs and can be translated into the following puzzle. Suppose there are two persons, say Alice and Bob. There are n biscuits, where n is a positive integer, and Alice chooses s of them uniformly at random. Bob possesses h grams of poison, where h is greater than or equal to 1, and the lethal dose is 1 gram. How should Bob distribute the poison over the biscuits in order to maximize the probability of poisoning Alice? This problem is due to Ken Kikuta and William Ruckle who, driven by less devious motives, formulated it in terms of accumulation games between two players. They conjectured that the optimal distribution of poison uses dosages of 1/j grams in as many biscuits as possible, where j is a positive integer that depends on h,n,s. In Chapter 1 we introduce the poisoning problem and discuss its relation to known results from the literature. The conjecture of Kikuta and Ruckle is related to two other conjectures, one from extremal combinatorics and one from the theory of probability. The combinatorial flavor of the Kikuta-Ruckle conjecture is its relation to the matching conjecture of Paul Erdos and its fractional analogue. Its probabilistic flavor is its relation to a conjecture of Stephen Samuels on a tail probability problem. We also consider a poisoning problem on more general ground spaces. This leads to a geometric problem that generalizes the isodiametric one. In Chapter 2 we settle the Kikuta-Ruckle conjecture in case n=2s-1. This case corresponds to the, so called, Odd graph. We also settle the conjecture for a few more cases using elementary combinatorial and game-theoretic arguments. In Chapter 3 we consider the poisoning game on the cyclic graph. In this game the n biscuits are arranged cyclically and Alice chooses s consecutive of them uniformly at random. We find the value of this game along with the optimal strategies of both players. In addition, we give a characterization of the fractional covering number of uniform hypergraphs obtained from the cyclic graph. Chapter 4 deals with the analysis of a network coloring game. This is a game that is motivated by conflict resolution situations and is played on a graph. The vertices of the graph are thought of as players having a fixed set of available colors. The game is played in rounds and in each round all players simultaneously and individually choose a color with the perspective of ending up with a color that is different from the colors chosen by their neighbors. We analyze the network game by introducing a very simple search game. The optimal strategy of the searchers in this game involves tosses of fair colored coins and leads to the following combinatorial probability problem that is interesting on its own. Suppose that you can color n fair coins with n colors. It is not allowed to colors both sides of a coin with the same color, but all other combinations are allowed. Let X be the number of different colors after a toss of the coins. In what way should you color the coins such that you maximize the median of X? We solve this problem and consider its natural generalization to the case of biased coins. The later case builds on the study of Bernoulli random variables whose total number of successes is of fixed parity.Applied mathematicsElectrical Engineering, Mathematics and Computer Scienc
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
Author-wise bibliometric analysis based on entropy.
No full textAuthor-wise bibliometric analysis based on entropy.</p
Optimizing stakes in simultaneous bets
No full textWe want to find the convex combination S of iid Bernoulli random variables that maximizes P(S ≥ t) for a given threshold t. Endre Csóka conjectured that such an S is an average if t ≥ p, where p is the success probability of the Bernoulli random variables. We prove this conjecture for a range of p and tGreen Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Applied Probabilit
- …
