Search NASA⌕ Search

SEARCH · Search NASA

Results for “evolutionary computation”

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 289 records · Page 16

Observational Effects of Magnetism in O Stars: Surface Nitrogen Abundances

Aims. We investigate the surface nitrogen content of the six magnetic O stars known to date as well as of the early B-type star Tau Sco.. We compare these abundances to predictions of evolutionary models to isolate the effects of magnetic field on the transport of elements in stellar interiors. Methods. We conduct a quantitative spectroscopic analysis of the ample stars with state-of-the-art atmosphere models. We rely on high signal-to-noise ratio, high resolution optical spectra obtained with ESPADONS at CFHT and NARVAL at TBL. Atmosphere models and synthetic spectra are computed with the code CMFGEN. Values of N/H together with their uncertainties are determined and compared to predictions of evolutionary models. Results. We find that the magnetic stars can be divided into two groups: one with stars displaying no N enrichment (one object); and one with stars most likely showing extra N enrichment (5 objects). For one star (Ori C) no robust conclusion can be drawn due to its young age. The star with no N enrichment is the one with the weakest magnetic field, possibly of dynamo origin. It might be a star having experienced strong magnetic braking under the condition of solid body rotation, but its rotational velocity is still relatively large. The five stars with high N content were probably slow rotators on the zero age main sequence, but they have surface N/H typical of normal O stars, indicating that the presence of a (probably fossil) magnetic field leads to extra enrichment. These stars may have a strong differential rotation inducing shear mixing. Our results shOuld be viewed as a basis on which new theoretical simulations can rely to better understand the effect of magnetism on the evolution of massive stars.

Martins, F.↗

Comparison of Computed and Measured Vortex Evolution for a UH-60A Rotor in Forward Flight

A Computational Fluid Dynamics (CFD) simulation using the Navier-Stokes equations was performed to determine the evolutionary and dynamical characteristics of the vortex flowfield for a highly flexible aeroelastic UH-60A rotor in forward flight. The experimental wake data were acquired using Particle Image Velocimetry (PIV) during a test of the fullscale UH-60A rotor in the National Full-Scale Aerodynamics Complex 40- by 80-Foot Wind Tunnel. The PIV measurements were made in a stationary cross-flow plane at 90 deg rotor azimuth. The CFD simulation was performed using the OVERFLOW CFD solver loosely coupled with the rotorcraft comprehensive code CAMRAD II. Characteristics of vortices captured in the PIV plane from different blades are compared with CFD calculations. The blade airloads were calculated using two different turbulence models. A limited spatial, temporal, and CFD/comprehensive-code coupling sensitivity analysis was performed in order to verify the unsteady helicopter simulations with a moving rotor grid system.

Evolution↗

Prediction of perovskite and other ternary oxide multilayers as mirrors for soft X-rays

Highlights: • Theoretical framework to identify optimal multilayers for high x-ray reflectivity. • Perovskite oxide multilayers are proposed as soft x-ray mirrors. • High soft x-ray reflectivity up to 33% are expected in perovskite multilayers. - Abstract: We propose multilayers of perovskite and related ternary oxides with a general formula of ABO{sub 3} as high reflectivity mirrors, especially for use in water window region (2.3–4.4 nm). The high reflectivity combinations of oxide multilayers were deduced using evolutionary search algorithms such as genetic algorithms, and the calculation speed was accelerated via parallel computing methods We also propose a figure of merit for X-ray reflectivity in periodic multilayers systems, which can simplify the future efforts on identifying material combinations, and the search through this multi-dimensional parameter space. The highest reflectivity value was found to be over 33% at 3.1 nm in the water window region. The effect of interface roughness was simulated and the decrease in reflectivity was found to be modest for practically achievable roughness values. This work establishes the foundation for future experimental and theoretical studies towards achieving high reflectivity x-ray mirrors of complex oxide multilayers.

36 MATERIALS SCIENCE↗

Blue straggler masses from pulsation properties. I. The case of NGC 6541

We used high spatial resolution images acquired with the Wide Field Camera 3 on board Hubble Space Telescope to probe the population of variable blue straggler stars (BSSs) in the central region of the poorly studied Galactic globular cluster NGC 6541. The time sampling of the acquired multiwavelength (F390W, F555W, and F814W) data allowed us to discover three WUMa stars and nine SX Phoenicis. Periods, mean magnitudes, and pulsation modes have been derived for the nine SX Phoenicis, and their masses have been estimated by using pulsation equations obtained from linear nonadiabatic models. We found masses in the range 1.0-1.1 M {sub ☉}, with an average value of 1.06 ± 0.09 M {sub ☉} (σ = 0.04), significantly in excess of the cluster main-sequence turn-off mass (∼0.75 M {sub ☉}). A mild trend between mass and luminosity seems also to be present. The computed pulsation masses turn out to be in very good agreement with the predictions of evolutionary tracks for single stars, indicating values in the range ∼1.0-1.2 M {sub ☉} for most of the BSS population, in agreement with what was discussed in a number of previous studies.

79 ASTRONOMY AND ASTROPHYSICS↗

The evolution of rotating stars. 1: Method and exploratory calculations for a 7 solar mass star

A method was developed which allows us to study the evolution of rotating stars beyond the main sequence stage. Four different cases of redistribution of angular momentum in an evolving star are considered. Evolutionary sequences for a 7 solar mass star, rotating according to these different cases, were computed from the ZAMS to the double shell source stage. Each sequence was begun with a (typical) equatorial velocity of 210 km/sec. On the main sequence, the effects of rotation are of minor importance. As the core contracts during later stages, important effects arise in all physically plausible cases. The outer regions of the cores approach critical velocities and develop unstable angular velocity distributions. The effects of these instabilities should significantly alter the subsequent evolution.

Endal, A. S.↗

NeoN: Neuromorphic Control for Autonomous Robotic Navigation

In this paper we describe the use of a new neuromorphic computing framework to implement the navigation system for a roaming, obstacle avoidance robot. Using a Dynamic Adaptive Neural Network Array (DANNA) structure, our TENNLab (Laboratory of Tennesseans Exploring Neural Networks) hardware/software co-design framework and evolutionary optimization (EO) as the training algorithm, we create, train, implement, and test a spiking neural network autonomous robot control system using an array of neuromorphic computing elements built on an FPGA. The simplicity and flexibility of the DANNA neuromorphic computing elements allow for sufficient scale and connectivity on a Xilinx Kintex-7 FPGA to support sensory input and motor control for a mobile robot to navigate a dynamically changing environment. We further describe how more complex capabilities can be added using the same platform, e.g. object identification and tracking.

Mitchell, J. Parker↗

Evolutionary design of smart analog circuits

This paper discusses the use of Evolvable Hardware (EHW) in automatic synthesis of electronic circuits for computational intelligence (CI) hardware.

evolvable hardware fuzzy logic reconfigurable devi↗

The 'Biologically-Inspired Computing' Column

The field of Biology changed dramatically in 1953, with the determination by Francis Crick and James Dewey Watson of the double helix structure of DNA. This discovery changed Biology for ever, allowing the sequencing of the human genome, and the emergence of a "new Biology" focused on DNA, genes, proteins, data, and search. Computational Biology and Bioinformatics heavily rely on computing to facilitate research into life and development. Simultaneously, an understanding of the biology of living organisms indicates a parallel with computing systems: molecules in living cells interact, grow, and transform according to the "program" dictated by DNA. Moreover, paradigms of Computing are emerging based on modelling and developing computer-based systems exploiting ideas that are observed in nature. This includes building into computer systems self-management and self-governance mechanisms that are inspired by the human body's autonomic nervous system, modelling evolutionary systems analogous to colonies of ants or other insects, and developing highly-efficient and highly-complex distributed systems from large numbers of (often quite simple) largely homogeneous components to reflect the behaviour of flocks of birds, swarms of bees, herds of animals, or schools of fish. This new field of "Biologically-Inspired Computing", often known in other incarnations by other names, such as: Autonomic Computing, Pervasive Computing, Organic Computing, Biomimetics, and Artificial Life, amongst others, is poised at the intersection of Computer Science, Engineering, Mathematics, and the Life Sciences. Successes have been reported in the fields of drug discovery, data communications, computer animation, control and command, exploration systems for space, undersea, and harsh environments, to name but a few, and augur much promise for future progress.

Hinchey, Mike↗

“Teamwork Makes the Dream Work”: Tribal Competition Evolutionary Search as a Surrogate for Free-Energy-Based Structural Predictions

Crystal structure prediction has been a grand challenge in material science owing to the large configurational space that one must explore. Evolutionary (genetic) algorithms coupled with first principles calculations are commonly used in crystal structure prediction to sample the ground and metastable states of materials based on configurational energies. However, crystal structure predictions at finite temperature (T), pressure (P), and composition (X) require a free-energy-based search that is often computationally expensive and tedious. Here in this paper, we introduce a new machine-learning workflow for structure prediction that is based on a concept inspired by the evolution of human tribes in primitive society. Our tribal genetic algorithm (GA) combines configurational sampling with evolutionary optimization to accurately predict entropically stabilized phases at finite (T, P, X), at a computational cost that is an order of magnitude smaller than that required for a free-energy-based search. In a departure from standard GA techniques, the populations of individuals are divided into multiple tribes based on a bond-order fingerprint, and genetic operations are modified to ensure that cluster configurations are sampled adequately to capture entropic contributions. Team competition introduced into the evolutionary process allows winning teams (representing a better set of individuals) to expand their sizes; this translates into a more expanded search of the phase space allowing us to explore solutions near possible global minimum. Each team explores a specific section of the structural phase space and avoids bias on solutions arising from the use of individual populations in a purely energy-based search. We demonstrate the efficacy of our approach by performing the structural prediction of a representative two-dimensional two-body system as well as Lennard-Jones clusters over a range of temperatures up to its melting point. Our approach outperforms the standard GA approaches and enables structural search under “real nonambient conditions” on both bulk systems and finite-sized clusters.

36 MATERIALS SCIENCE↗

In silico prediction of MOFs with high deliverable capacity or internal surface area

Metal–organic frameworks (MOFs) offer unprecedented atom-scale design and structural tunability, largely due to the vast number of possible organic linkers which can be utilized in their assembly. Exploration of this space of linkers allows identification of ranges of achievable material properties as well as discovery of optimal materials for a given application. Experimental exploration of the linker space has to date been quite limited due to the cost and complexity of synthesis, while high-throughput computational studies have mainly explored MOF materials based on known or readily available linkers. Here an evolutionary algorithm for de novo design of organic linkers for metal–organic frameworks is used to predict MOFs with either high methane deliverable capacity or methane accessible surface area. Known chemical reactions are applied in silico to a population of linkers to discover these MOFs. Through this design strategy, MOF candidates are found in the ten symmetric networks acs, cds, dia, hxg, lvt, nbo, pcu, rhr, sod, and tbo. Furthermore, the correlation between deliverable capacities and surface area is network dependent.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Multiobjective Hyperparameter Optimization for Deep Learning Interatomic Potential Training Using NSGA-II

Deep neural network (DNN) potentials are an emerging tool for simulation of dynamical atomistic systems, with the promise of quantum mechanical accuracy at speedups of 10000$\times$. As with other DNN methods, hyperparameters used during training can make a substantial difference in model accuracy, and optimal settings vary with dataset. To enable rapid tuning of hyperparameters for DNN potential training, we developed a scalable multiobjective optimization evolutionary algorithm for supercomputers and tested it on the Summit system at the Oak Ridge Leadership Computing Facility (OLCF). The multiobjective approach is required due to the coupling of two learned values defining the potential: the energy and force. Using a large-scale implementation of the NSGA-II algorithm adapted for training DNN potentials, we discovered several optimal multiobjective combinations, including best choices of activation functions, learning rate scaling scheme, and pairing of the two radial cutoffs used in the three dimensional descriptor function.

Coletti, Mark↗

The evolution of rotating stars. I - Method and exploratory calculations for a 7-solar-mass star

A method is developed which allows the evolution of rotating stars to be studied well beyond the main-sequence stage. Four different cases of redistribution of angular momentum in an evolving star are considered. Evolutionary sequences for a 7-solar-mass star, rotating according to these different cases, were computed from the zero-age main-sequence to the double-shell-source stage. Each sequence was begun with a (typical) equatorial rotational velocity of 210 km/s. On the main sequence, the effects of rotation are of minor importance. However, as the core contracts during later stages, important effects arise in all physically plausible cases. The outer regions of the cores approach critical velocities and develop unstable angular-velocity distributions. The effects of these instabilities should significantly alter the subsequent evolution.

Endal, A. S.↗

ARENA: Adversary-Resistant Evolving Neural Architectures

Neural networks are becoming the cornerstone for national security prediction tasks. However, designing them requires significant research and trial/error, as they have many hyperparameters, including their computation graph (“architecture”). Neural architecture search (NAS) employs secondary optimizers to search for architectures maximizing objectives like accuracy. Evolutionary algorithms (EAs) are the most used class of optimizer for NAS. However, existing Python libraries for writing EAs limit the complexity of experiments a user can design. In this project, we built ARENA, a Python framework that encodes complex, hyper-realistic EAs. ARENA collects detailed information as it runs and is flexible enough to encode non-EA search algorithms. We tested ARENA on 4 toy optimization problems by encoding 3 search algorithms for each—random search, an EA, and simulated annealing. We also designed an EA that performs NAS on the MNIST dataset. Our experiments suggest the potential for immediate mission impact through solving lab-wide optimization problems.

97 MATHEMATICS AND COMPUTING↗

A description and evaluation of TIMER: A time-based terminal flow-control concept

A description of a time-based ATC concept called TIMER (Traffic Intelligence for the Management of Efficient Runway-scheduling) and the results of a fast time and real time computer evaluation are presented. The concept was designed to improve the efficiency of extended terminal area operations (en route approach, transition, and terminal flight to the runway). TIMER integrates en route metering, fuel efficient cruise and profile descents, terminal sequencing and spacing together with computer-generated controller aids, in order to fully use runway capacity and improve efficiency of delay absorption. The concept, by using simplified aircraft models, accommodates both 4-D and non 4-D equipped aircraft and is designed for integration into the manual, voice linked ATC system in an evolutionary manner and still be able to accommodate proposed system upgrade features such as data link and further ground automation. Fast time and real time computer simulation results identify and show the effects and interactions of such key variables as horizon of control, metering fix and final approach delivery time errors, aircraft separation requirements, delay discounting, wind, flight technical error, and knowledge of aircraft final approach speed. The current ATC system has a runway interarrival-error standard deviation of approx. 26 seconds. Simulation results indicate that, with computer aiding, the runway interarrival-error standard deviation for non 4-D equipped traffic can be reduced to the region of 8 to 12 seconds if expected final approach speed is known; however, the reduction is only in the region of 16 to 20 seconds if expected final approach speed is unknown. Another major finding is that en route metering fix delivery-error standard deviation should be kept to less than a number somewhere between 35 to 45 seconds to achieve full runway capacity. This requirement implies the need for either airborne automation or assistance to the controller since the current manual performance in today's en route metering environment is in the order of 1.5 minutes.

Credeur, Leonard↗

NASA Tech Briefs, September 2006

Topics covered include: Improving Thermomechanical Properties of SiC/SiC Composites; Aerogel/Particle Composites for Thermoelectric Devices; Patches for Repairing Ceramics and Ceramic- Matrix Composites; Lower-Conductivity Ceramic Materials for Thermal-Barrier Coatings; An Alternative for Emergency Preemption of Traffic Lights; Vehicle Transponder for Preemption of Traffic Lights; Automated Announcements of Approaching Emergency Vehicles; Intersection Monitor for Traffic-Light-Preemption System; Full-Duplex Digital Communication on a Single Laser Beam; Stabilizing Microwave Frequency of a Photonic Oscillator; Microwave Oscillators Based on Nonlinear WGM Resonators; Pointing Reference Scheme for Free-Space Optical Communications Systems; High-Level Performance Modeling of SAR Systems; Spectral Analysis Tool 6.2 for Windows; Multi-Platform Avionics Simulator; Silicon-Based Optical Modulator with Ferroelectric Layer; Multiplexing Transducers Based on Tunnel-Diode Oscillators; Scheduling with Automated Resolution of Conflicts; Symbolic Constraint Maintenance Grid; Discerning Trends in Performance Across Multiple Events; Magnetic Field Solver; Computing for Aiming a Spaceborne Bistatic- Radar Transmitter; 4-Vinyl-1,3-Dioxolane-2-One as an Additive for Li-Ion Cells; Probabilistic Prediction of Lifetimes of Ceramic Parts; STRANAL-PMC Version 2.0; Micromechanics and Piezo Enhancements of HyperSizer; Single-Phase Rare-Earth Oxide/Aluminum Oxide Glasses; Tilt/Tip/Piston Manipulator with Base-Mounted Actuators; Measurement of Model Noise in a Hard-Wall Wind Tunnel; Loci-STREAM Version 0.9; The Synergistic Engineering Environment; Reconfigurable Software for Controlling Formation Flying; More About the Tetrahedral Unstructured Software System; Computing Flows Using Chimera and Unstructured Grids; Avoiding Obstructions in Aiming a High-Gain Antenna; Analyzing Aeroelastic Stability of a Tilt-Rotor Aircraft; Tracking Positions and Attitudes of Mars Rovers; Stochastic Evolutionary Algorithms for Planning Robot Paths; Compressible Flow Toolbox; Rapid Aeroelastic Analysis of Blade Flutter in Turbomachines; General Flow-Solver Code for Turbomachinery Applications; Code for Multiblock CFD and Heat-Transfer Computations; Rotating-Pump Design Code; Covering a Crucible with Metal Containing Channels; Repairing Fractured Bones by Use of Bioabsorbable Composites; Kalman Filter for Calibrating a Telescope Focal Plane; Electronic Absolute Cartesian Autocollimator; Fiber-Optic Gratings for Lidar Measurements of Water Vapor; Simulating Responses of Gravitational-Wave Instrumentation; SOFTC: A Software Correlator for VLBI; Progress in Computational Simulation of Earthquakes; Database of Properties of Meteors; Computing Spacecraft Solar-Cell Damage by Charged Particles; Thermal Model of a Current-Carrying Wire in a Vacuum; Program for Analyzing Flows in a Complex Network; Program Predicts Performance of Optical Parametric Oscillators; Processing TES Level-1B Data; Automated Camera Calibration; Tracking the Martian CO2 Polar Ice Caps in Infrared Images; Processing TES Level-2 Data; SmaggIce Version 1.8; Solving the Swath Segment Selection Problem; The Spatial Standard Observer; Less-Complex Method of Classifying MPSK; Improvement in Recursive Hierarchical Segmentation of Data; Using Heaps in Recursive Hierarchical Segmentation of Data; Tool for Statistical Analysis and Display of Landing Sites; Automated Assignment of Proposals to Reviewers; Array-Pattern-Match Compiler for Opportunistic Data Analysis; Pre-Processor for Compression of Multispectral Image Data; Compressing Image Data While Limiting the Effects of Data Losses; Flight Operations Analysis Tool; Improvement in Visual Target Tracking for a Mobile Robot; Software for Simulating Air Traffic; Automated Vectorization of Decision-Based Algorithms; Grayscale Optical Correlator Workbench; "One-Stop Shopping" for Ocean Remote-Sensing and Model Data; State Analysis Database Tool; Generating CAHV and CAHVOmages with Shadows in ROAMS; Improving UDP/IP Transmission Without Increasing Congestion; FORTRAN Versions of Reformulated HFGMC Codes; Program for Editing Spacecraft Command Sequences; Flight-Tested Prototype of BEAM Software; Mission Scenario Development Workbench; Marsviewer; Tool for Analysis and Reduction of Scientific Data; ASPEN Version 3.0; Secure Display of Space-Exploration Images; Digital Front End for Wide-Band VLBI Science Receiver; Multifunctional Tanks for Spacecraft; Lightweight, Segmented, Mostly Silicon Telescope Mirror; Assistant for Analyzing Tropical-Rain-Mapping Radar Data; and Anion-Intercalating Cathodes for High-Energy- Density Cells.

Source record↗

On Improving Efficiency of Differential Evolution for Aerodynamic Shape Optimization Applications

Differential Evolution (DE) is a simple and robust evolutionary strategy that has been provEn effective in determining the global optimum for several difficult optimization problems. Although DE offers several advantages over traditional optimization approaches, its use in applications such as aerodynamic shape optimization where the objective function evaluations are computationally expensive is limited by the large number of function evaluations often required. In this paper various approaches for improving the efficiency of DE are reviewed and discussed. Several approaches that have proven effective for other evolutionary algorithms are modified and implemented in a DE-based aerodynamic shape optimization method that uses a Navier-Stokes solver for the objective function evaluations. Parallelization techniques on distributed computers are used to reduce turnaround times. Results are presented for standard test optimization problems and for the inverse design of a turbine airfoil. The efficiency improvements achieved by the different approaches are evaluated and compared.

Madavan, Nateri K.↗

Can An Evolutionary Process Create English Text?

Critics of the conventional theory of biological evolution have asserted that while natural processes might result in some limited diversity, nothing fundamentally new can arise from 'random' evolution. In response, biologists such as Richard Dawkins have demonstrated that a computer program can generate a specific short phrase via evolution-like iterations starting with random gibberish. While such demonstrations are intriguing, they are flawed in that they have a fixed, pre-specified future target, whereas in real biological evolution there is no fixed future target, but only a complicated 'fitness landscape'. In this study, a significantly more sophisticated evolutionary scheme is employed to produce text segments reminiscent of a Charles Dickens novel. The aggregate size of these segments is larger than the computer program and the input Dickens text, even when comparing compressed data (as a measure of information content).

97 MATHEMATICS AND COMPUTING↗