SEARCH · Search NASA

Results for “algorithmic structures”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,063 records · Page 59

All sources NASA NTRS DOE OSTI

DOE OSTI2021

A systematic comparison of machine learning methods for modeling of dynamic processes applied to combustion emission rate modeling

Ten established, data-driven dynamic algorithms are surveyed and a practical guide for understanding these methods generated. Existing Python programming packages for implementing each algorithm are acknowledged, and the model equations necessary for prediction are presented. A case study on a coal-fired power plant’s NO x emission rates is performed, directly comparing each modeling method’s performance on a mutual system. Each model is evaluated by its root mean squared error (RMSE) on out-of-sample future horizon predictions. Optimal hyperparameters are identified using either an exhaustive search or genetic algorithm. The top five model structures of each method are used to recursively predict future NO x emission rates over a 60-step time horizon. The RMSE at each future timestep is determined, and the recursive output prediction trends compared against measurements in time. The GRU neural network is identified as the best candidate for representing the system, demonstrating accurate and stable predictions across the future horizon by all considered models, while satisfactory performance was observed in several of the ARX/NARX formulations. Finally, these efforts have contributed 1) a concise resource of multiple proven dynamic machine learning methods, 2) a practical guide explaining the use of these methods, effectively lowering the “barrier-to-entry” of deploying such models in control systems, 3) a comparison study evaluating each method’s performance on a mutual system, 4) demonstration of accurate multi-timestep emissions modeling suitable for systems-level control, and 5) generalizable results demonstrating the suitability of each method for prediction over a multi-step future horizon to other complex dynamic systems.

42 ENGINEERING↗

DOE OSTI2016

Effect of substrate orientation on CdS homoepitaxy by molecular dynamics

CdS homoepitaxy growth was performed by molecular dynamics using different substrate orientations and structures in order to analyze the CdS crystallinity. As anticipated from thermodynamics of homoepitaxy, highly crystalline films with only point defects were obtained on substrates with rectangular surface geometries, including View the MathML source[112¯] zinc blende (ZB), [101¯0] wurtzite (WZ), [112¯0] WZ, [110][110] ZB, [010][010] ZB, and View the MathML source[1101110] ZB. In contrast, films grown on substrates with hexagonal surface geometries, corresponding to the [0001][0001] WZ and [111][111] ZB growth directions, showed structures with a large number of defects including; anti-sites, vacancies, stacking faults, twinning, and polytypism. WZ and ZB transitions and grain boundaries are identified using a lattice identification algorithm and represented graphically in a structural map. A dislocation analysis was performed to detect, identify, and quantify linear defects within the atomistic data. Systematic simulations using different temperatures, deposition rates, and substrate polarities were perform to analyze the trends of dislocation densities on [0001][0001] WZ direction and showed persistent polytypism. As a result, the polytypism observed in the films grown on the substrates with hexagonal surface geometry is attributed to the similar formation energies of the WZ and ZB phases.

36 MATERIALS SCIENCE↗

DOE OSTI2026

RU-net for automatic characterization of TRISO fuel cross sections

During irradiation, phenomena such as kernel swelling and buffer densification may impact the performance of tristructural isotropic (TRISO) particle fuel. Post-irradiation microscopy is often used to identify these irradiation-induced morphologic changes. However, each fuel compact generally contains thousands of TRISO particles. Manually performing the work to get statistical information on these phenomena is cumbersome and subjective. Here, to reduce the subjectivity inherent in that process and to accelerate data analysis, we used convolutional neural networks (CNNs) to automatically segment cross-sectional images of microscopic TRISO layers. CNNs are a class of machine-learning algorithms specifically designed for processing structured grid data. They have gained popularity in recent years due to their remarkable performance in various computer vision tasks, including image classification, object detection, and image segmentation. In this research, we generated a large irradiated TRISO layer dataset with more than 2,000 microscopic images of cross-sectional TRISO particles and the corresponding annotated images. Based on these annotated images, we used different CNNs to automatically segment different TRISO layers. These CNNs include RU-Net (developed in this study), as well as three existing architectures: U-Net, Residual Network (ResNet), and Attention U-Net. The preliminary results show that the model based on RU-Net performs best in terms of Intersection over Union (IoU). Using CNN models, we can expedite the analysis of TRISO particle cross sections, significantly reducing the manual labor involved and improving the objectivity of the segmentation results.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

DOE OSTI2025

Recent trends in all-organic polymer dielectrics for high-temperature electrostatic energy storage capacitors

Electrostatic energy storage (EES) capacitors are critical for renewable energy and high-power systems, driving the search for dielectric materials that combine superior electrical insulation, mechanical flexibility, low density, cost-effectiveness, and processability. Polymer-based dielectrics have emerged as leading candidates, particularly for high electric field applications. However, conventional polymers often fail to meet the demands of high-temperature environments due to increased electrical conductivity and reduced discharged energy density at elevated temperatures, resulting in energy loss and reduced performance. High glass transition temperature (T g) polymers show promise but require further optimization to enhance their energy storage capabilities under thermal and electrical stress. This review provides a comprehensive update on recent advancements in high-T g polymer-based dielectrics for EES capacitors, focusing on both intrinsic polymers and all-organic composites. It outlines key design principles, critical performance parameters, and innovative strategies—such as nanofiller doping, layered architectures, physical blending, and chemical crosslinking—to improve electrical, thermal, and mechanical properties. The review also highlights emerging trends, including the integration of machine learning algorithms to explore novel polymer structures and expand the chemical design space. By bridging the gap between academic research and industrial application, this review aims to accelerate the development of next-generation dielectric materials capable of balancing multiple performance metrics for high-temperature EES capacitors.

Xie, Zongliang↗

DOE OSTI2013

Semiclassical Monte-Carlo approach for modelling non-adiabatic dynamics in extended molecules

Modelling of non-adiabatic dynamics in extended molecular systems and solids is a next frontier of atomistic electronic structure theory. The underlying numerical algorithms should operate only with a few quantities (that can be efficiently obtained from quantum chemistry), provide a controlled approximation (which can be systematically improved) and capture important phenomena such as branching (multiple products), detailed balance and evolution of electronic coherences. Here we propose a new algorithm based on Monte-Carlo sampling of classical trajectories, which satisfies the above requirements and provides a general framework for existing surface hopping methods for non-adiabatic dynamics simulations. In particular, our algorithm can be viewed as a post-processing technique for analysing numerical results obtained from the conventional surface hopping approaches. Presented numerical tests for several model problems demonstrate efficiency and accuracy of the new method.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2022

Sub-10 second fly-scan nano-tomography using machine learning

Abstract X-ray computed tomography is a versatile technique for 3D structure characterization. However, conventional reconstruction algorithms require that the sample not change throughout the scan, and the timescale of sample dynamics must be longer than the data acquisition time to fulfill the stable sample requirement. Meanwhile, concerns about X-ray-induced parasite reaction and sample damage have driven research efforts to reduce beam dosage. Here, we report a machine-learning-based image processing method that can significantly reduce data acquisition time and X-ray dose, outperforming conventional approaches like Filtered-Back Projection, maximum-likelihood, and model-based maximum-a-posteriori probability. Applying machine learning, we achieve ultrafast nano-tomography with sub-10 second data acquisition time and sub-50 nm pixel resolution in a transmission X-ray microscope. We apply our algorithm to study dynamic morphology changes in a lithium-ion battery cathode under a heating rate of 50 o C min −1 , revealing crack self-healing during thermal annealing. The proposed method can be applied to various tomography modalities.

36 MATERIALS SCIENCE↗

DOE OSTI2022

Skew-Symmetric adjacency matrices for clustering directed graphs

Graph clustering methods often critically rely on the symmetry of graph matrices. Developing analogous methods for digraphs often proves more challenging, because digraph matrices are typically asymmetric and not orthogonally diagonalizable. However, researchers have recently proposed several complex-valued Hermitian digraph matrices. In particular, one such representation has been utilized as an input to an algorithm for finding imbalanced cuts. In this work, we establish an algebraic relationship between this matrix and an associated real-valued matrix. We show using this real-valued matrix for imbalanced cut-finding algorithms is not only sufficient but advantageous. Our algorithm uses less memory and asymptotically less computation while provably preserving solution quality. We also show our method can be easily implemented using standing computational building blocks, possesses better numerical properties, and loans itself to a natural interpretation via an objective function relaxation argument. We empirically demonstrate these advantages on real world data sets and show how our algorithm can uncover meaningful cluster structure.

Hayashi, Koby↗

DOE OSTI2017

A Work-Efficient Parallel Sparse Matrix-Sparse Vector Multiplication Algorithm

We design and develop a work-efficient multithreaded algorithm for sparse matrix-sparse vector multiplication (SpMSpV) where the matrix, the input vector, and the output vector are all sparse. SpMSpV is an important primitive in the emerging GraphBLAS standard and is the workhorse of many graph algorithms including breadth-first search, bipartite graph matching, and maximal independent set. As thread counts increase, existing multithreaded SpMSpV algorithms can spend more time accessing the sparse matrix data structure than doing arithmetic. Our shared-memory parallel SpMSpV algorithm is work efficient in the sense that its total work is proportional to the number of arithmetic operations required. The key insight is to avoid each thread individually scan the list of matrix columns. Our algorithm is simple to implement and operates on existing column-based sparse matrix formats. It performs well on diverse matrices and vectors with heterogeneous sparsity patterns. A high-performance implementation of the algorithm attains up to 15x speedup on a 24-core Intel Ivy Bridge processor and up to 49x speedup on a 64-core Intel KNL manycore processor. In contrast to implementations of existing algorithms, the performance of our algorithm is sustained on a variety of different input types include matrices representing scale-free and high-diameter graphs.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Improving Property Graph Layouts by Leveraging Attribute Similarity for Structurally Equivalent Nodes

Many real-world networks contain structurally-equivalent nodes. These are defined as vertices that share the same set of neighboring nodes, making them interchangeable with a traditional graph layout approach. However, many real-world graphs also have properties associated with nodes, adding additional meaning to them. We present an approach for swapping locations of structurally-equivalent nodes in graph layout so that those with more similar properties have closer proximity to each other. This improves the usefulness of the visualization from an attribute perspective without negatively impacting the visualization from a structural perspective. We include an algorithm for finding these sets of nodes in linear time, as well as methodologies for ordering nodes based on their attribute similarity, which works for scalar, ordinal, multidimensional, and categorical data.

graph drawing, network visualization, property gra↗

DOE OSTI2020

Low-Memory, Discrete Ordinates, Discontinuous Galerkin Methods for Radiative Transport

The discrete ordinates discontinuous Galerkin (SN-DG) method is a well-established and practical approach for solving the radiative transport equation. In this paper, we study a low-memory variation of the upwind SN-DG method. The proposed method uses a smaller finite element space that is constructed by coupling spatial unknowns across collocation angles, thereby yielding an approximation with fewer degrees of freedom than the standard method. Like the original SN-DG method, the low-memory variation still preserves the asymptotic diffusion limit and maintains the characteristic structure needed for mesh sweeping algorithms. While we observe second-order convergence in the scattering dominated, diffusive regime, the low-memory method is in general only first-order accurate. To address this issue, we use upwind reconstruction to recover second-order accuracy. Finally, for both methods, numerical procedures based on upwind sweeps are proposed to reduce the system dimension in the underlying Krylov solver strategy.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2015

The midpoint between dipole and parton showers

We present a new parton-shower algorithm. Borrowing from the basic ideas of dipole cascades, the evolution variable is judiciously chosen as the transverse momentum in the soft limit. This leads to a very simple analytic structure of the evolution. A weighting algorithm is implemented that allows one to consistently treat potentially negative values of the splitting functions and the parton distributions. Thus, we provide two independent, publicly available implementations for the two event generators PYTHIA and SHERPA.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2014

Predicting and Detecting Emerging Cyberattack Patterns Using StreamWorks

The number and sophistication of cyberattacks on industries and governments have dramatically grown in recent years. To counter this movement, new advanced tools and techniques are needed to detect cyberattacks in their early stages such that defensive actions may be taken to avert or mitigate potential damage. From a cybersecurity analysis perspective, detecting cyberattacks may be cast as a problem of identifying patterns in computer network traffic. Logically and intuitively, these patterns may take on the form of a directed graph that conveys how an attack or intrusion propagates through the computers of a network. Such cyberattack graphs could provide cybersecurity analysts with powerful conceptual representations that are natural to express and analyze. We have been researching and developing graph-centric approaches and algorithms for dynamic cyberattack detection. The advanced dynamic graph algorithms we are developing will be packaged into a streaming network analysis framework known as StreamWorks. With StreamWorks, a scientist or analyst may detect and identify precursor events and patterns as they emerge in complex networks. This analysis framework is intended to be used in a dynamic environment where network data is streamed in and is appended to a large-scale dynamic graph. Specific graphical query patterns are decomposed and collected into a graph query library. The individual decomposed subpatterns in the library are continuously and efficiently matched against the dynamic graph as it evolves to identify and detect early, partial subgraph patterns. The scalable emerging subgraph pattern algorithms will match on both structural and semantic network properties.

Chin, George↗

DOE OSTI2022

Properly Learning Decision Trees in almost Polynomial Time

We give an n O (log log n ) -time membership query algorithm for properly and agnostically learning decision trees under the uniform distribution over { ± 1} n . Even in the realizable setting, the previous fastest runtime was n O (log n ) , a consequence of a classic algorithm of Ehrenfeucht and Haussler. Our algorithm shares similarities with practical heuristics for learning decision trees, which we augment with additional ideas to circumvent known lower bounds against these heuristics. To analyze our algorithm, we prove a new structural result for decision trees that strengthens a theorem of O’Donnell, Saks, Schramm, and Servedio. While the OSSS theorem says that every decision tree has an influential variable, we show how every decision tree can be “pruned” so that every variable in the resulting tree is influential.

Computer Science↗

DOE OSTI2024

AMReX v2024

The software framework, AMReX, supports the development of block-structured adaptive mesh refinement (AMR) algorithms for solving systems of partial differential equations. AMR reduces the computational cost and memory footprint compared to a uniform mesh while preserving the essential local descriptions of different physical processes in complex multiphysics algorithms. AMR uses a hierarchical representation of the solution at multiple levels of resolution where the solution on each level is defined on the union of data containers at that resolution. These data containers, which represent the solution over a logically rectangular subregion of the domain, can contain field data defined on a mesh, Lagrangian particles or combinations of both. In addition to these basic data types, AMReX supports a multilevel embedded boundary representation of complex geometry; linear solvers for cell-centered and nodal data; asynchronous I/O in a native format readable by ParaView, VisIt and yt; and interfaces to hypre and PETSc solvers. AMReX enables applications to run on distributed memory architectures with multicore CPUs and with GPU accelerators. AMReX uses a lightweight abstraction layer that effectively hides the details of the architecture from the application. The framework currently supports CUDA, HIP and SYCL for GPU acceleration and OpenMP for multi-core CPU architectures.

Almgren, Ann↗

DOE OSTI2022

Basement Fault Activation before Larger Earthquakes in Oklahoma and Kansas

Oklahoma and Kansas experienced unprecedented seismic activity over the past decade due to earthquakes associated with unconventional hydrocarbon development. The modest natural seismicity and incomplete knowledge of the fault network in the region made it difficult to anticipate the locations of earthquakes with larger magnitudes (M w ≥ 4). Here, we show that monitoring of microearthquakes at regional scale using a pretrained neural phase picker and an earthquake relocation algorithm can illuminate unknown fault structures, and deliver information that can be synthesized for earthquake forecasting. We found that 80% of the larger earthquakes that occurred in the past decade could have been anticipated based on the spatial extent of the seismicity clusters that were formed before these earthquakes occurred. We also found that once a seismicity cluster with a length scale enough to host a larger earthquake was formed, there was a ~5% chance that it would host one or more larger earthquakes within a year. This probability is nearly an order of magnitude higher than one based on Gutenberg–Richter statistics and preceding seismicity. Applying our approach in practice can provide critical information on seismic hazards for risk management and regulatory decision making.

58 GEOSCIENCES↗

DOE OSTI2017

Final technical report: SciDAC partnership "Predictive Computing for Condensed Matter"

Fundamental progress in energy technology depends critically on our ability to design, fabricate, characterize, and optimize advanced materials that can convert, transport, and store energies as well as display useful functions at minimum energy consumptions. To achieve this, we must first understand mechanisms underlying the functions and then be able to design materials with predicted properties. Unlike conventional structural materials, optoelectronic or magnetic materials for energy technology operate by quantum mechanical principles, which are hard to extract from experiments alone. Some representative unsolved problems of condensed-phase electronic structures in general include (1) the detailed mechanism of high-temperature superconductors such as cuprates and iron-arsenide materials; (2) the structures of solids in the presence of polymorphism; (3) excited states in solids and systematically accurate calculations of quasiparticle energy bands; (4) the structure of strongly correlated wave functions of solids. In this project, we aim at establishing general and predictive mathematical theories for solids and computational methods that implement them. We will then apply these methods to outstanding solid-state problems recognized by experimentalists including the above, with a view to solving them computationally. Hence, the project has the following three research objectives, all of which have been met: Predictive Electronic Structure Theories for Solids, Scalable Algorithms and Software, and Applications to Outstanding Condensed Matter Problems.

74 ATOMIC AND MOLECULAR PHYSICS↗

DOE OSTI2016

Data-Driven Optimization for the Design and Control of Large-Scale Systems (LDRD Final Report)

Engineering decisions are often formulated as optimization problems such as the optimal design or control of physical systems. In these applications, the resulting optimization problems are constrained by large-scale simulations involving systems of partial differential equations (PDEs), ordinary differential equations (ODEs), and differential algebraic equations (DAEs). In addition, critical components of these systems are fraught with uncertainty, including unverifiable modeling assumptions, unknown boundary and initial conditions, and uncertain coefficients. Typically, these components are estimated using noisy and incomplete data from a variety of sources (e.g., physical experiments). The lack of knowledge of the true underlying probabilistic characterization of model inputs motivates the need for optimal solutions that are robust to this uncertainty. In this report, we introduce a framework for handling "distributional" uncertainties in the context of simulation-based optimization. This includes a novel measure discretization technique that will lead to an adaptive optimization algorithm tailored to exploit the structures inherent to simulation- based optimization.

42 ENGINEERING↗

DOE OSTI2019

Asynchronous Graphs (Final Report)

The most performant massive-scale distributed graph analytic engines were essentially unusable for anything but the analytic they were tuned to solve. The project team had previously developed HavoqGT and used this project to demonstrate it as a flexible graph framework, aiming to extend algorithmic capabilities, improve underlying data structures, and develop novel communication paradigms to enable new data analysis missions. Highlights of the technology developed include (a) a new distributed communication paradigm dubbed You’ve Got Mail (YGM), (b) a performant exact and fuzzy HPC graph pattern matching approach, and (c) a distributed biased random walk simulation capability. The project was successful on several measurable fronts, including advancing computer science (reflected by publishing 14 peer-reviewed research papers yielding 4 publication awards and over 16 conference presentations), contributing tangibly to LLNL recruiting rare talent, and obtaining follow-on funding. These technologies were transferred to several FY19-20 programmatic projects and will continue to be leveraged by new research projects for several years.

97 MATHEMATICS AND COMPUTING↗