Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Symbolics”

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 91 records · Page 5

SRBench++: Principled Benchmarking of Symbolic Regression With Domain-Expert Interpretation

Symbolic regression searches for analytic expressions that accurately describe studied phenomena. The main promise of this approach is that it may return an interpretable model that can be insightful to users, while maintaining high accuracy. The current standard for benchmarking these algorithms is SRBench, which evaluates methods on hundreds of datasets that are a mix of real-world and simulated processes spanning multiple domains. At present, the ability of SRBench to evaluate interpretability is limited to measuring the size of expressions on real-world data, and the exactness of model forms on synthetic data. In practice, model size is only one of many factors used by subject experts to determine how interpretable a model truly is. Furthermore, SRBench does not characterize algorithm performance on specific, challenging sub-tasks of regression such as feature selection and evasion of local minima. In this work, we propose and evaluate an approach to benchmarking SR algorithms that addresses these limitations of SRBench by 1) incorporating expert evaluations of interpretability on a domain-specific task, and 2) evaluating algorithms over distinct properties of data science tasks. We evaluate 12 modern symbolic regression algorithms on these benchmarks and present an in-depth analysis of the results, discuss current challenges of symbolic regression algorithms and highlight possible improvements for the benchmark itself.

97 MATHEMATICS AND COMPUTING↗

Deep Learning Methods for Symbolic Calculations in HEP

This project develops machine learning methods to accelerate symbolic calculations in high-energy physics. Using sequence-to-sequence transformer models, we construct frameworks to predict squared amplitudes and related quantities for Standard Model processes, including quantum electrodynamics, quantum chromodynamics, and electroweak interactions. The results demonstrate that deep learning can successfully learn complex symbolic relationships and provide a scalable approach to symbolic computation with potential applications in precision calculations and collider phenomenology.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Symbol alphabets in QCD and flag cluster algebras

The full 245-letter symbol alphabet for all planar massless two-loop six-point Feynman integrals was recently determined in arXiv:2412.19884 and arXiv:2501.01847. In a parallel mathematical development, it was shown in arXiv:2408.14956 that there is an embedding of the cluster algebra associated to the partial flag variety $\mathcal{Fl}$ $2,n-2;n$ , which describes the kinematics of n massless particles, into that of the Grassmannian Gr(n–2, 2n–4). In this paper we connect these developments by showing that most of the rational symbol letters can be expressed in terms of flag cluster variables, and that all of the algebraic symbol letters arise from infinite mutation sequences.

97 MATHEMATICS AND COMPUTING↗

The inversion formula and 6j symbol for 3d fermions

In this work we study the 6 j symbol of the 3 d conformal group for fermionic operators. In particular, we study 4-point functions containing two fermions and two scalars and also those with four fermions. By using weight-shifting operators and harmonic analysis for the Euclidean conformal group, we relate these spinning 6 j symbols to the simpler 6 j symbol for four scalar operators. As one application we use these techniques to compute 3 d mean field theory (MFT) OPE coefficients for fermionic operators. We then compute corrections to the MFT spectrum and couplings due to the inversion of a single operator, such as the stress tensor or a low-dimension scalar. These results are valid at finite spin and extend the perturbative large spin analysis to include non-perturbative effects in spin.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Symbol alphabets from plabic graphs

Symbol alphabets of n-particle amplitudes in N = 4 super-Yang-Mills theory are known to contain certain cluster variables of Gr(4, n) as well as certain algebraic functions of cluster variables. In this paper we suggest an algorithm for computing these symbol alphabets from plabic graphs by solving matrix equations of the form C ∙ Z = 0 to associate functions on Gr(m, n) to parameterizations of certain cells of Gr(k, n) indexed by plabic graphs. For m = 4 and n = 8 we show that this association precisely reproduces the 18 algebraic symbol letters of the two-loop NMHV eight-particle amplitude from four plabic graphs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Symbol alphabets from tensor diagrams

We propose to use tensor diagrams and the Fomin-Pylyavskyy conjectures to explore the connection between symbol alphabets of n-particle amplitudes in planar $\mathcal{N}$ = 4 Yang-Mills theory and certain polytopes associated to the Grassmannian Gr(4, n). We show how to assign a web (a planar tensor diagram) to each facet of these polytopes. Webs with no inner loops are associated to cluster variables (rational symbol letters). For webs with a single inner loop we propose and explicitly evaluate an associated web series that contains information about algebraic symbol letters. In this manner we reproduce the results of previous analyses of n ≤ 8, and find that the polytope $\mathcal{C}^†$(4,9) encodes all rational letters, and all square roots of the algebraic letters, of known nine-particle amplitudes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stoichiometrically-informed symbolic regression for extracting chemical reaction mechanisms from data

A data-driven computational method is introduced to extract chemical reaction mechanisms from time series chemical concentration data. It is realized through the use of dynamic symbolic regression in which a sparse analytical form for a dynamical system is discoverable from the underlying data. We specifically develop the stoichiometrically-informed symbolic regression (SISR) method to address a standing challenge in complex chemical reaction networks: given a time-series dataset of concentrations of several components, what is the mechanism and the associated rate constants? SISR finds the optimal mechanism, kinetic equations and rate constants by combining differential optimization with a genetic optimization approach that searches a symbolic space of possible reaction mechanisms. Use of SISR in several paradigmatic examples spanning linear and nonlinear reaction schemes results in excellent agreement between true and predicted mechanisms, including when the method is applied to noisy data. The advantages of a stoichiometrically-informed approach such as SISR to address reaction discovery is illustrated through comparison with the use of generic state-of-the-art data-driven approaches.

36 MATERIALS SCIENCE↗

Causation entropy from symbolic representations of dynamical systems

Identification of causal structures and quantification of direct information flows in complex systems is a challenging yet important task, with practical applications in many fields. Data generated by dynamical processes or large-scale systems are often symbolized, either because of the finite resolution of the measurement apparatus, or because of the need of statistical estimation. By algorithmic application of causation entropy, we investigated the effects of symbolization on important concepts such as Markov order and causal structure of the tent map. We uncovered that these quantities depend nonmonotonically and, most of all, sensitively on the choice of symbolization. Indeed, we show that Markov order and causal structure do not necessarily converge to their original analog counterparts as the resolution of the partitioning becomes finer.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Generalized parton distributions from symbolic regression

AI/ML informed Symbolic Regression is the next stage of scientific modeling. We utilize a highly customizable symbolic regression package “PySR” to model the x and t dependence of the flavor isovector combination Hu-d(x, t, ) at = 0. These PySR models were trained on GPD results provided by both Lattice QCD and phenomenological sources GGL, GK, and VGG. We demonstrate, for the first time, the consistency and systematic convergence of Symbolic Regression by quantifying the disparate models through their Taylor expansion coefficients. In addition to PySR penalizing models with higher complexity and mean-squared error, we implement schemes that test specific physics hypotheses, including force-factorized x and t dependence and Regge behavior in PySR GPDs. We show that PySR can identify factorizing GPD sources based on their response to the Force-Factorized model. Here, knowing the precise behavior of the GPDs, and their uncertainties in a wide range in x and t, crucially impacts our ability to concretely and quantitatively predict hadronic spatial distributions and their derived quantities.

Dotson, Andrew [New Mexico State University, Las C↗

Towards Geospatial Knowledge Graph Infused Neuro-Symbolic AI for Remote Sensing Scene Understanding

Deep learning has proven its effectiveness in numerous tasks for remote sensing scene understanding. However there is an increasing interest to explore fusion of domain-specific background information to the deep neural network to further improve its performance. Remote sensing researchers are also working towards developing models that generalize and adapt to multiple applications. Generalization challenges coupled with the scarcity of large corpora of high-quality noise-free labelled data, have together fueled an interest for leveraging background information. Knowledge graphs serve as excellent choice to represent domain-specific information in a structured, standardized and extensible manner. Integrating symbolic knowledge representations in the form of Knowledge Graph Embedding (KGE) to perform neuro-symbolic reasoning is an emerging research direction promising significant impacts. This vision paper seeks to position ideas and provoke early thoughts toward advancing neuro-symbolic artificial intelligence in the context of geospatial challenges. Specifically, it conceptualizes and elaborates on an architecture for infusing geospatial knowledge from knowledge graph in a deep neural network pipeline. As guiding case studies - land-use land-cover classification, object detection and instance segmentation can benefit from infusing spatio-contextual information with remote sensing imagery. The discussion further reflects on and articulates the challenges and explainable AI opportunities anticipated when scaling and maintaining large-scale geospatial knowledge graphs.

Potnis, Abhishek↗

The 100 MSPS symbol synchronizer

The functional characteristics and design of the 100 Mega Symbol per Second (MSPS) symbol synchronizer are described, and test data obtained from the brassboard are presented. It was shown that symbol rates to 100 MSPS can be properly synchronized and detected at signal to noise ratios down to -2 db with detection degradation less than 1.5 db.

Source record↗

Computerized symbolic manipulation in structural mechanics Progress and potential

Status and recent applications of computerized symbolic manipulation to structural mechanics problems are summarized. The applications discussed include; (1) generation of characteristic arrays of finite elements; (2) evaluation of effective stiffness and mass coefficients of continuum models for repetitive lattice structures; and (3) application of Rayleigh-Ritz technique to free vibration analysis of laminated composite elliptic plates. The major advantages of using computerized symbolic manipulation in each of these applications are outlined. A number of problem areas which limit the realization of the full potential of computerized symbolic manipulation in structural mechanics are examined and some of the means of alleviating them are discussed.

Noor, A. K.↗

Symbolic-numeric interface: A review

A survey of the use of a combination of symbolic and numerical calculations is presented. Symbolic calculations primarily refer to the computer processing of procedures from classical algebra, analysis, and calculus. Numerical calculations refer to both numerical mathematics research and scientific computation. This survey is intended to point out a large number of problem areas where a cooperation of symbolic and numerical methods is likely to bear many fruits. These areas include such classical operations as differentiation and integration, such diverse activities as function approximations and qualitative analysis, and such contemporary topics as finite element calculations and computation complexity. It is contended that other less obvious topics such as the fast Fourier transform, linear algebra, nonlinear analysis and error analysis would also benefit from a synergistic approach.

Ng, E. W.↗

Computerized symbolic manipulation in nonlinear finite element analysis

The potential of using computerized symbolic manipulation in the development of nonlinear finite elements is discussed. Three tasks which can be efficiently performed using computerized symbolic manipulation are identified: (1) generation of algebraic expressions for the stiffness coefficients of nonlinear finite elements, (2) generation of FORTRAN source code for numerical evaluation of stiffness coefficients, and (3) checking the correctness of the FORTRAN statements for the arrays of coefficients. The symbolic and algebraic manipulation system MACSYMA is used in the present study. Two sample MACSYMA programs are presented for the development of the nonlinear stiffness coefficients of two-dimensional, shear-flexible, doubly-curved deep shell elements. The first program is for displacement models and the second program is for mixed models with discontinuous stress-resultant fields at interelement boundaries.

Noor, A. K.↗

Determination of eigenvalues of dynamical systems by symbolic computation

A symbolic computation technique for determining the eigenvalues of dynamical systems is described wherein algebraic operations, symbolic differentiation, matrix formulation and inversion, etc., can be performed on a digital computer equipped with a formula-manipulation compiler. An example is included that demonstrates the facility with which the system dynamics matrix and the control distribution matrix from the state space formulation of the equations of motion can be processed to obtain eigenvalue loci as a function of a system parameter. The example chosen to demonstrate the technique is a fourth-order system representing the longitudinal response of a DC 8 aircraft to elevator inputs. This simplified system has two dominant modes, one of which is lightly damped and the other well damped. The loci may be used to determine the value of the controlling parameter that satisfied design requirements. The results were obtained using the MACSYMA symbolic manipulation system.

Howard, J. C.↗

Symbol Stream Combining Versus Baseband Combining for Telemetry Arraying

The objectives of this article are to investigate and analyze the problem of combining symbol streams from many Deep Space Network stations to enhance bit signal-to-noise ratio and to compare the performance of this combining technique with baseband combining. Symbol stream combining (SSC) has some advantages and some disadvantages over baseband combining (BBC). The SSC suffers almost no loss in combining the digital data and no loss due to the transmission of the digital data by microwave links between the stations. The BBC suffers 0.2 dB loss due to alignment and combining the IF signals and 0.2 dB loss due to transmission of signals by microwave links. On the other hand, the losses in the subcarrier demodulation assembly (SDA) and in the symbol synchronization assembly (SSA) for SSC are more than the losses in the SDA and SSA for BBC. It is shown that SSC outperforms BBC by about 0.35 dB (in terms of the required bit energy-to-noise spectral density for a bit error rate of 1,000) for an array of three DSN antennas, namely 64 m, 34m(T/R) and 34m(R).

Divsalar, D.↗