Events

DH Asia Webinar Series: “Ancient and Modern Biotopes: What Can We Learn from Digitizing Ancient Pharmacology?” by Dr. Michael Stanley-Baker

ISTD PhD Oral Defense presented by Haoran Li – Overcoming the Limitations of Autoregressive and Non-Autoregressive Neural Models

ASD Gradshow 9: Öh!

ARISE Program – Validate Presentation Day

Fan Liu & Felix Tong (Morgan Stanley Technology) – An introduction of Cybersecurity in Investment Banking: An overview of Digital Signatures

In ARISE: Validate, teams will go out to the field and confirm if there is an actual need for their solution and discover other important requirements of their target market, to better shape the development roadmap of their solution.

ISTD PhD Oral Defense presented by Li Xu – Towards Effective, Robust, and Continual Multi-modal Learning

Combinatorial Game Theory is the branch of Mathematics and Computer Science that studies two-player games (the players areLeft/Positive and Right/Negative) with perfect and complete information; there is no chance, and there are no hidden moves. In the 1970s John Conway defined normal play game comparison via the rule G > H if Left wins G-H playing second. He understood that normal play games constitute a group structure, with respect to the disjunctive sum operator. Nowadays we rather define this inequality by G > H if, for all games X, the perfect play outcome of G + X is no worse than that of H + X, with respect to player Left. And we call Conway’s discovery, that the notions are equivalent, the “fundamental theorem of normal play”. We explain the relevance of this result, and as an illustration, compute game values of some classical ruleset positions, such as Hackenbush, Domineering, Toppling Dominoes, Toads and Frogs and more.

ARISE Program – Validate

In ARISE: Validate, teams will go out to the field and confirm if there is an actual need for their solution and discover other important requirements of their target market, to better shape the development roadmap of their solution.