1,720,961 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
Cryptanalysis on Asymmetric Structured Key Agreement Schemes
Get PDFWe study several asymmetric structured key agreement schemes based on
noncommutative matrix operations, including the recent proposal of Lizama as well as the strongly asymmetric algorithms SAA-3 and SAA-5 of Accardi
et al.\ We place them in a common algebraic framework for
public key agreement and identify simple structural conditions under which an
eavesdropper can reconstruct an effective key-derivation map and reduce key
recovery to solving linear systems over finite fields. We then show that the
three matrix-based schemes mentioned above all instantiate our algebraic framework and can therefore be broken in polynomial time from public
information alone. In particular, their security reduce to the hardness of
linear-algebraic problems and does not exceed that of the underlying discrete
logarithm problem. Our results demonstrate that the weakness of these schemes
is structural rather than parametric, and that minor algebraic modifications are insufficient to repair them
An Asymmetric Diffie-Hellman Protocol with Enhanced Efficiency through Parallelization
Get PDFTo ensure secure communication between two parties (Alice and Bob), Public Key Agreement (PKA) algorithms play a crucial role. The Diffie-Hellman (D-H) algorithm, introduced by W. Diffie and M. Hellman in 1976, is the most well-known PKA algorithm, based on exponentiation over a finite field. Over time, various PKA algorithms have been developed based on this original idea—these are referred to as D-H realizations or D-H algorithms. A common issue with D-H realizations is their computational inefficiency, particularly in environments with resource-constrained devices. This inefficiency arises from the high computational complexity of generating public and secret shared keys (SSKs), often resulting in communication delays.In this paper, we propose a modified D-H protocol designed to reduce the computational time required by one party, thereby decreasing the total time needed to establish the SSK in asymmetric environments where Alice and Bob have different computational capabilities. The core of this approach leverages the group homomorphism property of the underlying function to enable parallelization and reduce the complexity of Alice’s computations, together with an asymmetric key agreement structure in which both parties may follow distinct computational rules for public key and SSK generation.We demonstrate that the proposed protocol retains the security properties of the original D-H realizations, preserving the hardness of the discrete logarithm (DL), computational Diffie-Hellman (CDH), and decisional Diffie-Hellman (DDH) problems under an asymmetric setting. We also discuss its applicability to other cryptographic protocols. Experimental results show that the modified protocol significantly improves computational efficiency, particularly by reducing Alice\u27s computational burden through parallel processing. </p
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
- …
