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 127 records · Page 7

Practical Formal Verification of Diagnosability of Large Models via Symbolic Model Checking

This document reports on the activities carried out during a four-week visit of Roberto Cavada at the NASA Ames Research Center. The main goal was to test the practical applicability of the framework proposed, where a diagnosability problem is reduced to a Symbolic Model Checking problem. Section 2 contains a brief explanation of major techniques currently used in Symbolic Model Checking, and how these techniques can be tuned in order to obtain good performances when using Model Checking tools. Diagnosability is performed on large and structured models of real plants. Section 3 describes how these plants are modeled, and how models can be simplified to improve the performance of Symbolic Model Checkers. Section 4 reports scalability results. Three test cases are briefly presented, and several parameters and techniques have been applied on those test cases in order to produce comparison tables. Furthermore, comparison between several Model Checkers is reported. Section 5 summarizes the application of diagnosability verification to a real application. Several properties have been tested, and results have been highlighted. Finally, section 6 draws some conclusions, and outlines future lines of research.

Cavada, Roberto↗

Multiple Layer Identification Label Using Stacked Identification Symbols

An automatic identification system and method are provided which employ a machine readable multiple layer label. The label has a plurality of machine readable marking layers stacked one upon another. Each of the marking layers encodes an identification symbol detectable using one or more sensing technologies. The various marking layers may comprise the same marking material or each marking layer may comprise a different medium having characteristics detectable by a different sensing technology. These sensing technologies include x-ray, radar, capacitance, thermal, magnetic and ultrasonic. A complete symbol may be encoded within each marking layer or a symbol may be segmented into fragments which are then divided within a single marking layer or encoded across multiple marking layers.

Harry F Schramm↗

Multiple layer identification label using stacked identification symbols

An automatic identification system and method are provided which employ a machine readable multiple layer label. The label has a plurality of machine readable marking layers stacked one upon another. Each of the marking layers encodes an identification symbol detectable using one or more sensing technologies. The various marking layers may comprise the same marking material or each marking layer may comprise a different medium having characteristics detectable by a different sensing technology. These sensing technologies include x-ray, radar, capacitance, thermal, magnetic and ultrasonic. A complete symbol may be encoded within each marking layer or a symbol may be segmented into fragments which are then divided within a single marking layer or encoded across multiple marking layers.

Schramm, Harry F.↗

Using LDPC Code Constraints to Aid Recovery of Symbol Timing

A method of utilizing information available in the constraints imposed by a low-density parity-check (LDPC) code has been proposed as a means of aiding the recovery of symbol timing in the reception of a binary-phase-shift-keying (BPSK) signal representing such a code in the presence of noise, timing error, and/or Doppler shift between the transmitter and the receiver. This method and the receiver architecture in which it would be implemented belong to a class of timing-recovery methods and corresponding receiver architectures characterized as pilotless in that they do not require transmission and reception of pilot signals. Acquisition and tracking of a signal of the type described above have traditionally been performed upstream of, and independently of, decoding and have typically involved utilization of a phase-locked loop (PLL). However, the LDPC decoding process, which is iterative, provides information that can be fed back to the timing-recovery receiver circuits to improve performance significantly over that attainable in the absence of such feedback. Prior methods of coupling LDPC decoding with timing recovery had focused on the use of output code words produced as the iterations progress. In contrast, in the present method, one exploits the information available from the metrics computed for the constraint nodes of an LDPC code during the decoding process. In addition, the method involves the use of a waveform model that captures, better than do the waveform models of the prior methods, distortions introduced by receiver timing errors and transmitter/ receiver motions. An LDPC code is commonly represented by use of a bipartite graph containing two sets of nodes. In the graph corresponding to an (n,k) code, the n variable nodes correspond to the code word symbols and the n-k constraint nodes represent the constraints that the code places on the variable nodes in order for them to form a valid code word. The decoding procedure involves iterative computation of values associated with these nodes. A constraint node represents a parity-check equation using a set of variable nodes as inputs. A valid decoded code word is obtained if all parity-check equations are satisfied. After each iteration, the metrics associated with each constraint node can be evaluated to determine the status of the associated parity check. Heretofore, normally, these metrics would be utilized only within the LDPC decoding process to assess whether or not variable nodes had converged to a codeword. In the present method, it is recognized that these metrics can be used to determine accuracy of the timing estimates used in acquiring the sampled data that constitute the input to the LDPC decoder. In fact, the number of constraints that are satisfied exhibits a peak near the optimal timing estimate. Coarse timing estimation (or first-stage estimation as described below) is found via a parametric search for this peak. The present method calls for a two-stage receiver architecture illustrated in the figure. The first stage would correct large time delays and frequency offsets; the second stage would track random walks and correct residual time and frequency offsets. In the first stage, constraint-node feedback from the LDPC decoder would be employed in a search algorithm in which the searches would be performed in successively narrower windows to find the correct time delay and/or frequency offset. The second stage would include a conventional first-order PLL with a decision-aided timing-error detector that would utilize, as its decision aid, decoded symbols from the LDPC decoder. The method has been tested by means of computational simulations in cases involving various timing and frequency errors. The results of the simulations ined in the ideal case of perfect timing in the receiver.

Jones, Christopher↗

Inter-Symbol Guard Time for Synchronizing Optical PPM

An inter-symbol guard time has been proposed as a means of synchronizing the symbol and slot clocks of an optical pulse-position modulation (PPM) receiver with the symbol and slot periods of an incoming optical PPM signal.The proposal is applicable to the low-flux case in which the receiver photodetector operates in a photon-counting mode and the count can include contributions from incidental light sources and dark current.

Far, William↗

Fusing Symbolic and Numerical Diagnostic Computations

X-2000 Anomaly Detection Language denotes a developmental computing language, and the software that establishes and utilizes the language, for fusing two diagnostic computer programs, one implementing a numerical analysis method, the other implementing a symbolic analysis method into a unified event-based decision analysis software system for realtime detection of events (e.g., failures) in a spacecraft, aircraft, or other complex engineering system. The numerical analysis method is performed by beacon-based exception analysis for multi-missions (BEAMs), which has been discussed in several previous NASA Tech Briefs articles. The symbolic analysis method is, more specifically, an artificial-intelligence method of the knowledge-based, inference engine type, and its implementation is exemplified by the Spacecraft Health Inference Engine (SHINE) software. The goal in developing the capability to fuse numerical and symbolic diagnostic components is to increase the depth of analysis beyond that previously attainable, thereby increasing the degree of confidence in the computed results. In practical terms, the sought improvement is to enable detection of all or most events, with no or few false alarms.

James, Mark↗

A Comparative Study of Randomized Constraint Solvers for Random-Symbolic Testing

The complexity of constraints is a major obstacle for constraint-based software verification. Automatic constraint solvers are fundamentally incomplete: input constraints often build on some undecidable theory or some theory the solver does not support. This paper proposes and evaluates several randomized solvers to address this issue. We compare the effectiveness of a symbolic solver (CVC3), a random solver, three hybrid solvers (i.e., mix of random and symbolic), and two heuristic search solvers. We evaluate the solvers on two benchmarks: one consisting of manually generated constraints and another generated with a concolic execution of 8 subjects. In addition to fully decidable constraints, the benchmarks include constraints with non-linear integer arithmetic, integer modulo and division, bitwise arithmetic, and floating-point arithmetic. As expected symbolic solving (in particular, CVC3) subsumes the other solvers for the concolic execution of subjects that only generate decidable constraints. For the remaining subjects the solvers are complementary.

Takaki, Mitsuo↗

Maximum Likelihood Synchronization for Pulse Position Modulation with Inter-Symbol Guard Times

Deep space optical communications promises orders-of-magnitude growth in communication capacity, supporting high data rate applications such as video streaming and high-bandwidth science instruments. Pulse position modulation is the modulation format of choice for deep space applications, and by inserting inter-symbol guard times between the symbols, the signal carries the timing information needed by the demodulator. Accurately extracting this timing information is crucial to demodulating and decoding this signal. In this paper we propose a low complexity maximum likelihood timing estimator for pulse position modulation with inter-symbol guard times which significantly outperforms the prior art in this domain. We show that this estimator can achieve the same performance as prior estimators with an order-of-magnitude less signal flux, or multiple orders-of-magnitude less flux-accumulation time. Further we show that this estimator achieves the Cramer-Rao bound, making it asymptotically efficient. This method does not require an explicit synchronization sequence, freeing up channel resources for data transmission.

Rogalin, Ryan↗

Joint Channel Equalization and Symbol Detection for IoT Devices in Severe Multipath Channels

Internet of Things (IoT) devices often transmit very short message blocks without strong error correction coding or pilots for channel equalization. When the transmitted signals encounter a severe multipath channel, the receiver is often unable to equalize the resulting inter-symbol interference (ISI) via traditional methods, leading to a high retransmission rate. This paper proposes a joint channel equalization and symbol detection scheme for this scenario by utilizing the preamble sequence as a training pilot for equalization and the relatively weak cyclic redundancy check (CRC) 8-Dallas code for error correction. By assuming a sparse channel impulse response, the proposed joint channel equalization and symbol detection scheme formulates an l1 norm constrained optimization problem and solves it by a saddle-point algorithm. The proposed algorithm is applied to a set of real-world underwater animal tracking IoT data, and the results show improvement of correct message detection rate from 21:5% to 41:6%.

Jing, Shusen↗

Characterizing dilute combustion instabilities in a multi-cylinder spark-ignited engine using symbolic analysis

Spark-ignited internal combustion engines have evolved considerably in recent years in response to increasingly stringent regulations for emissions and fuel-economy. One new advanced engine strategy utilizes high levels of exhaust gas recirculation (EGR) to reduce combustion temperatures, thereby increasing thermodynamic efficiency and reducing nitrogen oxide emissions. While this strategy can be highly effective, it also poses major control and design challenges due to the large combustion oscillations that develop at sufficiently high EGR levels. Previous research has documented that combustion instabilities can propagate between successive engine cycles in individual cylinders via self-generated feedback of reactive species and thermal energy in the retained residual exhaust gases. In this work, we use symbolic analysis to characterize multi-cylinder combustion oscillations in an experimental engine operating with external EGR. At low levels of EGR, intra-cylinder oscillations are clearly visible and appear to be associated with brief, intermittent coupling among cylinders. As EGR is increased further, a point is reached where all four cylinders lock almost completely in phase and alternate simultaneously between two distinct bi-stable combustion states. From a practical perspective, it is important to understand the causes of this phenomenon and develop diagnostics that might be applied to ameliorate its effects. We demonstrate here that two approaches for symbolizing the engine combustion measurements can provide useful probes for characterizing these instabilities.

42 ENGINEERING↗

Hybrid Symbolic-Numerical Modeling and Parametric Stability Analysis of DC–AC Power Systems

Hybrid DC-AC power systems integrating diverse inverter-based resources (IBRs) and multi-terminal high-voltage direct current (MTDC) networks represent a promising architecture for future power grids, while introducing challenges for modeling, stability analysis, and control design. This paper develops a hybrid symbolic-numerical modeling framework and tool to characterize the parametric small-signal stability of DC-AC coupled power systems. The proposed approach constructs parametric state-space models to enable efficient representation of system dynamics under varying control parameters and network configurations, with target parameters retained as symbolic variables and the remainder treated numerically. The stability analysis framework covers eigenvalue, sensitivity, and stability boundary and region characterization. Enhanced linear matrix inequality (LMI) techniques are proposed to directly certify small-signal stability over regions of parameter space while also reducing the conservativeness and computational burden. The resulting tools and frameworks enable rapid parametric model construction across diverse grid conditions, thereby facilitating stability-informed control and operation in complex DC–AC power systems.

DC–AC power systems↗

MINLP for regularized symbolic regression with applications to data-driven modeling of critical minerals processes

The poster summarizes recent advances in symbolic regression developed as part of the PrOMMiS project over the past year. In particular, it describes the comparison of surrogates for critical minerals (CM) & rare earth element (REE) recovery flowsheets obtained via symbolic regression and ALAMO. It also compares the predictive ability and solvability of optimization models that incorporate these surrogates.

36 MATERIALS SCIENCE↗

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↗

Bingo: A Customizable Framework for Symbolic Regression with Genetic Programming

In this paper, we introduce Bingo, a flexible and customizable yet performant Python framework for symbolic regression with genetic programming. Bingo maintains a modular code structure for simple abstraction and easily swappable components. Fitness functions, selection methods, and constant optimization methods allow for easy problem-specific customization. Bingo also maintains several features for increased efficiency such as parallelism, equation simplification, and a C++ backend. We compare Bingo’s performance to other genetic programming for symbolic regression (GPSR) methods to show that it is both competitive and flexible.

machine learning↗

Symbol alphabets from plabic graphs II: rational letters

Symbol alphabets of n-particle amplitudes in N = 4 super-Yang-Mills theory are known to contain certain cluster variables of G(4, n) as well as certain algebraic functions of cluster variables. The first paper arXiv:2007.00646 in this series focused on n = 8 algebraic letters. In this paper we show that it is possible to obtain all rational symbol letters (in fact all cluster variables) by solving matrix equations of the form C Z = 0 if one allows C to be an arbitrary cluster parameterization of the top cell of G + (n-4, n).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Lifting heptagon symbols to functions

Seven-point amplitudes in planar $ \mathcal{N} $ = 4 super-Yang-Mills theory have previously been constructed through four loops using the Steinmann cluster bootstrap, but only at the level of the symbol. In this work, we promote these symbols to actual functions, by specifying their first derivatives and boundary conditions on a particular two-dimensional surface. To do this, we impose branch-cut conditions and construct the entire heptagon function space through weight six. We plot the amplitudes on a few lines in the bulk Euclidean region, and explore the properties of the heptagon function space under the coaction associated with multiple polylogarithms.

1/N expansion↗

SymbolFit: Automatic Parametric Modeling with Symbolic Regression

We introduce SymbolFit (API: https://github.com/hftsoi/symbolfit), a framework that automates parametric modeling by using symbolic regression to perform a machine-search for functions that fit the data while simultaneously providing uncertainty estimates in a single run. Traditionally, constructing a parametric model to accurately describe binned data has been a manual and iterative process, requiring an adequate functional form to be determined before the fit can be performed. The main challenge arises when the appropriate functional forms cannot be derived from first principles, especially when there is no underlying true closed-form function for the distribution. In this work, we develop a framework that automates and streamlines the process by utilizing symbolic regression, a machine learning technique that explores a vast space of candidate functions without requiring a predefined functional form because the functional form itself is treated as a trainable parameter, making the process far more efficient and effortless than traditional regression methods. We demonstrate the framework in high-energy physics experiments at the CERN Large Hadron Collider (LHC) using five real proton-proton collision datasets from new physics searches, including background modeling in resonance searches for high-mass dijet, trijet, paired-dijet, diphoton, and dimuon events. We show that our framework can flexibly and efficiently generate a wide range of candidate functions that fit a nontrivial distribution well using a simple fit configuration that varies only by random seed, and that the same fit configuration, which defines a vast function space, can also be applied to distributions of different shapes, whereas achieving a comparable result with traditional methods would have required extensive manual effort.

Tsoi, Ho Fung [Univ. of Pennsylvania, Philadelphia↗

Solvable model of quantum phase transitions and the symbolic-manipulation-based study of its multiply degenerate exceptional points and of their unfolding

It is known that the practical use of non-Hermitian (i.e., typically, PT-symmetric) phenomenological quantum Hamiltonians H≠H{sup †} requires an efficient reconstruction of an ad hoc Hilbert-space metric Θ=Θ(H) which would render the time-evolution unitary. Once one considers just the N-dimensional matrix toy models H=H{sup (N)}, the matrix elements of Θ(H) may be defined via a coupled set of N{sup 2} polynomial equations. Their solution is a typical task for computer-assisted symbolic manipulations. The feasibility of such a model-completion construction is illustrated here via a discrete square well model H=p{sup 2}+V endowed with a k-parametric close-to-the-boundary interaction V. The model is shown to possess (possibly, multiply degenerate) exceptional points marking the phase transitions which are attributable, due to the exact solvability of the model at any N<∞, to the loss of the regularity of the metric. In the parameter-dependence of the energy spectrum near these singularities one encounters a broad variety of alternative, topologically non-equivalent scenarios. -- Highlights: •New elementary non-Hermitian quantum Hamiltonians with real spectra proposed. •Exceptional points found and studied. •Non-equivalent stability-loss patterns of phase transition identified. •Hermitization matrices of metrics Θ constructed via symbolic manipulations and extrapolations at all N and k.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗