Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm selection”

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 991 records · Page 55

Local modeling for FRF estimation with noisy input measurements

The frequency response function (FRF) is an essential means by which dynamic systems are qualified. In recent years, local modeling approaches have been extensively researched and shown to significantly outperform traditional FRF estimators. However, the standard local modeling approach assumes a perfectly-known system input, which results in biased FRF estimates in the presence of input noise. This paper derives a simple adjustment that can be used to improve FRF estimation for systems subjected to random excitation with noisy input data. This improvement can be implemented with little modification to standard local modeling algorithms and with little additional computational burden. The adjustment is coupled with a model selection procedure to avoid underfitting and overfitting. In conclusion, the methods presented in this paper are validated on a simulation, and they are shown to reduce bias due to input noise.

47 OTHER INSTRUMENTATION↗

Systematic Generation of Moment Invariant Bases for 2D and 3D Tensor Fields

Moment invariants have been successfully applied to pattern detection tasks in 2D and 3D scalar, vector, and matrix valued data. However so far no flexible basis of invariants exists, i.e., no set that is optimal in the sense that it is complete and independent for every input pattern. Here, we prove that a basis of moment invariants can be generated that consists of tensor contractions of not more than two different moment tensors each under the conjecture of the set of all possible tensor contractions to be complete. This result allows us to derive the first generator algorithm that produces flexible bases of moment invariants with respect to orthogonal transformations by selecting a single non-zero moment to pair with all others in these two-factor products. Since at least one non-zero moment can be found in every non-zero pattern, this approach always generates a complete set of descriptors.

97 MATHEMATICS AND COMPUTING↗

Darwinian Model Building

We present a way to generate heuristic mathematical models based on the Darwinian principles of variation and selection in a pool of individuals over many generations. Each individual has a genotype (the hereditary properties) and a phenotype (the expression of these properties in the environment). Variation is achieved by cross-over and mutation operations on the genotype which consists in the present case of a single chromosome. The genotypes 'live' in the environment of the data. Nested Sampling is used to optimize the free parameters of the models given the data, thus giving rise to the phenotypes. Selection is based on the phenotypes.The evidences which naturally follow from the Nested Sampling Algorithm are used in a second level of Nested Sampling to find increasingly better models.The data in this paper originate from the Leiden Cytology and Pathology Laboratory (LCPL), which screens pap smears for cervical cancer. We have data for 1750 women who on average underwent 5 tests each. The data on individual women are treated as a small time series. We will try to estimate the next value of the prime cancer indicator from previous tests of the same woman.

97 MATHEMATICS AND COMPUTING↗

IBIXFIT: A Tool For The Analysis Of Microcalorimeter PIXE Spectra

PIXE analysis software has been for long mainly tuned to the needs of Si(Li) detector based spectra analysis and quantification methods based on K{sub {alpha}} or L{sub {alpha}} X-ray lines. Still, recent evidences related to the study of relative line intensities and new developments in detection equipment, namely the emergence of commercial microcalorimeter based X-ray detectors, have brought up the possibility that in the near future PIXE will become more than just major lines quantification. A main issue that became evident as a consequence of this was the need to be able to fit PIXE spectra without prior knowledge of relative line intensities. Considering new developments it may be necessary to generalize PIXE to a wider notion of ion beam induced X-ray (IBIX) emission, to include the quantification of processes such as Radiative Auger Emission. In order to answer to this need, the IBIXFIT code was created based much on the Bayesian Inference and Simulated Annealing routines implemented in the Datafurnace code [1]. In this presentation, the IBIXFIT is used to fit a microcalorimeter spectrum of a Ba{sub x}Sr{sub (1-x)}TiO{sub 3} thin film sample and the specific possibility of selecting between fixed and free line ratios combined with other specificities of the IBIXFIT algorithm are shown to be essential to overcome the problems faced.

74 ATOMIC AND MOLECULAR PHYSICS↗

Estimating luminosities and stellar masses of galaxies photometrically without determining redshifts

Large direct imaging surveys usually use a template-fitting technique to estimate photometric redshifts for galaxies, which are then applied to derive important galaxy properties such as luminosities and stellar masses. These estimates can be noisy and suffer from systematic biases because of the possible mis-selection of templates and the propagation of the photometric redshift uncertainty. We introduce an algorithm, the Direct Empirical Photometric method (DEmP), that can be used to directly estimate these quantities using training sets, bypassing photometric redshift determination. DEmP also applies two techniques to minimize the effects arising from the non-uniform distribution of training set galaxy redshifts from a flux-limited sample. First, for each input galaxy, fitting is performed using a subset of the training set galaxies with photometry and colors closest to those of the input galaxy. Second, the training set is artificially resampled to produce a flat distribution in redshift or other properties, e.g., luminosity. To test the performance of DEmP, we use a four filter-band mock catalog to examine its ability to recover redshift, luminosity, stellar mass, and luminosity and stellar mass functions. We also compare the results to those from two publicly available template-fitting methods, finding that the DEmP algorithm outperforms both. We find that resampling the training set to have a uniform redshift distribution produces the best results not only in photometric redshift, but also in estimating luminosity and stellar mass. The DEmP method is especially powerful in estimating quantities such as near-IR luminosities and stellar mass using only data from a small number of optical bands.

79 ASTRONOMY AND ASTROPHYSICS↗

The Convolutional Visual Network for Identification and Reconstruction of NOvA Events

In 2016 the NOvA experiment released results for the observation of oscillations in the vμ and ve channels as well as ve cross section measurements using neutrinos from Fermilab’s NuMI beam. These and other measurements in progress rely on the accurate identification and reconstruction of the neutrino flavor and energy recorded by our detectors. This presentation describes the first application of convolutional neural network technology for event identification and reconstruction in particle detectors like NOvA. The Convolutional Visual Network (CVN) Algorithm was developed for identification, categorization, and reconstruction of NOvA events. It increased the selection efficiency of the ve appearance signal by 40% and studies show potential impact to the vμ disappearance analysis.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Optimization of tomographic reconstruction workflows on geographically distributed resources

New technological advancements in synchrotron light sources enable data acquisitions at unprecedented levels. This emergent trend affects not only the size of the generated data but also the need for larger computational resources. Although beamline scientists and users have access to local computational resources, these are typically limited and can result in extended execution times. Applications that are based on iterative processing as in tomographic reconstruction methods require high-performance compute clusters for timely analysis of data. Here, time-sensitive analysis and processing of Advanced Photon Source data on geographically distributed resources are focused on. Two main challenges are considered: (i) modeling of the performance of tomographic reconstruction workflows and (ii) transparent execution of these workflows on distributed resources. For the former, three main stages are considered: (i) data transfer between storage and computational resources, (i) wait/queue time of reconstruction jobs at compute resources, and (iii) computation of reconstruction tasks. These performance models allow evaluation and estimation of the execution time of any given iterative tomographic reconstruction workflow that runs on geographically distributed resources. For the latter challenge, a workflow management system is built, which can automate the execution of workflows and minimize the user interaction with the underlying infrastructure. The system utilizes Globus to perform secure and efficient data transfer operations. The proposed models and the workflow management system are evaluated by using three high-performance computing and two storage resources, all of which are geographically distributed. Workflows were created with different computational requirements using two compute-intensive tomographic reconstruction algorithms. Experimental evaluation shows that the proposed models and system can be used for selecting the optimum resources, which in turn can provide up to 3.13× speedup (on experimented resources). Furthermore, the error rates of the models range between 2.1 and 23.3% (considering workflow execution times), where the accuracy of the model estimations increases with higher computational demands in reconstruction tasks.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

RE-INTEGRATE EMT Simulation Software: Graph Convolutional Network for Sparse Matrix Pattern Detection

The increasing complexity of power networks, driven by proliferation of inverters, presents analytical challenges that simplified models often fail to capture, necessitating Electromagnetic Transient (EMT) simulations. EMT models are represented as discretized differential-algebraic equations (DAEs), forming a linear system Ax = b that is computationally intensive to solve. Due to inherent sparsity of adjacency matrix A, distinct patterns emerge that, when accurately identified, enable efficient solver selection to minimize computation time. However, identifying ideal pattern is complicated by numerous reordering algorithms and limited structural insights. To address this, we introduce a Graph Convolutional Network (GCN) model for classifying sparse matrix patterns common in power system analysis. The model, achieving 96% test accuracy, is validated using PV plant models of 125 MW capacities connected to New England 39-bus transmission system (TS), and further scaled to a 4,992-bus network with 384 PV plants, yielding 191, 616 × 191, 616 sized A matrix. For all cases, the GCN model accurately identifies the matrix’s intrinsic sparse pattern, demonstrating its potential to enhance solver performance in EMT analysis.

Hossain, Md Rifat [Florida International Universit↗

Event Detection and Classification Using Machine Learning Applied to PMU Data for the Western US Power System

Smart grid technology enhances our comprehension and reliability of the power grid, leveraging Phasor Measurement Unit (PMU) data—time-synchronized, high-frequency measurements gathered across the US power grid. This paper employs machine learning techniques to effectively analyze the vast PMU data in Wide Area Monitoring Systems (WAMS) for power grid event detection and classification. Analyzing several months of real-world PMU data, the paper focuses on machine learning for fast, precise event detection and classification, corroborated by utility event logs. Practical challenges like feature extraction, dimensionality reduction, and model selection are addressed. A novel feature yielding improved results is discovered, and a supplementary algorithm for detecting small power grid faults is developed. The final algorithm is validated using a month-long real PMU data set, demonstrating its capability in accurately identifying power grid events in near real-time.

machine learning, event detection, PMU↗

Verification of MOOSE/Bison's Heat Conduction Solver Using Combined Spatiotemporal Convergence Analysis

Bison is a computational physics code that uses the finite element method to model the thermo-mechanical response of nuclear fuel. Since Bison is used to inform high-consequence decisions, it is important that its computational results are reliable and predictive. One important step in assessing the reliability and predictive capabilities of a simulation tool is the verification process, which quantifies numerical errors in a discrete solution relative to the exact solution of the mathematical model. One step in the verification process—called code verification—ensures that the implemented numerical algorithm is a faithful representation of the underlying mathematical model, including partial differential or integral equations, initial and boundary conditions, and auxiliary relationships. In this paper, the code verification process is applied to spatiotemporal heat conduction problems in Bison. Simultaneous refinement of the discretization in space and time is employed to reveal any potential mistakes in the numerical algorithms for the interactions between the spatial and temporal components of the solution. For each verification problem, the correct spatial and temporal order of accuracy is demonstrated for both first- and second-order accurate finite elements and a variety of time-integration schemes. Furthermore, these results provide strong evidence that the Bison numerical algorithm for solving spatiotemporal problems reliably represents the underlying mathematical model in MOOSE. The selected test problems can also be used in other simulation tools that numerically solve for conduction or diffusion.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

SU-F-19A-01: APBI Brachytherapy Treatment Planning: The Impact of Heterogeneous Dose Calculations

Purpose: To quantify the difference in dose to PTV-EVAL and OARs (skin and rib) as calculated by (TG43) and heterogeneous calculations (CCC). Methods: 25 patient plans (5 Contura and 20 SAVI) were selected for analysis. Clinical dose distributions were computed with a commercially available treatment planning algorithm (TG43-D-(w,w)) and then recomputed with a pre-clinical collapsed cone convolution algorithm (CCCD-( m,m)). PTV-EVAL coverage (V90%, V95%), and rib and skin maximum dose were compared via percent difference. Differences in dose to normal tissue (V150cc, V200cc of PTV-EVAL) were also compared. Changes in coverage and maximum dose to organs at risk are reported in percent change, (100*(TG43 − CCC) / TG43)), and changes in maximum dose to normal tissue are absolute change in cc (TG43 − CCC). Results: Mean differences in V90, V95, V150, and V200 for the SAVI cases were −0.2%, −0.4%, −0.03cc, and −0.14cc, respectively, with maximum differences of −0.78%, −1.7%, 1.28cc, and 1.01cc, respectively. Mean differences in the 0.1cc dose to the rib and skin were −1.4% and −0.22%, respectively, with maximum differences of −4.5% and 16%, respectively. Mean differences in V90, V95, V150, and V200 for the Contura cases were −1.2%, −2.1%, −1.8cc, and −0.59cc, respectively, with maximum differences of −2.0%, −3.16%, −2.9cc, and −0.76cc, respectively. Mean differences in the 0.1cc dose to the rib and skin were −2.6% and −3.9%, respectively, with maximum differences of −3.2% and −5.7%, respectively. Conclusion: The effects of translating clinical knowledge based on D-(w,w) to plans reported in D-(m,m) are minimal (2% or less) on average, but vary based on the type and placement of the device, source, and heterogeneity information.

60 APPLIED LIFE SCIENCES↗

Generate Optimized Genetic Rhythm for Enzyme Expression in Non-native systems

Most amino acids are represented by more than one codon, resulting in redundancy in the genetic code. Silent codon substitutions that do not alter the amino acid sequence still have an effect on protein expression. We have developed an algorithm, GoGREEN, to enhance the expression of foreign proteins in a host organism. GoGREEN selects codons according to frequency patterns seen in the gene of interest using the codon usage table from the host organism. GoGREEN is also designed to accommodate gaps in the sequence.This software takes for input (1) the aligned protein sequences for genes the user wishes to express, (2) the codon usage table for the host organism, (3) and the DNA sequence for the target protein found in the host organism. The program will select codons based on codon usage patterns for the target DNA sequence. The program will also select codons for “gaps” found in the aligned protein sequences using the codon usage table from the host organism.

Source record↗

Tusqh

SAND2025-00675O Tusqh is a software tool that generates cubical meshes in 2D and 3D and computes the homology of these meshes using persistent homology. It includes a grid cell in the output if its volume-fraction is above a selectable threshold, estimated by sampling points within the cell. Tusqh incorporates anti-aliasing algorithms to mitigate grid orientation and scale effects. It is designed for creating finite element meshes for simulations and can be used in various applications such as heat diffusion, mechanical simulations, and computer graphics rendering. The software outputs meshes in an open format compatible with downstream software. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

SciDAC↗

The Art of War: Beyond Memory-one Strategies in Population Games

We show that the history of play in a population game contains exploitable information that can be successfully used by sophisticated strategies to defeat memory-one opponents, including zero determinant strategies. The history allows a player to label opponents by their strategies, enabling a player to determine the population distribution and to act differentially based on the opponent’s strategy in each pairwise interaction. For the Prisoner’s Dilemma, these advantages lead to the natural formation of cooperative coalitions among similarly behaving players and eventually to unilateral defection against opposing player types. We show analytically and empirically that optimal play in population games depends strongly on the population distribution. For example, the optimal strategy for a minority player type against a resident TFT population is ALLC, while for a majority player type the optimal strategy versus TFT players is ALLD. Such behaviors are not accessible to memory-one strategies. Drawing inspiration from Sun Tzu’s the Art of War, we implemented a non-memory-one strategy for population games based on techniques from machine learning and statistical inference that can exploit the history of play in this manner. Via simulation we find that this strategy is essentially uninvadable and can successfully invade (significantly more likely than a neutral mutant) essentially all known memory-one strategies for the Prisoner’s Dilemma, including ALLC (always cooperate), ALLD (always defect), tit-for-tat (TFT), winstay-lose-shift (WSLS), and zero determinant (ZD) strategies, including extortionate and generous strategies.

60 APPLIED LIFE SCIENCES↗

Multi‐Scale Model‐Informed Deep Learning for Plasma‐Nanoparticle Interaction

The Overarching Goal of this proposed research is to understand and quantitively determine the interactions between non-thermal plasma (hot electrons, reactive radicals, vibrationally excited species) and surface reactions on influencing the activity and selectivity of the desired reactions via developing multi-scale model informed deep learning algorithm. Investigating non-thermal plasma-surface interaction is feasible due to the low bulk temperature in the discharge region. To investigate the role of plasma-nanoparticle interaction on enhancing the reaction kinetics, we will focus on ammonia cracking to generate clean hydrogen over earth-abundant, non-critical metallic nanoparticles, which is of great significance for decarbonization. We hypothesize that (1) reactive radicals interacting with surface reaction species via Eley–Rideal mechanism will significantly lower the energetics of the potential rate-limiting step of nitrogen formation; (2) the surface will be charged heterogeneously under non-thermal plasma conditions and the charged site will lower the energetics of ammonia cracking through Langmuir– Hinshelwood mechanism; (3) vibrationally excited ammonia will further promote the initial N-H bond cleavage. To access the hypothesis, we will (1) reveal the surface charge effects on tunning the reaction energetics via interpretable, physics-informed deep learning accelerated density functional theory (DFT) calculations; (2) determine the reactive radicals interacting with surface reaction species on tuning the reaction energetics via DFT; (3) reveal the surface charge effects on tunning the reaction energetics via DFT and deep learning models, (4) quantify how vibrationally excited species, reactive radicals, and surface charging effects on enhancing the catalysis via developing DFT-based microkinetic modeling (MKM) and active learning. Deep and active learning of plasma-nanoparticle interactions effects on enhancing ammonia cracking to generate hydrogen represents a new paradigm for designing high performance plasma materials. The fundamental science of how plasma-nanoparticle interactions will change the plasma kinetics and will improve the energy efficiency for decarbonization and sustainability. The interpretable and physics-informed machine learning model will accelerate low temperature plasma chemistry and material discovery with physics rules and model interpretation.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Neutrino Physics with Deep Learning on NOvA

The NOvA experiment has made both νμ \nu_\mu disappearance and νe \nu_e appearance measurements in Fermilab's NuMI beam, and is working on cross section measurements using near detector data. At the core of NOvA's measurements is the use of deep learning algorithms for identification and reconstruction of the neutrino flavor and energy. These algorithms, used for the first time on NOvA in 2016, yielded large improvements in selection efficiency, and will be applied to our first anti-neutrino results to be released this year. Presented here is the extension of our deep learning efforts for identification of neutrino signal events, final state identification, single particle tagging, and reconstruction using instance segmentation techniques. We will describe the new implementations of modified Convolutional Neural Networks for anti-neutrino events, single particles and their performance for analysis final states selection, standard candle measurements, and reconstruction.

Psihas, Fernanda [Indiana U.]↗

Unsupervised Resource Allocation with Graph Neural Networks

We present an approach for maximizing a global utility function by learning how to allocate resources in an unsupervised way. We expect interactions between allocation targets to be important and therefore propose to learn the reward structure for near-optimal allocation policies with a GNN. By relaxing the resource constraint, we can employ gradient-based optimization in contrast to more standard evolutionary algorithms. Our algorithm is motivated by a problem in modern astronomy, where one needs to select-based on limited initial information-among $10^9$ galaxies those whose detailed measurement will lead to optimal inference of the composition of the universe. Our technique presents a way of flexibly learning an allocation strategy by only requiring forward simulators for the physics of interest and the measurement process. We anticipate that our technique will also find applications in a range of resource allocation problems.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Training reinforcement learning models via an adversarial evolutionary algorithm

When training for control problems, more episodes used in training usually leads to better generalizability, but more episodes also requires significantly more training time. There are a variety of approaches for selecting the way that training episodes are chosen, including fixed episodes, uniform sampling, and stochastic sampling, but they can all leave gaps in the training landscape. In this work, we describe an approach that leverages an adversarial evolutionary algorithm to identify the worst performing states for a given model. We then use information about these states in the next cycle of training; this process can be repeated until the desired level of model performance is met. We demonstrate this approach with the OpenAI Gym cart-pole problem. With this problem, we show that the adversarial evolutionary algorithm did not reduce the number of episodes required in training needed to attain model generalizability when compared with stochastic sampling, and actually performed slightly worse.

Coletti, Mark↗