No abstract

Abstract-Discrete linear repetitive processes are a distinct class of two-dimensional (2-D) linear systems with applications in areas ranging from long-wall coal cutting through to iterative learning control schemes. The feature which makes them distinct from other classes of 2-D linear systems is that information propagation in one of the two independent directions only occurs over a finite duration. This, in turn, means that a distinct systems theory must be developed for them. In this paper a complete characterization of stability and so-called pass controllability (and several resulting features), essential building blocks for a rigorous systems theory, under a general set of initial, or boundary, conditions is developed. Finally, some significant new results on the problem of stabilization by choice of the pass state initial vector sequence are developed.

The Probability Density Function (PDF) is a key concept in statistics. Constructing the most adequate PDF from the observed data is still an important and interesting scientific problem, especially for large datasets. PDFs are often estimated using nonparametric data-driven methods. One of the most popular nonparametric method is the Kernel Density Estimator (KDE). However, a very serious drawback of using KDEs is the large number of calculations required to compute them, especially to find the optimal bandwidth parameter. In this paper we investigate the possibility of utilizing Graphics Processing Units (GPUs) to accelerate the finding of the bandwidth. The contribution of this paper is threefold: (a) we propose algorithmic optimization to one of bandwidth finding algorithms, (b) we propose efficient GPU versions of three bandwidth finding algorithms and (c) we experimentally compare three of our GPU implementations with the ones which utilize only CPUs. Our experiments show orders of magnitude improvements over CPU implementations of classical algorithms.

No abstract

The problem of fast computation of multivariate kernel density estimation (KDE) is still an open research problem. In our view, the existing solutions do not resolve this matter in a satisfactory way. One of the most elegant and efficient approach utilizes the fast Fourier transform. Unfortunately, the existing FFT-based solution suffers from a serious limitation, as it can accurately operate only with the constrained (i.e., diagonal) multivariate bandwidth matrices. In this paper we describe the problem and give a satisfactory solution. The proposed solution may be successfully used also in other research problems, for example for the fast computation of the optimal bandwidth for KDE.