Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm complexity analysis”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

The AXEAP2 program for K β X-ray emission spectra analysis using artificial intelligence

The processing and analysis of synchrotron data can be a complex task, requiring specialized expertise and knowledge. Our previous work addressed the challenge of X-ray emission spectrum (XES) data processing by developing a standalone application using unsupervised machine learning. However, the task of analyzing the processed spectra remains another challenge. Although the non-resonant K β XES of 3 d transition metals are known to provide electronic structure information such as oxidation and spin state, finding appropriate parameters to match experimental data is a time-consuming and labor-intensive process. Here, a new XES data analysis method based on the genetic algorithm is demonstrated, applying it to Mn, Co and Ni oxides. This approach is also implemented as a standalone application, Argonne X-ray Emission Analysis 2 ( AXEAP2 ), which finds a set of parameters that result in a high-quality fit of the experimental spectrum with minimal intervention. AXEAP2 is able to find a set of parameters that reproduce the experimental spectrum, and provide insights into the 3 d electron spin state, 3 d –3 p electron exchange force and K β emission core-hole lifetime.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Stereo-DIC Challenge 1.0 – Rigid Body Motion of a Complex Shape

Background Stereo-DIC is a widely used optical measurement technique that provides a dense full-field 3D measurement of the shape, displacement, and strain of a solid sample. When compared with 2D-DIC, Stereo-DIC provides greater flexibility and expands its use beyond flat, planar specimens. Furthermore, the widespread availability of commercial systems has led to the adoption of the technique throughout industry, academia, and government research labs. Objective Even though some research has been done to understand the effects of different experimental and stereo-DIC parameters, no reference is available to benchmark and compare the performance of current stereo-DIC algorithms to each other. Methods This paper provides the description and analysis of a carefully controlled 3D experiment and associated images used to compare the results from five subset based DIC software packages. Both the images and analysis codes used in this paper to compare the results are described here and are available for download and use for continued research. Results We show that over a very large range of motion, the 3D errors are very small, less than 80μm over a travel of ±20 mm out-of-plane and ±20 mm in-plane. While all codes performed similarly, there are important differences noted in the paper. Conclusion The image sets and results comparison software are hosted by the International DIC Society (www.iDICs.org) and are freely available for download and analysis for comparison with results in this paper. Furthermore, it is hoped that this set of images can be used for future research in improving stereo-DIC by future authors.

Algorithms comparison↗
DOE OSTI2025

Accelerating Advanced Light Source Science Through Multi-Facility HPC Workflows

Synchrotron light sources support a wide array of techniques to investigate materials, often producing complex, high-volume data that challenge traditional workflows. At the Advanced Light Source (ALS), we developed infrastructure to move microtomography data over ESnet to ALCF and NERSC, where CPU- and GPU-based algorithms generate 3D reconstructed volumes of experimental samples. We employ two data movement and reconstruction models: real-time processing as data streams directly to NERSC compute nodes, and automated file transfer to NERSC and ALCF file systems. The streaming pipeline provides users with feedback in under ten seconds, while the file-based workflow produces high-quality reconstructions suitable for deeper analysis in 20-30 minutes. This infrastructure enables users to utilize HPC resources without direct access to backend systems. We plan to extend this architecture to more endstations, supporting our beamline scientists and users.

Abramov, David↗
DOE OSTI2020

Automated detector simulation and reconstruction parametrization using machine learning

Rapidly applying the effects of detector response to physics objects (e.g. electrons, muons, showers of particles) is essential in high energy physics. Presently available tools for the transformation from truth-level physics objects to reconstructed detector-level physics objects involve manually defining resolution functions. These resolution functions are typically derived in bins of variables that are correlated with the resolution (e.g. pseudorapidity and transverse momentum). This process is time consuming, requires manual updates when detector conditions change, and can miss important correlations. Machine learning offers a way to automate the process of building these truth-to-reconstructed object transformations and can capture complex correlation for any given set of input variables. Such machine learning algorithms, with sufficient optimization, could have a wide range of applications: improving phenomenological studies by using a better detector representation, allowing for more efficient production of Geant4 simulation by only simulating events within an interesting part of phase space, and studies on future experimental sensitivity to new physics.

47 OTHER INSTRUMENTATION↗
DOE OSTI2026

Optimized Gear Selection to Maximize Energy Savings in Electric Traction Drives for Medium and Heavy Duty Vehicles

Multi‑gear transmission systems are commonly used in electric traction drives for medium and heavy‑duty vehicles, while most passenger‑vehicle electric drivetrains rely on a single fixed ratio to reduce cost, weight, and complexity. Using multiple gear ratios can enable downsizing of the motor and inverter while still meeting performance requirements. Additionally, appropriately chosen ratios allow the motor to operate more frequently in high‑efficiency regions, improving overall energy usage and reducing operating costs over the drive cycle. This paper presents a systematic approach for selecting optimal gear ratios for electric drive systems. A neural‑network model is first developed to represent motor losses across the full torque–speed range using data generated from finite element analysis. This model enables fast, accurate evaluation of motor efficiency under varying operating conditions. A genetic‑algorithm‑based optimization framework is then applied to identify gear ratios that maximize energy cost savings over the drive cycle, with the resulting optimal ratios stored for real‑time implementation.

Gadiyar, Nishanth [ORNL] (ORCID:0000000348267524)↗
DOE OSTI2024

Error and Correction Analysis for the FFA@CEBAF Energy Upgrade

An energy upgrade design for the Continuous Electron Beam Accelerator Facility (CEBAF) is under development, using fixed field alternating gradient (FFA) return arcs to recirculate electron beam up to an additional five times through the accelerating structures at CEBAF. A necessary component of any large accelerator is a beam steering and optical correction system. Small environmental changes and system errors can lower beam quality or even shut down the machine; and in pursuit of the scientific mission of JLab, high quality electron beams must be delivered to the experimental halls on a predictable schedule. Correction in the novel FFA arcs of the current upgrade design is complicated by several factors. These complexities inform the choice of correction algorithm structure and parameter values. A baseline algorithm in addition to diagnostic and correction hardware configuration is presented. The effect of this correction protocol is shown with respect to estimated errors, and several possible extensions of the algorithm are discussed. This work presents an important proof of concept for the FFA@CEBAF design effort, and provides a functional correction strategy which may be simply adjusted and optimized for future design changes.

Coxe, Alex [Old Dominion Univ., Norfolk, VA (Unite↗
DOE OSTI2017

Ion Mobility Spectrometry - High Resolution LTQ-Orbitrap Mass Spectrometry for Analysis of Homemade Explosives

The detailed chemical characterization of homemade explosives (HMEs) and other chemicals that can mimic or mask the presence of explosives is important for understanding and improving the performance of commercial instrumentation used for explosive detection. To that end, an atmospheric-pressure drift tube ion mobility spectrometry (IMS) instrument has been successfully coupled to a commercial tandem mass spectrometry (MS) system. The tandem MS system is comprised of a linear ion trap and a high resolution Orbitrap analyzer. This IMS-MS combination allows extensive characterization of threat chemical compounds, including HMEs, and complex real-world background chemicals that can interfere with detection. Here, the composition of ion species originating from a specific HME, erythritol tetranitrate, has been elucidated using accurate mass measurements, isotopic ratios, and tandem MS. Gated IMS-MS and high-resolution MS have been used to identify minor impurities that can be indicative of the HME source and/or synthesis route. Comparison between data obtained on the IMS/MS system and on commercial stand-alone IMS instruments used as explosive trace detectors (ETDs) has also been performed. Such analysis allows better signature assignments of threat compounds, modified detection algorithms, and improved overall ETD performance. .

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2017

Contaminant source identification using semi-supervised machine learning

Identification of the original groundwater types present in geochemical mixtures observed in an aquifer is a challenging but very important task. Frequently, some of the groundwater types are related to different infiltration and/or contamination sources associated with various geochemical signatures and origins. The characterization of groundwater mixing processes typically requires solving complex inverse models representing groundwater flow and geochemical transport in the aquifer, where the inverse analysis accounts for available site data. Usually, the model is calibrated against the available data characterizing the spatial and temporal distribution of the observed geochemical types. Numerous different geochemical constituents and processes may need to be simulated in these models which further complicates the analyses. In this paper, we propose a new contaminant source identification approach that performs decomposition of the observation mixtures based on Non-negative Matrix Factorization (NMF) method for Blind Source Separation (BSS), coupled with a custom semi-supervised clustering algorithm. Our methodology, called NMFk, is capable of identifying (a) the unknown number of groundwater types and (b) the original geochemical concentration of the contaminant sources from measured geochemical mixtures with unknown mixing ratios without any additional site information. NMFk is tested on synthetic and real-world site data. Finally, the NMFk algorithm works with geochemical data represented in the form of concentrations, ratios (of two constituents; for example, isotope ratios), and delta notations (standard normalized stable isotope ratios).

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2019

Fast, Dynamic, and Scalable Algorithms for Large-Scale Constrained Optimization

Scientists and engineers constantly aim to optimize an objective subject to physical, environmental, and/or resource constraints. The technique of using mathematical models to formulate and find real solutions of such problems is known as mathematical optimization, a process that has become invaluable for design and discovery in numerous scientific fields. This project has focused on the design, analysis, and implementation of high-performance computing algorithms for solving cutting-edge optimization problems. These include problems that involve (1) data uncertainties, such as those in the future supply, demand, and capacity of a given power system, (2) extreme numbers of alternatives, such as in the design of electrical power grids to avoid network vulnerabilities, and (3) real-time decisions, such as in the control of chemical reactors. The key features of the new algorithms are that they are fast, dynamic, and scalable to meet the computational requirements of scientists and researchers working to optimize large-scale, complex systems. The algorithms that have been designed, analyzed, and tested as part of the project can be characterized based on the types of optimization problems they have been designed to solve. Much of the work has focused on algorithms for solving large-scale constrained optimization problems. Contributions have also been made in the design of algorithms for unconstrained optimization, with some specialized methods for solving problems that have inherent nonsmoothness. Contributions have also been made in areas that have grown to prominence in the field over the five-year award period. These include the design of algorithms for solving large-scale stochastic optimization problems, such as those that arise in large-scale machine learning, and in complexity analyses for solving nonconvex problems, which has been a focal point of much recent work in continuous optimization. Overall, the project has supported work that has led to almost 30 articles that have been published or accepted to top journals in the field of mathematical optimization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

An evolutionary algorithm for designing microbial communities via environmental modification

Despite a growing understanding of how environmental composition affects microbial communities, it remains difficult to apply this knowledge to the rational design of synthetic multispecies consortia. This is because natural microbial communities can harbour thousands of different organisms and environmental substrates, making up a vast combinatorial space that precludes exhaustive experimental testing and computational prediction. Here, we present a method based on the combination of machine learning and metabolic modelling that selects optimal environmental compositions to produce target community phenotypes. In this framework, dynamic flux balance analysis is used to model the growth of a community in candidate environments. A genetic algorithm is then used to evaluate the behaviour of the community relative to a target phenotype, and subsequently adjust the environment to allow the organisms to approach this target. We apply this iterative process to thousands of in silico communities of varying sizes, showing how it can rapidly identify environments that yield desired taxonomic compositions and patterns of metabolic exchange. Moreover, this combination of approaches produces testable predictions for the assembly of experimental microbial communities with specific properties and can facilitate rational environmental design processes for complex microbiomes.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

A Novel Algorithm for CAD to CSG Conversion in McCAD

Modeling and simulation lie at the heart of the design process of any nuclear application. An accurate representation of the radiation environment ensures not only the feasibility of new technologies, but it also aids in operation, maintenance, and even decommissioning. With increasingly complex designs, high-fidelity models have become a necessity for design maturity. McCAD has been under development for many years at Karlsruhe Institute of Technology (KIT) to facilitate the process of generating suitable models for nuclear analyses. In this paper, an overview of the major advances in the new version of the code is presented. A novel conversion algorithm has proven to be robust in significantly reducing the processing time to generate radiation transport models, making it easier to iterate on design details. A first-of-a-kind capability to generate hierarchical void cells is also discussed with preliminary analysis showing performance gains for particle tracking.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Binary Complex Neural Network Acceleration on FPGA

Being able to learn from complex data with phase information is imperative for many signal processing applications. Today’s real-valued deep neural networks (DNNs) have shown efficiency in latent information analysis but fall short when applied to the complex domain. Deep complex networks (DCN) , in contrast, can learn from complex data, but have high computational costs; therefore, they cannot satisfy the instant decision making requirements of many deployable systems dealing with short observations or short signal bursts. Recent, Binarized Complex Neural Network (BCNN), which integrates DCNs with binarized neural networks (BNN), shows great potential in classifying complex data in real-time. In this paper, we propose a structural pruning based accelerator of BCNN, which is able to provide more than 5000 frames/s inference throughput on edge devices. The high performance comes from both the algorithm and hardware sides. On the algorithm side, we conduct structural pruning to the original BCNN models and obtain 20 × pruning rates with negligible accuracy loss; on the hardware side, we propose a novel 2D convolution operation accelerator for the binary complex neural network. Experimental results show that the proposed design works with over 90% utilization and is able to achieve the inference throughput of 5882 frames/s and 4938 frames/s for complex NIN-Net and ResNet-18 using CIFAR-10 dataset and Alveo U280 Board.

Peng, Hongwu↗
DOE OSTI2025

A generalizable machine learning-assisted fast Fourier transform algorithm to simulate the large strain phenomena in polycrystalline materials

Machine learning methods have shown initial promise in constitutive modeling for single crystals or homogenized polycrystals, delivering notable computational efficiency. However, existing machine learning-based constitutive models often lack generalizability, limiting their application across diverse boundary value problems. This study introduces a thermodynamics-informed artificial neural network model to accelerate rate-tangent crystal plasticity fast Fourier transform simulations for cross-scale deformation behaviors of polycrystals under complex loading. Our model integrates microstructural variability and local interactions effectively. To address local effects in each grain, we employ K-means clustering to group Gauss points within the microstructure into clusters assumed to be in similar mechanical states. This approach, based on self-clustering analysis, extends model scope from macroscopic stress response to the granular level, capturing mechanical responses and orientation evolution across grains. This reduces the number of nonlinear problems to solve, with cluster responses propagated throughout each group. The thermodynamics-based artificial neural network-extracted features are further processed using local material state clusters to account for history-dependent deformation and evolving microstructures. Additionally, representative volume element simulations with rate-tangent crystal plasticity fast Fourier transform provide reliable datasets for model training. The proposed model demonstrates high efficiency, accuracy, self-consistency, and enhanced generalizability in predicting strain–stress responses and orientation evolution at both individual grain and aggregate scales under complex loading conditions, such as biaxial tension and arbitrary loading scenarios.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Efficient Data Management in Neutron Scattering Data Reduction Workflows at ORNL

Oak Ridge National Laboratory (ORNL) experimental neutron science facilities produce 1.2 TB a day of raw event-based data that is stored using the standard metadata-rich NeXus schema built on top of the HDF5 file format. Performance of several data reduction workflows is largely determined by the amount of time spent on the loading and processing algorithms in Mantid, an open-source data analysis framework used across several neutron sciences facilities around the world. The present work introduces new data management algorithms to address identified input output (I/O) bottlenecks on Mantid. First, we introduce an in-memory binary-tree metadata index that resemble NeXus data access patterns to provide a scalable search and extraction mechanism. Second, data encapsulation in Mantid algorithms is optimally redesigned to reduce the total compute and memory runtime footprint associated with metadata I/O reconstruction tasks. Results from this work show speed ups in wall-clock time on ORNL data reduction workflows, ranging from 11% to 30% depending on the complexity of the targeted instrument-specific data. Nevertheless, we highlight the need for more research to address reduction challenges as experimental data volumes increase.

Godoy, William↗
DOE OSTI2021

Discussion on molecular dynamics (MD) simulations of the asphalt materials

The application of asphalt materials in pavement engineering has been increasingly widespread and sophisticated over the past several decades. Variations in the properties of asphalt binder during mixing, transportation, and paving can affect the performance of asphalt pavement. However, the asphalt material is a non-homogeneous and complex organic substance, consisting of various molecules with widely various molecular weights, elemental compositions, and structures. This complexity leads to difficulties for researchers to clearly and immediately understand the properties of asphalt materials and their variations. The multi-scale research approach combines macroscopic experimental data and microscopic simulation results from a practical engineering perspective. It helps to improve the understanding of asphalt materials. The molecular dynamics (MD) simulation proposes a corresponding molecular model of asphalt material based on experimental data, and the simulation algorithm is able to derive properties similar to those of real asphalt. Here, this paper provides a comprehensive review of the current studies on MD simulation of asphalt materials, including modeling, properties, and multi-scale analysis. As a key part of the computational simulation, this paper discusses the typical asphalt binder and asphalt-aggregate interface models constructed by different groups, and also presents their differences from real samples and their feasibility based on fundamental properties. After the introduction of molecular models, the extensive work made by researchers based on molecular models is categorically reviewed and discussed. The strengths and weaknesses of MD simulation methods in the study of asphalt materials are also summarized in order to provide the reader with a more comprehensive understanding of the relevant contents and to guide subsequent research.

36 MATERIALS SCIENCE↗
DOE OSTI2017

Addressing Global Data Dependencies in Heterogeneous Asynchronous Runtime Systems on GPUs

Large-scale parallel applications with complex global data dependencies beyond those of reductions pose significant scalability challenges in an asynchronous runtime system. Internodal challenges include identifying the all-to-all communication of data dependencies among the nodes. Intranodal challenges include gathering together these data dependencies into usable data objects while avoiding data duplication. This paper addresses these challenges within the context of a large-scale, industrial coal boiler simulation using the Uintah asynchronous many-task runtime system on GPU architectures. We show significant reduction in time spent analyzing data dependencies through refinements in our dependency search algorithm. Multiple task graphs are used to eliminate subsequent analysis when task graphs change in predictable and repeatable ways. Using a combined data store and task scheduler redesign reduces data dependency duplication ensuring that problems fit within host and GPU memory. Furthermore, these modifications did not require any changes to application code or sweeping changes to the Uintah runtime system. We report results running on the DOE Titan system on 119K CPU cores and 7.5K GPUs simultaneously. Our solutions can be generalized to other task dependency problems with global dependencies among thousands of nodes which must be processed efficiently at large scale.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Computational complexity of the landscape II—Cosmological considerations

We propose a new approach for multiverse analysis based on computational complexity, which leads to a new family of “computational” measure factors. By defining a cosmology as a space–time containing a vacuum with specified properties (for example small cosmological constant) together with rules for how time evolution will produce the vacuum, we can associate global time in a multiverse with clock time on a supercomputer which simulates it. We argue for a principle of “limited computational complexity” governing early universe dynamics as simulated by this supercomputer, which translates to a global measure for regulating the infinities of eternal inflation. The rules for time evolution can be thought of as a search algorithm, whose details should be constrained by a stronger principle of “minimal computational complexity”. Unlike previously studied global measures, ours avoids standard equilibrium considerations and the well-known problems of Boltzmann Brains and the youngness paradox. We also give various definitions of the computational complexity of a cosmology, and argue that there are only a few natural complexity classes.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

RE-INTEGRATE EMT Simulation Software: Graph Convolutional Network for Sparse Matrix Pattern Detection

The increasing complexity of power networks, driven by proliferation of inverters, presents analytical challenges that simplified models often fail to capture, necessitating Electromagnetic Transient (EMT) simulations. EMT models are represented as discretized differential-algebraic equations (DAEs), forming a linear system Ax = b that is computationally intensive to solve. Due to inherent sparsity of adjacency matrix A, distinct patterns emerge that, when accurately identified, enable efficient solver selection to minimize computation time. However, identifying ideal pattern is complicated by numerous reordering algorithms and limited structural insights. To address this, we introduce a Graph Convolutional Network (GCN) model for classifying sparse matrix patterns common in power system analysis. The model, achieving 96% test accuracy, is validated using PV plant models of 125 MW capacities connected to New England 39-bus transmission system (TS), and further scaled to a 4,992-bus network with 384 PV plants, yielding 191, 616 × 191, 616 sized A matrix. For all cases, the GCN model accurately identifies the matrix’s intrinsic sparse pattern, demonstrating its potential to enhance solver performance in EMT analysis.

Hossain, Md Rifat [Florida International Universit↗