Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “symbolic”

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 307 records · Page 17

Symbolic Solution of Linear Differential Equations

An algorithm for solving linear constant-coefficient ordinary differential equations is presented. The computational complexity of the algorithm is discussed and its implementation in the FORMAC system is described. A comparison is made between the algorithm and some classical algorithms for solving differential equations.

Feinberg, R. B.↗

Asymptotic matching by the symbolic manipulator MACSYMA

The delegation of the labor of calculating higher-order terms in singular perturbation (SP) expansions to a computer by the use of MACSYMA is considered. The method of matched asymptotic expansions is studied in detail for two model SP problems: a model resembling the boundary layer equation with a small parameter multiplying the highest derivatives; and a turning-point problem. It is shown that MACSYMA has successfully performed the higher-order matching in both problems.

Lo, L. L.↗

Investigations into the shape-preserving interpolants using symbolic computation

Shape representation is a central issue in computer graphics and computer-aided geometric design. Many physical phenomena involve curves and surfaces that are monotone (in some directions) or are convex. The corresponding representation problem is given some monotone or convex data, and a monotone or convex interpolant is found. Standard interpolants need not be monotone or convex even though they may match monotone or convex data. Most of the methods of investigation of this problem involve the utilization of quadratic splines or Hermite polynomials. In this investigation, a similar approach is adopted. These methods require derivative information at the given data points. The key to the problem is the selection of the derivative values to be assigned to the given data points. Schemes for choosing derivatives were examined. Along the way, fitting given data points by a conic section has also been investigated as part of the effort to study shape-preserving quadratic splines.

Lam, Maria↗

On the periodicity of symbolic observations of piecewise smooth discrete-time systems

A study is made of the behavior of discrete-time systems composed of a set of smooth transition maps coupled by a quantized feedback function. The feedback function partitions the state space into disjoint regions and assigns a smooth transition function to each region. The main result is that under a constraint on the norm of the derivative of the transition maps, a bounded state trajectory with limit points in the interior of the switching regions leads to a region index sequence that is eventually periodic. Under these assumptions, it is shown that eventually the feedback function is determined by a finite state automaton. A similar result is proved in the case of finite state dynamic feedback.

Ramadge, Peter J.↗

The symbolic computation and automatic analysis of trajectories

Research was generally done on computation of trajectories of dynamical systems, especially control systems. Algorithms were further developed for rewriting expressions involving differential operators. The differential operators involved arise in the local analysis of nonlinear control systems. An initial design was completed of the system architecture for software to analyze nonlinear control systems using data base computing.

Grossman, Robert↗

Synthesizing information-update functions using off-line symbolic processing

This paper explores the synthesis of programs that track dynamic conditions in their environment. An approach is proposed in which the designer specifies, in a declarative language, aspects of the environment in which the program will be embedded. This specification is then automatically compiled into a program that, when executed, updates internal data structures so as to maintain as an invariant a desired correspondence between internal data structures and states of the external environment. This approach retains much of the flexibility of declarative programming while guaranteeing a hard bound on the execution time of information-update functions.

Rosenschein, Stanley J.↗

An implementation of a reference symbol approach to generic modulation in fading channels

As mobile satellite communications systems evolve over the next decade, they will have to adapt to a changing tradeoff between bandwidth and power. This paper presents a flexible approach to digital modulation and coding that will accommodate both wideband and narrowband schemes. This architecture could be the basis for a family of modems, each satisfying a specific power and bandwidth constraint, yet all having a large number of common signal processing blocks. The implementation of this generic approach, with general purpose digital processors for transmission of 4.8 kilobits per sec. digitally encoded speech, is described.

Young, R. J.↗

Error latency measurements in symbolic architectures

Error latency, the time that elapses between the occurrence of an error and its detection, has a significant effect on reliability. In computer systems, failure rates can be elevated during a burst of system activity due to increased detection of latent errors. A hybrid monitoring environment is developed to measure the error latency distribution of errors occurring in main memory. The objective of this study is to develop a methodology for gauging the dependability of individual data categories within a real-time application. The hybrid monitoring technique is novel in that it selects and categorizes a specific subset of the available blocks of memory to monitor. The precise times of reads and writes are collected, so no actual faults need be injected. Unlike previous monitoring studies that rely on a periodic sampling approach or on statistical approximation, this new approach permits continuous monitoring of referencing activity and precise measurement of error latency.

Young, L. T.↗

Comparison Of Full-Spectrum And Complex-Symbol Combining

Report presents theoretical study of anticipated performances of two methods of combining S-band signals from Galileo spacecraft received in multiple antennas of NASA's Deep Space Network (DSN). Signal transmitted by spacecraft consists of binary data signal phase-modulated onto square-wave subcarrier that is, in turn, amplitude-modulated onto S-band carrier.

Million, Samson↗

Applications of symbolic computation in fracture mechanics

A FORTRAN program for calculating the stresses of n cracks embedded in an isotropic plate is presented. Formulas are given for calculating the stresses of one crack, two cracks, and n cracks in an isotropic plate. Then the program code that accomplishes this is provided.

Tan, Hui-Qian↗

Saturation: An efficient iteration strategy for symbolic state-space generation

This paper presents a novel algorithm for generating state spaces of asynchronous systems using Multi-valued Decision Diagrams. In contrast to related work, the next-state function of a system is not encoded as a single Boolean function, but as cross-products of integer functions. This permits the application of various iteration strategies to build a system's state space. In particular, this paper introduces a new elegant strategy, called saturation, and implements it in the tool SMART. On top of usually performing several orders of magnitude faster than existing BDD-based state-space generators, the algorithm's required peak memory is often close to the nal memory needed for storing the overall state spaces.

Ciardo, Gianfranco↗

Vacuum Arc Vapor Deposition Method and Apparatus for Applying Identification Symbols to Substrates

An apparatus for applying permanent markings onto products using a Vacuum Arc Vapor Deposition (VAVD) marker by accelerating atoms or molecules from a vaporization source onto a substrate to form human and/or machine-readable part identification marking that can be detected optically or via a sensing device like x-ray, thermal imaging, ultrasound, magneto-optic, micro-power impulse radar, capacitance, or other similar sensing means. The apparatus includes a housing with a nozzle having a marking end. A chamber having an electrode, a vacuum port and a charge is located within the housing. The charge is activated by the electrode in a vacuum environment and deposited onto a substrate at the marking end of the nozzle. The apparatus may be a hand-held device or be disconnected from the handle and mounted to a robot or fixed station.

Harry F Schramm↗

Method and Apparatus for Reading Two Dimensional Identification Symbols Using Radar Techniques

A method and apparatus are provided for sensing two-dimensional identification marks provided on a substrate or embedded within a substrate below a surface of the substrate. Micropower impulse radar is used to transmit a high risetime, short duration pulse to a focussed radar target area of the substrate having the two dimensional identification marks. The method further includes the steps of listening for radar echoes returned from the identification marks during a short listening period window occurring a predetermined time after transmission of the radar pulse. If radar echoes are detected, an image processing step is carried out. If no radar echoes are detected, the method further includes sequentially transmitting further high risetime, short duration pulses, and listening for radar echoes from each of said further pulses after different elapsed times for each of the further pulses until radar echoes are detected. When radar echoes are detected, data based on the detected echoes is processed to produce an image of the identification marks.

Harry F Schramm Jr.↗

Towards Symbolic Model Checking for Multi-Agent Systems via OBDDs

We present an algorithm for model checking temporal-epistemic properties of multi-agent systems, expressed in the formalism of interpreted systems. We first introduce a technique for the translation of interpreted systems into boolean formulae, and then present a model-checking algorithm based on this translation. The algorithm is based on OBDD's, as they offer a compact and efficient representation for boolean formulae.

Raimondi, Franco↗

An Estimate of Solar Wind Velocity Profiles in a Coronal Hole and a Coronal Streamer Area (6-40 R(radius symbol)

Total electron content data obtained from the Ulysses Solar Corona Experiment (SCE) in 1991 were used to select two data sets, one associated with a coronal hole and the other with coronal streamer crossings. (This is largely equatorial data shortly after solar maximum.) The solar wind velocity profile is estimated for these areas.

solar corona solar wind coronal streamer Ulysses↗