SEARCH · Engineering Papers

Results for “Machine Learning Algorithms”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,549 records · Page 86

All sources NASA NTRS DOE OSTI

DOE OSTI2023

Automatic point Cloud Building Envelope Segmentation (Auto-CuBES) using Machine Learning

Modern retrofit construction practices use 3D point cloud data of the building envelope to obtain the as-built dimensions. However, manual segmentation by a trained professional is required to identify and measure window openings, door openings, and other architectural features, making the use of 3D point clouds labor-intensive. In this study, the Automatic point Cloud Building Envelope Segmentation (Auto-CuBES) algorithm is described, which can significantly reduce the time spent during point cloud segmentation. The Auto-CuBES algorithm inputs a 3D point cloud generated by commonly available surveying equipment and outputs a wire-frame model of the building envelope. Unsupervised machine learning methods were used to identify facades, windows, and doors while minimizing the number of calibration parameters. Additionally, Auto-CuBES generates a heat map of each facade indicating non-planar characteristics that are crucial for the optimization of connections used in overclad envelope retrofits. With a scan resolution of 3 mm, the resulting window dimensions showed a mean absolute error of 4.2 mm compared to manual laser measurements.

Maldonado Puente, Bryan↗

DOE OSTI2019

Modeling Mesoscale Processes of Scalable Synthesis (Final Report)

The main objective of the center is to develop tools that can help for the understanding of equilibrium and non-equilibrium properties of nanoparticles in aqueous electrolytes. To achieve this goal, we need to develop new computational methodologies that can integrate molecular level description such as the electronic structure analysis to mesoscale description such as generalized hydrodynamics. The challenge is to develop systematic coarse graining techniques that can adaptively choose the level of description needed for the particular task. For example, if bonding breaking is involved, then one should use appropriate models from quantum mechanics to accurately model the time scale and molecular mechanism for the breaking process. However, to model transport process or the process of self-assembly, much less detailed models can be used. There are two main components to this task. One is to develop accurate models that bridge different levels of description. The classical example is the QM/MM model that bridges quantum mechanics and molecular mechanics for studying chemical reactions of large molecules. This work was awarded the Nobel prize this year. For our purpose, we also need to develop methods that bridge molecular and continuum levels of description. Another main task is to develop systematic coarse-graining methods that can give rise to accurate mesoscale and macroscale models, starting from more detailed models at the atomic or molecular scale. None of these ideas are new. By now they have been fashionable topics for quite some time. But neither problem is satisfactorily resolved. The main problem is that uncontrolled approximations are used. As a result, we have very little idea about the validity and accuracy of these models. The main purpose of the center is to exploit the Mori-Zwanzig formalism to achieve the goals stated above. The Mori-Zwanzig formalism is a general tool for eliminating degrees of freedom from existing models. What is attractive about this formalism is its generality. The flip side is that it is also somewhat of a tautology. In order to make it a practical tool, one has to make approximations and this is where the trouble comes. Instead of focusing on Mori-Zwanzig formalism, the PI proposes to study the closely related renormalization group formalism (RG). Like Mori-Zwanzig, RG is a general strategy for eliminating small scale degrees of freedom in a model. Unlike Mori-Zwanzig, RG has the advantage that at least for some problems, one can write a PDE (partial differential equation) type of model for the exact RG flow, without any approximation. This gives us a solid starting point for discussing and analyzing approximations. The PI studied approximate RG flows for turbulent diffusion and related problems. However, extending it to more practical problems proved to be hard. The second line that the PI has pursued is to develop special numerical algorithms for studying particularly important events for dynamics processes in meso-scale systems. The PI succeeded in doing so for the problem of understanding phase transition in metallic systems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Efficient Parallel Sparse Symmetric Tucker Decomposition for High-Order Tensors

Tensor based methods are receiving renewed attention in recent years due to their prevalence in diverse real-world applications. There is considerable literature on tensor representations and algorithms for tensor decompositions, both for dense and sparse tensors. Many applications in hypergraph analytics, machine learning, psychometry, and signal processing result in tensors that are both sparse and symmetric, making it an important class for further study. Similar to the critical Tensor Times Matrix chain operation (TTMc) in general sparse tensors, the Sparse Symmetric Tensor Times Same Matrix chain (S3TTMc) operation is compute and memory intensive due to high tensor order and the associated factorial explosion in the number of non-zeros. In this work, we present a novel compressed storage format CSS for sparse symmetric tensors, along with an efficient parallel algorithm for the S3TTMc operation. We theoretically establish that S3TTMc on CSS achieves a better memory versus run-time trade-off compared to state-of-the-art implementations. We demonstrate experimental findings that confirm these results and achieve up to 2.9× speedup on synthetic and real datasets.

Shivakumar, Shruti↗

DOE OSTI2022

A differentiable approach to the maximum independent set problem using dataless neural networks

The success of machine learning solutions for reasoning about discrete structures has brought attention to its adoption within combinatorial optimization algorithms. Such approaches generally rely on supervised learning by leveraging datasets of the combinatorial structures of interest drawn from some distribution of problem instances. Reinforcement learning has also been employed to find such structures. Here, in this paper, we propose a different approach in that no data is required for training the neural networks that produce the solution. In this sense, what we present is not a machine learning solution, but rather one that is dependent on neural networks and where backpropagation is applied to a loss function defined by the structure of the neural network architecture as opposed to a training dataset. In particular, we reduce the popular combinatorial optimization problem of finding a maximum independent set to a neural network and employ a dataless training scheme to refine the parameters of the network such that those parameters yield the structure of interest. Additionally, we propose a universal graph reduction procedure to handle large-scale graphs. The reduction exploits community detection for graph partitioning and is applicable to any graph type and/or density. Experimental results on both real and synthetic graphs demonstrate that our proposed method performs on par or outperforms state-of-the-art learning-based methods in terms of the size of the found set without requiring any training data.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

A data-driven operational model for traffic at the Dallas Fort Worth International Airport

Airports are on the front line of significant innovations, allowing the movement of more people and goods faster, cheaper, and with greater convenience. As air travel continues to grow, airports will face challenges in responding to increasing passenger vehicle traffic, which leads to lower operational efficiency, poor air quality, and security concerns. This paper evaluates methods for traffic demand forecasting combined with traffic microsimulation, which will allow airport operations staff to accurately predict traffic and congestion. Using two years of detailed data describing individual vehicle arrivals and departures, aircraft movements, and weather at Dallas-Fort Worth (DFW) International Airport, we evaluate multiple prediction methods including the Auto Regressive Integrated Moving Average (ARIMA) family of models, traditional machine learning models, and DeepAR, a modern recurrent neural network (RNN). We find that these algorithms are able to capture the diurnal trends in the surface traffic, and all do very well when predicting the next 30 minutes of demand. Longer forecast horizons are moderately effective, demonstrating the challenge of this problem and highlighting promising techniques as well as potential areas for improvement. Traffic demand is not the only factor that contributes to terminal congestion, because temporary changes to the road network, such as a lane closure, can make benign traffic demand highly congested. Combining a demand forecast with a traffic microsimulation framework provides a complete picture of traffic and its consequences. The result is an operational intelligence platform for exploring policy changes, as well as infrastructure expansion and disruption scenarios. To demonstrate the value of this approach, we present results from a case study at DFW Airport assessing the impact of a policy change for vehicle routing in high demand scenarios. This framework can assist airports like DFW as they tackle daily operational challenges, as well as explore the integration of emerging technology and expansion of their services into long term plans.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Real-Time Machine Learning Inferencing with Edge Computing Devices from Google and Intel

Machine Learning (ML) has been demonstrated to accelerate discovery and improve the accuracy of many measurements in astrophysics and high energy physics research. As an increasingly commonplace tool, we have reached a new set of challenges in the deployment of ML, at the forefront of which is their computational complexity. The goal of this project is to explore the viability of dedicated machine learning hardware, such as Google’s Coral/Edge TPU and Intel’s Movidius Myriad devices, in astrophysics and high energy physics applications. ML algorithms, while faster than traditional methods, can become the bottleneck in data processing pipelines --- which is a critical issue in systems that require low latency. Within the context of high energy physics and astrophysics, we test this hardware in an attempt to find if it is able to reduce the computational cost of machine learning. We have benchmarked some of these devices, specifically the Google Coral Dev Board and th e Google AIY Vision Kit (Containing Intel’s Movidius Myriad 2).This was done via a strong gravitational lens finding application and a known data set of lenses, simulating a realistic astrophysics application of machine learning, and compare their results to that of traditional computer hardware.

Hawks, Benjamin↗

DOE OSTI2023

Convex Optimization for Nonequilibrium Steady States on a Hybrid Quantum Processor

Finding the transient and steady state properties of open quantum systems is a central problem in various fields of quantum technologies. Here, in this work, we present a quantum-assisted algorithm to determine the steady states of open system dynamics. By reformulating the problem of finding the fixed point of Lindblad dynamics as a feasibility semidefinite program, we bypass several well-known issues with variational quantum approaches to solving for steady states. We demonstrate that our hybrid approach allows us to estimate the steady states of higher dimensional open quantum systems and discuss how our method can find multiple steady states for systems with symmetries.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

A Study of Physics-Informed Deep Learning for System Fluid Dynamics Closures

The sub-grid-scale (SGS) physics models, or so-called closure relations (CR), are essential in thermal-fluid modeling and simulation codes, ranging from large-eddy simulation to system-level thermo-fluid dynamic problems. While details vary, all thermo-fluid codes solve coupled mass-momentum-energy conservation partial differential equations (PDE). Traditionally, the analytical form of closure models has to be known, and then we calibrate the model using data from a set of applicable experiments. Characteristically, it takes long effort to gain insights and mechanistic understanding needed for developing closure models. Such a model is a compact form of data. The long time required for new model development limits the pace of model application while dealing with new geometries, new coolants or system conditions, particularly in newly designed systems. Alternative to mechanistic and semi-analytical models, it is possible to discover the pattern of closure relations by applying the modern machine learning methods to the body of relevant experimental data. Deep learning (DL) is a relatively new branch in the machine learning family, and a major breakthrough has been achieved since Hinton introduces a fast algorithm to efficiently train a feed-forward neural network (NN) with multilayer perceptrons. Generally, any NN with more than two layers is considered as deep learning, and it contains a large number of hyper-parameters to achieve pattern recognition or regression for complex datasets. Hornik shows that multilayer NN is compatible with universal approximation theorem. There is no constraint for a multilayer NN to capture the properties of any measurable information. This capability makes DL attractive for closure models in a system thermal-hydraulic code. As system geometry and/or operating conditions change, new physical experiments (increasingly sophisticated) are conducted to support evaluation and revision of closure models. Such a so-called data-driven modeling relaxes the structural form of system codes to directly assimilate data instead of hard-wiring the model to pre-calibrated correlations. The objective of this research is to enable cost-effective development of a DL-based closure that reflects the data. The previous work on applying machine learning techniques to fluid dynamics focused on statistical learning with basic NN from direct numerical simulations (DNS) dataset. In the present work, we show that DL-based closure models can cause the fluid calculation to diverge if multilayer NN is used. To address the issue, we investigate conditions by which the DL-based closure models work compatibly, stably, and effectively with PDE-constrained forward prediction problems. Optimally meeting the compatibility conditions constitutes a physics-informed deep learning (PIDL) strategy. We refer to this process as PDE-constrained machine learning or PDE-ML. To develop the technical basis for PDE-ML using DL-based fluid dynamics closure, numerical experiments are performed for manufactured problems of increasing complexity. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2025

Spectral Clustering-Based Partitioning of Large-Scale Power Electronics-Based Power Systems for Small-Signal Stability Analysis

The nodal admittance matrix (NAM)-based approach is well-suited for small-signal stability analysis of large-scale power electronics-based power systems (PEPSs), as it preserves the system structure through its admittance matrix. Previous studies have explored partitioning such systems into subareas and interconnections to reduce computational burden; however, they lacked a formal algorithmic procedure for determining feasible partitions. While several grid partitioning methods, such as those based on graph theory or machine learning, exist in the literature, they cannot be directly applied to NAM-based analysis due to differing objectives and constraints. Here, this paper addresses this gap by presenting a systematic, step-by-step procedure for applying a spectral partitioning algorithm that yields a division of the system into subareas suitable for NAM-based analysis. The computational complexity of the proposed method is also derived to demonstrate its efficiency and justify the practicality of the resulting subarea decomposition. The performance of the partitioning method is evaluated by applying the spectral clustering-derived subareas and interconnections to the NAM-based partitioning approach on a 140-bus system. Computational times for the full-system and partitioned NAM analyses are compared using MATLAB. Additionally, PSCAD simulations of the complete system and partitioned subareas are carried out to verify the effectiveness of the proposed method.

Nupur [Univ. of Tennessee, Knoxville, TN (United S↗

DOE OSTI2024

Reduced-Order Modeling of Multigroup Neutron Cross Sections for High-Temperature Gas-cooled Reactors

Abstract – Deterministic neutronics calculations rely on multigroup neutron cross section libraries, which consist of databases of tabulated values, used to calculate the neutron cross sections through multivariate linear interpolation. However, interpolation of the multidimensional cross section data becomes memory inefficient and time consuming as the number of tabulations increases, significantly slowing down the neutronics calculation, especially in the case of microscopic cross section libraries where every isotope (on the order of hundreds) has its own set of specific reactions and cross sections. In order to address this challenge, this work constructs efficient and robust reduced-order models (ROMs) of the multi-group cross sections to support the Griffin simulation of high-temperature gas-cooled reactors (HTGRs). The first part of the study investigates the linearity of the multigroup cross section data across isotopes, reaction types, and energy groups on pre-generated datasets for the purpose of dimensionality reduction. Secondly, a down-selection of ROM techniques is presented on representative classical machine learning (ML) techniques, including variants of linear regression, kernel-based methods, tree-based algorithms, and artificial neural networks. The selection criteria jointly consider the memory efficiency, predictive accuracy, prediction speed, and scalability in comparison to the multidimensional interpolation. Among all the ML techniques, deep neural networks (DNNs) have proven to be the best selection with sufficient accuracy, high robustness, good memory efficiency, great scalability, and superior flexibility. DNNs have been trained for all isotopes in this work and systematic Griffin testing is ongoing to ensure the feasibility of this ROM technique for predicting cross section and reducing memory requirements without a significant sacrifice in computational performance.

42 - ENGINEERING↗

DOE OSTI2026

Queue wait time prediction in high performance computing (HPC) systems

High Performance Computing (HPC) systems are critical enablers for groundbreaking scientific research across various domains. Efficient resource allocation, facilitated by job scheduling, is paramount for maximizing the utilization of HPC systems. However, the variability in wait times for queued jobs poses challenges for users, necessitating accurate job wait time estimation. This paper explores the influence of job characteristics, including job size (the number of nodes requested and walltime), the queue to which the job is submitted and other resource requirements, on job wait times in leadership-class HPC systems. Focusing on the Theta Cray XC40 and Polaris machines at Argonne National Laboratory, the study evaluates the performance of different supervised learning algorithms in predicting job wait times. It also evaluates the impact of data preprocessing, including outlier detection, Principal Component Analysis (PCA), and feature selection, on the performance of wait time prediction models. The findings reveal insights into the relationship between job characteristics and wait times, offering a foundation for optimizing resource allocation and enhancing user experience. The methodologies and tools developed in this study are adaptable to other leadership-class HPC systems, providing a valuable contribution to the broader HPC community aiming to improve job scheduling efficiency and user satisfaction.

Okafor, Nwamaka↗

DOE OSTI2021

OptML

OptML is an open-source Python package that provides modeling and solution capabilities for optimization problems with embedded machine learning models. OptML is a collaborative open-source project that includes advanced algorithms from the academic community for efficient solution of these problems. Sandia contributions to this package include the development of interfaces between these algorithms and Pyomo. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525. SAND2021-10861 O

Jalving, Jordan↗

DOE OSTI2022

In-Situ Machine Learning (ISML)

SAND2022-1478 O In-Situ Machine Learning (ISML) is a library of functions that can be combined to create algorithms for in-situ event detection. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

SciDAC↗

DOE OSTI2025

Kinetic Deep Learning v0.1

Here, we present a method that uses protein levels to predict times series of metabolite concentrations. Understanding this type of pathway dynamics is important in order to predict the behavior of the pathway and, more pragmatically, to be able to design biological systems (such as strains bioengineered to produce chemical products) reliably. Typically, for this purpose, kinetic models consisting of differential equations based on the Michaelis-Menten dynamics have been used in the past. However, these methods can rarely produce good fits to measured data time series. Possibly, this happens because the kinetic constants are unknown or are different from the ones measured in vivo, or perhaps because Michaelis-Menten dynamics is not a satisfactory description. In order to improve the predictive nature of these kinetic models we have eliminated the Michaelis-Menten description of pathway dynamics and we have substituted it by algorithms that automatically learn these dynamics from previously obtained metabolomics and proteomics data using machine learning approaches. Specifically, kinetic deep learning uses deep learning to map proteomics time series to metabolite concentration time series, instead of learning the first metabolite derivative and integrating in (as in the first version of kinetic learning). This approach is shown to provide good to excellent results with a data set specifically collected for this purpose.

Garcia Martin, Hector [Joint BioEnergy Institute (↗

DOE OSTI2021

deeplenstronomy: A dataset simulation package for strong gravitational lensing

Automated searches for strong gravitational lensing in optical imaging survey datasets often employ machine learning and deep learning approaches. These techniques require more example systems to train the algorithms than have presently been discovered, which creates a need for simulated images as training dataset supplements. This work introduces and summarizes deeplenstronomy, an open-source Python package that enables efficient, large-scale, and reproducible simulation of images of astronomical systems. A full suite of unit tests, documentation, and example notebooks are available at https://deepskies.github.io/deeplenstronomy/ .

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2018

Automated generation and ensemble-learned matching of X-ray absorption spectra

X-ray absorption spectroscopy (XAS) is a widely used materials characterization technique to determine oxidation states, coordination environment, and other local atomic structure information. Analysis of XAS relies on comparison of measured spectra to reliable reference spectra. However, existing databases of XAS spectra are highly limited both in terms of the number of reference spectra available as well as the breadth of chemistry coverage. In this work, we report the development of XASdb, a large database of computed reference XAS, and an Ensemble-Learned Spectra IdEntification (ELSIE) algorithm for the matching of spectra. XASdb currently hosts more than 800,000 K-edge X-ray absorption near-edge spectra (XANES) for over 40,000 materials from the open-science Materials Project database. We discuss a high-throughput automation framework for FEFF calculations, built on robust, rigorously benchmarked parameters. FEFF is a computer program uses a real-space Green’s function approach to calculate X-ray absorption spectra. Here, we will demonstrate that the ELSIE algorithm, which combines 33 weak “learners” comprising a set of preprocessing steps and a similarity metric, can achieve up to 84.2% accuracy in identifying the correct oxidation state and coordination environment of a test set of 19 K-edge XANES spectra encompassing a diverse range of chemistries and crystal structures. The XASdb with the ELSIE algorithm has been integrated into a web application in the Materials Project, providing an important new public resource for the analysis of XAS to all materials researchers. Finally, the ELSIE algorithm itself has been made available as part of veidt, an open source machine-learning library for materials science.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2014

Machine Learning Toolkit for Extreme Scale

Support Vector Machines (SVM) is a popular machine learning technique, which has been applied to a wide range of domains such as science, finance, and social networks for supervised learning. MaTEx undertakes the challenge of designing a scalable parallel SVM training algorithm for large scale systems, which includes commodity multi-core machines, tightly connected supercomputers and cloud computing systems. Several techniques are proposed for improved speed and memory space usage including adaptive and aggressive elimination of samples for faster convergence , and sparse format representation of data samples. Several heuristics for earliest possible to lazy elimination of non-contributing samples are considered in MaTEx. In many cases, where an early sample elimination might result in a false positive, low overhead mechanisms for reconstruction of key data structures are proposed. The proposed algorithm and heuristics are implemented and evaluated on various publicly available datasets

Source record↗

DOE OSTI2014

Machine Learning Toolkit for Extreme Scale

Source record↗