Deep Symbolic Regression
Explore the source record for details and available documents.
Computer science↗
SEARCH · Search NASA
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.
Directed Incremental Symbolic Execution
The last few years have seen a resurgence of interest in the use of symbolic execution -- a program analysis technique developed more than three decades ago to analyze program execution paths. Scaling symbolic execution and other path-sensitive analysis techniques to large systems remains challenging despite recent algorithmic and technological advances. An alternative to solving the problem of scalability is to reduce the scope of the analysis. One approach that is widely studied in the context of regression analysis is to analyze the differences between two related program versions. While such an approach is intuitive in theory, finding efficient and precise ways to identify program differences, and characterize their effects on how the program executes has proved challenging in practice. In this paper, we present Directed Incremental Symbolic Execution (DiSE), a novel technique for detecting and characterizing the effects of program changes. The novelty of DiSE is to combine the efficiencies of static analysis techniques to compute program difference information with the precision of symbolic execution to explore program execution paths and generate path conditions affected by the differences. DiSE is a complementary technique to other reduction or bounding techniques developed to improve symbolic execution. Furthermore, DiSE does not require analysis results to be carried forward as the software evolves -- only the source code for two related program versions is required. A case-study of our implementation of DiSE illustrates its effectiveness at detecting and characterizing the effects of program changes.
Person, Suzette↗
Feedback-Driven Dynamic Invariant Discovery
Program invariants can help software developers identify program properties that must be preserved as the software evolves, however, formulating correct invariants can be challenging. In this work, we introduce iDiscovery, a technique which leverages symbolic execution to improve the quality of dynamically discovered invariants computed by Daikon. Candidate invariants generated by Daikon are synthesized into assertions and instrumented onto the program. The instrumented code is executed symbolically to generate new test cases that are fed back to Daikon to help further re ne the set of candidate invariants. This feedback loop is executed until a x-point is reached. To mitigate the cost of symbolic execution, we present optimizations to prune the symbolic state space and to reduce the complexity of the generated path conditions. We also leverage recent advances in constraint solution reuse techniques to avoid computing results for the same constraints across iterations. Experimental results show that iDiscovery converges to a set of higher quality invariants compared to the initial set of candidate invariants in a small number of iterations.
Daikon↗
Perturbation analysis of the limit cycle of the free van der Pol equation
A power series expansion in the damping parameter, epsilon, of the limit cycle of the free van der Pol equation is constructed and analyzed. Coefficients in the expansion are computed in exact rational arithmetic using the symbolic manipulation system MACSYMA and using a FORTRAN program. The series is analyzed using Padeapproximants. The convergence of the series for the maximum amplitude of the limit cycle is limited by two pair of complex conjugate singularities in the complex epsilon-plane. A new expansion parameter is introduced which maps these singularities to infinity and leads to a new expansion for the amplitude which converges for all real values of epsilon. Amplitudes computed from this transformed series agree very well with reported numerical and asymptotic results. For the limit cycle itself, convergence of the series expansion is limited by three pair of complex conjugate branch point singularities. Two pair remain fixed throughout the cycle, and correspond to the singularities found in the maximum amplitude series, while the third pair moves in the epsilon-plane as a function of t from one of the fixed pairs to the other. The limit cycle series is transformed using a new expansion parameter, which leads to a new series that converges for larger values of epsilon.
Dadfar, M. B.↗
Perturbation analysis of the limit cycle of the free van der Pol equation
A power series expansion in the damping parameter, epsilon, of the limit cycle of the free van der Pol equation is constructed and analyzed. Coefficients in the expansion are computed in exact rational arithmetic using the symbolic manipulation system MACSYMA and using a FORTRAN program. The series is analyzed using Pade approximants. The convergence of the series for the maximum amplitude of the limit cycle is limited by two pair of complex conjugate singularities in the complex epsilon-plane. A new expansion parameter is introduced which maps these singularities to infinity and leads to a new expansion for the amplitude which converges for all real values of epsilon. Amplitudes computed from this transformed series agree very well with reported numerical and asymptotic results. For the limit cycle itself, convergence of the series expansion is limited by three pair of complex conjugate branch point singularities. Two pair remain fixed throughout the cycle, and correspond to the singularities found in the maximum amplitude series, while the third pair moves in the epsilon-plane as a function of t from one of the fixed pairs to the other. The limit cycle series is transformed using a new expansion parameter, which leads to a new series that converges for larger values of epsilon.
Dadfar, M. B.↗
Symbolic manipulation techniques for vibration analysis of laminated elliptic plates
A computational scheme is presented for the free vibration analysis of laminated composite elliptic plates. The scheme is based on Hamilton's principle, the Rayleigh-Ritz technique and symmetry considerations and is implemented with the aid of the MACSYMA symbolic manipulation system. The MACYSMA system, through differentiation, integration, and simplification of analytic expressions, produces highly-efficient FORTRAN code for the evaluation of the stiffness and mass coefficients. Multiple use is made of this code to obtain not only the frequencies and mode shapes of the plate, but also the derivatives of the frequencies with respect to various material and geometric parameters.
Andersen, C. M.↗
Stress intensity factor models using mechanics-guided decomposition and symbolic regression
The finite element method can be used to compute accurate stress intensity factors (SIFs) for cracks with complex geometries and boundary conditions. In contrast, handbook solutions act as surrogate SIF models that provide significantly faster evaluation times. However, the development of conventional surrogate SIF models relies on manual development based on low-order parameterizations. This limits surrogate model accuracy and generalizability. Here, in this paper, we develop a framework for the automated development of mechanics-guided handbook SIF solutions by using interpretable machine learning via genetic programming for symbolic regression (GPSR). Formalizing the mechanics-based approach of Raju and Newman, SIF training data is decomposed into multiple subsets. This decomposition enables parallel GPSR model development of subfunctions, each of which accounts for specific geometrical corrections with respect to a known analytical model. Using this mechanics-based approach with GPSR allows for equations to be learned with improved accuracy and reduced complexity relative to the Raju Newman equations while maintaining the inherent interpretability of mathematical expressions. In this paper, we present equations that match the complexity of the Raju Newman equations while having reduced error, as well as equations with similar errors and reduced complexity.
42 ENGINEERING↗
Methodology requirements for intelligent systems architecture
The methodology required for the development of the 'intelligent system architecture' of distributed computer systems which integrate standard data processing capabilities with symbolic processing to provide powerful and highly autonomous adaptive processing capabilities must encompass three elements: (1) a design knowledge capture system, (2) computer-aided engineering, and (3) verification and validation metrics and tests. Emphasis must be put on the earliest possible definition of system requirements and the realistic definition of allowable system uncertainties. Methodologies must also address human factor issues.
Grant, Terry↗
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↗
STAR - A computer language for hybrid AI applications
Constructing Artificial Intelligence application systems which rely on both symbolic and non-symbolic processing places heavy demands on the communication of data between dissimilar languages. This paper describes STAR (Simple Tool for Automated Reasoning), a computer language for the development of AI application systems which supports the transfer of data structures between a symbolic level and a non-symbolic level defined in languages such as FORTRAN, C and PASCAL. The organization of STAR is presented, followed by the description of an application involving STAR in the interpretation of airborne imaging spectrometer data.
Borchardt, G. C.↗
Multibody for Everybody (M4E): A Symbolic Dynamics Modeling Tool with Applications in Simulation, Control, and Optimization
Developing the analytical model of a multibody system is often the initial step in control and optimization. The analytical model (equations of motion) describes a system’s time evolution under specified forcing conditions. Although developing these equations is easy for simple systems, this process becomes more complex for systems composed of multiple bodies. Deriving equations of motion for complex multibody systems requires specialized expertise in multibody dynamics, is time-consuming, and is susceptible to error. To address this issue, this paper presents an open-source, easy-to-use, systematic framework to derive symbolic equations of motion in both Python and MATLAB using the joint coordinate formulation. This formulation results in a set of ordinary differential equations that use the minimum set of coordinates needed to model a system. The symbolic representation provides better insight into the influence of design parameters on system performance, facilitates sensitivity analysis and parameter studies, and supports direct implementation of control and optimization routines. The tool enables numerical simulation for specified parameter sets, is modular for straightforward integration with other tools and libraries, and allows incorporation of hydrodynamics, mooring, and other external forces. The result is a reproducible, extensible pipeline for modeling, simulation, and design of complex multibody systems. The proposed tool is versatile and can be applied to domains such as robotics, control, and design. In addition, we integrated external libraries that provide capabilities for modeling offshore systems such as underwater robots and marine energy converters.
16 TIDAL AND WAVE POWER↗
Observations on approximate integrations
A class of integration strategies is explored that fall in between the two extremes of symbolic integration and numerical quadrature, which are, respectively, aimed at the computer generation of answers in the form of exact expressions and numerical values. The theoretical advances in symbolic integration are discussed. Three major contexts of applications with attendant case studies, four possible types of strategies for approximate integration are examined. The feasibility and adequacy (or inadequancy) of MACSYMA for implementing these strategies are considered.
Ng, E. W.↗
Symbolic generation of elastic rotor blade equations using a FORTRAN processor and numerical study on dynamic inflow effects on the stability of helicopter rotors
The process of performing an automated stability analysis for an elastic-bladed helicopter rotor is discussed. A symbolic manipulation program, written in FORTRAN, is used to aid in the derivation of the governing equations of motion for the rotor. The blades undergo coupled bending and torsional deformations. Two-dimensional quasi-steady aerodynamics below stall are used. Although reversed flow effects are neglected, unsteady effects, modeled as dynamic inflow are included. Using a Lagrangian approach, the governing equations are derived in generalized coordinates using the symbolic program. The program generates the steady and perturbed equations and writes into subroutines to be called by numerical routines. The symbolic program can operate on both expressions and matrices. For the case of hovering flight, the blade and dynamic inflow equations are converted to equations in a multiblade coordinate system by rearranging the coefficients of the equations. For the case of forward flight, the multiblade equations are obtained through the symbolic program. The final multiblade equations are capable of accommodating any number of elastic blade modes. The computer implementation of this procedure consists of three stages: (1) the symbolic derivation of equations; (2) the coding of the equations into subroutines; and (3) the numerical study after identifying mass, damping, and stiffness coefficients. Damping results are presented in hover and in forward flight with and without dynamic inflow effects for various rotor blade models, including rigid blade lag-flap, elastic flap-lag, flap-lag-torsion, and quasi-static torsion. Results from dynamic inflow effects which are obtained from a lift deficiency function for a quasi-static inflow model in hover are also presented.
Reddy, T. S. R.↗
System and method for identifying and comparing code by semantic abstractions
Certain embodiments of the present invention are configured to facilitate analyzing computer code more efficiently. For example, by conducting a first level abstraction (e.g., symbolic interpretation and algebraic simplification) and a second level abstraction (e.g., generalization) of the computer code, the analysis may more accurately account for variations in the code that may occur as a result of register renaming, instruction reordering, choice of instructions, etc. while minimizing the cost of computations required to perform the analysis.
Lakhotia, Arun↗
The formulation of simulation models of aeronautical systems
Recent developments in formula-manipulation compilers have led to a significant reduction in the time spent in formulating models of complex multi-degrees-of-freedom dynamical systems. MACSYMA, a computer system that can be used to perform symbolic manipulations in an interactive mode, is applied to the problem of formulating models of aeronautical systems for simulation studies. An example demonstrates that once the procedure is established, the formulation and modification of the models can be reduced to a series of routine computer operations.
Howard, J. C.↗
Equation Discovery Using Fast Function Extraction: a Deterministic Symbolic Regression Approach
Advances in machine learning (ML) coupled with increased computational power have enabled identification of patterns in data extracted from complex systems. ML algorithms are actively being sought in recovering physical models or mathematical equations from data. This is a highly valuable technique where models cannot be built using physical reasoning alone. In this paper, we investigate the application of fast function extraction (FFX), a fast, scalable, deterministic symbolic regression algorithm to recover partial differential equations (PDEs). FFX identifies active bases among a huge set of candidate basis functions and their corresponding coefficients from recorded snapshot data. This approach uses a sparsity-promoting technique from compressive sensing and sparse optimization called pathwise regularized learning to perform feature selection and parameter estimation. Furthermore, it recovers several models of varying complexity (number of basis terms). FFX finally filters out many identified models using non-dominated sorting and forms a Pareto front consisting of optimal models with respect to minimizing complexity and test accuracy. Numerical experiments are carried out to recover several ubiquitous PDEs such as wave and heat equations among linear PDEs and Burgers, Korteweg–de Vries (KdV), and Kawahara equations among higher-order nonlinear PDEs. Additional simulations are conducted on the same PDEs under noisy conditions to test the robustness of the proposed approach.
42 ENGINEERING↗
Performance of concatenated Reed-Solomon/Viterbi channel coding
The concatenated Reed-Solomon (RS)/Viterbi coding system is reviewed. The performance of the system is analyzed and results are derived with a new simple approach. A functional model for the input RS symbol error probability is presented. Based on this new functional model, we compute the performance of a concatenated system in terms of RS word error probability, output RS symbol error probability, bit error probability due to decoding failure, and bit error probability due to decoding error. Finally we analyze the effects of the noisy carrier reference and the slow fading on the system performance.
Divsalar, D.↗
Formal system - Technical documentation
Input/output routines for symbolic programming with FORMAL on Univac 1108 computer
Mesztenyi, C. K.↗