119,445 research outputs found
Pandemonium and critique
No full textIntroduction to Parallax 30(2), edited by Margarita Palacios and Lasse Thomassen
Beyond the Richter-Thomassen conjecture
No full textIf two closed Jordan curves in the plane have precisely one point in common, then it is called a touching point-All other intersection points are called crossing points. The main result of this paper is a Crossing Lemma for closed curves: In any family of n pairwise intersecting simple closed curves in the plane, no three of which pass through the same point, the number of crossing points exceeds the number of touching points by a factor of fK(loglogn)1/8). As a corollary, we prove the following long-standing conjecture of Richter and Thomassen: The total number of intersection points between any n pairwise intersecting simple closed curves in the plane, no three of which pass through the same point, is at least (1 - o(l))n2
E. Thomassen et L. Painchaud, Le Traité tripartite (NH I, 5), Québec, Les Presses de l'Université Laval, 1989, (Bibliothèque copte de Nag Hammadi, Section « Textes » 19)
No full textBertrand Daniel A. E. Thomassen et L. Painchaud, Le Traité tripartite (NH I, 5), Québec, Les Presses de l'Université Laval, 1989, (Bibliothèque copte de Nag Hammadi, Section « Textes » 19). In: Revue d'histoire et de philosophie religieuses, 72e année n°3, Juillet-septembre 1992. pp. 330-331
E. Thomassen et L. Painchaud, Le Traité tripartite (NH I, 5), Québec, Les Presses de l'Université Laval, 1989, (Bibliothèque copte de Nag Hammadi, Section « Textes » 19)
No full textBertrand Daniel A. E. Thomassen et L. Painchaud, Le Traité tripartite (NH I, 5), Québec, Les Presses de l'Université Laval, 1989, (Bibliothèque copte de Nag Hammadi, Section « Textes » 19). In: Revue d'histoire et de philosophie religieuses, 72e année n°3, Juillet-septembre 1992. pp. 330-331
Minimizing the oriented diameter of a planar graph
No full textWe consider the problem of minimizing the diameter of an orientation of a planar graph. A result of Chvátal and Thomassen shows that for general graphs, it is NP-complete to decide whether a graph can be oriented so that its diameter is at most two. In contrast to this, for each constant l, we describe an algorithm that decides if a planar graph G has an orientation with diameter at most l and runs in time O(c|V|), where c depends on l
Going Beyond Counting First Authors in Author Co-citation Analysis
No full textThe 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
Square Dancing with the Stars to Enhance Dynamic Hirschman Linkages?
No full textIn this Presidential Address, the author takes the reader on a reconnaissance of his life and time as a regional scientist. He points out scenery he found scintillating along the way, hoping that some may pick up the banner and chew on a few of the ideas for a while. He suggests a revisit to Albert O. Hirschman’s notion of key sectors and more empirical analysis related to Marcus Berliant’s and Masahisa Fujita’s notion of knowledge creation and transfer.Presidential Address, San Antonio, Texas, March 29, 2014 (53rd Meetings of the Southern Regional Science Association
Appropriate Similarity Measures for Author Cocitation Analysis
No full textWe 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
Letter from unknown writer to Jesse L. Boyce
No full textLetter to Jesse L. Boyce from unknown author (possibly Jack) about the investigation into the powder magazine located in the Grand Canyon. Some personal news is included in the letter such as the writer's marriage to the daughter of C.A. Taylor, former Supervisor of Cochise County
Dispelling the Myths Behind First-author Citation Counts
No full textWe 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
- …
