Search NASA⌕ Search

Engineering topics

Hagberg, Aric Arild

Publications and source records attributed to Hagberg, Aric Arild.

Implications of new Reasoning Capabilities for Science and Security: Results from a Quick Initial Study

On Thursday, September 12 OpenAI released “a new series of models designed to spend more time thinking… they can reason through complex tasks and solve harder problems than previous models in science, coding, and math.” These models are referred to as o1-preview and o1-mini and appear to be first results of what had been a closely held project called Strawberry within OpenAI. The models are not described as successors in the earlier GPT series because they provide a qualitatively different type of capability, especially step-by-step reasoning.

97 MATHEMATICS AND COMPUTING↗

ASCR Reverse Site Visit [Slides]

We are dedicated to addressing complex national security issues and the world’s most difficult challenges.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Artificial Intelligence Strategy and Implementation [Slides]

LANL strategic activities for AI center on this goal: accelerate development of AI-enabled capabilities for science and security, with focus on developing and applying mission-relevant core AI technologies, creating an AI workforce pipeline and training opportunities, and building AI partnerships and community.

42 ENGINEERING↗

IS&T Computing Overview

This presentation gives an overview of events and studies within the Information, Science, and Technology Computing group at the Los Alamos National Laboratory.

97 MATHEMATICS AND COMPUTING↗

Linking structural and transport properties in three-dimensional fracture networks

Here, we investigate large scale particle motion and solute breakthrough in sparse three-dimensional discrete fracture networks (DFN) characterized by power-law distributed fracture lengths. The three networks we consider have the same fracture intensity values but exhibit different percolation densities, geometric properties and topological structures. We considered two different average transport models to predict solute breakthrough, a streamtube model and a Bernoulli CTRW model, both of which provide insights into the flow fields within the networks. The streamtube model provides acceptable predictions at short distances in two of the networks, but fails in all cases to predict breakthrough times at the outlet plane, which indicates that particle motion in such fracture networks cannot be characterized by a constant velocity between the inlet and control plane at which the breakthrough curve is detected. Rather the structure of the network requires that frequent velocity transitions be made as particles move through the system. Despite the relatively broad distribution of fracture radii and relatively small number of independent velocity transitions, the CTRW approach conditioned on the initial velocity distribution provides reasonable predictions for the breakthrough curves at different distances from the inlet. The application of these averaged transport models provides a richer understanding of the link from the fracture network structure to ow and transport properties.

58 GEOSCIENCES↗

Identifying Backbones in Three-Dimensional Discrete Fracture Networks: A Bipartite Graph-Based Approach

In this paper, we present a graph-based method to identify primary flow and transport sub-networks in three-dimensional discrete fracture networks (DFNs). The structure of a DFN lends itself to the use of graphs as a coarse-scale representation that retains the multiscale nature of flow and transport through fracture media. We develop a bipartite graph representation that integrates fracture network topology, fracture geometry, and hydraulic properties. We show that the two most common graph-representations of DFNs, vertices representing intersections and vertices representing fractures, are projections of this bipartite graph thereby providing a generalization of previous DFN-graph frameworks. The primary subnetworks in each DFN are identified by running a heuristic algorithm that determines the edge-disjoint shortest paths through the graph which correspond to the regions where the fastest transport occurs. The method does not have any user-defined parameters and terminates in a finite number of steps. The quality of the method is demonstrated by comparing transport simulations on the identified primary subnetwork and full network, which are in good agreement for early and middle times. In conclusion, these estimates of the first passage times can be achieved with close to an order of magnitude reduction of computational expense using the proposed method.

58 GEOSCIENCES↗

Advancing graph-based algorithms for predicting flow and transport in fractured rock

Discrete fracture network (DFN) models are a powerful alternative to continuum models for subsurface flow and transport simulations because they explicitly include fracture geometry and network topology, thereby allowing for better characterization of the latter's influence on flow and transport through fractured media. Recent advances in high performance computing have opened the door for flow and transport simulations in large explicit three-dimensional DFN, but this increase in model fidelity and system size comes at a huge computational cost because of the large number of mesh elements required to represent thousands of fractures (with sizes that can range several orders of magnitude, from mm to km). In most subsurface applications, fracture characteristics are only known statistically and numerous realizations are needed to bound uncertainty in flow and transport in the system, thereby exacerbating the computational burden. blackGraphs provide a simple and elegant way to characterize, query, and interrogate fracture network connectivity. We propose a DFN model reduction framework where various graph-representations are used in conjunction with high-fidelity DFN simulations to increase computational efficiency while retaining accuracy of key quantities of interest. The appropriate choice of a graph-representation, namely, which attributes of the DFN are to be represented as nodes and which ones as edges connecting those nodes, depends on the relevant scientific questions. We demonstrate that the proposed DFN model reduction framework provides an efficient means for DFN modeling through both system reduction of the DFN using graph-based properties and combining DFN and graph-based flow and transport simulations.

58 GEOSCIENCES↗

Predictions of first passage times in sparse discrete fracture networks using graph-based reductions

Here, we present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We also derive graph representations of generic three-dimensional discrete fracture networks (DFNs) using the DFN topology and flow boundary conditions. Subgraphs corresponding to the union of the k shortest paths between the inflow and outflow boundaries are identified and transport on their equivalent subnetworks is compared to transport through the full network. The number of paths included in the subgraphs is based on the scaling behavior of the number of edges in the graph with the number of shortest paths. First passage times through the subnetworks are in good agreement with those obtained in the full network, both for individual realizations and in distribution. We obtain accurate estimates of first passage times with an order of magnitude reduction of CPU time and mesh size using the proposed method.

54 ENVIRONMENTAL SCIENCES↗