Search NASA⌕ Search

SEARCH · Search NASA

Results for “Causal mechanism graph”

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.

Causal Mechanism Graph – A new notation for capturing cause-effect knowledge in software dependability

Understanding cause-effect relations between concepts in software dependability engineering is fundamental to various research or industrial activities. Cognitive maps are traditionally used to elicit and represent such knowledge; however they seem incapable of accurately representing complex causal mechanisms in dependability engineering. Here, this paper proposes a new notation called Causal Mechanism Graph (CMG) to elicit and represent the cause-effect domain knowledge embedded in experts’ minds or described in the literature. CMG contains a new set of symbols elicited from domain experts to capture the recurring interaction mechanisms between multiple concepts in software dependability engineering. Furthermore, compared to major existing graphic methods, CMG is particularly robust and suitable for mental knowledge elicitation: it allows one to represent the full range of cause-effect knowledge, accurately or fuzzily as one sees fit depending on the depth of knowledge he/she has. This feature combined with excellent reliability and validity poses CMG as a promising method that has the potential to be used in various areas, such as software dependability requirement elicitation, software dependability assessment and dependability risk control.

42 ENGINEERING↗

Final Technical Report on Quantifying Dependability Attributes of Software Based Safety Critical Instrumentation and Control Systems in Nuclear Power Plants

With the current transition from analog to digital instrumentation and control systems in nuclear power plants, the number and variety of software-based systems have significantly increased. The sophisticated nature and increasing complexity of software raises trust in these systems as a significant challenge. The trust placed in a software system is typically termed software dependability. Software dependability analysis faces uncommon challenges since software systems’ characteristics differ from those of hardware systems. The lack of systematic science-based methods for quantifying the dependability attributes in software-based instrumentation as well as control systems in safety critical applications has proved itself to be a significant inhibitor to the expanded use of modern digital technology in the nuclear industry. Dependability refers to the ability of a system to deliver a service that can be trusted. Dependability is commonly considered as a general concept that encompasses different attributes, e.g., reliability, safety, security, availability and maintainability. Dependability research has progressed significantly over the last few decades. For example, various assessment models and/or design approaches have been proposed for software reliability, software availability and software maintainability. Advances have also been made to integrate multiple dependability attributes, e.g., integrating security with other dependability attributes, measuring availability and maintainability, modeling reliability and availability, quantifying reliability and security, exploring the dependencies between security and safety and developing integrated analysis models. However, there is still a lack of understanding of the dependencies between various dependability attributes as a whole and of how such dependencies are formed. To address the need for quantification and give a more objective basis to the review process -- therefore reducing regulatory uncertainty -- measures and methods are needed to assess dependability attributes early on, as well as throughout the life-cycle process of software development. In this research, extensive expert opinion elicitation is used to identify the measures and methods for assessing software dependability. Semi-structured questionnaires were designed to elicit expert knowledge. A new notation system, Causal Mechanism Graphing, was developed to extract and represent such knowledge. The Causal Mechanism Graphs were merged, thus, obtaining the consensus knowledge shared by the domain experts. In this report, we focus on how software contributes to dependability. However, software dependability is not discussed separately from the context of systems or socio-technical systems. Specifically, this report focuses on software dependability, reliability, safety, security, availability, and maintainability. Our research was conducted in the sequence of stages found below. Each stage is further examined in its corresponding chapter. Stage 1 (Chapter 2): Elicitation of causal maps describing the dependencies between dependability attributes. These causal maps were constructed using expert opinion elicitation. This chapter describes the expert opinion elicitation process, the questionnaire design, the causal map construction method and the causal maps obtained. Stage 2 (Chapter 3): Elicitation of the causal map describing the occurrence of the event of interest for each dependability attribute. The causal mechanisms for the “event of interest” were extracted for each of the software dependability attributes. The “event of interest” for a dependability attribute is generally considered to be the “attribute failure”, e.g. security failure. The extraction was based on the analysis of expert elicitation results obtained in Stage 1. Stage 3 (Chapter 4): Identification of relevant measurements. Measures for the “events of interest” and their causal mechanisms were obtained from expert opinion elicitation for each of the software dependability attributes. The measures extracted are presented in this chapter. Stage 4 (Chapter 5): Assessment of the coverage of the causal maps via measures. Coverage was assessed to determine whether the measures obtained were sufficient to quantify software dependability, and what measures are further required. Stage 5 (Chapter 6): Identification of “missing” measures and measurement approaches for concepts not covered. New measures, for concepts that had not been covered sufficiently as determined in Stage 4, were identified using supplementary expert opinion elicitation as well as literature reviews. Stage 6 (Chapter 7): Building of a detailed quantification model based on the causal maps and measurements obtained. Ability to derive such a quantification model shows that the causal models and measurements derived from the previous stages (Stage 1 to Stage 5) can form the technical basis for developing dependability quantification models. Scope restrictions have led us to prioritize this demonstration effort. The demonstration was focused on a critical system, i.e. the reactor protection system. For this system, a ranking of the software dependability attributes by nuclear stakeholders was developed. As expected for this application, the stakeholder ranking identified safety as the most critical attribute to be quantified. A safety quantification model limited to the requirements phase of development was built. Two case studies were conducted for verification. A preliminary control gate for software safety for the requirements stage was proposed and applied to the first case study. The control gate allows a cost effective selection of the duration of the requirements phase.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Development of A Directed Acyclic Graph for Venous Thromboembolism During Spaceflight

Introduction: Recent studies have reported the development of venous blood flow stasis in astronauts and an occlusive venous thrombosis during spaceflight. Subsequent investigations revealed approximately one quarter of surveilled crew members had some degree of blood flow stasis in the left internal jugular vein. Therefore, NASA’s Human System Risk Board now formally tracks venous thromboembolism (VTE) as a “concern” for human spaceflight. To investigate potential mechanisms by which exposures concomitant with spaceflight (e.g., microgravity, radiation) may contribute to VTE, we developed a causal diagram in the form of a directed acyclic graph (DAG). Methods: The mechanisms by which spaceflight exposures may elevate the risk of VTE and the downstream effects on mission outcomes were critically analyzed, taking into account scientific literature and subject matter expertise consultation, and a DAG was generated. A Level-of-Evidence score for each causal relationship was assigned based on assessing the literature against a set of criteria derived from the A. Bradford Hill Causal Guidelines. Results: The set of three main factors that predispose people to VTE (hypercoagulability, endothelial damage, and blood stasis) is known as Virchow’s Triad. In constructing the DAG for VTE we articulated various mechanisms by which the principal spaceflight hazards (microgravity, radiation, closed hostile environment, isolation and confinement, distance from Earth) are thought to interact with or cause the components in Virchow’s triad. We found sufficient evidence to at least speculate that fluid shifts from microgravity, compensatory alterations in hematologic indices, spaceflight atmospheric conditions, and oxidative stress/inflammation from radiation may be potential contributors to VTE development. Discussion: Developing the DAG entailed a systematic and repeatable approach for visualizing relationships between contributing factors that may lead to VTE in spaceflight. Articulating pathways linking spaceflight exposures to VTE risk factors and possible VTE development enables subject matter experts from different domains to construct a shared mental model. Assignment of levels of evidence scores to the relationships helps identify knowledge and capability gaps that should be considered for further investigation. Furthermore, the DAG highlights modifiable variables and may therefore facilitate the development of new VTE risk mitigation strategies.

Alexander Svoronos↗

A Causal Approach to Model Validation and Calibration

This poster presents a novel method for validation and verification that focuses on identifying causal relationships between data elements, moving beyond traditional statistical and machine learning approaches. These methods employ causal discovery techniques to reveal the underlying mechanisms of data generation. The research utilizes structural causal models and directed acyclic graphs to depict causal relationships. This approach assists in achieving alignment between simulation models and reality.

97 MATHEMATICS AND COMPUTING↗

A Method for Validating Causal Diagrams of Human Health Risk in Space Flight

The complexity of cause-and-effect relationships between spaceflight hazards and resulting health conditions clouds understanding of the totality of human system risk in space. In response, NASA has introduced Directed Acyclic Graphs (causal diagrams) into the human systems risk management process. These diagrams allow for a common understanding of the mechanisms that lead from unique hazards of spaceflight to the health outcomes important to agencies and astronauts. However, the paucity of available biomedical data from spaceflight creates a need for methods of validating causal models that can accommodate data from spaceflight model analogs. Here we outline one approach utilizing open-access rodent bone datasets from the Ames Life Sciences Data Archive. The properties of directed acyclic graphs themselves can provide an epistemological and statistical framework for validation of a priori causal representations of human system risk in space flight. The assumed causal connections on the graph creates sets of logical implications: variables that – if the causal diagram is correct – should be correlated, as well as sets that should be conditionally independent. By testing these implied correlations and conditional independencies both statistically and heuristically, we can provide evidence for or against specific causal pathways on the causal diagram. In addition to validation of expert-generated causal diagrams, machine learning techniques can learn the most likely structure of a causal diagram from a given dataset. Comparison with and reconciliation between machine-learned causal diagrams and expert-generated diagrams is another technique for challenging assumptions and improving our understanding of causal mechanisms. Accurately representing complex causation is essential to systemic understanding of human health risks in space travel. Having a robust system of validating causal diagrams helps us arrive at more accurate representations of causal systems. This process will be integral to developing the countermeasures necessary for extended exploration of the moon and Mars.

Robert Reynolds↗

Dirac equation with an ultraviolet cutoff and a quantum walk

The weak convergence theorems of the one- and two-dimensional simple quantum walks, SQW{sup (d)},d=1,2, show a striking contrast to the classical counterparts, the simple random walks, SRW{sup (d)}. In the SRW{sup (d)}, the distribution of position X(t) of the particle starting from the origin converges to the Gaussian distribution in the diffusion scaling limit, in which the time scale T and spatial scale L both go to infinity as the ratio L/sq root(T) is kept finite. On the other hand, in the SQW{sup (d)}, the ratio L/T is kept to define the pseudovelocity V(t)=X(t)/t, and then all joint moments of the components V{sub j}(t),1<=j<=d, of V(t) converge in the T=L->infinity limit. The limit distributions have novel structures such that they are inverted-bell shaped and their supports are bounded. In the present paper we claim that these properties of the SQW{sup (d)} can be explained by the theory of relativistic quantum mechanics. We show that the Dirac equation with a proper ultraviolet cutoff can provide a quantum walk model in three dimensions, where the walker has a four-component qubit. We clarify that the pseudovelocity V(t) of the quantum walker, which solves the Dirac equation, is identified with the relativistic velocity. Since the quantum walker should be a tardyon, not a tachyon, |V(t)|<c, where c is the speed of light, and this restriction (the causality) is the origin of the finiteness of supports of the limit distributions universally found in quantum walk models. By reducing the number of components of momentum in the Dirac equation, we obtain the limit distributions of pseudovelocities for the lower dimensional quantum walks. We show that the obtained limit distributions for the one- and two-dimensional systems have common features with those of SQW{sup (1)} and SQW{sup (2)}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Verification, Validation, and Calibration Through a Causal Lens

While typical validation and verification approaches focus on identifying the associations between data elements using statistical and machine learning methods, the novel methods in this paper focus instead on identifying causal relationships between data elements. Statistical and machine-learning-based approaches are strictly data-driven, meaning that they provide quantitative comparison measures between data sets without explicitly considering the hypotheses behind them. This can lead to the erroneous conclusion that, if two data sets are close enough, the models that generated them are similar. In addition, when experimental and simulated data differ to an extent that fails to meet the acceptance criteria, calibration techniques are used to tweak simulation model parameters to reduce the gap between the two types of data. This produces the false expectation that a simulation model will match reality. The methods presented in this paper move away from these strictly data-driven methods for validation and calibration toward more robust, model-driven methods based on causal inference. Causal inference aims to identify the possible mechanisms that might have generated data. Thus, this analysis targets the prediction of the effects when one (or more) of the identified mechanisms are altered. There are many approaches to identify, quantify, and illustrate causal relationships. For the scope of this paper, directed graphs are employed as causal models. If the directed graph lacks cycles, it is known as a directed acyclic graph. A node in such a graph represents an observed data element while a directed edge connecting two nodes represents a causal relationship between two variables. The developed causal methods are designed to extract causal models from simulation models and experimental data. Causal models capture the causal relationships between data elements (e.g., simulated and experimental data). In this context, validation and verification are performed by comparing causal models. The proposed approach does not only inform system analysts on how a simulation model matches real-world data, but also identifies elements of the simulation model that should be revised when discrepancies between simulation and experimental data are observed. Through these causal methods, analysts can identify the portion of the model equation(s) that are behind an edge connecting two variables. Hence, once the structural differences between causal models have been determined, model calibration can occur by changing only those model parameters that impact the identified causal relationships.

97 MATHEMATICS AND COMPUTING↗

VALIDATION, VERIFICATION, AND CALIBRATION THROUGH A CAUSAL LENS

This paper presents an alternative method based on causal inference to perform validation, verification, and calibration of simulation models. While classical validation and verification approaches focus on the identification of the associations between data elements using statistical and machine learning methods, the novel methods in this paper focus instead on the identification of causal relationships between data elements. Statistical and machine learning-based approaches are strictly data-driven, meaning that they provide quantitative comparison measures between datasets without explicitly considering the hypotheses behind them. This can lead to the erroneous conclusion that, if two data sets are close enough, then the models that generated them are similar. In addition, when experimental and simulated data differ to an extent that fails to meet the acceptance criteria, calibration techniques are used to tweak simulation model parameters to reduce the gap between the two types of data. This produces the false expectation that a simulation model will match reality. The methods presented in this paper move away from these strictly data-driven methods for validation and calibration toward more robust, model-driven methods based on causal inference. Causal inference aims to identify the possible mechanisms that might have generated data. Thus, this analysis targets the prediction of the effects when one (or more) of the identified mechanisms are altered. There are many approaches to identify, quantify and illustrate causal relationships. For the scope of this paper, directed graphs are employed as causal models. If the directed graph lacks cycles it is known as a directed acyclic graph (DAG). A node in such a graph represents an observed data element while a directed edge connecting two nodes represents a causal relationship between two variables. The developed causal methods are designed to extract causal models from simulation models and from experimental data. Causal models capture the causal relationships between data elements (e.g., simulated and experimental data). In this context, validation and verification are performed by comparing causal models. The proposed approach does not only inform system analysts on how a simulation model matches real-world data, but also identifies elements of the simulation model that should be revised when discrepancies between simulation and experimental data are observed. Through these causal methods, analysts have a means to identify the portion of the model equation(s) that are behind an edge connecting two variables. Hence, once the structural differences between causal models have been determined, model calibration can occur by changing only those model parameters that impact the identified causal relationships.

97 MATHEMATICS AND COMPUTING↗

Deep-freeze graph training for latent learning

Scientific and engineering advances are primarily driven by multi-tier conceptual constructs and conditional theoretical frameworks. The theories allow predictions of hypothetical system responses, given a set of approximate conditions (ranges of applicability) imposed on latent parameters that cannot be measured directly. Learning to estimate the latent variables (Latent Learning) helps to pinpoint the anticipated range-edge anomalies and improves the confidence in interpretation, interpolation and extrapolation of limited experimental data. Due to high dimensionality and extreme non-linearity of the materials science problems, very large datasets are typically required for conventional data-driven model development. The vital experimental data collection, particularly on microstructural phases, is very challenging, which makes it difficult to compile a high-quality database. Incorporation of the domain knowledge into the computational graph structure, initialization and optimization processes presents a viable mechanism for developing accurate models, with limited datasets. Furthermore, this study successfully utilized the approach to build the Deep Freeze Graph (DeepFreG) by mapping known causality relationships and by digitizing empirical domain knowledge for Latent Learning (LL), with specific applications in materials science.

36 MATERIALS SCIENCE↗

Integrated Framework of Multisource Data Fusion for Outage Location in Looped Distribution Systems

Accurate outage location is essential for expediting post-outage power restoration, minimizing outage duration, and enhancing the resilience of distribution networks. With the advent of advanced metering infrastructure, data-driven outage location methods have significantly advanced beyond traditional approaches that rely on manual inspections. However, existing methods still face critical challenges, like reliance on single-source data, limited ability to handle partially observable systems or difficulties with loop networks. To the best of our knowledge, no single approach has comprehensively addressed all of these challenges at once. To this end, this paper proposes a comprehensive multisource data fusion framework for outage locations via probabilistic graph networks. The framework consists of three key phases. First, a novel method for reconstituting distribution networks with loops is developed, transforming looped networks into multiple radial subnetworks that retain all outage causalities of the original network. Second, Bayesian network (BN) models are established for each subnetwork, integrating multiple data sources and network structures. Finally, a joint Gibbs sampling mechanism, featuring forward and backward information flow, is designed to merge data from separate BN models and maximize the utilization of limited evidence, ensuring accurate outage location identification. In conclusion, the framework was validated on two modified public test systems, and comparative studies confirmed its effectiveness.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Quantum Bose-Hubbard model with an evolving graph as a toy model for emergent spacetime

We present a toy model for interacting matter and geometry that explores quantum dynamics in a spin system as a precursor to a quantum theory of gravity. The model has no a priori geometric properties; instead, locality is inferred from the more fundamental notion of interaction between the matter degrees of freedom. The interaction terms are themselves quantum degrees of freedom so that the structure of interactions and hence the resulting local and causal structures are dynamical. The system is a Hubbard model where the graph of the interactions is a set of quantum evolving variables. We show entanglement between spatial and matter degrees of freedom. We study numerically the quantum system and analyze its entanglement dynamics. We analyze the asymptotic behavior of the classical model. Finally, we discuss analogues of trapped surfaces and gravitational attraction in this simple model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Group velocity of discrete-time quantum walks

We show that certain types of quantum walks can be modeled as waves that propagate in a medium with phase and group velocities that are explicitly calculable. Since the group and phase velocities indicate how fast wave packets can propagate causally, we propose the use of these wave velocities in our definition for the hitting time of quantum walks. Our definition of hitting time has the advantage that it requires neither the specification of a walker's initial condition nor of an arrival probability threshold. We give full details for the case of quantum walks on the Cayley graphs of Abelian groups. This includes the special cases of quantum walks on the line and on hypercubes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Codiscovering graphical structure and functional relationships within data: A Gaussian Process framework for connecting the dots

Most problems within and beyond the scientific domain can be framed into one of the following three levels of complexity of function approximation. Type 1: Approximate an unknown function given input/output data. Type 2: Consider a collection of variables and functions, some of which are unknown, indexed by the nodes and hyperedges of a hypergraph (a generalized graph where edges can connect more than two vertices). Given partial observations of the variables of the hypergraph (satisfying the functional dependencies imposed by its structure), approximate all the unobserved variables and unknown functions. Type 3: Expanding on Type 2, if the hypergraph structure itself is unknown, use partial observations of the variables of the hypergraph to discover its structure and approximate its unknown functions. These hypergraphs offer a natural platform for organizing, communicating, and processing computational knowledge. While most scientific problems can be framed as the data-driven discovery of unknown functions in a computational hypergraph whose structure is known (Type 2), many require the data-driven discovery of the structure (connectivity) of the hypergraph itself (Type 3). We introduce an interpretable Gaussian Process (GP) framework for such (Type 3) problems that does not require randomization of the data, access to or control over its sampling, or sparsity of the unknown functions in a known or learned basis. Its polynomial complexity, which contrasts sharply with the super-exponential complexity of causal inference methods, is enabled by the nonlinear ANOVA capabilities of GPs used as a sensing mechanism.

Science & Technology - Other Topics↗

Modeling Principles Using the Relation Between Lagrange Multipliers and Bond Graphs

Final document is attached. Modeling dynamic systems by bond graphs has become state of the art technology since hundreds of researchers around the world have incorporated the technology in many fields of engineering and science. The legacy of its invertor Prof. Henry Paynter at MIT in 1959 is now a fundamental and practical technique to understand reality by building computer models. This paper addresses a particular aspect of this technology when modeling of mechanical systems require relaxation of constraints by means of Lagrange principles. Lagrange's equations are a useful means of describing and solving systems with kinematic constraints. Lagrange multipliers are variables used in equations to find the extremes of multivariate functions. Here we explore the relation of Lagrange multipliers to solve modeling difficulties of a space vehicle with equations with dependent derivatives. Lagrange multipliers were used in conjunction with bond graphs to simulate a system where joints of kinematic linkages produce dependent derivatives. NASA's Morpheus Project lunar lander was used as a case study. The Morpheus Project is a terrestrial test vehicle designed to fly the terminal descent trajectory of a lunar lander to advance the Autonomous Landing Hazard Avoidance Technology (ALHAT). An objective of this study is to apply the modeling approach herein to capture the dynamic movement of the lander as the propellant is sloshed and consumed. This paper expands further the analysis presented by (Granda, J J. Nguyen, L, Carlson, T, Sahragard-Monfared, G., Fornalski, E., Brocker 2016). Using an automated approach bond graph models of state space equations were generated using the Computer Aided Modeling Program (CAMPG). Integral causality models and derivative causality models were considered in order to find the simpler solution for the mathematical dependencies produced in modeling this vehicle.

Granda, Jose J.↗

Quantum fields on star graphs with bound states at the vertex

We investigate the propagation of a massless scalar field on a star graph, modeling the junction of n quantum wires. The vertex of the graph is represented by a pointlike impurity (defect), characterized by a one-body scattering matrix. The general case of off-critical scattering matrix with bound and/or antibound states is considered. We demonstrate that the contribution of these states to the scalar field is fixed by causality (local commutativity), which is the key point of our investigation. Two different regimes of the theory emerge at this stage. If bound sates are absent, the energy is conserved and the theory admits unitary time evolution. The behavior changes if bound states are present because each such state generates a kind of damped harmonic oscillator in the spectrum of the field. These oscillators lead to the breakdown of time-translation invariance. In both regimes we investigate in this framework the electromagnetic conductance of the Luttinger liquid on the quantum wire junction. We derive an explicit expression for the conductance in terms of the scattering matrix and show that antibound and bound states have a different impact, giving rise to oscillations with exponentially damped and growing amplitudes, respectively.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗