Engineering topics

Restrepo, Juan M.

Publications and source records attributed to Restrepo, Juan M..

6 records

DOE OSTI2023

A Review of Recent and Emerging Machine Learning Applications for Climate Variability and Weather Phenomena

Abstract Climate variability and weather phenomena can cause extremes and pose significant risk to society and ecosystems, making continued advances in our physical understanding of such events of utmost importance for regional and global security. Advances in machine learning (ML) have been leveraged for applications in climate variability and weather, empowering scientists to approach questions using big data in new ways. Growing interest across the scientific community in these areas has motivated coordination between the physical and computer science disciplines to further advance the state of the science and tackle pressing challenges. During a recently held workshop that had participants across academia, private industry, and research laboratories, it became clear that a comprehensive review of recent and emerging ML applications for climate variability and weather phenomena that can cause extremes was needed. This article aims to fulfill this need by discussing recent advances, challenges, and research priorities in the following topics: sources of predictability for modes of climate variability, feature detection, extreme weather and climate prediction and precursors, observation–model integration, downscaling, and bias correction. This article provides a review for domain scientists seeking to incorporate ML into their research. It also provides a review for those with some ML experience seeking to broaden their knowledge of ML applications for climate variability and weather.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2022

An improved framework for the dynamic likelihood filtering approach to data assimilation

Here, we propose improvements to the Dynamic Likelihood Filter (DLF), a Bayesian data assimilation filtering approach, specifically tailored to wave problems. The DLF approach was developed to address the common challenge in the application of data assimilation to hyperbolic problems in the geosciences and in engineering, where observation systems are sparse in space and time. When these observations have low uncertainties, as compared to model uncertainties, the DLF exploits the inherent nature of information and uncertainties to propagate along characteristics to produce estimates that are phase aware as well as amplitude aware, as would be the case in the traditional data assimilation approach. Along characteristics, the stochastic partial differential equations underlying the linear or nonlinear stochastic dynamics are differential equations. This study focuses on developing the explicit challenges of relating dynamics and uncertainties in the Eulerian and Lagrangian frames via dynamic Gaussian processes. It also implements the approach using the ensemble Kalman filter (EnKF) and compares the DLF approach to the conventional one with respect to wave amplitude and phase estimates in linear and nonlinear wave problems. Numerical comparisons show that the DLF/EnKF outperforms the EnKF estimates, when applied to linear and nonlinear wave problems. This advantage is particularly noticeable when sparse, low uncertainty observations are used.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Variable resolution Poisson-disk sampling for meshing discrete fracture networks

Here, we present the near-Maximal Algorithm for Poisson-disk Sampling (nMAPS) to generate point distributions for variable resolution Delaunay triangular and tetrahedral meshes in two and three-dimensions, respectively. nMAPS consists of two principal stages. In the first stage, an initial point distribution is produced using a cell-based rejection algorithm. In the second stage, holes in the sample are detected using an efficient background grid and filled in to obtain a near-maximal covering. Extensive testing shows that nMAPS generates a variable resolution mesh in linear run time with the number of accepted points. We demonstrate nMAPS capabilities by meshing three-dimensional discrete fracture networks (DFN) and the surrounding volume. The discretized boundaries of the fractures, which are represented as planar polygons, are used as the seed of 2D-nMAPS to produce a conforming Delaunay triangulation. The combined mesh of the DFN is used as the seed for 3D-nMAPS, which produces conforming Delaunay tetrahedra surrounding the network. Under a set of conditions that naturally arise in maximal Poisson-disk samples and are satisfied by nMAPS, the two-dimensional Delaunay triangulations are guaranteed to only have well-behaved triangular faces. While nMAPS does not provide triangulation quality bounds in more than two dimensions, we found that low-quality tetrahedra in 3D are infrequent, can be readily detected and removed, and a high-quality balanced mesh is produced.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

The impact of entrained air on ocean waves

We make a physical–mathematical analysis of the implications that the presence of a large number of tiny bubbles may have, when present, on the thin upper layer of the sea. In our oceanographic example, the bubbles are due to intense rain. It was found that the bubbles increase momentum dissipation in the near surface and affect the surface tension force. For short waves, the implications of increased vorticity are momentum exchanges between wave and mean flow and modifications to the wave dispersion relation. For the direct effect we have analyzed, the implications are estimated to be non-significant when compared to other processes of the ocean. However, we hint at the possibility that our analysis may be useful in other areas of research or practical application.

58 GEOSCIENCES↗

DOE OSTI2021

Gradient sensing via cell communication

Experimental evidence lends support to the conjecture that cell-to-cell communication plays a role in the gradient sensing of chemical species by certain chains of cells. Models have been formulated to explore this idea. For cells with no identifiable sensing structure, Mugler et al. [Proc. Natl. Acad. Sci. (U.S.A.) 113, E689 (2016)] have defined a particular local excitation, global inhibition (LEGI) model that pits nearest-neighbor communication against local reactions in a noisy environment to suggest how this sensing capability might arise in a physical system. In this study, we generalize the nearest-neighbor communication mechanism in the aforementioned LEGI model in order to explore the extent to which the gradient sensing characteristics depend on the parametrization of the communication itself, as well as on the cell size, the radius of influence of neighboring cells, and the influence of the background noise. Using our generalization and a collection of particular candidate communication models, we find that the precision of gradient sensing is indeed sensitive to the particular communication model, and we derive physical and analytic explanations for these results. The framework established and the associated results should prove useful in understanding the appropriateness of particular cell-to-cell communication models in gradient sensing studies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗