Google Tech Talks
June 17, 2008
ABSTRACT
Google University Inaugural Lecture: Expanding the Frontiers of Computer Science
Enrollments in undergraduate Computer Science programs nationwide have declined drastically in the past half decade and there is now a real crisis in the pipeline of students being prepared for careers in computing. Mehran Sahami, Google Research Scientist and Professor and ociate Chair for Education in the Computer Science Department at Stanford University, will examine some of the factors affecting enrollments in CS, analyzing both historical and current trends. He will also discuss the significant changes that have been made in Stanford’s undergraduate CS program which aim to expand the scope of education in computer science and highlight the diversity of options available in the field
Speaker: Mehran Sahami
Duration : 0:54:36
Google Tech Talks
December, 5 2007
DomainKeys Identified Mail (DKIM) is an emerging IETF standard (RFC
4871) to authenticate sending domains in SMTP mail. It is designed
to be scalable, extensible, back-compatible, and adoptable without
any flag days.
This talk will cover the background of sender domain authentication
in general and DKIM in particular, details of how DKIM works, and
other issues that DKIM brings up, notably sender accreditation and
reputation and receiver policy. Sendmail’s Open Source
implementation of DKIM will also be discussed.
Speaker: Eric Allman
As Sendmail’s Chief Science Officer and co-founder, Eric Allman leads the company’s technology strategy and direction. Allman authored sendmail, the world’s first Internet Mail program, in 1981 while at the University of California at Berkeley. He continues to spearhead sendmail.org, the global team of volunteers that maintain and support the sendmail Open Source platform.
At the forefront of industry-leading trends and technology, Allman is currently a leader of the movement to adopt an international standard for Sender Domain Authentication. Allman, backed by a cross-industry group of companies (Cisco, Yahoo, PGP, et. al.), co-authored the draft specification for DomainKeys Identified Mail (DKIM), and submitted it to the Internet Engineering Task Force (IETF).
Before joining Sendmail, Allman served as CTO for Sift, Inc., which is now part of 24/7 Media, Inc. He was lead developer and provided a large-scale research software infrastructure on the Mammoth project at U.C. Berkeley. Allman has contributed as a senior developer at the International Computer Science Institute to neural network systems design. Allman was also Chief Programmer on the INGRES Relational Database Management System and an early contributor to Berkeley UNIX, authoring syslog, tset, the troff -me macros, and trek in addition to sendmail. For several years, he has co-authored the “C Advisor” column for UNIX Review magazine. He was formerly a member of the Board of Directors of USENIX ociation and is currently a member of the ACM Queue Editorial Review Board.
Allman holds an Masters of Science degree in Computer Science from the University of California at Berkeley.
Duration : 0:52:57
Google Tech Talks
January, 25 2008
ABSTRACT
In this talk we examine how high performance computing has changed
over the last 10-year and look toward the future in terms of trends.
These changes have had and will continue to have a major impact on our
software. A new generation of software libraries and algorithms are
needed for the effective and reliable use of (wide area) dynamic,
distributed and parallel environments. Some of the software and
algorithm challenges have already been encountered, such as management
of communication and memory hierarchies through a combination of
compile–time and run–time techniques, but the increased scale of
computation, depth of memory hierarchies, range of latencies, and
increased run–time environment variability will make these problems
much harder.
We will focus on the redesign of software to fit multicore architectures.
Speaker: Jack Dongarra
University of Tennessee
Oak Ridge National Laboratory
University of Manchester
Jack Dongarra received a Bachelor of Science in Mathematics from Chicago State University in 1972 and a Master of Science in Computer Science from the Illinois Institute of Technology in 1973. He received his Ph.D. in Applied Mathematics from the University of New Mexico in 1980. He worked at the Argonne National Laboratory until 1989, becoming a senior scientist. He now holds an appointment as University Distinguished Professor of Computer Science in the Electrical Engineering and Computer Science Department at the University of Tennessee, has the position of a Distinguished Research Staff member in the Computer Science and Mathematics Division at Oak Ridge National Laboratory (ORNL), Turing Fellow in the Computer Science and Mathematics Schools at the University of Manchester, and an Adjunct Professor in the Computer Science Department at Rice University.
He specializes in numerical algorithms in linear algebra, parallel computing, the use of advanced-computer architectures, programming methodology, and tools for parallel computers. His research includes the development, testing and documentation of high quality mathematical software. He has contributed to the design and implementation of the following open source software packages and systems: EISPACK, LINPACK, the BLAS, LAPACK, ScaLAPACK, Netlib, PVM, MPI, NetSolve, Top500, ATLAS, and PAPI. He has published approximately 200 articles, papers, reports and technical memoranda and he is coauthor of several books. He was awarded the IEEE Sid Fernbach Award in 2004 for his contributions in the application of high performance computers using innovative approaches. He is a Fellow of the AAAS, ACM, and the IEEE and a member of the National Academy of Engineering.
Duration : 0:55:54
Google Tech Talks
June, 4 2008
ABSTRACT
We present a novel technique that speeds up state-space exploration
(SSE) for evolving programs with dynamically allocated data. SSE is
the essence of explicit-state model checking and an increasingly
popular method for automating test generation. Traditional,
non-incremental SSE takes one version of a program and systematically
explores the states reachable during the program’s executions to nd
property violations. Incremental SSE considers several versions that
arise during program evolution: reusing the results of SSE for one
version can speed up SSE for the next version, since state spaces of
consecutive program versions can have significant similarities. We
have implemented our technique in two model checkers: Java PathFinder
and the J-Sim state-space explorer. The experimental results on 24
program evolutions and exploration changes show that for non-initial
runs our technique speeds up SSE in 22 cases from 6.43% to 68.62%
(with median of 42.29%) and slows down SSE in only two cases for
-4.71% and -4.81%.
Joint work with Steven Lauterburg, Ahmed Sobeih, and Mahesh Viswanathan
Speaker: Darko Marinov
Darko Marinov is an istant Professor in the Department of
Computer Science at the University of Illinois at Urbana-Champaign. He
obtained his Ph.D. from MIT in 2005. His main research interests are in
Software Engineering, with focus on improving software reliability using
software testing and model checking. His work is supported by NSF and
Microsoft.
Duration : 0:27:47
Google Tech Talks
September 2, 2008
ABSTRACT
In recent years, cloud computing has emerged as an attractive tool for delivering web-based services. Cloud computing enables rapid deployment of new services and allows those services to scale dynamically, in response to changing user demand. However, the range of cloud computing applications is constrained by limitations of the Internet service model. New network level services are needed to enable advanced applications that include real-time, person-to-person communication. This talk discusses how to add a dynamic network layer to cloud computing infrastructures, to enable the rapid introduction of new network services in support of advanced applications.
Speaker: Jonathan S. Turner
Jonathan S. Turner received the MS and PhD degrees in computer science from Northwestern University in 1979 and 1981. He holds the Barbara and Jerome Cox Chair of Computer Science at Washington University, is Chairman of the Department of Computer Science and Engineering and Director of the Applied Research Lab. The Applied Research Laboratory creates experimental networking technology to validate and demonstrate new research innovations. The Lab’s current projects center on extensible networking technology with a particular focus on high performance platforms for overlay hosting services.
Professor Turner served as Chief Scientist for Growth Networks, a startup company that developed scalable switching components for Internet routers and ATM switches, before being acquired by Cisco Systems in early 2000.
Turner is a member of the National Academy of Engineering, a fellow of ACM and a fellow of the IEEE. He received the Koji Kobayashi Computers and Communications Award from the IEEE in 1994 and the IEEE Millenium Medal in 2000. He has been awarded 30 patents for his work on switching systems and has many widely cited publications.
Duration : 1:9:21
Google Tech Talks
June, 19 2008
ABSTRACT
Digital tools for annotation of video have the promise to provide immense value to researchers in disciplines ranging from psychology to computer science to ethnography. With the traditional methods for annotation being bersome, time-consuming, and frustrating, technological solutions are situated to aid in video annotation by increasing reliability, repeatability, and workflow optimizations. Three notable limitations of existing video annotation tools are lack of support for the annotation workflow, poor representation of data on a timeline, and poor interaction techniques with video, data, and annotations. Our model is a new system called VCode and VData. The benefit of our system is that is directly addresses the workflow and needs of both researchers and video coders.
Speaker: Josh Hailpern canditate
Joshua Hailpern is currently a Ph.D. candidate at the University of Illinois at Urbana-Champaign in the Computer Science Department focusing on Human Computer Interaction. He thesis work revolves around encouraging speech and vocalization in low functioning children with Autism. He attended Carnegie Mellon University in Pittsburgh, PA, majoring in Computer Science and minoring in Music Technology and graduated with a Bachelor of Science degree with Honors in May 2006.
Duration : 0:41:2