Search results for "Crete"
showing 10 items of 2495 documents
"Table 28" of "Search for long-lived particles produced in $pp$ collisions at $\sqrt{s}=13$ TeV that decay into displaced hadronic jets in the ATLAS …
2018
Barrel MS vertex efficiencies (in %) for $m_{\Phi}=1000$ GeV scalar benchmark samples. The vertex reconstruction efficiency is defined as the fraction of simulated LLP decays in the MS fiducial volume that match a reconstructed vertex ($\Delta R(\textrm{LLP,vertex}) = 0.4$) passing the baseline event selection and satisfying the vertex isolation criteria. A vertex is considered matched to a displaced decay if the vertex is within $\Delta R = 0.4$ of the simulated decay position. The MS vertex efficiency is parameterized as a function of the LLP decay position.
"Table 26" of "Search for long-lived particles produced in $pp$ collisions at $\sqrt{s}=13$ TeV that decay into displaced hadronic jets in the ATLAS …
2018
Barrel MS vertex efficiencies (in %) for $m_{\Phi}=400$ GeV scalar benchmark samples. The vertex reconstruction efficiency is defined as the fraction of simulated LLP decays in the MS fiducial volume that match a reconstructed vertex ($\Delta R(\textrm{LLP,vertex}) = 0.4$) passing the baseline event selection and satisfying the vertex isolation criteria. A vertex is considered matched to a displaced decay if the vertex is within $\Delta R = 0.4$ of the simulated decay position. The MS vertex efficiency is parameterized as a function of the LLP decay position.
"Table 39" of "Search for long-lived particles produced in $pp$ collisions at $\sqrt{s}=13$ TeV that decay into displaced hadronic jets in the ATLAS …
2018
Endcap MS vertex efficiencies (in %) for $m_{\Phi}=1000$ GeV scalar benchmark samples. The vertex reconstruction efficiency is defined as the fraction of simulated LLP decays in the MS fiducial volume that match a reconstructed vertex ($\Delta R(\textrm{LLP,vertex}) = 0.4$) passing the baseline event selection and satisfying the vertex isolation criteria. A vertex is considered matched to a displaced decay if the vertex is within $\Delta R = 0.4$ of the simulated decay position. The MS vertex efficiency is parameterized as a function of the LLP decay position.
"Table 25" of "Search for long-lived particles produced in $pp$ collisions at $\sqrt{s}=13$ TeV that decay into displaced hadronic jets in the ATLAS …
2018
Barrel MS vertex efficiencies (in %) for $m_{\Phi}=200$ GeV scalar benchmark samples. The vertex reconstruction efficiency is defined as the fraction of simulated LLP decays in the MS fiducial volume that match a reconstructed vertex ($\Delta R(\textrm{LLP,vertex}) = 0.4$) passing the baseline event selection and satisfying the vertex isolation criteria. A vertex is considered matched to a displaced decay if the vertex is within $\Delta R = 0.4$ of the simulated decay position. The MS vertex efficiency is parameterized as a function of the LLP decay position.
"Table 29" of "Search for long-lived particles produced in $pp$ collisions at $\sqrt{s}=13$ TeV that decay into displaced hadronic jets in the ATLAS …
2018
Barrel MS vertex efficiencies (in %) for all Stealth SUSY benchmark samples. The vertex reconstruction efficiency is defined as the fraction of simulated LLP decays in the MS fiducial volume that match a reconstructed vertex ($\Delta R(\textrm{LLP,vertex}) = 0.4$) passing the baseline event selection and satisfying the vertex isolation criteria. A vertex is considered matched to a displaced decay if the vertex is within $\Delta R = 0.4$ of the simulated decay position. The MS vertex efficiency is parameterized as a function of the LLP decay position.
"Table 40" of "Search for long-lived particles produced in $pp$ collisions at $\sqrt{s}=13$ TeV that decay into displaced hadronic jets in the ATLAS …
2018
Endcap MS vertex efficiencies (in %) for all Stealth SUSY benchmark samples. The vertex reconstruction efficiency is defined as the fraction of simulated LLP decays in the MS fiducial volume that match a reconstructed vertex ($\Delta R(\textrm{LLP,vertex}) = 0.4$) passing the baseline event selection and satisfying the vertex isolation criteria. A vertex is considered matched to a displaced decay if the vertex is within $\Delta R = 0.4$ of the simulated decay position. The MS vertex efficiency is parameterized as a function of the LLP decay position.
Projective models of K3 surfaces with an even set
2006
The aim of this paper is to describe algebraic K3 surfaces with an even set of rational curves or of nodes. Their minimal possible Picard number is nine. We completely classify these K3 surfaces and after a carefull analysis of the divisors contained in the Picard lattice we study their projective models, giving necessary and sufficient conditions to have an even set. Moreover we investigate their relation with K3 surfaces with a Nikulin involution.
Lie Algebras Generated by Extremal Elements
1999
We study Lie algebras generated by extremal elements (i.e., elements spanning inner ideals of L) over a field of characteristic distinct from 2. We prove that any Lie algebra generated by a finite number of extremal elements is finite dimensional. The minimal number of extremal generators for the Lie algebras of type An, Bn (n>2), Cn (n>1), Dn (n>3), En (n=6,7,8), F4 and G2 are shown to be n+1, n+1, 2n, n, 5, 5, and 4 in the respective cases. These results are related to group theoretic ones for the corresponding Chevalley groups.
Maximal subgroups and PST-groups
2013
A subgroup H of a group G is said r to permute with a subgroup K of G if HK is a subgroup of G. H is said to be permutable (resp. S-permutable) if it permutes with all the subgroups (resp. Sylow subgroups) of G. Finite groups in which permutability (resp. S-permutability) is a transitive relation are called PT-groups (resp. PST-groups). PT-, PST- and T-groups, or groups in which normality is transitive, have been extensively studied and characterised. Kaplan [Kaplan G., On T-groups, supersolvable groups, and maxmial subgroups, Arch. Math. (Basel), 2011, 96(1), 19-25)] presented some new characterisations of soluble T-groups. The main goal of this paper is to establish PT- and PST-versions o…
Toward a real-time tracking of dense point-sampled geometry
2012
4 pages; International audience; In this paper, we address the problem of tracking temporal deformations between two arbitrary densely sampled point-based surfaces. We propose an intuitive and efficient resolution to the point matching problem within two frames of a sequence. The proposed method utilizes two distinct space partition trees, one for each point cloud, which both are defined on a unique discrete space. Our method takes advantage of multi-resolution concerns, voxel adjacency relations, and a specific distance function. Experimental results obtained from both simulated and real reconstructed data sets demonstrate that the proposed method can handle efficiently the tracking proces…