Search NASA⌕ Search

SEARCH · Search NASA

Results for “Real Data”

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 505 records · Page 28
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

ASPIRES: Airport Shuttle Planning and Improved Routing Event-driven Simulation

Most of the existing traffic simulation packages require significant calibration work to be able to reflect reality. To evaluate special operations including emerging technologies, a microscopic simulation that tracks detailed interactions of all the elements of the traffic systems is usually needed. This type of simulation is usually computationally demanding. This work developed an Airport Shuttle Planning and Improved Routing Event-driven Simulation (ASPIRES) package to simulate and evaluate current, potential, and future airport shuttle operations. Here, the simulation was driven by data and thus did not require much calibration effort. The discrete-event simulation nature of ASPIRES makes the simulation computationally efficient. Simulating 1 day of shuttle operations takes less than 2s. The study site of this work is the Dallas/Fort Worth International Airport in the U.S. The shuttle service that connects the five terminals of the airport and the rental car center was studied. Travel times, dwell times, and passenger arrivals were simulated using empirical distributions derived mainly from real data to capture the stochastic nature of the rental car center shuttle bus operations. Data on bus miles traveled, bus energy consumption, passenger wait times, and passengers left behind at stops were collected to study the trade-off between energy use and passenger experience. Electric bus and on-demand bus operations were also included. The simulation outputs can show passengers statistics at terminals, shuttles statistics, and charging station statistics. ASPIRES cannot be used to model a generic traffic system but is well-suited for fleet systems.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2022

Real-time Event Detection Using Rank Signatures of Real-world PMU Data

Timely detection of power system events is a crucial task, which can facilitate the implementation of remedial actions to improve reliability, resiliency, and security of the system. Meanwhile, the widespread deployment of phasor measurement units (PMUs) makes it possible to develop data-driven event detection techniques. However, relying purely on data without incorporating domain knowledge for the event detection task in power systems poses substantial security and stability risks due to issues associated with data misinterpretation and model accuracy. In this regard, we propose a real-time event detection method using real-world PMU data by incorporating domain knowledge to adequately capture the event signatures. Specifically, we track the change in rank signatures of PMU data to accurately localize the events. To optimize the detection process, we incorporate an offline Bayesian optimization algorithm to tune the parameters by efficiently searching for the best values. The experiments using the real-world PMU dataset from a U.S. interconnection show that the proposed event detection approach can efficiently detect the events from PMU data streams with high accuracy.

Ghasemkhani, Amir↗
DOE OSTI2025

Modeling of the high column density systems in the Lyman-Alpha forest

The Lyman-α forests observed in the spectra of high-redshift quasars can be used as a tracer of the cosmological matter density to study baryon acoustic oscillations (BAO) and the Alcock-Paczynski effect. Extraction of cosmological information from these studies requires modeling of the forest correlations. While the models depend most importantly on the bias parameters of the intergalactic medium (IGM), they also depend on the numbers and characteristics of high-column-density systems (HCDs) ranging from Lyman-limit systems with column densities log N HI /1cm -2 > 17 to damped Lyman-α systems (DLAs) with log N HI /1cm -2 > 20.2. These HCDs introduce broad damped absorption characteristic of a Voigt profile. Consequently they imprint a component on the power spectrum whose modes in the radial direction are suppressed, leading to a scale-dependent bias. Using mock data sets of known HCD content, we test a model that describes this effect in terms of the distribution of column densities of HCDs, the Fourier transforms of their Voigt profiles and the bias of the halos containing the HCDs. Our results show that this physically well-motivated model describes the effects of HCDs with an accuracy comparable to that of the ad-hoc models used in published forest analyses. We also discuss the problems of applying the model to real data, where the HCD content and their bias is uncertain.

Lyman alpha forest↗
DOE OSTI2020

BASS: An R Package for Fitting and Performing Sensitivity Analysis of Bayesian Adaptive Spline Surfaces

In this work, we present the R package BASS as a tool for nonparametric regression. The primary focus of the package is fitting fully Bayesian adaptive spline surface (BASS) models and performing global sensitivity analyses of these models. The BASS framework is similar to that of Bayesian multivariate adaptive regression splines (BMARS) from Denison, Mallick, and Smith (1998), but with many added features. The software is built to efficiently handle significant amounts of data with many continuous or categorical predictors and with functional response. Under our Bayesian framework, most priors are automatic but these can be modified by the user to focus on parsimony and the avoidance of overfitting. If directed to do so, the software uses parallel tempering to improve the reversible jump Markov chain Monte Carlo (RJMCMC) methods used to perform inference. We discuss the implementation of these features and present the performance of BASS in a number of analyses of simulated and real data.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2002

A Bayesian Approach to Estimating Coupling Between Neural Components: Evaluation of the Multiple Component, Event-Related Potential (mcERP) Algorithm

Accurate measurement of single-trial responses is key to a definitive use of complex electromagnetic and hemodynamic measurements in the investigation of brain dynamics. We developed the multiple component, Event-Related Potential (mcERP) approach to single-trial response estimation. To improve our resolution of dynamic interactions between neuronal ensembles located in different layers within a cortical region and/or in different cortical regions. The mcERP model assets that multiple components defined as stereotypic waveforms comprise the stimulus-evoked response and that these components may vary in amplitude and latency from trial to trial. Maximum a posteriori (MAP) solutions for the model are obtained by iterating a set of equations derived from the posterior probability. Our first goal was to use the ANTWERP algorithm to analyze interactions (specifically latency and amplitude correlation) between responses in different layers within a cortical region. Thus, we evaluated the model by applying the algorithm to synthetic data containing two correlated local components and one independent far-field component. Three cases were considered: the local components were correlated by an interaction in their single-trial amplitudes, by an interaction in their single-trial latencies, or by an interaction in both amplitude and latency. We then analyzed the accuracy with which the algorithm estimated the component waveshapes and the single-trial parameters as a function of the linearity of each of these relationships. Extensions of these analyses to real data are discussed as well as ongoing work to incorporate more detailed prior information.

Shah, Ankoor S.↗
DOE OSTI2021

Sensitivity of back‐projection algorithm (BPA) synthetic aperture radar (SAR) image formation to initial position, velocity, and attitude navigation errors

Abstract The Back‐Projection Algorithm (BPA) is a time‐domain‐matched filtering technique to form synthetic aperture radar (SAR) images. To produce high‐quality BPA images, precise navigation data for the radar platform must be known. Errors in position, velocity, or attitude result in improperly formed images that are corrupted by shifting and blurring. The contribution of this paper is the development of analytical expressions that characterise the relationship between navigation errors and image formation errors from an inertial navigation point of view, where trajectory estimation errors in position, velocity, and attitude propagate through time and cause compounding errors in the vehicle state vector. These analytical expressions are verified via simulated image formation and real‐data image formation.

Lindstrom, Colton↗
NASA NTRS1975

Sensitivity analysis of short-arc station coordinate determinations from range data

The accurate determination of the geocentric coordinates of a tracking station is essential for most geodetic and geophysical satellite applications. Since most of these satellites are close to the earth, the geopotential model is a dominant source of error which significantly influences station coordinate determinations. Other sources, such as GM error and drag, also influence the accuracy of the station coordinate determination. One technique for reducing the effect of these errors is to use short-arcs consisting of a few passes of the satellite over the tracking station. This paper analyzes the sensitivity of short-arc station coordinate estimates to various errors in the physical model, to the number of observations, and to the station-satellite geometry using simulated as well as real data.

Schutz, B. E.↗
NASA NTRS1976

Sensitivity analysis of short-arc station coordinate determinations from range data

The accurate determination of the geocentric coordinates of a tracking station is essential for most geodetic and geophysical satellite applications. Since most of these satellites are close to the earth, the geopotential model is a dominant source of error which significantly influences station coordinate determinations. Other sources, such as GM error and drag, also influence the accuracy of the station coordinate determination. One technique for reducing the effect of these errors is to use short-arcs consisting of a few passes of the satellite over the tracking station. This paper analyzes the sensitivity of short-arc station coordinate estimates to various errors in the physical model, to the number of observations, and to the station-satellite geometry using simulated as well as real data.

Schutz, B. E.↗
DOE OSTI2014

Sampling-based Uncertainty Quantification in Deconvolution of X-ray Radiographs

In imaging applications that focus on quantitative analysis{such as X-ray radiography in the security sciences--it is necessary to be able to reliably estimate the uncertainties in the processing algorithms applied to the image data, and deconvolving the system blur out of the image is usually an essential step. In this work we solve the deconvolution problem within a Bayesian framework for edge-enhancing reconstruction with uncertainty quantification. The likelihood is a normal approximation to the Poisson likelihood, and the prior is generated from a classical total variation regularized Poisson deconvolution. Samples from the corresponding posterior distribution are computed using a Markov chain Monte Carlo approach, giving a pointwise measure of uncertainty in the final, deconvolved signal. We demonstrate the results on real data used to calibrate a high-energy X-ray source and show that this approach gives reconstructions as good as classical regularization methods, while mitigating many of their drawbacks.

Deconvolution, Inverse Problems, Markov Chain Mont↗
DOE OSTI2022

Computational Estimation by Scientific Data Mining with Classical Methods to Automate Learning Strategies of Scientists

Experimental results are often plotted as 2-dimensional graphical plots (aka graphs) in scientific domains depicting dependent versus independent variables to aid visual analysis of processes. Repeatedly performing laboratory experiments consumes significant time and resources, motivating the need for computational estimation. The goals are to estimate the graph obtained in an experiment given its input conditions, and to estimate the conditions that would lead to a desired graph. Existing estimation approaches often do not meet accuracy and efficiency needs of targeted applications. We develop a computational estimation approach called AutoDomainMine that integrates clustering and classification over complex scientific data in a framework so as to automate classical learning methods of scientists. Knowledge discovered thereby from a database of existing experiments serves as the basis for estimation. Challenges include preserving domain semantics in clustering, finding matching strategies in classification, striking a good balance between elaboration and conciseness while displaying estimation results based on needs of targeted users, and deriving objective measures to capture subjective user interests. These and other challenges are addressed in this work. The AutoDomainMine approach is used to build a computational estimation system, rigorously evaluated with real data in Materials Science. Our evaluation confirms that AutoDomainMine provides desired accuracy and efficiency in computational estimation. It is extendable to other science and engineering domains as proved by adaptation of its sub-processes within fields such as Bioinformatics and Nanotechnology.

Computer Science↗
DOE OSTI2020

Deblending galaxies with variational autoencoders: A joint multiband, multi-instrument approach

ABSTRACT Blending of galaxies has a major contribution in the systematic error budget of weak-lensing studies, affecting photometric and shape measurements, particularly for ground-based, deep, photometric galaxy surveys, such as the Rubin Observatory Legacy Survey of Space and Time (LSST). Existing deblenders mostly rely on analytic modelling of galaxy profiles and suffer from the lack of flexible yet accurate models. We propose to use generative models based on deep neural networks, namely variational autoencoders (VAE), to learn probabilistic models directly from data. We train a VAE on images of centred, isolated galaxies, which we reuse, as a prior, in a second VAE-like neural network in charge of deblending galaxies. We train our networks on simulated images including six LSST bandpass filters and the visible and near-infrared bands of the Euclid satellite, as our method naturally generalizes to multiple bands and can incorporate data from multiple instruments. We obtain median reconstruction errors on ellipticities and r-band magnitude between ±0.01 and ±0.05, respectively, in most cases, and ellipticity multiplicative bias of 1.6 per cent for blended objects in the optimal configuration. We also study the impact of decentring and prove the method to be robust. This method only requires the approximate centre of each target galaxy, but no assumptions about the number of surrounding objects, pointing to an iterative detection/deblending procedure we leave for future work. Finally, we discuss future challenges about training on real data and obtain encouraging results when applying transfer learning.

Arcelin, Bastien↗
NASA NTRS1990

Cloud optical parameters as derived from the multispectral cloud radiometer

Here, researchers analyze the data taken in the marine stratocumulus intensive field observation component of the First ISCCP Regional Experiment (FIRE), conducted off the California coast in July, 1987 using the Multispectral Cloud Radiometer (MCR). Researchers installed an efficient retrieval scheme for deriving the cloud optical thickness and droplet mode radius, and have described the behavior of the retrieval error. Generally the scheme can retrieve the optical thickness and mode radius adequately unless they are too small; the use of the forward scattering region is more sound than the use of the backscattering portion. Applying the method to real data, researchers derived the two-dimensional distribution of optical thickness and mode radius for a portion of one of the FIRE marine stratocumulus missions. In this case study, the droplet size showed a more uniform distribution than optical thickness with some correlation between large droplet size and small optical thickness. Although researchers can find microphysical reasons for these tendencies, they suspect that the remotely sensed droplet size may be overestimated. As a future problem, they will compare results with in situ data of the droplet size distribution. Also it will be very important to check several reasons why the droplet radius might be overestimated, e.g., soot contamination, effect of escaping photons from the lateral sides of broken clouds, and so on.

Nakajima, Eruyuki↗
DOE OSTI2024

Diffusion-Model-Assisted Supervised Learning of Generative Models for Density Estimation

Here, we present a supervised learning framework of training generative models for density estimation. Generative models, including generative adversarial networks (GANs), normalizing flows, and variational auto-encoders (VAEs), are usually considered as unsupervised learning models, because labeled data are usually unavailable for training. Despite the success of the generative models, there are several issues with the unsupervised training, e.g., requirement of reversible architectures, vanishing gradients, and training instability. To enable supervised learning in generative models, we utilize the score-based diffusion model to generate labeled data. Unlike existing diffusion models that train neural networks to learn the score function, we develop a training-free score estimation method. This approach uses mini-batch-based Monte Carlo estimators to directly approximate the score function at any spatial-temporal location in solving an ordinary differential equation (ODE), corresponding to the reverse-time stochastic differential equation (SDE). This approach can offer both high accuracy and substantial time savings in neural network training. Once the labeled data are generated, we can train a simple, fully connected neural network to learn the generative model in the supervised manner. Compared with existing normalizing flow models, our method does not require the use of reversible neural networks and avoids the computation of the Jacobian matrix. Compared with existing diffusion models, our method does not need to solve the reverse-time SDE to generate new samples. As a result, the sampling efficiency is significantly improved. We demonstrate the performance of our method by applying it to a set of 2D datasets as well as real data from the University of California Irvine (UCI) repository.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Numerical evidence against advantage with quantum fidelity kernels on classical data

Quantum machine learning techniques are commonly considered one of the most promising candidates for demonstrating practical quantum advantage. In particular, quantum kernel methods have been demonstrated to be able to learn certain classically intractable functions efficiently if the kernel is well aligned with the target function. In the more general case, quantum kernels are known to suffer from exponential “flattening” of the spectrum as the number of qubits grows, preventing generalization and necessitating the control of the inductive bias by hyperparameters. We show that the general-purpose hyperparameter-tuning techniques proposed to improve the generalization of quantum kernels lead to the kernel becoming well approximated by a classical kernel, removing the possibility of quantum advantage. We provide extensive numerical evidence for this phenomenon utilizing multiple previously studied quantum feature maps and both synthetic and real data. Our results show that unless novel techniques are developed to control the inductive bias of quantum kernels, they are unlikely to provide a quantum advantage on classical data that lacks special structure.

Quantum Information, Science & Technology↗
NASA NTRS2011

Distributed Monitoring of the R(sup 2) Statistic for Linear Regression

The problem of monitoring a multivariate linear regression model is relevant in studying the evolving relationship between a set of input variables (features) and one or more dependent target variables. This problem becomes challenging for large scale data in a distributed computing environment when only a subset of instances is available at individual nodes and the local data changes frequently. Data centralization and periodic model recomputation can add high overhead to tasks like anomaly detection in such dynamic settings. Therefore, the goal is to develop techniques for monitoring and updating the model over the union of all nodes data in a communication-efficient fashion. Correctness guarantees on such techniques are also often highly desirable, especially in safety-critical application scenarios. In this paper we develop DReMo a distributed algorithm with very low resource overhead, for monitoring the quality of a regression model in terms of its coefficient of determination (R2 statistic). When the nodes collectively determine that R2 has dropped below a fixed threshold, the linear regression model is recomputed via a network-wide convergecast and the updated model is broadcast back to all nodes. We show empirically, using both synthetic and real data, that our proposed method is highly communication-efficient and scalable, and also provide theoretical guarantees on correctness.

Bhaduri, Kanishka↗
DOE OSTI2020

Selecting the independent coordinates of manifolds with large aspect ratios

Many manifold embedding algorithms fail apparently when the data manifold has a large aspect ratio (such as a long, thin strip). Here, we formulate success and failure in terms of finding a smooth embedding, showing also that the problem is pervasive and more complex than previously recognized. Mathematically, success is possible under very broad conditions, provided that embedding is done by carefully selected eigenfunctions of the Laplace-Beltrami operator Δ. Hence, we propose a bicriterial Independent Eigencoordinate Selection (IES) algorithm that selects smooth embeddings with few eigenvectors. The algorithm is grounded in theory, has low computational overhead, and is successful on synthetic and large real data.

Meila, Marina↗
DOE OSTI2018

Implementing and evaluating a Gaussian mixture framework for identifying gene function from TnSeq data

The rapid acceleration of microbial genome sequencing increases opportunities to understand bacterial gene function. Unfortunately, only a small proportion of genes have been studied. Recently, TnSeq has been proposed as a cost-effective, highly reliable approach to predict gene functions as a response to changes in a cell’s fitness before-after genomic changes. However, major questions remain about how to best determine whether an observed quantitative change in fitness represents a meaningful change. To address the limitation, we develop a Gaussian mixture model framework for classifying gene function from TnSeq experiments. In order to implement the mixture model, we present the Expectation-Maximization algorithm and a hierarchical Bayesian model sampled using Stan’s Hamiltonian Monte-Carlo sampler. We compare these implementations against the frequentist method used in current TnSeq literature. From simulations and real data produced by E.coli TnSeq experiments, we show that the Bayesian implementation of the Gaussian mixture framework provides the most consistent classification results.

Li, Kevin↗