1,720,958 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
Randomly Choose an Angle from Immense Number of Angles to Rotate Qubits, Compute and Reverse
Get PDFHomomorphic encryption (HE) schemes enable the processing of encrypted data and may be used
by a user to outsource storage and computations to an untrusted server. A plethora of HE schemes has
been suggested in the past four decades, based on various assumptions, and which achieve different
attributes. In this work, we assume that the user and server are quantum computers, and look for HE
schemes of classical data. We set a high bar of requirements and ask what can be achieved under these
requirements. Namely, we look for HE schemes which are efficient, information-theoretically secure,
perfectly correct, and which support homomorphic operations in a fully compact and non-interactive
way. Fully compact means that decryption costs O(1) time and space. In contrast to the legacy quantum
one-time pad scheme, our scheme is computation agnostic. That is, when delegating computations, the
user can remain utterly oblivious to the implementation method chosen by the cloud.
We suggest an encryption scheme based on random bases and discuss the homomorphic properties
of that scheme. One of the advantages of our scheme is providing better security in the face of weak
measurements (WM). Measurements of this kind enable collecting partial information on a quantum state
while only slightly disturbing the state. We suggest here a novel QKD scheme based on random bases,
which is resilient against WM-based attacks. We demonstrate the usefulness of our scheme in several
applications. Notably, we bring up a new concept we call securing entanglement. We look at entangled
systems of qubits as a resource, used for carrying out quantum computations, and show how our scheme
may be used to guarantee that an entangled system can be used only by its rightful owners. To the best
of our knowledge, this concept has not been discussed in previous literature
Optimal-Round Preprocessing-MPC via Polynomial Representation and Distributed Random Matrix
No full textWe present preprocessing-MPC schemes of arithmetic functions with optimal round complexity, function-independent correlated randomness, and communication and space complexities that grow linearly with the size of the function. We extend our results to the client-server model and present a scheme which enables a user to outsource the storage of confidential data to distrusted servers and have the servers perform computations over the encrypted data in a single round of communication. We further extend our results to handle Boolean circuits. All our schemes have perfect passive security against coalitions of up to parties. Our schemes are based on a novel secret sharing scheme, Distributed Random Matrix (DRM), which we present here. The DRM secret sharing scheme supports homomorphic multiplications, and, after a single round of communication, supports homomorphic additions.
Our approach deviates from standard conventions of MPC. First, we consider a representation of the function f as a multivariate polynomial (rather than an arithmetic circuit). Second, we divide the problem into two cases. We begin with solving the Non-Vanishing case, in which the inputs are non-zero elements of . In this case, our schemes have space complexity and communication complexity , where is the size of the input, and is the number of monomials of the function. Then, we present several solutions for the general case, in which some of the secrets can be zero. In these solutions, the space and communication complexities are either and , or and , respectively, where is the size of a modified version of . is bounded by the square of the maximal possible size of
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
- …
