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,333 records · Page 74
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

Circular polarization analyzer with polarization tunable focusing of surface plasmon polaritons

A practical circular polarization analyzer (CPA) that can selectively focus surface plasmon polaritons (SPPs) at two separate locations, according to the helicity of the circularly polarized light, is designed and experimentally verified in the terahertz frequency range. The CPA consists of fishbone-slit units and is designed using the simulated annealing algorithm. By differentially detecting the intensities of the two SPPs focuses, the helicity of the incident circularly polarized light can be obtained and the CPA is less vulnerable to the noise of incident light. The proposed device may also have wide potential applications in chiral SPPs photonics and the analysis of chiral molecules in biology.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

SIRIUS: Enabling Progressive Data Exploration for Extreme-Scale Scientific Data

Scientific simulations on high performance computing (HPC) platforms generate large quantities of data. To bridge the widening gap between compute and I/O, and enable data to be more efficiently stored and analyzed, simulation outputs need to be refactored, reduced, and appropriately mapped to storage tiers. However, a systematic solution to support these steps has been lacking in the current HPC software ecosystem. To that end, this paper develops SIRIUS, a progressive JPEG-like data management scheme for storing and analyzing big scientific data. It co-designs data decimation, compression, and data storage, taking the hardware characteristics of each storage tier into considerations. With reasonably low overhead, our approach refactors simulation data, using either topological or uniform decimation, into a much smaller, reduced-accuracy base dataset, and a series of deltas that is used to augment the accuracy if needed. The base dataset and deltas are compressed and written to multiple storage tiers. Data saved on different tiers can then be selectively retrieved to restore the level of accuracy that satisfies data analytics. Thus, SIRIUS provides a paradigm shift towards elastic data analytics and enables end users to make trade-offs between analysis speed and accuracy on-the-fly. This paper further develops algorithms to preserve statistics for data decimation, a common requirement for reducing data. Here, we assess the impact of SIRIUS on unstructured triangular meshes, a pervasive data model used in scientific simulations. In particular, we evaluate two realistic use cases: the blob detection in fusion and high-pressure area extraction in computational fluid dynamics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Multi-objective dynamic aperture optimization for storage rings

We report an efficient dynamic aperture (DA) optimization approach using multiobjective genetic algorithm (MOGA), which is driven by nonlinear driving terms computation. It was found that having small low order driving terms is a necessary but insufficient condition of having a decent DA. Then direct DA tracking simulation is implemented among the last generation candidates to select the best solutions. The approach was demonstrated successfully in optimizing NSLS-II storage ring DA.

43 PARTICLE ACCELERATORS↗
DOE OSTI2014

Chisel: reliability- and accuracy-aware optimization of approximate computational kernels

The accuracy of an approximate computation is the distance between the result that the computation produces and the corresponding fully accurate result. The reliability of the computation is the probability that it will produce an acceptably accurate result. Emerging approximate hardware platforms provide approximate operations that, in return for reduced energy consumption and/or increased performance, exhibit reduced reliability and/or accuracy. We present Chisel, a system for reliability- and accuracy-aware optimization of approximate computational kernels that run on approximate hardware platforms. Given a combined reliability and/or accuracy specification, Chisel automatically selects approximate kernel operations to synthesize an approximate computation that minimizes energy consumption while satisfying its reliability and accuracy specification. We evaluate Chisel on five applications from the image processing, scientific computing, and financial analysis domains. The experimental results show that our implemented optimization algorithm enables Chisel to optimize our set of benchmark kernels to obtain energy savings from 8.7% to 19.8% compared to the fully reliable kernel implementations while preserving important reliability guarantees.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Graph Learning in Knowledge Bases

The amount of text data has been growing exponentially in recent years, giving rise to automatic information extraction methods that store text annotations in a database. The current state-of-theart structured prediction methods, however, are likely to contain errors and it’s important to be able to manage the overall uncertainty of the database. On the other hand, the advent of crowdsourcing has enabled humans to aid machine algorithms at scale. As part of this project we introduced pi-CASTLE , a system that optimizes and integrates human and machine computing as applied to a complex structured prediction problem involving conditional random fields (CRFs). We proposed strategies grounded in information theory to select a token subset, formulate questions for the crowd to label, and integrate these labelings back into the database using a method of constrained inference. On both a text segmentation task over academic citations and a named entity recognition task over tweets we showed an order of magnitude improvement in accuracy gain over baseline methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Study of Data-Driven Mesh-Model Optimization in System Thermal-Hydraulic Simulation

Quantification of nuclear power plant safety risk requires a systematic and yet practical approach to identification of accident scenarios, assessment of their likelihood and consequences. Instrumental to this goal is risk-informed safety margin characterization (RISMC) framework, whose realization requires computationally robust and affordable methods for sufficiently accurate simulation of complex multi-dimensional physical phenomena, such as turbulent and multi-phase flow. The CFD-like correlation-based codes with 3D simulation capability (e.g., GOTHIC) ensure computational efficiency using coarse mesh size and the sub-grid phenomena in the boundary layer that can be captured by adequate constitutive correlations. However, the error sources and user effects on the selection of mesh size and models lead to unpredictable simulation error, while rich High-Fidelity (HF) data from experiments and numerical simulation using validated code or DNS are not fully explored. It would be useful to have a “smart” data-driven multi-scale framework in which the low-resolution models can be “taught” to emulate high-resolution models. The objective of this work is to develop and evaluate a physical-based data-driven mesh-model optimization approach (Optimized Mesh/Model Information System, OMIS) to estimate the simulation error and give advice on the optimized selection of coarse mesh size and Low-Fidelity (LF) models for System Thermal Hydraulic (STH) simulation to achieve accuracy comparable to that of HF models. This approach takes advantages of computational efficiency of coarse-mesh simulation and application of Machine Learning (ML) algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

High-performance Generic Neutrino Detection in a LArTPC near the Earth's Surface with the MicroBooNE Detector

Large Liquid Argon Time Projection Chambers (LArTPCs) are being increasingly adopted in neutrino oscillation experiments because of their superb imaging capabilities through the combination of both tracking and calorimetry in a fully active volume. Active LArTPC neutrino detectors at or near the Earth's surface, such as the MicroBooNE experiment, present a unique analysis challenge because of the large flux of cosmic-ray muons and the slow drift of ionization electrons. We present a novel Wire-Cell-based high-performance generic neutrino-detection technique implemented in MicroBooNE. The cosmic-ray background is reduced by a factor of 1.4$\times10^{5}$ resulting in a 9.7% cosmic contamination in the selected neutrino candidate events, for visible energies greater than 200~MeV, while the neutrino signal efficiency is retained at 88.4% for $\nu_{\mu}$ charged-current interactions in the fiducial volume in the same energy region. This significantly improved performance compared to existing reconstruction algorithms, marks a major milestone toward reaching the scientific goals of LArTPC neutrino oscillation experiments operating near the Earth's surface.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

Real-time Anomaly Detection at the L1 Trigger of CMS Experiment

We present the preparation, deployment, and testing of an autoencoder trained for unbiased detection of new physics signatures in the CMS experiment Global Trigger (GT) test crate FPGAs during LHC Run 3. The GT makes the final decision whether to readout or discard the data from each LHC collision, which occur at a rate of 40 MHz, within a 50 ns latency. The Neural Network makes a prediction for each event within these constraints, which can be used to select anomalous events for further analysis. The GT test crate is a copy of the main GT system, receiving the same input data, but whose output is not used to trigger the readout of CMS, providing a platform for thorough testing of new trigger algorithms on live data, but without interrupting data taking. We describe the methodology to achieve ultra low latency anomaly detection, and present the integration of the DNN into the GT test crate, as well as the monitoring, testing, and validation of the algorithm during proton collisions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

A novel machine learning-based optimization algorithm (ActivO) for accelerating simulation-driven engine design

A novel design optimization approach (ActivO) that employs an ensemble of machine learning algorithms is presented. The proposed approach is a surrogate-based scheme, where the predictions of a weak leaner and a strong learner are utilized within an active learning loop. The weak learner is used to identify promising regions within the design space to explore, while the strong learner is used to determine the exact location of the optimum within promising regions. For each design iteration, exploration is done by randomly selecting evaluation points within regions where the weak learner-predicted fitness is high. The global optimum obtained by using the strong learner as a surrogate is also evaluated to enable rapid convergence once the most promising region has been identified. First, the performance of ActivO was compared against five other optimizers on a cosine mixture function with 25 local optima and one global optimum. In the second problem, the objective was to minimize indicated specific fuel consumption of a compression-ignition internal combustion (IC) engine while adhering to desired constraints associated with in-cylinder pressure and emissions. In this work, the efficacy of the proposed approach is compared to that of a genetic algorithm, which is widely used within the internal combustion engine community for engine optimization, showing that ActivO reduces the number of function evaluations needed to reach the global optimum, and thereby time-to-design by 80%. Furthermore, the optimization of engine design parameters leads to savings of around 1.9% in energy consumption, while maintaining operability and acceptable pollutant emissions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

SU-E-T-203: Comparison of a Commercial MRI-Linear Accelerator Based Monte Carlo Dose Calculation Algorithm and Geant4

Purpose: An MRI-linear accelerator is currently being developed by the vendor Elekta™. The treatment planning system that will be used to model dose for this unit uses a Monte Carlo dose calculation algorithm, GPUMCD, that allows for the application of a magnetic field. We tested this radiation transport code against an independent Monte-Carlo toolkit Geant4 (v.4.10.01) both with and without the magnetic field applied. Methods: The setup comprised a 6 MeV mono-energetic photon beam emerging from a point source impinging on a homogeneous water phantom at 100 cm SSD. The comparisons were drawn from the percentage depth doses (PDD) for three different field sizes (1.5 x 1.5 cm{sup 2}, 5 x 5 cm{sup 2}, 10 x 10 cm{sup 2}) and dose profiles at various depths. A 1.5 T magnetic field was applied perpendicular to the direction of the beam. The transport thresholds were kept the same for both codes. Results: All of the normalized PDDs and profiles agreed within ± 1 %. In the presence of the magnetic field, PDDs rise more quickly reducing the depth of maximum dose. Near the beam exit point in the phantom a hot spot is created due to the electron return effect. This effect is more pronounced for the larger field sizes. Profiles selected parallel to the external field show no effect, however, the ones selected perpendicular to the direction of the applied magnetic field are shifted towards the direction of the Lorentz force applied by the magnetic field on the secondary electrons. It is observed that these profiles are not symmetric which indicates a lateral build up of the dose. Conclusion: There is a good general agreement between the PDDs/profiles calculated by both algorithms thus far. We are proceeding towards clinically relevant comparisons in a heterogeneous phantom for polyenergetic beams. Funding for this work has been provided by Elekta.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2017

Developing reservoir monthly inflow forecasts using artificial intelligence and climate phenomenon information

Reservoirs are fundamental human–built infrastructures that collect, store, and deliver fresh surface water in a timely manner for many purposes. Efficient reservoir operation requires policy makers and operators to understand how reservoir inflows are changing under different hydrological and climatic conditions to enable forecast–informed operations. Over the last decade, the uses of Artificial Intelligence and Data Mining [AI & DM] techniques in assisting reservoir streamflow subseasonal to seasonal forecasts have been increasing. In this study, Random Forest [RF), Artificial Neural Network (ANN), and Support Vector Regression (SVR) are employed and compared with respect to their capabilities for predicting 1 month–ahead reservoir inflows for two headwater reservoirs in USA and China. Both current and lagged hydrological information and 17 known climate phenomenon indices, i.e., PDO and ENSO, etc., are selected as predictors for simulating reservoir inflows. Here, the results show three methods are capable of providing monthly reservoir inflows with satisfactory statistics; the results obtained by Random Forest have the best statistical performances compared with the other two methods; another advantage of Random Forest algorithm is its capability of interpreting raw model inputs; climate phenomenon indices are useful in assisting monthly or seasonal forecasts of reservoir inflow; and different climate conditions are autocorrelated with up to several months, and the climatic information and their lags are cross correlated with local hydrological conditions in our case studies.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2019

Comparing D-optimal designs with common mixture experimental designs for logistic regression

Mixture experiments are used in applications where the proportion of mixing components affects a response variable, such as in studies involving chemical formulations. In many applications, the response is dichotomous or binary (e.g., pass or fail) and a concern for researchers is how to efficiently and informatively design such experiments. A naive approach is to use design recommendations derived from linear normal-theory models with constant variance. In this research, we investigate the potential risks of such designs by comparing them to D-optimal mixture designs for binary responses and evaluating the D-efficiency of these design alternatives for several parameter subspaces. Standard designs for normal theory models generally do not work well for binary responses due to the tendency of these designs to favor boundary points. In addition, D-optimal mixture designs for binary responses tend to locate design points in the region where the magnitude of predicted response probabilities are moderate. Lastly, we recommend that researchers pay close attention to what is known about the characteristics of the underlying process models in selecting appropriate mixture designs for binary-response applications.

D-optimality↗
DOE OSTI2019

Two-tier model reduction of viscoelastically damped finite element models

Transient simulations of linear viscoelastically damped structures necessitate critical computational resources to directly integrate the full-order finite element model with time-stepping algorithms. Traditional modal reduction techniques are not directly applicable to these systems since viscoelastic materials depend on time and frequency. A more appropriate reduction basis is obtained from the nonlinear, complex eigenvalue problem, whose eigenvectors capture the appropriate kinematics and enable frequency-based mode selection; unfortunately, the computational cost is prohibitive for computing these modes from large-scale engineering models. To address this shortcoming, this work proposes a novel two-tier reduction procedure to reduce the upfront cost of solving the complex, nonlinear eigenvalue problem. The first reduction step reduces the full-order model with real mode shapes linearized about various centering frequencies to capture the kinematics over a full range of viscoelastic material behavior (glassy, rubbery, and glass-transition zones). This tier-one reduction preserves time-temperature superposition and allows the equations to depend parametrically on operating temperature. The second-level reduction then solves the complex, nonlinear eigenmode solutions in the tier-one reduced space about a fixed temperature to further reduce the equations-of-motion. The method is demonstrated on a cantilevered sandwich plate to display its accuracy and efficiency in comparison to full-order model predictions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Genarris: Random generation of molecular crystal structures and fast screening with a Harris approximation

Herein, we present Genarris, a Python package that performs configuration space screening for molecular crystals of rigid molecules by random sampling with physical constraints. For fast energy evaluations, Genarris employs a Harris approximation, whereby the total density of a molecular crystal is constructed via superposition of single molecule densities. Dispersion-inclusive density functional theory is then used for the Harris density without performing a self-consistency cycle. Genarris uses machine learning for clustering, based on a relative coordinate descriptor developed specifically for molecular crystals, which is shown to be robust in identifying packing motif similarity. In addition to random structure generation, Genarris offers three workflows based on different sequences of successive clustering and selection steps: the "Rigorous" workflow is an exhaustive exploration of the potential energy landscape, the "Energy" workflow produces a set of low energy structures, and the "Diverse" workflow produces a maximally diverse set of structures. The latter is recommended for generating initial populations for genetic algorithms. Here, the implementation of Genarris is reported and its application is demonstrated for three test cases. Published by AIP Publishing.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2023

Learning to learn by using nonequilibrium training protocols for adaptable materials

Evolution in time-varying environments naturally leads to adaptable biological systems that can easily switch functionalities. Advances in the synthesis of environmentally responsive materials therefore open up the possibility of creating a wide range of synthetic materials which can also be trained for adaptability. We consider high-dimensional inverse problems for materials where any particular functionality can be realized by numerous equivalent choices of design parameters. By periodically switching targets in a given design algorithm, we can teach a material to perform incompatible functionalities with minimal changes in design parameters. We exhibit this learning strategy for adaptability in two simulated settings: elastic networks that are designed to switch deformation modes with minimal bond changes and heteropolymers whose folding pathway selections are controlled by a minimal set of monomer affinities. The resulting designs can reveal physical principles, such as nucleation-controlled folding, that enable such adaptability.

Science & Technology - Other Topics↗
DOE OSTI2015

Full elastic strain and stress tensor measurements from individual dislocation cells in copper through-Si vias

We report non-destructive measurements of the full elastic strain and stress tensors from individual dislocation cells distributed along the full extent of a 50 mm-long polycrystalline copper via in Si is reported. Determining all of the components of these tensors from sub-micrometre regions within deformed metals presents considerable challenges. The primary issues are ensuring that different diffraction peaks originate from the same sample volume and that accurate determination is made of the peak positions from plastically deformed samples. For these measurements, three widely separated reflections were examined from selected, individual grains along the via. The lattice spacings and peak positions were measured for multiple dislocation cell interiors within each grain and the cell-interior peaks were sorted out using the measured included angles. A comprehensive uncertainty analysis using a Monte Carlo uncertainty algorithm provided uncertainties for the elastic strain tensor and stress tensor components.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Machine Learning (ML) Classifier to Assist Metadata Creation

The Atmospheric Radiation Measurement (ARM) Data Center is responsible for the timely collection, archival, and curation of science data products. These products are freely available through an online data repository. Metadata creation is paramount for scientific users to find and access over seven petabytes of atmospheric science data. The hierarchical metadata structure allows users to search for information at both broad and narrow levels. This project aims to leverage 30 years’ worth of manually created metadata to enable machine predictions of broad-term classifications from narrow-term descriptions. These classification predictions would assist metadata coordinators with their term selections. This paper discusses the cleaning and preprocessing of the training data, the pipeline developed to determine the best model for this task, and the creation of an API metadata classifier for ARM measurement metadata. Our results show that the Linear Support Vector Classification (LinearSVC) algorithm, along with the Term Frequency – Inverse Document Frequency (TF-IDF) vectorizer, is well-suited for our multi-class classification task. Lengthier input training data led to better results, and artificial balancing was unnecessary for this particular use case. This predictive classifier enhances efficiency in metadata creation, as well as supports greater consistency and accuracy in metadata tagging.

Collier, Hannah [ORNL] (ORCID:0000000341284292)↗
DOE OSTI2023

Capturing high‐resolution digital images for use in forensic document examination

Abstract In the past, pattern disciplines within forensic science have periodically faced criticism due to their subjective and qualitative nature and the perceived absence of research evaluating and supporting the foundations of their practices. Recently, however, forensic scientists and researchers in the field of pattern evidence analysis have developed and published approaches that are more quantitative, objective, and data driven. This effort includes automation, algorithms, and measurement sciences, with the end goal of enabling conclusions to be informed by quantitative models. Before employing these tools, forensic evidence must be digitized in a way that adequately balances high‐quality detail and content capture with minimal background noise imparted by the selected technique. While the current work describes the process of optimizing a method to digitize physical documentary evidence for use in semi‐automated trash mark examinations, it could be applied to assist other disciplines where the digitization of physical items of evidence is prevalent. For trash mark examinations specifically, it was found that high‐resolution photography provided optimal digital versions of evidentiary items when compared to high‐resolution scanning.

Riley, Paige↗