Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “network flow”

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 73 records · Page 4

Analysis and Visualization of Discrete Fracture Networks Using a Flow Topology Graph

We present an analysis and visualization prototype using the concept of a flow topology graph (FTG) for characterization of flow in constrained networks, with a focus on discrete fracture networks (DFN), developed collaboratively by geoscientists and visualization scientists. Our method allows users to understand and evaluate flow and transport in DFN simulations by computing statistical distributions, segment paths of interest, and cluster particles based on their paths. The new approach enables domain scientists to evaluate the accuracy of the simulations, visualize features of interest, and compare multiple realizations over a specific domain of interest. Geoscientists can simulate complex transport phenomena modeling large sites for networks consisting of several thousand fractures without compromising the geometry of the network. However, few tools exist for performing higher-level analysis and visualization of simulated DFN data. The prototype system we present addresses this need. Here, we demonstrate its effectiveness for increasingly complex examples of DFNs, covering two distinct use cases - hydrocarbon extraction from unconventional resources and transport of dissolved contaminant from a spent nuclear fuel repository.

97 MATHEMATICS AND COMPUTING↗

Modeling of Propagation of Interacting Cracks Under Hydraulic Pressure Gradient

A robust and reliable numerical model for fracture initiation and propagation, which includes the interactions among propagating fractures and the coupling between deformation, fracturing and fluid flow in fracture apertures and in the permeable rock matrix, would be an important tool for developing a better understanding of fracturing behaviors of crystalline brittle rocks driven by thermal and (or) hydraulic pressure gradients. In this paper, we present a physics-based hydraulic fracturing simulator based on coupling a quasi-static discrete element model (DEM) for deformation and fracturing with conjugate lattice network flow model for fluid flow in both fractures and porous matrix. Fracturing is represented explicitly by removing broken bonds from the network to represent microcracks. Initiation of new microfractures and growth and coalescence of the microcracks leads to the formation of macroscopic fractures when external and/or internal loads are applied. The coupled DEM-network flow model reproduces realistic growth pattern of hydraulic fractures. In particular, simulation results of perforated horizontal wellbore clearly demonstrate that elastic interactions among multiple propagating fractures, fluid viscosity, strong coupling between fluid pressure fluctuations within fractures and fracturing, and lower length scale heterogeneities, collectively lead to complicated fracturing patterns.

hydraulic fracturing↗

Control of Networked Traffic Flow Distribution: A Stochastic Distribution System Perspective

At signalized intersections, the traffic queues are controlled by traffic signal control settings and effective traffic lights control would realize both smooth traffic flow and minimize fuel consumption. Funded by the Energy Efficient Mobility Systems (EEMS) program of the Vehicle Technologies Office of the US Department of Energy, we performed a preliminary investigation on the modelling and control framework in context of urban network of signalized intersections. In specific, we developed a recursive input-output traffic queueing models. The queue formation can be modeled as a stochastic process where the number of vehicles entering each intersection is a random number. Further, we proposed a preliminary B-Spline stochastic modelling and control for a one-way single-lane corridor traffic system based on theory of stochastic distribution control that shapes the PDF of the queue length.

33 ADVANCED PROPULSION SYSTEMS↗

A biophysical approach to the performance diagnosis of human–building energy interaction: Information (bits) modeling, algorithm, and indicators of energy flow complexity

Highlights: • Energy-related human-building interaction is analyzed at the biophysical system scale. • Energy flow-networking model of environmental building performance is suggested. • Information is suggested as a holistic building performance metric. - Abstract: This article addresses the utmost upstream impacts of human–building energy interaction by proposing a network-based model, algorithms, and indicators. Hypothesizing that human behavior is a key factor for the symbiotic development of building and the geobiosphere system, the author seeks emergy (spelled with an “m”)-information integrated measures to indicate dynamic system-level performance of the interaction with building energy flow topology. To validate the hypothesis and methods, four representative building cases were tested on the building form (envelope) of (i) a building with no occupant intervention (baseline), (ii) a building controlled by responsive human behavior (bioclimatic adaptation), (iii) a building with reinforced insulation and behavior-dominated control (passive design), and (iv) a net-zero energy building (NZEB). The results demonstrate that adaptive human behavior in building operation increases the information content and complexity of energy-flow networking, improving performance and sustainability. Findings also reveal that increasing information, complexity, and power (energy availability over time) parallel the general energetic features of developing biophysical systems (greater feedback, internalization, and recycling of materials and energies). It becames clear that active behavioral response is a dominant agent of sustainable environments even on a far broader system scale.

54 ENVIRONMENTAL SCIENCES↗

Mastering Uncertainty and Risk at Multiple Time Scales in the Future Electrical Grid

Today's electrical grids enjoy a relatively clean separation of spatio-temporal scales yielding a compartmentalization of grid design, optimization, control and risk assessment allowing for the use of conventional mathematical tools within each area. In contrast, the future grid will incorporate time-intermittent renewable generation, operate via faster electrical markets, and tap the latent control capability at finer grid modeling scales; creating a fundamentally new set of couplings across spatiotemporal scales and requiring revolutionary advances in mathematics techniques to bridge these scales. One example is found in decade-scale grid expansion planning in which today's algorithms assume accurate load forecasts and well-controlled generation. Incorporating intermittent renewable generation creates fluctuating network flows at the hourly time scale, inherently linking the ability of a transmission line to deliver electrical power to hourly operational decisions. New operations-based planning algorithms are required, creating new mathematical challenges. Spatio-temporal scales are also crossed when the future grid's minute-scale fluctuations in network flows (due to intermittent generation) create a disordered state upon which second-scale transient grid dynamics propagate effectively invalidating today's on-line dynamic stability analyses. Addressing this challenge requires new on-line algorithms that use large data streams from new grid sensing technologies to physically aggregate across many spatial scales to create responsive, data-driven dynamic models. Here, we sketch the mathematical foundations of these problems and potential solutions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A novel lung-inspired 3D-printed desiccant-coated heat exchanger for high-performance humidity management in buildings

Offering an independent humidity management method for buildings, desiccant-coated heat exchangers (DCHXs) are deemed a promising approach to improve the overall energy efficiency of air conditioning (AC) systems. State-of-the-art DCHXs, however, are bound with conventional HX topologies either providing limited desiccant-air interfacial areas or introducing excessive pressure drop penalties. In this paper a novel 3D-printed DCHX concept inspired by the bronchi arrangement of a human lung is introduced to address the shortcomings inherent in existing DCHX designs. The proposed lung-inspired DCHX utilizes two intertwined bicontinuous flow networks enabling highly efficient heat and mass transfer characteristics for augmented adsorption and regeneration processes at low pressure drop penalties. While the first network evenly distributes an incoming air stream through the entire volume of the lung-inspired DCHX, the second network volumetrically splits a cooling water stream within and through the first network. Effects of various parameters including air flow rate, outdoor air humidity ratio, and regeneration temperature on dehumidification performance and energy efficiency of the proposed lung-inspired DCHX were investigated. Experimental results indicated the proposed lung-inspired 3D-printed DCHX outperforms existing DCHX systems by demonstrating an excellent balance between a high volumetric adsorption rate and a low pressure drop penalty. The volumetric adsorption rate of the proposed lung-inspired DCHX technology is 54.8 g/m 3 -s, a more than two-fold improvement compared with state-of-the-art DCHX systems. Additionally, the lung-inspired DCHX offers high thermal energy efficiency of 56% at a low regeneration temperature of 40 °C. Therefore, the proposed lung-inspired 3D-printed DCHX offers a new solid-desiccant-based air dehumidification pathway for next-generation high-performance AC systems.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

MinCostFlows.jl

MinCostFlows.jl is a utility package in the Julia programming language for efficiently solving min-cost network flow problems through an implementation of the relaxation dual ascent method (Bertsekas, 1985, https://link.springer.com/article/10.1007/BF01586087). The use of a dual ascent method allows for warm-starting the solver with a solution from a previously-solved problem that need not be feasible for the new problem, providing computational performance benefits when repeatedly solving similar network flow problems. This approach is particularly useful for Monte Carlo power system resource adequacy models.

Gordon, Stephen↗

Comprehensive, Multi-Source Cyber-Security Events Data Set

This data set represents 58 consecutive days of de-identified event data collected from five sources within Los Alamos National Laboratory’s corporate, internal computer network. The data sources include Windows-based authentication events from both individual computers and centralized Active Directory domain controller servers; process start and stop events from individual Windows computers; Domain Name Service (DNS) lookups as collected on internal DNS servers; network flow data as collected on at several key router locations; and a set of well-defined red teaming events that present bad behavior within the 58 days. In total, the data set is approximately 12 gigabytes compressed across the five data elements and presents 1,648,275,307 events in total for 12,425 users, 17,684 computers, and 62,974 processes. Specific users that are well known system related (SYSTEM, Local Service) were not de-identified though any well-known administrators account were still de-identified. In the network flow data, well-known ports (e.g. 80, 443, etc) were not de-identified. All other users, computers, process, ports, times, and other details were de-identified as a unified set across all the data elements (e.g. U1 is the same U1 in all of the data). The specific timeframe used is not disclosed for security purposes. In addition, no data that allows association outside of LANL’s network is included. All data starts with a time epoch of 1 using a time resolution of 1 second. In the authentication data, failed authentication events are only included for users that had a successful authentication event somewhere within the data set.

97 MATHEMATICS AND COMPUTING↗

Is infrared-collinear safe information all you need for jet classification?

Machine learning-based jet classifiers are able to achieve impressive tagging performance in a variety of applications in high-energy and nuclear physics. However, it remains unclear in many cases which aspects of jets give rise to this discriminating power, and whether jet observables that are tractable in perturbative QCD such as those obeying infrared-collinear (IRC) safety serve as sufficient inputs. In this article, we introduce a new classifier, Jet Flow Networks (JFNs), in an effort to address the question of whether IRC unsafe information provides additional discriminating power in jet classification. JFNs are permutation-invariant neural networks (deep sets) that take as input the kinematic information of reconstructed subjets. The subjet radius and a cut on the subjet’s transverse momenta serve as tunable hyperparameters enabling a controllable sensitivity to soft emissions and nonperturbative effects. We demonstrate the performance of JFNs for quark vs. gluon and Z vs. QCD jet tagging. For small subjet radii and transverse momentum cuts, the performance of JFNs is equivalent to the IRC-unsafe Particle Flow Networks (PFNs), demonstrating that infrared-collinear unsafe information is not necessary to achieve strong discrimination for both cases. As the subjet radius is increased, the performance of the JFNs remains essentially unchanged until physical thresholds that we identify are crossed. For relatively large subjet radii, we show that the JFNs may offer an increased model independence with a modest tradeoff in performance compared to classifiers that use the full particle information of the jet. These results shed new light on how machines learn patterns in high-energy physics data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Towards a Scalable and Reliable Real Time In-Network Data Analysis Infrastructure

The smart grid applications requires real time analysis, response within the order of milliseconds and high-reliability because of the mission critical structure of the power grid system. The only way to satisfy these requirements is in network data analysis and build-in redundancy routing for failures. To achieve this, we propose a data dissemination system that builds routes using network flow algorithms, have in network processing of the data and utilize data encoding to cope with high latencies.

99 GENERAL AND MISCELLANEOUS↗

Functional approach to exploring climatic and landscape controls on runoff generation: 2 Timing of runoff storm response

Abstract Hortonian overland flow, Dunne overland flow, and subsurface stormflow are the three most dominant mechanisms contributing to both the volume and timing of streamflow in headwater catchments. In this paper, guided by the Dunne diagram, we explore the impacts of climate, soil, and topography on estimated probability distributions of the travel times of each of these three runoff components. In each case, these are expressed in terms of the Connected Instantaneous Response Functions (CIRF) and account for the dynamics of their individual partial effective contributing areas that retain the connectivity to the outlet (instead of the whole catchment area). A spatially distributed hydrological model is used to derive the CIRFs numerically under multiple combinations of climate, soil, and topographic properties. The mean travel times and dimensionless forms of the CIRFs (i.e., scaled by their respective mean travel times) are used to examine both advective and dispersive aspects of catchment's runoff routing response. It is found that the CIRFs, upon nondimensionalization, collapsed to common characteristic shapes, which could be explained in terms of the relative contributions of hillslope and channel network flows, and the size of runoff contributing areas. The contributing areas, particularly for the Dunne overland flow, are themselves found to be governed by the competition between drainage of and recharge to the water table, and could be explained by a dimensionless drainage index which quantifies this competition. The study also reveals simple indicators based on landscape properties that can explain the magnitude of travel times in different catchments.

Li, Hong‐Yi↗

Communication-efficient Distributed Solutions to a System of Linear Equations with Laplacian Sparse Structure

Two communication-efficient distributed algorithms are proposed to solve a system of linear equations Ax = b with Laplacian sparse A. A system of linear equations with Laplacian sparse A can be found in many applications, e.g., the power flow problems and other network flow problems. The first algorithm is based on the gradient descent method in optimization and the agents only share two parts of the system state instead of that of the whole system state, which saves significant communication. The two parts shared by every agent through a communication link are the state information of its own and its neighbors connected by the communication link. The second method is obtained from an approximation of the Newton method, which converges faster. It requires twice as much communication as the first one but is still communicationefficient due to the low dimension of each part shared between agents. The convergence at a linear rate of both methods is proved. A comprehensive comparison of the convergence rate, communication burden, and computation costs between the methods is made. Finally, a simulation is conducted to show the effectiveness of both methods.

Wang, Peng↗

Exact Convex Relaxation of Optimal Power Flow in Radial Networks

The optimal power flow (OPF) problem determines a network operating point that minimizes a certain objective such as generation cost or power loss. It is nonconvex. We prove that a global optimum of OPF can be obtained by solving a second-order cone program, under a mild condition after shrinking the OPF feasible set slightly, for radial power networks. The condition can be checked a priori, and holds for the IEEE 13, 34, 37, 123-bus networks and two real-world networks.

Gan, LW↗

Netostat: analyzing dynamic flow patterns in high-speed networks

Understanding flow traffic patterns in networks, such as the Internet or service provider networks, is crucial to improving their design and building them robustly. However, as networks grow and become more complex, it is increasingly cumbersome and challenging to study how the many flow patterns, sizes and the continually changing source-destination pairs in the network evolve with time. Here, we present Netostat, a visualization-based network analysis tool that uses visual representation and a mathematics framework to study and capture flow patterns, using graph theoretical methods such as clustering, similarity and difference measures. Netostat generates an interactive graph of all traffic patterns in the network, to isolate key elements that can provide insights for traffic engineering. We present results for U.S. and European research networks, ESnet and GEANT, demonstrating network state changes, to identify major flow trends, potential points of failure, and bottlenecks.

97 MATHEMATICS AND COMPUTING↗

Interface Control Document for the EMPACT Module that Estimates Electric Power Transmission System Response to EMP-Caused Damage

The EPREP code is designed to evaluate the effects of an Electro-Magnetic Pulse (EMP) on the electric power transmission system. The EPREP code embodies an umbrella framework that allows a user to set up analysis conditions and to examine analysis results. The code links to three major physics/engineering modules. The first module describes the EM wave in space and time. The second module evaluates the damage caused by the wave on specific electric power (EP) transmission system components. The third module evaluates the consequence of the damaged network on its (reduced) ability to provide electric power to meet demand. This third module is the focus of the present paper. The EMPACT code serves as the third module. The EMPACT name denotes EMP effects on Alternating Current Transmission systems. The EMPACT algorithms compute electric power transmission network flow solutions under severely damaged network conditions. Initial solutions are often characterized by unacceptible network conditions including line overloads and bad voltages. The EMPACT code contains algorithms to adjust optimally network parameters to eliminate network problems while minimizing outages. System adjustments include automatically adjusting control equipment (generator V control, variable transformers, and variable shunts), as well as non-automatic control of generator power settings and minimal load shedding. The goal is to evaluate the minimal loss of customer load under equilibrium (steady-state) conditions during peak demand.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Planning of distributed data production for High Energy and Nuclear Physics

Modern experiments in High Energy and Nuclear Physics heavily rely on distributed computations using multiple computational facilities across the world. One of the essential types of the computations is a distributed data production where petabytes of raw files from a single source has to be processed once (per production campaign) using thousands of CPUs at distant locations and the output has to be transferred back to that source. The data distribution over a large system does not necessary match the distribution of storage, network and CPU capacity. Therefore, bottlenecks may appear and lead to increased latency and degraded performance. In this paper we propose a new scheduling approach for distributed data production which is based on the network flow maximization model. In our approach a central planner defines how much input and output data should be transferred over each network link in order to maximize the computational throughput. Such plans are created periodically for a fixed planning time interval using up-to-date information on network, storage and CPU resources. The centrally created plans are executed in a distributed manner by dedicated services running at participating sites. In conclusion, our simulations based on the log records from the data production framework of the experiment STAR (Solenoid Tracker at RHIC) have shown that the proposed model systematically provides a better performance compared to the simulated traditional techniques.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗