Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “machining”

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,711 records · Page 95
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Machine learning for molecular dynamics with strongly correlated electrons

We use machine learning to enable large-scale molecular dynamics (MD) of a correlated electron model under the Gutzwiller approximation scheme. This model exhibits a Mott transition as a function of on-site Coulomb repulsion U . The repeated solution of the Gutzwiller self-consistency equations would be prohibitively expensive for large-scale MD simulations. We show that machine learning models of the Gutzwiller potential energy can be remarkably accurate. The models, which are trained with N = 33 atoms, enable highly accurate MD simulations at much larger scales ( N ≳10 3 ). Here, we investigate the physics of the smooth Mott crossover in the fluid phase.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Characterizing different motility-induced regimes in active matter with machine learning and noise

Here we examine motility-induced phase separation (MIPS) in two-dimensional run-and-tumble disk systems using both machine learning and noise fluctuation analysis. Our measures suggest that within the MIPS state there are several distinct regimes as a function of density and run time, so that systems with MIPS transitions exhibit an active fluid, an active crystal, and a critical regime. The different regimes can be detected by combining an order parameter extracted from principal component analysis with a cluster stability measurement. The principal component-derived order parameter is maximized in the critical regime, remains low in the active fluid, and has an intermediate value in the active crystal regime. We demonstrate that machine learning can better capture dynamical properties of the MIPS regimes compared to more standard structural measures such as the maximum cluster size. The different regimes can also be characterized via changes in the noise power of the fluctuations in the average speed. In the critical regime, the noise power passes through a maximum and has a broad spectrum with a 1/f 1.6 signature, similar to the noise observed near depinning transitions or for solids undergoing plastic deformation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Time-Resolved Line Shapes of Single Quantum Emitters via Machine Learned Photon Correlations

Solid-state single-photon emitters (SPEs) are quantum light sources that combine atomlike optical properties with solid-state integration and fabrication capabilities. SPEs are hindered by spectral diffusion, where the emitter’s surrounding environment induces random energy fluctuations. Timescales of spectral diffusion span nanoseconds to minutes and require probing single emitters to remove ensemble averaging. Photon correlation Fourier spectroscopy (PCFS) can be used to measure time-resolved single emitter line shapes, but is hindered by poor signal-to-noise ratio in the measured correlation functions at early times due to low photon counts. Here, we develop a framework to simulate PCFS correlation functions directly from diffusing spectra that match well with experimental data for single colloidal quantum dots. We use these simulated datasets to train a deep ensemble autoencoder machine learning model that outputs accurate, noiseless, and probabilistic reconstructions of the noisy correlations. Using this model, we obtain reconstructed time-resolved single dot emission line shapes at timescales as low as 10 ns, which are otherwise completely obscured by noise. This enables PCFS to extract optical coherence times on the same timescales as Hong-Ou-Mandel two-photon interference, but with the advantage of providing spectral information in addition to estimates of photon indistinguishability. Further, our machine learning approach is broadly applicable to different photon correlation spectroscopy techniques and SPE systems, offering an enhanced tool for probing single emitter line shapes on previously inaccessible timescales.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2024

Machine learning-accelerated discovery of iron cobalt phosphides as rare-earth-free magnets

Here, the discovery of rare-earth-free permanent magnets has been a goal of scientists for decades. The absence of rare-earth elements will alleviate a pressing concern about the availability of rare-earth elements used in permanent magnets. These magnets are crucial for applications such as wind turbines, electric cars, and memory devices. Rare-earth magnets are special owing to a large magnetic anisotropy energy (K 1 ). In contrast, iron cobalt phosphides hold promise since doping P into cubic FeCo can induce anisotropy, leading to a large coercivity, without introducing rare-earth elements. We present a comprehensive search over the Fe-Co-P ternary space for magnets, utilizing recently developed adaptive machine learning feedback to efficiently screen over 850 000 structures. We focus on machine learning acceleration as a paradigm for materials design. Further adaptive genetic algorithm searches and first-principles calculations aid in the identification of 16 new structures below the known convex hull. Five of them possess high magnetic polarization (J s > 1 T). The structures with desirable magnetic properties center on (Fe,Co) 2⁢ P. This supports conventional wisdom, which focuses on the mixture of the two known end compounds: Fe 2 ⁢P and Co 2 ⁢P. Our work provides guidance for synthesis. We find Fe 7 ⁢CoP 4 shows the most promise (J s = 1.03T and K 1 = 0.83MJ/m 3 ).

36 MATERIALS SCIENCE↗
DOE OSTI2024

Dynamical simulation via quantum machine learning with provable generalization

Much attention has been paid to dynamical simulation and quantum machine learning (QML) independently as applications for quantum advantage, while the possibility of using QML to enhance dynamical simulations has not been thoroughly investigated. Here we develop a framework for using QML methods to simulate quantum dynamics on near-term quantum hardware. We use generalization bounds, which bound the error a machine learning model makes on unseen data, to rigorously analyze the training data requirements of an algorithm within this framework. Our algorithm is thus resource efficient in terms of qubit and data requirements. Furthermore, our preliminary numerics for the XY model exhibit efficient scaling with problem size, and we simulate 20 times longer than Trotterization on IBMQ-Bogota. Published by the American Physical Society 2024

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Quantifying uncertainty in machine learning for nuclear binding energy

Techniques from artificial intelligence and machine learning are increasingly employed in nuclear theory; however, the uncertainties that arise from the complex parameter manifold encoded by the neural networks are often overlooked. Epistemic uncertainties arising from training the same network multiple times for an ensemble of initial weight sets offer a first insight into the confidence of machine learning predictions, but they often come with a high computational cost. Instead, we apply a single-model uncertainty quantification method called Δ-UQ that gives epistemic uncertainties with one-time training. Here, we demonstrate our approach on a two-feature model of nuclear binding energies per nucleon with proton and neutron number pairs as inputs. We show that Δ-UQ can produce reliable and self-consistent epistemic uncertainty estimates and can be used to assess the degree of confidence in predictions made with deep neural networks.

Huang, Mengyao [Lawrence Livermore National Labora↗
DOE OSTI2014

Elements in nucleotide sensing and hydrolysis of the AAA+ disaggregation machine ClpB: a structure-based mechanistic dissection of a molecular motor

High-resolution crystal structures together with mutational analysis and transient kinetics experiments were utilized to understand nucleotide sensing and the regulation of the ATPase cycle in an AAA+ molecular motor. ATPases of the AAA+ superfamily are large oligomeric molecular machines that remodel their substrates by converting the energy from ATP hydrolysis into mechanical force. This study focuses on the molecular chaperone ClpB, the bacterial homologue of Hsp104, which reactivates aggregated proteins under cellular stress conditions. Based on high-resolution crystal structures in different nucleotide states, mutational analysis and nucleotide-binding kinetics experiments, the ATPase cycle of the C-terminal nucleotide-binding domain (NBD2), one of the motor subunits of this AAA+ disaggregation machine, is dissected mechanistically. The results provide insights into nucleotide sensing, explaining how the conserved sensor 2 motif contributes to the discrimination between ADP and ATP binding. Furthermore, the role of a conserved active-site arginine (Arg621), which controls binding of the essential Mg{sup 2+} ion, is described. Finally, a hypothesis is presented as to how the ATPase activity is regulated by a conformational switch that involves the essential Walker A lysine. In the proposed model, an unusual side-chain conformation of this highly conserved residue stabilizes a catalytically inactive state, thereby avoiding unnecessary ATP hydrolysis.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Integrating machine learning interatomic potentials with hybrid reverse Monte Carlo structure refinements in RMCProfile

Structure refinement with reverse Monte Carlo (RMC) is a powerful tool for interpreting experimental diffraction data. To ensure that the under-constrained RMC algorithm yields reasonable results, the hybrid RMC approach applies interatomic potentials to obtain solutions that are both physically sensible and in agreement with experiment. To expand the range of materials that can be studied with hybrid RMC, we have implemented a new interatomic potential constraint in RMCProfile that grants flexibility to apply potentials supported by the Large-scale Atomic/Molecular Massively Parallel Simulator ( LAMMPS ) molecular dynamics code. This includes machine learning interatomic potentials, which provide a pathway to applying hybrid RMC to materials without currently available interatomic potentials. To this end, we present a methodology to use RMC to train machine learning interatomic potentials for hybrid RMC applications.

Cuillier, Paul↗
DOE OSTI2015

Fast and Accurate Support Vector Machines on Large Scale Systems

Support Vector Machines (SVM) is a supervised Machine Learning and Data Mining (MLDM) algorithm, which has become ubiquitous largely due to its high accuracy and obliviousness to dimensionality. The objective of SVM is to find an optimal boundary --- also known as hyperplane --- which separates the samples (examples in a dataset) of different classes by a maximum margin. Usually, very few samples contribute to the definition of the boundary. However, existing parallel algorithms use the entire dataset for finding the boundary, which is sub-optimal for performance reasons. In this paper, we propose a novel distributed memory algorithm to eliminate the samples which do not contribute to the boundary definition in SVM. We propose several heuristics, which range from early (aggressive) to late (conservative) elimination of the samples, such that the overall time for generating the boundary is reduced considerably. In a few cases, a sample may be eliminated (shrunk) pre-emptively --- potentially resulting in an incorrect boundary. We propose a scalable approach to synchronize the necessary data structures such that the proposed algorithm maintains its accuracy. We consider the necessary trade-offs of single/multiple synchronization using in-depth time-space complexity analysis. We implement the proposed algorithm using MPI and compare it with libsvm--- de facto sequential SVM software --- which we enhance with OpenMP for multi-core/many-core parallelism. Our proposed approach shows excellent efficiency using up to 4096 processes on several large datasets such as UCI HIGGS Boson dataset and Offending URL dataset.

Vishnu, Abhinav↗
DOE OSTI2017

MACORD: Online Adaptive Machine Learning Framework for Silent Error Detection

Future HPC systems with ever-increasing resource capacity (such as compute cores, memory and storage) may significantly increase the risks on reliability. Silent data corruptions (SDCs) or silent errors are one of the major sources that corrupt HPC execution results. Unlike fail-stop errors, SDCs are rather harmful and dangerous in that they cannot be detected by hardware. We propose an online machine-learning based silent data corruption detection framework (abbreviated as MACORD) for detecting SDCs in HPC applications. In particular, we comprehensively investigate the prediction ability of a multitude of machine-learning algorithms in our study, and enable the detector to automatically select the best-fit algorithms at runtime to adapt to the data dynamics. Our learning framework exhibits low memory overhead (less than 1%), since it takes only spatial features (i.e., neighboring data values for each data point in the current time step) into the training data. Experiments based on real-world scientific applications/benchmarks show that our framework can get the detection sensitivity (i.e., recall) up to 99% while the false positive rate is limited to 0.1% in most cases, which is one order of magnitude improvement compared with the latest state-of-art spatial technique.

Subasi, Omer↗
DOE OSTI2018

Machine Learning Models for GPU Error Prediction in a Large Scale HPC System

GPUs are widely deployed on large-scale HPC systems to provide powerful computational capability for scientific applications from various domains. As those applications are normally long-running, investigating the characteristics of GPU errors becomes imperative for reliability. In this paper, we first study the system conditions that trigger GPU errors using six-month trace data collected from a large-scale, operational HPC system. Then, we use machine learning to predict the occurrence of GPU errors, by taking advantage of temporal and spatial dependencies of the trace data. The resulting machine learning prediction framework is robust and accurate under different workloads.

Nie, Bin↗
DOE OSTI2021

Automated Generation of Integrated Digital and Spiking Neuromorphic Machine Learning Accelerators

The growing numbers of application areas for artificial intelligence (AI) methods have led to an explosion of domain-specific accelerators that could support every new machine learning (ML) algorithm advancement, clearly highlighting the need for a capability to quickly and automatically transition from algorithm definition to hardware implementation and explore design space along a variety of SWaP (size, weight and Power). The software defined architectures (SODA) synthesizer implements a compiler-based modular infrastructure for the end-to-end generation of machine learning accelerators from high-level frameworks to hardware description language. At the same time, neuromorphic computing, by mimicking how the brain operates, promises to perform artificial intelligence tasks at efficiencies orders of magnitude higher than the current conventional tensor-processing based accelerators, as demonstrated by a variety of specialized designs leveraging Spiking Neural Networks (SNNs). Nevertheless, the mapping of an artificial neural network (ANN) to solutions supporting SNNs is still a non-trivial and very device-specific task, and completely lack the possibility to design hybrid systems that integrate conventional and spiking neural models. In this paper we discuss the support for such an integrated generation leveraging the SODA Synthesizer framework and its modular structure. In particular, we present a new MLIR dialect (part of the SODA frontend) that allows expressing spiking neural network features (e.g., available resources, spiking sequences, analog signal reading, etc.) and illustrate how it enables mapping to Spiking Neurons and deployment to the related specialized hardware (which, in the digital domain, could be generated through the other existing layers of the SODA Synthesizer). We then discuss the opportunities for even deeper integration afforded by the hardware compilation infrastructure, providing a path towards the generation of complex heterogeneous artificial intelligence systems.

Curzel, Serena↗
DOE OSTI2021

Discriminating Quantum States with Quantum Machine Learning

Quantum machine learning (QML) algorithms have obtained great relevance in the machine learning (ML) field due to the promise of quantum speedups when performing basic linear algebra subroutines (BLAS), a fundamental element in most ML algorithms. By making use of BLAS operations, we propose, implement and analyze a quantum k-means (qk-means) algorithm with a low time complexity of O(NKlog(D)I/C) to apply it to the fundamental problem of discriminating quantum states at readout. Discriminating quantum states allows the identification of quantum states |0⟩ and |1⟩ from low-level in-phase and quadrature signal (IQ) data, and can be done using custom ML models. In order to reduce dependency on a classical computer, we use the qk-means to perform state discrimination on the IBMQ Bogota device and managed to find assignment fidelities of up to 98.7% that were only marginally lower than that of the k-means algorithm. We also performed a cross-talk benchmark on the quantum device by applying both algorithms to perform state discrimination on a combination of quantum states and using Pearson Correlation coefficients and assignment fidelities of discrimination results to conclude on the presence of cross-talk on qubits. Evidence shows cross-talk in the (1, 2) and (2, 3) neighboring qubit couples for the analyzed device.

Quiroga, David↗
DOE OSTI2025

Electromagnetic Modeling of Lattice Structures in Additively Manufactured Electric Machines

Recent advancements in metal additive manufacturing (AM) show great potential to revolutionize the design and manufacturing of electromagnetic components used in the field of electrical engineering. Lattice structures directly printed by AM processes typically offer better structural performance with reduced weight, such as high stiffness, surface area, elongation, energy absorption, and porosity, than the solid counterpart. This paper aims to study the electromagnetic modeling of lattice structures used in additively manufactured magnetic cores or windings for electric machines. Three dimensional (3D) electromagnetic finite element (FE) analysis with high performance computing (HPC) shows the highest fidelity in predicting the electromagnetic performance of designs with lattice structures by preserving complex geometry details. FE-based homogenization methods have also been explored to potentially speed up concept design. A case study based on an additively manufactured axial-flux permanent magnet machine with a Hilbert pattern stator validates the discussed electromagnetic modeling approaches.

Chung, Shi-Uk [ANSYS, Inc.]↗
DOE OSTI2018

A Comparison of Machine Learning Techniques to Extract Human Settlements from High Resolution Imagery

Two machine learning techniques were developed to extract human settlements from very high resolution (VHR) satellite images of 3 provinces in Afghanistan: Logar, Panjsher, and Wardak. The results were then compared with analyst verified reference data information known as the LandScan Settlement Layer (LandScan SL).[1] This study attempts to compare settlement mapping results from a support vector machine (SVM) classifier specifically integrated in a current settlement mapping framework and a deep learner utilizing a convolutional neural network (CNN) approach. By comparing the results from the SVM and the CNN to the reference data information we demonstrate that the CNN yields more accurate results overall, in terms of overall pixel cells, and the SVM performs more accurately in omission, based on derived statistics against the reference data information.

Weaver, Jeanette E↗
DOE OSTI2019

Intelligent Reservoir Generation for Liquid State Machines using Evolutionary Optimization

Neuromorphic Computing is a burgeoning field of research. Many groups are exploring hardware architectures and theoretical ideas about spiking recurrent neural networks. The overarching goal is to exploit the low power promise of these neuromorphic systems. However, it is difficult to train spiking recurrent neural networks (SRNNs) to perform tasks and make efficient use of neuromorphic hardware. Reservoir Computing is an attractive methodology because it requires no tuning of weights for the reservoir itself. Yet, to find optimal reservoirs, manual tuning of hyperparameters such as hidden neurons, synaptic density, and natural structure is still required. Because of this, researchers often have to generate and evaluate many networks, which can result in non-trivial amounts of computation. This paper employs the reservoir computing technique (specifically liquid state machines) and genetic algorithms in order to develop useful networks that can be deployed on neuromorphic hardware. We build on past work in reservoir computing and genetic algorithms to demonstrate the power of combining these two techniques and the advantage it can provide over manually tuning reservoirs for use on classification tasks. We discuss the complexities of determining whether or not to use the genetic algorithms approach for liquid state machine generation.

Reynolds, John↗
DOE OSTI2021

Interpreting Write Performance of Supercomputer I/O Systems with Regression Models

This work seeks to advance the state of the art in HPC I/O performance analysis and interpretation. In particular, we demonstrate effective techniques to: (1) model output performance in the presence of I/O interference from production loads; (2) build features from write patterns and key parameters of the system architecture and configurations; (3) employ suitable machine learning algorithms to improve model accuracy. We train models with five popular regression algorithms and conduct experiments on two distinct production HPC platforms. We find that the lasso and random forest models predict output performance with high accuracy on both of the target systems. We also explore use of the models to guide adaptation in I/O middleware systems, and show potential for improvements of at least 15% from model-guided adaptation on 70% of samples, and improvements up to 10× on some samples for both of the target systems.

Xie, Bing↗
DOE OSTI2026

A Unified Scaling Framework for Comparative Analysis of Major Electrical Machine Topologies

This paper presents a unified framework for comparing major electrical machine topologies under identical output and thermal constraints, with emphasis on supply-chain-aware selection among rare-earth-intensive, reduced-rare-earth, and rare-earth-free solutions. Using power factor and air-gap flux density as the principal descriptors, the framework links topology choice to relative size, copper demand, magnet dependence, cost sensitivity, and inertia. To support robust early-stage screening, the deterministic scaling model is combined with uncertainty representation, Monte Carlo scenario propagation, and hesitationaware ranking. The results show that rare-earth-rich machines remain compact and dense, whereas reduced-rare-earth and rare-earth-free alternatives become more attractive under specific material-risk and cost scenarios.

Kumar, Praveen [ORNL] (ORCID:0000000291877857)↗