Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “graph analysis”

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 523 records · Page 29

Transient analysis of unbalanced short circuits of the ERDA-NASA 100 kW wind turbine alternator

Unbalanced short-circuit faults on the alternator of the ERDA-NASA Mod-O100-kW experimental wind turbine are studied. For each case, complete solutions for armature, field, and damper-circuit currents; short-circuit torque; and open-phase voltage are derived directly by a mathematical analysis. Formulated results are tabulated. For the Mod-O wind turbine alternator, numerical calculations are given, and results are presented by graphs. Comparisons for significant points among the more important cases are summarized. For these cases the transients are found to be potentially severe. The effect of the alternator neutral-to-ground impedance is evaluated.

Hwang, H. H.↗

Computer architecture for efficient algorithmic executions in real-time systems: New technology for avionics systems and advanced space vehicles

Improvements and advances in the development of computer architecture now provide innovative technology for the recasting of traditional sequential solutions into high-performance, low-cost, parallel system to increase system performance. Research conducted in development of specialized computer architecture for the algorithmic execution of an avionics system, guidance and control problem in real time is described. A comprehensive treatment of both the hardware and software structures of a customized computer which performs real-time computation of guidance commands with updated estimates of target motion and time-to-go is presented. An optimal, real-time allocation algorithm was developed which maps the algorithmic tasks onto the processing elements. This allocation is based on the critical path analysis. The final stage is the design and development of the hardware structures suitable for the efficient execution of the allocated task graph. The processing element is designed for rapid execution of the allocated tasks. Fault tolerance is a key feature of the overall architecture. Parallel numerical integration techniques, tasks definitions, and allocation algorithms are discussed. The parallel implementation is analytically verified and the experimental results are presented. The design of the data-driven computer architecture, customized for the execution of the particular algorithm, is discussed.

Carroll, Chester C.↗

Compiling and editing agricultural strata boundaries with remotely sensed imagery and map attribute data using graphics workstations

The USDA presently uses labor-intensive photographic interpretation procedures to delineate large geographical areas into manageable size sampling units for the estimation of domestic crop and livestock production. Computer software to automate the boundary delineation procedure, called the computer-assisted stratification and sampling (CASS) system, was developed using a Hewlett Packard color-graphics workstation. The CASS procedures display Thematic Mapper (TM) satellite digital imagery on a graphics display workstation as the backdrop for the onscreen delineation of sampling units. USGS Digital Line Graph (DLG) data for roads and waterways are displayed over the TM imagery to aid in identifying potential sample unit boundaries. Initial analysis conducted with three Missouri counties indicated that CASS was six times faster than the manual techniques in delineating sampling units.

Cheng, Thomas D.↗

Topological structure of complex predictions

Abstract Current complex prediction models are the result of fitting deep neural networks, graph convolutional networks or transducers to a set of training data. A key challenge with these models is that they are highly parameterized, which makes describing and interpreting the prediction strategies difficult. We use topological data analysis to transform these complex prediction models into a simplified topological view of the prediction landscape. The result is a map of the predictions that enables inspection of the model results with more specificity than dimensionality-reduction methods such as tSNE and UMAP. The methods scale up to large datasets across different domains. We present a case study of a transformer-based model previously designed to predict expression levels of a piece of DNA in thousands of genomic tracks. When the model is used to study mutations in the BRCA1 gene, our topological analysis shows that it is sensitive to the location of a mutation and the exon structure of BRCA1 in ways that cannot be found with tools based on dimensionality reduction. Moreover, the topological framework offers multiple ways to inspect results, including an error estimate that is more accurate than model uncertainty. Further studies show how these ideas produce useful results in graph-based learning and image classification.

Computer Science↗

Anonymization of Network Traces Data through Condensation-based Differential Privacy

Network traces are considered a primary source of information to researchers, who use them to investigate research problems such as identifying user behavior, analyzing network hierarchy, maintaining network security, classifying packet flows, and much more. However, most organizations are reluctant to share their data with a third party or the public due to privacy concerns. Therefore, data anonymization prior to sharing becomes a convenient solution to both organizations and researchers. Although several anonymization algorithms are available, few of them allow sufficient privacy (organization need), acceptable data utility (researcher need), and efficient data analysis at the same time. This article introduces a condensation-based differential privacy anonymization approach that achieves an improved tradeoff between privacy and utility compared to existing techniques and produces anonymized network trace data that can be shared publicly without lowering its utility value. Our solution also does not incur extra computation overhead for the data analyzer. A prototype system has been implemented, and experiments have shown that the proposed approach preserves privacy and allows data analysis without revealing the original data even when injection attacks are launched against it. When anonymized datasets are given as input to graph-based intrusion detection techniques, they yield almost identical intrusion detection rates as the original datasets with only a negligible impact.

97 MATHEMATICS AND COMPUTING↗

Detecting Living-off-the-land Attacks Using K-means And Graph Convolutional Networks

The code ingests Zeek logs derived from network packet captures and goes through data preprocessing before it gets passed into a K-Means model that labels each device as either a client or server. Graph Convolutional Network (GCN) model is used to obtain the embeddings to represent the features in lower dimension. Last, K-means cluster analysis is used to cluster the embeddings for each class.

Quach, Anna [Idaho National Laboratory (INL), Idah↗

Space station needs, attributes and architectural options: Mission requirements

Various mission requirements for the proposed space station are examined. Subjects include modelling methodology, science applications, commercial opportunities, operations analysis, integrated mission requirements, and the role of man in space station functions and activities. The information is presented through the use of graphs.

Source record↗

The use of underwater dynamometry to evaluate two space suits

Four Astronauts were instrumented and donned one of three extravehicular activity (EVA) suits: the currently in use shuttle suit (STS), the Mark III (MK3), and the AX5. The STS was used as the comparison suit because of approved status. Each subject performed ten different exercises in each suit in three different manners (static, dynamic and fatigue) in two different environments, WETF and KC-135 (KC-135 not completed as of this report). Data were recorded from a flight qualified underwater dynamometer (Cybex power head) with a TEAC multichannel recorder/tape and downloaded into the VAX computer system for analysis. Also direct hard copy strip chart recordings were made for backup comparisons. Data were analyzed using the ANOVA procedure and results were graphed and reported without interpretation to the NASA/JSC ABL manager.

Squires, W. G.↗

American Alligator Research on the Kennedy Space Center

This slide presentation reviews the research conducted at the Kennedy Space Center on the American Alligator. The objectives of the research were to establish life history baseline at the Kennedy Space Center and at the Merit Island National Wildlife Reserve (MINWR). Some of the factors that were examined are: nesting success, movement patterns, and population structure. Another objective was to determine the overall health of the alligator population, by analyzing blood and tissue chemistry, and urine analysis. A third objective was to compare alligators at KSC/MINWR to the statewide population. Some of the results are shown in charts and graphs.

Lowers, Russell H.↗

Optimal Sizing of Movable Energy Resources for Enhanced Resilience in Distribution Systems: A Techno-Economic Analysis

This article introduces a techno-economic analysis aimed at identifying the optimal total size of movable energy resources (MERs) to enhance the resilience of electric power supply. The core focus of this approach is to determine the total size of MERs required within the distribution network to expedite restoration after extreme events. Leveraging distribution line fragility curves, the proposed methodology generates numerous line outage scenarios, with scenario reduction techniques employed to minimize computational burden. For each reduced multiple line outage scenario, a systematic reconfiguration of the distribution network, represented as a graph, is executed using tie-switches within the system. To evaluate each locational combination of MERs for a specific number of these resources, the expected load curtailment (ELC) is calculated by summing the load curtailment within microgrids formed due to multiple line outages. This process is repeated for all possible locational combinations of MERs to determine minimal ELC for each MER total size. For every MER total size, the minimal ELCs are determined. Finally, a techno-economic analysis is performed using power outage cost and investment cost of MERs to pinpoint an optimal total size of MERs for the distribution system. To demonstrate the effectiveness of the proposed approach, case studies are conducted on the 33-node and the modified IEEE 123-node distribution test systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Integrating the PanDA Workload Management System with the Vera C. Rubin Observatory

The Vera C. Rubin Observatory will produce an unprecedented astronomical data set for studies of the deep and dynamic universe. Its Legacy Survey of Space and Time (LSST) will image the entire southern sky every three to four days and produce tens of petabytes of raw image data and associated calibration data over the course of the experiment’s run. More than 20 terabytes of data must be stored every night, and annual campaigns to reprocess the entire dataset since the beginning of the survey will be conducted over ten years. The Production and Distributed Analysis (PanDA) system was evaluated by the Rubin Observatory Data Management team and selected to serve the Observatory’s needs due to its demonstrated scalability and flexibility over the years, for its Directed Acyclic Graph (DAG) support, its support for multi-site processing, and its highly scalable complex workflows via the intelligent Data Delivery Service (iDDS). PanDA is also being evaluated for prompt processing where data must be processed within 60 seconds after image capture. This paper will briefly describe the Rubin Data Management system and its Data Facilities (DFs). Finally, it will describe in depth the work performed in order to integrate the PanDA system with the Rubin Observatory to be able to run the Rubin Science Pipelines using PanDA.

79 ASTRONOMY AND ASTROPHYSICS↗

Using Machine Learning for Quantum Annealing Accuracy Prediction

Quantum annealers, such as the device built by D-Wave Systems, Inc., offer a way to compute solutions of NP-hard problems that can be expressed in Ising or quadratic unconstrained binary optimization (QUBO) form. Although such solutions are typically of very high quality, problem instances are usually not solved to optimality due to imperfections of the current generations quantum annealers. In this contribution, we aim to understand some of the factors contributing to the hardness of a problem instance, and to use machine learning models to predict the accuracy of the D-Wave 2000Q annealer for solving specific problems. We focus on the maximum clique problem, a classic NP-hard problem with important applications in network analysis, bioinformatics, and computational chemistry. By training a machine learning classification model on basic problem characteristics such as the number of edges in the graph, or annealing parameters, such as the D-Wave’s chain strength, we are able to rank certain features in the order of their contribution to the solution hardness, and present a simple decision tree which allows to predict whether a problem will be solvable to optimality with the D-Wave 2000Q. We extend these results by training a machine learning regression model that predicts the clique size found by D-Wave.

97 MATHEMATICS AND COMPUTING↗

Thermal conductivity, electrical resistivity, and thermopower of aerospace alloys from 4 to 300 K.

Measurement of thermal conductivity, electrical resistivity, and thermopower for several aerospace alloys: titanium alloy A110-AT, aluminum alloy 7039, Inconel 718, and Hastelloy X. Tables and graphs of the measured properties and Lorenz ratio are presented over the range from 4 to 300 K. Comparisons to other measurements and theoretical analysis of the data are included. The uncertainties of the property data are estimated as 0.7 to 2.5% for thermal conductivity, 0.25% in electrical resistivity, and about 0.1 microvolt/K in thermopower.

Hust, J. G.↗

Isomorphisms between Petri nets and dataflow graphs

Dataflow graphs are a generalized model of computation. Uninterpreted dataflow graphs with nondeterminism resolved via probabilities are shown to be isomorphic to a class of Petri nets known as free choice nets. Petri net analysis methods are readily available in the literature and this result makes those methods accessible to dataflow research. Nevertheless, combinatorial explosion can render Petri net analysis inoperative. Using a previously known technique for decomposing free choice nets into smaller components, it is demonstrated that, in principle, it is possible to determine aspects of the overall behavior from the particular behavior of components.

Kavi, Krishna M.↗

Automatic Data Distribution for CFD Applications on Structured Grids

Data distribution is an important step in implementation of any parallel algorithm. The data distribution determines data traffic, utilization of the interconnection network and affects the overall code efficiency. In recent years a number data distribution methods have been developed and used in real programs for improving data traffic. We use some of the methods for translating data dependence and affinity relations into data distribution directives. We describe an automatic data alignment and placement tool (ADAPT) which implements these methods and show it results for some CFD codes (NPB and ARC3D). Algorithms for program analysis and derivation of data distribution implemented in ADAPT are efficient three pass algorithms. Most algorithms have linear complexity with the exception of some graph algorithms having complexity O(n(sup 4)) in the worst case.

Frumkin, Michael↗

Automatic Data Distribution for CFD Applications on Structured Grids

Data distribution is an important step in implementation of any parallel algorithm. The data distribution determines data traffic, utilization of the interconnection network and affects the overall code efficiency. In recent years a number data distribution methods have been developed and used in real programs for improving data traffic. We use some of the methods for translating data dependence and affinity relations into data distribution directives. We describe an automatic data alignment and placement tool (ADAFT) which implements these methods and show it results for some CFD codes (NPB and ARC3D). Algorithms for program analysis and derivation of data distribution implemented in ADAFT are efficient three pass algorithms. Most algorithms have linear complexity with the exception of some graph algorithms having complexity O(n(sup 4)) in the worst case.

Frumkin, Michael↗