1,720,982 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
Recommended from our members
Transmission strategies for multiple antenna wireless ad-hoc and relay networks
Get PDFtextWireless devices have become an integral part of our everyday lives. Cell-phones, PDA's, Wi-Fi enabled laptops, smart homes and appliances, and automated highway systems are some of the examples of wireless devices and networks in common use. More and more applications and functionalities are constantly being added to these devices, and to support these new applications high data rate communication is required between the wireless devices. Achieving high data rates with wireless communication is impeded by severe fluctuations in the received signal strength (called fading) due to mobility, the exponential attenuation of signal power with distance (called path loss), and interference due to simultaneous transmissions by different users at the same time or over same frequency band. Two of the promising techniques to mitigate the effects of fading, path loss, and interference are: using multiple antennas at the transmitter and receiver, and employing extra nodes (called relays) in between the transmitter and its receiver to relay the transmitter's message to its receiver. This dissertation identifies the optimal transmit and receive strategy with multiple antennas that maximizes the transmission capacity of an ad-hoc wireless network. The transmission capacity is defined as the maximum number of transmitter-receiver pairs that can simultaneously communicate under a per transmission quality of service constraint. This dissertation also presents novel relay transmission strategies for multiple antenna equipped relay based communication that achieve near optimal performance, with Shannon capacity and diversity-multiplexing tradeoff (DMT) as the performance metrics. The Shannon capacity is defined as the maximum rate of reliable communication, while the DMT characterizes the maximum diversity gain for a given value of multiplexing gain in a multiple antenna system. DMT is used as the benchmark, since transmission strategies that meet the DMT are guaranteed to leverage both the advantages of multiple antenna systems.Electrical and Computer Engineerin
Scheduling Multi-Server Jobs is Not Easy
Get PDFThe problem of online scheduling of multi-server jobs is considered, where there are a total of servers, and each job requires concurrent service from multiple servers for it to be processed. Each job on its arrival reveals its processing time, the number of servers from which it needs concurrent service and an online algorithm has to make scheduling decisions using only causal information, with the goal of minimizing the response/flow time. The worst case input model is considered and the performance metric is the competitive ratio. For the case, when all job processing time (sizes) are the same, we show that the competitive ratio of any deterministic/randomized algorithm is at least and propose an online algorithm whose competitive ratio is at most . With equal job sizes, we also consider the resource augmentation regime where an online algorithm has access to more servers than an optimal offline algorithm. With resource augmentation, we propose a simple algorithm and show that it has a competitive ratio of when provided with servers with respect to an optimal offline algorithm with servers. With unequal job sizes, we propose an online algorithm whose competitive ratio is at most , where is the maximum size of any job
Throughput-Delay-Reliability Tradeoff in Ad Hoc Networks
No full textInternational audienceDelay-reliability (D-R), and throughput-delayreliability (T-D-R) tradeoffs in an ad hoc network are derived for single hop and multi-hop transmission with automatic repeat request (ARQ) on each hop. The delay constraint is modeled by assuming that each packet is allowed at most D retransmissions end-to-end, and the reliability is defined as the probability that the packet is successfully decoded in at most D retransmissions. The throughput of the ad hoc network is characterized by the transmission capacity, which is defined to be the maximum allowable density of transmitting nodes satisfying a per transmitter receiver rate, and an outage probability constraint, multiplied with the rate of transmission and the success probability. Given an end-to-end retransmission constraint of D, the optimal allocation of the number of retransmissions allowed at each hop is derived that maximizes a lower bound on the transmission capacity. For equidistant hops equally distributing the total retransmission constraint among all the hops is optimal. Optimizing over the number of hops, single hop transmission is shown to be optimal for maximizing a lower bound on the transmission capacity in the sparse network regime
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
- …
