225 resultados para Arun Upneja
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Search for dark matter and large extra dimensions in monojet events in pp collisions at root s=7 TeV
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
A method for context-sensitive analysis of binaries that may have obfuscated procedure call and return operations is presented. Such binaries may use operators to directly manipulate stack instead of using native call and ret instructions to achieve equivalent behavior. Since definition of context-sensitivity and algorithms for context-sensitive analysis have thus far been based on the specific semantics associated to procedure call and return operations, classic interprocedural analyses cannot be used reliably for analyzing programs in which these operations cannot be discerned. A new notion of context-sensitivity is introduced that is based on the state of the stack at any instruction. While changes in 'calling'-context are associated with transfer of control, and hence can be reasoned in terms of paths in an interprocedural control flow graph (ICFG), the same is not true of changes in 'stack'-context. An abstract interpretation based framework is developed to reason about stack-contexts and to derive analogues of call-strings based methods for the context-sensitive analysis using stack-context. The method presented is used to create a context-sensitive version of Venable et al.'s algorithm for detecting obfuscated calls. Experimental results show that the context-sensitive version of the algorithm generates more precise results and is also computationally more efficient than its context-insensitive counterpart. Copyright © 2010 ACM.
Resumo:
Since Sharir and Pnueli, algorithms for context-sensitivity have been defined in terms of 'valid' paths in an interprocedural flow graph. The definition of valid paths requires atomic call and ret statements, and encapsulated procedures. Thus, the resulting algorithms are not directly applicable when behavior similar to call and ret instructions may be realized using non-atomic statements, or when procedures do not have rigid boundaries, such as with programs in low level languages like assembly or RTL. We present a framework for context-sensitive analysis that requires neither atomic call and ret instructions, nor encapsulated procedures. The framework presented decouples the transfer of control semantics and the context manipulation semantics of statements. A new definition of context-sensitivity, called stack contexts, is developed. A stack context, which is defined using trace semantics, is more general than Sharir and Pnueli's interprocedural path based calling-context. An abstract interpretation based framework is developed to reason about stack-contexts and to derive analogues of calling-context based algorithms using stack-context. The framework presented is suitable for deriving algorithms for analyzing binary programs, such as malware, that employ obfuscations with the deliberate intent of defeating automated analysis. The framework is used to create a context-sensitive version of Venable et al.'s algorithm for analyzing x86 binaries without requiring that a binary conforms to a standard compilation model for maintaining procedures, calls, and returns. Experimental results show that a context-sensitive analysis using stack-context performs just as well for programs where the use of Sharir and Pnueli's calling-context produces correct approximations. However, if those programs are transformed to use call obfuscations, a contextsensitive analysis using stack-context still provides the same, correct results and without any additional overhead. © Springer Science+Business Media, LLC 2011.
Resumo:
A search has been performed for long-lived particles that have stopped in the CMS detector, during 7TeV proton-proton operations of the CERN LHC. The existence of such particles could be inferred from observation of their decays when there were no protonproton collisions in the CMS detector, namely during gaps between LHC beam crossings. Using a data set in which CMS recorded an integrated luminosity of 4.0 fb -1, and a search interval corresponding to 246 hours of trigger live time, 12 events are observed, with a mean background prediction of 8:6 ± 2:4 events. Limits are presented at 95% confidence level on long-lived gluino and stop production, over 13 orders of magnitude of particle lifetime. Assuming the cloud model of R-hadron interactions, a gluino with mass below 640 GeV and a stop with mass below 340 GeV are excluded, for lifetimes between 10 μs and 1000 s.
Resumo:
The first measurement of the charged component of the underlying event using the novel jet-area/median approach is presented for proton-proton collisions at centre-of-mass energies of 0.9 and 7 TeV. The data were recorded in 2010 with the CMS experiment at the LHC. A new observable, sensitive to soft particle production, is introduced and investigated inclusively and as a function of the event scale defined by the transverse momentum of the leading jet. Various phenomenological models are compared to data, with and without corrections for detector effects. None of the examined models describe the data satisfactorily. © 2012 SISSA.
Resumo:
The performance of muon reconstruction, identification, and triggering in CMS has been studied using 40 pb-1 of data collected in pp collisions at s = 7 TeV at the LHC in 2010. A few benchmark sets of selection criteria covering a wide range of physics analysis needs have been examined. For all considered selections, the efficiency to reconstruct and identify a muon with a transverse momentum pT larger than a few GeV/c is above 95% over the whole region of pseudorapidity covered by the CMS muon system, < 2.4, while the probability to misidentify a hadron as a muon is well below 1%. The efficiency to trigger on single muons with pT above a few GeVc is higher than 90% over the full η range, and typically substantially better. The overall momentum scale is measured to a precision of 0.2% with muons from Z decays. The transverse momentum resolution varies from 1% to 6% depending on pseudorapidity for muons with pT below 100GeV/c and, using cosmic rays, it is shown to be better than 10% in the central region up to pT = 1 TeV/c. Observed distributions of all quantities are well reproduced by the Monte Carlo simulation. © 2012 IOP Publishing Ltd and Sissa Medialab srl.
Resumo:
A model-independent search for the production of heavy resonances decaying into top-antitop quark pairs is presented. The search is based on events containing one lepton (muon or electron) and at least two jets selected from data samples corresponding to an integrated luminosity of 4.4-5.0 fb -1 collected in pp collisions at √s =7 TeV. Results are presented from the combination of two dedicated searches optimized for boosted production and production at threshold. No excess of events is observed over the expected yield from the standard model processes. Topcolor Z′ bosons with narrow (wide) width are excluded at 95% confidence level for masses below 1.49 (2.04) TeV and an upper limit of 0.3 (1.3) pb or lower is set on the production cross section times branching fraction for resonance masses above 1 TeV. Kaluza-Klein excitations of a gluon with masses below 1.82 TeV (at 95% confidence level) in the Randall-Sundrum model are also excluded, and an upper limit of 0.7 pb or lower is set on the production cross section times branching fraction for resonance masses above 1 TeV.[Figure not available: See fulltext.] © 2012 CERN for the benefit of the CMS collaboration.
Resumo:
A measurement of the single-top-quark t-channel production cross section in pp collisions at √s=7 TeV with the CMS detector at the LHC is presented. Two different and complementary approaches have been followed. The first approach exploits the distributions of the pseudorapidity of the recoil jet and reconstructed top-quark mass using background estimates determined from control samples in data. The second approach is based on multivariate analysis techniques that probe the compatibility of the candidate events with the signal. Data have been collected for the muon and electron final states, corresponding to integrated luminosities of 1.17 and 1.56 fb-1, respectively. The single-top-quark production cross section in the t-channel is measured to be 67.2±6.1 pb, in agreement with the approximate next-to-next-to-leading- order standard model prediction. Using the standard model electroweak couplings, the CKM matrix element |V tb| is measured to be 1.020 ± 0.046 (meas.) ± 0.017 (theor.). © 2012 CERN for the benefit of the CMS collaboration.
Resumo:
Results are presented from a search for third-generation leptoquarks and scalar bottom quarks in a sample of proton-proton collisions at √s=7Tev collected by the CMS experiment at the LHC, corresponding to an integrated luminosity of 4.7 fb-1. A scenario where the new particles are pair produced and each decays to a b quark plus a tau neutrino or neutralino is considered. The number of observed events is found to be in agreement with the standard model prediction. Upper limits are set at 95% confidence level on the production cross sections. Leptoquarks with masses below ~450 GeV are excluded. Upper limits in the mass plane of the scalar quark and neutralino are set such that scalar bottom quark masses up to 410 GeV are excluded for neutralino masses of 50 GeV. © 2012 CERN for the benefit of CMS collaboration.