Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Semantics”

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 127 records · Page 7

Towards a Formal Semantics of Flight Plans and Trajectories

In the National Airspace System, ight plans are often used only as a planning tool by air trac controllers and aircraft operators. These plans are implicitly translated into trajectories by the pilot or by the ight management system, and subsequently own by the aircraft. This translation process inevitably introduces di erences between the plan and the trajectory. However, given the current intended usage, exact correspondence between the plan and the trajectory is not needed. To achieve greater capacity and eciency, future air trac management concepts are being designed around the use of trajectories where predictability is extremely important. In this paper, a mathematical relationship between ight plans and trajectories is explored with the goal of making feasible, highly accurate predictions of future positions and velocities of aircraft. The goal here is to describe, in mathematically precise detail, a formal language of trajectories, whereby all receivers of the trajectory information will be able to arrive at precisely the same trajectory predication and to do this without having aircraft broadcast a large amount of data. Although even a four-dimensional ight plan is simple in structure, this paper will show that it is inherently ambiguous and will explore these issues in detail. In e ect, we propose that a rigorous semantics for ight plans can be developed and this will serve as an important stepping stone towards trajectory-based operations in the National Airspace System.

Hagen, George E.↗

NASA's ATM Ontology: Semantic Integration and Querying Across NAS Data Sources

NASA is developing an Air Traffic Management (ATM) Ontology as part of an advanced prototyping activity that demonstrates the utility of semantic technologies for integrating, querying, and searching over various sources of heterogeneous ATM data. The ontology encodes an overarching data model that functions as the backbone upon which to overlay data from multiple sources published by FAA, NOAA, NASA, and others. The integrated data can be queried to produce results not achievable using any single source alone. The ontology incorporates flight data, weather data, traffic management advisory data, airport delay data, and national airspace infrastructure data for a very limited spatial and temporal slice of airspace operations (one day of operations at a major airport).

air traffic management↗

Automated Semantic Segmentation for Volumetric Cardiovascular Feature Quantification and Pathology Assessment

We present a pipeline method that curtails the expense and observer bias of manual cardiac evaluation by combining semantic segmentation and disease classification as a fully automatic processing pipeline. The initial element consists of a 2D U-Net convolutional neural network architecture for voxel-wise segmentation of the myocardium and ventricular cavities. The results of the segmentation were used to compute a comprehensive volumetric feature matrix that captured diagnostic clinical procedure data and that was used to model a cardiac pathology classifier.Our approach evaluated anonymized parasternal MRI cardiac images from a database of 100 patients (4 pathology groups, 1 healthy group, 20 patients per group) examined at the University Hospital of Dijon. We achieved top average Dice index scores of 0.939, 0.849, 0.886 for structure segmentation of the left ventricle (LV), right ventricle (RV) and myocardium respectively. A 5-ary pathology classification accuracy of 90% was recorded on an independent test set using our trained model.

Lindsey, Tony↗

Information Extraction on an Earth Science Knowledge Graphs with Semantic Parsing

Knowledge graphs are an important tool, both for representing knowledge and for retrieving information. Fundamentally, they are semantic networks that represent entities and relationships in the form of nodes and edges. A large corpus of natural language text can bebroken down into discrete entities and relationships to form a useful knowledge graph. Existing research breaks down text into a subject, object, and verb relationship triple. Although this is a useful first step, it loses much of the original contextual information encoded within the text. Our process uses a novel 7-tuple approach, in which elements of sentences are programmatically parsed into seven categories: initiator, impacted, receiver, beneficiary, result, and context. In this presentation, we show a knowledge graph built using this 7-tupleprocessing of an Earth science corpus. We explain the techniques used to create the graph and analyze its information retrieval capability while assessing the accuracy and limitations of the results.

Carson Davis↗

Computer processing through distance-based quality score method in geospatial-temporal semantic graphs

A computer-implemented method of improving processing of overhead image data by a processor using a distance-based quality score in a geospatial-temporal semantic graph. An allowable range for each attribute in the subgraph search template is defined. For each match in a comparison, attribute values of each match element are compared against the preferred range and the allowable range to compute a corresponding distance of each match attribute from the subgraph search template. A corresponding overall match quality score is determined for each match from the subgraph search template, wherein determining the corresponding overall match qualities is performed using a corresponding required quality score and a corresponding optional quality score. All corresponding overall match quality scores are sorted into an ordered list and then displayed.

97 MATHEMATICS AND COMPUTING↗

Using Graph Edit Distance for Noisy Subgraph Matching of Semantic Property Graphs

The subgraph matching problem is a fundamental problem in graph theory that is known to be NP-complete. In this study, performers were asked to develop algorithms to search for semantic property graphs that were subgraphs of a large knowledge graph. The templates provided contained structural information about the subgraphs and some attributes for each node and edge. There also exists a similarity measure between a set of attribute values that occurs on every node and edge. Algorithms performed well in the case where an exact match existed, but performers were also provided templates that had noise added such that there existed no match in the knowledge graph. Performers were asked to find the closest matches to those noisy subgraphs. To evaluate performance on this task, we developed a version of the graph edit distance algorithm to measure the cost of editing the template graph so that it is isomorphic in structure and attributes to the performer submission.

Ebsch, Christopher L.↗

Autonomous semantic data discovery for distributed networked systems

Systems, methods, techniques and apparatuses for managing distributed applications of networked intelligent agents are disclosed. The agents are operably to autonomously discover semantic profiles and associated data of other agents in a networked system participating in a given application. The agents need not be in direct communication with or known to all the other agents in the networked system.

Brissette, Alexander↗

Unsupervised Azimuth Estimation of Solar Arrays in Low-Resolution Satellite Imagery through Semantic Segmentation and Hough Transform

This paper explains the use of a convolutional neural network (CNN) to segment solar panels in a satellite image containing solar arrays, and extract associated metadata from the arrays. A novel unsupervised technique is introduced to estimate the azimuth of each individual solar panel from the predicted mask of the convolutional neural network. This pipeline was developed with the aim of extracting necessary metadata for a solar installation, using only a set of latitude–longitude coordinates. Azimuth prediction results for 669 individual solar installations associated with 387 sites located across the United States are provided. A mean average error and median average error of 21.65 degrees and 1.0 degrees were obtained, respectively, when predicting the azimuth of the solar fleet data set, with about 80% of the results within an error of zero degrees of the ground truth azimuth value and about 85% within an error of 25 degrees. The predicted azimuth was then used to estimate the energy conversion of the solar arrays. Results show a 90.9 and 90.6 R-squared value for estimating alternating current (AC) and direct current (DC) energy, respectively, and a mean absolute percentage error (MAPE) of 1.70% in estimating the alternating current (AC) energy using the fully automated algorithm.

14 SOLAR ENERGY↗

Detecting and Characterizing Semantic Inconsistencies in Ported Code

Adding similar features and bug fixes often requires porting program patches from reference implementations and adapting them to target implementations. Porting errors may result from faulty adaptations or inconsistent updates. This paper investigates (1) the types of porting errors found in practice, and (2) how to detect and characterize potential porting errors. Analyzing version histories, we define five categories of porting errors, including incorrect control- and data-flow, code redundancy, inconsistent identifier renamings, etc. Leveraging this categorization, we design a static control- and data-dependence analysis technique, SPA, to detect and characterize porting inconsistencies. Our evaluation on code from four open-source projects shows that SPA can detect porting inconsistencies with 65% to 73% precision and 90% recall, and identify inconsistency types with 58% to 63% precision and 92% to 100% recall. In a comparison with two existing error detection tools, SPA improves precision by 14 to 17 percentage points.

Semantic Errors↗

Semantic Segmentation of High-Resolution Satellite Imagery using Generative Adversarial Networks with Progressive Growing

With increase in urbanization and Earth Sciences research into urban areas, the need to quickly and accurately segment urban rooftop maps has never been greater. Cur-rent machine learning techniques struggle to produce high accuracy maps in dense urban zones where there is high image noise and foot print overlap. In this paper, we evaluate a training methodology for pixel-wise segmentation for high resolution satellite imagery using progressive growing of generative adversarial networks as a solution. We apply our model to segmenting building rooftops and compare these results to conventional methods for rooftop segmentation. We evaluate our approach using the SpaceNet version 2 and xView datasets. Our experiments show that for SpaceNet, progressive Generative Adversarial Network (GAN) training achieved a test accuracy of 93% compared to 89% for traditional GAN training and 87% for U-Net architecture, while for xView, we achieved 71% accuracy using progressive GAN training compared to 69% through traditional GAN training and 65% using U-Net.

Semantic↗