Characterizing chaotic melodies in automatic music composition

In this paper, we initially present an algorithm for automatic composition of melodies using chaotic dynamical systems. Afterward, we characterize chaotic music in a comprehensive way as comprising three perspectives: musical discrimination, dynamical influence on musical features, and musical perception. With respect to the first perspective, the coherence between generated chaotic melodies (continuous as well as discrete chaotic melodies) and a set of classical reference melodies is characterized by statistical descriptors and melodic measures. The significant differences among the three types of melodies are determined by discriminant analysis. Regarding the second perspective, the influence of dynamical features of chaotic attractors, e.g., Lyapunov exponent, Hurst coefficient, and correlation dimension, on melodic features is determined by canonical correlation analysis. The last perspective is related to perception of originality, complexity, and degree of melodiousness (Euler's gradus suavitatis) of chaotic and classical melodies by nonparametric statistical tests. (c) 2010 American Institute of Physics. [doi: 10.1063/1.3487516]

Particle competition for complex network community detection

In many real situations, randomness is considered to be uncertainty or even confusion which impedes human beings from making a correct decision. Here we study the combined role of randomness and determinism in particle dynamics for complex network community detection. In the proposed model, particles walk in the network and compete with each other in such a way that each of them tries to possess as many nodes as possible. Moreover, we introduce a rule to adjust the level of randomness of particle walking in the network, and we have found that a portion of randomness can largely improve the community detection rate. Computer simulations show that the model has good community detection performance and at the same time presents low computational complexity. (C) 2008 American Institute of Physics.

AFFINE INTERVAL EXCHANGE TRANSFORMATIONS WITH FLIPS AND WANDERING INTERVALS

There exist uniquely ergodic affine interval exchange transformations of [0,1] with flips which have wandering intervals and are such that the support of the invariant measure is a Cantor set.

Minimal Nielsen Root Classes and Roots of Liftings

Given a continuous map f : K -> M from a 2-dimensional CW complex into a closed surface, the Nielsen root number N(f) and the minimal number of roots mu(f) of f satisfy N(f) <= mu(f). But, there is a number mu(C)(f) associated to each Nielsen root class of f, and an important problem is to know when mu(f) = mu(C)(f)N(f). In addition to investigate this problem, we determine a relationship between mu(f) and mu((f) over tilde), when (f) over tilde f is a lifting of f through a covering space, and we find a connection between this problems, with which we answer several questions related to them when the range of the maps is the projective plane.

CHARACTERIZATION OF EXPONENTIAL DIVERGENCE OF THE KALMAN FILTER FOR TIME-VARYING SYSTEMS

This paper studies semistability of the recursive Kalman filter in the context of linear time-varying (LTV), possibly nondetectable systems with incorrect noise information. Semistability is a key property, as it ensures that the actual estimation error does not diverge exponentially. We explore structural properties of the filter to obtain a necessary and sufficient condition for the filter to be semistable. The condition does not involve limiting gains nor the solution of Riccati equations, as they can be difficult to obtain numerically and may not exist. We also compare semistability with the notions of stability and stability w.r.t. the initial error covariance, and we show that semistability in a sense makes no distinction between persistent and nonpersistent incorrect noise models, as opposed to stability. In the linear time invariant scenario we obtain algebraic, easy to test conditions for semistability and stability, which complement results available in the context of detectable systems. Illustrative examples are included.

PARTIAL STABILITY FOR A CLASS OF NONLINEAR SYSTEMS

This paper studies a nonlinear, discrete-time matrix system arising in the stability analysis of Kalman filters. These systems present an internal coupling between the state components that gives rise to complex dynamic behavior. The problem of partial stability, which requires that a specific component of the state of the system converge exponentially, is studied and solved. The convergent state component is strongly linked with the behavior of Kalman filters, since it can be used to provide bounds for the error covariance matrix under uncertainties in the noise measurements. We exploit the special features of the system-mainly the connections with linear systems-to obtain an algebraic test for partial stability. Finally, motivated by applications in which polynomial divergence of the estimates is acceptable, we study and solve a partial semistability problem.

Transport properties in nontwist area-preserving maps

Nontwist systems, common in the dynamical descriptions of fluids and plasmas, possess a shearless curve with a concomitant transport barrier that eliminates or reduces chaotic transport, even after its breakdown. In order to investigate the transport properties of nontwist systems, we analyze the barrier escape time and barrier transmissivity for the standard nontwist map, a paradigm of such systems. We interpret the sensitive dependence of these quantities upon map parameters by investigating chaotic orbit stickiness and the associated role played by the dominant crossing of stable and unstable manifolds. (C) 2009 American Institute of Physics. [doi: 10.1063/1.3247349]

Dynamical estimates of chaotic systems from Poincare recurrences

We show a function that fits well the probability density of return times between two consecutive visits of a chaotic trajectory to finite size regions in phase space. It deviates from the exponential statistics by a small power-law term, a term that represents the deterministic manifestation of the dynamics. We also show how one can quickly and easily estimate the Kolmogorov-Sinai entropy and the short-term correlation function by realizing observations of high probable returns. Our analyses are performed numerically in the Henon map and experimentally in a Chua's circuit. Finally, we discuss how our approach can be used to treat the data coming from experimental complex systems and for technological applications. (C) 2009 American Institute of Physics. [doi: 10.1063/1.3263943]

Bayesian online algorithms for learning in discrete Hidden Markov Models

We propose and analyze two different Bayesian online algorithms for learning in discrete Hidden Markov Models and compare their performance with the already known Baldi-Chauvin Algorithm. Using the Kullback-Leibler divergence as a measure of generalization we draw learning curves in simplified situations for these algorithms and compare their performances.

On the k-restricted structure ratio in planar and outerplanar graphs

A planar k-restricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar k-restricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar k-restricted ratio is the infimum, over simple planar graphs H, of the ratio of the number of edges in a maximum k-restricted structure subgraph of H to the number edges of H. We prove that, as k tends to infinity, the planar k-restricted ratio tends to 1/2. The same result holds for the weighted version. Our results are based on analyzing the analogous ratios for outerplanar and weighted outerplanar graphs. Here both ratios tend to 1 as k goes to infinity, and we provide good estimates of the rates of convergence, showing that they differ in the weighted from the unweighted case.

An algorithmic Friedman-Pippenger theorem on tree embeddings and applications

An (n, d)-expander is a graph G = (V, E) such that for every X subset of V with vertical bar X vertical bar <= 2n - 2 we have vertical bar Gamma(G)(X) vertical bar >= (d + 1) vertical bar X vertical bar. A tree T is small if it has at most n vertices and has maximum degree at most d. Friedman and Pippenger (1987) proved that any ( n; d)- expander contains every small tree. However, their elegant proof does not seem to yield an efficient algorithm for obtaining the tree. In this paper, we give an alternative result that does admit a polynomial time algorithm for finding the immersion of any small tree in subgraphs G of (N, D, lambda)-graphs Lambda, as long as G contains a positive fraction of the edges of Lambda and lambda/D is small enough. In several applications of the Friedman-Pippenger theorem, including the ones in the original paper of those authors, the (n, d)-expander G is a subgraph of an (N, D, lambda)-graph as above. Therefore, our result suffices to provide efficient algorithms for such previously non-constructive applications. As an example, we discuss a recent result of Alon, Krivelevich, and Sudakov (2007) concerning embedding nearly spanning bounded degree trees, the proof of which makes use of the Friedman-Pippenger theorem. We shall also show a construction inspired on Wigderson-Zuckerman expander graphs for which any sufficiently dense subgraph contains all trees of sizes and maximum degrees achieving essentially optimal parameters. Our algorithmic approach is based on a reduction of the tree embedding problem to a certain on-line matching problem for bipartite graphs, solved by Aggarwal et al. (1996).

On the resilience of long cycles in random graphs

In this paper we determine the local and global resilience of random graphs G(n,p) (p >> n(-1)) with respect to the property of containing a cycle of length at least (1 - alpha)n. Roughly speaking, given alpha > 0, we determine the smallest r(g) (G, alpha) with the property that almost surely every subgraph of G = G(n,p) having more than r(g) (G, alpha)vertical bar E(G)vertical bar edges contains a cycle of length at least (1 - alpha)n (global resilience). We also obtain, for alpha < 1/2, the smallest r(l) (G, alpha) such that any H subset of G having deg(H) (v) larger than r(l) (G, alpha) deg(G) (v) for all v is an element of V(G) contains a cycle of length at least (1 - alpha)n (local resilience). The results above are in fact proved in the more general setting of pseudorandom graphs.

ON GENERIC ROTATIONLESS DIFFEOMORPHISMS OF THE ANNULUS

Let f be a C(r)-diffeomorphism of the closed annulus A that preserves the orientation, the boundary components and the Lebesgue measure. Suppose that f has a lift (f) over tilde to the infinite strip (A) over tilde which has zero Lebesgue measure rotation number. If the rotation number of f restricted to both boundary components of (f) over tilde is positive, then for such a generic f (r >= 16), zero is an interior point of its rotation set. This is a partial solution to a conjecture of P. Boyland.

DJKM ALGEBRAS I: THEIR UNIVERSAL CENTRAL EXTENSION

The purpose of this paper is to explicitly describe in terms of generators and relations the universal central extension of the infinite dimensional Lie algebra, g circle times C[t, t(-1), u vertical bar u(2) = (t(2) - b(2))(t(2) - c(2))], appearing in the work of Date, Jimbo, Kashiwara and Miwa in their study of integrable systems arising from the Landau-Lifshitz differential equation.

COMPLETE ISOMORPHIC CLASSIFICATIONS OF SOME SPACES OF COMPACT OPERATORS

This paper is a continuation and a complement of our previous work on isomorphic classification of some spaces of compact operators. We improve the main result concerning extensions of the classical isomorphic classification of the Banach spaces of continuous functions on ordinals. As an application, fixing an ordinal a and denoting by X(xi), omega(alpha) <= xi < omega(alpha+1), the Banach space of all X-valued continuous functions defined in the interval of ordinals [0,xi] and equipped with the supremum, we provide complete isomorphic classifications of some Banach spaces K(X(xi),Y(eta)) of compact operators from X(xi) to Y(eta), eta >= omega. It is relatively consistent with ZFC (Zermelo-Fraenkel set theory with the axiom of choice) that these results include the following cases: 1.X* contains no copy of c(0) and has the Mazur property, and Y = c(0)(J) for every set J. 2. X = c(0)(I) and Y = l(q)(J) for any infinite sets I and J and 1 <= q < infinity. 3. X = l(p)(I) and Y = l(q)(J) for any infinite sets I and J and 1 <= q < p < infinity.