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 865 records · Page 48

Structures and Stabilities of (MgO) n Nanoclusters

Global minima for (MgO) n structures were optimized using a tree growth–hybrid genetic algorithm in conjunction with MNDO/MNDO/d semiempirical molecular orbital calculations followed by density functional theory geometry optimizations with the B3LYP functional. New lowest energy isomers were found for a number of (MgO) n clusters. The most stable isomers for (MgO) n (n > 3) are 3-dimensional. For n < 20, hexagonal tubular (MgO)n structures are more favored in energy than the cubic structures. The cubic structures and their variations dominate after n = 20. For the cubic isomers, increasing the size of the cluster in any dimension improves the stability. The effectiveness of increasing the size of the cluster in a specific dimension to improve stability diminishes as the size in that dimension increases. For cubic structures of the same size, the most compact cubic structure is expected to be the more stable cubic structure. The average Mg–O bond distance and coordination number both increase as n increases. The calculated average Mg–O bond distance is 2.055 Å at n = 40, slightly smaller than the bulk value of 2.104 Å. The average coordination number is predicted to be 4.6 for the lowest energy (MgO) 40 as compared to the bulk value of 6. As n increases, the normalized clustering energy ΔE(n) for the (MgO) n increases and the slope of the ΔE(n) vs n curve decreases. The value of ΔE(40) is predicted to be 150 kcal/mol, as compared to the bulk value ΔE(∞) = 176 kcal/mol. Finally, the electronic properties of the clusters are presented and the reactive sites are predicted to be at the corners.

Environmental Molecular Sciences Laboratory↗

Pressure-induced superconductivity in the hydrogen-rich pseudobinary CaB - H n compounds

Here, the crystal structures of CaB – Hn compounds with n = 1 – 12 in a pressure range of 50–300 GPa were studied using the genetic algorithm method and first-principles density-function theory calculations. Stable structures with stoichiometry of CaB H 6 and CaB H 7 were predicted in different pressure range. BH 4 , BH 5 , and BH 6 units were found to be the main motifs in these compounds. Moreover, metastable Imm2 CaB H 7 is dynamically stable above 180 GPa, with the formation of tetrahedral BH 4 unit surrounded by Ca atom and H 3 unit. Electron-phonon coupling (EPC) calculations reveal that the superconducting properties are closely related to the strong hydrogen-boron bonding of the BH 4 unit in Imm2, and T c can reach ~200 K at 200 GPa. As the major units, BH 4 , BH 5 , and BH 6 units exist in the Imm2, P 2 , and P2 1 /m phases of CaB H 7 at 300 GPa, respectively; the corresponding EPC parameter λ decreases with the increase of hydrogen content in CaB H 7 .

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Structures and magnetic properties of Ni n (n = 36-40) clusters from first-principles calculations

A genetic algorithm (GA) coupled with a tight-binding (TB) interatomic potential is used to search for the low-energy structures of medium-sized Ni n (n = 36-40) clusters. Structural candidates obtained from our GA search are further optimized with first-principles calculations. The medium-sized nickel clusters ranging from 36 to 40 atoms are found to favor the double-icosahedron-based structures with a Ni7 core (a pentagonal bipyramidal structure) except Ni38 cluster. The lowest-energy structure of Ni38 can be considered to be a magic cluster, which is a typical face-centered cubic structure with large stability and magnetic moment.

Song, W.↗

Scalable edge clustering of dynamic graphs via weighted line graphs

Timestamped relational datasets consisting of records (or connections) between pairs of entities are ubiquitous in network science. For applications like peer-to-peer communication, email, various social network interactions, and computer network security, it is useful to organize these records into groups based on how and when they are occurring. Weighted line graphs offer a natural way to model how records are related in such datasets but for large real-world graph topologies, building and utilizing the line graph is prohibitively expensive. Here, we present the framework to cluster the edges of a dynamic graph via the associated line graph that contains two major contributions. The first is a method to work with the line graph implicitly and the second is a distributed scale implementation of an agglomerative hierarchical graph clustering algorithm. We outline a novel hierarchical dynamic graph edge clustering approach that efficiently breaks massive relational datasets into small sets of edges containing events at various timescales. This is in stark contrast to traditional graph clustering algorithms that prioritize highly connected (clique-like) community structures. Our approach relies on constructing a sufficient subgraph of a weighted line graph and applying a hierarchical agglomerative clustering. This approach is related to scalable techniques from spatial clustering, nonlinear-dimension reduction, topological data analysis, and draws particular inspiration from HDBSCAN. As an edge clustering, this method yields an overlapping node clustering. Our algorithm is parallelizable and we demonstrate efficient clustering of a billion-scale, real-world dynamic graph into small edge sets that correlate in topology and time. The entire clustering process for a graph with tens of billions of edges takes just a few minutes of run time on 256 nodes of a distributed compute environment. We argue how the output of the edge clustering is useful for a multitude of data visualization and powerful machine learning tasks, both involving the original massive dynamic graph data and metadata associated with the nodes and edges. Finally, we describe how this approach can be extended to dynamic hypergraphs and dynamic graphs/hypergraphs with unstructured data living on vertices and edges.

Data Analysis↗

Electromagnetic and neutral-weak response functions of 4 He and 12 C

A major goal of nuclear theory is to understand the strong interaction in nuclei as it manifests itself in terms of two- and many-body forces among the nuclear constituents, the protons and neutrons, and the interactions of these constituents with external electroweak probes via one- and many-body currents. The objective of the present work is to calculate the quasielastic electroweak response functions in light nuclei within the realistic dynamical framework outlined above. These response functions determine the inclusive cross section as function of the lepton momentum and energy transfers. Their ab initio calculation is a very challenging quantum many-body problem, since it requires summation over the entire excitation spectrum of the nucleus and inclusion in the electroweak currents of one- and many-body terms. Green's functions Monte Carlo methods allow one to circumvent both difficulties by computing the response in imaginary time (the so-called Euclidean response) and hence summing implicitly over the bound and continuum states of the nucleus, and by implementing specific algorithms designed to deal with the complicated spin-isospin structure of nuclear many-body operators. Theoretical predictions for 4 He and 12 C, confirmed by experiment in the electromagnetic case, show that two-body currents generate excess transverse strength from threshold to the quasielastic to the dip region and beyond. In conclusion, these results challenge the conventional picture of quasielastic inclusive scattering as being largely dominated by single-nucleon knockout processes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Tactical Analysis for Calculating Contextual Risk at Boundaries: Summary of Laboratory Directed Research & Development Effort

The Tactical Analysis for Calculating Contextual Risk at Boundaries (TACCRAB) tool is an innovative digital twin (DT) platform and automated risk algorithm designed to transform operational decision-making in structured screening environments, with an initial focus on Southern Border Land Ports of Entry (POEs). The invention provides integration points for advanced artificial intelligence, predictive modeling, and real-time data analysis to produce a comprehensive risk management tool that enables proactive, data-informed security strategies. The core inventive features of TACCRAB center on its unique risk algorithm, which dynamically calculates contextual risk by synthesizing historical data, near real-time streaming data from the checkpoints themselves, and AI-generated predictions. Unlike traditional risk assessment methods, TACCRAB utilizes a DT to provide comprehensive operational insights, allowing stakeholders to visualize, simulate, and optimize checkpoint configurations with unprecedented speed and contextual awareness. TACCRAB's key innovation lies in its ability to combine multiple complex inputs - including technology detection probabilities, resource availability, screening pathway characteristics, and threat actor behavioral patterns - into a unified risk calculation and update these inputs based on changing operational and environmental conditions. By leveraging a DT that continuously updates and learns from linked data, TACCRAB can suggest adaptive mitigation strategies that minimize risk while maintaining operational efficiency. Particularly novel is the platform's approach to decision support, which goes beyond static risk assessment. The DT provides dynamic metrics such as wait times, resource allocation effectiveness, and potential emerging threat scenarios, enabling users to view sophisticated, relevant what-if simulations and optimize checkpoint operations in near real-time. The system's architecture allows for generalized application across different screening environments, such as secure facilities, ports of entry, and soft targets, making it a versatile tool for security and operational management. The invention distinguishes itself through its comprehensive integration of predictive modeling, AI-driven pattern discovery, and user-friendly interface design. By combining these elements, TACCRAB transforms complex risk data into actionable insights, supporting decision-makers at various organizational levels - from booth agents making split-second screening decisions to checkpoint managers optimizing the day's resource allocation to strategic planners managing long-term investments.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Distribution of centrality measures on undirected random networks via the cavity method

The Katz centrality of a node in a complex network is a measure of the node’s importance as far as the flow of information across the network is concerned. For ensembles of locally tree-like undirected random graphs, this observable is a random variable. Its full probability distribution is of interest but difficult to handle analytically because of its “global” character and its definition in terms of a matrix inverse. Leveraging a fast Gaussian Belief Propagation-Cavity algorithm to solve linear systems on tree-like structures, we show that i) the Katz centrality of a single instance can be computed recursively in a very fast way, and ii) the probability P ( K ) that a random node in the ensemble of undirected random graphs has centrality K satisfies a set of recursive distributional equations, which can be analytically characterized and efficiently solved using a population dynamics algorithm. We test our solution on ensembles of Erdős-Rényi and Scale Free networks in the locally tree-like regime, with excellent agreement. The analytical distribution of centrality for the configuration model conditioned on the degree of each node can be employed as a benchmark to identify nodes of empirical networks with over- and underexpressed centrality relative to a null baseline. We also provide an approximate formula based on a rank- 1 projection that works well if the network is not too sparse, and we argue that an extension of our method could be efficiently extended to tackle analytical distributions of other centrality measures such as PageRank for directed networks in a transparent and user-friendly way.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Approximate Latent Factor Algorithm for Scenario Selection and Weighting in Transmission Expansion Planning

One major difficulty in transmission expansion planning is selecting the representative scenarios to use to evaluate candidate transmission networks. The variability in demand and renewable generation makes the inclusion of several scenarios critical when calculating reliability and cost, but including too many scenarios in an optimization is computationally intractable. To reduce the number of representative operating conditions needed to obtain an accurate approximation of the system, we propose a method rooted in multivariate statistics that exploits the latent correlative structure between different scenarios and network configurations. The proposed algorithm includes an objective and rigorous way to select a subset of scenarios that provide as much information about the system as possible, and a method to accurately approximate the system cost from that scenario subset. The result is a set of scenarios and weights that are easily incorporated into traditional transmission expansion planning formulations. We apply this to a 312-bus WECC model with 8,736 distinct operating conditions. The transmission plans found with the proposed method are more reliable and have a lower total cost than those from other scenario reduction techniques, as well as a smaller error between the expected system performance from the optimization objective and the actual system performance.

42 ENGINEERING↗

Ground-state structures of Hafnium clusters

Hafnium (Hf) is a very large tetra-valence d-block element which is able to form relatively long covalent bond. Researchers are interested to search for substitution to silicon in the semi-conductor industry. We attempt to obtain the ground-state structures of small Hf clusters at both empirical and density-functional theory (DFT) levels. For calculations at the empirical level, charge-optimized many-body functional potential (COMB) is used. The lowest-energy structures are obtained via a novel global-minimum search algorithm known as parallel tempering Monte-Carlo Basin-Hopping and Genetic Algorithm (PTMBHGA). The virtue of using COMB potential for Hf cluster calculation lies in the fact that by including the charge optimization at the valence shells, we can encourage the formation of proper bond hybridization, and thus getting the correct bond order. The obtained structures are further optimized using DFT to ensure a close proximity to the ground-state.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

High speed vibration compensation using magnetic fiducials via NIMBLE

Additive manufacturing (AM) technology, specifically 3D printing, holds great promise for in-orbit manufacturing. In-space printing can significantly reduce the mass, cost, and risk of long-term space exploration by enabling replacement parts to be made as needed and reducing dependence on Earth. However, printing in a zero-gravity environment poses challenges due to the absence of a rigid ground for the print platform, which can result in vibrational and rotational forces that may impact printing integrity. Here, to address this issue, this paper proposes a novel linear magnetic position tracking algorithm, named Navigation Integrating Magnets By Linear Estimation (NIMBLE), for dynamic vibration compensation during 3D printing of truss structures in space. Compared to the most commonly used nonlinear optimization method, the NIMBLE algorithm is more than two orders of magnitude faster. With only a single 3-axis magnet sensor and a small NdFeB magnet, the NIMBLE algorithm provides a simple and easily implemented tracking solution for in-orbit 3D printing.

3D printing in space↗

Determining the Adsorption Energetics of 2,3-Butanediol on RuO 2 (110): Coupling First-Principles Calculations With Global Optimizers

As climate change continues to pose a threat to the Earth due to the disrupted carbon cycles and fossil fuel resources remain finite, new sources of sustainable hydrocarbons must be explored. 2,3-butanediol is a potential source to produce butene because of its sustainability as a biomass-derived sugar. Butene is an attractive product because it can be used as a precursor to jet fuel, categorizing this work in the alcohol-to-jet pathway. While studies have explored the conversion of 2,3-butanediol to butene, little is understood about the fundamental reaction itself. We quantify the energetics for three pathways that were reported in the literature in the absence of a catalyst. One of these pathways forms a 1,3-butadiene intermediate, which is a highly exothermic process and thus is unlikely to occur since 2,3-butanediol likely gets thermodynamically trapped at this intermediate. We further determined the corresponding energetics of 2,3-butanediol adsorption on an ensemble of predetermined binding sites when it interacts with a defect-free stoichiometric RuO 2 (110) surface. Within this ensemble of adsorption sites, the most favorable site has 2,3-butanediol covering a Ru 5–coordinated cation. This approach is compared to that obtained using the global optimization algorithm as implemented in the Northwest Potential Energy Surface Search Engine. When using such a global optimization algorithm, we determined a more favorable ground-state structure that was missed during the manual adsorption site testing, with an adsorption energy of -2.61 eV as compared to -2.34 eV when using the ensemble-based approach. We hypothesize that the dehydration reaction requires a stronger chemical bond, which could necessitate the formation of oxygen vacancies. As such, this study has taken the first step toward the utilization of a global optimization algorithm for the rational design of Ru-based catalysts toward the formation of butene from sustainable resources.

09 BIOMASS FUELS↗

Dynamic linear response quantum algorithm

The dynamic linear response of a quantum system is critical for understanding both the structure and dynamics of strongly interacting quantum systems, including neutron scattering from materials, photon and electron scattering from atomic systems, and electron and neutrino scattering by nuclei. Here, we present a general algorithm for universal quantum computers to calculate the dynamic linear response function with controlled errors and to obtain information about specific final states that can be directly compared to experimental observations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

AEOLUS: Advances in Experimental Design, Optimal Control, and Learning for Uncertain Complex Systems

Sustained advances in the mathematics of modeling and simulation have resulted in the capability today for routine simulation of a number of large scale complex DOE-relevant systems. As remarkable as this capability for solving the so-called forward problem is, it is typically only the first step-an inner loop within an outer loop that explores the simulation model's parameter space and decision space to characterize uncertainty in the model's predictions, learn unknown model parameters from data, design the most informative experiments, determine optimal control strategies, and create optimal designs. Broadly, what unifies all of these outer loop problems is that they are, in one form or another, optimization problems over parameter/control/design space that are constrained by complex uncertain models. To fully realize the power of scientific simulation as a basis for scientific discovery, technological innovation, and rational decision-making, it is imperative to move beyond simulation to tackle the outer loop of optimization for learning from data, experimental design, and control with complex uncertain models. When the models under consideration are large-scale and complex, and when the optimization variable and uncertain parameter spaces are high (or infinite) dimensional, this constitutes a grand challenge of the highest order, and is intractable with conventional methods. To overcome these challenges, the AEOLUS Center was established to develop a unified mathematical, computational, and statistical framework for (1) Learning predictive models from complex data via Bayesian inference and optimization, and (2) Optimizing experiments, processes, and designs using the resulting uncertain models. These problems are intractable with conventional methods, for several reasons: (1) The simulation problems that govern the inner loops of the optimization problems are expensive to execute (due to severe nonlinearity, heterogeneity, multiphysics/multiscale coupling); (2) The optimization variable and uncertain parameter spaces are high dimensional, often stemming from discretizations of infinite dimensional fields such as initial conditions, sources, or material properties. We argue that the key to overcoming these challenges is to develop new mathematical, computational, and statistical methods that exploit the structure of the Bayesian inference and optimization problems mediated by their underlying complex uncertain models. This structure includes the regularity, sparsity, geometry, low intrinsic dimensionality, and multifidelity nature of the maps from uncertain parameter/optimization variable spaces to the specific objectives targeted: Bayesian inference, optimal experimental design, and optimal control design. Black box methods developed as generic tools are incapable of exploiting this structure. To be successful, we must create, integrate, and cross-fertilize ideas across multiple areas of applied math--including approximation theory, Bayesian inference, data science, experimental design, information theory, machine learning, model reduction, optimal control theory, parallel algorithms, PDE-constrained optimization, randomized algorithms, stochastic optimization, and uncertainty quantification--all while exploiting the structure of the problems at hand. With this goal in mind, we have marshaled a team of leading authorities in these areas. While the methods we develop will be broadly applicable across a wide spectrum of DOE problems in which experiments inform models and the systems those models describe must be optimized under uncertainty, we have chosen a specific area, advanced manufacturing and materials, to drive our work. AMM is characterized by complex models across multiple scales, and is a rich source of challenging problems in inference, experimental design, and optimal control, requiring multifaceted and integrated advances in applied mathematics. As such, AMM serves as an excellent vehicle to motivate and demonstrate the advances in applied mathematics developed by our center.

97 MATHEMATICS AND COMPUTING↗

Physics makes the difference: Bayesian optimization and active learning via augmented Gaussian process

Abstract Both experimental and computational methods for the exploration of structure, functionality, and properties of materials often necessitate the search across broad parameter spaces to discover optimal experimental conditions and regions of interest in the image space or parameter space of computational models. The direct grid search of the parameter space tends to be extremely time-consuming, leading to the development of strategies balancing exploration of unknown parameter spaces and exploitation towards required performance metrics. However, classical Bayesian optimization (BO) strategies based on the Gaussian process (GP) do not readily allow for the incorporation of the known physical behaviors or past knowledge. Here we explore a hybrid optimization/exploration algorithm created by augmenting the standard GP with a structured probabilistic model of the expected system’s behavior. This approach balances the flexibility of the non-parametric GP approach with a rigid structure of physical knowledge encoded into the parametric model. The fully Bayesian treatment of the latter allows additional control over the optimization via the selection of priors for the model parameters. The method is demonstrated for a noisy version of a standard univariate test function used to evaluate optimization algorithms and further extended to physical lattice models. This methodology is expected to be universally suitable for injecting prior knowledge in the form of physical models and past data in the BO framework.

42 ENGINEERING↗

Exploring the free energy surface using ab initio molecular dynamics

Efficient exploration of the configuration space and identification of metastable structures are challenging from both computational as well as algorithmic perspectives. Here, we extend the recently proposed orderparameter aided temperature accelerated sampling schemes to efficiently and systematically explore free energy surfaces, and search for metastable states and reaction pathways within the framework of density functional theory based molecular dynamics. The sampling method is applied to explore the relevant parts of the configuration space in prototypical materials SiO 2 and Ti to identify the different metastable structures corresponding to different phases in these materials. In addition, we use the string method in collective variables to study the melting pathways in the high pressure cotunnite phase of SiO 2 and the hcp to fcc phase transition in Ti.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

SU-E-I-92: Is Photon Starvation Preventing Metal Artifact Reduction Algorithm From Working in KVCT?

Purpose: High density/high atomic number metallic objects create shading and streaking metal artifacts in the CT image that can cause inaccurate delineation of anatomical structures or inaccurate radiation dose calculation. A modified iterative maximum-likelihood polychromatic algorithm for CT (mIMPACT) that models the energy response of detectors, photon interaction processes and beam polychromaticity has successfully reduced metal artifacts in MVCT. Our extension of mIMPACT in kVCT did not significantly reduce metal artifacts for high density metal like steel. We hypothesize that photon starvation may result in the measured data in a commercial kVCT imaging beam. Methods: We measured attenuation of a range of steel plate thicknesses, sandwiched between two 12cm thick solid water blocks, using a Phillips Big Bore CTTM scanner in scout acquisition mode with 120kVp and 200mAs. The transmitted signal (y) was normalized to the air scan signal (y{sub 0}) to get attenuation [i.e., ln(y/y{sub 0})] data for a detector. Results: Below steel plate thickness of 13.4mm, the variations in measured attenuation as a function of view number are characterized by a quantum noise and show increased attenuation with metal thickness. On or above this thickness the attenuation shows discrete levels in addition to the quantum noise. Some views have saturated attenuation value. The histograms of the measured attenuation for up to 36.7mm of steel show this trend. The detector signal is so small that the quantization levels in the analog to digital (A-to-D) converter are visible, a clear indication of photon starvation. Conclusion: Photons reaching the kVCT detector after passing through a thick metal plate are either so low in number that the signal measured has large quantum noise, or are completely absorbed inside the plate creating photon starvation. This is un-interpretable by the mIMPACT algorithm and cannot reduce metal artifacts in kVCT for certain realistic thicknesses of steel hip implants. Moti Raj Paudel is supported by the Vanier Canada Graduate Scholarship, the Endowed Graduate Scholarship in Oncology and the Dissertation Fellowship at the University of Alberta. The authors acknowledge the CIHR operating grant number MOP 53254.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Jaynesian Analysis of Environmental Chemistry: Systems Model Component Integration via the Arctic Aquatic Carbon Cycle

Focal Areas: All three are touched upon from the OBER call. We will consider formal logical inference and entropic information analysis for sparse but intensive chemical measurements, as optimal drivers for managing process complexity. As a centerpiece for the discussion we take soil-to-sea organic structural evolution within the Arctic hydro-geochemosphere, assessing detrital negentropy then algorithmic greed to generate ranked, reduced mechanisms for system integration.

54 ENVIRONMENTAL SCIENCES↗