Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm development”

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,045 records · Page 58

Q4Q: Quantum Computation for Quantum Prediction of Materials and Molecular Properties

We aim at exploring the potential of quantum computation to solve practical problems that are currently targeted by “traditional” high performance computing (HPC). Along the way, we will develop theoretical frameworks and algorithmic strategies. We propose computational research activities that will advance the application of quantum computers to selected materials/molecular properties: (1) Band structure of solids; (2) Molecular electronic/vibronic properties; (3) Free energies and phase transitions.

36 MATERIALS SCIENCE↗

Average Incremental Cost Pricing for the AC Unit Commitment Problem [Rev. 1]

Unit Commitment (UC) problems that consider the Alternating Current (AC) model of the transmission network have long been considered intractable to solve at scale by the power system community. Recently, the Grid-Optimization (GO) Competition held by the Advanced Research Project Agency-Energy (ARPA-E) has facilitated the development of the first algorithms to solve large-scale ACUC problems. This new capability opens a path towards the explicit consideration of the AC transmission network model in UC problems used to clear day-ahead electricity markets. This calls for the analysis of electricity market structures that accommodate both the continuous non-linearity of the AC transmission network and the discrete non-linearity of the UC problem simultaneously. This paper serves as an initial effort to do so by proposing an Average Incremental Cost (AIC) pricing structure that is designed around the ACUC problem. In particular, an AIC one-pass pricing problem is proposed that represents a continuously constrained variant of the ACUC problem and allows for the computation of Locational Incremental Prices (LIPs) for both real and reactive power as the local optimal Lagrange multipliers of the power balance constraints. To avoid degeneracy, the pricing problem includes a small parameter ϵ > 0. Under certain assumptions market participants are shown to realize profit that converges to a non-negative value as ϵ approaches zero, practically ensuring profitability for small values of ϵ. We additionally provide many simple and important examples that provide intuition and insights into the proposed prices. Examples illustrate the basic concept of AIC pricing, the derived profitability results, the existence of multiple LIPs, the importance of including reactive power in the dispatch and pricing problems, the need for reactive power prices, and the improved incentives exhibited by LIPs as compared to traditional Locational Marginal Prices (LMPs). We additionally indicate many directions for future work including analysis of larger test cases.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Introduction to ALERT: A User-Interface Tool for Resilient Optimization

As the cyber-physical systems grow in complexity, there is a need for proactive resilience strategies that involve online, adaptive control actions to best prepare for any impending adversarial events. In this technical effort, supported by RD2C LDRD initiative, the project team designed and demonstrated online strategies – referred to as ALERT controls – for proactive and adaptive tuning of existing optimal controls in a microgrid, with quantifiably assured margins of resilience to various cyber-physical adversarial events. This ALERT functionality is made available to the end-users, e.g., the system operators, via an interactive user-interface. The end-users will not only be able to use the interface to visualize the system’s operation under various cyber-physical adversarial scenarios, but also evaluate the amount of tolerance the system has against selected adversarial perturbations of interest (e.g., malfunctioning sensors, suspected attacked measurements) via the adversarial plots. In this technical report, we briefly outline the algorithmic modules of the developed ALERT control technology, and introduce the user-interface tool that allows end-users (e.g., microgrid operators) to enter their system description, specify various operational and resilience requirements, and evaluate the impact of the control decisions via illustrative plots.

97 MATHEMATICS AND COMPUTING↗

Analytics-at-scale of Sensor Data for Digital Monitoring in Nuclear Plants (4th Annual Report)

Nuclear plant sites collect and store large volumes of data collected from various equipment and systems. These datasets typically include plant process parameters, maintenance records, technical logs, online monitoring data, and equipment failure data. The collection of such data affords an opportunity to leverage data-driven machine learning and artificial intelligence technologies to provide diagnostic and prognostic capabilities within the nuclear power industry to reduce operating and maintenance costs. In this way, nuclear energy can become more economically competitive with other energy sources, and premature closures can be avoided. From a maintenance standpoint, savings can be achieved by leveraging machine learning and artificial intelligence technologies to develop data-driven algorithms to better diagnose and predict potential faults within the system. Improved model accuracy can lead to reductions in unnecessary maintenance and more efficient planning of future maintenance, thus lowering the costs associated with parts, labor, and unnecessary planned, forced, or extended outages. From an operations perspective, cost savings can be generated by shifting from route-based monitoring to wireless technologies for online monitoring, and by transitioning from onsite- to cloud-based computing and storage services. Wireless monitoring would reduce the operator manhours required for taking routine measurements, while cloud computing services would generate cost savings by reducing the amount of hardware needing to be purchased and maintained—all while scaling to both computational and storage demands. This report summarizes this project’s effort to shift from costly, labor-intensive preventative maintenance to cheaper predictive maintenance.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Report for the ASCR Workshop on Basic Research Needs in Quantum Computing and Networking - 2023

Employing quantum mechanical resources in computing and networking opens the door to new computation and communication models and potential disruptive advantages over classical counterparts. However, quantifying and realizing such advantages face extensive scientific and engineering challenges. Investments by the Department of Energy (DOE) have driven progress toward addressing such challenges. Quantum algorithms have been recently developed, in some cases offering asymptotic exponential advantages in speed or accuracy, for fundamental scientific problems such as simulating physical systems, solving systems of linear equations, or solving differential equations. Empirical demonstrations on nascent quantum hardware suggest better performance than classical analogs on specialized computational tasks favorable to the quantum computing systems. However, demonstration of an end-to-end, substantial and rigorously quantifiable quantum performance advantage over classical analogs remains a grand challenge, especially for problems of practical value. The definition of requirements for quantum technologies to exhibit scalable, rigorous, and transformative performance advantages for practical applications also remains an outstanding open question, namely, what will be required to ultimately demonstrate practical quantum advantage?

97 MATHEMATICS AND COMPUTING↗

Exploitation of Defects in High Entropy Ceramic Barrier Materials

A critical mission need exists to develop new materials that can withstand extreme environments and multiple sequential threats. High entropy materials, those containing 5 or more metals, exhibit many exciting properties which would potentially be useful in such situations. However, a particularly hard challenge in developing new high entropy materials is determining a priori which compositions will form the desired single phase material. The project outlined here combined several modeling and experimental techniques to explore several structure-property-relationships of high entropy ceramics in an effort to better understand the connection between their compositional components, their observed properties, and stability. We have developed novel machine learning algorithms which rapidly predict stable high entropy ceramic compositions, identified the stability interplay between configurational entropy and cation defects, and tested the mechanical stability of high entropy oxides using the unique capabilities at the Dynamic Compression Sector facility and the Saturn accelerator.

36 MATERIALS SCIENCE↗

R-Adaptivity to Enable Compression of Elementary Computations in Extreme-Scale Finite Element Simulators

Modern computing systems are capable of exascale calculations, which are revolutionizing the development and application of high-fidelity numerical models in computational science and engineering. While these systems continue to grow in processing power, the available system memory has not increased commensurately, and electrical power consumption continues to grow. A predominant approach to limit the memory usage in large-scale applications is to exploit the abundant processing power and continually recompute many low-level simulation quantities, rather than storing them. However, this approach can adversely impact the throughput of the simulation and diminish the benefits of modern computing architectures. We present three novel contributions to reduce the memory burden while maintaining, and sometimes improving, performance in simulations based on finite element discretizations. The first contribution develops dictionary-based data compression schemes that detect and exploit the structure of the discretization, due to redundancies across the finite element mesh. While these schemes are shown to reduce memory requirements by more than 99% on meshes with large numbers of identical mesh cells, there are applications where this structure does not exist. The second contribution leverages a recently developed augmented Lagrangian optimization algorithm to enable r-adaptivity for meshes with the goal of enhancing the redundancies in the mesh. The third contribution extends these methods to patch-based linear solvers and preconditioners by compressing local matrices. Numerical results demonstrate the effectiveness of the proposed methods to detect, enhance and exploit mesh structure on a suite of examples inspired by large-scale applications.

97 MATHEMATICS AND COMPUTING↗

AGR-2 TRISO Layer Thickness Imaging Archive

As a part of fuel quality control characterization, optical microscopy images of particle cross sections near midplane were acquired at Oak Ridge National Laboratory (ORNL). These particles were produced by the Advanced Gas Reactor Fuel Development and Qualification (AGR) Program’s AGR-2 irradiation campaign. These images may be of use for the development of image processing algorithms with the benchmark values measured at ORNL. This report provides those benchmark values, along with the raw images and data generated by the ORNL particle layer thickness analysis process.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

AGR-2 TRISO Shadow Imaging Archive

As a part of fuel quality control characterization, backlit shadow images of particles produced by the Advanced Gas Reactor Fuel Development and Qualification (AGR) Program’s AGR-2 irradiation campaign were acquired at Oak Ridge National Laboratory (ORNL). These images may be of use for the development of image processing algorithms with the benchmark values measured at ORNL. This report provides those benchmark values, along with the raw images and data generated by the ORNL shadow imaging process.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Fast and robust strategies for large-scale mixed-integer SCOPF

This project develops scalable, computationally efficient algorithms to solve realistic large-scale power system optimization problems, including systems with more than 8,000 buses, as part of a larger series of competitions run by ARPA-E. These problems are critical because the secure and reliable operation of the power grid is becoming increasingly challenging, especially under conditions of increased uncertainty and variability. The economic feasibility of our methods is high, given that they are purely software-based solutions designed to operate power grids more efficiently. The technical effectiveness balances heuristics and approximations to provide a trade-off between speed and accuracy.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Exploring the Energy Frontier through Precision Tests and Fast Tracking with the CMS Detector (Final Technical Report)

This Early Career Award supported a research program using the CMS experiment at the CERN LHC to probe physics beyond the Standard Model in the top quark and Higgs boson sectors, alongside detector and trigger developments for the High-Luminosity LHC (HL-LHC) upgrade. The program (i) searched for charged lepton flavor violation (LFV) in the top quark sector with the full CMS Run-2 data set, placing the world’s strongest limits to date on the $t → eµq\ (q = u/c)$ branching fraction; (ii) developed preliminary analysis methods toward a boosted $t\bar{t}H(b\bar{b})$ measurement of the top quark Yukawa coupling and its CP properties; (iii) made leading contributions to the hardware-based Level-1 (L1) track finding system for the upgraded CMS detector for HL-LHC; and (iv) developed novel L1 trigger algorithms, notably a displaced vertex trigger enabling new searches for exotic long-lived particles.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A General Framework to Learn Tertiary Structure for Protein Sequence Characterization

During the past five years, deep-learning algorithms have enabled ground-breaking progress towards the prediction of tertiary structure from a protein sequence. Very recently, we developed SAdLSA, a new computational algorithm for protein sequence comparison via deep-learning of protein structural alignments. SAdLSA shows significant improvement over established sequence alignment methods. In this contribution, we show that SAdLSA provides a general machine-learning framework for structurally characterizing protein sequences. By aligning a protein sequence against itself, SAdLSA generates a fold distogram for the input sequence, including challenging cases whose structural folds were not present in the training set. About 70% of the predicted distograms are statistically significant. Although at present the accuracy of the intra-sequence distogram predicted by SAdLSA self-alignment is not as good as deep-learning algorithms specifically trained for distogram prediction, it is remarkable that the prediction of single protein structures is encoded by an algorithm that learns ensembles of pairwise structural comparisons, without being explicitly trained to recognize individual structural folds. As such, SAdLSA can not only predict protein folds for individual sequences, but also detects subtle, yet significant, structural relationships between multiple protein sequences using the same deep-learning neural network. The former reduces to a special case in this general framework for protein sequence annotation.

59 BASIC BIOLOGICAL SCIENCES↗

Quantum Solvers for Plane-Wave Hamiltonians: Abridging Virtual Spaces Through the Optimization of Pairwise Correlations

For many-body methods such as MCSCF and CASSCF, in which the number of one-electron orbitals is optimized and independent of the basis set used, there are no problems with using plane-wave basis sets. However, for methods currently used in quantum computing such as select configuration interaction (CI) and coupled cluster (CC) methods, it is necessary to have a virtual space that is able to capture a significant amount of electron-electron correlation in the system. The virtual orbitals in a pseudopotential plane-wave Hartree–Fock calculation, because of Coulomb repulsion, are often scattering states that interact very weakly with the filled orbitals. As a result, very little correlation energy is captured from them. The use of virtual spaces derived from the one-electron operators has also been tried, and while some correlations are captured, the amount is quite low. To overcome these limitations, we have been developing new classes of algorithms to define virtual spaces by optimizing orbitals from small pairwise CI Hamiltonians, which we term as correlation optimized virtual orbitals with the abbreviation COVOs. With these procedures, we have been able to derive virtual spaces, containing only a few orbitals, which are able to capture a significant amount of correlation. The focus in this manuscript is on using these derived basis sets to target full CI (FCI) quality results for H2 on near-term quantum computers. However, the initial results for this approach were promising. We were able to obtain good agreement with FCI/cc-pVTZ results for this system with just 4 virtual orbitals, using both FCI and quantum simulations. The quality of the results using COVOs suggests that it may be possible to use them in other many-body approaches, including coupled cluster and Møller–Plesset perturbation theories, and open up the door to many-body calculations for pseudopotential plane-wave basis set methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Device Classification for Industrial Control Systems Using Predicted Traffic Features

To achieve a secure interconnected Industrial Control System (ICS) architecture, security practitioners depend on accurate identification of network host behavior. However, accurate machine learning based host identification methods depends on the availability of significant quantities of network traffic data, which can be difficult to obtain due to system constraints such as network security, data confidentiality, and physical location. In this work, we propose a network traffic feature prediction method based on a generative model, which achieves high host identification accuracy. Furthermore, we develop a joint training algorithm to improve host identification performance compared to separate training of the generative model and the classifier responsible for host identification.

97 MATHEMATICS AND COMPUTING↗

Image Analysis for Rapid Assessment and Quality-Based Sorting of Corn Stover

Imaging in the visible spectrum is a low-cost tool that can be readily deployed for in-field or over-belt monitoring of biomass quality for bio-refining operations. Rapid image analysis coupled with innovative preprocessing may reduce the impacts of feedstock variability through identification of contaminants or other material attributes to guide selective sorting and quality management. Image analysis was employed to evaluate the quality of corn stover in red-green-blue (RGB) chromatic space. This study used controlled, bench-scale imaging as a proof-of-concept for rapid quality assessment of corn stover based on variations in material attributes, including chemical and physical attributes, that relate to biological degradation and soil contamination. Additionally, logistic regression-based classification algorithms were used to develop a method for biomass screening as a function of biological degradation or soil contamination. This study demonstrated the use of image analysis to extract features from RGB color space to investigate variations in critical material attributes from chemical composition of corn stover. Fourier transform infrared (FT-IR) suggested a correlation between red band intensity and biological degradation, while detailed surface texture analysis was found to distinguish among variations in ash. These insights offer promise for development of a rapid screening tool that could be deployed by farmers for in-field assessment of biomass quality or biorefinery operators for in-line sorting and process optimization.

09 BIOMASS FUELS↗

Frost prediction using machine learning and deep neural network models

This study describes accurate, computationally efficient models that can be implemented for practical use in predicting frost events for point-scale agricultural applications. Frost damage in agriculture is a costly burden to farmers and global food security alike. Timely prediction of frost events is important to reduce the cost of agricultural frost damage and traditional numerical weather forecasts are often inaccurate at the field-scale in complex terrain. In this paper, we developed machine learning (ML) algorithms for the prediction of such frost events near Alcalde, NM at the point-scale. ML algorithms investigated include deep neural network, convolution neural networks, and random forest models at lead-times of 6–48 h. Our results show promising accuracy (6-h prediction RMSE = 1.53–1.72°C) for use in frost and minimum temperature prediction applications. Seasonal differences in model predictions resulted in a slight negative bias during Spring and Summer months and a positive bias in Fall and Winter months. Additionally, we tested the model transferability by continuing training and testing using data from sensors at a nearby farm. We calculated the feature importance of the random forest models and were able to determine which parameters provided the models with the most useful information for predictions. We determined that soil temperature is a key parameter in longer term predictions (>24 h), while other temperature related parameters provide the majority of information for shorter term predictions. The model error compared favorable to previous ML based frost studies and outperformed the physically based High Resolution Rapid Refresh forecasting system making our ML-models attractive for deployment toward real-time monitoring of frost events and damage at commercial farming operations.

97 MATHEMATICS AND COMPUTING↗

Geometry of Non-Diffusive Tracer Transport in Gridded Atmospheric Models

A first-order linear and numerically non-diffusive Eulerian transport algorithm, minVAR, was recently developed for preservation of correlations between interrelated tracers during advective transport. The present study extends this work by: (1) providing further investigation of several interesting geometric constructions found in contours of constant minVAR, short for minimum variance, through extension to three coordinate dimensions. These contours capture point-by-point representations of thousands of individual atmospheric aerosol and/or cloud particles as they evolve and are rendered on Eulerian grids at a level of sub-grid resolution limited only by numerical precision; and (2) exploration of geometric similarities between the Arakawa C-grid, used to obtain interpolated values of the wind field at grid scale and minVAR. In particular, we consider interpolation of the u and v horizontal components of wind velocity from grid to sub-grid scales. The last results are motivated by recent applications of the Weather Research and Forecasting (WRF) model applied in the coastal Houston region, where the recent TRacking Aerosol Convection Interactions ExpeRiment (TRACER) field campaign was organized. A unique and fully consistent mapping is obtained between particles moving along meteorological wind trajectories and the non-diffusive, non-dispersive representation of such trajectories on an Eulerian grid.

54 ENVIRONMENTAL SCIENCES↗