M. Park, M. V. Tretyakov
We consider one-dimensional and two-dimensional models of the stochastic resin transfer molding process, which are formulated as random moving boundary problems. We study their properties, analytically in the one-dimensional case and numerically in the two-dimensional case. We show how variability of time to fill depends on correlation lengths and smoothness of a random permeability field.
M. Park
In general, Graph Neural Networks(GNN) have been using a message passing method to aggregate and summarize information about neighbors to express their information. Nonetheless, previous studies have shown that the performance of graph neural networks becomes vulnerable when there are abnormal nodes in the neighborhood due to this message passing method. In this paper, inspired by the Neural Architecture Search method, we present an algorithm that recognizes abnormal nodes and automatically excludes them from information aggregation. Experiments on various real worlds datasets show that our proposed Neural Architecture Search-based Anomaly Resistance Graph Neural Network (NASAR-GNN) is actually effective.
M. Park, M. V. Tretyakov
We propose a new method for sampling from stationary Gaussian random field on a grid which is not regular but has a regular block structure which is often the case in applications. The introduced block circulant embedding method (BCEM) can outperform the classical circulant embedding method (CEM) which requires a regularization of the irregular grid before its application. Comparison of BCEM vs CEM is performed on some typical model problems.