A search is conducted for a low-mass charged Higgs boson produced in a top quark decay and subsequently decaying into a charm and a strange quark. The data sample was recorded in proton-proton collisions at s=13 TeV ...
详细信息
A search is conducted for a low-mass charged Higgs boson produced in a top quark decay and subsequently decaying into a charm and a strange quark. The data sample was recorded in proton-proton collisions at s=13 TeV by the CMS experiment at the LHC and corresponds to an integrated luminosity of 35.9 fb−1. The search is performed in the process of top quark pair production, where one top quark decays to a bottom quark and a charged Higgs boson and the other to a bottom quark and a W boson. With the W boson decaying to a charged lepton (electron or muon) and a neutrino, the final state comprises an isolated lepton, missing transverse momentum, and at least four jets, of which two are tagged as b jets. To enhance the search sensitivity, one of the jets originating from the charged Higgs boson is required to satisfy a charm tagging selection. No significant excess beyond standard model predictions is found in the dijet invariant mass distribution. An upper limit in the range 1.68%–0.25% is set on the branching fraction of the top quark decay to the charged Higgs boson and bottom quark for a charged Higgs boson mass between 80 and 160 GeV.
A search is described for the production of a pair of bottom-type vectorlike quarks (VLQs), each decaying into a b or b¯ quark and either a Higgs or a Z boson, with a mass greater than 1000 GeV. The analysis is b...
详细信息
A search is described for the production of a pair of bottom-type vectorlike quarks (VLQs), each decaying into a b or b¯ quark and either a Higgs or a Z boson, with a mass greater than 1000 GeV. The analysis is based on data from proton-proton collisions at a 13 TeV center-of-mass energy recorded at the CERN LHC, corresponding to a total integrated luminosity of 137 fb−1. As the predominant decay modes of the Higgs and Z bosons are to a pair of quarks, the analysis focuses on final states consisting of jets resulting from the six quarks produced in the events. Since the two jets produced in the decay of a highly Lorentz-boosted Higgs or Z boson can merge to form a single jet, nine independent analyses are performed, categorized by the number of observed jets and the reconstructed event mode. No signal in excess of the expected background is observed. Lower limits are set on the VLQ mass at 95% confidence level equal to 1570 GeV in the case where the VLQ decays exclusively to a b quark and a Higgs boson, 1390 GeV for when it decays exclusively to a b quark and a Z boson, and 1450 GeV for when it decays equally in these two modes. These limits represent significant improvements over the previously published VLQ limits.
A search for new physics in top quark production is performed in proton-proton collisions at 13 TeV. The data set corresponds to an integrated luminosity of 35.9 fb−1 collected in 2016 with the CMS detector. Events wi...
详细信息
A search is presented for a narrow resonance decaying to a pair of oppositely charged muons using √s = 13 TeV proton-proton collision data recorded at the LHC. In the 45–75 and 110–200 GeV resonance mass ranges, th...
详细信息
Recommendation system, as an information filtering method, has been widely applied and the hybrid recommendation algorithm is by far the most commonly used technique. But in the field of online learning system, recomm...
详细信息
The explosive growth of the internet and the emergence of e-commerce have given rise to the fast development of recommendation algorithms-a kind of personalized information collection technology used to gather a set o...
详细信息
This paper considers two mutual-information based approaches for clustering random variables proposed in the literature: clustering by mutual information relevance networks (MIRNs) and clustering by multivariate mutua...
详细信息
ISBN:
(纸本)9781509018253
This paper considers two mutual-information based approaches for clustering random variables proposed in the literature: clustering by mutual information relevance networks (MIRNs) and clustering by multivariate mutual information (MMI). Despite being two seemingly very different approaches, the derived clustering solutions share very strong structural similarity. Motivated by this curious fact, in this paper we show that there is a precise connection between these two clustering solutions via the celebrated Chow-Liu tree algorithm in machine learning: Under a Chow-Liu tree approximation to the underlying joint distribution, the clustering solutions provided by MIRNs and by MMI are, in fact, identical. This solidifies the heuristic view of clustering by MMI as a natural generalization of clustering by MIRNs from dependency-tree distributions to general joint distributions.
Proving or disproving an information inequality is a crucial step in establishing the converse results in the coding theorems of communication networks. However, next generation networks are very large-scale, typicall...
详细信息
ISBN:
(纸本)9781479958320
Proving or disproving an information inequality is a crucial step in establishing the converse results in the coding theorems of communication networks. However, next generation networks are very large-scale, typically involving multiple users and many transceivers and relays. This means that an information inequality involving many random variables can be difficult to be proved or disproved manually. In HI, Yeung developed a framework that uses linear programming for verifying linear information inequalities, and it was recently shown in 121 that this framework can be used to explicitly construct an analytic proof of an information inequality or an analytic counterexample to disprove it if the inequality is not true in general. In this paper, we consider the construction of the smallest counterexample, and also give sufficient conditions for that the inequality can be manipulated to become true. We also describe the software development of automating this analytical framework enabled by cloud computing to analytically verify information inequalities in large-scale problem setting.
BATS code is a low-complexity random linear networkcoding scheme that can achieve asymptotic bandwidth optimality for many types of networks with packet loss. In this paper, we propose a BATS code based network proto...
详细信息
暂无评论