1,721,003 research outputs found
Bipolar varieties and real solving of a singular polynomial equation
Get PDFWe introduce the concept of a bipolar variety of a real algebraic hypersurface. This notion is then used for the design and complexity estimations of a novel type of algorithms that finds algebraic sample points for the connected components of a singular real hypersurface. The complexity of these algorithms is polynomial in the maximal geometric degree of the bipolar varieties of the given hypersurface and in this sense intrinsic.Fil: Bank, Bernd. Universität zu Berlin; AlemaniaFil: Giusti, Marc. Centre National de la Recherche Scientifique; FranciaFil: Heintz, Joos Ulrich. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Pardo, Luis Miguel. Universidad de Cantabria; Españ
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
Point searching in real singular complete intersection varieties: Algorithms of intrinsic complexity
Get PDFAbstract. Let X1, . . .,Xn be indeterminates over Q and let X := (X1, . . . ,Xn). Let F1, . . . ,Fp be a regular sequence of polynomials in Q[X] of degreeat most d such that for each 1 ≤ k ≤ p the ideal (F1, . . . , Fk) is radical.Suppose that the variables X1, . . .,Xn are in generic position with respect toF1, . . . ,Fp. Further, suppose that the polynomials are given by an essentiallydivision-free circuit β in Q[X] of size L and non-scalar depth .We present a family of algorithms Πi and invariants δi of F1, . . . ,Fp, 1 ≤i ≤ n − p, such that Πi produces on input β a smooth algebraic sample pointfor each connected component of {x ∈ Rn | F1(x) = ・ ・ ・ = Fp(x) = 0} wherethe Jacobian of F1 = 0, . . . , Fp = 0 has generically rank p.The sequential complexity of Πi is of order L(nd)O(1)(min{(nd)cn, δi})2and its non-scalar parallel complexity is of order O(n( + lognd) log δi). Herec > 0 is a suitable universal constant. Thus, the complexity of Πi meetsthe already known worst case bounds. The particular feature of Πi is itspseudo-polynomial and intrinsic complexity character and this entails the bestruntime behavior one can hope for. The algorithm Πi works in the non-uniformdeterministic as well as in the uniform probabilistic complexity model. Wealso exhibit a worst case estimate of order (nn d)O(n) for the invariant δi. Thereader may notice that this bound overestimates the extrinsic complexity ofΠi, which is bounded by (nd)O(n).1.Fil: Bank, Bernd. Universität zu Berlin; AlemaniaFil: Giusti, Marc. École Polytechnique; Francia. Centre National de la Recherche Scientifique; FranciaFil: Heintz, Joos Ulrich. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Universidad de Cantabria. Facultad de Ciencias. Departamento de Matemáticas, Estadística y Computación; Españ
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
- …
