305,194 research outputs found
Approximate strong edge-colouring of unit disk graphs
No full textItem does not contain fulltextWAOA 201
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
[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
Scheduling of Independent Dedicated Multiprocessor Tasks
No full textWe study the offline and online versions of the well known problem of scheduling a set of n independent multiprocessor tasks with prespecified processor allocations on a set of identical processors in order to minimize the makespan. Recently, in [13], it has been proven that in the case when all tasks have unit processing time the problem cannot be approximated within a factor of m 2 e , neither for some e > 0, unless P= NP; nor for any e > 0, unless NP=ZPP. For this special case we give a simple algorithm based on the classical first-fit technique. We analyze the algorithm for both tasks arrive over time and tasks arrive over list online scheduling versions, and show that its competitive ratio is bounded by 2 m and 2 m+1, respectively. Here we also use some preliminary results on (vertex) coloring of k-tuple graphs. For the case of arbitrary processing times, we show that any algorithm which uses the first-fit technique cannot be better than m competitive. Then, by using our split-round technique, we give a 3 m-approximation algorithm for the offline version of the problem. Finally, by using some ideas from [21], we adapt the algorithm to the online case, in the paradigm of tasks arriving over time in which the existence of a task is unknown until its release date, and show that its competitive ratio is bounded by 6 m. Due to the conducted experimental results, we conclude that our algorithms can perform well in practice
Mining e-mail content for author identification forensics
No full textWe describe an investigation into e-mail content mining for author identification, or authorship attribution, for the purpose of forensic investigation. We focus our discussion on the ability to discriminate between authors for the case of both aggregated e-mail topics as well as across different email topics. An extended set of e-mail document features including structural characteristics and linguistic patterns were derived and, together with a Support Vector Machine learning algorithm, were used for mining the e-mail content. Experiments using a number of e-mail documents generated by different authors on a set of topics gave promising results for both aggregated and multi-topic author categorisation
Minimizing average flow time on unrelated machines
No full textWe give an O(Q)-approximation for minimizing average flow time on unrelated machines, where Q is the maximum number of different process times on a machine. Consequently, the ratio is O(logP/loge) if all process times are a power of e. Here, P is the ratio of the maximum and minimum process time of a job
- …
