Search NASA⌕ Search

SEARCH · Search NASA

Results for “state machine”

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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
NASA NTRS2012

Best Practices for the Application of Functional Near Infrared Spectroscopy to Operator State Sensing

Functional Near Infrared Spectroscopy (fNIRS) is an emerging neuronal measurement technique with many advantages for application in operational and training contexts. Instrumentation and protocol improvements, however, are required to obtain useful signals and produce expeditiously self-applicable, comfortable and unobtrusive headgear. Approaches for improving the validity and reliability of fNIRS data for the purpose of sensing the mental state of commercial aircraft operators are identified, and an exemplary system design for attentional state monitoring is outlined. Intelligent flight decks of the future can be responsive to state changes to optimally support human performance. Thus, the identification of cognitive performance decrement, such as lapses in operator attention, may be used to predict and avoid error-prone states. We propose that attentional performance may be monitored with fNIRS through the quantification of hemodynamic activations in cortical regions which are part of functionally-connected attention and resting state networks. Activations in these regions have been shown to correlate with behavioral performance and task engagement. These regions lie beneath superficial tissue in head regions beyond the forehead. Headgear development is key to reliably and robustly accessing locations beyond the hair line to measure functionally-connected networks across the whole head. Human subject trials using both fNIRS and functional Magnetic Resonance Imaging (fMRI) will be used to test this system. Data processing employs Support Vector Machines for state classification based on the fNIRS signals. If accurate state classification is achieved based on sensed activation patterns, fNIRS will be shown to be useful for monitoring attentional performance.

Harrivel, Angela R.↗
DOE OSTI2026

Statistical and Machine Learning Approaches to Analyzing Pipeline Incidents in the United States (2010–2024)

This study applies machine learning methods to analyze natural gas pipeline incidents in the United States using the Pipeline and Hazardous Materials Safety Administration (PHMSA) Gas Distribution Incident Dataset (2010–2024). The dataset includes over 600 variables describing incident characteristics, infrastructure attributes, and contributing factors associated with unintentional gas releases. The objective is to assess whether these features can reliably predict the underlying cause of pipeline failures. Multinomial logistic regression and Random Forest models were developed to classify incident causes, including excavation damage, corrosion, equipment failure, and natural forces. Results show that excavation damage is both the most frequent and most predictable cause, with models achieving strong performance for this category. However, when excavation damage is excluded, model accuracy declines significantly, with some models performing near random levels. Across all approaches, severe class imbalance and limited variability in key predictors constrain predictive performance. Pipeline age and diameter emerge as the most influential variables, but they provide insufficient discriminatory power to distinguish among less frequent failure types. These findings indicate that non-excavation-related incidents are rare, heterogeneous, and weakly represented in the dataset, limiting the effectiveness of machine learning classification. Overall, this study highlights the structural limitations of the PHMSA dataset for predictive modeling and underscores the need for improved data balance and feature enrichment. The results reinforce excavation damage prevention as the most impactful strategy for reducing pipeline incidents.

03 NATURAL GAS↗
DOE OSTI2024

Recent Progress on Surface Water Quality Models Utilizing Machine Learning Techniques

Surface waterbodies are heavily exposed to pollutants caused by natural disasters and human activities. Empowering sensor technologies in water quality monitoring, sufficient measurements have become available to develop machine learning (ML) models. Numerous ML models have quickly been adopted to predict water quality indicators in various surface waterbodies. This paper reviews 78 recent articles from 2022 to October 2024, categorizing water quality models utilizing ML into three groups: Point-to-Point (P2P), which estimates the current target value based on other measurements at the same time point; Sequence-to-Point (S2P), which utilizes previous time series data to predict the target value at one time point ahead; and Sequence-to-Sequence (S2S), which uses previous time series data to forecast sequential target values in the future. The ML models used in each group are classified and compared according to water quality indicators, data availability, and model performance. Widely used strategies for improving performance, including feature engineering, hyperparameter tuning, and transfer learning, are recognized and described to enhance model effectiveness. The interpretability limitations of ML applications are discussed. This review provides a perspective on emerging ML for surface water quality models.

machine learning (ML)↗
DOE OSTI2026

Constellation: The autonomous control and data acquisition system for dynamic experimental setups

The operation of instruments and detectors in laboratory or beamline environments presents a complex challenge, requiring stable operation of multiple concurrent devices, often controlled by separate hardware and software solutions. These environments frequently undergo modifications, such as the inclusion of different auxiliary devices depending on the experiment or facility, adding further complexity. The successful management of such dynamic configurations demands a flexible and robust system capable of controlling data acquisition, monitoring experimental setups, enabling seamless reconfiguration, and integrating new devices with limited effort. This paper presents Constellation, a flexible and network-distributed control and data acquisition software framework tailored to laboratory and beamline environments, that addresses the limitations of existing solutions. The framework is designed with a focus on extensibility, providing a streamlined interface for instrument integration. It supports efficient system setup via network discovery mechanisms, promotes stability through autonomous operational features, and provides comprehensive documentation and supporting tools for operators and application developers such as controllers and logging interfaces. At the core of the architectural design is the autonomy of the individual components, called satellites, which can make independent decisions about their operation and communicate these decisions to other components. This paper introduces the design principles and framework architecture of Constellation, presents the available graphical user interfaces, shares insights from initial successful deployments, and provides an outlook on future developments and applications.

Autonomy↗
DOE OSTI2025

Ansatz-Free Hamiltonian Learning with Heisenberg-Limited Scaling

Learning the unknown interactions that govern a quantum system is crucial for quantum information processing, device benchmarking, and quantum sensing. The problem, known as Hamiltonian learning, is well understood under the assumption that interactions are local, but this assumption may not hold for arbitrary Hamiltonians. Previous methods all require high-order inverse polynomial dependency with precision, unable to surpass the standard quantum limit and reach the gold-standard Heisenberg-limited scaling. Whether Heisenberg-limited Hamiltonian learning is possible without prior assumptions about the interaction structures, a challenge we term ansatz-free Hamiltonian learning , remains an open question. In this work, we present a quantum algorithm to learn arbitrary sparse Hamiltonians without any structure constraints using only black-box queries of the system’s real-time evolution and minimal digital controls to attain Heisenberg-limited scaling in estimation error. Our method is also resilient to state-preparation-and-measurement errors, enhancing its practical feasibility. We numerically demonstrate our ansatz-free protocol for learning physical Hamiltonians and validating analog quantum simulations, benchmarking our performance against the state-of-the-art Heisenberg-limited learning approach. Moreover, we establish a fundamental trade-off between total evolution time and quantum control on learning arbitrary interactions, revealing the intrinsic interplay between controllability and total evolution-time complexity for any learning algorithm. These results pave the way for further exploration into Heisenberg-limited Hamiltonian learning in complex quantum systems under minimal assumptions, potentially enabling new benchmarking and verification protocols.

machine learning↗
DOE OSTI2026

Predicting Adaptively Chosen Observables in Quantum Systems

Recent advances have demonstrated that 𝒪⁡(log 𝑀) measurements suffice to predict 𝑀 properties of arbitrarily large quantum many-body systems. However, these remarkable findings assume that the properties to be predicted are chosen independently of the data. This assumption can be violated in practice, where scientists adaptively select properties after looking at previous predictions. This work investigates the adaptive setting for three classes of observables: local, Pauli, and bounded-Frobenius-norm observables. We prove that Ω⁡(√𝑀) samples of an arbitrarily large unknown quantum state are necessary to predict expectation values of 𝑀 adaptively chosen local and Pauli observables, where the system size scales exponentially and polynomially in 𝑀, respectively. We also present computationally efficient algorithms that achieve this information-theoretic lower bound. In contrast, for bounded-Frobenius-norm observables, we devise an algorithm requiring only 𝒪⁡(log 𝑀) samples, independent of system size. These results highlight the potential pitfalls of adaptivity in analyzing data from quantum experiments and provide algorithmic tools to safeguard against erroneous predictions in quantum experiments.

Machine learning↗
DOE OSTI2026

Scalability Analysis of Quantum Models for Stress and Emotion Detection

Stress and emotion detection from high-dimensional physiological signals is a challenging task, particularly when aiming for accurate classification across diverse behavioral states. Quantum machine learning (QML) is promising for modeling such high-dimensional data, but scalability is limited by qubit resources and the exponential cost of classical statevector simulation. This work studies the scalability of quantum support vector machines (QSVMs) for binary stress detection and three-class emotion recognition (Negative/Neutral/Positive) under varying qubit counts and angle-encoding strategies. We also present a comparison study with one-feature-per-qubit (1:1) and two-features-per-qubit (2:1) mappings. Experiments are executed on HPC infrastructure using NVIDIA CUDA-Q to evaluate performance, variance, and class-dependent separability at higher-qubit setups. Results show that larger Hilbert spaces can improve peak accuracy but may increase instability. At the same time, dense 2:1 encoding yields more consistent stress detection performance. For emotion recognition, scaling improves discrimination for classes like Negative and Positive more than Neutral. We find that effective QML scaling is task-dependent and benefits more from encoding design than simply increasing qubit count.

Onim, Md. Saif Hassan [University of Tennessee, Kn↗
NASA NTRS1996

Redesigned Gas Mass Flow Sensors for Space Shuttle Pressure Control System and Fuel Cell System

A program was conducted to determine if a state of the art micro-machined silicon solid state flow sensor could be used to replace the existing space shuttle orbiter flow sensors. The rather aggressive goal was to obtain a new sensor which would also be a multi-gas sensor and operate over a much wider flow range and with a higher degree of accuracy than the existing sensors. Two types of sensors were tested. The first type was a venturi throat design and the second was a bypass design. The accuracy of venturi design was found to be marginally acceptable. The bypass sensor was much better although it still did not fully reach the accuracy goal. Two main problems were identified which would require further work.

Source record↗
NASA NTRS2003

New Pulsars from Arecibo Drift Scan Searches

We report new pulsars discovered in drift-scan data taken by two collaborations (Berkeley/Cornell and STScI/NAIC) during the latter stages of the Arecibo upgrade period. The data were taken with the Penn State Pulsar Machine and are being processed on the COBRA cluster at Jodrell Bank. Processing is roughly 70% complete and has resulted in the detection of 10 new and 31 known pulsars, in addition to a number of pulsar candidates. The 10 new pulsars include one pulsar with a spin-period of 55 ms and another with a spin period of 5.8 ms. At the completion of the processing, we expect to have discovered roughly 20 new pulsars. All new pulsars are being subjected to a program of followup observations at Arecibo to determine spin and astrometric parameters.

McLaughlin, M. A.↗
NASA NTRS2003

Planets Around Neutron Stars

The objective of this proposal was to continue investigations of neutron star planetary systems in an effort to describe and understand their origin, orbital dynamics, basic physical properties and their relationship to planets around normal stars. This research represents an important element of the process of constraining the physics of planet formation around various types of stars. The research goals of this project included long-term timing measurements of the planets pulsar, PSR B1257+12, to search for more planets around it and to study the dynamics of the whole system, and sensitive searches for millisecond pulsars to detect further examples of old, rapidly spinning neutron stars with planetary systems. The instrumentation used in our project included the 305-m Arecibo antenna with the Penn State Pulsar Machine (PSPM), the 100-m Green Bank Telescope with the Berkeley- Caltech Pulsar Machine (BCPM), and the 100-m Effelsberg and 64-m Parkes telescopes equipped with the observatory supplied backend hardware.

Wolszczan, Alexander↗
NASA NTRS2011

Checking Flight Rules with TraceContract: Application of a Scala DSL for Trace Analysis

Typically during the design and development of a NASA space mission, rules and constraints are identified to help reduce reasons for failure during operations. These flight rules are usually captured in a set of indexed tables, containing rule descriptions, rationales for the rules, and other information. Flight rules can be part of manual operations procedures carried out by humans. However, they can also be automated, and either implemented as on-board monitors, or as ground based monitors that are part of a ground data system. In the case of automated flight rules, one considerable expense to be addressed for any mission is the extensive process by which system engineers express flight rules in prose, software developers translate these requirements into code, and then both experts verify that the resulting application is correct. This paper explores the potential benefits of using an internal Scala DSL for general trace analysis, named TRACECONTRACT, to write executable specifications of flight rules. TRACECONTRACT can generally be applied to analysis of for example log files or for monitoring executing systems online.

temporal logic↗
NASA NTRS2012

Quantified Event Automata: Towards Expressive and Efficient Runtime Monitors

Runtime verification is the process of checking a property on a trace of events produced by the execution of a computational system. Runtime verification techniques have recently focused on parametric specifications where events take data values as parameters. These techniques exist on a spectrum inhabited by both efficient and expressive techniques. These characteristics are usually shown to be conflicting - in state-of-the-art solutions, efficiency is obtained at the cost of loss of expressiveness and vice-versa. To seek a solution to this conflict we explore a new point on the spectrum by defining an alternative runtime verification approach.We introduce a new formalism for concisely capturing expressive specifications with parameters. Our technique is more expressive than the currently most efficient techniques while at the same time allowing for optimizations.

state machines↗
NASA NTRS2013

Wear and Reactivity Studies of Melt infiltrated Ceramic Matrix Composite

As interest grows in the use of ceramic matrix composites (CMCs) for critical gas turbine engine components, the effects of the CMCs interaction with the adjoining structure needs to be understood. A series of CMC/material couples were wear tested in a custom elevated temperature test rig and tested as diffusion couples, to identify interactions. Specifically, melt infiltrated silicon carbide/silicon carbide (MI SiC/SiC) CMC was tested in combination with a nickel-based super alloy, Waspaloy, a thermal barrier coating, Yttria Stabilized Zirconia (YSZ), and a monolithic ceramic, silicon nitride (Si3N4). To make the tests more representative of actual hardware, the surface of the CMC was kept in the as-received state (not machined) with the full surface features/roughness present. Test results include: scanning electron microscope characterization of the surfaces, micro-structural characterization, and microprobe analysis.

Jarmon, David C.↗
NASA NTRS2014

Data Automata in Scala

The field of runtime verification has during the last decade seen a multitude of systems for monitoring event sequences (traces) emitted by a running system. The objective is to ensure correctness of a system by checking its execution traces against formal specifications representing requirements. A special challenge is data parameterized events, where monitors have to keep track of the combination of control states as well as data constraints, relating events and the data they carry across time points. This poses a challenge wrt. efficiency of monitors, as well as expressiveness of logics. Data automata is a form of automata where states are parameterized with data, supporting monitoring of data parameterized events. We describe the full details of a very simple API in the Scala programming language, an internal DSL (Domain-Specific Language), implementing data automata. The small implementation suggests a design pattern. Data automata allow transition conditions to refer to other states than the source state, and allow target states of transitions to be inlined, offering a temporal logic flavored notation. An embedding of a logic in a high-level language like Scala in addition allows monitors to be programmed using all of Scala's language constructs, offering the full flexibility of a programming language. The framework is demonstrated on an XML processing scenario previously addressed in related work.

runtime verification↗