Skip to main content

MathAcrossCampus Talk

MathAcrossCampus Talk

 

Friday, December 2, 2016, 3:30 PM

Kane Hall 110

reception to follow at 4:30

David Shmoys

Cornell University

Smarter Tools for (Citi)Bike Sharing

The sharing economy has helped to transform many aspects of our day-to-day lives, leveraging the IT revolution in increasingly novel ways. At the same time, the sharing economy presents new computational challenges to provide tools to support the operations of these emerging industries. Although perhaps not quite as visible in impact as Uber and Airbnb (and their competitors), bike-sharing systems have fundamentally changed the urban landscape as well. Even in a city as notoriously inhospitable to cycling as New York, Citibike has emerged as a significant player in the city’s transportation network, supporting more than 1.5 million rides per month for a subscriber base of roughly 100,000 individuals. We have been working with Citibike to develop analytics and optimization models and algorithms to help manage this system. The key challenge is to cope with huge rush-hour usage that simultaneously creates stark shortages of bikes in some neighborhoods, and surpluses of bikes (and consequently, shortages of parking docks) elsewhere. We will explain how mathematical models can be used to answer questions such as, how should we position the fleet of bikes at the start of a rush hour, and how should we mitigate the imbalances that develop? Since a fundamental aspect of the behavior of these systems is the fluctuation in traffic patterns that vary over time, the resulting mathematical questions fall in the domain of stochastic optimization, where we develop a probabilistic model of the demand, and then optimize the expected performance of the system over a planning horizon. We will also describe some of the algorithmic challenges that these models pose, and highlight the computational tools developed to address them.

Speaker Bio:
David Shmoys is the Laibe/Acheson Professor at Cornell University in the School of Operations Research and Information Engineering, and also the Department of Computer Science at Cornell University, and is currently the Director of the School of Operations Research and Information Engineering. Shmoys’s research has focused on the design and analysis of efficient algorithms for discrete optimization problems, with applications including scheduling, inventory theory, computational biology, and most recently, on stochastic optimization models and algorithms in computational sustainability. His graduate-level text, The Design of Approximation Algorithms, co-authored with David Williamson, was awarded the 2013 INFORMS Lanchester Prize. He is an INFORMS Fellow, a Fellow of the ACM, a SIAM Fellow, and was an NSF Presidential Young Investigator; he has served on numerous editorial boards, and is currently Editor-in-Chief of Research in the Mathematical Sciences (for theoretical computer science) and an Associate Editor of Mathematics of Operations Research.
http://www.math.washington.edu/mac/

November 30, 2016

UW CSE Distinguished Lecture! / Thursday, November 10, 2016 / Lapata / University of Edinburgh / What’s This Movie About? Automatic Content Analysis and Summarization

———- Forwarded message ———-
From: Info about upcoming UW CSE Colloquia <talks@cs.washington.edu>
Date: Mon, Nov 7, 2016 at 3:53 PM
Subject: [cs-ugrads] UW CSE Distinguished Lecture! / Thursday, November 10, 2016 / Lapata / University of Edinburgh / What’s This Movie About? Automatic Content Analysis and Summarization
To: cs-ugrads@cs.washington.eduOn Thursday of this week:

UNIVERSITY OF WASHINGTON
Computer Science and Engineering
DISTINGUISHED LECTURE

SPEAKER:   Mirella Lapata, University of Edinburgh

TITLE:     What’s This Movie About? Automatic Content Analysis and
Summarization

DATE:      Thursday, November 10, 2016
TIME:      3:30pm
PLACE:     EEB-105
HOST:      Noah Smith

ABSTRACT:
Movie analysis is an umbrella term for many tasks aiming to automatically
interpret, extract, and summarize the content of a movie.  Potential
applications include generating shorter versions of scripts to help with
the decision making process in a production company, enhancing movie
recommendation engines by abstracting over specific keywords to more
general concepts (e.g., thrillers with psychopaths), and notably
generating movie previews.

In this talk I will illustrate how NLP-based models together with video
analysis can be used to facilitate various steps in the movie production
pipeline. I will formalize the process of generating a shorter version of
a movie as the task of finding an optimal chain of scenes and present a
graph-based model that selects a chain by jointly optimizing its logical
progression, diversity, and importance. I will then apply this framework
to screenplay summarization, a task which could enhance script browsing
and speed up reading time. I will also show that by aligning the
screenplay to the movie, the model can generate movie previews with
minimal modification. Finally, I will discuss how the computational
analysis of movies can lead to tools that automatically create movie
“profiles” which give a first impression of the movie by describing its
plot, mood, location, or style.

Bio
Mirella Lapata is a Professor at the School of Informatics at the
University of Edinburgh. Her recent research interests are in natural
language processing. She serves as an associate editor of the Journal of
Artificial Intelligence Research (JAIR). She is the first recipient (2009)
of the British Computer Society and Information Retrieval Specialist Group
(BCS/IRSG) Karen Sparck Jones award. She has also received best paper
awards in leading NLP conferences and financial support from the EPSRC
(the UK Engineering and Physical Sciences Research Council) and ERC (the
European Research Council).

Reception to take place in the Atrium *after* the talk.

*NOTE* This lecture will be broadcast live via the Internet. See
http://www.cs.washington.edu/news/colloq.info.html for more information.

Email: talk-info@cs.washington.edu
Info: http://www.cs.washington.edu/
(206) 543-1695

The University of Washington is committed to providing access, equal
opportunity and reasonable accomodation in its services, programs,
activities, education and employment for individuals with disabilities.
To request disability accommodation, contact the Disability Services
Office at least ten days in advance of the event at: (206) 543-6450/V,
(206) 543-6452/TTY, (206) 685-7264 (FAX), or email at
dso@u.washington.edu.

November 8, 2016

P. Anandan colloquium on Thursday

———- Forwarded message ———-
From: Info about upcoming UW CSE Colloquia <talks@cs.washington.edu>
Date: Sat, Oct 22, 2016 at 12:28 PM
Subject: [cs-ugrads] P. Anandan colloquium on Thursday
To: cs-ugrads@cs.washington.edu

P. Anandan is Vice President for Research at Adobe. He previously was Distinguished Scientist and Managing Director at Microsoft Research, where (after 7 years in Redmond) he established MSR India which he ran for a decade.

He will deliver the CSE colloquium on Thursday at 3:30 in EEB 105. The title is “How Data Science, Machine Learning, and AI are Transforming the Consumer Experience.”

Anandan is a very smart and experienced person; this talk should be of interest to anyone in the data science community, and anyone interested in AI and ML. Please plan to attend, and spread the word.

Info here:

http://www.cs.washington.edu/events/colloquia/details?id=2950

October 24, 2016

MathAcrossCampus Talk on Probabilistically Checkable Proofs

Dear students,

This talk next Friday afternoon should be extremely cool. Irit Dinur will be talking about one of the greatest results in complexity theory in the last 25 years:  the PCP theorem. One way of stating this theorem is that any mathematical proof can be rewritten into a proof that can be verified with high accuracy by a randomized algorithm that only looks at the proof in a constant number of places. It is the cornerstone in our understanding of the hardness of efficiently approximating the solutions to NP-complete problems.
Highly recommended!
Anna
MathAcrossCampus Talk
 

Friday, May 20, 2016, 3:30 PM

reception to follow at 4:30
Irit Dinur

The Weizmann Institute of Science

Probabilistically Checkable Proofs: deducing a complicated global picture from very simple partial views

Sometimes you just don’t have enough time to read an entire proof, a brief scan is all you can afford. Probabilistically checkable proofs (PCPs), discovered 25 years ago, guarantee that even a brief scan will find an error if there is one. A PCP proof is created by taking a regular proof and splitting it cleverly into fragments. The key is a theorem asserting that locally consistent fragments must be coming from a globally correct proof. We will describe this surprising local-to-global phenomenon and show a variety of implications from computational optimization all the way to secure cloud computing.

Speaker Bio: 

Irit Dinur is a professor of computer science at the Weizmann Institute of Science. Her research is in computational complexity. She earned her doctorate in 2002 from Tel-Aviv University. In 2006 she discovered a new proof of the PCP theorem that was significantly simpler than previous proofs of the same result. She is the recepient of the 2007 Michael Bruno Memorial Award in Computer Science by Yad Hanadiv. She was a plenary speaker at the 2010 International Congress of Mathematicians. In 2012, she won the Anna and Lajos Erdős Prize in Mathematics.

http://www.math.washington.edu/mac/

May 12, 2016

Glenn Kelman, Redfin, 6 p.m. Thursday, EE 125

From: Ed Lazowska

Glenn Kelman, the CEO of Redfin, will be giving a tech talk on Thursday in EE 125 at 6 p.m.

Glenn is MIND BLOWINGLY good. (Smart, witty, blunt, profane, accomplished.) It’s a privilege to have the chance to hear from him. (He’ll be speaking next week in the entrepreneurship course that Greg Gottesman and I teach – he is ALWAYS the favorite guest of the students in the course.)

This is DEFINITELY worth turning out for – a real opportunity.

February 3, 2016

CSE Colloquium upcoming lectures

Reminder, CSE majors: We host many interesting talks, such as the one below. If you want to learn about more upcoming lectures, find a calendar and a mailing list online:
http://www.cs.washington.edu/events/colloq_info

– – –
Happy New Year!  We’re kicking off our winter colloquium with this talk – please join us!

SPEAKER:   George Varghese, Microsoft Research
TITLE:     Network Verification and Synthesis – When Hoare Meets Cerf
DATE:      Tuesday, January 5, 2016
TIME:      3:30pm
PLACE:     EEB-105
HOST:      Tom Anderson

ABSTRACT:
Surveys reveal that network outages are prevalent, and that many outages take hours to resolve, resulting in significant lost revenue. Many bugs are caused by errors in configuration files which are programmed using arcane, low-level languages, akin to machine code. Taking our cue from
program and hardware verification, we suggest fresh approaches. I will first describe a geometric model of network forwarding called Header Space. While header space analysis is similar to finite state
machine verification, we exploit domain-specific structure to scale better than off-the shelf model checkers.   Next, I show how to exploit physical symmetry to scale network verification for large data centers. While Emerson and Sistla showed how to exploit symmetry for model checking in
1996, they exploited symmetry on the logical Kripke structure.

While the first part of the talk is about analysis, I will then describe our work in synthesis.   I will set the stage by describing a new re-configurable router architecture we proposed called RMT. This has led
to an emerging language for programming routers called P4 that promises to extend the boundaries of Software Designed Networks. I will then describe a synthesis problem for flexible routers, akin to code generation (packet transactions) and new algorithmic questions related to synthesizing routes
in the face of uncertainty. (With collaborators at Edinburgh, MSR, MIT,Stanford, and University of
Washington.)

BIOGRAPHY
George Varghese received his Ph.D. in 1992 from MIT. From 1993-1999, he was a professor at Washington University, and at UCSD from 1999 to 2013. He was the Distinguished Visitor in the computer science department at Stanford University from 2010-2011. He joined Microsoft Research in 2012.

His book “Network Algorithmics” was published in December 2004 by Morgan-Kaufman. In May 2004, he co-founded NetSift, which was acquired by Cisco Systems in 2005. With colleagues, he has won best paper awards at SIGCOMM (2014), ANCS (2013), OSDI (2008), PODC (1996), and the IETF
Applied Networking Prize (2013). He has won lifetime achievement awards in networking from the EE community (2014 Kobayashi Award) and the CS Community (2014 SIGCOMM Award).  He won the IIT Bombay Distinguished Alumni Award in 2015. Refreshments to be served in room prior to talk.

*NOTE* This lecture will be broadcast live via the Internet. See
http://www.cs.washington.edu/news/colloq.info.html for more information.

January 4, 2016

John Markoff’s talk on Thursday at 3:30

———- Forwarded message ———-
From: Ed Lazowska <lazowska@cs.washington.edu>
Date: Wed, Dec 16, 2015 at 2:16 PM
Subject: [cs-ugrads] John Markoff’s talk on Thursday at 3:30
To: “cs-ugrads@cs.washington.edu” <cs-ugrads@cs.washington.edu>
A reminder that Pulitzer Prize winning New York Times journalist and author John Markoff will be speaking on Thursday at 3:30 in the Microsoft Atrium of the Paul G. Allen Center for Computer Science & Engineering.

John will speak about topics from his most recent book, “Machines of Loving Grace,” which addresses a long-standing schism in Artificial Intelligence: whether the ultimate objective is to augment human intellect, or to replace it.

Information here:

http://www.cs.washington.edu/events/colloquia/details?id=2790

December 16, 2015

Alan Eustace, 3:30 today in the Atrium

 

———- Forwarded message ———-
From: Ed Lazowska <lazowska@cs.washington.edu>
Date: Tue, Dec 8, 2015 at 7:16 AM
Subject: [cs-ugrads] Alan Eustace, 3:30 today in the Atrium
To: “cs-ugrads@cs.washington.edu” <cs-ugrads@cs.washington.edu>
Alan Eustace, ex-Google Sr. VP of Engineering, will speak at 3:30 today in the CSE Atrium about his free-fall from 136,000 feet:

http://www.cs.washington.edu/events/colloquia/search/details?id=2775

Thursday: Jeannette Wing from Microsoft Research:

http://www.cs.washington.edu/events/colloquia/details?id=2792

Next Thursday: John Markoff from the New York Times:

http://www.cs.washington.edu/events/colloquia/details?id=2790

All of these talks will be GREAT for undergraduates as well as grads and faculty!

_______________________________________________

December 8, 2015

Three upcoming CSE Distinguished Lectures – please consider joining us!

 

———- Forwarded message ———-
From: Ed Lazowska <lazowska@cs.washington.edu>
Date: Wed, Dec 2, 2015 at 8:27 AM
Subject: [cs-ugrads] Three upcoming CSE Distinguished Lectures
To: “cs-ugrads@cs.washington.edu” <cs-ugrads@cs.washington.edu>
Yeah, it’s the end of the quarter, projects are due, exams are coming up … But we’ve got 3 CSE Distinguished Lectures coming up that ought to be really interesting – the first and the third even to friends of yours who are not super-technical:
Tuesday December 8, 3:30, CSE Atrium: Alan Eustace, ex-Google, on his free-fall parachute jump from 136,000 feet.

http://www.cs.washington.edu/events/colloquia/details?id=2775

Thursday December 10, 3:30, EEB 105: Jeannette Wing, Microsoft Research Corporate VP, on Microsoft Research.

http://www.cs.washington.edu/events/colloquia/details?id=2792

Thursday December 17, 3:30, CSE Atrium: John Markoff, NY Times, on his newest book, “Machines of Loving Grace.”

http://www.cs.washington.edu/events/colloquia/details?id=2790

_______________________________________________

December 2, 2015

Bob Colwell, Formerly DARPA and Intel “Our Computer Systems Are Not Good Enough”

Ugrads are invited to Dept talks, you can get on the list to hear about all of them, but this is the distinguished lecture series, so you may want to take note of this one in particular.

Just be aware that if you do NOT attend the talk, we don’t want to see you at the reception afterwards, that’s just grounds for ticking off your advising staff… so please be considerate as always.

UNIVERSITY OF WASHINGTON
Computer Science and Engineering
*DISTINGUISHED LECTURE*

SPEAKER:   Bob Colwell, Formerly DARPA and Intel

TITLE:     Our Computer Systems Are Not Good Enough

DATE:      Thursday, November 19, 2015
TIME:      3:30pm
PLACE:     EEB-105
HOST:      Luis Ceze

ABSTRACT:
We have all been following the dictum of Moore’s Law for longer than most
engineers have been alive. Our focus on functionality, performance, and
economics has yielded remarkable systems, from today’s smartphones to
supercomputers and internet servers, to engine controllers, anti-lock
brakes, airbags, and navigation systems in our vehicles.

But software is notoriously buggy, and hardware isn’t defect-free, either.
Worse, we seem to only take security into account when some hacker
perpetrates yet another outrage. The pending end of Moore’s Law will
greatly diminish the historical demand to replace systems every few years,
which will put new pressure on system aging effects. Our military is using
these same commercial systems, because they are the highest performance,
most economical solutions, but this means that they, too, are now exposed
to the same problems. By one estimate, more than half of automotive
recalls are due to software defects. And here come self-driving cars,
which could potentially have ALL of these threat axes simultaneously.

Performance and efficiency enable new applications, and in the past, the
computer design community could simply stop when those targets were within
reach. In this talk, I will argue that we cannot get away with that any
longer, and need to turn our attention to areas of system design that are
not good enough for how those systems will be used in the near future.
I’ll also discuss some ideas on how to accomplish this without incurring
additional development or product costs.

Bio:
Bob Colwell was Director of DARPA’s Microsystems Technology Office from
2012 – 2014. Previously, he was Intel’s chief IA32 (Pentium)
microprocessor architect from 1992-2000. He was named the Eckert-Mauchly
award winner for 2005. Elected to the National Academy of Engineering in
2006 “for contributions to turning novel computer architecture concepts
into viable, cutting-edge commercial processors”, he is also a member of
the American Academy of Arts and Science. He was named an Intel Fellow in
1996, and an IEEE Fellow in 2006. Colwell was a CPU architect at VLIW
mini-supercomputer pioneer Multiflow Computer, a hardware design engineer
at workstation vendor Perq Systems, and a member of technical staff at
Bell Labs. He has published many technical papers and journal articles, is
inventor or co-inventor on 40 patents, and has participated in numerous
panel sessions and invited talks. He is the Perspectives editor for IEEE
Computer Magazine, wrote the At Random column 2002-2005, and is author of
The Pentium Chronicles. He is currently an independent consultant. Colwell
holds the BSEE degree from the University of Pittsburgh, and the MSEE and
PhD from Carnegie Mellon University.

Reception to take place in the Atrium, Paul G Allen Center for Computer
Science & Engineering *after* the talk.

*NOTE* This lecture will be broadcast live via the Internet. See
http://www.cs.washington.edu/news/colloq.info.html for more information.

Email: talk-info@cs.washington.edu
Info: http://www.cs.washington.edu/
(206) 543-1695

The University of Washington is committed to providing access, equal
opportunity and reasonable accomodation in its services, programs,
activities, education and employment for individuals with disabilities.
To request disability accommodation, contact the Disability Services
Office at least ten days in advance of the event at: (206) 543-6450/V,
(206) 543-6452/TTY, (206) 685-7264 (FAX), or email at
dso@u.washington.edu.

November 18, 2015

« Newer PostsOlder Posts »