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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Study for material analogs of FeSb 2 : Material design for thermoelectric materials

Using the ab initio evolutionary algorithm (implemented in uspex) and electronic structure calculations we investigate the properties of a new thermoelectric material FeSbAs, which is a material analog of the enigmatic thermoelectric FeSb 2 . We utilize the density functional theory and the Gutzwiller method to check the energetics. We find that FeSbAs can be made thermodynamically stable above ~ 30 GPa. We investigate the electronic structure and thermoelectric properties of FeSbAs based on the density functional theory and compare with those of FeSb 2 . Above 50 K, FeSbAs has higher Seebeck coefficients than FeSb 2 . Upon doping, the figure of merit becomes larger for FeSbAs than for FeSb 2 . Another material analog FeSbP, was also investigated, and found thermodynamically unstable even at very high pressure. Regarding FeSb 2 as a member of a family of compounds (FeSb 2 , FeSbAs, and FeSbP) we elucidate what are the chemical handles that control the gaps in this series. Here, we also investigate solubility (As or P for Sb in FeSb 2 ) we found As to be more soluble. Finally, we study a two-band model for thermoelectric properties and find that the temperature dependent chemical potential and the presence of the ionized impurities are important to explain the extremum in the Seebeck coefficient exhibited in experiments for FeSb 2 .

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Two-dimensional Dirac semimetal based on the alkaline earth metal CaP 3

Using an evolutionary algorithm in combination with first-principles density-functional theory calculations, we identify a two-dimensional (2D) CaP 3 monolayer as a new Dirac semimetal due to inversion and nonsymmorphic spatial symmetries of the structure. This new topological material, composed of light elements, exhibits high structural stability (higher than the phase known in the literature), which is confirmed by thermodynamic and kinetic stability analysis. Moreover, it satisfies the electron filling criteria, so that its Dirac state is located near the Fermi level. The existence of the Dirac state predicted by the theoretical symmetry analysis is also confirmed by first-principles electronic band structure calculations. We find that the energy position of the Dirac state can be tuned by strain, while the Dirac state is unstable against an external electric field since it breaks the spatial inversion symmetry. In conclusion, our findings should be instrumental in the development of 2D Dirac fermions based on light elements for their application in nanoelectronic devices and topological electronics.

2-dimensional systems↗
DOE OSTI2024

A science-driven approach to optimize the design for a biological small-angle neutron scattering instrument

Biological small-angle neutron scattering (SANS) instruments facilitate critical analysis of the structure and dynamics of complex biological systems. However, with the growth of experimental demands and the advances in optical systems design, a new neutron optical concept is necessary to overcome the limitations of current instruments. This work presents an approach to include experimental objectives ( i.e. the science to be supported by a specific neutron scattering instrument) in the optimization of the neutron optical concept. The approach for a proposed SANS instrument at the Second Target Station of the Spallation Neutron Source at Oak Ridge National Laboratory, USA, is presented here. Further, the instrument is simulated with the McStas software package. The optimization process is driven by an evolutionary algorithm using McStas output data, which are processed to calculate an objective function designed to quantify the expected performance of the simulated neutron optical configuration for the intended purpose. Each McStas simulation covers the complete instrument, from source to detector, including realistic sample scattering functions. This approach effectively navigates a high-dimensional parameter space that is otherwise intractable; it allows the design of next-generation SANS instruments to address specific scientific cases and has the potential to increase instrument performance compared with traditional design approaches.

47 OTHER INSTRUMENTATION↗
DOE OSTI2017

Confocal depth-resolved fluorescence micro-X-ray absorption spectroscopy for the study of cultural heritage materials: a new mobile endstation at the Beijing Synchrotron Radiation Facility

A confocal fluorescence endstation for depth-resolved micro-X-ray absorption spectroscopy is described. A polycapillary half-lens defines the incident beam path and a second polycapillary half-lens at 90° defines the probe sample volume. An automatic alignment program based on an evolutionary algorithm is employed to make the alignment procedure efficient. This depth-resolved system was examined on a general X-ray absorption spectroscopy (XAS) beamline at the Beijing Synchrotron Radiation Facility. Sacrificial red glaze (AD 1368–1644) china was studied to show the capability of the instrument. As a mobile endstation to be applied on multiple beamlines, the confocal system can improve the function and flexibility of general XAS beamlines, and extend their capabilities to a wider user community.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2019

Evolving Larger Convolutional Layer Kernel Sizes for a Settlement Detection Deep-Learner on Summit

Deep-learner hyper-parameters, such as kernel sizes, batch sizes, and learning rates, can significantly influence the quality of trained models. The state of the art for finding optimal hyper-parameters generally uses a brute force, grid search approach, random search, or Bayesian-based optimization among other techniques. We applied an evolutionary algorithm to optimize kernel sizes for a convolutional neural network used to detect settlements in satellite imagery. Usually convolutional layer kernel sizes are small - typically one, three, or five - but we found that the system converged at, or near, kernel sizes of nine for the last convolutional layer, and that this occurred for multiple runs using two different datasets. Moreover, the larger kernel sizes had fewer false positives than the 3x3 kernel sizes found as optimal via a brute force uniform grid search. This suggests that this large kernel size may be leveraging patterns found in larger areal features in the source imagery, and that this may be generalized as possible guidance for similar remote sensing deep-learning tasks.

Coletti, Mark↗
DOE OSTI2026

Predicting Band-Gap of Inorganic Materials Using Neuromorphic Graph Learning

Predicting properties of inorganic materials is a heavily researched topic, with several new prediction approaches emerging as competitors. One such competitor is graph neural networks, which leverage the structure of the graph to aid in the prediction process. In this work, we propose integration of neuromorphic computation into the graph neural network pipeline. We call this approach Neuromorphic Graph Learning (NGL). We utilize the NGL approach to leverage evolutionary algorithms and a novel Spike Pipeline for Raster Analysis (SPIRE) for the prediction of band gap in inorganic materials.

Mulet, Ian [University of Tennessee (UT)]↗
DOE OSTI2017

Evolving bipartite authentication graph partitions

As large scale enterprise computer networks become more ubiquitous, finding the appropriate balance between user convenience and user access control is an increasingly challenging proposition. Suboptimal partitioning of users’ access and available services contributes to the vulnerability of enterprise networks. Previous edge-cut partitioning methods unduly restrict users’ access to network resources. This paper introduces a novel method of network partitioning superior to the current state-of-the-art which minimizes user impact by providing alternate avenues for access that reduce vulnerability. Networks are modeled as bipartite authentication access graphs and a multi-objective evolutionary algorithm is used to simultaneously minimize the size of large connected components while minimizing overall restrictions on network users. Lastly, results are presented on a real world data set that demonstrate the effectiveness of the introduced method compared to previous naive methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Identifying Vulnerabilities and Hardening Attack Graphs for Networked Systems

We investigate efficient security control methods for protecting against vulnerabilities in networked systems. A large number of interdependent vulnerabilities typically exist in the computing nodes of a cyber-system; as vulnerabilities get exploited, starting from low level ones, they open up the doors to more critical vulnerabilities. These cannot be understood just by a topological analysis of the network, and we use the attack graph abstraction of Dewri et al. to study these problems. In contrast to earlier approaches based on heuristics and evolutionary algorithms, we study rigorous methods for quantifying the inherent vulnerability and hardening cost for the system. We develop algorithms with provable approximation guarantees, and evaluate them for real and synthetic attack graphs.

attack graphs↗
DOE OSTI2019

Multi-Objective Optimization for Size and Resilience of Spiking Neural Networks

Inspired by the connectivity mechanisms in the brain, neuromorphic computing architectures model Spiking Neural Networks (SNNs) in silicon. As such, neuromorphic architectures are designed and developed with the goal of having small, low power chips that can perform control and machine learning tasks. However, the power consumption of the developed hardware can greatly depend on the size of the network that is being evaluated on the chip. Furthermore, the accuracy of a trained SNN that is evaluated on chip can change due to voltage and current variations in the hardware that perturb the learned weights of the network. While efforts are made on the hardware side to minimize those perturbations, a software based strategy to make the deployed networks more resilient can help further alleviate that issue. In this work, we study Spiking Neural Networks in two neuromorphic architecture implementations with the goal of decreasing their size, while at the same time increasing their resiliency to hardware faults. We leverage an evolutionary algorithm to train the SNNs and propose a multiobjective fitness function to optimize the size and resiliency of the SNN. We demonstrate that this strategy leads to well-performing, small-sized networks that are more resilient to hardware faults.

Dimovska, Mihaela↗
DOE OSTI2014

WE-E-17A-07: Patient-Specific Mathematical Neuro-Oncology: Biologically-Informed Radiation Therapy and Imaging Physics

Purpose: To demonstrate a method of generating patient-specific, biologically-guided radiation therapy (RT) plans and to quantify and predict response to RT in glioblastoma. We investigate the biological correlates and imaging physics driving T2-MRI based response to radiation therapy using an MRI simulator. Methods: We have integrated a patient-specific biomathematical model of glioblastoma proliferation, invasion and radiotherapy with a multiobjective evolutionary algorithm for intensity-modulated RT optimization to construct individualized, biologically-guided plans. Patient-individualized simulations of the standard-of-care and optimized plans are compared in terms of several biological metrics quantified on MRI. An extension of the PI model is used to investigate the role of angiogenesis and its correlates in glioma response to therapy with the Proliferation-Invasion-Hypoxia- Necrosis-Angiogenesis model (PIHNA). The PIHNA model is used with a brain tissue phantom to predict tumor-induced vasogenic edema, tumor and tissue density that is used in a multi-compartmental MRI signal equation for generation of simulated T2- weighted MRIs. Results: Applying a novel metric of treatment response (Days Gained) to the patient-individualized simulation results predicted that the optimized RT plans would have a significant impact on delaying tumor progression, with Days Gained increases from 21% to 105%. For the T2- MRI simulations, initial validation tests compared average simulated T2 values for white matter, tumor, and peripheral edema to values cited in the literature. Simulated results closely match the characteristic T2 value for each tissue. Conclusion: Patient-individualized simulations using the combination of a biomathematical model with an optimization algorithm for RT generated biologically-guided doses that decreased normal tissue dose and increased therapeutic ratio with the potential to improve survival outcomes for treatment of glioblastoma. Simulated T2-MRI is shown to be consistent with known physics of MRI and can be used to further investigate biological drivers of imaging-based response to RT.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2023

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↗
DOE OSTI2015

Autotune

The Autotune software code uses an island-based evolutionary algorithm to solve multi-objective optimization problems. For the code provided, this has been applied to the whole-building simulation engine EnergyPlus to allow a software description of a building to be calibrated to measured data.

Joshua New, AaronGarrett↗
DOE OSTI2019

Behavior, Energy, Autonomy, Mobility Modeling Framework

The Behavior, Energy, Autonomy, and Mobility (BEAM) model is an integrated, agent-based travel demand simulation framework. Individual agents express preferences through a utility-maximizing evolutionary algorithm that minimizes each individual's cost and time spent traveling via diverse modal options, including the competition for scarce supply resources such as parking spaces and charging infrastructure. BEAM simulates the essential elements that compose a dynamic transportation system. From the road network, parking and charging infrastructure, to the transit system and a synthetic population with plans and preferences, the virtual system is an amalgamation of multiple spatially resolved layers that together represent an integrated transportation system. BEAM is an extension to the MATSim (Multi-Agent Transportation Simulation) model, where agents employ reinforcement learning across successive simulated days to maximize their personal utility through plan mutation (exploration) and selecting between previously executed plans (exploitation). The BEAM model shifts some of the behavioral emphasis in MATSim from across-day planning to within-day planning, where agents dynamically respond to the state of the system during the mobility simulation. In BEAM, agents can plan across all major modes of travel including driving, walking, biking, transit, and demand-responsive ride hailing.

Bae, Sangjae↗
DOE OSTI2024

Behavior, Energy, Autonomy, Mobility Modeling Framework (BEAM) v1.0

The Behavior, Energy, Autonomy, and Mobility (BEAM) model is an integrated, agent-based travel demand simulation framework. Individual agents express preferences through a utility- maximizing evolutionary algorithm that minimizes each individual’s cost and time spent traveling via diverse modal options, including the competition for scarce supply resources such as parking spaces and charging infrastructure. BEAM simulates the essential elements that compose a dynamic transportation system. From the road network, parking and charging infrastructure, to the transit system and a synthetic population with plans and preferences, the virtual system is an amalgamation of multiple spatially resolved layers that together represent an integrated transportation system. BEAM is an extension to the MATSim (Multi-Agent Transportation Simulation) model, where agents employ reinforcement learning across successive simulated days to maximize their personal utility through plan mutation (exploration) and selecting between previously executed plans (exploitation). The BEAM model shifts some of the behavioral emphasis in MATSim from across-day planning to within- day planning, where agents dynamically respond to the state of the system during the mobility simulation. In BEAM, agents can plan across all major modes of travel including driving, walking, biking, transit, and demand-responsive ride hailing. It is designed to integrate with other open source transportation models, such as ActivitySim.

Lazarus, Jessica↗
DOE OSTI2015

Guided design of copper oxysulfide superconductors

We describe a framework for designing novel materials, combining modern first-principles electronic-structure tools, materials databases, and evolutionary algorithms capable of exploring large configurational spaces. Guided by the chemical principles introduced by Antipov et al., for the design and synthesis of the Hg-based high-temperature superconductors, we apply our framework to screen 333 proposed compositions to design a new layered copper oxysulfide, Hg(CaS)2CuO2. We evaluate the prospects of superconductivity in this oxysulfide using theories based on charge-transfer energies, orbital distillation and uniaxial strain.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2015

The Art of War: Beyond Memory-one Strategies in Population Games

We show that the history of play in a population game contains exploitable information that can be successfully used by sophisticated strategies to defeat memory-one opponents, including zero determinant strategies. The history allows a player to label opponents by their strategies, enabling a player to determine the population distribution and to act differentially based on the opponent’s strategy in each pairwise interaction. For the Prisoner’s Dilemma, these advantages lead to the natural formation of cooperative coalitions among similarly behaving players and eventually to unilateral defection against opposing player types. We show analytically and empirically that optimal play in population games depends strongly on the population distribution. For example, the optimal strategy for a minority player type against a resident TFT population is ALLC, while for a majority player type the optimal strategy versus TFT players is ALLD. Such behaviors are not accessible to memory-one strategies. Drawing inspiration from Sun Tzu’s the Art of War, we implemented a non-memory-one strategy for population games based on techniques from machine learning and statistical inference that can exploit the history of play in this manner. Via simulation we find that this strategy is essentially uninvadable and can successfully invade (significantly more likely than a neutral mutant) essentially all known memory-one strategies for the Prisoner’s Dilemma, including ALLC (always cooperate), ALLD (always defect), tit-for-tat (TFT), winstay-lose-shift (WSLS), and zero determinant (ZD) strategies, including extortionate and generous strategies.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2022

LINAC OPTICS OPTIMIZATION WITH MULTI-OBJECTIVE OPTIMIZATION

The beamline design of recirculating linacs requires special attention to avoid beam instabilities due to RF wakefields. A proposed high-energy, multi-pass energy recovery demonstration at CEBAF uses a low beam current. Stronger focusing at lower energies is necessary to avoid beam breakup(BBU) instabilities, even with this small beam current. The CEBAF linac optics optimization balances over-focusing at higher energies and beta excursions at lower energies. Using proper mathematical expressions, linac optics optimization can be achieved with evolutionary algorithms. Here, we present the optimization process of North Linac optics using multi-objective optimization.

Neththikumara, I.↗
DOE OSTI2014

Water Security Toolkit User Manual Version 1.2.

The Water Security Toolkit (WST) is a suite of open source software tools that can be used by water utilities to create response strategies to reduce the impact of contamination in a water distribution network . WST includes hydraulic and water quality modeling software , optimizati on methodologies , and visualization tools to identify: (1) sensor locations to detect contamination, (2) locations in the network in which the contamination was introduced, (3) hydrants to remove contaminated water from the distribution system, (4) locations in the network to inject decontamination agents to inactivate, remove, or destroy contaminants, (5) locations in the network to take grab sample s to help identify the source of contamination and (6) valves to close in order to isolate contaminate d areas of the network. This user manual describes the different components of WST , along w ith examples and case studies. License Notice The Water Security Toolkit (WST) v.1.2 Copyright c 2012 Sandia Corporation. Under the terms of Contract DE-AC04-94AL85000, there is a non-exclusive license for use of this work by or on behalf of the U.S. government. This software is distributed under the Revised BSD License (see below). In addition, WST leverages a variety of third-party software packages, which have separate licensing policies: Acro Revised BSD License argparse Python Software Foundation License Boost Boost Software License Coopr Revised BSD License Coverage BSD License Distribute Python Software Foundation License / Zope Public License EPANET Public Domain EPANET-ERD Revised BSD License EPANET-MSX GNU Lesser General Public License (LGPL) v.3 gcovr Revised BSD License GRASP AT&T Commercial License for noncommercial use; includes randomsample and sideconstraints executable files LZMA SDK Public Domain nose GNU Lesser General Public License (LGPL) v.2.1 ordereddict MIT License pip MIT License PLY BSD License PyEPANET Revised BSD License Pyro MIT License PyUtilib Revised BSD License PyYAML MIT License runpy2 Python Software Foundation License setuptools Python Software Foundation License / Zope Public License six MIT License TinyXML zlib License unittest2 BSD License Utilib Revised BSD License virtualenv MIT License Vol Common Public License vpykit Revised BSD License Additionally, some precompiled WST binary distributions might bundle other third-party executables files: Coliny Revised BSD License (part of Acro project) Dakota GNU Lesser General Public License (LGPL) v.2.1 PICO Revised BSD License (part of Acro project) i Revised BSD License Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Sandia National Laboratories nor Sandia Corporation nor the names of its con- tributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IM- PLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUD- ING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ii Acknowledgements This work was supported by the U.S. Environmental Protection Agency through its Office of Research and Development (Interagency Agreement # DW8992192801). The material in this document has been subject to technical and policy review by the U.S. EPA, and approved for publication. The views expressed by individual authors, however, are their own, and do not necessarily reflect those of the U.S. Environmental Protection Agency. Mention of trade names, products, or services does not convey official U.S. EPA approval, endorsement, or recommendation. The Water Security Toolkit is an extension of the Threat Ensemble Vulnerability Assessment-Sensor Place- ment Optimization Tool (TEVA-SPOT), which was also developed with funding from the U.S. Environ- mental Protection Agency through its Office of Research and Development (Interagency Agreement # DW8992192801). The authors acknowledge the following individuals for their contributions to the devel- opment of TEVA-SPOT: Jonathan Berry (Sandia National Laboratories), Erik Boman (Sandia National Laboratories), Lee Ann Riesen (Sandia National Laboratories), James Uber (University of Cincinnati), and Jean-Paul Watson (Sandia National Laboratories). iii Acronyms ATUS American Time-Use Survey BLAS Basic linear algebra sub-routines CFU Colony-forming unit CVAR Conditional value at risk CWS Contamination warning system EA Evolutionary algorithm EDS Event detection system EPA U.S. Environmental Protection Agency EC Extent of Contamination ERD EPANET results database file GLPK GNU Linear Programming Kit GRASP Greedy randomized adaptive sampling process HEX Hexadecimal HTML HyperText markup language INP EPANET input file LP Linear program MC Mass consumed MILP Mixed integer linear program MIP Mixed integer program MSX Multi-species extension for EPANET NFD Number of failed detections NS Number of sensors NZD Non-zero demand PD Population dosed PE Population exposed PK Population killed TAI Threat assessment input file TCE Tailed-conditioned expectation TD Time to detection TEC Timed extent of contamination TEVA Threat ensemble vulnerability assessment TSB Tryptic soy broth TSG Threat scenario generation file TSI Threat simulation input file VAR Value at risk VC Volume consumed WST Water Security Toolkit YML YAML configuration file format for WST iv Symbols Notation Definition Example { , } set brackets { 1,2,3 } means a set containing the values 1,2, and 3. [?] is an element of s [?] S means that s is an element of the set S . [?] for all s = 1 [?] s [?] S means that the statement s = 1 is true for all s in set S . P summation P n i =1 s i means s 1 + s 2 + * * * + s n . \ set minus S \ T means the set that contains all those elements of S that are not in set T . %7C given %7C is used to define conditional probability. P ( s %7C t ) means the prob- ability of s occurring given that t occurs. %7C ... %7C cardinality Cardinality of a set is the number of elements of the set. If set S = { 2,4,6 } , then %7C S %7C = 3. v

Klise, Katherine A.↗