 Publication Date:
 NSFPAR ID:
 10331438
 Journal Name:
 Symmetry
 Volume:
 13
 Issue:
 11
 Page Range or eLocationID:
 2157
 ISSN:
 20738994
 Sponsoring Org:
 National Science Foundation
More Like this

Inundation mapping is a critical task for damage assessment, emergency management, and prioritizing relief efforts during a flooding event. Remote sensing has been an effective tool for interpreting and analyzing water bodies and detecting floods over the past decades. In recent years, deep learning algorithms such as convolutional neural networks (CNNs) have demonstrated promising performance for remote sensing image classification for many applications, including inundation mapping. Unlike conventional algorithms, deep learning can learn features automatically from large datasets. This research aims to compare and investigate the performance of two stateoftheart methods for 3D inundation mapping: a deep learningbased image analysis and a Geomorphic Flood Index (GFI). The first method, deep learning image analysis involves three steps: 1) image classification to delineate flood boundaries, 2) integrate the flood boundaries and topography data to create a threedimensional (3D) water surface, and 3) compare the 3D water surface with preflood topography to estimate floodwater depth. The second method, i.e., GFI, involves three phases: 1) calculate a river basin morphological information, such as river height (hr) and elevation difference (H), 2) calibrate and measure GFI to delineate flood boundaries, and 3) calculate the coefficient parameter ( α ), and correct the value of hrmore »

The Sylvester equation offers a powerful and unifying primitive for a variety of important graph mining tasks, including network alignment, graph kernel, node similarity, subgraph matching, etc. A major bottleneck of Sylvester equation lies in its high computational complexity. Despite tremendous effort, stateoftheart methods still require a complexity that is at least \em quadratic in the number of nodes of graphs, even with approximations. In this paper, we propose a family of Krylov subspace based algorithms (\fasten) to speed up and scale up the computation of Sylvester equation for graph mining. The key idea of the proposed methods is to project the original equivalent linear system onto a Kronecker Krylov subspace. We further exploit (1) the implicit representation of the solution matrix as well as the associated computation, and (2) the decomposition of the original Sylvester equation into a set of intercorrelated Sylvester equations of smaller size. The proposed algorithms bear two distinctive features. First, they provide the \em exact solutions without any approximation error. Second, they significantly reduce the time and space complexity for solving Sylvester equation, with two of the proposed algorithms having a \em linear complexity in both time and space. Experimental evaluations on a diverse setmore »

In many mechanistic medical, biological, physical, and engineered spatiotemporal dynamic models the numerical solution of partial differential equations (PDEs), especially for diffusion, fluid flow and mechanical relaxation, can make simulations impractically slow. Biological models of tissues and organs often require the simultaneous calculation of the spatial variation of concentration of dozens of diffusing chemical species. One clinical example where rapid calculation of a diffusing field is of use is the estimation of oxygen gradients in the retina, based on imaging of the retinal vasculature, to guide surgical interventions in diabetic retinopathy. Furthermore, the ability to predict blood perfusion and oxygenation may one day guide clinical interventions in diverse settings, i.e., from stent placement in treating heart disease to BOLD fMRI interpretation in evaluating cognitive function (Xie et al., 2019 ; Lee et al., 2020 ). Since the quasisteadystate solutions required for fastdiffusing chemical species like oxygen are particularly computationally costly, we consider the use of a neural network to provide an approximate solution to the steadystate diffusion equation. Machine learning surrogates, neural networks trained to provide approximate solutions to such complicated numerical problems, can often provide speedups of several orders of magnitude compared to direct calculation. Surrogates of PDEs couldmore »

ABSTRACT We investigate rprocess nucleosynthesis and kilonova emission resulting from binary neutron star (BNS) mergers based on a threedimensional (3D) generalrelativistic magnetohydrodynamic (GRMHD) simulation of a hypermassive neutron star (HMNS) remnant. The simulation includes a microphysical finitetemperature equation of state (EOS) and neutrino emission and absorption effects via a leakage scheme. We track the thermodynamic properties of the ejecta using Lagrangian tracer particles and determine its composition using the nuclear reaction network SkyNet. We investigate the impact of neutrinos on the nucleosynthetic yields by varying the neutrino luminosities during postprocessing. The ejecta show a broad distribution with respect to their electron fraction Ye, peaking between ∼0.25–0.4 depending on the neutrino luminosity employed. We find that the resulting rprocess abundance patterns differ from solar, with no significant production of material beyond the second rprocess peak when using luminosities recorded by the tracer particles. We also map the HMNS outflows to the radiation hydrodynamics code SNEC and predict the evolution of the bolometric luminosity as well as broadband light curves of the kilonova. The bolometric light curve peaks on the timescale of a day and the brightest emission is seen in the infrared bands. This is the first direct calculation of the rprocessmore »

A novel green granular neural network (GGNN) with new fast softwareFPGA codesigned learning is developed to reduce both CO2 emissions and energy consumption more effectively than popular neural networks with the traditional softwareCPUGPUbased learning. Different from traditional tedious CPUGPUbased training algorithms using gradient descent methods and other methods such as genetic algorithms , the softwareFPGA codesigned training algorithm may quickly solve a system of linear equations to directly calculate optimal values of hyperparameters of the GGNN. Initial simulation results indicates that the FPGA equation solver code ran faster than the Python equation solver code. Therefore, implementing the GGNN with softwareFPGA codesigned learning is feasible. In addition, the shallow highspeed GGNN is explainable because it can generate interpretable granular IfThen rules. In the future, The GGNN will be evaluated by comparing with other machine learning models with traditional softwarebased learning in terms of speeds, model sizes, accuracy, CO2 emissions and energy consumption by using popular datasets. New algorithms will be created to divide the inputs to different input groups that will be used to build different smallsize GGNNs to solve the curse of dimensionality. Additionally, the explainable green granular convolutional neural network will be developed by using the GGNNs as basicmore »