1,720,956 research outputs found
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
Deterministic and robust scheduling of multiple projects with multiple skills in railway maintenance sites
No full textLes technicentres industriels de SNCF (TI) réalisent la maintenance lourde des rames (niveau 4 et 5) comprenant aussi la réparation des pièces. Les gammes opératoires varient d’un train à un autre et la majorité des opérations sont réalisées par des agents de maintenance. Les aléas rencontrés dans ce processus sont multiples (travaux supplémentaires, estimation incertaine des durées opératoires etc.). Cette thèse s’intéresse à la modélisation et à la résolution du problème d’ordonnancement des opérations de maintenance dans les technicentres industriels de SNCF en tenant compte de différentes incertitudes. Le problème est modélisé comme un problème d’ordonnancement de projets multiples à contraintes de ressources avec compétences multiples. Une formulation mathématique est proposée et un nouvel algorithme mémétique est mise en œuvre pour résoudre des instances industrielles de grande taille. Pour le problème déterministe, deux fonctions objectifs, la somme pondérée des durées des projets et la somme pondérée des retards des projets, sont considérées. L’algorithme mémétique est comparé à deux heuristiques et trois métaheuristiques. L’efficacité de l’approche proposée est validée à la fois sur des instances industrielles et des instances de la littérature. Pour le problème robuste, l’algorithme mémétique est étendu afin d’intégrer les incertitudes et de maximiser la somme pondérée des niveaux de service des projets. Ce critère correspond à la maximisation de la somme pondérée des probabilités de respecter les délais clients. Une nouvelle approche de génération de scénarios, qui sont limités par un budget d’incertitude, est proposée. Pour générer ces scénarios, des données historiques sont utilisées. La pertinence de notre approche d’ordonnancement robuste est validée sur dix instances industrielles. Les travaux de recherche menées dans cette thèse sont industrialisés et un outil d’aide à la décision est mise en œuvre pour les technicentres industriels de SNCF.The heavy maintenance centers of SNCF carry out heavy maintenance of rolling stock (levels 4 and 5), including component repairs. The operating procedures vary from one rolling stock unit to another, and most operations are carried out by maintenance agents. The uncertainties encountered in this process are numerous (additional work, uncertain estimation of operating times, etc.). This thesis focuses on modeling and solving the scheduling problem of maintenance operations, considering various uncertainties. The problem is modeled as a Multi-Skill Resource-Constrained Multi-Project Scheduling Problem. A mathematical formulation is proposed, and a new memetic algorithm is implemented to solve large-scale industrial instances. For the deterministic problem, two objective functions are independently considered: (i) Minimization of the sum of the weighted tardiness of the projects and (ii) Minimization of the sum of the weighted duration of the projects. The memetic algorithm is compared to two heuristics and three metaheuristics. The effectiveness of the proposed approach is validated on both industrial instances and instances from the literature. The memetic algorithm is extended to integrate uncertainties and maximize the sum of the weighted tardiness service level of the projects. This criterion corresponds to maximizing the probabilities of meeting customer deadlines. A new scenario generation approach, limited by different uncertainty budgets, is proposed. To generate these scenarios, real historical data are used. The relevance of our robust scheduling approach is validated on ten industrial instances. The research conducted in this thesis is industrialized, and a decision support tool is implemented for the heavy maintenance centers of SNCF
Dispelling the Myths Behind First-author Citation Counts
Get PDFWe 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
Ordonnancement déterministe et robuste de projets multiples avec compétences multiples dans les chantiers de maintenance ferroviaire
No full textThe heavy maintenance centers of SNCF carry out heavy maintenance of rolling stock (levels 4 and 5), including component repairs. The operating procedures vary from one rolling stock unit to another, and most operations are carried out by maintenance agents. The uncertainties encountered in this process are numerous (additional work, uncertain estimation of operating times, etc.). This thesis focuses on modeling and solving the scheduling problem of maintenance operations, considering various uncertainties. The problem is modeled as a Multi-Skill Resource-Constrained Multi-Project Scheduling Problem. A mathematical formulation is proposed, and a new memetic algorithm is implemented to solve large-scale industrial instances. For the deterministic problem, two objective functions are independently considered: (i) Minimization of the sum of the weighted tardiness of the projects and (ii) Minimization of the sum of the weighted duration of the projects. The memetic algorithm is compared to two heuristics and three metaheuristics. The effectiveness of the proposed approach is validated on both industrial instances and instances from the literature. The memetic algorithm is extended to integrate uncertainties and maximize the sum of the weighted tardiness service level of the projects. This criterion corresponds to maximizing the probabilities of meeting customer deadlines. A new scenario generation approach, limited by different uncertainty budgets, is proposed. To generate these scenarios, real historical data are used. The relevance of our robust scheduling approach is validated on ten industrial instances. The research conducted in this thesis is industrialized, and a decision support tool is implemented for the heavy maintenance centers of SNCF.Les technicentres industriels de SNCF (TI) réalisent la maintenance lourde des rames (niveau 4 et 5) comprenant aussi la réparation des pièces. Les gammes opératoires varient d’un train à un autre et la majorité des opérations sont réalisées par des agents de maintenance. Les aléas rencontrés dans ce processus sont multiples (travaux supplémentaires, estimation incertaine des durées opératoires etc.). Cette thèse s’intéresse à la modélisation et à la résolution du problème d’ordonnancement des opérations de maintenance dans les technicentres industriels de SNCF en tenant compte de différentes incertitudes. Le problème est modélisé comme un problème d’ordonnancement de projets multiples à contraintes de ressources avec compétences multiples. Une formulation mathématique est proposée et un nouvel algorithme mémétique est mise en œuvre pour résoudre des instances industrielles de grande taille. Pour le problème déterministe, deux fonctions objectifs, la somme pondérée des durées des projets et la somme pondérée des retards des projets, sont considérées. L’algorithme mémétique est comparé à deux heuristiques et trois métaheuristiques. L’efficacité de l’approche proposée est validée à la fois sur des instances industrielles et des instances de la littérature. Pour le problème robuste, l’algorithme mémétique est étendu afin d’intégrer les incertitudes et de maximiser la somme pondérée des niveaux de service des projets. Ce critère correspond à la maximisation de la somme pondérée des probabilités de respecter les délais clients. Une nouvelle approche de génération de scénarios, qui sont limités par un budget d’incertitude, est proposée. Pour générer ces scénarios, des données historiques sont utilisées. La pertinence de notre approche d’ordonnancement robuste est validée sur dix instances industrielles. Les travaux de recherche menées dans cette thèse sont industrialisés et un outil d’aide à la décision est mise en œuvre pour les technicentres industriels de SNCF
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
Author-wise bibliometric analysis based on entropy.
No full textAuthor-wise bibliometric analysis based on entropy.</p
- …
