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 1,477 records · Page 82
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

A Selective Overview and Comparison of Robust Mixture Regression Estimators

Summary Mixture regression models have been widely used in business, marketing and social sciences to model mixed regression relationships arising from a clustered and thus heterogeneous population. The unknown mixture regression parameters are usually estimated by maximum likelihood estimators using the expectation–maximisation algorithm based on the normality assumption of component error density. However, it is well known that the normality‐based maximum likelihood estimation is very sensitive to outliers or heavy‐tailed error distributions. This paper aims to give a selective overview of the recently proposed robust mixture regression methods and compare their performance using simulation studies.

Yu, Chun↗
DOE OSTI2019

The Quantum Alternating Operator Ansatz on Maximum k -Vertex Cover

The Quantum Alternating Operator Ansatz is a generalization of the Quantum Approximate Optimization Algorithm (QAOA) designed for finding approximate solutions to combinatorial optimization problems with hard constraints. In this paper, we study Maximum k-Vertex Cover under this ansatz due to its modest complexity, while still being more complex than the well studied problems of Max-Cut and Max E3-LIN2. Our approach includes (i) a performance comparison between easy-to-prepare classical states and Dicke states as starting states, (ii) a performance comparison between two XY -Hamiltonian mixing operators: the ring mixer and the complete graph mixer, (iii) an analysis of the distribution of solutions via Monte Carlo sampling, and (iv) the exploration of efficient angle selection strategies.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2004

A Preliminary ZEUS Lightning Location Error Analysis Using a Modified Retrieval Theory

The ZEUS long-range VLF arrival time difference lightning detection network now covers both Europe and Africa, and there are plans for further expansion into the western hemisphere. In order to fully optimize and assess ZEUS lightning location retrieval errors and to determine the best placement of future receivers expected to be added to the network, a software package is being developed jointly between the NASA Marshall Space Flight Center (MSFC) and the University of Nevada Las Vegas (UNLV). The software package, called the ZEUS Error Analysis for Lightning (ZEAL), will be used to obtain global scale lightning location retrieval error maps using both a Monte Carlo approach and chi-squared curvature matrix theory. At the core of ZEAL will be an implementation of an Iterative Oblate (IO) lightning location retrieval method recently developed at MSFC. The IO method will be appropriately modified to account for variable wave propagation speed, and the new retrieval results will be compared with the current ZEUS retrieval algorithm to assess potential improvements. In this preliminary ZEAL work effort, we defined 5000 source locations evenly distributed across the Earth. We then used the existing (as well as potential future ZEUS sites) to simulate arrival time data between source and ZEUS site. A total of 100 sources were considered at each of the 5000 locations, and timing errors were selected from a normal distribution having a mean of 0 seconds and a standard deviation of 20 microseconds. This simulated "noisy" dataset was analyzed using the IO algorithm to estimate source locations. The exact locations were compared with the retrieved locations, and the results are summarized via several color-coded "error maps."

Elander, Valjean↗
DOE OSTI2018

Generation of rationally-designed nerve growth factor (NGF) variants with receptor specificity

Highlights: • We characterized NGF variants predicted by FoldX protein design algorithm to have an altered binding to TrkA and p75{sup NTR}. • I31 was identified as a key residue within NGF that distinguishes between TrkA and p75{sup NTR} binding. • The I31R NGF selectively binds and activates p75{sup NTR}, while it did not exhibit the biological activity at TrkA receptor. Nerve growth factor (NGF) is the prototypic member of the neurotrophin family and binds two receptors, TrkA and the 75 kDa neurotrophin receptor (p75{sup NTR}), through which diverse and sometimes opposing effects are mediated. Using the FoldX protein design algorithm, we generated eight NGF variants with different point mutations predicted to have altered binding to TrkA or p75{sup NTR}. Of these, the I31R NGF variant exhibited specific binding to p75{sup NTR}. The generation of this NGF variant with selective affinity for p75{sup NTR} can be used to enhance understanding of neurotrophin receptor imbalance in diseases and identifies a key targetable residue for the development of small molecules to disrupt binding of NGF to TrkA with potential uses in chronic pain.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2019

Improvement of machine learning enhanced genetic algorithm for nonlinear beam dynamics optimization

On top of the genetic algorithm enhanced by machine learning for nonlinear lattice optimization, as proposed in Li et al. (2018), an improved repopulation technique has been developed. Different weight coefficients for defining the “elite cluster” were compared to discern the fastest convergence in two classic optimization test problems. Additonally, the volume of the parameter space for generating potentially competitive candidates was further confined by repopulation in the vicinity of randomly selected “elite seeds”. The new repopulation technique significantly improves the quality of newly populated candidates by excluding the less competitive seeds introduced by the old repopulation algorithm. Finally, this technique has been validated, having a faster convergence for test problems first, and then applied to the nonlinear lattice optimization for the High Energy Photon Source storage ring.

36 MATERIALS SCIENCE↗
DOE OSTI2018

An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method

This paper is concerned with applying bandwidth and profile reduction reordering algorithms prior to computing an incomplete Cholesky factorization and using this as a preconditioner for the conjugate gradient method. Hundreds of reordering algorithms have been proposed to solve the problems of bandwidth and profile reductions since the mid-1960s. In previous publications, a large range of heuristics for bandwidth and/or profile reductions was reviewed. Based on this experience, 13 heuristics were selected as the most promising methods. These are evaluated in this paper along with a variant of the breadth-first search procedure that is proposed. Numerical results confirm the effectiveness of this modified reordering algorithm for linear systems derived from specific application areas. Moreover, the most promising heuristics for several application areas are identified when reducing the computational cost of the incomplete Cholesky-conjugate gradient method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A Model Tree Generator (MTG) Framework for Simulating Hydrologic Systems: Application to Reservoir Routing

Data-driven algorithms have been widely used as effective tools to mimic hydrologic systems. Unlike black-box models, decision tree algorithms offer transparent representations of systems and reveal useful information about the underlying process. A popular class of decision tree models is model tree (MT), which is designed for predicting continuous variables. Most MT algorithms employ an exhaustive search mechanism and a pre-defined splitting criterion to generate a piecewise linear model. However, this approach is computationally intensive, and the selection of the splitting criterion can significantly affect the performance of the generated model. These drawbacks can limit the application of MTs to large datasets. To overcome these shortcomings, a new flexible Model Tree Generator (MTG) framework is introduced here. MTG is equipped with several modules to provide a flexible, efficient, and effective tool for generating MTs. The application of the algorithm is demonstrated through simulation of controlled discharge from several reservoirs across the Contiguous United States (CONUS).

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2018

An algorithm for automatic identification of double twin variants in Mg alloys

Highlights: • An algorithm for automatic identification of {10–11}–{10–12} double twin variants is proposed. • This algorithm is applicable for the cases without knowing the primary twin orientations. • The primary twin orientations can be reconstructed using this algorithm. - Abstract: {10 1-bar 1}−{10 1-bar 2} double twins (DTs) are profuse in Mg alloys after rolling at a large reduction (>10%). In many cases, the secondary twins completely occupy the primary ones, causing difficulty in variant analysis. Here, we propose an algorithm for automatic identification of twin variants. This is applicable for the {10 1-bar 1}−{10 1-bar 2} DTs without knowing the primary twins. In addition, two kinds of stereographic projections are constructed to assist such variant selection. By this method, the variants of 67 DTs observed in a rolled AZ31 sheet are determined. Based on 14 sets of DTs with known primary twin orientations, the high efficiency and reliability of this proposed algorithm is verified. The reason for unreliable variant identification in two special cases is also discussed.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Random Forests as a Viable Method to Select and Discover High-redshift Quasars

We present a method of selecting quasars up to redshift ≈6 with random forests, a supervised machine-learning method, applied to Pan-STARRS1 and WISE data. We find that, thanks to the increasing set of known quasars, we can assemble a training set that enables supervised machine-learning algorithms to become a competitive alternative to other methods up to this redshift. We present a candidate set for the redshift range 4.8–6.3, which includes the region around z = 5.5 where selecting quasars is difficult due to their photometric similarity to red and brown dwarfs. We demonstrate that, under our survey restrictions, we can reach a high completeness (66% ± 7% below redshift 5.6/83{sub -9}{sup +6}% above redshift 5.6) while maintaining a high selection efficiency (78{sub -8}{sup +10}%/94{sub -8}{sup +5}%). Our selection efficiency is estimated via a novel method based on the different distributions of quasars and contaminants on the sky. The final catalog of 515 candidates includes 225 known quasars. We predict the candidate catalog to contain additional 148{sub -33}{sup +41} new quasars below redshift 5.6 and 45{sub -8}{sup +5} above, and we make the catalog publicly available. Spectroscopic follow-up observations of 37 candidates led us to discover 20 new high redshift quasars (18 at 4.6 ≤ z ≤ 5.5, 2 z ~ 5.7). These observations are consistent with our predictions on efficiency. We argue that random forests can lead to higher completeness because our candidate set contains a number of objects that would be rejected by common color cuts, including one of the newly discovered redshift 5.7 quasars.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1990

Skyline based terrain matching

Skyline-based terrain matching, a new method for locating the vantage point of stereo camera or laser range-finding measurements on a global map previously prepared by satellite or aerial mapping is described. The orientation of the vantage is assumed known, but its translational parameters are determined by the algorithm. Skylines, or occluding contours, can be extracted from the sensory measurements taken by an autonomous vehicle. They can also be modeled from the global map, given a vantage estimate from which to start. The two sets of skylines, represented in cylindrical coordinates about either the true or the estimated vantage, are employed as 'features' or reference objects common to both sources of information. The terrain matching problem is formulated in terms of finding a translation between the respective representations of the skylines, by approximating the two sets of skylines as identical features (curves) on the actual terrain. The search for this translation is based on selecting the longest of the minimum-distance vectors between corresponding curves from the two sets of skylines. In successive iterations of the algorithm, the approximation that the two sets of curves are identical becomes more accurate, and the vantage estimate continues to improve. The algorithm was implemented and evaluated on a simulated terrain. Illustrations and examples are included.

Page, Lance A.↗
DOE OSTI2018

Estimating the joint distribution of rate parameters across multiple reactions in the absence of experimental data

Here, a procedure for determining the joint uncertainty of Arrhenius parameters across multiple combustion reactions of interest is demonstrated. This approach is capable of constructing the joint distribution of the Arrhenius parameters arising from the uncertain measurements performed in specific target experiments without having direct access to the underlying experimental data. The method involves constructing an ensemble of hypothetical data sets with summary statistics consistent with the available information reported by the experimentalists, followed by a fitting procedure that learns the structure of the joint parameter density across reactions using this consistent hypothetical data as evidence. The procedure is formalized in a Bayesian statistical framework, employing maximum-entropy and approximate Bayesian computation methods and utilizing efficient Markov chain Monte Carlo techniques to explore data and parameter spaces in a nested algorithm. We demonstrate the application of the method in the context of experiments designed to measure the rates of selected chain reactions in the H 2 -O 2 system and highlight the utility of this approach for revealing the critical correlations between the parameters within a single reaction and across reactions, as well as for maximizing consistency when utilizing rate parameter information in predictive combustion modeling of systems of interest.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Simultaneous repression of multiple bacterial genes using nonrepetitive extra-long sgRNA arrays

Engineering cellular phenotypes often requires the regulation of many genes. When using CRISPR interference, coexpressing many single-guide RNAs (sgRNAs) triggers genetic instability and phenotype loss, due to the presence of repetitive DNA sequences. We stably coexpressed 22 sgRNAs within nonrepetitive extra-long sgRNA arrays (ELSAs) to simultaneously repress up to 13 genes by up to 3,500-fold. We applied biophysical modeling, biochemical characterization and machine learning to develop toolboxes of nonrepetitive genetic parts, including 28 sgRNA handles that bind Cas9. We designed ELSAs by combining nonrepetitive genetic parts according to algorithmic rules quantifying DNA synthesis complexity, sgRNA expression, sgRNA targeting and genetic stability. Using ELSAs, we created three highly selective phenotypes in Escherichia coli, including redirecting metabolism to increase succinic acid production by 150-fold, knocking down amino acid biosynthesis to create a multi-auxotrophic strain and repressing stress responses to reduce persister cell formation by 21-fold. Finally, ELSAs enable simultaneous and stable regulation of many genes for metabolic engineering and synthetic biology applications.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2025

Model-agnostic search for dijet resonances with anomalous jet substructure in proton–proton collisions at $\sqrt{s}$ = 13 TeV

This paper presents a model-agnostic search for narrow resonances in the dijet final state in the mass range 1.8-6 TeV. The signal is assumed to produce jets with substructure atypical of jets initiated by light quarks or gluons, with minimal additional assumptions. Search regions are obtained by utilizing multivariate machine-learning methods to select jets with anomalous substructure. A collection of complementary anomaly detection methods - based on unsupervised, weakly supervised, and semisupervised algorithms - are used in order to maximize the sensitivity to unknown new physics signatures. These algorithms are applied to data corresponding to an integrated luminosity of 138 fb -1 , recorded by the CMS experiment at the LHC, at a center-of-mass energy of 13 TeV. No significant excesses above background expectations are seen. Exclusion limits are derived on the production cross section of benchmark signal models varying in resonance mass, jet mass, and jet substructure. Many of these signatures have not been previously sought, making several of the limits reported on the corresponding benchmark models the first ever. When compared to benchmark inclusive and substructure-based search strategies, the anomaly detection methods are found to significantly enhance the sensitivity to a variety of models.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Improved sensitivity of the DRIFT-IId directional dark matter experiment using machine learning

We demonstrate a new type of analysis for the DRIFT-IId directional dark matter detector using a machine learning algorithm called a Random Forest Classifier. The analysis labels events as signal or background based on a series of selection parameters, rather than solely applying hard cuts. The analysis efficiency is shown to be comparable to our previous result at high energy but with increased efficiency at lower energies. This leads to a projected sensitivity enhancement of one order of magnitude below a WIMP mass of 15 GeV c -2 and a projected sensitivity limit that reaches down to a WIMP mass of 9 GeV c -2 , which is a first for a directionally sensitive dark matter detector.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2019

Low energy muon neutrino reconstruction in MicroBooNE

MicroBooNE is a Liquid Argon Time Projection Chamber (LArTPC) neutrino experiment on the Booster Neutrino Beamline at the Fermi National Accelerator Laboratory, with an 85-tonne active mass. One of MicroBooNE’s primary physics goals is to investigate the excess of electron neutrino events seen by MiniBooNE in the [200-600] MeV range. MicroBooNE will constrain the intrinsic electron neutrino component of the beam by measuring the muon neutrino spectrum. Several low-energy excess analyses are taking place in parallel, using independent reconstructions and selection schemes. This paper will focus on a low-energy excess analysis that makes use of deep learning algorithms applied to the high-resolution images provided by the MicroBooNE LArTPC. We present a novel 3D event reconstruction based on computer vision tools and a stochastic search algorithm, yielding a 2.2% energy resolution for 1μ1p muon neutrino interactions in the [200-1500] MeV range.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2025

Measurement of photonuclear jet production in ultraperipheral Pb + Pb collisions at $\sqrt{s_{NN}}$ = 5.02 TeV with the ATLAS detector

In ultrarelativistic heavy ion collisions at the LHC, each nucleus acts a sources of high-energy real photons that can scatter off the opposing nucleus in ultraperipheral photonuclear (𝛾 + 𝐴) collisions. Hard scattering processes initiated by the photons in such collisions provide a novel method for probing nuclear parton distributions in a kinematic region not easily accessible to other measurements. ATLAS has measured production of dijet and multijet final states in ultraperipheral Pb + Pb collisions at $\sqrt{s_{NN}}$ = 5.02 TeV using a dataset recorded in 2018 with an integrated luminosity of 1.72 nb −1 . Photonuclear final states are selected by requiring a rapidity gap in the photon direction; this selects events where one of the outgoing nuclei remains intact. Jets are reconstructed using the anti-𝑘 t algorithm with radius parameter, 𝑅 = 0.4. Triple-differential cross sections, unfolded for detector response, are measured and presented using two sets of kinematic variables. The first set consists of the total transverse momentum (𝐻 T ), rapidity, and mass of the jet system. The second set uses 𝐻 T and particle-level nuclear and photon parton momentum fractions, 𝑥 A and 𝑧 𝛾 , respectively. The results are compared with leading-order perturbative QCD calculations of photonuclear jet production cross sections, where all leading order predictions using existing fits fall below the data in the shadowing region. More detailed theoretical comparisons will allow these results to strongly constrain nuclear parton distributions, and these data provide results from the LHC directly comparable to early physics results at the planned Electron-Ion Collider.

Parton distribution functions↗
DOE OSTI2020

Control of SiC Based Integrated DC-DC Powertrain Charger for Electric Vehicles

In this paper, an automated controller for an integrated, reconfigurable dc-dc converter for plugin electric vehicles (EVs) is presented. The integrated converter combines both an interleaved boost converter and dual active bridge (DAB) converter, sharing magnetics and switching devices. The converter switches between operating modes using the existing battery management system (BMS) contactors. The integrated converter operates in isolated DAB mode during battery charging operation. During traction operation, the integrated converter is operated in interleaved boost mode for heavy load and DAB mode during light load, high voltage operation. An online transition algorithm is used to transition from interleaved boost mode to DAB mode with minimal bus distortion. The automated controller selects the operating mode and inverter bus voltage at different torque-speed conditions to get maximum overall traction drive efficiency. An experimental prototype of the integrated converter demonstrates the automated controller functionality.

Anwar, Saeed↗