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

Phd by thesis

http://repositorium.sdum.uminho.pt/bitstream/1822/48763/1/1-s2.0-S037026931200857X-main.pdf

Observation of a new particle in the search for the Standard Model Higgs boson with the ATLAS detector at the LHC

https://digital.csic.es/bitstream/10261/108964/1/experiment%20at%20the%20LHC.pdf

Observation of a new boson at a mass of 125 GeV with the CMS experiment at the LHC

We discuss the theoretical bases that underpin the automation of the computations of tree-level and next-to-leading order cross sections, of their matching to parton shower simulations, and of the merging of matched samples that differ by light-parton multiplicities. We present a computer program, MadGraph5 aMC@NLO, capable of handling all these computations — parton-level fixed order, shower-matched, merged — in a unified framework whose defining features are flexibility, high level of parallelisation, and human intervention limited to input physics quantities. We demonstrate the potential of the program by presenting selected phenomenological applications relevant to the LHC and to a 1-TeV e + e − collider. While next-to-leading order results are restricted to QCD corrections to SM processes in the first public version, we show that from the user viewpoint no changes have to be expected in the case of corrections due to any given renormalisable Lagrangian, and that the implementation of these are well under way.

/pdf/the-automated-computation-of-tree-level-and-next-to-leading-4etm0g6w46.pdf

The automated computation of tree-level and next-to-leading order differential cross sections, and their matching to parton shower simulations

The k_t and Cambridge/Aachen inclusive jet finding algorithms for hadron-hadron collisions can be seen as belonging to a broader class of sequential recombination jet algorithms, parametrised by the power of the energy scale in the distance measure. We examine some properties of a new member of this class, for which the power is negative. This ``anti-k_t'' algorithm essentially behaves like an idealised cone algorithm, in that jets with only soft fragmentation are conical, active and passive areas are equal, the area anomalous dimensions are zero, the non-global logarithms are those of a rigid boundary and the Milan factor is universal. None of these properties hold for existing sequential recombination algorithms, nor for cone algorithms with split--merge steps, such as SISCone. They are however the identifying characteristics of the collinear unsafe plain ``iterative cone'' algorithm, for which the anti-k_t algorithm provides a natural, fast, infrared and collinear safe replacement.

/pdf/the-anti-k-t-jet-clustering-algorithm-2c4jbguc9f.pdf

The anti-$k_t$ jet clustering algorithm

FastJet is a C++ package that provides a broad range of jet finding and analysis tools. It includes efficient native implementations of all widely used 2→1 sequential recombination jet algorithms for pp and e
 +
 e
 − collisions, as well as access to 3rd party jet algorithms through a plugin mechanism, including all currently used cone algorithms. FastJet also provides means to facilitate the manipulation of jet substructure, including some common boosted heavy-object taggers, as well as tools for estimation of pileup and underlying-event noise levels, determination of jet areas and subtraction or suppression of noise in jets.

FastJet User Manual

Dispelling the N3 myth for the kt jet-finder

Pileup subtraction using jet areas

The area of a jet is a measure of its susceptibility to radiation, like pileup or underlying event (UE), that on average, in the jet’s neighbourhood, is uniform in rapidity and azimuth. In this article we establish a theoretical grounding for the discussion of jet areas, introducing two main definitions, passive and active areas, which respectively characterise the sensitivity to pointlike or diffuse pileup and UE radiation. We investigate the properties of jet areas for three standard jet algorithms, kt, Cambridge/Aachen and SISCone. Passive areas for single-particle jets are equal to the naive geometrical expectation πR 2 , but acquire an anomalous dimension at higher orders in the coupling, calculated here at leading order. The more physically relevant active areas differ from πR 2 even for single-particle jets, substantially so in the case of the cone algorithms like SISCone with a Tevatron Run-II split–merge procedure. We compare our results with direct measures of areas in parton-shower Monte Carlo simulations and find good agreement with the main features of the analytical predictions. We furthermore justify the use of jet areas to subtract the contamination from pileup.

/pdf/the-catchment-area-of-jets-12ebn1u1fu.pdf

The Catchment Area of Jets

FastJet is a C++ package that provides a broad range of jet finding and analysis tools. It includes efficient native implementations of all widely used 2-to-1 sequential recombination jet algorithms for pp and e+e- collisions, as well as access to 3rd party jet algorithms through a plugin mechanism, including all currently used cone algorithms. FastJet also provides means to facilitate the manipulation of jet substructure, including some common boosted heavy-object taggers, as well as tools for estimation of pileup and underlying-event noise levels, determination of jet areas and subtraction or suppression of noise in jets.

Matteo Cacciari

Papers

FastJet User Manual

Dispelling the N3 myth for the kt jet-finder

Pileup subtraction using jet areas

The Catchment Area of Jets

FastJet user manual