Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algorithmic Optimization”

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 703 records · Page 39

Designing Metabolic Division of Labor in Microbial Communities

ABSTRACT Microbes face a trade-off between being metabolically independent and relying on neighboring organisms for the supply of some essential metabolites. This balance of conflicting strategies affects microbial community structure and dynamics, with important implications for microbiome research and synthetic ecology. A “gedanken” (thought) experiment to investigate this trade-off would involve monitoring the rise of mutual dependence as the number of metabolic reactions allowed in an organism is increasingly constrained. The expectation is that below a certain number of reactions, no individual organism would be able to grow in isolation and cross-feeding partnerships and division of labor would emerge. We implemented this idealized experiment using in silico genome-scale models. In particular, we used mixed-integer linear programming to identify trade-off solutions in communities of Escherichia coli strains. The strategies that we found revealed a large space of opportunities in nuanced and nonintuitive metabolic division of labor, including, for example, splitting the tricarboxylic acid (TCA) cycle into two separate halves. The systematic computation of possible solutions in division of labor for 1-, 2-, and 3-strain consortia resulted in a rich and complex landscape. This landscape displayed a nonlinear boundary, indicating that the loss of an intracellular reaction was not necessarily compensated for by a single imported metabolite. Different regions in this landscape were associated with specific solutions and patterns of exchanged metabolites. Our approach also predicts the existence of regions in this landscape where independent bacteria are viable but are outcompeted by cross-feeding pairs, providing a possible incentive for the rise of division of labor. IMPORTANCE Understanding how microbes assemble into communities is a fundamental open issue in biology, relevant to human health, metabolic engineering, and environmental sustainability. A possible mechanism for interactions of microbes is through cross-feeding, i.e., the exchange of small molecules. These metabolic exchanges may allow different microbes to specialize in distinct tasks and evolve division of labor. To systematically explore the space of possible strategies for division of labor, we applied advanced optimization algorithms to computational models of cellular metabolism. Specifically, we searched for communities able to survive under constraints (such as a limited number of reactions) that would not be sustainable by individual species. We found that predicted consortia partition metabolic pathways in ways that would be difficult to identify manually, possibly providing a competitive advantage over individual organisms. In addition to helping understand diversity in natural microbial communities, our approach could assist in the design of synthetic consortia.

59 BASIC BIOLOGICAL SCIENCES↗

A Nonlocal Feature-Driven Exemplar-Based Approach for Image Inpainting

Here, we present a nonlocal variational image completion technique which admits simultaneous inpainting of multiple structures and textures in a unified framework. The recovery of geometric structures is achieved by using general convolution operators as a measure of behavior within an image. These are combined with a nonlocal exemplar-based approach to exploit the self-similarity of an image in the selected feature domains and to ensure the inpainting of textures. We also introduce an anisotropic patch distance metric to allow for better control of the feature selection within an image and present a nonlocal energy functional based on this metric. Finally, we derive an optimization algorithm for the proposed variational model and examine its validity experimentally with various test images.

97 MATHEMATICS AND COMPUTING↗

A.I. for nuclear physics

Nuclear science is concerned with the understanding of the nature of matter, its basic constituents and their interaction to form the elements and the properties we observe. This includes the forms of matter we see around us and also exotic forms such as those that existed in the first moments after the Big Bang and that exist today inside neutron stars. The techniques, tools, and expertise needed for nuclear physics (NP) research are therefore diverse in nature. State-of-the art accelerators are being developed to illuminate the dynamical basis of the core of the atom in terms of the fundamental constituents called quarks and gluons and to increase the number of isotopes with known properties. This scientific infrastructure is reaching scales and complexities that require computational methods for tasks such as anomaly detection in operational data. New methodologies are needed to detect anomalies and to optimize operating parameters, predict failures as well as to discover new optimization algorithms.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Reconstruction of cosmic-ray muon events with CUORE

We report the in-situ 3D reconstruction of through-going muons in the CUORE experiment, a cryogenic calorimeter array searching for neutrinoless double beta (0vββ) decay, leveraging the segmentation of the detector. Due to the slow time response of the detector, time-of-flight estimation is not feasible. Therefore, the track reconstruction is performed using a multi-objective optimization algorithm that relies on geometrical information from the detector as a whole. We measure the integral flux of cosmic-ray muons underground at the Laboratori Nazionali del Gran Sasso, and find our value to be in good agreement with other experiments that have performed a similar measurement. To our knowledge, this work represents the first demonstration of 3D particle tracking and reconstruction of through-going muons with per-event angular determination in a millikelvin cryogenic detector array. The analysis performed for this work will be critical for validating the muon-related background in CUPID, a next-generation 0vββ experiment, and for follow-up studies on detector response and on delayed products induced by cosmic-ray muons.

Adams, D. Q. [University of South Carolina]↗

Modeling Alzheimer’s Disease Progression with Fused Laplacian Sparse Group Lasso

Alzheimer’s disease (AD), the most common type of dementia, not only imposes a huge financial burden on the health care system, but also a psychological and emotional burden on patients and their families. There is furthermore an urgent need to infer trajectories of cognitive performance over time and identify biomarkers predictive of the progression. Here, we introduce the multi-task learning with fused Laplacian sparse group lasso model, which can identify biomarkers closely related to cognitive measures due to its sparsity-inducing property, and model the disease progression with a general weighted (undirected) dependency graphs among the tasks. An efficient alternative directions method of multipliers based optimization algorithm is derived to solve the proposed non-smooth objective formulation. The effectiveness of the presented model is demonstrated by its superior prediction performance over multiple state-of-the-art methods and accurate identification of compact sets of cognition-relevant imaging biomarkers that are consistent with prior medical studies.

59 BASIC BIOLOGICAL SCIENCES↗

Graph Contractions for Calculating Correlation Functions in Lattice QCD

Computing correlation functions for many-particle systems in Lattice QCD is vital to extract nuclear physics observables like the energy spectrum of hadrons such as protons. However, this type of calculation has long been considered to be very challenging and computing-resource intensive because of the complex nature of a hadron composed of quarks with many degrees of freedom. In particular, a correlation function can be calculated through a sum of all possible pairs of quark contractions, each of which is a batched tensor contraction, dictated by Wick's theorem. Because the number of terms of this sum can be very large for any hadronic system of interest, fast evaluation of the sum faces several challenges: an extremely large number of contractions, a huge memory footprint at runtime, and the speed of tensor contractions. In this paper, we present a Lattice QCD analysis software suite, Redstar, which addresses these challenges by utilizing novel algorithmic and software engineering methods targeting modern computing platforms such as many-core CPUs and GPUs. In particular, Redstar represents every term in the sum of a correlation function by a graph, applies efficient graph algorithms to reduce the number of contractions to lower the cost of computations, and minimizes the total memory footprint. Moreover, Redstar carries out the contractions on either CPUs or GPUs utilizing an internal and highly efficient Hadron contraction library. Specifically, we illustrate some important algorithmic optimizations of Redstar, show various key design features of Hadron library, and present the speedup values due to the optimizations along with performance figures for calculating six correlations functions on four computing platforms.

Chen, Jie↗

Adversarial Binaries: AI-guided Instrumentation Methods for Malware Detection Evasion

Adversarial binaries are executable files that have been altered without loss of function by an AI agent in order to deceive malware detection systems. Progress in this emergent vein of research has been constrained by the complex and rigid structure of executable files. Although prior work has demonstrated that these binaries deceive a variety of malware classification models which rely on disparate feature sets, a consensus as to the best approach has not been reached, either in terms of the optimization algorithms or the instrumentation methods. Furthermore, although inconsistencies in the data sets, target classifiers, and functionality verification methods make head-to-head comparisons difficult, here we extract lessons learned and make recommendations for future research.

malware obfuscation↗

Topology Optimization of 3D Flow Fields for Flow Batteries

We report as power generated from renewables becomes more readily available, the need for power-efficient energy storage devices, such as redox flow batteries, becomes critical for successful integration of renewables into the electrical grid. An important aspect of a redox flow battery is the planar flow field, which is usually composed of two-dimensional channels etched into a backing plate. As reactant-laden electrolyte flows into the flow battery, the channels in the flow field distribute the fluid throughout the reactive porous electrode. We utilize topology optimization to design flow fields with full three-dimensional geometry variation, i.e., 3D flow fields. Specifically, we focus on vanadium redox flow batteries and use the optimization algorithm to generate 3D flow fields evolved from standard interdigitated flow fields by minimizing the electrical and flow pressure power losses. To understand how these 3D designs improve performance, we analyze the polarization of the reactant concentration and exchange current within the electrode to highlight how the designed flow fields mitigate the presence of electrode dead zones. While interdigitated flow fields can be heuristically engineered to yield high performance by tuning channel and land dimensions, such a process can be laborious; this work provides a framework for automating that design process.

25 ENERGY STORAGE↗

Slope Extensions to ASL Library

Extensions to the AMPL/solver interface library (http://netlib.sandia.gov/ampl/solvers) to compute bounds on algebraic expressions, plus a test program. use in uncertainty quantification and global optimization algorithms. This software is not primarily for military applications.

Gay, David↗

Devastator Parallel Discrete Event Simulation Runtime (Devastator) v1.0

The Devastator runtime is a modern C++ implementation of optimistic parallel discrete event simulation methods. Devastator allows simulation application code to productively specify their component and event functionality with C++14 constructs. It utilizes GASNet-EX for distributed memory communication and includes parallel performance optimizations such as light-weight thread message queues and asynchronous GVT. Furthermore, it supports efficient event broadcasts and pause-rewind-resume functionality to support periodic load balancing and outer loop optimization algorithms.

Chan, Cy↗

O4855---Geometry_Optimizer_with_NSGA-II

It is a geometry optimizer, written for MCNP geometries but also applicable to other simulation programs. It uses NSGA-II optimization algorithm to change the specified input parameters to iteratively improve the requested tally values over generations.

Erdem, Omer↗

NuFast-LBL

NuFast is designed to calculate all nine neutrino oscillation probabilities in matter for long-baseline accelerator (e.g. NOvA, T2K, DUNE, HK) and reactor experiments (e.g. JUNO) very quickly, using the algorithms optimized for realistic oscillation scenarios. NuFast is provided in Fortran, C++, and Python, although no particular guarantees are made that the Python code is "fast".

Denton, PeterB. [Brookhaven National Laboratory (B↗

Inversion of downhole electrical measurements for proppant mapping using very fast simulated annealing

Proppant mapping is critical for optimizing fracture treatment design and improving wells’ productivity. An electrode-based resistivity tool concept was developed earlier for proppant mapping in cased-hole wells. An array of insulating gaps is installed and cemented in place as a permanent part of the casing string. The electrical measurements are performed by imposing a voltage across each insulating gap, one at a time, before and after hydraulic fracture operations. The voltages across other insulating gaps near the transmitter gap are recorded. The method relies on direct excitation of the casing, which is expected to overcome the severe limitations of induction tools in cased-hole wells. A forward model based on a finite volume method has been developed to simulate the tool’s response to one or multiple fractures. To enable the implementation of such a practical system in multistage fractured horizontal wells, a fast and robust inversion approach is required. To that end, we have developed a divide-and-conquer approach based on a global optimization algorithm very fast simulated annealing (VFSA). Specifically, the original inverse problem is divided into subproblems and each subproblem can be solved separately using VFSA. The results indicate that our approach can invert the data and output widths and radii of multiple fractures without requiring a large number of forward simulations. The robustness of the inverse solver is also tested by adding Gaussian noise to the synthetic data. We tested example cases that demonstrate that when up to 5% noise is introduced, VFSA still provides very accurate inversion results with moderate uncertainties. Inversion results with some more realistic conditions, e.g., tilted fractures, complex fractures, and so on, are also presented.

Geochemistry & Geophysics↗

MASK3 for Advanced WEC Dynamics and Controls

This report outlines the "MASK3" wave tank test within the Advanced WEC Dynamics and Controls (AWDC) project. This test represents the final test in the AWDC project. The focus of the MASK3 test was to consider coordinated 3-degree-of-freedom (3DOF) control of a WEC in a realistic ocean environment. A key aspect of this test was the inclusion of a "self-tuning" mechanism which uses an optimization algorithm to update controller gains based on a changing sea state. The successful implementation of the self-tuning mechanism is the last crucial step required for such a controller to be implemented in real ocean environments.

16 TIDAL AND WAVE POWER↗

Quantitative microstructural imaging by scanning Laue x-ray micro- and nanodiffraction

We present that local crystal structure, crystal orientation, and crystal deformation can all be probed by Laue diffraction using a submicron x-ray beam. This technique, employed at a synchrotron facility, is particularly suitable for fast mapping the mechanical and microstructural properties of inhomogeneous multiphase polycrystalline samples, as well as imperfect epitaxial films or crystals. As synchrotron Laue x-ray microdiffraction enters its 20th year of existence and new synchrotron nanoprobe facilities are being built and commissioned around the world, we take the opportunity to overview current capabilities as well as the latest technical developments. Fast data collection provided by state-of-the-art area detectors and fully automated pattern indexing algorithms optimized for speed make it possible to map large portions of a sample with fine step size and obtain quantitative images of its microstructure in near real time. Lastly, we extrapolate how the technique is anticipated to evolve in the near future and its potential emerging applications at a free-electron laser facility.

36 MATERIALS SCIENCE↗

Beam-Based Diagnostics of Electric Guide Fields and Lattice Parameters for Run-1 of the Muon g-2 Storage Ring at Fermilab

A portion of the Muon g-2 Storage Ring electric system, which provides vertical beam focusing, exhibited an unexpected time dependence that produced a characteristic evolution of the stored beam during Run-1 of the Muon g-2 Experiment at Fermilab (E989). A method to reconstruct the Run-1 electric guide fields has been developed, which is based on a numerical model of the muon storage ring and optimization algorithms supported by COSY INFINITY. This method takes beam profile measurements from the Muon g-2 straw tracking detectors as input, and it produces a full reconstruction of the time-dependent fields. The fields can then be used for the reproduction of detailed beam tracking simulations and the calculation of ring lattice parameters for acceptance studies and systematic error evaluations.

43 PARTICLE ACCELERATORS↗

Visualization for Hyper-Heuristics: Front-End Graphical User Interface

Modern society is faced with ever more complex problems, many of which can be formulated as generate-and-test optimization problems. General-purpose optimization algorithms are not well suited for real-world scenarios where many instances of the same problem class need to be repeatedly and efficiently solved because they are not targeted to a particular scenario. Hyper-heuristics automate the design of algorithms to create a custom algorithm for a particular scenario. While such automated design has great advantages, it can often be difficult to understand exactly how a design was derived and why it should be trusted. This project aims to address these issues of usability by creating an easy-to-use graphical user interface (GUI) for hyper-heuristics to support practitioners, as well as scientific visualization of the produced automated designs. My contributions to this project are exhibited in the user-facing portion of the developed system and the detailed scientific visualizations created from back-end data.

97 MATHEMATICS AND COMPUTING↗

A Comparison of Genetic Programming Variants for Hyper-Heuristics

Modern society is faced with ever more complex problems, many of which can be formulated as generate-and-test optimization problems. General-purpose optimization algorithms are not well suited for real-world scenarios where many instances of the same problem class need to be repeatedly and efficiently solved, such as routing vehicles over highways with constantly changing traffic flows, because they are not targeted to a particular scenario. Hyper-heuristics automate the design of algorithms to create a custom algorithm for a particular scenario. Hyper-heuristics typically employ Genetic Programming (GP) and this project has investigated the relationship between the choice of GP and performance in Hyper-heuristics. Results are presented demonstrating the existence of problems for which there is a statistically significant performance differential between the use of different types of GP.

97 MATHEMATICS AND COMPUTING↗