University of Grenoble

About: University of Grenoble is a education organization based out in Saint-Martin-d'Hères, France. It is known for research contribution in the topics: Population & Context (language use). The organization has 25658 authors who have published 45143 publications receiving 909760 citations.

The safety band of Antarctic ice shelves

Abstract: The authors map the areas of all the Antarctic ice shelves that can be lost without causing any ice discharge from further up on the ice sheet.

Electron efficiency measurements with the ATLAS detector using 2012 LHC proton-proton collision data

Abstract: This paper describes the algorithms for the reconstruction and identification of electrons in the central region of the ATLAS detector at the Large Hadron Collider (LHC). These algorithms were used for all ATLAS results with electrons in the final state that are based on the 2012 pp collision data produced by the LHC at [Formula: see text] = 8 [Formula: see text]. The efficiency of these algorithms, together with the charge misidentification rate, is measured in data and evaluated in simulated samples using electrons from [Formula: see text], [Formula: see text] and [Formula: see text] decays. For these efficiency measurements, the full recorded data set, corresponding to an integrated luminosity of 20.3 fb[Formula: see text], is used. Based on a new reconstruction algorithm used in 2012, the electron reconstruction efficiency is 97% for electrons with [Formula: see text] [Formula: see text] and 99% at [Formula: see text] [Formula: see text]. Combining this with the efficiency of additional selection criteria to reject electrons from background processes or misidentified hadrons, the efficiency to reconstruct and identify electrons at the ATLAS experiment varies from 65 to 95%, depending on the transverse momentum of the electron and background rejection.

Evaluation of CNRM Earth System Model, CNRM‐ESM2‐1: Role of Earth System Processes in Present‐Day and Future Climate

Abstract: This study introduces CNRM‐ESM2‐1, the Earth system (ES) model of second generation developed by CNRM‐CERFACS for the sixth phase of the Coupled Model Intercomparison Project (CMIP6). CNRM‐ESM2‐1 offers a higher model complexity than the Atmosphere‐Ocean General Circulation Model CNRM‐CM6‐1 by adding interactive ES components such as carbon cycle, aerosols, and atmospheric chemistry. As both models share the same code, physical parameterizations, and grid resolution, they offer a fully traceable framework to investigate how far the represented ES processes impact the model performance over present‐day, response to external forcing and future climate projections. Using a large variety of CMIP6 experiments, we show that represented ES processes impact more prominently the model response to external forcing than the model performance over present‐day. Both models display comparable performance at replicating modern observations although the mean climate of CNRM‐ESM2‐1 is slightly warmer than that of CNRM‐CM6‐1. This difference arises from land cover‐aerosol interactions where the use of different soil vegetation distributions between both models impacts the rate of dust emissions. This interaction results in a smaller aerosol burden in CNRM‐ESM2‐1 than in CNRM‐CM6‐1, leading to a different surface radiative budget and climate. Greater differences are found when comparing the model response to external forcing and future climate projections. Represented ES processes damp future warming by up to 10% in CNRM‐ESM2‐1 with respect to CNRM‐CM6‐1. The representation of land vegetation and the CO2‐water‐stomatal feedback between both models explain about 60% of this difference. The remainder is driven by other ES feedbacks such as the natural aerosol feedback.

The traveling salesman problem on a graph and some related integer polyhedra

Abstract: Given a graphG = (N, E) and a length functionl: E → ℝ, the Graphical Traveling Salesman Problem is that of finding a minimum length cycle goingat least once through each node ofG. This formulation has advantages over the traditional formulation where each node must be visited exactly once. We give some facet inducing inequalities of the convex hull of the solutions to that problem. In particular, the so-called comb inequalities of Grotschel and Padberg are generalized. Some related integer polyhedra are also investigated. Finally, an efficient algorithm is given whenG is a series-parallel graph.