Recently, the visibility graph has been introduced as a novel view for analyzing time series, which maps it to a complex network. In this paper, we introduce a new algorithm of visibility, ”cross-visibility”, which reveals the conjugation of two coupled time series. The correspondence between the two time series is mapped to a network, ”the cross-visibility graph”, to demonstrate the correlatio...

(2005). Teachers mentoring teachers: A view over time.

The analysis of time-oriented data is an important task in many application scenarios. In recent years, a variety of techniques for visualizing such data have been published. This variety makes it difficult for prospective users to select methods or tools that are useful for their particular task at hand. In this article, we develop and discuss a systematic view on the diversity of methods for ...

Consider the following problem: If you want to sort n numbers in k (a constant) rounds then how many comparisons-per-round do you need? This problem has been studied carefully and there exist several algorithms and some lower bounds for it. Many of the algorithms are non-constructive. We have embarked on an empirical study of most of the algorithms in the literature, including the non-construct...

This contribution is complementary to [1] in that it takes a timevarying mode-vector solution as an a priori assumption. The associated dynamic eigenvalue problem is solved by triangularizing the system equations, again accomplished by successive Riccati transforms. It is explicitly shown that equal eigenvalues do not give rise to the Jordan form. Although the mode-vectors are not uniquely dete...