SEARCH · Engineering Papers
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.
This fact sheet provides a general overview of the Energy Transitions Initiative Partnership Project (ETIPP). It describes the general purpose of the program, and provides some general examples of technical assistance that could be offered through the program.
Microbial-mediated utilization of particulate organic matter (POM) during its downward transport from the surface to the deep ocean constitutes a critical component of the global ocean carbon cycle. However, it remains unclear as to how high hydrostatic pressure (HHP) and low temperature (LT) with the sinking particles affects community structure and network interactions of the particle-attached microorganisms (PAM) and those free-living microorganisms (FLM) in the surrounding water. In this study, we investigated microbial succession and network interactions in experiments simulating POM sinking in the ocean. Diatom-derived 13C- and 12C-labeled POM were used to incubate surface water microbial communities from the East China Sea (ECS) under pressure (temperature) of 0.1 (25 °C), 20 (4 °C), and 40 (4 °C) MPa (megapascal). Our results show that the diversity and species richness of the PAM and FLM communities decreased significantly with HHP and LT. Microbial community analysis indicated an increase in the relative abundance of Bacteroidetes at high pressure (40 MPa), mostly at the expense of Gammaproteobacteria, Alphaproteobacteria, and Gracilibacteria at atmospheric pressure. Hydrostatic pressure and temperature affected lifestyle preferences between particle-attached (PA) and free-living (FL) microbes. Ecological network analysis showed that HHP and LT enhanced microbial network interactions and resulted in higher vulnerability to networks of the PAM communities and more resilience of those of the FLM communities. Most interestingly, the PAM communities occupied most of the module hubs of the networks, whereas the FLM communities mainly served as connectors of the modules, suggesting their different ecological roles of the two groups of microbes. These results provided novel insights into how HHP and LT affected microbial community dynamics, ecological networks during POM sinking, and the implications for carbon cycling in the ocean.
Achieving international food security requires improved understanding of how international trade networks connect countries around the world through the import-export flows of food commodities. The properties of international food trade networks are still poorly documented, especially from a multi-network perspective. In particular, nothing is known about the multi-network's community structure. Here we find that the individual crop-specific layers of the multi-network have densely connected trading groups, a consistent characteristic over the period 2001-2011. Further, the multi-network is characterized by low variability over this period but with substantial heterogeneity across layers in each year. In particular, the layers are mostly assortative: more-intensively connected countries tend to import from and export to countries that are themselves more connected. We also fit econometric models to identify social, economic and geographic factors explaining the probability that any two countries are co-present in the same community. Our estimates indicate that the probability of country pairs belonging to the same food trade community depends more on geopolitical and economic factors-such as geographical proximity and trade-agreement co-membership-than on country economic size and/or income. These community-structure findings of the multi-network are especially valuable for efforts to understand past and emerging dynamics in the global food system, especially those that examine potential 'shocks' to global food trade.
Dynamic (Temporal) graphs capture the valuable evolution of real-world systems, from the continuously evolving patterns of social interactions and genetic pathways to the dynamic fluctuations of economic forces. Detecting communities for such evolving networks poses unique challenges. Detecting and analyzing the evolution of communities within dynamic graphs unlocks valuable insights into the underlying structural and temporal patterns of real-world systems. However, the sheer volume of modern graph data and the inherent complexity of the temporal dimension pose significant challenges to scalable community detection algorithms. Addressing this gap, our work explores the limited landscape of scalable distributed-memory parallel methods specifically designed for dynamic network community detection. We propose a novel parallel algorithm, DyG-DPCD (Dynamic Graph Distributed Parallel Community Detection), to detect communities in dynamic networks using the Message Passing Interface (MPI) framework. We present a vertex-centric approach, allowing us to detect communities through local optimization. Furthermore, we enhance our baseline algorithm by incorporating three heuristics, which improve the algorithm’s performance significantly while maintaining the quality of the solutions. We demonstrate the efficiency of our algorithm by experimenting on several real-world large-scale networks with hundreds of millions of edges spanning diverse domains. Notably, DyG-DPCD achieves speedups between 25× and 30× for large networks that we experimented on using NERSC compute nodes. In conclusion, our algorithm outperforms the STINGER parallel re-agglomeration algorithm by 30×.
A very important problem in combinatorial optimization is the partitioning of a network into communities of densely connected nodes; where the connectivity between nodes inside a particular community is large compared to the connectivity between nodes belonging to different ones. This problem is known as community detection, and has become very important in various fields of science including chemistry, biology and social sciences. The problem of community detection is a twofold problem that consists of determining the number of communities and, at the same time, finding those communities. This drastically increases the solution space for heuristics to work on, compared to traditional graph partitioning problems. In many of the scientific domains in which graphs are used, there is the need to have the ability to partition a graph into communities with the “highest quality” possible since the presence of even small isolated communities can become crucial to explain a particular phenomenon. We have explored community detection using the power of quantum annealers, and in particular the D-Wave 2X and 2000Q machines. It turns out that the problem of detecting at most two communities naturally fits into the architecture of a quantum annealer with almost no need of reformulation. This paper addresses a systematic study of detecting two or more communities in a network using a quantum annealer.
A telephone survey of U.S. aerospace engineers and scientists who were on the Society of Automotive Engineers (SAE) mailing list was conducted between August 14-26, 1991. The survey was undertaken to obtain information on the daily work activities of aerospace engineers and scientists, to measure various practices used by aerospace engineers and scientists to obtain STI, and to ask aerospace engineers and scientists about their use of electronic networks. Co-workers were found important sources of information. Co-workers are used to obtain technical information because the information they have is relevant, not because co-workers are accessible. As technical uncertainty increases, so does the need for information internal and external to the organization. Electronic networks enjoy widespread use within the aerospace community. These networks are accessible and they are used to contact people at remote sites. About 80 percent of the respondents used electronic mail, file transfer, and information or data retrieval to commercial or in-house data bases.
Historically, engineers at the National Aeronautics and Space Administration (NASA) had few opportunities or incentives to share their technical expertise across the Agency. Its center- and project- focused culture often meant that knowledge never left organizational and geographic boundaries. With increasingly complex missions, the closeout of the Shuttle Program, and a new generation entering the workforce, developing a knowledge sharing culture became critical. To address this need, the Office of the Chief Engineer established communities of practice on the NASA Engineering Network. These communities were strategically aligned with NASA's core competencies in such disciplines as avionics, flight mechanics, life support, propulsion, structures, loads and dynamics, human factors, and guidance, navigation, and control. This paper describes the process used to identify and develop communities, from establishing simple websites that compiled discipline-specific resources to fostering a knowledge-sharing environment through collaborative and interactive technologies. It includes qualitative evidence of improved availability and transfer of knowledge. It focuses on pivotal capabilities that increased knowledge exchange such as a custom-made Ask An Expert system, community contact lists, publication of key resources, and submission forms that allowed any user to propose content for the sites. It discusses the peer relationships that developed through the communities and the leadership and infrastructure that made them possible.
Graph neural networks (GNNs) are increasingly widely used for community detection in attributed networks. They combine structural topology with node attributes through message passing and pooling. However, their robustness or lack thereof with respect to different perturbations and targeted attacks in conjunction with community detection tasks is not well understood. To shed light on latent mechanisms behind GNN sensitivity on community detection tasks, we conduct a systematic computational evaluation of six widely adopted GNN architectures graph convolutional network, graph attention network, graph sample and aggregate (GraphSAGE), differentiable pooling (DiffPool), minimum cut pooling (MinCUT), and deep modularity networks (DMoN). The analysis covers three perturbation categories: node attribute manipulations, edge topology distortions, and adversarial attacks. We use element-centric similarity as the evaluation metric on synthetic benchmarks and real-world citation networks. Our findings indicate that supervised GNNs tend to achieve higher baseline accuracy, while unsupervised methods, particularly DMoN, maintain stronger resilience under targeted and adversarial perturbations. Furthermore, robustness appears to be strongly influenced by community strength, with well-defined communities reducing performance loss. Across all models, node attribute perturbations associated with targeted edge deletions and shifts in attribute distributions tend to cause the largest degradation in community recovery. These findings highlight important trade-offs between accuracy and robustness in GNN-based community detection and offer insights into selecting architectures resilient to noise and adversarial attacks.
Techniques are provided for community threat intelligence for operational technology networks. For a plurality of OT networks, at least one monitoring device processes OT network traffic and collects telemetry data, and a telemetry sanitization system applies a sanitization process to the telemetry data to generate sanitized telemetry data that does not include sensitive data. A computer system receives sanitized telemetry data from the telemetry sanitization systems provided for the plurality of OT networks, maintains threat intelligence data generated based on the sanitized telemetry data, and provides access to at least one of the threat intelligence data and the sanitized telemetry data to a plurality of users.
Label Propagation is a machine learning algorithm typically used for classification. It has also been found to be an effective method for detecting communities in networks. It has two attractive features as a community detection method: it has nearly linear runtime and it requires no \textit{a priori} community information. We propose a new Direction Optimizing Label Propagation Algorithm (DOLPA) that relies on the use of {\em frontiers} and alternates between label {\em push} and label {\em pull} operations to enhance the performance of LPA. Specifically, DOLPA has parameters for tuning the processing order of vertices in a graph. This reduces the number of edges visited and improves the quality of solution. We apply DOLPA to community detection and present the design and implementation of the algorithm as well as its shared-memory parallelization using OpenMP. Empirically, we evaluate our algorithm using synthetic graphs as well as real-world networks. Compared with the state-of-art \textit{Parallel Label Propagation} algorithm, we achieve at least two times the F-Score while reducing the runtime by 50\% for synthetic graphs with overlapping communities. We also compare DOLPA against the state-of-art parallel implementation of the Louvain method using the same graphs and show that DOLPA achieves about three times the F-Score at 10\% the runtime. On real-world graphs, we get a speedup of up to $10\times$ using 64 threads.
This study develops a future scenario that enables convenient point-to-point commercial air travel via a large network of community airports and a new class of small airliners. A network demand and capacity study identifies current and future air travel demands and the capacity of this new network to satisfy these demands. A current technology small commercial airliner is defined to meet the needs of the new network, as a baseline for evaluating the improvement brought about by advanced technologies. Impact of this new mode of travel on the infrastructure and surrounding communities of the small airports in this new N+3 network are also evaluated. Year 2030-2035 small commercial airliner technologies are identified and a trade study conducted to evaluate and select those with the greatest potential for enhancing future air travel and the study metrics. The selected advanced air vehicle concept is assessed against the baseline aircraft, and an advanced, but conventional aircraft, and the study metrics. The key technologies of the selected advanced air vehicle are identified, their impact quantified, and risk assessments and roadmaps defined.
A lack of sounding data has limited the accuracy of ozone satellite retrievals in the tropics and our understanding of chemical-dynamical interactions in a region strongly influenced by natural variability and anthropogenic activity. In 1998, NASA s Goddard Space Flight Center, NOAA's Climate Monitoring and Diagnostics Laboratory (CMDL) and a team of international sponsors established the SHADOZ (Southern Hemisphere ADditional OZonesondes) project to address the gap in tropical ozone soundings. SHADOZ augments launches at selected sites and provides a public archive of ozonesonde and radiosonde data from twelve tropical and subtropical stations at http://croc.gsfc.nasa.gov/shadoz. Instrumentation, data and a summary of the first scientific findings from SHADOZ are presented.
Sampling is an important step in the machine learning process because it prioritizes samples that help the model best summarize the important concepts required for the task at hand. The process of determining the best sampling method has been rarely studied in the context of graph neural networks. In this paper, we evaluate multiple sampling methods (i.e., ascending and descending) that sample based off different definitions of centrality (i.e., Voterank, Pagerank, degree) to observe its relation with network topology. We find that no sampling method is superior across all network topologies. Additionally, we find situations where ascending sampling provides better classification scores, showing the strength of weak ties. Two strategies are then created to predict the best sampling method, one that observes the homogeneous connectivity of the nodes, and one that observes the network topology. In both methods, we are able to evaluate the best sampling direction consistently.
The Optical Network Testbeds Workshop 2 (ONT2), held on September 12-14, 2005, was cosponsored by the Department of Energy Office of Science (DOE/SC) and the National Aeronautics and Space Administration (NASA), in cooperation with the Joint Engineering Team (JET) of the Federal Networking and Information Technology Research and Development (NITRD) Program's Large Scale Networking (LSN) Coordinating Group. The ONT2 workshop was a follow-on to an August 2004 Workshop on Optical Network Testbeds (ONT1). ONT1 recommended actions by the Federal agencies to assure timely development and implementation of optical networking technologies and infrastructure. Hosted by the NASA Ames Research Center in Mountain View, California, the ONT2 workshop brought together representatives of the U.S. advanced research and education (R&E) networks, regional optical networks (RONs), service providers, international networking organizations, and senior engineering and R&D managers from Federal agencies and national research laboratories. Its purpose was to develop a common vision of the optical network technologies, services, infrastructure, and organizations needed to enable widespread use of optical networks; recommend activities for transitioning the optical networking research community and its current infrastructure to leading-edge optical networks over the next three to five years; and present information enabling commercial network infrastructure providers to plan for and use leading-edge optical network services in that time frame.
An integrated approach to building a networking infrastructure is an absolute necessity for meeting the multidisciplinary science networking requirements of the Office of Space Science and Applications (OSSA) science community. These networking requirements include communication connectivity between computational resources, databases, and library systems, as well as to other scientists and researchers around the world. A consolidated networking approach allows strategic use of the existing science networking within the Federal government, and it provides networking capability that takes into consideration national and international trends towards multivendor and multiprotocol service. It also offers a practical vehicle for optimizing costs and maximizing performance. Finally, and perhaps most important to the development of high speed computing is that an integrated network constitutes a focus for phasing to the National Research and Education Network (NREN). The NASA Science Internet (NSI) program, established in mid 1988, is structured to provide just such an integrated network. A description of the NSI is presented.
The present invention provides a heterogeneous spacecraft network including a network management architecture to facilitate communication between a plurality of operations centers and a plurality of data user communities. The network management architecture includes a plurality of network nodes in communication with the plurality of operations centers. The present invention also provides a method of communication for a heterogeneous spacecraft network. The method includes: transmitting data from a first space segment to a first ground segment; transmitting the data from the first ground segment to a network management architecture; transmitting data from a second space segment to a second ground segment, the second space and ground segments having incompatible communication systems with the first space and ground segments; transmitting the data from the second ground station to the network management architecture; and, transmitting data from the network management architecture to a plurality of data user communities.
Improving community resilience to climate change impacts is a core goal of the Beacon Hill stakeholder task force. Developing a network of resilience hubs in the community is a strategy the task force is pursuing to build this resilience. This technical assistance aims to assist the task force in their resilience hub network planning by: identifying hazards that the resilience hubs may address; providing background information on social vulnerability and climate impacts; identifying populations in Beacon Hill who are at risk to disproportionate climate impacts due to social isolation and physical vulnerability characteristics (e.g., lack of transportation or internet); and identifying the potential role of resilience hubs that align with best practices for reducing social vulnerability to climate impacts.
Graph layout algorithms used in network visualization represent the first and the most widely used tool to unveil the inner structure and the behavior of complex networks. Current network visualization software relies on the force-directed layout (FDL) algorithm, whose high computational complexity makes the visualization of large real networks computationally prohibitive and traps large graphs into high energy configurations, resulting in hard-to-interpret “hairball” layouts. Here we use Graph Neural Networks (GNN) to accelerate FDL, showing that deep learning can address both limitations of FDL: it offers a 10 to 100 fold improvement in speed while also yielding layouts which are more informative. We analytically derive the speedup offered by GNN, relating it to the number of outliers in the eigenspectrum of the adjacency matrix, predicting that GNNs are particularly effective for networks with communities and local regularities. Finally, we use GNN to generate a three-dimensional layout of the Internet, and introduce additional measures to assess the layout quality and its interpretability, exploring the algorithm’s ability to separate communities and the link-length distribution. The novel use of deep neural networks can help accelerate other network-based optimization problems as well, with applications from reaction-diffusion systems to epidemics.