Thesis defence

Monday, November 21, 2022 9:00 am - 9:00 am EST (GMT -05:00)

PhD Defence • Data Systems • Memory Power Consumption in Main-Memory Database Systems

Please note: This PhD defence will take place online.

Alexey Karyakin, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Ken Salem

In main-memory database systems, memory can consume a substantial amount of power, comparable to that of the processors. However, existing memory power-saving mechanisms are much less effective than processor power management. Unless the system is almost idle, memory power consumption will be high.

Please note: This PhD seminar will take place online.

Nabil Bin Hannan, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Edith Law

Wednesday, November 9, 2022 10:00 am - 10:00 am EST (GMT -05:00)

PhD Defence • Data Systems • Universal Data System Analysis for Insight and Adaptivity

Please note: This PhD defence will take place online.

Brad Glasbergen, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Khuzaima Daudjee

Database systems are ubiquitous; they serve as the cornerstone of modern application infrastructure due to their efficient data access and storage. Database systems are commonly deployed in a wide range of environments, from transaction processing to analytics.

Please note: This master’s thesis presentation will be given online.

Licheng Zhang, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Mark Hancock

Video games can generate different emotional states and affective reactions, but it can sometimes be difficult for a game’s visual designer to predict the emotional response a player might experience when designing a game or game scene.

Please note: This master’s thesis presentation will take place online.

Leonard Zhao, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Forbes Burkowski

Please note: This master’s thesis presentation will take place online.

Reza Bigdeli, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Anna Lubiw

The flip graph for a set $P$ of points in the plane has a vertex for every triangulation of $P$, and an edge when two triangulations differ by one flip that replaces one triangulation edge by another.

The flip graph is known to have some connectivity properties:

Please note: This master’s thesis presentation will be given in QNC 1201 and online.

Abhishek Anand, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Shalev Ben-David