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.

Searches for supersymmetry using the M-T2 variable in hadronic events produced in pp collisions at 8 TeV

Abstract: Searches for supersymmetry (SUSY) are performed using a sample of hadronic events produced in 8 TeV pp collisions at the CERN LHC. The searches are based on the MT2 variable, which is a measure of the transverse momentum imbalance in an event. The data were collected with the CMS detector and correspond to an integrated luminosity of 19.5 inverse femtobarns. Two related searches are performed. The first is an inclusive search based on signal regions defined by the value of the MT2 variable, the hadronic energy in the event, the jet multiplicity, and the number of jets identified as originating from bottom quarks. The second is a search for a mass peak corresponding to a Higgs boson decaying to a bottom quark-antiquark pair, where the Higgs boson is produced as a decay product of a SUSY particle. For both searches, the principal backgrounds are evaluated with data control samples. No significant excess over the expected number of background events is observed, and exclusion limits on various SUSY models are derived.

Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces

Abstract: We show that complex (scale-free) network topologies naturally emerge from hyperbolic metric spaces. Hyperbolic geometry facilitates maximally efficient greedy forwarding in these networks. Greedy forwarding is topology-oblivious. Nevertheless, greedy packets find their destinations with 100% probability following almost optimal shortest paths. This remarkable efficiency sustains even in highly dynamic networks. Our findings suggest that forwarding information through complex networks, such as the Internet, is possible without the overhead of existing routing protocols, and may also find practical applications in overlay networks for tasks such as application-level routing, information sharing, and data distribution.

C2P: Clustering based on Closest Pairs

Abstract: In this paper we present C 2 P, a new clustering algorithm for large spatial databases, which exploits spatial access methods for the determination of closest pairs. Several extensions are presented for scalable clustering in large databases that contain clusters of various shapes and outliers. Due to its characteristics, the proposed algorithm attains the advantages of hierarchical clustering and graphtheoretic algorithms providing both efficiency and quality of clustering result. The superiority of C 2 P is verified both with analytical and experimental results.

Search for new phenomena with the $M_{\mathrm {T2}}$ variable in the all-hadronic final state produced in proton-proton collisions at $\sqrt{s} = 13$ $\,\text {TeV}

Abstract: A search for new phenomena is performed using events with jets and significant transverse momentum imbalance, as inferred through the $M_{\mathrm {T2}}$ variable The results are based on a sample of proton–proton collisions collected in 2016 at a center-of-mass energy of 13 $\,\text {TeV}$ with the CMS detector and corresponding to an integrated luminosity of 359 $\,\text {fb}^\text {-1}$ No excess event yield is observed above the predicted standard model background, and the results are interpreted as exclusion limits at 95% confidence level on the masses of predicted particles in a variety of simplified models of R-parity conserving supersymmetry Depending on the details of the model, 95% confidence level lower limits on the gluino (light-flavor squark) masses are placed up to 2025 (1550) $\,\text {GeV}$ Mass limits as high as 1070 (1175) $\,\text {GeV}$ are set on the masses of top (bottom) squarks Information is provided to enable re-interpretation of these results, including model-independent limits on the number of non-standard model events for a set of simplified, inclusive search regions