Saturday, October 14, 2023

<< >>  
2023. 9
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. 10
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. 11
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-10-20 / 11:00 ~ 12:00
IBS-KAIST 세미나 - 수리생물학: 인쇄
by ()
Almost all biological systems possess the ability to gather environmental information and modulate their behaviors to adaptively respond to changing environments. While animals excel at sensing odors, even simple bacteria can detect faint chemicals using stochastic receptors. They then navigate towards or away from the chemical source by processing this sensed information through intracellular reaction systems. In the first half of our talk, we demonstrate that the E. coli chemotactic system is optimally structured for sensing noisy signals and controlling taxis. We utilize filtering theory and optimal control theory to theoretically derive this optimal structure and compare it to the quantitatively verified biochemical model of chemotaxis. In the latter half, we discuss the limitations of traditional information theory, filtering theory, and optimal control theory in analyzing biological systems. Notably, all biological systems, especially simpler ones, have constrained computational resources like memory size and energy, which influence optimal behaviors. Conventional theories don’t directly address these resource constraints, likely because they emerged during a period when computational resources were continually expanding. To address this gap, we introduce the “memory-limited partially observable optimal control,” a new theoretical framework developed by our group, and explore its relevance to biological problems.
2023-10-17 / 16:30 ~ 17:30
IBS-KAIST 세미나 - 이산수학: Essentially tight bounds for rainbow cycles in proper edge-colourings 인쇄
by Matija Bucić(Princeton University)
An edge-coloured graph is said to be rainbow if it uses no colour more than once. Extremal problems involving rainbow objects have been a focus of much research over the last decade as they capture the essence of a number of interesting problems in a variety of areas. A particularly intensively studied question due to Keevash, Mubayi, Sudakov and Verstraëte from 2007 asks for the maximum possible average degree of a properly edge-coloured graph on n vertices without a rainbow cycle. Improving upon a series of earlier bounds, Tomon proved an upper bound of $(\log n)^{2+o(1)}$ for this question. Very recently, Janzer-Sudakov and Kim-Lee-Liu-Tran independently removed the $o(1)$ term in Tomon's bound. We show that the answer to the question is equal to $(\log n)^{1+o(1)}$. A key tool we use is the theory of robust sublinear expanders. In addition, we observe a connection between this problem and several questions in additive number theory, allowing us to extend existing results on these questions for abelian groups to the case of non-abelian groups. Joint work with: Noga Alon, Lisa Sauermann, Dmitrii Zakharov and Or Zamir.
2023-10-19 / 16:00 ~ 17:00
학과 세미나/콜로퀴엄 - 박사논문심사: 개체수를 최대화하는 최적의 자원 분배에 관한 연구 인쇄
by 김연호(KAIST)

Events for the 취소된 행사 포함 모두인쇄
export to Google calendar  .ics download