REMINDER: MICDE Seminar: Charles Leiserson, MIT, “What the ____ is Parallelism? (And Why Should Anyone Care)?” — March 23

By | Educational, Events

Many people bandy about the notion of “parallelism,” saying such things as, “This optimization makes my application more parallel,” with only a hazy intuition about what they’re actually saying. Others cite Amdahl’s Law, which provides bounds on speedup due to parallelism, but which does not actually quantify parallelism. In this talk, Prof. Leiserson will review a general and precise quantification of parallelism provided by theoretical computer science, which every computer scientist and parallel programmer should know. He will argue that parallel-programming models should eschew concurrency and encapsulate nondeterminism. Finally, he’ll discuss why the impending end of Moore’s Law — the economic and technological trend that the number of transistors per semiconductor chip doubles every two years — will bring new poignancy to these issues.

There will be a reception afterwards in the third floor alcove of the Beyster building for people who attend this seminar, or the CSE Distinguished Lecture featuring Rosalind Picard, Founder and Director of the Affective Computing Research Group, Professor of Computer Science and Engineering, Massachusetts Institute of Technology. More information on that event is available on the CSE web site.

What the $#@! Is Parallelism? (And Why Should Anyone Care?)

3 – 4 p.m., Monday, March 23
Cooley G906

Charles E. Leiserson received his B.S. from Yale University in 1975 and his Ph.D. from Carnegie Mellon University in 1981.  He is currently Professor of Computer Science and Engineering at MIT, where he holds the position of Edwin Sibley Webster Professor in MIT’s Department of Electrical Engineering and Computer Science (EECS).  He is a Margaret MacVicar Faculty Fellow, the highest recognition at MIT for undergraduate teaching.  He is a member of MIT’s Computer Science and Artificial Intelligence Laboratory (CSAIL), a member of the Lab’s Theory of Computation Group (TOC), and head of the Lab’s Supertech Research Group.  Professor Leiserson is an ACM Fellow, a AAAS Fellow, and a senior member of IEEE and SIAM.

He is coauthor of Introduction to Algorithms (The MIT Press), one of the most cited publications in computer science.  ​He​​ has received numerous awards, including the 2013 ACM Paris Kanellakis Theory and Practice Award, the 2014 IEEE Taylor L. Booth Education Award, and the 2014 ACM-IEEE Computer Society Ken Kennedy High-Performance Computing Award.  Among his research contributions are the retiming method of digital-circuit optimization, the fat-tree interconnection network, the notion of cache-oblivious algorithms, and the Cilk multithreaded programming technology.  His current research centers on software performance engineering: how to engineer code that runs fast​ and consumes a small memory footprint.

The Data Incubator accepting applications for Summer Data Science Fellowships

By | Educational, Events, Funding Opportunities

Program: The Data Incubator is an intensive six-week fellowship that prepares masters, PhDs, and postdocs in STEM + social science fields seeking industry careers as data scientists. The program is supported by sponsorships from dozens of employers across multiple industries. In response to the overwhelming interest in our earlier sessions, we will be holding another fellowship.

Locations: There will be both an in-person (in NYC, DC, SF) and online section of the fellowship.

Dates: All sections will be from 2015-06-01 to 2015-07-17

Who should apply: Anyone within one year of graduating from a masters or PhD program or who has already obtained a masters or PhD is welcome to apply . Applications from international students welcome. There is a common application for both the online and in-person sections. Everyone else is encouraged to sign-up for a future session.

For additional information, checkout the organization’s website, blog , Venture Beat article, or Harvard Business Review piece.

Workshop: Mapping Strategies for Complex Data — March 11

By | Educational, Events

Justin Joque, U-M Library’s visualization librarian, is offering a workshop titled “Mapping Strategies for Complex Data.”

Time: 2 – 3:30 p.m.

Date: Wednesday, March 11

Location: Shapiro Instructional Lab, 4041 Shapiro Library

Description: This workshop will explore how to visualize complex geographic data. While it is relatively straightforward to map one variable, working with multiple variables in a way that is visually comprehensible quickly becomes difficult. We will work with some complex data and discover strategies to deal with various types of data. This workshop will be most helpful for those with some ArcGIS for Desktop experience.

More information and registration: Workshop web page.


CSE Lecture: Rosalind Picard, MIT, “Emotion Technology, Wearables, and Surprises” — March 23

By | Educational, Events

Dr. Rosalind Picard, founder and director of the Affective Computing Research Group at the Massachusetts Institute of Technology, will present a talk titled “Emotion Technology, Wearables, and Surprises,” at 4:30 p.m. on March 23 in the Beyster Buidling on North Campus.

The talk is sponsored by the Department of Computer Science and Engineering. For more information, visit the event web page.

SC15 conference seeks student volunteers — June 1 application deadline

By | Educational, Events

The SC15 conference in Austin, Texas, in November is taking applications for student volunteers. The deadline to apply is June 1.

Conference organizers say they are accepting an increased number of students from the U.S. and internationally. Student volunteers can attend tutorials, technical talks, panels, poster sessions, and workshops.

For information on how to apply, visit the SC15 Student Volunteer web page, or email