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,279 records · Page 71

Detecting Multiple Moving Objects in Crowded Environments with Coherent Motion Regions

We propose an object detection system that uses the locationsof tracked low-level feature points as input, and producesa set of independent coherent motion regions as output.As an object moves, tracked feature points on it spana coherent 3D region in the space-time volume defined bythe video. In the case of multi-object motion, many possiblecoherent motion regions can be constructed around theset of all feature point tracks. Our approach is to identifyall possible coherent motion regions, and extract the subsetthat maximizes an overall likelihood function while assigningeach point track to at most one motion region. Wesolve the problem of finding the best set of coherent motionregions with a simple greedy algorithm, and show thatour approach produces semantically correct detections andcounts of similar objects moving through crowded scenes.

99 GENERAL AND MISCELLANEOUS↗

Time-Limited Perturbation Waveform Generation by an Extended Time-Frequency Domain Swapping Algorithm

A time-limited pseudo-random signal is an important component in perturbation signals during a system identification procedure. In this paper, a finite-time duration pseudo-random waveform with desired continuous spectral features is generated using an extended time-frequency domain swapping algorithm. Multi-Sine waveforms are used as initial waveforms. Through iterations, the waveform is polished to achieve desired spectral features and small crest factor. A comparison with multi-sine waveforms shows that the new waveform generated with the proposed algorithm has a much flatter spectrum and smaller crest factor as being desired.

97 MATHEMATICS AND COMPUTING↗

Software Barrier Performance on Dual Quad-Core Opterons

Multi-core processors based SMP servers have become building blocks for Linux clusters in recent years because they can deliver better performance for multi-threaded programs through on-chip multi-threading. However, a relative slow software barrier can hinder the performance of a data-parallel scientific application on a multi-core system. In this paper we study the performance of different software barrier algorithms on a server based on newly introduced AMD quad-core Opteron processors. We study how the memory architecture and the cache coherence protocol of the system influence the performance of barrier algorithms. We present an optimized barrier algorithm derived from the queue-based barrier algorithm. We find that the optimized barrier algorithm achieves speedup of 1.77 over the original queue-based algorithm. In addition, it has speedup of 2.39 over the software barrier generated by the Intel OpenMP compiler.

99 GENERAL AND MISCELLANEOUS↗

Fully implicit particle-in-cell algorithms for kinetic simulation of plasmas [Slides]

We have demonstrated, for the first time, a fully implicit, fully nonlinear electrostatic PIC formulation that features: (1) Exact charge conservation (via a novel particle mover strategy). (2) Exact energy conservation (no particle self-heating or self-cooling). (3) Adaptive particle orbit integrator to control errors in momentum conservation. The approach has been shown to be free of CFL and finite-grid numerical instabilities. As a result, the method is able to take time steps many times larger than explicit, and resolutions many times coarser. Central to our implementation is the concept of particle enslavement. We have generalized formulation to use spatial adaptivity via mapped coordinates. he method has much potential for efficiency gains vs. explicit in long-time-scale applications, with the CPU speedup scaling as $(kΛ_D)-^{(d+1)}/N_{FE}$. Minimize the number of nonlinear function evaluations $N_{FE}$ for given $Δt$, $Δx \Rightarrow$ preconditioning! We have formulated and implemented a very efficient moment-based preconditioner. We have ported the algorithm to GPU architectures. We have generalized the algorithm to non-radiative electromagnetic regimes (Darwin model), where, in addition to charge and energy, we also conserve canonical momenta.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Subdivision meshes for organizing spatial biomedical data.

Abstract As bio-medical images and volumes are being collected at an increasing speed, there is a growing demand for efficient means to organize spatial information for comparative analysis. In many scenarios, such as determining gene expression patterns by in situ hybridization, the images are collected from multiple subjects over a common anatomical region, such as the brain. A fundamental challenge in comparing spatial data from different images is how to account for the shape variations among subjects, which makes direct image-to-image comparison meaningless. In this paper, we describe subdivision meshes as a geometric means to efficiently organize 2D images and 3D volumes collected from different subjects for comparison. The key advantages of a subdivision mesh for this purpose are its light-weight geometric structure and its explicit modeling of anatomical boundaries, which enable efficient and accurate registration. The multi-resolution structure of a subdivision mesh also allows development of fast comparison algorithms among registered images and volumes.

59 BASIC BIOLOGICAL SCIENCES↗

Development of a Low-energy Trigger for VERITAS

During the 2007/2008 observing season a low-energy trigger configuration was developed and tested for VERITAS. The configuration makes uses of the small ({approx}35 m) baseline between two of the VERITAS telescopes and employs a much lower discriminator threshold and tighter coincidence window compared to the standard VERITAS trigger. Five hours of Crab Nebula ON/OFF observations were obtained in low-energy mode and were used to test new low-energy analysis algorithms. We present some details of the VERITAS low-energy trigger and the associated data analysis.

79 ASTRONOMY AND ASTROPHYSICS↗

A CATALOG OF DETAILED VISUAL MORPHOLOGICAL CLASSIFICATIONS FOR 14,034 GALAXIES IN THE SLOAN DIGITAL SKY SURVEY

We present a catalog of detailed visual classifications for 14,034 galaxies in the Sloan Digital Sky Survey (SDSS) Data Release 4 (DR4). Our sample includes nearly all spectroscopically targeted galaxies in the redshift range 0.01 < z < 0.1 down to an apparent extinction-corrected limit of g < 16 mag. In addition to T-Types, we record the existence of bars, rings, lenses, tails, warps, dust lanes, arm flocculence, and multiplicity. This sample defines a comprehensive local galaxy sample which we will use in future papers to study low-redshift morphology. It will also prove useful for calibrating automated galaxy classification algorithms. In this paper, we describe the classification methodology used, detail the systematics and biases of our sample, and summarize the overall statistical properties of the sample, noting the most obvious trends that are relevant for general comparisons of our catalog with previously published work.

79 ASTRONOMY AND ASTROPHYSICS↗

Comix, a New Matrix Element Generator

We present a new tree-level matrix element generator, based on the color dressed Berends-Giele recursive relations. We discuss two new algorithms for phase space integration, dedicated to be used with large multiplicities and color sampling.

97 MATHEMATICS AND COMPUTING↗

Preliminary Analysis of Double Shell Tomography Data

In this project we have collaborated with LLNL scientists Dr. Peer-Timo Bremer while performing our research work on algorithmic solutions for geometric processing, image segmentation and data streaming. The main deliverable has been a 3D viewer for high-resolution imaging data with particular focus on the presentation of orthogonal slices of the double shell tomography dataset. Basic probing capabilities allow querying single voxels in the data to study in detail the information presented to the user and compensate for the intrinsic filtering and imprecision due to visualization based on colormaps. On the algorithmic front we have studied the possibility of using of non-local means filtering algorithm to achieve noise removal from tomography data. In particular we have developed a prototype that implements an accelerated version of the algorithm that may be able to take advantage of the multi-resolution sub-sampling of the ViSUS format. We have achieved promising results. Future plans include the full integration of the non-local means algorithm in the ViSUS frameworks and testing if the accelerated method will scale properly from 2D images to 3D tomography data.

99 GENERAL AND MISCELLANEOUS↗

Retrieving and Ranking Unannotated Images through Collaboratively Mining Online Search Results

We present a new image search and ranking algorithm for retrieving unannotated images by collaboratively mining online search results, which consist of online image and text search results. The online image search results are leveraged as reference examples to perform content-based image search over unannotated images. The online text search results are utilized to estimate individual reference images relevance to the search query as not all the online image search results are closely related to the query. Overall, the key contribution of our method lies in its capability to deal with unreliable online image search results through jointly mining visual and textual aspects of online search results. Through such collaborative mining, our algorithm infers the relevance of an online search result image to a text query. Once we estimate a query relevance score for each online image search result, we can selectively use query specific online search result images as reference examples for retrieving and ranking unannotated images. To explore the performance of our algorithm, we tested our algorithm both on the standard public image datasets and several modest sized personal photo collections. We also compared the performance of our method with that of two peer methods. The results are very positive, indicating that our algorithm is superior to existing content-based image search algorithms for retrieving and ranking unannotated images. Overall, the main advantage of our algorithm comes from its collaborative mining over online search results both in the visual and textual domains.

99 GENERAL AND MISCELLANEOUS↗

An h-adaptive mesh method for Boltzmann-BGK/hydrodynamics coupling

We introduce a coupled method for hydrodynamic and kinetic equations on 2-dimensional h-adaptive meshes. We adopt the Euler equations with a fast kinetic solver in the region near thermodynamical equilibrium, while use the Boltzmann-BGK equation in kinetic regions where fluids are far from equilibrium. A buffer zone is created around the kinetic regions, on which a gradually varying numerical flux is adopted. Based on the property of a continuously discretized cut-off function which describes how the flux varies, the coupling will be conservative. In order for the conservative 2-dimensional specularly reflective boundary condition to be implemented conveniently, the discrete Maxwellian is approximated by a high order continuous formula with improved accuracy on a disc instead of on a square domain. The h-adaptive method can work smoothly with a time-split numerical scheme. Through h-adaptation, the cell number is greatly reduced. This method is particularly suitable for problems with hydrodynamics breakdown on only a small part of the whole domain, so that the total efficiency of the algorithm can be greatly improved. Three numerical examples are presented to validate the proposed method and demonstrate its efficiency.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The SISCone and anti-k_t jet algorithms

We illustrate how the midpoint and iterative cone (with progressive removal) algorithms fail to satisfy the fundamental requirements of infrared and collinear safety, causing divergences in the perturbative expansion. We introduce SISCone and the anti-k{sub t} algorithms as respective replacements that do not have those failures without any cost at the experimental level.

97 MATHEMATICS AND COMPUTING↗

Stochastic Wireless Channel Modeling, Estimation and Identification from Measurements

This paper is concerned with stochastic modeling of wireless fading channels, parameter estimation, and system identification from measurement data. Wireless channels are represented by stochastic state-space form, whose parameters and state variables are estimated using the expectation maximization algorithm and Kalman filtering, respectively. The latter are carried out solely from received signal measurements. These algorithms estimate the channel inphase and quadrature components and identify the channel parameters recursively. The proposed algorithm is tested using measurement data, and the results are presented.

97 MATHEMATICS AND COMPUTING↗

Transient analysis of the dynamic stress intensity factors using SGBEM for frequency-domain elastodynamics

In this paper, a two-dimensional symmetric-Galerkin boundary integral formulation for elastodynamic fracture analysis in the frequency domain is described. The numerical implementation is carried out with quadratic elements, allowing the use of an improved quarter-point element for accurately determining frequency responses of the dynamic stress intensity factors (DSIFs). To deal with singular and hypersingular integrals, the formulation is decomposed into two parts: the first part is identical to that for elastostatics while the second part contains at most logarithmic singularities. The treatment of the elastostatic singular and hypersingular singular integrals employs an exterior limit to the boundary, while the weakly singular integrals in the second part are handled by Gauss quadrature. Time histories (transient responses) of the DSIFs can be obtained in a post-processing step by applying the fast Fourier transform (FFT) and inverse FFT to the frequency responses of these DSIFs. Several test examples are presented for the calculation of the DSIFs due to two types of impact loading: Heaviside step loading and blast loading. The results suggest that the combination of symmetric-Galerkin and FFT algorithms in determining transient responses of the DSIFs is robust and effective.

36 MATERIALS SCIENCE↗

Network Offoaded Hierarchical Collectives Using ConnectX-2's CORE-Direct Capabilities

As the scale of High Performance Computing (HPC) systems continues to increase, demanding that we extract even more parallelism from applications, the need to move communication management away from the Central Processing Unit (CPU) becomes even greater. Moving this management to the network, frees up CPU cycles for computation, making it possible to overlap computation and communication. In this paper we continue to investigate how to best use the new CORE-Direct support added in the ConnectX-2 Host Channel Adapter (HCA) for creating high performance, asynchronous collective operations that are managed by the HCA. Specifically we consider the network topology, creating a two-level communication hierarchy, reducing the MPI Barrier completion time by 45%, from 26.59 microseconds, when not considering network topology, to 14.72 microseconds, with the CPU based collective barrier operation completing in 19.04 microseconds. The nonblocking barrier algorithm has similar performance, with about 50% of that time available for computation.

99 GENERAL AND MISCELLANEOUS↗

Using SWIFT Data

SWIFT has been shown to be a promising new diagnostic tool with many applications. SWIFT diagnostics coupled with PDV and other tools represent an exciting new source of data. SIAS is the name for the methodology we use to couple our SWIFT data to calculations for maximum utilization. SIAS, formerly Schlieren Inverse Analysis Software -- now SWIFT Inverse Analysis Software, uses SWIFT data and a hydro code calculation repeated in a genetic algorithm loop to reconstruct pressure history of shock transducer material interface.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Tracking Files in 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.

99 GENERAL AND MISCELLANEOUS↗