Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallel search”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS2015

Gravitational Waves: Search Results, Data Analysis and Parameter Estimation. Amaldi 10 Parallel Session C2

The Amaldi 10 Parallel Session C2 on gravitational wave(GW) search results, data analysis and parameter estimation included three lively sessions of lectures by 13 presenters, and 34 posters. The talks and posters covered a huge range of material, including results and analysis techniques for ground-based GW detectors, targeting anticipated signals from different astrophysical sources: compact binary inspiral, merger and ringdown; GW bursts from intermediate mass binary black hole mergers, cosmic string cusps, core-collapse supernovae, and other unmodeled sources; continuous waves from spinning neutron stars; and a stochastic GW background. There was considerable emphasis on Bayesian techniques for estimating the parameters of coalescing compact binary systems from the gravitational waveforms extracted from the data from the advanced detector network. This included methods to distinguish deviations of the signals from what is expected in the context of General Relativity.

Tests of general relativity↗
NASA NTRS1989

Search for auroral belt E-parallel fields with high-velocity barium ion injections

In April 1984, four high-velocity shaped-charge Ba(+) injections were conducted from two sounding rockets at 770-975 km over northern Alaska under conditions of active auroral and magnetic disturbance. Spatial ionization (brightness) profiles of high-velocity Ba(+) clouds from photometric scans following each release were found to be consistent with the 28-sec theoretical time constant for Ba photoionization determined by Carlsten (1975). These observations therefore revealed no evidence of anomalous fast ionization predicted by the Alfven critical velocity hypothesis.

Heppner, J. P.↗
NASA NTRS1995

Optimization on a Network-based Parallel Computer System for Supersonic Laminar Wing Design

A set of Computational Fluid Dynamics (CFD) routines and flow transition prediction tools are integrated into a network based parallel numerical optimization routine. Through this optimization routine, the design of a 2-D airfoil and an infinitely swept wing will be studied in order to advance the design cycle capability of supersonic laminar flow wings. The goal of advancing supersonic laminar flow wing design is achieved by wisely choosing the design variables used in the optimization routine. The design variables are represented by the theory of Fourier series and potential theory. These theories, combined with the parallel CFD flow routines and flow transition prediction tools, provide a design space for a global optimal point to be searched. Finally, the parallel optimization routine enables gradient evaluations to be performed in a fast and parallel fashion.

Garcia, Joseph A.↗
NASA NTRS1993

Oceanic transform earthquakes with unusual mechanisms or locations - Relation to fault geometry and state of stress in the adjacent lithosphere

Results are presented of a search for transform earthquakes departing from the pattern whereby they occur on the principal transform displacement zone (PTDZ) and have strike-slip mechanisms consistent with transform-parallel motion. The search was conducted on the basis of source mechanisms and locations taken from the Harvard centroid moment tensor catalog and the bulletin of the International Seismological Center. The source mechanisms and centroid depths of 10 such earthquakes on the St. Paul's, Marathon, Owen, Heezen, Tharp, Menard, and Rivera transforms are determined from inversions of long-period body waveforms. Much of the anomalous earthquake activity on oceanic transforms is associated with complexities in the geometry of the PTDZ or the presence of large structural features that may influence slip on the fault.

Wolfe, Cecily J.↗
NASA NTRS1991

A parallel trajectory optimization tool for aerospace plane guidance

A parallel trajectory optimization algorithm is being developed. One possible mission is to provide real-time, on-line guidance for the National Aerospace Plane. The algorithm solves a discrete-time problem via the augmented Lagrangian nonlinear programming algorithm. The algorithm exploits the dynamic programming structure of the problem to achieve parallelism in calculating cost functions, gradients, constraints, Jacobians, Hessian approximations, search directions, and merit functions. Special additions to the augmented Lagrangian algorithm achieve robust convergence, achieve (almost) superlinear local convergence, and deal with constraint curvature efficiency. The algorithm can handle control and state inequality constraints such as angle-of-attack and dynamic pressure constraints. Portions of the algorithm have been tested. The nonlinear programming core algorithm performs well on a variety of static test problems and on an orbit transfer problem. The parallel search direction algorithm can reduce wall clock time by a factor of 10 for this part of the computation task.

Psiaki, Mark L.↗
NASA NTRS1998

NASA Image eXchange (NIX)

This paper discusses the technical aspects of and the project background for the NASA Image exchange (NIX). NIX, which provides a single entry point to search selected image databases at the NASA Centers, is a meta-search engine (i.e., a search engine that communicates with other search engines). It uses these distributed digital image databases to access photographs, animations, and their associated descriptive information (meta-data). NIX is available for use at the following URL: http://nix.nasa.gov./NIX, which was sponsored by NASAs Scientific and Technical Information (STI) Program, currently serves images from seven NASA Centers. Plans are under way to link image databases from three additional NASA Centers. images and their associated meta-data, which are accessible by NIX, reside at the originating Centers, and NIX utilizes a virtual central site that communicates with each of these sites. Incorporated into the virtual central site are several protocols to support searches from a diverse collection of database engines. The searches are performed in parallel to ensure optimization of response times. To augment the search capability, browse functionality with pre-defined categories has been built into NIX, thereby ensuring dissemination of 'best-of-breed' imagery. As a final recourse, NIX offers access to a help desk via an on-line form to help locate images and information either within the scope of NIX or from available external sources.

vonOfenheim. William H. C.↗
NASA NTRS1989

A VLSI chip set for real time vector quantization of image sequences

The architecture and implementation of a VLSI chip set that vector quantizes (VQ) image sequences in real time is described. The chip set forms a programmable Single-Instruction, Multiple-Data (SIMD) machine which can implement various vector quantization encoding structures. Its VQ codebook may contain unlimited number of codevectors, N, having dimension up to K = 64. Under a weighted least squared error criterion, the engine locates at video rates the best code vector in full-searched or large tree searched VQ codebooks. The ability to manipulate tree structured codebooks, coupled with parallelism and pipelining, permits searches in as short as O (log N) cycles. A full codebook search results in O(N) performance, compared to O(KN) for a Single-Instruction, Single-Data (SISD) machine. With this VLSI chip set, an entire video code can be built on a single board that permits realtime experimentation with very large codebooks.

Baker, Richard L.↗
NASA NTRS2012

Development of a Robust and Efficient Parallel Solver for Unsteady Turbomachinery Flows

The traditional design and analysis practice for advanced propulsion systems relies heavily on expensive full-scale prototype development and testing. Over the past decade, use of high-fidelity analysis and design tools such as CFD early in the product development cycle has been identified as one way to alleviate testing costs and to develop these devices better, faster and cheaper. In the design of advanced propulsion systems, CFD plays a major role in defining the required performance over the entire flight regime, as well as in testing the sensitivity of the design to the different modes of operation. Increased emphasis is being placed on developing and applying CFD models to simulate the flow field environments and performance of advanced propulsion systems. This necessitates the development of next generation computational tools which can be used effectively and reliably in a design environment. The turbomachinery simulation capability presented here is being developed in a computational tool called Loci-STREAM [1]. It integrates proven numerical methods for generalized grids and state-of-the-art physical models in a novel rule-based programming framework called Loci [2] which allows: (a) seamless integration of multidisciplinary physics in a unified manner, and (b) automatic handling of massively parallel computing. The objective is to be able to routinely simulate problems involving complex geometries requiring large unstructured grids and complex multidisciplinary physics. An immediate application of interest is simulation of unsteady flows in rocket turbopumps, particularly in cryogenic liquid rocket engines. The key components of the overall methodology presented in this paper are the following: (a) high fidelity unsteady simulation capability based on Detached Eddy Simulation (DES) in conjunction with second-order temporal discretization, (b) compliance with Geometric Conservation Law (GCL) in order to maintain conservative property on moving meshes for second-order time-stepping scheme, (c) a novel cloud-of-points interpolation method (based on a fast parallel kd-tree search algorithm) for interfaces between turbomachinery components in relative motion which is demonstrated to be highly scalable, and (d) demonstrated accuracy and parallel scalability on large grids (approx 250 million cells) in full turbomachinery geometries.

West, Jeff↗
NASA NTRSDate not supplied

Rolling Horizon with K-Position Search Method for Strategic Deconfliction of Package Delivery UAS

This research focuses on the strategic deconfliction of unmanned aircraft systems (UAS) in an urban package delivery environment with two depots and multiple drop-off locations. Since the formulated mixed-integer nonlinear programming (MINLP) problem is non-deterministic polynomial-time (NP) hard, a heuristic algorithm called "rolling horizon with k-position search (KPS)" is used to compute the departure sequence and scheduled time of departure (STD) of each UAS at a depot, considering temporal constraints at en-route crossing waypoints and depots for strategic deconfliction. The simulation studies show that an increase in the value of k (local neighborhood search) in the KPS reduces the average ground delay at the cost of an increase in the computation time for a given number of UAS, size of the rolling horizon window, and number of depots involved in the local neighborhood search. The studies also show that for a given rolling horizon window, the computation time increases exponentially with an increase in the total number of UAS flights when serial processing the local neighborhood search of KPS (with k > 1) and drops by an order of magnitude upon performing the local neighborhood search of KPS using parallel processing instead of serial processing. The computation time drops with the reduction in air traffic complexity of a scenario for a given number of flights, k (local neighborhood search), and rolling horizon window.

UTM↗
NASA NTRS1980

IMP 8. Volume 1: EM field experiment

The electromagnetic fields experiment on IMP-J used two electric dipole antennas and a triaxial search coil magnetic antenna to sense the electric and magnetic field of plasma waves in space. The electric dipole antennas consisted of a fine wire, 0.021 inches in diameter, with a nominal extended tip-to-tip length of 400 ft. The outermost 50 ft. of each element was conducting and the rest of the antenna was covered with an insulating coating. The search coil antennas each consisted of a high mu core with two separate windings of 40,000 turns each to sense ac magnetic fields. The search coils had a length of 18 inches tip-to-tip and are mounted on the end of a boom. The axes of the x prime and y prime search coil antennas were parallel to the x prime and y prime electric antenna axes.

Source record↗
NASA NTRS1990

Pattern recognition with parallel associative memory

An examination is conducted of the feasibility of searching targets in aerial photographs by means of a parallel associative memory (PAM) that is based on the nearest-neighbor algorithm; the Hamming distance is used as a measure of closeness, in order to discriminate patterns. Attention has been given to targets typically used for ground-control points. The method developed sorts out approximate target positions where precise localizations are needed, in the course of the data-acquisition process. The majority of control points in different images were correctly identified.

Toth, Charles K.↗
NASA NTRS1991

Parallel-vector computation for linear structural analysis and non-linear unconstrained optimization problems

Several parallel-vector computational improvements to the unconstrained optimization procedure are described which speed up the structural analysis-synthesis process. A fast parallel-vector Choleski-based equation solver, pvsolve, is incorporated into the well-known SAP-4 general-purpose finite-element code. The new code, denoted PV-SAP, is tested for static structural analysis. Initial results on a four processor CRAY 2 show that using pvsolve reduces the equation solution time by a factor of 14-16 over the original SAP-4 code. In addition, parallel-vector procedures for the Golden Block Search technique and the BFGS method are developed and tested for nonlinear unconstrained optimization. A parallel version of an iterative solver and the pvsolve direct solver are incorporated into the BFGS method. Preliminary results on nonlinear unconstrained optimization test problems, using pvsolve in the analysis, show excellent parallel-vector performance indicating that these parallel-vector algorithms can be used in a new generation of finite-element based structural design/analysis-synthesis codes.

Nguyen, D. T.↗
NASA NTRS2003

Quantum Search in Hilbert Space

A proposed quantum-computing algorithm would perform a search for an item of information in a database stored in a Hilbert-space memory structure. The algorithm is intended to make it possible to search relatively quickly through a large database under conditions in which available computing resources would otherwise be considered inadequate to perform such a task. The algorithm would apply, more specifically, to a relational database in which information would be stored in a set of N complex orthonormal vectors, each of N dimensions (where N can be exponentially large). Each vector would constitute one row of a unitary matrix, from which one would derive the Hamiltonian operator (and hence the evolutionary operator) of a quantum system. In other words, all the stored information would be mapped onto a unitary operator acting on a quantum state that would represent the item of information to be retrieved. Then one could exploit quantum parallelism: one could pose all search queries simultaneously by performing a quantum measurement on the system. In so doing, one would effectively solve the search problem in one computational step. One could exploit the direct- and inner-product decomposability of the unitary matrix to make the dimensionality of the memory space exponentially large by use of only linear resources. However, inasmuch as the necessary preprocessing (the mapping of the stored information into a Hilbert space) could be exponentially expensive, the proposed algorithm would likely be most beneficial in applications in which the resources available for preprocessing were much greater than those available for searching.

Zak, Michail↗
NASA NTRS1993

Real-time trajectory optimization on parallel processors

A parallel algorithm has been developed for rapidly solving trajectory optimization problems. The goal of the work has been to develop an algorithm that is suitable to do real-time, on-line optimal guidance through repeated solution of a trajectory optimization problem. The algorithm has been developed on an INTEL iPSC/860 message passing parallel processor. It uses a zero-order-hold discretization of a continuous-time problem and solves the resulting nonlinear programming problem using a custom-designed augmented Lagrangian nonlinear programming algorithm. The algorithm achieves parallelism of function, derivative, and search direction calculations through the principle of domain decomposition applied along the time axis. It has been encoded and tested on 3 example problems, the Goddard problem, the acceleration-limited, planar minimum-time to the origin problem, and a National Aerospace Plane minimum-fuel ascent guidance problem. Execution times as fast as 118 sec of wall clock time have been achieved for a 128-stage Goddard problem solved on 32 processors. A 32-stage minimum-time problem has been solved in 151 sec on 32 processors. A 32-stage National Aerospace Plane problem required 2 hours when solved on 32 processors. A speed-up factor of 7.2 has been achieved by using 32-nodes instead of 1-node to solve a 64-stage Goddard problem.

Psiaki, Mark L.↗
NASA NTRS1994

Can Attention be Divided Between Perceptual Groups?

Previous work using Head-Up Displays (HUDs) suggests that the visual system parses the HUD and the outside world into distinct perceptual groups, with attention deployed sequentially to first one group and then the other. New experiments show that both groups can be processed in parallel in a divided attention search task, even though subjects have just processed a stimulus in one perceptual group or the other. Implications for models of visual attention will be discussed.

McCann, Robert S.↗
NASA NTRS2004

Putting us on the Map: Remote Sensing Investigation of the Ancient Maya Landscape

A common problem for archaeologists studying ancient settlement in the Maya Lowlands is overcoming the dense vegetation in order to obtain an accurate regional perspective of the presence of archaeological sites, their exact locations and their overall extents. Most often this is done by extensive ground surveys in which many individuals chop parallel paths through the vegetation in search of sites. Once a site is found an effort is made to mark its location on a regional map and to explore its perimeter. Obtaining locational information has been made dramatically easier in recent years with the advent of improved Global Positioning Systems (GPS), however the process of initial identification of sites and the determination of their borders is exceedingly labor intensive and has remained relatively unchanged since the beginning of settlement surveys in the region in the 1950's. Currently, we are revolutionizing settlement survey in the Maya Lowlands by using remotely sensed data from IKONOS, Quickbird, and Eol, satellites. The Ancient Maya built their cities, towns and even their smallest hamlets using excavated limestone and lime plasters. We propose that the decay of these structures provides a unique microenvironment for the growth of vegetation as the levels of moisture and nutrition within the ruins vary substantially from those in the surrounding forest. These microenvironmental differences on the ground are likewise represented by compositional differences in the forest canopy both in the species present and in leaf color (representing moisture/nutritional stress) visible through the analysis of high- resolution satellite data. In this way the detailed analysis of forest composition can reveal a detailed picture of the ancient settlements that lie beneath it. Preliminary examinations using this technique have been very successful and we are refining these techniques in order to efficiently comprehend the details of Ancient Maya settlement in the Lowlands.

Sever, Thomas L.↗
NASA NTRS2004

Putting Us on the Map: Remote Sensing Investigation of the Ancient Maya Landscape

A common problem for archaeologists studying ancient settlement in the Maya Lowlands is overcoming the dense vegetation in order to obtain an accurate regional perspective of the presence of archaeological sites, their exact locations and their overall extents. Most often this is done by extensive ground surveys in which many individuals chop parallel paths through the vegetation in search of sites. Once a site is found an effort is made to mark its location on a regional map and to explore its perimeter. Obtaining locational information has been made dramatically easier in recent years with the advent of improved Global Positioning Systems (GPS), however the process of initial identification of sites and the determination of their borders is exceedingly labor intensive and has remained relatively unchanged since the beginning of settlement surveys in the region in the 1950 s. Currently, we are revolutionizing settlement survey in the Maya Lowlands by using remotely sensed data from IKONOS, Quickbird, and Eo 1, satellites as well as airborne AIRSAR radar data. The Ancient Maya built their cities, towns and even their smallest hamlets using excavated limestone and lime plasters. We propose that the decay of these structures provides a unique microenvironment for the growth of vegetation as the levels of moisture and nutrition within the ruins vary substantially from those in the surrounding forest. These microenvironmental differences on the ground are likewise represented by compositional differences in the forest canopy both in the species present and in leaf color (representing moisture/nutritional stress) visible through the analysis of high-resolution satellite data. In this way the detailed analysis of forest composition can reveal a detailed picture of the ancient settlements that lie beneath it. Preliminary examinations using this technique have been very successful and we are refining these techniques in order to efficiently comprehend the details of Ancient Maya settlement in the Lowlands.

Sever, Thomas L.↗