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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 667 records · Page 37

All sources NASA NTRS DOE OSTI

NASA NTRS2011

Automated Test Case Generation for an Autopilot Requirement Prototype

Designing safety-critical automation with robust human interaction is a difficult task that is susceptible to a number of known Human-Automation Interaction (HAI) vulnerabilities. It is therefore essential to develop automated tools that provide support both in the design and rapid evaluation of such automation. The Automation Design and Evaluation Prototyping Toolset (ADEPT) enables the rapid development of an executable specification for automation behavior and user interaction. ADEPT supports a number of analysis capabilities, thus enabling the detection of HAI vulnerabilities early in the design process, when modifications are less costly. In this paper, we advocate the introduction of a new capability to model-based prototyping tools such as ADEPT. The new capability is based on symbolic execution that allows us to automatically generate quality test suites based on the system design. Symbolic execution is used to generate both user input and test oracles user input drives the testing of the system implementation, and test oracles ensure that the system behaves as designed. We present early results in the context of a component in the Autopilot system modeled in ADEPT, and discuss the challenges of test case generation in the HAI domain.

Giannakopoulou, Dimitra↗

NASA NTRS2012

A Change Impact Analysis to Characterize Evolving Program Behaviors

Change impact analysis techniques estimate the potential effects of changes made to software. Directed Incremental Symbolic Execution (DiSE) is an intraprocedural technique for characterizing the impact of software changes on program behaviors. DiSE first estimates the impact of the changes on the source code using program slicing techniques, and then uses the impact sets to guide symbolic execution to generate path conditions that characterize impacted program behaviors. DiSE, however, cannot reason about the flow of impact between methods and will fail to generate path conditions for certain impacted program behaviors. In this work, we present iDiSE, an extension to DiSE that performs an interprocedural analysis. iDiSE combines static and dynamic calling context information to efficiently generate impacted program behaviors across calling contexts. Information about impacted program behaviors is useful for testing, verification, and debugging of evolving programs. We present a case-study of our implementation of the iDiSE algorithm to demonstrate its efficiency at computing impacted program behaviors. Traditional notions of coverage are insufficient for characterizing the testing efforts used to validate evolving program behaviors because they do not take into account the impact of changes to the code. In this work we present novel definitions of impacted coverage metrics that are useful for evaluating the testing effort required to test evolving programs. We then describe how the notions of impacted coverage can be used to configure techniques such as DiSE and iDiSE in order to support regression testing related tasks. We also discuss how DiSE and iDiSE can be configured for debugging finding the root cause of errors introduced by changes made to the code. In our empirical evaluation we demonstrate that the configurations of DiSE and iDiSE can be used to support various software maintenance tasks

Rungta, Neha Shyam↗

NASA NTRS2014

Learning Extended Finite State Machines

We present an active learning algorithm for inferring extended finite state machines (EFSM)s, combining data flow and control behavior. Key to our learning technique is a novel learning model based on so-called tree queries. The learning algorithm uses the tree queries to infer symbolic data constraints on parameters, e.g., sequence numbers, time stamps, identifiers, or even simple arithmetic. We describe sufficient conditions for the properties that the symbolic constraints provided by a tree query in general must have to be usable in our learning model. We have evaluated our algorithm in a black-box scenario, where tree queries are realized through (black-box) testing. Our case studies include connection establishment in TCP and a priority queue from the Java Class Library.

NASA NTRS2011

Frame Synchronization Without Attached Sync Markers

We describe a method to synchronize codeword frames without making use of attached synchronization markers (ASMs). Instead, the synchronizer identifies the code structure present in the received symbols, by operating the decoder for a handful of iterations at each possible symbol offset and forming an appropriate metric. This method is computationally more complex and doesn't perform as well as frame synchronizers that utilize an ASM; nevertheless, the new synchronizer acquires frame synchronization in about two seconds when using a 600 kbps software decoder, and would take about 15 milliseconds on prototype hardware. It also eliminates the need for the ASMs, which is an attractive feature for short uplink codes whose coding gain would be diminished by the overheard of ASM bits. The lack of ASMs also would simplify clock distribution for the AR4JA low-density parity-check (LDPC) codes and adds a small amount to the coding gain as well (up to 0.2 dB).

Hamkins, Jon↗

NASA NTRS2009

Deep-Space Ka-Band Link Priority Data Protection: Pre-Emptive Retransmission vs. Margin

In this paper the performance of two preemptive retransmission schemes for protection of priority data over deep-space Ka-band links is evaluated. The first scheme merges the correctly received bit from each transmission to create the most complete set of priority data for each pass (bit merge). The second scheme (symbol combining) combines the soft symbols received from each transmission of the priority data to increase the priority data's signal to noise ratio (SNR), thus increasing the liklihood of the correct reception.

Shambayati, Shervin↗

NASA NTRS2015

Marking Tests to Certify Part Identification Processes for Use in Low Earth Orbit

The primary purpose for the MISSE marking tests was to define Data Matrix symbol marking processes that will remain readable after exposure to Low Earth Orbit environments. A wide range of different Data Matrix symbol marking processes and materials, including some still under development, were evaluated. The samples flown on MISSE 1 and 2 were in orbit for 3 years and 348 days, MISSE 3 and 4 were in orbit for 1 year and 15 days, MISSE 6 was in orbit for 1 year and 130 days, and MISSE 8 was in orbit for 2 years and 55 days. The initial MISSE marking tests clearly reflected that intrusive marking processes can be successfully used for this purpose. All of the intrusive marking processes tested exceeded program expectations and met 100 percent of the principle investigators objectives. However, subsequent tests demonstrated that some additive marking processes will also satisfy the requirements. This was an unexpected result.

Roxby, D. L.↗

NASA NTRS2016

On the Performance of Adaptive Data Rate over Deep Space Ka-Bank Link: Case Study Using Kepler Data

Future missions envisioned for both human and robotic exploration demand increasing communication capacity through the use of Ka-band communications. The Ka-band channel, being more sensitive to weather impairments, presents a unique trade-offs between data storage, latency, data volume and reliability. While there are many possible techniques for optimizing Ka-band operations such as adaptive modulation and coding and site-diversity, this study focus exclusively on the use of adaptive data rate (ADR) to achieve significant improvement in the data volume-availability tradeoff over a wide range of link distances for near Earth and Mars exploration. Four years of Kepler Ka-band downlink symbol signal-to-noise (SNR) data reported by the Deep Space Network were utilized to characterize the Ka-band channel statistics at each site and conduct various what-if performance analysis for different link distances. We model a notional closed-loop adaptive data rate system in which an algorithm predicts the channel condition two-way light time (TWLT) into the future using symbol SNR reported in near-real time by the ground receiver and determines the best data rate to use. Fixed and adaptive margins were used to mitigate errors in channel prediction. The performance of this closed-loop adaptive data rate approach is quantified in terms of data volume and availability and compared to the actual mission configuration and a hypothetical, optimized single rate configuration assuming full a priori channel knowledge.

Gao, Jay L.↗

NASA NTRS2017

Automatic Estimation of Verified Floating-Point Round-Off Errors via Static Analysis

This paper introduces a static analysis technique for computing formally verified round-off error bounds of floating-point functional expressions. The technique is based on a denotational semantics that computes a symbolic estimation of floating-point round-o errors along with a proof certificate that ensures its correctness. The symbolic estimation can be evaluated on concrete inputs using rigorous enclosure methods to produce formally verified numerical error bounds. The proposed technique is implemented in the prototype research tool PRECiSA (Program Round-o Error Certifier via Static Analysis) and used in the verification of floating-point programs of interest to NASA.

Moscato, Mariano↗

NASA NTRS2021

A Low-Memory Spectral-Correlation Analyzer for Digital QAM-SRRC Waveforms

Cyclostationary signal processing (CSP) provides the ability to estimate received waveforms' statistical features blindly. Quadrature amplitude modulated (QAM) waveforms, when filtered by the square-root-raised cosine (SRRC) pulse shape function, have cyclic features that CSP can exploit to detect waveform parameters such as symbol rate (SR) and center frequency (CF). The estimation of these SR-CF pairs enables a cognitive radio (CR) to perform spectrum sensing techniques such as spectrum sharing and interference mitigation. Here, we investigate a field-programmable gate array (FPGA) application of a blind symbol rate-center frequency estimator. First, this study provides a background on the theory behind the cyclic spectral density function (CSD), spectral correlation analyzers (SCA), and spectrum sensing. Following this is a discussion on the motivation for CubeSat spectrum sensing. An SCA implementation for low-memory devices, such as FPGA-based CubeSat, is then describes. The paper concludes by reporting the performance characteristics of the newly developed streaming-based SCA.

FPGA↗

NASA NTRSDate not supplied

Parallelized Convolutional Interleaver Implementation for Efficient DDR Memory Access

Convolutional interleavers are used in many different communications systems to correct for burst errors due to atmospheric fades and scintillation. The interleaver size is related to the channel coherence time and the data rate. Small convolutional interleavers can be implemented in a field programmable gate array (FPGA) block random access memory (BRAM). However, large interleavers exceeding the size of the BRAM on the FPGA are necessary for channels with longer fades and higher data rates. Therefore, an implementation utilizing double data rate (DDR) memory external to the FPGA is necessary. Wide DDR memory data buses can make the use of DDR memory for convolutional interleavers inefficient when individual symbols are written to and read from the memory. DDR memory operational speeds can also limit the data rate of the interleaver. The Consultative Committee for Space Data Systems (CCSDS) Optical Communications High Photon Efficiency (HPE) standard utilizes a convolutional channel symbol interleaver. A previous implementation of the HPE standard utilized BRAM for the convolutional interleaver, but mission requirements for the upcoming Optical Artemis-2 Orion (O2O) communications demonstration dictate the use of an interleaver exceeding the size of the BRAM. An algorithm and method for implementing the convolutional interleaver in the FPGA with DDR memory is described in this paper.

optical communications↗

NASA NTRSDate not supplied

Parallelized convolutional interleaver implementation for efficient DDR memory access

Optical communications↗

NASA NTRS2021

Design and Modeling of a Coded-Interleaving System in the Presence of Fading

Future deep space links are migrating towards higher frequency bands such as Ka band and optical. These links are susceptible to non linear effects (e.g. cloud coverage, atmospheric turbulence, scintillation, antenna mis-pointing, jitter, relative motion, etc.) that cause various degrees of fading loss over various time scales. We consider a channel experiencing block fading where the channel coherence time is a lot longer than the length of a codeword. As long as the fading duration is not excessive, an interleaver can be used in a coded-communication system that randomizes the fades among symbols of multiple codewords. This achieves an “averaging” effect that spreads the signal energy more evenly among the codewords, and improves the likelihood that each of them can be decoded correctly. For simplicity, we consider a block interleaver where adjacent symbols of a codeword have a fixed delay (or separation) with each other, and investigate the error-rate performance of a coded-interleaving system (with fixed and finite interleaving depth) in the presence of block fading. Unlike prior research which assumes theoretical channel coherence models, we aim to build upon our analysis using empirical spacecraft signal measurements obtained with the Deep Space Network, and to use the fundamental theories of probability and statistics (e.g. variations of Law of Large Numbers) to quantify the error-rate performance of the coded-interleaving system. We propose to utilize these results in the design of a two-dimensional coded-interleaving system for fading channels.

Sanchez-Net, Marc↗

DOE OSTI2023

Machine-Learning Assisted Identification of Battery Life Models

Predictive battery life models are commonly utilized to extrapolate degradation trends observed during accelerated aging tests for simulation of degradation in real-world applications. Thus, fitting accelerated aging data as accurately as possible and with low uncertainty is crucial for making believable projections of battery lifetime, but it is challenging to identify algebraic expressions that accurately fit multivariate degradation trends. A review of models published in literature reveal some common expressions for fitting calendar aging data, which is only dependent on temperature and state-of-charge, but no consistency across many models for fitting cycle aging data, indicating the need for a statistically rigorous data driven approach for developing empirical models. This talk will describe a machine-learning assisted method for identification of predictive battery life models utilizing bilevel optimization and symbolic regression. Bilevel optimization with cross-validation is used to statistically determine cell- and stress-dependent model parameters, while symbolic regression identifies both linear and multiplicative candidate expressions to predict stress-dependent degradation rates by selecting low-order subsets of features from a generated feature library. Because model expressions are identified empirically, it is crucial to ensure resulting models behave according to physical expectations, so the stability of models for interpolation or extrapolation is interrogated qualitatively through simulation and quantitatively through cross-validation and uncertainty quantification via bootstrap resampling. This model identification approach substantially improves upon models identified purely using expert judgement in terms of both accuracy and uncertainty. Model simulation and validation is then conducted by deriving a state-equation form of the predictive model, enabling simulation of battery aging under dynamic stresses. This enables validation of the predictive battery model on lab-based tests with varying conditions or on drive-cycle or application-cycle testing protocols. Parameter uncertainty can be carried forward into model simulation, giving lifetime estimates and confidence windows for cell- or system-level lifetime. The financial impact of battery model uncertainty can be estimated by incorporating uncertainty into a technoeconomic model.

battery↗

DOE OSTI2023

SyReNN: A tool for analyzing deep neural networks

Deep Neural Networks (DNNs) are rapidly gaining popularity in a variety of important domains. Unfortunately, modern DNNs have been shown to be vulnerable to a variety of attacks and buggy behavior. This has motivated recent work in formally analyzing the properties of such DNNs. Furthermore, this paper introduces SyReNN, a tool for understanding and analyzing a DNN by computing its symbolic representation. The key insight is to decompose the DNN into linear functions. Our tool is designed for analyses using low-dimensional subsets of the input space, a unique design point in the space of DNN analysis tools. We describe the tool and the underlying theory, then evaluate its use and performance on three case studies: computing Integrated Gradients, visualizing a DNN’s decision boundaries, and repairing buggy DNNs.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Developing a robust strength model using physically-informed genetic programming

The strength of materials is influenced by a range of external conditions, such as temperature and deformation rate. Consequently, materials that demonstrate substantial variations in their mechanical behavior due to fluctuations in temperature and strain rate require complex strength models to accurately predict material performance in real-world applications. To predict such complex behavior, a robust and flexible strength model is necessary. In this work, we utilize genetic programming-based symbolic regression (GPSR) to develop data-driven strength models that accurately represent the measured stress–strain responses of tin across a wide range of strain, strain rate and temperature regimes. The GPSR models are constrained by physically-informed conditions, which leads to significant improvement in extrapolation. The best model is integrated into a multi-physics code to perform Taylor impact simulations, validating the model’s accuracy and robustness. In conclusion, the model predictions showed excellent agreement with experimental results, particularly when compared to predictions using traditional strength models.

Genetic programming↗

DOE OSTI2026

Locating Undocumented Wells Using Historical Oil and Gas Exploration Maps: A Case Study in Osage County, Oklahoma

Undocumented oil and gas wells lack reliable information about their locations and characteristics, making them difficult to identify. These wells can result in unanticipated delays and costs in the development of nearby surface and subsurface resources, and, if improperly plugged, can cause contamination. This study leverages historical petroleum exploration maps to locate such wells, focusing on Osage County, Oklahoma. Two sets of early 20th century oil and gas exploration maps by the United States Geological Survey were georeferenced and analyzed using a computer vision model to detect well symbols. The locations of detected wells were compared to the location of known wells in the database from the Bureau of Indian Affairs Osage Agency to identify potential undocumented wells. The analysis yielded over 500 potential undocumented wells, with dry holes constituting the largest fraction. Field verification confirmed the presence of some undocumented wells. Comparison with prior work revealed limited overlap, underscoring the complementary value of historical oil and gas maps for locating undocumented wells. This approach demonstrates the utility of integrating historical cartographic resources with modern geospatial and machine learning techniques to improve the identification and management of undocumented wells.

Energy - Petroleum↗

DOE OSTI2020

Data-driven Detection and Early Prediction of Thermoacoustic Instability in a Multi-nozzle Combustor

Thermoacoustic instability (TAI) is a critical issue in modern lean-burn gas-turbine combustors, which is induced by a strong coupling between the resonant combustor acoustics and fluctuations in the heat release rate. This instability may lead to high-amplitude pressure waves that generate undesirable noise levels as well as fatigue stresses in mechanical structures of the combustor. The intense pressure fluctuations due to TAI may also cause large flow perturbations and possibly flow reversal that may lead to flame oscillations, flame liftoff, and even flame blow-out. Hence, there is a strong need for exercising control actions in a timely fashion to mitigate the TAI phenomena. Anomaly detection is an essential prerequisite to the design of a good controller and such a detector must be able to reliably predict a forthcoming TAI. To detect and predict the onset of a TAI from an ensemble of pressure time series, this paper investigates three data-driven methods: Fast Fourier transform (FFT), symbolic time series analysis (STSA), and hidden Markov modeling (HMM). The main focus of the paper is to make a comparative evaluation of these three anomaly detection methods for classification of the current regime of operation into stable and unstable categories as well as for real-time identification of precursors to impending instabilities with short-length time series of measured variables (e.g., pressure oscillations). Finally, the results, generated on experimental data from a multi-nozzle combustor apparatus, have been compared to evaluate the performance of FFT, STSA, and HMM methods for TAI analysis.

42 ENGINEERING↗

DOE OSTI2026

Detect the Unobservable: Abnormality Detection in mixed Autonomy for Lane Change Maneuver with Following Vehicles’ Trajectories Only

Highly Automated Vehicles (HAVs) and Advanced Driver-Assistance Systems (ADAS) are transforming modern transportation with enhanced mobility, safety, and efficiency. Despite their advantages, cybersecurity vulnerabilities in these systems can lead to abnormal behavior, posing significant risks to surrounding human-driven vehicles (HDVs) in mixed traffic environments. Here, this article addresses the challenge of detecting abnormal lateral movements of HAVs/ADAS vehicles using only trajectory profiles of following HDVs. Specifically, we propose a novel modeling approach that captures both normal and abnormal lateral behaviors through vehicle kinematics, integrated decision-making processes, vehicle control using symbolic regression for lane change vehicles. Additionally, we introduce an abnormality detection framework that relies on observable HDV data, even in occlusion scenarios. The framework evaluates the sensitivity of various car-following models to detect abnormal behaviors, providing insights into the interaction between HAVs/ADAS and HDVs in mixed autonomy systems.

Connected and Automated vehicles↗