Lund University Publications
https://lup.lub.lu.se/search
Lund University Lund University Publications2000-01-01T00:00+00:001dailyHigh-pT Jet Energy Scale Uncertainty from single hadron response with the ATLAS detector
https://lup.lub.lu.se/search/publication/f6c7ba10-260f-411f-8091-cf7224c032b6
Poulsen, Trine2016-09-16The jet energy scale (JES) uncertainty is estimated using different methods at different pT ranges. In-situ techniques exploiting the pT balance between a jet and a reference object (e.g. Z or gamma) are used at lower pT, but at very high pT (> 2.5 TeV) there is not enough statistics for such in-situ techniques. A low JES uncertainty at high-pT is important in several searches for new phenomena, e.g. the dijet resonance and angular searches. In the highest pT range, the JES uncertainty is estimated using the calorimeter response to single hadrons. In this method, jets are treated as a superposition of energy depositions of single particles. An uncertainty is applied to each energy deposition belonging to the particles within the jet, and propagated to the final jet energy scale. This poster presents the JES uncertainty found with this method at sqrt(s) = 8 TeV and its developments.http://lup.lub.lu.se/record/f6c7ba10-260f-411f-8091-cf7224c032b6engPoS - Proceedings of Science; (2016)ISSN: 1824-8039High-pT Jet Energy Scale Uncertainty from single hadron response with the ATLAS detectorcontributiontobookanthology/conferenceinfo:eu-repo/semantics/conferencePapertextPushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases
https://lup.lub.lu.se/search/publication/fc31a0f2-8539-4908-b28b-72e546e84bc3
Gasieniec, LeszekJansson, JesperLevcopoulos, ChristosLingas, AndrzejPersson, Mia2019-04-09Henzinger et al. posed the so called Online Boolean Matrix-vector Multiplication (OMv) conjecture and showed that it implies tight hardness results for several basic partially dynamic or dynamic problems [STOC’15].We show that the OMv conjecture is implied by a simple off-line conjecture. If a not uniform (i.e., it might be different for different matrices) polynomial-time preprocessing of the matrix in the OMv conjecture is allowed then we can show such a variant of the OMv conjecture to be equivalent to our off-line conjecture. On the other hand, we show that the OMV conjecture does not hold in the restricted cases when the rows of the matrix or the input vectors are clustered.http://lup.lub.lu.se/record/fc31a0f2-8539-4908-b28b-72e546e84bc3http://dx.doi.org/10.1007/978-3-030-18126-0_14ISBN: 978-3-030-18126-0ISBN: 978-3-030-18125-3engLecture Notes in Computer Science; 11458, pp 156-169 (2019)ISSN: 0302-9743ISSN: 1611-3349Datavetenskap (datalogi)Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Casescontributiontobookanthology/conferenceinfo:eu-repo/semantics/conferencePapertext