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 1,441 records · Page 80
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

Causation entropy from symbolic representations of dynamical systems

Identification of causal structures and quantification of direct information flows in complex systems is a challenging yet important task, with practical applications in many fields. Data generated by dynamical processes or large-scale systems are often symbolized, either because of the finite resolution of the measurement apparatus, or because of the need of statistical estimation. By algorithmic application of causation entropy, we investigated the effects of symbolization on important concepts such as Markov order and causal structure of the tent map. We uncovered that these quantities depend nonmonotonically and, most of all, sensitively on the choice of symbolization. Indeed, we show that Markov order and causal structure do not necessarily converge to their original analog counterparts as the resolution of the partitioning becomes finer.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Thunderstorm Cloud-Type Classification from Space-Based Lightning Imagers

The organization and structure of thunderstorms determines the extent and severity of their hazards to the general public and their consequences for the Earth system. Distinguishing vigorous convective regions that produce heavy rain and hail from adjacent regions of stratiform clouds or overhanging anvil clouds that produce light to no rainfall is valuable in operations and physical research. Cloud-type algorithms that partition convection from stratiform regions have been developed for space-based radar, passive microwave, and now Geostationary Operational Environmental Satellites (GOES) Advanced Baseline Imager (ABI) multispectral products. However, there are limitations for each of these products including temporal availability, spatial coverage, and the degree to which they based on cloud microphysics. We report we have developed a cloud-type algorithm for GOES Geostationary Lightning Mapper (GLM) observations that identifies convective/nonconvective regions in thunderstorms based on signatures of interactions with nonconvective charge structures in the lightning flash data. The GLM sensor permits a rapid (20 s) update cycle over the combined GOES-16–GOES-17 domain across all hours of the day. Storm regions that do not produce lightning will not be classified by our algorithm, however. The GLM cloud-type product is intended to provide situational awareness of electrified nonconvective clouds and to complement other cloud-type retrievals by providing a contemporary assessment tied to lightning physics. We propose that a future combined ABI–GLM cloud-type algorithm would be a valuable product that could draw from the strengths of each instrument and approach.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2018

The Chern–Simons current in time series of knots and links in proteins

A superspace model of knots and links for DNA time series data is proposed to take into account the feedback loop from docking to undocking state of protein–protein interactions. In particular, the direction of interactions between the 8 hidden states of DNA is considered. It is a E{sub 8}×E{sub 8} unified spin model where the genotype, from active and inactive side of DNA time data series, can be considered for any living organism. The mathematical model is borrowed from loop-quantum gravity and adapted to biology. It is used to derive equations for gene expression describing transitions from ground to excited states, and for the 8 coupling states between geneon and anti-geneon transposon and retrotransposon in trash DNA. Specifically, we adopt a modified Grothendieck cohomology and a modified Khovanov cohomology for biology. The result is a Chern–Simons current in (8+3) extradimensions of a given unoriented supermanifold with ghost fields of protein structures. The 8 dimensions come from the 8 hidden states of spinor field of genetic code. The extradimensions come from the 3 types of principle fiber bundle in the secondary protein.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

MDTri: robust and efficient global mixed integer search of spaces of multiple ternary alloys: A DIRECT-inspired optimization algorithm for experimentally accessible computational material design

Computational materials design has suffered from a lack of algorithms formulated in terms of experimentally accessible variables. Here we formulate the problem of (ternary) alloy optimization at the level of choice of atoms and their composition that is normal for synthesists. Mathematically, this is a mixed integer problem where a candidate solution consists of a choice of three elements, and how much of each of them to use. This space has the natural structure of a set of equilateral triangles. We solve this problem by introducing a novel version of the DIRECT algorithm that (1) operates on equilateral triangles instead of rectangles and (2) works across multiple triangles. We demonstrate on a test case that the algorithm is both robust and efficient. Lastly, we offer an explanation of the efficacy of DIRECT -- specifically, its balance of global and local search -- by showing that 'potentially optimal rectangles' of the original algorithm are akin to the Pareto front of the 'multi-component optimization' of global and local search.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

The equation of state of neutron matter, symmetry energy and neutron star structure

We review the calculation of the equation of state of pure neutron matter using quantum Monte Carlo (QMC) methods. QMC algorithms permit the study of many-body nuclear systems using realistic two-and three-body forces in a non-perturbative framework. We present the results for the equation of state of neutron matter, and focus on the role of three-neutron forces at supranuclear density. We discuss the correlation between the symmetry energy, the neutron star radius and the symmetry energy. We also combine QMC and theoretical models of the three-nucleon interactions, and recent neutron star observations to constrain the value of the symmetry energy and its density dependence.

Gandolfi, S.↗
DOE OSTI2021

Using MLIR Framework for Codesign of ML Architectures Algorithms and Simulation Tools

MLIR (Multi-Level Intermediate Representation), is an extensible compiler framework that supports high-level data structures and operation constructs. These higher-level code representations are particularly applicable to the artificial intelligence and machine learning (AI/ML) domain, allowing developers to more easily support upcoming heterogeneous AI/ML accelerators and develop flexible domain specific compilers/frameworks with higher-level intermediate representations (IRs) and advanced compiler optimizations. The result of using MLIR within the LLVM compiler framework is expected to yield significant improvement in the quality of generated machine code, which in turn will result in improved performance and hardware efficiency

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

ED-cPSD: Fast Phase-Size Distribution via Sequential Erosion-Dilation

The Erosion-Dilation continuous Phase-Size Distribution, ED-cPSD, is an application for calculating continuous pore and particle-size distribution from digital reconstructions and/or image-based structural data. It is based on the erosion-dilation continuous phase-size distribution method. A continuous size distribution is a measure of the probability density of finding a particle or pore of a certain size. These distributions are of interest in any field of study involving porous media, including but not limited to electrochemistry, petroleum engineering, geology, and food science. The algorithm behind the software provides a computationally efficient way to calculate phase-size distributions for large domains. For a 3D battery electrode reconstruction with 1.3 x 10 8 voxels, the particle size distribution is derived in under 2 min on a desktop, while also retaining flexibility and computational efficiency for HPC-scale multi-threading. The software can handle structures with over 10 9 voxels. The algorithm is roughly 280 times faster than a previous version on the same task.

Characterization↗
DOE OSTI2014

Clusters, groups, and filaments in the Chandra deep field-south up to redshift 1

We present a comprehensive structure detection analysis of the 0.3 deg{sup 2} area of the MUSYC-ACES field, which covers the Chandra Deep Field-South (CDFS). Using a density-based clustering algorithm on the MUSYC and ACES photometric and spectroscopic catalogs, we find 62 overdense regions up to redshifts of 1, including clusters, groups, and filaments. We also present the detection of a relatively small void of ∼10 Mpc{sup 2} at z ∼ 0.53. All structures are confirmed using the DBSCAN method, including the detection of nine structures previously reported in the literature. We present a catalog of all structures present, including their central position, mean redshift, velocity dispersions, and classification based on their morphological and spectroscopic distributions. In particular, we find 13 galaxy clusters and 6 large groups/small clusters. Comparison of these massive structures with published XMM-Newton imaging (where available) shows that 80% of these structures are associated with diffuse, soft-band (0.4-1 keV) X-ray emission, including 90% of all objects classified as clusters. The presence of soft-band X-ray emission in these massive structures (M {sub 200} ≥ 4.9 × 10{sup 13} M {sub ☉}) provides a strong independent confirmation of our methodology and classification scheme. In the closest two clusters identified (z < 0.13) high-quality optical imaging from the Deep2c field of the Garching-Bonn Deep Survey reveals the cD galaxies and demonstrates that they sit at the center of the detected X-ray emission. Nearly 60% of the clusters, groups, and filaments are detected in the known enhanced density regions of the CDFS at z ≅ 0.13, 0.52, 0.68, and 0.73. Additionally, all of the clusters, bar the most distant, are found in these overdense redshift regions. Many of the clusters and groups exhibit signs of ongoing formation seen in their velocity distributions, position within the detected cosmic web, and in one case through the presence of tidally disrupted central galaxies exhibiting trails of stars. These results all provide strong support for hierarchical structure formation up to redshifts of 1.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Efficient and universal characterization of atomic structures through a topological graph order parameter

Abstract A graph-based order parameter, based on the topology of the graph itself, is introduced for the characterization of atomistic structures. The order parameter is universal to any material/chemical system and is transferable to all structural geometries. Four sets of data are used to validate both the generalizability and accuracy of the algorithm: (1) liquid lithium configurations spanning up to 300 GPa, (2) condensed phases of carbon along with nanotubes and buckyballs at ambient and high temperature, (3) a diverse set of aluminum configurations including surfaces, compressed and expanded lattices, point defects, grain boundaries, liquids, nanoparticles, all at nonzero temperatures, and (4) eleven niobium oxide crystal phases generated with ab initio molecular dynamics. We compare our proposed method to existing, state-of-the-art methods for the cases of aluminum and niobium oxide. Our order parameter uniquely classifies every configuration and outperforms all studied existing methods, opening the door for its use in a multitude of complex application spaces that can require fine structure-level characterization of atomistic graphs.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Exploring cryo-electron microscopy with molecular dynamics

Single particle analysis cryo-electron microscopy (EM) and molecular dynamics (MD) have been complimentary methods since cryo-EM was first applied to the field of structural biology. The relationship started by biasing structural models to fit low-resolution cryo-EM maps of large macromolecular complexes not amenable to crystallization. The connection between cryo-EM and MD evolved as cryo-EM maps improved in resolution, allowing advanced sampling algorithms to simultaneously refine backbone and sidechains. Moving beyond a single static snapshot, modern inferencing approaches integrate cryo-EM and MD to generate structural ensembles from cryo-EM map data or directly from the particle images themselves. We summarize the recent history of MD innovations in the area of cryo-EM modeling. The merits for the myriad of MD based cryo-EM modeling methods are discussed, as well as, the discoveries that were made possible by the integration of molecular modeling with cryo-EM. Lastly, current challenges and potential opportunities are reviewed.

Biochemistry & Molecular Biology↗
DOE OSTI2018

A framework for the identification of full-field structural dynamics using sequences of images in the presence of non-ideal operating conditions

Recent developments in the ability to automatically and efficiently extract natural frequencies, damping ratios, and full-field mode shapes from video of vibrating structures has great potential for reducing the resources and time required for performing experimental and operational modal analysis at very high spatial resolution. Furthermore, these techniques have the added advantage that they can be implemented remotely and in a non-contact fashion. Emerging full-field imaging techniques therefore have potential to allow the identification of the modal properties of structures in regimes that used to be challenging. For instance, these techniques suggest that the high spatial resolution structural identification could be performed on an aircraft during flight using a ground or aircraft-based imager. They also have the potential to identify the dynamics of microscopic systems. In order to realize this capability it will be necessary to develop techniques that can extract full-field structural dynamics in the presence of non-ideal operating conditions. In this work, we develop a framework for the deployment of emerging algorithms that allow the automatic extraction of high-resolution, full-field modal parameters in the presence of non-ideal operating conditions. One of the most notable non-ideal operating conditions is the rigid body motion of both the structure being measured as well as the imager performing the measurement. We demonstrate an instantiation of the framework by showing how it can be used to address, in-plane, translational, rigid body motion. The development of a frame-to-frame keypoint–based technique for identifying full-field structural dynamics in the presence of either rigid body motion is presented and demonstrated in the context of the framework for the deployment of full-field structural identification techniques in the presence of non-ideal operating conditions. It is expected that this framework will ultimately help enable the collection of full-field structural dynamics using measurement platforms including unmanned aerial vehicles, robotic telescopes, satellites, imagers mounted in high-vibration environments (seismic, industrial, harsh weather), characterization of microscopic structures, and human-carried imagers. If imager-based structural identification techniques mature to the point that they can be used in non-ideal field conditions, it could open up the possibility that the structural health monitoring community will be able to think beyond monitoring individual structures, to full-field structural integrity monitoring at the city scale.

Dasari, Sudeep↗
DOE OSTI2022

Neural network accelerator for quantum control

Efficient quantum control is necessary for practical quantum computing implementations with current technologies. Conventional algorithms for determining optimal control parameters are computationally expensive, largely excluding them from use outside of the simulation. Existing hardware solutions structured as lookup tables are imprecise and costly. By designing a machine learning model to approximate the results of traditional tools, a more efficient method can be produced. Such a model can then be synthesized into a hardware accelerator for use in quantum systems. In this study, we demonstrate a machine learning algorithm for predicting optimal pulse parameters. This algorithm is lightweight enough to fit on a low-resource FPGA and perform inference with a latency of 175 ns and pipeline interval of 5 ns with > 0.99 gate fidelity. In the long term, such an accelerator could be used near quantum computing hardware where traditional computers cannot operate, enabling quantum control at a reasonable cost at low latencies without incurring large data bandwidths outside of the cryogenic environment.

43 PARTICLE ACCELERATORS↗
DOE OSTI2014

New algorithms for iterative matrix‐free eigensolvers in quantum chemistry

New algorithms for iterative diagonalization procedures that solve for a small set of eigen‐states of a large matrix are described. The performance of the algorithms is illustrated by calculations of low and high‐lying ionized and electronically excited states using equation‐of‐motion coupled‐cluster methods with single and double substitutions (EOM‐IP‐CCSD and EOM‐EE‐CCSD). We present two algorithms suitable for calculating excited states that are close to a specified energy shift (interior eigenvalues). One solver is based on the Davidson algorithm, a diagonalization procedure commonly used in quantum‐chemical calculations. The second is a recently developed solver, called the “Generalized Preconditioned Locally Harmonic Residual (GPLHR) method.” We also present a modification of the Davidson procedure that allows one to solve for a specific transition. The details of the algorithms, their computational scaling, and memory requirements are described. The new algorithms are implemented within the EOM‐CC suite of methods in the Q‐Chem electronic structure program. © 2014 Wiley Periodicals, Inc.

Zuev, Dmitry↗
DOE OSTI2026

Towards gradient multimaterial toolpath generation for direct ink writing with connected fermat spirals

This work describes advances towards a reproducible, parametrically defined algorithm for generating graded multimaterial toolpaths for direct ink writing. Expanding on the existing Fermat space-filling algorithm and coupling with image-driven processing techniques, we demonstrate the fabrication of multimaterial structures. Here, material composition is encoded within toolpaths by parsing hue values from a multi-colored image. By performing dynamic velocity compensation based on local curvature and Euclidean distance filtering, internal voids are mitigated while optimizing print fidelity. Here, the work opens new avenues for designing complex toolpaths with locally programmable composition.

3D Printing↗
DOE OSTI2013

Block-oriented modeling of superstructure optimization problems

We present a novel software framework for modeling large-scale engineered systems as mathematical optimization problems. A key motivating feature in such systems is their hierarchical, highly structured topology. Existing mathematical optimization modeling environments do not facilitate the natural expression and manipulation of hierarchically structured systems. Rather, the modeler is forced to "flatten" the system description, hiding structure that may be exploited by solvers, and obfuscating the system that the modeling environment is attempting to represent. To correct this deficiency, we propose a Python-based "block-oriented" modeling approach for representing the discrete components within the system. Our approach is an extension of the Pyomo library for specifying mathematical optimization problems. Through the use of a modeling components library, the block-oriented approach facilitates a clean separation of system superstructure from the details of individual components. This approach also naturally lends itself to expressing design and operational decisions as disjunctive expressions over the component blocks. By expressing a mathematical optimization problem in a block-oriented manner, inherent structure (e.g., multiple scenarios) is preserved for potential exploitation by solvers. In particular, we show that block-structured mathematical optimization problems can be straightforwardly manipulated by decomposition-based multi-scenario algorithmic strategies, specifically in the context of the PySP stochastic programming library. We illustrate our block-oriented modeling approach using a case study drawn from the electricity grid operations domain: unit commitment with transmission switching and N - 1 reliability constraints. Finally, we demonstrate that the overhead associated with block-oriented modeling only minimally increases model instantiation times, and need not adversely impact solver behavior. (C) 2013 Elsevier Ltd. All rights reserved.

Friedman, Z↗
DOE OSTI2019

A memory-distributed quasi-Newton solver for nonlinear programming problems with a small number of general constraints

We approach the problem of parallelizing state-of-the-art nonlinear programming optimization algorithms.Specifically, we focus on parallelizing quasi-Newton interior-point methods that use limited-memory secant Hessian approximations. Such interior-point methods are known to have better convergence properties and to be more effective on large-scale problems than gradient-based and derivative-free optimization algorithms. We target nonlinear and potentially nonconvex optimization problems with an arbitrary number of bound constraints and a small number of general equality and inequality constraints on the optimization variables. These problems occur for example in the form of optimal control, optimal design, and inverse problems governed by ordinary or partial differential equations, whenever they are expressed in a “reduced-space” optimization approach. We introduce and analyze the time and space complexity of a decomposition method for solving the quasi-Newton linear systems that leverages the fact that the quasi-Newton Hessian matrix has a small number of dense blocks that border a low-rank update of a diagonal matrix. This enables an efficient parallelization on memory-distributed computers of the iterations of the optimization algorithm, a state-of-the-art filter line-search interior-point algorithm by Wächter et. al. We illustrate the efficiency of the proposed method by solving structural topology optimization problems on up to 4608 cores on a parallel machine.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Network Analysis of Academic Medical Center Websites in the United States

Healthcare resources are published annually in repositories such as the AHA Annual Survey Database TM . However, these data repositories are created via manual surveying techniques which are cumbersome in collection and not updated as frequently as website information of the respective hospital systems represented. Also, this resource is not widely available to patients in an easy-to-use format. Network analysis techniques have the potential to create topological maps which serve to aid in pathfinding for patients in their search for healthcare services. This study explores the topological structure of forty United States academic health center websites. Network analysis is utilized to analyze and visualize 48,686 webpages. Several elements of network structure are examined including basic network properties, and centrality measures distributions. The Louvain community detection algorithm is used to examine the extent to which these techniques allow identification of healthcare resources within networks. The results indicate that websites with related healthcare services tend to form observable clusters useful in mapping key resources within a hospital system.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Real-time coherent diffraction inversion using deep generative networks

Abstract Phase retrieval, or the process of recovering phase information in reciprocal space to reconstruct images from measured intensity alone, is the underlying basis to a variety of imaging applications including coherent diffraction imaging (CDI). Typical phase retrieval algorithms are iterative in nature, and hence, are time-consuming and computationally expensive, making real-time imaging a challenge. Furthermore, iterative phase retrieval algorithms struggle to converge to the correct solution especially in the presence of strong phase structures. In this work, we demonstrate the training and testing of CDI NN, a pair of deep deconvolutional networks trained to predict structure and phase in real space of a 2D object from its corresponding far-field diffraction intensities alone. Once trained, CDI NN can invert a diffraction pattern to an image within a few milliseconds of compute time on a standard desktop machine, opening the door to real-time imaging.

97 MATHEMATICS AND COMPUTING↗