Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Arbitrary functions”

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 55 records · Page 3

Graph Metric Learning Quantifies Morphological Differences between Two Genotypes of Shoot Apical Meristem Cells in Arabidopsis

We present a method for learning “spectrally descriptive” edge weights for graphs. We generalize a previously known distance measure on graphs (Graph Diffusion Distance), thereby allowing it to be tuned to minimize an arbitrary loss function. Because all steps involved in calculating this modified GDD are differentiable, we demonstrate that it is possible for a small neural network model to learn edge weights which minimize loss. We apply this method to discriminate between graphs constructed from shoot apical meristem images of two genotypes of Arabidopsis thaliana specimens: wild-type and trm678 triple mutants with cell division phenotype. Training edge weights and kernel parameters with contrastive loss produces a learned distance metric with large margins between these graph categories. We demonstrate this by showing improved performance of a simple k-nearest-neighbors classifier on the learned distance matrix. We also demonstrate a further application of this method to biological image analysis. Once trained, we use our model to compute the distance between the biological graphs and a set of graphs output by a cell division simulator. Comparing simulated cell division graphs to biological ones allows us to identify simulation parameter regimes which characterize mutant vs. wild-type Arabidopsis cells. We find that trm678 mutant cells are characterized by increased randomness of division planes and decreased ability to avoid previous vertices between cell walls.

59 BASIC BIOLOGICAL SCIENCES↗

Artificial to Spiking Neural Networks Conversion with Calibration in Scientific Machine Learning

Here, we introduce a method to convert physics-informed neural networks (PINNs), commonly used in scientific machine learning, to spiking neural networks (SNNs), which are expected to have higher energy efficiency compared to traditional artificial neural networks (ANNs). We first extend the calibration technique of SNNs to arbitrary activation functions beyond ReLU, making it more versatile, and we prove a theorem that ensures the effectiveness of the calibration. We successfully convert PINNs to SNNs, enabling computational efficiency for diverse regression tasks in solving multiple differential equations, including the unsteady Navier–Stokes equations. We demonstrate great gains in terms of overall efficiency, including separable PINNs (SPINNs), which accelerate the training process. Overall, this is the first work of this kind and the proposed method achieves relatively good accuracy with low spike rates.

PINN↗

Logical Activation Functions v.1.1

SAND2024-01501O Logical Activation Functions software is a PyTorch implementation from the paper, "Logical Activation Functions for Training Arbitrary Probabilistic Boolean Logic." The activation functions approximate logit-space marginalization of probabilistic truth tables from probabilistic interpretations of inputs. They also provide a general methodology to approximate logical relationships between abstract antecedents and consequents for machine learning architectures. They do not target any specific application or use-case. By training probabilistic truth tables, these activation functions can capture more expressive relationships in a neural network than typical elementwise activation functions. This code is only designed for a single compute node with a GPU and is limited to machine learning architectures than can fit within the memory of a single GPU. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Duersch, Jed↗

LaplaceInterpolation.jl: A Julia package for fast interpolation on a grid

We implement a linear-time algorithm for interpolation on a regular multidimensional grid in the Julia language. The algorithm is an approximate Laplace interpolation (Press, 1992) when no parameters are given; and when parameters m ∈ Z and ϵ > 0 are set, the interpolant approximates a Matérn kernel, of which radial basis functions and polyharmonic splines are a special case. We implement, in addition, Neumann, Dirichlet (trivial), and average boundary conditions with potentially different aspect ratios in the different dimensions. The interpolant functions in arbitrary dimensions.

97 MATHEMATICS AND COMPUTING↗

Streaming Generalized Canonical Polyadic Tensor Decompositions

In this paper, we develop a method which we call OnlineGCP for computing the Generalized Canonical Polyadic (GCP) tensor decomposition of streaming data. GCP differs from traditional canonical polyadic (CP) tensor decompositions as it allows for arbitrary objective functions which the CP model attempts to minimize. This approach can provide better fits and more interpretable models when the observed tensor data is strongly non-Gaussian. In the streaming case, tensor data is gradually observed over time and the algorithm must incrementally update a GCP factorization with limited access to prior data. In this work, we extend the GCP formalism to the streaming context by deriving a GCP optimization problem to be solved as new tensor data is observed, formulate a tunable history term to balance reconstruction of recently observed data with data observed in the past, develop a scalable solution strategy based on segregated solves using stochastic gradient descent methods, describe a software implementation that provides performance and portability to contemporary CPU and GPU architectures and integrates with Matlab for enhanced usability, and demonstrate the utility and performance of the approach and software on several synthetic and real tensor data sets.

97 MATHEMATICS AND COMPUTING↗

The Connection of Adiabaticity to the Fourier Transform

This is probably the first thing I’d suggest anyone learns about adiabatic transitions because it tells you how a linear system reacts to an arbitrary forcing function. Not all systems are linear but they are usually locally linear near their stable fixed point. I think Scott Berg pointed out the relation to the Fourier transform to me and there’s probably literature about this under generic dynamical systems.

43 PARTICLE ACCELERATORS↗

Differentiable Multiphysics Codes: A Breakthrough Technology for Simulation and Computing

This document summarizes the findings of a strategic planning exercise commissioned by the Weapons Simulation and Computing, Computational Physics (WSC/CP) program at the Lawrence Livermore National Laboratory (LLNL) in FY24. During the year, the committee met with multiple stakeholder communities to gather input, opinions, suggestions and concerns which have been incorporated throughout this document. The key findings from this exercise are summarized: • The development of multiphysics modelling and simulation (mod/sim) codes and software technologies, their deployment on exascale compute platforms, and their broad adoption across the NNSA is a major success of the Advanced Simulation and Computing (ASC) program and the Exascale Computing Project (ECP). Sustained investment in these core technologies is essential. • Today’s state of the art involves running ensembles of O(100K) simulations to perform uncertainty quantification (UQ) and design studies using multiple statistical methods such as Bayesian optimization to understand sensitivities of our models and explore parameterized design spaces. Even with exascale computing, we are practically limited to O(10) parameters in these studies since the number of simulations required to sample the space scales exponentially with the number of design parameters. • The data from these simulation ensembles is increasingly being used to train machine learned (ML) surrogates (or reduced order models, ROMs) which can then be used for optimization or real time design exploration. However, the trained surrogates are still limited in the number of parameters they can represent due to the sampling limitations previously noted. • Augmenting our suite of integrated multiphysics simulation codes, both current and emerging, with the ability to compute gradients (solution derivatives) of arbitrary simulation outputs with respect to (some or all) simulation inputs would be a breakthrough technology, opening the door to a new era of efficient and automated inverse design based on verified and validated mod/sim capabilities. • This capability, which we refer to as differentiable multiphysics codes (DMCs), would revolutionize both UQ and optimization studies by breaking the curse of dimensionality that presently limits our “gradient-free” ensemble based computing approach. A similar breakthrough occurred in the AI/ML community once the ability to compute gradients of arbitrary loss functions using back-propagation became commonplace. Gradient information from the multiphysics codes can also be used to dramatically improve the efficiency and scale of training of ML/ROM surrogates for rapid assessments. • Achieving this in our suite of codes will be a grand challenge, similar to the amount of effort that was required to transition from CPU to GPU computing. It will require buy-in from the entire WSC/CP program and beyond, including all integrated codes, physics and engineering models, third-party library dependencies and performance portability abstractions. It will also require investment in research and development of numerical methods for computing adjoints of coupled physics across multiple adaptively refined moving meshes and of stochastic (Monte Carlo) and mesh free (SPH) methods. • New software and numerical techniques, largely pioneered by the AI/ML community, make this feasible. Chief among these is automatic differentiation (AD), the ability to employ AD at point-wise locations in a physics calculation (instead of traditional black-box approaches) and the ability to perform “back-propagation in time” (or reverse mode AD) for non-linear partial differential equations (PDEs). Fundamentally, the conclusion of this strategic planning exercise is that the time is right to undertake a large scale effort in WSC, centered on the existing integrated codes, to continue the natural evolution of mod/sim in the age of AI/ML. Instead of attempting to replace mod/sim with purely data driven AI/ML models, we believe the key to success is to integrate AI/ML by building on top of the decades of hard-won knowledge and the verified/validated multiphysics modelling capability that is the hallmark of the ASC program.

97 MATHEMATICS AND COMPUTING↗

Getting Started with Evaluations with Means and Uncertainties (EMU 3.0)

One of the most fundamental quantities in nuclear physics is the reaction cross section. A cross section represents the probability that a nuclear reaction will resolve through a given channel given a target nucleus and a projectile with a certain energy. A nuclear evaluation is a set of discrete data and interpolation rules to convert those discrete nuclear reaction data—such as the cross section—into a continuous function at arbitrary energies. Evaluated nuclear data files that can appear in Evaluated Nuclear Data File (ENDF) and Generalized Nuclear Data Structure (GNDS) formats, storing a “most-complete” discretized representation of nuclear data, based on both experimental measurements and theory models.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Dynamically Learning Incentives for Load Control

As electrical generation becomes more distributed and volatile, and loads become more uncertain, controllability of distributed energy resources (DERs), regardless of their ownership status, will be necessary for grid reliability. Grid operators lack direct control over end-users' grid interactions, such as energy usage, but incentives can influence behavior -- for example, an end-user that receives a grid-driven incentive may adjust their consumption or expose relevant control variables in response. A key challenge in studying such incentives is the lack of data about human behavior, which usually motivates strong assumptions, such as distributional assumptions on compliance or rational utility-maximization. In this paper, we propose a general incentive mechanism in the form of a constrained optimization problem -- our approach is distinguished from prior work by modeling human behavior (e.g., reactions to an incentive) as an arbitrary unknown function. We propose feedback-based optimization algorithms to solve this problem that each leverage different amounts of information and/or measurements. We show that each converges to an asymptotically stable incentive with (near)-optimality guarantees given mild assumptions on the problem. Finally, we evaluate our proposed techniques in voltage regulation simulations on standard test beds. We test a variety of settings, including those that break assumptions required for theoretical convergence (e.g., convexity, smoothness) to capture realistic settings. In this evaluation, our proposed algorithms are able to find near-optimal incentives even when the reaction to an incentive is modeled by a theoretically difficult (yet realistic) function.

demand response↗

Superluminal matter waves

The Dirac equation has resided among the greatest successes of modern physics since its emergence as the first quantum mechanical theory fully compatible with special relativity. This compatibility ensures that the expectation value of the velocity is less than the vacuum speed of light. Here, we show that the Dirac equation admits free-particle solutions where the peak amplitude of the wave function can travel at any velocity, including those exceeding the vacuum speed of light, despite having a subluminal velocity expectation value. The solutions are constructed by superposing basis functions with correlations in momentum space. These arbitrary velocity wave functions feature a near-constant profile and may impact quantum mechanical processes that are sensitive to the local value of the probability density as opposed to expectation values.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Massively parallel and universal approximation of nonlinear functions using diffractive processors

Nonlinear computation is essential for a wide range of information processing tasks, yet implementing nonlinear functions using optical systems remains a challenge due to the weak and power-intensive nature of optical nonlinearities. Overcoming this limitation without relying on nonlinear optical materials could unlock unprecedented opportunities for ultrafast and parallel optical computing systems. Here, we demonstrate that large-scale nonlinear computation can be performed using linear optics through optimized diffractive processors composed of passive phase-only surfaces. In this framework, the input variables of nonlinear functions are encoded into the phase of an optical wavefront—e.g., via a spatial light modulator (SLM)—and transformed by an optimized diffractive structure with spatially varying point-spread functions to yield output intensities that approximate a large set of unique nonlinear functions–all in parallel. We provide proof establishing that this architecture serves as a universal function approximator for an arbitrary set of bandlimited nonlinear functions, also covering wavelength-multiplexed nonlinear functions as well as multi-variate and complex-valued functions that are all-optically cascadable. Our analysis also indicates the successful approximation of typical nonlinear activation functions commonly used in neural networks, including the sigmoid, tanh, ReLU (rectified linear unit), and softplus. We numerically demonstrate the parallel computation of one million distinct nonlinear functions, accurately executed at wavelength-scale spatial density at the output of a diffractive optical processor. Furthermore, we experimentally validated this framework using in situ optical learning and approximated 35 unique nonlinear functions in a single shot using a compact setup consisting of an SLM and an image sensor. These results establish diffractive optical processors as a scalable platform for massively parallel universal nonlinear function approximation, paving the way for new capabilities in analog optical computing based on linear materials.

Rahman, Md Sadman Sakib [University of California,↗

Phase retrieval using Gaussian basis functions

A wavefront map of arbitrary aperture can be represented by a sum of Gaussian basis functions. Its performance is compared here to other representation methods such as orthonormal polynomials and Fourier modes. Gaussian basis functions can be applied to phase retrieval of high-frequency wavefront maps. Experiments show good agreement with direct measurements by a wavefront sensor. Finally, optimum measurement conditions are discussed based on the statistics of wavefront properties.

47 OTHER INSTRUMENTATION↗

Weight function procedure for reduced order fracture analysis of arbitrary flaws in cylindrical pressure vessels

Fracture mechanics calculations using the finite element method can be computationally expensive, which makes them challenging to use in engineering evaluations of flaws in pressure vessels. The weight function (WF) technique is a reduced order fracture modeling method that is widely used to greatly reduce these computational costs. Its computational efficiency is essential for use in probabilistic fracture mechanics evaluations of embrittled nuclear reactor pressure vessels (RPVs), due to the large number of sampled flaws that must be evaluated. Although the WF technique is general, it is typically used only for axis-aligned flaws. Recent discoveries of off-axis flaws in operating nuclear reactors have necessitated detailed simulations of such flaws and the interactions between neighboring flaws. This paper presents a generalized WF approach applicable for analyzing arbitrary flaw geometries in thick-walled cylindrical vessels, including surface-breaking and subsurface flaws, which can either axis-aligned or off-axis, and can account for interactions with other flaws. Herein, this approach is demonstrated on representative simulations of multiple flaw geometries in a RPV subjected to transient loading conditions. In all cases, the WF technique gives good comparison with benchmark results from direct simulation with greatly reduced computational effort.

42 ENGINEERING↗

Hierarchical Self-Assembly of Carbon Dots into High-Aspect-Ratio Nanowires

Here, we report a spontaneous and hierarchical self-assembly mechanism of carbon dots prepared from citric acid and urea into nanowire structures with large aspect ratios (>50). Scattering-type scanning near-field optical microscopy (s-SNOM) with broadly tunable mid-IR excitation was used to interrogate details of the self-assembly process by generating nanoscopic chemical maps of local wire morphology and composition. s-SNOM images capture the evolution of wire formation and the complex interplay between different chemical constituents directing assembly over the nano- to microscopic length scales. We propose that residual citrate promotes tautomerization of melamine surface functionalities to produce supramolecular shape synthons comprised of melamine-cyanurate adducts capable of forming long-range and highly directional hydrogen-bonding networks. This intrinsic, heterogeneity-driven self-assembly mechanism reflects synergistic combinations of high chemical specificity and long-range cooperativity that may be harnessed to reproducibly fabricate functional structures on arbitrary surfaces.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Exploring gauge-fixing conditions with gradient-based optimization

Lattice gauge fixing is required to compute gauge-variant quantities, for example those used in RI-MOM renormalization schemes or as objects of comparison for model calculations. Recently, gauge-variant quantities have also been found to be more amenable to signal-to-noise optimization using contour deformations. These applications motivate systematic parameterization and exploration of gauge-fixing schemes. This work introduces a differentiable parameterization of gauge fixing which is broad enough to cover Landau gauge, Coulomb gauge, and maximal tree gauges. The adjoint state method allows gradient-based optimization to select gauge-fixing schemes that minimize an arbitrary target loss function.

Detmold, William↗

An implicit solution for Asay foil trajectories generated by separable, sustained-production ejecta source models

We present a simple implicit solution for the time-dependent trajectory of a thin Asay foil ejecta diagnostic for the general case where the impinging ejecta cloud is generated by a source function characterized by an arbitrary (sustained) time dependence and a time-independent (stationary) particle velocity distribution. In the limit that the source function time dependence becomes a delta function, this solution—which is amenable to rapid numerical calculations of arbitrary accuracy—exactly recovers a previously published solution for the special case of instantaneous ejecta production. We also derive simple expressions for the free-surface arrival (catch-up) time as well as the true ejecta areal mass accumulation on the accelerating foil and place bounds on the level of error incurred when applying instant-production mass solutions to a sustained-production trajectory. We demonstrate these solutions with example calculations for hypothetical source functions spanning a wide range of ejecta production durations, velocity distributions, and temporal behaviors. These calculations demonstrate how the foil trajectory is often insensitive to the temporal dependence of the source function, instead being dominated by the velocity distribution. We quantify this insensitivity using a “compatibility score” metric. Under certain conditions, one may capitalize upon this insensitivity to obtain a good approximation of the second integral of the velocity distribution from the observed foil trajectory.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Drift‐Kinetic Method for Obtaining Gradients in Plasma Properties From Single‐Point Distribution Function Data

Abstract In this paper, we derive a new drift‐kinetic method for estimating gradients in the plasma properties through a velocity space distribution at a single point. The gradients are intrinsically related to agyrotropic features of the distribution function. This method predicts the gradients in the magnetized distribution function and can predict gradients of arbitrary moments of the gyrotropic background distribution function. The method allows for estimates on density and pressure gradients on the scale of a Larmor radius, proving to resolve smaller scales than any method currently available to spacecraft. The model is verified with a set of fully kinetic VPIC particle‐in‐cell simulations.

Wetherton, B. A.↗

Comparing the MELCOR Aerosol Deposition Model with Exact Analytical Solutions

Exact analytical solutions are presented for the evolution of the aerosol particle mass density function in a control volume for particle deposition due to gravitational settling, thermophoresis, and diffusion. The solutions are for arbitrary initial mass density functions and are applied for an initial lognormal density function. Integration of these solutions provides the suspended mass in the control volume as a function of time. These solutions serve as an exact benchmark to assess the accuracy of numerical methods. For the numerical algorithm used in MELCOR, excellent agreement is obtained for gravitational settling, diffusive deposition, and thermophoretic deposition for the suspended aerosol mass. In all cases, the default number of discrete particle size bins of 10 is shown to converge, with hardly any advantage to using 20 size bins.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗