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 109 records · Page 6

Single- and Multiple-Objective Optimization with Differential Evolution and Neural Networks

Genetic and evolutionary algorithms have been applied to solve numerous problems in engineering design where they have been used primarily as optimization procedures. These methods have an advantage over conventional gradient-based search procedures became they are capable of finding global optima of multi-modal functions and searching design spaces with disjoint feasible regions. They are also robust in the presence of noisy data. Another desirable feature of these methods is that they can efficiently use distributed and parallel computing resources since multiple function evaluations (flow simulations in aerodynamics design) can be performed simultaneously and independently on ultiple processors. For these reasons genetic and evolutionary algorithms are being used more frequently in design optimization. Examples include airfoil and wing design and compressor and turbine airfoil design. They are also finding increasing use in multiple-objective and multidisciplinary optimization. This lecture will focus on an evolutionary method that is a relatively new member to the general class of evolutionary methods called differential evolution (DE). This method is easy to use and program and it requires relatively few user-specified constants. These constants are easily determined for a wide class of problems. Fine-tuning the constants will off course yield the solution to the optimization problem at hand more rapidly. DE can be efficiently implemented on parallel computers and can be used for continuous, discrete and mixed discrete/continuous optimization problems. It does not require the objective function to be continuous and is noise tolerant. DE and applications to single and multiple-objective optimization will be included in the presentation and lecture notes. A method for aerodynamic design optimization that is based on neural networks will also be included as a part of this lecture. The method offers advantages over traditional optimization methods. It is more flexible than other methods in dealing with design in the context of both steady and unsteady flows, partial and complete data sets, combined experimental and numerical data, inclusion of various constraints and rules of thumb, and other issues that characterize the aerodynamic design process. Neural networks provide a natural framework within which a succession of numerical solutions of increasing fidelity, incorporating more realistic flow physics, can be represented and utilized for optimization. Neural networks also offer an excellent framework for multiple-objective and multi-disciplinary design optimization. Simulation tools from various disciplines can be integrated within this framework and rapid trade-off studies involving one or many disciplines can be performed. The prospect of combining neural network based optimization methods and evolutionary algorithms to obtain a hybrid method with the best properties of both methods will be included in this presentation. Achieving solution diversity and accurate convergence to the exact Pareto front in multiple objective optimization usually requires a significant computational effort with evolutionary algorithms. In this lecture we will also explore the possibility of using neural networks to obtain estimates of the Pareto optimal front using non-dominated solutions generated by DE as training data. Neural network estimators have the potential advantage of reducing the number of function evaluations required to obtain solution accuracy and diversity, thus reducing cost to design.

Rai, Man Mohan↗

Sparse Gaussian elimination with controlled fill-in on a shared memory multiprocessor

It is shown that in sparse matrices arising from electronic circuits, it is possible to do computations on many diagonal elements simultaneously. A technique for obtaining an ordered compatible set directly from the ordered incompatible table is given. The ordering is based on the Markowitz number of the pivot candidates. This technique generates a set of compatible pivots with the property of generating few fills. A novel heuristic algorithm is presented that combines the idea of an order-compatible set with a limited binary tree search to generate several sets of compatible pivots in linear time. An elimination set for reducing the matrix is generated and selected on the basis of a minimum Markowitz sum number. The parallel pivoting technique presented is a stepwise algorithm and can be applied to any submatrix of the original matrix. Thus, it is not a preordering of the sparse matrix and is applied dynamically as the decomposition proceeds. Parameters are suggested to obtain a balance between parallelism and fill-ins. Results of applying the proposed algorithms on several large application matrices using the HEP multiprocessor (Kowalik, 1985) are presented and analyzed.

Alaghband, Gita↗

Turbopump Performance Improved by Evolutionary Algorithms

The development of design optimization technology for turbomachinery has been initiated using the multiobjective evolutionary algorithm under NASA's Intelligent Synthesis Environment and Revolutionary Aeropropulsion Concepts programs. As an alternative to the traditional gradient-based methods, evolutionary algorithms (EA's) are emergent design-optimization algorithms modeled after the mechanisms found in natural evolution. EA's search from multiple points, instead of moving from a single point. In addition, they require no derivatives or gradients of the objective function, leading to robustness and simplicity in coupling any evaluation codes. Parallel efficiency also becomes very high by using a simple master-slave concept for function evaluations, since such evaluations often consume the most CPU time, such as computational fluid dynamics. Application of EA's to multiobjective design problems is also straightforward because EA's maintain a population of design candidates in parallel. Because of these advantages, EA's are a unique and attractive approach to real-world design optimization problems.

Oyama, Akira↗

Electronic neural network for dynamic resource allocation

A VLSI implementable neural network architecture for dynamic assignment is presented. The resource allocation problems involve assigning members of one set (e.g. resources) to those of another (e.g. consumers) such that the global 'cost' of the associations is minimized. The network consists of a matrix of sigmoidal processing elements (neurons), where the rows of the matrix represent resources and columns represent consumers. Unlike previous neural implementations, however, association costs are applied directly to the neurons, reducing connectivity of the network to VLSI-compatible 0 (number of neurons). Each row (and column) has an additional neuron associated with it to independently oversee activations of all the neurons in each row (and each column), providing a programmable 'k-winner-take-all' function. This function simultaneously enforces blocking (excitatory/inhibitory) constraints during convergence to control the number of active elements in each row and column within desired boundary conditions. Simulations show that the network, when implemented in fully parallel VLSI hardware, offers optimal (or near-optimal) solutions within only a fraction of a millisecond, for problems up to 128 resources and 128 consumers, orders of magnitude faster than conventional computing or heuristic search methods.

Thakoor, A. P.↗

Mars: A reassessment of its interest to biology

Of all the planets in the solar system, Mars is certainly the one that has inspired the most speculation concerning extraterrestrial life. Observers had long ago noticed that Mars exhibits changes in its polar caps and alterations in its surface coloration that parallel seasonal changes on Earth. The fascination with Mars and the possibility of life on Mars continued into the spacecraft era and was directly expressed in the Viking Missions. These highly successful missions had the search for life on Mars as one of their principal goals. A review of Viking Missions experiments is presented. Results of these investigations are summarized. While the Viking Missions returned a negative answer to the question of life on Mars, they also showed that many years ago Mars was a very different place and enjoyed conditions that may have been conducive to the origin of life - life that may have long since become extinct. Evidence for the existence of water on Mars in the past is presented. Techniques used to study early life on Earth, which may also be used for similar studies on Mars, are described.

Mckay, Christopher P.↗

Lunar Ice Cube: ongoing development of first generation deep space cubesat mission with compact broadband IR spectrometer

Lunar Ice Cube (LIC) is one of 13 6U cubesats that will be deployed by EM1 in cislunar space. LIC along with Lunar Flashlight and LunaH-Map, all focused on the search for volatiles but with very different payloads, will be the first deep space cubesats designed to address goals for both demonstrating new technologies and collecting scientific data. Effectively, as their developments are occurring in parallel, they are acting as prototypes for future deep space cubesats missions. One useful outcome of this experiment is to evolve a working paradigm for the development and operation of compact, cost-capped, standardized (supporting subsystems) spacecraft to serve the needs of diverse user communities.

Mason, Paul↗

Motion detection in astronomical and ice floe images

Two approaches are presented for establishing correspondence between small areas in pairs of successive images for motion detection. The first one, based on local correlation, is used on a pair of successive Voyager images of the Jupiter which differ mainly in locally variable translations. This algorithm is implemented on a sequential machine (VAX 780) as well as the Massively Parallel Processor (MPP). In the case of the sequential algorithm, the pixel correspondence or match is computed on a sparse grid of points using nonoverlapping windows (typically 11 x 11) by local correlations over a predetermined search area. The displacement of the corresponding pixels in the two images is called the disparities to cubic surfaces. The disparities at points where the error between the computed values and the surface values exceeds a particular threshold are replaced by the surface values. A bilinear interpolation is then used to estimate disparities at all other pixels between the grid points. When this algorithm was applied at the red spot in the Jupiter image, the rotating velocity field of the storm was determined. The second method of motion detection is applicable to pairs of images in which corresponding areas can experience considerable translation as well as rotation.

Manohar, M.↗

Validation of Fault-Tolerant Plans for Europa Clipper

The Europa Clipper mission will explore that icy moon in a series of brief flybys through the Jovian radiation belts. A single event upset in the spacecraft flight computer during these critical scientific periods could jeopardize the success of the mission. Rather than safing and awaiting operator intervention, the Clipper mission envisions limited onboard autonomy that can restore spacecraft state sufficiently to resume the encounter observation plan as rapidly as possible. The contingency plan is contained in an Activity Restart Timeline (ART) that is transmitted in parallel with the nominal plan, which must be co-validated jointly against all spacecraft state and resource constraints amid unpredictable fault timing. A prototype validation tool was built that leverages declarative spacecraft models and automated search techniques to find such potential inconsistencies in the unified contingent mission plan. Early validation results within motivating scenarios are presented.

Ferguson, Eric↗

Evolutionary computing for the design search and optimization of space vehicle power subsystems

Evolutionary computing has proven to be a straightforward and robust approach for optimizing a wide range of difficult analysis and design problems. This paper discusses the application of these techniques to an existing space vehicle power subsystem resource and performance analysis simulation in a parallel processing environment.

evolutionary computing genetic algorithms optimiza↗

Evolutionary computing for the design search and optimization of space vehicle power subsystems

Evolutionary computing has proven to be a straightforward and robust approach for optimizing a wide range of difficult analysis and design problems. This paper discusses the application of these techniques to an existing space vehicle power subsystem resource and performance analysis simulation in a parallel processing environment. Out preliminary results demonstrate that this approach has the potential to improve the space system trade study process by allowing engineers to statistically weight subsystem goals of mass, cost and performance then automatically size power elements based on anticipated performance of the subsystem rather than on worst-case estimates.

power↗

Selection of Thermal Worst-Case Orbits via Modified Efficient Global Optimization

Efficient Global Optimization (EGO) was used to select orbits with worst-case hot and cold thermal environments for the Stratospheric Aerosol and Gas Experiment (SAGE) III. The SAGE III system thermal model changed substantially since the previous selection of worst-case orbits (which did not use the EGO method), so the selections were revised to ensure the worst cases are being captured. The EGO method consists of first conducting an initial set of parametric runs, generated with a space-filling Design of Experiments (DoE) method, then fitting a surrogate model to the data and searching for points of maximum Expected Improvement (EI) to conduct additional runs. The general EGO method was modified by using a multi-start optimizer to identify multiple new test points at each iteration. This modification facilitates parallel computing and decreases the burden of user interaction when the optimizer code is not integrated with the model. Thermal worst-case orbits for SAGE III were successfully identified and shown by direct comparison to be more severe than those identified in the previous selection. The EGO method is a useful tool for this application and can result in computational savings if the initial Design of Experiments (DoE) is selected appropriately.

Moeller, Timothy M.↗

The eigenvalue spectrum of the Orr-Sommerfeld problem

A numerical investigation of the temporal eigenvalue spectrum of the ORR-Sommerfeld equation is presented. Two flow profiles are studied, the plane Poiseuille flow profile and the Blasius boundary layer (parallel): flow profile. In both cases a portion of the complex c-plane bounded by 0 less than or equal to CR sub r 1 and -1 less than or equal to ci sub i 0 is searched and the eigenvalues within it are identified. The spectra for the plane Poiseuille flow at alpha = 1.0 and R = 100, 1000, 6000, and 10000 are determined and compared with existing results where possible. The spectrum for the Blasius boundary layer flow at alpha = 0.308 and R = 998 was found to be infinite and discrete. Other spectra for the Blasius boundary layer at various Reynolds numbers seem to confirm this result. The eigenmodes belonging to these spectra were located and discussed.

Antar, B. N.↗

The Evolution of the Galaxy Rest-Frame Ultraviolet Luminosity Function Over the First Two Billion Years

We present a robust measurement and analysis of the rest-frame ultraviolet (UV) luminosity function at z = 4 to 8. We use deep Hubble Space Telescope imaging over the CANDELS/GOODS fields, the Hubble Ultra Deep Field and the Hubble Frontier Field deep parallel observations near the Abell 2744 and MACS J0416.1- 2403 clusters. The combination of these surveys provides an effective volume of 0.6-1.2 ×10(exp 6) Mpc(exp 3) over this epoch, allowing us to perform a robust search for bright (M(sub UV) less than −21) and faint (M(sub UV) = −18) galaxies. We select galaxies using a well-tested photometric redshift technique with careful screening of contaminants, finding a sample of 7446 galaxies at 3.5 less than z less than 8.5, with more than 1000 galaxies at z of approximately 6 - 8. We measure both a stepwise luminosity function for galaxies in our redshift samples, as well as a Schechter function, using a Markov Chain Monte Carlo analysis to measure robust uncertainties. At the faint end our UV luminosity functions agree with previous studies, yet we find a higher abundance of UV-bright galaxies at z of greater than or equal to 6. Our bestfit value of the characteristic magnitude M* is consistent with −21 at z of greater than or equal to 5, different than that inferred based on previous trends at lower redshift. At z = 8, a single power-law provides an equally good fit to the UV luminosity function, while at z = 6 and 7, an exponential cutoff at the bright-end is moderately preferred. We compare our luminosity functions to semi-analytical models, and find that the lack of evolution in M* is consistent with models where the impact of dust attenuation on the bright-end of the luminosity function decreases at higher redshift, though a decreasing impact of feedback may also be possible. We measure the evolution of the cosmic star-formation rate (SFR) density by integrating our observed luminosity functions to M(sub UV) = −17, correcting for dust attenuation, and find that the SFR density declines proportionally to (1 + z)((exp −4.3)(+/-)(0.5)) at z greater than 4, consistent with observations at z greater than or equal to 9. Our observed luminosity functions are consistent with a reionization history that starts at redshift of approximately greater than 10, completes at z greater than 6, and reaches a midpoint (x(sub HII) = 0.5) at 6.7 less than z less than 9.4. Finally, using a constant cumulative number density selection and an empirically derived rising star-formation history, our observations predict that the abundance of bright z = 9 galaxies is likely higher than previous constraints, though consistent with recent estimates of bright z similar to 10 galaxies.

Galaxy↗

Personal Rotorcraft Design and Performance with Electric Hybridization

Recent and projected improvements for more or all-electric aviation propulsion systems can enable greater personal mobility, while also reducing environmental impact (noise and emissions). However, all-electric energy storage capability is significantly less than present, hydrocarbon-fueled systems. A system study was performed exploring design and performance assuming hybrid propulsion ranging from traditional hydrocarbon-fueled cycles (gasoline Otto and diesel) to all-electric systems using electric motors generators, with batteries for energy storage and load leveling. Study vehicles were a conventional, single-main rotor (SMR) helicopter and an advanced vertical takeoff and landing (VTOL) aircraft. Vehicle capability was limited to two or three people (including pilot or crew); the design range for the VTOL aircraft was set to 150 miles (about one hour total flight). Search and rescue (SAR), loiter, and cruise-dominated missions were chosen to illustrate each vehicle and degree of hybrid propulsion strengths and weaknesses. The traditional, SMR helicopter is a hover-optimized design; electric hybridization was performed assuming a parallel hybrid approach by varying degree of hybridization. Many of the helicopter hybrid propulsion combinations have some mission capabilities that might be effective for short range or on-demand mobility missions. However, even for 30 year technology electrical components, all hybrid propulsion systems studied result in less available fuel, lower maximum range, and reduced hover and loiter duration than the baseline vehicle. Results for the VTOL aircraft were more encouraging. Series hybrid combinations reflective of near-term systems could improve range and loiter duration by 30. Advanced, higher performing series hybrid combinations could double or almost triple the VTOL aircrafts range and loiter duration. Additional details on the study assumptions and work performed are given, as well as suggestions for future study effort.

electric motors↗

Two criteria for the selection of assembly plans - Maximizing the flexibility of sequencing the assembly tasks and minimizing the assembly time through parallel execution of assembly tasks

The authors introduce two criteria for the evaluation and selection of assembly plans. The first criterion is to maximize the number of different sequences in which the assembly tasks can be executed. The second criterion is to minimize the total assembly time through simultaneous execution of assembly tasks. An algorithm that performs a heuristic search for the best assembly plan over the AND/OR graph representation of assembly plans is discussed. Admissible heuristics for each of the two criteria introduced are presented. Some implementation issues that affect the computational efficiency are addressed.

Homem De Mello, Luiz S.↗

Programmable synaptic devices for electronic neural nets

The architecture, design, and operational characteristics of custom VLSI and thin film synaptic devices are described. The devices include CMOS-based synaptic chips containing 1024 reprogrammable synapses with a 6-bit dynamic range, and nonvolatile, write-once, binary synaptic arrays based on memory switching in hydrogenated amorphous silicon films. Their suitability for embodiment of fully parallel and analog neural hardware is discussed. Specifically, a neural network solution to an assignment problem of combinatorial global optimization, implemented in fully parallel hardware using the synaptic chips, is described. The network's ability to provide optimal and near optimal solutions over a time scale of few neuron time constants has been demonstrated and suggests a speedup improvement of several orders of magnitude over conventional search methods.

Moopenn, A.↗

Solid rocket booster retrieval operations

Solid Rocket Booster Retrieval operations are discussed in detail. The recovery of expended boosters and associated hardware without damage attributable to retrieval procedures is the main goal. The retrieval force consists tof ship's personnel and retrieval team members, each of whom has been trained and is highly skilled in multi-faceted operations. The retrieval force is equipped with two specially-built, highly maneuverable ships outfitted with parachute reels, retrieval cranes, towing winches, large volume-low pressure air compressors, SCUBA diving gear, inflatable boats with outboard motors and diver-operated SRB dewatering devices. The two ships are deployed in sufficient time to conduct an electronic and visual search of the impact area prior to launch. Upon search completeion, each ship takes station a safe distance from the predetermined impact point initiating both visual and electronic search in the direction of flight path, ensuring SRB acquisition at splashdown. When safe, the ships enter the impact area and commence recovery of all floating flight hardware which is subsequently returned to the Disassembly Facility for refurbishment and reuse. Retrieval techniques have evolved in parallel with equipment and flight hardware configuration changes. Additional changes have been initiated to improve personnel safety.

Rasmussen, A. M.↗

Computational mechanics analysis tools for parallel-vector supercomputers

Computational algorithms for structural analysis on parallel-vector supercomputers are reviewed. These parallel algorithms, developed by the authors, are for the assembly of structural equations, 'out-of-core' strategies for linear equation solution, massively distributed-memory equation solution, unsymmetric equation solution, general eigensolution, geometrically nonlinear finite element analysis, design sensitivity analysis for structural dynamics, optimization search analysis and domain decomposition. The source code for many of these algorithms is available.

Storaasli, Olaf O.↗