Decomposition of SU(N) connection and Effective Theory of SU(N) QCD

We give a general decomposition of SU(N) connection and derive a generalized Skyrme-Faddeev action as the effective action of SU(N) QCD in the low energy limit. The result is obtained by separating the topological degrees which describes the non-Abelian monopoles from the dynamical degree of gauge potential, and integrating all the dynamical degrees of SU(N) QCD.Comment: retex, 7 page

Signature of the γ\gamma+jet and dijet production mediated by an excited quark with QCD next-to-leading order accuracy at the LHC

We present a detailed study of the production and decay of the excited quark at the QCD next-to-leading order (NLO) level at the Large Hadron Collider, using the narrow width approximation and helicity amplitudes method. We find that the QCD NLO corrections can tighten the constraints on the model parameters and reduce the scale dependencies of the total cross sections. We discuss the signals of the excited quark production with decay mode $q^{\ast}\rightarrow q\gamma$ and $q^{\ast}\rightarrow qg$, and present several important kinematic distributions. Moreover, we give the upper limits of the excited quark excluded mass range and the allowed parameter space for the coupling constants and the excited quark mass.Comment: 20 pages, 13 figures; version published in PR

Optimal relaying in heterogeneous delay tolerant networks

In Delay Tolerant Networks (DTNs), there exists only intermittent connectivity between communication sources and destinations. In order to provide successful communication services for these challenged networks, a variety of relaying and routing algorithms have been proposed with the assumption that nodes are homogeneous in terms of contact rates and delivery costs. However, various applications of DTN have shown that mobile nodes should be divided into different classes in terms of their energy requirements and communication ability, and real application data have revealed the heterogeneous contact rates between node pairs. In this paper, we design an optimal relaying scheme for DTNs, which takes into account nodes’ heterogeneous contact rates and delivery costs when selecting relays to minimise the delivery cost while satisfying the required message delivery probability. Extensive results based on real traces demonstrate that our relaying scheme requires the least delivery cost and achieves the largest maximum delivery probability, compared with the schemes that neglect nodes’ heterogeneity