Search NASA⌕ Search

SEARCH · Search NASA

Results for “HIT”

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.

At least 361 records · Page 20

Measurement of the background in the CMS muon detector in ${p}{p}$-collisions at $\sqrt{s} = 13$ TeV

The CMS detector, including its muon system, has been operating at the CERN LHC in increasingly challenging conditions for about 15 years. The muon detector was designed to provide excellent triggering and track reconstruction for muons produced in proton–proton collisons at an instantaneous luminosity ($\mathcal{L}$) of 1 x 10 34 cm –2 s –1 . During the Run 2 data-taking period (2015–2018), the LHC achieved an instantaneous luminosity of twice its design value, resulting in larger background rates and making the efficient detection of muons more difficult. While some backgrounds result from natural radioactivity, cosmic rays, and interactions of the circulating protons with residual gas in the beam pipe, the dominant source of background hits in the muon system arises from proton–proton interactions themselves. Charged hadrons leaving the calorimeters produce energy deposits in the muon chambers. In addition, high-energy particles interacting in the hadron calorimeter and forward shielding elements generate thermal neutrons, which leak out of the calorimeter and shielding structures, filling the CMS cavern. We describe the method used to measure the background rates in the various muon subsystems. These rates, in conjunction with simulations, can be used to estimate the expected backgrounds in the High-Luminosity LHC. This machine will run for at least 10 years starting in 2029 reaching an instantaneous luminosity of $\mathcal{L}$ = 5 x 10 34 cm –2 s –1 and increasing ultimately to $\mathcal{L}$ = 7.5 x 10 34 cm –2 s –1 . These background estimates have been a key ingredient for the planning and design of the muon detector upgrade.

Tytgat, M. (ORCID:0000000239902074)↗

Neutrino interaction vertex reconstruction in DUNE with Pandora deep learning

The Pandora Software Development Kit and algorithm libraries perform reconstruction of neutrino interactions in liquid argon time projection chamber detectors. Pandora is the primary event reconstruction software used at the Deep Underground Neutrino Experiment, which will operate four large-scale liquid argon time projection chambers at the far detector site in South Dakota, producing high-resolution images of charged particles emerging from neutrino interactions. While these high-resolution images provide excellent opportunities for physics, the complex topologies require sophisticated pattern recognition capabilities to interpret signals from the detectors as physically meaningful objects that form the inputs to physics analyses. A critical component is the identification of the neutrino interaction vertex. Subsequent reconstruction algorithms use this location to identify the individual primary particles and ensure they each result in a separate reconstructed particle. A new vertex-finding procedure described in this article integrates a U-ResNet neural network performing hit-level classification into the multi-algorithm approach used by Pandora to identify the neutrino interaction vertex. The machine learning solution is seamlessly integrated into a chain of pattern-recognition algorithms. The technique substantially outperforms the previous BDT-based solution, with a more than 20% increase in the efficiency of sub-1 cm vertex reconstruction across all neutrino flavours.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Reconstruction of atmospheric neutrinos in DUNE’s horizontal-drift far-detector module

This paper reports on the capabilities in reconstructing and identifying atmospheric neutrino interactions in one of the Deep Underground Neutrino Experiment’s (DUNE) far detector modules, a liquid argon time projection chamber (LArTPC) with horizontal drift (FD-HD) of ionization electrons. The reconstruction is based upon the workflow developed for DUNE’s long-baseline oscillation analysis, with some necessary machine-learning models’ retraining and the addition of features relevant only to atmospheric neutrinos such as the neutrino direction reconstruction. Where relevant, the impact of the detection of the charged particles of the hadronic system is emphasized, and comparisons are carried out between the case when lepton-only information is considered in the reconstruction (as is the case for many neutrino oscillation experiments), versus when all particles identified in the LArTPC were included. Three neutrino direction reconstruction methods have been developed and studied for the atmospheric analyses: using lepton-only information, using all reconstructed particles, and using only correlations from reconstructed hits. The results indicate that incorporating more than just lepton information significantly improves the resolution of both neutrino direction and energy reconstruction. The angle reconstruction algorithms developed in this work result in no strong dependence on particle direction for reconstruction efficiencies or neutrino flavor identification. This comprehensive review of the reconstruction of atmospheric neutrinos in DUNE’s FD-HD LArTPC is the first step towards developing a first neutrino oscillation sensitivity analysis, which will ready DUNE for its first measurements.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

FCC-ee interaction region backgrounds

The FCC-ee machine induced backgrounds on the two proposed detectors (CLD and IDEA) have been studied in detail. Synchrotron Radiation (SR) considerations dictate the Interaction Region (IR) optimization. An asymmetric IR design limits the final bend critical energy to 100 keV. Masks placed before the final focus quadrupole protect the detector from direct hits, and a shield placed around the beam pipe from secondary particles, keeping the effect of SR on the detector to negligible levels. The most important source of background is expected to be the Incoherent Pair Creation (IPC). Its effect has been studied in full simulation and reconstruction, and it was shown that it will not pose a problem for the detector, even if conservative estimations for the time resolution of the detector sensors are assumed. Moreover, the γγ → hadrons, radiative Bhabhas and beam-gas interaction induced backgrounds were studied. All were found to have small to negligible effect on the detector. Finally overall, the FCC–ee interaction region backgrounds are not expected to compromise the detector performance.

47 OTHER INSTRUMENTATION↗

PLANC: Parallel Low-rank Approximation with Nonnegativity Constraints

In this work, we consider the problem of low-rank approximation of massive dense nonnegative tensor data, for example, to discover latent patterns in video and imaging applications. As the size of data sets grows, single workstations are hitting bottlenecks in both computation time and available memory. We propose a distributed-memory parallel computing solution to handle massive data sets, loading the input data across the memories of multiple nodes, and performing efficient and scalable parallel algorithms to compute the low-rank approximation. We present a software package called Parallel Low-rank Approximation with Nonnegativity Constraints, which implements our solution and allows for extension in terms of data (dense or sparse, matrices or tensors of any order), algorithm (e.g., from multiplicative updating techniques to alternating direction method of multipliers), and architecture (we exploit GPUs to accelerate the computation in this work). We describe our parallel distributions and algorithms, which are careful to avoid unnecessary communication and computation, show how to extend the software to include new algorithms and/or constraints, and report efficiency and scalability results for both synthetic and real-world data sets.

97 MATHEMATICS AND COMPUTING↗

VTK-m: Visualization for the Exascale Era and Beyond

A recent trend in modern high-performance computing is the increasing use of hybrid architectures, where the vast majority of performance comes from accelerators. Modern accelerators are based on Graphics Processing Units (GPU) that contain many low power cores that in their aggregate provides an extremely high computation rate. Current and future CPU processors are requiring more explicit parallelism as each successive version of the hardware packs in more cores, and technologies like hyperthreading and vector operations require even more parallel processing to leverage each core’s full potential. As an example, the Frontier supercomputer installed at Oak Ridge National Laboratories recently hit a record breaking 1.1 exaflops1 on the LINPACK HPC benchmark [Shoemaker 2022]. The system contains 37632 AMD MI250x GPUs which requires more than half a billion threads to keep the system fully utilized [Khizeran 2022].VTK-m is a toolkit of scientific visualization algorithms for these emerging processor architectures. VTK-m supports the fine-grained concurrency for data analysis and visualization algorithms required to drive extreme scale computing by providing abstract models for data and execution that can be applied to a variety of algorithms across many different processor architectures.

Bolstad, Mark↗

CAHS: Context-Aware Homology Search

Protein homology search is foundational to bioinformatics: it supports annotation transfer, structure/function inference, and evolutionary analysis over rapidly expanding sequence repositories (e.g., UniProtKB). Profile hidden Markov models (pHMMs), as implemented in HMMER, remain the most widely trusted approach because they provide statistically calibrated E-values; however, their gap behavior is fixed once a profile is trained, despite biological evidence that insertion/deletion tolerance varies across flexible loops and intrinsically disordered regions. We present CAHS (Context-Aware Homology Search), a lightweight query-time adapter for pHMM search that incorporates learned and biologically motivated signals without changing HMMER's downstream search pipeline or its calibrated E-value reporting. Given a query sequence, CAHS computes per-residue representations from a protein language model and a disorder predictor, maps these to profile coordinates, and modulates only match-state transition rows (gap-open and gap-extension probabilities) while preserving Plan7 constraints. We comprehensively evaluate CAHS across six structurally diverse protein families and multi-domain architectures against a 570k-sequence target corpus. CAHS expands detection capability, retrieving thousands of additional remote homologs at relaxed thresholds by maintaining alignment quality through flexible regions. For multi-domain proteins, context-aware modulation resolves 94% of fragmented alignments. Crucially, CAHS preserves hit-set invariance at stringent operating points (E<10-10), demonstrating increased statistical confidence without inflating false positives. Furthermore, sharper statistical distinction between homologs and background noise during early filter stages yields up to a 3.87× acceleration in end-to-end wall-clock time on high-performance computing clusters. Overall, CAHS illustrates a practical AI-for-science design pattern: augmenting a trusted probabilistic model with query-specific learned signals to improve interpretable, reproducible inference in data-rich biology.

Bhattaram, Swethasree [Georgia Institute of Techno↗

Impact Modeling and Testing of Pouch and Prismatic Cells

Understanding battery response under impact is critical to improve the safety of electrified vehicles. Nevertheless, predicting the impact behaviors of batteries is not straightforward since a battery cell usually contains hundreds of thin layers with dramatically different material properties and multiple physical processes occur simultaneously during cell deformation. Here we utilized both empirical tests and numerical models to capture the failure process of pouch and prismatic cells in various impact scenarios. In each test, a cell was hit once by an indenter dropped from a certain height. During which the cell penetration, loading force, voltage and temperature were monitored to characterize the cell’s response. Meanwhile, numerical models were developed to capture the coupled mechanical, electrical, electrochemical and thermal responses of batteries. In these models, the cell bulk was treated as a homogeneous part to achieve computational efficiency required by large-scale simulations, and it was represented by the geologic cap model that allows both shear and compaction deformation. Simulation results showed agreement with experimental data in essential features of cell behaviors during impact. Details of the test setup, model development and cell failure behaviors are presented in this paper. Additionally, capabilities, limitations and future improvement of the battery safety modeling are discussed.

25 ENERGY STORAGE↗

Mechanism and dynamics of fatty acid photodecarboxylase

The deposition contains diffraction patterns after hit-finding of time-resolved serial femtosecond crystallography measurements on fatty acid photodecarboxylase performed at LCLS XFEL (proposal ID: LT59). Five datasets are available. One dataset without pump laser excitation, labeled as "dark" and four time-resolved datasets with pump laser excitation at four different time-points labeled as "20 ps", "900 ps", "300 ns" and "2 μs". Please check the publication for more information about the datasets.

CXI↗

Idaho National Laboratory Data Acquisition And Processing System

The INLDAS data acquisition and processing system is designed to develop prototype measurements and real-time processing techniques. The INLDAS hardware and firmware currently consists of National Instruments • NI-DAQmx 14.1 • cDAQ-9184 • 9205 • 9211 INLDAS can perform of standard data acquisition functions as well as novel functions and real-time processing algorithms. There are 3 acquisition modes to choose from: • Continuous mode runs when the user hits start, processing data and logging it to file • SWTrigger mode waits for one or more predefined triggers before acquiring data. It will buffer data as well, so it can record data that happened shortly before the trigger • Wakeup mode waits on predefined timers. When a time goes off, it acquires a preset amount of data There are also 3 Data Processing Modes • Normal mode does no processing besides the rolling average • FFT Mode Performs an FFT on incoming data every time the time window has elapsed • STFFT mode

Smith, JamesA↗

HD-Bind: Encoding of Molecular Structure with Low Precision, Hyperdimensional Binary Representations

Publicly available collections of drug-like molecules have grown to comprise tens of billions of compounds due to advances in combinatorial chemistry. Traditional methods for identifying "hit" molecules from a large collection of potential drug-like candidates have relied on biophysical theory to compute approximations to the Gibbs free energy of the binding interaction between the drug and its protein target. These approaches have the major drawback that they require exceptional computing capabilities for even relatively small collections of molecules. Hyperdimensional Computing (HDC) is a recently-proposed learning paradigm that represents data with high-dimension binary vectors; this allows the use of low-precision binary vector arithmetic to create models of the data that can be learned without the need for the gradient-based optimization required in many conventional machine learning and deep learning methods. This algorithmic simplicity allows for acceleration in hardware that has been previously demonstrated in a range of application areas. We consider existing HDC approaches for molecular property classification and introduce two novel encodings of a commonly-used molecular representation, the extended connectivity fingerprint (ECFP). We show that HDC-based inference methods are as much as 91 times more efficient than traditional machine learning methods, and achieve an acceleration of nearly nine orders of magnitude compared to molecular docking. Our results show that HDC accelerated methods retain competitive accuracy on a number of well-studied tasks such as molecular property predictions using the MoleculeNet dataset, and bind/no-bind activity classification using the DUD-E and LIT-PCBA datasets. Our work thus motivates further investigation into molecular representation learning to develop ultraefficient pre-screening tools.

Jones, William↗

Knowledge Oriented Graph Unified Transformer (KOGUT) v0.1

KOGUT — Knowledge Oriented Graph Unified Transformer KOGUT implements the Relational Graph Transformer (RelGT) architecture for knowledge graph link prediction in biological domains, with a primary focus on microbial growth media prediction. While the original RelGT (arXiv:2505.10960) targets relational tables, time series, and multi-table databases, KOGUT adapts this architecture for heterogeneous biological knowledge graphs, providing first-in-class AI predictive models for microbial cultivation. Key Adaptations Beyond Original RelGT: - Knowledge Graph Focus: Applied to biological KGs with semantic node types (taxa, chemicals, media, phenotypes, environments) versus generic relational database tables, trained on the KG-Microbe knowledge graph (1.3M entities, 2.9M edges, 24 relation types). - Multimodal Node Encoding: Integrates node labels, categories, descriptions, and synonyms from KG metadata through learned embedding layers—adapting relational column features to graph node attributes with textual semantics. - Extended K-Hop Subgraph Strategy: Optimized neighborhood sampling (3-hop default, configurable up to 200 nodes) tuned for sparse biological networks, building on the original local-global attention framework with biological relation preservation. - Biolink Predicate Preservation: Type-specific transformations for 24 biological edge semantics (occurs_in, consumes, produces, has_phenotype, subclass_of) beyond standard relational foreign keys, enabling multi-relation link prediction. - Inductive Learning Support: Enables zero-shot predictions for novel taxa through feature-based embeddings (temperature, oxygen requirements, gram stain, cell shape), extending the original transductive relational benchmark scope to uncultured microorganisms. CheapSOTA Performance Optimizations (This Distribution): - VQ-EMA Centroid Attention: Vector quantization with exponential moving average for improved global context modeling (+5-10% MRR improvement). - HDF5 Precomputed Data Loading: One-time preprocessing of k-hop subgraphs to eliminate redundant graph traversals (2-5× training speedup). - Distributed Data Parallel Training: Multi-GPU support for scaling to larger knowledge graphs (tested on 4× NVIDIA A100 GPUs at NERSC Perlmutter). - Mixed Precision Training: Automatic mixed precision (AMP) for memory efficiency and faster training. Advantages Over Standard Knowledge Graph Embedding Models: Combines RelGT's proven multi-element tokenization (features, type, hop, structure) with graph-native biological representations, enabling interpretable link prediction across heterogeneous entities that standard embedding models (TransE, RotatE, ComplEx) and table-based transformers cannot directly model. Achieves near-perfect performance on microbial growth media prediction (MRR: 0.9966, Precision@1: 0.9932, Hit@10: 1.0000) while maintaining explainability through attention-based reasoning over biological pathways. Training Data: - KG-Microbe merged knowledge graph: 1,379,337 nodes, 2,960,472 edges - 24 biological relation types including taxonomic hierarchies, metabolic interactions, phenotype associations, and environmental relationships - Primary prediction task: Growth media suitability for microbial taxa (biolink:occurs_in, 50K edges) - Multi-relation capability: Predicts links for any of the 24 relation types, including chemical consumption/production, phenotype associations, and taxonomic classification Citation: Original RelGT Architecture: Dwivedi et al., "Relational Graph Transformer", arXiv:2505.10960, 2025 KOGUT Implementation: Knowledge Oriented Graph Unified Transformer for Microbial Growth Media Prediction Developed at Lawrence Berkeley National Laboratory (LBNL) Trained on NERSC Perlmutter supercomputer

Joachimiak, Marcin [Lawrence Berkeley National Lab↗

Record-Breaking Atmospheric River Drives April 2024 Extreme Precipitation in the United Arab Emirates and the Surrounding Gulf Region

In mid-April 2024, the United Arab Emirates (UAE) and the surrounding Gulf region experienced unprecedented rainfall and catastrophic flooding, causing widespread damage, loss of life, and significant economic costs. During the 3-day period from 15 to 17 April, rainfall in the UAE exceeded 100 mm in the hardest-hit areas, with more than 170% of the typical annual precipitation recorded in just 72 h. The event was associated with exceptionally strong integrated water vapor transport (IVT), driven by a persistent low pressure system and a focused corridor of moisture transport. This environment, combined with favorable dynamical and convective conditions, triggered intense thunderstorms and widespread flooding. This article examines the role of an atmospheric river (AR) in the April 2024 extreme precipitation event, emphasizing the contribution of extreme IVT to preconditioning and amplifying the heavy rainfall. While this event has previously been described primarily in terms of a mesoscale convective system (MCS) and potential vorticity (PV) streamers, here we document and illustrate its close relationship to a record-breaking moisture transport corridor. This AR-based perspective highlights how large-scale moisture-transport frameworks can complement synoptic and mesoscale analyses in understanding extreme rainfall in arid and semiarid regions such as the UAE and the Gulf. The event serves as a stark example of the vulnerabilities faced by arid regions, where atmospheric conditions conducive to extreme flooding may become more frequent in the future.

Massoud, Elias [ORNL] (ORCID:0000000217725361)↗

An implicit barotropic mode solver for MPAS-ocean using a modern Fortran solver interface

Here, we demonstrate use of a modern Fortran solver interface to manage solver algorithms for an implicit barotropic mode solver in the Model for Predictions Across Scales-Ocean (MPAS-O). ForTrilinos, a Fortran interface to Trilinos that contains a large collection of solver capabilities written in C++, has been implemented in MPAS-O to provide access to a suite of linear solver options. By virtue of the simplified wrapper and interface generator (SWIG) automation tool that generates modern Fortran interfaces to C++ code, we were able to implement the Fortran solver interface in MPAS-O using a familiar Fortran coding style while minimizing performance degradation. The ForTrilinos solver interface is written within MPAS-O’s time stepping modules as a subroutine in conjunction with MPAS-O code. Applied to an idealized ocean and a high-resolution realistic ocean test case, parallel performance of ForTrilinos solvers is examined. It is found that parallel scalability of the ForTrilinos solvers is highly dependent on the number of global synchronization points per solver iteration in each iterative solver algorithm. ForTrilinos solvers perform best compared to the Fortran hand-crafted (FHC) solver when the amount of work per processor is large enough. However, parallel scalability is better with the FHC solver and so when the work per core is modest FHC outperforms ForTrilinos. The intercomparison between the ForTrilinos and FHC solvers reveals that this performance hit in the ForTrilinos solver mostly comes from the global synchronization process, while suggesting that the matrix-vector multiplication process in the FHC solver needs to be optimized for better performance.

97 MATHEMATICS AND COMPUTING↗

Effects of machine learning errors on human decision-making: manipulations of model accuracy, error types, and error importance

Abstract This study addressed the cognitive impacts of providing correct and incorrect machine learning (ML) outputs in support of an object detection task. The study consisted of five experiments that manipulated the accuracy and importance of mock ML outputs. In each of the experiments, participants were given the T and L task with T-shaped targets and L-shaped distractors. They were tasked with categorizing each image as target present or target absent. In Experiment 1, they performed this task without the aid of ML outputs. In Experiments 2–5, they were shown images with bounding boxes, representing the output of an ML model. The outputs could be correct (hits and correct rejections), or they could be erroneous (false alarms and misses). Experiment 2 manipulated the overall accuracy of these mock ML outputs. Experiment 3 manipulated the proportion of different types of errors. Experiments 4 and 5 manipulated the importance of specific types of stimuli or model errors, as well as the framing of the task in terms of human or model performance. These experiments showed that model misses were consistently harder for participants to detect than model false alarms. In general, as the model’s performance increased, human performance increased as well, but in many cases the participants were more likely to overlook model errors when the model had high accuracy overall. Warning participants to be on the lookout for specific types of model errors had very little impact on their performance. Overall, our results emphasize the importance of considering human cognition when determining what level of model performance and types of model errors are acceptable for a given task.

97 MATHEMATICS AND COMPUTING↗

Moving toward automated µFTIR spectra matching for microplastic identification: addressing false identifications and improving accuracy

Abstract Infrared spectroscopy is a widely used tool for studying microplastics and identifying microparticles. Researchers rely on spectral libraries to differentiate between synthetic and natural materials. Unfortunately, spectral library matching is not perfect, and best practices require researchers to use time consuming, manual peak matching to assess spectral matches. Moving toward automated matching requires increased confidence in the matching process. Using spectra matching software may increase the efficiency of particle identification, however some matching strategies may confuse natural materials such as cotton, silk, and plant matter with common classes of synthetics such as polyesters and polyamides. In this experiment, we prepared 22 pristine sample materials from natural and synthetic sources and measured micro-Fourier transform infrared (µFTIR) spectra in transmission mode for each sample using a Thermo Nicolet iN10 MX instrument. The collected spectra were then input into two spectral library matching systems (Omnic Picta and Open Specy), using a total of five identification routines. Next, we placed a subset of four pristine microplastic materials in a biologically active river system for two weeks to simulate environmental samples. These simulated environmental samples were processed using 10% hydrogen peroxide for 24 h to remove organic contamination and then identified using the strongest performing library. We found that libraries with fewer sample spectra produced lower correlation matches and that using derivative correction greatly reduced the number of inaccuracies in identifying materials as either natural or synthetic. We also found that environmental fouling reduced the correlation value of library matches when compared to pristine particles, however the effect was not consistent across the four materials tested. Overall, we found that the accuracy of automated library matching in the tested systems and processing routines varied from 64.1 to 98.0% for distinguishing between natural and synthetic materials, and that a high Hit Quality Index (HQI) did not always correlate with accuracy. These results are important for the microplastic field, demonstrating a need to rigorously test spectral libraries and processing routines with known materials to ensure identification accuracy.

Kozloski, Rachel↗