Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Software Requirements”

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 181 records · Page 10

Production processing and workflow management software evaluation in the DUNE collaboration

The Deep Underground Neutrino Experiment (DUNE) will be theworld’s foremost neutrino detector when it begins taking data in the mid-2020s.Two prototype detectors, collectively known as ProtoDUNE, have begun tak-ing data at CERN and have accumulated over 3 PB of raw and reconstructeddata since September 2018. Particle interaction within liquid argon time projec-tion chambers are challenging to reconstruct, and the collaboration has set upa dedicated Production Processing group to perform centralized reconstructionof the large ProtoDUNE datasets as well as to generate large-scale Monte Carlosimulation. Part of the production infrastructure includes workflow manage-ment software and monitoring tools that are necessary to eciently submit andmonitor the large and diverse set of jobs needed to meet the experiment’s goals.We will give a brief overview of DUNE and ProtoDUNE, describe the varioustypes of jobs within the Production Processing group’s purview, and discuss thesoftware and workflow management strategies are currently in place to meetexisting demand. We will conclude with a description of our requirements in aworkflow management software solution and our planned evaluation process.

Herner, Kenneth R.↗

PLEXUS: A Pattern-Oriented Runtime System Architecture for Resilient Extreme-Scale High-Performance Computing Systems

For high-performance computing (HPC) system designers and users, meeting the myriad challenges of next-generation exascale supercomputing systems requires rethinking their approach to application and system software design. Among these challenges, providing resiliency and stability to the scientific applications in the presence of high fault rates requires new approaches to software architecture and design. As HPC systems become increasingly complex, they require intricate solutions for detection and mitigation for various modes of faults and errors that occur in these large-scale systems, as well as solutions for failure recovery. These resiliency solutions often interact with and affect other system properties, including application scalability, power and energy efficiency. Therefore, resilience solutions for HPC systems must be thoughtfully engineered and deployed.In previous work, we developed the concept of resilience design patterns, which consist of templated solutions based on well-established techniques for detection, mitigation and recovery. In this paper, we use these patterns as the foundation to propose new approaches to designing runtime systems for HPC systems. The instantiation of these patterns within a runtime system enables flexible and adaptable end-to-end resiliency solutions for HPC environments. The paper describes the architecture of the runtime system, named Plexus, and the strategies for dynamically composing and adapting pattern instances under runtime control. This runtime-based approach enables actively balancing the cost-benefit trade-off between performance overhead and protection coverage of the resilience solutions. Based on a prototype implementation of PLEXUS, we demonstrate the resiliency and performance gains achieved by the pattern-based runtime system for a parallel linear solver application.

Hukerikar, Saurabh↗

graphenv: a Python library for reinforcement learning on graph search spaces

Many important and challenging problems in combinatorial optimization (CO) can be expressed as graph search problems, in which graph vertices represent full or partial solutions and edges represent decisions that connect them. Graph structure not only introduces strong relational inductive biases for learning (Battaglia et al., 2018) - in this context, by providing a way to explicitly model the value of transitioning (along edges) between one search state (vertex) and the next - but lends itself to problems both with and without clearly defined algebraic structure. For example, classic CO problems on graphs such as the Traveling Salesman Problem (TSP) can be expressed as either pure graph search or integer programs. Other problems, however, such as molecular optimization, do no have concise algebraic formulations and yet are readily implemented as a graph search (V. et al., 2022; Zhou et al., 2019). Such "model-free" problems constitute a large fraction of modern reinforcement learning (RL) research owing to the fact that it is often much easier to write a forward simulation that expresses all of the state transitions and rewards, than to write down the precise mathematical expression of the full optimization problem. In the case of molecular optimization, for example, one can use domain knowledge alongside existing software libraries to model the effect of adding a single bond or atom to an existing but incomplete molecule, and let the RL algorithm build a model of how good a given decision is by "experiencing" the simulated environment many times through. In contrast, a model-based mathematical formulation that fully expresses all the chemical and physical constraints is intractable. In recent years, RL has emerged as an effective paradigm for optimizing searches over graphs and led to state-of-the-art heuristics for games like Go and chess, as well as for classical CO problems such as the TSP. This combination of graph search and RL, while powerful, requires non-trivial software to execute, especially when combining advanced state representations such as Graph Neural Networks (GNN) with scalable RL algorithms.

97 MATHEMATICS AND COMPUTING↗

Validation and Verification for INL Modelica-based TEDS models Via Experimental Results

This report provides an overview on the verification and validation (V&V) of the Thermal Energy Distribution System (TEDS) model developed in the Modelica process modeling ecosystem using experimental data. Model development has led to the creation of a dynamic process model of the experimental TEDS facility housed within the Energy Systems Laboratory (ESL) at Idaho National Laboratory (INL). The model was then used during the preconstruction phase of the experimental effort to inform experimental design (e.g., insulation requirements, bypass line placement, expected performance of components) and to test innovative control schemes prior to the initial operation. The TEDS model developed in Modelica includes the primary components of the TEDS experimental unit: a 200kW Chromalox heater; a single-tank packed-bed thermal energy storage system filled with 0.125-inch alumina (Al2O3) beads; an ethylene-glycol-to-Therminol-66 heat exchanger; system piping; five control valves; and all associated temperature, pressure, and volumetric flow sensors. Using the Institute of Electrical and Electronics Engineers (IEEE) V&V methodologies, considered the gold standard in the engineering field, the model was verified using a combination of static analysis, spatial convergence, and regression tests. Then using dynamic time warping (DTW) initial runs to validate and tune the TEDS model versus the experiment were conducted. This tuning method was accomplished using the INL Risk Analysis Virtual ENvironment (RAVEN) software package. Tuning is required to account for physical phenomena that are less understood within the empirical heat transfer correlations. Through the commencement of this work, a systems-level model of TEDS with associated control systems, sensors, piping diameters, and component capabilities has been created. This model was utilized in the pre-experimental phase to inform system design, insulation thicknesses, and potential control schemes to operate the system effectively and safely. Then, initial experimental startup and operational data were used to demonstrate the validation and tuning methodology. This process demonstrates the classical two-step approach of a model informing experimental design followed by the experiment validation and tuning the model.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Methodology for Thermodynamic Analysis Coupled with Computational Fluid Dynamics Modeling for Casting a Novel Aluminum–Cerium Alloy

In this paper, we present the results of computational fluid dynamics (CFD) analysis to assess castability, porosity, molten metal fluidity and other technological properties of a new Al-Ce alloy. A thermodynamic analysis of a new Al-Ce alloy is done to obtain the physical properties as a function of temperature across both solid and liquid phases. These properties are then used to build the CFD of model the full casting process from initial pouring through to final solidification of the part, here an example of a heavy duty mor mount is used. While several excellent commercial CFD codes exists this process shows that CFD can be used to assess the capability of the alloy to properly fill the mold, as well as give predictions where scattered porosity or large-scale defects may occur in the casting. Further, unlike the commercially available software (e.g., ProCAST, SOLIDCast , MAGMASOFT®) the complex 3D-analysis of the stress / strain fields in cast parts is not performed at this time. However, the availability of free software for assessing the required thermodynamic / thermo-physical properties of new alloys (OpenCALPHAD) and CFD codes such as OpenFOAM® makes the developed option attractive and economical, especially for the analysis of new Al-Ce alloys, for which the available data does not exist.

36 MATERIALS SCIENCE↗

Extrusion parameter control optimization for DIW 3D printing using image analysis techniques

Material extrusion is a well-recognized facet of additive manufacturing that involves the fabrication of parts through the deposition of structural material from an extrusion head from a bulk supply. In the subdivision of Direct Ink Writing (DIW) additive manufacturing, challenges arise when the structural material is flowable, synchronous extrusion control and tool movement becomes critical for achieving high-quality parts with low defect populations. DIW techniques are most used in laboratory settings using expensive custom instruments and may require specialized 3D slicing software. Here, in this study, the fabrication of an inexpensive, consumer-friendly progressive cavity pump dispensing system is detailed, in which can create high-quality parts by executing G-code commands produced from a commercial slicing software. The precision and repeatability of the movement-synchronized material extrusion is demonstrated through a series of optimization schemes, entailing the alteration of various control parameters, which directly affect the extrusion properties demonstrated during a print. In situ diagnostics were implemented to evaluate the results of the established optimization experiment. Using a machine vision technique, images of the optimization prints are processed. Following this, a supervised machine learning model was trained to autonomously judge whether or not the extrusion parameters produced a passing or failing result. The machine learning scheme serves as a preliminary benchmark for future layer-by-layer evaluation of more complex DIW parts. The construction of the printer and development of in situ characterization capabilities demonstrates the ability for this printer to create high-fidelity DIW parts for a fraction of the price of other systems.

42 ENGINEERING↗

The CLAS12 Data Acquisition System

The CLAS12 Data Acquisition System was designed and built as part of the CLAS12 detector project in Hall B at Jefferson Laboratory. This article contains a full description of the system, including requirements, design, hardware, and software descriptions, as well as the achieved performance. The associated computing, network, and slow controls systems are also described.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Scientific computing plan for the ECCE detector at the Electron Ion Collider

The Electron Ion Collider (EIC) is the next generation of precision QCD facility to be built at Brookhaven National Laboratory in conjunction with Thomas Jefferson National Laboratory. There are a significant number of software and computing challenges that need to be overcome at the EIC. During the EIC detector proposal development period, the ECCE consortium began identifying and addressing these challenges in the process of producing a complete detector proposal based upon detailed detector and physics simulations. Here, in this document, the software and computing efforts to produce this proposal are discussed; furthermore, the computing and software model and resources required for the future of ECCE are described.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A deep learning-based battery sizing optimization tool for hybridizing generation plants

Hybrid generation and energy storage systems offer the ability to increase flexibility of the combined asset. This flexibility can be used to increase provision of services already provided by the generation asset, such as timing sale of electricity to the energy market during high price periods, and also enable provision of additional services, such as ancillary services or contribute to resource adequacy. From a generation asset owner perspective, the decision to hybridize includes selecting an energy storage system that, among other factors, maximizes financial performance of the energy storage investment. Yet, existing tools to optimize energy storage sizing are either too rudimentary (i.e., based on “rules of thumb”) or too complex to implement (i.e., require specialized engineering and software knowledge and a high-performance computer to run). This work presents a novel deep learning-based battery sizing optimization tool that is designed to help generation asset owners easily assess preliminary sizing considerations for potential battery investments to hybridize their generation facility. The tool uses deep learning to predict revenue over a broad search space of potential battery sizes, estimates capital and operating costs (including accounting for battery degradation), and computes financial performance of each potential battery system investment, recommending a system with maximum financial performance. The tool is tested and validated for hydropower assets. Finally, this tool will help a greater cross-section of industry consider investments in battery systems, increasing their revenue and helping them compete in rapidly evolving electrify markets.

13 HYDRO ENERGY↗

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The parallelism motifs of genomic data analysis

Genomic datasets are growing dramatically as the cost of sequencing continues to decline and small sequencing devices become available. Enormous community databases store and share these data with the research community, but some of these genomic data analysis problems require large-scale computational platforms to meet both the memory and computational requirements. These applications differ from scientific simulations that dominate the workload on high-end parallel systems today and place different requirements on programming support, software libraries and parallel architectural design. For example, they involve irregular communication patterns such as asynchronous updates to shared data structures. We consider several problems in high-performance genomics analysis, including alignment, profiling, clustering and assembly for both single genomes and metagenomes. We identify some of the common computational patterns or ‘motifs’ that help inform parallelization strategies and compare our motifs to some of the established lists, arguing that at least two key patterns, sorting and hashing, are missing. This article is part of a discussion meeting issue ‘Numerical algorithms for high-performance computational science’.

59 BASIC BIOLOGICAL SCIENCES↗

Computationally efficient zero-noise extrapolation for quantum-gate-error mitigation

Zero noise extrapolation (ZNE) is a widely used technique for gate error mitigation on near term quantum computers because it can be implemented in software and does not require knowledge of the quantum computer noise parameters. Traditional ZNE requires a significant resource overhead in terms of quantum operations. A recent proposal using a targeted (or random) instead of fixed identity insertion method (riim versus fiim) requires significantly fewer quantum gates for the same formal precision. We start by showing that riim can allow for ZNE to be deployed on deeper circuits than fiim but requires many more measurements to maintain the same statistical uncertainty. We develop two extensions to fiim and riim. The List Identity Insertion Method (liim) allows to mitigate the error from certain cnot gates, typically those with the largest error. Set Identity Insertion Method (siim) naturally interpolates between the measurement-efficient fiim and the gate-efficient riim allowing to trade off fewer cnot gates for more measurements. Finally, we investigate a way to boost the number of measurements, namely to run ZNE in parallel, utilizing as many quantum devices as are available. We explore the performance of riim in a parallel setting where there is a non-trivial spread in noise across sets of qubits within or across quantum computers.

97 MATHEMATICS AND COMPUTING↗

Face Recognition Oak Ridge (FaRO): A Framework for Distributed and Scalable Biometrics Applications

The facial biometrics community has seen a recent abundance of high-accuracy facial analytic models become freely available. Although these models' capabilities in facial detection, landmark detection, attribute analysis, and recognition are ever-increasing, they aren't always straightforward to deploy in a real-world environment. In reality, the use of the field's ever growing collection of models is becoming exceedingly difficult as library dependencies update and deprecate. Researchers often encounter headaches when attempting to utilize multiple models requiring different or conflicting software packages. Face Recognition Oak Ridge (FaRO) is an open-source project designed to provide a highly modular, flexible framework for unifying facial analytic models through a compartmentalized plug-and-play paradigm built on top of the gRPC (Google Remote Procedure Call) protocol. FaRO's server-client architecture and flexible portability allows easy construction of modularized and heterogeneous face analysis pipelines, distributed over many machines with differing hardware and software resources. This paper outlines FaRO's architecture and current capabilities, along with some experiments in model testing and distributed scaling through FaRO.

Bolme, David↗

Real-Time Hardware-in-The-Loop Implementation of Protection and Self-Healing of Microgrids

The design of a reliable protection scheme for microgrids often requires communication between protective devices and microgrid controllers. The authors have developed such a communication assisted scalable protection scheme with a self healing feature to protect a microgrid with 100% Inverter Based Resources (IBRs). The communication assisted scheme must be validated in real time with cyber physical co-simulation for successful demonstration. In this regard, the paper presents a co-simulation platform between a simulated power system model using RTDS and physical protective devices. The primary protection of the scheme is programmed in SEL 421-7 relay and backup protection is programmed in MATLAB on a generic computer acting as a microgrid controller. The IEC 61850 models are used to communicate between SEL-421-7 relay and RTDS, whereas TCP/IP communication connects the microgrid controller to RTDS. The paper’s focus is to demonstrate the co- simulation platform with communication links established using both protocols and validate the proposed scheme in real-time on the IEEE 123 node distribution feeder. The paper explains the configuration of the IEC 61850 and TCP/IP communications as the interface requires proper hardware and software setup. Furthermore, the real time performance indicates the Hardware In the Loop (HIL) framework as a competent testing environment for the developed protection scheme for microgrids.

42 ENGINEERING↗

ExTreeM: Scalable Augmented Merge Tree Computation via Extremum Graphs

Over the last decade merge trees have been proven to support a plethora of visualization and analysis tasks since they effectively abstract complex datasets. Here, this paper describes the ExTreeM-Algorithm: A scalable algorithm for the computation of merge trees via extremum graphs. The core idea of ExTreeM is to first derive the extremum graph G of an input scalar field f defined on a cell complex K, and subsequently compute the unaugmented merge tree of f on G instead of K; which are equivalent. Any merge tree algorithm can be carried out significantly faster on G, since K in general contains substantially more cells than G. To further speed up computation, ExTreeM includes a tailored procedure to derive merge trees of extremum graphs. The computation of the fully augmented merge tree, i.e., a merge tree domain segmentation of K, can then be performed in an optional post-processing step. All steps of ExTreeM consist of procedures with high parallel efficiency, and we provide a formal proof of its correctness. Our experiments, performed on publicly available datasets, report a speedup of up to one order of magnitude over the state-of-the-art algorithms included in the TTK and VTK-m software libraries, while also requiring significantly less memory and exhibiting excellent scaling behavior.

97 MATHEMATICS AND COMPUTING↗

Blockchain smart contracts for energy markets

A successful architecture that depicts the relationship between the energy market engineering requirements and blockchain requirements (shown as enablers). Software includes sequential and relational architectures supported by the UML flow diagrams. For a successful blockchain agnostic implementation of energy markets, the proposed architecture/blueprint supported by prototype implementation is very efficient. The proposed invention also depicts various means of the use of blockchain technology for energy market systems.

Gourisetti, Sri Nikhil Gupta↗

Python Robust Phase Estimation (PyRPE)

Robust Phase Estimation (RPE) is a quantum algorithm to determine the relative phases of eigenstates of a unitary operator. This code implements the classical portion of the RPE algorithm, useful both in simulation (e.g., Sandia's pyGSTi or IBM's Qiskit simulators) and on actual quantum hardware (e.g., IBM's Qiskit Quantum Experience). It additionally implements improvements in these dependent software packages, for both required core function of the RPE and improved usability. SAND2020-12547 M Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA0003525.

Russo, Antonio↗

Renewable Energy Potential Model: Priority Geothermal Leasing Areas ReEDs Results

This dataset contains the results of a study conducted by the National Renewable Energy Laboratory (NREL) to identify potential future priority geothermal leasing areas on Bureau of Land Management (BLM) and United States Forest Service (USFS) lands. The analysis uses the Regional Energy Deployment System (ReEDS) model to evaluate geothermal resource potential under different scenarios of resource depth and technology combinations through the year 2050. The study considers geothermal resource potential, natural resource conflicts, and transmission access to categorize areas into near, mid, and far deployment priorities. The dataset includes outputs from the ReEDS model, such as geothermal capacity, generation, system costs, and emissions under various economic and technical scenarios. Favorability site data with geographic coordinates and site-specific attributes (e.g., resource favorability, land type) are also provided. Supporting resources include a technical report detailing methodologies and assumptions, along with a link to the ReEDS model GitHub repository, which requires GAMS and Python software for execution.

15 GEOTHERMAL ENERGY↗