Search NASA⌕ Search

SEARCH · Search NASA

Results for “knowledge networks”

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 109 records · Page 6

Distributed Outage Detection in Power Distribution Networks

Real time topology knowledge is essential for situational awareness of power distribution networks. Line outages change the topology of a distribution network. Hence, outage detection is an important task. Most of the existing outage detection algorithms are centralized, in which sensors communicate their data to a control center which performs outage detection using the received data. However, with the increasing size of the distribution network and with different areas of the network being monitored by different operators, communication is a bottleneck and scalability is a major concern. To address these issues, we propose a novel outage detection algorithm using a divide and conquer approach. First, we divide a distribution network into sub-networks, such that outage detection can be run in parallel in each sub-network independently ensuring scalability to large networks. Further, to reduce the latency, bandwidth and attenuation challenges associated with communications in a large network, we divide each sub-network into multiple control areas which communicate only with their neighbors. We employ a distributed iterative load estimation across the control areas of each sub-network and then use the load estimate for local outage detection in each control area. Here, the performance of our algorithm is evaluated for multiple feeder models and compared against traditional centralized outage detection algorithms.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Knowledge-guided learning with curated prior genetic biomarkers for robust model interpretation

Abstract Motivation Knowledge-guided learning offers effective and robust model training strategies in data-scarce settings by incorporating established domain knowledge, thereby enhancing generalization, robustness, and interpretability. By contrast, conventional deep learning approaches rely purely on data-driven learning, which can limit robust model interpretability, particularly in high-dimensional settings with limited size samples. In computational biology, knowledge-guided learning has primarily leveraged network- and structural-based knowledge, leading to biologically interpretable representations and enhanced predictive performance compared to conventional approaches. However, curated biomarkers, one of the most accessible forms of biological knowledge, remain largely unexplored within knowledge-guided paradigms. Results In this study, we propose a model-agnostic training paradigm, Biomarker-driven Explainable Prior-guided Learning (BioExPL), that can be applied to any neural networks that incorporates curated prior knowledge. BioExPL enforces neural networks to reflect curated biomarker priors in their latent representations through a novel knowledge-alignment loss. BioExPL consistently demonstrated significantly improved predictive performance and enhanced model interpretability with minimized computational overhead in simulation studies and intensive experiments on multiple cancer datasets. BioExPL not only integrates prior curated knowledge into the model but also accurately identifies unknown associated signals additionally. BioExPL is model-agnostic and domain-independent, enabling its integration into diverse neural network architectures. Availability and implementation The open-source is publicly available at: https://github.com/datax-lab/BioExPL.

Baek, Beomsu [Department of Computer Science, Univ↗

Lessons Learned in the Implementation of a Training Knowledge Management System for the SERVIR Network

The SERVIR program is a unique partnership between NASA, the U.S. Agency for International Development (USAID), focusing on building capacity to use Earth observations for addressing development challenges. In that context, between 2004 and 2020, the program delivered approximately 365 trainings to almost 10,000 professionals. More recently, between November 2020 and August 2021, the SERVIR network executed some 55 training events addressing SERVIR’s 4 priority thematic areas, and roughly a quarter of SERVIR trainings overall have focused on themes related to Ecological Forecasting. Due to the ongoing COVID-19 pandemic, almost four-fifths of recent training events have been virtual, with the remainder being in-person under limited circumstances. The large number of training events delivered represents both an opportunity and a challenge in terms of knowledge management. While the training materials developed can later be reused in other parts of the SERVIR network, prior to recently, the lack of a central repository for those materials has prevented wider dissemination and use. The recently developed Training Knowledge Management System (TKMS) is now becoming an integral part of the SERVIR Capacity Building Framework, supporting the exchange of resources and methods for conducting training activities across the network. This presentation focuses on the structure of this system, as well as on the anticipated benefits for the User Communities for Earth Observations of Terrestrial Systems.

training↗

Current and future directions in network biology

Network biology is an interdisciplinary field bridging computational and biological sciences that has proved pivotal in advancing the understanding of cellular functions and diseases across biological systems and scales. Although the field has been around for two decades, it remains nascent. It has witnessed rapid evolution, accompanied by emerging challenges. These stem from various factors, notably the growing complexity and volume of data together with the increased diversity of data types describing different tiers of biological organization. We discuss prevailing research directions in network biology, focusing on molecular/cellular networks but also on other biological network types such as biomedical knowledge graphs, patient similarity networks, brain networks, and social/contact networks relevant to disease spread. In more detail, we highlight areas of inference and comparison of biological networks, multimodal data integration and heterogeneous networks, higher-order network analysis, machine learning on networks, and network-based personalized medicine. Following the overview of recent breakthroughs across these five areas, we offer a perspective on future directions of network biology. Additionally, we discuss scientific communities, educational initiatives, and the importance of fostering diversity within the field. This article establishes a roadmap for an immediate and long-term vision for network biology.

59 BASIC BIOLOGICAL SCIENCES↗

Social Network: JAZ Protein Interactions Expand Our Knowledge of Jasmonate Signaling

Members of the family of JASMONATE ZIM-DOMAIN (JAZ) proteins are key regulators of the jasmonate (JA) hormonal response. The 12-member family is characterized by three conserved domains, an N-terminal domain, a TIFY-containing ZINC-FINGER EXPRESSED IN INFLORESCENCE MERISTEM domain, and a C-terminal Jas domain. JAZ proteins regulate JA-responsive gene transcription by inhibiting DNA-binding transcription factors in the absence of JA. JAZ proteins interact in a hormone-dependent manner with CORONATINE INSENSITIVE 1 (COI1), the recognition component of the E3 ubiquitin ligase, SCFCOI1, resulting in the ubiquitination and subsequent degradation of JAZs via the 26S proteasome pathway. Since their discovery in 2007, JAZ proteins have been implicated in protein–protein interactions with multiple transcription factors. These studies have shed light on the mechanism by which JAZs repress transcription, are targeted for degradation, modulate the JA signaling response, and participate in crosstalk with other hormone signaling pathways. In this review, we will take a close look at the recent discoveries made possible by the characterization JAZ protein–protein interactions.

54 ENVIRONMENTAL SCIENCES↗

Experiments in Neural-Network Control of a Free-Flying Space Robot

Four important generic issues are identified and addressed in some depth in this thesis as part of the development of an adaptive neural network based control system for an experimental free flying space robot prototype. The first issue concerns the importance of true system level design of the control system. A new hybrid strategy is developed here, in depth, for the beneficial integration of neural networks into the total control system. A second important issue in neural network control concerns incorporating a priori knowledge into the neural network. In many applications, it is possible to get a reasonably accurate controller using conventional means. If this prior information is used purposefully to provide a starting point for the optimizing capabilities of the neural network, it can provide much faster initial learning. In a step towards addressing this issue, a new generic Fully Connected Architecture (FCA) is developed for use with backpropagation. A third issue is that neural networks are commonly trained using a gradient based optimization method such as backpropagation; but many real world systems have Discrete Valued Functions (DVFs) that do not permit gradient based optimization. One example is the on-off thrusters that are common on spacecraft. A new technique is developed here that now extends backpropagation learning for use with DVFs. The fourth issue is that the speed of adaptation is often a limiting factor in the implementation of a neural network control system. This issue has been strongly resolved in the research by drawing on the above new contributions.

NEURAL NETS↗

Generating Dominating Sets Using Locally Defined Centrality Measures

The dominating set problem has many practical applications but is well-known to be NP-hard. Therefore, there is a need for efficient heuristic algorithms, especially in applications such as ad hoc wireless networks. Most distributed algorithms proposed in the literature assume that each node has knowledge of the network structure. We propose a distributed heuristic algorithm that uses two rounds of communication, and where each node has only local information, both in terms of network structure and dominating set assignment. First, each node calculates a local centrality measure to determine whether it is part of the dominating set D. The second round guarantees D is a dominating set by adding any non-dominated nodes. We compare several centrality measures and show that the Shapley centrality, derived from the Shapley value in game theory, is theoretically motivated and performs well in practice on several synthetic and real-world networks.

Network↗

Methods and systems for detecting abnormal digital traffic

Aspects of the present invention encompass methods and systems for detecting abnormal digital traffic by assigning characterizations of network behaviors according to knowledge nodes and calculating a confidence value based on the characterizations from at least one knowledge node and on weighting factors associated with the knowledge nodes. The knowledge nodes include a characterization model based on prior network information. At least one of the knowledge nodes should not be based on fixed thresholds or signatures. The confidence value includes a quantification of the degree of confidence that the network behaviors constitute abnormal network traffic.

97 MATHEMATICS AND COMPUTING↗

Knowledge Transfer Project: Cultivating Smart Energy Solutions through Dynamic Peer-to-Peer Learning

As energy policy makers and professionals convene in the Oresund region for the 9th Annual Clean Energy Ministerial (CEM9), the global community is as united as ever around the common goal of accelerating the transition to global clean energy. Through sustained collective effort and thought leadership, CEM partners and stakeholders are systematically addressing the barriers to the widescale deployment of clean energy technologies. Pivotal to their progress is the efficient sharing and dissemination of knowledge. To address that need, the CEM-initiative International SmartGrid Action Network (ISGAN) launched the Knowledge Transfer Project (KTP) in March 2016 to capture, collect, and share knowledge about smart grid technologies among countries and key stakeholders. Building on ISGAN's experience with delivering deep-dive workshops, the KTP fosters meaningful international dialogue on smart grids with a focus on developing competence and building capacity. After a successful 2016 pilot project and two consecutive projects, each with a different focus and structure, the KTP has become an established practice that can support existing ISGAN or CEM initiatives. To accommodate different purposes, needs, and practical circumstances, ISGAN has adopted three basic models for delivering KTP workshops: Country-Centric, Multilateral, and Hybrid. This fact sheet describes each approach through case studies of workshops in Mexico, India, and Belgium, and invites new ideas and partners for future KTPs.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Reduced‐Order Modeling of Energetic Materials Using Physics‐Aware Recurrent Convolutional Neural Networks in a Latent Space (LatentPARC)

Physics-aware deep learning (PADL) has gained popularity for use in spatiotemporal dynamics simulations, such as those in computational modeling of energetic materials (EM). We show that the challenge PADL methods face while learning complex field evolution problems can be simplified and accelerated by decoupling it into two tasks: learning complex geometric features in evolving fields and modeling dynamics over these features in a lower-dimensional feature space. We build upon our previous work on physics-aware recurrent convolutional neural networks (PARC). PARC embeds knowledge of underlying physics into its neural network architecture for more robust and accurate prediction of evolving physical fields. PARC was shown to effectively learn complex nonlinear features such as the formation of hotspots and coupled shock fronts in various initiation scenarios of EMs, as a function of microstructures, serving effectively as a microstructure-aware burn model. Here, we further accelerate PARC and reduce its computational cost by projecting the original dynamics onto a lower-dimensional invariant manifold, or “latent space.” The projected latent representation encodes the complex geometry of evolving fields (e.g., temperature and pressure) in a set of data-driven features. The reduced dimension of this latent space allows us to learn the dynamics during the initiation of EM with a lighter and more efficient model. We observe a significant decrease in training and inference time while maintaining results comparable to PARC at inference. This work takes steps towards enabling rapid prediction of EM thermomechanics at larger scales and characterization of EM structure–property–performance linkages at a full application scale.

Mathematics and Computing↗

Revealing the ISO/IEC 9126-1 Clique Tree for COTS Software Evaluation

Previous research has shown that acyclic dependency models, if they exist, can be extracted from software quality standards and that these models can be used to assess software safety and product quality. In the case of commercial off-the-shelf (COTS) software, the extracted dependency model can be used in a probabilistic Bayesian network context for COTS software evaluation. Furthermore, while experts typically employ Bayesian networks to encode domain knowledge, secondary structures (clique trees) from Bayesian network graphs can be used to determine the probabilistic distribution of any software variable (attribute) using any clique that contains that variable. Secondary structures, therefore, provide insight into the fundamental nature of graphical networks. This paper will apply secondary structure calculations to reveal the clique tree of the acyclic dependency model extracted from the ISO/IEC 9126-1 software quality standard. Suggestions will be provided to describe how the clique tree may be exploited to aid efficient transformation of an evaluation model.

Morris, A. Terry↗

Exploration of multifidelity UQ sampling strategies for computer network applications.

Network modeling is a powerful tool to enable rapid analysis of complex systems that can be challenging to study directly using physical testing. Here, two approaches are considered: emulation and simulation. The former runs real software on virtualized hardware, while the latter mimics the behavior of network components and their interactions in software. Although emulation provides an accurate representation of physical networks, this approach alone cannot guarantee the characterization of the system under realistic operative conditions. Operative conditions for physical networks are often characterized by intrinsic variability (payload size, packet latency, etc.) or a lack of precise knowledge regarding the network configuration (bandwidth, delays, etc.); therefore uncertainty quantification (UQ) strategies should be also employed. UQ strategies require multiple evaluations of the system with a number of evaluation instances that roughly increases with the problem dimensionality, i.e., the number of uncertain parameters. It follows that a typical UQ workflow for network modeling based on emulation can easily become unattainable due to its prohibitive computational cost. In this paper, a multifidelity sampling approach is discussed and applied to network modeling problems. The main idea is to optimally fuse information coming from simulations, which are a low-fidelity version of the emulation problem of interest, in order to decrease the estimator variance. By reducing the estimator variance in a sampling approach it is usually possible to obtain more reliable statistics and therefore a more reliable system characterization. Several network problems of increasing difficulty are presented. For each of them, the performance of the multifidelity estimator is compared with respect to the single fidelity counterpart, namely, Monte Carlo sampling. For all the test problems studied in this work, the multifidelity estimator demonstrated an increased efficiency with respect to MC.

97 MATHEMATICS AND COMPUTING↗

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↗

Integrating large-scale functional genomics data to dissect metabolic networks for hydrogen production

The goal of this project is to identify gene networks that are critical for efficient biohydrogen production by leveraging variation in gene content and gene expression in independently isolated Rhodopseudomonas palustris strains. Coexpression methods were applied to large data sets that we have collected to define probabilistic causal gene networks. To our knowledge this a first systems level approach that takes advantage of strain-to strain variability to computationally define networks critical for a particular bacterial phenotypic trait.

08 HYDROGEN↗

Interaction and Communication of Agents in Networks and Language Complexity Estimates

Knowledge acquisition and sharing are arguably the most critical activities of communicating agents. We report about our on-going project featuring knowledge acquisition and sharing among communicating agents embedded in a network. The applications we target range from hardware robots to virtual entities such as internet agents. Agent experiments can be simulated using a convenient simulation language. We analyzed the complexity of communicating agent simulations using Java and Easel. Scenarios we have studied are listed below. The communication among agents can range from declarative queries to sub-natural language queries. 1) A set of agents monitoring an object are asked to build activity profiles based on exchanging elementary observations; 2) A set of car drivers form a line, where every car is following its predecessor. An unsafe distance cm create a strong wave in the line. Individual agents are asked to incorporate and apply directions how to avoid the wave. 3) A set of micro-vehicles form a grid and are asked to propagate information and concepts to a central server.

Smid, Jan↗

Proposed Development of NASA Glenn Research Center's Aeronautical Network Research Simulator

Accurate knowledge and understanding of data link traffic loads that will have an impact on the underlying communications infrastructure within the National Airspace System (NAS) is of paramount importance for planning, development and fielding of future airborne and ground-based communications systems. Attempting to better understand this impact, NASA Glenn Research Center (GRC), through its contractor Computer Networks & Software, Inc. (CNS, Inc.), has developed an emulation and test facility known as the Virtual Aircraft and Controller (VAC) to study data link interactions and the capacity of the NAS to support Controller Pilot Data Link Communications (CPDLC) traffic. The drawback of the current VAC test bed is that it does not allow the test personnel and researchers to present a real world RF environment to a complex airborne or ground system. Fortunately, the United States Air Force and Navy Avionics Test Commands, through its contractor ViaSat, Inc., have developed the Joint Communications Simulator (JCS) to provide communications band test and simulation capability for the RF spectrum through 18 GHz including Communications, Navigation, and Identification and Surveillance functions. In this paper, we are proposing the development of a new and robust test bed that will leverage on the existing NASA GRC's VAC and the Air Force and Navy Commands JCS systems capabilities and functionalities. The proposed NASA Glenn Research Center's Aeronautical Networks Research Simulator (ANRS) will combine current Air Traffic Control applications and physical RF stimulation into an integrated system capable of emulating data transmission behaviors including propagation delay, physical protocol delay, transmission failure and channel interference. The ANRS will provide a simulation/stimulation tool and test bed environment that allow the researcher to predict the performance of various aeronautical network protocol standards and their associated waveforms under varying density conditions. The system allows the user to define human-interactive and scripted aircraft and controller models of various standards, such as (but not limited to) Very High Frequency Digital Link (VDL) of various modes.

Nguyen, Thanh C.↗

Knowledge Spillovers and Cost Reductions in Solar Soft Costs

Despite the commonly acknowledged importance of knowledge spillovers in reducing solar soft costs, we are only beginning to answer a fundamental question: who learns what (knowledge acquisition), from whom (knowledge production), and how (spillover mechanisms)? Until recently, this important topic has been largely unexplored in the case of solar soft costs. Thus, this project set out to identify how knowledge spillovers affect soft costs in the U.S. photovoltaic (PV) installation industry, specifically how important spillovers are, what types of knowledge are most likely to spillover, and how networks of actors affect spillovers. Our findings offer insights for designing solutions that address problems associated with knowledge spillovers and that leverage spillovers to reduce solar soft costs. Recognizing the ambiguity in the definition of soft costs, i.e., “non-hardware costs,” and variability in soft cost categories, we developed the Solar Soft Cost Ontology (SSCO) to systematically identify key concepts related to soft costs, network actors, learning processes, and the relationships between them. This ontology served as a foundational organizational structure for the methodology of the remaining tasks: case studies, surveys, pricing analysis, patent analysis, network analysis, and project integration across tasks. While there is substantial learning among installers that is reducing the soft costs for PV installations, most of that learning is retained by firms rather than spread across the industry. The positive relationship between experience accumulation and cost reductions is typically explained as learning by doing (LBD), but we find that LBD effects are mediated by other learning mechanisms, including learning by searching and learning by interacting. Knowledge spillovers have significant potential to reduce solar PV soft costs, but successful knowledge spillover pathways are complex and non-trivial. There are a wide variety of ways to construct an installation business, thus categories of firms that can effectively cross-learn directly are small and what knowledge is relevant to whom is challenging and costly for firms to assess. This fragmentation limits the critical mass needed for spillover related soft cost reductions. Knowledge does not flow directly between installers. Indirect knowledge transfer pathways are critical: distributors, software providers, collaboratives, and hiring. Furthermore, diverse, more integrated knowledge networks tend to promote successful learning by organizations and across the system as a whole. Accordingly, we find the need to supporting the whole ecosystem using an integrated policy and programmatic approach to support installers, distributors, complementary sector, and facilitators. Overall, a deliberate policy-mix design is needed to reduce the solar PV deployment barrier in terms of installation cost reductions, because deployment policies could potentially interact with policies that facilitate network-building and technological innovation. A combination of deployment policies, innovation-support policies, and network-facilitating policies could potentially lead to a more desired market outcome through achieving higher joint learning rates from firms’ cumulative experiences developed in a more integrated production and deployment ecosystem.

14 SOLAR ENERGY↗

Prior knowledge driven Granger causality analysis on gene regulatory network discovery

Our study focuses on discovering gene regulatory networks from time series gene expression data using the Granger causality (GC) model. However, the number of available time points (T) usually is much smaller than the number of target genes (n) in biological datasets. The widely applied pairwise GC model (PGC) and other regularization strategies can lead to a significant number of false identifications when n>>T. In this study, we proposed a new method, viz., CGC-2SPR (CGC using two-step prior Ridge regularization) to resolve the problem by incorporating prior biological knowledge about a target gene data set. In our simulation experiments, the propose new methodology CGC-2SPR showed significant performance improvement in terms of accuracy over other widely used GC modeling (PGC, Ridge and Lasso) and MI-based (MRNET and ARACNE) methods. In addition, we applied CGC-2SPR to a real biological dataset, i.e., the yeast metabolic cycle, and discovered more true positive edges with CGC-2SPR than with the other existing methods. In our research, we noticed a “ 1+1>2” effect when we combined prior knowledge and gene expression data to discover regulatory networks. Based on causality networks, we made a functional prediction that the Abm1 gene (its functions previously were unknown) might be related to the yeast’s responses to different levels of glucose. In conclusion, our research improves causality modeling by combining heterogeneous knowledge, which is well aligned with the future direction in system biology. Furthermore, we proposed a method of Monte Carlo significance estimation (MCSE) to calculate the edge significances which provide statistical meanings to the discovered causality networks. All of our data and source codes will be available under the link https://bitbucket.org/dtyu/granger-causality/wiki/Home.

60 APPLIED LIFE SCIENCES↗