Service-oriented systems are designed for interconnecting with other systems. The provided services face timing constraints, the so-called latencies. We present a high-level performance evaluation technique that can be used by a system designer to obtain distributions of these latencies. This technique is capable of capturing nondeterministic, probabilistic and real-time aspects in one go. Unde...

IMUTUS (Interactive Music Tuition System) is a EU project that aims to develop a practising environment for the recorder, combining new technologies and new approaches for music learning. Automatic analysis and evaluation of student performances play a central role in the student-system interaction. The performance evaluation module identifies typical performance errors, and provides feedback t...

In this paper we develop a probabilistic real-time calculus for performance evaluation. The calculus applies a simple generative model of probabilities. Next to probabilistic action transitions, probabilistic time transitions are supported. An operational characterization is given in terms of a labelled transition system. The operational rules for the real-time part of the calculus are construc...

The overall performance of P2P-based file sharing applications is becoming increasingly important. Based on the Adaptive Resource-based Probabilistic Search algorithm (ARPS), which was previously proposed by the authors, a novel probabilistic search algorithm with QoS guarantees is proposed in this letter. The algorithm relies on generating functions to satisfy the user's constraints and to exp...

We recently proposed a method to find cluster structure in home videos based on statistical models of visual and temporal features of video segments and sequential binary Bayesian classification. In this paper, we present analysis and improved results on two key issues: feature selection and performance evaluation, using a ten-hour database (30 video clips, 1,075,000 frames). From multiple feat...

Rapid computation of the Hough Transform is necessary in very many computer vision applications. One of the major approaches for fast Hough Transform computation is based on the use of a small random sample of the data set rather than the full set. Two diierent algorithms within this family are the Randomized Hough Transform (RHT) and the Probabilistic Hough Transform (PHT). There have been con...

We show how to evaluate the performance of solutions to finite-horizon scheduling problems where task durations are specified by bounded uniform distributions. Our computational technique, based on computing the volumes of zones, constitutes a contribution to the computational study of scheduling under uncertainty and stochastic systems in general.