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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Computing Bottleneck Structures at Scale for High-Precision Network Performance Analysis

The Theory of Bottleneck Structures is a recently-developed framework for studying the performance of data networks. It describes how local perturbations in one part of the network propagate and interact with others. This framework is a powerful analytical tool that allows network operators to make accurate predictions about network behavior and thereby optimize performance. Previous work implemented a software package for bottleneck structure analysis, but applied it only to toy examples. In this work, we introduce the first software package capable of scaling bottleneck structure analysis to production-size networks. Here, we benchmark our system using logs from ESnet, the Department of Energy's high-performance data network that connects research institutions in the U.S. Using the previously published tool as a baseline, we demonstrate that our system achieves vastly improved performance, constructing the bottleneck structure graphs in 0.21 s and calculating link derivatives in 0.09 s on average. We also study the asymptotic complexity of our core algorithms, demonstrating good scaling properties and strong agreement with theoretical bounds. These results indicate that our new software package can maintain its fast performance when applied to even larger networks. They also show that our software is efficient enough to analyze rapidly changing networks in real time. Overall, we demonstrate the feasibility of applying bottleneck structure analysis to solve practical problems in large, real-world data networks.

benchmark↗
DOE OSTI2018

Integrated Cyber/Physical Grid Resiliency Modeling

This project explored coupling modeling and analysis methods from multiple domains to address complex hybrid (cyber and physical) attacks on mission critical infrastructure. Robust methods to integrate these complex systems are necessary to enable large trade-space exploration including dynamic and evolving cyber threats and mitigations. Reinforcement learning employing deep neural networks, as in the AlphaGo Zero solution, was used to identify "best" (or approximately optimal) resilience strategies for operation of a cyber/physical grid model. A prototype platform was developed and the machine learning (ML) algorithm was made to play itself in a game of 'Hurt the Grid'. This proof of concept shows that machine learning optimization can help us understand and control complex, multi-dimensional grid space. A simple, yet high-fidelity model proves that the data have spatial correlation which is necessary for any optimization or control. Our prototype analysis showed that the reinforcement learning successfully improved adversary and defender knowledge to manipulate the grid. When expanded to more representative models, this exact type of machine learning will inform grid operations and defense - supporting mitigation development to defend the grid from complex cyber attacks! This same research can be expanded to similar complex domains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Machine-Learning Analysis of Moisture Carryover in Boiling Water Reactors

Moisture carryover (MCO) is modeled in the General Electric Type-4 boiling water reactor (BWR) using machine-learning methods and data from operating plants. Understanding MCO and the conditions that give rise to an elevated value is important since excessive MCO can damage critical turbine components, can result in elevated dose levels to on-site personnel, and can interfere with late-cycle power management. The analysis of MCO takes into account simplifying reactor symmetries and important geometric dependencies. The plant data are taken from several reactors and were collected over multiple years and multiple fuel cycles. A brief description of the origin of MCO in U.S. BWR plants is given. A machine-learning model is constructed from the data using applicable algorithms and data-reduction techniques. Matching model complexity with available data is one of the more challenging machine-learning tasks. Too many features and too little data will lead to overfitting. The data for each fuel cycle included over 6876 original features, 9 for each fuel bundle. Two approaches are used to reduce the data set into a manageable number of features. The first was an engineering analysis that resulted in the selection of steam quality Q and steam liquid phase velocity V L as the main features driving MCO. Using a Q and a V L for each fuel bundle gives 1528 Q and a V L feature describing the reactor behavior. An analysis of different functional forms of these two variables led to the actual inputs to the neural network model. The second approach involved the use of statistical techniques such as Pearson’s correlation and k-means analysis. The identified groupings of bundles behaved similarly. Treating each grouping as a single feature further reduced the input variable set to a manageable number. Here, a model selection criterion is proposed, and results are presented along with a discussion of related issues.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

PyKrev: A Python Library for the Analysis of Complex Mixture FT-MS Data

In this study, we present PyKrev, a Python library for the analysis of complex mixture Fourier transform mass spectrometry (FT-MS) data. PyKrev is a comprehensive suite of tools for analysis and visualization of FT-MS data after formula assignment has been performed. These comprise formula manipulation and calculation of chemical properties, intersection analysis between multiple lists of formulas, calculation of chemical diversity, assignment of compound classes to formulas, multivariate analysis, and a variety of visualization tools producing van Krevelen diagrams, class histograms, PCA score, and loading plots, biplots, scree plots, and UpSet plots. The library is showcased through analysis of hot water green tea extracts and Scotch whisky FT-ion cyclotron resonance-MS data sets. PyKrev addresses the lack of a single, cohesive toolset for researchers to perform FT-MS analysis in the Python programming environment encompassing the most recent data analysis techniques used in the field.

47 OTHER INSTRUMENTATION↗
DOE OSTI2025

Computational Algorithms for Unit Commitment with AC Power Flows (Final Report)

Security-constrained unit commitment (SCUC) is a key component in power system operations. When AC power flow constraints are considered in the SCUC model (AC-SCUC), the problem becomes extremely difficult due to its discrete and non-convex nature, as described in “Grid Optimization Competition Challenge 3 Problem Formulation (GOCC)”. There are four main challenges: (i) Discrete decisions regarding unit online/offline status and start-up/shut-down procedures for every single unit. The number of discrete decision variables increases considerably when a system integrates multiple generators; (ii) Configuration-based combined-cycle formulations, and multi-commodity models that include ramping products, spin/non-spin products, and regulation up/down products. The combined-cycle units introduce additional discrete decision variables and auxiliary service products further complicate the model by connecting multi-commodity products’ continuous and discrete variables; (iii) SCUC models with AC power flow constraints are far more complex due to massive bilinear terms in the large-scale nonlinear power balance equations. The nonlinear power balance equations are further complicated by the discrete step control variables of shunts; (iv) N − 1 contingency analysis. The size of the model increases linearly with the number of contingencies considered, greatly increasing the size of the optimization model. Accordingly, there is an emergent need to develop a robust algorithm capable of deriving a high-quality solution in a short time and passing through contingency tests simultaneously. In this project, we explore innovative techniques to address this challenging problem by integrating advanced polyhedral theory, approximation methods, relaxation strategies, decomposition techniques, and parallel computing. Each technique approaches the problem from a different perspective, leveraging its specific strengths to tackle distinct challenges. Each individual method has demonstrated its effectiveness in the PI’s previous research. Their integration is expected to significantly reduce the computational time required to solve the proposed complex problem. Successful completion of this project has the potential to transform the industry by enhancing optimization solvers capable of handling large-scale day-ahead energy market clearing models within strict time constraints, while incorporating AC power flow constraints. This advancement will lead to reduced overall generation costs and, consequently, increased social welfare.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2022

Streaming readout for next generation electron scattering experiments

Current and future experiments at the high-intensity frontier are expected to produce an enormous amount of data that needs to be collected and stored for offline analysis. Thanks to the continuous progress in computing and networking technology, it is now possible to replace the standard ‘triggered’ data acquisition systems with a new, simplified and outperforming scheme. ‘Streaming readout’ (SRO) DAQ aims to replace the hardware-based trigger with a much more powerful and flexible software-based one, that considers the whole detector information for efficient real-time data tagging and selection. Considering the crucial role of DAQ in an experiment, validation with on-field tests is required to demonstrate SRO performance. In this paper, we report results of the on-beam validation of the Jefferson Lab SRO framework. In this work, we exposed different detectors (PbWO-based electromagnetic calorimeters and a plastic scintillator hodoscope) to the Hall-D electron-positron secondary beam and to the Hall-B production electron beam, with increasingly complex experimental conditions. By comparing the data collected with the SRO system against the traditional DAQ, we demonstrate that the SRO performs as expected. Furthermore, we provide evidence of its superiority in implementing sophisticated AI-supported algorithms for real-time data analysis and reconstruction.

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

Metrics for Intercomparison of Remapping Algorithms (MIRA) protocol applied to Earth system models

Abstract. Strongly coupled nonlinear phenomena such as those described by Earth system models (ESMs) are composed of multiple component models with independent mesh topologies and scalable numerical solvers. A common operation in ESMs is to remap or interpolate component solution fields defined on their computational mesh to another mesh with a different combinatorial structure and decomposition, e.g., from the atmosphere to the ocean, during the temporal integration of the coupled system. Several remapping schemes are currently in use or available for ESMs. However, a unified approach to compare the properties of these different schemes has not been attempted previously. We present a rigorous methodology for the evaluation and intercomparison of remapping methods through an independently implemented suite of metrics that measure the ability of a method to adhere to constraints such as grid independence, monotonicity, global conservation, and local extrema or feature preservation. A comprehensive set of numerical evaluations is conducted based on a progression of scalar fields from idealized and smooth to more general climate data with strong discontinuities and strict bounds. We examine four remapping algorithms with distinct design approaches, namely ESMF Regrid (Hill et al., 2004), TempestRemap (Ullrich and Taylor, 2015), generalized moving least squares (GMLS) (Trask and Kuberry, 2020) with post-processing filters, and WLS-ENOR (Li et al., 2020). By repeated iterative application of the high-order remapping methods to the test fields, we verify the accuracy of each scheme in terms of their observed convergence order for smooth data and determine the bounded error propagation using challenging, realistic field data on both uniform and regionally refined mesh cases. In addition to retaining high-order accuracy under idealized conditions, the methods also demonstrate robust remapping performance when dealing with non-smooth data. There is a failure to maintain monotonicity in the traditional L2-minimization approaches used in ESMF and TempestRemap, in contrast to stable recovery through nonlinear filters used in both meshless GMLS and hybrid mesh-based WLS-ENOR schemes. Local feature preservation analysis indicates that high-order methods perform better than low-order dissipative schemes for all test cases. The behavior of these remappers remains consistent when applied on regionally refined meshes, indicating mesh-invariant implementations. The MIRA intercomparison protocol proposed in this paper and the detailed comparison of the four algorithms demonstrate that the new schemes, namely GMLS and WLS-ENOR, are competitive compared to standard conservative minimization methods requiring computation of mesh intersections. The work presented in this paper provides a foundation that can be extended to include complex field definitions, realistic mesh topologies, and spectral element discretizations, thereby allowing for a more complete analysis of production-ready remapping packages.

58 GEOSCIENCES↗
DOE OSTI2020

Quantifying patterns in optical micrographs of one- and two-dimensional ellipsoidal particle assemblies

Current developments in colloidal science include the assembly of anisotropic colloids with broad geometric diversity. As the complexity of particle assemblies increases, the need for ubiquitous algorithms that quantitatively analyze images of the assemblies to deliver key information such as quantification of crystal structures becomes more urgent. This contribution describes algorithms capable of image analysis for classifying colloidal structures based on abstracted interparticle relationship information and quantitatively analyzing the abundance of each structure in mixed pattern assemblies. The algorithm parameters can be adjusted, allowing for the algorithms to be adapted for different image analyses. Three different ellipsoidal particle assembly images are presented to demonstrate the effectiveness of the algorithms: a one-dimensional (1D) particle chain assembly and two two-dimensional (2D) polymorphic crystals each consisting of assemblies of two distinct plane symmetry groups. Angle relationships between neighbouring particles are calculated and neighbour counts of each particle are determined. Combining these two parameters as rules for classification criteria allows for the labeling and quantification of each particle into a defined symmetry class within an assembly. The algorithms provide a labelled image comprising classification results and particle counts of each defined class. For multiple images or individual frames from a video, the script can be looped to achieve automatic processing. The yielded classification data allow for more in-depth image analysis of mixed pattern particle assemblies. Finally, we envision that these algorithms will have utility in quantitative analysis of images comprising ellipsoidal colloidal materials, nanoparticles, or biological matter.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2017

Stochastic optimization of GeantV code by use of genetic algorithms

GeantV is a complex system based on the interaction of different modules needed for detector simulation, which include transport of particles in fields, physics models simulating their interactions with matter and a geometrical modeler library for describing the detector and locating the particles and computing the path length to the current volume boundary. The GeantV project is recasting the classical simulation approach to get maximum benefit from SIMD/MIMD computational architectures and highly massive parallel systems. This involves finding the appropriate balance between several aspects influencing computational performance (floating-point performance, usage of off-chip memory bandwidth, specification of cache hierarchy, etc.) and handling a large number of program parameters that have to be optimized to achieve the best simulation throughput. This optimization task can be treated as a black-box optimization problem, which requires searching the optimum set of parameters using only point-wise function evaluations. Here, the goal of this study is to provide a mechanism for optimizing complex systems (high energy physics particle transport simulations) with the help of genetic algorithms and evolution strategies as tuning procedures for massive parallel simulations. One of the described approaches is based on introducing a specific multivariate analysis operator that could be used in case of resource expensive or time consuming evaluations of fitness functions, in order to speed-up the convergence of the black-box optimization problem.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

From Chaos to Clarity: Autonomous Materials Discovery for Extreme Environments [Slides]

The pursuit of advanced functional materials for energy applications demands an understanding of their behavior under the most challenging conditions. Extreme environments, characterized by intense radiation, high temperatures, and corrosive chemistries, push materials to their limits, often revealing unexpected behaviors and degradation pathways. Traditional materials research approaches, relying on trial-and-error experimentation, are often slow and resource-intensive, ill-suited to the complexities of extreme environments. This talk will explore the transformative potential of autonomous materials science in revolutionizing our understanding of materials synthesis and degradation in extreme environments. By integrating advanced microscopy techniques, artificial intelligence, and robotic experimentation, we can accelerate the discovery and design of resilient materials for a sustainable future. The presentation will highlight recent breakthroughs in autonomous microscopy, computer vision, and machine learning, showcasing their ability to unravel complex material transformations at the atomic scale. The talk will also delve into the challenges and opportunities associated with deploying autonomous systems to probe extreme environments, emphasizing the importance of robust algorithms, real-time data analysis, and adaptive experimentation. The ultimate goal is to empower scientists with unprecedented capabilities to explore, understand, and engineer materials that can withstand the harshest conditions, paving the way for innovations in energy, aerospace, and beyond.

14 SOLAR ENERGY↗
DOE OSTI2024

From Chaos to Clarity: Autonomous Materials Discovery for Extreme Environments

The pursuit of advanced functional materials for energy applications demands an understanding of their behavior under the most challenging conditions. Extreme environments, characterized by intense radiation, high temperatures, and corrosive chemistries, push materials to their limits, often revealing unexpected behaviors and degradation pathways. Traditional materials research approaches, relying on trial-and-error experimentation, are often slow and resource-intensive, ill-suited to the complexities of extreme environments. This talk will explore the transformative potential of autonomous materials science in revolutionizing our understanding of materials synthesis and degradation in extreme environments. By integrating advanced microscopy techniques, artificial intelligence, and robotic experimentation, we can accelerate the discovery and design of resilient materials for a sustainable future. The presentation will highlight recent breakthroughs in autonomous microscopy, computer vision, and machine learning, showcasing their ability to unravel complex material transformations at the atomic scale. The talk will also delve into the challenges and opportunities associated with deploying autonomous systems to probe extreme environments, emphasizing the importance of robust algorithms, real-time data analysis, and adaptive experimentation. Our ultimate goal is to empower scientists with unprecedented capabilities to explore, understand, and engineer materials that can withstand the harshest conditions, paving the way for innovations in energy, aerospace, and beyond.

artificial intelligence↗
DOE OSTI2021

Single Quadrupole Multiple Fragment Ion Monitoring Quantitative Mass Spectrometry

Single quadrupole mass spectrometry (MS) with enhanced in-source multiple fragment ion monitoring was designed to perform high sensitivity quantitative mass analyses. Enhanced in-source fragmentation amplifies fragmentation from traditional soft electrospray ionization producing fragment ions that have been found to be identical to those generated in tandem MS. We have combined enhanced in-source fragmentation data with criteria established by the European Union Commission Directive 2002/657/EC for electron ionization single quadrupole quantitative analysis to perform quantitative analyses. These experiments were performed on multiple types of complex samples that included a mixture of 50 standards, as well as cell and plasma extracts. The dynamic range for these quantitative analyses was comparable to triple quadrupole multiple reaction monitoring (MRM) analyses at up to 5 orders of magnitude with the cell and plasma extracts showing similar matrix effects across both platforms. Amino acid and fatty acid measurements performed from certified NIST 1950 plasma with isotopically labeled standards demonstrated accuracy in the range of 91–110% for the amino acids, 76–129% for the fatty acids, and good precision (coefficient of variation <10%). To enhance specificity, a newly developed correlated ion monitoring algorithm was designed to facilitate these analyses. This algorithm autonomously processes, aligns, filters, and compiles multiple ions within one chromatogram enabling both precursor and in-source fragment ions to be correlated within a single chromatogram, also enabling the detection of coeluting species based on precursor and fragment ion ratios. Single quadrupole instrumentation can provide MRM level quantitative performance by monitoring/correlating precursor and fragment ions facilitating high sensitivity analysis on existing single quadrupole instrumentation that are generally inexpensive, easy to operate, and technically less complex.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2026

A new self-adaptive reconstruction method to identify defects through Wigner–Seitz approach

A new self-adaptive reconstruction method based on local atomic structure at any given molecular dynamics (MD) step has been developed in this article. The method can be used in Wigner–Seitz defect analysis approach to correctly and efficiently explore the information of both point defects and complex defect clusters (e.g. dislocation loops and voids) formed after a displacement cascade where the cascade interacts with grain boundaries and/or dislocations. The algorithm and validation are provided in detail. Results for identification of radiation defects during and after cascades interacting with a dislocation network show that the new method can well recognize all simple and complex defects and defect clusters. Thus, this new method provides a totally new way to explore the density and size of radiation defects at atomic scale after complex MD evolution processes, providing correct information to understand and predict radiation damage in materials through atomic simulations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Time-Varying Feedback Optimization for Quadratic Programs with Heterogeneous Gradient Step Sizes

Online feedback-based optimization has become a promising framework for real-time optimization and control of complex engineering systems. This tutorial paper surveys the recent advances in the field as well as provides novel convergence results for primal-dual online algorithms with heterogeneous step sizes for different elements of the gradient. The analysis is performed for quadratic programs and the approach is illustrated on applications for adaptive step-size and model-free online algorithms, in the context of optimal control of modern power systems.

gradient methods↗
DOE OSTI2018

Evaluation of Digital Image Recognition Methods for Mass Spectrometry Imaging Data Analysis

Analyzing mass spectrometry imaging data can be laborious and time consuming, and as the size and complexity of datasets grow, so does the need for robust automated processing methods. We here present a method for comprehensive, semi-targeted discovery of molecular distributions of interest from mass spectrometry imaging data, using widely available image similarity scoring algorithms to rank images by spatial correlation. A fast and powerful batch search method using a MATLAB implementation of structural similarity (SSIM) index scoring with a pre-selected reference distribution is demonstrated for two sample imaging datasets, a plant metabolite study using Artemisia annua leaf, and a drug distribution study using maraviroc-dosed macaque tissue. .

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Space-Split Algorithm for Sensitivity Analysis of Discrete Chaotic Systems With Multidimensional Unstable Manifolds

Accurate approximations of the change of a system's output and its statistics with respect to the input are highly desired in computational dynamics. Ruelle's linear response theory provides breakthrough mathematical machinery for computing the linear response of chaotic dynamical systems. In this paper, we propose an algorithm for sensitivity analysis of discrete chaos with an arbitrary number of positive Lyapunov exponents. We combine the concept of perturbation space-splitting, which regularizes Ruelle's original expression, together with measure-based parameterization of the expanding subspace. We use these tools to rigorously derive trajectory-following recursive relations that converge exponentially fast, and construct a memory-efficient Monte Carlo scheme for derivatives of the output statistics. Thanks to the regularization and lack of simplifying assumptions on the system's behavior, our method is immune to the common problems of other popular methods such as the exploding tangent solutions and unphysical shadowing directions. Here, we provide a ready-to-use algorithm, analyze its complexity, and demonstrate several numerical examples of sensitivity computation using physically-inspired low-dimensional systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Statistical Analysis of the First Passage Path Ensemble of Jump Processes

The transition mechanism of jump processes between two different subsets in state space reveals important dynamical information of the processes and therefore has attracted considerable attention in the past years. In this paper, we study the first passage path ensemble of both discrete-time and continuous-time jump processes on a finite state space. The main approach is to divide each first passage path into nonreactive and reactive segments and to study them separately. The analysis can be applied to jump processes which are non-ergodic, as well as continuous-time jump processes where the waiting time distributions are non-exponential. In the particular case that the jump processes are both Markovian and ergodic, our analysis elucidates the relations between the study of the first passage paths and the study of the transition paths in transition path theory. We provide algorithms to numerically compute statistics of the first passage path ensemble. The computational complexity of these algorithms scales with the complexity of solving a linear system, for which efficient methods are available. Several examples demonstrate the wide applicability of the derived results across research areas.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Multi-Attribute Subset Selection enables prediction of representative phenotypes across microbial populations

The interpretation of complex biological datasets requires the identification of representative variables that describe the data without critical information loss. This is particularly important in the analysis of large phenotypic datasets (phenomics). Here we introduce Multi-Attribute Subset Selection (MASS), an algorithm which separates a matrix of phenotypes (e.g., yield across microbial species and environmental conditions) into predictor and response sets of conditions. Using mixed integer linear programming, MASS expresses the response conditions as a linear combination of the predictor conditions, while simultaneously searching for the optimally descriptive set of predictors. We apply the algorithm to three microbial datasets and identify environmental conditions that predict phenotypes under other conditions, providing biologically interpretable axes for strain discrimination. MASS could be used to reduce the number of experiments needed to identify species or to map their metabolic capabilities. The generality of the algorithm allows addressing subset selection problems in areas beyond biology.

59 BASIC BIOLOGICAL SCIENCES↗