Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational complexity”

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 883 records · Page 49
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

A Novel Multi-Agent Deep Reinforcement Learning-enabled Distributed Power Allocation Scheme for mmWave Cellular Networks

We consider the power allocation problem over shared spectrum for millimeter-Wave (mmWave) cellular downlink. Existing approaches usually find sub-optimal solutions by solving a non-convex optimization which leads to scalability issues due to centralized control. Therefore, distributed and adaptive approaches are desirable. Recently, model-free Deep Reinforcement Learning (DRL) has achieved success in such wireless resource management tasks. By modeling the radio environment as a Markov Decision Process (MDP) with the base stations (BSs) being the agents, power allocation can be automated at the agent level with comparable throughput performance to conventional centralized schemes. The multi-agent setting presents new challenges as the radio environment is impacted by the joint actions of the agents and is no longer stationary from any individual agent’s perspective. Existing literature bypasses this non-stationarity violation by ignoring it which may cause performance degradation. To tackle this issue, we propose a distributed continuous power allocation scheme based on a modified version of multi-agent Deep Deterministic Policy Gradient (MADDPG) that is tailored for the distributed multiple-agent setting. The proposed scheme employs a centralized-training distributed-execution framework where Q-functions are trained over subsets of BSs while each BS determines its transmit power based only on its own local observation. It admits constant per-BS communication and computation complexity and is thus scalable to large networks. Numerical evaluation shows that the proposed scheme adapts well to a wide range of interference conditions and can achieve comparable or better performance than several state-of-the-art non-learning approaches.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2024

Extending Power of Nature from Binary Problems to Real-Valued Graph Learning in Real World

Nature performs complex computations constantly at clearly lower cost and higher performance than digital computers. It is crucial to understand how to harness the unique computational power of nature in Machine Learning (ML). In the past decade, besides the development of Neural Networks (NNs), the community has also relentlessly explored nature-powered ML paradigms. Although most of them are still predominantly theoretical, a new practical paradigm enabled by the recent advent of CMOS-compatible room-temperature nature-based computers has emerged. By harnessing the nature's power of entropy increase, this paradigm can solve binary learning problems delivering immense speedup and energy savings compared with NNs, while maintaining comparable accuracy. Regrettably, its values to the real world are highly constrained by its binary nature. A clear pathway to its extension to real-valued problems remains elusive. This paper aims to unleash this pathway by proposing a novel end-to-end Nature-Powered Graph Learning (NP-GL) framework. Specifically, through a three-dimensional co-design, NP-GL can leverage the nature's power of entropy increase to efficiently solve real-valued graph learning problems. Experimental results across 4 real-world applications with 6 datasets demonstrate that NP-GL delivers, on average, 6970X speedup and 10^5x energy consumption reduction with comparable or even higher accuracy than Graph Neural Networks (GNNs).

artificial intelligence↗
DOE OSTI2025

A Fast Dynamic Internal Predictive Power Scheduling Approach for Power Management in Microgrids: Preprint

This paper presents a Dynamic Internal Predictive Power Scheduling (DIPPS) approach for optimizing power management in microgrids, particularly focusing on external power exchanges among diverse prosumers. DIPPS utilizes a dynamic objective function with a time-varying binary parameter to control the timing of power transfers to the external grid, facilitated by efficient usage of energy storage for surplus renewable power. The microgrid power scheduling problem is modeled as a mixed-integer nonlinear programming (MINLP-PS) and subsequently transformed into a mixed-integer linear programming (MILPPS) optimization through McCormick's relaxation to reduce computational complexity. A predictive window window with 6 data points is solved at an average of 0.92s, a 97.6% improvement over the 38.27s required for the MINLP-PS formulation, implying the numerical feasibility of the DIPPS approach for real-time implementation. Finally, the approach is validated against a static objective using real-world load data across three case studies with different time-varying parameters, demonstrating the ability of DIPPS to optimize power exchanges and efficiently utilize distributed resources while shifting the external power transfers to specified time durations.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Sub-microsecond Transformers for Jet Tagging on FPGAs

We present the first sub-microsecond transformer implementation on an FPGA achieving competitive performance for state-of-the-art high-energy physics benchmarks. Transformers have shown exceptional performance on multiple tasks in modern machine learning applications, including jet tagging at the CERN Large Hadron Collider (LHC). However, their computational complexity prohibits use in real-time applications, such as the hardware trigger system of the collider experiments up until now. In this work, we demonstrate the first application of transformers for jet tagging on FPGAs, achieving $\mathcal{O}(100)$ nanosecond latency with superior performance compared to alternative baseline models. We leverage high-granularity quantization and distributed arithmetic optimization to fit the entire transformer model on a single FPGA, achieving the required throughput and latency. Furthermore, we add multi-head attention and linear attention support to hls4ml, making our work accessible to the broader fast machine learning community. This work advances the next-generation trigger systems for the High Luminosity LHC, enabling the use of transformers for real-time applications in high-energy physics and beyond.

Laatu, Lauri [Imperial Coll., London]↗
NASA NTRS1995

DREAMS and IMAGE: A Model and Computer Implementation for Concurrent, Life-Cycle Design of Complex Systems

Computing architectures are being assembled that extend concurrent engineering practices by providing more efficient execution and collaboration on distributed, heterogeneous computing networks. Built on the successes of initial architectures, requirements for a next-generation design computing infrastructure can be developed. These requirements concentrate on those needed by a designer in decision-making processes from product conception to recycling and can be categorized in two areas: design process and design information management. A designer both designs and executes design processes throughout design time to achieve better product and process capabilities while expanding fewer resources. In order to accomplish this, information, or more appropriately design knowledge, needs to be adequately managed during product and process decomposition as well as recomposition. A foundation has been laid that captures these requirements in a design architecture called DREAMS (Developing Robust Engineering Analysis Models and Specifications). In addition, a computing infrastructure, called IMAGE (Intelligent Multidisciplinary Aircraft Generation Environment), is being developed that satisfies design requirements defined in DREAMS and incorporates enabling computational technologies.

Hale, Mark A.↗
DOE OSTI2024

GDSA framework, a computational framework for complex modeling problems in radioactive waste management

This paper details a computational framework to produce automated, graphical workflows, and how this framework can be deployed to support complex modeling problems like those in nuclear engineering. Key benefits of the framework include: automating previously manual workflows; intuitive construction and communication of workflows through a graphical interface; and automated file transfer and handling for workflows deployed across heterogeneous computing resources. This paper demonstrates the framework's application to probabilistic post-closure performance assessment of systems for deep geologic disposal of nuclear waste. However, the framework is a general capability that can help users running a variety of computational studies.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
NASA NTRS2014

Software Accelerates Computing Time for Complex Math

Ames Research Center awarded Newark, Delaware-based EM Photonics Inc. SBIR funding to utilize graphic processing unit (GPU) technology- traditionally used for computer video games-to develop high-computing software called CULA. The software gives users the ability to run complex algorithms on personal computers with greater speed. As a result of the NASA collaboration, the number of employees at the company has increased 10 percent.

Source record↗
DOE OSTI2017

Computation of the Complex Probability Function

The complex probability function is important in many areas of physics and many techniques have been developed in an attempt to compute it for some z quickly and e ciently. Most prominent are the methods that use Gauss-Hermite quadrature, which uses the roots of the n th degree Hermite polynomial and corresponding weights to approximate the complex probability function. This document serves as an overview and discussion of the use, shortcomings, and potential improvements on the Gauss-Hermite quadrature for the complex probability function.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2000

An Approach to Experimental Design for the Computer Analysis of Complex Phenomenon

The ability to make credible system assessments, predictions and design decisions related to engineered systems and other complex phenomenon is key to a successful program for many large-scale investigations in government and industry. Recently, many of these large-scale analyses have turned to computational simulation to provide much of the required information. Addressing specific goals in the computer analysis of these complex phenomenon is often accomplished through the use of performance measures that are based on system response models. The response models are constructed using computer-generated responses together with physical test results where possible. They are often based on probabilistically defined inputs and generally require estimation of a set of response modeling parameters. As a consequence, the performance measures are themselves distributed quantities reflecting these variabilities and uncertainties. Uncertainty in the values of the performance measures leads to uncertainties in predicted performance and can cloud the decisions required of the analysis. A specific goal of this research has been to develop methodology that will reduce this uncertainty in an analysis environment where limited resources and system complexity together restrict the number of simulations that can be performed. An approach has been developed that is based on evaluation of the potential information provided for each "intelligently selected" candidate set of computer runs. Each candidate is evaluated by partitioning the performance measure uncertainty into two components - one component that could be explained through the additional computational simulation runs and a second that would remain uncertain. The portion explained is estimated using a probabilistic evaluation of likely results for the additional computational analyses based on what is currently known about the system. The set of runs indicating the largest potential reduction in uncertainty is then selected and the computational simulations are performed. Examples are provided to demonstrate this approach on small scale problems. These examples give encouraging results. Directions for further research are indicated.

Rutherford, Brian↗
DOE OSTI2018

Complexation of NpO 2 + with Amine-Functionalized Diacetamide Ligands in Aqueous Solution: Thermodynamic, Structural, and Computational Studies

Complexation of Np(V) with three structurally related amine-functionalized diacetamide ligands, including 2,2'-azanediylbis( N, N'-dimethylacetamide) (ABDMA), 2,2'-(methylazanediyl)bis( N, N'-dimethylacetamide) (MABDMA), and 2,2'-(benzylazanediyl)bis( N, N'-dimethylacetamide) (BnABDMA), in aqueous solutions was investigated. The stability constants of two successive complexes, namely, NpO 2 L + and NpO 2 L 2 + , where L stands for the ligands, were determined by absorption spectrophotometry. The results suggest that the stability constants of corresponding Np(V) complexes follow the trend: MABDMA > ABDMA ≈ BnABDMA. The data are discussed in terms of the basicity of the ligands and compared with those for the complexation of Np(V) with an ether oxygen-linked diacetamide ligand. Extended X-ray absorption fine structure data indicate that, similar to the complexation with Nd 3+ and UO 2 2+ , the ligands coordinate to NpO 2 + in a tridentate mode through the amine nitrogen and two oxygen atoms of the amide groups. Furthermore, computational results, in conjunction with spectrophotometric data, verify that the 1:2 complexes (NpO 2 (L) 2 + ) in aqueous solutions are highly symmetric with Np at the inversion center, so that the f-f transition of Np(V) is forbidden and NpO 2 (L) 2 + does not display significant absorption in the near-IR region.

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

The solution structures and relative stability constants of lanthanide–EDTA complexes predicted from computation

Ligand selectivity to specific lanthanide (Ln) ions is key to the separation of rare earth elements from each other. Ligand selectivity can be quantified with relative stability constants (measured experimentally) or relative binding energies (calculated computationally). The relative stability constants of EDTA (ethylenediaminetetraacetic acid) with La 3+ , Eu 3+ , Gd 3+ , and Lu 3+ were predicted from relative binding energies, which were quantified using electronic structure calculations with relativistic effects and based on the molecular structures of Ln–EDTA complexes in solution from density functional theory molecular dynamics simulations. The protonation state of an EDTA amine group was varied to study pH ~7 and ~11 conditions. Further, simulations at 25 °C and 90 °C were performed to elucidate how structures of Ln–EDTA complexes varying with temperature are related to complex stabilities at different pH conditions. Relative stability trends are predicted from computation for varying Ln 3+ ions (La, Eu, Gd, Lu) with a single ligand (EDTA at pH ~11), as well as for a single Ln 3+ ion (La) with varying ligands (EDTA at pH ~7 and ~11). Changing the protonation state of an EDTA amine site significantly changes the solution structure of the Ln–EDTA complex resulting in a reduction of the complex stability. As a result, increased Ln–ligand complex stability is correlated to reduced structural variations in solution upon an increase in temperature.

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

Comprehensive Experimental and Computational Spectroscopic Study of Hexacyanoferrate Complexes in Water: From Infrared to X-ray Wavelengths

We present a joint experimental and computational study of the hexacyanoferrate aqueous complexes at equilibrium in the 250 meV to 7.15 keV regime. The experiments include the vibrational spectroscopy of the cyanide ligands, the valence electronic absorption spectra and Fe 1s core hole spectra using X-ray absorption and emission techniques. These experiments are accompanied by density functional theory (DFT) based quantum mechanics/molecular mechanics (QM/MM) molecular dynamics (MD) simulations and spectroscopy calculations of the experiments spanning the IR to X-ray wavelengths. Our simulations, including explicit solvent effects, across this large energy window allows for a systematic comparison of vibrational, valence electronic and core-level spectra. The analysis reveals how the local solvation environment influences the geometric and electronic structure and impacts the line shape and intensity of the observed spectral features in the infrared, optical and X-ray wavelengths.

Ross, Matthew↗
DOE OSTI2022

Hydrogen Atom Abstraction from an Os II (NH 3 ) 2 Complex Generates an Os IV (NH 2 ) 2 Complex: Experimental and Computational Analysis of the N–H Bond Dissociation Free Energies and Reactivity

We report double hydrogen atom abstraction from (TMP)Os II (NH 3 ) 2 (TMP = tetramesitylporphyrin) with phenoxyl or nitroxyl radicals leads to (TMP)Os IV (NH 2 ) 2 . This unusual bis(amide) complex is diamagnetic and displays an N-H resonance at 12.0 ppm in its 1 H NMR spectrum. 1 H- 15 N correlation experiments identified a 15 N NMR spectroscopic resonance at –267 ppm. Experimental reactivity studies and density functional theory calculations support relatively weak N-H bonds of 73.3 kcal/mol for (TMP)Os II (NH 3 ) 2 and 74.2 kcal/mol for (TMP)Os III (NH 3 )(NH 2 ). Cyclic voltammetry experiments provide an estimate of the pK a of [(TMP)Os III (NH 3 ) 2 ] + . In the presence of Barton’s base, a current enhancement is observed at the Os(III/II) couple, consistent with an ECE event. Spectroscopic experiments confirmed (TMP)Os IV (NH 2 ) 2 as the product of bulk electrolysis. Double hydrogen atom abstraction is influenced by π donation from the amides of (TMP)Os IV (NH 2 ) 2 into the d orbitals of the Os center, favoring the formation of (TMP)Os IV (NH 2 ) 2 over N-N coupling. This π donation leads to a Jahn-Teller distortion that splits the energy levels of the d xz and d yz orbitals of Os, results in a low spin electron configuration, and leads to minimal aminyl character on the N atoms, rendering (TMP)Os IV (NH 2 ) 2 unreactive towards amide-amide coupling.

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

Π4U: A high performance computing framework for Bayesian uncertainty quantification of complex models

We present Π4U,{sup 1} an extensible framework, for non-intrusive Bayesian Uncertainty Quantification and Propagation (UQ+P) of complex and computationally demanding physical models, that can exploit massively parallel computer architectures. The framework incorporates Laplace asymptotic approximations as well as stochastic algorithms, along with distributed numerical differentiation and task-based parallelism for heterogeneous clusters. Sampling is based on the Transitional Markov Chain Monte Carlo (TMCMC) algorithm and its variants. The optimization tasks associated with the asymptotic approximations are treated via the Covariance Matrix Adaptation Evolution Strategy (CMA-ES). A modified subset simulation method is used for posterior reliability measurements of rare events. The framework accommodates scheduling of multiple physical model evaluations based on an adaptive load balancing library and shows excellent scalability. In addition to the software framework, we also provide guidelines as to the applicability and efficiency of Bayesian tools when applied to computationally demanding physical models. Theoretical and computational developments are demonstrated with applications drawn from molecular dynamics, structural dynamics and granular flow.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗