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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

A tool for manual endmember selection and spectral unmixing

Sampling a continuous radiance spectrum in many narrow contiguous spectral bands results in a high covariance between the bands. Hence, the true dimensionality of imaging spectrometer data is not determined by the number of spectral bands, but by the number of spectrally unique signatures whose mixtures reproduce the spectral variance observed in an image. Methods to unmix high dimensional multispectral data use principal components analysis to reduce the dimensionality. The variance of the spectral data is modeled as a linear combination of a finite set of endmembers in the space of the eigen-vectors that account for most of the variance. The number and characteristics of these endmembers are determined not only by the number and characteristics of the spectrally unique materials on the surface but also by processes (e.g., illumination, atmospheric scattering and absorption) affecting the signal received by the sensor. Selection of endmember spectra has typically been from a library. However, since most libraries are incomplete and do not account for the processes mentioned above, we have devised a computer display that allows researchers to explore interactively the eigenvector space of a representative and mean-corrected subset of the image data in search of extreme spectra to designate as endmembers. This display, which is based on parallel coordinates, is unique in the area of multidimensional visualization in that it includes not only a passive view of higher dimensional data but also the capability to interact and move geometrical objects in higher dimensional spaces.

Bateson, C. Ann↗
NASA NTRS1994

Magnification bias in galactic microlensing searches

It is shown that a significant amount of detectable gravitational microlensing events that could potentially be found by Massively Parallel Photometry (MAPP) project (such as the MACHO, EROS, and OGLE collaborations) will occur for stars too dim to be easily noticed individually by these projects. This is the result of a large magnification bias effect, a bias of including high-magnification events in any flux-limited sample. The probablility of detecting these events may be as high as 2.3 times the lensing probability of stars currently being monitored by MAPP collaborations.

Nemiroff, Robert J.↗
NASA NTRS1995

Parallel Monte Carlo Simulation for control system design

The research during the 1993/94 academic year addressed the design of parallel algorithms for stochastic robustness synthesis (SRS). SRS uses Monte Carlo simulation to compute probabilities of system instability and other design-metric violations. The probabilities form a cost function which is used by a genetic algorithm (GA). The GA searches for the stochastic optimal controller. The existing sequential algorithm was analyzed and modified to execute in a distributed environment. For this, parallel approaches to Monte Carlo simulation and genetic algorithms were investigated. Initial empirical results are available for the KSR1.

Schubert, Wolfgang M.↗
NASA NTRS2003

Parallel Information Processing (Image Transmission Via Fiber Bundle and Multimode Fiber

Growing demand for visual, user-friendly representation of information inspires search for the new methods of image transmission. Currently used in-series (sequential) methods of information processing are inherently slow and are designed mainly for transmission of one or two dimensional arrays of data. Conventional transmission of data by fibers requires many fibers with array of laser diodes and photodetectors. In practice, fiber bundles are also used for transmission of images. Image is formed on the fiber-optic bundle entrance surface and each fiber transmits the incident image to the exit surface. Since the fibers do not preserve phase, only 2D intensity distribution can be transmitted in this way. Each single mode fiber transmit only one pixel of an image. Multimode fibers may be also used, so that each mode represent different pixel element. Direct transmission of image through multimode fiber is hindered by the mode scrambling and phase randomization. To overcome these obstacles wavelength and time-division multiplexing have been used, with each pixel transmitted on a separate wavelength or time interval. Phase-conjugate techniques also was tested in, but only in the unpractical scheme when reconstructed image return back to the fiber input end. Another method of three-dimensional imaging over single mode fibers was demonstrated in, using laser light of reduced spatial coherence. Coherence encoding, needed for a transmission of images by this methods, was realized with grating interferometer or with the help of an acousto-optic deflector. We suggest simple practical holographic method of image transmission over single multimode fiber or over fiber bundle with coherent light using filtering by holographic optical elements. Originally this method was successfully tested for the single multimode fiber. In this research we have modified holographic method for transmission of laser illuminated images over commercially available fiber bundle (fiber endoscope, or fiberscope).

Kukhtarev, Nicholai↗
NASA NTRS1991

Parallel processing for scientific computations

The main contribution of the effort in the last two years is the introduction of the MOPPS system. After doing extensive literature search, we introduced the system which is described next. MOPPS employs a new solution to the problem of managing programs which solve scientific and engineering applications on a distributed processing environment. Autonomous computers cooperate efficiently in solving large scientific problems with this solution. MOPPS has the advantage of not assuming the presence of any particular network topology or configuration, computer architecture, or operating system. It imposes little overhead on network and processor resources while efficiently managing programs concurrently. The core of MOPPS is an intelligent program manager that builds a knowledge base of the execution performance of the parallel programs it is managing under various conditions. The manager applies this knowledge to improve the performance of future runs. The program manager learns from experience.

Alkhatib, Hasan S.↗
NASA NTRS1994

Viscosity estimates for the crust and upper mantle from patterns of lacustrine shoreline deformation in the Eastern Great Basin

The deformed shorelines of Lake Bonneville constitute a classic source of information on lithospheric elastic thickness and upper mantle viscosity. We describe and apply a new model to a recently augmented data set. New data better constrain both the complex spatio-temporal pattern of the lake load and the crustal deformation response to that load. The history of lake level fluctuations has been significantly refined and somewhat modified. This is due to both more radiocarbon dates from within the Bonneville basin and to an improved calibration of the radiocarbon timescale itself. The data which constrain the crustal deformation pattern consist of ages and shoreline elevations from several hundred points which sample three major levels of Lake Bonneville and corresponding elevations from the high stands of three smaller lakes situated to the west of Lake Bonneville. The geometry of the Earth model incorporates an arbitrary number of layers overlying a half-space, and the rheology of each level can accommodate an arbitrary number of Maxwell viscoelastic elements in parallel. The inverse modeling comprises three complementary approaches: for the simplest configurations, we performed a direct search of the parameter space and delineated the irregular boundary of the subspace of acceptable models. For more complex configurations, we constrained the elastic parameters to their seismically determined values and then solved for viscosity versus depth profiles by either expressing the log(viscosity) versus log(depth) profile as a series of specially constructed orhtogonal polynomials, or by allowing each of 8-10 layers (plus the half-space) to have an independently determined viscosity. We found that the data do not strongly support (nor can they conclusively exclude) a more complex rheology than simple Maxwell viscoelasticity. The orthogonal polynomial solution exhibits an essentially monotonic decrease in viscosity with depth.

Bills, Bruce G.↗
NASA NTRS2019

An Integrated Data Analytics Platform

An Integrated Science Data Analytics Platform is an environment that enables the confluence of resources for scientific investigation. It harmonizes data, tools and computational resources which subsequently enable the research community to focus on the investigation rather than spending time on security, data preparation, management, etc. OceanWorks is a NASA technology integration project to establish a cloud-based Integrated Ocean Science Data Analytics Platform at NASA’s Physical Oceanography Distributed Active Archive Center (PO.DAAC) for big ocean science. It focuses on advancement and maturity by bringing together several NASA open-source, big data projects for parallel analytics, anomaly detection, in-situ to satellite data matchup, quality-screened data subsetting, search relevancy, and data discovery. Our communities are relying on data distributed through data centers such as the PO.DAAC, COAPS, NCAR, and many others to conduct their research. In typical investigations, scientists would engage in: search for data, evaluate the relevance of that data, download it, and then apply algorithms to identify trends. Such workflow cannot scale if the research involves a massive amount of data or multi-variate measurements. NASA’s Surface Water and Ocean Topography (SWOT) mission is expected to produce massive amount of observational data during its 3-year nominal mission. Collections like SWOT challenges all existing Earth Science data archival, distribution and analysis paradigms. In this paper, we will discuss how OceanWorks enhances the analysis of physical ocean data where the computation is done on an elastic cloud platform next to the archive to deliver fast, web-accessible services for working with oceanographic measurements.

Yang, Chaowei↗
NASA NTRS2019

Overview of the Search for Space Weathering Signals on Bennu: One Rock Type, or Two?

We report on progress in the search for signs of space weathering on Bennu. We provide an overview of the space weathering evidence to date, and summarize relevant findings from several ongoing parallel studies of surface processes and surface properties. We examine trends from these studies in the context of space weathering, and what is known about near-Earth asteroid surface maturation. Because Bennu is covered with blocks, boulders, and rocks of various sizes, our search for space weathering signals has inevitably led to a study of the properties of Bennu’s rocks. Our research question is – do Bennu’s bright and dark rock populations form a maturity continuum due to space weathering, or alternatively, do the bright and dark rocks provide compelling evidence for two distinct rock populations on Bennu? In particular, we present our best estimate of the sub-field-of-view OVIRS (OSIRIS-REx Visible and Infrared Spectrometer) spectral properties of the largest bright boulders and compare them with the darker materials on Bennu’s surface to see if the observed spectral and albedo differences are consistent with space weathering effects, or not.

Clark, B. E.↗
NASA NTRS1995

Constraint-Based Scheduling System

Report describes continuing development of software for constraint-based scheduling system implemented eventually on massively parallel computer. Based on machine learning as means of improving scheduling. Designed to learn when to change search strategy by analyzing search progress and learning general conditions under which resource bottleneck occurs.

Zweben, Monte↗
NASA NTRS2005

A Parallel Particle Swarm Optimization Algorithm Accelerated by Asynchronous Evaluations

A parallel Particle Swarm Optimization (PSO) algorithm is presented. Particle swarm optimization is a fairly recent addition to the family of non-gradient based, probabilistic search algorithms that is based on a simplified social model and is closely tied to swarming theory. Although PSO algorithms present several attractive properties to the designer, they are plagued by high computational cost as measured by elapsed time. One approach to reduce the elapsed time is to make use of coarse-grained parallelization to evaluate the design points. Previous parallel PSO algorithms were mostly implemented in a synchronous manner, where all design points within a design iteration are evaluated before the next iteration is started. This approach leads to poor parallel speedup in cases where a heterogeneous parallel environment is used and/or where the analysis time depends on the design point being analyzed. This paper introduces an asynchronous parallel PSO algorithm that greatly improves the parallel e ciency. The asynchronous algorithm is benchmarked on a cluster assembled of Apple Macintosh G5 desktop computers, using the multi-disciplinary optimization of a typical transport aircraft wing as an example.

Venter, Gerhard↗
NASA NTRS2003

Aerodynamic Shape Optimization Using Hybridized Differential Evolution

An aerodynamic shape optimization method that uses an evolutionary algorithm known at Differential Evolution (DE) in conjunction with various hybridization strategies is described. DE is a simple and robust evolutionary strategy that has been proven effective in determining the global optimum for several difficult optimization problems. Various hybridization strategies for DE are explored, including the use of neural networks as well as traditional local search methods. A Navier-Stokes solver is used to evaluate the various intermediate designs and provide inputs to the hybrid DE optimizer. The method is implemented on distributed parallel computers so that new designs can be obtained within reasonable turnaround times. Results are presented for the inverse design of a turbine airfoil from a modern jet engine. (The final paper will include at least one other aerodynamic design application). The capability of the method to search large design spaces and obtain the optimal airfoils in an automatic fashion is demonstrated.

Madavan, Nateri K.↗
NASA NTRS1989

Auto- and hetero-associative memory using a 2-D optical logic gate

An optical associative memory system suitable for both auto- and hetero-associative recall is demonstrated. This system utilizes Hamming distance as the similarity measure between a binary input and a memory image with the aid of a two-dimensional optical EXCLUSIVE OR (XOR) gate and a parallel electronics comparator module. Based on the Hamming distance measurement, this optical associative memory performs a nearest neighbor search and the result is displayed in the output plane in real-time. This optical associative memory is fast and noniterative and produces no output spurious states as compared with that of the Hopfield neural network model.

Chao, Tien-Hsin↗
NASA NTRS1985

Multiprocessor sparse L/U decomposition with controlled fill-in

Generation of the maximal compatibles of pivot elements for a class of small sparse matrices is studied. The algorithm involves a binary tree search and has a complexity exponential in the order of the matrix. Different strategies for selection of a set of compatible pivots based on the Markowitz criterion are investigated. The competing issues of parallelism and fill-in generation are studied and results are provided. A technque for obtaining an ordered compatible set directly from the ordered incompatible table is given. This technique generates a set of compatible pivots with the property of generating few fills. A new hueristic algorithm is then proposed that combines the idea of an ordered compatible set with a limited binary tree search to generate several sets of compatible pivots in linear time. Finally, an elimination set to reduce the matrix is selected. Parameters are suggested to obtain a balance between parallelism and fill-ins. Results of applying the proposed algorithms on several large application matrices are presented and analyzed.

Alaghband, G.↗
NASA NTRS1985

Far-infrared observations of the exciting stars of Herbig-Haro objects. III - Circumstellar disks

Far-infrared observations of the exciting stars of Herbig-Haro objects are presented that (1) show these stars to be of low luminosity; (2) indicate that it is not usual for these objects themselves to be visible at far-infrared wavelengths; and (3) demonstrate the existence of spatially resolved, physically large, potentially disklike structures. These latter structures are resolved perpendicular to the directions of flow from the stars, but not parallel to the flows. In addition to these general properties, two new HH-exciting stars were discovered by searching along the extrapolated proper motion vectors for these HHs; and the jetlike object 'DG Tau B' was also detected.

Cohen, M.↗
NASA NTRS2000

A Parallel Genetic Algorithm for Automated Electronic Circuit Design

Parallelized versions of genetic algorithms (GAs) are popular primarily for three reasons: the GA is an inherently parallel algorithm, typical GA applications are very compute intensive, and powerful computing platforms, especially Beowulf-style computing clusters, are becoming more affordable and easier to implement. In addition, the low communication bandwidth required allows the use of inexpensive networking hardware such as standard office ethernet. In this paper we describe a parallel GA and its use in automated high-level circuit design. Genetic algorithms are a type of trial-and-error search technique that are guided by principles of Darwinian evolution. Just as the genetic material of two living organisms can intermix to produce offspring that are better adapted to their environment, GAs expose genetic material, frequently strings of 1s and Os, to the forces of artificial evolution: selection, mutation, recombination, etc. GAs start with a pool of randomly-generated candidate solutions which are then tested and scored with respect to their utility. Solutions are then bred by probabilistically selecting high quality parents and recombining their genetic representations to produce offspring solutions. Offspring are typically subjected to a small amount of random mutation. After a pool of offspring is produced, this process iterates until a satisfactory solution is found or an iteration limit is reached. Genetic algorithms have been applied to a wide variety of problems in many fields, including chemistry, biology, and many engineering disciplines. There are many styles of parallelism used in implementing parallel GAs. One such method is called the master-slave or processor farm approach. In this technique, slave nodes are used solely to compute fitness evaluations (the most time consuming part). The master processor collects fitness scores from the nodes and performs the genetic operators (selection, reproduction, variation, etc.). Because of dependency issues in the GA, it is possible to have idle processors. However, as long as the load at each processing node is similar, the processors are kept busy nearly all of the time. In applying GAs to circuit design, a suitable genetic representation 'is that of a circuit-construction program. We discuss one such circuit-construction programming language and show how evolution can generate useful analog circuit designs. This language has the desirable property that virtually all sets of combinations of primitives result in valid circuit graphs. Our system allows circuit size (number of devices), circuit topology, and device values to be evolved. Using a parallel genetic algorithm and circuit simulation software, we present experimental results as applied to three analog filter and two amplifier design tasks. For example, a figure shows an 85 dB amplifier design evolved by our system, and another figure shows the performance of that circuit (gain and frequency response). In all tasks, our system is able to generate circuits that achieve the target specifications.

Long, Jason D.↗
NASA NTRS1997

On Efficient Parallel Implementation of Moving Body Overset Grid Methods

An investigation into the parallel performance of moving-body overset grid methods will be presented. Parallel versions of the OVERFLOW flow solver, DCF3D domain connectivity software, and SIXDO six-degree-of-freedom routine are coupled with an automatic load balance routine and tested for 3D Navier-Stokes calculations on the IBM SP2. The primary source of parallel inefficiency in moving and problems are the domain connectivity costs with DCF 3D. Although this algorithm constitutes a relatively low fraction of the total solution cost (e.g. 10-20%) in calculations on serial machines, the consequently cause a significant degradation in the overall parallel performance. The paper will highlight some approaches for improving the scalability of DCF3D. The paper will present results of a proposed new load balancing scheme that seeks more equal distribution of the inter-grid boundary points in order to more evenly load balance the donor search costs associated with DCF3D. Some preliminary results will also be given from a new solution-adaption algorithm coupled with OVERFLOW which incorporates overset cartesian grids with various levels of refinement. The measured parallel performance from a descending delta-wing configuration and a generic store-separation from a wing/pylon case will be presented.

Wissink, Andrew M.↗