Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “network 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 415 records · Page 23

Social Network and Content Analysis of the North American Carbon Program as a Scientific Community of Practice

The North American Carbon Program (NACP) was formed to further the scientific understanding of sources, sinks, and stocks of carbon in Earth's environment. Carbon cycle science integrates multidisciplinary research, providing decision-support information for managing climate and carbon-related change across multiple sectors of society. This investigation uses the conceptual framework of com-munities of practice (CoP) to explore the role that the NACP has played in connecting researchers into a carbon cycle knowledge network, and in enabling them to conduct physical science that includes ideas from social science. A CoP describes the communities formed when people consistently engage in shared communication and activities toward a common passion or learning goal. We apply the CoP model by using keyword analysis of abstracts from scientific publications to analyze the research outputs of the NACP in terms of its knowledge domain. We also construct a co-authorship network from the publications of core NACP members, describe the structure and social pathways within the community. Results of the content analysis indicate that the NACP community of practice has substantially expanded its research on human and social impacts on the carbon cycle, contributing to a better understanding of how human and physical processes interact with one another. Results of the co-authorship social network analysis demonstrate that the NACP has formed a tightly connected community with many social pathways through which knowledge may flow, and that it has also expanded its network of institutions involved in carbon cycle research over the past seven years.

Knowledge domain↗

Near-Earth asteroids: Observer alert network and database analysis

The Planetary Science Institute (PSI) was funded by SERCulpr to develop a communication network to alert observers of newly discovered near-earth asteroids (NEA's). This network is intended to encourage observers to obtain physical observations of NEA's, which are needed in order to characterize and assess the resource potential of these bodies. This network was declared operational in October 1990 via an announcement to the asteroid observing community. The PSI is also supported to develop the Near-Earth Asteroid Database (NEAD), a comprehensive database of physical and dynamical data on NEA's. In the past year, the database was updated on newly discovered NEA's during 1990, and new data on radar observations and dynamical classifications were added.

Davis, Donald R.↗

Statistical analysis of geodetic networks for detecting regional events

We present an application of hidden Markov models (HMMs) to analysis of geodetic time series in Southern California. Our model fitting method uses a regularized version of the deterministic annealing expectation-maximization algorithm to ensure that model solutions are both robust and of high quality.

geodetic networks↗

Topology design and performance analysis of an integrated communication network

A research study on the topology design and performance analysis for the Space Station Information System (SSIS) network is conducted. It is begun with a survey of existing research efforts in network topology design. Then a new approach for topology design is presented. It uses an efficient algorithm to generate candidate network designs (consisting of subsets of the set of all network components) in increasing order of their total costs, and checks each design to see if it forms an acceptable network. This technique gives the true cost-optimal network, and is particularly useful when the network has many constraints and not too many components. The algorithm for generating subsets is described in detail, and various aspects of the overall design procedure are discussed. Two more efficient versions of this algorithm (applicable in specific situations) are also given. Next, two important aspects of network performance analysis: network reliability and message delays are discussed. A new model is introduced to study the reliability of a network with dependent failures. For message delays, a collection of formulas from existing research results is given to compute or estimate the delays of messages in a communication network without making the independence assumption. The design algorithm coded in PASCAL is included as an appendix.

Li, V. O. K.↗

Throughput Measurements and Profile Analysis of Cloud Networks

Cloud networks utilize virtual connections to connect virtual machines distributed across cloud sites. They are increasingly deployed due to flexible provisioning using software and cost-effectiveness in not requiring to build physical network infrastructure. However, their extensive virtualization makes it unclear how well the established practices of conventional networks translate to them. Here, we study throughput measurements over a Google Cloud network using a matching hardware emulated conventional network, which provide production and exploratory conditions, respectively. The measurements span connections representing local, cross-continental and around the Earth distances. We study the effects of parallel flows, congestion control algorithms and retransmissions on the network throughput profile expressed as a function of RTT. We compare the throughput profile of Google Cloud network with those of emulated network under various loss conditions, including those too disruptive or expensive in the former. Our analysis based on the concave-convex shape and utilization-concavity coefficients of throughput profiles indicates an overall agreement of performance between the two networks, thereby justifying the use of conventional network emulations to analyze cloud networks. In terms of practical use, our study establishes that BBR and BBRv2 alpha TCP achieve higher throughput compared to loss-based congestion control algorithms under most network configurations, especially, under losses at large RTT.

Phanekham, Derek [Southern Methodist Univ., Dallas↗

Modeling MTS pyrolysis and SiC deposition kinetics using principal component analysis and neural networks

Accurate chemical kinetics modeling is crucial for improving the efficiency of chemical processing and synthesis of ceramic matrix composites. Detailed kinetic models are computationally expensive due to the large number of transported chemical species, while the simplified physics-based models, such as single-step global mechanisms, are efficient but often overlook key chemical intermediates and pathways. Recent deep learning approaches promise accurate and cost-effective models. Yet, they require additional closures for the transported nonlinear latent variables, complicating integration with existing solvers. In this work, we develop a hybrid linear—nonlinear reduced model for silicon carbide deposition from methyltrichlorosilane precursor by combining principal component analysis (PCA) and autoencoder (AE) neural network (NN) approaches. PCA is used to identify a smaller set of linear transport variables, enabling direct reuse of conventional transport solvers. NNs then reconstruct the full chemical state from these reduced variables. We demonstrate the method on a chemical vapor deposition reactor—comprising a gas-phase pyrolysis plug flow reactor and a heterogeneous surface reactor—over a wide range of temperatures, pressures, and residence times. Our PCA–AE model achieves high accuracy with only five transported scalars, achieving an eightfold cost reduction compared to detailed mechanisms, in both a priori (using data from the test set only) and a posteriori (coupled with a differential equation solver). In conclusion, notable errors arise primarily near training domain boundaries and for long residence times, indicating the need for domain shift indicators and better long-horizon predictions in future reduced chemistry model development.

autoencoder neural networks↗

On the Probabilistic Analysis of Neural Networks

Neural networks are powerful tools for automated decision-making,seeing increased application in safety-critical domains, such as autonomous driving. Due to their black-box nature and large scale,reasoning about their behavior is challenging. Statistical analysis is often used to infer probabilistic properties of a network, such as its robustness to noise and inaccurate inputs. While scalable, statistical methods can only provide probabilistic guarantees on the quality of their results and may underestimate the impact of low probability inputs leading to undesired behavior of the network.We investigate here the use of symbolic analysis and constraint solution space quantification to precisely quantify probabilistic properties in neural networks. We demonstrate the potential of the proposed technique in a case study involving the analysis of ACAS-Xu, a collision avoidance system for unmanned aircraft control.

neural nets↗

Design and Analysis of Convolutional Neural Network for RF Signal Modulation Classification for In-Orbit Deployment

To effectively transmit data to and from satellites requires a complex and robust RF communication system. Commonly, several different types of signal modulations may be required to maximize satellite efficiency depending on a variety of unexpected channel impairments. We propose a neural network algorithm capable of learning these RF signal modulations using a supervised learning technique designed for low power, high-efficiency in-orbit deployment. The work presented demonstrates a convolutional neural network (CNN) capable of learning and recognizing a set of modulation schemes commonly used to transmit RF information. We are capable of recognizing the modulation scheme from the I and Q data channels directly, with no preprocessing or data conversion required other than breaking the incoming signal into a set of uniform normalized samples. We perform a network design and size analysis, showing that reasonably high accuracy can be obtained using networks with a relatively low number of trainable parameters. Given that a user of a system such as this may wish to receive a signal using a modulation scheme that the network has not previously learned, we demonstrate that transfer learning can learn new modulation schemes by retraining only the fully connected layers in the CNN. Thus, this type of network would excel in outer space deployment using high-efficiency transfer learning hardware. Modulation recognition can be performed through rapid feedforward computation, and the CNN training process is significantly simplified when learning new modulations is required.

CNN↗

Feature-Guided Analysis of Neural Networks

Applying standard software engineering practices to neural networks is challenging due to the lack of high-level abstractions describing a neural network’s behavior. To address this challenge, we propose to extract high-level task-specific features from the neural network internal representation, based on monitoring the neural network activations.The extracted feature representations can serve as a link to high-level requirements and can be leveraged to enable fundamental software engineering activities, such as automated testing, debugging, requirements analysis, and formal verification, leading to better engineering of neural networks. Using two case studies, we present initial empirical evidence demonstrating the feasibility of our ideas.

Features↗

Slip Tendency Analysis of Fracture Networks to Determine Suitability of Candidate Testbeds for the EGS Collab Hydroshear Experiment

Experiment 2 of the EGS Collab project is aimed at testing stimulation by hydro-shearing of existing natural fractures, versus Experiment 1, which is focused on hydraulic fracturing a rock mass to enhance permeability. The main criterion for the testbed selection in Experiment 2 is the presence of an interconnected network of fractures, at least 10 meters in extent, and with orientations such that shear slip can be induced at injection pressures less than the minimum horizontal stress (Shmin). The feasibility analysis for this experiment requires a well-constrained stress state along with well-characterized fracture networks. The fracture systems at two candidate locations in the Sanford Underground Research Facility (SURF), the 4850 Level (number refers to depth below ground surface in feet) and the 4100 Level, have been characterized to different extents. The 4850 Level has a well-characterized Discrete Fracture Network (DFN) from borehole (drilled for an experimental test bed) and drift observations. In contrast, the 4100 level has a fracture network characterized only by observations from the drift wall, which provides little constraint on fracture extents. This paper will present assessments for the interpreted slip potential for the natural fractures at the two locations. Data uncertainties are addressed by performing a probabilistic analysis that takes into account the uncertainty in the stress state, uncertainty in the fracture properties, and preliminary borehole locations. There is strong evidence of shear stimulation of some natural fractures in Experiment 1 on the 4850 level. We use examples of natural fractures strongly linked to shear stimulation in Experiment 1 from multiple monitoring indicators to test the consistency of the stress model and guide the uncertainty interpretation. This analysis is intended to guide the site selection process for Experiment 2 by highlighting the fracture orientations that are likely to be shear-stimulated in a majority of modeled realizations.

40 EE - Geothermal Technologies Office (EE-4G)↗

High-Rate Delay Tolerant Networking (HDTN) Software Requirements Analysis

This document serves as a detailed analysis of the main networking protocols implemented by HDTN. Sources of the protocol specifications include Internet Engineering Task Force (IETF) Request for Comments (RFC) and Consultative Committee for Space Data Systems (CCSDS) standards. The focus of this report is to derive software requirements suitable for NASA Procedural Requirements 7150.2D Class B compliance, including requirements traceability and software verification and validation, from the source specifications. This analysis will be incorporated into the finalized HDTN Software Requirements Specification (SRS) but does not encompass the full scope of the HDTN SRS. Requirements in this document are considered draft. The complete requirements will include bundle application requirements, interface requirements, computer resource requirements, software quality factors, and additional requirements as determined by the project. This document is publicly released to the greater community to receive feedback and foster collaboration opportunities.

Rachel Dudukovich↗

Deep Cellular Recurrent Network for Efficient Analysis of Time-Series Data With Spatial Information

Efficient processing of large-scale time series data is an intricate problem in machine learning. Conventional sensor signal processing pipelines with hand engineered feature extraction often involve huge computational cost with high dimensional data. Deep recurrent neural networks have shown promise in automated feature learning for improved time-series processing. However, generic deep recurrent models grow in scale and depth with increased complexity of the data. This is particularly challenging in presence of high dimensional data with temporal and spatial characteristics. Consequently, this work proposes a novel deep cellular recurrent neural network (DCRNN) architecture to efficiently process complex multi-dimensional time series data with spatial information. Here, the cellular recurrent architecture in the proposed model allows for location-aware synchronous processing of time series data from spatially distributed sensor signal sources. Extensive trainable parameter sharing due to cellularity in the proposed architecture ensures efficiency in the use of recurrent processing units with high-dimensional inputs. This study also investigates the versatility of the proposed DCRNN model for classification of multi-class time series data from different application domains. Consequently, the proposed DCRNN architecture is evaluated using two time-series datasets: a multichannel scalp EEG dataset for seizure detection, and a machine fault detection dataset obtained in-house. The results suggest that the proposed architecture achieves state-of-the-art performance while utilizing substantially less trainable parameters when compared to comparable methods in the literature.

60 APPLIED LIFE SCIENCES↗

“Understanding Robustness Lottery”: A Geometric Visual Comparative Analysis of Neural Network Pruning Approaches

Deep learning approaches have provided state-of-the-art performance in many applications by relying on large and overparameterized neural networks. However, such networks are very brittle and are difficult to deploy on resource-limited platforms. Model pruning, i.e., reducing the size of the network, is a widely adopted strategy that can lead to a more robust and compact model. Many heuristics exist for model pruning, but our understanding of the pruning process remains limited due to the black-box nature of a neural network model. Empirical studies show that some heuristics improve performance whereas others can make models more brittle. Here, this work aims to shed light on how different pruning methods alter the network’s internal feature representation and the corresponding impact on model performance. To facilitate a comprehensive comparison and characterization of the high-dimensional model feature space, we introduce a visual geometric analysis of feature representations. We evaluated a set of critical geometric concepts decomposed from the commonly adopted classification loss and used them to design a visualization system to compare and highlight the impact of pruning on model performance and feature representation. The proposed tool provides an environment for an in-depth comparison of pruning methods and a comprehensive understanding of how the model responds to common data corruption. By leveraging the proposed visualization, machine learning researchers can reveal the similarities between pruning methods and redundancy in robustness evaluation benchmarks, obtain geometric insights about the differences between pruned models that achieve superior robustness performance, and identify samples that are robust or fragile to model pruning and common data corruption.

Li, Zhimin [Univ. of Utah, Salt Lake City, UT (Uni↗

Analysis of mobility data to build contact networks for COVID-19

As social distancing policies and recommendations went into effect in response to COVID-19, people made rapid changes to the places they visit. These changes are clearly seen in mobility data, which records foot traffic using location trackers in cell phones. While mobility data is often used to extract the number of customers that visit a particular business or business type, it is the frequency and duration of concurrent occupancy at those sites that governs transmission. Understanding the way people interact at different locations can help target policies and inform contact tracing and prevention strategies. This paper outlines methods to extract interactions from mobility data and build networks that can be used in epidemiological models. Several measures of interaction are extracted: interactions between people, the cumulative interactions for a single person, and cumulative interactions that occur at particular businesses. Network metrics are computed to identify structural trends which show clear changes based on the timing of stay-at-home orders. Measures of interaction and structural trends in the resulting networks can be used to better understand potential spreading events, the percent of interactions that can be classified as close contacts, and the impact of policy choices to control transmission.

60 APPLIED LIFE SCIENCES↗

Telecommunications network optimization

Analysis discusses STACOM (state criminal justic communication) network topology program used to design and evaluate digital telecommunications networks STACOM employs ESAU-WILLIAMS technique to search for direct links between system terminations and regional switching center. Inputs include traffic data, terminal locations, and functional requirements.

Lee, J.↗