Search NASA⌕ Search

SEARCH · Search NASA

Results for “probabilistic distance”

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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1979

Efficient feature subset selection with probabilistic distance criteria

Recursive expressions are derived for efficiently computing the commonly used probabilistic distance measures as a change in the criteria both when a feature is added to and when a feature is deleted from the current feature subset. A combinatorial algorithm for generating all possible r feature combinations from a given set of s features in (s/r) steps with a change of a single feature at each step is presented. These expressions can also be used for both forward and backward sequential feature selection.

Chittineni, C. B.↗
DOE OSTI2020

Angular Correlation Function Estimators Accounting for Contamination from Probabilistic Distance Measurements

With the advent of surveys containing millions to billions of galaxies, it is imperative to develop analysis techniques that utilize the available statistical power. In galaxy clustering, even small sample contamination arising from distance uncertainties can lead to large artifacts, which the standard estimator for two-point correlation functions does not account for. We first introduce a formalism, termed decontamination, that corrects for sample contamination by utilizing the observed cross-correlations in the contaminated samples; this corrects any correlation function estimator for contamination. Using this formalism, we present a new estimator that uses the standard estimator to measure correlation functions in the contaminated samples but then corrects for contamination. We also introduce a weighted estimator that assigns each galaxy a weight in each redshift bin based on its probability of being in that bin. We demonstrate that these estimators effectively recover the true correlation functions and their covariance matrices. Our estimators can correct for sample contamination caused by misclassification between object types as well as photometric redshifts; they should be particularly helpful for studies of galaxy evolution and baryonic acoustic oscillations, where forward modeling the clustering signal using the contaminated redshift distribution is undesirable.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2015

MetaBAT, an efficient tool for accurately reconstructing single genomes from complex microbial communities

Grouping large genomic fragments assembled from shotgun metagenomic sequences to deconvolute complex microbial communities, or metagenome binning, enables the study of individual organisms and their interactions. Because of the complex nature of these communities, existing metagenome binning methods often miss a large number of microbial species. In addition, most of the tools are not scalable to large datasets. Here we introduce automated software called MetaBAT that integrates empirical probabilistic distances of genome abundance and tetranucleotide frequency for accurate metagenome binning. MetaBAT outperforms alternative methods in accuracy and computational efficiency on both synthetic and real metagenome datasets. Lastly, it automatically forms hundreds of high quality genome bins on a very large assembly consisting millions of contigs in a matter of hours on a single node. MetaBAT is open source software and available at https://bitbucket.org/berkeleylab/metabat.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1986

Evaluation of detectability and distinguishability of aircraft control element failures using flight test data

This paper examines the detectability and distinguishability of control element failures on the B-737 aircraft. The results of Weiss (1985) are used to define decentralized residuals from analytic redundancy relationships, and the results of Weiss et al. (1984) are used to define the probabilistic distance measures which provide bounds on the minimum achievable probabilities or error. The residual signals are then generated using data which were recorded during a landing approach of the NASA-Langley Advanced Transport Operations (ATOPS) transportation systems research vehicle (TSRV). The distance measures are computed using estimates of the statistics of these residual signals.

Weiss, J. L.↗
DOE OSTI2014

MetaBAT: Metagenome Binning based on Abundance and Tetranucleotide frequence

Grouping large fragments assembled from shotgun metagenomic sequences to deconvolute complex microbial communities, or metagenome binning, enables the study of individual organisms and their interactions. Here we developed automated metagenome binning software, called MetaBAT, which integrates empirical probabilistic distances of genome abundance and tetranucleotide frequency. On synthetic datasets MetaBAT on average achieves 98percent precision and 90percent recall at the strain level with 281 near complete unique genomes. Applying MetaBAT to a human gut microbiome data set we recovered 176 genome bins with 92percent precision and 80percent recall. Further analyses suggest MetaBAT is able to recover genome fragments missed in reference genomes up to 19percent, while 53 genome bins are novel. In summary, we believe MetaBAT is a powerful tool to facilitate comprehensive understanding of complex microbial communities.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Performance Study of Distance-Weighting Approach with Loopy Sum-Product Algorithm for Multi-Object Tracking in Clutter

In this paper, we explore the performance of the distance-weighting probabilistic data association (DWPDA) approach in conjunction with the loopy sum-product algorithm (LSPA) for tracking multiple objects in clutter. First, we discuss the problem of data association (DA), which is to infer the correspondence between targets and measurements. DA plays an important role when tracking multiple targets using measurements of uncertain origin. Second, we describe three methods of data association: probabilistic data association (PDA), joint probabilistic data association (JPDA), and LSPA. We then apply these three DA methods for tracking multiple crossing targets in cluttered environments, e.g., radar detection with false alarms and missed detections. We are interested in two performance metrics: tracking accuracy and computation time. LSPA is known to be superior to PDA in terms of the former and to dominate JPDA in terms of the latter. Last, we consider an additional DA method that is a modification of PDA by incorporating a weighting scheme based on distances between position estimates and measurements. This distance-weighting approach, when combined with PDA, has been shown to enhance the tracking accuracy of PDA without significant change in the computation burden. Since PDA constitutes a crucial building block of LSPA, we hypothesize that DWPDA, when integrated with LSPA, would perform better under the two performance metrics above. Contrary to expectations, the distance-weighting approach does not enhance the performance of LSPA, whether in terms of tracking accuracy or computation time.

47 OTHER INSTRUMENTATION↗
DOE OSTI2012

Rapid Damage eXplorer (RDX): A Probabilistic Framework for Learning Changes From Bitemporal Images

Recent decade has witnessed major changes on the Earth, for example, deforestation, varying cropping and human settlement patterns, and crippling damages due to disasters. Accurate damage assessment caused by major natural and anthropogenic disasters is becoming critical due to increases in human and economic loss. This increase in loss of life and severe damages can be attributed to the growing population, as well as human migration to the disaster prone regions of the world. Rapid assessment of these changes and dissemination of accurate information is critical for creating an effective emergency response. Change detection using high-resolution satellite images is a primary tool in assessing damages, monitoring biomass and critical infrastructures, and identifying new settlements. In this demo, we present a novel supervised probabilistic framework for identifying changes using very high-resolution multispectral, and bitemporal remote sensing images. Our demo shows that the rapid damage explorer (RDX) system is resilient to registration errors and differing sensor characteristics.

Change detection↗
DOE OSTI2011

Quantum repeaters based on deterministic storage of a single photon in distant atomic ensembles

Quantum repeaters hold the promise to prevent the photon losses in communication channels. Most recently, the serious efforts have been applied to achieve scalable distribution of entanglement over long distances. However, the probabilistic nature of entanglement generation and realistic quantum memory storage times make the implementation of quantum repeaters an outstanding experimental challenge. We propose a quantum repeater protocol based on the deterministic storage of a single photon in atomic ensembles confined in distant high-finesse cavities and show that this system is capable of distributing the entanglement over long distances with a much higher rate as compared to previous protocols, thereby alleviating the limitations on the quantum memory lifetime by several orders of magnitude. Our scheme is robust with respect to phase fluctuations in the quantum channel, while the fidelity imperfection is fixed and negligibly small at each step of entanglement swapping.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Geodesic least squares regression for scaling studies in magnetic confinement fusion

In regression analyses for deriving scaling laws that occur in various scientific disciplines, usually standard regression methods have been applied, of which ordinary least squares (OLS) is the most popular. However, concerns have been raised with respect to several assumptions underlying OLS in its application to scaling laws. We here discuss a new regression method that is robust in the presence of significant uncertainty on both the data and the regression model. The method, which we call geodesic least squares regression (GLS), is based on minimization of the Rao geodesic distance on a probabilistic manifold. We demonstrate the superiority of the method using synthetic data and we present an application to the scaling law for the power threshold for the transition to the high confinement regime in magnetic confinement fusion devices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Event Location using Arrival Times from Seismic and Acoustic Phenomena

Accurately locating seismoacoustic sources with geophysical observations helps to monitor natural and anthropogenic phenomena. Sparsely deployed infrasound arrays can readily locate large sources thousands of kms away, but small events typically produce signals observable at only local to regional distances. At such distances, accurate location efforts rely on observations across smaller regional or temporary deployments which often consist of single-channel infrasound sensors that cannot record direction of arrival. Event locations can also be aided by inclusion of ground coupled airwaves (GCA). This study demonstrates how we can robustly locate a catalog of seismoacoustic events using infrasound, GCA, and seismic arrival times at local to near-regional distances. We employ a probabilistic location framework using simplified forward models. Our results indicate that both single-channel infrasound and GCA arrival times can provide accurate estimates of event location in the absence of array-based observations even when using simple models. However, one must carefully choose model uncertainty bounds to avoid underestimation of confidence intervals.

58 GEOSCIENCES↗
DOE OSTI2017

Comoving Stars in Gaia DR1: An Abundance of Very Wide Separation Comoving Pairs

The primary sample of the Gaia Data Release 1 is the Tycho-Gaia Astrometric Solution (TGAS): ≈2 million Tycho-2 sources with improved parallaxes and proper motions relative to the initial catalog. This increased astrometric precision presents an opportunity to find new binary stars and moving groups. We search for high-confidence comoving pairs of stars in TGAS by identifying pairs of stars consistent with having the same 3D velocity using a marginalized likelihood ratio test to discriminate candidate comoving pairs from the field population. Although we perform some visualizations using (bias-corrected) inverse parallax as a point estimate of distance, the likelihood ratio is computed with a probabilistic model that includes the covariances of parallax and proper motions and marginalizes the (unknown) true distances and 3D velocities of the stars. We find 13,085 comoving star pairs among 10,606 unique stars with separations as large as 10 pc (our search limit). Some of these pairs form larger groups through mutual comoving neighbors: many of these pair networks correspond to known open clusters and OB associations, but we also report the discovery of several new comoving groups. Most surprisingly, we find a large number of very wide (>1 pc) separation comoving star pairs, the number of which increases with increasing separation and cannot be explained purely by false-positive contamination. Our key result is a catalog of high-confidence comoving pairs of stars in TGAS. We discuss the utility of this catalog for making dynamical inferences about the Galaxy, testing stellar atmosphere models, and validating chemical abundance measurements.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS2003

Obstacle detection in foliage with ladar and radar

Autonomous off-road navigation is central to several important applications of unmanned ground vehicles. This requires the ability to detect obstacles in vegetation. We examine the prospects for doing so with scanning ladar and with a linear array of 2.2 GHz micro-impulse radar transceivers. For ladar, we summarize our work to date on algorithms for detecting obstacles in tall grass with single-axis ladar, then present a simple probabilistic model of the distance into tall grass that ladar-based obstacle detection is possible.

ladar↗
DOE OSTI2020

Low-frequency Electromagnetic Detection Limits of Underground Nuclear Explosions

Underground nuclear explosions produce a broadband electromagnetic signal that can propagate to the surface at some distance. We perform a logistic regression on historical electromagnetic detections to calculate a probabilistic detection curve for prediction of the propagation distance for any given underground nuclear explosion. The curve predicts positive detections at scaled ranges of 2414.6, 2025.7, 1908.3, and 1672.4 m/ktonne 1/3 at probabilities of 50, 90, 95 and 99%, respectively. For a theoretical 100 ktonne underground nuclear explosion these scaled ranges translate to absolute ranges of 11.2, 9.4, 8.9, and 7.8 km at probabilities of 50, 90, 95 and 99%, respectively. We also motivate a need for improved electromagnetic sensor design and deployment by extending the detection analysis using the quoted signal-to-noise ratio of two and noise amplitude of 10 pT along with attenuation relationships that go as 1/r to 1/r 3 . We find that reducing the noise floor by a factor often could extend the detection limit to approximately 5 to 25 km/ktonne 1/3 , which translates to 24 to 112 km for a theoretical 100 ktonne underground nuclear explosion.

58 GEOSCIENCES↗
DOE OSTI2023

Motion Planning Algorithms for Safety and Quantum Computing Efficiency

Motion planning remains a fundamental problem in robotics. Sampling-based algorithms use randomization to allow efficient solutions to this complex problem. As mobile robots and autonomous vehicles become more prevalent in everyday life, motion planning must be applied to increasingly challenging scenarios. Safety has become a paramount concern in motion planning for ensuring robotic applications enrich human lives. To date, many motion planning techniques to increase safety in the face of uncertain and dynamic environments have been developed. This dissertation first addresses distributional safety of Rapidly-Exploring Random Trees (RRT) through our algorithm W-Safe RRT. To acknowledge distributional uncertainty and poor modeling, W-Safe RRT uses the Wasserstein metric to provide a probabilistic bound on the distributional distance between a robot and obstacles. Human-interpretable environmental agent classification allows online safety margin adaptation. We propose and analyze an integrating region method for online classification that increases actor labeling accuracy based on behavioral feature values when compared to state of the art methods. The method performs class assignments based on local maximum likelihood in a created behavioral feature-space, allowing a notion of classification uncertainty. Model-based methods with safety guarantees can quickly become computationally in tractable, especially with multiple agents, higher dimensions, and plentiful unknowns. Sampling based algorithms have been parallelized for computation with multi-core computers and GPUs. We consider the use of quantum algorithms and computers for sampling-based motion planning for the first time. Quantum computing performs operations on superpositions of states and can solve certain problems much more efficiently than classical computers, but introduces previously unseen challenges. With Quantum-RRT, we recast the motion planning problem into a database-search structure and use Quantum Amplitude Amplification to find reachable states in the database with a quadratic performance increase over classical methods. We address two error sources with this method: quantum measurement and quantum oracle errors. We then extend this method to Parallel Quantum-RRT, which uses a manager-worker architecture with multiple parallel quantum workers to increase database search efficiency. We compare algorithm architectures and characterize probabilities of multiple workers finding solutions. Lastly, we test in simulation the quantum algorithms against classical versions in a wide variety of scenarios, concluding that a similar parallelization improvement is to be found in the quantum case as was found in the parallelization of classical RRT.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Efficient Signal Processing in BOTDA: Utilizing PCA and PCA-Based Neural Networks for Temperature Monitoring

This work presents a comparative analysis of the various signal processing techniques used in the Brillouin gain spectrum (BGS) peak estimation. Traditional fitting methods such as Lorentzian curve fitting (LCF) are slow and less effective in noisy data. PCA-based methods were tested on the experimental data: A Euclidian distance-based approach, and a probabilistic deep neural network (PDNN) based approach, both using 5 principal components to represent a single BGS. Both methods significantly reduce computational time with respect to LCF, whereas PDNN offers uncertainty insights along with the parameter value. Measuring a range of temperatures, analyzing accuracy, and speed, it can be concluded that PCA trained PDNN outperforms other methods, and appears to be helpful in scenario where large datasets are generated.

Brillouin optical time domain analysis↗
DOE OSTI2014

Long-distance quantum key distribution with imperfect devices

Quantum key distribution over probabilistic quantum repeaters is addressed. We compare, under practical assumptions, two such schemes in terms of their secure key generation rate per memory, R{sub QKD}. The two schemes under investigation are the one proposed by Duan et al. in [Nat. 414, 413 (2001)] and that of Sangouard et al. proposed in [Phys. Rev. A 76, 050301 (2007)]. We consider various sources of imperfections in the latter protocol, such as a nonzero double-photon probability for the source, dark count per pulse, channel loss and inefficiencies in photodetectors and memories, to find the rate for different nesting levels. We determine the maximum value of the double-photon probability beyond which it is not possible to share a secret key anymore. We find the crossover distance for up to three nesting levels. We finally compare the two protocols.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Wasserstein normalized autoencoder for anomaly detection

A novel anomaly detection algorithm is presented. The Wasserstein normalized autoencoder (WNAE) is a normalized probabilistic model that minimizes the Wasserstein distance between the learned probability distribution—a Boltzmann distribution where the energy is the reconstruction error of the autoencoder (AE)—and the distribution of the training data. This algorithm has been developed and applied to the identification of semivisible jets—conical sprays of visible standard model (SM) particles and invisible dark matter states—with the CMS experiment at the CERN LHC. Trained on jets of particles from simulated SM processes, the WNAE is shown to learn the probability distribution of the input data in a fully unsupervised fashion, such that it effectively identifies new physics jets as anomalies. The model exhibits stable, convergent training and recovers strong classification performance for a wide range of signals against the selected background process, for which a standard AE fails because of outlier reconstruction. In addition, the model improves upon standard normalized autoencoders while remaining fully agnostic to the signal. The WNAE directly tackles the problem of outlier reconstruction, a common failure mode of autoencoders in anomaly detection tasks.

Hayrapetyan, Aram [Yerevan Phys. Inst.]↗
DOE OSTI2024

Twisty-puzzle-inspired approach to Clifford synthesis

The problem of decomposing an arbitrary Clifford element into a sequence of Clifford gates is known as Clifford synthesis. Drawing inspiration from similarities between this and the famous Rubik's cube twisty puzzle, here we develop a machine learning approach for Clifford synthesis based on learning an approximation to the distance to the identity. This approach is probabilistic and computationally intensive. However, when a decomposition is successfully found, it often involves fewer gates than the decomposition methods used in the Qiskit decomposition protocol, which uses a combination of several well-known Clifford decomposition schemes. Additionally, our approach is much more flexible than existing algorithms in that arbitrary gate sets, device topologies, and gate fidelities may be incorporated, thus allowing for the approach to be tailored to a specific device.

97 MATHEMATICS AND COMPUTING↗