Search NASA⌕ Search

SEARCH · Search NASA

Results for “probabilistic representations”

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 37 records · Page 2

Probabilistic Sensitivity Analyses Incorporating Surrogate Models for the Structural Response of a Representative Inflatable Space Structure

This study concentrates on results from probabilistic analysis and numerical simulation tools to identify parameter sensitivities and assess surrogate model suitability for a novel inflatable airlock concept, specifically the Non-Axisymmetric Inflatable Pressure Structure (NAIPS) under NASA's Minimalistic Advanced Softgoods Hatch (MASH) Program. The current studies extended the demonstration of probabilistic analysis tools to identify parameter sensitivities by: incorporating nonlinear material load-strain property curves and orthotropic representation of the fabric; and exploring the use of surrogate models to facilitate rapid evaluations as new information becomes available, as well as enable optimizations. The airlock model has been simplified to focus on the end dome section. Brief overviews of the finite element model and associated surrogate models are provided along with the probabilistic sensitivity analysis approaches. Responses of interest include the sensitivities of various loads in the structural elements of the NAIPS to material properties, cord lengths, inflation pressure and friction between softgoods components. The use of surrogate models was explored to facilitate rapid sensitivity evaluations as parameter ranges change. The completion of the sensitivity studies improved understanding of the dependence of load responses to several uncertain parameters and confidence in the ability to use surrogate models to represent the finite element simulations.

Lyle, Karen H.↗

Image-to-Image Wildfire Detection via Quantum-Compatible Variational Segmentation from Remotely-sensed Data

Over the last decade, the incidence of wildfires has surged, causing widespread destruction globally. To better comprehend and manage these incidents, remote sensing and aerial missions have been implemented in recent efforts. However, this has resulted in an exponential rise in the amount of remote sensing data utilization, leading to a need for intelligent automation of data extraction in wildfire studies. Machine learning provides an accurate automated approach for detecting these natural anomalies and facilitates decision-makers to take prompt actions. To make insightful decisions in wildfire management, it is imperative to move beyond simple detection and explore the potential of probabilistic generative machine learning for creating "what-if" scenarios for various wildfire conditions. Such models offer improved representation of the stochastic nature of wildfire events. However, the optimization of these models can be computationally expensive, especially when using classical computers. Quantum computers have recently emerged as a promising solution to reduce the computational cost of training such models and improve their performance. In this study, we aim to utilize quantum-compatible machine learning techniques to implement our probabilistic generative approach. To that end, we propose a supervised probabilistic variational model consisting of a U-NET-based image-to-image component along with encoder and decoder networks which work as a variational autoencoder (VAE) component. Additionally, we explore the type of latent distribution type in the VAE component and implement different means for modeling the prior distribution. We further investigate the quantum-compatible versions of the model compared to the classical counterpart and benchmark potential benefits of quantum compatibility over the classical model.

quantum machine learning↗

Model checking

Automatic formal verification methods for finite-state systems, also known as model-checking, successfully reduce labor costs since they are mostly automatic. Model checkers explicitly or implicitly enumerate the reachable state space of a system, whose behavior is described implicitly, perhaps by a program or a collection of finite automata. Simple properties, such as mutual exclusion or absence of deadlock, can be checked by inspecting individual states. More complex properties, such as lack of starvation, require search for cycles in the state graph with particular properties. Specifications to be checked may consist of built-in properties, such as deadlock or 'unspecified receptions' of messages, another program or implicit description, to be compared with a simulation, bisimulation, or language inclusion relation, or an assertion in one of several temporal logics. Finite-state verification tools are beginning to have a significant impact in commercial designs. There are many success stories of verification tools finding bugs in protocols or hardware controllers. In some cases, these tools have been incorporated into design methodology. Research in finite-state verification has been advancing rapidly, and is showing no signs of slowing down. Recent results include probabilistic algorithms for verification, exploitation of symmetry and independent events, and the use symbolic representations for Boolean functions and systems of linear inequalities. One of the most exciting areas for further research is the combination of model-checking with theorem-proving methods.

Dill, David L.↗

Unifying Model-Based and Reactive Programming within a Model-Based Executive

Real-time, model-based, deduction has recently emerged as a vital component in AI's tool box for developing highly autonomous reactive systems. Yet one of the current hurdles towards developing model-based reactive systems is the number of methods simultaneously employed, and their corresponding melange of programming and modeling languages. This paper offers an important step towards unification. We introduce RMPL, a rich modeling language that combines probabilistic, constraint-based modeling with reactive programming constructs, while offering a simple semantics in terms of hidden state Markov processes. We introduce probabilistic, hierarchical constraint automata (PHCA), which allow Markov processes to be expressed in a compact representation that preserves the modularity of RMPL programs. Finally, a model-based executive, called Reactive Burton is described that exploits this compact encoding to perform efficIent simulation, belief state update and control sequence generation.

Williams, Brian C.↗

Probabilistic Models for Solar Particle Events

Probabilistic Models of Solar Particle Events (SPEs) are used in space mission design studies to provide a description of the worst-case radiation environment that the mission must be designed to tolerate.The models determine the worst-case environment using a description of the mission and a user-specified confidence level that the provided environment will not be exceeded. This poster will focus on completing the existing suite of models by developing models for peak flux and event-integrated fluence elemental spectra for the Z>2 elements. It will also discuss methods to take into account uncertainties in the data base and the uncertainties resulting from the limited number of solar particle events in the database. These new probabilistic models are based on an extensive survey of SPE measurements of peak and event-integrated elemental differential energy spectra. Attempts are made to fit the measured spectra with eight different published models. The model giving the best fit to each spectrum is chosen and used to represent that spectrum for any energy in the energy range covered by the measurements. The set of all such spectral representations for each element is then used to determine the worst case spectrum as a function of confidence level. The spectral representation that best fits these worst case spectra is found and its dependence on confidence level is parameterized. This procedure creates probabilistic models for the peak and event-integrated spectra.

Adams, James H., Jr.↗

Efficient algorithms for use in probabilistic finite element analysis

This paper investigates the use of Fast Probability Integration (FPI) algorithms in a Finite Element environment. A method allowing the representation of correlated fields in terms of a vector of uncorrelated transformed variables, based on the spectral decomposition of the variance-covariance matrix is developed. The response of the deterministic model corresponding to selected perturbations of these uncorrelated variables is then obtained via a Newton-type iterative scheme. The results of the perturbed problems are used to construct a local representation of the model's behavior in the neighborhood of the deterministic state, which the FPI algorithm will use to estimate the reliability of the system. Although the proposed strategy has thus far only been applied to linear elastostatics, the extension of the method to a broader class of problems appears to be feasible.

Dias, J. B.↗

Probabilistic Risk Assessment for Decision Making During Spacecraft Operations

Decisions made during the operational phase of a space mission often have significant and immediate consequences. Without the explicit consideration of the risks involved and their representation in a solid model, it is very likely that these risks are not considered systematically in trade studies. Wrong decisions during the operational phase of a space mission can lead to immediate system failure whereas correct decisions can help recover the system even from faulty conditions. A problem of special interest is the determination of the system fault protection strategies upon the occurrence of faults within the system. Decisions regarding the fault protection strategy also heavily rely on a correct understanding of the state of the system and an integrated risk model that represents the various possible scenarios and their respective likelihoods. Probabilistic Risk Assessment (PRA) modeling is applicable to the full lifecycle of a space mission project, from concept development to preliminary design, detailed design, development and operations. The benefits and utilities of the model, however, depend on the phase of the mission for which it is used. This is because of the difference in the key strategic decisions that support each mission phase. The focus of this paper is on describing the particular methods used for PRA modeling during the operational phase of a spacecraft by gleaning insight from recently conducted case studies on two operational Mars orbiters. During operations, the key decisions relate to the commands sent to the spacecraft for any kind of diagnostics, anomaly resolution, trajectory changes, or planning. Often, faults and failures occur in the parts of the spacecraft but are contained or mitigated before they can cause serious damage. The failure behavior of the system during operations provides valuable data for updating and adjusting the related PRA models that are built primarily based on historical failure data. The PRA models, in turn, provide insight into the effect of various faults or failures on the risk and failure drivers of the system and the likelihood of possible end case scenarios, thereby facilitating the decision making process during operations. This paper describes the process of adjusting PRA models based on observed spacecraft data, on one hand, and utilizing the models for insight into the future system behavior on the other hand. While PRA models are typically used as a decision aid during the design phase of a space mission, we advocate adjusting them based on the observed behavior of the spacecraft and utilizing them for decision support during the operations phase.

dynamic fault trees↗

Probabilistic Methods for Structural Reliability and Risk

A probabilistic method is used to evaluate the structural reliability and risk of select metallic and composite structures. The method is a multiscale, multifunctional and it is based on the most elemental level. A multi-factor interaction model is used to describe the material properties which are subsequently evaluated probabilistically. The metallic structure is a two rotor aircraft engine, while the composite structures consist of laminated plies (multiscale) and the properties of each ply are the multifunctional representation. The structural component is modeled by finite element. The solution method for structural responses is obtained by an updated simulation scheme. The results show that the risk for the two rotor engine is about 0.0001 and the composite built-up structure is also 0.0001.

Chamis, Christos C.↗

Probabilistic Methods for Structural Reliability and Risk

A probabilistic method is used to evaluate the structural reliability and risk of select metallic and composite structures. The method is a multiscale, multifunctional and it is based on the most elemental level. A multifactor interaction model is used to describe the material properties which are subsequently evaluated probabilistically. The metallic structure is a two rotor aircraft engine, while the composite structures consist of laminated plies (multiscale) and the properties of each ply are the multifunctional representation. The structural component is modeled by finite element. The solution method for structural responses is obtained by an updated simulation scheme. The results show that the risk for the two rotor engine is about 0.0001 and the composite built-up structure is also 0.0001.

Chamis, Christos C.↗

UQTools: The Uncertainty Quantification Toolbox - Introduction and Tutorial

UQTools is the short name for the Uncertainty Quantification Toolbox, a software package designed to efficiently quantify the impact of parametric uncertainty on engineering systems. UQTools is a MATLAB-based software package and was designed to be discipline independent, employing very generic representations of the system models and uncertainty. Specifically, UQTools accepts linear and nonlinear system models and permits arbitrary functional dependencies between the system s measures of interest and the probabilistic or non-probabilistic parametric uncertainty. One of the most significant features incorporated into UQTools is the theoretical development centered on homothetic deformations and their application to set bounding and approximating failure probabilities. Beyond the set bounding technique, UQTools provides a wide range of probabilistic and uncertainty-based tools to solve key problems in science and engineering.

Kenny, Sean P.↗

Probabilistic Scale-Space Filtering Program

Probabilistic Scale-Space Filtering (PSF) computer program implements scale-space technique to describe input signals as collections of nested hills and valleys organized in treelike structure. Helps to construct sparse representations of complicated signals. Calculates probabilities, with extracted features corresponding to physical processes. Written in C language (49 percent) and Common Lisp (51 percent).

Kulkarni, Deepak↗

Wildfire Segmentation From Remotely Sensed Data Using Quantum-Compatible Conditional Vector Quantized-Variational Autoencoders

Wildfires represent a critical environmental hazard with multifaceted implications for ecosystems, communities, and public health [1]. The escalating frequency and intensity of wildfires globally have intensified the urgency for robust segmentation methodologies to facilitate effective mitigation, response, and recovery strategies [2]. Accurate wildfire segmentation is pivotal for delineating fire boundaries, assessing progression patterns, and prioritizing resource allocation during emergency scenarios. Furthermore, precise segmentation enables stakeholders, including policymakers, environmental scientists, and emergency responders, to formulate evidence-based strategies, thereby minimizing socio-economic disruptions and ecological degradation. Consequently, advancing wildfire segmentation techniques through innovative technological interventions remains a paramount research imperative. Although foundational in wildfire segmentation, traditional deterministic models exhibit inherent limitations that compromise their efficacy in dynamic and uncertain environments. These models often operate on rigid algorithms prioritizing deterministic classifications, thereby overlooking the inherent complexities and uncertainties associated with wildfire behavior and satellite data variability. Such deterministic frameworks tend to produce oversimplified representations that fail to capture the intricate nuances of evolving fire dynamics, spatial heterogeneity, and environmental interactions [1]. Consequently, the deterministic approach’s propensity for uncertainty collapsing [1, 3] hampers the accuracy, reliability, and applicability of segmentation outcomes in real-world scenarios. Contrastingly, stochastic models offer a more nuanced and adaptable framework for wildfire segmentation. By integrating probabilistic elements into the modeling paradigm, stochastic approaches, particularly probabilistic approaches such as variational auto encoders (VAEs) [4], facilitate comprehensive uncertainty assessment, enabling researchers to quantify and incorporate uncertainties into segmentation outcomes effectively. This probabilistic nature empowers stochastic models to encapsulate variability, account for data inconsistencies, and adapt to evolving environmental conditions, enhancing segmentation accuracy, reliability, and robustness. Embracing stochastic methodologies thus catalyzes advancements in wildfire science by fostering a more holistic, adaptive, and resilient segmentation framework. Despite VAEs demonstrating significant promise in various applications, they come with inherent limitations that have garnered attention within the machine learning community. One of the primary drawbacks lies in their reliance on static priors, which essentially assume a fixed distribution for latent variables, thereby limiting the model’s flexibility to capture complex data structures effectively [5]. This static nature leads to suboptimal representations, especially when dealing with complex and high-dimensional data. Additionally, VAEs often struggle with generating sharp and realistic samples, a phenomenon commonly referred to as mode collapse [5, 7, 6]. Furthermore, the optimization process in VAEs, which involves balancing the reconstruction loss and the regularization term, can sometimes be challenging to fine-tune [7]. In recent efforts to address these shortcomings, alternative approaches like Vector Quantized Variational Auto encoders(VQ-VAEs) [7], address the challenges by incorporating discrete latent variables and leveraging techniques that enhance the quality and diversity of generated samples while maintaining efficient training dynamics. VQ-VAEs propose a dynamic prior distribution generation mechanism that diverges from the static priors commonly associated with traditional VAEs. This dynamic approach allows for more adaptive and context-aware latent variable representations, thereby potentially capturing complex data structures more effectively. Unlike autoregressive prior models such as PixelCNN, which, despite their ability to model dependencies across data dimensions, suffer from significant computational inefficiencies and lack flexibility in handling diverse datasets. In our work, we propose to use a generative quantum-compatible approach to help alleviate the shortcomings of autoregressive prior model in VQ-VAEs. Restricted Boltzmann Machines (RBMs) are a viable alternative prior model that can learn prior distributions in a faster and more flexible manner. In this research endeavor, we meticulously curate a state-of-the-art dataset leveraging satellite MODIS data in conjunction with VIIRS fire masks, derived from Fire Radiative Power (FRP), thereby encapsulating diverse wildfire scenarios and environmental contexts. We developed a conditional VQ-VAE architecture with the RBM prior model that is trained in a supervised manner for segmenting wildfire masks. This innovative approach synergistically harnesses deep learning capabilities, enabling the generation of segmentation maps characterized by heightened precision, granularity, and contextual relevance. Furthermore, replacing the autoregressive prior learning method proposed by the original VQ-VAE with a prior density approximation via quantum-compatible RBM facilitates expedited inference processes, augments flexibility in prior sampling, optimizes computational efficiency and establishes a groundbreaking benchmark in wildfire segmentation methodologies.

quantum machine learning↗

Modeling, Analyzing, and Mitigating Dissonance Between Alerting Systems

Alerting systems are becoming pervasive in process operations, which may result in the potential for dissonance or conflict in information from different alerting systems that suggests different threat levels and/or actions to resolve hazards. Little is currently available to help in predicting or solving the dissonance problem. This thesis presents a methodology to model and analyze dissonance between alerting systems, providing both a theoretical foundation for understanding dissonance and a practical basis from which specific problems can be addressed. A state-space representation of multiple alerting system operation is generalized that can be tailored across a variety of applications. Based on the representation, two major causes of dissonance are identified: logic differences and sensor error. Additionally, several possible types of dissonance are identified. A mathematical analysis method is developed to identify the conditions for dissonance originating from logic differences. A probabilistic analysis methodology is developed to estimate the probability of dissonance originating from sensor error, and to compare the relative contribution to dissonance of sensor error against the contribution from logic differences. A hybrid model, which describes the dynamic behavior of the process with multiple alerting systems, is developed to identify dangerous dissonance space, from which the process can lead to disaster. Methodologies to avoid or mitigate dissonance are outlined. Two examples are used to demonstrate the application of the methodology. First, a conceptual In-Trail Spacing example is presented. The methodology is applied to identify the conditions for possible dissonance, to identify relative contribution of logic difference and sensor error, and to identify dangerous dissonance space. Several proposed mitigation methods are demonstrated in this example. In the second example, the methodology is applied to address the dissonance problem between two air traffic alert and avoidance systems: the existing Traffic Alert and Collision Avoidance System (TCAS) vs. the proposed Airborne Conflict Management system (ACM). Conditions on ACM resolution maneuvers are identified to avoid dynamic dissonance between TCAS and ACM. Also included in this report is an Appendix written by Lee Winder about recent and continuing work on alerting systems design. The application of Markov Decision Process (MDP) theory to complex alerting problems is discussed and illustrated with an abstract example system.

Song, Lixia↗

Applying Simulated Annealing to Problems in Model-Based Diagnosis

Generating all diagnoses is computationally intractable. Therefore, many of the state-of-the-art approaches are incomplete. Quantum computers may however offer a solution. The first commercially available quantum computer is being used to minimize polynomials that are difficult for classical simulated annealing but easy for quantum annealing. All problems in Model-based Diagnosis (MBD) can be transformed into a polynomial minimization problem, allowing one to apply a quantum algorithm called quantum annealing to solve MBD problems. To better understand the need for this quantum approach, we designed two simulated annealingdiagnostic algorithms tailored to run on a polynomial representation of MBD. These algorithms differ on their policy for random neighborhood variable selection. In addition, enhanced metrics were devised to provide more diagnostic coverage. Finally, these two simulated annealing algorithms were analyzed and empirically evaluated and compared against state-of-the-art probabilistic methods for MBD such as SAFARI using ISCAS-85.

Simulated annealing↗

Thoughts Without Content are Empty, Intuitions Without Concepts are Blind - Determinism and Contingency Revisited

Was the emergence of life a predictable outcome of chemical evolution on earth? Could evolution produce life very different from ours? These are one of the oldest questions in the field of the origin of life that not only have broad philosophical implications but also impact how we approach the problem from the methodological standpoint. Framing the issue in terms of the dichotomy between contingency and determinism is not a fortunate because these two terms in their conventional meaning are neither mutually exclusive nor jointly exhaustive. Determinism, represented in natural sciences by Newtonian physics, relies on the assumption that every event is causally determined by a chain of previous events. In the context of the origin of life it means that once the initial conditions on the early earth have been specified further evolution follows inevitably. Considering uncertainties about conditions on the prebiotic earth, many plausible sets of initial conditions can be defined, each followed by a separate deterministic trajectory. This conventional understanding of determinism does not admit contingency. Further, it has no implications for evaluating how many sets of initial conditions lead to the emergence of life. It appears that a better framing of the problem is as follows: given plausible sets of initial conditions on the early earth how probable and broadly spread are evolutionary trajectories that lead to life? Instead of undertaking an impossible task of specifying microscopic initial conditions for all components of the system one uses a reduced representation of this system and specify only a small set of essential macroscopic parameters, values (or ranges of values) of which can be identified, inferred or estimated from experiment, theory or historical record. The following evolutionary trajectories are still governed by laws of physics and chemistry but become probabilistic and "contingency" is admitted as variations in other variables in the system. A similar reasoning is common in other fields of science, for example in statistical mechanics. Some trajectories lead to life, perhaps in different forms, whereas others do not. Of our true interest is the ratio of these two outcomes. The issue of determinism does not directly enter the picture. The debate about the likelihood of the emergence of life is quite old. One view holds that the origin of life is an event governed by chance, and the result of so many random events (contingencies) is unpredictable. This view was eloquently expressed by Monod. In his book "Chance or Necessity" he argued that life was a product of "nature's roulette." In an alternative view, expressed in particular by deDuve and Morowitz, the origin of life is considered a highly probable or even inevitable event (although its details need not be determined in every respect). Only in this sense the origin of life can be considered a "deterministic event".

Pohorille, Andrew↗

Wind models for flight simulator certification of landing and approach guidance and control systems

The definition of a model suitable for certification was the main objective of this report. The model was designed to simplify and reduce the wind model parameters to enable evaluation of a large number of aircraft and control system design parameters. Analytical descriptions of wind phenomena were presented. For those parameters defying analytic description, probabilistic descriptions were sought. A brief analysis of the effects of wind on aircraft motion was conducted. The axes transformations required between wind and turbulence components in their inherent axis system and in the airplane's axis system were shown. Techniques of providing a random process on computers for the representation of turbulence were presented. A simulation model was presented that combines all the foregoing components.

Schaeffer, D. R.↗

Probabilistic finite elements for fatigue and fracture analysis

An overview of the probabilistic finite element method (PFEM) developed by the authors and their colleagues in recent years is presented. The primary focus is placed on the development of PFEM for both structural mechanics problems and fracture mechanics problems. The perturbation techniques are used as major tools for the analytical derivation. The following topics are covered: (1) representation and discretization of random fields; (2) development of PFEM for the general linear transient problem and nonlinear elasticity using Hu-Washizu variational principle; (3) computational aspects; (4) discussions of the application of PFEM to the reliability analysis of both brittle fracture and fatigue; and (5) a stochastic computational tool based on stochastic boundary element (SBEM). Results are obtained for the reliability index and corresponding probability of failure for: (1) fatigue crack growth; (2) defect geometry; (3) fatigue parameters; and (4) applied loads. These results show that initial defect is a critical parameter.

Belytschko, Ted↗

A Probabilistic Framework for the Validation and Certification of Computer Simulations

The paper presents a methodology for quantifying, propagating, and managing the uncertainty in the data required to initialize computer simulations of complex phenomena. The purpose of the methodology is to permit the quantitative assessment of a certification level to be associated with the predictions from the simulations, as well as the design of a data acquisition strategy to achieve a target level of certification. The value of a methodology that can address the above issues is obvious, specially in light of the trend in the availability of computational resources, as well as the trend in sensor technology. These two trends make it possible to probe physical phenomena both with physical sensors, as well as with complex models, at previously inconceivable levels. With these new abilities arises the need to develop the knowledge to integrate the information from sensors and computer simulations. This is achieved in the present work by tracing both activities back to a level of abstraction that highlights their commonalities, thus allowing them to be manipulated in a mathematically consistent fashion. In particular, the mathematical theory underlying computer simulations has long been associated with partial differential equations and functional analysis concepts such as Hilbert spares and orthogonal projections. By relying on a probabilistic framework for the modeling of data, a Hilbert space framework emerges that permits the modeling of coefficients in the governing equations as random variables, or equivalently, as elements in a Hilbert space. This permits the development of an approximation theory for probabilistic problems that parallels that of deterministic approximation theory. According to this formalism, the solution of the problem is identified by its projection on a basis in the Hilbert space of random variables, as opposed to more traditional techniques where the solution is approximated by its first or second-order statistics. The present representation, in addition to capturing significantly more information than the traditional approach, facilitates the linkage between different interacting stochastic systems as is typically observed in real-life situations.

Ghanem, Roger↗