9,428 research outputs found
Fully open-flavor tetraquark states and with
We have studied the masses for fully open-flavor tetraquark states
and with quantum numbers
. We systematically construct all diquark-antiquark
interpolating currents and calculate the two-point correlation functions and
spectral densities in the framework of QCD sum rule method. Our calculations
show that the masses are about GeV for the
tetraquark states and GeV for the tetraquarks. The
masses of tetraquarks are below the thresholds of
and final states for the scalar and
axial-vector channels respectively. The tetraquark states
with lie below the and thresholds.
Such low masses for these possible tetraquark states indicate that they can
only decay via weak interaction and thus are very narrow and stable.Comment: 17 pages, 4 figure
Optimum buckling design of composite stiffened panels using ant colony algorithm
Optimal design of laminated composite stiffened panels of symmetric and balanced layup with different number of T-shape stiffeners is investigated and presented. The stiffened panels are simply supported and subjected to uniform biaxial compressive load. In the optimization for the maximum buckling load without weight penalty, the panel skin and the stiffened laminate stacking sequence, thickness and the height of the stiffeners are chosen as design variables. The optimization is carried out by applying an ant colony algorithm (ACA) with the ply contiguous constraint taken into account. The finite strip method is employed in the buckling analysis of the stiffened panels. The results shows that the buckling load increases dramatically with the number of stiffeners at first, and then has only a small improvement after the number of stiffeners reaches a certain value. An optimal layup of the skin and stiffener laminate has also been obtained by using the ACA. The methods presented in this paper should be applicable to the design of stiffened composite panels in similar loading conditions
The Gaussian Multiple Access Diamond Channel
In this paper, we study the capacity of the diamond channel. We focus on the
special case where the channel between the source node and the two relay nodes
are two separate links with finite capacities and the link from the two relay
nodes to the destination node is a Gaussian multiple access channel. We call
this model the Gaussian multiple access diamond channel. We first propose an
upper bound on the capacity. This upper bound is a single-letterization of an
-letter upper bound proposed by Traskov and Kramer, and is tighter than the
cut-set bound. As for the lower bound, we propose an achievability scheme based
on sending correlated codes through the multiple access channel with
superposition structure. We then specialize this achievable rate to the
Gaussian multiple access diamond channel. Noting the similarity between the
upper and lower bounds, we provide sufficient and necessary conditions that a
Gaussian multiple access diamond channel has to satisfy such that the proposed
upper and lower bounds meet. Thus, for a Gaussian multiple access diamond
channel that satisfies these conditions, we have found its capacity.Comment: submitted to IEEE Transactions on Information Theor
On various restricted sumsets
For finite subsets A_1,...,A_n of a field, their sumset is given by
{a_1+...+a_n: a_1 in A_1,...,a_n in A_n}. In this paper we study various
restricted sumsets of A_1,...,A_n with restrictions of the following forms:
a_i-a_j not in S_{ij}, or alpha_ia_i not=alpha_ja_j, or a_i+b_i not=a_j+b_j
(mod m_{ij}). Furthermore, we gain an insight into relations among recent
results on this area obtained in quite different ways.Comment: 11 pages; final version for J. Number Theor
- β¦