Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “evolutionary algorithm”

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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
NASA NTRS1995

An Empirical Comparison of Seven Iterative and Evolutionary Function Optimization Heuristics

This report is a repository of the results obtained from a large scale empirical comparison of seven iterative and evolution-based optimization heuristics. Twenty-seven static optimization problems, spanning six sets of problem classes which are commonly explored in genetic algorithm literature, are examined. The problem sets include job-shop scheduling, traveling salesman, knapsack, binpacking, neural network weight optimization, and standard numerical optimization. The search spaces in these problems range from 2368 to 22040. The results indicate that using genetic algorithms for the optimization of static functions does not yield a benefit, in terms of the final answer obtained, over simpler optimization heuristics. Descriptions of the algorithms tested and the encodings of the problems are described in detail for reproducibility.

Baluja, Shumeet↗
NASA NTRS2004

A Novel, Real-Valued Genetic Algorithm for Optimizing Radar Absorbing Materials

A novel, real-valued Genetic Algorithm (GA) was designed and implemented to minimize the reflectivity and/or transmissivity of an arbitrary number of homogeneous, lossy dielectric or magnetic layers of arbitrary thickness positioned at either the center of an infinitely long rectangular waveguide, or adjacent to the perfectly conducting backplate of a semi-infinite, shorted-out rectangular waveguide. Evolutionary processes extract the optimal physioelectric constants falling within specified constraints which minimize reflection and/or transmission over the frequency band of interest. This GA extracted the unphysical dielectric and magnetic constants of three layers of fictitious material placed adjacent to the conducting backplate of a shorted-out waveguide such that the reflectivity of the configuration was 55 dB or less over the entire X-band. Examples of the optimization of realistic multi-layer absorbers are also presented. Although typical Genetic Algorithms require populations of many thousands in order to function properly and obtain correct results, verified correct results were obtained for all test cases using this GA with a population of only four.

Hall, John Michael↗
NASA NTRS1997

Application of Domain Knowledge to Software Quality Assurance

This work focused on capturing, using, and evolving a qualitative decision support structure across the life cycle of a project. The particular application of this study was towards business process reengineering and the representation of the business process in a set of Business Rules (BR). In this work, we defined a decision model which captured the qualitative decision deliberation process. It represented arguments both for and against proposed alternatives to a problem. It was felt that the subjective nature of many critical business policy decisions required a qualitative modeling approach similar to that of Lee and Mylopoulos. While previous work was limited almost exclusively to the decision capture phase, which occurs early in the project life cycle, we investigated the use of such a model during the later stages as well. One of our significant developments was the use of the decision model during the operational phase of a project. By operational phase, we mean the phase in which the system or set of policies which were earlier decided are deployed and put into practice. By making the decision model available to operational decision makers, they would have access to the arguments pro and con for a variety of actions and can thus make a more informed decision which balances the often conflicting criteria by which the value of action is measured. We also developed the concept of a 'monitored decision' in which metrics of performance were identified during the decision making process and used to evaluate the quality of that decision. It is important to monitor those decision which seem at highest risk of not meeting their stated objectives. Operational decisions are also potentially high risk decisions. Finally, we investigated the use of performance metrics for monitored decisions and audit logs of operational decisions in order to feed an evolutionary phase of the the life cycle. During evolution, decisions are revisisted, assumptions verified or refuted, and possible reassessments resulting in new policy are made. In this regard we implemented a machine learning algorithm which automatically defined business rules based on expert assessment of the quality of operational decisions as recorded during deployment.

Wild, Christian W.↗
DOE OSTI2015

Optimal Stop Word Selection for Text Mining in Critical Infrastructure Domain

Eliminating all stop words from the feature space is a standard practice of preprocessing in text mining, regardless of the domain which it is applied to. However, this may result in loss of important information, which adversely affects the accuracy of the text mining algorithm. Therefore, this paper proposes a novel methodology for selecting the optimal set of domain specific stop words for improved text mining accuracy. First, the presented methodology retains all the stop words in the text preprocessing phase. Then, an evolutionary technique is used to extract the optimal set of stop words that result in the best classification accuracy. The presented methodology was implemented on a corpus of open source news articles related to critical infrastructure hazards. The first step of mining geo-dependencies among critical infrastructures from text is text classification. In order to achieve this, article content was classified into two classes: 1) text content with geo-location information, and 2) text content without geo-location information. Classification accuracy presented methodology was compared to accuracies of four other test cases. Experimental results with 10-fold cross validation showed that the presented method yielded an increase of 1.76% or higher in True Positive (TP) rate and a 2.27% or higher increase in the True Negative (TN) rate compared to the other techniques.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Computational evolution of high-performing unfused non-fullerene acceptors for organic solar cells

Materials optimization for organic solar cells (OSCs) is a highly active field, with many approaches using empirical experimental synthesis, computational brute force to screen a subset of chemical space, or generative machine learning methods that often require significant training sets. While these methods may find high-performing materials, they can be inefficient and time-consuming. Genetic algorithms (GAs) are an alternative approach, allowing for the “virtual synthesis” of molecules and a prediction of their “fitness” for some property, with new candidates suggested based on good characteristics of previously generated molecules. In this work, a GA is used to discover high-performing unfused non-fullerene acceptors (NFAs) based on an empirical prediction of power conversion efficiency (PCE) and provides design rules for future work. The electron-withdrawing/donating strength, as well as the sequence and symmetry, of those units are examined. The utilization of a GA over a brute-force approach resulted in speedups up to 1.8 × 10 12 . New types of units, not frequently seen in OSCs, are suggested, and in total 5426 NFAs are discovered with the GA. Of these, 1087 NFAs are predicted to have a PCE greater than 18%, which is roughly the current record efficiency. While the symmetry of the sequence showed no correlation with PCE, analysis of the sequence arrangement revealed that higher performance can be achieved with a donor core and acceptor end groups. Future NFA designs should consider this strategy as an alternative to the current A-D-A'-D-A architecture.

14 SOLAR ENERGY↗
DOE OSTI2022

Improving DFIG performance under fault scenarios through evolutionary reinforcement learning based control

The double-fed induction generator (DFIG) usually experiences high rotor current and DC capacitor link voltage during system fault events. In this paper, a novel data-driven approach is proposed to enhance the DFIG performance under fault scenarios. An advanced reinforcement learning (RL) algorithm called guided surrogate-gradient-based evolution strategy (GSES) is used to control the DFIG power and capacitor DClink voltage by adjusting the optional reference signals. This controller is able to prevent the rotor of DFIG from overcurrent risk and maintain the grid-connected operation. The proposed GSES-based control algorithm was evaluated through simulations on a 3.6-MW DFIG in PSCAD/EMTDC software. Results have validated the effectiveness of the proposed GSESbased control algorithm in improving the DFIG performance under fault scenarios.

42 ENGINEERING↗
DOE OSTI2022

Evolutionary vs imitation learning for neuromorphic control at the edge*

Abstract Neuromorphic computing offers the opportunity to implement extremely low power artificial intelligence at the edge. Control applications, such as autonomous vehicles and robotics, are also of great interest for neuromorphic systems at the edge. It is not clear, however, what the best neuromorphic training approaches are for control applications at the edge. In this work, we implement and compare the performance of evolutionary optimization and imitation learning approaches on an autonomous race car control task using an edge neuromorphic implementation. We show that the evolutionary approaches tend to achieve better performing smaller network sizes that are well-suited to edge deployment, but they also take significantly longer to train. We also describe a workflow to allow for future algorithmic comparisons for neuromorphic hardware on control applications at the edge.

Schuman, Catherine↗
DOE OSTI2022

Vertex finding in neutrino-nucleus interaction: a model architecture comparison

We compare different neural network architectures for machine learning algorithms designed to identify the neutrino interaction vertex position in the MINERvA detector. The architectures developed and optimized by hand are compared with the architectures developed in an automated way using the package “Multi-node Evolutionary Neural Networks for Deep Learning” (MENNDL), developed at Oak Ridge National Laboratory. While the domain-expert hand-tuned network was the best performer, the differences were negligible and the auto-generated networks performed as well. There is always a trade-off between human, and computer resources for network optimization and this work suggests that automated optimization, assuming resources are available, provides a compelling way to save significant expert time.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2015

Extensive site-directed mutagenesis reveals interconnected functional units in the alkaline phosphatase active site

Enzymes enable life by accelerating reaction rates to biological timescales. Conventional studies have focused on identifying the residues that have a direct involvement in an enzymatic reaction, but these so-called ‘catalytic residues’ are embedded in extensive interaction networks. Although fundamental to our understanding of enzyme function, evolution, and engineering, the properties of these networks have yet to be quantitatively and systematically explored. We dissected an interaction network of five residues in the active site of Escherichia coli alkaline phosphatase. Analysis of the complex catalytic interdependence of specific residues identified three energetically independent but structurally interconnected functional units with distinct modes of cooperativity. From an evolutionary perspective, this network is orders of magnitude more probable to arise than a fully cooperative network. From a functional perspective, new catalytic insights emerge. Further, such comprehensive energetic characterization will be necessary to benchmark the algorithms required to rationally engineer highly efficient enzymes.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2018

Global land model development: time to shift from a plant functional type to a plant functional trait approach (Final Report)

This project advanced global land models by shifting from the current plant functional type approach to one that better utilizes what is known about the importance and variability of plant traits, within a framework of simultaneously improving fundamental physiological relations that are at the core of model carbon cycling algorithms. A primary goal for Earth system modeling is to make accurate predictions of the future trajectory of the climate system, based on a mechanistic understanding of processes regulating fluxes of mass and energy among system components. Land plays an important role in modifying the Earth’s mass and energy balance, as a critical link in the global cycling of carbon, among others. Land surface models have developed to include mechanistic representations of vegetation physiology, carbon and nutrient dynamics in plants and soils, how they might respond to changing climate and chemistry, and how those changes might feedback to influence changes in atmospheric greenhouse gases themselves. Existing models represent the global distribution of vegetation types using the Plant Functional Type concept. Plant Functional Types are classes of plant species with similar evolutionary and life history with presumably similar responses to environmental conditions like CO 2 , water and nutrient availability. Fixed properties for each Plant Functional Type are specified through a collection of physiological parameters, or traits. These traits, mostly physiological in nature (e.g., leaf nitrogen and longevity) are used in model algorithms to estimate ecosystem properties and/or drive calculated process rates. In most models, 5 to 15 functional types represent terrestrial vegetation; in essence, they assume there are a total of only 5 to 15 different kinds of plants on the entire globe. This assumption of constant plant traits captured within the functional type concept has serious limitations, as a single set of traits does not reflect trait variation observed within and between species and communities. While this simplification was necessary decades past, substantial improvement is now possible. Rather than assigning a small number of constant parameter values to all grid cells in a model, we developed procedures that predict a frequency distribution of values for any given grid cell. Thus, by incorporating the mean and variance model fidelity has been improved. The trait-based approach has improved land modeling by (1) incorporating patterns and heterogeneity of traits into model parameterization, thus evolving away from a framework that considers large areas of vegetation to have near identical trait values and (2) allowing for improved treatment of physiological responses to environmental drivers.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2014

Molecular clouds in the North American and Pelican Nebulae: structures

We present observations of a 4.25 deg{sup 2} area toward the North American and Pelican Nebulae in the J = 1-0 transitions of {sup 12}CO, {sup 13}CO, and C{sup 18}O. Three molecules show different emission areas with their own distinct structures. These different density tracers reveal several dense clouds with a surface density of over 500 M {sub ☉} pc{sup –2} and a mean H{sub 2} column density of 5.8, 3.4, and 11.9 × 10{sup 21} cm{sup –2} for {sup 12}CO, {sup 13}CO, and C{sup 18}O, respectively. We obtain a total mass of 5.4 × 10{sup 4} M {sub ☉} ({sup 12}CO), 2.0 × 10{sup 4} M {sub ☉} ({sup 13}CO), and 6.1 × 10{sup 3} M {sub ☉} (C{sup 18}O) in the complex. The distribution of excitation temperature shows two phases of gas: cold gas (∼10 K) spreads across the whole cloud; warm gas (>20 K) outlines the edge of the cloud heated by the W80 H II region. The kinetic structure of the cloud indicates an expanding shell surrounding the ionized gas produced by the H II region. There are six discernible regions in the cloud: the Gulf of Mexico, Caribbean Islands and Sea, and Pelican's Beak, Hat, and Neck. The areas of {sup 13}CO emission range within 2-10 pc{sup 2} with mass of (1-5) × 10{sup 3} M {sub ☉} and line width of a few km s{sup –1}. The different line properties and signs of star-forming activity indicate they are in different evolutionary stages. Four filamentary structures with complicated velocity features are detected along the dark lane in LDN 935. Furthermore, a total of 611 molecular clumps within the {sup 13}CO tracing cloud are identified using the ClumpFind algorithm. The properties of the clumps suggest that most of the clumps are gravitationally bound and at an early stage of evolution with cold and dense molecular gas.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS2003

Quantum Search in Hilbert Space

A proposed quantum-computing algorithm would perform a search for an item of information in a database stored in a Hilbert-space memory structure. The algorithm is intended to make it possible to search relatively quickly through a large database under conditions in which available computing resources would otherwise be considered inadequate to perform such a task. The algorithm would apply, more specifically, to a relational database in which information would be stored in a set of N complex orthonormal vectors, each of N dimensions (where N can be exponentially large). Each vector would constitute one row of a unitary matrix, from which one would derive the Hamiltonian operator (and hence the evolutionary operator) of a quantum system. In other words, all the stored information would be mapped onto a unitary operator acting on a quantum state that would represent the item of information to be retrieved. Then one could exploit quantum parallelism: one could pose all search queries simultaneously by performing a quantum measurement on the system. In so doing, one would effectively solve the search problem in one computational step. One could exploit the direct- and inner-product decomposability of the unitary matrix to make the dimensionality of the memory space exponentially large by use of only linear resources. However, inasmuch as the necessary preprocessing (the mapping of the stored information into a Hilbert space) could be exponentially expensive, the proposed algorithm would likely be most beneficial in applications in which the resources available for preprocessing were much greater than those available for searching.

Zak, Michail↗
DOE OSTI2018

Peer-to-Peer Energy Trading in a Prosumer-Based Community Microgrid: A Game-Theoretic Model

This paper proposes a novel game-theoretic model for peer-to-peer (P2P) energy trading among the prosumers in a community. The buyers can adjust the energy consumption behavior based on the price and quantity of the energy offered by the sellers. There exist two separate competitions during the trading process: 1) price competition among the sellers; and 2) seller selection competition among the buyers. The price competition among the sellers is modeled as a noncooperative game. The evolutionary game theory is used to model the dynamics of the buyers for selecting sellers. Moreover, an M-leader and N-follower Stackelberg game approach is used to model the interaction between buyers and sellers. Two iterative algorithms are proposed for the implementation of the games such that an equilibrium state exists in each of the games. The proposed method is applied to a small community microgrid with photo-voltaic and energy storage systems. Simulation results show the convergence of the algorithms and the effectiveness of the proposed model to handle P2P energy trading. The results also show that P2P energy trading provides significant financial and technical benefits to the community, and it is emerging as an alternative to cost-intensive energy storage systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

AlloSHP: deconvoluting single homeologous polymorphism for phylogenetic analysis of allopolyploids

Background The genomic and evolutionary study of allopolyploid organisms involves multiple copies of homeologous chromosomes, making their assembly, annotation, and phylogenetic analysis challenging. Bioinformatics tools and protocols have been developed to study polyploid genomes, but sometimes require the assembly of their genomes, or at least the genes, limiting their use. Results We have developed AlloSHP, a command-line tool for detecting and extracting single homeologous polymorphisms (SHPs) from the subgenomes of allopolyploid species. This tool integrates three main algorithms, WGA, VCF2ALIGNMENT and VCF2SYNTENY, and allows the detection of SHPs for the study of diploid-polyploid complexes with available diploid progenitor genomes, without assembling and annotating the genomes of the allopolyploids under study. AlloSHP has been validated on three diploid-polyploid plant complexes, Brachypodium, Brassica, and Triticum-Aegilops, and a set of synthetic hybrid yeasts and their progenitors of the genus Saccharomyces. The results and congruent phylogenies obtained from the four datasets demonstrate the potential of AlloSHP for the evolutionary analysis of allopolyploids with a wide range of ploidy and genome sizes. Conclusions AlloSHP combines the strategies of simultaneous mapping against multiple reference genomes and syntenic alignment of these genomes to call SHPs, using as input data a single VCF file and the reference genomes of the known or closest extant diploid progenitor species. This novel approach provides a valuable tool for the evolutionary study of allopolyploid species, both at the interspecific and intraspecific levels, allowing the simultaneous analysis of a large number of accessions and avoiding the complex process of assembling polyploid genomes.

Allopolyploids↗
NASA NTRS1986

Open system magnetic evolution of the taos plateau volcanic field, Northern New Mexico. I - The petrology and geochemistry of the servilleta basalt

MULTIFIT, an embodiment of the conceptual structure needed in modeling multisource and multiprocess magmatic systems, is described. This program, which uses familiar materials balance methodology and the equilibrium form of the Rayleigh equations, links evolutionary arrays, which is turn collectively relate the starting and final compositions of a given magmatic system. Moreover, MULTIFIT incorporates variations within major element data arrays; the linkage between them can be tested using an extension of the least squares algorithm, which selects the best branch point according to the minimum-sum-of-squared-residuals criterion. Advantages and disadvantages of the materials balance approach used in this program are discussed, an example is provided, and equations utilized by MULTIFIT are summarized. While MULTIFIT may not be the best approach for poorly constrained models involving partial melting for complex mixing, it may ultimately prove useful for ascertaining trace element partition coefficients in magnetic systems.

Dungan, M. A.↗
DOE OSTI2019

tRNA functional signatures classify plastids as late-branching cyanobacteria

Eukaryotes acquired the trait of oxygenic photosynthesis through endosymbiosis of the cyanobacterial progenitor of plastid organelles. Despite recent advances in the phylogenomics of Cyanobacteria, the phylogenetic root of plastids remains controversial. Although a single origin of plastids by endosymbiosis is broadly supported, recent phylogenomic studies are contradictory on whether plastids branch early or late within Cyanobacteria. One underlying cause may be poor fit of evolutionary models to complex phylogenomic data. Using Posterior Predictive Analysis, we show that recently applied evolutionary models poorly fit three phylogenomic datasets curated from cyanobacteria and plastid genomes because of heterogeneities in both substitution processes across sites and of compositions across lineages. To circumvent these sources of bias, we developed CYANO-MLP, a machine learning algorithm that consistently and accurately phylogenetically classifies (“phyloclassifies”) cyanobacterial genomes to their clade of origin based on bioinformatically predicted function-informative features in tRNA gene complements. Classification of cyanobacterial genomes with CYANO-MLP is accurate and robust to deletion of clades, unbalanced sampling, and compositional heterogeneity in input tRNA data. CYANO-MLP consistently classifies plastid genomes into a late-branching cyanobacterial sub-clade containing single-cell, starch-producing, nitrogen-fixing ecotypes, consistent with metabolic and gene transfer data. Phylogenomic data of cyanobacteria and plastids exhibit both site-process heterogeneities and compositional heterogeneities across lineages. These aspects of the data require careful modeling to avoid bias in phylogenomic estimation. Furthermore, we show that amino acid recoding strategies may be insufficient to mitigate bias from compositional heterogeneities. However, the combination of our novel tRNA-specific strategy with machine learning in CYANO-MLP appears robust to these sources of bias with high accuracy in phyloclassification of cyanobacterial genomes. CYANO-MLP consistently classifies plastids as late-branching Cyanobacteria, consistent with independent evidence from signature-based approaches and some previous phylogenetic studies.

59 BASIC BIOLOGICAL SCIENCES↗