1,721,016 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
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
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
Numerical algorithms for the Coxeter spectral analysis of bigraphs
No full textCelem rozprawy jest rozwiązanie klasy problemów algorytmiczno-obliczeniowych (sformułowanych w pracach [48]–[50], [69]–[76]) występujących w spektralnej klasyfikacji Coxetera-Grama spójnych dodatnich prostych grafów oznakowanych, a także spójnych dodatnich krawędziowo-dwudzielnych grafów ∆ bez pętli (w skrócie bigrafów) zdefiniowanych w [70].
Rozdziały 1 oraz 2 poświęcone są krótkiemu wprowadzeniu do spektralnej analizy Coxetera grafów oznakowych oraz klasy nieujemnych grafów krawędziowo-dwudzielnych ∆ bez pętli a także podaniu motywacji do badań nad problemami spektralnej klasyfikacji Coxetera skończonych bigrafów.
Przypomnijmy, że z dowolnym bigrafem ∆ bez pętli o skończonym zbiorze ponumerowanych n >= 1 wierzchołków, stowarzysza się jego zespolone spektrum Coxetera specc_∆ ⊆ C, tj. spektrum Z-odwracalnej macierzy Coxetera Cox_∆ := −Gˇ_∆ · Gˇ_∆^−tr ∈ M_n(Z), gdzie Gˇ_∆ ∈ M_n(Z) jest niesymetryczną macierzą Grama bigrafu ∆.
Jednym z celów rozprawy jest podanie klasyfikacji dodatnich grafów krawędziowo-dwudzielnych z dokładnością do silnej Z-kongruencji Grama ∆ ≈z ∆, zdefiniowanej w pracy [70] następująco:
“∆ ≈z ∆' ⇐⇒ Gˇ_∆' = B^tr · Gˇ_∆ · B, dla pewnej macierzy B ∈ Gl(n, Z)”.
Innym z celów rozprawy jest zbudowanie algorytmów symbolicznych i numerycznych obliczających macierz B ∈ Gl(n, Z) definiującą Z-kongruencję Grama ∆ ≈z ∆', dla dowolnej pary bigrafów spełniających relację ∆ ≈z ∆' (lub takich, dla których zachodzi równość specc_∆ = specc_∆' ich spektrów Coxetera).
W rozdziale 3 przedstawiamy narzędzia techniczne i algorytmiczne pozwalające zredukować rozważane problemy spektralnej klasyfikacji Coxetera-Grama do badania analogicznych problemów dla pewnego skończonego zbioru Mor_D ⊆ M_n(Z) wszystkich morsyfikacji macierzowych A (zdefiniowanego w pracach [69]–[71]) dla ustalonego jednorodnego diagramu Dynkina D ∈ {A_n , n >= 1, D_n , n >= 4, E6 , E7, E8}. Zbiór Mor_D jest niezmienniczym podzbiorem zbioru macierzy M_n(Z) względem działania ∗: M_n(Z) × Gl(n, Z)_D → M_n(Z), (A, B) → A ∗ B := B^tr ·A·B ograniczonego do skończonej podgrupy Gl(n, Z)_D grupy liniowej Gl(n, Z), zwanej grupą izotropii diagramu D (zobacz [70]). Jednym z ważniejszych wyników tego rozdziału są autorskie algorytmy obliczające zbiór Mor_D, grupę izotropii Gl(n, Z)_D oraz zbiór Gl(n, Z)_D-orbit w Mor_D, dla dowolnego jednorodnego diagramu Dynkina D, a także wyniki tych obliczeń.
Jednym z głównych osiągnięć tej rozprawy jest przedstawiona w rozdziale 4 pełna klasyfikacja spójnych dodatnich grafów krawędziowo-dwudzielnych ∆ o co najwyżej 9-ciu wierzchołkach, z dokładnością do silnej Z-kongruencji Grama ∆ ≈z ∆'. Udowodnione twierdzenie klasyfikacyjne orzeka, że każdy taki bigraf jest Z-kongruentny z jednym z 26 bigrafów klasyfikujących.
Rozdział 5 zawiera konstrukcje nieskończonych serii morsyfikacji A ∈ Mor_A_n diagramu Dynkina A_n, o parami różnych spektrach Coxetera, dla n >= 1.
W rozdziałach 6 oraz 7 przedstawiamy ideę redukcji badanych problemów klasyfikacyjnych do konstrukcji klasy symbolicznych algorytmów toroidalno-oczkowych konstruujących macierze B definiujące silną Z-kongruencję Grama ∆ ≈z ∆'. W szczególności, dla klasy nieskończonych serii morsyfikacji diagramu Dynkina D = A_n budujemy algorytmy symboliczne konstruujące, dla dowolnej pary morsyfikacji A, A' ∈ Mor_D leżących w tej samej Gl(n, Z)_D-orbicie, pewną macierz B ∈ M_n(Z) taką, że A' = A ∗ B^tr.
Główne wyniki rozprawy zostały opublikowane w artykułach [8], [9], [24], [27]–[31].The aim of this thesis is to solve class of the algorithmic and computing problems (formulated in [48]–[50], [69]–[76]) for Coxeter-Gram spectral classification of the connected positive simple signed graphs and connected positive loop-free edge-bipartite graphs ∆ (bigraphs, in short) defined in [70].
The first and the second chapter are devoted to short introduction to the Coxeter spectral analysis of the signed graphs and the class of the loop-free non-negative edge-bipartite graphs ∆. Moreover, we present a motivation for the study of Coxeter spectral analysis problems of the finite edge-bipartite graphs.
Recall that, with any loop-free bigraph ∆ with n >= 1 vertices numbered by the integers, we associate the (complex) Coxetera spectrum specc_∆ ⊆ C, i.e., the spectrum of the Z-invertible Coxeter matrix Cox_∆ := −Gˇ_∆ · Gˇ_∆^−tr ∈ M_n(Z), where Gˇ_∆ ∈ M_n(Z) is the non-symmetric Gram matrix of ∆.
One of the aims of this thesis is to classify positive edge-bipartite graphs, up to the Gram Z-bilinear congruence defined in [70] as follows
“∆ ≈z ∆' ⇐⇒ Gˇ_∆' = B^tr · Gˇ_∆ · B, for some B ∈ Gl(n, Z)”.
Another issue of this thesis is to construct symbolic and numeric algorithms for computing matrix B ∈ Gl(n, Z) defining the Gram Z-bilinear congruence ∆ ≈z ∆', for any pair of edge-bipartite graphs such that ∆ ≈z ∆' (or their Coxeter spectra equality holds specc_∆ = specc_∆').
In the third chapter we present technical and algorithmic tools that allows a reduction of the Coxeter-Gram spectral classification problems to the analogue problems for some finite set Mor_D ⊆ M_n(Z) of matrix morsifications A (defined in [69]–[71]) of the fixed simply laced Dynkin diagram D ∈ {A_n , n >= 1, D_n , n >= 4, E6 , E7, E8}. Set Mor_D is invariant subset of M_n(Z) under the action ∗: M_n(Z) × Gl(n, Z)_D → M_n(Z), (A, B) → A ∗ B := B^tr ·A·B limited to isotropy group Gl(n, Z)_D of the diagram D, that is a finite subgroup of the general linear group Gl(n, Z) (see [70]). Main results of this chapter are our algorithms computing the set Mor_D, isotropy group Gl(n, Z)_D and the set of Gl(n, Z)_D-orbits in Mor_D, for any simply laced Dynkin diagram D. We also present results of these computer calculations.
One of the main results of this thesis is a complete classification of positive connected edge-bipartite graphs with at most nine vertices, up to the Gram Z-bilinear congruence ∆ ≈z ∆', presented in the fourth chapter. It follows from our classification theorem that any of those bigraphs are Z-congruent with one of the 26 classifying bigraphs presented in chapter four.
The fifth chapter contains constructions of several infinite series of matrix morsification A ∈ Mor_A_n for the diagram A_n, with pairwise different Coxeter spectra, for n >= 1.
In the six and the seventh chapter we present an idea of a reduction from studied classification problems to the build class of symbolic toroidal mesh algorithms for computing matrix B ∈ Gl(n, Z)_D defining the Gram Z-bilinear congruence ∆ ≈z ∆'. In particular, for a class of the infinite series of matrix morsification for Dynkin diagram D = A_n we build symbolic algorithms constructing some matrix B ∈ M_n(Z) such that A' = A ∗ B^tr, for any pair of morsifications
A, A' ∈ Mor_D, that lie in the same Gl(n, Z)_D-orbit.
The main results of this thesis have been published in the articles [8], [9], [24], [27]–[31]
- …
