1,721,123 research outputs found
On Some New Zm Linear Codes Based on Elementary Symmetric Functions
No full textLet Z(m) def= 0; 1, ... , (m - 1)g be the m-ary alphabet, mN. This paper gives some new theory and efficient designs of Z(m) linear error control codes based on the elementary symmetric functions of m-ary words. Here, a Z(m) linear code is a sub-module of the module (Z(m)(n);+ mod m; Zm; . mod m), n is an element of N, and the errors are measured in the L-1 or Lee metric. In particular, given a field, K, of characteristic p = char(K) = 2,3,5, ... prime, and given d,m = vp(l), v, l, nN with d <= m/v = p(l) and n <= vertical bar K vertical bar - 1, we introduce a new class of (d -1) asymmetric error correcting Z(m) linear codes, C-d, of length n whose redundancy is only p(C-d) = n - log(m) vertical bar C-d vertical bar <= (d - 1) log(m) vertical bar K vertical bar. For these codes we give very efficient field based algebraic decoding algorithms to control d 1 errors actually in the Lee distance. Also for the extended codes, we give new efficient field based decoding algorithms
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe 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
Full text link“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
Full text linkWe 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
Efficient balanced codes over the mth roots of unity
No full textLet Phi(m) subset of C be the set of all mth roots of unity, m is an element of IN. A balanced code over Phi(m) is a block code over the alphabet Phi(m) such that each code word is balanced; that is, the complex sum of its components (or weight) is equal to 0. Let B-m (n) be the set of all balanced words of length n over Phi(m). In this correspondence, it is shown that when m is a prime number, the set B-m (n) is not empty if, and only if, m divides n. In this case, the minimum redundancy for a balanced code over Phi(m) of length n is rho(B-m(n)) = n [log(m) vertical bar B-m(n)vertical bar] approximate to[(m-1)/2]log(m)(2 pi n) - m/2. On the other hand, it is shown that when m = 4, the set B-4 (n) is not empty if, and only if, n is even, and in this case, the minimum redundancy for a balanced code over Phi(4) of length n is rho(B-4(n)) = n - [log(4) vertical bar B-4(n)vertical bar] approximate to log(4) n + 0.326. Further, this correspondence completely solves the problem of designing efficient coding methods for balanced codes over Phi(m), when m = 4. In fact, it reduces the problem of designing efficient coding schemes for balanced codes over Phi(4) to the design of efficient balanced codes over the usual bipolar alphabet Phi(2) = {-1,+1}.[...
Dispelling the Myths Behind First-author Citation Counts
Full text linkWe 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
On codes achieving zero error capacities in limited magnitude error channels
No full textShannon in his 1956 seminal paper introduced the concept of the zero error capacity, Co, of a noisy channel. This is defined as the least upper bound of rates at which it is possible to transmit information with zero probability of error. At present not many codes are known to achieve the zero error capacity. In this paper, some codes which achieve zero error capacities in limited magnitude error channels are described. The code lengths of these zero error capacity achieving codes can be of any finite length n = 1, 2,..., in contrast to the long lengths required for the known regular capacity achieving codes such as turbo codes, LDPC codes and polar codes. Both non-systematic and systematic codes are described
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
- …
