时 间:16:00-16:45, Jul 24, 2026 (Fri)地 点:RM 1-222, FIT Building内容:We investigate the structural properties, including isomerization, and melting behavior of two-dimensional ion crystals in an RF trap, focusing on the effects of ion temperature and trap potential anisotropy. We identify distinct crystal structures that form under varying trapping conditions and temperatures through ex...
时 间:10:00-10:45, Jul 24, 2026 (Fri)地 点:RM 1-222, FIT Building内容:Understanding how molecular vibrations afiect charge and energy transfer in complex chemical and biological systems requires modeling the interactions among the electronic, spin, and vibrational degrees of freedom, which cannot be treated independently, especially when the Born-Oppenheimer approximation breaks down. Tr...
时 间:13:30-15:00, Jul 15, 2026 (Wed)地 点:RM 1-222, FIT Building内容:We consider the exact asymptotics of the minimax risk for detecting an elevated-mean sparse submatrix in a large Gaussian random matrix. Although there exists a precise characterization of when and how asymptotic consistency is possible for such testing problems, there is limited understanding of the exact minimax risk...
时 间:15:00-16:00, Jul 9, 2026 (Thu)地 点:RM 1-202, FIT Building内容:As AI systems increasingly operate as autonomous agents, intelligence is becoming inherently social. Future AI systems will not act in isolation, but will learn, coordinate, communicate, and make decisions alongside humans and other agents in open-ended environments. This shift raises fundamental challenges: How can age...
时 间:10:00-11:30, Jul 6, 2026 (Mon)地 点:Lecture Hall, FIT Building内容:Programmable atomic systems offer a powerful route to quantum simulation of strongly correlated many-body dynamics beyond the reach of classical computation. As an introductory example, I will briefly discuss implementations of lattice gauge theories, where atomic, ionic, and Rydberg platforms enable controlled stud...
时 间:14:00-15:00, Jun 29, 2026 (Mon)地 点:RM 1-222, FIT Building内容:We will discuss recent algorithmic advances for fundamental graph problems, including negative-weight shortest paths, maximum flow, and minimum-cost flow. Classical textbook-style algorithms, such as Bellman-Ford and push-relabel, often lead to \(O(mn)\)-type running times. In recent years, however, there has been trem...