3,441,637 research outputs found
Going Beyond Counting First Authors in Author Co-citation Analysis
No full textThe 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
SPSS Syntax - Polish Verbs
No full textPsycholexical study on Polish verbs.
The syntax for SPSS allows the calculation of EFA solutions from 1 to 7
Appropriate Similarity Measures for Author Cocitation Analysis
No full textWe 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
Portrait of Louis Nowra, author, 1981, 2 [picture] /
No full textTitle devised by cataloguer from inscription.; Part of the collection: Portraits of Louis Nowra, author, 1981.; Inscriptions: "Louis Nowra 5/2/81, H de Berg"--In ink on verso of print.; Condition: Soiled, scratched.; Also available in an electronic version via the Internet at: http://nla.gov.au/nla.pic-vn4728375
Saying Thanks and Meaning It: Expressing Gratitude for Social Gain
No full textPeople sometimes give thanks as a true expression of their feeling but also sometimes because they know gratitude expression helps to make a certain social impression. That is, some gratitude is expressed because of intrinsic motivations or extrinsic motivations. Such motivations affect the outcomes of behavior. The present work assessed gratitude, trait tendency to manage socially desirable expressions, and well-being across two studies (combined n = 398). Motivations to express gratitude were also measured and impression management goals were manipulated in study 2. Results show that gratitude expression is highest when people want to make a good impression and extrinsic motives to express gratitude can moderate the relationship between gratitude and well-being. Implications for the measurement of gratitude and theoretical understanding of gratitude’s social function are discussed
Dispelling the Myths Behind First-author Citation Counts
No full textWe 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
Geometric Configurations of Algorithms for Reduced m x 2 and 2 x 2 Matrix Multiplication
No full textMatrix multiplication is commonly used in scientific computation. Given matrices A = (aij ) of size l �� m and B = (bij ) of size m �� n, the standard way to compute the product C := AB is computing cij = ��^m k=1 aikbkj . In this case, lmn multiplications and ln(m ��� 1) additions are used. In 1969, V. Strassen found a surprising algorithm to multiply 2 �� 2 matrices using 7 multiplications instead of 8 in the standard algorithm. In this way, n �� n matrix multiplication can be computed using O(n^log^7 2 ) scalar multiplication operations. If n is large, the Strassen algorithm is much more efficient than the standard algorithm. After Strassen���s algorithm, numerous efforts were made to reduce the complexity for n �� n matrix multiplication. By 1986, the bound was reduced to O(n^2.38) by Coppersmith and Winograd. However this is an asymptotic result rather than an implementable algorithm. The complexity has not been significantly improved for 30 years.
Matrix multiplication is a tensor and one way to measure the complexity is using its tensor rank. Any tensor can be written as finite sum of rank one tensors and the rank for a tensor is the least number of rank-one tensors needed in the sum. A theorem due to Strassen shows the tensor rank is a good measurement for the complexity. One Bini���s theorem demonstrates that the border rank of the matrix multiplication tensor M is a complexity measurement for matrix multiplication. Even though the problem may sound simple, the border ranks of small matrix multiplication tensors are still unknown. Suppose one wants to compute the border rank of the tensor for the matrix multiplication of size m �� 2 and 2 �� 2 denoted by R(M). R(M) is closely related to the border rank of reduced matrix multiplication tensor TBCLRS,m, where one entry is set equal to zero. For small m like 2 and 3, there are good geometric configurations in the border rank algorithms for the tensor TBCLRS,m. My project is to understand the geometry of the good existing algorithms in the cases m = 2, 3. In the configuration of case m = 2, the limit 5-plane in the Grassmannian plane in the algorithm intersects with the Segre variety in three special lines. For the case m = 3, the intersection of the limiting 8-plane and the Segre variety consists of the union of a family of lines passing through a plane conic and a special sub-Segre variety. I also try to find analogous algorithms to the m = 2 case or disprove the existence of such algorithms
- …
