1,721,045 research outputs found

    Going Beyond Counting First Authors in Author Co-citation Analysis

    Get PDF
    The 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 PDF
    We 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

    Queueing net with random delay signals

    No full text
    A queueing network is considered with nodes in which a signals flow enters along with a flow of usual (positive) demands. Random time is required for activation of a signal entering a node. The multiplicative form is obtained for stationary distribution of network states probabilities with one-linear nodes and exponentially-distributed service time

    Stationary distribution of a finite queue with recursive input flow and Markov service discipline

    No full text
    An one-line queueing system with the limited accumulator and recursive demand input flow is studied. The service process of the phase type is Markov one and specified by the transition intensity matrices by phases with and without the demand output from a device. A matrix algorithm is obtained for the calculation of stationary distribution of the Markov process describing the queue process for both arbitrary time moment and the moments of demands entering into the system and their service completion. Laplace-Stieltjes transformation is obtained for the demand expecting time in the service discipline FCFS

    A finite queue with a markov input dependent on the state of the system and a random service discipline

    No full text
    A single-server finite-capacity queue with a Markov input is studied under the assumption that the matrix parameters determining the Markov flow depend on the number of calls in the system. The service time is distributed by an arbitrary law. A matrix algorithm for computing the stationary probabilities of the states and expressions interrelating the capacity parameters of the system are derived

    Matrix-geometric queue distribution under LCFS discipline with interruption and phase-type distributions

    No full text
    The queuing system of GI - GI - 1 - r type with phase-type distribution function (PH-distribution) of input flow and serving time is considered. It is supposed that forthcoming claim ousts the served one in the queue and the interrupted claim is served afterwards anew. This procedure corresponds to service discipline LCFS PRR (Last Come First Served Preemtive Resume Repetition). Thus, the service discipline assumes the reversed order of serving claims with interruption and repetition of service of interrupted claim with the same distribution. The stochastic behaviour of queuing system is described by homogeneous Markovian process over some set of states. The matrix-geometric form for queue stationary distribution is obtained. The recurrent relations for the moments of staying time of the claim in the system are derived. The numerical analysis are given. Particularly, these results enable to calculate the dependencies of probability of losses and mean number of claims on the capacity

    Queueing net with random delay signals

    No full text
    A queueing network is considered with nodes in which a signals flow enters along with a flow of usual (positive) demands. Random time is required for activation of a signal entering a node. The multiplicative form is obtained for stationary distribution of network states probabilities with one-linear nodes and exponentially-distributed service time
    corecore