Search NASA⌕ Search

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.

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

At least 541 records · Page 30

Machine learning for deep elastic strain engineering of semiconductor electronic band structure and effective mass

Abstract The controlled introduction of elastic strains is an appealing strategy for modulating the physical properties of semiconductor materials. With the recent discovery of large elastic deformation in nanoscale specimens as diverse as silicon and diamond, employing this strategy to improve device performance necessitates first-principles computations of the fundamental electronic band structure and target figures-of-merit, through the design of an optimal straining pathway. Such simulations, however, call for approaches that combine deep learning algorithms and physics of deformation with band structure calculations to custom-design electronic and optical properties. Motivated by this challenge, we present here details of a machine learning framework involving convolutional neural networks to represent the topology and curvature of band structures in k -space. These calculations enable us to identify ways in which the physical properties can be altered through “deep” elastic strain engineering up to a large fraction of the ideal strain. Algorithms capable of active learning and informed by the underlying physics were presented here for predicting the bandgap and the band structure. By training a surrogate model with ab initio computational data, our method can identify the most efficient strain energy pathway to realize physical property changes. The power of this method is further demonstrated with results from the prediction of strain states that influence the effective electron mass. We illustrate the applications of the method with specific results for diamonds, although the general deep learning technique presented here is potentially useful for optimizing the physical properties of a wide variety of semiconductor materials.

Tsymbalov, Evgenii↗

Tools and Models for Integrating Multiple Cellular Networks

In this grant, we have systematically investigated the integrated networks, which are responsible for the coordination of activity between metabolic pathways in prokaryotes. We have developed several computational tools to analyze the topology of the integrated networks consisting of metabolic, regulatory, and physical interaction networks. The tools are all open-source, and they are available to download from Github, and can be incorporated in the Knowledgebase. Here, we summarize our work as follow. Understanding the topology of the integrated networks is the first step toward understanding its dynamics and evolution. For Aim 1 of this grant, we have developed a novel algorithm to determine and measure the hierarchical structure of transcriptional regulatory networks [1]. The hierarchy captures the direction of information flow in the network. The algorithm is generally applicable to regulatory networks in prokaryotes, yeast and higher organisms. Integrated datasets are extremely beneficial in understanding the biology of a system in a compact manner due to the conflation of multiple layers of information. Therefore for Aim 2 of this grant, we have developed several tools and carried out analysis for integrating system-wide genomic information. To make use of the structural data, we have developed DynaSIN for protein-protein interactions networks with various dynamical interfaces [2]. We then examined the association between network topology with phenotypic effects such as gene essentiality. In particular, we have organized E. coli and S. cerevisiae transcriptional regulatory networks into hierarchies. We then correlated gene phenotypic effects by tinkering with different layers to elucidate which layers were more tolerant to perturbations [3]. In the context of evolution, we also developed a workflow to guide the comparison between different types of biological networks across various species using the concept of rewiring [4], and Furthermore, we have developed CRIT for correlation analysis in systems biology [5]. For Aim 3, we have further investigated the scaling relationship that the number of Transcription Factors (TFs) in a genome is proportional to the square of the total number of genes. We have extended the analysis from transcription factors to various classes of functional categories, and from individual categories to joint distribution [6]. By introducing a new analytical framework, we have generalized the original toolbox model to take into account of metabolic network with arbitrary network topology [7].

09 BIOMASS FUELS↗

A fast, efficient direct slicing method for slender member structures

We describe a method for quickly and efficiently slicing structures consisting of a large number of slender members called struts connected at node positions called joints. Previous research on periodic lattice structures shows these structures are highly mechanically efficient with exceptionally high stiffness- and strength-to-weight ratios. Additive manufacturing technologies allow the construction slender member structures with complicated macroscale shapes. These structures could consist of thousands or millions of geometric primitives describing the struts. Structures with large numbers of geometric objects cause the conventional methods for manipulating, storing, and slicing the geometry of these parts via STL files to be highly inefficient. This work describes an alternate design process for slender member structures using efficient methods for manipulating, storing, and slicing the geometry of the part. These new methods, in particular a fast, efficient direct slicing method, enable printing slender member structures with over one hundred thousand struts. The slicing algorithm is nearly perfectly parallel so it could extend to handle structures with over one million struts, helping to facilitate the adoption of slender member structures for engineering-scale applications.

36 MATERIALS SCIENCE↗

Elucidation of Bottom-up Growth of CaCO3 Involving Prenucleation Clusters from Structure Predictions and Decomposition of Globally Optimized (CaCO3)n Nanoclusters

Low-energy minima structures for (CaCO3)n, n = 28, are predicted using bottom-up genetic algorithms in conjunction with density functional theory electronic structure calculations, in comparison with the frozen and relaxed top-down clusters generated by cuts from the calcite, vaterite, and aragonite crystal structures. Similarities in structural motifs for the bottom-up and relaxed top-down are revealed using a fragment recognition technique. Fragment energy decomposition analysis shows that the bottom-up and relaxed top-down clusters belong to two classes of amorphous clusters with distinct intracluster energy distributions, despite their structural similarity. The bottom-up clusters with >20 formula units are surface stabilized with negative surface energy densities. In contrast, the top-down clusters are interior stabilized with positive surface energy densities. We prove that the sign of the surface energy density determines whether the nucleation reaction energy as a function of nuclear size has a maximum or a minimum. The surface-stabilized bottom-up clusters are proposed to be a type of prenucleation cluster at the minimum of the nucleation reaction energy. A mechanism for mineralization of CaCO3 involving prenucleation clusters and nonclassical growth pathway is proposed on the basis of our theoretical findings, which is consistent with previous titration experiments.

calcium carbonate, prenucleation cluster, biominer↗

A theoretical calculation of stacking fault energy of Ni alloys: The effects of temperature and composition

Combining cluster expansion (CE) method with one dimensional axial Ising model, this work investigated the effects of alloying elements and configurational variations due to temperature on the stacking fault energy (SFE) of FCC Ni binary alloys. Ensembles of large numbers of atomistic structures, each with more than ~400 atoms, were generated to consider sufficient long-range chemical disorder and temperature effects due to configurational entropy. Here, a Monte Carlo Metropolis algorithm was used to generate these structures, whose energies were then evaluated based on the effective cluster interactions obtained from CE. As a baseline, this work had shown the SFE of pure Ni and Al to be 127 mJ/m 2 and 137 mJ/m 2 , respectively, which agreed with the experimental values of 125 mJ/m 2 and 150 mJ/m 2 reported in the literature. Additions of Al, Ti, Cr and Co to pure Ni were found to decrease the SFE to different extents. Although temperature does not strongly influence the SFE of the FCC Ni-Al and Ni-Cr binary alloys, it can lead to significant changes to the SFE of the FCC Ni-Ti and Ni-Co alloys. While effects of temperature and composition on SFE observed in this work were calculated from binary Ni alloys, the general trends are nonetheless expected to be valid in the γ phase of multicomponent Ni superalloys.

36 MATERIALS SCIENCE↗

Extending DFT-based genetic algorithms by atom-to-place re-assignment via perturbation theory: A systematic and unbiased approach to structures of mixed-metallic clusters

Energy surfaces of metal clusters usually show a large variety of local minima. For homo-metallic species the energetically lowest can be found reliably with genetic algorithms, in combination with density functional theory without system-specific parameters. For mixed-metallic clusters this is much more difficult, as for a given arrangement of nuclei one has to find additionally the best of many possibilities of assigning different metal types to the individual positions. In the framework of electronic structure methods this second issue is treatable at comparably low cost at least for elements with similar atomic number by means of first-order perturbation theory, as shown previously [F. Weigend, C. Schrodt, and R. Ahlrichs, J. Chem. Phys. 121, 10380 (2004)]. In the present contribution the extension of a genetic algorithm with the re-assignment of atom types to atom sites is proposed and tested for the search of the global minima of PtHf{sub 12} and [LaPb{sub 7}Bi{sub 7}]{sup 4−}. For both cases the (putative) global minimum is reliably found with the extended technique, which is not the case for the “pure” genetic algorithm.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Tensor network investigation of the double layer Kagome compound Ca 10 Cr 7 O 28

Quantum spin liquids are exotic quantum phases of matter that do not order even at zero temperature. While there are several toy models and simple Hamiltonians that could host a quantum spin liquid as their ground state, it is very rare to find actual, realistic materials that exhibit their properties. At the same time, the classical simulation of such instances of strongly correlated systems is intricate and reliable methods are scarce. Here, in this work, we investigate the quantum magnet Ca 10 Cr 7 O 28 that has recently been discovered to exhibit properties of a quantum spin liquid in inelastic neutron scattering experiments. This compound has a distorted bilayer Kagome lattice crystal structure consisting of Cr 5+ ions with spin- moments. Coincidentally, the lattice structure renders a tensor network algorithm in 2D applicable that can be seen as a new variant of a projected entangled simplex state algorithm in the thermodynamic limit. In this first numerical investigation of this material that takes into account genuine quantum correlations, good agreement with the experimental findings is found. Our study contributes to uplifting tensor networks from conceptual tools to methods to describe real two-dimensional quantum materials.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗