A connection between the Kalman filter and the Fibonacci sequence is developed. More precisely it is shown that, for a scalar random walk system in which the two noise sources (process and measurement noise) have equal variance, the Kalman filter’s estimate turns out to be a convex linear combination of the a priori estimate and of the measurements with coefficients suitably related to the Fibo...

In this paper, we introduce new concepts of weak rigidity matrix and infinitesimal weak rigidity for planar frameworks. The weak rigidity matrix is used to directly check if a framework is infinitesimally weakly rigid while previous work can check a weak rigidity of a framework indirectly. An infinitesimal weak rigidity framework can be uniquely determined up to a translation and a rotation (an...

In this report we describe our scalability-related experiments with the transactional R-Tree prototype on a server-class hardware. We describe here our algorithm for concurrency control and transactional isolation, the prototype and the evaluation environment. Also the motivation and a short R-Tree technology survey is presented. This report can be considered as the supplementary to the paper [...

A promising way to capture the characteristics of changing traffic is to extract significant flow clusters in traffic. However, clustering flows by 5-tuple requires flow matching in huge flow attribute spaces, and thus, is difficult to perform on the fly. We propose an efficient yet flexible flow aggregation technique for monitoring the dynamics of network traffic. Our scheme employs twostage f...