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.
This fact sheet provides an overview of trends and barriers related to disclosure of climate and resilience performance. It reviews major reporting frameworks for resilience, compares the frameworks, and provides next steps for building owners.
There is an opportunity to save energy and reduce operational expenses when choosing a suitable desalination method aided by computational modeling. Existing models are not conducive to generalized comparisons between different desalination methods. Therefore, the work in this study developed metamodels for six desalination methods, grouped them into thermal and molecular transport families, and validated their predictive performance within 9% difference from published data. This validated framework allowed comparisons of desalination methods at their prescribed ranges of operational conditions that they were designed for. These conditions specify feed salinity ranges of 1.6 to 2.4 g/kg for Capacitive Deionization and Reverse Osmosis (RO), 2.8 to 4.2 g/kg for Electrodialysis, 28 to 42 g/kg for Thermovapor Compression and Humidification-Dehumidification, and 37 to 55 g/kg for Multi-Effect Distillation (MED). Despite different operational conditions, all models exhibit non-linear, positive correlation between energy consumption and system size in response to feed salinity and production rate. The framework is also employed in a cross-comparative analysis between MED and RO whose results suggest that energy intensity for MED is an order of magnitude greater than RO for the same operational conditions, but actual operational costs are comparable. Overall, the framework is ready for deployment in case studies of actual desalination plants.
Diagnostic inference involves the detection of anomalous system behavior and the identification of its cause, possibly down to a failed unit or to a parameter of a failed unit. Traditional approaches to solving this problem include expert/rule-based, model-based, and data-driven methods. Each approach (and various techniques within each approach) use different representations of the knowledge required to perform the diagnosis. The sensor data is expected to be combined with these internal representations to produce the diagnosis result. In spite of the availability of various diagnosis technologies, there have been only minimal efforts to develop a standardized software framework to run, evaluate, and compare different diagnosis technologies on the same system. This paper presents a framework that defines a standardized representation of the system knowledge, the sensor data, and the form of the diagnosis results and provides a run-time architecture that can execute diagnosis algorithms, send sensor data to the algorithms at appropriate time steps from a variety of sources (including the actual physical system), and collect resulting diagnoses. We also define a set of metrics that can be used to evaluate and compare the performance of the algorithms, and provide software to calculate the metrics.
There is no universal model for thixotropy, and comparing thixotropic effects between different fluids is a subtle yet challenging problem. We introduce a generalized (model-insensitive) framework for comparing thixotropic properties based on thixotropic spectra. A superposition of exponential stress modes distributed over thixotropic time scales is used to quantify buildup and breakdown times and mode strengths in response to step-change input. This mathematical framework is tested with several experimental step-shear rate data on colloidal suspensions. Low-dimensional metrics based on moments of the distribution reveal characteristic average thixotropic properties, which are visualized on Ashby-style diagrams. This method outlines a framework for describing thixotropy across a diverse range of microstructures, supporting scientific studies as well as material selection for engineering design applications.
We apply a nonlinearly preconditioned, quasi-Newton framework to accelerate the numerical solution of the thermal radiative transfer (TRT) equations. This framework was inspired by the unpublished method that has existed for years in Teton, Lawrence Livermore National Laboratory’s deterministic TRT code. In this paper, we cast this iteration scheme within a formal nonlinear preconditioning framework and compare its performance against other iteration schemes in the framework. With proper choices of iteration controls for the various levels of the solver, we can recover the standard linearized one-step method, a full nonlinear Newton scheme, as well as the method in Teton. In brief, the nonlinear preconditioning TRT scheme formally eliminates the material temperature equation from the nonlinear system in a nonlinear analog of a Schur complement. This nonlinear elimination step involves solving a decoupled nonlinear equation for each spatial degree of freedom and is therefore inexpensive. By applying a quasi-Newton iteration scheme on the new system, we obtain a three-level iteration scheme that is at least as efficient as commonly used TRT schemes. The new method allows full convergence to the nonlinear backward Euler time-discretized system, increasing accuracy and robustness, while using a similar number of linear iterations as the more common linearized one-step methods Eq. (4).
Accurately representing synoptic near-surface temperature variability is crucial to predict weather extremes, yet models remain biased. Existing studies primarily attribute wintertime midlatitude near-surface temperature variability to tropospheric large-scale advection, assuming minimal land influence. However, nudging the model's circulation toward observations yields little improvement in wintertime temperature variance over Northern Hemisphere land, suggesting that land-atmosphere interactions also warrant attention. We introduce a new scaling framework for temperature variance that incorporates local land-atmosphere feedbacks. Comparing our framework to the mixing length approach—which links temperature variance to the meridional temperature gradient and air parcel displacement (mixing length)—shows that land-atmosphere feedbacks are inherently embedded in the mixing length, a connection previously overlooked. Roles of land–atmosphere feedbacks are evaluated via model experiments with perturbed circulation, land, or both. We find that longwave radiative damping dominates temperature variance responses over meridional temperature gradient when both land and circulation are perturbed.
The Sparsely Distributed Memory (SDM) model (Kanerva, 1984) is compared to Hopfield-type neural-network models. A mathematical framework for comparing the two is developed, and the capacity of each model is investigated. The capacity of the SDM can be increased independently of the dimension of the stored vectors, whereas the Hopfield capacity is limited to a fraction of this dimension. However, the total number of stored bits per matrix element is the same in the two models, as well as for extended models with higher order interactions. The models are also compared in their ability to store sequences of patterns. The SDM is extended to include time delays so that contextual information can be used to cover sequences. Finally, it is shown how a generalization of the SDM allows storage of correlated input pattern vectors.
Weather forecasting has been a critical component to predict and control building energy consumption for better building energy management. Without accessibility to other data sources, the onsite observed temperatures or the airport temperatures are used in forecast models. In this paper, we present a novel approach by utilizing the crowdsourcing weather data from neighboring personal weather stations (PWS) to improve the weather forecast accuracy around buildings using a general spatial-temporal modeling framework. The final forecast is based on the ensemble of local forecasts for the target location using neighboring PWSs. Our approach is distinguished from existing literature in various aspects. First, we leverage the crowdsourcing weather data from PWS in addition to public data sources. In this way, the data is at much finer time resolution (e.g., at 5-minute frequency) and spatial resolution (e.g., arbitrary location vs grid). Second, our proposed model incorporates spatial-temporal correlation information of weather variables between the target building and a set of neighboring PWSs so that underlying correlations can be effectively captured to improve forecasting performance. Here, we demonstrate the performance of the proposed framework by comparing to the benchmark models on temperature forecasting for a building located at an arbitrary location at San Antonio, Texas, USA. In general, the proposed model framework equipped with machine learning technique such as Random Forest can improve forecasting by 50% compares with persistent model and has 90% chance to outperform airport forecast in short-term forecasting. In a real-time setting, the proposed model framework can provide more accurate temperature forecasting results compared with using airport temperature forecast for most forecast horizon. Moreover, we analyze the sensitivity of model parameters to gain insights on how crowdsourcing data from the neighboring personal weather stations impacts forecasting performance. Finally, we implement our model in other cities such as Syracuse and Chicago to test the model's performance in different landforms and climate types.
Abstract Streaming graph processing performs batched updates and analytics on a time-evolving graph. The underlying representation format of the graph largely determines the throughputs of these updates and analytics phases. Existing representation formats usually employ variations of hash tables or adjacency lists. However, a recent study showed that the adjacency-list-based approaches perform poorly on heavy-tailed graphs, and the hash table-based approaches suffer on short-tailed graphs. We propose GraphTango, a hybrid representation format that provides excellent update and analytics throughput regardless of the graph’s degree distribution. GraphTango dynamically switches among three different formats based on a vertex’s degree: (i) Low-degree vertices store the edges directly with the neighborhood metadata, confining accesses to a single cache line, (2) Medium-degree vertices use adjacency lists, and (3) High-degree vertices use hash tables as well as adjacency lists. In this case, the adjacency list provides fast traversal during the analytics phase, while the hash table provides constant-time lookups during the update phase. We further optimized the performance by designing an open-addressing-based hash table that fully utilizes every fetched cache line. In addition, we developed a thread-local lock-free memory pool that allows fast growing/shrinking of the adjacency lists and hash tables in a multi-threaded environment. We evaluated GraphTango with the help of the SAGA-Bench framework and compared it with four other representation formats: Stinger, Degree-aware Robin Hood Hashing, and two adjacency list-based formats with different workload balancing scheme. On average, GraphTango provides 4.5x higher insertion throughput, 3.2x higher deletion throughput, and 1.1x higher analytics throughput over the next best format. Furthermore, we integrated GraphTango with the state-of-the-art graph processing frameworks DZiG and RisGraph. Compared to the vanilla DZiG and vanilla RisGraph , [ GraphTango + DZiG ] and [ GraphTango + RisGraph ] reduces the average batch processing time by 2.3x and 1.5x, respectively.
A framework to compare and evaluate diagnosis algorithms (DAs) has been created jointly by NASA Ames Research Center and PARC. In this paper, we present the first concrete implementation of this framework as a competition called DXC 09. The goal of this competition was to evaluate and compare DAs in a common platform and to determine a winner based on diagnosis results. 12 DAs (model-based and otherwise) competed in this first year of the competition in 3 tracks that included industrial and synthetic systems. Specifically, the participants provided algorithms that communicated with the run-time architecture to receive scenario data and return diagnostic results. These algorithms were run on extended scenario data sets (different from sample set) to compute a set of pre-defined metrics. A ranking scheme based on weighted metrics was used to declare winners. This paper presents the systems used in DXC 09, description of faults and data sets, a listing of participating DAs, the metrics and results computed from running the DAs, and a superficial analysis of the results.
Brain evolution has primarily been studied at the macroscopic level by comparing the relative size of homologous brain centers between species. How neuronal circuits change at the cellular level over evolutionary time remains largely unanswered. Here, using a phylogenetically informed framework, we compare the olfactory circuits of three closely related Drosophila species that differ in their chemical ecology: the generalists Drosophila melanogaster and Drosophila simulans and Drosophila sechellia that specializes on ripe noni fruit. We examine a central part of the olfactory circuit that, to our knowledge, has not been investigated in these species—the connections between projection neurons and the Kenyon cells of the mushroom body—and identify species-specific connectivity patterns. We found that neurons encoding food odors connect more frequently with Kenyon cells, giving rise to species-specific biases in connectivity. These species-specific connectivity differences reflect two distinct neuronal phenotypes: in the number of projection neurons or in the number of presynaptic boutons formed by individual projection neurons. Finally, behavioral analyses suggest that such increased connectivity enhances learning performance in an associative task. Our study shows how fine-grained aspects of connectivity architecture in an associative brain center can change during evolution to reflect the chemical ecology of a species.
Abstract. To make predictions about the carbon cycling consequences of rising global surface temperatures, Earth system scientists rely on mathematical soil biogeochemical models (SBMs). However, it is not clear which models have better predictive accuracy, and a rigorous quantitative approach for comparing and validating the predictions has yet to be established. In this study, we present a Bayesian approach to SBM comparison that can be incorporated into a statistical model selection framework. We compared the fits of linear and nonlinear SBMs to soil respiration data compiled in a recent meta-analysis of soil warming field experiments. Fit quality was quantified using Bayesian goodness-of-fit metrics, including the widely applicable information criterion (WAIC) and leave-one-out cross validation (LOO). We found that the linear model generally outperformed the nonlinear model at fitting the meta-analysis data set. Both WAIC and LOO computed higher overfitting risk and effective numbers of parameters for the nonlinear model compared to the linear model, conditional on the data set. Goodness of fit for both models generally improved when they were initialized with lower and more realistic steady-state soil organic carbon densities. Still, testing whether linear models offer definitively superior predictive performance over nonlinear models on a global scale will require comparisons with additional site-specific data sets of suitable size and dimensionality. Such comparisons can build upon the approach defined in this study to make more rigorous statistical determinations about model accuracy while leveraging emerging data sets, such as those from long-term ecological research experiments.
The computational modeling of nearly incompressible materials is a difficult task for many numerical methods, and even after several decades of investigation, it is still an active research area. This report seeks to address the treatment of incompressible materials in meshfree methods using a synergistic combination of two treatments. The first treatment is an $\bar{F}$ method, where the decomposed dilatational and deviatoric parts are calculated over different smoothing domains. The second treatment “activates” additional nodes throughout the domain to increase the flexibility of the model. We implement this synergistic combination in the context of the reproducing kernel particle method (RKPM) and present results for the Cook’s membrane benchmark problem. The results are compared with those using the composite tet10 finite element with a volume-averaged J formulation. We show that the combined treatment is an effective way to deal with nearly incompressible materials in a meshfree framework and compares well with other highly-effective treatments.
Conference paper titled, Comparing microclimate weather conditions from the weather research and forecasting (WRF) model with typical meteorological year (TMY) data for building energy simulations accepted for Building Simulation 2025 Conference in Brisbane, Australia in Aug 2025.
The ability to track simulated cancer cells through the circulatory system, important for developing a mechanistic understanding of metastatic spread, pushes the limits of today's supercomputers by requiring the simulation of large fluid volumes at cellular-scale resolution. To overcome this challenge, we introduce a new adaptive physics refinement (APR) method that captures cellular-scale interaction across large domains and leverages a hybrid CPU-GPU approach to maximize performance. Through algorithmic advances that integrate multi-physics and multi-resolution models, we establish a finely resolved window with explicitly modeled cells coupled to a coarsely resolved bulk fluid domain. In this work we present multiple validations of the APR framework by comparing against fully resolved fluid-structure interaction methods and employ techniques, such as latency hiding and maximizing memory bandwidth, to effectively utilize heterogeneous node architectures. Collectively, these computational developments and performance optimizations provide a robust and scalable framework to enable system-level simulations of cancer cell transport.
Measuring the growth rate of large-scale structures ( f ) as a function of redshift has the potential to break degeneracies between modified gravity and dark energy models, when combined with expansion-rate probes. Direct estimates of peculiar velocities of galaxies have attracted interest as a means of estimating fσ 8 . In particular, field-level methods can be used to fit the field nuisance parameter along with cosmological parameters simultaneously. This article aims to provide the community with a unified framework for the theoretical modeling of the likelihood-based field-level inference by performing fast field covariance calculations for velocity and density fields. Our purpose is to lay the foundations for a nonlinear extension of the likelihood-based method at the field level. We have developed a generalized framework, implemented in the dedicated software flip to perform a likelihood-based inference of fσ 8 . We derived a new field covariance model, which includes wide-angle corrections. We also included the models previously described in the literature inside our framework. We compared their performance against ours, and we validated our model by comparing it with the two-point statistics of a recent N-body simulation. The tests we performed have allowed us to validate our software and determine the appropriate wavenumber range to integrate our covariance model and its validity in terms of separation. Our framework allows for a wider wavenumber coverage to be used in our calculations than in previous works, which is particularly interesting for nonlinear model extensions. Finally, our generalized framework allows us to efficiently perform a survey geometry-dependent Fisher forecast of the fσ 8 parameter. We show that the Fisher forecast method we developed gives an error bar that is 30% closer to a full likelihood-based estimation than a standard volume Fisher forecast.
Advanced nuclear reactors offer innovative applications due to their portability, reliability, resiliency, and high capacity factors. To operate them on a wider scale, reducing maintenance life-cycle costs while ensuring their integrity is essential. Autonomous operations in advanced nuclear reactors using augmented Digital Twin (DT) technology can serve as a cost-effective solution by increasing awareness about the system’s health. A key component of nuclear DT frameworks is the condition monitoring of safety systems, such as piping-equipment systems, which involves acquiring and monitoring the plant’s sensor data. Here, this research proposes a condition monitoring methodology utilizing deep learning algorithms, such as multilayer perceptions (MLP) and convolutional neural networks (CNNs), to detect degradation and its severity in nuclear piping-equipment systems. Sensor signals are processed to obtain the power spectral density and the Short-Time Fourier transform, and feature extraction methodologies are proposed to develop degradation-sensitive data repositories. The performance of MLP, one-dimensional (1D) CNN, and 2D CNN within the proposed condition monitoring framework is compared using a finite element model of a 3D piping system subjected to seismic loads as the application case study. Various approaches, such as dropout, k-Fold validation, regularization, and early stopping of training the network, are investigated to avoid overfitting the models to the input sensor data. The predictive capability and computational capacity of the deep learning algorithms are also compared to detect degradation in the Z-pipe system of the Experimental Breeder Reactor II (EBRII). The Z-pipe system is subjected to harmonic excitations that represent normal operating loads, such as pump-induced vibrations. The findings of the study indicate that the proposed artificial intelligence (AI)-driven condition monitoring framework demonstrates superior prediction accuracies with a 2D CNN, whereas the MLP exhibits higher computational efficiency.
In the next decade, transient searches from the Vera C. Rubin Observatory and the Nancy Grace Roman Space Telescope will increase the sample of known Type Ia supernovae (SNe Ia) from ~10 3 to 10 5 . With this reduction of statistical uncertainties on cosmological measurements, new methods are needed to reduce systematic uncertainties. Here, characterizing the underlying spectroscopic evolution of SN Ia remains a major systematic uncertainty in current cosmological analyses, motivating a new simulation tool for the next era of SN Ia cosmology: Build Your Own Spectral Energy Distribution (byosed). byosed is used within the SNANA framework to simulate light curves by applying spectral variations to model SEDs, enabling flexible testing of possible systematic shifts in SN Ia distance measurements. We test the framework by comparing a nominal Roman SN Ia survey simulation using a baseline SED model to simulations using SEDs perturbed with byosed, and investigating the impact of ignoring specific SED features in the analysis. These features include semiempirical models of two possible, predicted relationships: between SN ejecta velocity and light-curve observables, and a redshift-dependent relationship between SN Hubble residuals and host-galaxy mass. We analyze each byosed simulation using the SALT2 and BEAMS with Bias Corrections framework, and estimate changes in the measured value of the dark-energy equation-of-state parameter, w. We find a difference of Δw = –0.023 for SN velocity and Δw = 0.021 for redshift-evolving host mass when compared to simulations without these features. By using byosed for SN Ia cosmology simulations, future analyses (e.g., the Rubin and Roman SN Ia samples) will have greater flexibility to constrain or reduce such SN Ia modeling uncertainties.