SEARCH · Engineering Papers
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.
The efficacy of dual quaternion spaceflight guidance, navigation and control (GNC) systems was investigated by developing a dual quaternion GNC system and computing its computational complexity for comparison to traditional GNC styles.
Microprocessor, Graphics Processing Units (GPUs) and DDRx memory devices have emerged as promising next-generation technologies that enables both high performance processing and acceleration of complex algorithms for the latest challenges in human spaceflight, autonomous vehicles and artificial intelligence (AI). The feature sets of these devices offer exponential increases to throughput, calculation capability and system autonomy when compared to legacy flight systems. NASA's Electronic Part and Packaging (NEPP) Program has conducted an investigation into the radiation susceptibility of leading edge devices and process technologies by establishing standardized test approaches. Unlike most discrete devices, these require state of the art test systems to induce specific hardware activity similar to application software, thus allowing the characterization of failure modes within the system. To best characterize the tested part, NEPP eliminates variables that may impact device performance under radiation. Simplification of remaining system-level variables leads to an improved understanding of complex computational devices and their intended applications. The failure modes and error signatures that are recorded during testing are used to determine radiation sensitivity of the semiconductor process and the microcode architecture of the design. This presentation will discuss the test methodology that NASA Electronic Parts and Packaging (NEPP) is working to establish for its microprocessor, GPU and DDRx memory test programs to provide guidance on these devices and their underlying technology, in regards to their potential usage in future space flight systems.
Data aggregation is the ability to combine separate datasets to form a single new logical dataset provides users with a powerful abstraction. The advantage of an aggregate dataset is that the users are freed from having to understand, and incorporate into their workflow, knowledge about the (ad hoc) organization of the constituent datasets. However, aggregating large numbers of files can be computationally complex with data server systems performing many repetitive operations. As part of the authors work on subsetting data stored on Amazon Web Service (AWS) Simple Storage Service (S3), we developed technology to read portions of otherwise monolithic data files. This enables the formation of virtual shards for user in subsetting data stored in HDF5 (hierarchical data format, version 5) files. This same tool can be used to form aggregations that combine data stored in many HDF5 files when those files are stored on S3. The nature of the virtual sharding and the algorithm that exploits it for subsetting is such that it can also be used for aggregation with the need for many of the repetitive operations required by the per file aggregation techniques. We will present timing information that demonstrates the flexibility of this approach. However, the lessons learned is that while this is a useful result in and of itself, these very same techniques can be applied in other contexts where data are stored in services and on media other than S3. For example, this same technique can be applied to data stored on spinning disk. Pushing the envelope for S3 forced a reexamination of our data access techniques which lead to unexpected positive benefits.
Complex computational simulations are needed to support the Space Launch System (SLS) program, and the fidelity of the computational results must be defended. More specifically, a number of databases are produced for the transition phase of flight, which occurs after the rocket clears the tower but before reaching transonic speeds. In an effort to reduce computational uncertainty, many of the computational parameters were altered to determine the sensitivity of the results to the value of the parameter and then updating the best practice procedures. The baseline routines were developed over many years through the maturation of the SLS program, and this paper delivers a detailed discussion of these baseline results. This section is followed by demonstration of perturbing some of the more significant parameters, including time step and turbulence model, and concluded with a summary of the herein determined best practices for such analysis.
Identification of flood water extent from satellite images has historically relied on either synthetic aperture radar (SAR) or multi-spectral (MS) imagery. MS sensors are limited to cloud free conditions, whereas SAR imagery is plagued by noise-like speckle. Prior studies that use combinations of MS and SAR data to overcome individual limitations of these sensors have not fully examined sensitivity of flood mapping performance to different combinations of SAR and MS derived spectral indices or band transformations in color space. This study explores the use of diverse bands of Sentinel 2 (S2) through well-established water indices and Sentinel 1 (S1) derived SAR imagery along with their combinations to assess their capability for generating accurate flood inundation maps. The robustness in performance of S-1 and S-2 band combinations was evaluated using 446 hand labeled flood inundation images spanning across 11 flood events from Sen1Floods11 dataset which are highly diverse in terms of land cover as well as location. A modified K-fold cross validation approach is used to evaluate the performance of 32 combinations of S1 and S2 bands using a fully connected deep convolutional neural network known as U-Net. Our results indicated that usage of elevation information has improved the capability of S1 imagery to produce more accurate flood inundation maps. Compared to a median F1 score of 0.62 when using only S1 bands, the combined use of S1 and elevation information led to an improved median F1 score of 0.73. Water extraction indices based on S2 bands have a statistically significant superior performance in comparison to S1. Among all the band combinations, HSV (Hue, Saturation, Value) transformation of S2 bands provides a median F1 score of 0.9, outperforming the commonly used water spectral indices owing to HSV’s transformation’s superior contrast distinguishing abilities. Additionally, U-Net algorithm was able to learn the relationship between raw S2 based water extraction indices and their corresponding raw S2 bands, but not of HSV owing to relatively complex computation involved in the latter. Results of the paper establishes important benchmarks for the extension of S1 and S2 data-based flood inundation mapping efforts over large spatial extents.
Stoquastic Hamiltonians play a role in the computational complexity of the local Hamiltonian problem as well as the study of classical simulability. In particular, stoquastic Hamiltonians can be straightforwardly simulated using Monte Carlo techniques. We address the question of whether two or more Hamiltonians may be made simultaneously stoquastic via a unitary transformation. This question has important implications for the complexity of simulating quantum annealing where quantum advantage is related to the stoquasticity of the Hamiltonians involved in the anneal. We find that for almost all problems no such unitary exists and show that the problem of determining the existence of such a unitary is equivalent to identifying if there is a solution to a system of polynomial (in)equalities in the matrix elements of the initial and transformed Hamiltonians. Solving such a system of equations is NP-hard. We highlight a geometric understanding of this problem in terms of a collection of generalized Bloch vectors.
Stoquastic Hamiltonians play a role in the computational complexity of the local Hamiltonian problem as well as the study of classical simulability. In particular, stoquastic Hamiltonians can be straightforwardly simulated using Monte Carlo techniques. We address the question of whether two or more Hamiltonians may be made simultaneously stoquastic via a unitary transformation. This question has important implications for the complexity of simulating quantum annealing where quantum advantage is related to the stoquasticity of the Hamiltonians involved in the anneal. We find that for almost all problems no such unitary exists and show that the problem of determining the existence of such a unitary is equivalent to identifying if there is a solution to a system of polynomial (in)equalities in the matrix elements of the initial and transformed Hamiltonians. Solving such a system of equations is NP-hard. We highlight a geometric understanding of this problem in terms of a collection of generalized Bloch vectors.
P-band radiometry has been demonstrated to have a deeper sensing depth than at L-band, making the consideration of multi-layer microwave interactions necessary. Additionally, the scattering and phase interference effects are different at P-band, requiring a re-consideration of the need for coherent models. However, the impact remains to be clarified, and understanding the validity and limitations of these models at both L-band and P-band is crucial for their refinement and application. Therefore, two general categories of microwave emission models, including two stratified coherent models (Njoku and Wilhite) and four incoherent models (conventional tau-omega model and three multi-layer models being zero-order, first-order, and incoherent solution), were intercompared for the first time on the same dataset. This evaluation utilized observations of L-band and P-band radiometry under different land cover conditions from a tower-based experiment in Victoria, Australia. Model estimations of brightness temperature (TB) were consistent with measurements, with the lowest root mean square error (RMSE) at P-band V-polarization under corn (2 K) and the highest RMSE at L-band H-polarization under bare soil (13 K). Coherent models performed slightly better than incoherent models under bare soil (3 K less RMSE), while the opposite was true under vegetated soil conditions (1 K less RMSE). Coherent and incoherent models showed maximum differences (3 K at P-band, 2 K at L-band), correlating strongly with soil moisture variations at 0-10 cm. Findings suggest that coherent and incoherent models perform similarly; thus, incoherent models may be preferable for estimating TB at L- and P-band due to reduced computational complexity.
This paper present a new sequential filter for state estimation using measurements corrupted with Cauchy noise. The new filter retains the familiar structure of the Kalman filter and is computationally efficient. In addition, it does not exhibit computational complexity which grows or varies in time like existing methods. These results are based upon a nearly 50 year old result by Masreliez in which the conditional mean estimator is approximated via linearization of the measurement predictive density. This work derives the new filter, provides discussion regarding practical implementation, and present Monte Carlo analyses to validate and assess the new filter's performance.
The code for Forced Response Aeromechanics Analysis in a MATLAB-based (The MathWorks, Inc.) Environment (FRAAME Version 1.0) was developed for internal use in aeromechanics efforts undertaken at the NASA Glenn Research Center for computing turbomachine component forced response and Goodman diagrams via modal summation method. The main working script (FRAAMEv1.m) allows users to input case-specific manual inputs while the triple-nested loop invokes functions to compute forced response per blade, per nodal diameter, and per mode. Secondly, forced response values are applied to modal stresses to compute complex Von Mises stress values and generate Goodman diagrams per blade, per nodal diameter, and per mode using a linear modal summation method. Currently, this code functions in the Windows (Microsoft Corporation) operating system using MATLAB Version R2023a, but it can be adapted for use in the Linux (Linus Torvalds) operating system by changing the appropriate file path structure in the main script, as well as functions that call external results files.
Sulfur dioxide (SO2) is a criteria air pollutant due to its contributions to aerosol formation, rainfall acidification, and harm to human health. The placement of air quality monitoring sites is typically biased towards urban areas, leaving large areas with very limited monitoring data. The Ozone Monitoring Instrument (OMI) has been used to provide estimates of SO2 vertical column densities (VCDs) globally at spatial resolution of 10s of kms once per day. OMI SO2 VCDs have been previously used to estimate surface SO2 concentrations using chemical transport model (CTM) simulations. The CTMs use estimated emissions and assimilated meteorological data, and simulate the chemical and physical processes that determine the vertical profile of SO2, which can be used to derive a ratio between the surface concentrations and VCDs. These models are complex, computationally expensive, and have large uncertainties in the simulated surface-to-VCD ratio due to biases in emissions and relatively coarse resolution. Machine learning techniques are comparatively easier to use, much less computationally expensive to use after training, and can produce more accurate estimations of surface concentrations than the CTM-based method. The interpretation of machine learning models often poses challenges, and in some cases, non-physical variables unrelated to SO2 are used as predictors. In this work, we create an artificial neural network (ANN) to relate OMI retrievals and archived GEOS-FP boundary layer heights to surface SO2 concentrations from the ChinaHighAirPollutants ChinaHighSO2 dataset (CHAP; Wei et al., 2023) on a seasonal average timescale from 2013-2018. Our model only utilizes five variables that are directly relevant to the satellite retrieval, lifetime, and spatial distribution of SO2. The model was trained on 16 seasons (four of each) with independent validation (one of each season) and testing datasets (one of each season) to avoid overfitting. Our ANN generates surface SO2 concentrations that are sensitive (slope = 0.51) and consistent (r = 0.74) with the CHAP data, but are underpredicted by an average of 1.2 ppbv with a mean absolute error of 2.2 ppbv. These results are better than recent studies utilizing the CTM method. To our knowledge, this is the best performing machine learning model that only uses physical variables to predict surface SO2. Our work demonstrates that a carefully constructed, simple ML model can accurately estimate surface-based SO2 concentrations from satellite VCD measurements, and this technique has future promise to expend to newer, higher resolution satellites and other air pollutants.
In this paper, we develop a grid-interactive multi-zone building controller based on a deep reinforcement learning (RL) approach. The controller is designed to facilitate building operation during normal conditions and demand response events, while ensuring occupants comfort and energy efficiency. We leverage a continuous action space RL formulation, and devise a two-stage global-local RL training framework. In the first stage, a global fast policy search is performed using a gradient-free RL algorithm. In the second stage, a local fine-tuning is conducted using a policy gradient method. In contrast to the state-of-the-art model predictive control (MPC) approach, the proposed RL controller does not require complex computation during real-time operation and can adapt to non-linear building models. We illustrate the controller performance numerically using a five-zone commercial building.
As the HVAC&R industry mobilizes to deploy more low-GWP refrigerants, relevant standards are being continually reviewed and updated. Those include the general safety standards ISO 5149 and ASHRAE 15, and the equipment standards IEC and UL. The standards systematically set the allowable maximum amount of refrigerant that should be used in different equipment types and different applications. To do so, they rely on predictions of how a leaked refrigerant mass will disperse into a space. Dispersion characteristics, such as total flammable volume and its residence time, determine the risk associated with the presence of the flammable refrigerant. The standards have included provisions for the use of flammable refrigerants for approximately two decades. They relied on limited analytical analyses and test cases in their development. Dispersion of a refrigerant into a space is complex. Computational fluid dynamics (CFD) are the most accurate in predicting a given problem. However, CFD is computationally expensive and requires specialized expertise and resources and is not suitable for use by standards development working group as prediction tool. This paper presents the development of a reduced order model (ROM) that predicts the key dispersion characteristics relevant to the dispersion of a leaked refrigerant into a space for any combination of input variables. The inputs are the refrigerant release height, the total released refrigerant mass and its release flow rate, the refrigerant molecular weight, the ventilation flow rate, the floor area and height of the space, recirculation air flow rate, and the tightness of the space. The outputs are histograms of volume fraction of the room in prescribed concentration bins and the total mass of the refrigerant in each bin normalized by the total refrigerant charge at 13 prescribed simulation time stamps between 1 and 900 seconds. The ROM is constructed from a set of CFD simulations with carefully chosen combinations of input parameters. The selection if done using a multidimensional sparse grid which is a generalization of the classical tensor approach but offers additional flexibility and thus can be more carefully tuned towards a specific model. The tuning is done to improve the accuracy, measured in the difference between the output values of the ROM and the CFD model, while minimizing the computational cost, measured in number of CFD simulations which is orders of magnitude more expensive than the processing the training data.
We consider the power allocation problem over shared spectrum for millimeter-Wave (mmWave) cellular downlink. Existing approaches usually find sub-optimal solutions by solving a non-convex optimization which leads to scalability issues due to centralized control. Therefore, distributed and adaptive approaches are desirable. Recently, model-free Deep Reinforcement Learning (DRL) has achieved success in such wireless resource management tasks. By modeling the radio environment as a Markov Decision Process (MDP) with the base stations (BSs) being the agents, power allocation can be automated at the agent level with comparable throughput performance to conventional centralized schemes. The multi-agent setting presents new challenges as the radio environment is impacted by the joint actions of the agents and is no longer stationary from any individual agent’s perspective. Existing literature bypasses this non-stationarity violation by ignoring it which may cause performance degradation. To tackle this issue, we propose a distributed continuous power allocation scheme based on a modified version of multi-agent Deep Deterministic Policy Gradient (MADDPG) that is tailored for the distributed multiple-agent setting. The proposed scheme employs a centralized-training distributed-execution framework where Q-functions are trained over subsets of BSs while each BS determines its transmit power based only on its own local observation. It admits constant per-BS communication and computation complexity and is thus scalable to large networks. Numerical evaluation shows that the proposed scheme adapts well to a wide range of interference conditions and can achieve comparable or better performance than several state-of-the-art non-learning approaches.
Nature performs complex computations constantly at clearly lower cost and higher performance than digital computers. It is crucial to understand how to harness the unique computational power of nature in Machine Learning (ML). In the past decade, besides the development of Neural Networks (NNs), the community has also relentlessly explored nature-powered ML paradigms. Although most of them are still predominantly theoretical, a new practical paradigm enabled by the recent advent of CMOS-compatible room-temperature nature-based computers has emerged. By harnessing the nature's power of entropy increase, this paradigm can solve binary learning problems delivering immense speedup and energy savings compared with NNs, while maintaining comparable accuracy. Regrettably, its values to the real world are highly constrained by its binary nature. A clear pathway to its extension to real-valued problems remains elusive. This paper aims to unleash this pathway by proposing a novel end-to-end Nature-Powered Graph Learning (NP-GL) framework. Specifically, through a three-dimensional co-design, NP-GL can leverage the nature's power of entropy increase to efficiently solve real-valued graph learning problems. Experimental results across 4 real-world applications with 6 datasets demonstrate that NP-GL delivers, on average, 6970X speedup and 10^5x energy consumption reduction with comparable or even higher accuracy than Graph Neural Networks (GNNs).
This paper presents a Dynamic Internal Predictive Power Scheduling (DIPPS) approach for optimizing power management in microgrids, particularly focusing on external power exchanges among diverse prosumers. DIPPS utilizes a dynamic objective function with a time-varying binary parameter to control the timing of power transfers to the external grid, facilitated by efficient usage of energy storage for surplus renewable power. The microgrid power scheduling problem is modeled as a mixed-integer nonlinear programming (MINLP-PS) and subsequently transformed into a mixed-integer linear programming (MILPPS) optimization through McCormick's relaxation to reduce computational complexity. A predictive window window with 6 data points is solved at an average of 0.92s, a 97.6% improvement over the 38.27s required for the MINLP-PS formulation, implying the numerical feasibility of the DIPPS approach for real-time implementation. Finally, the approach is validated against a static objective using real-world load data across three case studies with different time-varying parameters, demonstrating the ability of DIPPS to optimize power exchanges and efficiently utilize distributed resources while shifting the external power transfers to specified time durations.
We present the first sub-microsecond transformer implementation on an FPGA achieving competitive performance for state-of-the-art high-energy physics benchmarks. Transformers have shown exceptional performance on multiple tasks in modern machine learning applications, including jet tagging at the CERN Large Hadron Collider (LHC). However, their computational complexity prohibits use in real-time applications, such as the hardware trigger system of the collider experiments up until now. In this work, we demonstrate the first application of transformers for jet tagging on FPGAs, achieving $\mathcal{O}(100)$ nanosecond latency with superior performance compared to alternative baseline models. We leverage high-granularity quantization and distributed arithmetic optimization to fit the entire transformer model on a single FPGA, achieving the required throughput and latency. Furthermore, we add multi-head attention and linear attention support to hls4ml, making our work accessible to the broader fast machine learning community. This work advances the next-generation trigger systems for the High Luminosity LHC, enabling the use of transformers for real-time applications in high-energy physics and beyond.
Computing architectures are being assembled that extend concurrent engineering practices by providing more efficient execution and collaboration on distributed, heterogeneous computing networks. Built on the successes of initial architectures, requirements for a next-generation design computing infrastructure can be developed. These requirements concentrate on those needed by a designer in decision-making processes from product conception to recycling and can be categorized in two areas: design process and design information management. A designer both designs and executes design processes throughout design time to achieve better product and process capabilities while expanding fewer resources. In order to accomplish this, information, or more appropriately design knowledge, needs to be adequately managed during product and process decomposition as well as recomposition. A foundation has been laid that captures these requirements in a design architecture called DREAMS (Developing Robust Engineering Analysis Models and Specifications). In addition, a computing infrastructure, called IMAGE (Intelligent Multidisciplinary Aircraft Generation Environment), is being developed that satisfies design requirements defined in DREAMS and incorporates enabling computational technologies.