Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Symbolic computing”

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 235 records · Page 13

From Rules to Reasoning: A Survey of Large Language Model-Based Approaches to Scientific Hypothesis and Idea Generation

Scientific hypothesis generation represents a fundamental challenge in contemporary research due to exponentially expanding literature volumes and increasing disciplinary specialization. Large language models (LLMs) have emerged as transformative tools for automated scientific discovery, moving beyond traditional rule-based and literature-mining approaches. Four paradigmatic approaches define current LLM-driven hypothesis generation: direct prompting and fine-tuning methods, knowledge-enhanced frameworks integrating retrieval-augmented generation (RAG), multi-agent collaborative systems simulating research teams, and reasoning-focused approaches implementing cognitive architectures. Domain-specific applications demonstrate statistical equivalence to human expert performance in social psychology, experimental validation in biomedical research, and near-expert quality in astronomy. Evaluation methodologies encompass human expert assessment, LLM-as-judge frameworks, and comprehensive benchmarking systems. Technical challenges include hallucination management, knowledge integration limitations, and balancing novelty with feasibility. Future directions emphasize hybrid neural-symbolic architectures and sophisticated human-AI collaboration models for responsible scientific discovery acceleration.

AI-driven discovery↗

Towards physics-informed explainable machine learning and causal models for materials research

From emergent material descriptions to estimation of properties stemming from structures to optimization of process parameters for achieving best performance – all key facets of materials science and related fields have experienced tremendous growth with the introduction of data-driven models. This gradual progression goes at par with developments of machine learning workflows, from purely data-driven shallow models to those that are well-capable in encoding more complex graphs, symbolic representations, invariances, and positional embeddings. Furthermore, this perspective aims at summarizing strategic aspects of such transitions while providing insights into the requirements of bringing in explainable, interpretable predictive models, and causal learning to aid in materials design and discovery. Although the focus remains on a variety of functional materials by providing a handful of case studies, the applications of such integrated methodologies are universal to facilitate fundamental understandings of materials physics while enabling autonomous experiments.

36 MATERIALS SCIENCE↗

Challenging Practices of Algebraic Battery Life Models through Statistical Validation and Model Identification via Machine-Learning

Various modeling techniques are used to predict the capacity fade of Li-ion batteries. Algebraic reduced-order models, which are inherently interpretable and computationally fast, are ideal for use in battery controllers, technoeconomic models, and multi-objective optimizations. For Li-ion batteries with graphite anodes, solid-electrolyte-interphase (SEI) growth on the graphite surface dominates fade. This fade is often modeled using physically informed equations, such as square-root of time for predicting solvent-diffusion limited SEI growth, and Arrhenius and Tafel-like equations predicting the temperature and state-of-charge rate dependencies. In some cases, completely empirical relationships are proposed. However, statistical validation is rarely conducted to evaluate model optimality, and only a handful of possible models are usually investigated. This article demonstrates a novel procedure for automatically identifying reduced-order degradation models from millions of algorithmically generated equations via bi-level optimization and symbolic regression. Identified models are statistically validated using cross-validation, sensitivity analysis, and uncertainty quantification via bootstrapping. On a LiFePO 4 /Graphite cell calendar aging data set, automatically identified models utilizing square-root, power law, stretched exponential, and sigmoidal functions result in greater accuracy and lower uncertainty than models identified by human experts, and demonstrate that previously known physical relationships can be empirically "rediscovered" using machine learning.

25 ENERGY STORAGE↗

Combining data and theory for derivable scientific discovery with AI-Descartes

Abstract Scientists aim to discover meaningful formulae that accurately describe experimental data. Mathematical models of natural phenomena can be manually created from domain knowledge and fitted to data, or, in contrast, created automatically from large datasets with machine-learning algorithms. The problem of incorporating prior knowledge expressed as constraints on the functional form of a learned model has been studied before, while finding models that are consistent with prior knowledge expressed via general logical axioms is an open problem. We develop a method to enable principled derivations of models of natural phenomena from axiomatic knowledge and experimental data by combining logical reasoning with symbolic regression. We demonstrate these concepts for Kepler’s third law of planetary motion, Einstein’s relativistic time-dilation law, and Langmuir’s theory of adsorption. We show we can discover governing laws from few data points when logical reasoning is used to distinguish between candidate formulae having similar error on the data.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Giallar: push-button verification for the qiskit Quantum compiler

This paper presents Giallar, a fully-automated verification toolkit for quantum compilers. Giallar requires no manual specifications, invariants, or proofs, and can automatically verify that a compiler pass preserves the semantics of quantum circuits. To deal with unbounded loops in quantum compilers, Giallar abstracts three loop templates, whose loop invariants can be automatically inferred. To efficiently check the equivalence of arbitrary input and output circuits that have complicated matrix semantics representation, Giallar introduces a symbolic representation for quantum circuits and a set of rewrite rules for showing the equivalence of symbolic quantum circuits. With Giallar, we implemented and verified 44 (out of 56) compiler passes in 13 versions of the Qiskit compiler, the open-source quantum compiler standard, during which three bugs were detected in and confirmed by Qiskit. Furthermore, our evaluation shows that most of Qiskit compiler passes can be automatically verified in seconds and verification imposes only a modest overhead to compilation performance.

automated verification↗

FASTMap v. 2010.01

FASTMap is mapping application available for the web or on mobile devices (IOS and Android) that browses geospatial data and produces detailed reports of objects within any area of analysis. FASTMap can access any geospatial dataset. The software can provide immediate access to the selected data through a fully symbolized interactive mapping interface. FASTMap can load arbitrary contours that represent a region of interest and can dynamically identify and geospatially select objects that reside within the region. The software can produce a report listing the objects and aggregations for the region, as well as producing publication quality maps. FASTMap also has the ability to post and maintain authored maps, any GIS data included in the map, areas of interest, as well as any titles, and labels. These defining ingredients of a map are called map contexts. These mao contexts can be instantly broadcast via the internet through any of an infinite number of named channels to small or large numbers of users monitouring any of the channels being posted to, so a user can author a map and immediately share that map with others instantly, whether they are on traditional desktop computer, laptop, mobile tablet or smartphone. Further, users receiving broadcast maps can also alter the maps can also alter the maps, or create new ones and publish back to the channel in a collaborative manner. FASTMap can be configured to access virtually any geospatial data.

Bynum, Leo↗

Symbolic pregression: Discovering physical laws from distorted video

In this work, we present a method for unsupervised learning of equations of motion for objects in raw and optionally distorted unlabeled synthetic video (or, more generally, for discovering and modeling predictable features in time-series data). We first train an autoencoder that maps each video frame into a low-dimensional latent space where the laws of motion are as simple as possible, by minimizing a combination of nonlinearity, acceleration, and prediction error. Differential equations describing the motion are then discovered using Pareto-optimal symbolic regression. We find that our pre-regression (“pregression”) step is able to rediscover Cartesian coordinates of unlabeled moving objects even when the video is distorted by a generalized lens. Using intuition from multidimensional knot theory, we find that the pregression step is facilitated by first adding extra latent space dimensions to avoid topological problems during training and then removing these extra dimensions via principal component analysis. An inertial frame is autodiscovered by minimizing the combined equation complexity for multiple experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Native glycosylated HIV-1 Env in silico ensemble

The computationally modeled datasets generated in this study, namely the natively glycosylated SOSIP Env and the uniform mannose-9 glycosylated SOSIP Env ensembles will be submitted as Mendeley dataset server as required by the journal publishers, for public availability. These include two sets of Protein Data Bank (PDB)ensembles of 1000 structures each. The files are in the standardized PDB format. Each of the constituent ensemble structures are separated by the ‘END’ tag within the files. Snapshots from the beginning and end of each data set are given here. The column descriptions are as follows: Col1 –ATOM tag; Col 2 –atom number; COL 3 –atom name; COL4 –residue name; COL 5 –chain identifier; COL 6 –residue number; COL. 7,8,9 –X,Y,Z coordinates of atom in 3Dspace; COL 10 –Occupancy Factor; COL 11 -Temperature factor; COL 12 –segment identifier; COL 13 –element symbol.

59 BASIC BIOLOGICAL SCIENCES↗

Security Analysis of a Class of Spread Spectrum Systems Presentation

A method of adding physical layer security to a class of spread spectrum systems has been recently proposed. In this paper, we look into the rate at which an eavesdropper may gain information about the system to decipher the data symbols. The Shannon mutual information is used to measure the rate of information that may be gained by an eavesdropper. The k-nearest neighbors (k-NN) method is used to obtain estimates of relevant entropy values, which will then be used to quantify the rate of information recovery as more data is transmitted. It turns out that such information recovery requires the adoption of special methods that avoid any destructive bias in the estimates. Details of these methods are also presented.

97 - MATHEMATICS AND COMPUTING↗

Catalyst: Fast and flexible modeling of reaction networks

We introduce Catalyst.jl, a flexible and feature-filled Julia library for modeling and high-performance simulation of chemical reaction networks (CRNs). Catalyst supports simulating stochastic chemical kinetics (jump process), chemical Langevin equation (stochastic differential equation), and reaction rate equation (ordinary differential equation) representations for CRNs. Through comprehensive benchmarks, we demonstrate that Catalyst simulation runtimes are often one to two orders of magnitude faster than other popular tools. More broadly, Catalyst acts as both a domain-specific language and an intermediate representation for symbolically encoding CRN models as Julia-native objects. This enables a pipeline of symbolically specifying, analyzing, and modifying CRNs; converting Catalyst models to symbolic representations of concrete mathematical models; and generating compiled code for numerical solvers. Leveraging ModelingToolkit.jl and Symbolics.jl, Catalyst models can be analyzed, simplified, and compiled into optimized representations for use in numerical solvers. Finally, we demonstrate Catalyst’s broad extensibility and composability by highlighting how it can compose with a variety of Julia libraries, and how existing open-source biological modeling projects have extended its intermediate representation.

59 BASIC BIOLOGICAL SCIENCES↗

Security Analysis of a Class of Secured Spread Spectrum Systems

Abstract—A method of adding physical layer security to a class of spread spectrum systems has been recently proposed. In this paper, we look into the rate at which an eavesdropper may gain information about the system to decipher the data symbols. The Shannon mutual information is used to measure the rate of information that may be gained by an eavesdropper. The k-nearest neighbors (k-NN) method is used to obtain the estimates of relevant entropy values which will be then used to quantify the rate of information recovery as more data are being transmitted. It turns out that such information recovery requires adoption of special methods that avoid any destructive bias in the estimates. Details of these methods are also presented.

97 - MATHEMATICS AND COMPUTING↗

Two-parameter asymptotics in magnetic Weyl calculus

This paper is concerned with small parameter asymptotics of magnetic quantum systems. In addition to a semiclassical parameter {epsilon}, the case of small coupling {lambda} to the magnetic vector potential naturally occurs in this context. Magnetic Weyl calculus is adapted to incorporate both parameters, at least one of which needs to be small. Of particular interest is the expansion of the Weyl product which can be used to expand the product of operators in a small parameter, a technique which is prominent to obtain perturbation expansions. Three asymptotic expansions for the magnetic Weyl product of two Hoermander class symbols are proven as (i) {epsilon}<< 1 and {lambda}<< 1, (ii) {epsilon}<< 1 and {lambda}= 1, as well as (iii) {epsilon}= 1 and {lambda}<< 1. Expansions (i) and (iii) are impossible to obtain with ordinary Weyl calculus. Furthermore, I relate the results derived by ordinary Weyl calculus with those obtained with magnetic Weyl calculus by one- and two-parameter expansions. To show the power and versatility of magnetic Weyl calculus, I derive the semirelativistic Pauli equation as a scaling limit from the Dirac equation up to errors of fourth order in 1/c.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Numerical similarity solution for a variable coefficient K(m, n) equation

A technique for finding numerical similarity solutions to an initial boundary value problem (IBVP) for generalized K(m, n) equations is described. The equation under consideration is nonlinear and has variable coefficients. The original problem is transformed with the aid of Lie symmetries to an initial value problem (IVP) for a nonlinear third-order ordinary differential equation. The existence and uniqueness of the solution are examined, and the problem is consequently solved with the aid of a finite-difference scheme for various values of the governing parameters. In lieu of an exact symbolic solution, the scheme is validated by comparing the numerical solutions with the approximate analytic solutions obtained with the aid of the method of successive approximations in their region of validity. The accuracy, efficiency, and consistency of the scheme are demonstrated. Numerical solutions to the original initial boundary value problem are constructed for selected parameter values with the aid of the transforms. The qualitative behavior of the solutions as a function of the governing parameters is analyzed, and it is found that the examined IBVPs for generalized K(m, n) equations with variable coefficients that are functions of time, do not admit solitary wave or compacton solutions.

97 MATHEMATICS AND COMPUTING↗

Structure-preserving numerical discretizations for domains with boundaries

This SAND report documents Exploratory Express LDRD Project 223790, "Structure-preserving numerical discretizations for domains with boundaries", which developed a method to incorporate consistent treatment of domain boundaries and arbitrary boundary conditions in discrete exterior calculus (DEC) for arbitrary polygonal (2D) and tensor-product structure prism (3D) grids. The new DEC required the development of novel discrete exterior derivatives, boundary operators, wedge products and Hodge stars. This was accomplished through the use of boundary extension and the blending of known 2D operators on the interior with 1D operators on the boundary. The Hodge star was based on the Voronoi Hodge star, and retained the limitation of a triangular circumcentric primal or dual grid along with low-order accuracy. In addition to the new DEC, two related software packages were written: one for the study of DEC operators on arbitrary polygonal and polyhedral grids using both symbolic and numerical approaches and one for a (thermal) shallow water testbed using TRiSK-type numerics. Immediately relevant (already funded, through CANGA) followup work is the development of a high-order, geometrically flexible Hodge star and structure-preserving, high-order, oscillation-limiting transport operators (using WENO) for n-forms on arbitrary 2D and 3D grids. This will provide all of the machinery required for a high-order version of TRiSK with boundaries on arbitrary 2D and tensor-product 3D grids, which is applicable to both the atmospheric (CRM in E3SM-MMF) and oceanic (MPAS-O) components of E3SM.

97 MATHEMATICS AND COMPUTING↗

High-pressure structural behavior and equation of state of NaZnF{sub 3}

We report the results of density functional theory ab-initio calculations and monochromatic synchrotron X-ray diffraction study carried out for orthorhombic NaZnF{sub 3} in the pressure range 0-40 GPa. Perovskite-to-postperovskite phase transition was anticipated by first-principles computations and then observed in high-pressure diamond anvil cell synchrotron diffraction experiment between 14 and 22 GPa. Above 25 GPa postperovskite structure (CaIrO{sub 3} type, space group Cmcm) coexists with another phase, yet unidentified. On decompression, pure postperovskite-type structure was found to be stable down to 4 GPa; below this pressure sample contained both perovskite and postperovskite modifications. Fit of experimental P-V data to the third-order Birch-Murnaghan equation of state gave bulk moduli, K{sub P,0} 64.98+-2.67 and 69.88+-3.69 GPa for perovskite and postperovskite modifications, respectively. Both phases demonstrated strong anisotropy of compressibility. For postperovskite NaZnF{sub 3}, the highest compression was observed along the direction perpendicular to the planes of ZnF{sub 6} octahedra arrangement. - Graphical Abstract: Fit of P-V data obtained from high-pressure X-ray diffraction study of perovskite and postperovskite NaZnF{sub 3} to the third-order Birch-Murnaghan equation of state (solid line). Open and closed symbols represent experimental data corresponding to compression and decompression, respectively. Bulk moduli, K{sub 0,P}, of perovskite and postperovskite phases are 64.98+-2.67 and 69.88+-3.69 GPa.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Tuning Multigrid Methods with Robust Optimization and Local Fourier Analysis

Local Fourier analysis is a useful tool for predicting and analyzing the performance of many efficient algorithms for the solution of discretized PDEs, such as multigrid and domain decomposition methods. The crucial aspect of local Fourier analysis is that it can be used to minimize an estimate of the spectral radius of a stationary iteration, or the condition number of a preconditioned system, in terms of a symbol representation of the algorithm. In practice, this is a “minimax” problem, minimizing with respect to solver parameters the appropriate measure of work, which involves maximizing over the Fourier frequency. Often, several algorithmic parameters may be determined by local Fourier analysis in order to obtain efficient algorithms. Analytical solutions to minimax problems are rarely possible beyond simple problems; the status quo in local Fourier analysis involves grid sampling, which is prohibitively expensive in high dimensions. In this paper, we propose and explore optimization algorithms to solve these problems efficiently. Finally, several examples, with known and unknown analytical solutions, are presented to show the effectiveness of these approaches.

97 MATHEMATICS AND COMPUTING↗

Revisiting Huffman Coding: Toward Extreme Performance on Modern GPU Architectures

Today's high-performance computing (HPC) applications are producing vast volumes of data, which are challenging to store and transfer efficiently during the execution, such that data compression is becoming a critical technique to mitigate the storage burden and data movement cost. Huffman coding is arguably the most efficient Entropy coding algorithm in information theory, such that it could be found as a fundamental step in many modern compression algorithms such as DEFLATE. On the other hand, today's HPC applications are more and more relying on the accelerators such as GPU on supercomputers, while Huffman encoding suffers from low throughput on GPUs, resulting in a significant bottleneck in the entire data processing. In this paper, we propose and implement an efficient Huffman encoding approach based on modern GPU architectures, which addresses two key challenges: (1) how to parallelize the entire Huffman encoding algorithm, including codebook construction, and (2) how to fully utilize the high memory-bandwidth feature of modern GPU architectures. The detailed contribution is fourfold. (1) We develop an efficient parallel codebook construction on GPUs that scales effectively with the number of input symbols. (2) We propose a novel reduction based encoding scheme that can efficiently merge the codewords on GPUs. (3) We optimize the overall GPU performance by leveraging the state-of-the-art CUDA APIs such as Cooperative Groups. (4) We evaluate our Huffman encoder thoroughly using six real-world application datasets on two advanced GPUs and compare with our implemented multi-threaded Huffman encoder. Experiments show that our solution can improve the encoding throughput by up to 5.0x and 6.8x on NVIDIA RTX 5000 and V100, respectively, over the state-of-the-art GPU Huffman encoder, and by up to 3.3x over the multi-thread encoder on two 28-core Xeon Platinum 8280 CPUs.

Tian, Jiannan↗

Revisiting Huffman Coding: Toward Extreme Performance on Modern GPU Architectures

Today's high-performance computing (HPC) applications are producing vast volumes of data, which are challenging to store and transfer efficiently during the execution, such that data compression is becoming a critical technique to mitigate the storage burden and data movement cost. Huffman coding is arguably the most efficient Entropy coding algorithm in information theory, such that it could be found as a fundamental step in many modern compression algorithms such as DEFLATE. On the other hand, today's HPC applications are more and more relying on the accelerators such as GPU on supercomputers, while Huffman encoding suffers from low throughput on GPUs, resulting in a significant bottleneck in the entire data processing. In this paper, we propose and implement an efficient Huffman encoding approach based on modern GPU architectures, which addresses two key challenges: (1) how to parallelize the entire Huffman encoding algorithm, including codebook construction, and (2) how to fully utilize the high memory-bandwidth feature of modern GPU architectures. The detailed contribution is fourfold. (1) We develop an efficient parallel codebook construction on GPUs that scales effectively with the number of input symbols. (2) We propose a novel reduction based encoding scheme that can efficiently merge the codewords on GPUs. (3) We optimize the overall GPU performance by leveraging the state-of-the-art CUDA APIs such as Cooperative Groups. (4) We evaluate our Huffman encoder thoroughly using six real-world application datasets on two advanced GPUs and compare with our implemented multithreaded Huffman encoder. Experiments show that our solution can improve the encoding throughput by up to 5.0× and 6.8× on NVIDIA RTX 5000 and V100, respectively, over the state-of-the-art GPU Huffman encoder, and by up to 3.3× over the multithread encoder on two 28-core Xeon Platinum 8280 CPUs.

Tian, Jiannan↗