Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithms and data structure”

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

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

At least 613 records · Page 34

Airborne/Space-Based Doppler Lidar Wind Sounders Sampling the PBL and Other Regions of Significant Beta and U Inhomogeneities

This final report covers the period from April 1994 through March 1998. The proposed research was organized under four main tasks. Those tasks were: (1) Investigate the vertical and horizontal velocity structures within and adjacent to thin and subvisual cirrus; (2) Investigate the lowest 1 km of the PBL and develop algorithms for processing pulsed Doppler lidar data obtained from single shots into regions of significant inhomogeneities in Beta and U; (3) Participate in OSSEs including those designed to establish shot density requirements for meso-gamma scale phenomena with quasi-persistent locations (e.g., jets, leewaves, tropical storms); and (4) Participate in the planning and execution of an airborne mission to measure winds with a pulsed CO2 Doppler lidar. Over the four year period of this research contract, work on all four tasks has yielded significant results which have led to 38 professional presentations (conferences and publications) and have been folded into the science justification for an approved NASA space mission, SPARCLE (SPAce Readiness Coherent Lidar Experiment), in 2001. Also this research has, through Task 4, led to a funded proposal to work directly on a NASA field campaign, CAMEX III, in which an airborne Doppler wind lidar will be used to investigate the cloud-free circulations near tropical storms. Monthly progress reports required under this contract are on file. This final report will highlight major accomplishments, including some that were not foreseen in the original proposal. The presentation of this final report includes this written document as well as material that is better presented via the internet (web pages). There is heavy reference to appended papers and documents. Thus, the main body of the report will serve to summarize the key efforts and findings.

Emmitt, Dave↗

Ground Vibration Test of the Aerostructure Test Wing 2

The Aerostructures Test Wing (ATW) was developed to test unique concepts for flutter prediction and control synthesis. A follow-on to the successful ATW, denoted ATW2, was fabricated as a test bed to validate a variety of instrumentation in flight and to collect data for development of advanced signal processing algorithms for flutter prediction and aviation safety. As a means to estimate flutter speed, a ground vibration test (GVT) was performed. The results of a GVT are typically utilized to update structural dynamics finite element (FE) models used for flutter analysis. In this study, two GVT methodologies were explored to determine which nodes provide the best sensor locations: (i) effective independence and (ii) kinetic energy sorting algorithms. For measurement, ten and twenty sensors were used for three and 10 target test modes. A total of six accelerometer configurations measured frequencies and mode shapes. This included locations used in the original ATW GVT. Moreover, an optical measurement system was used to acquire data without mass effects added by conventional sensors. A considerable frequency shift was observed in comparing the data from the accelerometers to the optical data. The optical data provided robust data for use of the ATW2 finite element model update.

Herrera, Claudia↗

A new frame-based registration algorithm

This paper presents a new algorithm for frame registration. Our algorithm requires only that the frame be comprised of straight rods, as opposed to the N structures or an accurate frame model required by existing algorithms. The algorithm utilizes the full 3D information in the frame as well as a least squares weighting scheme to achieve highly accurate registration. We use simulated CT data to assess the accuracy of our algorithm. We compare the performance of the proposed algorithm to two commonly used algorithms. Simulation results show that the proposed algorithm is comparable to the best existing techniques with knowledge of the exact mathematical frame model. For CT data corrupted with an unknown in-plane rotation or translation, the proposed technique is also comparable to the best existing techniques. However, in situations where there is a discrepancy of more than 2 mm (0.7% of the frame dimension) between the frame and the mathematical model, the proposed technique is significantly better (p < or = 0.05) than the existing techniques. The proposed algorithm can be applied to any existing frame without modification. It provides better registration accuracy and is robust against model mis-match. It allows greater flexibility on the frame structure. Lastly, it reduces the frame construction cost as adherence to a concise model is not required.

NASA Center ARC↗

Selection of high-redshift Lyman-Break Galaxies from broadband and wide photometric surveys

In this paper, we investigate the possibility of selecting high-redshift Lyman-Break Galaxies (LBG) using current and future broadband wide photometric surveys, such as the Ultraviolet Near Infrared Optical Northern Survey (UNIONS) or the Vera C. Rubin Legacy Survey of Space and Time (LSST), using a Random Forest algorithm. This work is conducted in the context of future large-scale structure spectroscopic surveys like DESI-II, the next phase of the Dark Energy Spectroscopic Instrument (DESI), which will start around 2029.We use deep imaging data from the Hyper Suprime Camera (HSC) and the Canada-France-Hawaii Telescope Large Area U-band Deep Survey (CLAUDS) on the COSMOS and XMM-LSS fields. To predict the selection performance of LBGs with image quality similar to UNIONS, we degrade the u,g,r,i and z bands to UNIONS depth.The Random Forest algorithm is trained with the u,g,r,i and z bands to classify LBGs in the 2.5 < z < 3.5 range.We find that fixing a target density budget of 1,100 deg$^{-2}$, the Random Forest approach gives a density of z > 2 targets of 873 deg$^{-2}$, and a density of 493 deg$^{-2}$ of confirmed LBGs after spectroscopic confirmation with DESI. This UNIONS-like selection was tested in a dedicated spectroscopic observation campaign of 1,000 targets with DESI on the COSMOS field, providing a safe spectroscopic sample with a mean redshift of 3. This sample is used to derive forecasts for DESI-II, assuming a sky coverage of 5,000 deg$^{2}$. We predict uncertainties on Alcock-Paczynski parameters α$_{⊥}$ and α$_{∥}$ to be 0.7% and 1% for 2.6 < z < 3.2, resulting in a potential 2% measurement of the dark energy fraction at high redshift. Additionally, we estimate the uncertainty in local non-Gaussianity and predict σ$_{fNL}$ ≈ 7, which would be comparable to the current best precision achieved by Planck. The latter forecast suggests that achieving the precision required to place stringent constraints on inflationary models (σ$_{fNL}$ ≈ 1) using spectroscopic galaxy surveys necessitates the development of a next-generation (Stage V) spectroscopic survey.

79 ASTRONOMY AND ASTROPHYSICS↗

Dimensionally reduced machine learning model for predicting single component octanol–water partition coefficients

Abstract MF-LOGP, a new method for determining a single component octanol–water partition coefficients ( $$LogP$$ LogP ) is presented which uses molecular formula as the only input. Octanol–water partition coefficients are useful in many applications, ranging from environmental fate and drug delivery. Currently, partition coefficients are either experimentally measured or predicted as a function of structural fragments, topological descriptors, or thermodynamic properties known or calculated from precise molecular structures. The MF-LOGP method presented here differs from classical methods as it does not require any structural information and uses molecular formula as the sole model input. MF-LOGP is therefore useful for situations in which the structure is unknown or where the use of a low dimensional, easily automatable, and computationally inexpensive calculations is required. MF-LOGP is a random forest algorithm that is trained and tested on 15,377 data points, using 10 features derived from the molecular formula to make $$LogP$$ LogP predictions. Using an independent validation set of 2713 data points, MF-LOGP was found to have an average $$RMSE$$ RMSE = 0.77 ± 0.007, $$MAE$$ MAE = 0.52 ± 0.003, and $${R}^{2}$$ R 2 = 0.83 ± 0.003. This performance fell within the spectrum of performances reported in the published literature for conventional higher dimensional models ( $$RMSE$$ RMSE = 0.42–1.54, $$MAE$$ MAE = 0.09–1.07, and $${R}^{2}$$ R 2 = 0.32–0.95). Compared with existing models, MF-LOGP requires a maximum of ten features and no structural information, thereby providing a practical and yet predictive tool. The development of MF-LOGP provides the groundwork for development of more physical prediction models leveraging big data analytical methods or complex multicomponent mixtures. Graphical Abstract

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Independent Analysis of the Space Station Node Modal Test Data

With complex structures, comparison of independently derived sets of experimental modal parameters is an excellent way to increase confidence in the results. This paper presents modal identification results using the Eigensystem Realization Algorithm (ERA) on frequency response functions from the modal test of the Space Station Resource Node. The Resource Node is the first U.S.-built structure for the International Space Station. The modal test was conducted by the NASA Marshall Space Flight Center (MSFC) in January 1997 for the Boeing Company, who designed and built the Node. The ERA-calculated parameters are compared with independent results obtained by the MSFC test team using commercial software. There was excellent correlation of mode shapes between the two sets of results for the first 21 vibration modes of the structure up to 35 Hz. From 35 to 50 Hz, about 60 percent of 25 additional modes had excellent correlation. Natural frequencies and damping factors of most modes agreed within 0.1 Hz and 0.2 percent, respectively.

Pappa, Richard S.↗

Representation of high frequency Space Shuttle data by ARMA algorithms and random response spectra

High frequency Space Shuttle lift-off data are treated by autoregressive (AR) and autoregressive-moving-average (ARMA) digital algorithms. These algorithms provide useful information on the spectral densities of the data. Further, they yield spectral models which lend themselves to incorporation to the concept of the random response spectrum. This concept yields a reasonably smooth power spectrum for the design of structural and mechanical systems when the available data bank is limited. Due to the non-stationarity of the lift-off event, the pertinent data are split into three slices. Each of the slices is associated with a rather distinguishable phase of the lift-off event, where stationarity can be expected. The presented results are rather preliminary in nature; it is aimed to call attention to the availability of the discussed digital algorithms and to the need to augment the Space Shuttle data bank as more flights are completed.

Spanos, P. D.↗

Multimodal X-ray nano-spectromicroscopy analysis of chemically heterogeneous systems

Abstract Understanding the nanoscale chemical speciation of heterogeneous systems in their native environment is critical for several disciplines such as life and environmental sciences, biogeochemistry, and materials science. Synchrotron-based X-ray spectromicroscopy tools are widely used to understand the chemistry and morphology of complex material systems owing to their high penetration depth and sensitivity. The multidimensional (4D+) structure of spectromicroscopy data poses visualization and data-reduction challenges. This paper reports the strategies for the visualization and analysis of spectromicroscopy data. We created a new graphical user interface and data analysis platform named XMIDAS (X-ray multimodal image data analysis software) to visualize spectromicroscopy data from both image and spectrum representations. The interactive data analysis toolkit combined conventional analysis methods with well-established machine learning classification algorithms (e.g. nonnegative matrix factorization) for data reduction. The data visualization and analysis methodologies were then defined and optimized using a model particle aggregate with known chemical composition. Nanoprobe-based X-ray fluorescence (nano-XRF) and X-ray absorption near edge structure (nano-XANES) spectromicroscopy techniques were used to probe elemental and chemical state information of the aggregate sample. We illustrated the complete chemical speciation methodology of the model particle by using XMIDAS. Next, we demonstrated the application of this approach in detecting and characterizing nanoparticles associated with alveolar macrophages. Our multimodal approach combining nano-XRF, nano-XANES, and differential phase-contrast imaging efficiently visualizes the chemistry of localized nanostructure with the morphology. We believe that the optimized data-reduction strategies and tool development will facilitate the analysis of complex biological and environmental samples using X-ray spectromicroscopy techniques.

36 MATERIALS SCIENCE↗

Multigraph-based Routing in Delay Tolerant Networks: An Alternative to Contact Graph Routing

Satellites are leaving the realms of niche use, extending our day-to-day networked infrastructure to space – thereby forcing a generalization of network architectures. The Delay Tolerant Networking (DTN) protocol is being developed to give rise to this new Solar System Internet. Predominantly, DTNs in space use globally-distributed contact tables to compute routes. In this paper, we propose and analyze a novel optimized approach for route computations that improves upon traditional approaches. As the general DTN will always include some scheduled links, our new algorithm enables greater scalability and practicality of DTN routing. These contact tables include windows when two nodes can communicate and were classically organized into a contact graph, where the vertices represent contact opportunities. Because the complexity of a contact graph grows with the number of contacts, pathfinding on it does not scale. A new structure using multigraphs with the same data is proposed. We show that a multigraph-based approach, which we call contact multigraph routing, exhibits performance superior to routing based on contact graphs, allowing greater scaling to schedule-based routing. In this paper, the multigraph-based algorithm is detailed and a proof is included showing it outperforms the previous algorithm given the same input. Pseudocode is included, as are simulation results. We conclude with suggested future work.

Delay Tolerant Networking↗

User Guide for TROPICS Data Products

This document provides information for using the data products available from the “Time-Resolved Observations of Precipitation structure and storm Intensity with a Constellation of Smallsats” (TROPICS) mission. The TROPICS mission will produce a range of data products that will be available at the NASA Goddard Earth Sciences Data and Information Services Center (GES DISC). The data products will be produced at the TROPICS Data Processing Center (UW-M SSEC), and consist of Level-1 radiances (antenna and brightness temperatures), Level-2a unified resolution radiance, Level-2b Atmospheric Vertical Temperature Profiles (AVTP), Level-2b Atmospheric Vertical Moisture Profiles (AVMP), Level-2b Instantaneous Surface Rain Rate (ISRR), and Level-2b Tropical Cyclone (TC) intensity algorithms to estimate two primary variables: Minimum Sea Level Pressure (MSLP) and Maximum Sustained Winds (MSW). Two independent intensity estimation methods are included: 1) the Tropical Cyclone Intensity Estimate algorithm (TCIE) developed at the University of Wisconsin/CIMSS using native microwave brightness temperatures and 2) the Hurricane Intensity and Structure Algorithm (HISA) developed at Colorado State University/CIRA using microwave retrievals of temperature, moisture, and integrated quantities. In addition to MSW and MSLP, HISA also provides estimates of surface wind radii and 2D winds at standard pressure levels. TROPICS is adapting the NOAA STAR Microwave Integrated Retrieval System (MIRS) to retrieve the AVTP and AVMP data products. The ISRR algorithm uses the NASA Goddard Precipitation Retrieval and Profiling Scheme (PRPS).

TROPICS↗

rBahadur: efficient simulation of structured high-dimensional genotype data with applications to assortative mating

Existing methods for generating synthetic genotype data are ill-suited for replicating the effects of assortative mating (AM). We propose rb_dplr, a novel and computationally efficient algorithm for generating high-dimensional binary random variates that effectively recapitulates AM-induced genetic architectures using the Bahadur order-2 approximation of the multivariate Bernoulli distribution. The rBahadur R library is available through the Comprehensive R Archive Network at https://CRAN.R-project.org/package=rBahadur.

59 BASIC BIOLOGICAL SCIENCES↗

Software reliability studies

There are many software reliability models which try to predict future performance of software based on data generated by the debugging process. Our research has shown that by improving the quality of the data one can greatly improve the predictions. We are working on methodologies which control some of the randomness inherent in the standard data generation processes in order to improve the accuracy of predictions. Our contribution is twofold in that we describe an experimental methodology using a data structure called the debugging graph and apply this methodology to assess the robustness of existing models. The debugging graph is used to analyze the effects of various fault recovery orders on the predictive accuracy of several well-known software reliability algorithms. We found that, along a particular debugging path in the graph, the predictive performance of different models can vary greatly. Similarly, just because a model 'fits' a given path's data well does not guarantee that the model would perform well on a different path. Further we observed bug interactions and noted their potential effects on the predictive process. We saw that not only do different faults fail at different rates, but that those rates can be affected by the particular debugging stage at which the rates are evaluated. Based on our experiment, we conjecture that the accuracy of a reliability prediction is affected by the fault recovery order as well as by fault interaction.

Hoppa, Mary Ann↗

Augmenting machine learning of energy landscapes with local structural information

We present a machine learning approach for accurately predicting formation energies of binary compounds in the context of crystal structure predictions. The success of any machine learning model depends significantly on the choice of representation used to encode the relevant physical information into machine-learnable data. We test different representation schemes based on partial radial and angular distribution functions (RDF+ADF) on Al–Ni and Cd–Te structures generated using our genetic algorithm for structure prediction. We observe a remarkable improvement in predictive accuracy upon transitioning from global to atom-centered representations, resulting in a threefold decrease in prediction errors. We show that a support vector regression model using a combination of atomic radial and angular distribution functions performs best at the formation energy prediction task, providing small root mean squared errors of 3.9 meV/atom and 10.9 meV/atom for Al–Ni and Cd–Te, respectively. We test the performance of our models against common traditional descriptors and find that RDF- and ADF-based representations significantly outperform many of those in the prediction of formation energies. The high accuracy of predictions makes our machine learning models great candidates for the exploration of energy landscapes.

Honrao, Shreyas J. (ORCID:0000000166155257)↗

The CXSFIT spectral fitting code: Past, present and future

Magnetically confined plasma experiments generate a wealth of spectroscopic data. The first step toward extracting physical parameters is to fit a spectral model to the often complex spectra. The CXSFIT (Charge eXchange Spectroscopy FITting) spectral fitting code was originally developed for fitting charge exchange spectra on JET from the late 1980s onward and has been further developed over decades to keep up with the needs of the users. The primary use is to efficiently fit a large number of spectra with many constrained Gaussian spectral lines of which the physical parameters can be coupled in a user-friendly manner. More recent additions to the code include time-dependent couplings between parameters, flexible background subtraction, and a non-linear coupling scheme between fit parameters. The latter was a pre-requisite for implementing Zeeman and motional Stark effect multiplets in the library of spectral features. The ability to save and replay “fit recipes,” even when multiple iterations are required, has ensured the traceability of the results and is one of the keys to the longevity and success of the code. The code is also in use on other tokamaks (AUG, ST-40) and to fit data from other spectroscopic diagnostics on JET. In this paper, we document the current capabilities and philosophy behind the structure of the code, including some of the algorithms used to calculate spectral features numerically efficiently. We also provide an outline of how CXSFIT could be transferred into a framework that would be able to meet the spectral fitting requirements of future devices, such as ITER.

Delabie, Ephrem G.↗

Advanced Health Information Technology Analytic Framework and Application to Hazard Detection

Health Information Technology (HIT) aims to improve healthcare outcomes by organizing and analyzing various health-related data. With data accumulating at a staggering rate, the importance of real-time analytics has been increasing dramatically, shifting the focus of informatics from batch processing to streaming analytics. HIT is also facing unprecedented challenges in adapting to this new requirement and leveraging advanced IT technologies. This paper introduces a HIT data and compute platform that supports multi-granularity real-time analytics from heterogeneous data sources. The paper first identifies functional requirements and proposes a framework that satisfies the requirements using state-of-the-art big data technologies including Apache Kafka, Spark Structured Streaming Engine, and Delta Lake. To demonstrate its capability to support data analytics in multiple time granularities analytics, a statistical process control-based hazard detection algorithm has been implemented on top of the framework to detect unexpected hazards from order cancellation data of the Department of US Veterans Affairs (VA) in near real-time.

Kumar, Mohit↗

Scalable Tensor Methods for Nonuniform Hypergraphs

While multilinear algebra appears natural for studying the multiway interactions modeled by hypergraphs, tensor methods for general hypergraphs have been stymied by theoretical and practical barriers. A recently proposed adjacency tensor is applicable to nonuniform hypergraphs, but is prohibitively costly to form and analyze in practice. We develop tensor times same vector (TTSV) algorithms for this tensor which improve complexity from $O(n^r)$ to a low-degree polynomial in $r$, where $n$ is the number of vertices and $r$ is the maximum hyperedge size. Our algorithms are implicit, avoiding formation of the order $r$ adjacency tensor. Here, we demonstrate the flexibility and utility of our approach in practice by developing tensor-based hypergraph centrality and clustering algorithms. We also show these tensor measures offer complementary information to analogous graph-reduction approaches on data, and are also able to detect higher-order structure that many existing matrix-based approaches provably cannot.

97 MATHEMATICS AND COMPUTING↗

Hiperclust

This software leverages transfer learning to analyze atom probe tomography (APT) data. It is trained on synthetic data and then applies this knowledge to predict the optimal number of clusters for a given APT dataset. Initially, the software used preliminary clustering to estimate the general structure of the data. Based on this, it provides suggestions for key parameters like minimum cluster size and minimum number of points. These parameters are critical for algorithms like HDBSCAN, ensuring accurate cluster formation without the need for trial-and-error testing. The software runs on High-Performance computing (HPC) systems, enabling fast, scalable analysis of large APT datasets, ultimately saving time and improving the reliability of clustering outcomes.

Tang, Yalei [Idaho National Laboratory (INL), Idah↗

Deep Learning Image Segmentation for Atmospheric Rivers

Abstract The identification of atmospheric rivers (ARs) is crucial for weather and climate predictions as they are often associated with severe storm systems and extreme precipitation, which can cause large impacts on society. This study presents a deep learning model, termed ARDetect, for image segmentation of ARs using ERA5 data from 1960 to 2020 with labels obtained from the TempestExtremes tracking algorithm. ARDetect is a convolutional neural network (CNN)-based U-Net model, with its structure having been optimized using automatic hyperparameter tuning. Inputs to ARDetect were selected to be the integrated water vapor transport (IVT) and total column water (TCW) fields, as well as the AR mask from TempestExtremes from the previous time step to the one being considered. ARDetect achieved a mean intersection-over-union (mIoU) rate of 89.04% for ARs, indicating its high accuracy in identifying these weather patterns and a superior performance than most deep learning–based models for AR detection. In addition, ARDetect can be executed faster than the TempestExtremes method (seconds vs minutes) for the same period. This provides a significant benefit for online AR detection, especially for high-resolution global models. An ensemble of 10 models, each trained on the same dataset but having different starting weights, was used to further improve on the performance produced by ARDetect, thus demonstrating the importance of model diversity in improving performance. ARDetect provides an effective and fast deep learning–based model for researchers and weather forecasters to better detect and understand ARs, which have significant impacts on weather-related events such as floods and droughts.

Galea, Daniel↗