Consensus analysis of multiagent networks via aggregated and pinning approaches

This is the post-print version of of the Article - Copyright @ 2011 IEEEIn this paper, the consensus problem of multiagent nonlinear directed networks (MNDNs) is discussed in the case that a MNDN does not have a spanning tree to reach the consensus of all nodes. By using the Lie algebra theory, a linear node-and-node pinning method is proposed to achieve a consensus of a MNDN for all nonlinear functions satisfying a given set of conditions. Based on some optimal algorithms, large-size networks are aggregated to small-size ones. Then, by applying the principle minor theory to the small-size networks, a sufficient condition is given to reduce the number of controlled nodes. Finally, simulation results are given to illustrate the effectiveness of the developed criteria.This work was jointly supported by CityU under a research grant (7002355) and GRF funding (CityU 101109)

Leveraging Contextual Cues for Generating Basketball Highlights

The massive growth of sports videos has resulted in a need for automatic generation of sports highlights that are comparable in quality to the hand-edited highlights produced by broadcasters such as ESPN. Unlike previous works that mostly use audio-visual cues derived from the video, we propose an approach that additionally leverages contextual cues derived from the environment that the game is being played in. The contextual cues provide information about the excitement levels in the game, which can be ranked and selected to automatically produce high-quality basketball highlights. We introduce a new dataset of 25 NCAA games along with their play-by-play stats and the ground-truth excitement data for each basket. We explore the informativeness of five different cues derived from the video and from the environment through user studies. Our experiments show that for our study participants, the highlights produced by our system are comparable to the ones produced by ESPN for the same games.Comment: Proceedings of ACM Multimedia 201

Primordial Lepton Family Asymmtries in Seesaw Model

In leptogenesis scenario, the decays of heavy Majorana neutrinos generate lepton family asymmetries, $Y_e, Y_{\mu}$ and $Y_{\tau}$. They are sensitive to CP violating phases in seesaw models. The time evolution of the lepton family asymmetries are derived by solving Boltzmann equations. By taking a minimal seesaw model, we show how each family asymmetry varies with a CP violating phase. For instance, we find the case that the lepton asymmetry is dominated by $Y_{\mu}$ or $Y_{\tau}$ depending on the choice of the CP violating phase. We also find the case that the signs of lepton family asymmetries $Y_{\mu}$ and $Y_{\tau}$ are opposite each other. Their absolute values can be larger than the total lepton asymmetry and the baryon asymmetry may result from the cancellation of the lepton family asymmetries.Comment: 26 pages, 8 figures, ptp.styl

On practical design for joint distributed source and network coding

This paper considers the problem of communicating correlated information from multiple source nodes over a network of noiseless channels to multiple destination nodes, where each destination node wants to recover all sources. The problem involves a joint consideration of distributed compression and network information relaying. Although the optimal rate region has been theoretically characterized, it was not clear how to design practical communication schemes with low complexity. This work provides a partial solution to this problem by proposing a low-complexity scheme for the special case with two sources whose correlation is characterized by a binary symmetric channel. Our scheme is based on a careful combination of linear syndrome-based Slepian-Wolf coding and random linear mixing (network coding). It is in general suboptimal; however, its low complexity and robustness to network dynamics make it suitable for practical implementation