Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computation time”

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 OSTI2020

Development and Validation of a Simulation Testbed for the Intelligent Building Agents Laboratory (IBAL) Using TRNSYS

This paper documents the development and validation of a dynamic primary cooling and thermal storage system simulation testbed. The system simulation testbed, sIBAL, is based on the Intelligent Building Agents Laboratory (IBAL) at the National Institute of Standards and Technology (NIST), which is a research infrastructure and testbed for the development, evaluation, and demonstration of intelligent control algorithms. The sIBAL testbed developed in this project will serve as a virtual twin of the real facility for future control algorithm development. The details of the methodologies used to develop and validate the simulation testbed, which replicates the dynamic behaviors of the primary cooling and ice storage system in the IBAL facility, are presented. The simulation testbed was developed in TRNSYS using built-in component models and MATLAB functions to replicate the two water-cooled chillers, a thermal storage tank, pumps, valves and other components for four different operation modes. Experiments on IBAL components were designed and executed to generate experimental data for model development and verification of the simulation platform. The validation of the simulation results was carried out in two phases: 1) independent component simulations for the chillers and thermal storage tank, and 2) a combined testbed simulation of the entire hydronic system. Comparison of simulation results to the experimental data obtained from the IBAL facility showed errors within 1 °C for the temperatures outputs of both the chiller and the thermal storage model. The error is within an acceptable range for further intelligent control algorithms development. The findings from the study are summarized and presented along with areas where additional research is needed. In addition, data filtering procedures and model refinement measures utilized to improve the accuracy and accelerate the computation time of the simulation are presented.

cooling systems↗
DOE OSTI2020

Effectively Using Remote I/O For Work Composition in Distributed Workflows

Distributed scientific workflows are becoming more important with the interest in incorporating AI into their loops. A critical programming and performance question is how to compose workflow tasks when data is produced on one system but must be consumed on another. Since the dominant technique is composition with remote I/O, this paper explores its performance expectations. We describe BigFlowSim, a workflow I/O simulator that captures key implementation choices for remote I/O, including intensity, reuse, locality, access pattern, and data movement.With BigFlowSim, we generate a synthetic benchmark. We quantify the effects of each parameter with a performance sensitivity study. We explain trends in terms of data movement reduction and show that, under certain conditions, it is possible to establish a total order among most parameters. We apply these insights to a high energy physics workflow, Belle II Monte Carlo and simulate several I/O optimizations. Speedups range from 5% to 2×, without changing compute time.

Friese, Ryan D.↗
DOE OSTI2021

Companion Assisted Software Based Remote Attestation in SCADA Networks

Critical infrastructure such as power generation and water distribution systems have become a priority target in cyber warfare because of their recent computerization and introduction to the internet. As a result, Supervisory Control and Data Acquisition (SCADA) system security has become a hot topic in academic and industrial research. Among these topics, Remote Attestation is a security method intended to detect the presence of fileless malware in remote devices as they continue to operate. This allows for the detection of malware in the absence of long-term storage artifacts before symptoms of compromise begin to appear. In general, a trusted device (the verifier) makes a request for evidence of innocence from the untrusted device (the prover). In software-based schemes, the verifier can then measure the delay between its request and the prover’s response. If this delay is greater than the known computational time of the evidence gathering algorithm performed by the prover, then evidence may have been forged. Multi-hop networks often introduce too much network jitter to allow accurate measurement of prover response time, which limits the effectiveness of software based Remote Attestation in a real-world setting. In this work, we introduce a companion device that the verifier can trust to perform a subset of attestation, thereby removing any network jitter. This device is a Field Programmable Gate Array (FPGA) that is physically connected to the prover. We provide a communication protocol between the verifier, prover, and companion. To evaluate our scheme, we simulate it in a common SCADA network environment under normal and heavy traffic loads. Our simulations are performed in the discrete event network simulator NS-3, and we perform statistical analysis over our results to show that our scheme allows for tight timing constraints to be placed on the prover such that the verifier can more easily determine the validity of the evidence that it receives.

Johnson, William A.↗
DOE OSTI2022

Reconstruction of Large Radius Tracks with the Exa.TrkX pipeline

Particle tracking is a challenging pattern recognition task at the Large Hadron Collider (LHC) and the High Luminosity-LHC. Conventional algorithms, such as those based on the Kalman Filter, achieve excellent performance in reconstructing the prompt tracks from the collision points. However, they require dedicated configuration and additional computing time to efficiently reconstruct the large radius tracks created away from the collision points. We developed an end-to-end machine learning-based track finding algorithm for the HL-LHC, the Exa.TrkX pipeline. The pipeline is designed so as to be agnostic about global track positions. In this work, we study the performance of the Exa.TrkX pipeline for finding large radius tracks. Trained with all tracks in the event, the pipeline simultaneously reconstructs prompt tracks and large radius tracks with high efficiencies. This new capability offered by the Exa.TrkX pipeline may enable us to search for new physics in real time.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2022

Meshfree Methods for Modeling Chemo-Mechanical Cathode Cracking in Li-Ion Batteries

Through repeated charging and discharging, the electrodes of a Li-ion battery experience cyclic loading causing swelling and contraction due to the movement of lithium, also known as intercalation. This research focuses specifically on the chemo-mechanical cracking in the cathode. Because cathode particles are comprised of many randomly-oriented grains, which have highly anisotropic material properties, the expansion and contraction is very non-uniform. As a result, stress concentrations tend to form between grains, which necessitates the modeling of crack propagation largely along grain boundaries. Chemo-mechanical models are simulated mainly by two methods: the cohesive zone model (CZM) and the continuous damage model (CDM). The CZM is more accurate at capturing the sharp discontinuities of a crack but is very computationally expensive and intractable for large-scale models as a result. Conversely, the CDM is easily computed but not well-suited to easily allow for discontinuous field variables, which are inherent across a crack. This study aims to improve the CDM's ability to capture discontinuous cracks. Current versions of the CDM use the finite element method (FEM), which is one of the most widely used approaches for spatial discretization. This research investigates the use of the Reproducing Kernel Particle Method (RKPM), a meshfree method, for spatial discretization and aims to achieve a chemo-mechanical crack propagation model that achieves both intermediate accuracy and computational time between a CDM and CZM. To gain a better understanding of how the meshfree model compares to the current FEM model in capturing cathode crack propagation, further investigation is needed.

cathode cracking↗
DOE OSTI2022

Random filters for enriching the discriminatory power of topological representations

Topological representations of data are inherently coarse summaries which endows them with certain desirable properties like stability but also potentially inhibits their discriminatory power relative to fine-scale learned features. In this work we present a novel framework for enriching the discriminatory power of topological representations based on random filters and capturing ``interference topology'' rather than direct topology. We show that our random filters outperform previously explored structured image filters while requiring orders of magnitude less computational time. The approach is demonstrated on the MNIST dataset but is broadly applicable across data sets and modalities. This work is concluded with a discussion of the mathematical intuition underlying the approach and identification of future directions to enable deeper understanding and theoretical results.

Jorgenson, Grayson S.↗
DOE OSTI2022

Random Filters for Enriching the Discriminatory Power of Topological Representations

Topological representations of data are inherently coarse summaries which endows them with certain desirable properties like stability but also potentially inhibits their discriminatory power relative to fine-scale learned features. In this work we present a novel framework for enriching the discriminatory power of topological representations based on random filters and capturing "interference topology'' rather than direct topology. We show that our random filters outperform previously explored structured image filters while requiring orders of magnitude less computational time. The approach is demonstrated on the MNIST dataset but is broadly applicable across data sets and modalities. This work is concluded with a discussion of the mathematical intuition underlying the approach and identification of future directions to enable deeper understanding and theoretical results.

Jorgenson, Grayson S.↗
DOE OSTI2022

A Machine Learning-Assisted Framework to Control Thermally Anisotropic Building Envelopes in Residential Buildings

To curb the energy consumption of buildings and their related CO2 emissions, Oak Ridge National Laboratory (ORNL) has developed the thermally anisotropic building envelope (TABE) —a multi-layer design comprising insulation materials and metal foils connected to thermal loops. In this study, a machine learning-assisted framework was developed to control the TABE in residential buildings to reduce the computation load for future optimal rule-based control and application. First, a 2D finite element model was established in COMSOL to calculate the hourly heat flux through exterior walls installed with the TABE. Then, TABE wall heat fluxes were simulated for various given indoor and outdoor boundary conditions, as well as thermal loops fluid temperatures and flow rates. Since the finite element simulations are computationally expensive, an artificial neural network (ANN) was then trained to use as a proxy of the finite element (COMSOL) modeling. Finally, the trained ANN model was coupled with the EnergyPlus model to predict the energy consumption of a US Department of Energy prototype single-family house installed with the TABE. An optimal simple rule-based control was determined from predefined rules for a case study. The results demonstrate that the developed machine learning–assisted framework can reduce 99.9% of the computation time while efficiently managing residential building energy for installed TABE walls.

Shen, Zhenglai↗
DOE OSTI2024

Efficient Modeling of Floating Wind Arrays Including Current Loads and Seabed Bathymetry: Preprint

Capabilities for modeling the effects of seabed bathymetry and current drag loads on a floating wind farm are now available in an open-source model for quasi-static analysis. In this model, mooring lines and dynamic cables are represented by a quasistatic solver that can quickly represent complex mooring/cabling arrangements and arrays of floating bodies. To account for seabed bathymetry, we expand the model to include a surface mesh that captures changes in water depth over a rectangular grid. We formulate modifications to the catenary equations that capture a mooring line's profile and tensions when contacting a slope seabed. To account for current drag loads on mooring lines and dynamic cables, we formulate a novel technique that rotates the reference frame so that the vector sum of the the weight and the current force are used in the catenary equations, while accounting for the seabed orientation. To complete the system, current drag loads on floating substructures are handled by inclusion of strip-theory drag calculations. These new capabilities are verified by comparing with results from the established offshore dynamics models MoorDyn and OrcaFlex in equivalent steady-state scenarios. The results show very good agreement for both sloped seabeds and current loads. With computation times of the quasi-static model typically under one second, the model additions are a useful capability toward rapidly evaluating a floating wind array's response to environmental loads under realistic site conditions.

bathymetry↗
DOE OSTI2022

Performance enhancement of planar MOC calculation in hexagonal geometries by assembly-wise domain decomposition

The parallelization of planar Method of Characteristics (MOC) calculation with the higher order scattering in the hexagonal version of the nTRACER direct whole core calculation code is enhanced by adopting assembly-wise domain decomposition and other techniques. In order to augment the hexagonal domain decomposition, the three-color scheme, the angular decomposition, and the angular flux storage scheme are examined. The parallel performance assessed for the VVER benchmark problems demonstrates that the hexagonal assembly-wise domain decomposition significantly reduces the computing time in ray tracing by up to 64 %. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

Particle Swarm Optimisation for group structure optimization for radiotherapy shielding

Neutron transport simulations are ubiquitous in nuclear engineering because they allow one to model experimental systems and render a model platform for easy perturbation of experimental designs. In addition, simulations allow one to gain experimental insight without actually having to go through the trouble of building a physical experiment. Neutron transport simulations can be stochastic or deterministic based. Stochastic neutron transport simulations are typically simulated using the Monte Carlo method and yield very accurate solutions but are computationally expensive, while deterministic methods are typically faster but can be less accurate. Here we focus on optimizing the accuracy of deterministic neutron transport simulations for radiotherapy simulations. Deterministic neutron transport requires discretization of angle, energy, and space to appropriately analyze the system one is trying to model. Discretization of energy is challenging because of the highly variable neutron flux at certain neutron energies. Improper discretization of energy in the transport model can lead to erroneous results and therefore inaccurate interpretations of the solution. In this study, we evaluate Particle Swarm Optimization (PSO) as a mechanism for selecting optimal group structures for radiotherapy shielding. We tested the particle swarm optimization algorithm on radiotherapy shielding problems using Los Alamos National Laboratory's (LANL) main deterministic transport code PARTISN. Results show that the optimized energy group structures generated from the optimization algorithm outperformed LANL's standard energy group structures, and therefore demonstrate utility in using PSO to expedite computation times due to the increased accuracy obtained with a smaller but optimized group structure. (authors)

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

Advancing earth system model calibration: a diffusion-based method

Understanding of climate impact on ecosystems globally requires site-specific model calibration. Here we introduce a novel diffusion-based uncertainty quantification (DBUQ) method for efficient model calibration. DBUQ is a score-based diffusion model that leverages Monte Carlo simulation to estimate the score function and evaluates a simple neural network to quickly generate samples for approximating parameter posterior distributions. DBUQ is stable, efficient, and can effectively calibrate the model given diverse observations, thereby enabling rapid and site-specific model calibration on a global scale. This capability significantly advances Earth system modeling and our understanding of climate impacts on Earth systems. We demonstrate DBUQ's capability in E3SM land model calibration at the Missouri Ozark AmeriFlux forest site. Both synthetic and real-data applications indicate that DBUQ produces accurate parameter posterior distributions similar to those generated by Markov Chain Monte Carlo sampling but with 30X less computing time. This efficiency marks a significant stride in model calibration, paving the way for more effective and timely climate impact analyses.

Liu, Yanfang↗
DOE OSTI2024

Active Learning for Metamaterial Optimization on HPC and QC Integrated Systems

Active learning algorithms, integrating machine learning, quantum computing and optics simulation in an iterative loop, offer a promising approach to optimizing metamaterials. However, these algorithms can face difficulties in optimizing highly complex structures due to computational limitations. High-performance computing (HPC) and quantum computing (QC) integrated systems can address these issues by enabling parallel computing. In this study, we develop an active learning algorithm working on HPC-QC integrated systems. We evaluate the performance of optimization processes within active learning (i.e., training a machine learning model, problem-solving with quantum computing, and evaluating optical properties through wave-optics simulation) for highly complex metamaterial cases. Our results showcase that utilizing multiple cores on the integrated system can significantly reduce computational time, thereby enhancing the efficiency of optimization processes. Therefore, we expect that leveraging HPC-QC integrated systems helps effectively tackle large-scale optimization challenges in general.

Kim, Seongmin↗
DOE OSTI2023

Computationally Robust Line Outage Detection and Identification in Three-Phase Networks

Detection and identification of individual phase outages remains a challenging problem due to insufficient metering in three-phase unbalanced power networks. This problem was tackled for the transmission systems in our previous work as documented in [1]. In this paper, this work is extended to detect phase outages in three-phase unbalanced systems using only the sparse estimation method. In addition, further improvements are introduced to increase the estimation accuracy for the virtual power injections at the terminal buses of disconnected lines, once the disconnected line is identified by sparse estimation methods. Simulation results are provided to experimentally validate the increased accuracy in detecting phase outages while decreasing the computational time by using the proposed approach.

Sparse Estimation, Line Outage, Phase Outage, LASS↗
DOE OSTI2025

Evaluating Chemical Kinetics Predictions for Propane Using 3-D and 0-D Models in a Boosted Spark-Ignited Engine

Propane has been shown to be a promising alternative fuel to reduce emissions while simultaneously achieving high efficiencies in medium- and heavy-duty engines. These high-power density applications require boosted engines which, combined with high compression ratio, can lead to auto-ignition and knock. While three-dimensional (3-D) computational fluid dynamics (CFD) models are often used for resolving the complex fluid flow in engines, these models can become computationally expensive when simulating detailed chemical kinetics. Likewise, zero-dimensional (0-D) models are computationally concise enough for kinetics development, but lack any flow-field information which governs the flame propagation processes in spark ignition (SI) engines. This work presents a comprehensive comparison between 3-D and 0-D closed cycle simulations at knocking conditions in a high compression ratio high stroke-to-bore ratio propane engine. In order to initialize the flow-field for the 3-D closed cycle (intake valve closing, (IVC) to exhaust valve opening, (EVO)) simulation, a motored multi-cycle 3-D model was run using Converge to create a map at IVC, reducing the computational time. The map allowed a non-homogeneous 3-D closed cycle simulation to be satisfactorily validated against experiments, while a homogeneous case using only the turbulence field mapping was also simulated, mimicking 0-D modeling. The 3-D simulations were used to prescribe the initial conditions (e.g., IVC thermodynamics, speciation, burn-rate profile) for a 2-zone 0-D SI engine model in Chemkin Pro for both cases. It was found that 2-zone 0-D modeling underpredicted the knock onset timing, likely due to the lack of thermal stratification in the unburned gas region. Future work will carry multi-zone 0-D modeling to capture the fuel auto-ignition in the unburned region.

Douvry-Rabjeau, Julien [Oakland University, Roches↗
NASA NTRS1989

CPU timing routines for a CONVEX C220 computer system

The timing routines available on the CONVEX C220 computer system in the Structural Mechanics Division (SMD) at NASA Langley Research Center are examined. The function of the timing routines, the use of the timing routines in sequential, parallel, and vector code, and the interpretation of the results from the timing routines with respect to the CONVEX model of computing are described. The timing routines available on the SMD CONVEX fall into two groups. The first group includes standard timing routines generally available with UNIX 4.3 BSD operating systems, while the second group includes routines unique to the SMD CONVEX. The standard timing routines described in this report are /bin/csh time,/bin/time, etime, and ctime. The routines unique to the SMD CONVEX are getinfo, second, cputime, toc, and a parallel profiling package made up of palprof, palinit, and palsum.

Bynum, Mary Ann↗
NASA NTRS1989

Approximation algorithms for planning and control

A control system operating in a complex environment will encounter a variety of different situations, with varying amounts of time available to respond to critical events. Ideally, such a control system will do the best possible with the time available. In other words, its responses should approximate those that would result from having unlimited time for computation, where the degree of the approximation depends on the amount of time it actually has. There exist approximation algorithms for a wide variety of problems. Unfortunately, the solution to any reasonably complex control problem will require solving several computationally intensive problems. Algorithms for successive approximation are a subclass of the class of anytime algorithms, algorithms that return answers for any amount of computation time, where the answers improve as more time is allotted. An architecture is described for allocating computation time to a set of anytime algorithms, based on expectations regarding the value of the answers they return. The architecture described is quite general, producing optimal schedules for a set of algorithms under widely varying conditions.

Boddy, Mark↗
NASA NTRS1978

Computer Program for the Design and Off-Design Performance of Turbojet and Turbofan Engine Cycles

The rapid computer program is designed to be run in a stand-alone mode or operated within a larger program. The computation is based on a simplified one-dimensional gas turbine cycle. Each component in the engine is modeled thermo-dynamically. The component efficiencies used in the thermodynamic modeling are scaled for the off-design conditions from input design point values using empirical trends which are included in the computer code. The engine cycle program is capable of producing reasonable engine performance prediction with a minimum of computer execute time. The current computer execute time on the IBM 360/67 for one Mach number, one altitude, and one power setting is about 0.1 seconds. about 0.1 seconds. The principal assumption used in the calculation is that the compressor is operated along a line of maximum adiabatic efficiency on the compressor map. The fluid properties are computed for the combustion mixture, but dissociation is not included. The procedure included in the program is only for the combustion of JP-4, methane, or hydrogen.

Morris, S. J.↗