4:15 pm in Science 3821
Refreshments served at 4:00 pm in the CS Commons.
Blake Creasey '16 will present: "IBM Watson & Innovation in New York City."
This summer I went to New York City for seven weeks to learn about IBM Watson and engineering entrepreneurship at the Cooper Union. Our IBM mentor taught us about the brand of Watson, how pieces of the technology work, and current implementations of the technology. We met with our client, the New York Public Library, to understand a problem in their book recommendation system, and we set out trying to use the Watson Experience Manager to build a solution. We interviewed potential users, reviewed existing survey data, extensively discussed technological feasibility, met with current IBM Watson business partners, and finally built an iPhone book recommendation application using IBM Watson's natural language processing capabilities. My main focus in this talk will be on IBM Watson and our prototype iPhone application, Shelf. I will also briefly discuss the companies that I toured-Google, Bloomberg, Microsoft, Gamechanger, IBM Watson's Experience Center-and the meetups that I attended. Thanks to the Wilson Program, I hope to share what I learned about innovation, and I hope to discuss my general impressions on what is happening with innovation-the cool, the incredible, the scary, and the future.
Peter-Michael Osera and Charlie Curtsinger will discuss graduate programs in computer science.
Snacks will be available in the CS Commons at 4:00 p.m.
On Wednesday, September 23, Dr. Ursula Wolz gives a talk on two of her research projects: "Does Learning Computer Science Require a Teacher? Reflections on Automated Tutors and Learning Communities."
On Thursday, September 24, our own Samuel Rebelsky gives a short talk: "Scripting GIMP with Racket."
Both talks are in Science-3821 at 4:15 PM, preceded by refreshment in the CS Commons at 4:00.
Ursula Wolz will be teaching at Grinnell as a Noyce Visiting Professor in Spring 2016. Dr. Wolz is currently involved in two projects, one to create a very robust mechanical tutor using a sophisticated rule base, the other to create face-to-face communities of coders that remove, or at least reduce, the technology divide. She will provide a quick overview of both projects, and then invite stimulating discussion of the major technological and ethical issues involved.
Professor Rebelsky's talk is practice for an upcoming presentation at RacketCon in St. Louis. The GNU Image Manipulation Program, or GIMP, is an open-source alternative to Photoshop. In the early days of GIMP, the designers added a scripting language, Script-Fu, based on Scheme. Over the years, Script-Fu has been superseded by Python-Fu, although Script-Fu remains an option, albeit with a primitive IDE. Over the past few years, my students and I have built a library that allows programmers to script GIMP using Racket and the DrRacket IDE. In addition to providing the “glue” between GIMP and Racket, we also added a library of routines more amenable to novice programmers. In this talk, we will discuss the design of both the “glue” and the broader library. We will also discuss a related introductory course in CS that uses multiple models of image making as the motivating problem domain.
Our topic at this week's Computer Science Table will be software vulnerabilities in cars, as described in this article:
Gallagher, Sean. Highway to Hack: Why We're Just at the Beginning of the Auto-Hacking Era. Ars Technica, August 13, 2015.
Computer Science table (CS Table) is a weekly meeting of Grinnell College community members (students, faculty, staff, etc.) interested in discussing topics related to computing and computer science. CS Table meets Tuesdays from 12:00 to 12:45 in Rosenfield 224C. Contact the CS faculty for the weekly reading. Students on meal plans, faculty, and staff are expected to cover the cost of their meals. Visitors to the College and students not on meal plans can charge their meals to the department.
On Thursday, September 10, Reilly Noonan Grant 2018, Alex French 2017, Bazil Mupisiri 2018, and Logan Goldberg 2018 will present their summer 2015 work on projects for the maintenance and improvement of MathLAN:
We shall describe the various projects completed to improve the computer science department’s MathLAN systems over the summer and give an overview of the field of system administration. MathLAN’s operating system is GNU/Linux, a free software, which gives the user more control over the computer. This made the course very open-ended. As such, the projects completed are varied and relate to many different aspects of system administration. The more noticeable effects of these projects are an improvement in the MathLAN login screen, and a revision of the CS website, yet to be implemented.
At 4:00 p.m., refreshments will be served in the Computer Science Commons. The talk, “GNU/Linux System Administration Projects,” will begin at 4:15 p.m. in Noyce 3821. Everyone is welcome to attend!
This week at CS Table, we will consider a recent article on the potential power of Google to swing elections:
Rogers, Adam (2015). “Google's Search Algorithm Could Steal the Presidency.” Available on line at http://www.wired.com/2015/08/googles-search-algorithm-steal-presidency.
IMAGINE AN ELECTION -- A close one. You're undecided. So you type the name of one of the candidates into your search engine of choice. (Actually, let's not be coy here. In most of the world, one search engine dominates; in Europe and North America, it's Google.) And Google coughs up, in fractions of a second, articles and facts about that candidate. Great! Now you are an informed voter, right? But a study published this week says that the order of those results, the ranking of positive or negative stories on the screen, can have an enormous influence on the way you vote. And if the election is close enough, the effect could be profound enough to change the outcome.
In other words: Google's ranking algorithm for search results could accidentally steal the presidency. “We estimate, based on win margins in national elections around the world,” says Robert Epstein, a psychologist at the American Institute for Behavioral Research and Technology and one of the study's authors, “that Google could determine the outcome of upwards of 25 percent of all national elections.”
Those of you who want to delve more deeply into the issue can read (or skim) the full journal article:
Epstein, Robert, and Robertson, Ronald E. (2015). “The Search Engine Manipulation Effect (SEME) and Its Possible Impact on the Outcomes of Elections.” Proceedings of the National Academy of Sciences, 112 (33). Available on line at http://www.pnas.org/content/112/33/E4512.abstract.
Internet search rankings have a significant impact on consumer choices, mainly because users trust and choose higher-ranked results more than lower-ranked results. Given the apparent power of search rankings, we asked whether they could be manipulated to alter the preferences of undecided voters in democratic elections. Here we report the results of five relevant double-blind, randomized controlled experiments, using a total of 4,556 undecided voters representing diverse demographic characteristics of the voting populations of the United States and India. The fifth experiment is especially notable in that it was conducted with eligible voters throughout India in the midst of India’s 2014 Lok Sabha elections just before the final votes were cast. The results of these experiments demonstrate that (i) biased search rankings can shift the voting preferences of undecided voters by 20% or more, (ii) the shift can be much higher in some demographic groups, and (iii) search ranking bias can be masked so that people show no awareness of the manipulation. We call this type of influence, which might be applicable to a variety of attitudes and beliefs, the search engine manipulation effect. Given that many elections are won by small margins, our results suggest that a search engine company has the power to influence the results of a substantial number of elections with impunity. The impact of such manipulations would be especially large in countries dominated by a single search engine company.
Computer Science Table is a weekly meeting of Grinnell College community members (students, faculty, staff, etc.) interested in discussing topics related to computing and computer science. CS Table meets Tuesdays from 12:00-12:45 in JRC 224C. Contact the CS faculty for the weekly reading. Students on meal plans, faculty, and staff are expected to cover the cost of their meals. Visitors to the College and students not on meal plans can charge their meals to the department.
The Computer Science majors of the class of 2015 are:
Congratulations to all!
On Thursday, April 30, Brooks Davis (Senior Software Engineer, SRI International) will describe a proposed processor architecture to support memory-safe programming:
The C programming language (combined with C++) is used to implement all important modern operating systems and the runtimes of most higher level programming languages. Despite the ease of implementing serious security bugs in C, billions of lines of software is written in it and our daily lives depend on much of that software. It is surprising that all popular CPU architectures provide memory safety mechanisms substantially identical to those on the PDP-11 on which C was written in 1972! Our research aims to change that.
In this talk I provide an introduction to the conventional memory model of C and cover some of the problems this model causes. I will then discuss our solution, the CHERI CPU and our modified C compiler and how we took it from an early prototype to something that can bring memory safety to virtually all C code without code changes.
At 4:15 p.m., refreshments will be served in the Computer Science Commons. The talk, “Beyond the PDP-11: Architectural support for a memory-safe C abstract machine,” will begin at 4:30 p.m. in Noyce 3821. Everyone is welcome to attend!