Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “networking”

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 811 records · Page 45
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

CPViz: Visualizing clinical pathways represented in higher-order networks

To improve clinical care practice, it is important to understand the variability of clinical pathways executed in different contexts (e.g., pathways in different geographical locations, demographics, and phenotypic groups). A common way of representing clinical pathways is through network-based representations that capture trajectories of treatment steps. However, first-order networks, which are based on the Markovian property and the de facto standard model to represent transitions between steps, often fail to capture real trajectories. This paper introduces a visual analytic tool to explore and compare pathways represented in higher-order networks. Because each higher node in the network is a subtrajectory (i.e., partial or full history of treatment steps), the tool can display true sequences of treatment steps and compute the similarity of the two networks in a space of higher-order nodes. The tool also highlights areas in which the two networks are similar and dissimilar and how a certain subtrajectory is realized differently in different pathways. The paper demonstrates the tool's usefulness by applying it to multiple antidepressant pharmacotherapy pathways for veterans diagnosed with major depressive disorder and by illustrating heterogeneity in prescription patterns across pathways.

Chae, Junghoon↗
DOE OSTI2022

ITeM: Independent temporal motifs to summarize and compare temporal networks

We report networks are a fundamental and flexible way of representing various complex systems. Many domains such as communication, citation, procurement, biology, social media, and transportation can be modeled as a set of entities and their relationships. Temporal networks are a specialization of general networks where every relationship occurs at a discrete time. The temporal evolution of such networks is as important to understand as the structure of the entities and relationships. We present the Independent Temporal Motif (ITeM) to characterize temporal graphs from different domains. ITeMs can be used to model the structure and the evolution of the graph. In contrast to existing work, ITeMs are edge-disjoint directed motifs that measure the temporal evolution of ordered edges within the motif. For a given temporal graph, we produce a feature vector of ITeM frequencies and the time it takes to form the ITeM instances. We apply this distribution to measure the similarity of temporal graphs. We show that ITeM has higher accuracy than other motif frequency-based approaches. We define various ITeM-based metrics that reveal salient properties of a temporal network. We also present importance sampling as a method to efficiently estimate the ITeM counts. We present a distributed implementation of the ITeM discovery algorithm using Apache Spark and GraphFrame. We evaluate our approach on both synthetic and real temporal networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Indoor Occupancy Sensing via Networked Nodes (2012–2022): A Review

In the past decade, different sensing mechanisms and algorithms have been developed to detect or estimate indoor occupancy. One of the most recent advancements is using networked sensor nodes to create a more comprehensive occupancy detection system where multiple sensors can identify human presence within more expansive areas while delivering enhanced accuracy compared to a system that relies on stand-alone sensor nodes. The present work reviews the studies from 2012 to 2022 that use networked sensor nodes to detect indoor occupancy, focusing on PIR-based sensors. Methods are compared based on pivotal ADPs that play a significant role in selecting an occupancy detection system for applications such as Health and Safety or occupant comfort. These parameters include accuracy, information requirement, maximum sensor failure and minimum observation rate, and feasible detection area. We briefly describe the overview of occupancy detection criteria used by each study and introduce a metric called “sensor node deployment density” through our analysis. This metric captures the strength of network-level data filtering and fusion algorithms found in the literature. It is hinged on the fact that a robust occupancy estimation algorithm requires a minimal number of nodes to estimate occupancy. This review only focuses on the occupancy estimation models for networked sensor nodes. It thus provides a standardized insight into networked nodes’ occupancy sensing pipelines, which employ data fusion strategies, network-level machine learning algorithms, and occupancy estimation algorithms. This review thus helps determine the suitability of the reviewed methods to a standard set of application areas by analyzing their gaps.

Emad-Ud-Din, Muhammad (ORCID:0000000279515538)↗
DOE OSTI2024

Data-Informed Synthetic Networks of Water Distribution Systems for Resilience Analysis in Puerto Rico

The increasing potential of infrastructure disruptions calls for high-quality infrastructure models to be used in resilience analysis and decision making. Unfortunately, many utilities and communities do not have access to accurate and detailed models due to a lack of data and resources. Furthermore, security restrictions on sharing infrastructure models present roadblocks to research, analysis, and decision making. Recent advances in the development of synthetic water distribution models provide a potential solution to this problem. There is an opportunity to improve these methods by leveraging incomplete pipe datasets to aid synthetic network generation. To address this gap, we developed a methodology for synthetic network generation that incorporates partial pipe data using a modification of the minimum cost flow algorithm for network generation and pipe sizing. This methodology demonstrates how partial pipe data can be leveraged to improve site-specific synthetic network generation. For the study area of Mayagüez, Puerto Rico, a synthetic model generated using 50% of real pipe data matches the pressure of the validation system with an average error of 23.5 m of head, which improves upon the average error of 31.6 m of head produced by a synthetic model generated using no data of the real pipes. Additionally, synthetic networks are shown to replicate the pressure response under a disruption scenario of the validation network, suggesting potential use in resilience analysis.

resilience analysis↗
DOE OSTI2020

Extended Physics-Informed Neural Networks (XPINNs): A Generalized Space-Time Domain Decomposition Based Deep Learning Framework for Nonlinear Partial Differential Equations

Here we propose a generalized space-time domain decomposition approach for the physics-informed neural networks (PINNs) to solve nonlinear partial differential equations (PDEs) on arbitrary complex-geometry domains. The proposed framework, named eXtended PINNs ( X P I N N s ), further pushes the boundaries of both PINNs as well as conservative PINNs (cPINNs), which is a recently proposed domain decomposition approach in the PINN framework tailored to conservation laws. Compared to PINN, the XPINN method has large representation and parallelization capacity due to the inherent property of deployment of multiple neural networks in the smaller subdomains. Unlike cPINN, XPINN can be extended to any type of PDEs. Moreover, the domain can be decomposed in any arbitrary way (in space and time), which is not possible in cPINN. Thus, XPINN offers both space and time parallelization, thereby reducing the training cost more effectively. In each subdomain, a separate neural network is employed with optimally selected hyperparameters, e.g., depth/width of the network, number and location of residual points, activation function, optimization method, etc. A deep network can be employed in a subdomain with complex solution, whereas a shallow neural network can be used in a subdomain with relatively simple and smooth solutions. We demonstrate the versatility of XPINN by solving both forward and inverse PDE problems, ranging from one-dimensional to three-dimensional problems, from time-dependent to time-independent problems, and from continuous to discontinuous problems, which clearly shows that the XPINN method is promising in many practical problems. The proposed XPINN method is the generalization of PINN and cPINN methods, both in terms of applicability as well as domain decomposition approach, which efficiently lends itself to parallelized computation. The XPINN code is available on h t t p s : / / g i t h u b . c o m / A m e y a J a g t a p / X P I N N s .

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Neural Scaling Laws of Deep ReLU and Deep Operator Network: A Theoretical Study

Neural scaling laws play a pivotal role in the performance of deep neural networks and have been observed in a wide range of tasks. However, a complete theoretical framework for understanding these scaling laws remains underdeveloped. In this paper, we explore the neural scaling laws for deep operator networks, which involve learning mappings between function spaces, with a focus on the Chen and Chen style architecture. These approaches, which include the popular Deep Operator Network (DeepONet), approximate the output functions using a linear combination of learnable basis functions and coefficients that depend on the input functions. We establish a theoretical framework to quantify the neural scaling laws by analyzing its approximation and generalization errors. We articulate the relationship between the approximation and generalization errors of deep operator networks and key factors such as network model size and training data size. Moreover, we address cases where input functions exhibit low-dimensional structures, allowing us to derive tighter error bounds. These results also hold for deep ReLU networks and other similar structures. Our results offer a partial explanation of the neural scaling laws in operator learning and provide a theoretical foundation for their applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Evaluation of global teleconnections in CMIP6 climate projections using complex networks

In climatological research, the evaluation of climate models is one of the central research subjects. As an expression of large-scale dynamical processes, global teleconnections play a major role in interannual to decadal climate variability. Their realistic representation is an indispensable requirement for the simulation of climate change, both natural and anthropogenic. Therefore, the evaluation of global teleconnections is of utmost importance when assessing the physical plausibility of climate projections. We present an application of the graph-theoretical analysis tool δ-MAPS, which constructs complex networks on the basis of spatio-temporal gridded data sets, here sea surface temperature and geopotential height at 500 hPa. Complex networks complement more traditional methods in the analysis of climate variability, like the classification of circulation regimes or empirical orthogonal functions, assuming a new non-linear perspective. While doing so, a number of technical tools and metrics, borrowed from different fields of data science, are implemented into the δ-MAPS framework in order to overcome specific challenges posed by our target problem. Those are trend empirical orthogonal functions (EOFs), distance correlation and distance multicorrelation, and the structural similarity index. δ-MAPS is a two-stage algorithm. In the first place, it assembles grid cells with highly coherent temporal evolution into so-called domains. In a second step, the teleconnections between the domains are inferred by means of the non-linear distance correlation. We construct 2 unipartite and 1 bipartite network for 22 historical CMIP6 climate projections and 2 century-long coupled reanalyses (CERA-20C and 20CRv3). Potential non-stationarity is taken into account by the use of moving time windows. The networks derived from projection data are compared to those from reanalyses. Our results indicate that no single climate projection outperforms all others in every aspect of the evaluation. But there are indeed models which tend to perform better/worse in many aspects. Differences in model performance are generally low within the geopotential height unipartite networks but higher in sea surface temperature and most pronounced in the bipartite network representing the interaction between ocean and atmosphere.

58 GEOSCIENCES↗
DOE OSTI2021

Testing the reliability of interpretable neural networks in geoscience using the Madden–Julian oscillation

Abstract. We test the reliability of two neural network interpretation techniques, backward optimization and layerwise relevance propagation, within geoscientific applications by applying them to a commonly studied geophysical phenomenon, the Madden–Julian oscillation. The Madden–Julian oscillation is a multi-scale pattern within the tropical atmosphere that has been extensively studied over the past decades, which makes it an ideal test case to ensure the interpretability methods can recover the current state of knowledge regarding its spatial structure. The neural networks can, indeed, reproduce the current state of knowledge and can also provide new insights into the seasonality of the Madden–Julian oscillation and its relationships with atmospheric state variables. The neural network identifies the phase of the Madden–Julian oscillation twice as accurately as a linear regression approach, which means that nonlinearities used by the neural network are important to the structure of the Madden–Julian oscillation. Interpretations of the neural network show that it accurately captures the spatial structures of the Madden–Julian oscillation, suggest that the nonlinearities of the Madden–Julian oscillation are manifested through the uniqueness of each event, and offer physically meaningful insights into its relationship with atmospheric state variables. We also use the interpretations to identify the seasonality of the Madden–Julian oscillation and find that the conventionally defined extended seasons should be shifted later by 1 month. More generally, this study suggests that neural networks can be reliably interpreted for geoscientific applications and may thereby serve as a dependable method for testing geoscientific hypotheses.

58 GEOSCIENCES↗
DOE OSTI2025

Adaptive continuity-preserving simplification of street networks

While street network data are nearly universally available, their representation is usually transportation-based. However, for many types of analyses, e.g., urban morphology or network science, unprocessed transportation-based street network data is unsuitable, making a cumbersome manual simplification process necessary. To address this challenge, in this paper we propose an algorithm for simplification of street networks, based on the detection of network portions that need to be simplified, and continuity-preserving heuristics that generate new geometries. The algorithm, released in the open-source Python package neatnet, facilitates the generation of morphological networks and generalises to various geographical contexts without a need to alter the parameters, while offering better performance than other available solutions.

Fleischmann, Martin [Charles University, Prague, C↗
NASA NTRS1972

Computer generation of symbolic network functions - A new theory and implementation.

A new method is presented for obtaining network functions in which some, none, or all of the network elements are represented by symbolic parameters (i.e., symbolic network functions). Unlike the topological tree enumeration or signal flow graph methods generally used to derive symbolic network functions, the proposed procedure employs fast, efficient, numerical-type algorithms to determine the contribution of those network branches that are not represented by symbolic parameters. A computer program called NAPPE (for Network Analysis Program using Parameter Extractions) and incorporating all of the concepts discussed has been written. Several examples illustrating the usefulness and efficiency of NAPPE are presented.

Alderson, G. E.↗
NASA NTRS1972

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.↗
NASA NTRS1972

Satellite networks for education

Satellite based educational networking is discussed with particular attention given to the potential uses of communications satellites to help meet educational needs in the United states. Four major subject areas were covered; (1) characteristics and structure of networks, (2) definition of pressures within educational establishment that provide motivation for various types of networks, (3) examination of current educational networking status for educational radio and television, instructional television fixed services, inter- and intra-state educational communication networks, computer networks, and cable television for education, and (4) identification of possible satellite based educational telecommunication services and three alternatives for implementing educational satellite systems.

Singh, J. P.↗
NASA NTRS1972

Terminal-oriented computer-communication networks.

Four examples of currently operating computer-communication networks are described in this tutorial paper. They include the TYMNET network, the GE Information Services network, the NASDAQ over-the-counter stock-quotation system, and the Computer Sciences Infonet. These networks all use programmable concentrators for combining a multiplicity of terminals. Included in the discussion for each network is a description of the overall network structure, the handling and transmission of messages, communication requirements, routing and reliability consideration where applicable, operating data and design specifications where available, and unique design features in the area of computer communications.

Schwartz, M.↗
NASA NTRS1981

The evolution of the spaceflight tracking and data network

The evolution of the Minitrack Network, the first worldwide satellite tracking capability (1957-1962), into the Satellite Tracking and Data Acquisition Network (1960-1966) is described. Attention is also given to the Mercury Network, which became operational in 1961, was the foundation for the Manned Space Flight Network, and supported the Gemini and Apollo missions. The development of the NASA Communications Network, which began to take shape in the early 1960s, is described. An account is also given of the way in which all these functions began playing together (1965) and were consolidated in the early 1970s as the Space Tracking and Data Network.

Hocking, W. M.↗
NASA NTRS1983

NASCOM network ground communications availability report

A performance analysis of NASCOM Network circuits is presented. An objective of 99.80 percent availability has been established for all network circuits and an acceptable level of 99.50. A network narrative summary for the current month includes changes in network configurations, current month's totals for modes of service and trouble category losses, a discussion of trends, and significant losses that affected the performance indexes of individual or groups of circuits. A table and narrative summary of those circuits that failed to meet the objective of 99.80% availability for all network circuits and an acceptable level of 99.50. Lost time and interruption tables showing all circuits affected by outages, by trouble category, with their total time and events, scheduled operating hours, and individual availability indexes also are included. Selected circuits whose availabilities have or continue to affect the overall network availability are also analyzed.

Source record↗
NASA NTRS1983

Communications network design and costing model technical manual

This computer model provides the capability for analyzing long-haul trunking networks comprising a set of user-defined cities, traffic conditions, and tariff rates. Networks may consist of all terrestrial connectivity, all satellite connectivity, or a combination of terrestrial and satellite connectivity. Network solutions provide the least-cost routes between all cities, the least-cost network routing configuration, and terrestrial and satellite service cost totals. The CNDC model allows analyses involving three specific FCC-approved tariffs, which are uniquely structured and representative of most existing service connectivity and pricing philosophies. User-defined tariffs that can be variations of these three tariffs are accepted as input to the model and allow considerable flexibility in network problem specification. The resulting model extends the domain of network analysis from traditional fixed link cost (distance-sensitive) problems to more complex problems involving combinations of distance and traffic-sensitive tariffs.

Logan, K. P.↗
NASA NTRS1984

LaRC local area networks to support distributed computing

The Langley Research Center's (LaRC) Local Area Network (LAN) effort is discussed. LaRC initiated the development of a LAN to support a growing distributed computing environment at the Center. The purpose of the network is to provide an improved capability (over inteactive and RJE terminal access) for sharing multivendor computer resources. Specifically, the network will provide a data highway for the transfer of files between mainframe computers, minicomputers, work stations, and personal computers. An important influence on the overall network design was the vital need of LaRC researchers to efficiently utilize the large CDC mainframe computers in the central scientific computing facility. Although there was a steady migration from a centralized to a distributed computing environment at LaRC in recent years, the work load on the central resources increased. Major emphasis in the network design was on communication with the central resources within the distributed environment. The network to be implemented will allow researchers to utilize the central resources, distributed minicomputers, work stations, and personal computers to obtain the proper level of computing power to efficiently perform their jobs.

Riddle, E. P.↗
NASA NTRS1984

GSFC network operations with Tracking and Data Relay Satellites

The Tracking and Data Relay Satellite System (TDRSS) Network (TN) has been developed to provide services to all NASA User spacecraft in near-earth orbits. Three inter-relating entities will provide these services. The TN has been transformed from a network continuously changing to meet User specific requirements to a network which is flexible to meet future needs without significant changes in operational concepts. Attention is given to the evolution of the TN network, the TN capabilities-space segment, forward link services, tracking services, return link services, the three basic capabilities, single access services, multiple access services, simulation services, the White Sands Ground Terminal, the NASA communications network, and the network control center.

Spearing, R.↗