Talk by Lukasz Golab “Is time-of-use electricity pricing effective?”

Published

Date/Time
Date(s) - 04/12/2017
10:00 am - 11:00 am

Categories


Title: Is time-of-use electricity pricing effective?

Abstract: The intuition behind time-of-use (TOU) electricity pricing is to charge more when demand is high so that customers either reduce their peak consumption or shift some of their consumption to a different time of day. It might seem that impact analysis of TOU pricing is simple: we just compare the average consumption before and after its introduction. However, weather changes from year to year, affecting how much consumers use air conditioners, fans and heaters. In this talk, I will discuss two things: 1) a methodology for isolating the impact of TOU pricing in the presence of confounding factors such as weather, and 2) an application of our methodology to a local distribution company in Ontario, showing that TOU pricing led to a 2.6-percent drop in residential demand during summer peak periods.

Bio: Lukasz Golab is an Associate Professor at the University of Waterloo and a Canada Research Chair in Data Analytics for Sustainability. He holds a B.Sc. in Computer Science (with High Distinction) from the University of Toronto and a Ph.D. in Computer Science (with Alumni Gold Medal) from the University of Waterloo. From 2006 till his return to Waterloo in 2011, he was a researcher at AT&T Labs. Lukasz’s research focuses on improving the efficiency and effectiveness of large-scale data management systems and developing new data-driven methodologies to solve problems in energy, sustainability and education.

You may also like

Why-query support in graph databases
Published

Why-query support in graph databases

Speaker: Elena Vasilyeva from TU Dresden Germany

Graph database systems based on the property graph model are used in multiple domains including: social networks, biology, logistics, and data integration. They provide schema-flexible storage for data of a different degree of a structure and support complex, expressive queries like shortest path calculation or subgraph isomorphism queries. Similar to a relational database, the result of a query in a graph database can be unexpected, because no answer, too few, or too many results can be returned. The flexibility and expressiveness of a graph database increase the likelihood of these situations and at the same time make it even harder for the user to resolve such issues manually […]

Talk by Reynold Cheng on Meta Paths and Meta Structures
Published

Talk by Reynold Cheng on Meta Paths and Meta Structures

A heterogeneous information network (HIN) is a graph model in which objects and edges are annotated with types. Large and complex databases, such as YAGO and DBLP, can be modeled as HINs. In this talk, we will give a review of meta paths, as well as how they are used to define relevance.
We further generalise the notion of a meta path to “meta structure”. Meta structure, which is more expressive than the meta path, describes complex relationship between two HIN objects.