Computer Science Senior Judy Mou has been working with K. Mani Chandy and Julian Bunn to develop an Android phone and tablet application that could be used to keep communities informed about crisis situations, such as local earthquakes, fires, and pollution hazards. Her application, called a situational awareness application, combines this hazard information with dynamically updated, individualized content, such as traffic on the user's commute, campus events, or news feeds that the user has subscribed to. "The test-case for the application that she is building is whether her classmates and housemates use the application," Chandy says. "She knows that she is building something valuable, and she's excited about it. That's one of the things I like best about working with her." [Learn More]
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]
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.
Caltech Welcomes Professor Chandrasekaran
Venkat Chandrasekaran, Assistant Professor of Computing and Mathematical Sciences, arrived at Caltech in early September 2012. His area of research is mathematical optimization. He describes, "Almost anything we wish to do in engineering design is about maximizing objectives subject to certain constraints—trading off different aspects of a system to optimize a few others. For instance, if you work in jet-engine design, you have certain constraints in the amount of material you can use, the weight of these materials, aerodynamic issues, etc. But then you want to be able to design your wings and so on in such a way that you maximize, for example, how fast you are able to go. My specific focus deals with trying to look at optimization problems that (a) are tractable to solve—not all optimization problems are ones that can be efficiently solved on a computer—and (b) arise in the information sciences." [Caltech Release]