BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.4//
METHOD:PUBLISH
X-WR-CALNAME;VALUE=TEXT:None
BEGIN:VTIMEZONE
TZID:America/Toronto
BEGIN:STANDARD
DTSTART:20201101T020000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20210314T020000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.2684.field_event_date.0@uwaterloo.ca/computer-science
DTSTAMP:20210123T213141Z
CREATED:20210112T033235Z
DESCRIPTION:Please note: This master’s thesis presentation will be given on
line.\n\n\n\nTrevor Clokie\, Master’s candidateDavid R. Cheriton School of
Computer Science\n\n\n\nSupervisor: Professor Jeffrey Shallit\n\n\n\nLet
s_2(n) be the sum of the digits of n when expressed in base 2. For integer
s n and k\, Stolarsky defined n to be k-flimsy if s_2(kn) < s_2(n). In thi
s paper\, we generalize the definition of k-flimsy numbers to all bases b\
, and provide a method to construct a pushdown automaton recognizing the k
-flimsy base-b numbers. Using the tools of context-free languages and anal
ytic combinatorics\, we use this automaton to determine precise asymptotic
s for the number of k-flimsy N-digit numbers in base b. Lastly\, using the
results we obtained\, we discuss the natural densities of k-flimsy number
s in base b for all values k and b.\n\n\n\nOur main results can be found i
n Theorems 2\, 3\, 8\, and 9.\n\n\n\nTo joint this master’s thesis present
ation on Zoom\, please go to https://us02web.zoom.us/j/88171362356?pwd=L2h
NN3hUN3BGMTdoYUI4ZlVNNTdsQT09.
DTSTART;TZID=America/Toronto:20210125T160000
DTEND;TZID=America/Toronto:20210125T160000
LAST-MODIFIED:20210116T135911Z
LOCATION:Online presentation\, 200 University Avenue West\, Waterloo\, Onta
rio\, Canada N2L 3G1
SUMMARY:Master’s Thesis Presentation • Algorithms and Complexity — Counting
Flimsy Numbers via Formal Language Theory
URL;TYPE=URI:https://uwaterloo.ca/computer-science/events/masters-thesis-pr
esentation-algorithms-and-complexity-counting-flimsy-numbers-via-formal-la
nguage-theory
END:VEVENT
BEGIN:VEVENT
UID:calendar.2697.field_event_date.0@uwaterloo.ca/computer-science
DTSTAMP:20210123T213141Z
CREATED:20210121T215350Z
DESCRIPTION:Please note: This seminar will be given online.\n\n\n\nSepideh
MahabadiToyota Technological Institute at Chicago\n\n\n\nSearching and sum
marization are two of the most fundamental tasks in massive data analysis.
In this talk\, I will focus on these two tasks from the perspective of di
versity and fairness.\n\n\n\nSearch is often formalized as the (approximat
e) nearest neighbor problem. Despite an extensive research on this topic\,
its basic formulation is insufficient for many applications. In this talk
\, I will describe such applications and our approaches to address them. F
or example\, we show how to incorporate diversity or fairness in the resul
ts of a search query.\n\n\n\nA prominent approach to summarize the data is
to compute a small “core-set”: a subset of the data that is sufficient fo
r approximating the solution of a given task. We introduce the notion of “
composable core-sets” as core-sets with the composability property: the un
ion of multiple core-sets should form a good summary for the union of the
original data sets. This composability property enables efficient solution
s to a wide variety of massive data processing applications\, including di
stributed computation (e.g.\, Map-Reduce model)\, streaming algorithms\, a
nd similarity search. We show how to produce such efficient summaries of t
he data while preserving the diversity in the data set. I will describe se
veral metrics for capturing the notion of diversity\, and present efficien
t algorithms for construction of composable core-sets with respect to thos
e metrics.\n\n\n\nBio: Sepideh Mahabadi is a research assistant professor
at the Toyota Technological Institute at Chicago (TTIC). She received her
PhD from MIT\, where she was advised by Piotr Indyk. For a year\, she was
a postdoctoral research scientist at Simons Collaboration on Algorithms an
d Geometry based at Columbia University. Her research focuses on Theoretic
al Foundations of Massive Data including High Dimensional Computational Ge
ometry\, Streaming Algorithms\, and Data Summarization\; as well as Social
Aspects of Algorithms for Massive Data including Diversity Maximization a
nd Algorithmic Fairness.\n\n\n\nTo join this seminar on Zoom\, please go t
o https://zoom.us/j/91745798268?pwd=U3hNK0dXMDZUZ1RvLytRV3c5UXN1UT09.
DTSTART;TZID=America/Toronto:20210126T120000
DTEND;TZID=America/Toronto:20210126T120000
LAST-MODIFIED:20210121T215451Z
LOCATION:Online seminar\, 200 University Avenue West\, Waterloo\, Ontario\,
Canada N2L 3G1
SUMMARY:Seminar • Algorithms and Complexity — Diversity and Fairness in Dat
a Summarization Algorithms
URL;TYPE=URI:https://uwaterloo.ca/computer-science/events/seminar-algorithm
s-and-complexity-diversity-and-fairness-in-data-summarization-algorithms
END:VEVENT
BEGIN:VEVENT
UID:calendar.2664.field_event_date.0@uwaterloo.ca/computer-science
DTSTAMP:20210123T213141Z
CREATED:20201217T031642Z
DESCRIPTION:Please note: This PhD defence will be given online.\n\n\n\nJan
Gorzny\, PhD candidateDavid R. Cheriton School of Computer Science\n\n\n\n
Supervisor: Professor Jonathan Buss\n\n\n\nAn asteroidal triple in a graph
is a set of three independent vertices such that between any two of them\
, there is a path that does not contain the closed neighbourhood of the th
ird. A graph without an asteroidal triple is said to be AT-free. An orderi
ng of a graph $G$ is a bijection of V(G) to {1\,...\, |V(G)|}. In this the
sis\, we consider the ordering problems Cutwidth\, Imbalance\, and Optimal
Linear Arrangement\, as well as the S-End-Vertex problem\, on AT-free gra
phs and in the parameterized complexity setting.\n\n\n\nFirst\, we show th
at results for Cutwidth can be applied to Imbalance\, and that those resul
ts in turn can be applied to obtain complexity results for Optimal Linear
Arrangement. On some graph classes\, there is an ordering which is optimal
for all three problems simultaneously. Along the way\, we show that there
are optimal orderings where each set of true twins in the graph appears c
onsecutively for each of these problems. These results yield fixed-paramet
er tractable (FPT) algorithms for these problems when the parameter is a v
ariant of the twin-cover or the (edge-)clique-cover number.\n\n\n\nWe obta
in tractable algorithms for Imbalance on various classes of AT-free graphs
\, which match the complexity of algorithms for Cutwidth on these classes.
We show that Imbalance is NP-complete for split graphs\, but can be solve
d on threshold graphs — the AT-free restriction of this class of graphs —
in linear time. We obtain tractable results for other subclasses of AT-fre
e graphs: Imbalance can be solved in linear time on proper interval graphs
and bipartite permutation graphs\, an-d in polynomial time on superfragil
e graphs. We observe that the best-known FPT algorithm for Cutwidth on gra
phs with bounded vertex cover can be adapted for Imbalance\, and the reduc
tion that shows Cutwidth likely has no polynomial-sized kernel for bounded
vertex cover number graphs also applies to Imbalance. These results also
follow from the fact that there are Imbalance-optimal orderings where each
set of true twins in the graph appears consecutively. We also determine c
losed formulas for Imbalance on very small graph classes which have closed
formulas for Cutwidth.\n\n\n\nIn turn\, the Imbalance results lead to tra
ctable algorithms for Optimal Linear Arrangement. We show that Optimal Lin
ear Arrangement has a linear time algorithm for threshold graphs\, and pol
ynomial time algorithms for bipartite permutation graphs and superfragile
graphs.\n\n\n\nFinally\, we consider the question of whether a particular
vertex can be visited last a search algorithm $S$: this is the S-End-Verte
x problem. We perform the first systematic study of the problem on biparti
te permutation graphs. We improve the previous result for Lexicographic Br
eadth-First Search\, and show new positive results for Maximal Neighbourho
od Search\, Depth-First Search\, and Breadth-First Search.\n\n\n\nTo join
this PhD defence on Zoom\, please go to https://us02web.zoom.us/j/81596822
990?pwd=UjdXa0hHYUhhRkxkNWxteWQwOHp6Zz09.
DTSTART;TZID=America/Toronto:20210127T090000
DTEND;TZID=America/Toronto:20210127T090000
LAST-MODIFIED:20210122T213034Z
LOCATION:Online PhD defence\, 200 University Avenue West\, Waterloo\, Ontar
io\, Canada N2L 3G1
SUMMARY:PhD Defence • Algorithms and Complexity — Related Orderings of AT-F
ree Graphs
URL;TYPE=URI:https://uwaterloo.ca/computer-science/events/phd-defence-algor
ithms-and-complexity-related-orderings-of-at-free-graphs
END:VEVENT
BEGIN:VEVENT
UID:calendar.2699.field_event_date.0@uwaterloo.ca/computer-science
DTSTAMP:20210123T213141Z
CREATED:20210122T175606Z
DESCRIPTION:Please note: This seminar will be given online.\n\n\n\nAnton Mo
sunov\, Digital Assets GroupUniversity of Waterloo\n\n\n\nI will talk abou
t various administrative decisions that enabled me and my colleagues to ru
n MATH 135 — a multi-section Honours Algebra course\, which was offered bo
th on campus and online. The ratio of on-campus to online students was rou
ghly 1:4. I will discuss technology that we used\, digital assets develope
d for the course\, approaches to mitigating student anxiety in a new envir
onment\, as well as ways to deal with situations when either a student or
an instructor on campus suspected to have COVID-19.\n\n\n\nTo join this se
minar on MS Teams\, please go to https://teams.microsoft.com/l/meetup-join
/19%3ameeting_YWI1MWQ5ZjItMTk3My00NWU3LTg3ZGMtNjk3YTFlMDU4Njhk%40thread.v2
/0?context=%7b'Tid'%3a'723a5a87-f39a-4a22-9247-3fc240c01396'%2c'Oid'%3a'c2
18ed4d-e21a-4ab1-bba9-153cd5654b2a'%7d.
DTSTART;TZID=America/Toronto:20210128T110000
DTEND;TZID=America/Toronto:20210128T110000
LAST-MODIFIED:20210122T175715Z
LOCATION:Online seminar\, 200 University Avenue West\, Waterloo\, Ontario\,
Canada N2L 3G1
SUMMARY:Mathematics Faculty Teaching Seminar • Coordinating MATH 135: A Mul
ti-Section Course Offered Both On Campus and Online
URL;TYPE=URI:https://uwaterloo.ca/computer-science/events/mathematics-facul
ty-teaching-seminar-coordinating-math-135
END:VEVENT
BEGIN:VEVENT
UID:calendar.2698.field_event_date.0@uwaterloo.ca/computer-science
DTSTAMP:20210123T213141Z
CREATED:20210121T222521Z
DESCRIPTION:Please note: This semianr will be given online.\n\n\n\nAkshitha
Sriraman\, Computer Science and EngineeringUniversity of Michigan\n\n\n\n
Current hardware and software systems were conceived at a time when we had
scarce compute and memory resources\, limited quantity of data and users\
, and easy hardware performance scaling due to Moore’s Law. These assumpti
ons are not true today. Today\, emerging web services require data centers
that scale to hundreds of thousands of servers\, i.e.\, hyperscale\, to e
fficiently process requests from billions of users. In this new era of hyp
erscale computing\, we can no longer afford to build each layer of the sys
tems stack separately. Instead\, we must rethink the synergy between the s
oftware and hardware worlds from the ground up.\n\n\n\nIn this talk\, I wi
ll focus on re-thinking (1) software threading and concurrency paradigms a
nd (2) data center hardware architectures. First\, I will detail μTune\, m
y software threading framework that is aware of the overheads induced by t
he underlying hardware’s constraints. Then\, I will discuss SoftSKU and Ac
celerometer—my proposals to answer the question of: How should we build da
ta center hardware for emerging software paradigms in the post-Moore era?
Finally\, I will conclude by describing my ongoing and future research tow
ards re-designing the systems stack to enable the hyperscale web services
of tomorrow.\n\n\n\nBio: Akshitha Sriraman is a Ph.D. candidate in Compute
r Science and Engineering at the University of Michigan. Her research brid
ges computer architecture and software systems\, demonstrating the importa
nce of that bridge in realizing efficient hyperscale web services via solu
tions that span the systems stack. Her systems solutions to improve hardwa
re efficiency have been deployed in real hyperscale data centers and curre
ntly serve billions of users\, saving millions of dollars and meaningfully
reducing the global carbon footprint. Additionally\, her hardware design
proposals have influenced Intel’s Alder Lake+ CPU architectures.\n\n\n\nSr
iraman has been recognized with a Facebook Fellowship\, a Rackham Merit Ph
.D. Fellowship\, and was selected for the Rising Stars in EECS Workshop. H
er work has been recognized with an IEEE Micro Top Picks distinction and h
as appeared in top architecture and systems venues like OSDI\, ISCA\, ASPL
OS\, MICRO\, and HPCA. \n\n\n\nTo joint this seminar on Zoom\, please go t
o https://zoom.us/j/92423957388?pwd=RDdFNDlqK0pRR05pUDFoSVR0amEyZz09.
DTSTART;TZID=America/Toronto:20210128T120000
DTEND;TZID=America/Toronto:20210128T120000
LAST-MODIFIED:20210121T222547Z
LOCATION:Online seminar\, 200 University Avenue West\, Waterloo\, Ontario\,
Canada N2L 3G1
SUMMARY:Seminar • Computer Architecture and Software Systems — Enabling Hyp
erscale Web Services
URL;TYPE=URI:https://uwaterloo.ca/computer-science/events/seminar-computer-
architecture-and-software-systems-enabling-hyperscale-web-services
END:VEVENT
BEGIN:VEVENT
UID:calendar.2685.field_event_date.0@uwaterloo.ca/computer-science
DTSTAMP:20210123T213141Z
CREATED:20210112T035656Z
DESCRIPTION:Please note: This PhD seminar will be given online.\n\n\n\nGreg
Philbrick\, PhD candidateDavid R. Cheriton School of Computer Science\n\n
\n\nSupervisor: Professor Craig Kaplan\n\n\n\nThe hatching shape is our pr
imitive for supporting hand-drawn hatching from imagination. A hatching sh
ape comprises a mask and three rasterized fields—width\, spacing\, and dir
ection. Streamline advection uses these fields to create hatching marks. A
hatching shape also contains barrier curves: deliberate discontinuities u
seful for drawing complex forms. We explain several operations on hatching
shapes\, such as the multi-dir operation\, an easy way to depict 3D form
using a hatching shape’s direction field. We also explain the modification
s to streamline advection necessary to handle barrier curves.\n\n\n\nPleas
e contact Greg Philbrick at least an hour in advance of his PhD seminar to
attend this presentation on MS Teams.
DTSTART;TZID=America/Toronto:20210129T130000
DTEND;TZID=America/Toronto:20210129T130000
LAST-MODIFIED:20210122T185731Z
LOCATION:Online PhD seminar\, 200 University Avenue West\, Waterloo\, Ontar
io\, Canada N2L 3G1
SUMMARY:PhD Seminar • Computer Graphics — A Primitive for Manual Hatching
URL;TYPE=URI:https://uwaterloo.ca/computer-science/events/phd-seminar-compu
ter-graphics-a-primitive-for-manual-hatching
END:VEVENT
END:VCALENDAR