Sofia University

About: Sofia University is a education organization based out in Sofia, Bulgaria. It is known for research contribution in the topics: Large Hadron Collider & Laser. The organization has 8533 authors who have published 15730 publications receiving 306320 citations. The organization is also known as: University of Sofia & BFUS.

Inclusive Search for Supersymmetry Using Razor Variables in pp Collisions at $√s=7 TeV$

Abstract: An inclusive search is presented for new heavy particle pairs produced in √s=7 TeV proton-proton collisions at the LHC using 4.7±0.1 fb-1 of integrated luminosity. The selected events are analyzed in the 2D razor space of MR, an event-by-event indicator of the heavy particle mass scale, and R, a dimensionless variable related to the missing transverse energy. The third-generation sector is probed using the event heavy-flavor content. The search is sensitive to generic supersymmetry models with minimal assumptions about the superpartner decay chains. No excess is observed in the number of events beyond that predicted by the standard model. Exclusion limits are derived in the CMSSM framework as well as for simplified models. Within the CMSSM parameter space considered, gluino masses up to 800 GeV and squark masses up to 1.35 TeV are excluded at 95% confidence level depending on the model parameters. The direct production of pairs of top or bottom squarks is excluded for masses as high as 400 GeV.

Highly efficient temporal cleaner for femtosecond pulses based on cross-polarized wave generation in a dual crystal scheme

Abstract: We present an experimental demonstration of a renewed set up, with respect to the one described in [A. Jullien et al, Opt. Lett. 30, 920 (2005)], that enables more reliable and robust performances in the increase of the contrast ratio (CR) of energetic femtosecond pulses. The new approach is based on the use of two successive crystals situated at optimum position that generate cross polarized waves whose individual effect interferes constructively. This arrangement overcomes the limitation of the single crystal schemes for temporal cleaning – the early saturation of the transmission efficiency, previously observed when either using a relatively thick crystal or increasing intensities up to its damage threshold. A theoretical model that predicts the output CR is developed for the first time. It shows that the CR depends on the initial CR and the extinction ratio of the polarizers used. The measured temporal CR 10-10 is in accordance with theoretical predictions.

Dynamic synthesis for relaxed memory models

Abstract: Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, allowing control of this behavior.To implement a concurrent algorithm for a modern architecture, the programmer is forced to manually reason about subtle relaxed behaviors and figure out ways to control these behaviors by adding fences to the program. Not only is this process time consuming and error-prone, but it has to be repeated every time the implementation is ported to a different architecture.In this paper, we present the first scalable framework for handling real-world concurrent algorithms running on relaxed architectures. Given a concurrent C program, a safety specification, and a description of the memory model, our framework tests the program on the memory model to expose violations of the specification, and synthesizes a set of necessary ordering constraints that prevent these violations. The ordering constraints are then realized as additional fences in the program.We implemented our approach in a tool called DFence based on LLVM and used it to infer fences in a number of concurrent algorithms. Using DFence, we perform the first in-depth study of the interaction between fences in real-world concurrent C programs, correctness criteria such as sequential consistency and linearizability, and memory models such as TSO and PSO, yielding many interesting observations. We believe that this is the first tool that can handle programs at the scale and complexity of a lock-free memory allocator.