Bice Cavallo

An empirical comparison of methods to support QoS-aware service selection

Run-time binding is an important and useful feature of Service Oriented Architectures (SOA), which aims at selecting, among functionally equivalent services, the ones that optimize some QoS objective of the overall application. To this aim, it is particularly relevant to forecast the QoS a service will likely exhibit in future invocations. This paper presents an empirical study aimed at comparing different approaches for QoS forecasting, namely the use of average and current values, linear models, and models based on time series. The study is performed on QoS data obtained by monitoring the execution of 10 real services for 4 months. Results show that, overall, the use of time series forecasting has the best compromise in ensuring a good prediction error, being sensible to outliers, and being able to predict likely violations of QoS constraints.

About a consistency index for pairwise comparison matrices over a divisible alo‐group

Pairwise comparison matrices (PCMs) over an Abelian linearly ordered (alo)‐group \documentclass{article}\usepackage{amssymb}\pagestyle{empty}\begin{document}

Reciprocal transitive matrices over abelian linearly ordered groups

\mathcal{G}=(G, \odot, \leq)

Investigating Properties of the ⊙-Consistency Index

\end{document} have been introduced to generalize multiplicative, additive and fuzzy ones and remove some consistency drawbacks. Under the assumption of divisibility of \documentclass{article}\usepackage{amssymb}\pagestyle{empty}\begin{document}

A Bayesian Approach for on-Line Max Auditing

\mathcal{G}

Building Consistent Pairwise Comparison Matrices over Abelian Linearly Ordered Groups

\end{document}, for each PCM A=(aij), a ⊙‐mean vector \documentclass{article}\usepackage{amssymb}\pagestyle{empty}\begin{document}

A further discussion of “A Semiring-based study of judgment matrices: properties and models” [Information Sciences 181 (2011) 2166–2176]

\underline{w}_{m}(A)

A Bayesian model for disclosure control in statistical databases

\end{document} can be associated with A and a consistency measure \documentclass{article}\usepackage{amssymb}\pagestyle{empty}\begin{document}

Ensuring reliability of the weighting vector

I_{\mathcal{G}}(A)

Independence and convergence in non-additive settings

\end{document}, expressed in terms of ⊙‐mean of \documentclass{article}\usepackage{amssymb}\pagestyle{empty}\begin{document}