SEARCH · Search NASA

Results for “symbolic computation”

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 181 records · Page 10

All sources NASA NTRS DOE OSTI

NASA NTRS1990

Automating symbolic analysis with CLIPS

Symbolic Analysis is a methodology first applied as an aid in selecting and generating test cases for 'white box' type testing of computer software programs. The feasibility of automating this analysis process has recently been demonstrated through the development of a CLIPS-based prototype tool. Symbolic analysis is based on separating the logic flow diagram of a computer program into its basic elements, and then systematically examining those elements and their relationships to provide a detailed static analysis of the process that those diagrams represent. The basic logic flow diagram elements are flow structure (connections), predicates (decisions), and computations (actions). The symbolic analysis approach supplies a disciplined step-by-step process to identify all executable program paths and produce a truth table that defines the input and output domains for each path identified. The resulting truth table is the tool that allows software test cases to be generated in a comprehensive manner to achieve total program path, input domain, and output domain coverage. Since the manual application of symbolic analysis is extremely labor intensive and is itself error prone, automation of the process is highly desirable. Earlier attempts at automation, utilizing conventional software approaches, had only limited success. This paper briefly describes the automation problems, the symbolic analysis expert's problem solving heuristics, and the implementation of those heuristics as a CLIPS based prototype, and the manual augmentation required. A simple application example is also provided for illustration purposes. The paper concludes with a discussion of implementation experiences, automation limitations, usage experiences, and future development suggestions.

Morris, Keith E.↗

NASA NTRS1964

Artificial intelligence

Artificial intelligence - system for instructing computer and programming language for manipulating symbolic expressions

ARTIFICIAL INTELLIGENCE↗

NASA NTRS1988

Integration of symbolic and algorithmic hardware and software for the automation of space station subsystems

Expert systems that require access to data bases, complex simulations and real time instrumentation have both symbolic and algorithmic needs. Both of these needs could be met using a general purpose workstation running both symbolic and algorithmic codes, or separate, specialized computers networked together. The later approach was chosen to implement TEXSYS, the thermal expert system, developed by the NASA Ames Research Center in conjunction with the Johnson Space Center to demonstrate the ability of an expert system to autonomously monitor the thermal control system of the space station. TEXSYS has been implemented on a Symbolics workstation, and will be linked to a microVAX computer that will control a thermal test bed. The integration options and several possible solutions are presented.

Gregg, Hugh↗

NASA NTRSDate not supplied

Bayesian Symbolic Regression: Addressing Challenges in Estimating Fractional Bayes Factors and Application to Fatigue Crack Growth Modeling

This research pioneers advancements in computational mechanics by integrating Bayesian-based uncertainty quantification into symbolic regression, specifically focusing on the critical task of accurately estimating the fractional Bayes factor for selecting arbitrary equations. In our exploration, we rigorously study two prominent methods—sequential Monte Carlo and the Laplace approximation—employed for computing the fractional Bayes factor. Our findings underscore the limitations of the Laplace approximation, revealing its diminished accuracy in nonlinear and multimodal scenarios. Specifically, the Laplace approximation is shown to underpredict fractional Bayes factor on a wide set of equations associated with a symbolic regression benchmark. This comparative analysis sheds light on the nuanced performance of these techniques, guiding researchers toward more informed choices in uncertainty quantification within symbolic regression. Furthermore, we showcase the practical utility of these enhanced symbolic regression tools through their application to a real-world problem in fatigue crack growth modeling, emphasizing their efficacy in capturing the complexities of mechanical systems.

Geoffrey Bomarito↗

NASA NTRS1975

Orbital Maneuvering Engine Feed System Coupled Stability Investigation, Computer User's Manual

An operating manual for the feed system coupled stability model was given, in partial fulfillment of a program designed to develop, verify, and document a digital computer model that can be used to analyze and predict engine/feed system coupled instabilities in pressure-fed storable propellant propulsion systems over a frequency range of 10 to 1,000 Hz. The first section describes the analytical approach to modelling the feed system hydrodynamics, combustion dynamics, chamber dynamics, and overall engineering model structure, and presents the governing equations in each of the technical areas. This is followed by the program user's guide, which is a complete description of the structure and operation of the computerized model. Last, appendices provide an alphabetized FORTRAN symbol table, detailed program logic diagrams, computer code listings, and sample case input and output data listings.

Schuman, M. D.↗

NASA NTRS1994

New Computer Simulations of Macular Neural Functioning

We use high performance graphics workstations and supercomputers to study the functional significance of the three-dimensional (3-D) organization of gravity sensors. These sensors have a prototypic architecture foreshadowing more complex systems. Scaled-down simulations run on a Silicon Graphics workstation and scaled-up, 3-D versions run on a Cray Y-MP supercomputer. A semi-automated method of reconstruction of neural tissue from serial sections studied in a transmission electron microscope has been developed to eliminate tedious conventional photography. The reconstructions use a mesh as a step in generating a neural surface for visualization. Two meshes are required to model calyx surfaces. The meshes are connected and the resulting prisms represent the cytoplasm and the bounding membranes. A finite volume analysis method is employed to simulate voltage changes along the calyx in response to synapse activation on the calyx or on calyceal processes. The finite volume method insures that charge is conserved at the calyx-process junction. These and other models indicate that efferent processes act as voltage followers, and that the morphology of some afferent processes affects their functioning. In a final application, morphological information is symbolically represented in three dimensions in a computer. The possible functioning of the connectivities is tested using mathematical interpretations of physiological parameters taken from the literature. Symbolic, 3-D simulations are in progress to probe the functional significance of the connectivities. This research is expected to advance computer-based studies of macular functioning and of synaptic plasticity.

Ross, Muriel D.↗

NASA NTRS1995

Effect Of Transition Density On Performance Of A DTTL

One estimates minimum transition density needed to limit symbol-error rate. Theoretical calculations and accompanying computer simulations provide numerical basis for specification of minimum data-transition density needed for adequate performance of radio receiver processing noisy signal containing non-return-to-zero (NRZ) stream of data symbols (bits). By use of digital-data-transition-tracking loop (DTTL), receiver strives to synchronize operation with data symbols. Performance of receiver in terms of ability to keep symbol-error rate (SER) in output of receiver below specified level depends on symbol signal-to-noise ratio (SSNR) of incoming signal and on degree of synchronization. Ability of DTTL to maintain synchronization depends partly on SSNR and partly on data-transition density.

Nguyen, Tien M.↗

NASA NTRS1992

Binary weight distributions of some Reed-Solomon codes

The binary weight distributions of the (7,5) and (15,9) Reed-Solomon (RS) codes and their duals are computed using the MacWilliams identities. Several mappings of symbols to bits are considered and those offering the largest binary minimum distance are found. These results are then used to compute bounds on the soft-decoding performance of these codes in the presence of additive Gaussian noise. These bounds are useful for finding large binary block codes with good performance and for verifying the performance obtained by specific soft-coding algorithms presently under development.

Pollara, F.↗

NASA NTRS1984

Research in computer science

Several short summaries of the work performed during this reporting period are presented. Topics discussed in this document include: (1) resilient seeded errors via simple techniques; (2) knowledge representation for engineering design; (3) analysis of faults in a multiversion software experiment; (4) implementation of parallel programming environment; (5) symbolic execution of concurrent programs; (6) two computer graphics systems for visualization of pressure distribution and convective density particles; (7) design of a source code management system; (8) vectorizing incomplete conjugate gradient on the Cyber 203/205; (9) extensions of domain testing theory and; (10) performance analyzer for the pisces system.

Ortega, J. M.↗

NASA NTRS1978

Structural Dynamics, Stability, and Control of Helicopters

The dynamic synthesis of gyroscopic structures consisting of point-connected substructures is investigated. The objective is to develop a mathematical model capable of an adequate simulation of the modal characteristics of a helicopter using a minimum number of degrees of freedom. The basic approach is to regard the helicopter structure as an assemblage of flexible substructures. The variational equations for the perturbed motion about certain equilibrium solutions are derived. The discretized variational equations can be conveniently exhibited in matrix form, and a great deal of information about the system modal characteristics can be extracted from the coefficient matrices. The derivation of the variational equations requires a monumental amount of algebraic operations. To automate this task a symbolic manipulation program on a digital computer is developed.

Meirovitch, L.↗

NASA NTRS1984

Carrier recovery methods for a dual-mode modem: A design approach

A dual mode model with selectable QPSK or 16-QASK modulation schemes is discussed. The theoretical reasoning as well as the practical trade-offs made during the development of a modem are presented, with attention given to the carrier recovery method used for coherent demodulation. Particular attention is given to carrier recovery methods that can provide little degradation due to phase error for both QPSK and 16-QASK, while being insensitive to the amplitude characteristic of a 16-QASK modulation scheme. A computer analysis of the degradation is symbol error rate (SER) for QPSK and 16-QASK due to phase error is prresented. Results find that an energy increase of roughly 4 dB is needed to maintain a SER of 1X10(-5) for QPSK with 20 deg of phase error and 16-QASK with 7 deg phase error.

Richards, C. W.↗

NASA NTRS1987

Research on knowledge representation, machine learning, and knowledge acquisition

Research in knowledge representation, machine learning, and knowledge acquisition performed at Knowledge Systems Lab. is summarized. The major goal of the research was to develop flexible, effective methods for representing the qualitative knowledge necessary for solving large problems that require symbolic reasoning as well as numerical computation. The research focused on integrating different representation methods to describe different kinds of knowledge more effectively than any one method can alone. In particular, emphasis was placed on representing and using spatial information about three dimensional objects and constraints on the arrangement of these objects in space. Another major theme is the development of robust machine learning programs that can be integrated with a variety of intelligent systems. To achieve this goal, learning methods were designed, implemented and experimented within several different problem solving environments.

Buchanan, Bruce G.↗

NASA NTRS2011

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↗

NASA NTRS2014

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↗

NASA NTRS1984

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.↗

NASA NTRS1983

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.↗

NASA NTRS1977

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.↗

NASA NTRS1987

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↗