Intrinsic Regularization Method in QCD

There exist certain intrinsic relations between the ultraviolet divergent graphs and the convergent ones at the same loop order in renormalizable quantum field theories. Whereupon we may establish a new method, the intrinsic regularization method, to regularize those divergent graphs. In this paper, we apply this method to QCD at the one loop order. It turns out to be satisfactory:The gauge invariance is preserved manifestly and the results are the same as those derived by means of other regularization methods.Comment: 18 pages, LaTeX , 7 figures in a separate compressed postscript fil

Long Text Generation via Adversarial Training with Leaked Information

Automatically generating coherent and semantically meaningful text has many applications in machine translation, dialogue systems, image captioning, etc. Recently, by combining with policy gradient, Generative Adversarial Nets (GAN) that use a discriminative model to guide the training of the generative model as a reinforcement learning policy has shown promising results in text generation. However, the scalar guiding signal is only available after the entire text has been generated and lacks intermediate information about text structure during the generative process. As such, it limits its success when the length of the generated text samples is long (more than 20 words). In this paper, we propose a new framework, called LeakGAN, to address the problem for long text generation. We allow the discriminative net to leak its own high-level extracted features to the generative net to further help the guidance. The generator incorporates such informative signals into all generation steps through an additional Manager module, which takes the extracted features of current generated words and outputs a latent vector to guide the Worker module for next-word generation. Our extensive experiments on synthetic data and various real-world tasks with Turing test demonstrate that LeakGAN is highly effective in long text generation and also improves the performance in short text generation scenarios. More importantly, without any supervision, LeakGAN would be able to implicitly learn sentence structures only through the interaction between Manager and Worker.Comment: 14 pages, AAAI 201

Real-Time Bidding by Reinforcement Learning in Display Advertising

The majority of online display ads are served through real-time bidding (RTB) --- each ad display impression is auctioned off in real-time when it is just being generated from a user visit. To place an ad automatically and optimally, it is critical for advertisers to devise a learning algorithm to cleverly bid an ad impression in real-time. Most previous works consider the bid decision as a static optimization problem of either treating the value of each impression independently or setting a bid price to each segment of ad volume. However, the bidding for a given ad campaign would repeatedly happen during its life span before the budget runs out. As such, each bid is strategically correlated by the constrained budget and the overall effectiveness of the campaign (e.g., the rewards from generated clicks), which is only observed after the campaign has completed. Thus, it is of great interest to devise an optimal bidding strategy sequentially so that the campaign budget can be dynamically allocated across all the available impressions on the basis of both the immediate and future rewards. In this paper, we formulate the bid decision process as a reinforcement learning problem, where the state space is represented by the auction information and the campaign's real-time parameters, while an action is the bid price to set. By modeling the state transition via auction competition, we build a Markov Decision Process framework for learning the optimal bidding policy to optimize the advertising performance in the dynamic real-time bidding environment. Furthermore, the scalability problem from the large real-world auction volume and campaign budget is well handled by state value approximation using neural networks.Comment: WSDM 201

The Exclusivity Principle Determines the Correlation Monogamy

Adopting the graph-theoretic approach to the correlation experiments, we analyze the origin of monogamy and prove that it can be recognised as a consequence of exclusivity principle(EP). We provide an operational criterion for monogamy: if the fractional packing number of the graph corresponding to the union of event sets of several physical experiments does not exceed the sum of independence numbers of each individual experiment graph, then these experiments are monogamous. As applications of this observation, several examples are provided, including the monogamy for experiments of Clauser-Horne-Shimony-Holt (CHSH) type, Klyachko-Can-Binicio\u{g}lu-Shumovsky (KCBS) type, and for the first time we give some monogamy relations of Swetlichny's genuine nonlocality. We also give the necessary and sufficient condition for several experiments to be monogamous: several experiments are monogamous if and only if the Lov\'asz number the union exclusive graph is less than or equal to the sum of independence numbers of each exclusive graph

Diquarks and the Semi-Leptonic Decay of Λb\Lambda_{b} in the Hybrid Scheme

In this work we use the heavy-quark-light-diquark picture to study the semileptonic decay $\Lambda_b \to \Lambda_c+l+\bar{\nu}_l$ in the so-called hybrid scheme. Namely, we apply the heavy quark effective theory (HQET) for larger $q^2$ (corresponding to small recoil), which is the invariant mass square of $l+\bar\nu$, whereas the perturbative QCD approach for smaller $q^2$ to calculate the form factors. The turning point where we require the form factors derived in the two approaches to be connected, is chosen near $\rho_{cut}=1.1$. It is noted that the kinematic parameter $\rho$ which is usually adopted in the perturbative QCD approach, is in fact exactly the same as the recoil factor $\omega=v\cdot v'$ used in HQET where $v$, $v'$ are the four velocities of $\Lambda_b$ and $\Lambda_c$ respectively. We find that the final result is not much sensitive to the choice, so that it is relatively reliable. Moreover, we apply a proper numerical program within a small range around $\rho_{cut}$ to make the connection sufficiently smooth and we parameterize the form factor by fitting the curve gained in the hybrid scheme. The expression and involved parameters can be compared with the ones gained by fitting the experimental data. In this scheme the end-point singularities do not appear at all. The calculated value is satisfactorily consistent with the data which is recently measured by the DELPHI collaboration within two standard deviations.Comment: 16 pages, including 4 figures, revtex

Systematic study of elliptic flow parameter in the relativistic nuclear collisions at RHIC and LHC energies

We employed the new issue of a parton and hadron cascade model PACIAE 2.1 to systematically investigate the charged particle elliptic flow parameter $v_2$ in the relativistic nuclear collisions at RHIC and LHC energies. With randomly sampling the transverse momentum $x$ and $y$ components of the particles generated in string fragmentation on the circumference of an ellipse instead of circle originally, the calculated charged particle $v_2(\eta)$ and $v_2(p_T)$ fairly reproduce the corresponding experimental data in the Au+Au/Pb+Pb collisions at $\sqrt{s_{NN}}$=0.2/2.76 TeV. In addition, the charged particle $v_2(\eta)$ and $v_2(p_T)$ in the p+p collisions at $\sqrt s$=7 TeV as well as in the p+Au/p+Pb collisions at $\sqrt{s_{NN}}$=0.2/5.02 TeV are predicted.Comment: 7 pages, 5 figure

A UPnP-based Decentralized Service Discovery Improved Algorithm

The current UPnP service discovery algorithm in the presence of the service can cause severe drops in the digital home network. The reason is that the root devices instantly send delay sending response messages and randomly selected independent response message congestion through simulation analysis. To solve these problems, an improved UPnP service discovery algorithm was given. Considering the length of the message and the bandwidth of the router, derived by testing the router the packet loss rate can be reduce