Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm complexity analysis”

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 1,153 records · Page 64
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

RAVEN User Manual

RAVEN is a generic software framework to perform parametric and probabilistic analy- sis based on the response of complex system codes. The initial development was aimed to provide dynamic risk analysis capabilities to the Thermo-Hydraulic code RELAP-7, currently under development at the Idaho National Laboratory (INL). Although the initial goal has been fully accomplished, RAVEN is now a multi-purpose probabilistic and uncer- tainty quantification platform, capable to agnostically communicate with any system code. This agnosticism includes providing Application Programming Interfaces (APIs). These APIs are used to allow RAVEN to interact with any code as long as all the parameters that need to be perturbed are accessible by inputs files or via python interfaces. RAVEN is capable of investigating the system response, and investigating the input space using Monte Carlo, Grid, or Latin Hyper Cube sampling schemes, but its strength is focused to- ward system feature discovery, such as limit surfaces, separating regions of the input space leading to system failure, using dynamic supervised learning techniques. The development of RAVEN has started in 2012, when, within the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program, the need to provide a modern risk evaluation framework became stronger. RAVEN principal assignment is to provide the necessary software and algorithms in order to employ the concept developed by the Risk Informed Safety Margin Characterization (RISMC) program. RISMC is one of the pathways defined within the Light Water Reactor Sustainability (LWRS) program. In the RISMC approach, the goal is not just the individuation of the frequency of an event potentially leading to a system failure, but the closeness (or not) to key safety-related events. Hence, the approach is in- terested in identifying and increasing the safety margins related to those events. A safety margin is a numerical value quantifying the probability that a safety metric (e.g. for an important process such as peak pressure in a pipe) is exceeded under certain conditions. The initial development of RAVEN has been focused on providing dynamic risk assess- ment capability to RELAP-7, currently under develop-ment at the INL and, likely, future replacement of the RELAP5-3D code. Most the capabilities that have been implemented having RELAP-7 as principal focus are easily deployable for other system codes. For this reason, several side activates are currently ongoing for coupling RAVEN with soft- ware such as RELAP5-3D, etc. The aim of this document is the explaination of the input requirements, focalizing on the input structure.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1997

An Adaptive Flow Solver for Air-Borne Vehicles Undergoing Time-Dependent Motions/Deformations

This report describes a concurrent Euler flow solver for flows around complex 3-D bodies. The solver is based on a cell-centered finite volume methodology on 3-D unstructured tetrahedral grids. In this algorithm, spatial discretization for the inviscid convective term is accomplished using an upwind scheme. A localized reconstruction is done for flow variables which is second order accurate. Evolution in time is accomplished using an explicit three-stage Runge-Kutta method which has second order temporal accuracy. This is adapted for concurrent execution using another proven methodology based on concurrent graph abstraction. This solver operates on heterogeneous network architectures. These architectures may include a broad variety of UNIX workstations and PCs running Windows NT, symmetric multiprocessors and distributed-memory multi-computers. The unstructured grid is generated using commercial grid generation tools. The grid is automatically partitioned using a concurrent algorithm based on heat diffusion. This results in memory requirements that are inversely proportional to the number of processors. The solver uses automatic granularity control and resource management techniques both to balance load and communication requirements, and deal with differing memory constraints. These ideas are again based on heat diffusion. Results are subsequently combined for visualization and analysis using commercial CFD tools. Flow simulation results are demonstrated for a constant section wing at subsonic, transonic, and a supersonic case. These results are compared with experimental data and numerical results of other researchers. Performance results are under way for a variety of network topologies.

Singh, Jatinder↗
DOE OSTI2020

Big Data and AI at DoE's Legacy Sites - 20546

More than 30 years have passed since DOE started the decommissioning of nuclear weapon complexes and the clean-up of soil and groundwater. All the sites have been collecting and archiving soil and groundwater monitoring datasets; particularly contaminant concentration time-series. These datasets provide unparalleled opportunities to understand the system behavior (including more fundamental hydrological and geochemical processes, the response to various perturbations, the long-term trend and environmental decay rate towards the regulatory limit). This understanding is critical for providing multiple lines of evidences that can support site closure. In this study, we explore the machine learning (ML) and artificial intelligence (AI) applications to the long-term soil and groundwater management at DoE's legacy sites. ML can improve our understanding of the subsurface systems, which is critical for long-term monitoring and management of the sites, while AI can automate or support some of decision-making processes (e.g., anomaly detection, monitoring well placements). The particular focuses are to develop general algorithms to: (1) to identify distinct spatiotemporal patterns and to identify several groups that have similar temporal behaviors, using unsupervised clustering methods, (2) identify the different temporal scales of hydrological responses to climate perturbations by time-series analysis, and (3) reduce the number of monitoring wells by identifying the minimum sufficient number of wells to capture the heterogeneity of the groundwater contaminant plume and concentration distribution, using the Gaussian Process model. We demonstrate our methodology at the Savannah River Site F-Area. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
NASA NTRS2002

Program Instrumentation and Trace Analysis

Several attempts have been made recently to apply techniques such as model checking and theorem proving to the analysis of programs. This shall be seen as a current trend to analyze real software systems instead of just their designs. This includes our own effort to develop a model checker for Java, the Java PathFinder 1, one of the very first of its kind in 1998. However, model checking cannot handle very large programs without some kind of abstraction of the program. This paper describes a complementary scalable technique to handle such large programs. Our interest is turned on the observation part of the equation: How much information can be extracted about a program from observing a single execution trace? It is our intention to develop a technology that can be applied automatically and to large full-size applications, with minimal modification to the code. We present a tool, Java PathExplorer (JPaX), for exploring execution traces of Java programs. The tool prioritizes scalability for completeness, and is directed towards detecting errors in programs, not to prove correctness. One core element in JPaX is an instrumentation package that allows to instrument Java byte code files to log various events when executed. The instrumentation is driven by a user provided script that specifies what information to log. Examples of instructions that such a script can contain are: 'report name and arguments of all called methods defined in class C, together with a timestamp'; 'report all updates to all variables'; and 'report all acquisitions and releases of locks'. In more complex instructions one can specify that certain expressions should be evaluated and even that certain code should be executed under various conditions. The instrumentation package can hence be seen as implementing Aspect Oriented Programming for Java in the sense that one can add functionality to a Java program without explicitly changing the code of the original program, but one rather writes an aspect and compiles it into the original program using the instrumentation. Another core element of JPaX is an observation package that supports the analysis of the generated event stream. Two kinds of analysis are currently supported. In temporal analysis the execution trace is evaluated against formulae written in temporal logic. We have implemented a temporal logic evaluator on finite traces using the Maude rewriting system from SRI International, USA. Temporal logic is defined in Maude by giving its syntax as a signature and its semantics as rewrite equations. The resulting semantics is extremely efficient and can handle event streams of hundreds of millions events in few minutes. Furthermore, the implementation is very succinct. The second form of even stream analysis supported is error pattern analysis where an execution trace is analyzed using various error detection algorithms that can identify error-prone programming practices that may potentially lead to errors in some different executions. Two such algorithms focusing on concurrency errors have been implemented in JPaX, one for deadlocks and the other for data races. It is important to note, that a deadlock or data race potential does not need to occur in order for its potential to be detected with these algorithms. This is what makes them very scalable in practice. The data race algorithm implemented is the Eraser algorithm from Compaq, however adopted to Java. The tool is currently being applied to a code base for controlling a spacecraft by the developers of that software in order to evaluate its applicability.

Havelund, Klaus↗
DOE OSTI2016

Enhanced gauge symmetry in 6D F‐theory models and tuned elliptic Calabi‐Yau threefolds

We systematically analyze the local combinations of gauge groups and matter that can arise in 6D F‐theory models over a fixed base. We compare the low‐energy constraints of anomaly cancellation to explicit F‐theory constructions using Weierstrass and Tate forms, and identify some new local structures in the “swampland” of 6D supergravity and SCFT models that appear consistent from low‐energy considerations but do not have known F‐theory realizations. In particular, we classify and carry out a local analysis of all enhancements of the irreducible gauge and matter contributions from “non‐Higgsable clusters,” and on isolated curves and pairs of intersecting rational curves of arbitrary self‐intersection. Such enhancements correspond physically to unHiggsings, and mathematically to tunings of the Weierstrass model of an elliptic CY threefold. We determine the shift in Hodge numbers of the elliptic threefold associated with each enhancement. We also consider local tunings on curves that have higher genus or intersect multiple other curves, codimension two tunings that give transitions in the F‐theory matter content, tunings of abelian factors in the gauge group, and generalizations of the “ E 8 ” rule to include tunings and curves of self‐intersection zero. These tools can be combined into an algorithm that in principle enables a finite and systematic classification of all elliptic CY threefolds and corresponding 6D F‐theory SUGRA models over a given compact base (modulo some technical caveats in various special circumstances), and are also relevant to the classification of 6D SCFT's. To illustrate the utility of these results, we identify some large example classes of known CY threefolds in the Kreuzer‐Skarke database as Weierstrass models over complex surface bases with specific simple tunings, and we survey the range of tunings possible over one specific base.

Johnson, Samuel B.↗
DOE OSTI2026

Machine Learning for Fairness-Aware Load Shedding: A Real-Time Solution via Identifying Binding Constraints: Preprint

Timely and effective load shedding in power systems is critical for maintaining supply-demand balance and preventing cascading blackouts. To eliminate load shedding bias against specific regions in the system, optimization-based methods are uniquely positioned to help balance between economic and fairness considerations. However, the resulting optimization problem involves complex constraints, which can be time-consuming to solve and thus cannot meet the real-time requirements of load shedding. To tackle this challenge, in this paper we present an efficient machine learning algorithm to enable millisecond-level computation for the optimization-based load shedding problem. Numerical studies on both a 3-bus toy example and a realistic RTS-GMLC system have demonstrated the validity and efficiency of the proposed algorithm for delivering fairness-aware and real-time load shedding decisions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Enhancing nuclear data validation analysis by using machine learning

In this work, we demonstrate how machine learning (ML) techniques can be used as an auxiliary tool for nuclear data validation analysis. The output of the ML analysis can inform evaluators and validators on the quality, or lack thereof, of specific nuclear data and benchmark experiments with respect to simulating these experimental benchmark values. To this end, measured and simulated effective neutron multiplication factors, k eff , of 875 selected ICSBEP critical assemblies and the latter's sensitivities with respect to nuclear data as well as benchmarks' features (e.g., material nuclide, core geometry) are used as input for a random forest (RF) regression model. The RF is used to encode the complex inter-dependencies between thousands of nuclear data features (i.e., sensitivity profiles and aspects describing the measurements) and 875 simulated and experimental k eff values in order to understand what nuclear data features are most informative for predicting bias. The complexity of relationships and high-dimensional space is difficult-to-impossible to search fully using simply expert judgment. As a first proof-of-concept—step, it is demonstrated that this technique is able to correctly trace large discrepancies between simulated and experimental k eff back to fabricated shortcomings in nuclear data that were perturbed to simulated k eff values. In a second, real-case scenario, step, the RF algorithm is used to validate the ENDF/B-VIII.0 library in comparison to ENDF/B-VII.1 nuclear data. One case is showcased where the chosen ML algorithms highlighted nuclear data (the 19 F(n,inl) cross section from 0.4–0.9 MeV) that are shown to be problematic by comparing them to associated differential experimental data and nuclear data from other libraries. In addition to that, it is shown that the RF results point towards poor benchmark experiments and associated underestimated uncertainties (e.g., the PU-SOL-THERM-028 series). However, using the RF algorithm for validating nuclear data with respect to k eff is currently limited to pinpointing groups of questionable nuclear data due to the inherent correlations between features introduced by the nuclear data themselves and how k eff is simulated. Due to this, we recommend that the ML methods presented be used to augment—rather than replace—the expert knowledge of evaluators and validators.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2017

Sequential computation of elementary modes and minimal cut sets in genome-scale metabolic networks using alternate integer linear programming

Elementary (flux) modes (EMs) have served as a valuable tool for investigating structural and functional properties of metabolic networks. Identification of the full set of EMs in genome-scale networks remains challenging due to combinatorial explosion of EMs in complex networks. It is often, however, that only a small subset of relevant EMs needs to be known, for which optimization-based sequential computation is a useful alternative. Most of the currently available methods along this line are based on the iterative use of mixed integer linear programming (MILP), the effectiveness of which significantly deteriorates as the number of iterations builds up. To alleviate the computational burden associated with the MILP implementation, we here present a novel optimization algorithm termed alternate integer linear programming (AILP). Results: Our algorithm was designed to iteratively solve a pair of integer programming (IP) and linear programming (LP) to compute EMs in a sequential manner. In each step, the IP identifies a minimal subset of reactions, the deletion of which disables all previously identified EMs. Thus, a subsequent LP solution subject to this reaction deletion constraint becomes a distinct EM. In cases where no feasible LP solution is available, IP-derived reaction deletion sets represent minimal cut sets (MCSs). Despite the additional computation of MCSs, AILP achieved significant time reduction in computing EMs by orders of magnitude. The proposed AILP algorithm not only offers a computational advantage in the EM analysis of genome-scale networks, but also improves the understanding of the linkage between EMs and MCSs.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

Demand Driven Cycamore Archetypes

Future nuclear fuel cycle options may present advantages over today’s once-through fuel cycle. Nuclear fuel cycle simulation tools assess the performance of those fuel cycles as well as the dynamics of long-term technology transitions. In many nuclear fuel cycle simulation tools, it has historically been the responsibility of the user to manually define facility deployment schemes and all facility parameters. While this is straightforward in simple fuel cycles, transitions from one fuel cycle to another can be more complex. In particular, deployment schemes for supportive fuel cycle facilities beyond the reactor become complex if the analyst desires to avoid gaps in the nuclear fuel and power supply chain during those transition scenarios. As nuclear fuel cycle analysis approaches questions regarding the feasibility and performance of the deployment schemes and technology choices during technology transition, automation of this historically manual process is necessary. The main objective of this work was to develop and demonstrate Cyclus automation capabilities toward key nuclear fuel cycle transition scenarios. While deploying reactors to meet power demand is trivial, and existed in the earliest versions of CYCLUS, automated, predictive deployment and decommissioning of other facilities is more complex. These include mining, milling, enrichment, fuel fabrication, reprocessing, and others. For example, a balanced closed fuel cycle may require ensuring that there is enough fast reactor fuel for their operation and may drive deployment of a fleet of light water reactors. This concern comprises the main challenge that drove the project effort. The Demand-Driven Cycamore Archetype project (NEUP-FY16-10512) aimed to develop CYCAMORE demand-driven deployment capabilities and thereby automate transition scenario definition. The developed software package, d3ploy, in the form of a CYCLUS Institution agent, deploys Facilities to meet the front-end and back-end demands of the fuel cycle. The University of South Carolina and the University of Illinois applied multiple algorithmic approaches to this challenge. This project developed an in situ demand-driven development schedule calculation through non-optimizing, deterministic-optimizing, and stochastic-optimizing algorithms as CYCLUS archetypes and demonstrated these new archetypes in program-supporting fuel cycle transition scenarios. Both objectives were achieved. This report documents the results and deliverables obtained toward these achievements in detail.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2025

Linking large-scale weather patterns to observed and modeled turbine hub-height winds offshore of the US West Coast

The US West Coast holds great potential for wind power generation, although its potential varies due to the complex coastal climate. Characterizing and modeling turbine hub-height winds under different weather conditions are vital for wind resource assessment and management. This study uses a two-stage machine learning algorithm to identify five large-scale meteorological patterns (LSMPs): post-trough, post-ridge, pre-ridge, pre-trough, and California high. The LSMPs are linked to offshore wind patterns, specifically at lidar buoy locations within lease areas for future wind farm development off Humboldt and Morro Bay. While each LSMP is associated with characteristic large-scale atmospheric conditions and corresponding differences in wind direction, diurnal variation, and jet features at the two lidar sites, substantial variability in wind speeds can still occur within each LSMP. Wind speeds at Humboldt increase during the post-trough, pre-ridge, and California-high LSMPs and decrease during the remaining LSMPs. Morro Bay has smaller responses in mean speeds, showing increased wind speed during the post-trough and California-high LSMPs. Besides the LSMPs, local factors, including the land–sea thermal contrast and topography, also modify mean winds and diurnal variation. The High-Resolution Rapid Refresh model analysis does a good job of capturing the mean and variation at Humboldt but produces large biases at Morro Bay, particularly during the pre-ridge and California-high LSMPs. The findings are anticipated to guide the selection of cases for studying the influence of specific large-scale and local factors on California offshore winds and to contribute to refining numerical weather prediction models, thereby enhancing the efficiency and reliability of offshore wind energy production.

17 WIND ENERGY↗
NASA NTRS2004

The Role of Ontologies in Schema-based Program Synthesis

Program synthesis is the process of automatically deriving executable code from (non-executable) high-level specifications. It is more flexible and powerful than conventional code generation techniques that simply translate algorithmic specifications into lower-level code or only create code skeletons from structural specifications (such as UML class diagrams). Key to building a successful synthesis system is specializing to an appropriate application domain. The AUTOBAYES and AUTOFILTER systems, under development at NASA Ames, operate in the two domains of data analysis and state estimation, respectively. The central concept of both systems is the schema, a representation of reusable computational knowledge. This can take various forms, including high-level algorithm templates, code optimizations, datatype refinements, or architectural information. A schema also contains applicability conditions that are used to determine when it can be applied safely. These conditions can refer to the initial specification, to intermediate results, or to elements of the partially-instantiated code. Schema-based synthesis uses AI technology to recursively apply schemas to gradually refine a specification into executable code. This process proceeds in two main phases. A front-end gradually transforms the problem specification into a program represented in an abstract intermediate code. A backend then compiles this further down into a concrete target programming language of choice. A core engine applies schemas on the initial problem specification, then uses the output of those schemas as the input for other schemas, until the full implementation is generated. Since there might be different schemas that implement different solutions to the same problem this process can generate an entire solution tree. AUTOBAYES and AUTOFILTER have reached the level of maturity where they enable users to solve interesting application problems, e.g., the analysis of Hubble Space Telescope images. They are large (in total around 100kLoC Prolog), knowledge intensive systems that employ complex symbolic reasoning to generate a wide range of non-trivial programs for complex application do- mains. Their schemas can have complex interactions, which make it hard to change them in isolation or even understand what an existing schema actually does. Adding more capabilities by increasing the number of schemas will only worsen this situation, ultimately leading to the entropy death of the synthesis system. The root came of this problem is that the domain knowledge is scattered throughout the entire system and only represented implicitly in the schema implementations. In our current work, we are addressing this problem by making explicit the knowledge from Merent parts of the synthesis system. Here; we discuss how Gruber's definition of an ontology as an explicit specification of a conceptualization matches our efforts in identifying and explicating the domain-specific concepts. We outline the dual role ontologies play in schema-based synthesis and argue that they address different audiences and serve different purposes. Their first role is descriptive: they serve as explicit documentation, and help to understand the internal structure of the system. Their second role is prescriptive: they provide the formal basis against which the other parts of the system (e.g., schemas) can be checked. Their final role is referential: ontologies also provide semantically meaningful "hooks" which allow schemas and tools to access the internal state of the program derivation process (e.g., fragments of the generated code) in domain-specific rather than language-specific terms, and thus to modify it in a controlled fashion. For discussion purposes we use AUTOLINEAR, a small synthesis system we are currently experimenting with, which can generate code for solving a system of linear equations, Az = b.

Bures, Tomas↗
NASA NTRS2002

Digital Distortion Caused by Traveling- Wave-Tube Amplifiers Simulated

Future NASA missions demand increased data rates in satellite communications for near real-time transmission of large volumes of remote data. Increased data rates necessitate higher order digital modulation schemes and larger system bandwidth, which place stricter requirements on the allowable distortion caused by the high-power amplifier, or the traveling-wave-tube amplifier (TWTA). In particular, intersymbol interference caused by the TWTA becomes a major consideration for accurate data detection at the receiver. Experimentally investigating the effects of the physical TWTA on intersymbol interference would be prohibitively expensive, as it would require manufacturing numerous amplifiers in addition to acquiring the required digital hardware. Thus, an accurate computational model is essential to predict the effects of the TWTA on system-level performance when a communication system is being designed with adequate digital integrity for high data rates. A fully three-dimensional, time-dependent, TWT interaction model has been developed using the electromagnetic particle-in-cell code MAFIA (Solution of Maxwell's equations by the Finite-Integration-Algorithm). It comprehensively takes into account the effects of frequency-dependent AM (amplitude modulation)/AM and AM/PM (phase modulation) conversion, gain and phase ripple due to reflections, drive-induced oscillations, harmonic generation, intermodulation products, and backward waves. This physics-based TWT model can be used to give a direct description of the effects of the nonlinear TWT on the operational signal as a function of the physical device. Users can define arbitrary excitation functions so that higher order modulated digital signals can be used as input and that computations can directly correlate intersymbol interference with TWT parameters. Standard practice involves using communication-system-level software packages, such as SPW, to predict if adequate signal detection will be achieved. These models use a nonlinear, black-box model to represent the TWTA. The models vary in complexity, but most make several assumptions regarding the operation of the high-power amplifier. When the MAFIA TWT interaction model was used, these assumptions were found to be in significant error. In addition, digital signal performance, including intersymbol interference, was compared using direct data input into the MAFIA model and using the system-level analysis tool SPW for several higher order modulation schemes. Results show significant differences in predicted degradation between SPW and MAFIA simulations, demonstrating the significance of the TWTA approximations made in the SPW model on digital signal performance. For example, a comparison of the SPW and MAFIA output constellation diagrams for a 16-ary quadrature amplitude modulation (16-QAM) signal (data shown only for second and fourth quadrants) is shown. The upper-bound degradation was calculated from the corresponding eye diagrams. In comparison to SPW simulations, the MAFIA data resulted in a 3.6-dB larger degradation.

Kory, Carol L.↗
NASA NTRS2006

Aerocapture Benefits to Future Science Missions

NASA's In-Space Propulsion Technology (ISPT) Program is investing in technologies to revolutionize the robotic exploration of deep space. One of these technologies is Aerocapture, the most promising of the "aeroassist" techniques used to maneuver a space vehicle within an atmosphere, using aerodynamic forces in lieu of propellant. (Other aeroassist techniques include aeroentry and aerobraking.) Aerocapture relies on drag atmospheric drag to decelerate an incoming spacecraft and capture it into orbit. This technique is very attractive since it permits spacecraft to be launched from Earth at higher velocities, providing shorter trip times and saving mass and overall cost on future missions. Recent aerocapture systems analysis studies quantify the benefits of aerocapture to future exploration. The 2002 Titan aerocapture study showed that using aerocapture at Titan instead of conventional propulsive capture results in over twice as much payload delivered to Titan. Aerocapture at Venus results in almost twice the payload delivered to Venus as with aerobraking, and over six times more mass delivered into orbit than all-propulsive capture. Aerocapture at Mars shows significant benefits as the payload sizes increase and as missions become more complex. Recent Neptune aerocapture studies show that aerocapture opens up entirely new classes of missions at Neptune. Current aerocapture technology development is advancing the maturity of each subsystem technology needed for successful implementation of aerocapture on future missions. Recent development has focused on both rigid aeroshell and inflatable aerocapture systems. Rigid aeroshell systems development includes new ablative and non-ablative thermal protection systems, advanced aeroshell performance sensors, lightweight structures and higher temperature adhesives. Inflatable systems such as trailing tethered and clamped "ballutes" and inflatable aeroshells are also under development. Computational tools required to support future aerocapture missions are an integral part of aerocapture development. Tools include engineering reference atmosphere models, guidance and navigation algorithms, aerothermodynamic modeling, and flight simulation.

Artis, Gwen↗
DOE OSTI2021

Utilizing computer vision and artificial intelligence algorithms to predict and design the mechanical compression response of direct ink write 3D printed foam replacement structures

Additive Manufacturing (AM) of porous polymeric materials, such as foams, recently became a topic of intensive research due their unique combination of low density, impressive mechanical properties, and stress dissipation capabilities. Conventional methods for fabricating foams rely on complex and stochastic processes, making it challenging to achieve precise architectural control of structured porosity. In contrast, AM provides access to a wide range of printable materials, where precise spatial control over structured porosity can be modulated during the fabrication process enabling the production of foam replacement structures (FRS). Current approaches for designing FRS are based on intuitive understanding of their properties or an extensive number of finite element method (FEM) simulations. These approaches, however, are computationally expensive and time consuming. As such, in this work, we present a novel methodology for determining the mechanical compression response of direct ink write (DIW) 3D printed FRS using a simple cross-sectional image. By obtaining measurement data for a relatively small number of samples, an artificial neural network (ANN) was trained, and a computer vision algorithm was used to make inferences about foam compression characteristics from a single cross-sectional image. Finally, a genetic algorithm (GA) was used to solve the inverse design problem, generating the AM printing parameters that an engineer should use to achieve a desired compression response from a DIW printed FRS. The methods developed herein present an avenue for entirely autonomous design and analysis of additively manufactured structures using artificial intelligence.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Characterization and Quantification of Radiation-Induced Clusters/Precipitates in RPV Steels Using STEM-EDS and Machine Learning

Over the operational lifespan of a nuclear reactor, reactor pressure vessel (RPV) steels are subjected to significant neutron irradiation, resulting in complex microstructural changes and the consequent degradation of mechanical properties. Various physically motivated correlation models have been developed to predict neutron irradiation-induced embrittlement of RPVs under different irradiation conditions. However, the efficient and accurate characterizations and quantification of radiation-induced clusters in RPVs are still challenging, which will affect the precision of the predictive models for embrittlement of RPV components. In the DOE Visiting Faculty Program (VFP) research work at Oak Ridge National Lab (ORNL), I integrate machine learning to aid Scanning Transmission Electron Microscopy – Energy Dispersive X-ray Spectroscopy (STEM-EDS) analyses, which improve the characterization and quantification of radiation-induced clusters in RPV steels, thereby enabling more accurate predictions of material behavior under irradiation. The surveillance base- and welded- RPV steels were annealed at various temperatures of 340 °C, 450 °C and 500 °C for up to 168 hours, respectively. Afterwards, I have characterized radiation-induced clusters using advanced STEM-EDS techniques and subsequently applying machine learning algorithms to analyze and refine STEM-EDS datasets, enhancing the quantification of clusters compositions and distributions. In the end, an efficient workflow for integrating STEM-EDS data analysis with machine learning to address challenges including noise reduction has been developed. The completion of this VFP work will support bridge critical gaps in the accurate quantification of radiation-induced clusters in RPV steels using STEM-EDS and support the development of more precise models for predicting RPV embrittlement in the Light Water Reactor Sustainability program supported by Department of Energy and enhancing the collaboration between ORNL and Alred University. The outcome of the VFP project will leverage a few research papers submission to peer-reviewed journals in the relevant scientific field and a few oral presentations at national and international conferences.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

Three-dimensional realizations of flood flow in large-scale rivers using the neural fuzzy-based machine-learning algorithms

Machine learning methods have been extensively used to study the dynamics of complex fluid flows. One such algorithm, known as adaptive neural fuzzy inference system (ANFIS), can generate data-driven predictions for flow fields, but has not been applied to natural geophysical flows in large-scale rivers. Herein, we demonstrate the potential of ANFIS to produce three-dimensional (3D) realizations of the instantaneous flood flow field in several large-scale, virtual meandering rivers. The 3D dynamics of flood flow in large-scale rivers were obtained using large-eddy simulation (LES). The LES results, i.e., the 3D velocity components, were employed to train the learnable coefficients of an ANFIS. Further, the trained ANFIS, along with a few time-steps of LES results (precursor data) were then used to produce 3D realizations of flood flow fields in large-scale rivers with geometries other than the one the ANFIS was trained with. We also used the trained ANFIS to generate 3D realizations of river flow at a discharge other than that the ANFIS was trained with. The flow field results obtained from ANFIS were validated using separate LES runs to assess the accuracy of the 3D instantaneous realizations of the machine learning algorithm. An error analysis was conducted to quantify the discrepancies among the ANFIS and LES results for various flood flow predictions in large-scale rivers.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS2000

TE/TM Simulations of Interferometric Measurements

Interferometric synthetic aperture radar (IFSAR) measurements at X-, C-, L-, and P-band are used to derive ground topography at meter level resolution. Interpretation of the derived topography requires attention due to the complex interaction of the radar signal with ground cover. The presence of penetrable surfaces such as vegetation, and tree canopies poses a challenge since the depth of penetration depends on a number of parameters such as the operating radar frequency, polarization, incident angle, as well as terrain structure. The dependence of the reconstructed topography on polarization may lead to the characterization of the ground cover. Simulation of interferometric measurements is useful for interpretation of the derived topography (B. Houshmand, Proceedings of URSI, 314, 1997). In this talk , time domain simulations for interferometric measurement for TE- and TM- polarization are presented. Time domain simulation includes the effects of the surface material property as well geometry comparable the radar signal wavelength (B. Houshmand, Proceedings of the URSI, 25, 1998). The IFSAR simulation is carried out in two steps. First, the forward scattering data is generated based on full wave analysis. Next, the electromagnetic information is inverted to generate surface topography. This inversion is based on the well known IFSAR processing technique which is composed of signal compression, and formation of an interferogram. The full wave forward scattering data is generated by the scattered-field formulation of the FDTD algorithm. The simulation is carried out by exciting the computational domain by a radar signal. The scattered field is then computed and translated to the receiving interferometric antennas using the time-domain Huygen's principle. The inversion process starts by compressing the time-domain data. The range compressed data from both receivers are then coregistered to form an interferogram. The resulting interferogram is then related to the ground topography using the radar imaging geometry. In this talk, the simulation results are compared with the C-band TM IFSAR derived topography, and the TE/TM SAR images at L-Band.

Houshmand, Bijan↗
DOE OSTI2018

OpenMSI Arrayed Analysis Tools (OMAAT) v2.0

Mass spectrometry (MS) is an analytical technique that enables all chemical species within a complex mixture to be resolved and identified based on their mass:charge ratio. MS is an increasingly important tool in life science research and development because it can resolve or separate small molecules, peptides, lipids, proteins, biopolymers and fragments of all of these structures. Unfortunately, the use of MS has been limited for lack of software tools to visualize, manipulate, store and transfer MS data. Ben Bowen, Oliver Ruebel and colleagues made a huge advance on the resolution of these limitations with the invention of "OpenMSI" (#2013-004), a computational method that makes the handling of these very large files (up to 50 Tb) much easier, especially for scientists with limited background in bioinformatics or sophisticated software applications of the type needed to handle such data files. With the OpenMSI Arrayed Analysis Tool (OMAAT, #2016-188) invention, the authors take MS data analysis one step further by providing tolls for automatic sample position optimization and ion selection. Even though sample deposition technologies have improved greatly, there is always the chance of encountering outliers in a predefined roster, especially in very large sample sets. Manual curation of the data would be extremely time consuming, so the inventors have included an algorithm that automatically finds the outliers. OMAAT is written in Python with accompanying Jupyter (formerly iPython) notebook and is fully integrated with OpenMSI.

Bowen, Benjamin↗