Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “knowledge representation”

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 307 records · Page 17

Software For Fault-Tree Diagnosis Of A System

Fault Tree Diagnosis System (FTDS) computer program is automated-diagnostic-system program identifying likely causes of specified failure on basis of information represented in system-reliability mathematical models known as fault trees. Is modified implementation of failure-cause-identification phase of Narayanan's and Viswanadham's methodology for acquisition of knowledge and reasoning in analyzing failures of systems. Knowledge base of if/then rules replaced with object-oriented fault-tree representation. Enhancement yields more-efficient identification of causes of failures and enables dynamic updating of knowledge base. Written in C language, C++, and Common LISP.

Iverson, Dave↗

Transactional Knowledge Graph Generation To Model Adversarial Activities

A Knowledge Graph (KG) is a formal and structured representation of facts, relationships, and semantic descriptions of a set of entities. Traditionally, KGs are used to describe metadata about entities and to provide additional context to target application results. Many real-world domains also involve temporal interactions between entities in addition to the metadata data. Modeling these attributed transactions is a critical requirement when using KGs in complex real-world applications. Modeling adversarial activities is one such application that develops methodology and tools to produce realistic large-scale background activity graphs that include embedded Weapons of Mass Destruction (WMD) activity patterns. We present a novel platform for constructing a transactional knowledge graph from a diverse set of sources. We present the core components and architecture of the framework, and a use case for generating a background knowledge graph and WMD activity template to evaluate network alignment and subgraph matching algorithms.

Purohit, Sumit↗

Data-driven modeling and control of dynamical systems using Koopman and Perron-Frobenius operators

This dissertation studies the data-driven modeling and control problem of nonlinear systems by exploiting the linear operator theoretic framework involving Koopman and Perro-Frobenius operator. A systematic linear-operator based controller design procedure has been established, which can be used to solve a variety of nonlinear control problems, including feedback stabilization using control Lyapunov functions, optimal quadratic regulation using Koopman eigenfunctions and convex optimization formulation of optimal control problem using P-F and Koopman operator approximation. As the core of data-driven modeling, we first propose a new algorithm for the finite-dimensional approximation of the linear transfer Koopman and Perron-Frobenius operator from time-series data. We argue that the existing approach for the finite-dimensional approximation of these transfer operators such as Dynamic Mode Decomposition (DMD) and Extended Dynamic Mode Decomposition (EDMD) do not capture two important properties of these operators, namely positivity and Markov property. The algorithm we propose preserves these two properties. We call the proposed algorithm as naturally structured DMD (NSDMD) since it retains the inherent properties of these operators. Naturally structured DMD algorithm leads to a better approximation of the steady-state dynamics of the system regarding computing Koopman and Perron- Frobenius operator eigenfunctions and eigenvalues. However, preserving positivity property is critical for capturing the real transient dynamics of the system. This positivity property of the transfer operators and it's finite-dimensional approximation play an important role for controller and estimator design of nonlinear systems. To solve the feedback stabilization problem for nonlinear control systems, we tried to take advantage of the Koopman operator framework. The Koopman operator approach provides a linear representation for a nonlinear dynamical system and a bilinear representation for a nonlinear control system. The problem of feedback stabilization of a nonlinear control system is then transformed to the stabilization of a bilinear control system. We propose a control Lyapunov function (CLF)-based approach for the design of stabilizing feedback controllers for the bilinear system. The search for finding a CLF for the bilinear control system is formulated as a convex optimization problem. This leads to a schematic procedure for designing CLF-based stabilizing feedback controllers for the bilinear system and hence the original nonlinear system. Another advantage of the proposed controller design approach outlined in this dissertation is that it does not require explicit knowledge of system dynamics. In particular, the bilinear representation of a nonlinear control system in the Koopman eigenfunction space can be obtained from time-series data. Next, we study the optimal quadratic regulation problem for nonlinear systems. The linear operator theoretic framework involving the Koopman operator is used to lift the dynamics of nonlinear control system to an infinite-dimensional bilinear system. The optimal quadratic regulation problem for nonlinear system is formulated in terms of the finite-dimensional approximation of the bilinear system. A convex optimization-based approach is proposed for solving the quadratic regulator problem for bilinear system. We applied a variety of examples and compared the simulation results between our framework and conventional LQR control using linearized model. For more general optimal control problems, we provide a density-function based convex formulation for the optimal control problem of the nonlinear system. The convex formulation relies on the duality result in the stability theory of a dynamical system involving density function and Perron-Frobenius operator. The optimal control problem is formulated as an infinite-dimensional convex optimization program. The finite-dimensional approximation of the optimization problem relies on the recent advances made in the data-driven computation of the Koopman operator, which is dual to the Perron-Frobenius operator. Simulation results are presented to demonstrate the application of the developed framework.

Huang, Bowen↗

A space station onboard scheduling assistant

One of the goals for the Space Station is to achieve greater autonomy, and have less reliance on ground commanding than previous space missions. This means that the crew will have to take an active role in scheduling and rescheduling their activities onboard, perhaps working from preliminary schedules generated on the ground. Scheduling is a time intensive task, whether performed manually or automatically, so the best approach to solving onboard scheduling problems may involve crew members working with an interactive software scheduling package. A project is described which investigates a system that uses knowledge based techniques for the rescheduling of experiments within the Materials Technology Laboratory of the Space Station. Particular attention is paid to: (1) methods for rapid response rescheduling to accommodate unplanned changes in resource availability, (2) the nature of the interface to the crew, (3) the representation of the many types of data within the knowledge base, and (4) the possibility of applying rule-based and constraint-based reasoning methods to onboard activity scheduling.

Brindle, A. F.↗

The 3-D world modeling with updating capability based on combinatorial geometry

A 3-D world modeling technique using range data is discribed. Range data quantify the distances from the sensor focal plane to the object surface, i.e., the 3-D coordinates of discrete points on the object surface are known. The approach proposed herein for 3-D world modeling is based on the Combinatorial Geometry (CG) method which is widely used in Monte Carlo particle transport calculations. First, each measured point on the object surface is surrounded by a small sphere with a radius determined by the range to that point. Then, the 3-D shapes of the visible surfaces are obtained by taking the (Boolean) union of all the spheres. The result is an unambiguous representation of the object's boundary surfaces. The pre-learned partial knowledge of the environment can be also represented using the CG Method with a relatively small amount of data. Using the CG type of representation, distances in desired directions to boundary surfaces of various objects are efficiently calculated. This feature is particularly useful for continuously verifying the world model against the data provided by a range finder, and for integrating range data from successive locations of the robot during motion. The efficiency of the proposed approach is illustrated by simulations of a spherical robot in a 3-D room in the presence of moving obstacles and inadequate prelearned partial knowledge of the environment.

Goldstein, M.↗

COVID19 Disease Map, a computational knowledge repository of virus–host interaction mechanisms

We need to effectively combine the knowledge from surging literature with complex datasets to propose mechanistic models of SARS-CoV-2 infection, improving data interpretation and predicting key targets of intervention. Here, we describe a large-scale community effort to build an open access, interoperable and computable repository of COVID-19 molecular mechanisms. The COVID-19 Disease Map (C19DMap) is a graphical, interactive representation of disease-relevant molecular mechanisms linking many knowledge sources. Notably, it is a computational resource for graph-based analyses and disease modelling. To this end, we established a framework of tools, platforms and guidelines necessary for a multifaceted community of biocurators, domain experts, bioinformaticians and computational biologists. The diagrams of the C19DMap, curated from the literature, are integrated with relevant interaction and text mining databases. We demonstrate the application of network analysis and modelling approaches by concrete examples to highlight new testable hypotheses. This framework helps to find signatures of SARS-CoV-2 predisposition, treatment response or prioritisation of drug candidates. Such an approach may help deal with new waves of COVID-19 or similar pandemics in the long-term perspective.

59 BASIC BIOLOGICAL SCIENCES↗

Modeling dust mineralogical composition: sensitivity to soil mineralogy atlases and their expected climate impacts

Soil dust aerosols are a key component of the climate system, as they interact with short- and long-wave radiation, alter cloud formation processes, affect atmospheric chemistry and play a role in biogeochemical cycles by providing nutrient inputs such as iron and phosphorus. The influence of dust on these processes depends on its physicochemical properties, which, far from being homogeneous, are shaped by its regionally varying mineral composition. The relative amount of minerals in dust depends on the source region and shows a large geographical variability. However, many state-of-the-art Earth system models (ESMs), upon which climate analyses and projections rely, still consider dust mineralogy to be invariant. The explicit representation of minerals in ESMs is more hindered by our limited knowledge of the global soil composition along with the resulting size-resolved airborne mineralogy than by computational constraints. In this work we introduce an explicit mineralogy representation within the state-of-the-art Multiscale Online Nonhydrostatic AtmospheRe CHemistry (MONARCH) model. We review and compare two existing soil mineralogy datasets, which remain a source of uncertainty for dust mineralogy modeling and provide an evaluation of multiannual simulations against available mineralogy observations. Soil mineralogy datasets are based on measurements performed after wet sieving, which breaks the aggregates found in the parent soil. Our model predicts the emitted particle size distribution (PSD) in terms of its constituent minerals based on brittle fragmentation theory (BFT), which reconstructs the emitted mineral aggregates destroyed by wet sieving. Our simulations broadly reproduce the most abundant mineral fractions independently of the soil composition data used. Feldspars and calcite are highly sensitive to the soil mineralogy map, mainly due to the different assumptions made in each soil dataset to extrapolate a handful of soil measurements to arid and semi-arid regions worldwide. For the least abundant or more difficult-to-determine minerals, such as iron oxides, uncertainties in soil mineralogy yield differences in annual mean aerosol mass fractions of up to ~ 100 %. Although BFT restores coarse aggregates including phyllosilicates that usually break during soil analysis, we still identify an overestimation of coarse quartz mass fractions (above 2 µm in diameter). In a dedicated experiment, we estimate the fraction of dust with undetermined composition as given by a soil map, which makes up ~ 10 % of the emitted dust mass at the global scale and can be regionally larger. Changes in the underlying soil mineralogy impact our estimates of climate-relevant variables, particularly affecting the regional variability of the single-scattering albedo at solar wavelengths or the total iron deposited over oceans. All in all, this assessment represents a baseline for future model experiments including new mineralogical maps constrained by high-quality spaceborne hyperspectral measurements, such as those arising from the NASA Earth Surface Mineral Dust Source Investigation (EMIT) mission.

54 ENVIRONMENTAL SCIENCES↗

Modeling Dust Mineralogical Composition: Sensitivity to Soil Mineralogy Atlases and Their Expected Climate Impacts

Soil dust aerosols are a key component of the climate system, as they interact with short- and long-wave radiation, alter cloud formation processes, affect atmospheric chemistry and play a role in biogeochemical cycles by providing nutrient inputs such as iron and phosphorus. The influence of dust on these processes depends on its physicochemical properties, which, far from being homogeneous, are shaped by its regionally varying mineral composition. The relative amount of minerals in dust depends on the source region and shows a large geographical variability. However, many state-of-the-art Earth system models (ESMs), upon which climate analyses and projections rely, still consider dust mineralogy to be invariant. The explicit representation of minerals in ESMs is more hindered by our limited knowledge of the global soil composition along with the resulting size-resolved airborne mineralogy than by computational constraints. In this work we introduce an explicit mineralogy representation within the state-of-the-art Multiscale Online Nonhydrostatic AtmospheRe CHemistry (MONARCH) model. We review and compare two existing soil mineralogy datasets, which remain a source of uncertainty for dust mineralogy modeling and provide an evaluation of multiannual simulations against available mineralogy observations. Soil mineralogy datasets are based on measurements performed after wet sieving, which breaks the aggregates found in the parent soil. Our model predicts the emitted particle size distribution (PSD) in terms of its constituent minerals based on brittle fragmentation theory (BFT), which reconstructs the emitted mineral aggregates destroyed by wet sieving. Our simulations broadly reproduce the most abundant mineral fractions independently of the soil composition data used. Feldspars and calcite are highly sensitive to the soil mineralogy map, mainly due to the different assumptions made in each soil dataset to extrapolate a handful of soil measurements to arid and semi-arid regions worldwide. For the least abundant or more difficult-to-determine minerals, such as iron oxides, uncertainties in soil mineralogy yield differences in annual mean aerosol mass fractions of up to ∼ 100 %. Although BFT restores coarse aggregates including phyllosilicates that usually break during soil analysis, we still identify an overestimation of coarse quartz mass fractions (above 2 µm in diameter). In a dedicated experiment, we estimate the fraction of dust with undetermined composition as given by a soil map, which makes up ∼ 10 % of the emitted dust mass at the global scale and can be regionally larger. Changes in the underlying soil mineralogy impact our estimates of climate-relevant variables, particularly affecting the regional variability of the single-scattering albedo at solar wavelengths or the total iron deposited over oceans. All in all, this assessment represents a baseline for future model experiments including new mineralogical maps constrained by high-quality spaceborne hyperspectral measurements, such as those arising from the NASA Earth Surface Mineral Dust Source Investigation (EMIT) mission.

Soil dust↗

Specification, Design, and Analysis of Advanced HUMS Architectures

During the two-year project period, we have worked on several aspects of domain-specific architectures for HUMS. In particular, we looked at using scenario-based approach for the design and designed a language for describing such architectures. The language is now being used in all aspects of our HUMS design. In particular, we have made contributions in the following areas. 1) We have employed scenarios in the development of HUMS in three main areas. They are: (a) To improve reusability by using scenarios as a library indexing tool and as a domain analysis tool; (b) To improve maintainability by recording design rationales from two perspectives - problem domain and solution domain; (c) To evaluate the software architecture. 2) We have defined a new architectural language called HADL or HUMS Architectural Definition Language. It is a customized version of xArch/xADL. It is based on XML and, hence, is easily portable from domain to domain, application to application, and machine to machine. Specifications written in HADL can be easily read and parsed using the currently available XML parsers. Thus, there is no need to develop a plethora of software to support HADL. 3) We have developed an automated design process that involves two main techniques: (a) Selection of solutions from a large space of designs; (b) Synthesis of designs. However, the automation process is not an absolute Artificial Intelligence (AI) approach though it uses a knowledge-based system that epitomizes a specific HUMS domain. The process uses a database of solutions as an aid to solve the problems rather than creating a new design in the literal sense. Since searching is adopted as the main technique, the challenges involved are: (a) To minimize the effort in searching the database where a very large number of possibilities exist; (b) To develop representations that could conveniently allow us to depict design knowledge evolved over many years; (c) To capture the required information that aid the automation process.

Mukkamala, Ravi↗

Extreme Wet and Dry Conditions Affected Differently by Greenhouse Gases and Aerosols

Global warming due to greenhouse gases and atmospheric aerosols alter precipitation rates, but the influence on extreme precipitation by aerosols relative to greenhouse gases is still not well known. Here we use the simulations from the Precipitation Driver and Response Model Intercomparison Project that enable us to compare changes in mean and extreme precipitation due to greenhouse gases with those due to black carbon and sulfate aerosols, using indicators for dry extremes as well as for moderate and very extreme precipitation. Generally, we find that the more extreme a precipitation event is, the more pronounced is its response relative to global mean surface temperature change, both for aerosol and greenhouse gas changes. Black carbon (BC) stands out with distinct behavior and large differences between individual models. Dry days become more frequent with BC-induced warming compared to greenhouse gases, but so does the intensity and frequency of extreme precipitation. An increase in sulfate aerosols cools the surface and thereby the atmosphere, and thus induces a reduction in precipitation with a stronger effect on extreme than on mean precipitation. A better understanding and representation of these processes in models will provide knowledge for developing strategies for both climate change and air pollution mitigation.

Sillmann, Jana↗

Deep Domain Adaptation based Cloud Type Detection using Active and Passive Satellite Data

Domain adaptation techniques have been developed to handle data from multiple sources or domains. Most existing domain adaptation models assume that source and target domains are homogeneous, i.e., they have the same feature space. Nevertheless, many real world applications often deal with data from heterogeneous domains that come from completely different feature spaces. In our remote sensing application, data in source domain (from an active spaceborne Lidar sensor CALIOP onboard CALIPSO satellite) contain 25 attributes, while data in target domain (from a passive spectroradiometer sensor VIIRS onboard Suomi-NPP satellite) contain 20 different attributes. CALIOP has better representation capability and sensitivity to aerosol types and cloud phase, while VIIRS has wide swaths and better spatial coverage but has inherent weakness in differentiating atmospheric objects on different vertical levels. To address this mismatch of features across the domains/sensors, we propose a novel end-to-end deep domain adaptation with domain mapping and correlation alignment (DAMA) to align the heterogeneous source and target domains in active and passive satellite remote sensing data. It can learn domain invariant representation from source and target domains by transferring knowledge across these domains, and achieve additional performance improvement by incorporating weak label information into the model (DAMA-WL). Our experiments on a collocated CALIOP and VIIRS dataset show that DAMA and DAMA-WL can achieve higher classification accuracy in predicting cloud types.

domain adaptation↗

Graph Neural Networks for Particle Reconstruction in High Energy Physics detectors

Pattern recognition problems in high energy physics are notably different from traditional machine learning applications in computer vision. Reconstruction algorithms identify and measure the kinematic properties of particles produced in high energy collisions and recorded with complex detector systems. Two critical applications are the reconstruction of charged particle trajectories in tracking detectors and the reconstruction of particle showers in calorimeters. These two problems have unique challenges and characteristics, but both have high dimensionality, high degree of sparsity, and complex geometric layouts. Graph Neural Networks (GNNs) are a relatively new class of deep learning architectures which can deal with such data effectively, allowing scientists to incorporate domain knowledge in a graph structure and learn powerful representations leveraging that structure to identify patterns of interest. In this work we demonstrate the applicability of GNNs to these two diverse particle reconstruction problems.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Representation in incremental learning

Work focused on two areas in machine learning: representation for inductive learning and how to apply concept learning techniques to learning state preferences, which can represent search control knowledge for problem solving. Specifically, in the first area the issues of the effect of representation on learning, on how learning formalisms are biased, and how concept learning can benefit from the use of a hybrid formalism are addressed. In the second area, the issues of developing an agent to learn search control knowledge from the relative values of states, of the source of that qualitative information, and of the ability to use both quantitative and qualitative information in order to develop an effective problem-solving policy are examined.

Source record↗

Qualitative trend analysis based on a mixed-integer representation

Shape constrained spline fitting is a useful method to impose prior knowledge onto flexible semi-parametric models during parameter estimation. Most typically, the function shape is imposed through order restrictions on the regression coefficients. The intended shape is considered known or selected based on heuristic rules. In this study, we present a method to estimate the optimal set of order restrictions to segment a univariate data series into episodes with distinct shapes. This is also known as the qualitative trend analysis (QTA) problem. The obtained solution uses a trade-off between lack-of-fit and model complexity. Further, our practical implementation takes inspiration from the generalized order restricted information criterion (GORIC) for inequality-constrained model selection. From this, one learns (a) that QTA can be formulated as a mixed-integer quadratic program (MIQP) and (b) that the newly proposed mixed order restricted information criterion (MORIC) enables optimal segmentation. This is illustrated through didactic case studies.

42 ENGINEERING↗

Procedural knowledge

Much of commonsense knowledge about the real world is in the form of procedures or sequences of actions for achieving particular goals. In this paper, a formalism is presented for representing such knowledge using the notion of process. A declarative semantics for the representation is given, which allows a user to state facts about the effects of doing things in the problem domain of interest. An operational semantics is also provided, which shows how this knowledge can be used to achieve particular goals or to form intentions regarding their achievement. Given both semantics, the formalism additionally serves as an executable specification language suitable for constructing complex systems. A system based on this formalism is described, and examples involving control of an autonomous robot and fault diagnosis for NASA's Space Shuttle are provided.

Georgeff, Michael P.↗

Soil Carbon Saturation: What Do We Really Know?

Managing soils to increase organic carbon storage presents a potential opportunity to mitigate and adapt to global change challenges, while providing numerous co-benefits and ecosystem services. However, soils differ widely in their potential for carbon sequestration, and knowledge of biophysical limits to carbon accumulation may aid in informing priority regions. Consequently, there is great interest in assessing whether soils exhibit a maximum capacity for storing organic carbon, particularly within organo–mineral associations given the finite nature of reactive minerals in a soil. While the concept of soil carbon saturation has existed for over 25 years, recent studies have argued for and against its importance. Here, we summarize the conceptual understanding of soil carbon saturation at both micro- and macro-scales, define key terminology, and address common concerns and misconceptions. We review methods used to quantify soil carbon saturation, highlighting the theory and potential caveats of each approach. Critically, we explore the utility of the principles of soil carbon saturation for informing carbon accumulation, vulnerability to loss, and representations in process-based models. We highlight key knowledge gaps and propose next steps for furthering our mechanistic understanding of soil carbon saturation and its implications for soil management.

Environmental sciences↗

Identifying intragenic functional modules of genomic variations associated with cancer phenotypes by learning representation of association networks

Background Genome-wide Association Studies (GWAS) aims to uncover the link between genomic variation and phenotype. They have been actively applied in cancer biology to investigate associations between variations and cancer phenotypes, such as susceptibility to certain types of cancer and predisposed responsiveness to specific treatments. Since GWAS primarily focuses on finding associations between individual genomic variations and cancer phenotypes, there are limitations in understanding the mechanisms by which cancer phenotypes are cooperatively affected by more than one genomic variation. Results This paper proposes a network representation learning approach to learn associations among genomic variations using a prostate cancer cohort. The learned associations are encoded into representations that can be used to identify functional modules of genomic variations within genes associated with early- and late-onset prostate cancer. The proposed method was applied to a prostate cancer cohort provided by the Veterans Administration’s Million Veteran Program to identify candidates for functional modules associated with early-onset prostate cancer. The cohort included 33,159 prostate cancer patients, 3181 early-onset patients, and 29,978 late-onset patients. The reproducibility of the proposed approach clearly showed that the proposed approach can improve the model performance in terms of robustness. Conclusions To our knowledge, this is the first attempt to use a network representation learning approach to learn associations among genomic variations within genes. Associations learned in this way can lead to an understanding of the underlying mechanisms of how genomic variations cooperatively affect each cancer phenotype. This method can reveal unknown knowledge in the field of cancer biology and can be utilized to design more advanced cancer-targeted therapies.

60 APPLIED LIFE SCIENCES↗

Knowledge engineering for temporal dependency networks as operations procedures

This paper presents a case study of the knowledge engineering process employed to support the Link Monitor and Control Operator Assistant (LMCOA). The LMCOA is a prototype system which automates the configuration, calibration, test, and operation (referred to as precalibration) of the communications, data processing, metric data, antenna, and other equipment used to support space-ground communications with deep space spacecraft in NASA's Deep Space Network (DSN). The primary knowledge base in the LMCOA is the Temporal Dependency Network (TDN), a directed graph which provides a procedural representation of the precalibration operation. The TDN incorporates precedence, temporal, and state constraints and uses several supporting knowledge bases and data bases. The paper provides a brief background on the DSN, and describes the evolution of the TDN and supporting knowledge bases, the process used for knowledge engineering, and an analysis of the successes and problems of the knowledge engineering effort.

Fayyad, Kristina E.↗