Search NASA⌕ Search

SEARCH · Search NASA

Results for “call 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.

At least 73 records · Page 4

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↗

A VLSI decomposition of the deBruijn graph

The nth order deBruijn graph Bn is the state diagram for an n-stage binary shift register. It is a directed graph with 2 to the n vertices, each labeled with an n-bit binary string, and 2 to the n+1 edges, each labeled with an (n+1)-bit binary string. It is shown that Bn can be built by appropriately connecting together with extra edges many isomorphic copies of a fixed graph, which is called a building block for Bn. The efficiency of such a building block is refined as the fraction of the edges of Bn which are present in the copies of the building block. It is then shown that for any alpha less than 1, there exists a graph which is a building block for Bn of efficiency greater than alpha for all sufficiently large n. The results are illustrated by showing how a special hierarchical family of building blocks has been used to construct a very large Viterbi decoder which will be used on the Galileo mission.

Collins, Oliver↗

Fibers add flavor. Part II. 5d SCFTs, gauge theories, and dualities

In [1, 2] we proposed an approach based on graphs to characterize 5d superconformal field theories (SCFTs), which arise as compactifications of 6d $$ \mathcal{N} $$ N = (1 , 0) SCFTs. The graphs, so-called combined fiber diagrams (CFDs), are derived using the realization of 5d SCFTs via M-theory on a non-compact Calabi-Yau threefold with a canonical singularity. In this paper we complement this geometric approach by connecting the CFD of an SCFT to its weakly coupled gauge theory or quiver descriptions and demonstrate that the CFD as recovered from the gauge theory approach is consistent with that as determined by geometry. To each quiver description we also associate a graph, and the embedding of this graph into the CFD that is associated to an SCFT provides a systematic way to enumerate all possible consistent weakly coupled gauge theory descriptions of this SCFT. Furthermore, different embeddings of gauge theory graphs into a fixed CFD can give rise to new UV-dualities for which we provide evidence through an analysis of the prepotential, and which, for some examples, we substantiate by constructing the M-theory geometry in which the dual quiver descriptions are manifest.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A mass graph-based approach for the identification of modified proteoforms using top-down tandem mass spectra

Motivation: Although proteomics has rapidly developed in the past decade, researchers are still in the early stage of exploring the world of complex proteoforms, which are protein products with various primary structure alterations resulting from gene mutations, alternative splicing, post-translational modifications, and other biological processes. Proteoform identification is essential to mapping proteoforms to their biological functions as well as discovering novel proteoforms and new protein functions. Top-down mass spectrometry is the method of choice for identifying complex proteoforms because it provides a “bird’s eye view” of intact proteoforms. The combinatorial explosion of various alterations on a protein may result in billions of possible proteoforms, making proteoform identification a challenging computational problem. Results: We propose a new data structure, called the mass graph, for efficient representation of proteoforms and design mass graph alignment algorithms. We developed TopMG, a mass graph-based software tool for proteoform identification by top-down mass spectrometry. Experiments on top-down mass spectrometry data sets showed that TopMG outperformed existing methods in identifying complex proteoforms.

Dynamic Programming↗

Using spatio-temporal graph neural networks to estimate fleet-wide photovoltaic performance degradation patterns

Accurate estimation of photovoltaic (PV) system performance is crucial for determining its feasibility as a power generation technology and financial asset. PV-based energy solutions offer a viable alternative to traditional energy resources due to their superior Levelized Cost of Energy (LCOE). A significant challenge in assessing the LCOE of PV systems lies in understanding the Performance Loss Rate (PLR) for large fleets of PV systems. Estimating the PLR of PV systems becomes increasingly important in the rapidly growing PV industry. Precise PLR estimation benefits PV users by providing real-time monitoring of PV module performance, while explainable PLR estimation assists PV manufacturers in studying and enhancing the performance of their products. However, traditional PLR estimation methods based on statistical models have notable drawbacks. Firstly, they require user knowledge and decision-making. Secondly, they fail to leverage spatial coherence for fleet-level analysis. Additionally, these methods inherently assume the linearity of degradation, which is not representative of real world degradation. To overcome these challenges, we propose a novel graph deep learning-based decomposition method called the Spatio-Temporal Graph Neural Network for fleet-level PLR estimation (PV-stGNN-PLR). PV-stGNN-PLR decomposes the power timeseries data into aging and fluctuation components, utilizing the aging component to estimate PLR. PV-stGNN-PLR exploits spatial and temporal coherence to derive PLR estimation for all systems in a fleet and imposes flatness and smoothness regularization in loss function to ensure the successful disentanglement between aging and fluctuation. We have evaluated PV-stGNN-PLR on three simulated PV datasets consisting of 100 inverters from 5 sites. Experimental results show that PV-stGNN-PLR obtains a reduction of 33.9% and 35.1% on average in Mean Absolute Percent Error (MAPE) and Euclidean Distance (ED) in PLR degradation pattern estimation compared to the state-of-the-art PLR estimation methods.

14 SOLAR ENERGY↗

Evaluating single-scale and/or non-planar diagrams by differential equations

We apply a recently suggested new strategy to solve differential equations for Feynman integrals. We develop this method further by analyzing asymptotic expansions of the integrals. We argue that this allows the systematic application of the differential equations to single-scale Feynman integrals. Moreover, the information about singular limits significantly simplifies finding boundary constants for the differential equations. To illustrate these points we consider two families of three-loop integrals. The first are form-factor integrals with two external legs on the light cone. We introduce one more scale by taking one more leg off-shell, $p_2^2\neq 0$. We analytically solve the differential equations for the master integrals in a Laurent expansion in dimensional regularization with $\epsilon=(4-D)/2$. Then we show how to obtain analytic results for the corresponding one-scale integrals in an algebraic way. An essential ingredient of our method is to match solutions of the differential equations in the limit of small $p_2^2$ to our results at $p_2^2\neq 0$ and to identify various terms in these solutions according to expansion by regions. The second family consists of four-point non-planar integrals with all four legs on the light cone. We evaluate, by differential equations, all the master integrals for the so-called $K_4$ graph consisting of four external vertices which are connected with each other by six lines. We show how the boundary constants can be fixed with the help of the knowledge of the singular limits. We present results in terms of harmonic polylogarithms for the corresponding seven master integrals with six propagators in a Laurent expansion in $\epsilon$ up to weight six.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Risk-Averse Bi-Level Stochastic Network Interdiction Model for Cyber-Security Risk Management

Security of cyber networks is crucial; recent severe cyber-attacks have had a devastating effect on many large organizations. The attack graph, which maps the potential attack paths of a cyber network, is a popular tool for analyzing cyber system vulnerability. In this study, we propose a bi-level stochastic network interdiction model on an attack graph to enable a risk-averse, resource constrained cyber network defender to optimally deploy security countermeasures that protect against attackers with an uncertain budget. This risk- averse conditional-value-at-risk (CVaR) model minimizes a weighted sum of the expected maximum loss over all scenarios and the expected maximum loss from the most damaging attack scenarios. We develop a customized constraint and column generation algorithm to solve our model as well as several acceleration techniques to improve the computational efficiency. Numerical experiments demonstrate that the acceleration techniques enable the solution of relatively large problems within a reasonable amount of time: applying all the acceleration techniques also reduces the average computation time of the basic algorithm by 71% for 100-node graphs. Using metrics called mean-risk value of stochastic solution and value of risk-aversion, computational results suggest that our stochastic risk-averse model significantly outperforms deterministic and risk-neutral models when 1) the distribution of attacker budget is heavy-right-tailed and 2) the defender is highly risk-averse.

Bhuiyan, Tanveer H.↗

Information-incorporated gene network construction with FDR control

Abstract Motivation Large-scale gene expression studies allow gene network construction to uncover associations among genes. To study direct associations among genes, partial correlation-based networks are preferred over marginal correlations. However, FDR control for partial correlation-based network construction is not well-studied. In addition, currently available partial correlation-based methods cannot take existing biological knowledge to help network construction while controlling FDR. Results In this paper, we propose a method called Partial Correlation Graph with Information Incorporation (PCGII). PCGII estimates partial correlations between each pair of genes by regularized node-wise regression that can incorporate prior knowledge while controlling the effects of all other genes. It handles high-dimensional data where the number of genes can be much larger than the sample size and controls FDR at the same time. We compare PCGII with several existing approaches through extensive simulation studies and demonstrate that PCGII has better FDR control and higher power. We apply PCGII to a plant gene expression dataset where it recovers confirmed regulatory relationships and a hub node, as well as several direct associations that shed light on potential functional relationships in the system. We also introduce a method to supplement observed data with a pseudogene to apply PCGII when no prior information is available, which also allows checking FDR control and power for real data analysis. Availability and implementation R package is freely available for download at https://cran.r-project.org/package=PCGII.

59 BASIC BIOLOGICAL SCIENCES↗

Automated detection of double nuclei galaxies using GOTHIC and the discovery of a large sample of dual AGN

We present a novel algorithm to detect double nuclei galaxies (DNG) called Gothic (Graph-bOosTed iterated HIll Climbing) – that detects whether a given image of a galaxy has two or more closely separated nuclei. Our aim is to test for the presence of dual/multiple active galactic nuclei (AGN) in galaxies that visually represent a DNG. Although galaxy mergers are common, the detection of dual AGN is rare. Their detection is very important as they help us understand the formation of supermassive black hole (SMBH) binaries, SMBH growth and AGN feedback effects in multiple nuclei systems. There is thus a need for an algorithm to do a systematic survey of existing imaging data for the discovery of DNGs and dual AGNs. We have tested Gothic on an established sample of DNGs with a 100 per cent detection rate and subsequently conducted a blind search of 1 million SDSS DR16 galaxies (with spectroscopic data available) lying in the redshift range of z = 0 to 0.75. From the list of candidate DNGs found, we have detected 159 dual AGNs, of which 2 are triple AGN systems. Our results show that dual AGNs are not common, and triple AGN even rarer. The colour (u–r) magnitude plots of the DNGs indicate that star formation is quenched as the nuclei come closer and as the AGN fraction increases. The quenching is especially prominent for dual/triple AGN galaxies that lie at the extreme end of the red sequence.

79 ASTRONOMY AND ASTROPHYSICS↗

Decentralized Collaborative Learning with Probabilistic Data Protection

We discuss future directions of Blockchain as a collaborative value co-creation platform, in which network participants can gain extra insights that cannot be accessed when disconnected from the others. As such, we propose a decentralized machine learning framework that is carefully designed to respect the values of democracy, diversity, and privacy. Specifically, we propose a federated multi-task learning framework that integrates a privacy-preserving dynamic consensus algorithm. We show that a specific network topology called the expander graph dramatically improves the scalability of global consensus building. We conclude the paper by making some remarks on open problems.

Ide, Tsuyoshi↗

GPLADD: Quantifying Trust in Government and Commercial Systems A Game-Theoretic Approach

Trust in a microelectronics-based system can be characterized as the level of confidence that a system is free of subversive alterations made during system development, or that the development process of a system has not been manipulated by a malicious adversary. Trust in systems has become an increasing concern over the past decade. This report introduces a novel game-theoretic framework, called GPLADD (Graph-based Probabilistic Learning Attacker and Dynamic Defender), for analyzing and quantifying system trustworthiness at the end of the development process, through the analysis of risk of development-time system manipulation. GPLADD represents attacks and attacker-defender contests over time. Here, time is an explicit constraint and allows incorporating the informational asymmetries between the attacker and defender into analysis. GPLADD includes an explicit representation of attack steps via multi-step attack graphs, attacker and defender strategies, and player actions at different times. GPLADD allows quantifying the attack success probability over time and the attacker and defender costs based on their capabilities and strategies. This ability to quantify different attacks provides an input for evaluation of trust in the development process. We demonstrate GPLADD on an example attack and its variants. We develop a method for representing success probability for arbitrary attacks and derive an explicit analytic characterization of success probability for a specific attack. We present a numeric Monte Carlo study of a small set of attacks, quantify attack success probabilities, attacker and defender costs, and illustrate the options the defender has for limiting the attack success and improving trust in the development process.

37 attack↗

nem_slice ver. 3.34

Nem_slice reads in a finite element model description of the geometry of a problem from an ExodusII file and generates either a nodal or elemental graph of the problem. It then calls Chaco to load balance the graph and then outputs a NemesisI load-balance file.

HUTCHINSON, SCOTT↗

Conducting Beyond the Standard Model Searches in the MicroBooNE Detector with Machine Learning

MicroBooNE is one of the three neutrino detectors that comprise the Short Baseline Neutrino program at Fermilab. It utilizes Liquid Argon Time Projection Chamber (LArTPC) technology to probe the anomalous excess of electron-like events seen by its predecessor, MiniBooNE. Additionally, it provides a rich avenue of study for Beyond the Standard Model (BSM) theories. In the GeV energy regime relevant to MicroBooNE's beam neutrino program, many such theories lead to signatures which produce electron-positron (e+e-) final-states in the detector. While photons can pair produce into e+e- pairs with negligible opening angles, BSM theories often predict e+e- pairs with a broader range of opening angles. Thus, developing a tool that can reliably measure the opening angles of e+e- events is crucial for conducting rigorous BSM studies. However, these e+e- pairs result in topologically complex showers instead of clean tracks, making non-machine learning (ML) based methods such as line-fitting unsuitable for this task. This poster discusses the effectiveness of ML, namely a graph neural network called PointNet++, in accomplishing this goal. Our studies show promising results, with a resolution for the opening angle of 5 or less.

Bhelande, Vedang Adutya [Los Alamos]↗

Strategies for concurrent processing of complex algorithms in data driven architectures

The purpose is to document research to develop strategies for concurrent processing of complex algorithms in data driven architectures. The problem domain consists of decision-free algorithms having large-grained, computationally complex primitive operations. Such are often found in signal processing and control applications. The anticipated multiprocessor environment is a data flow architecture containing between two and twenty computing elements. Each computing element is a processor having local program memory, and which communicates with a common global data memory. A new graph theoretic model called ATAMM which establishes rules for relating a decomposed algorithm to its execution in a data flow architecture is presented. The ATAMM model is used to determine strategies to achieve optimum time performance and to develop a system diagnostic software tool. In addition, preliminary work on a new multiprocessor operating system based on the ATAMM specifications is described.

Stoughton, John W.↗

Kinetic parameters from thermogravimetric analysis

High performance polymeric materials are finding increased use in aerospace applications. Proposed high speed aircraft will require materials to withstand high temperatures in an oxidative atmosphere for long periods of time. It is essential that accurate estimates be made of the performance of these materials at the given conditions of temperature and time. Temperatures of 350 F (177 C) and times of 60,000 to 100,000 hours are anticipated. In order to survey a large number of high performance polymeric materials on a reasonable time scale, some form of accelerated testing must be performed. A knowledge of the rate of a process can be used to predict the lifetime of that process. Thermogravimetric analysis (TGA) has frequently been used to determine kinetic information for degradation reactions in polymeric materials. Flynn and Wall studied a number of methods for using TGA experiments to determine kinetic information in polymer reactions. Kinetic parameters, such as the apparent activation energy and the frequency factor, can be determined in such experiments. Recently, researchers at the McDonnell Douglas Research Laboratory suggested that a graph of the logarithm of the frequency factor against the apparent activation energy can be used to predict long-term thermo-oxidative stability for polymeric materials. Such a graph has been called a kinetic map. In this study, thermogravimetric analyses were performed in air to study the thermo-oxidative degradation of several high performance polymers and to plot their kinetic parameters on a kinetic map.

Kiefer, Richard L.↗

Software reliability studies

There are many software reliability models which try to predict future performance of software based on data generated by the debugging process. Our research has shown that by improving the quality of the data one can greatly improve the predictions. We are working on methodologies which control some of the randomness inherent in the standard data generation processes in order to improve the accuracy of predictions. Our contribution is twofold in that we describe an experimental methodology using a data structure called the debugging graph and apply this methodology to assess the robustness of existing models. The debugging graph is used to analyze the effects of various fault recovery orders on the predictive accuracy of several well-known software reliability algorithms. We found that, along a particular debugging path in the graph, the predictive performance of different models can vary greatly. Similarly, just because a model 'fits' a given path's data well does not guarantee that the model would perform well on a different path. Further we observed bug interactions and noted their potential effects on the predictive process. We saw that not only do different faults fail at different rates, but that those rates can be affected by the particular debugging stage at which the rates are evaluated. Based on our experiment, we conjecture that the accuracy of a reliability prediction is affected by the fault recovery order as well as by fault interaction.

Hoppa, Mary Ann↗

Event driven executive

Tasks may be planned for execution on a single processor or are split up by the designer for execution among a plurality of signal processors. The tasks are modeled using a design aid called a precedence graph, from which a dependency table and a prerequisite table are established for reference within each processor. During execution, at the completion of a given task, an end of task interrupt is provided from any processor which has completed a task to any and all other processors including itself in which completion of that task is a prerequisite for commencement of any dependent tasks. The relevant updated data may be transferred by the processor either before or after signalling task completion to the processors needing the updated data prior to commencing execution of the dependent tasks. Coherency may be ensured, however, by sending the data before the interrupt. When the end of task interrupt is received in a processor, its dependency table is consulted to determine those tasks dependent upon completion of the task which has just been signalled as completed, and task dependency signals indicative thereof are provided and stored in a current status list of a prerequisite table. The current status of all current prerequisites are compared to the complete prerequisites listed for all affected tasks and those tasks for which the comparison indicates that all prerequisites have been met are queued for execution in a selected order.

Tulpule, Bhalchandra R.↗

nem_slice ver. 3.34

Nem_slice reads in a finite element model description of the geometry of a problem from an ExodusII file and generates either a nodal or elemental graph of the problem. It then calls Chaco to load balance the graph and then outputs a NemesisI load-balance file.

HUTCHINSON, SCOTT↗