Events - November 2018

Thursday, November 29, 2018 — 3:00 PM EST

Dhinakaran Vinayagamurthy, PhD candidate
David R. Cheriton School of Computer Science

Thursday, November 29, 2018 — 1:30 PM EST

Anastasia Kuzminykh, PhD candidate
David R. Cheriton School of Computer Science

Video-mediated communication has long struggled with asymmetrical constraints on situational awareness, especially in hybrid work meetings between collocated and remote participants. Advances in computer vision offer exciting opportunities to augment mediated situational awareness, but we must first understand what is meaningful to capture and present.

Thursday, November 29, 2018 — 10:30 AM EST

Nick Rollick, Graduate student
Department of Pure Mathematics

For this week's seminar, I invite you to join me for an informal chat about my experiences using "reflective responses" in my elementary number theory course. In these bi-weekly formal reflective assignments, my students were asked to set and monitor learning goals, identify gaps in understanding, and ponder the value and importance of their course material. Most importantly, I responded in detail to every student's reflection, creating a meaningful course-long conversation.

Wednesday, November 28, 2018 — 4:00 PM EST

John P. Conley, Department of Economics
Vanderbilt University

Blockchains are distributed, immutable, append only, ledgers designed to make trustless interactions between anonymous agents feasible and safe. The ledgers are maintained by networks of independent nodes who process transactions and come to a consensus view of which are valid and how this affects the ledger state. The integrity of blockchain ledgers therefore depends on the incentives contained in the consensus protocols that are designed to make the validating nodes behave honestly.

Wednesday, November 28, 2018 — 12:15 PM EST

Jaemyung Kim, PhD candidate
David R. Cheriton School of Computer Science

Transaction durability guarantees the ability to recover committed transactions from failures. However, making every transaction durable impacts transaction processing performance. Some ad-hoc durability mechanisms (e.g., delayed durability) improve performance, but they risk transactions losing their effects due to failures. The current one-size-fits-all transaction durability model does not solve this problem.

Monday, November 26, 2018 — 3:30 PM EST

Robin Cohen
David R. Cheriton School of Computer Science

Monday, November 26, 2018 — 2:00 PM EST

Li Liu, PhD candidate
David R. Cheriton School of Computer Science

Entanglement is a type of resource used in quantum information theory that gives correlations that cannot be simulated using classical probability theory. It is known that entanglement cannot be created locally. 

Monday, November 26, 2018 — 12:30 PM EST

Mohammad Rashidujjaman Rifat, PhD candidate
Department of Computer Science, University of Toronto

Monday, November 26, 2018 — 10:30 AM EST

N. Asokan, Department of Computer Science
Aalto University, Finland

All kinds of previously local services are being moved to cloud settings. While this is justified by the scalability and efficiency benefits of cloud-based services, it also raises new security and privacy challenges. Solving them by naive application of standard security/privacy techniques can conflict with other functional requirements. In this talk, I will outline some cloud-assisted services and the conflicts that arise while trying to secure these services.

Friday, November 23, 2018 — 1:30 PM EST

Xinan Yan, PhD candidate
David R. Cheriton School of Computer Science

Wednesday, November 21, 2018 — 1:30 PM EST

Abel Molina, PhD candidate
David R. Cheriton School of Computer Science

Yao (1993) proved that quantum Turing machines and uniformly generated quantum circuits are polynomially equivalent computational models: t >= n steps of a quantum Turing machine running on an input of length n can be simulated by a uniformly generated family of quantum circuits with size quadratic in t, and a polynomial-time uniformly generated family of quantum circuits can be simulated by a quantum Turing machine running in polynomial time.

Wednesday, November 21, 2018 — 12:15 PM EST

Hemant Saxena, PhD candidate
David R. Cheriton School of Computer Science

We address the problem of discovering dependencies from distributed big data. Existing (non-distributed) algorithms focus on minimizing computation by pruning the search space of possible dependencies. However, distributed algorithms must also optimize data communication costs, especially in current shared-nothing settings. 

Thursday, November 15, 2018 — 10:30 AM EST

Professor Brian Forrest
Department of Pure Mathematics, University of Waterloo

There are many challenges to teaching mathematics in a fully online environment. In this talk I will show the important role that assigned work plays in mitigating many of these challenges. I will also speak about how my experience in teaching online has impacted the way in which I approach my on campus courses.

Thursday, November 15, 2018 — 10:00 AM EST

Jeff Avery, PhD candidate
David R. Cheriton School of Computer Science

Wednesday, November 14, 2018 — 12:15 PM EST

Amine Mhedhbi, PhD candidate
David R. Cheriton School of Computer Science

We study the problem of optimizing subgraph queries (SQs) using the new worst-case optimal (WCO) join plans in Selinger-style cost-based optimizers. WCO plans evaluate SQs by matching one query vertex at a time using multiway intersections. The core problem in optimizing WCO plans is to pick an ordering of the query vertices to match. 

We make two contributions:

Friday, November 2, 2018 — 2:30 PM EDT

Nate Cardozo, Senior Staff Attorney
Electronic Frontier Foundation

Encryption is legal in the Five Eyes countries, thanks to our victory in what’s come to be known as the Crypto Wars of the 1990s. Computer security research is increasingly viewed as a boon rather than a scourge. But time is a circle and once again, law enforcement and policy makers around the world are calling for all that to change. 

Friday, November 2, 2018 — 1:30 PM EDT

Bushra Aloraini, PhD candidate
David R. Cheriton School of Computer Science

Friday, November 2, 2018 — 10:00 AM EDT

Yuwei Jiao, Master’s candidate
David R. Cheriton School of Computer Science

Thursday, November 1, 2018 — 10:30 AM EDT

Andrew Beltaos / Amenda Chow
University of Waterloo / York University

Teaching via analogies builds upon students' existing knowledge. New concepts that are taught only within the context of mathematics may seem foreign to students at first glance, but if students have already learned analogous concepts elsewhere in life, as educators, we can make use of their existing framework to strengthen their learning. 

S M T W T F S
28
29
30
31
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
1
  1. 2019 (212)
    1. December (1)
    2. November (4)
    3. October (14)
    4. September (20)
    5. August (18)
    6. July (12)
    7. June (23)
    8. May (23)
    9. April (32)
    10. March (25)
    11. February (16)
    12. January (24)
  2. 2018 (220)
    1. December (16)
    2. November (19)
    3. October (26)
    4. September (22)
    5. August (17)
    6. July (20)
    7. June (13)
    8. May (25)
    9. April (34)
    10. March (24)
    11. February (3)
    12. January (1)
  3. 2017 (36)
  4. 2016 (21)
  5. 2015 (36)
  6. 2014 (33)
  7. 2013 (23)
  8. 2012 (4)
  9. 2011 (1)
  10. 2010 (1)
  11. 2009 (1)
  12. 2008 (1)