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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS1998

Parallelization of Rocket Engine Simulator Software (PRESS)

We have outlined our work in the last half of the funding period. We have shown how a demo package for RESSAP using MPI can be done. However, we also mentioned the difficulties with the UNIX platform. We have reiterated some of the suggestions made during the presentation of the progress of the at Fourth Annual HBCU Conference. Although we have discussed, in some detail, how TURBDES/PUMPDES software can be run in parallel using MPI, at present, we are unable to experiment any further with either MPI or PVM. Due to X windows not being implemented, we are also not able to experiment further with XPVM, which it will be recalled, has a nice GUI interface. There are also some concerns, on our part, about MPI being an appropriate tool. The best thing about MPr is that it is public domain. Although and plenty of documentation exists for the intricacies of using MPI, little information is available on its actual implementations. Other than very typical, somewhat contrived examples, such as Jacobi algorithm for solving Laplace's equation, there are few examples which can readily be applied to real situations, such as in our case. In effect, the review of literature on both MPI and PVM, and there is a lot, indicate something similar to the enormous effort which was spent on LISP and LISP-like languages as tools for artificial intelligence research. During the development of a book on programming languages [12], when we searched the literature for very simple examples like taking averages, reading and writing records, multiplying matrices, etc., we could hardly find a any! Yet, so much was said and done on that topic in academic circles. It appears that we faced the same problem with MPI, where despite significant documentation, we could not find even a simple example which supports course-grain parallelism involving only a few processes. From the foregoing, it appears that a new direction may be required for more productive research during the extension period (10/19/98 - 10/18/99). At the least, the research would need to be done on Windows 95/Windows NT based platforms. Moreover, with the acquisition of Lahey Fortran package for PC platform, and the existing Borland C + + 5. 0, we can do work on C + + wrapper issues. We have carefully studied the blueprint for Space Transportation Propulsion Integrated Design Environment for the next 25 years [13] and found the inclusion of HBCUs in that effort encouraging. Especially in the long period for which a map is provided, there is no doubt that HBCUs will grow and become better equipped to do meaningful research. In the shorter period, as was suggested in our presentation at the HBCU conference, some key decisions regarding the aging Fortran based software for rocket propellants will need to be made. One important issue is whether or not object oriented languages such as C + + or Java should be used for distributed computing. Whether or not "distributed computing" is necessary for the existing software is yet another, larger, question to be tackled with.

Cezzar, Ruknet↗
NASA NTRS2000

Global Design Optimization for Aerodynamics and Rocket Propulsion Components

Modern computational and experimental tools for aerodynamics and propulsion applications have matured to a stage where they can provide substantial insight into engineering processes involving fluid flows, and can be fruitfully utilized to help improve the design of practical devices. In particular, rapid and continuous development in aerospace engineering demands that new design concepts be regularly proposed to meet goals for increased performance, robustness and safety while concurrently decreasing cost. To date, the majority of the effort in design optimization of fluid dynamics has relied on gradient-based search algorithms. Global optimization methods can utilize the information collected from various sources and by different tools. These methods offer multi-criterion optimization, handle the existence of multiple design points and trade-offs via insight into the entire design space, can easily perform tasks in parallel, and are often effective in filtering the noise intrinsic to numerical and experimental data. However, a successful application of the global optimization method needs to address issues related to data requirements with an increase in the number of design variables, and methods for predicting the model performance. In this article, we review recent progress made in establishing suitable global optimization techniques employing neural network and polynomial-based response surface methodologies. Issues addressed include techniques for construction of the response surface, design of experiment techniques for supplying information in an economical manner, optimization procedures and multi-level techniques, and assessment of relative performance between polynomials and neural networks. Examples drawn from wing aerodynamics, turbulent diffuser flows, gas-gas injectors, and supersonic turbines are employed to help demonstrate the issues involved in an engineering design context. Both the usefulness of the existing knowledge to aid current design practices and the need for future research are identified.

Shyy, Wei↗
NASA NTRS1994

An implementation of a tree code on a SIMD, parallel computer

We describe a fast tree algorithm for gravitational N-body simulation on SIMD parallel computers. The tree construction uses fast, parallel sorts. The sorted lists are recursively divided along their x, y and z coordinates. This data structure is a completely balanced tree (i.e., each particle is paired with exactly one other particle) and maintains good spatial locality. An implementation of this tree-building algorithm on a 16k processor Maspar MP-1 performs well and constitutes only a small fraction (approximately 15%) of the entire cycle of finding the accelerations. Each node in the tree is treated as a monopole. The tree search and the summation of accelerations also perform well. During the tree search, node data that is needed from another processor is simply fetched. Roughly 55% of the tree search time is spent in communications between processors. We apply the code to two problems of astrophysical interest. The first is a simulation of the close passage of two gravitationally, interacting, disk galaxies using 65,636 particles. We also simulate the formation of structure in an expanding, model universe using 1,048,576 particles. Our code attains speeds comparable to one head of a Cray Y-MP, so single instruction, multiple data (SIMD) type computers can be used for these simulations. The cost/performance ratio for SIMD machines like the Maspar MP-1 make them an extremely attractive alternative to either vector processors or large multiple instruction, multiple data (MIMD) type parallel computers. With further optimizations (e.g., more careful load balancing), speeds in excess of today's vector processing computers should be possible.

Olson, Kevin M.↗
NASA NTRS2002

Bioinspired engineering of exploration systems for NASA and DoD

A new approach called bioinspired engineering of exploration systems (BEES) and its value for solving pressing NASA and DoD needs are described. Insects (for example honeybees and dragonflies) cope remarkably well with their world, despite possessing a brain containing less than 0.01% as many neurons as the human brain. Although most insects have immobile eyes with fixed focus optics and lack stereo vision, they use a number of ingenious, computationally simple strategies for perceiving their world in three dimensions and navigating successfully within it. We are distilling selected insect-inspired strategies to obtain novel solutions for navigation, hazard avoidance, altitude hold, stable flight, terrain following, and gentle deployment of payload. Such functionality provides potential solutions for future autonomous robotic space and planetary explorers. A BEES approach to developing lightweight low-power autonomous flight systems should be useful for flight control of such biomorphic flyers for both NASA and DoD needs. Recent biological studies of mammalian retinas confirm that representations of multiple features of the visual world are systematically parsed and processed in parallel. Features are mapped to a stack of cellular strata within the retina. Each of these representations can be efficiently modeled in semiconductor cellular nonlinear network (CNN) chips. We describe recent breakthroughs in exploring the feasibility of the unique blending of insect strategies of navigation with mammalian visual search, pattern recognition, and image understanding into hybrid biomorphic flyers for future planetary and terrestrial applications. We describe a few future mission scenarios for Mars exploration, uniquely enabled by these newly developed biomorphic flyers.

Space Flight↗
NASA NTRS2012

Real-Time Cognitive Computing Architecture for Data Fusion in a Dynamic Environment

A novel cognitive computing architecture is conceptualized for processing multiple channels of multi-modal sensory data streams simultaneously, and fusing the information in real time to generate intelligent reaction sequences. This unique architecture is capable of assimilating parallel data streams that could be analog, digital, synchronous/asynchronous, and could be programmed to act as a knowledge synthesizer and/or an "intelligent perception" processor. In this architecture, the bio-inspired models of visual pathway and olfactory receptor processing are combined as processing components, to achieve the composite function of "searching for a source of food while avoiding the predator." The architecture is particularly suited for scene analysis from visual data and odorant.

Duong, Tuan A.↗
NASA NTRS1978

On-board landmark navigation and attitude reference parallel processor system

An approach to autonomous navigation and attitude reference for earth observing spacecraft is described along with the landmark identification technique based on a sequential similarity detection algorithm (SSDA). Laboratory experiments undertaken to determine if better than one pixel accuracy in registration can be achieved consistent with onboard processor timing and capacity constraints are included. The SSDA is implemented using a multi-microprocessor system including synchronization logic and chip library. The data is processed in parallel stages, effectively reducing the time to match the small known image within a larger image as seen by the onboard image system. Shared memory is incorporated in the system to help communicate intermediate results among microprocessors. The functions include finding mean values and summation of absolute differences over the image search area. The hardware is a low power, compact unit suitable to onboard application with the flexibility to provide for different parameters depending upon the environment.

Gilbert, L. E.↗
NASA NTRS2006

The Use of Dynamic Visual Acuity as a Functional Test of Gaze Stabilization Following Space Flight

After prolonged exposure to a given gravitational environment the transition to another is accompanied by adaptations in the sensorimotor subsystems, including the vestibular system. Variation in the adaptation time course of these subsystems, and the functional redundancies that exist between them make it difficult to accurately assess the functional capacity and physical limitations of astro/cosmonauts using tests on individual subsystems. While isolated tests of subsystem performance may be the only means to address where interventions are required, direct measures of performance may be more suitable for assessing the operational consequences of incomplete adaptation to changes in the gravitational environment. A test of dynamic visual acuity (DVA) is currently being used in the JSC Neurosciences Laboratory as part of a series of measures to assess the efficacy of a countermeasure to mitigate postflight locomotor dysfunction. In the current protocol, subjects visual acuity is determined using Landolt ring optotypes presented sequentially on a computer display. Visual acuity assessments are made both while standing and while walking at 1.8 m/s on a motorized treadmill. The use of a psychophysical threshold detection algorithm reduces the required number of optotype presentations and the results can be presented immediately after the test. The difference between the walking and standing acuity measures provides a metric of the change in the subject s ability to maintain gaze fixation on the visual target while walking. This functional consequence is observable regardless of the underlying subsystem most responsible for the change. Data from 15 cosmo/astronauts have been collected following long-duration (approx. 6 months) stays in space using a visual target viewing distance of 4.0 meters. An investigation of the group mean shows a change in DVA soon after the flight that asymptotes back to baseline approximately one week following their return to earth. The performance of some subjects nicely parallels the stereotypical recovery curve observed in the group mean data. Others show dramatic changes in DVA from one test day to another. These changes may be indicative of a re-adaptation process that is not characterized by a steady improvement with the passage of time, but is instead a dynamic search for appropriate coordinative strategy to achieve the desired gaze stabilization goal. Ground-based data have been collected in our lab using DVA with one of the goals being to improve the DVA test itself. In one of these studies, the DVA test was repeated using a visual target viewing distance of 0.5 meters. While walking, the relative contributions of the otoliths and semi-circular canals that are required to stabilize gaze are affected by visual target viewing distance. It may be possible to exploit this using the current treadmill DVA test to differentially assess changes in these vestibular subsystems. The postflight DVA evaluations currently used have been augmented to include the near target version of the test. Preliminary results from these assessments, as well as the results from the ground-based tests will also be reported. DVA provides a direct measure of a subject's ability to see clearly in the presence of self-motion. The use of the current tests for providing a functionally relevant metric is evident. However, it is possible to expand the scope of DVA testing to include scenarios other than walking. A facility for measuring DVA in the presence of passive movements is being created. Using a mechanized platform to provide the perturbation, it should be possible to simulate aircraft and automobile vibration profiles. Used in conjunction with the far and near visual displays this facility should be able to assess a subject s ability to clearly see distant objects as well as those that appear on the dashboard or instrument control panel during functionally relevant situations.

Peters, B. T.↗
NASA NTRS1999

Corrugated Quantum Well Infrared Photodetectors and Arrays

Quantum well infrared photodetectors (QWIPs) have many advantages in infrared detection, mainly due to the mature Ill-V material technology. The employment of the corrugation structure further advances the technology by providing a simple, yet efficient light-coupling scheme. A C-QWIP enjoys the same flexibility as a detector with intrinsic normal incident absorption. In this paper, we will discuss the utilities of C-QWIPs in different applications, including two-color detection and polarization-sensitive detection. Besides practical applications, C-QWIPs are also useful in detector characterization. They can be used for measuring the absorption coefficient of light propagating parallel to the layers under bias and providing information on the energy resolved photoconductive gain. These two quantities have never been measured before. Based on the corrugation design, we have made several modifications that further improve the detector sensitivity without increasing its complexity. Other than the C-QWIP structure, we also continue searching for other sensitive detector architectures. In a quantum grid infrared photodetector, 3-dimensional electron confinement can be achieved, with which the detector is able to absorb light in all directions. At the same time, the photoconductive gain can also be improved. We further improve the design using a blazed structure. All the experimental results are supported by a rigorous electromagnetic modal transmission-line theory developed especially for these types of structures. Preliminary thermal imaging using C-QWIP FPAs validates the advantages of the present approach.

Choi, K. K.↗
NASA NTRS1980

A design study of a signal detection system

A system is described which can aid in the search for radio signals from extraterrestrial sources, or in other applications characterized by low signal-to-noise ratios and very high data rates. The system follows a multichannel (16 million bin) spectrum analyzer, and has critical processing, system control, and memory fuctions. The design includes a moderately rich set of algorithms to be used in parallel to detect signals of unknown form. A multi-threshold approach is used to obtain high and low signal sensitivities. Relatively compact and transportable memory systems are specified.

Healy, T. J.↗
NASA NTRS2017

Gravity-Assist Trajectories to the Ice Giants: An Automated Method to Catalog Mass-or Time-Optimal Solutions

This work presents an automated method of calculating mass (or time) optimal gravity-assist trajectories without a priori knowledge of the flyby-body combination. Since gravity assists are particularly crucial for reaching the outer Solar System, we use the Ice Giants, Uranus and Neptune, as example destinations for this work. Catalogs are also provided that list the most attractive trajectories found over launch dates ranging from 2024 to 2038. The tool developed to implement this method, called the Python EMTG Automated Trade Study Application (PEATSA), iteratively runs the Evolutionary Mission Trajectory Generator (EMTG), a NASA Goddard Space Flight Center in-house trajectory optimization tool. EMTG finds gravity-assist trajectories with impulsive maneuvers using a multiple-shooting structure along with stochastic methods (such as monotonic basin hopping) and may be run with or without an initial guess provided. PEATSA runs instances of EMTG in parallel over a grid of launch dates. After each set of runs completes, the best results within a neighborhood of launch dates are used to seed all other cases in that neighborhood---allowing the solutions across the range of launch dates to improve over each iteration. The results here are compared against trajectories found using a grid-search technique, and PEATSA is found to outperform the grid-search results for most launch years considered.

Hughes, Kyle M.↗
NASA NTRS2017

Gravity-Assist Trajectories to the Ice Giants: An Automated Method to Catalog Mass- Or Time-Optimal Solutions

This work presents an automated method of calculating mass (or time) optimal gravity-assist trajectories without a priori knowledge of the flyby-body combination. Since gravity assists are particularly crucial for reaching the outer Solar System, we use the Ice Giants, Uranus and Neptune, as example destinations for this work. Catalogs are also provided that list the most attractive trajectories found over launch dates ranging from 2024 to 2038. The tool developed to implement this method, called the Python EMTG Automated Trade Study Application (PEATSA), iteratively runs the Evolutionary Mission Trajectory Generator (EMTG), a NASA Goddard Space Flight Center in-house trajectory optimization tool. EMTG finds gravity-assist trajectories with impulsive maneuvers using a multiple-shooting structure along with stochastic methods (such as monotonic basin hopping) and may be run with or without an initial guess provided. PEATSA runs instances of EMTG in parallel over a grid of launch dates. After each set of runs completes, the best results within a neighborhood of launch dates are used to seed all other cases in that neighborhood-allowing the solutions across the range of launch dates to improve over each iteration. The results here are compared against trajectories found using a grid-search technique, and PEATSA is found to outperform the grid-search results for most launch years considered.

Hughes, Kyle M.↗
NASA NTRS1982

Research on turbulence in plasma

The plasma turbulence research program at William and Mary is discussed. The search has been less for phenomena to explain than for nontrivial magnetohydrodynamic processes in the fully turbulent domain that can be understood. Two examples are used to illustrate this: (1) development of anisotropy in the presence of a strong do magnetic field; and (2) the decay of an MHD turbulent field to a dynamically aligned state with velocity field and magnetic fields parallel or antiparallel.

Source record↗
NASA NTRS1996

Telemedicine: An Application in Search of Users

Telemedicine involves the use of telecommunication technologies as a medium for the provision of medical information and services to consumers at sites that are at a distance from the provider. The concept encompasses everything from the telephone system to high-speed, wide-bandwidth transmission with use of fiberoptics, satellites, or a combination of terrestrial and satellite-communication technologies. The peripheral software could be as simple as a typewriter used to type a letter requesting an opinion or as complex as high-capacity parallel processing computers and imaging devices. Although the definition includes telephone, facsimile, and distance learning, the term "Telemedicine" is currently used as a generic label for remote consultation and diagnosis. Telemedicine is not a medical subspecialty but a facilitator of all medical and surgical specialties.

Khandheria, Bijoy K.↗
NASA NTRS1994

Active antenna

An antenna, which may be a search coil, is connected to an operational amplifier circuit which provides negative impedances, each of which is in the order of magnitude of the positive impedances which characterize the antenna. The antenna is connected to the inverting input of the operational amplifier; a resistor is connected between the inverting input and the output of the operational amplifier; a capacitor-resistor network, in parallel, is connected between the output and the noninverting input of the operational amplifier; and a resistor is connected from the noninverting input and the circuit common. While this circuit provides a negative resistance and a negative inductance, in series, which appear, looking into the noninverting input of the operational amplifier, in parallel with the antenna, these negative impedances appear in a series loop with the antenna positive impedances, so as to algebraically add. This circuit is tuned by varying the various circuit components so that the negative impedances are very close, but somewhat less, in magnitude, to the antenna impedances. The result is to increase the sensitivity of the antenna by lowering its effective impedance. This, in turn, increases the effective area of the antenna, which may be broadband.

Sutton, John F.↗
NASA NTRS1990

Evaluation and selection of assembly plans

Two criteria are introduced for the evaluation and selection of assembly plans. The first criterion is to maximize the number of different sequences encompassed by the assembly plan. The second criterion is to maximize the amount of parallelism (i.e., simultaneity) that is possible in the execution of the assembly tasks. While the metrics corresponding to the criteria used in previous work can be expressed as a sum of terms, each being a function of a task or a state, the metrics corresponding to the criteria introduced are more complex functions of the whole assembly plan. An algorithm that performs a heuristic search for the best assembly plan over the AND/OR graph representation of assembly plans introduced in previous work is presented. Admissible heuristics for each of the two criteria are presented.

Homem De Mello, L. S.↗
NASA NTRS2011

Evolutionary Computational Methods for Identifying Emergent Behavior in Autonomous Systems

A technique based on Evolutionary Computational Methods (ECMs) was developed that allows for the automated optimization of complex computationally modeled systems, such as autonomous systems. The primary technology, which enables the ECM to find optimal solutions in complex search spaces, derives from evolutionary algorithms such as the genetic algorithm and differential evolution. These methods are based on biological processes, particularly genetics, and define an iterative process that evolves parameter sets into an optimum. Evolutionary computation is a method that operates on a population of existing computational-based engineering models (or simulators) and competes them using biologically inspired genetic operators on large parallel cluster computers. The result is the ability to automatically find design optimizations and trades, and thereby greatly amplify the role of the system engineer.

Terrile, Richard J.↗
NASA NTRS1985

Search for optical bursts from the gamma ray burst source GBS 0526-66

Attempts were made to detect optical bursts from the gamma-ray burst source GBS 0526-66 during Dec. 31, 1984 to Jan. 2, 1985 and Feb. 23 to Feb. 24, 1985, using the one meter reflector of the Kavalur Observatory. Jan. 1, 1985 coincided with the zero phase of the predicted 164 day period of burst activity from the source (Rothschild and Lingenfelter, 1984). A new optical burst photon counting system with adjustable trigger threshold was used in parallel with a high speed photometer for the observations. The best time resolution was 1 ms and maximum count rate capability was 255,000 counts s(-1). Details of the instrumentation and observational results are presented.

Seetha, S.↗
NASA NTRS2011

Meta-RaPS Algorithm for the Aerial Refueling Scheduling Problem

The Aerial Refueling Scheduling Problem (ARSP) can be defined as determining the refueling completion times for each fighter aircraft (job) on multiple tankers (machines). ARSP assumes that jobs have different release times and due dates, The total weighted tardiness is used to evaluate schedule's quality. Therefore, ARSP can be modeled as a parallel machine scheduling with release limes and due dates to minimize the total weighted tardiness. Since ARSP is NP-hard, it will be more appropriate to develop a ppro~imate or heuristic algorithm to obtain solutions in reasonable computation limes. In this paper, Meta-Raps-ATC algorithm is implemented to create high quality solutions. Meta-RaPS (Meta-heuristic for Randomized Priority Search) is a recent and promising meta heuristic that is applied by introducing randomness to a construction heuristic. The Apparent Tardiness Rule (ATC), which is a good rule for scheduling problems with tardiness objective, is used to construct initial solutions which are improved by an exchanging operation. Results are presented for generated instances.

Kaplan, Sezgin↗