University of Cyprus

About: University of Cyprus is a education organization based out in Nicosia, Cyprus. It is known for research contribution in the topics: Large Hadron Collider & Context (language use). The organization has 3624 authors who have published 15157 publications receiving 412135 citations.

Search for long-lived particles that decay into final states containing two electrons or two muons in proton-proton collisions at s =8TeV

Abstract: A search is performed for long-lived particles that decay into final states that include a pair of electrons or a pair of muons. The experimental signature is a distinctive topology consisting of a pair of charged leptons originating from a displaced secondary vertex. Events corresponding to an integrated luminosity of 19.6 (20.5) inverse femtobarns in the electron (muon) channel were collected with the CMS detector at the CERN LHC in proton-proton collisions at sqrt(s) = 8 TeV. No significant excess is observed above standard model expectations. Upper limits on the product of the cross section and branching fraction of such a signal are presented as a function of the long-lived particle's mean proper decay length. The limits are presented in an approximately model-independent way, allowing them to be applied to a wide class of models yielding the above topology. Over much of the investigated parameter space, the limits obtained are the most stringent to date. In the specific case of a model in which a Higgs boson in the mass range 125-1000 GeV decays into a pair of long-lived neutral bosons in the mass range 20-350 GeV, each of which can then decay to dileptons, the upper limits obtained are typically in the range 0.2-10 fb for mean proper decay lengths of the long-lived particles in the range 0.01-100 cm. In the case of the lowest Higgs mass considered (125 GeV), the limits are in the range 2-50 fb. These limits are sensitive to Higgs boson branching fractions as low as 1E-4.

Average Consensus in the Presence of Delays in Directed Graph Topologies

Abstract: Classical distributed algorithms for asymptotic average consensus typically assume timely and reliable exchange of information between neighboring components of a given multi-component system. These assumptions are not necessarily valid in practice due to varying delays that might affect computations at different nodes and/or transmissions at different links. In this work, we propose a protocol that overcomes this limitation and, unlike existing consensus protocols in the presence of delays, ensures asymptotic consensus to the exact average, despite the presence of arbitrary (but bounded) delays in the communication links. The protocol requires that each component has knowledge of the number of its out-neighbors (i.e., the number of components to which it can send information) and its proof of correctness relies on the weak convergence of a backward product of column stochastic matrices. The proposed algorithm is demonstrated via illustrative examples.

A search for a doubly-charged Higgs boson in pp collisions at √s=7 TeV

Abstract: A search for a doubly-charged Higgs boson in pp collisions at root s = 7 TeV is presented. The data correspond to an integrated luminosity of 4.9 fb(-1), collected by the CMS experiment at the LHC. The search is performed using events with three or more isolated charged leptons of any flavor, giving sensitivity to the decays of pair-produced triplet components Phi(++)Phi(--), and Phi(++)Phi(-) from associated production. No excess is observed compared to the background prediction, and upper limits at the 95 % confidence level are set on the Phi(++) production cross section, under specific assumptions on its branching fractions. Lower bounds on the Phi(++) mass are reported, providing significantly more stringent constraints than previously published limits.