Search NASA⌕ Search

SEARCH · Search NASA

Results for “SYMBOL”

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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
NASA NTRS2003

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

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↗
NASA NTRS1995

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↗
NASA NTRS1994

Trellis Coding of Non-coherent Multiple Symbol Full Response M-ary CPFSK with Modulation Index 1/M

This paper introduces a trellis coded modulation (TCM) scheme for non-coherent multiple full response M-ary CPFSK with modulation index 1/M. A proper branch metric for the trellis decoder is obtained by employing a simple approximation of the modified Bessel function for large signal to noise ratio (SNR). Pairwise error probability of coded sequences is evaluated by applying a linear approximation to the Rician random variable.

trellis coded modulation TCM↗
NASA NTRS2010

Symbolic Computation of Strongly Connected Components Using Saturation

Finding strongly connected components (SCCs) in the state-space of discrete-state models is a critical task in formal verification of LTL and fair CTL properties, but the potentially huge number of reachable states and SCCs constitutes a formidable challenge. This paper is concerned with computing the sets of states in SCCs or terminal SCCs of asynchronous systems. Because of its advantages in many applications, we employ saturation on two previously proposed approaches: the Xie-Beerel algorithm and transitive closure. First, saturation speeds up state-space exploration when computing each SCC in the Xie-Beerel algorithm. Then, our main contribution is a novel algorithm to compute the transitive closure using saturation. Experimental results indicate that our improved algorithms achieve a clear speedup over previous algorithms in some cases. With the help of the new transitive closure computation algorithm, up to 10(exp 150) SCCs can be explored within a few seconds.

Zhao, Yang↗
NASA NTRS2011

Symbol Tables and Branch Tables: Linking Applications Together

This document explores the computer techniques used to execute software whose parts are compiled and linked separately. The computer techniques include using a branch table or indirect address table to connect the parts. Methods of storing the information in data structures are discussed as well as differences between C and C++.

Handler, Louis M.↗
NASA NTRS2018

Advanced Symbolic Analysis Tools for Fault-Tolerant Integrated Distributed Systems

The project aims to develop advanced model-checking algorithms and tools to automate the verification of fault-tolerant distributed systems for avionics. We present a new method called Property-Directed K-Induction (PD-KIND) for synthesizing K-inductive invariants of state-transition systems. PD-KIND builds upon Satifiability Modulo Theories (SMT) to generalize Bradley's IC3 method and its variants. This method is implemented in a new tool called SALLY. Case studies show that PD-KIND can automatically verify fault-tolerant algorithms under a variety of fault models and that SALLY is competitive with other SMT-based model checkers.

Dutertre, Bruno↗