An Engineering Art Exhibit
Hillary Mushkin, Visiting Professor of Art and Design in Mechanical and Civil Engineering, worked with a group of students taking her new media art history seminar (E/H/Art 89 - the first Caltech course cross-listed in engineering and humanities) to conceptualize, design and fabricate their own original new media artwork using technologies and fabrication methods of their own choice. Students created electroencephalogram (EEG) art, automatic drawing machines, conceptual art-inspired visualizations of mathematical concepts, interactive video projections, electronic instruments and other novel forms. [Photos of the exhibit]
International Scholarship Focused on Engineering Global Challenges Announced
The Caltech Division of Engineering and Applied Science and the USC Viterbi School of Engineering have established a new scholarship program, named after outgoing National Academy of Engineering (NAE) president Charles M. Vest at their institutions, along with six other universities around the country. "The Vest Scholarship is a superb opportunity for high-powered international graduate students to work with faculty and researchers who are international leaders in their engineering disciplines," says Chair Ares Rosakis. "At Caltech, due to its small size and strong interdisciplinary philosophy, the students will have the opportunity to work closely with not only these international leaders in engineering research, but also with their collaborators in all areas of science and technology." [Caltech Release] [Application Information]
Alumnus Receives 2012 Simons Graduate Fellowships in Theoretical Computer Science
Christopher Beck (BS '09 Computer Science and Mathematics) is a recipient of a 2012 Simons Graduate Fellowship. The fellowships are given to graduate students in theoretical computer science with outstanding track records of research accomplishments. Beck’s work seeks to establish the limits of how efficiently we can solve computational problems. One of his papers studies a popular class of algorithms known as SAT solvers and shows that if their memory is restricted, then they can require exponential running time. Another result concerns how well we can approximately sample from certain distributions when our computation must be small depth, that is, highly parallelizable. Beck and his co-authors showed that even exponentially large bounded depth circuits cannot sample with even exponentially small success from a certain simple distribution.