Immersion on the Edge: A Cooperative Framework for Mobile Immersive Computing

Immersive computing (IC) technologies such as virtual reality and augmented reality are gaining tremendous popularity. In this poster, we present CoIC, a Cooperative framework for mobile Immersive Computing. The design of CoIC is based on a key insight that IC tasks among different applications or users might be similar or redundant. CoIC enhances the performance of mobile IC applications by caching and sharing computation-intensive IC results on the edge. Our preliminary evaluation results on an AR application show that CoIC can reduce the recognition and rendering latency by up to 52.28% and 75.86% respectively on current mobile devices.Comment: This poster has been accepted by the SIGCOMM in June 201

Bs1∗B∗KB^{\ast}_{s1}B^{\ast}K form factor from QCD sum rules

In this article, we calculate the form factors and the coupling constant of the $g_{B^{\ast}_{s1}B^{\ast} K}$ vertex in the framework of the three-point QCD sum rules. Three point correlation functions responsible for the vertex are evaluated by considering both $B^{\ast}$ and $K$ mesons as off-shell states. The form factors obtained are different if the $B^{\ast}$ or the $K$ meson is off-shell but give the same coupling constant.Comment: 12 pages, 6 figures. arXiv admin note: text overlap with arXiv:1009.5320 by other author

Could Zc(4025)Z_{c}(4025) be a JP=1+J^{P}=1^{+} D∗D∗ˉD^{*}\bar{D^{*}} molecular state?

We investigate whether the newly observed narrow resonance $Z_{c}(4025)$ can be described as a $D^{*}\bar{D^{*}}$ molecular state with quantum numbers $J^{P}=1^{+}$. Using QCD sum rules, we consider contributions up to dimension six in the operator product expansion and work at leading order of $\alpha_{s}$. The mass obtained for this state is (4.05\pm 0.28) \mbox{GeV}. It is concluded that $D^{*}\bar{D^{*}}$ molecular state is a possible candidate for $Z_{c}(4025)$.Comment: 7 pages, 4 figures.Published in Eur.Phys.J. C73 (2013) 2661. arXiv admin note: text overlap with arXiv:1304.185

The Explicit Derivation of QED Trace Anomaly in Symmetry-Preserving Loop Regularization at One Loop Level

The QED trace anomaly is calculated at one-loop level based on the loop regularization method which is realized in 4-dimensional spacetime and preserves gauge symmetry and Poincare symmetry in spite of the introduction of two mass scales, namely the ultraviolet (UV) cut-off $M_c$ and infrared (IR) cut-off $\mu_s$. It is shown that the dilation Ward identity which relates the three-point diagrams with the vacuum polarization diagrams gets the standard form of trace anomaly through quantum corrections in taking the consistent limit $M_c\to \infty$ and $\mu_s = 0$ which recovers the original integrals. This explicitly demonstrates that the loop regularization method is indeed a self-consistent regularization scheme which is applicable to the calculations not only for the chiral anomaly but also for the trace anomaly, at least at one-loop level. It is also seen that the consistency conditions which relates the tensor-type and scalar-type irreducible loop integrals (ILIs) are crucial for obtaining a consistent result. As a comparison, we also present the one-loop calculations by using the usual Pauli-Villars regularization and the dimensional regularization.Comment: 13 pages, 2 figure

Towards a System Theoretic Approach to Wireless Network Capacity in Finite Time and Space

In asymptotic regimes, both in time and space (network size), the derivation of network capacity results is grossly simplified by brushing aside queueing behavior in non-Jackson networks. This simplifying double-limit model, however, lends itself to conservative numerical results in finite regimes. To properly account for queueing behavior beyond a simple calculus based on average rates, we advocate a system theoretic methodology for the capacity problem in finite time and space regimes. This methodology also accounts for spatial correlations arising in networks with CSMA/CA scheduling and it delivers rigorous closed-form capacity results in terms of probability distributions. Unlike numerous existing asymptotic results, subject to anecdotal practical concerns, our transient one can be used in practical settings: for example, to compute the time scales at which multi-hop routing is more advantageous than single-hop routing