1,720,962 research outputs found
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe 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
Modifying landscapes with penalties in iterative improvement for solving distributed constraint satisfaction problems.
Get PDFThe recent growth of the internet and distributed computing facilitated by the internet has created more opportunities for collaboration between individuals and organisations. These new forms of collaborative activity put groups of participants in situations where there is a shared objective but at the same time there is also a competition for resources by the participants. Hence, there is a need for participants to make compromises in order to reach agreement. Examples of such situations include collaborative scheduling in supply chain management or even individuals trying to agree on a schedule of meetings. The process of reaching agreement on any of such situations can be automated and the first step in such automation may be to model the situations as Distributed Constraint Problems (DisCSPs). DisCSPs formally describe distributed problems where each participant in the problem is represented by an agent, and the collection of agents have to collaborate in order to reach a satisfactory agreement (or find a solution) for a problem. Yokoo’s seminal work on distributed constraint solving introduced the idea of distributed approaches to solving such problems. And following that, research in the new field has come up with a variety of techniques, including combinatorial search and other forms of inference, for solving DisCSPs. In this study, we investigate an iterative improvement search approach for solving DisCSPS. Iterative improvement search has the advantage, over constructive search, of being able to converge quicker on large problems. But, it also has a propensity to converge to local optima in the process. Previous work on iterative improvement search (in centralised and distributed forms) has considered a variety of techniques for dealing with the problem of convergence on local optima. Prominent amongst these include introducing forms of randomisation or modifying the shapes of objective landscapes to guide a search out of plateaus. We present a new approach for dealing with local optima in distributed iterative improvement by modifying the cost landscape with two forms of penalties which are attached to individual domain values. We use one type of penalty to perturb solutions and the other to help agents learn about (and avoid) domain values frequently associated with local optima. We argue that, compared to other forms of landscape modification, our approach has a more dramatic effect on cost landscapes and hence, it is a more effective strategy for solving DisCSPs by iterative improvement search. Based on the idea of using two forms of penalties for dealing with local optima, we introduce three new distributed algorithms for solving DisCSPs where the objective is to find the first solution that satisfies all constraints simultaneously. First, we introduce the Distributed Penalty Driven Search (DisPeL) which is built around a two phased strategy of using penalties. We also introduced a stochastic variation of that algorithm (Stoch- DisPeL), which reduces some of DisPeL’s complexities and allows agents to randomly decide which of the two penalties to use when dealing with local optima. These two algorithms are specifically designed for scenarios where each agent represents a variable in a DisCSP, unlike our third algorithm (Multi-DisPeL) which extends some of the ideas from the earlier algorithms to DisCSPs where each agent represents multiple variables. We evaluated all three algorithms on a number of distributed constraint satisfaction problems including distributed graph colouring, distributed Boolean satisfiability, and random DisCSPs. We also compared them to state-of-the-art distributed iterative improvement algorithms. The results of the evaluations show that the penalty driven algorithms are effective alternatives; they solved more problems and typically incurred lower costs in the process
Variations on the Author
Get PDF“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Get PDFWe 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
Modifying landscapes with penalties in iterative improvement for solving distributed constraint satisfaction problems
No full textEThOS - Electronic Theses Online ServiceGBUnited Kingdo
Dispelling the Myths Behind First-author Citation Counts
Get PDFWe 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
koamabayili/VECTRON-author-checklist: VECTRON author checklist
No full textWe have done our best to complete the author checklist relating to the use of animals in the hut study. Note that the objective for the hut study was to evaluate the IRS treatment applications for residual efficacy against Anopheles mosquitoes, including the local An. coluzzii mosquito population. Cows were only used to attract mosquitoes into the huts and no tests were carried out directly on the cows. The author checklist is intended for use with studies where experiments are carried out on animals, which is why we have had such difficulty in completing this for the hut study, as many of the questions do not relate to how the cows were used
Author-wise bibliometric analysis based on entropy.
No full textAuthor-wise bibliometric analysis based on entropy.</p
- …
