1,721,174 research outputs found
Dexterous textile manipulation using electroadhesive fingers
No full textHandling of fabric is a crucial step in the manufacturing of garments. This task is typically performed by trained workers who manipulate one sheet at a time, thus introducing a bottleneck in the automation of the textile industry. This paper seeks to address the challenge of picking fabric up by proposing a new method of achieving ply-separation. Our approach relies on a finger-tip sized (2 cm(2)) electroadhesive skin to lift fabric up. A pinch-type grasp is then used to securely hold the separated sheet of fabric, enabling easy manipulation thereafter. The ability to successfully pick up and manipulate a variety of commercial fabrics with diverse materials, shapes, sizes and textures is demonstrated. The ability to handle fabrics 100s of times larger than the electroadhesive skin is unique to our approach. Additionally, we demonstrate the manipulation of non-flat fabrics, a challenge that has not been previously addressed by electroadhesive approaches. We believe that this method introduces a smarter way of handling flexible and limp materials, showing great potential towards automation of garment manufacturing
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
Separations between Combinatorial Measures for Transitive Functions
Get PDFThe role of symmetry in Boolean functions has been
extensively studied in complexity theory. For example, symmetric functions,
that is, functions that are invariant under the action of , is an
important class of functions in the study of Boolean functions. A function
is called transitive (or weakly-symmetric) if there
exists a transitive group of such that is invariant under the
action of - that is the function value remains unchanged even after the
bits of the input of are moved around according to some permutation . Understanding various complexity measures of transitive functions has
been a rich area of research for the past few decades.
In this work, we study transitive functions in light of several combinatorial
measures. We look at the maximum separation between various pairs of measures
for transitive functions. Such study for general Boolean functions has been
going on for past many years. The best-known results for general Boolean
functions have been nicely compiled by Aaronson et. al (STOC, 2021).
The separation between a pair of combinatorial measures is shown by
constructing interesting functions that demonstrate the separation. But many of
the celebrated separation results are via the construction of functions (like
"pointer functions" from Ambainis et al. (JACM, 2017) and "cheat-sheet
functions" Aaronson et al. (STOC, 2016)) that are not transitive. Hence, we
don't have such separation between the pairs of measures for transitive
functions.
In this paper we show how to modify some of these functions to construct
transitive functions that demonstrate similar separations between pairs of
combinatorial measures
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
Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead
Get PDFBuhrman, Cleve and Wigderson (STOC'98) observed that for every Boolean function f:{-1,1}ⁿ → {-1,1} and •:{-1,1}² → {-1,1} the two-party bounded-error quantum communication complexity of (f ∘ •) is O(Q(f) log n), where Q(f) is the bounded-error quantum query complexity of f. Note that the bounded-error randomized communication complexity of (f ∘ •) is bounded by O(R(f)), where R(f) denotes the bounded-error randomized query complexity of f. Thus, the BCW simulation has an extra O(log n) factor appearing that is absent in classical simulation. A natural question is if this factor can be avoided. Razborov (IZV MATH'03) showed that the bounded-error quantum communication complexity of Set-Disjointness is Ω(√n). The BCW simulation yields an upper bound of O(√n log n). Høyer and de Wolf (STACS'02) showed that this can be reduced to c^(log^* n) for some constant c, and subsequently Aaronson and Ambainis (FOCS'03) showed that this factor can be made a constant. That is, the quantum communication complexity of the Set-Disjointness function (which is NOR_n ∘ ∧) is O(Q(NOR_n)).
Perhaps somewhat surprisingly, we show that when • = ⊕, then the extra log n factor in the BCW simulation is unavoidable. In other words, we exhibit a total function F:{-1,1}ⁿ → {-1,1} such that Q^{cc}(F ∘ ⊕) = Θ(Q(F) log n).
To the best of our knowledge, it was not even known prior to this work whether there existed a total function F and 2-bit function •, such that Q^{cc}(F ∘ •) = ω(Q(F))
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
- …
