1,720,957 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
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
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
Magneto-Rheological Fluid Device as Artificial Feel Force System on Aircraft Control Stick
Get PDFThe conventional feel system in any aircraft occupies large space in the cockpit and has complicated designs. The primary objective of this research is to develop an artificial feel force system that can overcome some drawbacks of the current feel force system. A novel feel system using magneto-rheological (MR) fluid is constructed to precisely control the shear stress under the magnetic field. To validate the functionality of the MR artificial feel system, the final system is fabricated and multiple tests are performed to acquire force-velocity characteristics that are compared to the mathematical model derived. In addition, the reference model of the force feedback control is simulated for the feel force application. Both experimental and simulation results are compared to validate the derived system model. The system response time and the sampling rates are evaluated and compared to the conventional system at the end. It is concluded from the research that the developed artificial feel system can precisely control and acts as a fail proof system when incorporated with a modern fly-by-wire aircraft system
Recommended from our members
Distributed fault tolerant distance computation in graphs : algorithms and lower bounds
Get PDFDistributed systems are fundamental to modern computing at scale, with a wide variety of applications, including computer networks, cloud computing, big data computing and blockchains. Fault tolerance is essential in distributed systems to manage failures gracefully and ensure reliability. Routing messages is an important problem in distributed networks, and efficient fault-tolerant routing requires methods to maintain shortest distances between nodes when faults occur.
The goal of this thesis is to design and analyze efficient distributed algorithms for these fault-tolerant, distance-related computations, and to develop bounds on the limits to the efficiency of such algorithms by proving unconditional lower bounds.
In this thesis, we develop distributed algorithms and lower bounds for the Replacement Paths problem, which addresses a shortest path between a pair of specific vertices in the event of an edge failure on the original path, and the Distance Sensitivity Oracle problem, which pertains to shortest paths between any pair of vertices when any single edge fails. Despite their importance in the distributed setting and extensive literature in the sequential setting, prior to this thesis, little was known about the distributed round complexity of these problems. In many cases, we obtain near optimal bounds for our problems.
The sequential fine-grained complexity of these fault-tolerant path problems is closely related to other fundamental graph problems, such as the Minimum Weight Cycle (MWC). We extend our investigation to these cycle problems, studying their exact and approximate distributed round complexity, including a novel sublinear 2-approximation algorithm for directed MWC and an algorithm that closes a longstanding gap for 2-approximation of undirected unweighted MWC (girth).
Together, our results display a rich landscape of distributed round complexity for exact and approximate versions of these problems in different graph types: directed or undirected, weighted or unweighted.
Finally, in addition to the distributed setting, we study algorithms for fault-tolerant distance problems in other models of parallel computation, such as PRAM (Parallel RAM).Computer Scienc
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
- …
