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 307 records · Page 17

Using active learning to improve quasar identification for the DESI spectra processing pipeline

The Dark Energy Spectroscopic Instrument (DESI) survey uses an automatic spectral classification pipeline to classify spectra. QuasarNET is a convolutional neural network used as part of this pipeline originally trained using data from the Baryon Oscillation Spectroscopic Survey (BOSS). In this paper we implement an active learning algorithm to optimally select spectra to use for training a new version of the QuasarNET weights file using only DESI data, with the goal of improving classification accuracy. This active learning algorithm includes a novel outlier rejection step using a Self-Organizing Map to ensure we label spectra representative of the larger quasar sample observed in DESI. We perform two iterations of the active learning pipeline, assembling a final dataset of 5600 labeled spectra, a small subset of the approximately 1.3 million quasar targets in DESI's Data Release 1. When splitting the spectra into training and validation subsets we achieve similar performance to the previously trained weights file in completeness and purity calculated on the validation dataset but do so with less than one tenth of the amount of training data. The new weights also more consistently classify objects in the same way when used on unlabeled data compared to the old weights file. In the process of improving QuasarNET's classification accuracy we discovered a systemic error in QuasarNET's redshift estimation and used our findings to improve our understanding of QuasarNET's redshifts.

Machine learning↗

High-Throughput Discovery Illuminates Design Principles and Limits for Long-Lived Charged Species in Organic Electrolytes

The chemical stability of charged molecules in all-organic redox flow batteries (RFBs) is required for the prolonged operation of these devices. Molecular engineering and electrolyte optimization are used to mitigate parasitic reactions and extend the lifetimes of the charge carriers. However, how much can structural variation extend the lifetime? To probe this query, we designed a high-throughput kinetic study of the radical cation of N-methylphenothiazinium, guided by statistical sampling and learning algorithms. Using Argonne’s autonomous discovery facility, we conducted over 6,000 kinetic experiments with robotic sample preparation, parallel kinetic measurements, and machine learning inputs, testing 188 solvent molecules selected from a space of over 540 candidates from 11 chemical classes. Algorithmic selections guided us to stable solvent candidates, which were further tested in high concentration with and without supporting electrolyte. Our findings reveal the inherent difficulty of exceeding the current state of the art through solvent variation. The desired stability is statistically rare and poorly predictable. Among the many tested, only three solvents significantly outperformed our baseline, acetonitrile─and none by more than a factor of 3─suggesting a general challenge in achieving the necessary techno-economic targets. Furthermore, we suggest that self-discharge through solvent homolysis is the cause of the observed limitations. Several structural motifs contribute to >1,000 h half-life stability including molecular simplicity, symmetry, oxidation complement, and strategic fluorination. Importantly, this workflow establishes effective assays for diagnosing and predicting oxidative stress for highly stable liquid electrolytes in all batteries.

Batteries↗

Component-wise reduced-order model design optimization such as for lattice design optimization

Systems and methods for optimizing a lattice structure design are disclosed herein. In some embodiments, a method for optimizing a lattice structure design can include (i) modeling the lattice structure with a component-wise reduced-order model (CWROM) and (ii) optimizing the CWROM based on a selected criterion using a topology optimization algorithm for lattice design. The selected criterion can include a boundary condition and a load applied to the lattice structure. By modeling the lattice structure as a CWROM, the optimization process can be very fast while still permitting the accurate computation of physical quantities of the lattice structure.

Choi, Youngsoo↗

Surrogate-Based Autotuning for Randomized Sketching Algorithms in Regression Problems

Algorithms from Randomized Numerical Linear Algebra (RandNLA) are known to be effective in handling high-dimensional computational problems, providing high-quality empirical performance as well as strong probabilistic guarantees. However, their practical application is complicated by the fact that the user needs to set various algorithm-specific tuning parameters which are different from those used in traditional NLA. This paper demonstrates how a surrogate-based autotuning approach can be used to address fundamental problems of parameter selection in RandNLA algorithms. In particular, we provide a detailed investigation of surrogate-based autotuning for sketch-and-precondition (SAP)-based randomized least squares methods, which have been one of the great success stories in modern RandNLA. Empirical results show that our surrogate-based autotuning approach can achieve near-optimal performance with much less tuning cost than a random search (up to about 7.6x fewer trials of different parameter configurations). Moreover, while our experiments focus on least squares, our results demonstrate a general-purpose autotuning pipeline applicable to any kind of RandNLA algorithm.

Cho, Younghyun↗

SU-E-T-497: Semi-Automated in Vivo Radiochromic Film Dosimetry Using a Novel Image Processing Algorithm

Purpose: To validate an automated image processing algorithm designed to detect the center of radiochromic film used for in vivo film dosimetry against the current gold standard of manual selection. Methods: An image processing algorithm was developed to automatically select the region of interest (ROI) in *.tiff images that contain multiple pieces of radiochromic film (0.5x1.3cm{sup 2}). After a user has linked a calibration file to the processing algorithm and selected a *.tiff file for processing, an ROI is automatically detected for all films by a combination of thresholding and erosion, which removes edges and any additional markings for orientation. Calibration is applied to the mean pixel values from the ROIs and a *.tiff image is output displaying the original image with an overlay of the ROIs and the measured doses. Validation of the algorithm was determined by comparing in vivo dose determined using the current gold standard (manually drawn ROIs) versus automated ROIs for n=420 scanned films. Bland-Altman analysis, paired t-test, and linear regression were performed to demonstrate agreement between the processes. Results: The measured doses ranged from 0.2-886.6cGy. Bland-Altman analysis of the two techniques (automatic minus manual) revealed a bias of -0.28cGy and a 95% confidence interval of (5.5cGy,-6.1cGy). These values demonstrate excellent agreement between the two techniques. Paired t-test results showed no statistical differences between the two techniques, p=0.98. Linear regression with a forced zero intercept demonstrated that Automatic=0.997*Manual, with a Pearson correlation coefficient of 0.999. The minimal differences between the two techniques may be explained by the fact that the hand drawn ROIs were not identical to the automatically selected ones. The average processing time was 6.7seconds in Matlab on an IntelCore2Duo processor. Conclusion: An automated image processing algorithm has been developed and validated, which will help minimize user interaction and processing time of radiochromic film used for in vivo dosimetry.

60 APPLIED LIFE SCIENCES↗

Comparing Sensor Fusion and Multimodal Chemometric Models for Monitoring U(VI) in Complex Environments Representative of Irradiated Nuclear Fuel

Optical sensors and chemometric models were leveraged for the quantification of uranium(VI) (0–100 μg mL –1 ), europium (0–150 μg mL –1 ), samarium (0–250 μg mL –1 ), praseodymium (0–350 μg mL –1 ), neodymium (0–1000 μg mL –1 ), and HNO 3 (2–4 M) with varying corrosion product (iron, nickel, and chromium) levels using laser fluorescence, Raman scattering, and ultraviolet–visible–near-infrared absorption spectra. In this paper, an efficient approach to developing and evaluating tens of thousands of partial least-squares regression (PLSR) models, built from fused optical spectra or multimodal acquisitions, is discussed. Each PLSR model was optimized with unique preprocessing combinations, and features were selected using genetic algorithm filters. The 7-factor D-optimal design training set contained just 55 samples to minimize the number of samples. The performance of PLSR models was evaluated by using an automated latent variable selection script. PLS1 regression models tailored to each species outperformed a global PLS2 model. PLS1 models built using fused spectra data and a multimodal (i.e., analyzed separately) approach yielded similar information, resulting in percent root-mean-square error of prediction values of 0.9–5.7% for the seven factors. Further, the optical techniques and data processing strategies established in this study allow for the direct analysis of numerous species without measuring luminescence lifetimes or relying on a standard addition approach, making it optimal for near-real-time, in situ measurements. Nuclear reactor modeling helped bound training set conditions and identified elemental ratios of lanthanide fission products to characterize the burnup of irradiated nuclear fuel. Leveraging fluorescence, spectrophotometry, experimental design, and chemometrics can enable the remote quantification and characterization of complex systems with numerous species, monitor system performance, help identify the source of materials, and enable rapid high-throughput experiments in a variety of industrial processes and fundamental studies.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

A case study evaluating the portability of an executable computable phenotype algorithm across multiple institutions and electronic health record environments

Abstract Electronic health record (EHR) algorithms for defining patient cohorts are commonly shared as free-text descriptions that require human intervention both to interpret and implement. We developed the Phenotype Execution and Modeling Architecture (PhEMA, http://projectphema.org) to author and execute standardized computable phenotype algorithms. With PhEMA, we converted an algorithm for benign prostatic hyperplasia, developed for the electronic Medical Records and Genomics network (eMERGE), into a standards-based computable format. Eight sites (7 within eMERGE) received the computable algorithm, and 6 successfully executed it against local data warehouses and/or i2b2 instances. Blinded random chart review of cases selected by the computable algorithm shows PPV ≥90%, and 3 out of 5 sites had >90% overlap of selected cases when comparing the computable algorithm to their original eMERGE implementation. This case study demonstrates potential use of PhEMA computable representations to automate phenotyping across different EHR systems, but also highlights some ongoing challenges.

Pacheco, Jennifer A.↗

Influence of pseudopotentials on excitation energies from selected configuration interaction and diffusion Monte Carlo

Due to their diverse nature, the faithful description of excited states within electronic structure theory methods remains one of the grand challenges of modern theoretical chemistry. Quantum Monte Carlo (QMC) methods have been applied very successfully to ground state properties but still remain generally less effective than other non-stochastic methods for electronically excited states. Nonetheless, we have recently reported accurate excitation energies for small organic molecules at the fixed-node diffusion Monte Carlo (FN-DMC) within a Jastrow-free QMC protocol relying on a deterministic and systematic construction of nodal surfaces using the selected configuration interaction (sCI) algorithm known as CIPSI (Configuration Interaction using a Perturbative Selection made Iteratively). Albeit highly accurate, these all-electron calculations are computationally expensive due to the presence of core electrons. One very popular approach to remove these chemically-inert electrons from the QMC simulation is to introduce pseudopotentials (also known as effective core potentials). Taking the water molecule as an example, we investigate the influence of Burkatzki-Filippi-Dolg (BFD) pseudopotentials and their associated basis sets on vertical excitation energies obtained with sCI and FN-DMC methods. Although these pseudopotentials are known to be relatively safe for ground state properties, we evidence that special care may be required if one strives for highly accurate vertical transition energies. Indeed, comparing all-electron and valence-only calculations, we show that using pseudopotentials with the associated basis sets can induce differences of the order of 0.05 eV on the excitation energies. Fortunately, a reasonable estimate of this shift can be estimated at the sCI level.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Scalable PDC Placement Technique for Fast and Resilient Monitoring of Large Power Grids

The wide-area measurement system (WAMS) is a key enabler of real-time monitoring of power grids. The essential goals of WAMS design are fast and resilient data transfer from phasor measurement units (PMU) to phasor data concentrators (PDC). We propose a scalable two-stage PDC placement technique for minimizing the end-to-end delay while maintaining resiliency. In the prescreening stage, the plausible candidates of PDC configurations are identified based on a graph theory-based multi-median function (MMF). Here, in this article, a computationally efficient meta-heuristic algorithm is used to address scalability. In the candidate selection stage, two different algorithms, namely, Suurballe's and Dijkstra's, are employed to identify the best of those plausible PDC configurations as the final design. This technique not only minimizes the hop paths between PMUs and PDCs, but also ensures network resiliency against single PMU, PDC, or communication link failure by incorporating the roles of PMUs in power grid observability into routing policy. Simulation results on the IEEE 57-bus test power system and the 2000-bus test power system demonstrate the effectiveness and scalability of the proposed technique.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Selecting Minimal Motion Primitive Libraries with Genetic Algorithms

Motion primitives allow for application of discrete search algorithms to rapidly produce trajectories in complex continuous space. The maneuver automaton (MA) provides an elegant formulation for creating a primitive library based on trims and maneuvers. However, performance is fundamentally limited by the contents of the primitive library. If the library is too sparse, performance can be poor in terms of path cost, whereas a library that is too large can increase run time. This work outlines new methods for using genetic algorithms to prune a primitive library. The proposed methods balance the path cost and planning time while maintaining the reachability of the MA. The genetic algorithm in this paper evaluates and mutates populations of motion primitive libraries to optimize both objectives. Here, we illustrate the performance of these methods with a simulated study using a nonlinear medium-fidelity F-16 model. We optimize a library with the presented algorithm for obstacle-free navigation and a nap-of-the-Earth navigation task. In the obstacle-free navigation task, we show a tradeoff of a 10.16% higher planning cost for a 96.63% improvement in run time. In the nap-of-the-Earth task, we show a tradeoff of a 9.712% higher planning cost for a 92.06% improvement in run time.

42 ENGINEERING↗

Cholesky-based experimental design for Gaussian process and kernel-based emulation and calibration.

Gaussian processes and other kernel-based methods are used extensively to construct approximations of multivariate data sets. The accuracy of these approximations is dependent on the data used. This paper presents a computationally efficient algorithm to greedily select training samples that minimize the weighted L p error of kernel-based approximations for a given number of data. The method successively generates nested samples, with the goal of minimizing the error in high probability regions of densities specified by users. The algorithm presented is extremely simple and can be implemented using existing pivoted Cholesky factorization methods. Training samples are generated in batches which allows training data to be evaluated (labeled) in parallel. For smooth kernels, the algorithm performs comparably with the greedy integrated variance design but has significantly lower complexity. Numerical experiments demonstrate the efficacy of the approach for bounded, unbounded, multi-modal and non-tensor product densities. We also show how to use the proposed algorithm to efficiently generate surrogates for inferring unknown model parameters from data using Bayesian inference.

97 MATHEMATICS AND COMPUTING↗

Enhancing Cluster Identification in Atom Probe Tomography Data Using Transfer Learning

Atom Probe Tomography (APT) is a powerful technique for visualizing the atomic-scale distribution of solutes in materials, but quantitative cluster analysis of APT datasets remains a challenge due to the need for subjective parameter selection in clustering algorithms. While distance-based and density-based methods such as HDBSCAN are widely used, their performance is highly sensitive to user-defined parameters, which undermines reproducibility and accuracy. This study proposes an image-based, deep learning-aided workflow for automating parameter selection and cluster detection in APT data analysis. By projecting 3D APT point clouds onto 2D planes, we leverage pretrained convolutional neural networks (ConvNeXt-Tiny and ResNet-50) through transfer learning to predict the number of clusters present in synthetic datasets. The output is used to guide K-means clustering and estimate HDBSCAN parameters, specifically minimum cluster size and minimum sample points. This approach reduces reliance on manual parameter tuning, improving consistency and scalability. The methodology demonstrates the feasibility of using image-based deep learning for interpreting complex spatial patterns in APT data, enabling faster and more objective analysis. The complete workflow and code are made publicly available to support reproducibility and future research.

Density-based clustering↗

Optimal band selection for target detection with a LWIR multispectral imager

Multispectral imaging can offer many benefits in cost, complexity, resolution, size, weight, and power, relative to hyperspectral imaging. When designing a multispectral system, spectral bandpasses can be selected using optimization algorithms configured to maximally separate target detection scores between target and background regions. A hyperspectral image (HSI) can serve as the source of data from which band groupings can be tested for optimality. The output of an adaptive cosine estimator target detection algorithm is used in an objective function. Three optimization algorithms are compared: particle swarm, dual annealing, and differential evolution. A global optimum is also found using a brute force approach on the Livermore Computing Syrah supercomputer. Three materials are investigated: calcite, gypsum, and limestone. This is done for 3-, 4-, and 5-band systems. The data originate from a longwave infrared HSI of a material display board. The optimization algorithms were run 30 times for every scenario. Performance statistics (maximum, minimum, mean, standard deviation, and median) based on the separation values are given. Additional characterization was performed using receiver operator characteristic (ROC) curves and the area under the ROC curve. While good performance was obtained for the three optimization algorithms, the dual annealing algorithm produced the highest and most consistent detection separation scores on average.

47 OTHER INSTRUMENTATION↗

Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions

Here we propose a manifold sampling algorithm for minimizing a nonsmooth composition $f= h\circ F$, where we assume $h$ is nonsmooth and may be inexpensively computed in closed form and $F$ is smooth but its Jacobian may not be available. We additionally assume that the composition $h\circ F$ defines a continuous selection. Manifold sampling algorithms can be classified as model-based derivative-free methods, in that models of $F$ are combined with particularly sampled information about $h$ to yield local models for use within a trust-region framework. We demonstrate that cluster points of the sequence of iterates generated by the manifold sampling algorithm are Clarke stationary. We consider the tractability of three particular subproblems generated by the manifold sampling algorithm and the extent to which inexact solutions to these subproblems may be tolerated. Numerical results demonstrate that manifold sampling as a derivative-free algorithm is competitive with state-of-the-art algorithms for nonsmooth optimization that utilize first-order information about $f$.

97 MATHEMATICS AND COMPUTING↗

SU-F-T-352: Development of a Knowledge Based Automatic Lung IMRT Planning Algorithm with Non-Coplanar Beams

Purpose: To improve the robustness of a knowledge based automatic lung IMRT planning method and to further validate the reliability of this algorithm by utilizing for the planning of clinical cases with non-coplanar beams. Methods: A lung IMRT planning method which automatically determines both plan optimization objectives and beam configurations with non-coplanar beams has been reported previously. A beam efficiency index map is constructed to guide beam angle selection in this algorithm. This index takes into account both the dose contributions from individual beams and the combined effect of multiple beams which is represented by a beam separation score. We studied the effect of this beam separation score on plan quality and determined the optimal weight for this score.14 clinical plans were re-planned with the knowledge-based algorithm. Significant dosimetric metrics for the PTV and OARs in the automatic plans are compared with those in the clinical plans by the two-sample t-test. In addition, a composite dosimetric quality index was defined to obtain the relationship between the plan quality and the beam separation score. Results: On average, we observed more than 15% reduction on conformity index and homogeneity index for PTV and V{sub 40}, V{sub 60} for heart while an 8% and 3% increase on V{sub 5}, V{sub 20} for lungs, respectively. The variation curve of the composite index as a function of angle spread score shows that 0.6 is the best value for the weight of the beam separation score. Conclusion: Optimal value for beam angle spread score in automatic lung IMRT planning is obtained. With this value, model can result in statistically the “best” achievable plans. This method can potentially improve the quality and planning efficiency for IMRT plans with no-coplanar angles.

60 APPLIED LIFE SCIENCES↗

Hybrid feature selection approach for power transformer fault diagnosis based on support vector machine and genetic algorithm

To further improve fault diagnosis accuracy, a new hybrid feature selection approach combined with a genetic algorithm (GA) and support vector machine (SVM) is presented in this study. Adaptive synthetic technique and arctangent transformation method are adopted to improve the statistical property of the training set (IEC TC10 dataset). Five filter methods based on different evaluation metrics are employed to rank 48 input features derived from dissolved gas analysis (DGA). Then, feature combination methods are applied to aggregate feature ranks and form a lower-dimension candidate feature subset. The GA-SVM model is implemented to optimise parameters and select optimal feature subsets. 5-fold cross-validation accuracy of the GA-SVM is used to evaluate fault diagnosis capability of feature subsets and finally, a novel subset is determined as the optimal feature subset. Accuracy comparison manifests the superiority of the optimal feature subsets over that of conventional approaches. Besides, generalisation and robustness of the optimal subset are validated by testing DGA samples from the local power utility. Results indicate that the optimal feature subset obtained by the proposed method can significantly improve the accuracies of power transformer fault diagnosis.

Kari, Tusongjiang↗

Performance Improvements Through Advanced PV Backtracking on Uneven Terrain

The climatic sensitivity of new terrain-aware backtracking algorithms is evaluated across 800 locations in the continental USA on a representative synthetic rolling terrain. We find that a global optimization approach to backtracking results in climate-specific annual energy gains of 2.4%–3.2% relative to a traditional backtracking algorithm baseline. We identify a strong logarithmic correlation between local diffuse fraction and yield improvement, and highlight the effect of seasonal precipitation on performance gains. We also find that a backtracking approach, which approximates the terrain as constant, does not offer significant annual energy gains over the baseline on the synthetic terrain. Our findings suggest that specific yield from backtracking in the USA can be improved by as much as 88 kWh/kW by considering terrain when selecting a backtracking algorithm.

Backtracking↗

Graphical Optimization of Spectral Shift Reconstructions for Optical Backscatter Reflectometry

Optical backscatter reflectometry (OBR) is an interferometric technique that can be used to measure local changes in temperature and mechanical strain based on spectral analyses of backscattered light from a singlemode optical fiber. The technique uses Fourier analyses to resolve spectra resulting from reflections occurring over a discrete region along the fiber. These spectra are cross-correlated with reference spectra to calculate the relative spectral shifts between measurements. The maximum of the cross-correlated spectra—termed quality—is a metric that quantifies the degree of correlation between the two measurements. Recently, this quality metric was incorporated into an adaptive algorithm to (1) selectively vary the reference measurement until the quality exceeds a predefined threshold and (2) calculate incremental spectral shifts that can be summed to determine the spectral shift relative to the initial reference. Using a graphical (network) framework, this effort demonstrated the optimal reconstruction of distributed OBR measurements for all sensing locations using a maximum spanning tree (MST). By allowing the reference to vary as a function of both time and sensing location, the MST and other adaptive algorithms could resolve spectral shifts at some locations, even if others can no longer be resolved.

47 OTHER INSTRUMENTATION↗