Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “network analyzer”

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 217 records · Page 12

Phase Noise in Photonic Phased-Array Antenna Systems

The total noise of a phased-array antenna system employing a photonic feed network is analyzed using a model for the individual component noise including both additive and multiplicative equivalent noise generators.

Photonic Phased-Array Antenna Systems↗

Constellation Program Electrical Ground Support Equipment Research and Development

At the Kennedy Space Center, I engaged in the research and development of electrical ground support equipment for NASA's Constellation Program. Timing characteristics playa crucial role in ground support communications. Latency and jitter are two problems that must be understood so that communications are timely and consistent within the Kennedy Ground Control System (KGCS). I conducted latency and jitter tests using Alien-Bradley programmable logic controllers (PLCs) so that these two intrinsic network properties can be reduced. Time stamping and clock synchronization also play significant roles in launch processing and operations. Using RSLogix 5000 project files and Wireshark network protocol analyzing software, I verified master/slave PLC Ethernet module clock synchronization, master/slave IEEE 1588 communications, and time stamping capabilities. All of the timing and synchronization test results are useful in assessing the current KGCS operational level and determining improvements for the future.

McCoy, Keegan S.↗

The Orbiting Carbon Observatory (OCO-2) Tracks 2-3 Peta-Gram Increase in Carbon Release to the Atmosphere During the 2014-2016 El Nino

The powerful El Niño event of 2015-2016 - the third most intense since the 1950s - has exerted a large impact on the Earth's natural climate system. The column-averaged CO2 dry-air mole fraction (XCO2) observations from satellites and ground based networks are analyzed together with in situ observations for the period of September 2014 to October 2016. From the differences between satellite (OCO-2) observations and simulations using an atmospheric chemistry-transport model, we estimate that, relative to the mean annual fluxes for 2014, the most recent El Niño has contributed to an excess CO2 emission from the Earth's surface (land+ocean) to the atmosphere in the range of 2.4+/-0.2 PgC (1 Pg = 10(exp 15) g) over the period of July 2015 to June 2016. The excess CO2 flux is resulted primarily from reduction in vegetation uptake due to drought, and to a lesser degree from increased biomass burning. It is about the half of the CO2 flux anomaly (range: 4.4-6.7 PgC) estimated for the 1997/1998 El Niño. The annual total sink is estimated to be 3.9+/-0.2 PgC for the assumed fossil fuel emission of 10.1 PgC. The major uncertainty in attribution arise from error in anthropogenic emission trends, satellite data and atmospheric transport.

OCO-2↗

Command and Control Software Development

As NASA’s role in spaceflight operations change, so too does its design priorities. NASA’s flagship venture, the Space Launch System (SLS), is being created primarily to explore deep space. While commercial partners conduct low Earth orbit resupplies, tests, and even transportation of astronauts, NASA can divert more resources to more exciting projects - going back to the moon, or onwards to Mars. In the short term, this goal manifests in the upcoming Exploration Mission-1 (EM-1) test of the SLS, slated for as early as 2019. SLS, with the Orion capsule, will travel farther than any human-rated spacecraft has gone before. As the most powerful launch vehicle ever created, SLS requires many new innovations to ensure mission success. One such technology is the launch control software, which is the focus of this internship. The SLS launch control software is composed of many functions, all of which require rigorous testing to meet the standard of life-critical code. To facilitate easier testing, the first project I undertook was to customize the open-source tool Wireshark to the software team’s needs. Wireshark is a network protocol analyzer that can take in information about custom information packets. The launch control software will have several protocols that are custom to NASA. I ensured that all necessary component files were the correct file type and in the correct structure for Wireshark to compile. Having allowed Wireshark access to understand custom NASA data packets, testers of the launch control software will be able to find anomalies easier.

Wang, Zhengdong↗

The spatial distribution of ionospheric threats to WAAS integrity, 2000 – 2019: a systematic analysis

The United States’ Wide Area Augmentation System (WAAS) broadcasts data to facilitate aircraft navigation. This paper examines the spatial dependence of ionospheric disturbances that have threatened the accuracy and reliability of position estimates derived from these data over the period 2000 – 2019. We address two distinct aspects of this spatial dependence: (1) the geographic distribution of these threats, in particular, in relation to geomagnetic latitude, and (2) the geometric dependence of threats relative to the locations of the receiver sites that comprise the WAAS network. We analyze threat distributions in terms of the various means that WAAS employs to mitigate these threats, including the Extreme Storm Detector, the Moderate Storm Detector, local irregularity detectors, and the ionospheric threat model. Distinct distributions are presented for threats occurring in Solar Cycle 23 and those of Solar Cycle 24. To study the geometric dependence of threats on receiver locations, we use as a metric the distance separating a threat from the centroid of the nearest Ncentroid receivers. Large values of this metric identify threats at or beyond the edge of coverage. We conclude by discussing the implications of our results for WAAS operations.

Altshuler, Eric↗

Parameterization of Vertical Cloud Distribution from C3M and MERRA Data Using ML Method

Clouds play a key role in regulating the hydrological cycle and the Earth's radiative energy budget. However, global climate models (GCMs) with a horizontal grid spacing on the order of 100 km have limitations in representing sub-grid cloud dynamics with spatial scales on the order of 1 km, leading to potential uncertainties in cloud radiative feedback on the global scale. In our research, we will leverage the capabilities of Deep Machine Learning (DML) methods to construct parameterizations of sub-grid volumetric cloud fraction (VCF), which is the frequency of occurrence on a grid volume accumulated in the horizontal and vertical directions. Our investigation delves into the intricate relationship between VCF obtained from the NASA CALIPSO-CloudSat-CERES-MODIS (CCCM) satellite observation data and 3-D MERRA-2 reanalysis meteorological profiling data (e.g., wind, relative humidity, temperature). Through a comprehensive one-year data training utilizing the Sequence to Sequence DML method, we have successfully disentangled the complicated cloud formation dynamics across diverse meteorological conditions through a day-to-day analysis framework. Preliminary findings reveal promising statistical agreements in geographical and vertical distributions and seasonal variations of volumetric cloud fraction between ML prediction and satellite measurements. These results underscore the aptitude of our DML model to discern underlying cloud physical processes and accurately represent sub-grid cloud formation dynamics. Additionally, we have also employed trained neural network to analyze uncertainties arising from errors in meteorological data, further enhancing the robustness of our VCF parameterization.

Shan Zeng↗

Computer analysis of general linear networks using digraphs.

Investigation of the application of digraphs in analyzing general electronic networks, and development of a computer program based on a particular digraph method developed by Chen. The Chen digraph method is a topological method for solution of networks and serves as a shortcut when hand calculations are required. The advantage offered by this method of analysis is that the results are in symbolic form. It is limited, however, by the size of network that may be handled. Usually hand calculations become too tedious for networks larger than about five nodes, depending on how many elements the network contains. Direct determinant expansion for a five-node network is a very tedious process also.

Mcclenahan, J. O.↗

Identifying Trends in Deep Space Network Monitor Data

A computer program has been developed that analyzes Deep Space Network monitor data, looking for changes of trends in critical parameters. This program represents a significant improvement over the previous practice of manually plotting data and visually inspecting the resulting graphs to identify trends. This program uses proven numerical techniques to identify trends. When a statistically significant trend is detected, then it is characterized by means of a symbol that can be used by pre-existing model-based reasoning software. The program can perform any of the following functions: Given an expectation that data in a given list should exhibit an upward, downward, constant, or unknown trend, it can determine whether the data do or do not follow such a trend. Given a list of data, it can identify which of the aforementioned trends the data follow. Given two lists of data, it can determine whether or not both follow the same trend. This program can be executed on a variety of computers. It can be distributed in either source code or binary code form. It must be run in conjunction with any one of a number of Lisp compilers that are available commercially or as shareware.

James, Mark↗

Multi-Domain Routing in Delay Tolerant Networks

The goal of Delay Tolerant Networking (DTN) is to provide the missing ingredient for the ever-growing collection of communicating nodes in our solar system to become a Solar System Internet (SSI). Great strides have been made in modeling particular types of DTNs, such as schedule- or discovery-based. Now, analogously to the Internet, these smaller DTNs can be considered routing domains which must be stitched together to form the overall SSI. In this paper, we propose a framework for cross-domain routing in DTNs as well as methodologies for detecting these sub-domains. Example time-varying networks are given to demonstrate the techniques proposed. A basic component is the mathematical theory of sheaves, which unifies the underlying model of DTN routing algorithms, by giving rise to routing sheaves – these can be defined for the dynamic and scheduled networks as noted above, and can also be used to define the interfaces between these domains in order to route across them. An immediate application would be routing across discovery-based networks connected by scheduled networks. These DTN subdomains remain elusive, however, and need to become well-defined and properly sized for tractable computability. In particular, a balance must be determined between areas that are too large (i.e. large matrix computations) versus areas that are too small (i.e. “many” single-noded domains). Moreover, the connections between the domains should, at least locally, be chosen to optimize data flow and connectivity: we address this in three ways. First, tools from persistent homology are given to understand underlying structures, reminiscent of hierarchies in the Internet Protocol (IP) addressing. Second, we construct a notion of temporal graph curvature based on network geometry to analyze flows induced by dynamical processes on these networks. Finally, Schrodinger Bridges, a tool arising from statistical physics, are proposed as a method of constructing flows on time-evolving networks with desirable properties such as speed, robustness, and load sensitivity. We construct an approach to temporal hypergraphs to simultaneously model unicast, multicast, and broadcast, using the language of scheme theory, and then consider DTN network coding as a way to achieve network-level computation and organization. The paper concludes with a discussion and ideas for future work.

Alan Hylton↗

On the Performance of TCP Spoofing in Satellite Networks

In this paper, we analyze the performance of Transmission Control Protocol (TCP) in a network that consists of both satellite and terrestrial components. One method, proposed by outside research, to improve the performance of data transfers over satellites is to use a performance enhancing proxy often dubbed 'spoofing.' Spoofing involves the transparent splitting of a TCP connection between the source and destination by some entity within the network path. In order to analyze the impact of spoofing, we constructed a simulation suite based around the network simulator ns-2. The simulation reflects a host with a satellite connection to the Internet and allows the option to spoof connections just prior to the satellite. The methodology used in our simulation allows us to analyze spoofing over a large range of file sizes and under various congested conditions, while prior work on this topic has primarily focused on bulk transfers with no congestion. As a result of these simulations, we find that the performance of spoofing is dependent upon a number of conditions.

Ishac, Joseph↗

Multilayer Network Clarifies Prevailing Water Consumption Telecouplings in the United States

Virtual water flows are used to map the indirect water consumption connections implied by the supply chain of a city, region, or country. This information can be used to manage supply chains to achieve environmental policy objectives and mitigate environmental risks to critical supply chains. A limitation of prior work is that these flows are typically analyzed using monolayer networks, which ignores crucial intersectoral or interlayer couplings. Here, in this study, we use a multilayer network to account for such couplings when analyzing blue virtual water flows in the United States. Our multilayer network consists of 115 different regions (nodes), covering the entire conterminous United States; 41 coupled economic sectors (layers); and ∼2 × 10 7 possible links. To analyze the multilayer network, we focus on three fundamental network properties: topological connectivity, mesoscale structure, and node centrality. The network has a high connectivity, with each node being on average connected to roughly 2/3 of the network's nodes. Interlayer flows are a major driver of connectivity, representing ∼54% of all the network's connections. Five different groups of tightly connected nodes (communities) characterize the network. Each community represents a preferred spatial mode of long-range virtual water interaction within the United States. We find that large (populous) cities have a stronger influence than small ones on network functioning because they attract and recirculate more virtual water through their supply chains. Our results also highlight differences between the multilayer and monolayer virtual water network, which overall show that the former provides a more realistic representation of virtual water flows.

Garcia Gonzalez, Susana↗

Visual Understanding of COVID-19 Knowledge Graph for Predictive Analysis

This study aims to effectively analyze and visualize the concept to concept network derived from the COVID-19 Open Research Dataset (CORD-19) dataset, where we have more than 48,000 concepts with more than 300,000 relationships between concepts. In analyzing networks, we focus on finding relationship patterns between the coronavirus disease 2019 (COVID-19) concepts and other concepts. Given the node and edge datasets, we construct directional graphs and calculate all pair shortest paths based on multiple edge weight schemes. However, statistical metrics are not sufficient to identify specific relationships represented in the network. Therefore, we also propose a visual analytics approach to effectively understand the knowledge graph. Our highly interactive visual analytics allows users to effectively analyze the evolving graphs and (COVID-19) concept nodes and other nodes related to the COVID-19 nodes. We envision that this study will pave the path to develop strategies to provide more accurate and scalable predictive analysis on knowledge graphs related to CORD19 and other biomedical knowledge graphs.

Lim, Seung-Hwan↗

Spatial analysis of storm depths from an Arizona raingage network

Eight years of summer rainstorm observations are analyzed by a dense network of 93 raingages operated by the U.S. Department of Agriculture, Agricultural Research Service, in the 150 km Walnut Gulch experimental catchment near Tucson, Arizona. Storms are defined by the total depths collected at each raingage during the noon-to-noon period for which there was depth recorded at any of the gages. For each of the resulting 428 storm days, the gage depths are interpolated onto a dense grid and the resulting random field analyzed to obtain moments, isohyetal plots, spatial correlation function, variance function, and the spatial distribution of storm depth.

Fennessey, N. M.↗

DeepLearnMOR: a deep-learning framework for fluorescence image-based classification of organelle morphology

Abstract The proper biogenesis, morphogenesis, and dynamics of subcellular organelles are essential to their metabolic functions. Conventional techniques for identifying, classifying, and quantifying abnormalities in organelle morphology are largely manual and time-consuming, and require specific expertise. Deep learning has the potential to revolutionize image-based screens by greatly improving their scope, speed, and efficiency. Here, we used transfer learning and a convolutional neural network (CNN) to analyze over 47,000 confocal microscopy images from Arabidopsis wild-type and mutant plants with abnormal division of one of three essential energy organelles: chloroplasts, mitochondria, or peroxisomes. We have built a deep-learning framework, DeepLearnMOR (Deep Learning of the Morphology of Organelles), which can rapidly classify image categories and identify abnormalities in organelle morphology with over 97% accuracy. Feature visualization analysis identified important features used by the CNN to predict morphological abnormalities, and visual clues helped to better understand the decision-making process, thereby validating the reliability and interpretability of the neural network. This framework establishes a foundation for future larger-scale research with broader scopes and greater data set diversity and heterogeneity.

Plant Sciences↗

Computing Bottleneck Structures at Scale for High-Precision Network Performance Analysis

The Theory of Bottleneck Structures is a recently-developed framework for studying the performance of data networks. It describes how local perturbations in one part of the network propagate and interact with others. This framework is a powerful analytical tool that allows network operators to make accurate predictions about network behavior and thereby optimize performance. Previous work implemented a software package for bottleneck structure analysis, but applied it only to toy examples. In this work, we introduce the first software package capable of scaling bottleneck structure analysis to production-size networks. Here, we benchmark our system using logs from ESnet, the Department of Energy's high-performance data network that connects research institutions in the U.S. Using the previously published tool as a baseline, we demonstrate that our system achieves vastly improved performance, constructing the bottleneck structure graphs in 0.21 s and calculating link derivatives in 0.09 s on average. We also study the asymptotic complexity of our core algorithms, demonstrating good scaling properties and strong agreement with theoretical bounds. These results indicate that our new software package can maintain its fast performance when applied to even larger networks. They also show that our software is efficient enough to analyze rapidly changing networks in real time. Overall, we demonstrate the feasibility of applying bottleneck structure analysis to solve practical problems in large, real-world data networks.

benchmark↗