309,588 research outputs found
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
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
Author, publisher and bookseller : a tripartite synergy in Nigerian book industry
No full textThis work is about the roles of Author, Publisher and Bookseller in Book development in
Nigeria. The paper started by delving into the history of Book Publishing in Nigeria after
which it proceeded by defining who an author, a publisher, and a bookseller is and
expatiated on the indispensable roles of these key actors in Nigerian Book Industry and in
the emerging Information Society. Furthermore, the various constraints to book
development were identified while the paper advised on how the Book Industry can be
further promoted in Nigeria. However, the paper concluded and made recommendations
on how the Book sector can help in enhancing scholarship in the country
Pebble guided Treasure Hunt in Plane
No full textWe study the problem of treasure hunt in a Euclidean plane by a mobile agent
with the guidance of pebbles. The initial position of the agent and position of
the treasure are modeled as special points in the Euclidean plane. The treasure
is situated at a distance at most from the initial position of the agent.
The agent has a perfect compass, but an adversary controls the speed of the
agent. Hence, the agent can not measure how much distance it traveled for a
given time. The agent can find the treasure only when it reaches the exact
position of the treasure. The cost of the treasure hunt is defined as the total
distance traveled by the agent before it finds the treasure. The agent has no
prior knowledge of the position of the treasure or the value of . An Oracle,
which knows the treasure's position and the agent's initial location, places
some pebbles to guide the agent towards the treasure. Once decided to move
along some specified angular direction, the agent can decide to change its
direction only when it encounters a pebble or a special point.
We ask the following central question in this paper:
``For given , What is cheapest treasure hunt algorithm if at most
pebbles are placed by the Oracle?"
We show that for , there does not exist any treasure hunt algorithm that
finds the treasure with finite cost. We show the existence of an algorithm with
cost for . For we have designed an algorithm that uses
many pebbles to find the treasure with cost , where . The second result shows the
existence of an algorithm with cost arbitrarily close to for sufficiently
large values of
Treasure game
No full textA prize is located at an unknown point on an island. In each period, each of n players searches a subset of the as yet unsearched portion of the island. If one player alone finds the prize he wins it and the game ends. Players have a per-period discount factor and a search cost proportional to area searched. Efficient symmetric Markov perfect equilibria are characterized when search is observable. Equilibria for n ≥ 2 exhibit two types of inefficiency: a tragedy of the commons (for small islands) and free riding (for large islands). For n ≥ 3, equilibrium properties are non-monotonic: players may be better off searching larger islands, and larger islands may take less time to search. When search is unobservable and players are sufficiently impatient, multi-player search can be efficient. The model is very general: applications include R&D races, team production, and extraction of exhaustible resources.uncertainty; search; R&D
Treasure Island": um tesouro inesgotável"
No full textpp. 119-160Embora as palavras de Coleridge se possam aplicar a qualquer
obra de arte, pareceram adequadas para o subtítulo deste trabalho,
por nele se pôr a hipótese de que Treasure Island não seja apenas uma
história de aventuras, mas que na narrativa de Stevenson haja "an
inexhaustible treasury", que os nossos olhos de tão habituados não
vêem. O objectivo que se pretende atingir é, pois, confirmar essa
hipótese. Propomo-nos, tal como os protagonistas de Treasure Island, ir
desenterrar o tesouro escondido. E, uma vez encontrado, analisá-lo,
aferindo o seu valor tanto na história da literatura infantil, onde tem,
sem dúvida, um lugar à parte, como na literatura inglesa
[Report to Chief J. E. Curry, by an unknown author #2]
No full textReport to Chief J. E. Curry, by an unknown author. The report contains a list of officers who gave depositions to the United States Attorney
[Report to Chief J. E. Curry, by an unknown author #1]
No full textReport to Chief J. E. Curry, by an unknown author. The report contains a list of officers who gave depositions to the United States Attorney
Lung metastasectomy in colorectal cancer: Is this surgery effective in prolonging life?
No full textThe commonest context in which pulmonary metastasectomy is performed is for recurrent colorectal cancer. With a more active policy of surveillance among cancer teams, ready access to ever faster CT scans and a willingness to perform further surgery to control recurrent cancer, the practice of pulmonary metastasectomy is increasing. In this pro/con debate the issues are explored. It is recognized by both sides that there is no randomized trial evidence on which to base the practice. The difference of opinion is whether there is sufficient evidence from very many case series of both pulmonary and hepatic metastasectomy on which to base current practice. The surgeon's view is that the weight of evidence from many follow-up studies is in favour of continuing this practice. The mathematician's view is that case selection could account for nearly all the observed results
- …
