1,721,298 research outputs found
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
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
Linear Quadratic Control with Input
No full textThis paper studies a new approach to linear quadratic control for linear systems with input saturation. Our work presents an optimal sector bound to model the mismatch between the unsaturated controller and saturated one and an optimised control design associated with this sector bound. This leads to a new characterisation of invariant sets and new switching controllers. The main outcome of this paper is that better performance can be guaranteed for the same region of attraction, or equivalently, a larger region of attraction is given for the same level of guaranteed performance
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
Computational Complexity of Real Structured Singular Value in l_p Setting
No full textThis paper studies a generalized real structured singular value (¯) problem where uncertain parameters are bounded by an ` p norm. Two results are presented. The first one shows that this generalized ¯ problem is NP-hard for any given rational number p 2 [1; 1]. The NP-hardness holds as long as k, the size of the largest repeated block, exceeds 1. This result generalizes the known NP-hardness result for the conventional ¯ problem (with p = 1). Our second result, which strengthens the first one, considers the approximability problem of the generalized ¯. We show that the problem of obtaining an estimate for the generalized ¯ with some guaranteed bound on the relative error remains to be NP-hard, regardless how large this bound is. This work was supported by Australian Research Council and NSF grants ECS-9211593 and ECS-9350346. The first author was visiting the University of Iowa when this work was initiated. 1 Introduction The problem of real structured singular value (real ¯) ari..
Computational Complexity of a Problem Arising in Fixed Order Output Feedback Design
No full textThis paper is concerned with a matrix inequality problem which arises in fixed order output feedback control design. This problem involves finding two symmetric and positive definitive matrices X and Y such that they each satisfies a linear matrix inequality and that XY = I. It is well-known that many control problems such as fixed order output feedback stabilization, H1 control, guaranteed H 2 control, and mixed H 2 =H1 control can all be converted into the matrix inequality problem above, including static output feedback problems as a special case. We show, however, that this matrix inequality problem is NP-hard. Keywords:Output feedback control, static output feedback, linear matrix inequality, H1 control, computational complexity. The research of the first author is supported by Australian Research Council, while the research of the second author is supported by the Natural Science and Engineering Research Council of Canada under grant No. OPG0090301. 1 Main Result Denote by..
- …
