Comparison of lattice Boltzmann method and pore-network modeling of CO2 and brine flow in Mount Simon Sandstone
Presented by NETL at 2016 Fall AGU Meeting; 12/16
SEARCH · Search NASA
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.
Presented by NETL at 2016 Fall AGU Meeting; 12/16
One of the major challenges of simulating flow and transport in the far field of a geologic repository in crystalline host rock is related to reproducing the properties of the fracture network over the large volume of rock with sparse fracture characterization data. Various approaches have been developed to simulate flow and transport through the fractured rock. The approaches can be broadly divided into Discrete Fracture Network (DFN) and Equivalent Continuum Model (ECM). The DFN explicitly represents individual fractures, while the ECM uses fracture properties to determine equivalent continuum parameters. In this paper, we compare DFN and ECM in terms of upscaled observed transport properties through generic fracture networks. The major effort was directed on making the DFN and ECM approaches similar in their conceptual representations. This allows for separating differences related to the interpretation of the test conditions and parameters from the differences between the DFN and ECM approaches. The two models are compared using a benchmark test problem that is constructed to represent the far field (1 × 1 × 1 km 3 ) of a hypothetical repository in fractured crystalline rock. The test problem setting uses generic fracture properties that can be expected in crystalline rocks. The models are compared in terms of the: 1) effective permeability of the domain, and 2) nonreactive solute breakthrough curves through the domain. The principal differences between the models are mesh size, network connectivity, matrix diffusion and anisotropy. We demonstrate how these differences affect the flow and transport. Finally, we identify the factors that should be taken in consideration when selecting an approach most suitable for the site-specific conditions.
Presented by NETL at 8th International Conference on Porous Media; InterPore2016; 5/2016
We present a mathematical formulation of a multiscale model for solidification with convective flow in the liquid phase. The model is an extension of the dendritic needle network approach for crystal growth in a binary alloy. We propose a simple numerical implementation based on finite differences and step-wise approximations of parabolic dendritic branches of arbitrary orientation. Results of the two-dimensional model are verified against reference benchmark solutions for steady, unsteady, and buoyant flow, as well as steady-state dendritic growth in the diffusive regime. Simulations of equiaxed growth under forced flow yield dendrite tip velocities within 10% of quantitative phase-field results from the literature. Finally, we perform illustrative simulations of polycrystalline solidification using physical parameters for an aluminum-10wt% copper alloy. Resulting microstructures show notable differences when taking into account natural buoyancy in comparison to a purely diffusive transport regime. The resulting model opens new avenues for computationally and quantitatively investigating the influence of fluid flow and gravity-induced buoyancy upon the selection of dendritic microstructures. Further ongoing developments include an equivalent formulation for directional solidification conditions and the implementation of the model in three dimensions, which is critical for quantitative comparison to experimental measurements.
This Concept Definition Study focused on developing a scientific understanding of methods to reduce energy consumption in data networks using rate adaptation. Rate adaptation is a collection of techniques that reduce energy consumption when traffic is light, and only require full energy when traffic is at full provisioned capacity. Rate adaptation is a very promising technique for saving energy: modern data networks are typically operated at average rates well below capacity, but network equipment has not yet been designed to incorporate rate adaptation. The Study concerns packet-switching equipment, routers and switches; such equipment forms the backbone of the modern Internet. The focus of the study is on algorithms and protocols that can be implemented in software or firmware to exploit hardware power-control mechanisms. Hardware power-control mechanisms are widely used in the computer industry, and are beginning to be available for networking equipment as well. Network equipment has different performance requirements than computer equipment because of the very fast rate of packet arrival; hence novel power-control algorithms are required for networking. This study resulted in five published papers, one internal report, and two patent applications, documented below. The specific technical accomplishments are the following: • A model for the power consumption of switching equipment used in service-provider telecommunication networks as a function of operating state, and measured power-consumption values for typical current equipment. • An algorithm for use in a router that adapts packet processing rate and hence power consumption to traffic load while maintaining performance guarantees on delay and throughput. • An algorithm that performs network-wide traffic routing with the objective of minimizing energy consumption, assuming that routers have less-than-ideal rate adaptivity. • An estimate of the potential energy savings in service-provider networks using feasibly-implementable rate adaptivity. • A buffer-management algorithm that is designed to reduce the size of router buffers, and hence energy consumed. • A packet-scheduling algorithm designed to minimize packet-processing energy requirements. Additional research is recommended in at least two areas: further exploration of rate-adaptation in network switching equipment, including incorporation of rate-adaptation in actual hardware, allowing experimentation in operational networks; and development of control protocols that allow parts of networks to be shut down while minimizing disruption to traffic flow in the network. The research is an integral part of a large effort within Bell Laboratories, Alcatel-Lucent, aimed at dramatic improvements in the energy efficiency of telecommunication networks. This Study did not explicitly consider any commercialization opportunities.
Here we examine the modeling, simulation, and optimization of district heating systems, which are widely used for thermal transport using steam or hot water as a carrier. We propose a generalizable framework to specify network models and scenario parameters, and develop an optimization method for evaluating system states including pressures, fluid flowrates, and temperatures throughout the network. The network modeling includes pipes, thermal plants, pumps, and passive or controllable loads as system components. We propose basic models for thermodynamic fluid transport and enforce the balance of physical quantities in steady-state flow over co-located outgoing and return networks. We formulate an optimization problem with steam and hot water as the outgoing and return carriers, as in legacy twentieth century systems. The physical laws and engineering limitations are specified for each component type, and the thermal network flow optimization problem is formulated and solved for a realistic test network under several scenarios.
The classical max-flow min-cut theorem describes transport through certain idealized classical networks. We consider the quantum analog for tensor networks. By associating an integral capacity to each edge and a tensor to each vertex in a flow network, we can also interpret it as a tensor network and, more specifically, as a linear map from the input space to the output space. The quantum max-flow is defined to be the maximal rank of this linear map over all choices of tensors. The quantum min-cut is defined to be the minimum product of the capacities of edges over all cuts of the tensor network. We show that unlike the classical case, the quantum max-flow=min-cut conjecture is not true in general. Under certain conditions, e.g., when the capacity on each edge is some power of a fixed integer, the quantum max-flow is proved to equal the quantum min-cut. However, concrete examples are also provided where the equality does not hold. We also found connections of quantum max-flow/min-cut with entropy of entanglement and the quantum satisfiability problem. We speculate that the phenomena revealed may be of interest both in spin systems in condensed matter and in quantum gravity.
Thermal engineers often create custom heat maps to analyze their thermal model. However, generating a heat map is difficult because thermal simulation only readily provide attributes of simulated nodes such as temperature, capacitance, heat generation, and a network of conductances. Heat flow values are a derived quantity from the nodal attributes, and the data processing and management of heat flow between nodes quickly become difficult for large models. Deriving a network of heat flow values requires vast amount of calculations and data handling, heat map generation process generally suffers from processing speed, loss of accuracy, and/or presentation of data in a useful format. Heat Analysis Manager (HAM) is a Thermal Desktop (TD) based free multi-purpose tool developed to aid thermal engineers in analyzing their thermal model, including a heat map generation functionality. HAM’s heat map generator retains accuracy and fast processing speed by utilizing TD’s application programming interface (API) and built-in TD’s “Qflow from Results.” Furthermore, HAM’s heat map output is presented in an easily customizable format in Excel, allowing users to create various custom visual heat maps. A full description of how HAM utilizes TD’s API to create a customizable heat map is provided. A simple model demonstration is included along with step-by-step procedures on creating custom heat maps. HAM’s heat map result has been verified against TD’s and other heat map generation software, and verification methods are also included.
Not provided.
The advent of affordable computing, low-cost sensor hardware, and high-speed and reliable communications have spurred installation of ubiquitous sensors in complex engineered systems. However, ensuring reliable data quality remains a challenge. Exploitation of redundancy among sensor signals can help improving the precision of measured variables, detecting the presence of gross errors, and identifying faulty sensors. The cost of sensor ownership, maintenance efforts in particular, can still be cost-prohibitive however. Maximizing the ability to assess and control data quality while minimizing the cost of ownership thus requires a careful sensor placement. To solve this challenge, in this work we develop a generally applicable method to solve the multi-objective sensor placement problem in systems governed by linear and bilinear balance equations. Importantly, the method computes all Pareto-optimal sensor layouts with conventional computational resources and requires no information about the expected sensor quality.
Not Available
In this study, the sedimentologic and tectonic histories of clastic cap rocks and their inherent mechanical properties control the nature of permeable fractures within them. The migration of fluid through mm- to cm-scale fracture networks can result in focused fluid flow allowing hydrocarbon production from unconventional reservoirs or compromising the seal integrity of fluid traps. To understand the nature and distribution of subsurface fluid-flow pathways through fracture networks in cap-rock seals we examine four exhumed Paleozoic and Mesozoic seal analogs in Utah. We combine these outcrop analyses with subsidence analysis, paleoloading histories, and rock-strength testing data in modified Mohr–Coulomb–Griffith analyses to evaluate the effects of differential stress and rock type on fracture mode.
This dataset represents a compilation of two global and three USA-specific datasets of dam locations and their attributes. The major hurdle toward developing this compilation was the identification of duplicates within the source datasets, especially given the variable precision of dam location coordinates. The most immediately-useful product in this dataset is a spreadsheet (VotE-Dams_v1.csv) that documents the unique dams found across the datasets, their coordinates, and their ids within the respective source datasets. We do not reproduce the source datasets (GRaND, GOODD, GeoDAR, NID, and EHA) here, but their download locations are provided in the README files ('Overview' tab). Some of the source datasets are provided as shapefiles, which require geospatial data software to open (e.g. QGIS/ArcGIS for graphical display, geopandas for Python, rgdal for R, many others freely available). The provided README documents metadata of the source datasets and provides attribute-linking information (i.e. matches attributes among various source datasets that contain the same, or similar, information but have different names). Note that the README is provided as both .xslx and a collection of .csvs (one per tab in the .xslx file). We suggest using the .xlsx version that preserves images, formatting, and sheets. .xlsx files can be viewed using (free) Google Docs or Microsoft Excel.Finally, we provide Technical Documentation.pdf that describes the procedures used to identify unique and duplicate dams.The title of this dataset refers to our 'Veins of the Earth' (VotE) project, which seeks to provide a flexible, scale-free representation of the Earth's river networks. Dams are a critical component of VotE as they heavily influence flows throughout river networks.
Not provided.
Node controllers and power distribution networks in accordance with embodiments of the invention enable distributed power control on an unbalanced network. One embodiment includes a node controller including a distributed power control application; a plurality of node operating parameters describing the operating parameter of a node in an unbalanced network; wherein the processor is configured by the distributed power control application to: send node operating parameters to nodes in the set of at least one node; receive operating parameters from the nodes in the set of at least one node; calculate a plurality of updated node operating parameters using an iterative process to determine updated node operating parameters using the node operating parameters that describe the operating parameters of the node, and the operating parameters of the set of at least one node, where each iteration in the iterative process involves evaluation of a subproblem; and adjust node operating parameters.
Orientation and completion for well pairs that have been subjected to multi-zonal stimulation play a critical role in the long-term performance of an Enhanced Geothermal Reservoir. Enhanced geothermal systems often rely on preferential flow along fractures between well injection and production locations. Modeling this preferential flow using discrete fracture networks (DNF) relies on stochastic realizations of the DFN based on geological sampling. Here we present the development of a stochastic optimization methodology to determine well completion options in a discrete fracture network based on using parallel subset simulation. Stochastic optimization will provide insight into regions where placements of the injection and production wells are optimal. An example optimization of well-pair location optimization based on a deterministic-stochastic DFN model representing FORGE follows a discussion of the theory.