Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized algorithm”

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 1,315 records · Page 73

"Mtrack 2.0": An ultra-scale tracking algorithm for low-resolution overhead imagery

Overhead persistent surveillance systems are becoming more capable at acquiring wide-field image sequences for long time-spans. The need to exploit this data is becoming ever greater. The ability to track a single vehicle of interest or to track all the observable vehicles, which may number in the thousands, over large, cluttered regions while they persist in the imagery is very desirable. Typically, this imagery has many thousands of pixels on a side and is characterized by lower resolutions (e.g. {approx}0.5 meters/pixel to {approx}2.0 meters/pixel) and lower frame rates (e.g. {approx} sub-Hz to several Hz). We describe our ultra-scale capable implementation of a multiple-vehicle tracking algorithm for overhead persistent surveillance imagery. This work builds upon an earlier report, where now the algorithm has been modified for improved performance and has been substantially improved to handle much larger datasets in a much shorter time.

42 ENGINEERING↗

Data-Parallel Mesh Connected Components Labeling and Analysis

We present a data-parallel algorithm for identifying and labeling the connected sub-meshes within a domain-decomposed 3D mesh. The identification task is challenging in a distributed-memory parallel setting because connectivity is transitive and the cells composing each sub-mesh may span many or all processors. Our algorithm employs a multi-stage application of the Union-find algorithm and a spatial partitioning scheme to efficiently merge information across processors and produce a global labeling of connected sub-meshes. Marking each vertex with its corresponding sub-mesh label allows us to isolate mesh features based on topology, enabling new analysis capabilities. We briefly discuss two specific applications of the algorithm and present results from a weak scaling study. We demonstrate the algorithm at concurrency levels up to 2197 cores and analyze meshes containing up to 68 billion cells.

97 MATHEMATICS AND COMPUTING↗

Numerical estimation of the relative entropy of entanglement

We propose a practical algorithm for the calculation of the relative entropy of entanglement (REE), defined as the minimum relative entropy between a state and the set of states with positive partial transpose. Our algorithm is based on a practical semidefinite cutting plane approach. In low dimensions the implementation of the algorithm in matlab provides an estimation for the REE with an absolute error smaller than 10{sup -3}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Algorithmic properties of the midpoint predictor-corrector time integrator.

Algorithmic properties of the midpoint predictor-corrector time integration algorithm are examined. In the case of a finite number of iterations, the errors in angular momentum conservation and incremental objectivity are controlled by the number of iterations performed. Exact angular momentum conservation and exact incremental objectivity are achieved in the limit of an infinite number of iterations. A complete stability and dispersion analysis of the linearized algorithm is detailed. The main observation is that stability depends critically on the number of iterations performed.

97 MATHEMATICS AND COMPUTING↗

Faith in the algorithm, part 1: beyond the turing test

Since the Turing test was first proposed by Alan Turing in 1950, the goal of artificial intelligence has been predicated on the ability for computers to imitate human intelligence. However, the majority of uses for the computer can be said to fall outside the domain of human abilities and it is exactly outside of this domain where computers have demonstrated their greatest contribution. Another definition for artificial intelligence is one that is not predicated on human mimicry, but instead, on human amplification, where the algorithms that are best at accomplishing this are deemed the most intelligent. This article surveys various systems that augment human and social intelligence.

99 GENERAL AND MISCELLANEOUS↗

Semi-analytic treatment of nearly-singular Galerkin surface integrals

On utilizing piecewise linear test and interpolation functions over flat triangles, three semi-analytic techniques for evaluating nearly-singular surface integrals of potential theory are developed and investigated in the context of a three-dimensional Galerkin approximation. In all procedures, the inner surface integral is calculated exactly via recursive expressions defined over the edges of the integration triangle. In addition, the proposed methods respectively employ a Duffy transformation, sinh transformations, and polynomial transformations to weaken or smooth out near singularities, followed by a standard product Gauss-Legendre quadrature rule to compute the outer boundary integral. Numerical experiments and comparisons of the proposed approaches are included to provide more insight into the performance of these techniques. Computational tests have demonstrated that the algorithm based on a Duffy transformation is the most efficient and effective method for dealing with nearly-singular as well as well-separated integrals.

99 GENERAL AND MISCELLANEOUS↗

Analysis of High-Throughput ELISA Microarray Data

Our research group develops analytical methods and software for the high-throughput analysis of quantitative enzyme-linked immunosorbent assay (ELISA) microarrays. ELISA microarrays differ from DNA microarrays in several fundamental aspects and most algorithms for analysis of DNA microarray data are not applicable to ELISA microarrays. In this review, we provide an overview of the steps involved in ELISA microarray data analysis and how the statistically sound algorithms we have developed provide an integrated software suite to address the needs of each data-processing step. The algorithms discussed are available in a set of open-source software tools (http://www.pnl.gov/statistics/ProMAT).

59 BASIC BIOLOGICAL SCIENCES↗

Top Ten Interaction Challenges in Extreme-Scale Visual Analytics

The chapter presents ten selected user interfaces and interaction challenges in extreme-scale visual analytics. The study of visual analytics is often referred to as 'the science of analytical reasoning facilitated by interactive visual interfaces' in the literature. The discussion focuses on the issues of applying visual analytics technologies to extreme-scale scientific and non-scientific data ranging from petabyte to exabyte in sizes. The ten challenges are: in situ interactive analysis, user-driven data reduction, scalability and multi-level hierarchy, representation of evidence and uncertainty, heterogeneous data fusion, data summarization and triage for interactive query, analytics of temporally evolving features, the human bottleneck, design and engineering development, and the Renaissance of conventional wisdom. The discussion addresses concerns that arise from different areas of hardware, software, computation, algorithms, and human factors. The chapter also evaluates the likelihood of success in meeting these challenges in the near future.

99 GENERAL AND MISCELLANEOUS↗

A Simulation and Modeling Framework for Space Situational Awareness

This paper describes the development and initial demonstration of a new, integrated modeling and simulation framework, encompassing the space situational awareness enterprise, for quantitatively assessing the benefit of specific sensor systems, technologies and data analysis techniques. The framework is based on a flexible, scalable architecture to enable efficient, physics-based simulation of the current SSA enterprise, and to accommodate future advancements in SSA systems. In particular, the code is designed to take advantage of massively parallel computer systems available, for example, at Lawrence Livermore National Laboratory. The details of the modeling and simulation framework are described, including hydrodynamic models of satellite intercept and debris generation, orbital propagation algorithms, radar cross section calculations, optical brightness calculations, generic radar system models, generic optical system models, specific Space Surveillance Network models, object detection algorithms, orbit determination algorithms, and visualization tools. The use of this integrated simulation and modeling framework on a specific scenario involving space debris is demonstrated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

STUDIES IN ASTRONOMICAL TIME SERIES ANALYSIS. VI. BAYESIAN BLOCK REPRESENTATIONS

This paper addresses the problem of detecting and characterizing local variability in time series and other forms of sequential data. The goal is to identify and characterize statistically significant variations, at the same time suppressing the inevitable corrupting observational errors. We present a simple nonparametric modeling technique and an algorithm implementing it-an improved and generalized version of Bayesian Blocks-that finds the optimal segmentation of the data in the observation interval. The structure of the algorithm allows it to be used in either a real-time trigger mode, or a retrospective mode. Maximum likelihood or marginal posterior functions to measure model fitness are presented for events, binned counts, and measurements at arbitrary times with known error distributions. Problems addressed include those connected with data gaps, variable exposure, extension to piecewise linear and piecewise exponential representations, multivariate time series data, analysis of variance, data on the circle, other data modes, and dispersed data. Simulations provide evidence that the detection efficiency for weak signals is close to a theoretical asymptotic limit derived by Arias-Castro et al. In the spirit of Reproducible Research all of the code and data necessary to reproduce all of the figures in this paper are included as supplementary material.

79 ASTRONOMY AND ASTROPHYSICS↗

Solving Chemical Master Equations by an Adaptive Wavelet Method

Solving chemical master equations is notoriously difficult due to the tremendous number of degrees of freedom. We present a new numerical method which efficiently reduces the size of the problem in an adaptive way. The method is based on a sparse wavelet representation and an algorithm which, in each time step, detects the essential degrees of freedom required to approximate the solution up to the desired accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Physical Fidelity in Particle-In-Cell Modeling of Small Debye-Length Plasmas

The connection between macro-particle shape functions and non-physical phase-space 'heating' in the particle-in-cell (PIC) algorithm is examined. The development of fine-scale phase-space structures starting from a cold initial condition is shown to be related to spatial correlations in the interpolated fields used in the Lorentz force. It is shown that the plasma evolution via the PIC algorithm from a cold initial condition leads to a state that is not consistent with that of a thermal plasma.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A SIMULTANEOUS STACKING AND DEBLENDING ALGORITHM FOR ASTRONOMICAL IMAGES

Stacking analysis is a means of detecting faint sources using a priori position information to estimate an aggregate signal from individually undetected objects. Confusion severely limits the effectiveness of stacking in deep surveys with limited angular resolution, particularly at far-infrared to submillimeter wavelengths, and causes a bias in stacking results. Deblending corrects measured fluxes for confusion from adjacent sources; however, we find that standard deblending methods only reduce the bias by roughly a factor of 2 while tripling the variance. We present an improved algorithm for simultaneous stacking and deblending that greatly reduces bias in the flux estimate with nearly minimum variance. When confusion from neighboring sources is the dominant error, our method improves upon rms error by at least a factor of 3 and as much as an order of magnitude compared to other algorithms. This improvement will be useful for Herschel and other telescopes working in a source confused, low signal-to-noise regime.

79 ASTRONOMY AND ASTROPHYSICS↗

Reduced Basis Method for Nanodevices Simulation

Ballistic transport simulation in nanodevices, which involves self-consistently solving a coupled Schrodinger-Poisson system of equations, is usually computationally intensive. Here, we propose coupling the reduced basis method with the subband decomposition method to improve the overall efficiency of the simulation. By exploiting a posteriori error estimation procedure and greedy sampling algorithm, we are able to design an algorithm where the computational cost is reduced significantly. In addition, the computational cost only grows marginally with the number of grid points in the confined direction.

99 GENERAL AND MISCELLANEOUS↗

Geometric algorithm for efficient coincident detection of gravitational waves

Data from a network of gravitational-wave detectors can be analyzed in coincidence to increase detection confidence and reduce nonstationarity of the background. We propose and explore a geometric algorithm to combine the data from a network of detectors. The algorithm makes optimal use of the variances and covariances that exist among the different parameters of a signal in a coincident detection of events. The new algorithm essentially associates with each trigger ellipsoidal regions in parameter space defined by the covariance matrix. Triggers from different detectors are deemed to be in coincidence if their ellipsoids have a nonzero overlap. Compared to an algorithm that uses uncorrelated windows separately for each of the signal parameters, the new algorithm greatly reduces the background rate thereby increasing detection efficiency at a given false alarm rate.

79 ASTRONOMY AND ASTROPHYSICS↗

Stochastic Differential Equations for Modeling, Estimation and Identification of Mobile-to-Mobile Communication Channels

Mobile-to-mobile networks are characterized by node mobility that makes the propagation environment time varying and subject to fading. As a consequence, the statistical characteristics of the received signal vary continuously, giving rise to a Doppler power spectral density (DPSD) which varies from one observation instant to the next. The current models do not capture and track the time varying characteristics. This paper is concerned with dynamical modelling of mobile-to-mobile channels, parameter estimation and identification from received signal measurements. The evolution of the propagation environment is described by stochastic differential equations. In particular, it is shown that the parameters of the models can be determined by approximating the band-limited DPSD using the Gauss-Newton method. However, since the DPSD is not available online, we propose to use a filter-based expectation maximization algorithm and Kalman filter to estimate the channel parameters and states, respectively. The scheme results in a finite dimensional filter which only uses the first and second order statistics. The algorithm is recursive allowing the inphase and quadrature components and parameters to be estimated online from received signal measurements. The algorithms are tested using experimental data collected from moving sensor nodes in indoor and outdoor environments demonstrating the method s viability.

99 GENERAL AND MISCELLANEOUS↗

Detection of facilities in satellite imagery using semi-supervised image classification and auxiliary contextual observables

Detecting complex targets, such as facilities, in commercially available satellite imagery is a difficult problem that human analysts try to solve by applying world knowledge. Often there are known observables that can be extracted by pixel-level feature detectors that can assist in the facility detection process. Individually, each of these observables is not sufficient for an accurate and reliable detection, but in combination, these auxiliary observables may provide sufficient context for detection by a machine learning algorithm. We describe an approach for automatic detection of facilities that uses an automated feature extraction algorithm to extract auxiliary observables, and a semi-supervised assisted target recognition algorithm to then identify facilities of interest. We illustrate the approach using an example of finding schools in Quickbird image data of Albuquerque, New Mexico. We use Los Alamos National Laboratory's Genie Pro automated feature extraction algorithm to find a set of auxiliary features that should be useful in the search for schools, such as parking lots, large buildings, sports fields and residential areas and then combine these features using Genie Pro's assisted target recognition algorithm to learn a classifier that finds schools in the image data.

99 GENERAL AND MISCELLANEOUS↗

Tracking Files Using the Kepler Provenance Framework

Workflow Management Systems (WFMS), such as Kepler, are proving to be an important tool in scientific problem solving. They can automate and manage complex processes and huge amounts of data produced by petascale simulations. Typically, the produced data need to be properly visualized and analyzed by scientists in order to achieve the desired scientific goals. Both run-time and post analysis may benefit from, even require, additional meta-data - provenance information. One of the challenges in this context is the tracking of the data files that can be produced in very large numbers during stages of the workflow, such as visualizations. The Kepler provenance framework collects all or part of the raw information flowing through the workflow graph. This information then needs to be further parsed to extract meta-data of interest. This can be done through add-on tools and algorithms. We show how to automate tracking specific information such as data files locations.

97 MATHEMATICS AND COMPUTING↗