Friday, May 5, 2023

<< >>  
2023. 4
Sun Mon Tue Wed Thu Fri Sat
1
2 3 4 5 6 7 8
9 10 11 12 13 14 15
16 17 18 19 20 21 22
23 24 25 26 27 28 29
30
2023. 5
Sun Mon Tue Wed Thu Fri Sat
1 2 3 4 5 6
7 8 9 10 11 12 13
14 15 16 17 18 19 20
21 22 23 24 25 26 27
28 29 30 31
2023. 6
Sun Mon Tue Wed Thu Fri Sat
1 2 3
4 5 6 7 8 9 10
11 12 13 14 15 16 17
18 19 20 21 22 23 24
25 26 27 28 29 30
2023-05-12 / 11:00 ~ 12:00
학과 세미나/콜로퀴엄 - 응용 및 계산수학 세미나: 인쇄
by 정재훈(포항공대 (POSTECH) 수학과)
Time-series data analysis is found in various applications that deal with sequential data over the given interval of, e.g. time. In this talk, we discuss time-series data analysis based on topological data analysis (TDA). The commonly used TDA method for time-series data analysis utilizes the embedding techniques such as sliding window embedding. With sliding window embedding the given data points are translated into the point cloud in the embedding space and the method of persistent homology is applied to the obtained point cloud. In this talk, we first show some examples of time-series data analysis with TDA. The first example is from music data for which the dynamic processes in time is summarized by low dimensional representation based on persistence homology. The second is the example of the gravitational wave detection problem and we will discuss how we concatenate the real signal and topological features. Then we will introduce our recent work of exact and fast multi-parameter persistent homology (EMPH) theory. The EMPH method is based on the Fourier transform of the data and the exact persistent barcodes. The EMPH is highly advantageous for time-series data analysis in that its computational complexity is as low as O(N log N) and it provides various topological inferences almost in no time. The presented works are in collaboration with Mai Lan Tran, Chris Bresten and Keunsu Kim.
2023-05-08 / 10:00 ~ 11:00
학과 세미나/콜로퀴엄 - 기타: 인쇄
by ()
We present a framework of predictive modeling of unknown system from measurement data. The method is designed to discover/approximate the unknown evolution operator, i.e., flow map, behind the data. Deep neural network (DNN) is employed to construct such an approximation. Once an accurate DNN model for the evolution operator is constructed, it serves as a predictive model for the unknown system and enables us to conduct system analysis. We demonstrate that flow map learning (FML) approach is applicable for modeling a wide class of problems, including dynamical systems, systems with missing variables and hidden parameters, as well as partial differential equations (PDEs).
2023-05-09 / 15:00 ~ 16:30
SAARC 세미나 - SAARC 세미나: 인쇄
by ()
We obtain uniform in time L^\infty -bounds for the solutions to a class of thermo-diffusive systems. The nonlinearity is assumed to be at most sub-exponentially growing at infinity and have a linear behavior near zero. This is a joint work with Lenya Ryzhik and Jean-Michel Roquejoffre.
2023-05-09 / 16:30 ~ 17:30
IBS-KAIST 세미나 - 이산수학: Separating the edges of a graph by a linear number of paths 인쇄
by Jozef Skokan(London School of Economics)
Recently, Letzter proved that any graph of order n contains a collection P of $O(n \log^*n)$ paths with the following property: for all distinct edges e and f there exists a path in P which contains e but not f. We improve this upper bound to 19n, thus answering a question of Katona and confirming a conjecture independently posed by Balogh, Csaba, Martin, and Pluhar and by Falgas-Ravry, Kittipassorn, Korandi, Letzter, and Narayanan. Our proof is elementary and self-contained.
2023-05-08 / 16:00 ~ 17:00
학과 세미나/콜로퀴엄 - 박사논문심사: Parallel computation techniques to accelerate training of deep neural networks 인쇄
by 이영규 (KAIST)()

2023-05-10 / 16:00 ~ 17:00
IBS-KAIST 세미나 - 수리생물학: 인쇄
by ()
TBD
2023-05-11 / 16:15 ~ 17:15
학과 세미나/콜로퀴엄 - 콜로퀴엄: 인쇄
by ()
Tree decompositions are a powerful tool in both structural graph theory and graph algorithms. Many hard problems become tractable if the input graph is known to have a tree decomposition of bounded “width”. Exhibiting a particular kind of a tree decomposition is also a useful way to describe the structure of a graph. Tree decompositions have traditionally been used in the context of forbidden graph minors; bringing them into the realm of forbidden induced subgraphs has until recently remained out of reach. Over the last couple of years we have made significant progress in this direction, exploring both the classical notion of bounded tree-width, and concepts of more structural flavor. This talk will survey some of these ideas and results.
2023-05-11 / 11:50 ~ 12:40
대학원생 세미나 - 대학원생 세미나: 인쇄
by 최도영(카이스트)
In this talk, we present a formula for the degree of the 3-secant variety of a nonsingular projective variety embedded by a 3-very ample line bundle. The formula is provided in terms of Segre classes of the tangent bundle of a given variety. We use the generalized version of double point formula to reduce the calculation into the case of the 2-secant variety. Due to the singularity of the 2-secant variety, we use secant bundle as a nonsingular birational model and compute multiplications of desired algebraic cycles.
Events for the 취소된 행사 포함 모두인쇄
export to Google calendar  .ics download