SEARCH · Engineering Papers

Results for “EXPONENTIAL FUNCTION”

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.

SourceResearch connectionFrom yearThrough year

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

At least 55 records · Page 3

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Uncovering the binding nature of thiocyanate in contact ion pairs with lithium ions

Ion pair formation is a fundamental molecular process that occurs in a wide variety of systems, including electrolytes, biological systems, and materials. In solution, the thiocyanate (SCN–) anion interacts with cations to form contact ion pairs (CIPs). Due to its ambidentate nature, thiocyanate can bind through either its sulfur or nitrogen atoms, depending on the solvent. This study focuses on the binding nature of thiocyanate with lithium ions as a function of the solvents using FTIR, 2D infrared spectroscopy (2DIR) spectroscopies, and theoretical calculations. The study reveals that the SCN– binding mode (S or N end) in CIPs can be identified through 2DIR spectroscopy but not by linear IR spectroscopy. Linear IR spectroscopy shows that the CN stretch frequencies are too close to one another to separate N- and S-bound CIPs. Moreover, the IR spectrum shows that the S–C stretch presents different frequencies for the salt in different solvents, but it is related to the anion speciation rather than to its binding mode. A similar trend is observed for the anion bend. 2DIR spectra show different dynamics for N-bound and S-bound thiocyanate. In particular, the frequency–frequency correlation function (FFCF) dynamics extracted from the 2DIR spectra have a single picosecond exponential decay for N-bound thiocyanate and a biexponential decay for S-bound thiocyanate, consistent with the binding mode of the anion. Lastly, it is also observed that the binding mode also affects the line shape parameters, probably due to the different molecular mechanisms of the FFCF for N- and S-bound CIPs.

25 ENERGY STORAGE↗

DOE OSTI2025

Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem

Simon’s problem is to find a hidden period (a bitstring) encoded into an unknown 2-to-1 function. It is one of the earliest problems for which an exponential quantum speedup was proven for ideal, noiseless quantum computers, albeit in the oracle model. Here, using two different 127-qubit IBM Quantum superconducting processors, we demonstrate an algorithmic quantum speedup for a variant of Simon’s problem where the hidden period has a restricted Hamming weight 𝑤. For sufficiently small values of 𝑤 and for circuits involving up to 58 qubits, we demonstrate an exponential speedup, albeit of a lower quality than the speedup predicted for the noiseless algorithm. The speedup exponent and the range of 𝑤 values for which an exponential speedup exists are significantly enhanced when the computation is protected by dynamical decoupling. Further enhancement is achieved with measurement error mitigation. This case constitutes a demonstration of a bona fide quantum advantage for an Abelian hidden subgroup problem.

computation↗

DOE OSTI2025

Simplifying activations with linear approximations in neural networks

A key step in Neural Networks is activation. Among the different types of activation functions, sigmoid, tanh, and others involve the usage of exponents for calculation. From a hardware perspective, exponential implementation implies the usage of Taylor series or repeated methods involving many addition, multiplication, and division steps, and as a result are power-hungry and consume many clock cycles. We implement a piecewise linear approximation of the sigmoid function as a replacement for standard sigmoid activation libraries. This approach provides a practical alternative by leveraging piecewise segmentation, which simplifies hardware implementation and improves computational efficiency. In this paper, we detail piecewise functions that can be implemented using linear approximations and their implications for overall model accuracy and performance gain. Our results show that for the DenseNet, ResNet, and GoogLeNet architectures, the piecewise linear approximation of the sigmoid function provides faster execution times compared to the standard TensorFlow sigmoid implementation while maintaining comparable accuracy. Specifically, for MNIST with DenseNet, accuracy reaches 99.91% (Piecewise) vs. 99.97% (Base) with up to 1.31x speedup in execution time. For CIFAR-10 with DenseNet, accuracy improves to 98.97% (Piecewise) vs. 99.40% (Base) while achieving 1.24x faster execution. Similarly, for CIFAR-100 with DenseNet, the accuracy is 97.93% (Piecewise) vs. 98.39% (Base), with a 1.18x execution time reduction. These results confirm the proposed method’s capability to efficiently process large-scale datasets and computationally demanding tasks, offering a practical means to accelerate deep learning models, including LSTMs, without compromising accuracy.

Activation function↗

DOE OSTI2025

Score-Based Physics-Informed Neural Networks for High-Dimensional Fokker–Planck Equations

The Fokker-Planck (FP) equation is a foundational partial differential equation (PDE) in stochastic processes involving Brownian motions. However, the curse of dimensionality (CoD) poses a formidable challenge when dealing with high-dimensional FP equations. Although Monte Carlo simulation and (vanilla) Physics-Informed Neural Networks (PINNs) have shown the potential to tackle CoD, both methods exhibit significant numerical errors in high dimensions when dealing with the probability density function (PDF) associated with Brownian motion. The point-wise PDF values tend to decrease exponentially as dimensionality increases, surpassing the precision of numerical simulations and resulting in substantial errors. In addition, due to its massive sampling, Monte Carlo fails to offer fast sampling. Modeling the logarithm likelihood (LL) via vanilla PINNs transforms the FP equation into a notoriously difficult Hamilton-Jacobi-Bellman (HJB) equation, which is impractical for PINN learning, whose error grows rapidly with dimension. To this end, we propose a novel approach utilizing a score-based solver to fit the score function in stochastic differential equations (SDEs). The score function, defined as the gradient of the LL, plays a fundamental role in inferring LL and PDF and enables fast SDE sampling, offering an effective means to overcome the CoD. Three fitting methods, Score Matching (SM), Sliced Score Matching (SSM), and Score-PINN, are introduced, each contributing unique advantages in computational complexity, accuracy, and generality. The proposed score-based SDE solver operates in two stages: first, employing score matching or Score-PINN to acquire the score function; and second, solving the LL via an ordinary differential equation (ODE) using the obtained score function. Comparative evaluations across these methods showcase varying trade-offs. The proposed methodology is evaluated across diverse SDEs, including anisotropic Ornstein-Uhlenbeck processes, geometric Brownian motion, and Brownian motion with varying eigenspace. We also test various distributions, including Gaussian, Log-normal, Laplace, and Cauchy distributions. The numerical results demonstrate the score-based SDE solver’s stability, speed, and performance across different experimental settings, solidifying its potential as a solution to CoD for high-dimensional FP equations.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Convergence analysis for a nonlocal gradient descent method via directional Gaussian smoothing

We analyze the convergence of a nonlocal gradient descent method for minimizing a class of high-dimensional non-convex functions, where a directional Gaussian smoothing (DGS) is proposed to define the nonlocal gradient (also referred to as the DGS gradient). The method was first proposed in [Zhang et al., Enabling long-range exploration in minimization of multimodal functions, UAI 2021], in which multiple numerical experiments showed that replacing the traditional local gradient with the DGS gradient can help the optimizers escape local minima more easily and significantly improve their performance. However, a rigorous theory for the efficiency of the method on nonconvex landscape is lacking. In this work, we investigate the scenario where the objective function is composed of a convex function, perturbed by deterministic oscillating noise. We provide a convergence theory under which the iterates exponentially converge to a tightened neighborhood of the solution, whose size is characterized by the noise wavelength. Here, we also establish a correlation between the optimal values of the Gaussian smoothing radius and the noise wavelength, thus justifying the advantage of using moderate or large smoothing radii with the method. Furthermore, if the noise level decays to zero when approaching the global minimum, we prove that DGS-based optimization converges to the exact global minimum with linear rates, similarly to standard gradient-based methods in optimizing convex functions. Several numerical experiments are provided to confirm our theory and illustrate the superiority of the approach over those based on the local gradient.

Tran, Hoang [Oak Ridge National Laboratory (ORNL),↗

DOE OSTI2024

A multiscale model to understand the interface chemistry, contacts, and dynamics during lithium stripping

A reversible Li-metal electrode, paired with a solid electrolyte, is critical for attaining higher energy density and safer batteries beyond the current lithium-ion cells. A stable stripping process may be even harder to attain as the stripping process will remove Li-atoms from the surface, and naturally reduce surface contact area, if not self-corrected by other mechanisms, such as diffusion and plastic deformation under an applied external stack pressure. Here, we capture these mechanisms occurring at multiple length- and time- scales, i.e., interface interactions, vacancy hopping, and plastic deformation, by integrating density functional theory (DFT) simulations, kinetic Monte Carlo (KMC), and continuum finite element method (FEM). By assuming the self-affine nature of multiscale contacts, we predict the steady-state contact area as a function of stripping current density, interface wettability, and stack pressure. We further estimate the exponential increase of overpotential due to contact area loss to maintain the same stripping current density. We demonstrate that a lithiophilic interface requires less stack pressure to reach the same steady-state contact area fraction than a lithiophobic interface. A “tolerable steady-state” contact area loss for maintaining stable stripping is estimated at 20 %, corresponding to a 10 % increase in overpotential. To constrain contact loss within the tolerance, the required stack pressure is 0.1, 0.5, and 2 times the yield strength of lithium metal for three distinct interfaces, lithiophilic Li/lithium oxide(Li2O), Li/lithium lanthanum zirconium oxide(LLZO), and lithiophoblic Li/lithium fluoride(LiF), respectively. The modeling results agree with experiments on the impact of the stack pressure quantitatively, while the discrepancy in stripping rate sensitivity is attributed to the simplifying interface interaction in our simulations. Overall, this multiscale simulation framework demonstrates the importance of electrochemical-mechanical coupling in understanding the dynamics of the Li/SE interface during stripping.

Feng, Min↗

DOE OSTI2024

Logistic function as a characteristic of multipactor development

Simulations of multipacting with or without space charge effect bring out a different behavior of particle number growth, namely, the exponential growth of particle number in the simulations without space charge effect and the saturation of particle number (or collision and emission currents) when space charge is considered. That creates a certain confusion in evaluation and comparison of overall danger of multipactor between the approaches. On the other hand, both growth rate and total multipactor current loading at saturation are important for multipactor barriers evaluation. It was noticed and then verified that the logistic function, widely used in chemistry, biology, and ecosystem study, reproduces the particle number growth curves remarkably well. The function contains the parameters, which can be interpreted as particle number growth rate and multipactor current saturation level, so both become correlated and obtained simultaneously in one run. In this work it is shown how the logistic function can be used for characterization of the multipactor barriers and how it can be used for possible reduction of simulation time in the simulations with space charge effect.

Romanov, Gennady↗

DOE OSTI2025

Bottom-Up Simulation, Reconstruction, and Quantification of Macromolecule Sequences from Experimental Polymerizations

Motivated by the canonical sequence–structure–function paradigm, tools to characterize chemical patterning in natural biomacromolecules, from proteins to nucleic acids, have grown exponentially in recent years. However, analogous strategies for synthetic macromolecules remain in nascent stages, complicated by sequence polydispersity and analytical limitations. To address this, we have developed a comprehensive and open-source Python package, PRISM (polymer rate insights and sequence modeling), an end-to-end workflow that provides a path from experimental kinetics measurements to quantitative and qualitative metrics for describing chemical patterning in stochastic polymers. First, a numerical integration strategy was constructed to simulate and fit experimental data from reversible addition–fragmentation chain transfer (RAFT) polymerization kinetics, enabling the facile estimation of relevant reactivity ratios. These ratios were then used in a mechanism-specific stochastic kinetic simulation strategy to simulate sequence ensembles corresponding to model systems spanning experimental copolymers, classes of statistical polymers (e.g., alternating, block, and gradient), and multiblock copolymers. Lastly, inspired by sequence homology metrics from bioinformatics, we introduce visualization strategies and quantitative metrics to facilitate comparisons of different sequence ensembles. As the sequence–structure–function paradigm becomes increasingly central in de novo design of synthetic macromolecules, this toolkit provides a first step toward accurate and representative sequence description and featurization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2025

Stretched exponential magnetic relaxation dynamics in artificial square ice revealed through x-ray photon correlation spectroscopy

X-ray photon correlation scattering measurements are undertaken on a thermally active artificial spin ice based on the square lattice, referred to as artificial square ice, to probe the fluctuation timescales as a function of temperature as the system passes through the paramagnetic-antiferromagnetic phase transition, which belongs to the two-dimensional Ising universality class. In the paramagnetic regime, a single exponential timescale is seen, whereas at and below the critical temperature, a stretched exponential decorrelation is observed, with the stretching exponent decreasing from unity down to below one-half as the temperature reduces. This trend is confirmed by kinetic Monte Carlo simulations of a simplified point-dipolar square ice system, and is in agreement with past theoretical work on the kinetic Ising model where stretched exponential relaxation due to equilibrium domain wall dynamics below the critical temperature was found.

36 MATERIALS SCIENCE↗

DOE OSTI2024

Codiscovering graphical structure and functional relationships within data: A Gaussian Process framework for connecting the dots

Most problems within and beyond the scientific domain can be framed into one of the following three levels of complexity of function approximation. Type 1: Approximate an unknown function given input/output data. Type 2: Consider a collection of variables and functions, some of which are unknown, indexed by the nodes and hyperedges of a hypergraph (a generalized graph where edges can connect more than two vertices). Given partial observations of the variables of the hypergraph (satisfying the functional dependencies imposed by its structure), approximate all the unobserved variables and unknown functions. Type 3: Expanding on Type 2, if the hypergraph structure itself is unknown, use partial observations of the variables of the hypergraph to discover its structure and approximate its unknown functions. These hypergraphs offer a natural platform for organizing, communicating, and processing computational knowledge. While most scientific problems can be framed as the data-driven discovery of unknown functions in a computational hypergraph whose structure is known (Type 2), many require the data-driven discovery of the structure (connectivity) of the hypergraph itself (Type 3). We introduce an interpretable Gaussian Process (GP) framework for such (Type 3) problems that does not require randomization of the data, access to or control over its sampling, or sparsity of the unknown functions in a known or learned basis. Its polynomial complexity, which contrasts sharply with the super-exponential complexity of causal inference methods, is enabled by the nonlinear ANOVA capabilities of GPs used as a sensing mechanism.

Science & Technology - Other Topics↗

DOE OSTI2024

High throughput, accurate gene annotation through AI and HPC-enabled structural analysis

With the advances in next generation sequencing technologies, the number of sequenced genomes is growing exponentially, resulting in a technology bottleneck for the translation of sequence information into usable hypotheses about the function of each gene. We have proposed leveraging our leadership high-performance computing (HPC) resources to help break this annotation bottleneck. Here we design an HPC-based framework to infer gene function from gene sequence by incorporating information about protein structure and interactions predicted by deep learning approaches. Accurate functional prediction and gene annotation using computational methods will facilitate breakthroughs in the genomic sciences essential to understanding and harnessing life processes in bacteria, fungi and plants. The development and applications of the state-of-the-art deep neural networks to protein structural modeling, interaction prediction, sequence comparison, and quality assessment of protein structural models will be made possible by leadership computational resources. These HPC-enabled bioinformatics and molecular modeling tools will provide powerful insights into molecular functions of genes.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2025

Quantum Adiabatic Optimization with Rydberg Arrays: Localization Phenomena and Encoding Strategies

Quantum adiabatic optimization seeks to solve combinatorial problems using quantum dynamics, requiring the Hamiltonian of the system to align with the problem of interest. However, these Hamiltonians are often incompatible with the native constraints of quantum hardware, necessitating encoding strategies to map the original problem into a hardware-conformant form. While the classical overhead associated with such mappings is easily quantifiable and typically polynomial in problem size, it is much harder to quantify their overhead on the quantum algorithm, e.g., the transformation of the adiabatic timescale. In this work, we address this challenge on the concrete example of the encoding scheme proposed in [Nguyen , PRX Quantum , 010316 (2023)], which is designed to map optimization problems on arbitrarily connected graphs into Rydberg atom arrays. We consider the fundamental building blocks underlying this encoding scheme and determine the scaling of the minimum gap with system size along adiabatic protocols. Even when the original problem is trivially solvable, we find that the encoded problem can exhibit an exponentially closing minimum gap. We show that this originates from a quantum coherent effect, which gives rise to an unfavorable localization of the ground-state wave function. On the QuEra Aquila neutral atom machine, we observe such localization and its effect on the success probability of finding the correct solution to the encoded optimization problem. Finally, we propose quantum-aware modifications of the encoding scheme that avoid this quantum bottleneck and lead to an exponential improvement in the adiabatic performance. This highlights the crucial importance of accounting for quantum effects when designing strategies to encode classical problems onto quantum platforms. Published by the American Physical Society 2025

Bombieri, Lisa (ORCID:0009000950422897)↗

DOE OSTI2025

Essential barrier height and a probabilistic approach in characterizing potential landscape

In this work we propose a probabilistic approach to investigate the shape of landscapes of multi-dimensional potential functions. Under a suitable coupling scheme, two copies of the overdamped Langevin dynamics associated with the potential function are coupled, and the coupling times are collected. Assuming a set of intuitive yet technically challenging conditions on the coupling scheme, it is shown that the tail distributions of the coupling times exhibit qualitatively different dependencies on the noise magnitude for single-well versus multi-well potential functions. More specifically, for convex single-well potentials, the negative tail exponent of the coupling time distribution is uniformly bounded away from zero by the convexity parameter and is independent of the noise magnitude. In contrast, for multi-well potentials, the negative tail exponent decreases exponentially as the noise vanishes, with the decay rate governed by the essential barrier height, a quantity introduced in this paper to characterize the non-convex nature of the potential function. Numerical investigations are conducted for a variety of examples, including the Rosenbrock function, interacting particle systems, and loss functions arising in artificial neural networks. These examples not only illustrate the theoretical results in various contexts but also provide crucial numerical validation of the conjectured assumptions, which are essential to the theoretical analysis yet lie beyond the reach of standard technical tools.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Fermi Velocity Dependent Critical Current in Ballistic Bilayer Graphene Josephson Junctions

We perform transport measurements on proximitized, ballistic, bilayer graphene Josephson junctions (BGJJs) in the intermediate-to-long junction regime (L > ξ). We measure the device’s differential resistance as a function of bias current and gate voltage for a range of different temperatures. The extracted critical current IC follows an exponential trend with temperature: exp(−k B T/δE). Here δE = ħν F /2πL: an expected trend for intermediate-to-long junctions. From δE, we determine the Fermi velocity of the bilayer graphene, which is found to increase with gate voltage. Simultaneously, we show the carrier density dependence of δE, which is attributed to the quadratic dispersion of bilayer graphene. This is in contrast to single layer graphene Josephson junctions, where δE and the Fermi velocity are independent of the carrier density. The carrier density dependence in BGJJs allows for additional tuning parameters in graphene-based Josephson junction devices.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2025

Differentially Private Map Matching (DPMM) v1.0

Human mobility trajectories provide valuable information for developing mobility applications, as they contain diverse and rich information about the users. User mobility data is valuable for various applications such as intelligent transportation systems (ITS), commercial business models, and disease-spread models. However, such spatio-temporal traces may pose a threat to user privacy. GPS trajectories in their raw form are not suitable for transportation studies, as they require matching locations with nearest road links — a process called map-matching. This software implements a differential privacy (DP)-based map-matching algorithm, called DPMM, that generates link-level location trajectories in a privacy-preserving manner to protect users' origin destinations (OD) and travel paths. OD privacy is achieved by injecting Planar Laplace noise to the user OD GPS points. Travel-path privacy is provided with randomized travel path construction using exponential DP mechanism. The injected noise level is selected adaptively, by considering the link density of the location and the functional category of the localized links. For path privacy, our mechanism samples waypoints and selects candidate paths between waypoints. DPMM provides privacy effectively with respect to link density instead of other trajectory samples in the database compared to other privacy mechanisms. Compared to the different baseline models our DP-based privacy model offers closer query responses to the raw data in terms of individual and aggregate trajectory-level statistics with an average at absolute deviation from the baseline for individual statistics on ϵ = 1.0. Beyond individual trajectory statistics, the DPMM outperforms the other benchmark DP-based mechanisms on different aggregate statistics with up to 8x improvement in utility.

Peisert, Sean [Lawrence Berkeley National Laborato↗

DOE OSTI2026

Magnus method for electronic structure calculations at extreme conditions

We present the application of Magnus based methods to the solution of first order coupled ordinary differential equations in High Energy Density (HED) physics applications. Our focus is on the application to quantum mechanical methods, specifically on the solution of the radial Dirac equation for real and complex energies. HED applications require accurate solutions across a wide range of spatial and energy domains, including regimes where the solutions exhibit pronounced oscillatory behavior. Such cases pose significant computational challenges. We demonstrate that Magnus-based integrators can efficiently and accurately address these challenges. We discuss the implementation of the Magnus method for the solution of the radial Dirac equation, including practical considerations such as the evaluation of matrix exponentials, numerical integration, error estimation, and adaptive step size control. We also discuss the application of these methods to complex energy Green’s function techniques and the efficient approximation of integrals of the solutions relevant to HED electronic structure calculations. Here, we demonstrate the accuracy and robustness of the resulting method in applications to the free-particle case, for which analytic solutions are available for comparison, as well as the challenging case of gold at HED conditions.

general physics↗

DOE OSTI2024

Structure Factors for Hot Neutron Matter from Ab Initio Lattice Simulations with High-Fidelity Chiral Interactions

We present the first ab initio lattice calculations of spin and density correlations in hot neutron matter using high-fidelity interactions at next-to-next-to-next-to-leading order in chiral effective field theory. These correlations have a large impact on neutrino heating and shock revival in core-collapse supernovae and are encapsulated in functions called structure factors. Unfortunately, calculations of structure factors using high-fidelity chiral interactions were well out of reach using existing computational methods. In this Letter, we solve the problem using a computational approach called the rank-one operator (RO) method. The RO method is a general technique with broad applications to simulations of fermionic many-body systems. It solves the problem of exponential scaling of computational effort when using perturbation theory for higher-body operators and higher-order corrections. Using the RO method, we compute the vector and axial static structure factors for hot neutron matter as a function of temperature and density. Here, the ab initio lattice results are in good agreement with virial expansion calculations at low densities but are more reliable at higher densities. Random phase approximation codes used to estimate neutrino opacity in core-collapse supernovae simulations can now be calibrated with ab initio lattice calculations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2026

Comparison of the Arrhenius parameters between conventional hydrothermal and microwave-assisted synthesis methods for tin oxide nanoparticles

Microwave (MW) irradiation has emerged as a powerful tool for accelerating materials synthesis, yet the origins of its specific influence on reaction kinetics remain elusive. While multiple studies have attributed the observed enhancements in reaction rates under MW heating to reduced activation energies, other accounts have suggested modifications to the Arrhenius pre-exponential factor as the predominant cause. Distinguishing between these parameters in modern applications of MW processing in nanomaterials requires experimental approaches capable of resolving the dynamic and nuanced structural kinetics that govern MW-assisted chemistry. Here, we combine in-situ synchrotron X-ray total scattering with pair distribution function (PDF) analysis to track the structural evolution of SnO 2 nanoparticles synthesized via MW-assisted and conventional hydrothermal conditions. Avrami modeling and Arrhenius analysis suggest that although MW irradiation yields a higher apparent activation energy, the enhanced crystallization is better explained by a pre-exponential factor several orders of magnitude larger than that of conventional heating. These findings suggest that the MW field induces a higher frequency of successful molecular rearrangements rather than lowering the intrinsic activation barrier. The results contribute further insights clarifying the role of the applied MW field for materials design where MW-specific effects can be deliberately harnessed. Furthermore, this work presents a framework promoting the utility of in-situ PDF characterization coupled with kinetic analysis for developing more sophisticated descriptions of nanoscale transformations for MW-driven reaction kinetics.

36 MATERIALS SCIENCE↗