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.
The general features of the GENET system for simulating networks are described. A set of features is presented which are desirable for network simulations and which are expected to be achieved by this system. Among these features are: (1) two level network modeling; and (2) problem oriented operations. Several typical network systems are modeled in GENET framework to illustrate various of the features and to show its applicability.
Genetic algorithms for function optimization employ genetic operators patterned after those observed in search strategies employed in natural adaptation. Two of these operators, crossover and inversion, are interpreted in terms of their algebraic and geometric properties. Stochastic models of the operators are developed which are employed in Monte Carlo simulations of their behavior.
The results are presented of a study to determine the performance of genetic direct search algorithms in solving function optimization problems arising in the optimal and adaptive control areas. The findings indicate that: (1) genetic algorithms can outperform standard algorithms in multimodal and/or noisy optimization situations, but suffer from lack of gradient exploitation facilities when gradient information can be utilized to guide the search. (2) For large populations, or low dimensional function spaces, mutation is a sufficient operator. However for small populations or high dimensional functions, crossover applied in about equal frequency with mutation is an optimum combination. (3) Complexity, in terms of storage space and running time, is significantly increased when population size is increased or the inversion operator, or the second level adaptation routine is added to the basic structure.
The genetic code is examined for indications of possible preceding codes that existed during early evolution. Eight of the 20 amino acids are coded by 'quartets' of codons with fourfold degeneracy, and 16 such quartets can exist, so that an earlier code could have provided for 15 or 16 amino acids, rather than 20. If twofold degeneracy is postulated for the first position of the codon, there could have been ten amino acids in the code. It is speculated that these may have been phenylalanine, valine, proline, alanine, histidine, glutamine, glutanic acid, aspartic acid, cysteine and glycine. There is a notable deficiency of arginine in proteins, despite the fact that it has six codons. Simultaneously, there is more lysine in proteins than would be expected from its two codons, if the four bases in mRNA are equiprobable and are arranged randomly. It is speculated that arginine is an 'intruder' into the genetic code, and that it may have displayed another amino acid such as ornithine, or may even have displayed lysine from some of its previous codon assignments. As a result, natural selection has favored lysine against the fact that it has only two codons.
Differences between typical coacervate droplets and typical proteinoid microspheres are examined. It is pointed out that coacervate droplets are produced from polymers obtained from contemporary organisms. The microspheres considered are aggregates of proteinoid formed from monomeric amino acids under geologically relevant conditions. Aspects regarding the primordial sequence are discussed along with the origin of the genetic apparatus and the genetic code.
Genetic Algorithms that are used for learning as one way to control the combinational explosion associated with the generation of new rules are discussed. The Genetic Algorithm approach tends to work best when it can be applied to a domain independent knowledge representation. Applications to real time control in space systems are discussed.
A prototype system employing a genetic algorithm (GA) has been developed to support the scheduling of the Hubble Space Telescope. A non-standard knowledge structure is used and appropriate genetic operators have been created. Several different crossover styles (random point selection, evolving points, and smart point selection) are tested and the best GA is compared with a neural network (NN) based optimizer. The smart crossover operator produces the best results and the GA system is able to evolve complete schedules using it. The GA is not as time-efficient as the NN system and the NN solutions tend to be better.
G/SPLINES are a hybrid of Friedman's Multivariable Adaptive Regression Splines (MARS) algorithm with Holland's Genetic Algorithm. In this hybrid, the incremental search is replaced by a genetic search. The G/SPLINE algorithm exhibits performance comparable to that of the MARS algorithm, requires fewer least squares computations, and allows significantly larger problems to be considered.
SPLICER computer program is genetic-algorithm software tool used to solve search and optimization problems. Provides underlying framework and structure for building genetic-algorithm application program. Written in Think C.
Theoretical simulation of prebiotic chemical processes is an invaluable tool for probing the phenomenon of evolution of life. Using computational and modeling techniques and guided by analogies from present day systems we, seek to understand the emergence of genetic apparatus, enzymatic catalysis and protein synthesis under prebiotic conditions. In one possible scenario, the RNA enzymatic reaction plays a key role in the emergence of the self-replicating and offers a clue to the onset of enzymatic catalysis prior to the existence of the protein biosynthetic machinery. Our ultimate goal is to propose a simple RNA segment which contains the specificity and catalytic activity of the contemporary RNA enzyme and which could emerge in a primordial chemical environment. To understand the mechanism of ribozyme catalyzed reactions, ab initio and semi-empirical (ZINDO) programs were used to investigate the reaction path of transphosphorylation. A special emphasis was placed on the possible catalytic and structural roles played by the coordinated magnesium cation. Both the inline and adjacent mechanisms of transphosphorylation have been studied. Another important aspect of this reaction is the identity of the functional groups which are essential for the acid base catalysis. The structural characteristics of the target helices, particularly a possible role of G center dot T pair, is under examination by molecular dynamics (MD) simulation technique. Modeling of the ancestral aminoacyl-tRNA synthetases (aRS) may provide important clues to the emergence of the genetic code and the protein synthetic machinery. Assuming that the catalytic function evolved before the elements of specific recognition of a particular amino acid, we are exploring the minimal structural requirements for the catalysis of tRNA aminoacylation. The molecular modeling system SYBYL was used for this study based on the high resolution crystallographic structures of the present day tyrosyl-adenylate:tyrRS and tRNA(Gln): ATP:glnRS complexes. The trinucleotide CCA of the 3'-end tRNA is placed into the active site pocket of tyrRS, based on the scheme of interaction between tRNA(Gln) and glnRS, and upon the stereochemistry of the tyrRS:tRNA:Tyr-AMP transition state. This provides a model of the non-specific recognition of a tRNA's 3'-end by an aRS, which might be similar to that of the ancestral aRS's. In the next step, modeling of the rest of the acceptor stem of tRNA (Tyr) with tyrRS is carried out.
Theoretical simulation of prebiotic chemical processes is an invaluable tool for probing the phenomenon of the evolution of life. Using computational and modeling techniques and guided by analogies from present day systems, we seek to understand the emergence of the genetic apparatus, enzymatic catalysis and protein synthesis under prebiotic conditions. Modeling of the ancestral aminoacyl-tRNA-synthetases (aRS) may provide important clues to the emergence of the genetic code and the protein synthetic machinery. The minimal structural requirements for the catalysis of tRNA aminoacylation are being explored. A formation of an aminoacyl adenylate was studied in the framework of ab initio molecular orbital theory. The role of individual residues in the vicinity of the TyrRS active site was examined, and the effect of all possible amino acids substitutions near the active site was examined. A formation of aminoacyl tRNA was studied by the molecular modeling system SYBYL with the high resolution crystallographic structures of the present day tRNA, aRS's complexes. The ultimate goal is to propose a simple RNA segment that is small enough to be build in the primordial chemical environment but maintains the specificity and catalytic activity of the contemporary RNA enzyme. To understand the mechanism of ribozyme catalyzed reactions, ab initio and semi-empirical (ZINDO) programs were used to investigate the reaction path of transphosphorylation. A special emphasis was placed on the possible catalytic and structural roles played by the coordinated magnesium cation. Both the inline and adjacent mechanisms of transphosphorylation were studied. The structural characteristics of the target helices, particularly a possible role for the G-T pair, is also studied by a molecular dynamics (MD) simulation technique.
An optimization method for flush-orifice air data system design has been developed using the Genetic Algorithm approach. The optimization of the orifice array minimizes the effect of normally distributed random noise in the pressure readings on the calculation of air data parameters, namely, angle of attack, sideslip angle and freestream dynamic pressure. The optimization method is applied to the design of Pressure Distribution/Air Data System experiment (PD/ADS) proposed for inclusion in the Aeroassist Flight Experiment (AFE). Results obtained by the Genetic Algorithm method are compared to the results obtained by conventional gradient search method.
The design of neural networks and fuzzy systems can involve complex, nonlinear, and ill-conditioned optimization problems. Often, traditional optimization schemes are inadequate or inapplicable for such tasks. Genetic Algorithms (GA's) are a class of optimization procedures whose mechanics are based on those of natural genetics. Mathematical arguments show how GAs bring substantial computational leverage to search problems, without requiring the mathematical characteristics often necessary for traditional optimization schemes (e.g., modality, continuity, availability of derivative information, etc.). GA's have proven effective in a variety of search tasks that arise in neural networks and fuzzy systems. This presentation begins by introducing the mechanism and theoretical underpinnings of GA's. GA's are then related to a class of rule-based machine learning systems called learning classifier systems (LCS's). An LCS implements a low-level production-system that uses a GA as its primary rule discovery mechanism. This presentation illustrates how, despite its rule-based framework, an LCS can be thought of as a competitive neural network. Neural network simulator code for an LCS is presented. In this context, the GA is doing more than optimizing and objective function. It is searching for an ecology of hidden nodes with limited connectivity. The GA attempts to evolve this ecology such that effective neural network performance results. The GA is particularly well adapted to this task, given its naturally-inspired basis. The LCS/neural network analogy extends itself to other, more traditional neural networks. Conclusions to the presentation discuss the implications of using GA's in ecological search problems that arise in neural and fuzzy systems.
Researchers at the U.S. Bureau of Mines have developed adaptive process control systems in which genetic algorithms (GA's) are used to augment fuzzy logic controllers (FLC's). GA's are search algorithms that rapidly locate near-optimum solutions to a wide spectrum of problems by modeling the search procedures of natural genetics. FLC's are rule based systems that efficiently manipulate a problem environment by modeling the 'rule-of-thumb' strategy used in human decision making. Together, GA's and FLC's possess the capabilities necessary to produce powerful, efficient, and robust adaptive control systems. To perform efficiently, such control systems require a control element to manipulate the problem environment, and a learning element to adjust to the changes in the problem environment. Details of an overall adaptive control system are discussed. A specific laboratory acid-base pH system is used to demonstrate the ideas presented.
Researchers at the U.S. Bureau of Mines have developed adaptive process control systems in which genetic algorithms (GA's) are used to augment fuzzy logic controllers (FLC's). GA's are search algorithms that rapidly locate near-optimum solutions to a wide spectrum of problems by modeling the search procedures of natural genetics. FLC's are rule based systems that efficiently manipulate a problem environment by modeling the 'rule-of-thumb' strategy used in human decision-making. Together, GA's and FLC's possess the capabilities necessary to produce powerful, efficient, and robust adaptive control systems. To perform efficiently, such control systems require a control element to manipulate the problem environment, an analysis element to recognize changes in the problem environment, and a learning element to adjust to the changes in the problem environment. Details of an overall adaptive control system are discussed. A specific laboratory acid-base pH system is used to demonstrate the ideas presented.
Researchers at the U.S. Bureau of Mines have developed adaptive process control systems in which genetic algorithms (GA's) are used to augment fuzzy logic controllers (FLC's). GA's are search algorithms that rapidly locate near-optimum solutions to a wide spectrum of problems by modeling the search procedures of natural genetics. FLC's are rule based systems that efficiently manipulate a problem environment by modeling the 'rule-of-thumb' strategy used in human decision making. Together, GA's and FLC's possess the capabilities necessary to produce powerful, efficient, and robust adaptive control systems. To perform efficiently, such control systems require a control element to manipulate the problem environment, an analysis element to recognize changes in the problem environment, and a learning element to adjust fuzzy membership functions in response to the changes in the problem environment. Details of an overall adaptive control system are discussed. A specific computer-simulated chemical system is used to demonstrate the ideas presented.
Through previous work, a fuzzy control system was developed to perform translational and rotational control of a space vehicle. This problem was then re-examined to determine the effectiveness of genetic algorithms on fine tuning the controller. This paper explains the problems associated with the design of this fuzzy controller and offers a technique for tuning fuzzy logic controllers. A fuzzy logic controller is a rule-based system that uses fuzzy linguistic variables to model human rule-of-thumb approaches to control actions within a given system. This 'fuzzy expert system' features rules that direct the decision process and membership functions that convert the linguistic variables into the precise numeric values used for system control. Defining the fuzzy membership functions is the most time consuming aspect of the controller design. One single change in the membership functions could significantly alter the performance of the controller. This membership function definition can be accomplished by using a trial and error technique to alter the membership functions creating a highly tuned controller. This approach can be time consuming and requires a great deal of knowledge from human experts. In order to shorten development time, an iterative procedure for altering the membership functions to create a tuned set that used a minimal amount of fuel for velocity vector approach and station-keep maneuvers was developed. Genetic algorithms, search techniques used for optimization, were utilized to solve this problem.
Optimal placement of tuning masses, actuators and other peripherals on large space structures is a combinatorial optimization problem. This paper surveys several techniques for solving this problem. The genetic algorithm approach to the solution of the placement problem is described in detail. An example of minimizing the difference between the two lowest frequencies of a laboratory truss by adding tuning masses is used for demonstrating some of the advantages of genetic algorithms. The relative efficiencies of different codings are compared using the results of a large number of optimization runs.