Exotic QQqˉqˉQQ\bar{q}\bar{q}, QQqˉsˉQQ\bar{q}\bar{s} and QQsˉsˉQQ\bar{s}\bar{s} states

After constructing the possible $J^P=0^-, 0^+, 1^-$ and $1^+$ $QQ\bar{q}\bar{q}$ tetraquark interpolating currents in a systematic way, we investigate the two-point correlation functions and extract the corresponding masses with the QCD sum rule approach. We study the $QQ\bar{q}\bar{q}$, $QQ\bar{q}\bar{s}$ and $QQ\bar{s}\bar{s}$ systems with various isospins $I=0, 1/2, 1$. Our numerical analysis indicates that the masses of doubly-bottomed tetraquark states are below the threshold of the two bottom mesons, two bottom baryons and one doubly bottomed baryon plus one anti-nucleon. Very probably these doubly-bottomed tetraquark states are stable.Comment: 37 pages, 2 figure

Possible JPC=0+−J^{PC} = 0^{+-} Exotic State

We study the possible exotic states with $J^{PC} = 0^{+-}$ using the tetraquark interpolating currents with the QCD sum rule approach. The extracted masses are around 4.85 GeV for the charmonium-like states and 11.25 GeV for the bottomomium-like states. There is no working region for the light tetraquark currents, which implies the light $0^{+-}$ state may not exist below 2 GeV.Comment: 13 pages, 11 figures, 2 table

A Numerical Analysis to the {π\pi} and {K} Coupled--Channel Scalar Form-factor

A numerical analysis to the scalar form-factor in the $\pi\pi$ and KK coupled--channel system is made by solving the coupled-channel dispersive integral equations, using the iteration method. The solutions are found not unique. Physical application to the $\pi\pi$ central production in the $pp\to pp\pi\pi$ process is discussed based upon the numerical solutions we found.Comment: 8 pages, Latex, 3 figures. Minor changes and one reference adde

Spin-1 charmonium-like states in QCD sum rule

We study the possible spin-1 charmonium-like states by using QCD sum rule approach. We calculate the two-point correlation functions for all the local form tetraquark interpolating currents with $J^{PC}=1^{--}, 1^{-+}, 1^{++}$ and $1^{+-}$ and extract the masses of the tetraquark charmonium-like states. The mass of the $1^{--}$ $qc\bar q\bar c$ state is $4.6\sim4.7$ GeV, which implies a possible tetraquark interpretation for Y(4660) meson. The masses for both the $1^{++}$ $qc\bar q\bar c$ and $sc\bar s\bar c$ states are $4.0\sim 4.2$ GeV, which is slightly above the mass of X(3872). For the $1^{-+}$ and $1^{+-}$ $qc\bar q\bar c$ states, the extracted masses are $4.5\sim4.7$ GeV and $4.0\sim 4.2$ GeV respectively.Comment: 7 pages, 2 figures. arXiv admin note: substantial text overlap with arXiv:1010.339

Combining Traditional Marketing and Viral Marketing with Amphibious Influence Maximization

In this paper, we propose the amphibious influence maximization (AIM) model that combines traditional marketing via content providers and viral marketing to consumers in social networks in a single framework. In AIM, a set of content providers and consumers form a bipartite network while consumers also form their social network, and influence propagates from the content providers to consumers and among consumers in the social network following the independent cascade model. An advertiser needs to select a subset of seed content providers and a subset of seed consumers, such that the influence from the seed providers passing through the seed consumers could reach a large number of consumers in the social network in expectation. We prove that the AIM problem is NP-hard to approximate to within any constant factor via a reduction from Feige's k-prover proof system for 3-SAT5. We also give evidence that even when the social network graph is trivial (i.e. has no edges), a polynomial time constant factor approximation for AIM is unlikely. However, when we assume that the weighted bi-adjacency matrix that describes the influence of content providers on consumers is of constant rank, a common assumption often used in recommender systems, we provide a polynomial-time algorithm that achieves approximation ratio of $(1-1/e-\epsilon)^3$ for any (polynomially small) $\epsilon > 0$. Our algorithmic results still hold for a more general model where cascades in social network follow a general monotone and submodular function.Comment: An extended abstract appeared in the Proceedings of the 16th ACM Conference on Economics and Computation (EC), 201

Boosting Information Spread: An Algorithmic Approach

The majority of influence maximization (IM) studies focus on targeting influential seeders to trigger substantial information spread in social networks. In this paper, we consider a new and complementary problem of how to further increase the influence spread of given seeders. Our study is motivated by the observation that direct incentives could "boost" users so that they are more likely to be influenced by friends. We study the $k$-boosting problem which aims to find $k$ users to boost so that the final "boosted" influence spread is maximized. The $k$-boosting problem is different from the IM problem because boosted users behave differently from seeders: boosted users are initially uninfluenced and we only increase their probability to be influenced. Our work also complements the IM studies because we focus on triggering larger influence spread on the basis of given seeders. Both the NP-hardness of the problem and the non-submodularity of the objective function pose challenges to the $k$-boosting problem. To tackle the problem on general graphs, we devise two efficient algorithms with the data-dependent approximation ratio. For the $k$-boosting problem on bidirected trees, we present an efficient greedy algorithm and a rounded dynamic programming that is a fully polynomial-time approximation scheme. We conduct extensive experiments using real social networks and synthetic bidirected trees. We show that boosting solutions returned by our algorithms achieves boosts of influence that are up to several times higher than those achieved by boosting solutions returned by intuitive baselines, which have no guarantee of solution quality. We also explore the "budget allocation" problem in our experiments. Compared with targeting seeders with all budget, larger influence spread is achieved when we allocation the budget to both seeders and boosted users