Friday, June 3, 2022

<< >>  
2022. 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
2022. 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
2022. 7
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
2022-06-10 / 13:00 ~ 14:00
IBS-KAIST 세미나 - 수리생물학: 인쇄
by ()
Circadian rhythm is a robust internal 24 hours timekeeping mechanism maintained by the master circadian pacemaker Suprachiasmatic Nuclei (SCN). Numerous mathematical models have been proposed to capture SCN’s timekeeping mechanism and predict the circadian phase. There has been an increased demand for applying these models to the various unexplored data sets. One potential application is on data from commercially available wearable devices, which provide the noninvasive measurements of physiological proxies, such as activity and heart rate. Using these physiological proxies, we can estimate the circadian phase of the central and peripheral circadian pacemakers. Here, we propose a new framework for estimating the circadian phase using wearable data and the Level Set Kalman Filter on the nonlinear state-space model of the human circadian pacemaker. Analysis of over 200,000 days of wearable data from over 3,000 subjects using our framework successfully identified misalignment in central and peripheral pacemakers with a significantly smaller uncertainty than previous methods.
2022-06-10 / 11:00 ~ 12:00
학과 세미나/콜로퀴엄 - 대수기하학: 인쇄
by ()
In this talk, we introduce a various methods of representations of graphs which are mathematical objects expressing a variety of non-Euclidean data such as Molecules, social networks, genes, transportation networks, citation networks of papers and so on. Graph representation as a Euclidean vector is inevitable in machine learning for classifications for graphs which is closely related to graph neural network in computer science. We would like to introduce a few literatures, Weisfeiler-lehman algortihm, random walks, graph convolution whci are commonly used techniques and explain the result of combining them with topological invarints of graphs
2022-06-10 / 14:00 ~ 15:00
학과 세미나/콜로퀴엄 - 대수기하학: 인쇄
by 조도상()
The introduction for the framework of geometric deep learning will be explained in the perspective of new methodology of A.I. and data analysis. Various applications can be discussed by utilizing geometry, algebra, topology.
2022-06-10 / 14:00 ~ 15:30
학과 세미나/콜로퀴엄 - 박사논문심사: 다중모집단에서 수집된 영과잉 시계열 가산자료 분석을 위한 계층적 모델링 인쇄
by 심기성(KAIST)
심사위원장 : 정연승, 심사위원 : 김성호(명예교수), 박철우, 전현호, 김윤희(The University of Tokyo)
2022-06-07 / 16:00 ~ 17:00
SAARC 세미나 - SAARC 세미나: 인쇄
by ()
In this talk, I will describe the large deviation asymptotic of the sum of power-weighted edge lengths $\sum_{e \in E}|e|^\alpha$ in the Poisson $k$-nearest neighbor graph in $\mathbb R^d$. While the case $\alpha < d$ can be treated through classical methods from large deviations theory, an interesting dichotomy occurs if $\alpha > d$. Rare events in the lower tail can still be explained by subtle changes in the Poisson process throughout the sampling window. However, the most likely cause for rare events in the upper tail is a condensation phenomenon: the excess edge weight is caused by a negligible portion of Poisson points whose configuration can be described through a concrete geometric optimization problem. After presenting the general proof strategy, I will also elucidate on the prospects and limits of generalizing our approach to other spatial networks.
2022-06-07 / 16:00 ~ 17:15
학과 세미나/콜로퀴엄 - 정수론: 인쇄
by ()
Abstract: We discuss a new application of (a part of) the Iwasawa main conjecture to the non-triviality of Kato's Kolyvagin systems and a structural refinement of Birch and Swinnerton-Dyer conjecture. In particular, the structure of Selmer groups is completely determined by certain modular symbols for a large class of elliptic curves. (Please contact Wansu Kim at wansu.math@kaist.ac.kr for Zoom meeting info or any inquiry.)
2022-06-08 / 16:00 ~ 17:00
SAARC 세미나 - SAARC 세미나: 인쇄
by 서인석(서울대학교)
In this talk, we consider the Ising and Potts model defined on large lattices of dimension two or three at very low temperature regime. Under this regime, each monochromatic spin configuration is metastable in that exit from the energetic valley around that configuration is exponentially difficult. It is well-known that, under the presence of external magnetic fields, the metastable transition from a monochromatic configuration to another one is characterized solely by the appearance of a critical droplet. On the other hand, for the model without external field, the saddle structure is no longer characterized by a sharp droplet but has a huge and complex plateau structure. In this talk, we explain our recent research on the analysis of this energy landscape and its application to the demonstration of Eyring-Kramers formula for models on fixed two or three dimensional lattice (cf. https://arxiv.org/abs/2102.05565) or models on growing two-dimensional lattice (cf. https://arxiv.org/abs/2109.13583).
2022-06-03 / 17:00 ~ 18:00
IBS-KAIST 세미나 - IBS-KAIST 세미나: 인쇄
by 박영민(부산광역시교육청)
이 ‘영어 논문 쓰기’ 워크숍은 현재의 영어 수준이나 과거의 영어 학습 경험과 상관 없이 누구나 영어 논문 쓰기를 시작할 수 있는 방법에 관한 것입니다. 우선 영어에 대한 막연한 두려움, 과거 경험으로 인한 자신감 부족, 게다가 ‘쓰기’라는 쉽지 않은 인지 활동, 심지어 논문이라는 큰 벽, 혹은 섣부른 자신감 등 ‘영어 논문 쓰기’를 방해하는 요인을 생각해 봅니다. 이런 요인을 자세하게 들여다보면 각각의 걸림돌을 넘어갈 방법도 명쾌하게 발견할 수 있습니다. 이 세미나에서 다룰 구체적 내용은 다음과 같습니다. - 한국인들이 ‘영어’와 ‘영어 쓰기’를 어렵게 느끼는 원인 이해하고 극복하기 - ‘읽기’와 ‘쓰기’의 서로 다른 두 가지 인지활동의 관련성 이해하고 적용하기 - 논문에 적합한 단어, 시제, 구두점 선택하고 사용하기 - 영문초록, 제목, 소제목 스타일 이해하고 작성하기 - 영어논문 쓰기를 돕는 디지털 도구 선택하고 활용하기 이 워크숍에서 안내될 몇 가지 방법은 영어 논문 쓰기가 더 이상 두려운 것이 아닌 연구자로서의 목표를 이루는 디딤돌이 되도록 할 것입니다.
2022-06-03 / 16:00 ~ 17:00
IBS-KAIST 세미나 - IBS-KAIST 세미나: 인쇄
by 원병묵(성균관대학교)
논문은 저자와 독자 사이의 학문적 소통을 위한 논리적인 글이다. 이번 강연을 통해 논문을 작성하기 위한 기본 원리를 배울 수 있다. 특히, 연구가 거의 마무리되는 시점에 (After completing your research), 연구 결과를 그림과 표로 잘 정리한 다음에 (Based on well-organized figures and tables), 본격적으로 논문 작성을 시작하는 (Compose your manuscript from a title to a conclusion) ‘ABC 논문 작성법’을 소개한다. 논문 작성의 준비 과정으로 (A와 B의 과정), 연구 노트 작성 방법, 저널 클럽 운영 방법, 한 페이지 활용 방법을 설명한다. 논문 작성 준비가 완료되면, 제목부터 결론까지 순서대 로 논문 원고를 작성할 수 있다 (C의 과정). 이렇게 하면, 단기간에 집중하여 효율적으 로 논문을 작성할 수 있다. *참고: 원병묵 교수의 과학 논문 쓰는 법
2022-06-10 / 10:00 ~ 11:00
SAARC 세미나 - SAARC 세미나: Stefan problem via optimal stopping time 인쇄
by 김인원(캘리포니아 대학교 로스앤젤레스)
We consider an optimal transport problem where the cost depends on the stopping time of Brownian motion from a given distribution to another. When the target measure is fixed, it is often called the optimal Skorokhod embedding problem in the literature, a popular topic in math finance. Under a monotonicity assumption on the cost, the optimal stopping time is given by the hitting time to a space-time barrier set. When the target measure is optimized under an upper bound constraint, we will show that the optimal barrier set leads us to the Stefan problem, a free boundary problem for the heat equation describing phase transition between water and ice. This is joint work with Young-Heon Kim at UBC.
Events for the 취소된 행사 포함 모두인쇄
export to Google calendar  .ics download