Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithm testing”

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 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

An Evolutionary Algorithm to Personalize Stool-Based Colorectal Cancer Screening

Fecal immunochemical testing (FIT) is an established method for colorectal cancer (CRC) screening. Measured FIT-concentrations are associated with both present and future risk of CRC, and may be used for personalized screening. However, evaluation of personalized screening is computationally challenging. In this study, a broadly applicable algorithm is presented to efficiently optimize personalized screening policies that prescribe screening intervals and FIT-cutoffs, based on age and FIT-history. We present a mathematical framework for personalized screening policies and a bi-objective evolutionary algorithm that identifies policies with minimal costs and maximal health benefits. The algorithm is combined with an established microsimulation model (MISCAN-Colon), to accurately estimate the costs and benefits of generated policies, without restrictive Markov assumptions. The performance of the algorithm is demonstrated in three experiments. In Experiment 1, a relatively small benchmark problem, the optimal policies were known. The algorithm approached the maximum feasible benefits with a relative difference of 0.007%. Experiment 2 optimized both intervals and cutoffs, Experiment 3 optimized cutoffs only. Optimal policies in both experiments are unknown. Compared to policies recently evaluated for the USPSTF, personalized screening increased health benefits up to 14 and 4.3%, for Experiments 2 and 3, respectively, without adding costs. Generated policies have several features concordant with current screening recommendations. The method presented in this paper is flexible and capable of optimizing personalized screening policies evaluated with computationally-intensive but established simulation models. It can be used to inform screening policies for CRC or other diseases. For CRC, more debate is needed on what features a policy needs to exhibit to make it suitable for implementation in practice.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2022

Using machine learning for particle track identification in the CLAS12 detector

Particle track reconstruction is the most computationally intensive process in nuclear physics experiments. Traditional algorithms use a combinatorial approach that exhaustively tests track measurements ("hits") to identify those that form an actual particle trajectory. In this article, we describe the development of four machine learning (ML) models that assist the tracking algorithm by identifying valid track candidates from the measurements in drift chambers. Several types of machine learning models were tested, including: Convolutional Neural Networks (CNN), Multi-Layer Perceptrons (MLP), Extremely Randomized Trees (ERT) and Recurrent Neural Networks (RNN). As a result of this work, an MLP network classifier was implemented as part of the CLAS12 reconstruction software to provide the tracking code with recommended track candidates. The resulting software achieved accuracy of greater than 99% and resulted in an end-to-end speedup of 35% compared to existing algorithms.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Evaluation of automated stability testing in machining through closed-loop control and Bayesian machine learning

Here, this paper describes a system for automated identification of the optimal stable cutting parameters in milling through Bayesian machine learning and closed-loop control. The closed-loop control system consists of a process monitoring architecture, an analysis framework, and a feedback mechanism. The analysis framework consists of a Bayesian machine learning algorithm that learns a stability map given test results. The learned stability map is used to select parameters for stability testing using an expected improvement in the material removal rate criterion. The test parameters are communicated to the machine controller to complete the test cut through a feedback mechanism. The test cuts were monitored using an audio signal; the stability of the test cut was determined by analyzing the frequency content of the audio signal. The test result was fed back to the Bayesian learning algorithm to complete the loop. Experimental results demonstrate that the system can identify the optimal stable parameters without information about the cutting force model or the structural dynamics. The system provides a low-cost method for optimal stable parameter identification in an industrial environment.

Chatter↗
DOE OSTI2021

An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods

A framework is proposed for solving general convex quadratic programs (CQPs) from an infeasible starting point by invoking an existing feasible-start algorithm tailored for inequality-constrained CQPs. The central tool is an exact penalty function scheme equipped with a penalty-parameter updating rule. The feasible-start algorithm merely has to satisfy certain general requirements, and so is the updating rule. Under mild assumptions, the framework is proved to converge on CQPs with both inequality and equality constraints and, at a negligible additional cost per iteration, produces an infeasibility certificate, together with a feasible point for an (approximately) ℓ 1 -least relaxed feasible problem, when the given problem does not have a feasible solution. The framework is applied to a feasible-start constraint-reduced interior-point algorithm previously proved to be highly performant on problems with many more inequality constraints than variables (“imbalanced”). Numerical comparison with popular codes (OSQP, qpOASES, MOSEK) is reported on both randomly generated problems and support-vector machine classifier training problems. The results show that the former typically outperforms the latter on imbalanced problems. Finally, application of the proposed infeasible-start framework to other feasible-start algorithms is briefly considered, and is tested on a simplex iteration.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Preliminary Enhanced LAW Glass Formulation Algorithm

This report summarizes the Preliminary Enhanced LAW Glass Formulation Algorithm, its background information, and the calculations it performs. The Preliminary Enhanced LAW Glass Formulation Algorithm is a tool that has been developed in MATLAB to formulate glass at a given a waste composition, while attempting to maximize waste loading. It is intended for use at the Hanford Waste Treatment and Immobilization Plant, where nuclear waste will be vitrified into glass for safe, long-term storage. The formulated glass is required to meet several processing and product quality constraints. In addition, calculations must account for associated uncertainties in constraint prediction and measurement. The algorithm also allows for the ability to hold glass compositions closer to tested regions in order to increase confidence in the output. The algorithm must also follow nuclear quality assurance procedures and submit to rigorous validation and verification testing.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2022

Verification and Validation of a Modified Numerical Algorithm for Simulation of Transient Unconfined Groundwater Flow

This report extends verification and validation testing of the NUFT package of codes (Nitao 2000a,b) to the US1P module of code designed for simulation of single-phase mixed or “coupled” saturated and unsaturated (or “variably saturated”) groundwater flow. Importantly, the verification and validation testing of US1P in this report includes performance evaluation of a modified numerical algorithm that was not included in prior quality assurance (QA) of the NUFT package by Carle et al. (2014) for Underground Test Area (UGTA) project activities, which are directed at assessment of radionuclide contamination in groundwater sourced from underground nuclear test locations at the Nevada National Security Site (NNSS). An immediate purpose of this report is to provide QA for ongoing large-scale, three-dimensional (3-D) groundwater flow modeling of transient water levels associated with longterm water supply pumping and underground nuclear testing at the NNSS (Jackson and Fenelon, 2018; Jackson et al., 2021). For UGTA activities, the QA refers to the standards of ASTM (1996) for verification and validation testing of groundwater modeling codes.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Using angular two-point correlations to self-calibrate the photometric redshift distributions of DECaLS DR9

Calibrating the redshift distributions of photometric galaxy samples is essential in weak lensing studies. The self-calibration method combines angular auto- and cross-correlations between galaxies in multiple photometric redshift (photo-z) bins to reconstruct the scattering rates matrix between redshift bins. In this paper, we test a recently proposed self-calibration algorithm using the DECaLS Data Release 9 and investigate to what extent the scattering rates are determined. We first mitigate the spurious angular correlations due to imaging systematics by a machine learning based method. We then improve the algorithm for χ 2 minimization and error estimation. Finally, we solve for the scattering matrices, carry out a series of consistency tests, and find reasonable agreements: (1) finer photo-z bins return a high-resolution scattering matrix, and it is broadly consistent with the low-resolution matrix from wider bins; (2) the scattering matrix from the Northern Galactic Cap is almost identical to that from Southern Galactic Cap; (3) the scattering matrices are in reasonable agreement with those constructed from the power spectrum and the weighted spectroscopic subsample. We also evaluate the impact of cosmic magnification. Although it changes little the diagonal elements of the scattering matrix, it affects the off-diagonals significantly. The scattering matrix also shows some dependence on scale cut of input correlations, which may be related to a known numerical degeneracy between certain scattering pairs. In conclusion, this work demonstrates the feasibility of the self-calibration method in real data and provides a practical alternative to calibrate the redshift distributions of photometric samples.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Validating Connected, Automated, and Electric Vehicle Models and Simulation - Research Performance Progress Report

The objective of this project is to test connected and automated vehicles with both electrified and internal combustion engine powertrains to support updates and validation of modeling and simulation tools. This includes the development of the components and network architecture to execute and collect empirical data for multiple scenarios and traffic interactions. Specific program objectives include: • Translate Lab algorithms into vehicle and infrastructure controls • Conduct physical testing at realistic scale • Evaluate system performance • Improve models using empirical data • Improve control algorithms from lessons learned • Identify system and algorithm assumptions which need refinement It is important to note that the objective of this project was not to demonstrate the efficacy of the selected algorithms to improve energy efficiency but rather to validate and improve modeling and simulation tools using empirical data. While it is a desirable outcome to concurrently demonstrate improved energy efficiency through use of these algorithms, and in most cases that was the outcome, the success of this project was not predicated on the performance of the algorithm towards improving energy efficiency across all scenarios and test matrices.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2021

Heuristic Dispatch Based on Price Signals for Behind-the-Meter PV-Battery Systems in the System Advisor Model

The economic potential of a behind-the-meter (BTM) PV-battery system depends greatly on how the battery is dispatched. Different utility rates, system sizes, generation and load profiles can all require different dispatch strategies. This paper presents price signals dispatch, a new algorithm for automated economic dispatch of BTM PV-battery systems, which utilizes 24-hour PV and load forecasts, degradation data, and utility rates. The algorithm is integrated with the System Advisor Model (SAM) tool and is tested with a nonlinear generic electrochemical battery model. Price signals dispatch outperforms SAM's existing algorithms in cases requiring a balance between demand charge management and energy arbitrage, and in cases where battery degradation imposes a significant cost.

batteries↗
DOE OSTI2020

Cycle-Consistent Adversarial Networks for Realistic Pervasive Change Generation in Remote Sensing Imagery

This paper introduces a new method of generating realistic pervasive changes in the context of evaluating the effectiveness of change detection algorithms in controlled settings. The method - a cycle-consistent adversarial network (CycleGAN) - requires low quantities of training data to generate realistic changes. Here we show an application of CycleGAN in creating realistic snow-covered scenes of multispectral Sentinel-2 imagery, and demonstrate how these images can be used as a test bed for anomalous change detection algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Least H 2 norm updating of quadratic interpolation models for derivative-free trust-region algorithms

One particular class of derivative-free optimization algorithms is trust-region algorithms based on quadratic models given by the under-determined interpolation. Different techniques in updating the quadratic model from iteration to iteration will give different interpolation models. We propose a new way to update the quadratic model by minimizing the $H^{2}$ norm of the difference between neighboring quadratic models. The motivation for applying the $H^{2}$ norm is given. The theoretical properties of our new updating technique are also presented. We propose the projection in the sense of $H^{2}$ norm and the interpolation error analysis of our model function. We obtain the coefficients of the quadratic model function using the Karush–Kuhn–Tucker (KKT) conditions. Numerical results show the advantages of our model on the test set considered, and the derivative-free algorithms based on our least $H^{2}$ norm updating quadratic model functions can solve test problems with fewer function evaluations than the algorithm based on the least Frobenius norm updating model and the other compared methods.

derivative-free optimization↗
DOE OSTI2025

Machine learning for photovoltaic single axis tracker fault detection and classification

More than 81% of the annual capacity of utility-scale photovoltaic (PV) power plants in the U.S. use single-axis trackers (SATs) due to SATs delivering 4% in capacity factor on average over fixed-array systems. However, SATs are subject to faults, such as software misconfigurations and mechanical failures, resulting in suboptimal tracking. If left undetected, the overall power yield of the PV power plant is reduced significantly. Minimizing downtime and ensuring efficient operation of SATs requires robust detection and diagnosis mechanisms for SAT faults. We present a machine learning framework for implementing real-time SAT fault detection and classification. Our implementation of the proposed framework reliably identifies measurements taken from a test PV system undergoing emulated SAT faults relative to state-of-the-art algorithms and produces nearly zero false positives on our testing days. Code and data are available at https://pvpmc.sandia.gov/tools.

Fault classification↗
DOE OSTI2025

ScaWL: Scaling k-WL (Weisfeiler-Lehman) Algorithms in Memory and Performance on Shared and Distributed-Memory Systems

The k-dimensional Weisfeiler-Lehman (k-WL) algorithm—developed as an efficient heuristic for testing if two graphs are isomorphic—is a fundamental kernel for node embedding in the emerging field of graph neural networks. Unfortunately, the k-WL algorithm has exponential storage requirements, limiting the size of graphs that can be handled. This work presents a novel k-WL scheme with a storage requirement orders of magnitude lower while maintaining the same accuracy as the original k-WL algorithm. Due to the reduced storage requirement, our scheme allows for processing much bigger graphs than previously possible on a single compute node. For even bigger graphs, we provide the first distributed-memory implementation. Our k-WL scheme also has significantly reduced communication volume and offers high scalability. Our experimental results demonstrate that our approach is significantly faster and has superior scalability compared to five other implementations employing state-of-the-art techniques.

algorithims↗
DOE OSTI2025

Pulse: An Outlier Sensitive Downsampling Algorithm For Timeseries Data

Pulse is a downsampling algorithm for timeseries data. Frequently datasets become so large that visualization tools and web browsers cannot effectively render graphics due to memory constraints. Downsampling algorithms are commonly applied to minimize the quantity of data required to visualize important features or trends in the data, but some datasets are composed by distinct enough features and trends that most existing downsampling algorithms fail to preserve them. Pule was developed to downsample timeseries data for galvanostatic stack test data at the Idaho National Laboratory. These datasets were composed by approximately 4 million records, most of them being extremely uniform. However, during relatively brief time periods when the stack test changes state, for example when the test article is powered on, or a load is added, the data produce sparse asymptotes. No existing downsampling algorithm was capable of preserving the sparse asymptotes in electrolysis stack test data. Instead, we develop a downsampling algorithm that preserves important outliers in data, and otherwise aggressively downsamples uniform data. The algorithm has applications in other domains like seismology, in the measurement of earthquakes, or astronomy, in the measurement of quasars or transit photometry.

Woodruff, Nathan [Idaho National Laboratory (INL),↗
DOE OSTI2020

Towards Robustness Guarantees for Feedback-Based Optimization

Feedback-based online optimization algorithms have gained traction in recent years because of their simple implementation, their ability to reject disturbances in real time, and their increased robustness to model mismatch. While the robustness properties have been observed both in simulation and experimental results, the theoretical analysis in the literature is mostly limited to nominal conditions. In this work, we propose a framework to systematically assess the robust stability of feedback-based online optimization algorithms. We leverage tools from monotone operator theory, variational inequalities and classical robust control to obtain tractable numerical tests that guarantee robust convergence properties of online algorithms in feedback with a physical system, even in the presence of disturbances and model uncertainty. The results are illustrated via an academic example and a case study of a power distribution system.

approximation algorithms↗
DOE OSTI2022

Physics makes the difference: Bayesian optimization and active learning via augmented Gaussian process

Abstract Both experimental and computational methods for the exploration of structure, functionality, and properties of materials often necessitate the search across broad parameter spaces to discover optimal experimental conditions and regions of interest in the image space or parameter space of computational models. The direct grid search of the parameter space tends to be extremely time-consuming, leading to the development of strategies balancing exploration of unknown parameter spaces and exploitation towards required performance metrics. However, classical Bayesian optimization (BO) strategies based on the Gaussian process (GP) do not readily allow for the incorporation of the known physical behaviors or past knowledge. Here we explore a hybrid optimization/exploration algorithm created by augmenting the standard GP with a structured probabilistic model of the expected system’s behavior. This approach balances the flexibility of the non-parametric GP approach with a rigid structure of physical knowledge encoded into the parametric model. The fully Bayesian treatment of the latter allows additional control over the optimization via the selection of priors for the model parameters. The method is demonstrated for a noisy version of a standard univariate test function used to evaluate optimization algorithms and further extended to physical lattice models. This methodology is expected to be universally suitable for injecting prior knowledge in the form of physical models and past data in the BO framework.

42 ENGINEERING↗
DOE OSTI2022

Development and Validation of Algorithms That Analyze Communicating Thermostat Data to Identify Enclosure Retrofit Opportunities

Annual energy savings of up to $\$ 4$ to $\$ 5$ billion could be achieved nationwide through basic insulation and heating system retrofits of existing homes. However, current utility energy efficiency programs are costly and challenging to scale. Customer acquisition occurs primarily through energy bill mailers, mass media, and online advertising that lack specificity about home-specific retrofit opportunities, expected energy savings, and cost-effectiveness. Specific retrofit opportunities are identified via on-site home energy assessments (HEAs) that are inconvenient to homeowners, expensive, and of variable accuracy. We developed computational algorithms that automatically analyze communicating thermostat (CT) heating data that could be used to increase the customer uptake of insulation and air sealing energy conservation measures (ECMs) by identifying homes with the most significant retrofit opportunities, estimating post-retrofit energy savings, and formulating home-specific outreach. The algorithms are based on an extended second-order grey-box model that characterizes a building’s thermal response using lumped elements, coupled with an empirical model of infiltration that accounts for both wind and stack effects. The basic parameters of the model correspond to actual physical parameters of the home, i.e., the home’s overall R-value of and the building envelope ACH50. Unlike the conventional approach, which estimates model parameters based on the best fit to the observed time-dependent room temperature, our approach derives correlations between the daily heating system runtime and temperature difference (indoor-outdoor) that are more robust to data quality issues in real-world applications. We also used HEA data for algorithm development and validation. With the help of our utility partners, Eversource and National Grid, we obtained data sets for hundreds of Massachusetts homes. For each home, these data sets included three sets of information anonymized by the utility: (1) CT data (HVAC runtime, room temperature, and, for some vendors, outdoor temperature and wind speed) collected by the CT vendor (one of three) over a heating season, (2) HEA report performed by the HEA vendor (same vendor for all homes), (3) Monthly utility gas bills coincident with the CT data (3 to 24 per home, depending on availability). For some homes, we also obtained blower-door test results. Initially, we applied the algorithms developed to homes with a single CT and then extended them to homes with two CTs by using an equivalent home approach. Finally, we developed algorithms for prediction of energy savings and a methodology of comparing our predictions with those generated by HEAs. The main technical results indicate that we can reliably identify homes with insulation and/or air sealing retrofit opportunities and provide accurate savings predictions. Our hypothesis is that the algorithms could be applied to utility energy efficiency programs to identify homes that could realize significant energy savings from insulation and/or air sealing retrofits. This information could then be used to reach out to those homes with highly customized outreach, thereby delivering increased program energy savings and cost-effectiveness. This would: Significantly increase the uptake rate of on-site HEAs, and Significantly increase the fraction of HEAs resulting in ECM implementation. To test these hypotheses, we designed and conducted a randomized controlled trial (RCT). The RCT results suggest that personal messaging leads to a two- to five-fold increase in the HEA uptake rate.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗