Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “vertex reconstruction”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

68 records · Page 4

Is tokenization needed for masked particle modeling?

In this work, we significantly enhance masked particle modeling (MPM), a self-supervised learning scheme for constructing highly expressive representations of unordered sets relevant to developing foundation models for high-energy physics. In MPM, a model is trained to recover the missing elements of a set, a learning objective that requires no labels and can be applied directly to experimental data. We achieve significant performance improvements over previous work on MPM by addressing inefficiencies in the implementation and incorporating a more powerful decoder. We compare several pre-training tasks and introduce new reconstruction methods that utilize conditional generative models without data tokenization or discretization. We show that these new methods outperform the tokenized learning objective from the original MPM on a new test bed for foundation models for jets, which includes using a wide variety of downstream tasks relevant to jet physics, such as classification, secondary vertex finding, and track identification.

conditional generative models↗

Search for Long-Lived Particles with Muon Detector Shower Signature in the CMS Run-3 data

Many beyond standard model theories predict the existence of long-lived particles (LLPs). These LLPs can have sizable lifetimes and decay several meters from their production vertex. In this poster/talk, we present the analysis strategy for searching for LLPs using the Compact Muon Solenoid (CMS) Experiment. The proton-proton collision data used in this analysis were collected from 2022 to 2024 at a center-of-mass energy of 13.6 TeV, corresponding to an integrated luminosity of 170 fb^-1. The LLP decays are reconstructed as a high-multiplicity cluster of detector hits in the cathode strip chambers (CSC) of the muon system endcap. This signature is referred to as the Muon Detector Showers (MDS). This search requires events to contain at least one MDS cluster. The analysis focuses on LLP hadronic decays and LLP masses up to a few tens of GeV. We present the signal properties in MonteCarlo simulation, event selection, background modeling, and evaluation of the expected sensitivity. The results are interpreted under the Twin Higgs model benchmark.

Agyemang-Duah, Andrews [Grambling State U.]↗

Search for displaced leptons in $\sqrt{𝑠}$ =13 TeV and 13.6 TeV 𝑝⁢𝑝 collisions with the ATLAS detector

A search for leptons displaced from the primary vertex is performed with the ATLAS detector at the Large Hadron Collider. The search includes the full proton-proton collision dataset collected during Run 2 at $\sqrt{𝑠}$ = 13 TeV and a partial dataset collected during Run 3 in 2022–2023 at $\sqrt{𝑠}$ = 13.6 TeV, corresponding to integrated luminosities of 140 fb −1 and 56.3 fb −1 , respectively. Final states with displaced electrons or muons are considered, and novel triggers introduced in Run 3 are employed that use large impact parameter tracking to reconstruct displaced tracks with low momentum. In addition, photon reconstruction and multivariate techniques are employed to broaden the sensitivity to channels with large background rates or highly displaced electrons, respectively. The results are consistent with the Standard Model background expectations and are used to set model-independent limits on the production of displaced electrons and muons. The analysis is also interpreted in the context of a gauge-mediated supersymmetry breaking model with pair-produced long-lived sleptons and a dark sector model with pair-produced chargino-like states. The results include 95% confidence level exclusions of selectrons with lifetimes from 4 ps to 60 ns and a mass of 150 GeV, and exclusions of selectrons, smuons, and staus with a lifetime of 0.3 ns for masses up to 740, 830, and 440 GeV, respectively. Dark charginos with masses up to 380 GeV are excluded for a mass difference with the neutral state of 40 GeV, and mass differences down to 17 GeV are excluded for dark charginos with a 100 GeV mass.

supersymmetric models↗

Search in diphoton and dielectron final states for displaced production of Higgs or Z bosons with the ATLAS detector in s = 13 TeV p p collisions

A search is presented for displaced production of Higgs bosons or Z bosons, originating from the decay of a neutral long-lived particle (LLP) and reconstructed in the decay modes H → γ γ and Z → ee . The analysis uses the full Run 2 dataset of proton-proton collisions delivered by the LHC at an energy of $\sqrt{s}$ = 13 TeV between 2015 and 2018 and recorded by the ATLAS detector, corresponding to an integrated luminosity of 139 fb -1 . Exploiting the capabilities of the ATLAS liquid argon calorimeter to precisely measure the arrival times and trajectories of electromagnetic objects, the analysis searches for the signature of pairs of photons or electrons which arise from a common displaced vertex and which arrive after some delay at the calorimeter. The results are interpreted in a gauge-mediated supersymmetry breaking model with pair-produced Higgsinos that decay to LLPs, and each LLP subsequently decays into either a Higgs boson or a Z boson. The final state includes at least two particles that escape direct detection, giving rise to missing transverse momentum. No significant excess is observed above the background expectation. The results are used to set upper limits on the cross section for Higgsino pair production, up to a $\bar{χ}^0_1$ mass of 369 (704) GeV for decays with 100% branching ratio of $\bar{χ}^0_1$ to Higgs (Z) bosons for a $\bar{χ}^0_1$ lifetime of 2 ns. A model-independent limit is also set on the production of pairs of photons or electrons with a significant delay in arrival at the calorimeter.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Universal Monte Carlo Event Generator

With the Jefferson Lab 12 GeV physics program underway and plans for the future Electron-Ion Collider (EIC), the nuclear physics community is entering a new era of exploration of QCD phenomena involving extensive data taking and event-level processing. This brings with it the potential for unprecedented access to multidimensional particle momentum distributions (PMDs) that can be connected to various theoretical frameworks by unfolding the emergent quantum mechanical properties of QCD using the PMDs. In practice, the PMDs are rendered as discretized histograms (typically one- or two-dimensional projections), and detector effects must be taken into account to unfold the pure detector effect-free PMDs that can be connected with theory. One of the challenges in this new era is obtaining faithful reconstructions of the multidimensional PMDs that preserve all of the inherent particle correlations. In this LDRD project we developed a novel approach using machine learning (ML) that solves this challenge, by avoiding entirely the need to use histograms as the main numerical technique to obtain the detector effect-free PMDs. The new approach is, moreover, scalable to higher dimensional PMDs. The central idea involves training neural networks (NNs) to generate synthetic event-level data (momenta 4-vectors of final state particles) to preserve all correlations among the particles. This is achieved by converting the trial synthetic vertex-level events to detector-level events using detector simulators. The NNs are then tuned using a specialized distance metric between the synthetic detector events and the real detector events.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Degree-preserving graph dynamics: a versatile process to construct random networks

Real-world networks evolve over time via the addition or removal of vertices and edges. In current network evolution models, vertex degree varies or grows arbitrarily. A recently introduced degree-preserving network growth (DPG) family of models preserves vertex degree, resulting in structures significantly different from and more diverse than previous models. Despite its degree preserving property, the DPG model is able to replicate the output of several well-known real-world network growth models. Simulations showed that many real-world networks can also be constructed from small seed graphs via the DPG process. Here, we start the development of a rigorous mathematical theory underlying the DPG family of network growth models. We prove that the degree sequence of the output of some of the well-known, real-world network growth models can be reconstructed via the DPG process, using proper parametrization. We also show that the general problem of deciding whether a simple graph can be obtained via the DPG process from a small seed (DPG feasibility) is, however, NP-complete. In conclusion, it is an intriguing open problem to uncover whether there is a structural reason behind the DPG-constructability of real-world networks.

97 MATHEMATICS AND COMPUTING↗

Muon reconstruction and identification efficiency in ATLAS using the full Run 2 $pp$ collision data set at $\sqrt{s}=13$ TeV

This article documents the muon reconstruction and identification efficiency obtained by the ATLAS experiment for 139 fb$^{-1}$ of $pp$ collision data at $\sqrt{s}=13$ TeV collected between 2015 and 2018 during Run 2 of the LHC. The increased instantaneous luminosity delivered by the LHC over this period required a reoptimisation of the criteria for the identification of prompt muons. Improved and newly developed algorithms were deployed to preserve high muon identification efficiency with a low misidentification rate and good momentum resolution. The availability of large samples of $Z\to\mu\mu$ and $J/\psi\to\mu\mu$ decays, and the minimisation of systematic uncertainties, allows the efficiencies of criteria for muon identification, primary vertex association, and isolation to be measured with an accuracy at the per-mille level in the bulk of the phase space, and up to the percent level in complex kinematic configurations. Excellent performance is achieved over a range of transverse momenta from 3 GeV to several hundred GeV, and across the full muon detector acceptance of $|\eta|<2.7$.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

NuGraph2: A Graph Neural Network for Neutrino Event Reconstruction

Neutrino experiments are set to probe some of the most important open questions in physics, from CP violation and the nature of dark matter. The technology of choice for many of these experiments is the liquid argon time projection chamber (LArTPC). In current LArTPC experiments, reconstruction performance often represents a limiting factor for the sensitivity. New developments are therefore needed to unlock the full potential of LArTPC experiments. NuGraph2 is a state of the art Graph Neural Network for reconstruction of data in LArTPC experiments. NuGraph2 utilizes a heterogeneous graph structure, with separate subgraphs of 2D nodes (hits in each plane) connected across planes via 3D nodes (space points). The model provides a consistent description of the neutrino interaction across all planes. NuGraph2 is a multi-purpose network, with a common message-passing attention engine connected to multiple decoders with different classification or regression tasks. These include the classification of detector hits according to the particle type that produced them (semantic segmentation) and the separation of hits from the neutrino interaction from hits due to noise or cosmic-ray background. Additional decoders are being developed, performing tasks such as the regression of the neutrino interaction vertex position. Performance results will be presented based on publicly available samples from MicroBooNE. These include both physics performance metrics, achieving 95% accuracy for semantic segmentation and 98% classification of neutrino hits, as well as computational metrics for training and for inference on CPU or GPU. The status of the NuGraph integration in the LArSoft software framework will be presented, as well as initial studies about model interpretability and injection of domain knowledge.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

NuGraph2: A Graph Neural Network for Neutrino Event Reconstruction

Neutrino experiments are set to probe some of the most important open questions in physics, from CP violation and the nature of dark matter. The technology of choice for many of these experiments is the liquid argon time projection chamber (LArTPC). In current LArTPC experiments, reconstruction performance often represents a limiting factor for the sensitivity. New developments are therefore needed to unlock the full potential of LArTPC experiments. NuGraph2 is a state of the art Graph Neural Network for reconstruction of data in LArTPC experiments. NuGraph2 utilizes a heterogeneous graph structure, with separate subgraphs of 2D nodes (hits in each plane) connected across planes via 3D nodes (space points). The model provides a consistent description of the neutrino interaction across all planes. NuGraph2 is a multi-purpose network, with a common message-passing attention engine connected to multiple decoders with different classification or regression tasks. These include the classification of detector hits according to the particle type that produced them (semantic segmentation) and the separation of hits from the neutrino interaction from hits due to noise or cosmic-ray background. Additional decoders are being developed, performing tasks such as the regression of the neutrino interaction vertex position. Performance results will be presented based on publicly available samples from MicroBooNE. These include both physics performance metrics, achieving 95% accuracy for semantic segmentation and 98% classification of neutrino hits, as well as computational metrics for training and for inference on CPU or GPU. The status of the NuGraph integration in the LArSoft software framework will be presented, as well as initial studies about model interpretability and injection of domain knowledge.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

NuGraph2: A Graph Neural Network for Neutrino Event Reconstruction

Neutrino experiments are set to probe some of the most important open questions in physics, from CP violation and the nature of dark matter. The technology of choice for many of these experiments is the liquid argon time projection chamber (LArTPC). In current LArTPC experiments, reconstruction performance often represents a limiting factor for the sensitivity. New developments are therefore needed to unlock the full potential of LArTPC experiments. NuGraph2 is a state of the art Graph Neural Network for reconstruction of data in LArTPC experiments [https://arxiv.org/abs/2403.11872]. NuGraph2 utilizes a heterogeneous graph structure, with separate subgraphs of 2D nodes (hits in each plane) connected across planes via 3D nodes (space points). The model provides a consistent description of the neutrino interaction across all planes. NuGraph2 is a multi-purpose network, with a common message-passing attention engine connected to multiple decoders with different classification or regression tasks. These include the classification of detector hits according to the particle type that produced them (semantic segmentation) and the separation of hits from the neutrino interaction from hits due to noise or cosmic-ray background. Additional decoders are being developed, performing tasks such as the regression of the neutrino interaction vertex position. Performance results will be presented based on publicly available samples from MicroBooNE. These include both physics performance metrics, achieving 95% accuracy for semantic segmentation and 98% classification of neutrino hits, as well as computational metrics for training and for inference on CPU or GPU. The status of the NuGraph integration in the LArSoft software framework will be presented, as well as initial studies about model interpretability and injection of domain knowledge.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Time integration algorithms for the two-dimensional Euler equations on unstructured meshes

Explicit and implicit time integration algorithms for the two-dimensional Euler equations on unstructured grids are presented. Both cell-centered and cell-vertex finite volume upwind schemes utilizing Roe's approximate Riemann solver are developed. For the cell-vertex scheme, a four-stage Runge-Kutta time integration, a fourstage Runge-Kutta time integration with implicit residual averaging, a point Jacobi method, a symmetric point Gauss-Seidel method and two methods utilizing preconditioned sparse matrix solvers are presented. For the cell-centered scheme, a Runge-Kutta scheme, an implicit tridiagonal relaxation scheme modeled after line Gauss-Seidel, a fully implicit lower-upper (LU) decomposition, and a hybrid scheme utilizing both Runge-Kutta and LU methods are presented. A reverse Cuthill-McKee renumbering scheme is employed for the direct solver to decrease CPU time by reducing the fill of the Jacobian matrix. A comparison of the various time integration schemes is made for both first-order and higher order accurate solutions using several mesh sizes, higher order accuracy is achieved by using multidimensional monotone linear reconstruction procedures. The results obtained for a transonic flow over a circular arc suggest that the preconditioned sparse matrix solvers perform better than the other methods as the number of elements in the mesh increases.

Slack, David C.↗

Calculating the grain boundary inclination of voxelated grain structures using a smoothing algorithm

We have developed a flexible method for calculating the grain boundary (GB) inclinations of voxelated grain structure data using smoothing algorithms. We compared the performance of four algorithms: the linear interpolation, Allen–Cahn, level-set, and vertex algorithms. We assessed their accuracy using 2D and 3D cases with known inclinations. The vertex algorithm provided the best balance between accuracy and efficiency for 2D structures while the linear interpolation algorithm provided the best balance for 3D structures. We compared the GB inclinations calculated using our smoothing method on a 3D high energy X-ray diffraction microscopy (HEDM) dataset to those determined by meshing the GBs. The two approaches determined similar GB plane distributions, though they varied significantly at triple junctions. In conclusion, the smoothing method was demonstrated for two sources of 3D voxelated grain structures: HEDM data and results from Monte Carlo Potts grain growth simulations.

36 MATERIALS SCIENCE↗

Vertex finding in neutrino-nucleus interaction: a model architecture comparison

We compare different neural network architectures for machine learning algorithms designed to identify the neutrino interaction vertex position in the MINERvA detector. The architectures developed and optimized by hand are compared with the architectures developed in an automated way using the package “Multi-node Evolutionary Neural Networks for Deep Learning” (MENNDL), developed at Oak Ridge National Laboratory. While the domain-expert hand-tuned network was the best performer, the differences were negligible and the auto-generated networks performed as well. There is always a trade-off between human, and computer resources for network optimization and this work suggests that automated optimization, assuming resources are available, provides a compelling way to save significant expert time.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Expected tracking performance of the ATLAS Inner Tracker at the High-Luminosity LHC

The high-luminosity phase of LHC operations (HL-LHC), will feature a large increase in simultaneous proton-proton interactions per bunch crossing up to 200, compared with a typical leveling target of 64 in Run 3. Such an increase will create a very challenging environment in which to perform charged particle trajectory reconstruction, a task crucial for the success of the ATLAS physics program, and will exceed the capabilities of the current ATLAS Inner Detector (ID). A new all-silicon Inner Tracker (ITk) will replace the current ID in time for the start of the HL-LHC. To ensure successful use of the ITk capabilities in Run 4 and beyond, the ATLAS tracking software has been successfully adapted to achieve state-of-the-art track reconstruction in challenging high-luminosity conditions with the ITk detector. This paper presents the expected tracking performance of the ATLAS ITk based on the latest available developments since the ITk technical design reports.

47 OTHER INSTRUMENTATION↗