A Phenomenological Expression for Deuteron Electromagnetic Form Factors Based on Perturbative QCD Predictions

For deuteron electromagnetic form factors,perturbative QCD(pQCD) predicts that $G^{+}_{00}$ becomes the dominate helicity amplitude and that $G^{+}_{+0}$ and $G^{+}_{+-}$ are suppressed by factors $\Lambda_{\rm QCD}/Q$ and $\Lambda_{\rm QCD}^2/Q^2$ at large $Q^2$,respectively. We try to discuss the higher order corrections beyond the pQCD asymptotic predictions by interpolating an analytical form to the intermediate energy region. From fitting the data,our results show that the helicity-zero to zero matrix element $G^{+}_{00}$ dominates the gross structure function $A(Q^2)$ in both of the large and intermediate energy regions; it is a good approximation for $G^{+}_{+-}$ to ignore the higher order contributions and the higher order corrections to $G^{+}_{+0}$ should be taken into account due to sizeable contributions in the intermediate energy region.Comment: 9 pages,3 figure

Optimization Framework and Graph-Based Approach for Relay-Assisted Bidirectional OFDMA Cellular Networks

This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using OFDMA for both uplink and downlink. The goal is to improve the overall system performance by exploring the full potential of the network in various dimensions including user, subcarrier, relay, and bidirectional traffic. In this work, we first introduce a novel three-time-slot time-division duplexing (TDD) transmission protocol. This protocol unifies direct transmission, one-way relaying and network-coded two-way relaying between the BS and each MS. Using the proposed three-time-slot TDD protocol, we then propose an optimization framework for resource allocation to achieve the following gains: cooperative diversity (via relay selection), network coding gain (via bidirectional transmission mode selection), and multiuser diversity (via subcarrier assignment). We formulate the problem as a combinatorial optimization problem, which is NP-complete. To make it more tractable, we adopt a graph-based approach. We first establish the equivalence between the original problem and a maximum weighted clique problem in graph theory. A metaheuristic algorithm based on any colony optimization (ACO) is then employed to find the solution in polynomial time. Simulation results demonstrate that the proposed protocol together with the ACO algorithm significantly enhances the system total throughput.Comment: 27 pages, 8 figures, 2 table