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 1,513 records · Page 84

New trends in photonic switching and optical networking architectures for data centers and computing systems [Invited]

The rapid increases in data traffic coupled with user preferences are driving the data center and computing system service providers to offer energy-efficient, intelligent, flexible, cost-effective, high-capacity, and low-latency data services without added complexity to the users. Disaggregated heterogeneous reconfigurable computing systems realized by photonic switching and interconnects can enhance throughput and energy efficiency for artificial intelligence/machine learning (AI/ML) workloads, especially when aided by the AI/ML-enhanced control plane. Photonic switching and new optical networking architectures are expected to solve many of these challenging problems. This paper discusses new trends in photonic switching and optical network architectures for future data centers and computing systems summarized as follows: (1) flat reconfigurable disaggregated computing enabled by high-radix photonic switching and interconnects in data centers; (2) chiplet-based computing architectures empowered by embedded photonics toward heterogeneous reconfigurable computing; (3) nanosecond-scale photonic switching in data centers and computing systems; (4) AI/ML in self-driving, application-aware, and situation-aware data centers; (5) the emergence of flexible networking for cloud computing, edge computing, and split computing, as well as flexible networking for 5G/6G RF-optical networks; and (6) the deployment of embedded co-designed silicon photonics being considered for future data centers.

Yoo, S. J. Ben (ORCID:0000000274201871)↗

Two-center three-electron bonding in ClNH{sub 3} revealed via helium droplet infrared laser Stark spectroscopy: Entrance channel complex along the Cl + NH{sub 3} → ClNH{sub 2} + H reaction

Pyrolytic dissociation of Cl{sub 2} is employed to dope helium droplets with single Cl atoms. Sequential addition of NH{sub 3} to Cl-doped droplets leads to the formation of a complex residing in the entry valley to the substitution reaction Cl + NH{sub 3} → ClNH{sub 2} + H. Infrared Stark spectroscopy in the NH stretching region reveals symmetric and antisymmetric vibrations of a C{sub 3v} symmetric top. Frequency shifts from NH{sub 3} and dipole moment measurements are consistent with a ClNH{sub 3} complex containing a relatively strong two-center three-electron (2c–3e) bond. The nature of the 2c–3e bonding in ClNH{sub 3} is explored computationally and found to be consistent with the complexation-induced blue shifts observed experimentally. Computations of interconversion pathways reveal nearly barrierless routes to the formation of this complex, consistent with the absence in experimental spectra of two other complexes, NH{sub 3}Cl and Cl–HNH{sub 2}, which are predicted in the entry valley to the hydrogen abstraction reaction Cl + NH{sub 3} → HCl + NH{sub 2}.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The Electrolyte Genome project: A big data approach in battery materials discovery

We present a high-throughput infrastructure for the automated calculation of molecular properties with a focus on battery electrolytes. The infrastructure is largely open-source and handles both practical aspects (input file generation, output file parsing, and information management) as well as more complex problems (structure matching, salt complex generation, and failure recovery). Using this infrastructure, we have computed the ionization potential (IP) and electron affinities (EA) of 4830 molecules relevant to battery electrolytes (encompassing almost 55,000 quantum mechanics calculations) at the B3LYP/6-31+G(*) level. We describe automated workflows for computing redox potential, dissociation constant, and salt-molecule binding complex structure generation. We present routines for automatic recovery from calculation errors, which brings the failure rate from 9.2% to 0.8% for the QChem DFT code. Automated algorithms to check duplication between two arbitrary molecules and structures are described. We present benchmark data on basis sets and functionals on the G2-97 test set; one finding is that a IP/EA calculation method that combines PBE geometry optimization and B3LYP energy evaluation requires less computational cost and yields nearly identical results as compared to a full B3LYP calculation, and could be suitable for the calculation of large molecules. Our data indicates that among the 8 functionals tested, XYGJ-OS and B3LYP are the two best functionals to predict IP/EA with an RMSE of 0.12 and 0.27 eV, respectively. Application of our automated workflow to a large set of quinoxaline derivative molecules shows that functional group effect and substitution position effect can be separated for IP/EA of quinoxaline derivatives, and the most sensitive position is different for IP and EA. Published by Elsevier B.V

Battery↗

Computer Vision Pipeline for Image Analysis for Freeze‐Fracture Electron Microscopy: Rosette Cellulose Synthase Complexes Case

In materials science, plant biology, agriculture, and environmental research, the automated analysis of high-magnification, complex microscopy images, such as those generated by freeze-fracture electron microscopy (FF-TEM), remains a critical challenge that limits the scalability of data interpretation. We present a deep learning computer vision pipeline for high-throughput detection and morphological characterization analysis of cellulose synthase complexes (CSCs, or rosettes) in FF-TEM images. The pipeline integrates preprocessing, detection, human-in-the-loop verification, and semantic segmentation to quantify features such as rosette diameter and inter-lobe spacing. The approach was trained and tested on a curated dataset of high-resolution FF-TEM micrographs of Physcomitrium patens, expanded via strategic tiling and augmentation to over 650 images. We compare YOLOv8 and YOLOv9 architectures and demonstrate that YOLOv9 achieves superior performance in both localization accuracy (mAP50-95 = 0.854) and inference speed. The resulting distributions revealed biological variability consistent with prior manual studies, validating the approach for high-throughput applications. Our results show that the pipeline achieves human-expert level accuracy while dramatically reducing analysis time, enabling scalable, reproducible structural characterization of intramembrane protein complexes. The pipeline is broadly applicable to other domains requiring precise interpretation of complex microscopy data and establishes a foundation for future artificial intelligence (AI)-assisted workflows in biological imaging.

59 BASIC BIOLOGICAL SCIENCES↗

Constrained GAN-Generated X-Ray CT Data For Self-Supervised And Foundation-Model Segmentation Of Concrete Microstructures

Three-dimensional characterization of materials using X-ray computed tomography (XCT) is challenging due to the complexity of internal structures, noise, and variations in resolution. Traditional computer vision models often struggle to accurately segment these images, particularly in domain-specific applications like materials science. While supervised deep learning approaches have been developed to address the limitations of conventional algorithms, they typically require large amounts of labeled training data and often fail to generalize across different datasets. Self-supervised, few-and zero-shot learning methods have gained prominence in natural image processing and segmentation tasks, but their application to scientific imaging remains limited due to the unique structural complexity, noise, and textural artifacts present in materials science data. In this work, we investigate how domain adaptation, leveraging physics-based and GAN-generated synthetic data, impacts segmentation performance. We introduce a modified Contrastive Unpaired Translation (CUT) model designed to generate realistic labeled data, which can be used for training, pre-training, and fine-tuning segmentation models for real XCT microstructure data. We evaluate the performance of two segmentation approaches: a self-supervised network (SSL-ALPNet) and a foundation model (Segment Anything Model), assessing their improvements when pre-trained and/or fine-tuned on the synthesized data. Our results demonstrate that leveraging synthetic data significantly enhances segmentation performance, particularly in challenging materials science applications.

Ziabari, Amir [ORNL] (ORCID:000000034776457X)↗

xSDK: Building an ecosystem of highly efficient math libraries for exascale

Current efforts to build increasingly powerful computer architectures are opening up new avenues for more complex and higher fidelity simulations coupled with data analytics and learning, leading to new scientific insights and deeper understanding. At one extreme, exascale computers will be much faster than previous computer generations (performing 10 18 operations per second—that is, 1,000 times faster than petascale). To achieve these performance improvements, computer architectures are becoming increasingly complex, with deep memory hierarchies, very high node and core counts, and heterogeneous features such as graphics processing units (GPUs). Such architectural changes impact the full breadth of computing scales, as heterogeneity pervades even current-generation laptops, workstations, and moderate-sized clusters. While emerging advanced architectures provide unprecedented opportunities, they also present significant challenges for developers of scientific applications, such as multiphysics and multiscale codes, who must adapt their software to handle disruptive changes in architectures and new programming models that have not yet stabilized. Developers must consider increasing concurrency while reducing communication and synchronization, and other complexities such as the potential for using mixed precision to leverage the compute power available in low-precision tensor cores. On one hand, developers must implement new scientific capabilities, which in turn increase code complexity. On the other hand, the codes must be ported to new architectures, requiring the inclusion of new programming models and the restructuring of code to achieve good performance. Addressing these issues is beyond the capability of any single person or team—leading to the need for collaboration among many teams, who encapsulate their expertise in reusable software and work together to create sustainable software ecosystems.

97 MATHEMATICS AND COMPUTING↗

Spectroscopic and Computational Studies of Spin States of Iron(IV) Nitrido and Imido Complexes

High-oxidation state metal complexes with multiply bonded ligands are of great interest for both their reactivity as well as their fundamental bonding properties. This paper reports a combined spectroscopic and theoretical investigation into the effect of the apical multiply bonded ligand on the spin state preferences of three-fold symmetric iron(IV) complexes with tris(carbene) donor ligands. Specifically, singlet (S = 0) nitrido [{PhB(Im R ) 3 }FeN], R = t Bu (1), Mes (mesityl, 2) and the related triplet (S = 1) imido complexes, [{PhB(Im R ) 3 }Fe(NR')] + , R = Mes, R' = Ad (1- adamantyl, 3), t Bu (4), have been investigated by electronic absorption and Mössbauer effect spectroscopies. For comparison, two other Fe(IV) nitrido complexes, [(TIMEN Ar )FeN] + , (TIMEN Ar = tris[2-(3-aryl-imidazol-2-ylidene)ethyl]amine; Ar = Xyl (xylyl), Mes), have been investigated by 57 Fe Mössbauer spectroscopy, including applied-field measurements. The paramagnetic imido complexes 3 and 4 were also studied by magnetic susceptibility measurements (for 3) and paramagnetic resonance spectroscopy: high-frequency and -field electron paramagnetic resonance (HFEPR) (for 3 and 4) and frequency-domain Fouriertransform (FD-FT) THz EPR (for 3), which reveal their zero-field splitting (zfs) parameters. Experimentally correlated theoretical studies comprising ligand-field theory (LFT) and quantum chemical theory (QCT), the latter including both density functional theory (DFT) and ab initio methods reveal the key role played by the Fe3 d z 2 (a1) orbital in these systems: the nature of its interaction with the nitrido or imido ligand dictates the spin state preference of the complex. Lastly, the ability to tune the spin state through the energy and nature of a single orbital has general relevance to the factors controlling spin states in complexes with applicability as single molecule devices.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Computational molecular technology towards macroscopic chemical phenomena-molecular control of complex chemical reactions, stereospecificity and aggregate structures

A new efficient hybrid Monte Carlo (MC)/molecular dynamics (MD) reaction method with a rare event-driving mechanism is introduced as a practical ‘atomistic’ molecular simulation of large-scale chemically reactive systems. Starting its demonstrative application to the racemization reaction of (R)-2-chlorobutane in N,N-dimethylformamide solution, several other applications are shown from the practical viewpoint of molecular controlling of complex chemical reactions, stereochemistry and aggregate structures. Finally, I would like to mention the future applications of the hybrid MC/MD reaction method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The complexity of NISQ

Abstract The recent proliferation of NISQ devices has made it imperative to understand their power. In this work, we define and study the complexity class , which encapsulates problems that can be efficiently solved by a classical computer with access to noisy quantum circuits. We establish super-polynomial separations in the complexity among classical computation, , and fault-tolerant quantum computation to solve some problems based on modifications of Simon’s problems. We then consider the power of for three well-studied problems. For unstructured search, we prove that cannot achieve a Grover-like quadratic speedup over classical computers. For the Bernstein-Vazirani problem, we show that only needs a number of queries logarithmic in what is required for classical computers. Finally, for a quantum state learning problem, we prove that is exponentially weaker than classical computers with access to noiseless constant-depth quantum circuits.

42 ENGINEERING↗

Structural complexity of snapshots of two-dimensional Fermi-Hubbard systems

The development of quantum gas microscopy for two-dimensional optical lattices has provided an unparalleled tool to study the Fermi-Hubbard model (FHM) with ultracold atoms. Spin-resolved projective measurements, or snapshots, have played a significant role in quantifying correlation functions, theory verification, and thus the uncovering of underlying physical phenomena such as antiferromagnetism at commensurate filling on bipartite lattices and other charge and spin correlations, as well as dynamical properties at various densities. Here we employ a recent concept, the multiscale structural complexity, and show that when computed for the snapshots (of single spin species, local moments, or total density) it can provide a theory-free property, immediately accessible to experiments. Specifically, after benchmarking results for Ising and $XY$ models, we study the structural complexity of snapshots of the repulsive FHM in the two-dimensional square lattice as a function of doping and temperature. We generate projective measurements using determinant quantum Monte Carlo and compare their complexities against those from the experiment. We demonstrate that these complexities are linked to relevant physical observables such as the entropy and double occupancy. Their behaviors capture the development of correlations and relevant length scales in the system. Furthermore, we provide an open-source code in python which can be implemented into data analysis routines in experimental settings for the square lattice.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Systematic theoretical investigation of the zero-field splitting in Gd(III) complexes: Wave function and density functional approaches

The zero-field splitting (ZFS) of the electronic ground state in paramagnetic ions is a sensitive probe of the variations in the electronic and molecular structure with an impact on fields ranging from fundamental physical chemistry to medical applications. A detailed analysis of the ZFS in a series of symmetric Gd(III) complexes is presented in order to establish the applicability and accuracy of computational methods using multiconfigurational complete-active-space self-consistent field wave functions and of density functional theory calculations. The various computational schemes are then applied to larger complexes Gd(III)DOTA(H{sub 2}O){sup −}, Gd(III)DTPA(H{sub 2}O){sup 2−}, and Gd(III)(H{sub 2}O){sub 8}{sup 3+} in order to analyze how the theoretical results compare to experimentally derived parameters. In contrast to approximations based on density functional theory, the multiconfigurational methods produce results for the ZFS of Gd(III) complexes on the correct order of magnitude.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Leveraging In-Network Computing and Programmable Switches for Streaming Analysis of Scientific Data

With the emergence of programmable network devices that match the performance of fixed function devices, several recent projects have explored in-network computing, where the processing that is traditionally done outside the network is offloaded to the network devices. In-network computing has typically been applied to network functions (e.g., load balancing, NAT, and DNS), caching, data reduction/aggregation, and coordination/consensus functions. In some cases it has been used to accelerate stream-processing tasks that involve small payloads and simple operations. In this work we focus on leveraging in-network computing for stream processing of scientific datasets with large payloads that require complex operations such as floating-point computations and logarithmic functions. We demonstrate in-network computing for a real-world scientific application performing streaming normalization of a 2-D image from a light source experiment. We discuss the challenges we encountered and potential approaches to address them.

Sankaran, Ganesh↗

Integrating Ion Mobility Mass Spectrometry with Molecular Modelling to Determine the Architecture of Multiprotein Complexes

Current challenges in the field of structural genomics point to the need for new tools and technologies for obtaining structures of macromolecular protein complexes. Here, we present an integrative computational method that uses molecular modelling, ion mobility-mass spectrometry (IM-MS) and incomplete atomic structures, usually from X-ray crystallography, to generate models of the subunit architecture of protein complexes. We begin by analyzing protein complexes using IM-MS, and by taking measurements of both intact complexes and sub-complexes that are generated in solution. We then examine available high resolution structural data and use a suite of computational methods to account for missing residues at the subunit and/or domain level. High-order complexes and sub-complexes are then constructed that conform to distance and connectivity constraints imposed by IM-MS data. We illustrate our method by applying it to multimeric protein complexes within the Escherichia coli replisome: the sliding clamp, (β 2 ), the γ complex (γ 3 δδ'), the DnaB helicase (DnaB 6 ) and the Single-Stranded Binding Protein (SSB 4 ).

59 BASIC BIOLOGICAL SCIENCES↗

Multi-Fidelity Modeling and Control for Building Temperature Control

The ability to control energy loads such as a building's heating, ventilation, and air conditioning (HVAC) system can help facilitate increased penetration of variable renewable energy sources into the electric grid. To be able to control these HVAC systems more effectively, detailed simulations of the corresponding building physics is becoming increasingly important. These detailed simulations can be complex, nonlinear, and can require immense computational power when used in an advanced control method such as model predictive control (MPC), prompting the need to explore less computationally intensive strategies. In this work, a multi-fidelity approach is proposed to combine samples from a complex, high-fidelity model with a simple, low-fidelity model within the MPC control loop. More specifically, the parameters of a reduced-order, linear building model are periodically updated with knowledge from its high-fidelity counterpart - an EnergyPlus model - in an online fashion using a Gaussian Process surrogate model. Hence, highly accurate predictions of current and future conditions in a building are maintained with a substantially reduced computational burden compared to using the high-fidelity models alone. In other words, this linear parameter varying model preserves the low computational requirements of a low-order linear model while accurately modeling a building's dynamics. This allows a building controller to take highly informed actions without requiring a large computational budget.

building modeling↗

SPARTAN (Scalable Probabilistic Application Reconfigurable Tensor Autonomous Network)

The technical founder of Ludwig Computing Inc has been competitively selected for support by Cyclotron Road, a U.S. Department of Energy (DOE) Advanced Manufacturing Office (AMO) Lab-Embedded Entrepreneurship Program (LEEP) through an approved merit review process. Ludwig Computing Inc, supported by the U.S. Department of Energy's Advanced Manufacturing Office through the Cyclotron Road program, has investigated the advantages of probabilistic computing for real-world compute-intensive applications. This research adds to the understanding of alternative computing paradigms by exploring a unique hardware-software co-design that integrates quantum computing methods with nature-inspired problem-solving techniques. The project's focus on areas such as combinatorial optimization, graph analytics, and machine learning demonstrates the potential for significant advancements in computational efficiency and performance. By harnessing natural randomness to streamline large circuits into fewer devices, Ludwig's approach enables massive parallelism, potentially offering higher throughput, speed, and energy efficiency compared to conventional hardware solutions. This work benefits the public by paving the way for more efficient computing solutions that could address complex real-world problems while potentially reducing energy consumption in data-intensive industries.

97 MATHEMATICS AND COMPUTING↗

Holographic pseudoentanglement and the complexity of the AdS/CFT dictionary

The `quantum gravity in the lab' paradigm suggests that quantum computers might shed light on quantum gravity by simulating the CFT side of the AdS/CFT correspondence and mapping the results to the AdS side. This relies on the assumption that the duality map (the `dictionary') is efficient to compute. In this work, we show that the complexity of the AdS/CFT dictionary is surprisingly subtle: there might be cases in which one can efficiently apply operators to the CFT state (a task we call 'operator reconstruction') without being able to extract basic properties of the dual bulk state such as its geometry (which we call 'geometry reconstruction'). Geometry reconstruction corresponds to the setting where we want to extract properties of a completely unknown bulk dual from a simulated CFT boundary state. We demonstrate that geometry reconstruction may be generically hard due to the connection between geometry and entanglement in holography. In particular we construct ensembles of states whose entanglement approximately obey the Ryu-Takayanagi formula for arbitrary geometries, but which are nevertheless computationally indistinguishable. This suggests that even for states with the special entanglement structure of holographic CFT states, geometry reconstruction might be hard. This result should be compared with existing evidence that operator reconstruction is generically easy in AdS/CFT. A useful analogy for the difference between these two tasks is quantum fully homomorphic encryption (FHE): this encrypts quantum states in such a way that no efficient adversary can learn properties of the state, but operators can be applied efficiently to the encrypted state. We show that quantum FHE can separate the complexity of geometry reconstruction vs operator reconstruction, which raises the question whether FHE could be a useful lens through which to view AdS/CFT.

FOS: Physical sciences↗