SEARCH · Search NASA
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.
Software for a long-duration NASA flagship planetary mission faces a combination of challenges – maintaining legacy systems, complex modeling and algorithmic systems, limited funding, very low tolerance for risk, and heavy process requirements. Our team within the Cassini Mission to Saturn has faced these obstacles while applying Agile principles, and we have learned some lessons along the way.
This study establishes an optical inversion scheme for deriving the absorption coefficient of colored (or chromophoric, depending on the literature) dissolved organic material (CDOM) at the 440 nm wavelength, which can be applied to global water masses with near-equal efficacy. The approach uses a ratio of diffuse attenuation coefficient spectral end members, i.e., a short and long wavelength pair. The global perspective is established by sampling "extremely" clear water plus a generalized extent in turbidity and optical properties that each span three decades of dynamic range. A unique data set was collected in oceanic, coastal, and inland waters (as shallow as 0.6 m) from the North Pacific Ocean, the Arctic Ocean, Hawaii, Japan, Puerto Rico, and the east and west coasts of the United States. The data were partitioned using subjective categorizations to define a validation quality subset of conservative water masses, i.e., the inflow and outflow of properties constrain the range in the gradient of a constituent, plus 15 subcategories of water masses that were not evolving conservatively. The dependence on subcategories was confirmed with an objective methodology based on cluster analysis techniques. The latter defined five distinct classes with validation quality data present in all classes, but which also decreased in percent composition as a function of increasing class number and optical complexity. Four different algorithms based on different validation quality end members were validated with accuracies of 1.–6.2 %, wherein pairs with the largest spectral span were most accurate. Although algorithm accuracy decreased with the inclusion of more subcategories containing non-conservative water masses, changes to the algorithm fit were small when a preponderance of subcategories were included. The high accuracy for all end-member algorithms was the result of data acquisition and data processing improvements, e.g., increased vertical sampling resolution to less than 1mm and a boundary constraint to mitigate wave focusing effects, respectively. An independent evaluation with a historical database confirmed the consistency of the algorithmic approach and its application to quality assurance, e.g., to flag data outside expected ranges, identify suspect spectra, and objectively determine the in-water extrapolation interval by converging agreement for all applicable end-member algorithms. The legacy data exhibit degraded performance (as 44 % uncertainty) due to a lack of high-quality near-surface observations, especially for clear waters wherein wave-focusing effects are problematic. The novel optical approach allows the in situ estimation of an in-water constituent in keeping with the accuracy obtained in the laboratory.
Low-cost sensors for particulate matter mass (PM) enable spatially dense, high temporal resolution measurements of air quality that traditional reference monitoring cannot. Low-cost PM sensors are especially beneficial in low and middle-income countries where few, if any, reference grade measurements exist and in areas where the concentration fields of air pollutants have significant spatial gradients. Unfortunately, low-cost PM sensors also come with a number of challenges that must be addressed if their data products are to be used for anything more than a qualitative characterization of air quality. The various PM sensors used in low-cost monitors are all subject to biases and calibration dependencies, corrections for which range from relatively straightforward(e.g. meteorology, age of sensor) to complex (e.g. aerosol source, composition, refractive index). The methods for correcting and calibrating these biases and dependencies that have been used in the literature likewise range from simple linear and quadratic models to complex machine learning algorithms. Here we review the needs and challenges when trying to get high-quality data from low-cost sensors. We also present a set of best practices to follow to obtain high-quality data from these low-cost sensors.
We describe a neural network learning algorithm that implements differential learning in a generalized backpropagation framework. The algorithm regulates model complexity during the learning procedure, generating the best low-complexity approximation to the Bayer-optimal classifier allowed by the training sample.
Spatially explicit percent tree cover (TC) estimation is critical for mapping forest aboveground biomass and its dynamics. While various TC products have been developed, there has not been a generalized framework that can be applied to diverse terrestrial ecosystems due to underlain extreme complexities. Deep learning algorithms can learn a spatial pattern and radiometric characteristics of tree canopy as a robust approximation of physical or empirical models, and thus have emerged as promising and efficient tools for large-scale TC mapping. In this study, we synergistically use very high-resolution aerial imageries (National Agriculture Imagery Program, NAIP) and medium resolution Landsat data to map continental-scale TC (CONUS and Mexico) through a hierarchical deep learning approach (Convolutional Neural Network), i.e., NAIP TC generated from a NAIP model is utilized to train a Landsat model. The produced TC product (hereafter, NEX-TC) is able to capture the spatial pattern of TC distribution and its changes driven by natural disturbance and human land management. We further explore and analyze the reliability and potential uncertainty of the NEX-TC by comparing it to lidar- (lidar-TC), National Land Cover Database (NLCD-TC), and MODIS Vegetation Continuous Field (MODIS-TC). This evaluation practice reveals that TC products based on passive optical sensors tend to underestimate TC across all land cover types while Landsat-based TCs (i.e., NEX-TC & NLCD-TC) perform better than the coarser MODIS TC estimate. Our results show that the NEX-TC is generally comparable to NLCD-TC but it particularly outperforms NLCD-TC and MODIS-TC over the dense forests where lidar-TC indicates >80% TC. These results indicate that our hierarchical deep learning approach and TC product will be effective and useful for characterizing large-scale tree cover and possibly associated carbon dynamics.
Most parallel scientific programs contain compiler directives (pragmas) such as those from OpenMP, explicit calls to runtime library procedures such as those implementing the Message Passing Interface (MPI), or compiler-specific language extensions such as those provided by CUDA. By contrast, the recent Fortran standards empower developers to express parallel algorithms without directly referencing lower-level parallel programming models. Fortran’s parallel features place the language within the Partitioned Global Address Space (PGAS) class of programming models. When writing programs that exploit data-parallelism, application developers often find it straightforward to develop custom parallel algorithms. Problems involving complex, heterogeneous, staged calculations, however, pose much greater challenges. Such applications require careful coordination of tasks in a manner that respects dependencies prescribed by a directed acyclic graph. When rolling one’s own solution proves difficult, extending a customizable framework becomes attractive. The paper presents the design, implementation, and use of the Framework for Extensible Asynchronous Task Scheduling (FEATS), which we believe to be the first task-scheduling tool written in modern Fortran. We describe the benefits and compromises associated with choosing Fortran as the implementation language, and we propose ways in which future Fortran standards can best support the use case in this paper.
We present a new methodology—the Keplerian Optical Dynamics Analysis (KODA)—for quantifying the dynamics of erupting magnetic structures in the solar corona. The technique involves adaptive spatiotemporal tracking of propagating intensity gradients and their characterization in terms of time-evolving Keplerian areas swept out by the position vectors of moving plasma blobs. Whereas gravity induces purely ballistic motions consistent with Kepler's second law, noncentral forces such as the Lorentz force introduce nonzero torques resulting in more complex motions. KODA algorithms enable direct evaluation of the line-of-sight component of the net torque density from the image-plane projection of the areal acceleration. The method is applied to the prominence eruption of 2011 June 7, observed by the Solar Dynamics Observatory's Atmospheric Imaging Assembly. Results obtained include quantitative estimates of the magnetic forces, field intensities, and blob masses and energies across a vast region impacted by the postreconnection redistribution of the prominence material. The magnetic pressure and energy are strongly dominant during the early, rising phase of the eruption, while the dynamic pressure and kinetic energy become significant contributors during the subsequent falling phases. Measured intensive properties of the prominence blobs are consistent with those of typical active-region prominences; measured extensive properties are compared with those of the whole pre-eruption prominence and the post-eruption coronal mass ejection of 2011 June 7, all derived by other investigators and techniques. We show that KODA provides valuable information on spatially and temporally dependent characteristics of coronal eruptions that is not readily available via alternative means, thereby shedding new light on the environment and evolution of these solar events.
To enable autonomy in space, machine-learning and computer vision applications become invaluable for sensor processing. However, these algorithms are computationally complex and unfeasible for many embedded central processing units (CPUs) and usually require external coprocessors, such as graphics processing units (GPUs) or accelerators specific to the application, including application specific integrated circuits (ASICs). In power-constrained systems, GPUs tend to consume more power than is acceptable (>40W), so lower-power accelerators have shown promise to provide the performance needed under spacecraft constraints. For radiation engineers, developing methodologies that can properly test CPUs, GPUs, and accelerators, and enable comparisons between them remains a necessary complication to solve as the devices become more complex. The methodology in this test aims to be a start in developing a baseline single-event effect (SEE) test for client-device machine learning accelerators. This category of devices do not host their own operating system. This testing campaign is a continuation of a previous 200 MeV proton test performed in January 2024. This report covers two heavy ion tests of the SAKURA-I card: one in April 2024, and one in June 2024. Additional data was needed after the April test due to ion-range issues experienced at higher linear-energy transfers (LETs). These range issues are described in more detail in Section 8. This experiment characterizes SEEs and data error susceptibility of the EdgeCortix SAKURA-I machine-learning accelerator under heavy ions. The device was monitored for single event upsets (SEUs) and single event functional interrupts (SEFIs) at the Lawrence Berkeley National Laboratory’s 88-inch cyclotron. The SAKURA-I board accelerates machine-learning inference applications on a host computer through a PCIex16 connection. For the purposes of devising an end to end automated analysis workflow for this experiment, the YOLO-V5 and SSD300 objection-detection models, and the ResNet-50, EfficientNet, and MobileNetV2 image classification models were used as a representative suite of analytical machine-learning models.
Multi-fidelity Bayesian optimization (MFBO) is a powerful approach that utilizes lowfidelity, cost-effective sources to expedite the exploration and exploitation of a high-fidelity objective function. Existing MFBO methods with theoretical foundations either lack justification for performance improvements over single-fidelity optimization or rely on strong assumptions about the relationships between fidelity sources to construct surrogate models and direct queries to low-fidelity sources. To mitigate the dependency on cross-fidelity assumptions while maintaining the advantages of low-fidelity queries, we introduce a random sampling and partition-based MFBO framework with deep kernel learning. This framework is robust to cross-fidelity model misspecification and explicitly illustrates the benefits of low-fidelity queries. Our results demonstrate that the proposed algorithm effectively manages complex cross-fidelity relationships and efficiently optimizes the target fidelity function.
Sundry recent developments are presented which show some potential for affecting the automatic extraction of information from remotely sensed data. Pattern representations more abstract than Euclidean vector spaces offer some hope of unifying structural and decision theoretical approaches. The estimation of expected classification error rates is becoming more sophisticated and rigorous, but useful finite-sample results for nonparametric distributions appear unobtainable. Focus on computational complexity allows comparison of algorithms, while software engineering techniques reduce the effort necessary to develop and maintain complex image processing systems. Advances in computer systems architecture, commercial database technology, and man-machine communications should be closely monitored by the remote sensing community. A NASA-sponsored recommendation for research directions in mathematical pattern recognition are offered.
It has long been known that convolutional codes have a natural, regular trellis structure that facilitates the implementation of Viterbi's algorithm. It has gradually become apparent that linear block codes also have a natural, though not in general a regular, 'minimal' trellis structure, which allows them to be decoded with a Viterbi-like algorithm. In both cases, the complexity of the Viterbi decoding algorithm can be accurately estimated by the number of trellis edges per encoded bit. It would, therefore, appear that we are in a good position to make a fair comparison of the Viterbi decoding complexity of block and convolutional codes. Unfortunately, however, this comparison is somewhat muddled by the fact that some convolutional codes, the punctured convolutional codes, are known to have trellis representations that are significantly less complex than the conventional trellis. In other words, the conventional trellis representation for a convolutional code may not be the minimal trellis representation. Thus, ironically, at present we seem to know more about the minimal trellis representation for block than for convolutional codes. In this article, we provide a remedy, by developing a theory of minimal trellises for convolutional codes. (A similar theory has recently been given by Sidorenko and Zyablov). This allows us to make a direct performance-complexity comparison for block and convolutional codes. A by-product of our work is an algorithm for choosing, from among all generator matrices for a given convolutional code, what we call a trellis-minimal generator matrix, from which the minimal trellis for the code can be directly constructed. Another by-product is that, in the new theory, punctured convolutional codes no longer appear as a special class, but simply as high-rate convolutional codes whose trellis complexity is unexpectedly small.
Tolerance compare technique indicates discompare only when numerical difference value exceeds prescribed limit. Algorithm involving binary number properties is defined, in lieu of arithmetic operation which requires relatively complex circuitry. Extension of algorithm may be made to encompass tolerances other than one unit.
Electrified aircraft propulsion (EAP) research is a priority of the National Aeronautics and Space Administration (NASA) for its potential to increase propulsion system efficiency, performance, and operability at the subsystem and vehicle levels while decreasing emissions. These EAP systems demand more advanced control algorithms due to increased complexity. NASA has developed a reconfigurable, hardware-in-the-loop rig to verify control algorithm performance using a sub-scale electro-mechanical system. A novel capability of this rig is the ability to test full scale EAP control algorithms on a sub-scale representation of the electro-mechanical system without turbomachinery/rotors. A novel feature is the use of a physical energy storage device within the electro-mechanical system. A dual spool, parallel hybrid-electric turbofan architecture and energy management control system is tested with the goal of verifying the ability to obtain turbomachinery model operability benefits while controlling sub-scale electro-mechanical hardware. Pre-test predictions of the turbofan model, control, and rig performance were obtained through simulation using a software model of the rig. Theoretical results showing the true performance of the turbofan model were obtained through a software simulation using full-scale mechanical shaft models. The paper compares theoretical, predicted, and actual test results from the turbofan model, energy management control and rig perspectives. The results show that the presence of sub-scale electro-mechanical hardware did not inhibit the energy management algorithm from achieving turbomachinery operability benefits.
Electrified aircraft propulsion (EAP) research is a priority of the National Aeronautics and Space Administration (NASA) for its potential to increase propulsion system efficiency, performance, and operability at the subsystem and vehicle levels while decreasing emissions. These EAP systems demand more advanced control algorithms due to increased complexity. NASA has developed a reconfigurable, hardware-in-the-loop rig to verify control algorithm performance using a sub-scale electro-mechanical system. A novel capability of this rig is the ability to test full scale EAP control algorithms on a sub-scale representation of the electro-mechanical system without turbomachinery/rotors. A novel feature is the use of a physical energy storage device within the electro-mechanical system. A dual spool, parallel hybrid-electric turbofan architecture and energy management control system is tested with the goal of verifying the ability to obtain turbomachinery model operability benefits while controlling sub-scale electro-mechanical hardware. Pre-test predictions of the turbofan model, control, and rig performance were obtained through simulation using a software model of the rig. Theoretical results showing the true performance of the turbofan model were obtained through a software simulation using full-scale mechanical shaft models. The paper compares theoretical, predicted, and actual test results from the turbofan model, energy management control and rig perspectives. The results show that the presence of sub-scale electro-mechanical hardware did not inhibit the energy management algorithm from achieving turbomachinery operability benefits.
Timing comparisons are given for three sorting algorithms written for the CDC STAR computer. One algorithm is Hoare's (1962) Quicksort, which is the fastest or nearly the fastest sorting algorithm for most computers. A second algorithm is a vector version of Quicksort that takes advantage of the STAR's vector operations. The third algorithm is an adaptation of Batcher's (1968) sorting algorithm, which makes especially good use of vector operations but has a complexity of N(log N)-squared as compared with a complexity of N log N for the Quicksort algorithms. In spite of its worse complexity, Batcher's sorting algorithm is competitive with the serial version of Quicksort for vectors up to the largest that can be treated by STAR. Vector Quicksort outperforms the other two algorithms and is generally preferred. These results indicate that unusual instruction sets can introduce biases in program execution time that counter results predicted by worst-case asymptotic complexity analysis.
As more and more electric vehicles emerge in our daily operation progressively, a very critical challenge lies in the prediction of remaining driving flying time/distance for the flying vehicles. This information is important, particularly in the case of auto vehicles, because such vehicles can become self-aware, autonomously compute its own capabilities, and identify how to best plan and successfully complete vehicular missions safely. In case of electric aircrafts, computing the remaining flying time is also safety-critical, since an aircraft that runs out of power (battery charge) while in the air will eventually lose control leading to catastrophe. To facilitate and solve the prediction problem, awareness of the current health state of the system is key, since it is necessary to perform condition-based predictions. To accurately predict the future state of any system, it is required to possess knowledge of its current health state and future operational conditions. Latest achievements of data-driven algorithms in regression of complex nonlinear functions and classification tasks have generated a growing interest in artificial intelligence for industrial applications. Complex multi-physics models as well as digital twins, once purely built on physics and corresponding simplified lumped parameter iterations, can now benefit from machine learning algorithms to mitigate the lack of understanding of some complex behavior. Given models of the current and future system behavior, a general approach of model-based prognostics can solve the prediction problem and further decision-making. A systematic prediction framework is implemented to identify all possible sources of uncertainty, quantify each of them individually, and mathematically estimate their combined effect on the system-level quantity of interest, in this case, the remaining flying time/distance of the unmanned aircraft. Note - This presentation contains all previously published information.
As more and more electric vehicles emerge in our daily operation progressively, a very critical challenge lies in the prediction of remaining driving flying time/distance for the flying vehicles. This information is important, particularly in the case of auto vehicles, because such vehicles can become self-aware, autonomously compute its own capabilities, and identify how to best plan and successfully complete vehicular missions safely. In case of electric aircrafts, computing the remaining flying time is also safety-critical, since an aircraft that runs out of power (battery charge) while in the air will eventually lose control leading to catastrophe. To facilitate and solve the prediction problem, awareness of the current health state of the system is key, since it is necessary to perform condition-based predictions. To accurately predict the future state of any system, it is required to possess knowledge of its current health state and future operational conditions. Latest achievements of data-driven algorithms in regression of complex nonlinear functions and classification tasks have generated a growing interest in artificial intelligence for industrial applications. Complex multi-physics models as well as digital twins, once purely built on physics and corresponding simplified lumped parameter iterations, can now benefit from machine learning algorithms to mitigate the lack of understanding of some complex behavior. Given models of the current and future system behavior, a general approach of model-based prognostics can solve the prediction problem and further decision-making. A systematic prediction framework is implemented to identify all possible sources of uncertainty, quantify each of them individually, and mathematically estimate their combined effect on the system-level quantity of interest, in this case, the remaining flying time/distance of the unmanned aircraft. Note - This presentation contains all previously approved and published information.
To facilitate and solve the prediction problem, awareness of the current health state of the system is key, since it is necessary to perform condition-based predictions. To accurately predict the future state of any system, it is required to possess knowledge of its current health state and future operational conditions. Development in data-driven algorithms in regression of complex nonlinear functions and classification tasks have generated a growing interest in artificial intelligence for industrial applications. Complex multi-physics models as well as digital twins, once purely built on physics and corresponding simplified lumped parameter iterations, can now benefit from machine learning algorithms to mitigate the lack of understanding of some complex behavior. The research work presents application of physics-informed neural nets application to a representative electric powertrain for unmanned aerial vehicles. The model is composed of physics-derived and empirical equations, integrated with connected networks that are strategically placed within the model to substitute equations that are subject to large uncertainty. Polynomial fit driven by heuristics or empirical observations can be substituted by more flexible networks that can minimize the error between model predictions and observations without being restricted to a predefined functional form. This modeling strategy allows training of networks deep inside the model and unknown parameters in a single learning stage.