Search NASA⌕ Search

SEARCH · Search NASA

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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Targeted evolution of pinning landscapes for large superconducting critical currents

The ability of type II superconductors to carry large amounts of current at high magnetic fields is a key requirement for future design innovations in high-field magnets for accelerators and compact fusion reactors, and largely depends on the vortex pinning landscape comprised of material defects. The complex interaction of vortices with defects that can be grown chemically, e.g., self-assembled nanoparticles and nanorods, or introduced by postsynthesis particle irradiation precludes a priori prediction of the critical current and can result in highly nontrivial effects on the critical current. Here, we borrow concepts from biological evolution to create a vortex pinning genome based on a genetic algorithm, naturally evolving the pinning landscape to accommodate vortex pinning and determine the best possible configuration of inclusions for two different scenarios: a natural evolution process initiating from a pristine system and one starting with preexisting defects to demonstrate the potential for a postprocessing approach to enhance critical currents. Furthermore, the presented approach is even more general and can be adapted to address various other targeted material optimization problems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Data-driven selection and spectral classification of white dwarf stars

The next generation of spectroscopic surveys is expected to provide spectra for hundreds of thousands of white dwarf (WD) candidates in the upcoming years. Currently, spectroscopic classification of white dwarfs is mostly done by visual inspection, requiring substantial amounts of expert attention. We propose a data-driven pipeline for fast, automatic selection, and spectroscopic classification of WD candidates, trained using spectroscopically confirmed objects with available Gaia astrometry, photometry, and Sloan Digital Sky Survey (SDSS) spectra with signal-to-noise ratios ≥9. The pipeline selects WD candidates with improved accuracy and completeness over existing algorithms, classifies their primary spectroscopic type with ≥ 90 % accuracy, and spectroscopically detects main sequence companions with similar performance. We apply our pipeline to the Gaia Data Release 3 cross-matched with the SDSS Data Release 17 (DR17), identifying 424 096 high-confidence WD candidates and providing the first catalogue of automated and quantifiable classification for 36 523 WD spectra. Both the catalogue and pipeline are made available online. Such a tool will prove particularly useful for the undergoing SDSS-V survey, allowing for rapid classification of thousands of spectra at every data release.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2019

Dark Energy Surveyed Year 1 results: calibration of cluster mis-centring in the redMaPPer catalogues

Abstract The centre determination of a galaxy cluster from an optical cluster finding algorithm can be offset from theoretical prescriptions or N-body definitions of its host halo centre. These offsets impact the recovered cluster statistics, affecting both richness measurements and the weak lensing shear profile around the clusters. This paper models the centring performance of the redMaPPer cluster finding algorithm using archival X-ray observations of redMaPPer-selected clusters. Assuming the X-ray emission peaks as the fiducial halo centres, and through analysing their offsets to the redMaPPer centres, we find that ${\sim } 75\pm 8 {{\ \rm per\ cent}}$ of the redMaPPer clusters are well centred and the mis-centred offset follows a Gamma distribution in normalized, projected distance. These mis-centring offsets cause a systematic underestimation of cluster richness relative to the well-centred clusters, for which we propose a descriptive model. Our results enable the DES Y1 cluster cosmology analysis by characterizing the necessary corrections to both the weak lensing and richness abundance functions of the DES Y1 redMaPPer cluster catalogue.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2018

Methods and systems for generating a continuous helical tool path for parts having multiple central axes

A computer-implemented method for generating a continuous helical tool path for forming a part having a plurality of central axes is provided. The method includes performing a tool path algorithm modeling and a tool path algorithm execution using a computer system. The tool path algorithm modeling includes defining a starting point location within a computer-generated three-dimensional part geometry model, defining a vector, defining a helix, defining a sweeping surface three-dimensional geometry element, and generating an intersection curve from tracing a continuous curved line of an intersection between the sweeping surface geometry element and the part geometry model. The tool path algorithm execution includes defining data for a forming tool stylus, selecting the intersection curve as a guiding element for the forming tool stylus, and generating the continuous helical tool path for the forming tool stylus. The continuous helical tool path includes a forming tool stylus centerline path in graphical space.

42 ENGINEERING↗
DOE OSTI2022

Deploying a Model Predictive Traffic Signal Control Algorithm - A Field Deployment Experiment Case Study: Preprint

This paper presents a field deployment experiment of a real-time traffic signal control algorithm. We implemented the Model Predictive Control (MPC) algorithm based on Virtual Phase-Link (VPL) model. We selected the deployment locations and times based on an energy saving potential concept. We developed a set of experiment systems to enable the deployment including sensing, processing, and actuating components. We tested the systems rigorously before the experiment days. We reported the key procedures on the experiment days including the steps took, real-time control procedure, and the monitoring of the experiment. We evaluated the impact of the deployment with the changes in delay and energy consumption.

deployment↗
DOE OSTI2021

Optimal dimensionality selection for independent component analysis of transcriptomic data

Independent component analysis is an unsupervised machine learning algorithm that separates a set of mixed signals into a set of statistically independent source signals. Applied to high-quality gene expression datasets, independent component analysis effectively reveals both the source signals of the transcriptome as co-regulated gene sets, and the activity levels of the underlying regulators across diverse experimental conditions. Two major variables that affect the final gene sets are the diversity of the expression profiles contained in the underlying data, and the user-defined number of independent components, or dimensionality, to compute. Availability of high-quality transcriptomic datasets has grown exponentially as high-throughput technologies have advanced; however, optimal dimensionality selection remains an open question. We computed independent components across a range of dimensionalities for four gene expression datasets with varying dimensions (both in terms of number of genes and number of samples). We computed the correlation between independent components across different dimensionalities to understand how the overall structure evolves as the number of user-defined components increases. We then measured how well the resulting gene clusters reflected known regulatory mechanisms, and developed a set of metrics to assess the accuracy of the decomposition at a given dimension. We found that over-decomposition results in many independent components dominated by a single gene, whereas under-decomposition results in independent components that poorly capture the known regulatory structure. From these results, we developed a new method, called OptICA, for finding the optimal dimensionality that controls for both over- and under-decomposition. Specifically, OptICA selects the highest dimension that produces a low number of components that are dominated by a single gene. We show that OptICA outperforms two previously proposed methods for selecting the number of independent components across four transcriptomic databases of varying sizes. OptICA avoids both over-decomposition and under-decomposition of transcriptomic datasets resulting in the best representation of the organism’s underlying transcriptional regulatory network.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Harnessing Condorcet Methods to Improve Decision-making Based on Ranked Data

Decision-makers must often choose between multiple alternatives based on their relative merits across a variety of criteria. These multiple-criteria decision-making (MCDM) problems must be approached in an objective, measurable, and transparent fashion to obtain well-supported outcomes. The challenge of using sets of ranked data to identify the optimal choice is not unlike the challenge of using ranked ballots to identify the winner of an election in a preference voting system. As such, the methods of rank aggregation used in elections can be applied to help resolve MCDM problems. Previous research into the design of elections and ballots has yielded many algorithms with well-understood properties. A subset of these, called Condorcet methods, reliably identify the “Condorcet winner,” if it exists, giving the result that would defeat any other in a pairwise comparison. That, in addition to several other desirable qualities, makes Condorcet methods like the Schulze method, Ranked Pairs, and Copeland’s method, effective and scalable means for tackling MCDM problems. These rank aggregation methods have been implemented in JavaScript functions for incorporation into a web-based MCDM decision tool. These algorithms can be applied in a wide variety of contexts (for example, determining the “best” environmental remediation method or selecting a subcontractor) to facilitate effective decision-making. The performance of the JavaScript Condorcet prototype tool was compared across the implemented algorithms and with both a non-Condorcet rank aggregation method as well as an implementation of the Simple Multi-Attribute Rating Technique (SMART) algorithm.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2018

Dynamic Optimization of Switched-Reluctance Motors

A design algorithm is proposed for switched-reluctance motors used in manufacturing systems. The algorithm includes an optimization procedure and is based on the Monte Carlo method. In optimization of the magnetic system, it is advisable to take account of the motor’s operating conditions. The results of optimization are compared. Recommendations are made regarding the selection of the tooth-zone dimensions.

42 ENGINEERING↗
DOE OSTI2025

GRAPH — an readout ASIC for large MCP based detectors

We present a programmable 16 channel, mixed signal, low power readout ASIC, having the project historically named Gigasample Recorder of Analog waveforms from a PHotodetector (GRAPH). It is designed to read large aperture single photon imaging detectors using micro channel plates for charge multiplication, and measuring the detector's response on crossed strips anodes to extrapolate the incoming photon position. Each channel consists of a fast, low power and low noise charge sensitive amplifier, which provides a myriad of coarse and fine programmable options for gain and shaping settings. Further, the amplified signal is recorded using, to our knowledge novel, the Hybrid Universal sampLing Architecture (HULA) ADC. A kind of mixed signal double buffer memory, that enables concurrent waveform recording, and selected event digitized data extraction. The sampling frequency is freely adjustable between few kHz up to 125 MHz, while the chip's internal digital memory holds a history 2048 samples for each channel, with a digital headroom of 12 bits. An optimized region of interest sample-read algorithm allows to extract the information just around the event pulse peak, while selecting the next event, thus substantially reducing the operational dead time. The chip is designed in 130 nm TSMC CMOS technology, and its power consumption is around 47 mW per channel.

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

Adversarial methods to reduce simulation bias in neutrino interaction event filtering at liquid argon time projection chambers

For current and future neutrino oscillation experiments using large liquid argon time projection chambers (LAr-TPCs), a key challenge is identifying neutrino interactions from the pervading cosmic-ray background. Rejection of such background is often possible using traditional cut-based selections, but this typically requires the prior use of computationally expensive reconstruction algorithms. This work demonstrates an alternative approach of using a 3D submanifold sparse convolutional network trained on low-level information from the scintillation light signal of interactions inside LAr-TPCs. This technique is applied to example simulations from ICARUS, the far detector of the short baseline neutrino program at Fermilab. The results of the network, show that cosmic background is reduced by up to 76.3% whilst neutrino interaction selection efficiency remains over 98.9%. We further present a way to mitigate potential biases from imperfect input simulations by applying domain adversarial neural networks (DANNs), for which modified simulated samples are introduced to imitate real data and a small portion of them are used for adversarial training. A series of mock-data studies are performed and demonstrate the effectiveness of using DANNs to mitigate biases, showing neutrino interaction selection efficiency performances significantly better than that achieved without the adversarial training.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Integrated System for Methane Emissions Monitoring, Mapping, and Quantification

This report presents the work completed under the DOE iM4 project for the development of a methane emission monitoring system for detection, location, and quantification of methane in oil and gas industries. The task was divided into four main areas including: 1) Sensors and Input, 2) Centralized Cloud Information Center, 3) Algorithms, and 4) Testing and Validation. Task 1 focused on researching and developing an understanding of the current, or soon to be, available methane sensing technologies. Task 2 consisted of developing the architecture, selecting hardware, software and elements for the methane monitoring system. Task 3 focused on the algorithms used for the complex inverse model of going from measured methane signatures to the detection, localization, and quantification of sources that are desired. Finally, Task 4 focused on the methods of testing and validating the operation of the system. Attention was also given to the development method and cost breakdown of the system.

03 NATURAL GAS↗
DOE OSTI2020

A crisis for the verification and validation of turbulence simulations

Three algorithms have been proposed for solution of the Rayleigh–Taylor turbulent mixing problem. They are based upon three different physical principles governing the Euler equations for fluid flow. The principles serve to select the physically relevant solution from among many nonunique solutions. The admissibility principle is in dispute. The three different algorithms, expressing the three physical admissibility principles can be formulated in terms of the three energy dissipation rates or the entropy production rates, as selected by the size of the sub grid scale coefficients. These have maximal values or less than maximal values. The resulting solutions are markedly different. We find strong validation evidence that supports the maximum rate principle, based on a review of prior results and on new results presented here. We review experimental data used for validation and sufficient to discriminate among the three. We present a new analysis of this data. We show that the hypothesized long wave length perturbations in the initial conditions are not significant, so that validation can be based on this data in a straight forward manner. One of the algorithms is labeled direct numerical simulation, but is not, and as a consequence, the two algorithms with less than maximal SGS coefficients are variants of one another. Finally recommendations for the numerical modeling of the deflagration to detonation transition in type Ia supernova are discussed.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2019

Quantitative Parameter Estimation, Model Selection, and Variable Selection in Battery Science

Numerical physics-based models are useful in understanding battery performance and devel- oping optimal battery design architectures. Data science developments have enabled software algorithms to perform data analysis and decision making that traditionally could only be per- formed by technical experts. Traditional workflows of model development - manual parameter estimation through visual comparison of simulations to experimental observations, and model discrimination through expert intuition - are time-consuming, and difficult to justify. This paper compares the conclusions derived from computationally scalable algorithms to conclu- sions developed by expert researchers. This paper illustrates how data science techniques, such as cross-validation and lasso regression, can be used to augment physics-based simulations to perform data analysis such as parameter estimation, model selection, variable selection, and model-guided design of experiment. The validation of these algorithms is that they produce results similar to those of the expert modeler. The algorithms outlined are well-established and the approaches are general, so can be applied to a variety of battery chemistries and architectures. The conclusions reached using these approaches are in agreement with expert analysis (literature results), were reached with minimal human intervention, and provide quantitative justification. By minimizing the amount of expert time, and providing rigorous quantitative justifications, these methods may accelerate battery development.

25 ENERGY STORAGE↗
DOE OSTI2021

Mutual information-assisted adaptive variational quantum eigensolver

Adaptive construction of ansatz circuits offers a promising route towards applicable variational quantum eigensolvers on near-term quantum hardware. Those algorithms aim to build up optimal circuits for a certain problem and ansatz circuits are adaptively constructed by selecting and adding entanglers from a predefined pool. In this work, we propose a way to construct entangler pools with reduced size by leveraging classical algorithms. Our method uses mutual information between the qubits in classically approximated ground state to rank and screen the entanglers. The density matrix renormalization group method is employed for classical precomputation in this work. We corroborate our method numerically on small molecules. Our numerical experiments show that a reduced entangler pool with a small portion of the original entangler pool can achieve same numerical accuracy. Here, we believe that our method paves a new way for adaptive construction of ansatz circuits for variational quantum algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Efficient Application of the Factorized form of the Unitary Coupled-Cluster Ansatz for the Variational Quantum Eigensolver Algorithm by Using Linear Combination of Unitaries

The variational quantum eigensolver is one of the most promising algorithms for near-term quantum computers. It has the potential to solve quantum chemistry problems involving strongly correlated electrons with relatively low-depth circuits, which are otherwise difficult to solve on classical computers. The variational eigenstate is constructed from a number of factorized unitary coupled-cluster terms applied onto an initial (single-reference) state. Current algorithms for applying one of these operators to a quantum state require a number of operations that scale exponentially with the rank of the operator. We exploit a hidden SU(2) symmetry to allow us to employ the linear combination of unitaries approach, Our Prepare subroutine uses n+2 ancilla qubits for a rank-n operator. Our Select (U) scheme uses O(n) Cnot gates. This results in a full algorithm that scales like the cube of the rank of the operator n 3 , a significant reduction in complexity for rank five or higher operators. This approach, when combined with other algorithms for lower-rank operators (when compared to the standard implementation), will make the factorized form of the unitary coupled-cluster approach much more efficient to implement on all types of quantum computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Photoinduced Dynamics with Constrained Vibrational Motion: FrozeNM Algorithm

Ab initio molecular dynamics (AIMD) simulation, analyzed in terms of vibrational normal modes, is a widely used technique that facilitates understanding of complex structural motions and coupling between electronic and nuclear degrees of freedom. Usually, only a subset of vibrations is directly involved in the process of interest. The impact of these vibrations can be evaluated by performing AIMD simulations by selectively freezing certain motions. In this paper, we present frozen normal mode (FrozeNM), a new algorithm to apply normal-mode constraints in AIMD simulations, as implemented in the nonadiabatic excited state molecular dynamics code. We further illustrate its capacity by analyzing the impact of normal-mode constraints on the photoinduced energy transfer between polyphenylene ethynylene dendrimer building blocks. Our results show that the electronic relaxation can be significantly slowed down by freezing a well-selected small subset of active normal modes characterized by their contributions in the direction of energy transfer. The application of these constraints reduces the nonadiabatic coupling between electronic excited states during the entire dynamical simulations. Furthermore, we validate reduced dimensionality models by freezing all the vibrations, except a few active modes. Altogether, we consider FrozeNM as a useful tool that can be broadly used to underpin the role of vibrational motion in a studied process and to formulate reduced models that describe essential physical phenomena.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2019

Optimizing wind farm siting to reduce power system impacts of wind variability

We introduce and solve two variants of a biobjective optimization model to reduce the negative impact of wind variability on the power system by strategically locating wind farms. The first model variant considers average changes in wind power over time; the second captures extreme fluctuations in wind power. A complementary set of wind sites is selected with the aim of minimizing both residual demand and the variability in residual demand. Because exact optimization is computationally intensive, we develop two heuristics—forward and backward greedy algorithms—to find approximate solutions. The results are compared with the exact optimization results for a well-selected subset of the data as well as to the results from selecting sites based on average wind alone. The two models are solved using demand data and potential wind sites for the Southwest Power Pool. Though both objectives can be improved by adding more sites, for a fixed number of sites, minimizing residual demand and variability in residual demand are competing objectives. Here, we find an approximate efficient frontier to compare trade-offs between the two objectives. We also vary the parameter in the heuristic that controls how the two objectives are prioritized. For the case study, the backward greedy algorithm is more effective at reducing the wind power variability than the forward greedy algorithm. Furthermore, using the backward algorithm for the full dataset is more effective than solving the exact optimization on a subset of the data when the results are evaluated using the full dataset.

17 WIND ENERGY↗
DOE OSTI2024

Robust and Simple ADMM Penalty Parameter Selection

We present a new method for online selection of the penalty parameter for the alternating direction method of multipliers (ADMM) algorithm. ADMM is a widely used method for solving a range of optimization problems, including those that arise in signal and image processing. In its standard form, ADMM includes a scalar hyperparameter, known as the penalty parameter, which usually has to be tuned to achieve satisfactory empirical convergence. In this work, we develop a framework for analyzing the ADMM algorithm applied to a quadratic problem as an affine fixed point iteration. Using this framework, we develop a new method for automatically tuning the penalty parameter by detecting when it has become too large or small. We analyze this and several other methods with respect to their theoretical properties, i.e., robustness to problem transformations, and empirical performance on several optimization problems. Our proposed algorithm is based on a theoretical framework with clear, explicit assumptions and approximations, is theoretically covariant/invariant to problem transformations, is simple to implement, and exhibits competitive empirical performance.

42 ENGINEERING↗