# 학과 세미나 및 콜로퀴엄

2021-10
Sun Mon Tue Wed Thu Fri Sat
1 2
3 4 5 1 6 7 1 8 9
10 11 12 1 13 14 15 16
17 18 19 20 21 1 22 23
24 25 26 27 1 28 29 30
31
2021-11
Sun Mon Tue Wed Thu Fri Sat
1 2 1 3 4 5 6
7 8 9 10 11 1 12 13
14 15 16 17 18 1 19 20
21 22 23 24 1 25 26 27
28 29 30

구글 Calendar나 iPhone 등에서 구독하면 세미나 시작 전에 알림을 받을 수 있습니다.

Within a given species, fluctuations in egg or embryo size is unavoidable. Despite this, the gene expression pattern and hence the embryonic structure often scale in proportion with the body length. This scaling phenomenon is very common in development and regeneration and has long fascinated scientists. I will first discuss a generic theoretical framework to show how scaling gene expression pattern can emerge from non-scaling morphogen gradients. I will then demonstrate that the Drosophila gap gene system achieves scaling in a way that is entirely consistent with our theory. Remarkably, a parameter-free model based on the theory quantitatively accounts for the gap gene expression pattern in nearly all morphogen mutants. Furthermore, the regulation logic and the coding/decoding strategy of the gap gene system can be revealed. Our work provides a general theoretical framework on a large class of problems where scaling output is induced by non-scaling input, as well as a unified understanding of scaling, mutants’ behavior and regulation in the Drosophila gap gene and related systems.
This talk will be presented online. Zoom link: 709 120 4849 (pw: 1234)
Host: Jae Kyoung Kim         미정     2021-10-05 14:18:47
This talk will be presented online. Zoom link: 709 120 4849 (pw: 1234)
Host: Jae Kyoung Kim         미정     2021-10-05 14:19:57
A well-known theorem of Whitney states that a 3-connected planar graph admits an essentially unique embedding into the 2-sphere. We prove a 3-dimensional analogue: a simply-connected 2-complex every link graph of which is 3-connected admits an essentially unique locally flat embedding into the 3-sphere, if it admits one at all. This can be thought of as a generalisation of the 3-dimensional Schoenflies theorem. This is joint work with Agelos Georgakopoulos.
Host: Sang-il Oum     영어     2021-09-13 08:19:27
Abstract: From fertilization to birth, successful mammalian reproduction relies on interactions of elastic structures with a fluid environment. Sperm flagella must move through cervical mucus to the uterus and into the oviduct, where fertilization occurs. In fact, some sperm may adhere to oviductal epithelia, and must change their pattern of oscillation to escape. In addition, coordinated beating of oviductal cilia also drive the flow. Sperm-egg penetration, transport of the fertilized ovum from the oviduct to its implantation in the uterus and, indeed, birth itself are rich examples of elasto-hydrodynamic coupling. We will discuss successes and challenges in the mathematical and computational modeling of the biofluids of reproduction.
This talk will be presented online. Zoom link: 709 120 4849 (pw: 1234)
Host: Jae Kyoung Kim         미정     2021-10-05 14:21:18
TBA
This talk will be presented online. Zoom link: 709 120 4849 (pw: 1234)
Host: Jae Kyoung Kim         미정     2021-10-05 14:22:25
Simple mathematical models have had remarkable successes in biology, framing how we understand a host of mechanisms and processes. However, with the advent of a host of new experimental technologies, the last ten years has seen an explosion in the amount and types of quantitative data now being generated. This sets a new challenge for the field – to develop, calibrate and analyse new models to interpret these data. In this talk I will use examples relating to intracellular transport and cell motility to showcase how quantitative comparisons between models and data can help tease apart subtle details of biological mechanisms.
This talk will be presented online. Zoom link: 709 120 4849 (pw: 1234)
Host: Jae Kyoung Kim         미정     2021-10-05 14:23:39
Majority dynamics on a graph $G$ is a deterministic process such that every vertex updates its $\pm 1$-assignment according to the majority assignment on its neighbor simultaneously at each step. Benjamini, Chan, O'Donnell, Tamuz and Tan conjectured that, in the Erd\H{o}s--R\'enyi random graph $G(n,p)$, the random initial $\pm 1$-assignment converges to a $99\%$-agreement with high probability whenever $p=\omega(1/n)$. This conjecture was first confirmed for $p\geq\lambda n^{-1/2}$ for a large constant $\lambda$ by Fountoulakis, Kang and Makai. Although this result has been reproved recently by Tran and Vu and by Berkowitz and Devlin, it was unknown whether the conjecture holds for $p< \lambda n^{-1/2}$. We break this $\Omega(n^{-1/2})$-barrier by proving the conjecture for sparser random graphs $G(n,p)$, where $\lambda' n^{-3/5}\log n \leq p \leq \lambda n^{-1/2}$ with a large constant $\lambda'>0$.
Host: Sang-il Oum     영어     2021-09-22 08:28:45
Immune sentinel cells must initiate the appropriate immune response upon sensing the presence of diverse pathogens or immune stimuli. To generate stimulus-specific gene expression responses, immune sentinel cells have evolved a temporal code in the dynamics of stimulus responsive transcription factors. I will present recent works 1) using an information theoretic approach to identify the codewords, termed “signaling codons”, 2) using a machine learning approach to characterize their reliability and points of confusion, and 3) dynamical systems modeling to characterize the molecular circuits that allow for their encoding. I will present progress on how the temporal code may be decoded to specify immune responses. Further, I will discuss to what extent such a code may be harnessed to achieve greater pharmacological specificity when therapeutically targeting pleiotropic signaling hubs. NFκB Signaling: information theory, signaling codons
This talk will be presented online. Zoom link: 709 120 4849 (pw: 1234)
Host: Jae Kyoung Kim         미정     2021-10-05 14:17:31
I am going to present an algorithm for computing a feedback vertex set of a unit disk graph of size k, if it exists, which runs in time $2^{O(\sqrt{k})}(n + m)$, where $n$ and $m$ denote the numbers of vertices and edges, respectively. This improves the $2^{O(\sqrt{k}\log k)}(n + m)$-time algorithm for this problem on unit disk graphs by Fomin et al. [ICALP 2017].
Host: Sang-il Oum     영어     2021-09-22 08:25:36