Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “disjoint set”

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.

23 records · Page 2

Theoretical Study of the Low-Lying States of TiHe(+),TiNe(+),TiAr(+),VAr(+),CrHe(+),CrAr(+),FeHe(+),FeAr(+),CoHe(+),and CoAr(+)

The potential energy curves for the manifold of molecular states dissociating to the lowest transition metal ion states derived from the 3d(sup n+1) and 3d(sup n)4s(sup 1) occupations have been determined for selected transition-metal ion- rare gas systems. These curves have been computed using large basis sets, and the state-averaged complete- active-space self-consistent-field/multireference configuration interaction level of electron correlation treatment. In general, the families of curves derived from the 3d(sup n+1) and 3d(sup n)4s(sup 1) metal occupations are disjoint; however, for Ti(+) there is a strong mixing of the 3d(sup 2)4s(sup 1) and 3d(sup 3) asymptotes, because of the small separation between the asymptotes. This mixing leads to a failure of single-reference-based techniques; this is discussed in the context of our previous single-reference-based treatments.

Partridge, Harry↗

Dynamically allocating sets of fine-grained processors to running computations

Researchers explore an approach to using general purpose parallel computers which involves mapping hardware resources onto computations instead of mapping computations onto hardware. Problems such as processor allocation, task scheduling and load balancing, which have traditionally proven to be challenging, change significantly under this approach and may become amenable to new attacks. Researchers describe the implementation of this approach used by the FFP Machine whose computation and communication resources are repeatedly partitioned into disjoint groups that match the needs of available tasks from moment to moment. Several consequences of this system are examined.

Middleton, David↗

On the Natural Structure of Amino Acid Patterns in Families of Protein Sequences

All known terrestrial proteins are coded as continuous strings of ≈20 amino acids. The patterns formed by the repetitions of elements in groups of finite sequences describes the natural architectures of protein families. We present a method to search for patterns and groupings of patterns in protein sequences using a mathematically precise definition for “repetition”, an efficient algorithmic implementation and a robust scoring system with no adjustable parameters. We show that the sequence patterns can be well-separated into disjoint classes according to their recurrence in nested structures. The statistics of the occurrences of patterns indicate that short repetitions are sufficient to account for the differences between natural families and randomized groups of sequences by more than 10 standard deviations, while contiguous sequence patterns shorter than 5 residues are effectively random in their occurrences. A small subset of patterns is sufficient to account for a robust ”familiarity” definition between arbitrary sets of sequences.

Pablo Turjanski↗

SSME structural dynamic model development, phase 2

A set of test correlated mathematical models of the SSME High Pressure Oxygen Turbopump (HPOTP) housing and rotor assembly was produced. New analysis methods within the EISI/EAL and SPAR systems were investigated and runstreams for future use were developed. The LOX pump models have undergone extensive modification since the first phase of this effort was completed. The rotor assembly from the original model was abandoned and a new, more detailed model constructed. A description of the new rotor math model is presented. Also, the pump housing model was continually modified as additional test data have become available. This model is documented along with measured test results. Many of the more advanced features of the EAL/SPAR finite element analysis system were exercised. These included the cyclic symmetry option, the macro-element procedures, and the fluid analysis capability. In addition, a new tool was developed that allows an automated analysis of a disjoint structure in terms of its component modes. A complete description of the implementation of the Craig-Bampton method is given along with two worked examples.

Foley, M. J.↗

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↗