Search NASA⌕ Search

SEARCH · Search NASA

Results for “Selection optimization”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

A Novel Secondary Frequency Regulation with Optimal Priority Selection of AGC Contributions

Automatic generation control (AGC) is used to maintain acceptable frequencies during operation owing to fluctuations in load and variable resources. In conventional industry applications, the AGC signal is allocated to each generator according to the predispatched frequency regulation capacity or the order of economic efficiency. However, with the increasing integration of inverter-based resources (IBRs), the retirement of conventional synchronous generators (SGs) has posed new challenges to frequency control schemes because fewer of them are optional for AGC regulation. In this paper, we propose a novel model predictive control (MPC)-based frequency regulation model to reduce control cost and ensure stability, by considering different critical dynamic factors when optimally selecting the AGC units. The proposed control model – developed in a general form – comprehensively embeds characteristics such as generator ramping rates, reserve capacity, and operation cost. The model predictive control–based two-timescale AGC scheme enhances the capability of immunizing the power disturbance from types of resources by coordinating the control signals between faster IBRs and slower SGs. The case study’s proposed model is verified to be effective in synergistically enforcing different dynamic properties of AGC units into the frequency regulation scheme.

Jiang, Sufan [The University of North Carolina at ↗
NASA NTRS2011

Optimal Tuner Selection for Kalman-Filter-Based Aircraft Engine Performance Estimation

An emerging approach in the field of aircraft engine controls and system health management is the inclusion of real-time, onboard models for the inflight estimation of engine performance variations. This technology, typically based on Kalman-filter concepts, enables the estimation of unmeasured engine performance parameters that can be directly utilized by controls, prognostics, and health-management applications. A challenge that complicates this practice is the fact that an aircraft engine s performance is affected by its level of degradation, generally described in terms of unmeasurable health parameters such as efficiencies and flow capacities related to each major engine module. Through Kalman-filter-based estimation techniques, the level of engine performance degradation can be estimated, given that there are at least as many sensors as health parameters to be estimated. However, in an aircraft engine, the number of sensors available is typically less than the number of health parameters, presenting an under-determined estimation problem. A common approach to address this shortcoming is to estimate a subset of the health parameters, referred to as model tuning parameters. The problem/objective is to optimally select the model tuning parameters to minimize Kalman-filterbased estimation error. A tuner selection technique has been developed that specifically addresses the under-determined estimation problem, where there are more unknown parameters than available sensor measurements. A systematic approach is applied to produce a model tuning parameter vector of appropriate dimension to enable estimation by a Kalman filter, while minimizing the estimation error in the parameters of interest. Tuning parameter selection is performed using a multi-variable iterative search routine that seeks to minimize the theoretical mean-squared estimation error of the Kalman filter. This approach can significantly reduce the error in onboard aircraft engine parameter estimation applications such as model-based diagnostic, controls, and life usage calculations. The advantage of the innovation is the significant reduction in estimation errors that it can provide relative to the conventional approach of selecting a subset of health parameters to serve as the model tuning parameter vector. Because this technique needs only to be performed during the system design process, it places no additional computation burden on the onboard Kalman filter implementation. The technique has been developed for aircraft engine onboard estimation applications, as this application typically presents an under-determined estimation problem. However, this generic technique could be applied to other industries using gas turbine engine technology.

Simon, Donald L.↗
DOE OSTI2021

Gradient-Informed Design Optimization of Select Nuclear Systems

In this work, we present a gradient-informed design optimization of nuclear reactor core components based on neutronics objectives with both continuous and discrete materials. The main argument in favor of using gradient-informed design optimization is that it scales well with increasing dimensionality of the design space. First, a challenge problem with 121 free parameters is solved with a gradient-informed method and then with a genetic algorithm. Then, a challenge problem to optimize the flux profile of a simplified assembly with eight axial zones is solved. Both challenge problems are solved using directly calculated derivatives from Tools for Sensitivity and Uncertainty Analysis Methodology Implementation (TSUNAMI) in the SCALE package. Furthermore, we demonstrate how a discrete optimization problem—selection of materials for 121 voxels—can be lifted into a continuous problem with mixed materials. In the continuous space, adjoint-based gradients are well-defined, and gradient descent is applicable. Then, a forcing function is introduced that with the selection of an appropriately sized hyperparameter can be used to guide the optimized continuous solution back into a discrete solution. This paper presents an account of the challenges that were faced when applying a gradient-informed optimization algorithm using a Monte Carlo calculation to estimate the gradient information and compares a gradient descent optimization method to a genetic algorithm optimization of the same geometry. Overall, this work demonstrates the potential use of adjoint-based gradient calculations in design optimization of nuclear systems.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2026

Toward memory-efficient melt pool monitoring: a classification framework using event-based imaging and sparse sensing technique

Vision sensors like CMOS and CCD cameras are often used for in-process monitoring of melt pools in laser-based additive and welding processes, but they require transferring large amounts of data and computational processing resources. Event-based neuromorphic imagery, on the other hand, detects only the change in pixel intensity, thus potentially reducing the data amount and latency. With an event imager, this study develops a framework for melt pool condition classification, including image construction, time scale selection, optimal pixel selection, and sparse classification, to achieve a highly memory-efficient scheme. These are based on sparse sensing techniques with singular value decomposition (SVD) and QR pivoting, the two fundamental matrix transformations for linear dimensionality reduction. The framework is then validated by classifying a controlled experiment by exciting various mode shapes of liquid gallium pools of varying depths (3, 6, and 8 mm). At 200 pixels, the classifier can reach overall accuracy of 75%, while at 2000 pixels (0.013% of the total possible pixels), the accuracy is nearly 90% (89.86%). At the same number of pixels, random selection can only achieve 46% and 67%, respectively. The memory savings of the sparsely sampled event data compared to a conventional imager is about 500 times. In addition to performance, implementation and limitations of the framework are also discussed.

42 ENGINEERING↗
DOE OSTI2020

Effect of frequency detuning on Brillouin lasing in microcavities

We have theoretically investigated Brillouin lasing in microcavities in the case when the Brillouin shift and the intermode spacing of the microcavity do not coincide. It is shown that, despite the rise of the lasing threshold, a significant increase in the Brillouin signal intensity can be achieved in this case compared to the resonance one. A necessary condition for this effect is to select an optimal value of detuning of the pump radiation frequency from the frequency of the corresponding microcavity mode. The result of increasing the lasing threshold is also a narrowing of the Brillouin signal lasing range in the nonresonant case, which leads to a decrease in the signal noise level provided the detuning value is optimally selected. Analytical calculations are confirmed by the results of numerical modelling. (paper)

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2017

Target tracking via recursive Bayesian state estimation in radar networks

Modern cognitive radar networks incorporating intelligent and cognitive support-modules can actively adjust the radar-target geometry and optimally select a subset of radars to track the target of interest. Based on the theories of dynamic graphical models (DGM) and recursive Bayesian state estimation (RBSE), we propose a framework for single target tracking in mobile and cooperative radar networks, jointly considering path planning and radar selection. We formulate the tracking procedure as two iterative steps: (i) solving a combinatorial problem based on the expected cross-entropy measure to select the optimal subset of radars and their locations, and (ii) tracking the target using RBSE technique. We simulate the proposed framework using an illustrative example in 2-D space and demonstrate the tracking performance.

Xiang, Yijian↗
DOE OSTI2025

Extending Shared Socioeconomic Pathways to Future Water Supply In-frastructure Scenarios: A Case Study of San Antonio, TX

Datasets supporting findings and visualization behind Okoye and McManamay (2025) Extending Shared Socioeconomic Pathways to Future Water Supply Infrastructure Scenarios: A Case Study of San Antonio, TX. Environmental Research Communications, DOI: 10.57931/2563186 These datasets contains the results of a site selection analysis for municipal water supply planning across multiple Shared Socioeconomic Pathways (SSPs 1–5) and hard scenario classification of water systems in San Antonio, TX. It includes data at the resolution of individual surface water supply sources (COMIDs) and integrates a wide range of hydrologic, socioeconomic, infrastructural, and scenario-based planning variables. Please refer to the README file provided in Files for more details. Descriptions of the datasets are provided below. Dataset(s) Descriptions: Dataset_SSP1_SSP4.xlsx - Contains data used for site selection optimization under SSP1 to SSP4. This dataset was generated based on multi-indicator computations (e.g., WAI, WQI, ERI, WTC, WIC), scenario demand projections, and resource and spatial constraints, excluding new reservoir values. Dataset_SSP5.xlsx - Used for site optimization under SSP5. Unlike Dataset_SSP1_SSP4, this dataset includes new reservoir features with updated calculations of WAI, WTC, and WIC to reflect the added infrastructure and supply potential. hard_classification.xlsx - Provides the scenario classification output for each site. Includes both the initial scenario classification based on Euclidean Distance and adjusted classifications based on 30% change reduction BAU.zip - Zipped folder of .shp files showing spatially optimized water supply sites per SSP under the Business-As-Usual (BAU) water demand strategy LowGW.zip - Zipped folder of .shp files showing optimized site selections under the Low Groundwater strategy

geospatial↗
DOE OSTI2023

An automated and portable method for selecting an optimal GPU frequency

Power consumption poses a significant challenge in current and emerging graphics processing unit (GPU) enabled high-performance computing systems. In modern GPUs, dynamic voltage frequency scaling (DVFS) appears to be a reliable control to regulate power consumption and performance. However, the DVFS design space is large - hence, brute-force approaches are infeasible to select the optimal frequency. Furthermore, no single frequency can be universally optimal for applications with varying computational intensities. Thus, the application's complexity and the availability of a wide range of frequency settings are a challenge in selecting the optimal frequency configuration for a given GPU workload. To that end, this paper proposes a systematic approach that consists of three steps. The feature characterization study identifies the fine-grain GPU utilization metrics that influence the power consumption and execution time of a given workload. To understand the performance, power, and energy consumption behaviors of a workload across GPU's DVFS design space, we derived analytical power and performance models using the identified fine-grain features. Here, it is shown that the same set of GPU utilization metrics can estimate both the power consumption and execution time while being agnostic of changes to frequency and input sizes. Applying a power control with the single objective of reducing power may cause performance degradation, leading to more energy consumption. A multi-objective approach is proposed to select the optimal GPU DVFS configuration for a workload that reduces power consumption with negligible degradation in performance. The evaluation was conducted using SPEC ACCEL benchmarks and three real applications - NAMD LAMMPS, and LSTM on NVIDIA GV100, GA100, and AMD MI210 GPUs. On average, real applications showed 29.6% energy savings with a performance loss of 5.2% on GA100 and 22.6% energy savings with a performance loss of 4.7% on GV100. Moreover, the proposed models are portable to real applications, GPU architectures, and vendors, and require metric collection at only the default frequency rather than all supported DVFS configurations. Additionally, we conducted a comparison between our models and the GPU assembly instructions (PTX)-based static models. The results revealed a significant reduction in the average error rates, with a decrease from 19.7% to 3.1% for power models and from 29.4% to 5.2% for performance models.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1993

Optimal material selection using branch and bound techniques

A methodology for structural synthesis is presented in which the optimal material selection for the structural members is treated in terms of (0,1) variables. Structural member sizes and material selection variables are treated simultaneously as design variables. Optimization is carried out by generating and solving a sequence of explicit approximate problems using a branch and bound strategy. Intermediate design variables and intermediate response quantities are used to enhance the quality of the approximate design problems. Numerical results for example problems are presented to illustrate the efficiency of the design procedure set forth.

Sepulveda, A. E.↗
DOE OSTI2021

Efficient Sampling Allocation Procedures for Optimal Quantile Selection

We propose a dynamic sampling allocation and selection paradigm for finding the alternative with the optimal quantile in a Bayesian framework. Myopic allocation policies (MAPs), analogous to existing methods in classic ranking and selection for selecting the alternative with the optimal mean, and computationally efficient selection policies are derived for selecting the alternative with the optimal quantile. Under certain conditions, we prove that the proposed MAPs and selection procedures are consistent, which means that the best quantile would be eventually correctly selected as the sample size goes to infinity. Numerical experiments demonstrate that the proposed schemes can significantly improve the performance.

Computer Science↗
NASA NTRS1994

In Vitro Selection of Optimal DNA Substrates for Ligation by a Water-Soluble Carbodiimide

We have used in vitro selection to investigate the sequence requirements for efficient template-directed ligation of oligonucleotides at 0 deg C using a water-soluble carbodiimide as condensing agent. We find that only 2 bp at each side of the ligation junction are needed. We also studied chemical ligation of substrate ensembles that we have previously selected as optimal by RNA ligase or by DNA ligase. As anticipated, we find that substrates selected with DNA ligase ligate efficiently with a chemical ligating agent, and vice versa. Substrates selected using RNA ligase are not ligated by the chemical condensing agent and vice versa. The implications of these results for prebiotic chemistry are discussed.

Harada, Kazuo↗
DOE OSTI2018

Optimizing event selection with the random grid search

In this paper, the random grid search (RGS) is a simple, but efficient, stochastic algorithm to find optimal cuts that was developed in the context of the search for the top quark at Fermilab in the mid-1990s. The algorithm, and associated code, have been enhanced recently with the introduction of two new cut types, one of which has been successfully used in searches for supersymmetry at the Large Hadron Collider. The RGS optimization algorithm is described along with the recent developments, which are illustrated with two examples from particle physics. One explores the optimization of the selection of vector boson fusion events in the four-lepton decay mode of the Higgs boson and the other optimizes SUSY searches using boosted objects and the razor variables.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2019

Comprehensive Evaluation and Application of GIS Insulation Condition Part 1: Selection and Optimization of Insulation Condition Comprehensive Evaluation Index Based on Multi-Source Information Fusion

How to select and optimize the evaluation indicators from many characteristic information to characterize the internal insulation condition of GIS equipment, and establish a scientific technical and economic evaluation model of insulation condition is a huge challenge needs to be addressed urgently. Motived by this purpose, this study simulates the deterioration process of four typical insulation defects in GIS to obtain the information of UHF, ultrasound, and SF 6 decomposition components excited by different degradation stages of each insulating defect simultaneously. Moreover, the operating environment conditions, running time, overhaul times, and the residual value of equipment are taken into account. Using the improved minimum-redundancy-maximum-relevance (mRMR) criterion and genetic algorithm, a comprehensive evaluation index system including the 23 evaluation indicators in three categories is established, which covers the PD hazard, SF 6 insulation performance, equipment running time and environment, and residual value. The research lays a foundation for the later construction and application of multi-source information fusion evaluation model of GIS equipment insulation condition considering economic value.

42 ENGINEERING↗
DOE OSTI2021

ThickBrick: optimal event selection and categorization in high energy physics. Part I. Signal discovery

We provide a prescription called ThickBrick to train optimal machine-learning-based event selectors and categorizers that maximize the statistical significance of a potential signal excess in high energy physics (HEP) experiments, as quantified by any of six different performance measures. For analyses where the signal search is performed in the distribution of some event variables, our prescription ensures that only the information complementary to those event variables is used in event selection and categorization. This eliminates a major misalignment with the physics goals of the analysis (maximizing the significance of an excess) that exists in the training of typical ML-based event selectors and categorizers. In addition, this decorrelation of event selectors from the relevant event variables prevents the background distribution from becoming peaked in the signal region as a result of event selection, thereby ameliorating the challenges imposed on signal searches by systematic uncertainties. Our event selectors (categorizers) use the output of machine-learning-based classifiers as input and apply optimal selection cutoffs (categorization thresholds) that are functions of the event variables being analyzed, as opposed to flat cutoffs (thresholds). These optimal cutoffs and thresholds are learned iteratively, using a novel approach with connections to Lloyd’s k-means clustering algorithm. We provide a public, Python implementation of our prescription, also called ThickBrick, along with usage examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS2019

Target Optimal Aperture Selection

This document describes the computation of optimal pixels for planetary transit targets. The method we describe is based on that used in the End-to-End Model (ETEM), which simulates Kepler science output. An optimal aperture for a target is defined as the set of pixels which maximizes the signal-to-noise ratio (SNR) for that target. The optimal aperture for a target is determined by using catalog data to generate, for that target, a synthetic image with all background stars and signals and a second synthetic image with the target star's flux only. These images are incorporated into a noise model, from which the SNR of each pixel is computed. The pixels around a target are summed in an order that maximizes the SNR with each term. As dimmer and dimmer pixels contribute to this sum, the SNR reaches a maximum and further terms decrease the SNR. The set of pixels whose SNR sums to this maximum value defines the optimal aperture.

Bryson, Stephen↗
NASA NTRS2008

Efficient Simulation Budget Allocation for Selecting an Optimal Subset

We consider a class of the subset selection problem in ranking and selection. The objective is to identify the top m out of k designs based on simulated output. Traditional procedures are conservative and inefficient. Using the optimal computing budget allocation framework, we formulate the problem as that of maximizing the probability of correc tly selecting all of the top-m designs subject to a constraint on the total number of samples available. For an approximation of this corre ct selection probability, we derive an asymptotically optimal allocat ion and propose an easy-to-implement heuristic sequential allocation procedure. Numerical experiments indicate that the resulting allocatio ns are superior to other methods in the literature that we tested, and the relative efficiency increases for larger problems. In addition, preliminary numerical results indicate that the proposed new procedur e has the potential to enhance computational efficiency for simulation optimization.

Chen, Chun-Hung↗
DOE OSTI2018

An Analytic Framework for Optimal Milling Parameter Selection

The selection of optimal parameters is an important step in machining process definition. This paper presents a decision analytic framework for completing this task. The approach is demonstrated for titanium milling. An influence diagram showing the decision situation, the corresponding uncertainties, and the value is presented. The optimization objective is the selection of machining parameters that minimize cost while considering uncertainty in tool life and stability. The uncertainties are characterized using a probability distribution taking into account all available information. The cost associated with tool failure and unstable cutting conditions is incorporated in the cost formulation. A process probability tree showing the uncertainties and the corresponding costs is constructed. The optimization results show a 90% reduction in machining cost as compared to tool manufacturer-recommended parameters. The proposed framework is normative and robust and can be applied for optimizing process parameters in conventional (such as milling and turning) and non-conventional (such as electric discharge machining, electro-chemical machining) processes. A discussion section regarding inference, experimental design, and risk aversion is included.

Karandikar, Jaydeep↗