Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “runtime performance”

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 739 records · Page 41

Fast and accurate reduced-order modeling of a MOOSE-based additive manufacturing model with operator learning

One predominant challenge in additive manufacturing (AM) is to achieve specific material properties by manipulating manufacturing process parameters during the runtime. Such manipulation tends to increase the computational load imposed on existing simulation tools employed in AM. The goal of the present work is to construct a fast and accurate reduced-order model (ROM) for an AM model developed within the Multiphysics Object-Oriented Simulation Environment (MOOSE) framework, ultimately reducing the time/cost of AM control and optimization processes. Our adoption of the operator learning (OL) approach enabled us to learn a family of differential equations produced by altering process variables in the laser’s Gaussian point heat source. More specifically, we used the Fourier neural operator (FNO) and deep operator network (DeepONet) to develop ROMs for time-dependent responses. Furthermore, we benchmarked the performance of these OL methods against a conventional deep neural network (DNN)-based ROM. Ultimately, we found that OL methods offer comparable performance and, in terms of accuracy and generalizability, even outperform DNN at predicting scalar model responses. The DNN-based ROM afforded the fastest training time. Furthermore, all the ROMs were faster than the original MOOSE model yet still provided accurate predictions. FNO had a smaller mean prediction error than DeepONet, with a larger variance for time-dependent responses. Unlike DNN, both FNO and DeepONet were able to simulate time series data without the need for dimensionality reduction techniques. Finally, the present work can help facilitate the AM optimization process by enabling faster execution of simulation tools while still preserving evaluation accuracy.

36 MATERIALS SCIENCE↗

Full Simulation of CMS for Run-3 and Phase-2

In this contribution we report the status of the CMS Geant4 simulation and the prospects for Run-3 and Phase-2. Firstly, we report about our experience during the start of Run-3 with Geant4 10.7.2, the common software package DD4hep for geometry description, and VecGeom runtime geometry library. In addition, FTFP_BERT_EMM Physics List and CMS configuration for tracking in magnetic field have been utilized. For the first time, for the Grid mass production of Monte-Carlo, this combination of components is used. Further simulation improvements are under development targeting Run-3 such as the switch to the new Geant4 11.1 in production, that provides several features important for the optimization of simulation, for example the new transportation process with built-in multiple scattering, neutron general process, custom tracking manager, G4HepEm sub-library, and others. We will present evaluation of various options, validation results, and the final choice of simulation configuration for 2023 production and beyond. The performance of the CMS full simulation for Run-2 and Run-3 will also be discussed. CMS development plan for the Phase-2 Geant4 based simulation is very ambitious, and it includes a new geometry description, physics, and simulation configurations. The progress on new detector descriptions and full simulation will be presented as well as the R&D in progress to reduce compute capacity needs.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

True Load Balancing for Matricized Tensor Times Khatri-Rao Product

MTTKRP is the bottleneck operation in algorithms used to compute the CP tensor decomposition. For sparse tensors, utilizing the compressed sparse fibers (CSF) storage format and the CSF-oriented MTTKRP algorithms is important for both memory and computational efficiency on distributed-memory architectures. Existing intelligent tensor partitioning models assume the computational cost of MTTKRP to be proportional to the total number of nonzeros in the tensor. However, this is not the case for the CSF-oriented MTTKRP on distributed-memory architectures. We outline two deficiencies of nonzero-based intelligent partitioning models when CSF-oriented MTTKRP operations are performed locally: failure to encode processors' computational loads and increase in total computation due to fiber fragmentation. We focus on existing fine-grain hypergraph model and propose a novel vertex weighting scheme that enables this model encode correct computational loads of processors. We also propose to augment the fine-grain model by fiber nets for reducing the increase in total computational load via minimizing fiber fragmentation. In this way, the proposed model encodes minimizing the load of the bottleneck processor. In conclusion, parallel experiments with real-world sparse tensors on up to 1024 processors prove the validity of the outlined deficiencies and demonstrate the merit of our proposed improvements in terms of parallel runtimes.

97 MATHEMATICS AND COMPUTING↗

Predicting Unreinforced Fabric Mechanical Behavior with Recurrent Neural Networks

Unreinforced woven fabrics are widely employed in various high-performance applications, including parachute deployment systems, airbags, and ballistic armor. The analysis of such materials is inherently complex due to the multiscale structure of these materials, and the dependence of macroscale behavior on changes that occur at lower scales. Previously, NASA’s Multiscale Analysis Tool (NASMAT) showed its capability in predicting unreinforced fabric behavior at the macroscale by capturing finite rotations that occur at the mesoscale. Though effective, the tool can face high computational cost for large, complex problems, motivating the need for the development of a surrogate model that can capture the same behavior. A recurrent neural network (RNN) was developed and trained on virtual NASMAT data to mimic the physics-based solutions while improving the computational runtime. The architecture of the RNN to best simulate the fabric behavior was carefully crafted based on heuristic knowledge of predicting physics-based temporal data, manual hyperparameter case studies, and Hyperband optimization.. The resultant model was able to predict a variety of stress-strain curves for fabrics with different mesoscale geometries, and was further validated by comparing to experimental data for the K706 style Kevlar plain-weave fabric, demonstrating the ability of the model to effectively capture the geometric changes in the fabric without explicitly calculating them, as is done in NASMAT. Furthermore, the tool showed its ability to improve on the runtime by a factor of 10 for fabric solutions compared to the multiscale tool, which would further enable the simulation of complex loading scenarios on unreinforced fabrics.

Fabric↗

First Order Temporal Logic Monitoring with BDDs

Runtime verification is aimed at analyzing execution traces stemming from a running program or system. The traditional purpose is to detect the lack of conformance with respect to a formal specification. Numerous efforts in the field have focused on monitoring so-called parametric specifications, where events carry data, and formulas can refer to such. Since a monitor for such specifications has to store observed data, the challenge is to have an efficient representation and manipulation of Boolean operators, quantification, and lookup of data. The fundamental problem is that the actual values of the data are not necessarily bounded or provided in advance. In this work we explore the use of Binary Decision Diagrams (BDDs) for representing observed data. Our experiments show a substantial improvement in performance compared to related work.

Ulus, Dogan↗

Achieving Runtime State Verification Assurance in Critical Cyber-Physical Infrastructures

Industrial Cyber-Physical Systems (ICPS) are an essential backbone of national critical infrastructures. They help monitor and control crucial cyber-enabled services such as energy generation. Commonly ICPS monitors the physical process through Supervisory Control and Data Acquisition (SCADA) systems. The SCADA ecosystem takes critical real-time and future system operational decisions based on the runtime state behavior of field sensors. Traditional SCADA systems use legacy and insecure communication protocols such as the Modbus protocol that lack adequate security mechanisms to provide robust runtime state behavior assurance of constrained field sensors. Therefore, constrained field sensors are commonly vulnerable to standard semantic attacks that gradually change the behavior state of infected devices. This paper discusses process integrity assurance techniques necessary to enhance the security of behavior-based protocols such as the Modbus protocol. The Runtime State Verification (RSV) protocol proposed in this paper aims to address semantic attacks in the SCADA ecosystem by integrating behavior-based Mandatory Results Automata (MRA) and a Hyperledger Fabric (HLF) network. The RSV protocol provides high process integrity assurance through enhanced behavior-based MRA suitable for the constrained field devices. A proof of concept of the RSV protocol has been evaluated in an emulated water-tube boiler. Preliminary evaluations of the RSV protocol aimed to measure the efficiency of the proposed protocol by monitoring an Combustion Efficiency (CE) process necessary to preserve optimal combustion, thus minimizing costs and future maintenance of water-tube boilers. We analyze the overall network overhead and latency of the proposed RSV protocol by evaluating the HLF network performance and comparing the proposed RSV protocol with the state-ofart BloSPAI protocol. Through the preliminary evaluations of the proposed RSV protocol, this paper demonstrates that the proposed RSV protocol overcomes the shortcomings and network overhead of the BloSPAI protocol by integrating behavior-based authentication through novel MRAs and HLF networks.

Rivera, Abel Gomez↗

Dynamic Power Convertor Development for Radioisotope Power Systems at NASA GRC

The Thermal Energy Conversion Branch at NASA Glenn Research Center (GRC) is supporting the development of high-efficiency power convertors in support of Radioisotope Power System (RPS) development. Significant progress was made towards such a system that utilized Stirling conversion machines during the 2001 to 2015 timeframe. Flight development of the Advanced Stirling Radioisotope Generator (ASRG) was cancelled in 2013 by the Department of Energy (DOE) and NASA Headquarters primarily due to budget constraints, and the Advanced Stirling Convertor (ASC) technology contract was subsequently concluded in 2015. A new chapter of technology development has recently been initiated by the NASA RPS Program. This new effort is considering all dynamic power convertor options, such as Stirling and Brayton cycles. Four convertor development contracts supporting this effort were awarded in 2017. The awarded contracts include two free-piston Stirling, one thermoacoustic Stirling, and one turbo-Brayton designs. The technology development contracts each consist of up to three phases: Design, Fabricate, and Test. As of May 2018, all contracts have completed the Design Phase, and each underwent a design review with an independent review board. Two of the contracts have been awarded the Phase 2 option for fabrication. Convertors manifesting from these development efforts will then undergo independent validation and verification at NASA facilities, which will consist of convertor performance and RPS viability demonstrations. Example tests include launch vibration simulation, performance mapping over the environmental temperature range, and static acceleration exposure. In parallel with this renewed development effort, NASA GRC is still demonstrating free-piston Stirling convertor technology using assets from previous projects. The Stirling Research Laboratory (SRL) is still operating 10 convertors from previous development projects. Four of which are flexure-bearing based, and the other six are gas-bearing based. One of the flexure-bearing convertors has accumulated over 110,000 hours of operation, and holds the current maintenance-free heat-engine run-time record. Another flexure-bearing convertor was recently manually shutdown after 105,620 hours of operation, then disassembled and inspected. This inspection produced a wealth of information about the effects of this amount of runtime on the technology's components. One of the engineering unit flexure-bearing convertors recently underwent launch simulation vibration test, a static acceleration exposure up to 20 g, and was then placed on extended operation. Amongst the gas-bearing convertors, the longest running unit has accumulated over 70,000 hours of operation. Four high-fidelity gas-bearing convertors from the ASRG project are still operating continuously, for which the longest runtime has reached 26,000 hours.

Oriti, Salvatore↗

Spatially Explicit Modeling of Criteria Air Pollutants from Agricultural and Forestry Feedstock Production

The Feedstock Production Emissions to Air Model (FPEAM) is a spatially explicit supply chain model that quantifies criteria air pollutants and precursors generated by biomass production, harvest and transportation to biorefineries. FPEAM was most recently used for the 2016 Billion Ton Study (BTS) published by the U.S. Department of Energy Bioenergy Technologies Office. This presentation describes several use cases for the model, and provides an overview of recent restructuring that increases FPEAM's usability and functionality. FPEAM currently estimates emissions of volatile organic compounds, particulate matter, nitrogen oxides, sulfur oxides, and carbon monoxide from on-farm equipment operation, on-farm fugitive dust, on-farm chemical (fertilizer, herbicide and insecticide) application, and biomass transportation. These calculations are implemented within FPEAM as modules, which independently perform calculations for each emissions category. This structure allows users to include or exclude emissions categories according to the goal and scope of their analysis. Each module's input data defines the activities taking place with information including fuel combusted, chemicals applied, and equipment used. Users can replace or augment the default input data to quantify additional pollutant types, emissions categories, farming practices and biomass types. Emissions from biomass transportation and on-farm equipment operation are by default calculated by the U.S. Environmental Protection Agency's Motor Vehicle Emission Simulator (MOVES) and NONROAD model, respectively. These models - which are computationally intensive but provide detailed results - can optionally be replaced with user-provided emissions factors for fuel combustion and vehicle operation. This approach reduces FPEAM's runtime and allows users to run sensitivity analyses around biomass production and transportation scenarios. Other enhancements currently under development are the use of farm-to-biorefinery route information to increase the spatial resolution of transportation emissions, and a module to connect FPEAM and the Intervention Model for Air Pollution (InMAP), which will enable the quantification of human health impacts.

09 BIOMASS FUELS↗

Graph Contractions for Calculating Correlation Functions in Lattice QCD

Computing correlation functions for many-particle systems in Lattice QCD is vital to extract nuclear physics observables like the energy spectrum of hadrons such as protons. However, this type of calculation has long been considered to be very challenging and computing-resource intensive because of the complex nature of a hadron composed of quarks with many degrees of freedom. In particular, a correlation function can be calculated through a sum of all possible pairs of quark contractions, each of which is a batched tensor contraction, dictated by Wick's theorem. Because the number of terms of this sum can be very large for any hadronic system of interest, fast evaluation of the sum faces several challenges: an extremely large number of contractions, a huge memory footprint at runtime, and the speed of tensor contractions. In this paper, we present a Lattice QCD analysis software suite, Redstar, which addresses these challenges by utilizing novel algorithmic and software engineering methods targeting modern computing platforms such as many-core CPUs and GPUs. In particular, Redstar represents every term in the sum of a correlation function by a graph, applies efficient graph algorithms to reduce the number of contractions to lower the cost of computations, and minimizes the total memory footprint. Moreover, Redstar carries out the contractions on either CPUs or GPUs utilizing an internal and highly efficient Hadron contraction library. Specifically, we illustrate some important algorithmic optimizations of Redstar, show various key design features of Hadron library, and present the speedup values due to the optimizations along with performance figures for calculating six correlations functions on four computing platforms.

Chen, Jie↗

Graph Contractions for Calculating Correlation Functions in Lattice QCD

Computing correlation functions for many-particle systems in Lattice QCD is vital to extract nuclear physics observables like the energy spectrum of hadrons such as protons. However, this type of calculation has long been considered to be very challenging and computing-resource intensive because of the complex nature of a hadron composed of quarks with many degrees of freedom. In particular, a correlation function can be calculated through a sum of all possible pairs of quark contractions, each of which is a batched tensor contraction, dictated by Wick's theorem. Because the number of terms of this sum can be very large for any hadronic system of interest, fast evaluation of the sum faces several challenges: an extremely large number of contractions, a huge memory footprint at runtime, and the speed of tensor contractions. In this paper, we present a Lattice QCD analysis software suite, Redstar, which addresses these challenges by utilizing novel algorithmic and software engineering methods targeting modern computing platforms such as many-core CPUs and GPUs. In particular, Redstar represents every term in the sum of a correlation function by a graph, applies efficient graph algorithms to reduce the number of contractions to lower the cost of computations, and minimizes the total memory footprint. Moreover, Redstar carries out the contractions on either CPUs or GPUs utilizing an internal and highly efficient Hadron contraction library. Specifically, we illustrate some important algorithmic optimizations of Redstar, show various key design features of Hadron library, and present the speedup values due to the optimizations along with performance figures for calculating six correlations functions on four computing platforms.

Chen, Jie↗

Direction-optimizing Label Propagation Framework for Structure Detection in Graphs: Design, Implementation, and Experimental Analysis

Label Propagation is not only a well-known machine learning algorithm for classification but also an effective method for discovering communities and connected components in networks. We propose a new Direction-optimizing Label Propagation Algorithm (DOLPA) framework that enhances the performance of the standard Label Propagation Algorithm (LPA), increases its scalability, and extends its versatility and application scope. As a central feature, the DOLPA framework relies on the use of frontiers and alternates between label push and label pull operations to attain high performance. It is formulated in such a way that the same basic algorithm can be used for finding communities or connected components in graphs by only changing the objective function used. Additionally, DOLPA has parameters for tuning the processing order of vertices in a graph to reduce the number of edges visited and improve the quality of solution obtained. We present the design and implementation of the enhanced algorithm as well as our shared-memory parallelization of it using OpenMP. We also present an extensive experimental evaluation of our implementations using the LFR benchmark and real-world networks drawn from various domains. Compared with an implementation of LPA for community detection available in a widely used network analysis software, we achieve at most five times the F-Score while maintaining similar runtime for graphs with overlapping communities. We also compare DOLPA against an implementation of the Louvain method for community detection using the same LFR-graphs and show that DOLPA achieves about three times the F-Score at just 10% of the runtime. For connected component decomposition, our algorithm achieves orders of magnitude speedups over the basic LP-based algorithm on large-diameter graphs, up to 13.2× speedup over the Shiloach-Vishkin algorithm, and up to 1.6× speedup over Afforest on an Intel Xeon processor using 40 threads.

97 MATHEMATICS AND COMPUTING↗

Godiva IV Simulated Radiation Field Characterization and Variance Reduction

Godiva IV is a system comprised of highly enriched uranium alloyed with molybdenum in the form of fuel plate rings. The reactor, along with its predecessors, was designed with the unique ability to satisfy interests in the super-prompt-critical reactor operation space. Originally, the reactor was part of the Los Alamos Critical Experiments Facility (LACEF) at Technical Area-18 (TA-18). The radiation field around Godiva at this facility was well characterized and understood. As a fast neutron system, the neutron spectrum in and around Godiva was close to a Watt Fission spectrum. The Kiva where Godiva IV was located at LACEF was made of thin, sheet metal walls which did not contribute significantly to the neutron spectrum. Following the transition of LACEF to the National Critical Experiments and Research Center (NCERC) in Nevada, Godiva-IV was moved from TA-18 to the Device Assembly Facility (DAF) at the Nevada National Security Site (NNSS). Part of this move brought renewed interest in radiation field characterization. The new facility introduced significant changes to the environment surrounding Godiva, and preliminary foil irradiation results suggested that the room contribution to the neutron spectrum was significant. Unlike at TA-18, a large thermal neutron signature was added to the fast spectrum from Godiva due to significant room return. A primary goal due to the additional complexity that the room return adds to the Godiva IV radiation emission spectrum was the development of an efficient Monte Carlo N-Particle (MCNP) calculation capable of characterizing the neutron spectrum anywhere in the room around Godiva. A campaign of activation foil irradiations and analysis were completed to support the validation of the MCNP model. The modeling of these foils in MCNP can be easily done with a standard volumetric neutron flux tally. However, given the multitude of locations and reaction rates to be modeled, further steps must be taken to increase the efficiency of these calculations in MCNP. During this study, a benchmark model currently under development for Godiva IV was used. A qualitative assessment of the thermal neutron contributors was performed using spatial neutron distribution plots. Additional detail was added to the model based on the qualitative results showing the thermal spectrum’s large sensitivity to hydrogenous material. Neutron energy spectra was evaluated at discrete locations in the room around Godiva to quantify the relative contribution of various components. It was discovered that the concrete walls are the largest contributor to the thermal signature, with minor contributions from plastic components surrounding Godiva. Following these results, two different variance reduction techniques were implemented to improve the problem efficiency in these calculations. In the first approach, an F5 point detector tally was implemented in the standard Godiva IV criticality problem. The second approach involved a weight-window generator implementation with an F5 point detector tally in a fixed source problem. The weight window implementation reduced the runtime from 42739.55 minutes to 1803.34 minutes (computer time), compared to the F5 KCODE implementation.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Dynamic Power Convertor Development for Radioisotope Power Systems at NASA Glenn Research Center

The Thermal Energy Conversion Branch at NASA Glenn Research Center (GRC) is supporting the development of high-efficiency power convertors for use in Radioisotope Power Systems (RPS). Significant progress was made towards such a system that utilized Stirling conversion during the 2001 to 2015 timeframe. Flight development of the Advanced Stirling Radioisotope Generator (ASRG) was cancelled in 2013 by the Department of Energy (DOE) and NASA Headquarters primarily due to budget constraints, and the Advanced Stirling Convertor (ASC) technology contract was subsequently concluded in 2015. A new chapter of technology development has recently been initiated by the NASA RPS Program. This effort is considering all dynamic power convertor options, such as Stirling and Brayton cycles. Four convertor development contracts supporting this effort were awarded in 2017. The awarded contracts include two free-piston Stirling, one thermoacoustic Stirling, and one turbo-Brayton designs. The technology development contracts each consist of up to three phases: Design, Fabricate, and Test. As of May 2018, all contracts have completed the Design Phase, and each underwent a design review with an independent review board. Three of the contracts are planned to execute the Phase 2 option for fabrication. Convertors manifesting from these development efforts will then undergo independent validation and verification at NASA facilities, which will consist of convertor performance and RPS viability demonstrations. Example tests include launch vibration simulation, performance mapping over the environmental temperature range, and static acceleration exposure. In parallel with this renewed development effort, NASA GRC is still demonstrating free-piston Stirling convertor technology using assets from previous projects. The Stirling Research Laboratory (SRL) is still operating several convertors from previous development projects which have similarities and relevance to current contract designs. Four of which are flexure-bearing based, and another six are gas-bearing based. One of the flexure-bearing convertors has accumulated over 110,000 hours of operation, and holds the current record for maintenance-free heat-engine run-time. Another flexure-bearing convertor was recently manually shutdown after 105,620 hours of operation, then disassembled and inspected. This inspection produced a wealth of information about the effects of this amount of runtime on the technology's components. One of the engineering unit flexure-bearing convertors recently underwent launch simulation vibration test, a static acceleration exposure up to 20 g, and was then placed on extended operation. Amongst the gas-bearing convertors, the longest running unit has accumulated over 70,000 hours of operation. Four high-fidelity gas-bearing convertors from the ASRG project are still operating continuously, for which the longest runtime has reached 28,000 hours.

Oriti, Salvatore M.↗

Speed and Memory Improvements to MCNP6 Delayed-Gamma Line Treatment

The delayed-gamma (DG) line-emission (line) sampling was first introduced into MCNPX in 2005. At the time, storage demands for problems with large numbers of DG lines was a major concern. In order to accommodate large amounts of line data while keeping the memory footprint of such a problem from exceeding memory limits, complicated logic was included to sift through various storage options. In mid-2015 concerns arose over the adequacy of the MCNP6 DG source option (inherited from MCNPX) with line sampling for modeling high-fidelity problems. One indication that there was a problem came when studying the MCNP6 produced DG spectra of U-238 and its progeny using high-fidelity spectroscopic tallies when compared to DG line amplitudes directly from ENDF/B-VII.1 emission data. Despite producing a correct integral number of gammas, the comparison to ENDF data showed a broadening in the energy lines and a reduction in the amplitude of more prominent lines. It was later found that the cause of this broadening was one of the memory-saving techniques used to store DG line data when problems required many DG lines. Specifically, the DG lines were integrated into fine energy bins for sampling. When a DG line was to be sampled, a random number would be used to choose which energy bin to sample based on emission probability. Once chosen, a second random number was used to perform nearest-line sampling in that bin. The integration of lines led to an oversampling of low-probability lines, especially when in close proximity to high-probability lines. This treatment also caused a similar issue with the time-dependent behavior of DG line emission which occurred when low-probability lines were sampled near high probability lines with the former decay constant being used. The effect on time-dependent gamma production was demonstrated in analytic benchmarks performed by Weldon et al.. To address these issues a new gamma line storage and sampling treatment was introduced in 2015. This new treatment, stores gamma emission data in a line-by-line CDF which is sampled directly, thereby resolving both the line-broadening issue, and the time-dependence issue as was demonstrated by Tutt el al.. In addition, the new DG sampling treatment was written to use dynamically dimensioned storage arrays as opposed to large fixed-dimensioned arrays, as in the former treatment, and also makes more efficient use of line data that is stored by reducing or eliminating repeated data. As a result, storage arrays are generated only for DG data relevant to the problem being executed. The result should be a reduction in both memory requirements and runtime. However, these reductions could not be realized until the logic for the old treatment could be removed. This paper provides an update on recent work which has focused on the removal of the old DG sampling logic and attempts to quantify the memory reduction and speed up of selected problems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Opportunities for enhancing MLCommons efforts while leveraging insights from educational MLCommons earthquake benchmarks efforts

MLCommons is an effort to develop and improve the artificial intelligence (AI) ecosystem through benchmarks, public data sets, and research. It consists of members from start-ups, leading companies, academics, and non-profits from around the world. The goal is to make machine learning better for everyone. In order to increase participation by others, educational institutions provide valuable opportunities for engagement. In this article, we identify numerous insights obtained from different viewpoints as part of efforts to utilize high-performance computing (HPC) big data systems in existing education while developing and conducting science benchmarks for earthquake prediction. As this activity was conducted across multiple educational efforts, we project if and how it is possible to make such efforts available on a wider scale. This includes the integration of sophisticated benchmarks into courses and research activities at universities, exposing the students and researchers to topics that are otherwise typically not sufficiently covered in current course curricula as we witnessed from our practical experience across multiple organizations. As such, we have outlined the many lessons we learned throughout these efforts, culminating in the need for benchmark carpentry for scientists using advanced computational resources. The article also presents the analysis of an earthquake prediction code benchmark while focusing on the accuracy of the results and not only on the runtime; notedly, this benchmark was created as a result of our lessons learned. Energy traces were produced throughout these benchmarks, which are vital to analyzing the power expenditure within HPC environments. Additionally, one of the insights is that in the short time of the project with limited student availability, the activity was only possible by utilizing a benchmark runtime pipeline while developing and using software to generate jobs from the permutation of hyperparameters automatically. It integrates a templated job management framework for executing tasks and experiments based on hyperparameters while leveraging hybrid compute resources available at different institutions. The software is part of a collection called cloudmesh with its newly developed components, cloudmesh-ee (experiment executor) and cloudmesh-cc (compute coordinator).

58 GEOSCIENCES↗

Efficient online quantum circuit learning with no upfront training

Optimization is a promising candidate for studying the utility of variational quantum algorithms (VQAs). However, evaluating cost functions using quantum hardware introduces runtime overheads that limit exploration. Surrogate-based methods can reduce calls to a quantum computer, yet existing approaches require hyperparameter pre-training and have been tested only on small problems. Here, we show that surrogate-based methods can enable successful optimization at scale, without pre-training, by using radial basis function interpolation (RBF) to construct an adaptive, hyperparameter-free surrogate. Using the surrogate as an acquisition function drives hardware queries to the vicinity of the true optima. For 16-qubit random 3-regular Max-Cut instances with the Quantum Approximate Optimization Algorithm (QAOA), our method outperforms state-of-the-art approaches, without considering their upfront training costs. Furthermore, we successfully optimize QAOA circuits for 127-qubit random Ising models on an IBM processor using 10 4 −10 5 measurements. Strong empirical performance demonstrates the promise of automated surrogate-based learning for large-scale VQA applications.

97 MATHEMATICS AND COMPUTING↗

Intelligent Hardware-Enabled Sensor and Software Safety and Health Management for Autonomous UAS

Unmanned Aerial Systems (UAS) can only be deployed if they can effectively complete their mission and respond to failures and uncertain environmental conditions while maintaining safety with respect to other aircraft as well as humans and property on the ground. We propose to design a real-time, onboard system health management (SHM) capability to continuously monitor essential system components such as sensors, software, and hardware systems for detection and diagnosis of failures and violations of safety or performance rules during the ight of a UAS. Our approach to SHM is three-pronged, providing: (1) real-time monitoring of sensor and software signals; (2) signal analysis, preprocessing, and advanced on-the- y temporal and Bayesian probabilistic fault diagnosis; (3) an unobtrusive, lightweight, read-only, low-power hardware realization using Field Programmable Gate Arrays (FPGAs) in order to avoid overburdening limited computing resources or costly re-certi cation of ight software due to instrumentation. No currently available SHM capabilities (or combinations of currently existing SHM capabilities) come anywhere close to satisfying these three criteria yet NASA will require such intelligent, hardwareenabled sensor and software safety and health management for introducing autonomous UAS into the National Airspace System (NAS). We propose a novel approach of creating modular building blocks for combining responsive runtime monitoring of temporal logic system safety requirements with model-based diagnosis and Bayesian network-based probabilistic analysis. Our proposed research program includes both developing this novel approach and demonstrating its capabilities using the NASA Swift UAS as a demonstration platform.

Robotics↗

Jeagle: a JAVA Runtime Verification Tool

We introduce the temporal logic Jeagle and its supporting tool for runtime verification of Java programs. A monitor for an Jeagle formula checks if a finite trace of program events satisfies the formula. Jeagle is a programming oriented extension of the rule-based powerful Eagle logic that has been shown to be capable of defining and implementing a range of finite trace monitoring logics, including future and past time temporal logic, real-time and metric temporal logics, interval logics, forms of quantified temporal logics, and so on. Monitoring is achieved on a state-by-state basis avoiding any need to store the input trace. Jeagle extends Eagle with constructs for capturing parameterized program events such as method calls and method returns. Parameters can be the objects that methods are called upon, arguments to methods, and return values. Jeagle allows one to refer to these in formulas. The tool performs automated program instrumentation using AspectJ. We show the transformational semantics of Jeagle.

DAmorim, Marcelo↗