Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “dynamic programming”

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,063 records · Page 59

Bi-Level Adaptive Storage Expansion Strategy for Microgrids Using Deep Reinforcement Learning

Battery energy storage (BES) is a versatile resource for the secure and economic operation of microgrids (MGs). Prevailing stochastic optimization-based approaches for BES expansion planning for MGs are computationally complicated. This work proposes a data-driven bi-level multi-period BES expansion planning framework to determine the siting, sizing, and timing of BES installations. The proposed planning framework unifies deep reinforcement learning (DRL) and linear programming, thereby decoupling the determinations for the integer and continuous decision variables in two time scales, respectively. In the upper level, a rainbow DRL agent with quantile regression is trained to provide dynamic planning policies to accommodate stochastic renewable energy resources (RESs), load, and battery price changes efficiently. Further, the lower level computes the optimal operation of MGs with frequency constraints to hedge the islanding contingency. The two levels communicate with one another by exchanging storage configuration and operating expenses in order to accomplish the shared goal of minimizing investment and operation costs. Comparative case studies on an MG are carried out to demonstrate the superiority of the proposed DRL-based solution to the mixed-integer linear programming counterpart on efficiency, scalability, and adaptability.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Dynamic Event Tree Analysis Through RAVEN

Conventional Event-Tree (ET) based methodologies are extensively used as tools to perform reliability and safety assessment of complex and critical engineering systems. One of the disadvantages of these methods is that timing/sequencing of events and system dynamics is not explicitly accounted for in the analysis. In order to overcome these limitations several techniques, also know as Dynamic Probabilistic Risk Assessment (D-PRA), have been developed. Monte-Carlo (MC) and Dynamic Event Tree (DET) are two of the most widely used D-PRA methodologies to perform safety assessment of Nuclear Power Plants (NPP). In the past two years, the Idaho National Laboratory (INL) has developed its own tool to perform Dynamic PRA: RAVEN (Reactor Analysis and Virtual control ENvironment). RAVEN has been designed in a high modular and pluggable way in order to enable easy integration of different programming languages (i.e., C++, Python) and coupling with other application including the ones based on the MOOSE framework, developed by INL as well. RAVEN performs two main tasks: 1) control logic driver for the new Thermo-Hydraulic code RELAP-7 and 2) post-processing tool. In the first task, RAVEN acts as a deterministic controller in which the set of control logic laws (user defined) monitors the RELAP-7 simulation and controls the activation of specific systems. Moreover, RAVEN also models stochastic events, such as components failures, and performs uncertainty quantification. Such stochastic modeling is employed by using both MC and DET algorithms. In the second task, RAVEN processes the large amount of data generated by RELAP-7 using data-mining based algorithms. This paper focuses on the first task and shows how it is possible to perform the analysis of dynamic stochastic systems using the newly developed RAVEN DET capability. As an example, the Dynamic PRA analysis, using Dynamic Event Tree, of a simplified pressurized water reactor for a Station Black-Out scenario is presented.

42 ENGINEERING↗

High-Temperature Gas-Cooled Reactor Research Survey and Overview: Preliminary Data Platform Construction for the Nuclear Energy University Program

Since the U.S. Department of Energy Office of Nuclear Energy initiated the Nuclear Energy University Program (NEUP) in 2009, there are 29 NEUP projects focusing on high-temperature gas-cooled reactor (HTGR) research up to July 2022. The resultant research product, either experimental or computational, were published as final NEUP reports, journal articles and conference proceedings. However, these federally funded products have been scattered and sometimes cannot be easily accessed. To improve access to this valuable HTGR validation data and optimize the return on the significant investment made by the Department of Energy, the Advanced Reactor Technologies (ART) Gas-Cooled Reactor (GCR) program started a survey of completed and ongoing HTGR NEUP projects to develop a public-access database specific for HTGRs applications that can be used to retrieve computational fluid dynamics and system code validation data. This effort will help guide future NEUP-funded research, define new state of the ART Phenomena Identification and Ranking Table (PIRT), and promote the usage of this data in the codes validation matrices. This report provides an overview of the NEUP-funded HTGR-related research projects from Fiscal Year (FY) 2009–2021 and identifies validation knowledge gaps still existing in HTGR thermal-fluid research. A preliminary data platform has been developed for the 29 NEUP projects investigating HTGR thermal hydraulics, including their final reports as well as the available scientific publications. As an ultimate goal for this work, the ART-GCR program will create a central database at Idaho National Laboratory to identify, organize, and store these datasets generated by experimental investigations or computational models, experimental facility descriptions, and publicly-available academic products from the HTGR-related NEUP projects and provide future guidance for the storage and transmission of important project documentations for later NEUP projects as well.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Velocity dispersion and dynamical masses for 388 galaxy clusters and groups

The second catalogue of Planck Sunyaev-Zeldovich (SZ) sources, hereafter PSZ2, represents the largest galaxy cluster sample selected by means of their SZ signature in a full-sky survey. For this work, using telescopes at the Canary Island observatories, we conducted the long-term observational program 128- MULTIPLE-16/15B (hereafter LP15), a large and complete optical follow-up campaign of all the unidentified PSZ2 sources in the northern sky, with declinations above –15° and no correspondence in the first Planck catalogue PSZ1. This paper is the third and last in the series of LP15 results, after Streblyanska et al. (2019, A&A, 628, A13) and Aguado-Barahona et al. (2019, A&A, 631, A148), and presents all the spectroscopic observations of the full program. We complement these LP15 spectroscopic results with Sloan Digital Sky Survey archival data and other observations from a previous program (ITP13-08), and present a catalogue of 388 clusters and groups of galaxies including estimates of their velocity dispersion. The majority of them (356) are optical counterparts of PSZ2 sources. A subset of 297 of those clusters are used to construct the M SZ – M dyn scaling relation based on the estimated SZ mass from Planck measurements and our dynamical mass estimates. We discuss and correct for different statistical and physical biases in the estimation of the masses, such as the Eddington bias when estimating M SZ and the aperture and the number of galaxies used to calculate M dyn . The SZ-to-dynamical mass ratio for those 297 PSZ2 clusters is (1 – B) = 0.80 ± 0.04 (stat) ± 0.05 (sys), with only marginal evidence for a possible mass dependence for this factor. Our value is consistent with previous results in the literature, but is associated with a significantly smaller uncertainty due to the use of the largest sample size for this type of study.

79 ASTRONOMY AND ASTROPHYSICS↗

Efficient Treatment of Large Active Spaces through Multi-GPU Parallel Implementation of Direct Configuration Interaction

In this study, we have extended our graphical processing unit (GPU)-accelerated direct configuration interaction program to multiple devices, reducing iteration times for configuration spaces of 165 million determinants to only 3 s using NVIDIA P100 GPUs. Similar improvements in the one- and two-particle reduced density matrix formation allow for fast analytical energy gradients and electronic properties. Our parallel algorithm enables the calculation of arbitrarily large configuration spaces (limited only by available system memory), with iteration times of 13 min for an active space of 18 electrons in 18 orbitals (2.4 billion determinants) using six consumer grade NVIDIA 1080Ti GPUs. These advances enable routine molecular dynamics simulations, geometry optimizations, and absorption spectrum calculations for molecules with large configuration spaces, a task that has heretofore required massive computational effort. In this work, we demonstrate the utility of our program by generating the absorption spectrum for diphenyl acetylene at the floating occupation molecular orbital complete active space configuration interaction level of theory. Lastly, several active spaces were investigated to assess the dependence of spectral features on orbital space dimension.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Colloidal Superstructures Programmed into Magnetic Janus Particles

By engineering thin magnetic films onto homogeneous colloidal particles, various crystalline lattices are induced from simple magnetic Janus spheres. In situ formation of dicolloids amplifies the diversity of achievable dynamic structures. The competition between shape anisotropy and dipole orientation generates mesoscopic isomerism. Furthermore, this opens design space for anisotropic building blocks for smart colloidal materials.

36 MATERIALS SCIENCE↗

Exploiting Vector and Multicore Parallelsim for Recursive, Data- and Task-Parallel Programs

Modern hardware contains parallel execution resources that are well-suited for data-parallelism-vector units-and task parallelism-multicores. However, most work on parallel scheduling focuses on one type of hardware or the other. In this work, we present a scheduling framework that allows for a unified treatment of task- and data-parallelism. Our key insight is an abstraction, task blocks, that uniformly handles data-parallel iterations and task-parallel tasks, allowing them to be scheduled on vector units or executed independently as multicores. Our framework allows us to define schedulers that can dynamically select between executing task- blocks on vector units or multicores. We show that these schedulers are asymptotically optimal, and deliver the maximum amount of parallelism available in computation trees. To evaluate our schedulers, we develop program transformations that can convert mixed data- and task-parallel pro- grams into task block-based programs. Using a prototype instantiation of our scheduling framework, we show that, on an 8-core system, we can simultaneously exploit vector and multicore parallelism to achieve 14×-108× speedup over sequential baselines.

Ren, Bin↗

A Flexible CUDA LU-based Solver for Small, Batched Linear Systems

This chapter presents the implementation of a batched CUDA solver based on LU factorization for small linear systems. This solver may be used in applications such as reactive flow transport models, which apply the Newton-Raphson technique to linearize and iteratively solve the sets of non linear equations that represent the reactions for ten of thousands to millions of physical locations. The implementation exploits somewhat counterintuitive GPGPU programming techniques: it assigns the solution of a matrix (representing a system) to a single CUDA thread, does not exploit shared memory and employs dynamic memory allocation on the GPUs. These techniques enable our implementation to simultaneously solve sets of systems with over 100 equations and to employ LU decomposition with complete pivoting, providing the higher numerical accuracy required by certain applications. Other currently available solutions for batched linear solvers are limited by size and only support partial pivoting, although they may result faster in certain conditions. We discuss the code of our implementation and present a comparison with the other implementations, discussing the various tradeoffs in terms of performance and flexibility. This work will enable developers that need batched linear solvers to choose whichever implementation is more appropriate to the features and the requirements of their applications, and even to implement dynamic switching approaches that can choose the best implementation depending on the input data.

bached linear solvers↗

Physics-based modeling and information-theoretic sensor and settings selection for tool wear detection in precision machining

Precision machining of metals is an energy intensive process with applications and impacts across the manufacturing industry. The energy efficiency, product yield, and maintenance of the precision machine require a digital twin that can assist with prognostics and health management. In this report a physics-based model is developed and validated against face milling data, and then used for the timely and precise inference of machining faults that cannot be measured directly. Computer numerical control (CNC) measurements of power and force are used through this physics-based machining model to predict deviations of the outputs of power consumption and cutting forces during normal operation. A model-based fault detection and isolation methodology is applied to determine the optimal (traditional and available) sensor suite and the test settings (admissible input values) that improve the inference of tool wear in face milling. The optimal sensor suite and input test settings are obtained by solving a mixed integer non-linear program that optimizes information-theoretic metrics relevant to the detection and isolation of tool wear from steady-state or transient machining measurements. Dynamic time warping and k—NN classification are then used to validate the robustness of the optimal design for fault detection test design, including the optimal sensor suite.

42 ENGINEERING↗

Multinode Multi-GPU Two-Electron Integrals: Code Generation Using the Regent Language

The computation of two-electron repulsion integrals (ERIs) is often the most expensive step of integral-direct self-consistent field methods. Formally it scales as O(N 4 ), where N is the number of Gaussian basis functions used to represent the molecular wave function. In practice, this scaling can be reduced to O(N 2 ) or less by neglecting small integrals with screening methods. The contributions of the ERIs to the Fock matrix are of Coulomb (J) and exchange (K) type and require separate algorithms to compute matrix elements efficiently. We previously implemented highly efficient GPU-accelerated J-matrix and K-matrix algorithms in the electronic structure code TeraChem. Although these implementations supported the use of multiple GPUs on a node, they did not support the use of multiple nodes. This presents a key bottleneck to cutting-edge ab initio simulations of large systems, e.g., excited state dynamics of photoactive proteins. We present our implementation of multinode multi-GPU J- and K-matrix algorithms in TeraChem using the Regent programming language. Regent directly supports distributed computation in a task-based model and can generate code for a variety of architectures, including NVIDIA GPUs. We demonstrate multinode scaling up to 45 GPUs (3 nodes) and benchmark against hand-coded TeraChem integral code. Finally, we also outline our metaprogrammed Regent implementation, which enables flexible code generation for integrals of different angular momenta.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Dynamic NMR under nonstationary conditions: Theoretical model, numerical calculation, and potential of application

An expression has been derived for the time dependence of the NMR line shape for systems with multi-site chemical exchange in the absence of spin-spin coupling, in a zero saturation limit. The dynamics of variation of the NMR line shape with time is considered in detail for the case of two-site chemical exchange. Mathematical programs have been designed for numerical simulation of the NMR spectra of chemical exchange systems. The analytical expressions obtained are useful for NMR line shape simulations for systems with photoinduced chemical exchange.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Multi-level parallelization of quantum-chemical calculations

Here, strategies for multiple-level parallelizations of quantum-mechanical calculations are discussed, with an emphasis on using groups of workers for performing parallel tasks. These parallel programming models can be used for a variety ab initio quantum chemistry approaches, including the fragment molecular orbital method and replica-exchange molecular dynamics. Strategies for efficient load balancing on problems of increasing granularity are introduced and discussed. A four-level parallelization is developed based on a multi-level hierarchical grouping, and a high parallel efficiency is achieved on the Theta supercomputer using 131 072 OpenMP threads.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Photon structure studied at an electron ion collider

We report that a future electron ion collider (EIC) will be able to provide collisions of polarized electrons with protons and heavy ions over a wide range of center-of-mass energies (20 GeV to 140 GeV) at an instantaneous luminosity of 10 33 - 10 34 cm -2 s -1 . One of its promising physics programs is the study of the partonic structure of quasireal photons. Measuring dijets in quasireal photoproduction events, one can effectively access the underlying parton dynamics of the photons. In this paper, we discuss the feasibility of tagging resolved photon processes and measuring the dijet cross section as a function of jet transverse momentum in the range of 0.01 < x$rec\atop{γ}$ < 1 at an EIC. Finally, it will be shown that both unpolarized and polarized parton distributions in the photon can be extracted, and that the flavor of the parton can be tagged at an EIC.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Approximating Trajectory Constraints With Machine Learning – Microgrid Islanding With Frequency Constraints

Here, we introduce deep earning aided constraint encoding to tackle the frequency-constraint microgrid scheduling problem. The nonlinear function between system operating condition and frequency nadir is approximated by using a neural network, which admits an exact mixed-integer formulation (MIP). This formulation is then integrated with the scheduling problem to encode the frequency constraint. With the stronger representation power of the neural network, the resulting commands can ensure adequate frequency response in a realistic setting in addition to islanding success. The proposed method is validated on a modified 33-node system. Successful islanding with a secure response is simulated under the scheduled commands using a detailed three-phase model in Simulink. The advantages of our model are particularly remarkable when the inertia emulation functions from wind turbine generators are considered.

24 POWER TRANSMISSION AND DISTRIBUTION↗

AWARE: The Atmospheric Radiation Measurement (ARM) West Antarctic Radiation Experiment

The U.S. Department of Energy Atmospheric Radiation Measurement (ARM) West Antarctic Radiation Experiment (AWARE) performed comprehensive meteorological and aerosol measurements and ground-based atmospheric remote sensing at two Antarctic stations using the most advanced instrumentation available. A suite of cloud research radars, lidars, spectral and broadband radiometers, aerosol chemical and microphysical sampling equipment, and meteorological instrumentation was deployed at McMurdo Station on Ross Island from December 2015 through December 2016. A smaller suite of radiometers and meteorological equipment, including radiosondes optimized for surface energy budget measurement, was deployed on the West Antarctic Ice Sheet between 4 December 2015 and 17 January 2016. AWARE provided Antarctic atmospheric data comparable to several well-instrumented high Arctic sites that have operated for many years and that reveal numerous contrasts with the Arctic in aerosol and cloud microphysical properties. These include persistent differences in liquid cloud occurrence, cloud height, and cloud thickness. Antarctic aerosol properties are also quite different from the Arctic in both seasonal cycle and composition, due to the continent’s isolation from lower latitudes by Southern Ocean storm tracks. Antarctic aerosol number and mass concentrations are not only non-negligible but perhaps play a more important role than previously recognized because of the higher sensitivities of clouds at the very low concentrations caused by the large-scale dynamical isolation. Antarctic aerosol chemical composition, particularly organic components, has implications for local cloud microphysics. The AWARE dataset, fully available online in the ARM Program data archive, offers numerous case studies for unique and rigorous evaluation of mixed-phase cloud parameterization in climate models.

54 ENVIRONMENTAL SCIENCES↗

ZettaBricks: A Language Compiler and Runtime System for Anyscale Computing

This grant supported the ZettaBricks and OpenTuner projects. ZettaBricks is a new implicitly parallel language and compiler where defining multiple implementations of multiple algorithms to solve a problem is the natural way of programming. ZettaBricks makes algorithmic choice a first class construct of the language. Choices are provided in a way that also allows our compiler to tune at a finer granularity. The ZettaBricks compiler autotunes programs by making both fine-grained as well as algorithmic choices. Choices also include different automatic parallelization techniques, data distributions, algorithmic parameters, transformations, and blocking. Additionally, ZettaBricks introduces novel techniques to autotune algorithms for different convergence criteria. When choosing between various direct and iterative methods, the ZettaBricks compiler is able to tune a program in such a way that delivers near-optimal efficiency for any desired level of accuracy. The compiler has the flexibility of utilizing different convergence criteria for the various components within a single algorithm, providing the user with accuracy choice alongside algorithmic choice. OpenTuner is a generalization of the experience gained in building an autotuner for ZettaBricks. OpenTuner is a new open source framework for building domain-specific multi-objective program autotuners. OpenTuner supports fully-customizable configuration representations, an extensible technique representation to allow for domain-specific techniques, and an easy to use interface for communicating with the program to be autotuned. A key capability inside OpenTuner is the use of ensembles of disparate search techniques simultaneously; techniques that perform well will dynamically be allocated a larger proportion of tests.

97 MATHEMATICS AND COMPUTING↗

Update on Small Modular Reactors Dynamics System Modeling Tool -- Molten Salt Cooled Architecture

The Small Modular Reactor (SMR) Dynamic System Modeling Tool project is in the third year of development. The project is designed to support collaborative modeling and study of various advanced SMR (non-light water cooled) concepts, including the use of multiple coupled reactors at a single site. The objective of the project is to provide a common simulation environment and baseline modeling resources to facilitate rapid development of dynamic advanced reactor SMR models, ensure consistency among research products within the Instrumentation, Controls, and Human-Machine Interface (ICHMI) technical area, and leverage cross-cutting capabilities while minimizing duplication of effort. The combined simulation environment and suite of models are identified as the Modular Dynamic SIMulation (MoDSIM) tool. The critical elements of this effort include (1) defining a standardized, common simulation environment that can be applied throughout the program, (2) developing a library of baseline component modules that can be assembled into full plant models using existing geometry and thermal-hydraulic data, (3) defining modeling conventions for interconnecting component models, and (4) establishing user interfaces and support tools to facilitate simulation development (i.e., configuration and parameterization), execution, and results display and capture.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗