Georges Aad

Bio: Georges Aad is an academic researcher from Aix-Marseille University. The author has contributed to research in topics: Large Hadron Collider & Higgs boson. The author has an hindex of 135, co-authored 1121 publications receiving 88811 citations. Previous affiliations of Georges Aad include Centre national de la recherche scientifique & University of Udine.

Identification of boosted, hadronically decaying W bosons and comparisons with ATLAS data taken at √s = 8 TeV

Abstract: This paper reports a detailed study of techniques for identifying boosted, hadronically decaying W bosons using 20.3 fb −¹ of proton–proton collision data collected by the ATLAS detector at the LHC at a centre-of-mass energy √s = 8 TeV. A range of techniques for optimising the signal jet mass resolution are combined with various jet substructure variables. The results of these studies in Monte Carlo simulations show that a simple pairwise combination of groomed jet mass and one substructure variable can provide a 50 % efficiency for identifying W bosons with transverse momenta larger than 200 GeV while maintaining multijet background efficiencies of 2–4 % for jets with the same transverse momentum. These signal and background efficiencies are confirmed in data for a selection of tagging techniques.

Performance of the ATLAS detector using first collision data

Abstract: More than half a million minimum-bias events of LHC collision data were collected by the ATLAS experiment in December 2009 at centre-of-mass energies of 0.9 TeV and 2.36 TeV. This paper reports on studies of the initial performance of the ATLAS detector from these data. Comparisons between data and Monte Carlo predictions are shown for distributions of several track- and calorimeter-based quantities. The good performance of the ATLAS detector in these first data gives confidence for successful running at higher energies.

Search for a light Higgs boson decaying to long-lived weakly interacting particles in proton-proton collisions at √s=7TeV with the atlas detector

Abstract: A search for the decay of a light Higgs boson (120-140 GeV) to a pair of weakly interacting, long-lived particles in 1.94 fb(-1) of proton-proton collisions at root s = 7 TeV recorded in 2011 by the ATLAS detector is presented. The search strategy requires that both long-lived particles decay inside the muon spectrometer. No excess of events is observed above the expected background and limits on the Higgs boson production times branching ratio to weakly interacting, long-lived particles are derived as a function of the particle proper decay length.

Search for new particles in events with one lepton and missing transverse momentum in pp collisions at s = 8 TeV with the ATLAS detector

Abstract: This paper presents a search for new particles in events with one lepton (electron or muon) and missing transverse momentum using 20.3 fb(-1) of proton-proton collision data at root s = 8 TeV recorded by the ATLAS experiment at the Large Hadron Collider. No significant excess beyond Standard Model expectations is observed. A W' with Sequential Standard Model couplings is excluded at the 95% confidence level for masses up to 3.24 TeV. Excited chiral bosons (W*) with equivalent coupling strengths are excluded for masses up to 3.21 TeV. In the framework of an effective field theory limits are also set on the dark matter-nucleon scattering cross-section as well as the mass scale M-* of the unknown mediating interaction for dark matter pair production in association with a leptonically decaying W.

I and i

Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

Machine learning

Abstract: Machine Learning is the study of methods for programming computers to learn. Computers are applied to a wide range of tasks, and for most of these it is relatively easy for programmers to design and implement the necessary software. However, there are many tasks for which this is difficult or impossible. These can be divided into four general categories. First, there are problems for which there exist no human experts. For example, in modern automated manufacturing facilities, there is a need to predict machine failures before they occur by analyzing sensor readings. Because the machines are new, there are no human experts who can be interviewed by a programmer to provide the knowledge necessary to build a computer system. A machine learning system can study recorded data and subsequent machine failures and learn prediction rules. Second, there are problems where human experts exist, but where they are unable to explain their expertise. This is the case in many perceptual tasks, such as speech recognition, hand-writing recognition, and natural language understanding. Virtually all humans exhibit expert-level abilities on these tasks, but none of them can describe the detailed steps that they follow as they perform them. Fortunately, humans can provide machines with examples of the inputs and correct outputs for these tasks, so machine learning algorithms can learn to map the inputs to the outputs. Third, there are problems where phenomena are changing rapidly. In finance, for example, people would like to predict the future behavior of the stock market, of consumer purchases, or of exchange rates. These behaviors change frequently, so that even if a programmer could construct a good predictive computer program, it would need to be rewritten frequently. A learning program can relieve the programmer of this burden by constantly modifying and tuning a set of learned prediction rules. Fourth, there are applications that need to be customized for each computer user separately. Consider, for example, a program to filter unwanted electronic mail messages. Different users will need different filters. It is unreasonable to expect each user to program his or her own rules, and it is infeasible to provide every user with a software engineer to keep the rules up-to-date. A machine learning system can learn which mail messages the user rejects and maintain the filtering rules automatically. Machine learning addresses many of the same research questions as the fields of statistics, data mining, and psychology, but with differences of emphasis. Statistics focuses on understanding the phenomena that have generated the data, often with the goal of testing different hypotheses about those phenomena. Data mining seeks to find patterns in the data that are understandable by people. Psychological studies of human learning aspire to understand the mechanisms underlying the various learning behaviors exhibited by people (concept learning, skill acquisition, strategy change, etc.).

Phd by thesis

Abstract: Deposits of clastic carbonate-dominated (calciclastic) sedimentary slope systems in the rock record have been identified mostly as linearly-consistent carbonate apron deposits, even though most ancient clastic carbonate slope deposits fit the submarine fan systems better. Calciclastic submarine fans are consequently rarely described and are poorly understood. Subsequently, very little is known especially in mud-dominated calciclastic submarine fan systems. Presented in this study are a sedimentological core and petrographic characterisation of samples from eleven boreholes from the Lower Carboniferous of Bowland Basin (Northwest England) that reveals a >250 m thick calciturbidite complex deposited in a calciclastic submarine fan setting. Seven facies are recognised from core and thin section characterisation and are grouped into three carbonate turbidite sequences. They include: 1) Calciturbidites, comprising mostly of highto low-density, wavy-laminated bioclast-rich facies; 2) low-density densite mudstones which are characterised by planar laminated and unlaminated muddominated facies; and 3) Calcidebrites which are muddy or hyper-concentrated debrisflow deposits occurring as poorly-sorted, chaotic, mud-supported floatstones. These