131,254 research outputs found
Demonstration of an inductively coupled ring trap for cold atoms
No full textWe report the first demonstration of an inductively coupled magnetic ring trap for cold atoms. A uniform, ac magnetic field is used to induce current in a copper ring, which creates an opposing magnetic field that is time-averaged to produce a smooth cylindrically symmetric ring trap of radius 5 mm. We use a laser-cooled atomic sample to characterize the loading efficiency and adiabaticity of the magnetic potential, achieving a vacuum-limited lifetime in the trap. This technique is suitable for creating scalable toroidal waveguides for applications in matter-wave interferometry, offering long interaction times and large enclosed areas
Graph Guessing Games and Non-Shannon Information Inequalities
No full textGuessing games for directed graphs were introduced by Riis [12] for studying multiple unicast network coding problems. In a guessing game, the players toss generalised dice and can see some of the other outcomes depending on the structure of an underlying digraph. They later guess simultaneously the outcome of their own die. Their objective is to find a strategy which maximises the probability that they all guess correctly. The performance of the optimal strategy for a graph is measured by the guessing number of the digraph.
In [3], Christofides and Markstrom studied guessing numbers of undirected graphs and defined a strategy which they conjectured to be optimal. One of the main results of this paper is a disproof of this conjecture.
The main tool so far for computing guessing numbers of graphs is information theoretic inequalities. The other main result of the paper is that Shannon's information inequalities, which work particularly well for a wide range of graph classes, are not sufficient for computing the guessing number.
Finally we pose a few more interesting questions some of which we can answer and some which we leave as open problems
MeSH term explosion and author rank improve expert recommendations
No full textInformation 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
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
"Closing the R&D Gap, Evaluating the Sources of R&D Spending"
No full textBoth 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.
Group contest success functions
No full textThis paper extends the axiomatic characterization of contest success functions of Skaperdas (1996) and Clark and Riis (1998) to contests between groups. – Contest ; conflict ; axiom ; group -- Eine contest success function beschreibt, wie in einem Wettkampf die Gewinnwahrscheinlichkeiten von den Einsätzen der Beteiligten abhängen. Dieser Aufsatz verallgemeinert die auf Skaperdas (1996) und Clark und Riis (1998) zurückgehende axiomatische Fundierung von contest success functions, indem er Wettkämpfe zwischen Gruppen untersucht.
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
Scholarly Communication and Publishing Lunch and Learn Talk #11: The ULS Open Access Author Fee Fund
No full textAt 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
- …
