1,720,956 research outputs found
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe 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
Full text link“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
Recommended from our members
ALGORITHMS FOR PATH PLANNING IN 3D PRINTING
Full text linkIn my thesis we have addressed the questions on path planning in additive manufacturing(AM) by tackling problems related to geometry and tool path traversal in a graphicalsetting. By using graphical models for tool path planning, we can ensure the required mechanicalproperties are satisfied by imposing appropriate constraints. The overall goal isto characterize the mathematical aspects of the AM problem and to develop efficient algorithmswith provable guarantees of performance and quality for tool path planning. We havecreatively used mathematical techniques from combinatorial and computational topology,discrete optimization, computational complexity, graph theory, and computational geometryfor theoretical results and to design and implement efficient algorithms.We proposed an Euler transformation that transforms a given d-dimensional cell complexK for d = 2; 3 into a new d-complex ^K in which every vertex is part of a same evennumber of edges. Hence every vertex in the graph ^G that is the 1-skeleton of ^K has an even degree, which makes ^G Eulerian, i.e., it is guaranteed to contain an Eulerian tour. Mesheswhose edges admit Eulerian tours are crucial in coverage problems arising in several applicationsincluding 3D printing and robotics.We developed a framework that creates a new polygonal mesh representation of the 3Ddomain of a layer-by-layer 3D printing job on which I identify a single, continuous toolpaths covering each connected piece of the domain in every layer. I present a tool pathalgorithm that traverses each such continuous tool path with no crossovers.In a third line of work, I explored efficient optimization of toolpaths based on multiplecriteria for large instances of 3d printing problems. I first showed that the minimumturn cost 3d printing problem is NP-hard, even when the region is a simple polygon. I developedSFCDecomp, a space filling curve based decomposition framework to solve largeinstances of 3d printing problems efficiently by solving these optimization subproblemsindependently. For the Buddha, this framework builds toolpaths over a total of 799,716nodes across 169 layers, and for the Bunny it builds toolpaths over 812,733 nodes across360 layers
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe 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
Full text linkWe 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
Two Vertex Descriptors Based on Hosoya’s Matching Descriptor Z(\u3cem\u3eG\u3c/em\u3e)
Full text linkIn 1971, Harao Hosoya launched the study of graph-theoretical descriptors in chemical applications by demonstrating a high correlation between the number of matchings of an alkane to its boiling point. We continue his legacy by describing two distinct vertex descriptors.
...
Together, adaptations of these descriptors form a local vertex space such that two vertices with similar local characteristics are mapped to points that are close in this space. As an application of such a space, we can quickly search large databases of chemical compounds for atoms with specific local connectivity environments.
Download the attached PDF file to see the complete abstract
Simplicial Complexes and the Optimal Homologous Chain Problem
Full text linkThesis (Ph.D.), Department of Mathematics, Washington State UniversityThis dissertation examines topological properties of a finite simplicial complexDepartment of Mathematics, Washington State Universit
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
- …
