Global state synchronization in networks of cyclic feedback systems

This technical note studies global asymptotic state synchronization in networks of identical systems. Conditions on the coupling strength required for the synchronization of nodes having a cyclic feedback structure are deduced using incremental dissipativity theory. The method takes advantage of the incremental passivity properties of the constituent subsystems of the network nodes to reformulate the synchronization problem as one of achieving incremental passivity by coupling. The method can be used in the framework of contraction theory to constructively build a contracting metric for the incremental system. The result is illustrated for a network of biochemical oscillators. © 2011 IEEE.

Phase synchronization between stratospheric and tropospheric quasi-biennial and semi-annual oscillations

A combination of singular systems analysis and analytic phase techniques are used to investigate the possible occurrence in observations of coherent synchronization between quasi-biennial and semi-annual oscillations (QBOs; SAOs) in the stratosphere and troposphere. Time series of zonal mean zonal winds near the Equator are analysed from the ERA-40 and ERA-interim reanalysis datasets over a ∼ 50-year period. In the stratosphere, the QBO is found to synchronize with the SAO almost all the time, but with a frequency ratio that changes erratically between 4:1, 5:1 and 6:1. A similar variable synchronization is also evident in the tropical troposphere between semi-annual and quasi-biennial cycles (known as TBOs). Mean zonal winds from ERA-40 and ERA-interim, and also time series of indices for the Indian and West Pacific monsoons, are commonly found to exhibit synchronization, with SAO/TBO ratios that vary between 4:1 and 7:1. Coherent synchronization between the QBO and tropical TBO does not appear to persist for long intervals, however. This suggests that both the QBO and tropical TBOs may be separately synchronized to SAOs that are themselves enslaved to the seasonal cycle, or to the annual cycle itself. However, the QBO and TBOs are evidently only weakly coupled between themselves and are frequently found to lose mutual coherence when each changes its frequency ratio to its respective SAO. This suggests a need to revise a commonly cited paradigm that advocates the use of stratospheric QBO indices as a predictor for tropospheric phenomena such as monsoons and hurricanes. © 2012 Royal Meteorological Society.

Information theory, inference, and learning algorithms

Fun and exciting textbook on the mathematics underpinning the most dynamic areas of modern science and engineering.

Representations and algorithms for finite-state bisimulations of linear discrete-time control systems

While a large amount of research over the past two decades has focused on discrete abstractions of infinite-state dynamical systems, many structural and algorithmic details of these abstractions remain unknown. To clarify the computational resources needed to perform discrete abstractions, this paper examines the algorithmic properties of an existing method for deriving finite-state systems that are bisimilar to linear discrete-time control systems. We explicitly find the structure of the finite-state system, show that it can be enormous compared to the original linear system, and give conditions to guarantee that the finite-state system is reasonably sized and efficiently computable. Though constructing the finite-state system is generally impractical, we see that special cases could be amenable to satisfiability based verification techniques. ©2009 IEEE.

Distributed flow algorithms for scalable similarity visualization

We describe simple yet scalable and distributed algorithms for solving the maximum flow problem and its minimum cost flow variant, motivated by problems of interest in objects similarity visualization. We formulate the fundamental problem as a convex-concave saddle point problem. We then show that this problem can be efficiently solved by a first order method or by exploiting faster quasi-Newton steps. Our proposed approach costs at most O(|ε|) per iteration for a graph with |ε| edges. Further, the number of required iterations can be shown to be independent of number of edges for the first order approximation method. We present experimental results in two applications: mosaic generation and color similarity based image layouting. © 2010 IEEE.