1,720,977 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
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
Coordination d’appareils autonomes sur canaux bruités : régions de capacité et algorithmes de codage
No full text5G networks will be characterized by machine to machine communication and the Internet of Things, a unified network of connected objects. In this context, communicating devices are autonomous decision-makers that cooperate, coordinate their actions, and reconfigure dynamically according to changes in the environment.To do this, it is essential to develop effective techniques for coordinating the actions of the nodes in the network.Information theory allows us to study the long-term behavior of the devices through the analysis of the joint probability distribution of their actions. In particular, we are interested in strong coordination, which requires the joint distribution of sequences of actions to converge to an i.i.d. target distribution in L^1 distance.We consider a two-node network comprised of an information source and a noisy channel, and we require the coordination of the signals at the input and at the output of the channel with the source and the reconstruction. We assume that the encoder and decoder share a common source of randomness and we introduce a state capturing theeffect of the environment.The first objective of this work is to characterize the strong coordination region, i.e. the set of achievable joint behaviors and the required minimal rates of common randomness. We prove inner and outer bounds for this region. Then, we characterize the exact coordination region in three particular cases: when the channel is perfect, when the decoder is lossless and when the random variables of the channel are separated from the random variables of the source.The study of the latter case allows us to show that the joint source-channel separation principle does not hold for strong coordination. Moreover, we prove that strong coordination offers “free” security guarantees at the physical layer.The second objective of this work is to develop practical codes for coordination: by exploiting the technique of source polarization, we design an explicit coding scheme for coordination, providing a constructive alternative to random coding proofs.Les réseaux de 5ème génération se caractérisent par la communication directe entre machines (M2M) et l’Internet des Objets, un réseau unifié d’objets connectés. Dans ce contexte, les appareils communicants sont des décideurs autonomes qui coopérent, coordonnent leurs actions et se reconfigurent de manière dynamique enfonction de leur environnement. L’enjeu est de développer des algorithmes efficaces pour coordonner les actions des appareils autonomes constituant le réseau.La théorie de l’information nous permet d’étudier le comportement de long-terme des appareils grâce aux distributions de probabilité conjointes. En particulier, nous sommes intéressés par la coordination forte, qui exige que la distribution induite sur les suites d’actions converge en distance L^1 vers une distribution i.i.d. cible.Nous considérons un model point-à-point composé d’une source d’information, d’un encodeur, d’un canal bruité, d’un décodeur, d’une information commune et nous cherchons à coordonner les signaux en entrée et en sortie du canal avec la source et sa reconstruction.Nos premiers résultats sont des bornes intérieures et extérieure pour la région de coordination forte, c’est-à-dire l’ensemble des distributions de probabilité conjointes réalisables et la quantité d’information commune requise.Ensuite, nous caractérisons cette région de coordination forte dans trois cas particuliers: lorsque le canal est parfait, lorsque le décodeur est sans perte et lorsque les variables aléatoires du canal sont indépendantes des variables aléatoires de la source. L’étude de ce dernier cas nous permet de remettre en cause le principe de séparation source-canal pour la coordination forte. Nous démontrons également que la coordination forte offre “gratuitement” des garanties de sécurité au niveau de la couche physique.Par ailleurs, nous étudions la coordination sous l’angle du codage polaire afin de développer des algorithmes de codage implémentables. Nous appliquons la polarisation de la source de manière à créer un schéma de codage explicite qui offre une alternative constructive aux preuves de codage aléatoires
Coordination of autonomous devices over noisy channels : capacity results and coding techniques
No full textLes réseaux de 5ème génération se caractérisent par la communication directe entre machines (M2M) et l’Internet des Objets, un réseau unifié d’objets connectés. Dans ce contexte, les appareils communicants sont des décideurs autonomes qui coopérent, coordonnent leurs actions et se reconfigurent de manière dynamique enfonction de leur environnement. L’enjeu est de développer des algorithmes efficaces pour coordonner les actions des appareils autonomes constituant le réseau.La théorie de l’information nous permet d’étudier le comportement de long-terme des appareils grâce aux distributions de probabilité conjointes. En particulier, nous sommes intéressés par la coordination forte, qui exige que la distribution induite sur les suites d’actions converge en distance L^1 vers une distribution i.i.d. cible.Nous considérons un model point-à-point composé d’une source d’information, d’un encodeur, d’un canal bruité, d’un décodeur, d’une information commune et nous cherchons à coordonner les signaux en entrée et en sortie du canal avec la source et sa reconstruction.Nos premiers résultats sont des bornes intérieures et extérieure pour la région de coordination forte, c’est-à-dire l’ensemble des distributions de probabilité conjointes réalisables et la quantité d’information commune requise.Ensuite, nous caractérisons cette région de coordination forte dans trois cas particuliers: lorsque le canal est parfait, lorsque le décodeur est sans perte et lorsque les variables aléatoires du canal sont indépendantes des variables aléatoires de la source. L’étude de ce dernier cas nous permet de remettre en cause le principe de séparation source-canal pour la coordination forte. Nous démontrons également que la coordination forte offre “gratuitement” des garanties de sécurité au niveau de la couche physique.Par ailleurs, nous étudions la coordination sous l’angle du codage polaire afin de développer des algorithmes de codage implémentables. Nous appliquons la polarisation de la source de manière à créer un schéma de codage explicite qui offre une alternative constructive aux preuves de codage aléatoires.5G networks will be characterized by machine to machine communication and the Internet of Things, a unified network of connected objects. In this context, communicating devices are autonomous decision-makers that cooperate, coordinate their actions, and reconfigure dynamically according to changes in the environment.To do this, it is essential to develop effective techniques for coordinating the actions of the nodes in the network.Information theory allows us to study the long-term behavior of the devices through the analysis of the joint probability distribution of their actions. In particular, we are interested in strong coordination, which requires the joint distribution of sequences of actions to converge to an i.i.d. target distribution in L^1 distance.We consider a two-node network comprised of an information source and a noisy channel, and we require the coordination of the signals at the input and at the output of the channel with the source and the reconstruction. We assume that the encoder and decoder share a common source of randomness and we introduce a state capturing theeffect of the environment.The first objective of this work is to characterize the strong coordination region, i.e. the set of achievable joint behaviors and the required minimal rates of common randomness. We prove inner and outer bounds for this region. Then, we characterize the exact coordination region in three particular cases: when the channel is perfect, when the decoder is lossless and when the random variables of the channel are separated from the random variables of the source.The study of the latter case allows us to show that the joint source-channel separation principle does not hold for strong coordination. Moreover, we prove that strong coordination offers “free” security guarantees at the physical layer.The second objective of this work is to develop practical codes for coordination: by exploiting the technique of source polarization, we design an explicit coding scheme for coordination, providing a constructive alternative to random coding proofs
Coordination d’appareils autonomes sur canaux bruités : régions de capacité et algorithmes de codage
No full text5G networks will be characterized by machine to machine communication and the Internet of Things, a unified network of connected objects. In this context, communicating devices are autonomous decision-makers that cooperate, coordinate their actions, and reconfigure dynamically according to changes in the environment.To do this, it is essential to develop effective techniques for coordinating the actions of the nodes in the network.Information theory allows us to study the long-term behavior of the devices through the analysis of the joint probability distribution of their actions. In particular, we are interested in strong coordination, which requires the joint distribution of sequences of actions to converge to an i.i.d. target distribution in L^1 distance.We consider a two-node network comprised of an information source and a noisy channel, and we require the coordination of the signals at the input and at the output of the channel with the source and the reconstruction. We assume that the encoder and decoder share a common source of randomness and we introduce a state capturing theeffect of the environment.The first objective of this work is to characterize the strong coordination region, i.e. the set of achievable joint behaviors and the required minimal rates of common randomness. We prove inner and outer bounds for this region. Then, we characterize the exact coordination region in three particular cases: when the channel is perfect, when the decoder is lossless and when the random variables of the channel are separated from the random variables of the source.The study of the latter case allows us to show that the joint source-channel separation principle does not hold for strong coordination. Moreover, we prove that strong coordination offers “free” security guarantees at the physical layer.The second objective of this work is to develop practical codes for coordination: by exploiting the technique of source polarization, we design an explicit coding scheme for coordination, providing a constructive alternative to random coding proofs.Les réseaux de 5ème génération se caractérisent par la communication directe entre machines (M2M) et l’Internet des Objets, un réseau unifié d’objets connectés. Dans ce contexte, les appareils communicants sont des décideurs autonomes qui coopérent, coordonnent leurs actions et se reconfigurent de manière dynamique enfonction de leur environnement. L’enjeu est de développer des algorithmes efficaces pour coordonner les actions des appareils autonomes constituant le réseau.La théorie de l’information nous permet d’étudier le comportement de long-terme des appareils grâce aux distributions de probabilité conjointes. En particulier, nous sommes intéressés par la coordination forte, qui exige que la distribution induite sur les suites d’actions converge en distance L^1 vers une distribution i.i.d. cible.Nous considérons un model point-à-point composé d’une source d’information, d’un encodeur, d’un canal bruité, d’un décodeur, d’une information commune et nous cherchons à coordonner les signaux en entrée et en sortie du canal avec la source et sa reconstruction.Nos premiers résultats sont des bornes intérieures et extérieure pour la région de coordination forte, c’est-à-dire l’ensemble des distributions de probabilité conjointes réalisables et la quantité d’information commune requise.Ensuite, nous caractérisons cette région de coordination forte dans trois cas particuliers: lorsque le canal est parfait, lorsque le décodeur est sans perte et lorsque les variables aléatoires du canal sont indépendantes des variables aléatoires de la source. L’étude de ce dernier cas nous permet de remettre en cause le principe de séparation source-canal pour la coordination forte. Nous démontrons également que la coordination forte offre “gratuitement” des garanties de sécurité au niveau de la couche physique.Par ailleurs, nous étudions la coordination sous l’angle du codage polaire afin de développer des algorithmes de codage implémentables. Nous appliquons la polarisation de la source de manière à créer un schéma de codage explicite qui offre une alternative constructive aux preuves de codage aléatoires
- …
