1,720,965 research outputs found
Computationally Efficient Recursions for Top-Order Invariant Polynomials with Applications ∗
No full textevaluation of top-order invariant polynomials and moments of ratio of quadratic forms in normal random variables. ” Hillier first became involved as a referee of that earlier paper. His contribution has been confined mainly to suggesting the generating function approach, simplifying some of the proofs, and contributing a few additional results. We are grateful to Plamen Koev, Peter Phillips, Serge Provost, Marko Riedel and two anonymous referees for helpful comments and suggestions. Kan gratefully acknowledges financial support from the National Bank Financial of Canada
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
Densities of the extreme eigenvalues of Beta–MANOVA matrices
No full text We derive new expressions for the densities of extreme eigenvalues of a Beta–MANOVA matrix, which generalize the classical result of Khatri for the real case. We also present new expressions for the distributions of those eigenvalues which are valid for any values of the parameters. </jats:p
The efficient evaluation of the hypergeometric function of a matrix argument
No full textAbstract. We present new algorithms that efficiently approximate the hypergeometric function of a matrix argument through its expansion as a series of Jack functions. Our algorithms exploit the combinatorial properties of the Jack function, and have complexity that is only linear in the size of the matrix. 1
The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
No full textNecessary and sufficient conditions for accurate and efficient rational function evaluation and factorizations of rational matrices
No full text- …
