130,673 research outputs found
Licenser under cover: The Genitive of Negation in Slovenian
No full textIn some languages there exist syntactic environments in which noun phrases of negated sentences do not take nominative or accusative case as their counterparts from the parallel affirmative sentences do. Instead, they are inflected for the genitive, usually called the genitive of negation. The article (i) reconsiders the list of these environments; (ii) describes an observation whereby the genitive of negation on the subject cancels the subject-verb agreement, triggering the default morphosyntactic form of the (auxiliary) verb; (iii) compares the distribution of the genitive of negation to the distribution of the negative-numeral nič “nothing”; and (iv) argues for the hypothesis that the genitive of negation is licensed by the covert version of the n-numeral nič “nothing”
MeSH term explosion and author rank improve expert recommendations
No full textInformation overload is an often-cited phenomenon that reduces the productivity, efficiency and efficacy of scientists. One challenge for scientists is to find appropriate collaborators in their research. The literature describes various solutions to the problem of expertise location, but most current approaches do not appear to be very suitable for expert recommendations in biomedical research. In this study, we present the development and initial evaluation of a vector space model-based algorithm to calculate researcher similarity using four inputs: 1) MeSH terms of publications; 2) MeSH terms and author rank; 3) exploded MeSH terms; and 4) exploded MeSH terms and author rank. We developed and evaluated the algorithm using a data set of 17,525 authors and their 22,542 papers. On average, our algorithms correctly predicted 2.5 of the top 5/10 coauthors of individual scientists. Exploded MeSH and author rank outperformed all other algorithms in accuracy, followed closely by MeSH and author rank. Our results show that the accuracy of MeSH term-based matching can be enhanced with other metadata such as author rank
Rigorous continuous evolution of uncertain systems
No full textUncertainty is unavoidable in modeling dynamical systems and it may be represented mathematically by differential inclusions. In the past, we proposed an algorithm to compute validated solutions of differential inclusions; here we provide several theoretical improvements to the algorithm, including its extension to piecewise constant and sinu- soidal approximations of uncertain inputs, updates on the affine approx- imation bounds and a generalized formula for the analytical error. In addition, we implemented the methodology in Ariadne, a library for the verification of continuous and hybrid systems. Then we evaluated ten systems with varying degrees of nonlinearity, number of variables and uncertain inputs. The results are hereby compared with two state-of- the-art approaches to time-varying uncertainties in nonlinear systems
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
Chromosomal polymorphism of D. subobscura: no differences between wild males and sons of wild females
No full textWhen analyzing the chromosomal polymorphism of D. subobscura natural populations it is assumed that the information provided by wild males and sons of wild females is equivalent. Thus, using both in the analysis it is possible to increase the sample size. However, it is important to verify whether there are significant differences between both groups or not. The aim of this research has been to statistically compare the results of chromosomal polymorphism of both groups. We have used data from Avala Mountain (Serbia) where D. subobscura flies were collected from the 30th May to the 5th June 2011. Avala is located 18 km south of Belgrade and the trapping place is a forest with polydominant communities of Fagetum submontanum Table 1. Number and percentage of adult flies collected in Font Groga (Barcelona, Spain) on 9th October 2013. Males and sons of wild females were crossed with virgin females of the Küsnacht strain. Third instar larvae from F1 were dissected to obtain the salivary glands and the polytene chromosomes were stained and squashed in aceto-orcein solution. No significant differences were observed for any chromosome of the karyotype: A (p-value = 0.485), J (p-value = 0.230), U (p-value =0.572), E (p-value = 0.536), and O (p-value = 0.338). Thus, it seems that the two groups can be grouped together to obtain the chromosomal polymorphism of the population
"Closing the R&D Gap, Evaluating the Sources of R&D Spending"
No full textBoth spending and tax policies have been implemented in the United States with the goal of stimulating private sector research and development (R&D). Karier questions whether current R&D policy, especially the research and experimentation tax credit, can contribute to closing the gap between nondefense expenditures on R&D in the United States and such expenditures in other countries, such as Japan and Germany. He also explores possible changes to our current R&D policy to make it more effective.
A higher order method for input-affine uncertain systems
No full textUncertainty is unavoidable in modeling dynamical systems and it may be represented mathematically by differential inclusions. In the past, we proposed an algorithm to compute validated solutions of differential inclusions; here we provide several theo-retical improvements to the algorithm, including its extension to piecewise constant and sinusoidal approximations of uncertain inputs, updates on the affine approximation bounds and a generalized formula for the analytical error. The approach proposed is able to achieve higher order convergence with respect to the current state-of-the-art. We implemented the methodology in Ariadne, a library for the verification of continuous and hybrid systems. For evaluation purposes, we introduce ten systems from the literature, with varying degrees of nonlinearity, number of variables and uncertain inputs. The results are hereby compared with two state-of-the-art approaches to time-varying uncertainties in nonlinear systems.(c) 2022 Published by Elsevier Ltd
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
Scholarly Communication and Publishing Lunch and Learn Talk #11: The ULS Open Access Author Fee Fund
No full textAt the May 2014 talk, you will learn about the ULS Open Access Author Fee Fund--what it is, why we do it, how it works, and how the program is going so far
- …
