130,379 research outputs found
Characterizing core stability with fuzzy games
Shellshear E. Characterizing core stability with fuzzy games. Working Papers. Institute of Mathematical Economics. Vol 410. Bielefeld: Universität Bielefeld; 2009.This paper investigates core stability of cooperative, TU games via a fuzzy extension of the totally balanced cover of a TU game. The stability of the core of the fuzzy extension of a game, the concave extension, is shown to reflect the core stability of the original game and vice versa. Stability of the core is then shown to be equivalent to the existence of an equilibrium of a certain correspondence
On core stability and extendability
Shellshear E. On core stability and extendability. Working Papers. Institute of Mathematical Economics. Vol 387. Bielefeld: Universität Bielefeld; 2007.This paper investigates conditions under which the core of a TU cooperative game is stable. In particular the author extends the idea of extendability to find new conditions under which the core is stable. It is also shown that these new conditions are not necessary for core stability
Fast exact shortest distance queries for massive point clouds
S.28-37This paper describes a new efficient algorithm for the rapid computation of exact shortest distances between a point cloud and another object (e.g. triangulated, point-based, etc.) in three dimensions. It extends the work presented in Eriksson and Shellshear (2014) where only approximate distances were computed on a simplification of a massive point cloud. Here, the fast computation of the exact shortest distance is achieved by pruning large subsets of the point cloud known not to be closest to the other object. The approach works for massive point clouds even with a small amount of RAM and is able to provide real time performance. Given a standard PC with only 8GB of RAM, this resulted in real-time shortest distance computations of 15 frames per second for a point cloud having 1 billion points in three dimensions.8
Characterizing core stability with fuzzy games
This paper investigates core stability of cooperative, TU games via a fuzzy extension of the totally balanced cover of a TU game. The stability of the core of the fuzzy extension of a game, the concave extension, is shown to reflect the core stability of the original game and vice versa. Stability of the core is then shown to be equivalent to the existence of an equilibrium of a certain correspondence.cooperative game, core, stable set, fuzzy coalition, fuzzy game, core stability
MeSH term explosion and author rank improve expert recommendations
Information overload is an often-cited phenomenon that reduces the productivity, efficiency and efficacy of scientists. One challenge for scientists is to find appropriate collaborators in their research. The literature describes various solutions to the problem of expertise location, but most current approaches do not appear to be very suitable for expert recommendations in biomedical research. In this study, we present the development and initial evaluation of a vector space model-based algorithm to calculate researcher similarity using four inputs: 1) MeSH terms of publications; 2) MeSH terms and author rank; 3) exploded MeSH terms; and 4) exploded MeSH terms and author rank. We developed and evaluated the algorithm using a data set of 17,525 authors and their 22,542 papers. On average, our algorithms correctly predicted 2.5 of the top 5/10 coauthors of individual scientists. Exploded MeSH and author rank outperformed all other algorithms in accuracy, followed closely by MeSH and author rank. Our results show that the accuracy of MeSH term-based matching can be enhanced with other metadata such as author rank
Going Beyond Counting First Authors in Author Co-citation Analysis
The 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
"Closing the R&D Gap, Evaluating the Sources of R&D Spending"
Both spending and tax policies have been implemented in the United States with the goal of stimulating private sector research and development (R&D). Karier questions whether current R&D policy, especially the research and experimentation tax credit, can contribute to closing the gap between nondefense expenditures on R&D in the United States and such expenditures in other countries, such as Japan and Germany. He also explores possible changes to our current R&D policy to make it more effective.
Dispelling the Myths Behind First-author Citation Counts
We 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
Scholarly Communication and Publishing Lunch and Learn Talk #11: The ULS Open Access Author Fee Fund
At the May 2014 talk, you will learn about the ULS Open Access Author Fee Fund--what it is, why we do it, how it works, and how the program is going so far
- …
