Search NASA⌕ Search

SEARCH · Search NASA

Results for “identification algorithms”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

A Privacy Preserving Distributed Model Identification Algorithm for Power Distribution Systems

Distributed control/optimization is a promising approach for network systems due to its advantages over centralized schemes, such as robustness, cost-effectiveness, and improved privacy. However, distributed methods can have drawbacks, such as slower convergence rates due to limited knowledge of the overall network model. Additionally, ensuring privacy in the communication of sensitive information can pose implementation challenges. To address this issue, we propose a distributed model identification algorithm that enables each agent to identify the sub-model that characterizes the relationship between its local control and the overall system outputs. The proposed algorithm maintains the privacy of local agents by only communicating through dummy variables. We demonstrate the efficacy of our algorithm in the context of power distribution systems by applying it to the voltage regulation of a modified IEEE distribution system. The proposed algorithm is well-suited to the needs of power distribution controls and offers an effective solution to the challenges of distributed model identification in network systems.

data-driven modeling↗
DOE OSTI2023

A Privacy Preserving Distributed Model Identification Algorithm for Power Distribution Systems: Preprint

Distributed control/optimization is a promising approach for network systems due to its advantages over centralized schemes, such as robustness, cost-effectiveness, and improved privacy. However, distributed methods can have drawbacks, such as slower convergence rates due to limited knowledge of the overall network model. Additionally, ensuring privacy in the communication of sensitive information can pose implementation challenges. To address this issue, we propose a distributed model identification algorithm that enables each agent to identify the sub-model that characterizes the relationship between its local control and the overall system outputs. The proposed algorithm maintains the privacy of local agents by only communicating through dummy variables. We demonstrate the efficacy of our algorithm in the context of power distribution systems by applying it to the voltage regulation of a modified IEEE distribution system. The proposed algorithm is well-suited to the needs of power distribution controls and offers an effective solution to the challenges of distributed model identification in network systems.

data-driven modeling↗
DOE OSTI2024

A Distributed Model Identification Algorithm for Multi-Agent Systems: Preprint

In this study, we investigate agent-based approach for system model identification with emphasis on power distribution system applications. Departing from conventional practices of relying on historical data for offline model identification, we adopt online update approach utilizing real-time data by employing the latest data points for gradient computation. This methodology offers advantages including a large reduction in the communication network's bandwidth requirements by minimizing the data exchanged at each iteration and enabling the model to adapt in real-time to disturbances. Furthermore, we extend our model identification process from linear frameworks to more complex non-linear convex models. This extension is validated through numerical studies demonstrating improved control performance for a synthetic IEEE test case.

data-driven control↗
DOE OSTI2024

A Comprehensive Review of Latent Space Dynamics Identification Algorithms for Intrusive and Non-Intrusive Reduced-Order-Modeling

Numerical solvers of partial differential equations (PDEs) have been widely employed for simulating physical systems. However, the computational cost remains a major bottleneck in various scientific and engineering applications, which has motivated the development of reduced-order models (ROMs). Recently, machine-learning-based ROMs have gained significant popularity and are promising for addressing some limitations of traditional ROM methods, especially for advection dominated systems. In this chapter, we focus on a particular framework known as Latent Space Dynamics Identification (LaSDI), which transforms the high-fidelity data, governed by a PDE, to simpler and low-dimensional latent-space data, governed by ordinary differential equations (ODEs). These ODEs can be learned and subsequently interpolated to make ROM predictions. Each building block of LaSDI can be easily modulated depending on the application, which makes the LaSDI framework highly flexible. In particular, we present strategies to enforce the laws of thermodynamics into LaSDI models (tLaSDI), enhance robustness in the presence of noise through the weak form (WLaSDI), select high-fidelity training data efficiently through active learning (gLaSDI, GPLaSDI), and quantify the ROM prediction uncertainty through Gaussian processes (GPLaSDI). We demonstrate the performance of different LaSDI approaches on Burgers equation, a non-linear heat conduction problem, and a plasma physics problem, showing that LaSDI algorithms can achieve relative errors of less than a few percent and up to thousands of times speed-ups.

Computational Engineering, Finance, and Science (c↗
DOE OSTI2023

Transcriptome architecture of the three main lineages of agrobacteria

ABSTRACT Agrobacteria are a diverse, polyphyletic group of prokaryotes with multipartite genomes capable of transferring DNA into the genomes of host plants, making them an essential tool in plant biotechnology. Despite their utility in plant transformation, genome-wide transcriptional regulation is not well understood across the three main lineages of agrobacteria. Transcription start sites (TSSs) are a necessary component of gene expression and regulation. In this study, we used differential RNA-seq and a TSS identification algorithm optimized on manually annotated TSS, then validated with existing TSS to identify thousands of TSS with nucleotide resolution for representatives of each lineage. We extend upon the 356 TSSs previously reported in Agrobacterium fabrum C58 by identifying 1,916 TSSs. In addition, we completed genomes and phenotyping of Rhizobium rhizogenes C16/80 and Allorhizobium vitis T60/94, identifying 2,650 and 2,432 TSSs, respectively. Parameter optimization was crucial for an accurate, high-resolution view of genome and transcriptional dynamics, highlighting the importance of algorithm optimization in genome-wide TSS identification and genomics at large. The optimized algorithm reduced the number of TSSs identified internal and antisense to the coding sequence on average by 90.5% and 91.9%, respectively. Comparison of TSS conservation between orthologs of the three lineages revealed differences in cell cycle regulation of ctrA as well as divergence of transcriptional regulation of chemotaxis-related genes when grown in conditions that simulate the plant environment. These results provide a framework to elucidate the mechanistic basis and evolution of pathology across the three main lineages of agrobacteria. IMPORTANCE Transcription start sites (TSSs) are fundamental for understanding gene expression and regulation. Agrobacteria, a group of prokaryotes with the ability to transfer DNA into the genomes of host plants, are widely used in plant biotechnology. However, the genome-wide transcriptional regulation of agrobacteria is not well understood, especially in less-studied lineages. Differential RNA-seq and an optimized algorithm enabled identification of thousands of TSSs with nucleotide resolution for representatives of each lineage. The results of this study provide a framework for elucidating the mechanistic basis and evolution of pathology across the three main lineages of agrobacteria. The optimized algorithm also highlights the importance of parameter optimization in genome-wide TSS identification and genomics at large.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Co-Occurring Atmospheric Features and Their Contributions to Precipitation Extremes

Object-based identification algorithms for atmospheric features are commonly utilized to attribute global precipitation. This study employs a systematic approach to examine feature co-occurrences and their relationships to mean and extreme precipitation. Four features are identified using existing data sets for atmospheric rivers (ARs), mesoscale convective systems (MCSs), low-pressure systems (LPSs), and fronts (FTs). Often, a single atmospheric phenomenon satisfies the criteria set by multiple feature identification algorithms, yielding an association between precipitation and multiple features. Over the extra-tropics, the number of features attributed to a single event typically increases with precipitation intensity. Over two-thirds of the precipitation is from co-occurring features, with a considerable fraction related to AR-FT co-occurrences. Over the tropics, about one-quarter of precipitation is associated with co-occurring features, with LPS-MCS co-occurrences contributing substantially in monsoon regions. MCSs are the leading single-feature contributors over tropical land and oceans. In the extra-tropics, FTs, ARs, and their co-occurrences account for over half of the total precipitation over oceans. AR-FT-MCS and FT-MCS co-occurrences contribute to extremes (precipitation exceeding the 95th percentile) over both oceans (over 30%) and land (over 20%). Any combination of features involving MCSs shows a larger contribution to high percentiles of precipitation intensity. A case analysis indicates that AR-FT-MCS co-occurrences exhibit convective instability and deep vertical motion, suggesting that the feature trackers and reanalysis are capturing physics relevant to both convective and frontal systems. The results here emphasize the need for simultaneous identifications of multiple features when attributing precipitation to atmospheric phenomena.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Using Temporal Information from Human Mobility Data to Detect Anchor Points

Spatiotemporal mobility data are available in massive quantities, but large quantities of data typically include fewer variables or data fields. Often, the only available fields are User ID, Longitude, Latitude, Timestamp (ULLT). This raises an important question: how much can we infer about human mobility patterns using only these four fields? With ULLT data, we do not know individuals' socioeconomic status information or when they are visiting their anchor points (AP) or locations (such as homes, places of employment, or schools), and it is a modern challenge to use this data to infer these characteristics. When detecting anchor locations with limited input information, verification and validation (VV) are significant challenges. This paper addresses the problem of identifying individuals' anchor locations using only temporal information from spatiotemporal datasets with limited attributes. Our approach does not explicitly use latitude and longitude during analysis. Locationbased information is only employed in the preprocessing stage to identify periods of movement (trips) and stops (dwelling). Beyond this step, all analysis is based on temporal patterns. In theory, if stops and dwell times could be detected through alternative means, our method could function entirely without location-based input. We demonstrate this methodology on the 2017 National Household Travel Survey (NHTS) data, because it includes a carefully designed and collected time use survey with representative sampling and labeled ground truth. The high-quality survey data allows us to test the accuracy of our methods because NHTS contains intended place labels and agent/user characteristics. We have also applied our validated AP identification algorithm on very large-scale GPS based trajectory data for Patterns-of-Life (PoL) assessment and other applications, but due to space limit that could not be presented here.

McBride, Liz [ORNL] (ORCID:0000000286925869)↗
DOE OSTI2025

Identification of tau leptons using a convolutional neural network with domain adaptation

A tau lepton identification algorithm,DeepTau, based on convolutional neural network techniques, has been developed in the CMS experiment to discriminate reconstructed hadronic decays of tau leptons (τ h ) from quark or gluon jets and electrons and muons that are misreconstructed as τ h candidates. The latest version of this algorithm, v2.5, includes domain adaptation by backpropagation, a technique that reduces discrepancies between collision data and simulation in the region with the highest purity of genuine τh candidates. Additionally, a refined training workflow improves classification performance with respect to the previous version of the algorithm, with a reduction of 30–50% in the probability for quark and gluon jets to be misidentified as τ h candidates for given reconstruction and identification efficiencies. This paper presents the novel improvements introduced in theDeepTau algorithm and evaluates its performance in LHC proton-proton collision data at √(s) = 13 and 13.6 TeV collected in 2018 and 2022 with integrated luminosities of 60 and 35 fb -1 , respectively. Techniques to calibrate the performance of the τ h identification algorithm in simulation with respect to its measured performance in real data are presented, together with a subset of results among those measured for use in CMS physics analyses.

Large detector-systems performance↗
DOE OSTI2025

Real-Time, Adaptive Radiological Anomaly Detection and Isotope Identification Using Non-Negative Matrix Factorization

Spectroscopic anomaly detection and isotope identification algorithms are integral components in nuclear nonproliferation applications such as search operations. The task is especially challenging in the case of mobile detector systems because the observed gamma-ray background changes more than for a static detector system, and a pretrained background model can easily find itself out of domain. The result is that algorithms may exceed their intended false alarm rate or sacrifice detection sensitivity to maintain the desired false alarm rate. Non-negative matrix factorization (NMF) is a powerful tool for spectral anomaly detection and identification, but, like many similar algorithms that rely on data-driven background models, in its conventional implementation, it is unable to update in real time to account for environmental changes that affect the background spectroscopic signature. Here, we have developed a novel NMF-based algorithm that periodically updates its background model to accommodate changing environmental conditions. The adaptive NMF algorithm involves fewer assumptions about its environment, making it more generalizable than existing NMF-based methods while maintaining or exceeding detection performance on simulated and real-world datasets.

Anomaly detection↗
DOE OSTI2025

Detection of Isotopes in Urban Source Search Low-Count Gamma Spectra Using Hopfield Neural Networks

Source search campaigns involve measurements of background gamma-ray spectra with a mobile detector-spectrometer traveling along arbitrarily chosen trajectories over a wide screening area. Radiation counts are typically measured with a tellurium-doped sodium iodide [NaI(Tl)] scintillator detector-spectrometer in short acquisition intervals, usually 1 s. The objective is to detect orphan isotopes with half-lives shorter than those of the isotopes in the natural background. In principle, radioisotopes can be identified by their unique gamma emission spectrum. However, detecting orphan isotopes in search data is challenging because low counts measured in short acquisition intervals result in incomplete spectral lines. In this study, we investigate the performance of a Hopfield neural network (HNN) that implements an auto-associative memory for the detection of isotopes of interest in an urban search campaign. The HNN is trained on one example of gamma spectra with well-resolved spectral lines of each isotope of interest. During testing, the auto-associative memory implementation of the HNN processes low-count gamma spectra with partially complete isotopic lines by matching incoming measurements to the closest one of its memory-stored patterns. The testing database consisted of almost 10 000 1-s gamma spectra, including measurements of orphan isotopes 137 Cs, 241 Am, and 131 I, obtained during two urban search surveys with a NaI(Tl) detector. The performance of the HNN detection algorithm was evaluated using precision, recall, and F1 scores, and benchmarked with a multiple linear regression (MLR) identification algorithm. In conclusion, the test results demonstrate that HNN outperforms MLR in the detection of all the isotopes of interest.

Auto associative memory↗
DOE OSTI2025

sourcePy

Pollutant source identification techniques (of which there are many variations) are either locked behind researchers writing their own code for each use case or GUI platforms that are easy to use but inflexible and opaque. The Python package sourcePy brings together many of the pollutant source identification algorithms, giving the user full control out of the box. It aims to create a platform for source identification experiments where the full analysis from beginning to end can be done in Python, with a level of specificity in design that isn't available in the GUI options. sourcePy provides users with a few key features: -A Python interface with HYSPLIT, which can be used to generate trajectories and concentration plumes -Several Python classes which standardize the preparation and processing of data related to source identification experiments -Example scripts and notebooks that allow even new python users to get started with their own experiments quickly -Visualization methods

Arseneau, Isaac [Oak Ridge National Laboratory (OR↗
DOE OSTI2025

Replicative Assessment of Spectroscopic Equipment v3.1

The Replicative Assessment of Spectrometric Equipment (RASE) is a software for evaluating the performance of radiation detectors and isotope identification algorithms. It uses a semi-empirical approach to rapidly generate synthetic spectra and inject into detector's software to obtain nuclide identification response. RASE facilitates studies of spectroscopic device performance and a quantitative assessment of its capabilities to correctly distinguish and identify isotopes of interest in realistic scenarios

Sangiorgio, Samuele [Lawrence Livermore National L↗
DOE OSTI2024

Weak-form latent space dynamics identification

Recent work in data-driven modeling has demonstrated that a weak formulation of model equations enhances the noise robustness of a wide range of computational methods. In this paper, we demonstrate the power of the weak form to enhance the LaSDI (Latent Space Dynamics Identification) algorithm, a recently developed data-driven reduced order modeling technique. We introduce a weak form-based version WLaSDI (Weak-form Latent Space Dynamics Identification). WLaSDI first compresses data, then projects onto the test functions and learns the local latent space models. Notably, WLaSDI demonstrates significantly enhanced robustness to noise. With WLaSDI, the local latent space is obtained using weak-form equation learning techniques. Compared to the standard sparse identification of nonlinear dynamics (SINDy) used in LaSDI, the variance reduction of the weak form guarantees a robust and precise latent space recovery, hence allowing for a fast, robust, and accurate simulation. We demonstrate the efficacy of WLaSDI vs. LaSDI on several common benchmark examples including viscid and inviscid Burgers', radial advection, and heat conduction. For instance, in the case of 1D inviscid Burgers' simulations with the addition of up to 100% Gaussian white noise, the relative error remains consistently below 6% for WLaSDI, while it can exceed 10,000% for LaSDI. Similarly, for radial advection simulations, the relative errors stay below 15% for WLaSDI, in stark contrast to the potential errors of up to 10,000% with LaSDI. Moreover, speedups of several orders of magnitude can be obtained with WLaSDI. For example applying WLaSDI to 1D Burgers' yields a 140X speedup compared to the corresponding full order model.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Performance of the LHCb muon detector in Run 3

In Run 3 of the LHC, the instantaneous luminosity at the LHCb interaction point has been increased by a factor of five, from to $\mathscr{L}$ = 4 x 10 32 cm -2 s -2 to $\mathscr{L}$ = 2 x 10 33 cm -2 s -1 . Several hardware interventions, including a complete overhaul of the readout electronics, have been carried out on the muon detector. The muon identification algorithms in the software trigger were improved with the aim of ensuring Run 2 performance under a higher particle rate. The operation and calibration of the upgraded muon detector are presented. The muon detection efficiency and muon identification performance are evaluated on data calibration samples collected during the year 2024. A muon identification efficiency above 90% with sub-percent hadron misidentification probability is achieved by exploiting the pattern of hits in the muon detector.

Gaseous detectors↗
DOE OSTI2024

Metrics and Methods for Radiation Detection Algorithm Characterization for Nuclear/Radiological Source Search

This report presents a series of recommendations for data to train and evaluate radiation detection algorithms and performance metrics to evaluate these algorithms. These recommendations were formed through a community consensus approach through the Detection Radiation Algorithms Group (DRAG), a multi-institution collaboration spanning eight Department of Energy laboratories and John Hopkins Applied Physics Laboratory. This report includes recommendations on background data variability, and metrics to quantify variability, sources and shielding configurations to include in data collection campaigns and detector response variability. In addition, this report describes several anomaly detection and identification algorithms and recommends metrics to report their performance. Finally, this report ends with a discussion on machine learning algorithms.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

Anomaly Detection and Identification Using a Leave-One-Variable-Out Method

At nuclear power plants (NPPs), anomaly detection and identification (i.e., determining the causes of anomalies) are important tasks for ensuring the safe and efficient operation of NPPs. These tasks are currently labor-intensive and costly, and are made more difficult by the size and complexity of NPP systems. An alternative approach to conducting these tasks is to automate them, such as via the reconstruction-based contribution method, which is a well-researched unsupervised machine learning method that uses a data-driven model of anomaly-free behavior to detect events and then identify each variable’s contributions to those events. The present effort developed a novel contribution approach that utilized a leave-one-variable-out (LOVO) model, with which each variable is predicted using all the other variables. The novelty lay in transforming this model into a reconstruction model and modifying the identification algorithm to work with the new reconstruction model. To evaluate this method in a controlled environment, a synthetic dataset based on spring-mass-damper (SMD) systems (commonly found in mechanical engineering references) was used, with known anomalies introduced into the system. The proposed method successfully detected the anomalies and afforded insights into their causes, thus enabling the appropriate identifications to be made.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

Probing Naturalness with Searches for Supersymmetric Higgs Partners at the Large Hadron Collider

The discovery of the Higgs boson at the Large Hadron Collider completed the standard model of particle physics and led to the 2013 Nobel Prize. While it has been extremely successful in describing a wide variety of phenomena, the standard model cannot be the final theory of nature because it is unable to explain why the Higgs boson mass lies at the electroweak scale rather than 16 orders of magnitude larger at the Planck scale, a theoretical flaw known as the ``hierarchy problem.'' Supersymmetry is a standard model extension that could provide a natural solution to the hierarchy problem by introducing light supersymmetric Higgs partners. This proposal focused on searches that are sensitive to supersymmetric Higgs partners in data collected by the ATLAS experiment, which were carried out by the University of Illinois high-energy physics group led by PI Ben Hooberman as part of his Department of Energy Early Career Research Program award from 2017-2023. The searches were complemented by improvements to particle identification algorithms and the ATLAS trigger system that extend the sensitivity of future supersymmetry searches.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗