Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Network centrality”

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 37 records · Page 2

D2NO: Efficient handling of heterogeneous input function spaces with distributed deep neural operators

Neural operators have been applied in various scientific fields, such as solving parametric partial differential equations, dynamical systems with control, and inverse problems. However, challenges arise when dealing with input functions that exhibit heterogeneous properties, requiring multiple sensors to handle functions with minimal regularity. To address this issue, discretization-invariant neural operators have been used, allowing the sampling of diverse input functions with different sensor locations. However, existing frameworks still require an equal number of sensors for all functions. We propose a novel distributed approach to further relax the discretization requirements and solve the heterogeneous dataset challenges. Our method involves partitioning the input function space and processing individual input functions using independent and separate neural networks. A centralized neural network is used to handle shared information across all output functions. This distributed methodology reduces the number of gradient descent back-propagation steps, improving efficiency while maintaining accuracy. Here, we demonstrate that the corresponding neural network is a universal approximator of continuous nonlinear operators and present three numerical examples to validate its performance.

97 MATHEMATICS AND COMPUTING↗

Feasibility study of robotic neural controllers

The results are given of a feasibility study performed to establish if an artificial neural controller could be used to achieve joint space trajectory tracking of a two-link robot manipulator. The study is based on the results obtained by Hecht-Nielsen, who claims that a functional map can be implemented to a desired degree of accuracy with a three layer feedforward artificial neural network. Central to this study is the assumption that the robot model as well as its parameters values are known.

Magana, Mario E.↗

New applications for the EUTELTRACS service

The EUTELTRACS two-way Mobile Satellite Messaging and Automatic Satellite Position Reporting (ASPR) service is Europe's first commercially operated Mobile Satellite Service. It was introduced by the European Telecommunications Satellite Organization (EUTELSAT) for commercial service in 1991. The system is based on a centralized network architecture organized around a single hub station operated by EUTELSAT. Initially the system was designed with a close user group architecture enabling a mobile user to communicate exclusively with its own headquarters. This paper describes the new applications (design and tests prior to their introduction into service) especially developed for the European market and particularly the Double Hop Services opening the system to authorized external entities. In addition, the European Commission (EC) pilot demonstrations in which the EUTELTRACS system is involved are described.

Colcy, Jean-Noel↗

Geological Factors Impacted Cadmium Availability and use as an Alternative Cofactor for Zinc in the Carbon Fixation Pathways of Marine Diatoms

Transition metal cofactors are crucial for many biological processes. Despite being primarily considered to be toxic, the transition metal cadmium (Cd) was discovered to be a substitute cofactor for zinc (Zn) in photosynthetic carbon fixation pathways of marine diatoms. However, it is not known how conditions in the geosphere impacted Cd availability and its incorporation as an alternative metal cofactor for phytoplankton. We employed mineral chemistry network analysis to investigate which geochemical factors may have influenced the availability of Cd and Zn during the putative time period that the alternative Cd-based pathway evolved. Our results show that Zn minerals are more chemically diverse than are Cd minerals, but Zn- and Cd-containing minerals have similar network centrality values when specifically considering sulfur (S)-containing species. Cadmium and Zn sulfides are the most common Cd- and Zn-containing mineral species over the past 500 million years. In particular, the Cd and Zn sulfides, respectively greenockite and sphalerite, were highly abundant during this time period. Furthermore, S-containing Cd and Zn minerals are commonly co-located in geologic time, allowing them to be weathered and transported to the ocean in tandem, rather than from separate sources. We suggest that the simultaneous weathering of Cd and Zn sulfides allowed for Cd to be a bioavailable direct substitute for Zn in protein complexes during periods of Zn depletion. The biogeochemical cycles of Zn and Cd exemplify the importance of the coevolution of the geosphere and biosphere in shaping primary production in the modern ocean.

Naman Srivastava↗

A central tree.

Network analysis and synthesis using centrally located tree to generate connected linear graph trees

GRAPH↗

Dynamic Disruption Resilience in Intermodal Transport Networks: Integrating Flow Weighting and Centrality Measures

Resilient intermodal freight networks are vital for sustaining supply chains amid increasing threats from natural hazards and cyberattacks. Transportation resilience has been widely studied; understanding how random and targeted disruptions affect structural connectivity and functional performance remains a key challenge. To address this, this study evaluates the robustness of the US intermodal freight network, which consists of rail and water modes, using a simulation-based framework that integrates graph-theoretic metrics with flow-weighted centrality measures. Disruption scenarios are examined, including random failures as well as targeted node and edge removals based on static and dynamically updated degree and betweenness centrality. To reflect more realistic conditions, flow-weighted degree centralities (WDC) and partial node degradation are considered. Two resilience indicators are used: (1) the size of the giant connected component to measure structural connectivity; and (2) flow-weighted network efficiency (NE) to assess freight mobility under disruption. The results show that progressively degrading nodes ranked by WDC to 60% of their original functionality causes a sharper decline in normalized NE, for up to approximately 45 affected nodes, than complete failure (100% loss of functionality) applied to nodes targeted by weighted betweenness centrality or selected at random. This highlights how partial degradation of high-tonnage hubs can produce disproportionately large functional losses. The findings emphasize the need for resilience strategies that go beyond network topology to incorporate freight flow dynamics.

42 ENGINEERING↗

Gradient Coding With Iterative Block Leverage Score Sampling

Gradient coding is a method for mitigating straggling servers in a centralized computing network that uses erasure-coding techniques to distributively carry out first-order optimization methods. Randomized numerical linear algebra uses randomization to develop improved algorithms for large-scale linear algebra computations. In this study, we propose a method for distributed optimization that combines gradient coding and randomized numerical linear algebra. The proposed method uses a randomized ℓ 2 -subspace embedding and a gradient coding technique to distribute blocks of data to the computational nodes of a centralized network, and at each iteration the central server only requires a small number of computations to obtain the steepest descent update. The novelty of our approach is that the data is replicated according to importance scores, called block leverage scores, in contrast to most gradient coding approaches that uniformly replicate the data blocks. Furthermore, we do not require a decoding step at each iteration, avoiding a bottleneck in previous gradient coding schemes. We show that our approach results in a valid ℓ 2 -subspace embedding, and that our resulting approximation converges to the optimal solution.

97 MATHEMATICS AND COMPUTING↗

Distribution of centrality measures on undirected random networks via the cavity method

The Katz centrality of a node in a complex network is a measure of the node’s importance as far as the flow of information across the network is concerned. For ensembles of locally tree-like undirected random graphs, this observable is a random variable. Its full probability distribution is of interest but difficult to handle analytically because of its “global” character and its definition in terms of a matrix inverse. Leveraging a fast Gaussian Belief Propagation-Cavity algorithm to solve linear systems on tree-like structures, we show that i) the Katz centrality of a single instance can be computed recursively in a very fast way, and ii) the probability P ( K ) that a random node in the ensemble of undirected random graphs has centrality K satisfies a set of recursive distributional equations, which can be analytically characterized and efficiently solved using a population dynamics algorithm. We test our solution on ensembles of Erdős-Rényi and Scale Free networks in the locally tree-like regime, with excellent agreement. The analytical distribution of centrality for the configuration model conditioned on the degree of each node can be employed as a benchmark to identify nodes of empirical networks with over- and underexpressed centrality relative to a null baseline. We also provide an approximate formula based on a rank- 1 projection that works well if the network is not too sparse, and we argue that an extension of our method could be efficiently extended to tackle analytical distributions of other centrality measures such as PageRank for directed networks in a transparent and user-friendly way.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Operations of the reconfigured Ground Communications Facility Central Communications Terminal and the Network Operations Control Center

The ground communications facility (GCF) central communications terminal and network operations control center (NOCC) hardware was rearranged, supplemented, and modified, and software programs changed to provide an improved GCF and NOCC operational environment and capability. Control center operations section activities required to make the changeover from the old to the new GCF and NOCC configuration are addressed.

Santana, J. C.↗

Securely Aggregated Coded Matrix Inversion

Coded computing is a method for mitigating straggling workers in a centralized computing network, by using erasure-coding techniques. Federated learning is a decentralized model for training data distributed across client devices. In this work we propose approximating the inverse of an aggregated data matrix, where the data is generated by clients; similar to the federated learning paradigm, while also being resilient to stragglers. To do so, we propose a coded computing method based on gradient coding. We modify this method so that the coordinator does not access the local data at any point; while the clients access the aggregated matrix in order to complete their tasks. Here, the network we consider is not centrally administrated, and the communications which take place are secure against potential eavesdroppers.

97 MATHEMATICS AND COMPUTING↗

Global Network Analysis of Neisseria gonorrhoeae Identifies Coordination between Pathways, Processes, and Regulators Expressed during Human Infection

Neisseria gonorrhoeae is a Gram-negative diplococcus that is responsible for the sexually transmitted infection gonorrhea, a high-morbidity disease in the United States and worldwide. Over the past several years, N. gonorrhoeae strains resistant to antibiotics used to treat this infection have begun to emerge across the globe. Thus, new treatment strategies are needed to combat this organism. Here, we utilized N. gonorrhoeae transcriptomic data sets, including those obtained from natural infection of the human genital tract, to infer the first global gene coexpression network of this pathogen. Interrogation of this network revealed genes central to the network that are likely critical for gonococcal growth, metabolism, and virulence, including genes encoding hypothetical proteins expressed during mucosal infection. In addition, network analysis revealed overlap in the response of N. gonorrhoeae to incubation with neutrophils and exposure to hydrogen peroxide stress in vitro. Network analysis also identified new targets of the gonococcal global regulatory protein Fur, while examination of the network neighborhood of genes allowed us to assign additional putative categories to several proteins. Collectively, the characterization of the first gene coexpression network for N. gonorrhoeae described here has revealed new regulatory pathways and new categories for proteins and has shown how processes important to gonococcal infection in both men and women are linked. This information fills a critical gap in our understanding of virulence strategies of this obligate human pathogen and will aid in the development of new treatment strategies for gonorrhea.

59 BASIC BIOLOGICAL SCIENCES↗

In Vivo Thermodynamic Analysis of Glycolysis in Clostridium thermocellum and Thermoanaerobacterium saccharolyticum Using 13 C and 2 H Tracers

Clostridium thermocellum and Thermoanaerobacterium saccharolyticum are thermophilic anaerobic bacteria with complementary metabolic capabilities that utilize distinct glycolytic pathways for the conversion of cellulosic sugars to biofuels. We integrated quantitative metabolomics with 2 H and 13 C metabolic flux analysis to investigate the in vivo reversibility and thermodynamics of the central metabolic networks of these two microbes. We found that the glycolytic pathway in C. thermocellum operates remarkably close to thermodynamic equilibrium, with an overall drop in Gibbs free energy 5-fold lower than that of T. saccharolyticum or anaerobically grown Escherichia coli . The limited thermodynamic driving force of glycolysis in C. thermocellum could be attributed in large part to the small free energy of the phosphofructokinase reaction producing fructose bisphosphate. The ethanol fermentation pathway was also substantially more reversible in C. thermocellummthan in T. saccharolyticum. These observations help explain the comparatively low ethanol titers of C. thermocellum and suggest engineering interventions that can be used to increase its ethanol productivity and glycolytic rate. In addition to thermodynamic analysis, we used our isotope tracer data to reconstruct the T. saccharolyticum central metabolic network, revealing exclusive use of the Embden-Meyerhof-Parnas (EMP) pathway for glycolysis, a bifurcated tricarboxylic acid (TCA) cycle, and a sedoheptulose bisphosphate bypass active within the pentose phosphate pathway. Thermodynamics constitutes a key determinant of flux and enzyme efficiency in metabolic networks. Here, we provide new insights into the divergent thermodynamics of the glycolytic pathways of C. thermocellum and T. saccharolyticum, two industrially relevant thermophilic bacteria whose metabolism still is not well understood. We report that while the glycolytic pathway in T. saccharolyticum is as thermodynamically favorable as that found in model organisms, such as E. coli or Saccharomyces cerevisiae , the glycolytic pathway of C. thermocellum operates near equilibrium. The use of a near-equilibrium glycolytic pathway, with potentially increased ATP yield, by this cellulolytic microbe may represent an evolutionary adaptation to growth on cellulose, but it has the drawback of being highly susceptible to product feedback inhibition. The results of this study will facilitate future engineering of high-performance strains capable of transforming cellulosic biomass to biofuels at high yields and titers.

59 BASIC BIOLOGICAL SCIENCES↗

Modeling District Heating and Cooling Systems with URBANopt, GeoJSON to Modelica Translator, and the Modelica Buildings Library

The URBANopt project has successfully leveraged OpenStudio/EnergyPlus to model buildings and electrical systems at an urban scale; however, URBANopt has lacked the ability to model district thermal energy systems until recently. This paper will present the modeling infrastructure that was developed specifically for the analysis of district heating and cooling systems, and how it is integrated into the existing URBANopt framework. The paper also discusses the development of new models added to the Modelica Buildings Library to model various district energy system components including loads, energy transfer stations (ETS), distribution networks, and central plants. The paper describes how different building loads can be modeled including time series, TEASER reduced-order models, or Spawn of EnergyPlus models. URBANopt District Energy Systems allows the user to switch between the various configurations.

district heating and cooling↗

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↗

Space physics analysis network node directory (The Yellow Pages): Fourth edition

The Space Physics Analysis Network (SPAN) is a component of the global DECnet Internet, which has over 17,000 host computers. The growth of SPAN from its implementation in 1981 to its present size of well over 2,500 registered SPAN host computers, has created a need for users to acquire timely information about the network through a central source. The SPAN Network Information Center (SPAN-NIC) an online facility managed by the National Space Science Data Center (NSSDC) was developed to meet this need for SPAN-wide information. The remote node descriptive information in this document is not currently contained in the SPAN-NIC database, but will be incorporated in the near future. Access to this information is also available to non-DECnet users over a variety of networks such as Telenet, the NASA Packet Switched System (NPSS), and the TCP/IP Internet. This publication serves as the Yellow Pages for SPAN node information. The document also provides key information concerning other computer networks connected to SPAN, nodes associated with each SPAN routing center, science discipline nodes, contacts for primary SPAN nodes, and SPAN reference information. A section on DECnet Internetworking discusses SPAN connections with other wide-area DECnet networks (many with thousands of nodes each). Another section lists node names and their disciplines, countries, and institutions in the SPAN Network Information Center Online Data Base System. All remote sites connected to US-SPAN and European-SPAN (E-SPAN) are indexed. Also provided is information on the SPAN tail circuits, i.e., those remote nodes connected directly to a SPAN routing center, which is the local point of contact for resolving SPAN-related problems. Reference material is included for those who wish to know more about SPAN. Because of the rapid growth of SPAN, the SPAN Yellow Pages is reissued periodically.

Peters, David J.↗

Deep reaction network exploration at a heterogeneous catalytic interface

Characterizing the reaction energies and barriers of reaction networks is central to catalyst development. However, heterogeneous catalytic surfaces pose several unique challenges to automatic reaction network characterization, including large sizes and open-ended reactant sets, that make ad hoc network construction the current state-of-the-art. Here, we show how automated network exploration algorithms can be adapted to the constraints of heterogeneous systems using ethylene oligomerization on silica-supported single-site Ga 3+ as a model system. Using only graph-based rules for exploring the network and elementary constraints based on activation energy and size for identifying network terminations, a comprehensive reaction network is generated and validated against standard methods. The algorithm (re)discovers the Ga-alkyl-centered Cossee-Arlman mechanism that is hypothesized to drive major product formation while also predicting several new pathways for producing alkanes and coke precursors. These results demonstrate that automated reaction exploration algorithms are rapidly maturing towards general purpose capability for exploratory catalytic applications.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗