1,720,973 research outputs found
Étude de complexité algorithmique pour des problèmes de domination et de tournées dans les graphes avec obligations
No full textRésumé indisponible.Résumé indisponible
Étude de complexité algorithmique pour des problèmes de domination et de tournées dans les graphes avec obligations
No full textRésumé indisponible.Résumé indisponible
Trouver un Indépendant Dominant respectant des Obligations dans les graphes
No full textNational audienc
Sur la complexité de l'ensemble Indépendant Dominant avec des Obligations faibles dans les graphes
No full textNational audienc
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
On the complexity of Independent Dominating Set with Obligations in graphs
No full textA subset is an \emph{independent} (or \emph{stable}) \emph{dominating set} of a graph if is an independent set (no edges between vertices of ) and dominates all the vertices of (each vertex of has a neighbour in ). In this paper we study a generalisation of this classical notion. Namely, an instance of our problem is a graph and a partition of . Each subset of is called an \emph{obligation}. An \emph{Independent Dominating set with Obligation} (\IDO) in an instance is an independent dominating set of with the additional property that if a vertex of obligation is in , then \emph{all} the others vertices of must also be in ; i.e., for all , either or (we say that \emph{respects} the obligations). Note that when each obligation of is a singleton, an \IDO is just an independent dominating set of that can be constructed with a greedy algorithm. Among other things, we show that determining if an instance has an \IDO is -complete, even if is a path (each vertex of exactly has two neighbours, except two extremities that have one), all the obligations are independent sets of and they all have the same constant size . We also show that the problem is also -complete, even if is composed of independent obligations each of size or if the diameter of is three. Our results clearly show that this problem is very difficult, even in extremely restricted instances. Hence, in a second part of the paper, we relax the condition to dominate all the vertices of . However, we show that determining if contains an independent set respecting the obligations and dominating at least vertices of is -complete, even if is a collection of disjoint paths and obligations are all independent sets of . On the positive side, we propose a greedy algorithm constructing a solution dominating at least vertices in any instance if all obligations of are independent sets of
Sur la complexité de tournées avec transitions obligatoires
No full textInternational audienceSur la complexité de tournées avec transitions obligatoire
- …
