Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithm testing”

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 811 records · Page 45
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Signal Processing Based Method for Real-Time Anomaly Detection in High-Performance Computing

Performance anomalies can manifest as irregular execution times or abnormal execution events for many reasons, including network congestion and resource contention. Detecting such anomalies in real-time by analyzing the details of performance traces at scale is impractical due to the sheer volume of data High-Performance Computing (HPC) applications produce. In this paper, we propose formulating HPC performance anomaly detection as a signal-processing problem where anomalies can be treated as noise. We evaluate our proposed method in comparison with two other commonly used anomaly detection techniques of varying complexity based on their detection accuracy and scalability. Since real-time in-situ anomaly detection at a large scale requires lightweight methods that can handle a large volume of streaming data, we find that our proposed method provides the best trade-off. We then implement the proposed method in Chimbuko, the first online, distributed, and scalable workflow-level performance trace analysis framework. We compare our proposed signal-based anomaly detection algorithm with two other methods using a function of their accuracy, F1 score, and detection overhead. Our experiments demonstrate that our proposed approach achieves a 99% improvement for the benchmark datasets and a 93% improvement with Chimbuko traces.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2021

A data-driven peridynamic continuum model for upscaling molecular dynamics

Nonlocal models, including peridynamics, often use integral operators that embed lengthscales in their definition. However, the integrands in these operators are difficult to define from the data that are typically available for a given physical system, such as laboratory mechanical property tests. In contrast, molecular dynamics (MD) does not require these integrands, but it suffers from computational limitations in the length and time scales it can address. To combine the strengths of both methods and to obtain a coarse-grained, homogenized continuum model that efficiently and accurately captures materials’ behavior, we propose a learning framework to extract, from MD data, an optimal Linear Peridynamic Solid (LPS) model as a surrogate for MD displacements. To maximize the accuracy of the learnt model we allow the peridynamic influence function to be partially negative, while preserving the well-posedness of the resulting model. To achieve this, we provide sufficient well-posedness conditions for discretized LPS models with sign-changing influence functions and develop a constrained optimization algorithm that minimizes the equation residual while enforcing such solvability conditions. This framework guarantees that the resulting model is mathematically well-posed, physically consistent, and that it generalizes well to settings that are different from the ones used during training. We illustrate the efficacy of the proposed approach with several numerical tests for single layer graphene. Our two-dimensional tests show the robustness of the proposed algorithm on validation data sets that include thermal noise, different domain shapes and external loadings, and discretizations substantially different from the ones used for training.

homogenization↗
DOE OSTI2020

The XtalOpt Evolutionary Algorithm for Crystal Structure Prediction

Significant progress has been made in the field of a priori crystal structure prediction, with a number of recent remarkable success stories. Herein, we briefly outline the methods that have been developed for finding the global minimum structure and interesting local minima without the need for experimental information. Focus is placed on describing the XTALOPT evolutionary algorithm (EA) developed in our group towards this end. XTALOPT is published under well-known open-source licenses, and the EA searches can be analyzed via the AVOGADRO chemical editor and visualizer. We describe new algorithmic developments that have made it possible to predict the structures of ever-more complex crystalline lattices. Benchmark tests, which clearly illustrate how the new developments improve the success rate and accelerate the discovery of the global minimum structure, are carried out. Lastly, we describe how XTALOPT has been employed to predict novel ternary hydrides that have the propensity for high-temperature superconductivity under pressure.

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

Performance Evaluation of Distributed Energy Resource Management Algorithm in Large Distribution Networks

This paper presents performance evaluation of hierarchical optimization and control for distributed energy resource management system (DERMS) in large distribution networks via an advanced hardware-in-the-loop (HIL) platform. The HIL platform provides realistic testing in a laboratory environment, including the accurate modeling of a full-scale distribution system of 11,000 nodes, the DERMS software controller, and 90 power hardware photovoltaics (PVs) and battery inverters. The applied DERMS algorithm is designed based on a realtime optimal power flow algorithm and implemented with acceleration design that performs fast dispatch of simulated PVs and real physical hardware DER devices every 4 seconds.

DERMS↗
DOE OSTI2020

Quantitative assessment of distant recurrence risk in early stage breast cancer using a nonlinear combination of pathological, clinical and imaging variables

Abstract Use of genomic assays to determine distant recurrence risk in patients with early stage breast cancer has expanded and is now included in the American Joint Committee on Cancer staging manual. Algorithmic alternatives using standard clinical and pathology information may provide equivalent benefit in settings where genomic tests, such as OncotypeDx, are unavailable. We developed an artificial neural network (ANN) model to nonlinearly estimate risk of distant cancer recurrence. In addition to clinical and pathological variables, we enhanced our model using intraoperatively determined global mammographic breast density (MBD) and local breast density (LBD). LBD was measured with optical spectral imaging capable of sensing regional concentrations of tissue constituents. A cohort of 56 ER+ patients with an OncotypeDx score was evaluated. We demonstrated that combining MBD/LBD measurements with clinical and pathological variables improves distant recurrence risk prediction accuracy, with high correlation ( r = 0.98) to the OncotypeDx recurrence score.

Nichols, Brandon S.↗
DOE OSTI2021

Efficient quadrature rules for finite element discretizations of nonlocal equations

Here, in this paper, we design efficient quadrature rules for finite element (FE) discretizations of nonlocal diffusion problems with compactly supported kernel functions. Two of the main challenges in nonlocal modeling and simulations are the prohibitive computational cost and the nontrivial implementation of discretization schemes, especially in three-dimensional settings. In this work, we circumvent both challenges by introducing a parametrized mollifying function that improves the regularity of the integrand, utilizing an adaptive integration technique, and exploiting parallelization. We first show that the “mollified” solution converges to the exact one as the mollifying parameter vanishes, then we illustrate the consistency and accuracy of the proposed method on several two- and three-dimensional test cases. Furthermore, we demonstrate the good scaling properties of the parallel implementation of the adaptive algorithm and we compare the proposed method with recently developed techniques for efficient FE assembly.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Toward Discord : Code for Simulating Continuous Spin Systems

A new computational tool to simulate classical spin systems with frustrated crystal structures is presented. Complementary single- and cluster-spin flip algorithms are implemented to calculate the diffuse scattering patterns, spin-pair correlations, and thermodynamic quantities. Test cases of geometrically frustrated kagome, pyrochlore, and cubic systems are detailed. Two recent scientific cases are also shown here. This new method, together with recent developments of the rmc-discord package (https://github.com/zjmorgan/rmc-discord), represent integrated and strategic step in a complete forward and reverse Monte Carlo framework discord.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Invertible neural networks for real-time control of extrusion additive manufacturing

Material extrusion additive manufacturing (AM) has enabled an elegant fabrication pathway for a vast material library. Nonetheless, each material requires optimization of printing parameters generally determined through significant trial-and-error testing. To eliminate arduous, iteration-based optimization approaches, many researchers have used machine learning (ML) algorithms which provide opportunities for automated process optimization. Here, in this work, we demonstrate the use of an ML-driven approach for real-time material extrusion print-parameter optimization through in-situ monitoring of printed line geometry. To do this, we use deep invertible neural networks (INNs) which can solve both forward and inverse, or optimization, problems using a single network. By combining in-situ computer vision and deep INNs, the printing parameters can be autonomously optimized to print a target line width in 1.2 s. Furthermore, defects that occur during printing can be rapidly identified and corrected autonomously. The methods developed and presented in this work eliminate user-intensive, time-consuming, and iterative parameter discovery approaches that currently limit accelerated implementation of extrusion-based AM processes. Furthermore, the presented approach can be generalized to provide real-time monitoring and optimization pathways for increasingly complex AM environments.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Generating realistic building electrical load profiles through the Generative Adversarial Network (GAN)

Building electrical load profiles can improve understanding of building energy efficiency, demand flexibility, and building-grid interactions. Current approaches to generating load profiles are time-consuming and not capable of reflecting the dynamic and stochastic behaviors of real buildings; some approaches also trigger data privacy concerns. In this study, we proposed a novel approach for generating realistic electrical load profiles of buildings through the Generative Adversarial Network (GAN), a machine learning technique that is capable of revealing an unknown probability distribution purely from data. The proposed approach has three main steps: (1) normalizing the daily 24-hour load profiles, (2) clustering the daily load profiles with the k-means algorithm, and (3) using GAN to generate daily load profiles for each cluster. The approach was tested with an open-source database – the Building Data Genome Project. We validated the proposed method by comparing the mean, standard deviation, and distribution of key parameters of the generated load profiles with those of the real ones. The KL divergence of the generated and real load profiles are within 0.3 for majority of parameters and clusters. Additionally, results showed the load profiles generated by GAN can capture not only the general trend but also the random variations of the actual electrical loads in buildings. We report the proposed GAN approach can be used to generate building electrical load profiles, verify other load profile generation models, detect changes to load profiles, and more importantly, anonymize smart meter data for sharing, to support research and applications of grid-interactive efficient buildings.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2021

Bayesian sparse learning with preconditioned stochastic gradient MCMC and its applications

Deep neural networks have been successfully employed in an extensive variety of research areas, including solving partial differential equations. Despite its significant success, there are some challenges in effectively training DNN, such as avoiding overfitting in over-parameterized DNNs and accelerating the optimization in DNNs with pathological curvature. Here, we propose a Bayesian type sparse deep learning algorithm. The algorithm utilizes a set of spike-and-slab priors for the parameters in the deep neural network. The hierarchical Bayesian mixture will be trained using an adaptive empirical method. That is, one will alternatively sample from the posterior using preconditioned stochastic gradient Langevin Dynamics (PSGLD), and optimize the latent variables via stochastic approximation. The sparsity of the network is achieved while optimizing the hyperparameters with adaptive searching and penalizing. A popular SG-MCMC approach is Stochastic gradient Langevin dynamics (SGLD). However, considering the complex geometry in the model parameter space in nonconvex learning, updating parameters using a universal step size in each component as in SGLD may cause slow mixing. To address this issue, we apply a computationally manageable preconditioner in the updating rule, which provides a step-size parameter to adapt to local geometric properties. Moreover, by smoothly optimizing the hyperparameter in the preconditioning matrix, our proposed algorithm ensures a decreasing bias, which is introduced by ignoring the correction term in the preconditioned SGLD. According to the existing theoretical framework, we show that the proposed algorithm can asymptotically converge to the correct distribution with a controllable bias under mild conditions. Numerical tests are performed on both synthetic regression problems and learning solutions of elliptic PDE, which demonstrate the accuracy and efficiency of the present work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Dynamical tuning of the chemical potential to achieve a target particle number in grand canonical Monte Carlo simulations

We present a method to facilitate Monte Carlo simulations in the grand canonical ensemble given a target mean particle number. The method imposes a fictitious dynamics on the chemical potential, to be run concurrently with the Monte Carlo sampling of the physical system. Corrections to the chemical potential are made according to time-averaged estimates of the mean and variance of the particle number, with the latter being proportional to thermodynamic compressibility. Here, we perform a variety of tests, and in all cases find rapid convergence of the chemical potential—inexactness of the tuning algorithm contributes only a minor part of the total measurement error for realistic simulations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Enhancing Photosynthesis Simulation Performance in ESMs with Machine Learning-Assisted Solvers

When simulating vegetation dynamics, photosynthesis accounts for a large fraction of the computational cost in most Earth System Models (ESMs). This is largely since photosynthesis is represented as a system of nonlinear equations, and the solution requires the use of an initial guess followed by many iterations of the numerical solver to obtain a solution. We use machine learning (ML) to replicate the response surface of the model’s numerical solver to improve the choice of initial guess, therefore requiring fewer iterations to obtain a final solution. We implemented this test on the leaf-level calculations as well as at the canopy scale, and for both we observed fewer iterations of the photosynthesis solver when a ML-based initial guess was implemented. The model tested here is the Energy Exascale Earth System Model - Land Model (ELM). The ML-based algorithms used here are trained on simulations from the model itself and used only to improve the initial guess for the solver; therefore, the model maintains its own set of physics to obtain the final solution. This work shows novel ways to utilize ML-based methods to improve the performance of numerical solvers in ESMs.

Massoud, Elias [ORNL] (ORCID:0000000217725361)↗
DOE OSTI2020

A Machine Learning Approach to the Detection of Ghosting Artifacts in Dark Energy Survey Images

Unwanted artifacts that often plague astronomical images arise from a number of sources that include imperfect optics, faulty image sensors, cosmic ray hits, and even airplanes and satellites. One major source that is dicult to avoid is known as ghosting, and is caused by the scattering and internal reflections of light o of the telescope’s mechanical and optical components. Detecting ghosting artifacts eciently in the large cosmological surveys that will acquire petabytes of data can be a daunting task. In this paper, we use data from the Dark Energy Survey to develop, train, and validate a machine learning model to detect ghosts based on convolutional neural networks. The model architecture and training procedure is discussed in detail, and the performance on the training and validation set presented. Testing is performed on data and results are compared with those from a ray-tracing algorithm. A proof-of-principle is demonstrated that shows promise for Stage IV surveys and beyond.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Efficient quadrature rules for finite element discretizations of nonlocal equations

In this paper we design efficient quadrature rules for finite element discretizations of nonlocal diffusion problems with compactly supported kernel functions. Two of the main challenges in nonlocal modeling and simulations are the prohibitive computational cost and the nontrivial implementation of discretization schemes, especially in three-dimensional settings. In this work we circumvent both challenges by introducing a parametrized mollifying function that improves the regularity of the integrand, utilizing an adaptive integration technique, and exploiting parallelization. We first showthat the “mollified” solution converges to the exact one as the mollifying parameter vanishes, then we illustrate the consistency and accuracy of the proposed method on several two- and three-dimensional test cases. Furthermore, we demonstrate the good scaling properties of the parallel implementation of the adaptive algorithm and we compare the proposed method with recently developed techniques for efficient finite element assembly.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

NgramPPM: Compression Analytics without Compression

Arithmetic Coding (AC) using Prediction by Partial Matching (PPM) is a compression algorithm that can be used as a machine learning algorithm. This paper describes a new algorithm, NGram PPM. NGram PPM has all the predictive power of AC/PPM, but at a fraction of the computational cost. Unlike compression-based analytics, it is also amenable to a vector space interpretation, which creates the ability for integration with other traditional machine learning algorithms. AC/PPM is reviewed, including its application to machine learning. Then NGram PPM is described and test results are presented, comparing them to AC/PPM.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Diagnostic and predictive capabilities of the TCR digital platform

The Transformational Challenge Reactor program is leveraging additive manufacturing technologies to fabricate the nuclear components required to assemble a microreactor core. Compared with traditional manufacturing processes, additive manufacturing allows for direct observation of the interior of the component during manufacturing. This unique capability promises significant possibilities for creating a new paradigm for nuclear component qualification by leveraging in-situ process data. This report describes FY21 efforts to predict material tensile properties based on data collected during the laser powder bed fusion printing process. The primary focus of this report is the test campaign designed to generate the large quantities of training data required to implement artificial intelligence algorithms that can predict these material properties. Preliminary prediction results and a demonstration of the overall data collection, analysis, and visualization pipeline are also provided.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2023

Explainable Artificial Intelligence Technology for Predictive Maintenance

The domestic nuclear power plant fleet has relied on labor-intensive and time-consuming preventive maintenance programs, thus driving up operation and maintenance costs to achieve high-capacity factors. Artificial intelligence and machine learning can help simplify complex problems, such as diagnosing equipment degradation, to enable more effective decision-making. Benefits will be felt not only within existing analog and digital instrumentation and control, but also work processes, the integration of people with technology, and most importantly, the business case. Together, these hold promise to make nuclear power more efficient and reduce costs associated with operation and maintenance. While the artificial intelligence and machine learning technologies hold significant promise in the nuclear industry, there are challenges or barriers to their adoption. This report outlines the those different machine learning adoption barriers (categorized as historical, technical, economic, regulatory, and user) that the industry must overcome to realize the full benefits of artificial intelligence and machine learning capabilities for long-term economic sustainability. This report also provides solutions for some of these barriers by focusing on improving the explainability of machine learning to encourage trust from the end-user. Trust and explainability are essential to machine learning adoption. This report focuses on research-developed solutions to some of these barriers while analyzing a non-safety-related system, namely the circulating water system. This system frequently experiences waterbox fouling which our models preemptively diagnoses then explains to the operator how those conclusions were reached. This report presents and discusses the inherent trade-off between machine learning performance (in terms of accuracy) and explainability, where highly accurate machine learning methods (such as deep-learning) are the least explainable, and the most explainable methods (such as decision trees) are the least accurate. In addition, explainability of artificial intelligence techniques in terms of transparency and post-hoc metrics are discussed. This report outlines the importance of data novelty and value of new information in evaluating both the explainability and trustworthiness. Novelty detection helps to establish consistency or inconsistency of the new data with respect to the training data. On the other hand, value of information could be a part of the user-centric visualization recommendation system that request additional information to be collected, thereby strengthening the machine learning outcomes. During this project, a copyrighted user-centric visualization that aligns with a human-in-the-loop approach was developed. The user-centric visualization presents different levels of information and can be tailored as per user credentials to gain user confidence. One of the salient features of the user-centric visualization is it presents machine learning methods with explainability metrics. A simplified version of the user-centric visualization was presented to 32 users with varying levels of machine learning expertise. Feedback was solicited to test the hypothesis that the app contained sufficient explainability and that the users would trust the algorithm. Overall, the app was positively received, and the hypothesis was supported. This report discusses the trust-but-verify framework – a potential approach to build user trust artificial intelligence. The framework discusses trust from the human level to artificial intelligence level. The fundamental premise of the trust but verify framework is derived from an observation of nuclear safety culture (i.e., nuclear power plant personnel do not rely on a singular source of data to make a decision). This also ties back to the user-centric visualization that presents different levels of information to achieve both explainability and trustworthiness of artificial intelligence. Even so, the adoption of artificial intelligence and machine learning in the nuclear industry faces additional barriers, namely regulatory and stakeholder readiness. To overcome these challenges, new solutions must gain regulatory approval and cater to stakeholder needs. The Nuclear Regulatory Committee has a 5-year strategic plan which prepares them for reviewing artificial intelligence technologies in licensee submissions. Early and frequent engagement with the regulator is encouraged. Additionally, artificial intelligence solutions should incorporate human-in-the-loop considerations and offer explainability. Stakeholders must prepare by hiring or training staff to adapt to advancing technology in everyday plant tasks.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

300_underground robot (final research report)

Recent advancements in mobile robotics have displayed impressive capabilities in traversing and accessing areas that are inaccessible to humans either due to the characteristics of the environment or potential hazards. Furthermore, these advancements within the field of mobile robotics, more specifically uncrewed ground vehicles (UGVs), give the ability to potentially survey, observe, and map these inaccessible areas for humans. However, one of the most challenging areas to implement this technology is underground environments. The main challenge with implementing this technology in underground environments is the dependence on either GPS or RF communication for UGVs to navigate properly. Therefore, in order to properly demonstrate the mapping capabilities of the UGV this challenge must be resolved. The overall goal of this study is to demonstrate the mapping capabilities of a UGV while addressing this challenge and documenting the implementation and testing phase of the robot. The proposed solution to this challenge is to implement a SLAM algorithm onto the main computational device of the UGV utilizing the Robot Operating System (ROS). The algorithm is the open-source software package Slam Toolbox developed by Steve Macenski. Furthermore, the sllidar_ros2 package from Slamtec will be used to gather the lidar data from an A3M1 2D lidar. A separate program will be created to gather odometry information for our UGV robot. All of these software packages will run together in a Docker environment. Through working on this project I have developed a better understanding of the world of robotics/autonomous systems, especially with applications such as navigation and mapping. Furthermore, through this project, I have been given exposure to how research is conducted within a DOE lab setting. As robotics/autonomous systems become more advanced it's important to pursue more avenues of research such as this project as it will ensure the development of our capabilities.

42 ENGINEERING↗