## 2021 POSTECH MINDS WORKSHOP

Recent Progress in Data Science and Applications

Hilton Gyeongju, Nov. 19 (Fri) ~ Nov. 20 (Sat), 2021

Organizers : Keunsu Kim, Eunsuh Kim, Sungwoong Cho (POSTECH)

You can check the notices about this workshop in **English** at the bottom of the page as well.

## 1. 일정 및 장소

2021년 11월 19일(금) – 2021년 11월 20일(토), 1박 2일

힐튼 경주, 경상북도 경주시 보문로 484-7

## 2. 개요

MINDS 연구소에 있는 교수님과 학생들이 위주가 되어 서로 연구 내용을 소개 및 발표

## 3. 지원

여행경비, 숙박, 식사

## 4. 신청 방법 :**11****월 2일(화)**까지

**11**

**월 2일(화)**까지

https://bit.ly/31cV6Jm 로 접속 후 Google Form 작성

대학원생 분들은 1인당 20분정도의 간단한 발표 세션을 구상 중입니다.

발표 세션 지원은 11월 2일까지 참가신청하신 분들에 한해,

**11월 12일(금)까지 Organizer에게 연락**해주시면 세션 구성에 반영하도록 하겠습니다.

Organizer E-mail

## 1. Date & Venue

November, 19th, 2021 ~ November, 20, 2021 (1 Night 2 Days)

Hilton Gyeongju, 484-7 Bomun-ro, Gyeongju-si, Gyeongsangbuk-do

## 2. Workshop Theme

Sharing research ideas and Social Networking in MINDS

## 3. Financial Support

Travel, accommodation, and meal

## 4. Registration

For registration, fill out the Google Form

by Nov. 12 (Tue).

We are planning the presentation sessions that consist of roughly 20-minute short presentations of each graduate student.

Participant can ask the presentation also either by checking "yes" in the registration form for the presentation option or by contacting one of the organizers.

Contact: Organizers

## ☑ 세부 일정표(Specific Schedules)

셔틀버스 탑승하시는 참가자 분들께서는 11월 19일 **오후 12시15분경**까지 **대학본관 주차장**에 모여주시기 바랍니다.

(수리과학관에서 모여서 오실 분들은 마인즈 사무실 208호 앞에 모여주시면 김근수 오거나이저와 함께 오셔도 됩니다.)

Participants who use the bus, should come to Math Building until around PM 12:15.

## ☑ 제공 식사 메뉴(Provided Meals)

갈비찜 정식(19일 금요일 저녁), 조식 뷔페 (20일 토요일 저녁), 새싹비빔밥(20일 토요일 점심)

Set Menu of Braised Short Ribs (19th dinner), Breakfast Buffet (20th breakfast), and Sprout Bibimbap (20th lunch).

## Invitation presentation 1 (Dr. Hyung Ju Hwang )

## Invitation presentation 2 (Dr. Sehun Chun)

Speaker : Dr. Sehun Chun (Yonsei University)

Title: Moving frames for scientific computing and beyond in applications to Meteorology, Cardiology, and Neuroscience.

Abstract: First introduced as orthonormal basis vectors in the numerical solution of PDEs on curved surfaces, moving frame algorithms have been proved competitively accurate and stable for various PDEs, particularly with high-order discretization schemes. The PDEs include conservational laws, diffusion equations, shallow water equations, and Maxwell’s equations. High-order discretization schemes mean continuous/discontinuous Galerkin method or spectral/hp methods. The most striking feature of moving frames is that moving frames simplify the type of medium in PDEs. A simple representation of anisotropy by the adjusted length of the frames in diffusion equations or a general representation of rotation surfaces by moving frames provides significant advantages in numerical algorithms. Beyond the spatial representation of the complex domain, moving frames aligned along with wave propagation yields connection and Riemann curvature tensor to help to identify and predict the flow pattern. One application of such an algorithm is to analyze the cardiac electric flow where a large amount of a specific component of the Riemann curvature tensor implies conduction block and consequently the possibility of reentry and fibrillation. Another application is to construct a numerical algorithm to simulate neural spike propagation along with a spreading neural fiber bundle in the brain’s white matter to reveal the geometric structure of the brain connectivity. The most recent research also applies moving frames to a field of ‘time’ to achieve the spacetime analysis of time-dependent propagation in the heart and brain. All these moving frames applications demonstrate the beautiful simplicity of moving frames in the complex propagation phenomena in complex domains. However, a question still hangs in the air about its restrictions and real-world interpretation of connection and curvature.

## Student presentation 1 (Mr. Keunsu Kim)

Speaker : Keunsu Kim (POSTECH)

Title : Miner for a heart of gold

Abstract : 제가 하고 있는 연구 방향은 크게 두 가지입니다. 1. Time series data(1-parameter data)에 Persistent homology 이론을 적용하여 topological feature를 vectorization 하는 것. 2. Nonnegative Matrix Factorization과 Topological Data Analysis를 결합하는 방법에 대해 간략하게 소개를 하려고 합니다.

시간이 허락한다면 개인홈페이지 (https://sites.google.com/view/keunsukim/)를 바탕으로 저를 소개를 하려고 합니다.

Abstract : My direction of research has two primary reasons. 1. Apply Topological data analysis to Time series data, extract topological feature and convert to vector for using Machine Learning technic. 2. Combine Nonnegative Matrix Factorization and Topological data analysis.

If time permit, I will introduce myself based on my website. (https://sites.google.com/view/keunsukim/)

## Student presentation 2 (Mr. Jeahan Jung)

Speaker : Jeahan Jung (POSTECH)

Title : Bayesian neural networks for quantifying uncertainty in stochastic partial differential equations.

Abstract : Solving stochastic partial differential equations (SPDEs) is a challenging task in uncertainty quantification. We propose a new and novel deep learning method to solve SPDEs using Bayesian neural networks (BNNs). BNNs provide a natural approach to modeling the solutions to SPDEs since BNNs learn the distribution of their parameters so that the output of the BNN follows the target distributions. Our framework is applicable to both forward and inverse problems of SPDEs. Numerical examples are presented to illustrate the efficacy of the proposed method.

## Student presentation 3 (Mr. SungWoong Cho)

Speaker : SungWoong Cho (POSTECH)

Title : Traveling wave solutions of PDEs via neural networks]{Traveling wave solutions of partial differential equations via neural networks

Abstract : We focuses on how to approximate traveling wave solutions for various kinds of partial differential equations via artificial neural networks. A traveling wave solution is hard to obtain with traditional numerical methods when the corresponding wave speed is unknown in advance. We propose a novel method to approximate both the traveling wave solution and the unknown wave speed via a neural network and an additional free parameter. We proved that under a mild assumption, the neural network solution converges to the analytic solution and the free parameter accurately approximates the wave speed as the corresponding loss tends to zero for the Keller--Segel equation. We also demonstrate in the experiments that reducing loss through training assures an accurate approximation of the traveling wave solution and the wave speed for the Keller--Segel equation, the Allen--Cahn model with relaxation, and the Lotka--Volterra competition model.

## Student presentation 4 (Dr. Hwi-Jae Son)

## Student presentation 5 (Mr. Taeyeob Lee)

Speaker : Taeyeob Lee (POSTECH)

Title : Interior jump and regularity for the Naiver-Stokes equations in a nonsmooth domain

Abstract : The elliptic boundary value problems have been studied in smooth domains. However, the general issues in practice are posed in domains which are simple but not smooth. So the study of the problems in nonsmooth domains is essential. We investigate the simplified stationary compressible Navier-Stokes equations in a cut domain, which is a nonsmooth boundary. We prove piecewise regularity by splitting the corner singularity functions at the cut tip and constructing the vector field which lifts the pressure jump value on the streamline.

## Student presentation 6 (Mr. Sijin Yeom)

Speaker : Sijin Yeom (POSTECH)

Title : Robust Random Cut Tree

## Student presentation 7 (Mr. Jae Yong Lee)

Speaker : Jae Yong Lee (POSTECH)

Title : The model reduction of the Vlasov-Poisson-Fokker-Planck system to the Poisson-Nernst-Planck system via the Deep Neural Network Approach

Abstarct : The model reduction of the mesoscopic kinetic dynamics to the macroscopic continuum dynamics has been one of the main questions in the studies of mathematical physics since Hilbert's time in the early 20th century. In this talk, we consider a diagram of diffusion limit from the Vlasov-Poisson-Fokker-Planck (VPFP) system on a bounded interval with the specular reflection boundary condition to the Poisson-Nernst–Planck (PNP) system with the no-flux boundary condition. We provide a Deep Learning algorithm to simulate the VPFP system and the PNP system via computing the time-asymptotic behaviors of the solution and the physical quantities. We analyze the convergence of the neural network solution of the VPFP system to that of the PNP system in the sense of the Asymptotic-Preserving (AP) scheme. Also, we provide theoretical evidence that Deep Neural Network (DNN) solutions to the VPFP and the PNP systems converge to the a priori classical solution of each system if the total loss function vanishes.