Searches for Prompt RR-Parity-Violating Supersymmetry at the LHC

Searches for supersymmetry (SUSY) at the LHC frequently assume the conservation of $R$-parity in their design, optimization and interpretation. In the case that $R$-parity is not conserved, constraints on SUSY particle masses tend to be weakened with respect to $R$-parity-conserving models. We review the current status of searches for $R$-parity-violating (RPV) supersymmetry models at the ATLAS and CMS experiments, limited to 8 TeV search results published or submitted for publication as of the end of March 2015. All forms of renormalisable RPV terms leading to prompt signatures have been considered in the set of analyses under review. Discussing results for searches for prompt R-parity-violating SUSY signatures summarizes the main constraints for various RPV models from LHC Run I and also defines the basis for promising signal regions to be optimized for Run II. In addition to identifying highly constrained regions from existing searches, also gaps in the coverage of the parameter space of RPV SUSY are outlined

Approximating Optimal Bounds in Prompt-LTL Realizability in Doubly-exponential Time

We consider the optimization variant of the realizability problem for Prompt Linear Temporal Logic, an extension of Linear Temporal Logic (LTL) by the prompt eventually operator whose scope is bounded by some parameter. In the realizability optimization problem, one is interested in computing the minimal such bound that allows to realize a given specification. It is known that this problem is solvable in triply-exponential time, but not whether it can be done in doubly-exponential time, i.e., whether it is just as hard as solving LTL realizability. We take a step towards resolving this problem by showing that the optimum can be approximated within a factor of two in doubly-exponential time. Also, we report on a proof-of-concept implementation of the algorithm based on bounded LTL synthesis, which computes the smallest implementation of a given specification. In our experiments, we observe a tradeoff between the size of the implementation and the bound it realizes. We investigate this tradeoff in the general case and prove upper bounds, which reduce the search space for the algorithm, and matching lower bounds.Comment: In Proceedings GandALF 2016, arXiv:1609.0364

A heuristics approach for classroom scheduling using genetic algorithm technique

Reshuffling and arranging classroom based on the capacity of the audience, complete facilities, lecturing time and many more may lead to a complexity of classroom scheduling. While trying to enhance the efficiency in classroom planning, this paper proposes a heuristic approach for timetabling optimization. A new algorithm was produced to take care of the timetabling problem in a university. The proposed of heuristics approach will prompt a superior utilization of the accessible classroom space for a given time table of courses at the university. Genetic Algorithm through Java programming languages were used in this study and aims at reducing the conflicts and optimizes the fitness. The algorithm considered the quantity of students in each class, class time, class size, time accessibility in each class and lecturer who in charge of the classes

Seeking for sterile neutrinos with displaced leptons at the LHC

We study the signal of long-lived sterile neutrino at the LHC produced through the decay of the $W$ boson. It decays into charged lepton and jets. The characteristic signature is a hard prompt lepton and a lepton from the displaced decay of the sterile neutrino, which leads to a bundle of displaced tracks with large transverse impact parameter. Different from other studies, we neither reconstruct the displaced vertex nor place requirement on its invariant mass to maintain sensitivity for low sterile neutrino masses. Instead, we focus on the displaced track from the lepton. A difficulty for low mass sterile neutrino study is that the displaced lepton is usually \textit{non-isolated}. Therefore, leptons from heavy flavor quark is the major source of background. We closely follow a search for displaced electron plus muon search at CMS and study their control regions, which is related to our signal regions, in great detail to develop a robust estimation of the background for our signals. After further optimization on the signal limiting the number of jets, low $H_T$ and large lepton displacement $d_0$ to suppress SM background, we reach an exclusion sensitivity of about $10^{-8}$ ($10^{-5}$) for the mixing angle square at 10 (2) GeV sterile neutrino mass respectively. The strategy we propose can cover the light sterile masses complimentary to beam dump and forward detector experiments.Comment: 22 pages, 6 figures, 1 table; v2: matched to Journal version

First Evaluation of the CPU, GPGPU and MIC Architectures for Real Time Particle Tracking based on Hough Transform at the LHC

Recent innovations focused around {\em parallel} processing, either through systems containing multiple processors or processors containing multiple cores, hold great promise for enhancing the performance of the trigger at the LHC and extending its physics program. The flexibility of the CMS/ATLAS trigger system allows for easy integration of computational accelerators, such as NVIDIA's Tesla Graphics Processing Unit (GPU) or Intel's \xphi, in the High Level Trigger. These accelerators have the potential to provide faster or more energy efficient event selection, thus opening up possibilities for new complex triggers that were not previously feasible. At the same time, it is crucial to explore the performance limits achievable on the latest generation multicore CPUs with the use of the best software optimization methods. In this article, a new tracking algorithm based on the Hough transform will be evaluated for the first time on a multi-core Intel Xeon E5-2697v2 CPU, an NVIDIA Tesla K20c GPU, and an Intel \xphi\ 7120 coprocessor. Preliminary time performance will be presented.Comment: 13 pages, 4 figures, Accepted to JINS

Strong Optimized Conservative Fermi-LAT Constraints on Dark Matter Models from the Inclusive Photon Spectrum

We set conservative, robust constraints on the annihilation and decay of dark matter into various Standard Model final states under various assumptions about the distribution of the dark matter in the Milky Way halo. We use the inclusive photon spectrum observed by the Fermi Gamma-ray Space Telescope through its main instrument, the Large-Area Telescope (LAT). We use simulated data to first find the "optimal" regions of interest in the gamma-ray sky, where the expected dark matter signal is largest compared with the expected astrophysical foregrounds. We then require the predicted dark matter signal to be less than the observed photon counts in the a priori optimal regions. This yields a very conservative constraint as we do not attempt to model or subtract astrophysical foregrounds. The resulting limits are competitive with other existing limits, and, for some final states with cuspy dark-matter distributions in the Galactic Center region, disfavor the typical cross section required during freeze-out for a weakly interacting massive particle (WIMP) to obtain the observed relic abundance.Comment: 24 pages + appendices and references, 13 figures, accepted by PRD. Contact authors: Andrea Massari, Eder Izaguirre, and Rouven Essi