1,720,959 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
Approximation in Batch- und Multiprozessor-Scheduling
No full textThis thesis is about scheduling problems where jobs arrive over time. Depending on the problem, we consider the case that each job has a deadline, or the relaxation that the sum of flow times or completion times need to be minimized. Since most of the discussed problems are NP-hard, the goal is to find polynomial time algorithms with provable approximation guarantee, preferably in an on-line setting.
In the first part of this thesis, we consider batch scheduling problems for the case that each job has a deadline, and hence two jobs may be added to the same batch if their due intervals intersect. We first present a framework that unifies all batch cost structures discussed in this part. For instance max-batching, where the cost of each batch is the maximum weight of any contained job. We show that max-batching is strongly NP-hard in this context if the size of each batch is additionally restricted by a constant capacity constraint, and we also give a polynomial time approximation scheme (PTAS) for this case. Moreover, we consider a minmax-variant of max-batching which finds application in the area of data aggregation. We show that this variant is strongly NP-hard as well, and we present a quasi-polynomial time approximation scheme (QPTAS) and moreover a PTAS for the case that the due interval lengths are constants. Finally, we show that the closely related batch cost structure used in joint replenishment results in an APX-hard problem, which is hence not likely to admit an approximation scheme, but we show that it admits a randomized 5/3-approximation algorithm.
In the second part of this thesis, multiprocessor scheduling problems are discussed. We give the first proof that the competitive ratio of the well-known algorithm SRPT is strictly smaller than 2 for completion time scheduling on identical machines. Specifically, we give the upper bound 1.86. Since it is harder to find approximation guarantees for flow time scheduling, we investigate this case in the context of speed-scaling, where it is allowed to arbitrarily increase the speed of each processor subject to some reasonable penalty. For this model, we present a general approach to transform single processor algorithms into multiprocessor algorithms. This yields new or improved constant approximation guarantees for basically all variants of speed-scaled multiprocessor scheduling.Diese Dissertation beschäftigt sich mit Schedulingproblemen mit unterschiedlichen Einlastzeiten (engl. release times), d.h. die Aufträge (engl. jobs) erscheinen nacheinander. Abhängig von dem betrachteten Problem untersuchen wir den Fall, dass jeder Auftrag entweder eine Fertigstellungstermin (engl. deadline) besitzt oder die Relaxierung, dass die Summe der Flusszeiten (engl. flow times) oder Fertigstellungszeiten (engl. completion times) minimiert werden soll. Da die meisten der betrachteten Probleme NP-hart sind, ist es unser Ziel, Algorithmen zu enwickeln, die in Polynomialzeit Lösungen mit beweisbarer Approximationsgüte liefern, und dies möglichst sogar dann, wenn die Aufträge on-line erscheinen.
Der erste Teil dieser Dissertation beschäftigt sich mit Batch-Schedulingproblemen. Wir betrachten den Fall, dass jeder Auftrag über einen Fertigstellungstermin verfügt, und sich zwei Jobs nur dann in denselben Batch packen lassen, wenn ihre entsprechenden Verfügbarkeitsintervalle (engl. due intervals) überlappen. Wir erläutern zuerst ein einheitliches Rahmenwerk, welches alle betrachteten Batch-Kostenstrukturen enthält. Ein prominentes Beispiel ist max-Batching, d.h., die Kosten eines Batches ist das maximale Gewicht aller Aufträge, welche in diesem Batch enthalten sind. Wir zeigen, dass max-Batching in diesem Zusammenhang NP-hart ist falls die Größe jedes Batches durch eine konstante Kapazität beschränkt ist und präsentieren ausserdem ein Polynomialzeit-Approximationsschema (PTAS) für diesen Fall. Danach betrachten wir eine minmax-Variante von max-Batching, welche bei der Aggregation von Daten Verwendung findet, und zeigen, dass auch dieses Problem NP-hart ist. Ausserdem präsentieren wir auch hier eine Quasi-Polynomialzeit-Approximationsschema (QPTAS) und außerdem ein PTAS für den Fall, dass die Längen der Verfügbarkeitsintervalle konstant beschränkt sind. Zuletzt zeigen wir, dass die verwandte Batch-Kostenstruktur des Joint Replenishment ein APX-hartes Problem ergibt, welches damit wahrscheinlich kein Approximationsschema zuläßt. Wir formulieren aber einen randomisierten 5/3-Approximationsalgorithmus.
Der zweite Teil dieser Dissertation befasst sich mit Schedulingproblemen auf mehreren Prozessoren. Wir präsentieren den ersten Beweis, dass die Kompetitivität des bekannten Algorithmus SRPT echt kleiner ist als 2 falls die Summe der Fertigstellungszeiten minimiert werden soll. Speziell erhalten wir die obere Schranke 1.86. Da es schwieriger ist, solche Approximationsgarantien für die Minimierung der Summe der Flusszeiten zu erhalten, betrachten wird diesen Fall für Prozessoren mit skalierbaren Geschwindigkeiten (engl. speed-scaled processors), welche unter Rücksichtnahme einer sinnvollen Kostensanktion beliebig erhöht werden dürfen. Für dieses Modell präsentieren wir eine allgemeine Methode, um aus einen beliebigen Algorithmen für einen einzelnen Prozessor einen Algorithmus für mehrere Prozessoren zu erhalten. Dies liefert neue oder verbesserte Kompetitivitäten für alle wesentlichen Varianten
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
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
Author Under Sail The Imagination of Jack London, 1893-1902
No full textIn Author Under Sail, Jay Williams offers the first complete literary biography of Jack London as a professional writer engaged in the labor of writing. It examines the authorial imagination in London's work, the use of imagination in both his fiction and nonfiction, and the ways he defined imagination in the creative process in his business dealings with his publishers, editors, and agents. In this first volume of a two-volume biography, Williams traverses the years 1893 to 1902, from London's "Story of a Typhoon" to The People of the Abyss. The Jack London who emerges in the pages of Author Under Sail is a writer whose partnership with publishers, most notably his productive alliance with George Brett of Macmillan, was one of the most formative in American literary history. London pioneered many author models during the heyday of realism and naturalism, blurring the boundaries of these popular genres by focusing on absorption and theatricality and the representation of the seen and unseen. London created an impassioned, sincere, and extremely personal realism unlike that of other American writers of the time. Author Under Sail is a literary tour de force that reveals the full range of London as writer, creative citizen, and entrepreneur at the same time it sheds light on the maverick side of machine-age literature.Intro -- Title Page -- Copyright Page -- Dedication -- Contents -- Acknowledgments -- Introduction -- 1. Spirit Truth -- 2. From Absorption to Theatricality and Back Again -- 3. "I Will Build a New Present" -- 4. Sons as Authors -- 5. Fathers as Publishers -- 6. The Daughter as Author -- 7. Lovers as Authors -- 8. At Sea with the Family -- 9. Yellow News, Yellow Stories -- 10. The Return Home -- Notes -- Bibliography -- Index -- About Jay WilliamsIn Author Under Sail, Jay Williams offers the first complete literary biography of Jack London as a professional writer engaged in the labor of writing. It examines the authorial imagination in London's work, the use of imagination in both his fiction and nonfiction, and the ways he defined imagination in the creative process in his business dealings with his publishers, editors, and agents. In this first volume of a two-volume biography, Williams traverses the years 1893 to 1902, from London's "Story of a Typhoon" to The People of the Abyss. The Jack London who emerges in the pages of Author Under Sail is a writer whose partnership with publishers, most notably his productive alliance with George Brett of Macmillan, was one of the most formative in American literary history. London pioneered many author models during the heyday of realism and naturalism, blurring the boundaries of these popular genres by focusing on absorption and theatricality and the representation of the seen and unseen. London created an impassioned, sincere, and extremely personal realism unlike that of other American writers of the time. Author Under Sail is a literary tour de force that reveals the full range of London as writer, creative citizen, and entrepreneur at the same time it sheds light on the maverick side of machine-age literature.Description based on publisher supplied metadata and other sources.Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, YYYY. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries
- …
