SEARCH · Engineering Papers

Results for “Algorithms and theoretical developments”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

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

At least 217 records · Page 12

All sources NASA NTRS DOE OSTI

NASA NTRS2023

Development of the Ames Global Hyperspectral Synthetic Data Set: Surface Bidirectional Reflectance Distribution Function

This study introduces the Ames Global Hyperspectral Synthetic Data set (AGHSD), in particular the surface bidirectional reflectance distribution function (BRDF) product, to support the NASA Surface Biology and Geology (SBG) mission development. The data set is generated based on the corresponding multispectral BRDF products from NASA's MODIS satellite sensor. Based on theories of radiative transfer in vegetation canopies, we derive a simple but robust relationship that indicates that the hyperspectral surface BRDF can be accurately approximated as a weighted sum of the soil surface reflectance, the leaf single albedo, and the canopy scattering coefficient, where the weights or coefficients are spectrally invariant and thus readily estimated from the multispectral MODIS products. We validate the algorithm with simulations by a Monte Carlo Ray Tracing model and find the results highly consistent with the theoretic derivation. Using reflectance spectra of soil and vegetation derived from existing spectral libraries, we apply the algorithm to generate the AGHSD BRDF product at 1 km and 8-day resolutions for the year of 2019. The data set is biogeochemically and biogeophysically coherent and consistent, and serves the goal to support the SBG community in developing sciences and applications for the future global imaging spectroscopy mission.

Hyperspectral Remote Sensing↗

DOE OSTI2023

Tensor Decompositions for Count Data that Leverage Stochastic and Deterministic Optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the global maximum likelihood estimator from local minima. Simultaneously, a recent trend in theoretical computer science and numerical linear algebra leverages randomization to solve very large, hard problems. The typical approach is to use randomization for a fast approximation and determinism for refinement to yield effective algorithms with theoretical guarantees. Two popular algorithms for Poisson CPD reflect that emergent dichotomy: CP Alternating Poisson Regression is a deterministic algorithm and Generalized Canonical Polyadic decomposition makes use of stochastic algorithms in several variants. This work extends recent work to develop two new methods that leverage randomized and deterministic algorithms for improved accuracy and performance.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1987

Spectral multigrid methods for the solution of homogeneous turbulence problems

New three-dimensional spectral multigrid algorithms are analyzed and implemented to solve the variable coefficient Helmholtz equation. Periodicity is assumed in all three directions which leads to a Fourier collocation representation. Convergence rates are theoretically predicted and confirmed through numerical tests. Residual averaging results in a spectral radius of 0.2 for the variable coefficient Poisson equation. In general, non-stationary Richardson must be used for the Helmholtz equation. The algorithms developed are applied to the large-eddy simulation of incompressible isotropic turbulence.

Erlebacher, G.↗

NASA NTRS1988

Spectral multigrid methods for the solution of homogeneous turbulence problems

Erlebacher, G.↗

NASA NTRS1996

SIR-C Measurements of Soil Moisture, Vegetation and Surface Roughness and their Hydrological Application

The objectives of the study are: (1) Analysis of SIR-C/X-SAR response to soil moisture, vegetation and surface roughness and development of an algorithm to retrieve these parameters; (2) Combination of the visible and near-infrared data and the SIR-C/X-SAR data to improve the range and accuracy of vegetation classification; (3) Testing of theoretical models for microwave propagation with SIR-C/X-SAR and microwave radiometric measurements over rough surfaces; and (4) Evaluation of a water balance model using SIR-C/X-SAR derived soil moisture values and other ancillary data. Progress, significant results and future plans are presented.

Wang, James R.↗

NASA NTRS2016

The Mathematics of Dispatchability Revisited

Dispatchability is an important property for the efficient execution of temporal plans where the temporal constraints are represented as a Simple Temporal Network (STN). It has been shown that every STN may be reformulated as a dispatchable STN, and dispatchability ensures that the temporal constraints need only be satisfied locally during execution. Recently it has also been shown that Simple Temporal Networks with Uncertainty, augmented with wait edges, are Dynamically Controllable provided every projection is dispatchable. Thus, the dispatchability property has both theoretical and practical interest. One thing that hampers further work in this area is the underdeveloped theory. The existing definitions are expressed in terms of algorithms, and are less suitable for mathematical proofs. In this paper, we develop a new formal theory of dispatchability in terms of execution sequences. We exploit this to prove a characterization of dispatchability involving the structural properties of the STN graph. This facilitates the potential application of the theory to uncertainty reasoning.

control↗

NASA NTRS1994

A passive microwave technique for estimating rainfall and vertical structure information from space. Part 2: Applications to SSM/I data

A multi channel physical approach for retrieving rainfall and its vertical structure from Special Sensor Microwave/Imager (SSM/I) observations is examined. While a companion paper was devoted exclusively to the description of the algorithm, its strengths, and its limitations, the main focus of this paper is to report on the results, applicability, and expected accuraciesfrom this algorithm. Some examples are given that compare retrieved results with ground-based radar data from different geographical regions to illustrate the performance and utility of the algorithm under distinct rainfall conditions. More quantitative validation is accomplished using two months of radar data from Darwin, Australia, and the radar network over Japan. Instantaneous comparisons at Darwin indicate that root-mean-square errors for 1.25 deg areas over water are 0.09 mm/h compared to the mean rainfall value of 0.224 mm/h while the correlation exceeds 0.9. Similar results are obtained over the Japanese validation site with rms errors of 0.615 mm/h compared to the mean of 0.0880 mm/h and a correlation of 0.9. Results are less encouraging over land with root-mean-square errors somewhat larger than the mean rain rates and correlations of only 0.71 and 0.62 for Darwin and Japan, respectively. These validation studies are further used in combination with the theoretical treatment of expected accuracies developed in the companion paper to define error estimates on a broader scale than individual radar sites from which the errors may be analyzed. Comparisons with simpler techniques that are based on either emission or scattering measurements are used to illustrate the fact that the current algorithm, while better correlated with the emission methods over water, cannot be reduced to either of these simpler methods.

Kummerow, Christian↗

NASA NTRS1994

Stochastic model of the residual acceleration environment in microgravity

We describe a theoretical investigation of the effects that stochastic residual accelerations (g-jitter) onboard spacecraft can have on experiments conducted in a microgravity environment. We first introduce a stochastic model of the residual acceleration field, and develop a numerical algorithm to solve the equations governing fluid flow that allow for a stochastic body force. We next summarize our studies of two generic situations: stochastic parametric resonance and the onset of convective flow induced by a fluctuating acceleration field.

Vinals, Jorge↗

DOE OSTI2021

Implementing Arbitrary/Common Concurrent Writes of CRCW PRAM

The Parallel Random Access Machines (PRAM) abstraction is the simplest and most elegant algorithmic model for the design and analysis of parallel algorithms. It consists of different models categorized based on the underlying memory access mode used, the most powerful of which is the Concurrent Read Concurrent Write (CRCW) model. A PRAM algorithm describes a series of rounds, each of which consists of a collection of operations that can be executed concurrently within the same time step. However, the lack of support for concurrent memory accesses and the prevalence of asynchronous programming models led to the belief that implementing CRCW PRAM algorithms is unattainable and prompted many to avoid this model except for theoretical studies of optimal performance.In this work, we study the arbitrary and common concurrent writes in the CRCW PRAM model and explore implementation challenges on general-purpose systems. Moreover, we examine current practices for implementing common/arbitrary concurrent writes and propose a new efficient lightweight and thread-safe method to implement concurrent writes through leveraging atomic instructions. To demonstrate the efficacy of our method, we developed OpenMP kernels for classical CRCW PRAM algorithms and provide experimental results and comparisons based on run time performance measured over the x86 multicore architecture. Our results show a performance speedup compared to current practices up to 4.5x across all our benchmarks.

Ghanim, Fady↗

DOE OSTI2024

Physics-informed machine learning to predict solvatochromic parameters of designer solvents with case studies in CO 2 and lignin dissolution

The polarity of solvents plays a critical role in various research applications, particularly in their solubilities. Polarity is conveniently characterized by the Kamlet-Taft parameters that is, the hydrogen bonding acidity (α), the basicity (β), and the polarizability (π*). Obtaining Kamlet-Taft parameters is very important for designer solvents, namely ionic liquids (ILs) and deep eutectic solvents (DESs). However, given the unlimited theoretical number of combinations of ionic pairs in ILs and hydrogen-bond donor/acceptor pairs in DESs, experimental determination of their Kamlet-Taft parameters is impractical. To address this, the present study developed two different machine learning (ML) algorithms to predict Kamlet-Taft parameters for designer solvents using quantum chemically derived input features. The ML models developed in the present study showed accurate predictions with high R 2 and low RMSE values. Further, in the context of present interest in the circular bioeconomy, the relationship between the basicities and acidities of designer solvents and their ability to dissolve lignin and carbon dioxide (CO 2 ) is discussed. Our method thus guides the design of effective solvents with optimal Kamlet-Taft parameter values dissolving and converting biomass and CO 2 into valuable chemicals.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2022

Fast Solution of Fully Implicit Runge--Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part II: Nonlinearities and DAEs

Fully implicit Runge--Kutta (IRK) methods have many desirable accuracy and stability properties as time integration schemes, but high-order IRK methods are not commonly used in practice with large-scale numerical PDEs because of the difficulty of solving the stage equations. This paper introduces a theoretical and algorithmic framework for solving the nonlinear equations that arise from IRK methods (and discontinuous Galerkin discretizations in time) applied to nonlinear numerical PDEs, including PDEs with algebraic constraints. Several new linearizations of the nonlinear IRK equations are developed, offering faster and more robust convergence than the often-considered simplified Newton, as well as an effective preconditioner for the true Jacobian if exact Newton iterations are desired. Inverting these linearizations requires solving a set of block 2 x 2 systems. Under quite general assumptions, it is proven that the preconditioned 2 x 2 operator's condition number is bounded by a small constant close to one, independent of the spatial discretization, spatial mesh, and time step, and with only weak dependence on the number of stages or integration accuracy. Moreover, the new method is built using the same preconditioners needed for backward Euler-type time stepping schemes, so can be readily added to existing codes. The new methods are applied to several challenging fluid flow problems, including the compressible Euler and Navier--Stokes equations, and the vorticity-streamfunction formulation of the incompressible Euler and Navier--Stokes equations. Up to 10th-order accuracy is demonstrated using Gauss IRK, while in all cases fourth-order Gauss IRK requires roughly half the number of preconditioner applications as required by standard Singly diagonally implicit Runge--Kutta methods.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1982

The CMC/3DPNS computer program for prediction of three-dimension, subsonic, turbulent aerodynamic juncture region flow. Volume 2: Users' manual

The CMC fluid mechanics program system was developed to transmit the theoretical solution of finite element numerical solution methodology, applied to nonlinear field problems into a versatile computer code for comprehensive flow field analysis. Data procedures for the CMC 3 dimensional Parabolic Navier-Stokes (PNS) algorithm are presented. General data procedures a juncture corner flow standard test case data deck is described. A listing of the data deck and an explanation of grid generation methodology are presented. Tabulations of all commands and variables available to the user are described. These are in alphabetical order with cross reference numbers which refer to storage addresses.

Manhardt, P. D.↗

NASA NTRS2006

UWB Tracking Algorithms: AOA and TDOA

Ultra-Wideband (UWB) tracking prototype systems are currently under development at NASA Johnson Space Center for various applications on space exploration. For long range applications, a two-cluster Angle of Arrival (AOA) tracking method is employed for implementation of the tracking system; for close-in applications, a Time Difference of Arrival (TDOA) positioning methodology is exploited. Both AOA and TDOA are chosen to utilize the achievable fine time resolution of UWB signals. This talk presents a brief introduction to AOA and TDOA methodologies. The theoretical analysis of these two algorithms reveal the affecting parameters impact on the tracking resolution. For the AOA algorithm, simulations show that a tracking resolution less than 0.5% of the range can be achieved with the current achievable time resolution of UWB signals. For the TDOA algorithm used in close-in applications, simulations show that the (sub-inch) high tracking resolution is achieved with a chosen tracking baseline configuration. The analytical and simulated results provide insightful guidance for the UWB tracking system design.

Ni, Jianjun David↗

DOE OSTI2022

Cyber risk assessment and investment optimization using game theory and ML-based anomaly detection and mitigation for wide-area control in smart grids

The electric power grid is increasingly becoming susceptible to cyber attacks that exploit vulnerabilities in the smart grid control, information, and physical layers. Successful cyber attacks can have catastrophic impacts on the social and economic well-being of any nation all over the globe. It has, thus, become imperative to secure the smart grid against such adversarial actions to ensure stable, secure, and reliable operation of the grid. The existing research and industry practices prove to be inadequate in terms of providing pragmatic and effective defense methodologies and measures for long-term cybersecurity planning and real-time cybersecurity for grid operation. For example, existing works lack models that incorporate uncertain behavior of cyber-attackers and pragmatic defense measures for cyber risk assessment and cybersecurity investment optimization which often provide unreliable and strictly qualitative solutions to these problems. At the same time, with the growing number of cyber incidents in the grid, there still exists a need to develop attack-resilient algorithms for wide-area monitoring, protection, and control (WAMPAC) applications like the wide-area voltage control systems (WAVCS) for Flexible AC Transmissions Systems (FACTS) that lack in scalable and feasible solutions from the cybersecurity perspective. This dissertation proposes novel models and methodologies for: (1) Cybersecurity planning, and (2) Cybersecurity for system operation. The cybersecurity planning is achieved through cyber risk assessment and cybersecurity resource investment optimization for long-term cybersecurity of the grid using game theory and attack-defense trees. Cybersecurity for system operation consists of development of cyber anomaly detection and mitigation algorithms for flexible AC transmission system (FACTS) controller-based wide-area voltage control systems (WAVCS) using machine learning (ML), and software defined networking-based moving target defense network routing for achieving real-time cyber-physical security for grid operations. This is followed by hardware-in-the-loop (HIL) implementation and evaluation of these attack prevention, detection, and mitigation algorithms and methodologies showcasing their feasibility in a close to real-world environment. For cybersecurity planning, a novel approach involving a combination of game theory and attack defense trees (ADT) for optimal cybersecurity resource allocation in the smart grid is proposed. This methodology involves modeling of the cyber-physical smart grid substations as ADTs, defining attacker costs, defense costs, and attack probabilities for attack access points. Using game theoretical formulation, optimal defense strategies for the defender of the system to invest cybersecurity resources in the grid are obtained. Additionally, a game-theoretic framework is developed for quantitative cyber-physical risk assessment of the grid under a dynamically changing cyber threat space and uncertain behavior of cyber attackers which is further used to optimize investments in the smart grid's cybersecurity resources. The attacker, defender, and the smart grid system are modeled while incorporating attacker-stochasticity and federal guidelines for smart grid cybersecurity. This allows quantification of threat, vulnerabilities, and attack impact of the grid for quantitative risk assessment. The defender's budget to invest in the security resources in the grid is optimized based on the strategies leading to minimum system risk. The evaluation of the proposed solutions highlight the feasibility for practical implementation of these methodologies and algorithms in the smart grid, while taking the federal requirements and guidelines for smart grid security into consideration. For achieving cybersecurity for system operation, attack prevention, detection, and mitigation algorithms and methodologies are developed specifically for FACTS-based WAVCS. Anomaly detection and mitigation in the WAVCS are achieved using algorithms based on machine learning which involves offline training and testing of ML models with CPS datasets incorporating physics-based features that allow accurate distinction between system faults and cyber attacks. For attack prevention, a methodology based on software defined network (SDN)-based moving target defense (MTD) network routing is proposed that enables prevention of Denial of Service (DoS) type attacks on the smart grid communication system. Subsequently, these methodologies and algorithms are implemented and evaluated on an HIL testbed that allows for real-time attack prevention, detection, and mitigation of emulated cyber attacks on the WAVCS in a close to real-world environment. The results show highly accurate and efficient performance of the implemented algorithms and methodologies with the smart grid system operating within the NERC's system operation limits even in the presence of DoS and data integrity cyber attacks. This work opens up future research opportunities in other directions such as (1) Expanding cybersecurity planning methodologies to real-time cyber contingency analysis with different game formulations; and (2) Applying the cybersecurity for system operation algorithms to broader categories of wide-area control applications.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NASA NTRS1993

Land surface temperature measurements from EOS MODIS data

The task objectives of this reporting phase included: (1) completing the draft of the LST Algorithms Theoretical Basic Document by July 30, 1993; (2) making a detailed characterization of the thermal infrared measurement system including spectrometer, blackbody, and radiation sources; (3) making TIR spectral measurements of water and snow-cover surfaces with the MIDAC M2401 spectrometer; and (4) making conceptual and engineering design of an accessory system for spectrometric measurements at variable angles. These objectives are based on the requirements by the MODIS Science Team and the unique challenge in the development of MODIS LST algorithms: to acquire accurate spectral emissivity data of land covers in the near-term and to make ground validations of the LST product in the long-term with a TIR measurement system.

Wan, Zhengming↗

NASA NTRS1990

Multiband radar characterization of forest biomes

The utility of airborne and orbital SAR in classification, assessment, and monitoring of forest biomes is investigated through analysis of orbital synthetic aperature radar (SAR) and multifrequency and multipolarized airborne SAR imagery relying on image tone and texture. Preliminary airborne SAR experiments and truck-mounted scatterometer observations demonstrated that the three dimensional structural complexity of a forest, and the various scales of temporal dynamics in the microwave dielectric properties of both trees and the underlying substrate would severely limit empirical or semi-empirical approaches. As a consequence, it became necessary to develop a more profound understanding of the electromagnetic properties of a forest scene and their temporal dynamics through controlled experimentation coupled with theoretical development and verification. The concatenation of various models into a physically-based composite model treating the entire forest scene became the major objective of the study as this is the key to development of a series of robust retrieval algorithms for forest biophysical properties. In order to verify the performance of the component elements of the composite model, a series of controlled laboratory and field experiments were undertaken to: (1) develop techniques to measure the microwave dielectric properties of vegetation; (2) relate the microwave dielectric properties of vegetation to more readily measured characteristics such as density and moisture content; (3) calculate the radar cross-section of leaves, and cylinders; (4) improve backscatter models for rough surfaces; and (5) relate attenuation and phase delays during propagation through canopies to canopy properties. These modeling efforts, as validated by the measurements, were incorporated within a larger model known as the Michigan Microwave Canopy Scattering (MIMICS) Model.

Dobson, M. Craig↗

NASA NTRS2022

Satellite Precipitation Measurements: What Have We Learnt About Cloud-Precipitation Processes From Space?

Precipitation is one of the fundamental elements that define global and regional climatology. Precipitation systems consist of a broad spectrum of three-dimensional structures in which microphysical processes interact with macro-scale processes in the cloud system and the ambient environment that prescribe the evolution of the system. Since 1970s, satellite observations of precipitation have been a fundamental tool in quantifying this complex interaction. They have first quantified the frequency and intensity of global precipitation, including remote areas over open oceans and polar regions, thus providing today’s precipitation climatology. More recently, satellite observations of cloud and precipitation have been exploited for understanding the physical mechanisms governing precipitation systems. A subset of these studies also provided observation-based metrics to probe physical processes operating in cloud-precipitation systems and to apply them as diagnostic measures for evaluating the representation of the processes in numerical models for better projections of future climate. In this chapter, we first review the theoretical basis of precipitation remote sensing from space and describe how it is practically applied in satellite missions. In the first part of the chapter, an historical overview of the satellite missions is described, summarising the instruments and retrieval algorithms developed in the missions. In the second part, we introduce a set of studies discussing the fundamental mechanisms behind precipitation formation, highlighting what we have learnt to date on cloud-precipitation processes from satellite observations.

Precipitation↗

NASA NTRSDate not supplied

Avoiding Selection Bias in Generating Examples of Plans in the Presence of Heuristic Error

It is generally understood that heuristic error hurts the performance of search algorithms, measured in terms of search effort. Hence there is an interest in understanding how to reduce heuristic error. One way to do this is to learn a heuristic from a set of examples of plans generated offline, e.g. bootstrapping methods. In this paper, we consider how some methods for generating examples of plans may skew the training set in the presence of heuristic errors. Initial theoretical results show that duplicate detection is one source of selection bias in the canonical A* algorithm. We introduce a duplicate selection scheme for A* that avoids selection bias in generating cost-optimal examples, without compromising memory efficiency, and develop ideas in the satisficing setting. We evaluate our approach on n x m grids with multiple cost-optimal solutions and synthetic heuristic error. Finally, we attempt to extend these ideas to the problem of generating extreme examples of plans.

Alison S Paredes↗