Search NASA⌕ Search

SEARCH · Search NASA

Results for “network flow 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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS2023

An Urban Drainage Scheme for Large-Scale Flood Models

As flood modeling spatial resolutions get finer, physical processes normally neglected, such as urban drainage, must be accounted for. Here, we describe and evaluate an urban drainage scheme for large-scale flood models. The parameterization accounts for urban imperviousness, and water flow over streets and through a prescribed urban drainage network. A parameter sensitivity analysis is performed during three major extreme floods over Rio de Janeiro city, Brazil, at ∼200 m spatial resolution. Results show that, compared to a hypothetical case without urban drainage, representing a drainage network decreases urban flooding during selected extreme events across Rio de Janeiro by 31–53 %. Such a decrease is caused by an underground water storage of up to 2.5 billion m3 across the city during flood peaks. Underground water storage and transport smooth out and delay peak flows by a few hours over major rivers and channels draining the city. Simulations also indicate that the number of residents exposed to flooding drops by 60–80 %, from ∼5 million to 1–2 million, when an urban drainage system is considered during extreme events. Similar proportions are found for social infrastructure (i.e., schools and hospitals) exposed to flooding. Results reveal that racial minority and low-income populations could disproportionally be exposed to extreme floodings across the city. We conclude that representing urban drainage has a substantial impact on flood exposure and should be accounted for in fine resolution modeling. The proposed scheme is particularly useful in poorly monitored cities and where extreme floods are a frequent hazard yet to be tackled.

Urban drainage↗
DOE OSTI2020

Wave function analysis with a maximum flow algorithm

An efficient algorithm for computing the maximum-flow path in a network is applied to the identification of the dominant configuration state functions (CSFs) in a graphically contracted function (GCF), configuration interaction, wave function. The flow network is a space of spin-adapted CSFs represented by a Shavitt graph, wherein the nodes correspond to orbital occupations and spin quantum numbers. The graph nodes are connected by arcs, and an arc density is defined as sums of the associated squared CSF coefficients. A max-min approach determines an upper bound to the maximum possible incoming flow for each graph node. A backtracking step generates a candidate walk and is followed by a limited search of alternative branching paths for the dominant CSF. The arc density contributions are removed from the graph, and the algorithm is reapplied to the updated graph. This list of generated walks can be partitioned in order to guarantee that the dominant CSFs have been identified. All of the steps in this algorithm are computationally efficient and do not depend on the potentially large dimension of the underlying linear CSF expansion space. An analysis of low-lying valence states of C-2 illustrates the method.

74 ATOMIC AND MOLECULAR PHYSICS↗
NASA NTRS2015

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↗
DOE OSTI2018

Evolution of DDB1-binding WD40 (DWD) in the viridiplantae

Damaged DNA Binding 1 (DDB1)—binding WD40 (DWD) proteins are highly conserved and involved in a plethora of developmental and physiological processes such as flowering time control, photomorphogenesis, and abiotic stress responses. The phylogeny of this family of proteins in plants and algae of viridiplante is a critical area to understand the emergence of this family in such important and diverse functions. We aimed to investigate the putative homologs of DWD in the viridiplante and establish a deeper DWD evolutionary grasp. The advancement in publicly available genomic data allowed us to perform an extensive genome-wide DWD retrieval. Using annotated Arabidopsis thaliana DWDs as the reference, we generated and characterized a comprehensive DWD database for the studied photoautotrophs. Further, a generic DWD classification system (Type A to K), based on (i) position of DWD motifs, (ii) number of DWD motifs, and (iii) presence/absence of other domains, was adopted. About 72–80% DWDs have one DWD motif, whereas 17–24% DWDs have two and 0.5–4.7% DWDs have three DWD motifs. Neighbor-joining phylogenetic construction of A. thaliana DWDs facilitated us to tune these substrate receptors into 15 groups. Though the DWD count increases from microalgae to higher land plants, the ratio of DWD to WD40 remained constant throughout the viridiplante. The DWD expansion appeared to be the consequence of consistent DWD genetic flow accompanied by several gene duplication events. The network, phylogenetic, and statistical analysis delineated DWD evolutionary relevance in the viridiplante.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

GIS Visualization of Transportation Energy Consumption

Transportation is witnessing unprecedented transformation, where emerging technologies are disrupting the way we travel. Be it sharing economy, or micro-mobility, the landscape of urban transportation is undergoing a much-needed paradigm shift. In order to capture and model these shifts, researchers need to be agile in their studies of the current and future transportation landscape. The need for agility in turn calls for sophisticated, intuitive, and reliable means to visualize and share transportation data. Travel is inherently spatial, so methods of visualizing transportation information should also be rooted in spatial analysis. Geographic Information Systems (GIS) are the premier technological framework to analyze and display spatial data. GIS tools have been used in the past to depict flow of vehicles, and display of network conditions (speed, congestion, etc.). However, in an ever-changing technological landscape, spanning advancements in vehicle as well as information systems, depicting vehicle flows falls short of providing a comprehensive picture of the impact these advancements have on travel related energy consumption. To address this issue, this research effort presents a web-based mapping application to visualize how travel related energy flows across a city. The application is being developed by National Renewable Energy Laboratory researchers to integrate various transportation energy consumption models within a GIS schema. This has the goal of enabling rapid analysis of energy impacts of the dramatically evolving transportation environment. The application is being developed using a Python framework for ArcGIS Online. Using road network data from the City of Columbus, Ohio and traffic data from CATT Laboratory's Regional Integrated Transportation Information System, transportation energy consumption will be modeled at a macro level. The application aims to provide highly accurate data while still maintaining the flexibility needed to adapt the model when new technologies arise. The methodology presented through this effort is expected to provide insights into how light-duty vehicles use energy on a large scale based on the road network they use. The application will also provide data exports to enable sharing and collaboration. " need for agility in turn calls for sophisticated, intuitive, and reliable means to visualize and share transportation data. Travel is inherently spatial, so methods of visualizing transportation information should also be rooted in spatial analysis. Geographic Information Systems (GIS) are the premier technological framework to analyze and display spatial data. GIS tools have been used in the past to depict flow of vehicles, and display of network conditions (speed, congestion, etc.). However, in an ever-changing technological landscape, spanning advancements in vehicle as well as information systems, depicting vehicle flows falls short of providing a comprehensive picture of the impact these advancements have on travel related energy consumption. To address this issue, this research effort presents a web-based mapping application to visualize how travel related energy flows across a city. The application is being developed by National Renewable Energy Laboratory researchers to integrate various transportation energy consumption models within a GIS schema. This has the goal of enabling rapid analysis of energy impacts of the dramatically evolving transportation environment. The application is being developed using a Python framework for ArcGIS Online. Using road network data from the City of Columbus, Ohio and traffic data from CATT Laboratory's Regional Integrated Transportation Information System, transportation energy consumption will be modeled at a macro level. The application aims to provide highly accurate data while still maintaining the flexibility needed to adapt the model when new technologies arise. The methodology presented through this effort is expected to provide insights into how light-duty vehicles use energy on a large scale based on the road network they use. The application will also provide data exports to enable sharing and collaboration.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2017

Crystalline and Crystalline International Disposal Activities

This report presents the results of work conducted between September 2015 and July 2016 at Los Alamos National Laboratory in the crystalline disposal and crystalline international disposal work packages of the Used Fuel Disposition Campaign (UFDC) for DOE-NE’s Fuel Cycle Research and Development program. Los Alamos focused on two main activities during this period: Discrete fracture network (DFN) modeling to describe flow and radionuclide transport in complex fracture networks that are typical of crystalline rock environments, and a comprehensive interpretation of three different colloid-facilitated radionuclide transport experiments conducted in a fractured granodiorite at the Grimsel Test Site in Switzerland between 2002 and 2013. Chapter 1 presents the results of the DFN work and is divided into three main sections: (1) we show results of our recent study on the correlation between fracture size and fracture transmissivity (2) we present an analysis and visualization prototype using the concept of a flow topology graph for characterization of discrete fracture networks, and (3) we describe the Crystalline International work in support of the Swedish Task Force. Chapter 2 presents interpretation of the colloidfacilitated radionuclide transport experiments in the crystalline rock at the Grimsel Test Site.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
NASA NTRS2009

Computing Bounds on Resource Levels for Flexible Plans

A new algorithm efficiently computes the tightest exact bound on the levels of resources induced by a flexible activity plan (see figure). Tightness of bounds is extremely important for computations involved in planning because tight bounds can save potentially exponential amounts of search (through early backtracking and detection of solutions), relative to looser bounds. The bound computed by the new algorithm, denoted the resource-level envelope, constitutes the measure of maximum and minimum consumption of resources at any time for all fixed-time schedules in the flexible plan. At each time, the envelope guarantees that there are two fixed-time instantiations one that produces the minimum level and one that produces the maximum level. Therefore, the resource-level envelope is the tightest possible resource-level bound for a flexible plan because any tighter bound would exclude the contribution of at least one fixed-time schedule. If the resource- level envelope can be computed efficiently, one could substitute looser bounds that are currently used in the inner cores of constraint-posting scheduling algorithms, with the potential for great improvements in performance. What is needed to reduce the cost of computation is an algorithm, the measure of complexity of which is no greater than a low-degree polynomial in N (where N is the number of activities). The new algorithm satisfies this need. In this algorithm, the computation of resource-level envelopes is based on a novel combination of (1) the theory of shortest paths in the temporal-constraint network for the flexible plan and (2) the theory of maximum flows for a flow network derived from the temporal and resource constraints. The measure of asymptotic complexity of the algorithm is O(N O(maxflow(N)), where O(x) denotes an amount of computing time or a number of arithmetic operations proportional to a number of the order of x and O(maxflow(N)) is the measure of complexity (and thus of cost) of a maximumflow algorithm applied to an auxiliary flow network of 2N nodes. The algorithm is believed to be efficient in practice; experimental analysis shows the practical cost of maxflow to be as low as O(N1.5). The algorithm could be enhanced following at least two approaches. In the first approach, incremental subalgorithms for the computation of the envelope could be developed. By use of temporal scanning of the events in the temporal network, it may be possible to significantly reduce the size of the networks on which it is necessary to run the maximum-flow subalgorithm, thereby significantly reducing the time required for envelope calculation. In the second approach, the practical effectiveness of resource envelopes in the inner loops of search algorithms could be tested for multi-capacity resource scheduling. This testing would include inner-loop backtracking and termination tests and variable and value-ordering heuristics that exploit the properties of resource envelopes more directly.

Muscvettola, Nicola↗
NASA NTRS2003

[Development and Use of Hidrosig]

The NASA portion of this joint NSF-NASA grant consists of objective 2 and a part of objective 3. A major effort was made on objective 2, and it consisted of developing a numerical GIs environment called Hidrosig. This major research tool is being developed by the University of Colorado for conducting river-network-based scaling analyses of coupled water-energy-landform-vegetation interactions including water and energy balances, and floods and droughts, at multiple space-time scales.Objective 2: To analyze the relevant remotely sensed products from satellites, radars and ground measurements to compute the transported water mass for each complete Strahler stream using an 'assimilated water balance equation' at daily and other appropriate time scales. This objective requires analysis of concurrent data sets for Precipitation (PPT), Evapotranspiration (ET) and stream flows (Q) on river networks. To solve this major problem, our decision was to develop Hidrosig, a new Open-Source GIs software. A research group in Colombia, South America, developed the first version of Hidrosig, and Ricardo Mantilla was part of this effort as an undergraduate student before joining the graduate program at the University of Colorado in 2001. Hydrosig automatically extracts river networks from large DEMs and creates a "link-based" data structure, which is required to conduct a variety of analyses under objective 2. It is programmed in Java, which is a multi-platform programming language freely distributed by SUN under a GPL license. Some existent commercial tools like Arc-Info, RiverTools and others are not suitable for our purpose for two reasons. First, the source code is not available that is needed to build on the network data structure. Second, these tools use different programming languages that are not most versatile for our purposes. For example, RiverTools uses an IDL platform that is not very efficient for organizing diverse data sets on river networks. Hidrosig establishes a clear data organization framework that allows a simultaneous analysis of spatial fields along river network structures involving Horton- Strahler framework. Software tools for network extraction from DEMs and network-based analysis of geomorphologic and topologic variables were developed during the first year and a part of second year.

Gupta, Vijay K.↗
NASA NTRS1998

A Second Law Based Unstructured Finite Volume Procedure for Generalized Flow Simulation

An unstructured finite volume procedure has been developed for steady and transient thermo-fluid dynamic analysis of fluid systems and components. The procedure is applicable for a flow network consisting of pipes and various fittings where flow is assumed to be one dimensional. It can also be used to simulate flow in a component by modeling a multi-dimensional flow using the same numerical scheme. The flow domain is discretized into a number of interconnected control volumes located arbitrarily in space. The conservation equations for each control volume account for the transport of mass, momentum and entropy from the neighboring control volumes. In addition, they also include the sources of each conserved variable and time dependent terms. The source term of entropy equation contains entropy generation due to heat transfer and fluid friction. Thermodynamic properties are computed from the equation of state of a real fluid. The system of equations is solved by a hybrid numerical method which is a combination of simultaneous Newton-Raphson and successive substitution schemes. The paper also describes the application and verification of the procedure by comparing its predictions with the analytical and numerical solution of several benchmark problems.

Majumdar, Alok↗
NASA NTRS2011

Extension of Generalized Fluid System Simulation Program's Fluid Property Database

This internship focused on the development of additional capabilities for the General Fluid Systems Simulation Program (GFSSP). GFSSP is a thermo-fluid code used to evaluate system performance by a finite volume-based network analysis method. The program was developed primarily to analyze the complex internal flow of propulsion systems and is capable of solving many problems related to thermodynamics and fluid mechanics. GFSSP is integrated with thermodynamic programs that provide fluid properties for sub-cooled, superheated, and saturation states. For fluids that are not included in the thermodynamic property program, look-up property tables can be provided. The look-up property tables of the current release version can only handle sub-cooled and superheated states. The primary purpose of the internship was to extend the look-up tables to handle saturated states. This involves a) generation of a property table using REFPROP, a thermodynamic property program that is widely used, and b) modifications of the Fortran source code to read in an additional property table containing saturation data for both saturated liquid and saturated vapor states. Also, a method was implemented to calculate the thermodynamic properties of user-fluids within the saturation region, given values of pressure and enthalpy. These additions required new code to be written, and older code had to be adjusted to accommodate the new capabilities. Ultimately, the changes will lead to the incorporation of this new capability in future versions of GFSSP. This paper describes the development and validation of the new capability.

Patel, Kishan↗
NASA NTRS2011

Defining Dynamic Route Structure

This poster describes a method for defining route structure from flight tracks. Dynamically generated route structures could be useful in guiding dynamic airspace configuration and helping controllers retain situational awareness under dynamically changing traffic conditions. Individual merge and diverge intersections between pairs of flights are identified, clustered, and grouped into nodes of a route structure network. Links are placed between nodes to represent major traffic flows. A parametric analysis determined the algorithm input parameters producing route structures of current day flight plans that are closest to todays airway structure. These parameters are then used to define and analyze the dynamic route structure over the course of a day for current day flight paths. Route structures are also compared between current day flight paths and more user preferred paths such as great circle and weather avoidance routing.

Zelinski, Shannon↗
NASA NTRSDate not supplied

GT2024-128885: Flow Reconstruction in a Transonic Turbine Cascade using Physics-Informed Neural Networks (PINNs)

This presentation investigates the application of Physics-Informed Neural Networks (PINNs) for the analysis of turbine blades in a transonic cascade. PINNs are a machine learning method trained on losses calculated from reconstructed governing equations, assigned boundary/initial conditions, and measured data. We reconstruct the 2-D flow field in a transonic turbine cascade in two ways: the traditional forward approach (without training/experimental data) and by training the PINN using experimental data. We then compare the PINN solutions to measured data. This is repeated for three different turbine blades with distinct loading characteristics. The experimental data used for training is the static pressure measurements along the suction and pressure sides of each blade. The PINN is trained utilizing all available data, half the available data, data from only the leading edge region, and data from only the trailing edge region. It's shown that the PINN can reconstruct the flow field in all cases with acceptable errors. Cases where the PINN is trained on all the data, and even half the data, resulted in the lowest errors. The exit Mach number is inferred for each case and compared to the experimentally calculated value.

Machine Learning↗
DOE OSTI2019

A Software Defined Network Design for Analyzing Streaming Data in Transit

Year after year, network traffic keeps reaching newhighs as unprecedented volumes of data flow between an ever-increasing number of sources and destinations. As part of the Analysis on the Wire project, we aim to develop a network-centric approach for streaming data processing to facilitate scientific data analysis and reduce the overhead in sending big data to a data center. This work discusses our design for programmable network devices to augment network capabilities for streaming data processing, including efforts in progress at Brookhaven National Laboratory and the challenges faced to date.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1992

Integrated numerical methods for hypersonic aircraft cooling systems analysis

Numerical methods have been developed for the analysis of hypersonic aircraft cooling systems. A general purpose finite difference thermal analysis code is used to determine areas which must be cooled. Complex cooling networks of series and parallel flow can be analyzed using a finite difference computer program. Both internal fluid flow and heat transfer are analyzed, because increased heat flow causes a decrease in the flow of the coolant. The steady state solution is a successive point iterative method. The transient analysis uses implicit forward-backward differencing. Several examples of the use of the program in studies of hypersonic aircraft and rockets are provided.

Petley, Dennis H.↗
NASA NTRS1993

Analysis of high vacuum systems using SINDA'85

The theory, algorithms, and test data correlation analysis of a math model developed to predict performance of the Space Station Freedom Vacuum Exhaust System are presented. The theory used to predict the flow characteristics of viscous, transition, and molecular flow is presented in detail. Development of user subroutines which predict the flow characteristics in conjunction with the SINDA'85/FLUINT analysis software are discussed. The resistance-capacitance network approach with application to vacuum system analysis is demonstrated and results from the model are correlated with test data. The model was developed to predict the performance of the Space Station Freedom Vacuum Exhaust System. However, the unique use of the user subroutines developed in this model and written into the SINDA'85/FLUINT thermal analysis model provides a powerful tool that can be used to predict the transient performance of vacuum systems and gas flow in tubes of virtually any geometry. This can be accomplished using a resistance-capacitance (R-C) method very similar to the methods used to perform thermal analyses.

Spivey, R. A.↗
DOE OSTI2024

Macroscopic Traffic Modeling Using Probe Vehicle Data: A Machine Learning Approach

Abstract The macroscopic fundamental diagram (MFD) captures an orderly relationship among traffic flow, density, and speed at the network level. It is a simple yet powerful tool for modeling traffic dynamics in large urban networks with broad application in traffic control and management. However, empirically derived MFDs in urban regions require high-resolution traffic data from the network. Having the network flow and vehicular density estimated at the (granular) census tract level using vehicle probe data, we apply machine learning methods to predict the MFDs across U.S. urban areas and capture the impacts of location-specific input features on the network flow–density relationships at a large scale. The results show that, among the four tested machine learning approaches (Random Forest, XGBoost, Support Vector Machine, and Neural Network), XGBoost delivers the best performance in predicting network traffic flow based on vehicular density and location attributes. Using interaction Shapley Additive explanation (SHAP) values and partial correlation analysis, we examine the factors influencing MFD shapes across different locations. Our empirical findings reveal that across U.S. urban areas, network topology, transportation infrastructure, and land use are primary factors shaping MFD curves, while demand and trip-related factors play a lesser role. Specifically, higher ranking roads, centrality, and development levels correlate positively with network capacity and critical density, whereas negative associations are observed for network connectivity, mixed-use development, and road roughness levels.

Jin, Ling↗