SEARCH · Engineering Papers

Results for “program ordering”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 163 records · Page 9

All sources NASA NTRS DOE OSTI

DOE OSTI2026

Enabling Dynamic Probabilistic Risk Assessment of Physical Security Using EMRALD and MAAP (Presentation)

The optimization of physical security in nuclear power plants requires sophisticated methodologies that integrate operator actions and plant behavior through advanced simulation tools. Idaho National Laboratory has developed the Modeling and Analysis for Safety and Security using the Dynamic EMRALD Framework (MASS-DEF) methodology, an approach that integrates force-on-force simulations, dynamic probabilistic risk assessment, and thermal hydraulics modeling to enhance security planning while reducing costs. A reduced order model for thermal hydraulic simulations performed by the Modular Accident Analysis Program (MAAP) was developed to evaluate reactor core behavior during attack scenarios. MAAP simulations are computationally intensive and must be run in a secure environment, complicating analysis and validation. By pre-computed scenario outcomes for a small number of modified parameters, the reduced order model significantly decreases the computational cost and enables offsite review of the results.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2022

A computationally efficient algorithm for computing convex hull prices

Electricity markets worldwide allow participants to bid non-convex production offers. While non-convex offers can more accurately reflect a resource's capabilities, they create challenges for market clearing processes. For example, system operators may be required to execute side payments to participants whose costs are not covered through energy sales as determined via traditional locational marginal pricing schemes. Convex hull pricing minimizes this and other types of side payments while providing uniform (i.e., locationally and temporally consistent) prices. Computing convex hull prices involves solving either a large-scale linear program or the Lagrangian dual of the corresponding non-convex scheduling problem. Further, the former approach requires explicit descriptions of market participants' convex hulls. While linear programs for computing convex hull prices are large, their structure is naturally decomposable by generators. Here, in this work, we propose and empirically analyze a Benders decomposition approach to computing convex hull prices that leverages recent advances in convex hull formulations for thermal generating units. We demonstrate across a large set of test instances that our decomposition approach only requires modest computational effort, obtaining solutions at least an order of magnitude faster than the equivalent large-scale linear programming approach. Overall, we provide a computationally feasible method for computing convex hull prices for industrial scale market clearing problems, enabling the possibility of practical adoption of this advanced pricing mechanism.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

DOE OSTI2024

Deep drilling in the time domain with DECam – II: characterizing the light curves of candidates in the extragalactic fields

ABSTRACT In this second paper on the DECam deep-drilling field (DDF) program, we release 2020 optical $gri$-band light curves for transients and variables in the extragalactic COSMOS and ELAIS fields based on time series observations with a 3-d cadence from semester 2021A through 2023A. In order to demonstrate the wide variety of time domain events detected by the program and encourage others to use the data set, we characterize the sample by presenting a brief analysis of the light-curve parameters such as time span, amplitude, and peak brightness. We also present preliminary light-curve categorizations, and identify potential stellar variables, active galactic nuclei, tidal disruption events, supernovae (SNe) (such as Type Ia, Type IIP, superluminous, and gravitationally lensed SNe), and fast transients. Where relevant, the number of identified transients is compared to the predictions of the original proposal. We also discuss the challenges of analyzing DDF data in the context of the upcoming Vera C. Rubin Observatory and its Legacy Survey of Space and Time, which will include DDFs. Images from the Dark Energy Camera DDF program are available without proprietary period and the light curves presented in this work are publicly available for analysis.

Graham, Melissa L. (ORCID:0000000291543136)↗

DOE OSTI2026

Translation-Invariant Quantum Algorithms for Ordered Search are Optimal

Ordered search is the task of finding an item in an ordered list using comparison queries. The best exact classical algorithm for this fundamental problem uses [log 2 n] queries for a list of length n. Quantum computers can achieve a constant-factor speedup, but the best possible coefficient of log 2 n for exact quantum algorithms is only known to lie between (ln2)/π ≈ 0.221 and 4/log 2 605 ≈ 0.4333. We consider a special class of translation-invariant algorithms with no workspace, introduced by Farhi, Goldstone, Gutmann, and Sipser, that has been used to find the best known upper bounds. First, we show that any bounded-error, k-query quantum algorithm for ordered search can be implemented by a k-query algorithm in this special class. Second, we use linear programming to show that the best exact 5-query quantum algorithm can search a list of length 7265, giving an ordered search algorithm that asymptotically uses 5 log 7265 n ≈ 0.390 log 2 n quantum queries.

Translation-invariant quantum algorithms↗

DOE OSTI2026

Metamaterials as a Platform for the Development of Novel Materials for Energy Applications

To explore the fundamental properties of metamaterials (MMs) / metasurfaces and their potential for control of energy at the sub‐wavelength scale in support of the mission of the Department of Energy and the office of Basic Energy Sciences. Electromagnetic metamaterials provide a platform for the discovery and design of new materials with novel structures, functions, and properties. The PI proposes to advance the knowledge base of these materials through fundamental investigations of the experimental and theoretical properties of metamaterials for the discovery, prediction and design of new materials with novel structures, functions, and properties. The proposed research activities emphasize a complete basic research program including the conceptual / computational design, fabrication / synthesis of the materials, and the characterization and analysis of their electromagnetic properties. The proposed project explores the fundamental properties of metamaterials / metasurfaces and their potential for energy applications. There are three main topics which will be investigated: 1) Dispersion engineering with metamaterials and metasurfaces, 2) Epsilon near zero metamaterial absorbers and emitters, and 3) All dielectric metamaterials. The program implements a complete basic research program consisting of theory / design, modeling, characterization, and analysis, in order to fully characterize metamaterials and metasurfaces, while at the same time minimizing iterations necessary to achieve the proposal goals.

36 MATERIALS SCIENCE↗

DOE OSTI2025

Optimal Mitigation Planning For Adversarial Scenarios

We propose a generalized framework which performs an optimal partitioning of a limited budget into various organizational sectors in order to improve the cybersecurity of a smart device or component in the Cyber Physical Energy System (CPS). The framework identifies the adversarial threats and possible attack sequences which can be performed to exploit cyber vulnerabilities of the component. Thereafter, we formulate an Mixed Integer Linear Programming (MILP) optimization problem which aims to evaluate the optimal budget partitions in order to minimize the number of highly likely attack sequences. Though we provide results for using the framework in CPES, the proposed methodology can be extended for multiple domains with a set of known adversarial and mitigation actions.

Purohit, Sumit [Pacific Northwest National Laborat↗

DOE OSTI2022

Implicit shock tracking for unsteady flows by the method of lines

Here, a recently developed high-order implicit shock tracking (HOIST) framework for resolving discontinuous solutions of inviscid, steady conservation laws is extended to the unsteady case. Central to the framework is an optimization problem which simultaneously computes a discontinuity-aligned mesh and the corresponding high-order approximation to the flow, which provides nonlinear stabilization and a high-order approximation to the solution. This work extends the implicit shock tracking framework to the case of unsteady conservation laws using a method of lines discretization via a diagonally implicit Runge-Kutta method by “solving a steady problem at each timestep”. We formulate and solve an optimization problem that produces a feature-aligned mesh and solution at each Runge-Kutta stage of each timestep, and advance this solution in time by standard Runge-Kutta update formulas. A Rankine-Hugoniot based prediction of the shock location together with a high-order, untangling mesh smoothing procedure provides a high-quality initial guess for the optimization problem at each time, which results in rapid convergence of the sequential quadratic programing (SQP) optimization solver. This method is shown to deliver highly accurate solutions on coarse, high-order discretizations without nonlinear stabilization and recover the design accuracy of the Runge-Kutta scheme. We demonstrate this framework on a series of inviscid, unsteady conservation laws in both one- and two- dimensions. We also verify that our method is able to recover the design order of accuracy of our time integrator in the presence of a strong discontinuity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2021

CSRI Summer Proceedings 2021

The Computer Science Research Institute (CSRI) brings university faculty and students to Sandia National Laboratories for focused collaborative research on Department of Energy (DOE) computer and computational science problems. The institute provides an opportunity for university researches to learn about problems in computer and computational science at DOE laboratories, and help transfer results of their research to programs at the labs. Some specific CSRI research interest areas are: scalable solvers, optimization, algebraic preconditioners, graph-based, discrete, and combinatorial algorithms, uncertainty estimation, validation and verification methods, mesh generation, dynamic load-balancing, virus and other malicious-code defense, visualization, scalable cluster computers, beyond Moore’s Law computing, exascale computing tools and application design, reduced order and multiscale modeling, parallel input/output, and theoretical computer science. The CSRI Summer Program is organized by CSRI and includes a weekly seminar series and the publication of a summer proceedings.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

CSRI Summer Proceedings 2021

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Many-Body Physics in the NISQ Era: Quantum Programming a Discrete Time Crystal

Recent progress in the realm of noisy intermediate-scale quantum (NISQ) devices represents an exciting opportunity for many-body physics by introducing new laboratory platforms with unprecedented control and measurement capabilities. We explore the implications of NISQ platforms for many-body physics in a practical sense: we ask which physical phenomena, in the domain of quantum statistical mechanics, they may realize more readily than traditional experimental platforms. While a universal quantum computer can simulate any system, the eponymous noise inherent to NISQ devices practically favors certain simulation tasks over others in the near term. As a particularly well-suited target, we identify discrete time crystals (DTCs), novel nonequilibrium states of matter that break time translation symmetry. These can only be realized in the intrinsically out-of-equilibrium setting of periodically driven quantum systems stabilized by disorder-induced many-body localization. While promising precursors of the DTC have been observed across a variety of experimental platforms—ranging from trapped ions to nitrogen-vacancy centers to NMR crystals—none have all the necessary ingredients for realizing a fully fledged incarnation of this phase, and for detecting its signature long-range spatiotemporal order. We show that a new generation of quantum simulators can be programmed to realize the DTC phase and to experimentally detect its dynamical properties, a task requiring extensive capabilities for programmability, initialization, and readout. Specifically, the architecture of Google’s Sycamore processor is a remarkably close match for the task at hand. We also discuss the effects of environmental decoherence, and how they can be distinguished from ‘internal’ decoherence coming from closed-system thermalization dynamics. Already with existing technology and noise levels, we find that DTC spatiotemporal order would be observable over hundreds of periods, with parametric improvements to come as the hardware advances.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2020

Underground Test Area (UGTA) Sampling Plan for Corrective Action Units 101 and 102: Central and Western Pahute Mesa, Nevada National Security Site, Nevada

The purpose of this groundwater sampling plan (referred to herein as “the Plan”) is to describe the approach for collecting and analyzing groundwater samples to meet the objectives of the U.S. Department of Energy (DOE), Environmental Management (EM) Nevada Program’s Underground Test Area (UGTA) Activity. The Plan is focused on the Central and Western Pahute Mesa corrective action units (CAUs 101 and 102). The remaining UGTA CAUs are in the final stage of the UGTA strategy (Closure Report [CR] stage), and monitoring requirements for these CAUs are described in their respective CRs. The Plan supersedes the Nevada National Security Site Integrated Groundwater Sampling Plan and its ensuing Record of Technical Change (ROTC) (DOE/EMNV, 2019b). The Plan is designed to ensure compliance with the UGTA Quality Assurance Plan (QAP) and its ensuing ROTC (DOE/EMNV, 2018), and the Federal Facility Agreement and Consent Order (FFACO) (1996, as amended). The Plan is implemented by the Environmental Program Services (EPS) contractor. Implementation of the Plan provides data to complete corrective actions prescribed by the FFACO to protect the public from groundwater contaminated by historical underground nuclear testing. The Plan’s scope comprises sample collection and analysis requirements for assessing the extent of groundwater contamination from underground nuclear testing. Sampling wells located in the communities surrounding the Nevada National Security Site (NNSS) is performed by other organizations (e.g., management and operating [M&O] contractor) and is therefore not included within the Plan. The results of the community sampling are presented in the annual NNSS environmental reports.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2023

User’s Manual for Seal_Flux: A Seal Barrier Reduced-Order Model (Update)

This report provides a brief description on the use of the Seal_Flux computer program developed as part of the effort to quantify the risk of geologic storage of carbon dioxide (CO 2 ) under the U.S. Department of Energy’s (DOE) National Risk Assessment Partnership (NRAP). The Seal_Flux code simulates the flow of CO 2 through a low permeability rock horizon or seal formation overlying the storage reservoir into which CO 2 is injected. A two-phase, relative permeability approach with Darcy’s law is used for one-dimensional (1D) flow computations of CO 2 through the horizon in the vertical direction. The code also allows the simulation of time-dependent processes that can influence such flow. However, as part of its design, Seal_Flux is what can be termed a “reduced-order model” (ROM) and is not intended as a full-functioning flow code. The theory and simulation in the code is streamlined and directed towards the implementation of Monte Carlo risk analyses of CO 2 transport or as termed in this context as “leakage.” While presented in this report as a stand-alone tool, the Seal_Flux code is intended to function in the future as one of several models as part of an integrated, systems-level model of CO 2 storage performance. Finally, the code is written in Python 3.10 to provide an open framework for further development by others and to assist in linking the code with other modules in an integrated assessment model.

58 GEOSCIENCES↗

DOE OSTI2021

Addressing Load Imbalance in Bioinformatics and Biomedical Applications: Efficient Scheduling across Multiple GPUs

Computational bioinformatics and biomedical applications frequently contain heterogeneously sized units of work or tasks, for instance due to variability in the sizes of biological sequences and molecules. Variable-sized workloads lead to load imbalances in parallel implementations which detract from efficiency and performance. Many modern computing resources now have multiple graphics processing units(GPUs) per computer for acceleration. These multiple GPU resources need to be used efficiently through balancing of workloads across the GPUs. OpenMP is a portable directive-based parallel programming API used ubiquitously in bioscience applications to program CPUs; recently, the use of OpenMP directives for GPU acceleration has become possible. Here, motivated by experiences with imbalanced loads in GPU-accelerated bioinformatics applications, we address the load balancing problem using OpenMP task-to-GPU scheduling combined with OpenMP GPU offloading for multiply heterogeneous workloads – loads with both variable input sizes, and simultaneously, variable convergence rates for algorithms with a stochastic component – scheduled across multiple GPUs. We aim to develop strategies which are both easy to use and have lower overheads, and may be incorporated incrementally in existing programs which already make use of OpenMP for CPU-based threading in order to make use of multi-GPU computers. We test different combinations of input size variability and convergence rate variability, and characterize the effects of these different scenarios on the performance of scheduling strategies across multiple GPUs with OpenMP. We present several dynamic scheduling solutions for different parallel patterns, explore optimizations, and provide publicly available example computational kernels to make these strategies easy to use in programs. This work will enable application developers to efficiently and easily use multiple GPUs for imbalanced workloads found in bioinformatics and biomedical applications.

Thavappiragasam, Mathialakan↗

DOE OSTI2024

Statistics and sensitivity of axion wind detection with the homogeneous precession domain of superfluid helium-3

The homogeneous precession domain (HPD) of superfluid He 3 has recently been identified as a detection medium which might provide sensitivity to the axion-nucleon coupling g a N N competitive with, or surpassing, existing experimental proposals. In this work, we make a detailed study of the statistical and dynamical properties of the HPD system in order to make realistic projections for a full-fledged experimental program. We include the effects of clock error and measurement error in a concrete readout scheme using superconducting qubits and quantum metrology. This work also provides a more general framework to describe the statistics associated with the axion gradient coupling through the treatment of a transient resonance with a nonstationary background in a time-series analysis. Incorporating an optimal data-taking and analysis strategy, we project a sensitivity approaching g a N N ∼ 10 − 12 GeV − 1 across a decade in axion mass. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2023

Quantum Many-Body Theory from a Solution of the N -Representability Problem

Here, in this study, we present a many-body theory based on a solution of the N-representability problem in which the ground-state two-particle reduced density matrix (2-RDM) is determined directly without the many-particle wave function. We derive an equation that re-expresses physical constraints on higher-order RDMs to generate direct constraints on the 2-RDM, which are required for its derivation from an N-particle density matrix, known as N-representability conditions. The approach produces a complete hierarchy of 2-RDM constraints that do not depend explicitly upon the higher RDMs or the wave function. By using the two-particle part of a unitary decomposition of higher order constraint matrices, we can solve the energy minimization by semidefinite programming in a form where the low-rank structure of these matrices can be potentially exploited. We illustrate by computing the ground-state electronic energy and properties of the H 8 ring.

74 ATOMIC AND MOLECULAR PHYSICS↗

DOE OSTI2021

Arroyo Seco Improvement Program Annual Report for 2020

The Arroyo Seco Improvement Program is being carried out at Sandia National Laboratories, California in order to address erosion and other streambed instability issues in the Arroyo Seco as it crosses the Sandia National Laboratories, California. The work involves both repair of existing eroded areas, and habitat enhancement. This work is being carried out under the requirements of Army Corps of Engineers permit 2006-400195S and California Regional Water Quality Control Board, San Francisco Bay Region Water Quality Certification Site No. 02-01-C0987.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2020

Performance Assessment of OpenMP Compilers Targeting NVIDIA V100 GPUs

Heterogeneous systems are becoming increasingly prevalent. In order to exploit the rich compute resources of such systems, robust programming models are needed for application developers to seamlessly migrate legacy code from today’s systems to tomorrow’s. Over the past decade and more, directives have been established as one of the promising paths to tackle programmatic challenges on emerging systems. This work focuses on applying and demonstrating OpenMP offloading directives on five proxy applications. We observe that the performance varies widely from one compiler to the other; a crucial aspect of our work is reporting best practices to application developers who use OpenMP offloading compilers. While some issues can be worked around by the developer, there are other issues that must be reported to the compiler vendors. By restructuring OpenMP offloading directives, we gain an 18x speedup for the su3 proxy application on NERSC’s Cori system when using the Clang compiler, and a 15.7x speedup by switching max reductions to add reductions in the laplace mini-app when using the Cray-llvm compiler on Cori.

Davis, Josh↗

DOE OSTI2022

User’s Manual for Seal_Flux: A Seal Barrier Reduced-Order Model

54 ENVIRONMENTAL SCIENCES↗