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 361 records · Page 20

Artificial intelligence-driven approaches for materials design and discovery

Materials design is an important component of modern science and technology, yet traditional approaches rely heavily on trial and error and can be inefficient. Computational techniques, enhanced by modern artificial intelligence, have reshaped the landscape of designing new materials. Among these approaches, inverse design has shown great promise in designing materials that meet specific property requirements. Here, in this Review, we present key computational advances in materials design over the past few decades. We follow the evolution of relevant materials design techniques, from high-throughput forward machine learning methods and evolutionary algorithms, to advanced artificial intelligence strategies such as reinforcement learning and deep generative models. We highlight the paradigm shift from conventional screening approaches to inverse generation driven by deep generative models. Finally, we discuss current challenges and future perspectives of materials inverse design. This Review may serve as a brief guide to the approaches, progress and outlook of designing future functional materials with technological relevance.

computational methods↗

RG-CAT: Detection pipeline and catalogue of radio galaxies in the EMU pilot survey

Abstract We present source detection and catalogue construction pipelines to build the first catalogue of radio galaxies from the 270$\rm deg^2$pilot survey of the Evolutionary Map of the Universe (EMU-PS) conducted with the Australian Square Kilometre Array Pathfinder (ASKAP) telescope. The detection pipeline uses Gal-DINO computer vision networks (Gupta et al. 2024, PASA, 41, e001) to predict the categories of radio morphology and bounding boxes for radio sources, as well as their potential infrared host positions. The Gal-DINO network is trained and evaluated on approximately 5 000 visually inspected radio galaxies and their infrared hosts, encompassing both compact and extended radio morphologies. We find that the Intersection over Union (IoU) for the predicted and ground-truth bounding boxes is larger than 0.5 for 99% of the radio sources, and 98% of predicted host positions are within$3^{\prime \prime}$of the ground-truth infrared host in the evaluation set. The catalogue construction pipeline uses the predictions of the trained network on the radio and infrared image cutouts based on the catalogue of radio components identified using theSelavysource finder algorithm. Confidence scores of the predictions are then used to prioritiseSelavycomponents with higher scores and incorporate them first into the catalogue. This results in identifications for a total of 211 625 radio sources, with 201 211 classified as compact and unresolved. The remaining 10 414 are categorised as extended radio morphologies, including 582 FR-I, 5 602 FR-II, 1 494 FR-x (uncertain whether FR-I or FR-II), 2 375 R (single-peak resolved) radio galaxies, and 361 with peculiar and other rare morphologies. Each source in the catalogue includes a confidence score. We cross-match the radio sources in the catalogue with the infrared and optical catalogues, finding infrared cross-matches for 73% and photometric redshifts for 36% of the radio galaxies. The EMU-PS catalogue and the detection pipelines presented here will be used towards constructing catalogues for the main EMU survey covering the full southern sky.

Astronomy & Astrophysics↗

Is Betelgeuse the Outcome of a Past Merger?

We explore the possibility that the star α Orionis (Betelgeuse) is the outcome of a merger that occurred in a low-mass-ratio (q= $\mathcal{M}$ 2 /$\mathcal{M}$ 1 = 0.07–0.25) binary system some time in the past hundreds of thousands of years. To that goal, we present a simple analytical model to approximate the perturbed internal structure of a post-merger object following the coalescence of a secondary in the mass range 1–4 M ⊙ into the envelope of a 15–17 M ⊙ primary. We then compute the long-term evolution of post-merger objects for a grid of initial conditions and make predictions about their surface properties for evolutionary stages that are consistent with the observed location of Betelgeuse in the Hertzsprung–Russell diagram. We find that if a merger occurred after the end of the primary’s main-sequence phase, while it was expanding toward becoming a red supergiant star and typically with radius ∼200–300 R ⊙ , then its envelope is spun up to values that remain in a range consistent with Betelgeuse observations for thousands of years of evolution. We argue that the best scenario that can explain both the fast rotation of Betelgeuse and its observed large space velocity is one where a binary was dynamically ejected by its parent cluster a few million years ago and then subsequently merged. An alternative scenario in which the progenitor of Betelgeuse was spun up by accretion in a binary and released by the supernova explosion of the companion requires a finely tuned set of conditions but cannot be ruled out.

79 ASTRONOMY AND ASTROPHYSICS↗

Design Space Issues for Intrinsic Evolvable Hardware

This paper discuss the problem of increased programming time for intrinsic evolvable hardware (EHW) as the complexity of the circuit grows. We develop equations for the size of the population, n, and the number of generations required for the population to converge, ngen, based on L, the length of the programming string. We show that the processing time of the computer becomes negligible for intrinsic EHW since the selection/crossover/mutation steps are only done once per generation, suggesting there is room for use of more complex evolutionary algorithms m intrinsic EHW. F i y , we review the state of the practice and discuss the notion of a system design approach for intrinsic EHW.

Hereford, James↗

Feature Learning for Multispectral Satellite Imagery Classification Using Neural Architecture Search

Automated classification of remote sensing data is an integral tool for earth scientists, and deep learning has proven very successful at solving such problems. However, building deep learning models to process the data requires expert knowledge of machine learning. We introduce DELTA, a software toolkit to bridge this technical gap and make deep learning easily accessible to earth scientists. Visual feature engineering is a critical part of the machine learning lifecycle, and hence is a key area that will be automated by DELTA. Hand-engineered features can perform well, but require a cross functional team with expertise in both machine learning and the specific problem domain, which is costly in both researcher time and labor. The problem is more acute with multispectral satellite imagery, which requires considerable computational resources to process. In order to automate the feature learning process, a neural architecture search samples the space of asymmetric and symmetric autoencoders using evolutionary algorithms. Since denoising autoencoders have been shown to perform well for feature learning, the autoencoders are trained on various levels of noise and the features generated by the best performing autoencoders evaluated according to their performance on image classification tasks. The resulting features are demonstrated to be effective for Landsat-8 flood mapping, as well as benchmark datasets CIFAR10 and SVHN.

Robert Campbell↗

On-Sensor Data Filtering using Neuromorphic Computing for High Energy Physics Experiments

This work describes the investigation of neuromorphic computing-based spiking neural network (SNN) models used to filter data from sensor electronics in high energy physics experiments conducted at the High Luminosity Large Hadron Collider. We present our approach for developing a compact neuromorphic model that filters out the sensor data based on the particle's transverse momentum with the goal of reducing the amount of data being sent to the downstream electronics. The incoming charge waveforms are converted to streams of binary-valued events, which are then processed by the SNN. We present our insights on the various system design choices - from data encoding to optimal hyperparameters of the training algorithm - for an accurate and compact SNN optimized for hardware deployment. Our results show that an SNN trained with an evolutionary algorithm and an optimized set of hyperparameters obtains a signal efficiency of about 91% with nearly half as many parameters as a deep neural network.

R. Kulkarni, Shruti↗

The Effects of Surface Fossil Magnetic Fields on Massive Star Evolution: IV. Grids of Models at Solar, LMC, and SMC Metallicities

Magnetic fields can drastically change predictions of evolutionary models of massive stars via mass-loss quenching, magnetic braking, and efficient angular momentum transport, which we aim to quantify in this work. We use the MESA software instrument to compute an e xtensiv e main-sequence grid of stellar structure and evolution models, as well as isochrones, accounting for the effects attributed to a surface fossil magnetic field. The grid is densely populated in initial mass (3–60 M ), surface equatorial magnetic field strength (0–50 kG), and metallicity (representative of the Solar neighbourhood and the Magellanic Clouds). We use two magnetic braking and two chemical mixing schemes and compare the model predictions for slowly rotating, nitrogen- enriched (‘Group 2’) stars with observations in the Large Magellanic Cloud. We quantify a range of initial field strengths that allow for producing Group 2 stars and find that typical values (up to a few kG) lead to solutions. Between the subgrids, we find notable departures in surface abundances and evolutionary paths. In our magnetic models, chemical mixing is al w ays less efficient compared to non-magnetic models due to the rapid spin-down. We identify that quasi-chemically homogeneous main sequence evolution by efficient mixing could be prevented by fossil magnetic fields. We recommend comparing this grid of evolutionary models with spectropolarimetric and spectroscopic observations with the goals of (i) revisiting the derived stellar parameters of known magnetic stars, and (ii) observationally constraining the uncertain magnetic braking and chemical mixing schemes.

stars: abundances↗

Homologous recombination shapes the architecture and evolution of bacterial genomes

Homologous recombination is a key evolutionary force that varies considerably across bacterial species. However, how the landscape of homologous recombination varies across genes and within individual genomes has only been studied in a few species. Here, we used Approximate Bayesian Computation to estimate the recombination rate along the genomes of 145 bacterial species. Our results show that homologous recombination varies greatly along bacterial genomes and shapes many aspects of genome architecture and evolution. The genomic landscape of recombination presents several key signatures: rates are highest near the origin of replication in most species, patterns of recombination generally appear symmetrical in both replichores (i.e. replicational halves of circular chromosomes) and most species have genomic hotspots of recombination. Furthermore, many closely related species share conserved landscapes of recombination across orthologs indicating that recombination landscapes are conserved over significant evolutionary distances. We show evidence that recombination drives the evolution of GC-content through increasing the effectiveness of selection and not through biased gene conversion, thereby contributing to an ongoing debate. Finally, we demonstrate that the rate of recombination varies across gene function and that many hotspots of recombination are associated with adaptive and mobile regions often encoding genes involved in pathogenicity.

Torrance, Ellis L [University of North Carolina, G↗

Computational Systems Biology

Computational systems biology is the term that we use to describe computational methods to identify, infer, model, and store relationships between the molecules, pathways, and cells (“systems”) involved in a living organism. Based on this definition, the field of computational systems biology has been in existence for some time. However, the recent confluence of high throughput methodology for biological data gathering, genome-scale sequencing and computational processing power has driven a reinvention and expansion of this field. The expansions include not only modeling of small metabolic{Ishii, 2004 #1129; Ekins, 2006 #1601; Lafaye, 2005 #1744} and signaling systems{Stevenson-Paulik, 2006 #1742; Lafaye, 2005 #1744} but also modeling of the relationships between biological components in very large systems, incluyding whole cells and organisms {Ideker, 2001 #1124; Pe'er, 2001 #1172; Pilpel, 2001 #393; Ideker, 2002 #327; Kelley, 2003 #1117; Shannon, 2003 #1116; Ideker, 2004 #1111}{Schadt, 2003 #475; Schadt, 2006 #1661}{McDermott, 2002 #878; McDermott, 2005 #1271}. Generally these models provide a general overview of one or more aspects of these systems and leave the determination of details to experimentalists focused on smaller subsystems. The promise of such approaches is that they will elucidate patterns, relationships and general features that are not evident from examining specific components or subsystems. These predictions are either interesting in and of themselves (for example, the identification of an evolutionary pattern), or are interesting and valuable to researchers working on a particular problem (for example highlight a previously unknown functional pathway). Two events have occurred to bring about the field computational systems biology to the forefront. One is the advent of high throughput methods that have generated large amounts of information about particular systems in the form of genetic studies, gene expression analyses (both protein and mRNA) and metabolomics. With such tools, research to consider systems as a whole are being conceived, planned and implemented experimentally on an ever more frequent and wider scale. The other is the growth of computational processing power and tools. Methods to analyze large data sets of this kind are often computationally demanding and, as is the case in other areas, the field has benefited from continuing improvements in computational hardware and methods. The field of computational biology is very much like a telescope with two sequential lenses: one lens represents the biological data and the other represents a computational and/or mathematical model of the data. Both lenses must be properly coordinated to yield an image that reflects biological reality. This means that the design parameters for both lenses must be designed in concert to create a system that yields a model of the organism that provides both predictive and mechanistic information. The chapters in this book describe the construction of subcomponents of such a system. Computational systems biology is a rapidly evolving field and no single group of investigators has yet developed a compete system that integrates both data generation and data analysis in such a way so as to allow full and accurate modeling of any single biological organism. However, the field is rapidly moving in that direction. The chapters in this book represent a snapshot of the current methods being developed and used in the area of computational systems biology. Each method or database described within represents one or more steps on the path to a complete description of a biological system. How these tools will evolve and ultimately be integrated is an area of intense research and interest. We hope that readers of this book will be motivated by the chapters within and become involved in this exciting area of research.

59 BASIC BIOLOGICAL SCIENCES↗

The Populus ARBORKNOX1 homeodomain transcription factor regulates woody growth through binding to evolutionarily conserved target genes of diverse function

Summary The class I KNOX homeodomain transcription factor ARBORKNOX1 (ARK1) is a key regulator of vascular cambium maintenance and cell differentiation in Populus . Currently, basic information is lacking concerning the distribution, functional characteristics, and evolution of ARK1 binding in the Populus genome. Here, we used chromatin immunoprecipitation sequencing (ChIP‐seq) technology to identify ARK1 binding loci genome‐wide in Populus . Computational analyses evaluated the distribution of ARK1 binding loci, the function of genes associated with bound loci, the effect of ARK1 binding on transcript levels, and evolutionary conservation of ARK1 binding loci. ARK1 binds to thousands of loci which are highly enriched proximal to the transcriptional start sites of genes of diverse functions. ARK1 target genes are significantly enriched in paralogs derived from the whole‐genome salicoid duplication event. Both ARK1 and a maize ( Zea mays ) homolog, KNOTTED1, preferentially target evolutionarily conserved genes. However, only a small portion of ARK1 target genes are significantly differentially expressed in an ARK1 over‐expression mutant. This study describes the functional characteristics and evolution of DNA binding by a transcription factor in an undomesticated tree, revealing complexities similar to those shown for transcription factors in model animal species.

Liu, Lijun↗

Angular momentum fluctuations in the convective helium shell of massive stars

We find significant fluctuations of angular momentum within the convective helium shell of a pre-collapse massive star—a core-collapse supernova progenitor—that may facilitate the formation of accretion disks and jets that can explode the star. The convective flow in our model of an evolved M{sub ZAMS}=15M{sub ⊙} star, computed using the subsonic hydrodynamic solver MAESTRO, contains entire shells with net angular momentum in different directions. This phenomenon may have important implications for the late evolutionary stages of massive stars and for the dynamics of core collapse.

79 ASTRONOMY AND ASTROPHYSICS↗

Oxygen-enhanced models for globular cluster stars. III - Horizontal-branch sequences

A large grid of horizontal-branch (HB) evolutionary sequences which have been calculated with core expansion and semiconvection and with enhanced oxygen composition are presented and described. Tracks for 10 different metallicities are computed; they range from (Fe/H) = -0.47 to -2.26 and comprise a total of 115 sequences. The evolution is traced from the zero-age horizontal-branch (ZAHB) to the lower AGB at a point where log L/solar luminosity = 2.25. All of the sequences are illustrated on both the theoretical H-R diagram and on the B, V color-magnitude diagram. A complete set of tables for the ZAHB models and a representative sample of tabulations of the track parameters are provided. The phenomena which control HB evolution morphology, and existing certainties in theoretical HB models are discussed.

Dorman, Ben↗

Automating software design system DESTA

'DESTA' is the acronym for the Dialogue Evolutionary Synthesizer of Turnkey Algorithms by means of a natural language (Russian or English) functional specification of algorithms or software being developed. DESTA represents the computer-aided and/or automatic artificial intelligence 'forgiving' system which provides users with software tools support for algorithm and/or structured program development. The DESTA system is intended to provide support for the higher levels and earlier stages of engineering design of software in contrast to conventional Computer Aided Design (CAD) systems which provide low level tools for use at a stage when the major planning and structuring decisions have already been taken. DESTA is a knowledge-intensive system. The main features of the knowledge are procedures, functions, modules, operating system commands, batch files, their natural language specifications, and their interlinks. The specific domain for the DESTA system is a high level programming language like Turbo Pascal 6.0. The DESTA system is operational and runs on an IBM PC computer.

Lovitsky, Vladimir A.↗

Intelligent systems technology infrastructure for integrated systems

Significant advances have occurred during the last decade in intelligent systems technologies (a.k.a. knowledge-based systems, KBS) including research, feasibility demonstrations, and technology implementations in operational environments. Evaluation and simulation data obtained to date in real-time operational environments suggest that cost-effective utilization of intelligent systems technologies can be realized for Automated Rendezvous and Capture applications. The successful implementation of these technologies involve a complex system infrastructure integrating the requirements of transportation, vehicle checkout and health management, and communication systems without compromise to systems reliability and performance. The resources that must be invoked to accomplish these tasks include remote ground operations and control, built-in system fault management and control, and intelligent robotics. To ensure long-term evolution and integration of new validated technologies over the lifetime of the vehicle, system interfaces must also be addressed and integrated into the overall system interface requirements. An approach for defining and evaluating the system infrastructures including the testbed currently being used to support the on-going evaluations for the evolutionary Space Station Freedom Data Management System is presented and discussed. Intelligent system technologies discussed include artificial intelligence (real-time replanning and scheduling), high performance computational elements (parallel processors, photonic processors, and neural networks), real-time fault management and control, and system software development tools for rapid prototyping capabilities.

Lum, Henry, Jr.↗

Annual Research Briefs - 2000: Center for Turbulence Research

This report contains the 2000 annual progress reports of the postdoctoral Fellows and visiting scholars of the Center for Turbulence Research (CTR). It summarizes the research efforts undertaken under the core CTR program. Last year, CTR sponsored sixteen resident Postdoctoral Fellows, nine Research Associates, and two Senior Research Fellows, hosted seven short term visitors, and supported four doctoral students. The Research Associates are supported by the Departments of Defense and Energy. The reports in this volume are divided into five groups. The first group largely consists of the new areas of interest at CTR. It includes efficient algorithms for molecular dynamics, stability in protoplanetary disks, and experimental and numerical applications of evolutionary optimization algorithms for jet flow control. The next group of reports is in experimental, theoretical, and numerical modeling efforts in turbulent combustion. As more challenging computations are attempted, the need for additional theoretical and experimental studies in combustion has emerged. A pacing item for computation of nonpremixed combustion is the prediction of extinction and re-ignition phenomena, which is currently being addressed at CTR. The third group of reports is in the development of accurate and efficient numerical methods, which has always been an important part of CTR's work. This is the tool development part of the program which supports our high fidelity numerical simulations in such areas as turbulence in complex geometries, hypersonics, and acoustics. The final two groups of reports are concerned with LES and RANS prediction methods. There has been significant progress in wall modeling for LES of high Reynolds number turbulence and in validation of the v(exp 2) - f model for industrial applications.

Source record↗

Rapid evolution of cis-regulatory sequences via local point mutations

Although the evolution of protein-coding sequences within genomes is well understood, the same cannot be said of the cis-regulatory regions that control transcription. Yet, changes in gene expression are likely to constitute an important component of phenotypic evolution. We simulated the evolution of new transcription factor binding sites via local point mutations. The results indicate that new binding sites appear and become fixed within populations on microevolutionary timescales under an assumption of neutral evolution. Even combinations of two new binding sites evolve very quickly. We predict that local point mutations continually generate considerable genetic variation that is capable of altering gene expression.

Non-NASA Center↗

Virtual Machine Language 2.1

VML (Virtual Machine Language) is an advanced computing environment that allows spacecraft to operate using mechanisms ranging from simple, time-oriented sequencing to advanced, multicomponent reactive systems. VML has developed in four evolutionary stages. VML 0 is a core execution capability providing multi-threaded command execution, integer data types, and rudimentary branching. VML 1 added named parameterized procedures, extensive polymorphism, data typing, branching, looping issuance of commands using run-time parameters, and named global variables. VML 2 added for loops, data verification, telemetry reaction, and an open flight adaptation architecture. VML 2.1 contains major advances in control flow capabilities for executable state machines. On the resource requirements front, VML 2.1 features a reduced memory footprint in order to fit more capability into modestly sized flight processors, and endian-neutral data access for compatibility with Intel little-endian processors. Sequence packaging has been improved with object-oriented programming constructs and the use of implicit (rather than explicit) time tags on statements. Sequence event detection has been significantly enhanced with multi-variable waiting, which allows a sequence to detect and react to conditions defined by complex expressions with multiple global variables. This multi-variable waiting serves as the basis for implementing parallel rule checking, which in turn, makes possible executable state machines. The new state machine feature in VML 2.1 allows the creation of sophisticated autonomous reactive systems without the need to develop expensive flight software. Users specify named states and transitions, along with the truth conditions required, before taking transitions. Transitions with the same signal name allow separate state machines to coordinate actions: the conditions distributed across all state machines necessary to arm a particular signal are evaluated, and once found true, that signal is raised. The selected signal then causes all identically named transitions in all present state machines to be taken simultaneously. VML 2.1 has relevance to all potential space missions, both manned and unmanned. It was under consideration for use on Orion.

Riedel, Joseph E.↗

Telemetry-Based Ranging

A telemetry-based ranging scheme was developed in which the downlink ranging signal is eliminated, and the range is computed directly from the downlink telemetry signal. This is the first Deep Space Network (DSN) ranging technology that does not require the spacecraft to transmit a separate ranging signal. By contrast, the evolutionary ranging techniques used over the years by NASA missions, including sequential ranging (transmission of a sequence of sinusoids) and PN-ranging (transmission of a pseudo-noise sequence) whether regenerative (spacecraft acquires, then regenerates and retransmits a noise-free ranging signal) or transparent (spacecraft feeds the noisy demodulated uplink ranging signal into the downlink phase modulator) relied on spacecraft power and bandwidth to transmit an explicit ranging signal. The state of the art in ranging is described in an emerging CCSDS (Consultative Committee for Space Data Systems) standard, in which a pseudo-noise (PN) sequence is transmitted from the ground to the spacecraft, acquired onboard, and the PN sequence is coherently retransmitted back to the ground, where a delay measurement is made between the uplink and downlink signals. In this work, the telemetry signal is aligned with the uplink PN code epoch. The ground station computes the delay between the uplink signal transmission and the received downlink telemetry. Such a computation is feasible because symbol synchronizability is already an integral part of the telemetry design. Under existing technology, the telemetry signal cannot be used for ranging because its arrival-time information is not coherent with any Earth reference signal. By introducing this coherence, and performing joint telemetry detection and arrival-time estimation on the ground, a high-rate telemetry signal can provide all the precision necessary for spacecraft ranging.

Hamkins, Jon↗