Validador de políticas de acceso abierto

MELIBEA és un directori i validador de polítiques en favor de l'accés obert a la producció científico-acadèmica. Com a directori, descriu les polítiques institucionals existents relacionades amb l'accés obert (AO) a la producció científica i acadèmica. Com a validador, les sotmet a una anàlisi qualitatiu i quantitatiu basat en el compliment d'un conjunt d'indicadors que reflecteixen les bases en què es fonamenta una política institucional. El validador indica una puntuació i un percentatge de compliment per a cada una de les polítiques analitzades. Això es realitza a partir dels valors assignats a certs indicadors i la seva ponderació en funció de la seva importància relativa. La suma dels valors ponderats de cadascun dels indicadors s'ajusta a una escala percentual i condueix al que hem anomenat "Percentatge validat d'accés obert", el càlcul del qual s'exposa en l'apartat de Metodologia. Els tipus d'institucions que s'analitzen són universitats, centres de recerca, agències finançadores i organitzacions governamentals.

Weighted Logratio Biplots, Correspondence Analysis and Spectral Maps

Starting with logratio biplots for compositional data, which are based on the principle of subcompositional coherence, and then adding weights, as in correspondence analysis, we rediscover Lewi's spectral map and many connections to analyses of two-way tables of non-negative data. Thanks to the weighting, the method also achieves the property of distributional equivalence

Bernstein's problem on weighted polynomial approximation

We formulate a necessary and sufficient condition for polynomials to be dense in a space of continuous functions on the real line, with respect to Bernstein's weighted uniform norm. Equivalently, for a positive finite measure [lletra "mu" minúscula de l'alfabet grec] on the real line we give a criterion for density of polynomials in Lp[lletra "mu" minúscula de l'alfabet grec entre parèntesis].

Weighted Kernel regression

In the fixed design regression model, additional weights areconsidered for the Nadaraya--Watson and Gasser--M\"uller kernel estimators.We study their asymptotic behavior and the relationships between new andclassical estimators. For a simple family of weights, and considering theIMSE as global loss criterion, we show some possible theoretical advantages.An empirical study illustrates the performance of the weighted estimatorsin finite samples.

Weighted metric multidimensional scaling

This paper establishes a general framework for metric scaling of any distance measure between individuals based on a rectangular individuals-by-variables data matrix. The method allows visualization of both individuals and variables as well as preserving all the good properties of principal axis methods such as principal components and correspondence analysis, based on the singular-value decomposition, including the decomposition of variance into components along principal axes which provide the numerical diagnostics known as contributions. The idea is inspired from the chi-square distance in correspondence analysis which weights each coordinate by an amount calculated from the margins of the data table. In weighted metric multidimensional scaling (WMDS) we allow these weights to be unknown parameters which are estimated from the data to maximize the fit to the original distances. Once this extra weight-estimation step is accomplished, the procedure follows the classical path in decomposing a matrix and displaying its rows and columns in biplots.

Weighted Euclidean biplots

We construct a weighted Euclidean distance that approximates any distance or dissimilarity measure between individuals that is based on a rectangular cases-by-variables data matrix. In contrast to regular multidimensional scaling methods for dissimilarity data, the method leads to biplots of individuals and variables while preserving all the good properties of dimension-reduction methods that are based on the singular-value decomposition. The main benefits are the decomposition of variance into components along principal axes, which provide the numerical diagnostics known as contributions, and the estimation of nonnegative weights for each variable. The idea is inspired by the distance functions used in correspondence analysis and in principal component analysis of standardized data, where the normalizations inherent in the distances can be considered as differential weighting of the variables. In weighted Euclidean biplots we allow these weights to be unknown parameters, which are estimated from the data to maximize the fit to the chosen distances or dissimilarities. These weights are estimated using a majorization algorithm. Once this extra weight-estimation step is accomplished, the procedure follows the classical path in decomposing the matrix and displaying its rows and columns in biplots.

Nuclear incompressibility in the quasilocal density functional theory

We explore the ability of the recently established quasilocal density functional theory for describing the isoscalar giant monopole resonance. Within this theory we use the scaling approach and perform constrained calculations for obtaining the cubic and inverse energy weighted moments (sum rules) of the RPA strength. The meaning of the sum rule approach in this case is discussed. Numerical calculations are carried out using Gogny forces and an excellent agreement is found with HF+RPA results previously reported in literature. The nuclear matter compression modulus predicted in our model lies in the range 210230 MeV which agrees with earlier findings. The information provided by the sum rule approach in the case of nuclei near the neutron drip line is also discussed.

Correlations in weighted networks

We develop a statistical theory to characterize correlations in weighted networks. We define the appropriate metrics quantifying correlations and show that strictly uncorrelated weighted networks do not exist due to the presence of structural constraints. We also introduce an algorithm for generating maximally random weighted networks with arbitrary P(k,s) to be used as null models. The application of our measures to real networks reveals the importance of weights in a correct understanding and modeling of these heterogeneous systems.

Some spectral properties of the canonical solution operator to $\bar\partial$ on weighted Fock spaces

We characterize the Schatten class membership of the canonical solution operator to $\overline{\partial}$ acting on $L^2(e^{-2\phi})$, where $\phi$ is a subharmonic function with $\Delta\phi$ a doubling measure. The obtained characterization is in terms of $\Delta\phi$. As part of our approach, we study Hankel operators with anti-analytic symbols acting on the corresponding Fock space of entire functions in $L^2(e^{-2\phi})$

The Uncertain generalized probabilistic weighted average and its application in the theory of expertons

A new model for dealing with decision making under risk by considering subjective and objective information in the same formulation is here presented. The uncertain probabilistic weighted average (UPWA) is also presented. Its main advantage is that it unifies the probability and the weighted average in the same formulation and considering the degree of importance that each case has in the analysis. Moreover, it is able to deal with uncertain environments represented in the form of interval numbers. We study some of its main properties and particular cases. The applicability of the UPWA is also studied and it is seen that it is very broad because all the previous studies that use the probability or the weighted average can be revised with this new approach. Focus is placed on a multi-person decision making problem regarding the selection of strategies by using the theory of expertons.

Impulse response recovery of linear systems through weighted cumulant slice

Identifiability of the so-called ω-slice algorithm is proven for ARMA linear systems. Although proofs were developed in the past for the simpler cases of MA and AR models, they were not extendible to general exponential linear systems. The results presented in this paper demonstrate a unique feature of the ω-slice method, which is unbiasedness and consistency when order is overdetermined, regardless of the IIR or FIR nature of the underlying system, and numerical robustness.

An efficient solver for weighted Max-SAT

We present a new branch and bound algorithm for weighted Max-SAT, called Lazy which incorporates original data structures and inference rules, as well as a lower bound of better quality. We provide experimental evidence that our solver is very competitive and outperforms some of the best performing Max-SAT and weighted Max-SAT solvers on a wide range of instances.

Pointwise estimates for the Bergman kernel of the weighted Fock space

We prove upper pointwise estimates for the Bergman kernel of the weighted Fock space of entire functions in $L^{2}(e^{-2\phi}) $ where $\phi$ is a subharmonic function with $\Delta\phi$ a doubling measure. We derive estimates for the canonical solution operator to the inhomogeneous Cauchy-Riemann equation and we characterize the compactness of this operator in terms of $\Delta\phi$.

Beurling-Landau densities of weighted Fekete sets and correlation kernel estimates

Let $Q$ be a suitable real function on $C$. An $n$-Fekete set corresponding to $Q$ is a subset ${Z_{n1}},\dotsb, Z_{nn}}$ of $C$ which maximizes the expression $\Pi^n_i_{