Phenomenological discriminations of the Yukawa interactions in two-Higgs doublet models with Z2Z_2 symmetry

There are four types of two-Higgs doublet models under a discrete $Z_2$ symmetry imposed to avoid tree-level flavour-changing neutral current, i.e. type-I, type-II, type-X and type-Y models. We investigate the possibility to discriminate the four models in the light of the flavour physics data, including $B_s-\bar B_s$ mixing, $B_{s,d} \to \mu^+ \mu^-$, $B\to \tau\nu$ and $\bar B \to X_s \gamma$ decays, the recent LHC Higgs data, the direct search for charged Higgs at LEP, and the constraints from perturbative unitarity and vacuum stability. After deriving the combined constraints on the Yukawa interaction parameters, we have shown that the correlation between the mass eigenstate rate asymmetry $A_{\Delta\Gamma}$ of $B_{s} \to \mu^+ \mu^-$ and the ratio $R={\cal B}(B_{s} \to \mu^+ \mu^-)_{exp}/ {\cal B}(B_{s} \to \mu^+ \mu^-)_{SM}$ could be sensitive probe to discriminate the four models with future precise measurements of the observables in the $B_{s} \to \mu^+ \mu^-$ decay at LHCb.Comment: 29 pages, 4 tables, 11 figures. v3: minor corrections included, matches published version in EPJ

Information-Coupled Turbo Codes for LTE Systems

We propose a new class of information-coupled (IC) Turbo codes to improve the transport block (TB) error rate performance for long-term evolution (LTE) systems, while keeping the hybrid automatic repeat request protocol and the Turbo decoder for each code block (CB) unchanged. In the proposed codes, every two consecutive CBs in a TB are coupled together by sharing a few common information bits. We propose a feed-forward and feed-back decoding scheme and a windowed (WD) decoding scheme for decoding the whole TB by exploiting the coupled information between CBs. Both decoding schemes achieve a considerable signal-to-noise-ratio (SNR) gain compared to the LTE Turbo codes. We construct the extrinsic information transfer (EXIT) functions for the LTE Turbo codes and our proposed IC Turbo codes from the EXIT functions of underlying convolutional codes. An SNR gain upper bound of our proposed codes over the LTE Turbo codes is derived and calculated by the constructed EXIT charts. Numerical results show that the proposed codes achieve an SNR gain of 0.25 dB to 0.72 dB for various code parameters at a TB error rate level of $10^{-2}$, which complies with the derived SNR gain upper bound.Comment: 13 pages, 12 figure

Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times

2004-2005 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

Approximating the selected-internal Steiner tree

AbstractIn this paper, we consider a variant of the well-known Steiner tree problem. Given a complete graph G=(V,E) with a cost function c:E→R+ and two subsets R and R′ satisfying R′⊂R⊆V, a selected-internal Steiner tree is a Steiner tree which contains (or spans) all the vertices in R such that each vertex in R′ cannot be a leaf. The selected-internal Steiner tree problem is to find a selected-internal Steiner tree with the minimum cost. In this paper, we present a 2ρ-approximation algorithm for the problem, where ρ is the best-known approximation ratio for the Steiner tree problem

Differential and Difference Equations for Recurrence Coefficients of Orthogonal Polynomials with a Singularly Perturbed Laguerre-type Weight

We are concerned with the monic orthogonal polynomials with respect to a singularly perturbed Laguerre-type weight. By using the ladder operator approach, we derive a complicated system of nonlinear second-order difference equations satisfied by the recurrence coefficients. This allows us to derive the large $n$ asymptotic expansions of the recurrence coefficients. In addition, we also obtain a system of differential-difference equations for the recurrence coefficients