SEARCH · Search NASA
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.
Matched asymptotic expansion method applied to ordinary and optimal trajectory problems in hypervelocity flight dynamics
The feasibility of simulating and synthesizing substructures by computational neural network models is illustrated by investigating a statically indeterminate beam, using both a 1-D and a 2-D plane stress modelling. The beam can be decomposed into two cantilevers with free-end loads. By training neural networks to simulate the cantilever responses to different loads, the original beam problem can be solved as a match-up between two subsystems under compatible interface conditions. The genetic algorithms are successfully used to solve the match-up problem. Simulated results are found in good agreement with the analytical or FEM solutions.
Explore the source record for details and available documents.
F77NNS (FORTRAN 77 Neural Network Simulator) computer program simulates popular back-error-propagation neural network. Designed to take advantage of vectorization when used on computers having this capability, also used on any computer equipped with ANSI-77 FORTRAN Compiler. Problems involving matching of patterns or mathematical modeling of systems fit class of problems F77NNS designed to solve. Program has restart capability so neural network solved in stages suitable to user's resources and desires. Enables user to customize patterns of connections between layers of network. Size of neural network F77NNS applied to limited only by amount of random-access memory available to user.
This paper explores a co-evolutionary approach applicable to difficult problems with limited failure/success performance feedback. Like familiar "predator-prey" frameworks this algorithm evolves two populations of individuals - the solutions (predators) and the problems (prey). The approach extends previous work by rewarding only the problems that match their difficulty to the level of solut,ion competence. In complex problem domains with limited feedback, this "tractability constraint" helps provide an adaptive fitness gradient that, effectively differentiates the candidate solutions. The algorithm generates selective pressure toward the evolution of increasingly competent solutions by rewarding solution generality and uniqueness and problem tractability and difficulty. Relative (inverse-fitness) and absolute (static objective function) approaches to evaluating problem difficulty are explored and discussed. On a simple control task, this co-evolutionary algorithm was found to have significant advantages over a genetic algorithm with either a static fitness function or a fitness function that changes on a hand-tuned schedule.
A computer simulation model for a multiprocessor computer is developed that is useful for studying the problem of matching multiprocessor's memory space, memory bandwidth and numbers and speeds of processors with aggregate job set characteristics. The model assumes an input work load of a set of recurrent jobs. The model includes a feedback scheduler/allocator which attempts to improve system performance through higher memory bandwidth utilization by matching individual job requirements for space and bandwidth with space availability and estimates of bandwidth availability at the times of memory allocation. The simulation model includes provisions for specifying precedence relations among the jobs in a job set, and provisions for specifying precedence execution of TMR (Triple Modular Redundant and SIMPLEX (non redundant) jobs.
Component data on the J35-A-23 compressor and two-stage turbine were used to determine the problems in matching the two units for operatio n in a turbojet engine. Possible operating regions were determined an d an equilibrium operating line was also determined for the assumed c onditions of zero flight speed and a jet nozzle area approximately 5. 5 percent greater than the wide-open nozzle area.
One of the basic building blocks in any point-based registration scheme involves matching feature points that are extracted from the sensed image to their counterparts in the reference image. This leads to the fundamental problem of point matching: given two sets of points, find the affine transformation that transforms one point set so that its distance from the other point set is minimized. Because of measurement errors and the presence of outlying data points, it is important that the distance measure between two point sets be robust to these effects. We measure distances using the generalized Hausdorff distance. Point matching can be a computationally intensive task, and there have been a number of algorithms and approaches proposed for solving this problem both theoretical and applied. We present two approaches to the point matching problem, in an attempt to reduce the computational complexity of the problem, while still providing guarantees on the quality of the final match. Our first method is an approximation algorithm, which is loosely based on a branch-and-bound approach due to Huttenlocher and Rucklidge. We show that by varying the approximation error bounds, it is possible to achieve a tradeoff between the quality of the match and the running time of the algorithm. Our second method involves a Monte Carlo method for accelerating the search process used in the first algorithm. With high probability this method succeeds in finding an approximately optimal match. We establish the efficiency of our approaches empirically.
We exploit a novel idea for the optimization of flows governed by the Euler equations. The algorithm consists of marching on the design hypersurface while improving the distance to the state and costate hypersurfaces. We consider the problem of matching the pressure distribution to a desired one, subject to the euler equations, both for subsonic and supersonic flows. The rate of convergence to the minimum for the cases considered is 3 to 4 times slower than that of the analysis problem. Results are given for Ringleb flow and a shockless recompression case.
Three-dimensional corrections to the nonlinear mixed flow admitted by a high-aspect-ratio swept wing of practical interest are analyzed by solving a perturbation problem and matching its solution to that of an outer flow. The latter is identified with a linear solution involving a lifting line, but the centerline of the planform is not required to be straight and unyawed. The existence of a similarity in the three-dimensional flow structure for a certain oblique-wing geometry is demonstrated, along with a solution to the reduced problem in a high-subcritical case.
The only way to gain genuine expertise in Statistical Process Control (SPC) and the design of experiments (DOX) is with repeated practice, but not on canned problems with dead data sets. Rather, one must negotiate a wide variety of problems each with its own peculiarities and its own constantly changing data. The problems should not be of the type for which there is a single, well-defined answer that can be looked up in a fraternity file or in some text. The problems should match as closely as possible the open-ended types for which there is always an abundance of uncertainty. These are the only kinds that arise in real research, whether that be basic research in academe or engineering research in industry. To gain this kind of experience, either as a professional consultant or as an industrial employee, takes years. Vast amounts of money, not to mention careers, must be put at risk. The purpose here is to outline some realistic simulation-type lab exercises that are so simple and inexpensive to run that the students can repeat them as often as desired at virtually no cost. Simulations also allow the instructor to design problems whose outcomes are as noisy as desired but still predictable within limits. Also the instructor and the students can learn a great deal more from the postmortum conducted after the exercise is completed. One never knows for sure what the true data should have been when dealing only with real life experiments. To add a bit more realism to the exercises, it is sometimes desirable to make the students pay for each experimental result from a make-believe budget allocation for the problem.
Static power conversion systems for medium power level needs of spacecraft, and problems of matching power sources to the load
The time dependent concentration and temperature profiles of a finite layer of a binary mixture are investigated during solidification. The coupled time dependent Stefan problem is solved numerically using an implicit finite differencing algorithm with the method of lines. Specifically, the temporal operator is approximated via an implicit finite difference operator resulting in a coupled set of ordinary differential equations for the spatial distribution of the temperature and concentration for each time. Since the resulting differential equations set form a boundary value problem with matching conditions at an unknown spatial point, the method of invariant imbedding is used for its solution.
The formulation and basic theorems of singularly perturbed nonlinear optimal control problems are discussed and the solution of such problems using matched asymptotic expansions is described.
The diffusive acceleration of highly relativistic particles at a shock is reconsidered. Using the same physical assumptions as Blandford and Ostriker (1978), but dropping the restriction to nonrelativistic shock velocities, the authors find approximate solutions of the particle kinetic equation by generalizing the diffusion approximation to higher order terms in the anisotropy of the particle distribution. The general solution of the transport equation on either side of the shock is constructed, which involves the solution of an eigenvalue problem. By matching the two solutions at the shock, the spectral index of the resulting power law is found by taking into account a sufficiently large number of eigenfunctions. Low-order truncation corresponds to the standard diffusion approximation and to a somewhat more general method described by Peacock (1981). In addition to the energy spectrum, the method yields the angular distribution of the particles and its spatial dependence.
Decision and analysis systems have had broad and very practical application areas in the human decision making process. These software systems range from the help sections in simple accounting packages, to the more complex computer configuration programs. Dypas is a decision and analysis system that aids prelaunch shutlle scheduling, and has added functionality to aid the rescheduling done in flight. Dypas is written in Common Lisp on a Symbolics Lisp machine. Dypas differs from other scheduling programs in that it can draw its knowledge from different rule bases and apply them to different rule interpretation schemes. The system has been coded with Flavors, an object oriented extension to Common Lisp on the Symbolics hardware. This allows implementation of objects (experiments) to better match the problem definition, and allows a more coherent solution space to be developed. Dypas was originally developed to test a programmer's aptitude toward Common Lisp and the Symbolics software environment. Since then the system has grown into a large software effort with several programmers and researchers thrown into the effort. Dypas is currently using two expert systems and three inferencing procedures to generate a many object schedule. The paper will review the abilities of Dypas and comment on its functionality.
Improved acoustic-transducer assembly easy to assemble, relocatable, and used at high temperatures. In assembly, piezoelectric acoustic transducer pressure-coupled to delay line or fixture through soft metal like aluminum, copper or gold. Transducer subassembly includes layered structure of coupling material, transducer, thin disk of coupling material acting as cushion for transducer, electrode disk with coaxial cable lead attached, insulation/damping material, and pressure plate. Pressure coupling precludes problem of matching coefficients of thermal expansion of transducer, coupling material, and delay line.
Time series of maps of monthly tropical Pacific dynamic topography anomalies from 1979 through 1985 were constructed by means of assimilation of the tide gauge and expendable bathythermograph (XBT) data into a linear model driven by observed winds. Estimates of error statistics were calculated and compared to actual differences between hindcasts and observations. Four experiements were performed as follows: one with no assimilation, one with assimiation of sea level anomaly data from eight selected island tide gauge stations, one with assimilation of dynamic height anomalies derived from XBT data, and one with both XBT and tide gauge data assimilated. Data from seven additional tide gauge stations were withheld from the assimilation process and used for verification in all four experiements. Statistical objective maps based on data alone were also constructed for comparison purposes. The dynamic response of the model without assimilation was, in general, weaker than the observed response. Assimilation resulted in enhanced signal amplitude in all three assimilation experiments. With few exceptions the error estimated generated by the Kalman filter appeared quite reasonable. Since the error processes cannot be assumed to be white or stationary, we could find no straightforward way to test the formal statistical hypothesis that the time series of differences between the filter ouput and the actual observations were drawn from a population with statistics given by the Kalman filter estimaes. We found that the best filter we could devise was still short of the goal of producing a white innovation sequence. Extensive changes in the assumed error statistics make only marginal differences. The same is true for long time and space scale behavior of different models with richer physics and finer resolution. Better data assimilation results will probably require relaxation of the assumptions of stationarity and serial independence of the errors. Formation of such detailed noise models will require longer time series, with the attendant problems of matching very different data sets.