UCLA
Computer Science Department
Fall 2007
University of California, Los Angeles
Henry Samueli School of Engineering & Applied Science
Computer Science Department
4732 Boelter Hall
Los Angeles, CA 90095-1596
1
Message From the Chair
I
w
would like to share with you some of
tthe Computer Science Department’s
progress and achievements during the
pro
200
2006-2007 academic year. It has been
busy year: the ABET accreditation
a b
rev
review of our undergraduate programs
in ffall 2006 was followed by the UCLA
Academic Senate’s review of the departAc
ment in winter 2007 (reviews are conme
duc
ducted every six and eight years, respectively)
rep
tively). I am glad to report
that both the computer science
and the computer science and engineering (CS&E) programs
successfully passed the ABET review. The Academic Senate
review, performed by a panel of internal reviewers (outside
CS) and external experts from other top CS departments, was
also very positive, concluding with: “The state of the computer science department is strong, and improving in all aspects.
Faculty research, graduate student training and research, and
undergraduate teaching are all top-notch….”
With the successful addition of 16 new faculty members since
2000, the department now has 41 tenured or tenure-track faculty. In 2005 we initiated an active program to reach out to
other departments on campus via joint appointments of faculty. I am pleased to announce that within the past year professors Tony Chan from Mathematics and Mani Srivastava from
Electrical Engineering were selected for joint appointments
in the Computer Science Department. Both have received
numerous awards and are world-renowned leaders in their respective fields. Their profiles are featured on pages 2 and 3.
The department continues to expand its research programs
with more than thirty labs and research groups, and three major research centers; these centers are highlighted on pages 4
through 6. To facilitate the close interaction of various disciplines within computer science and engineering, we have
also organized the department’s research activities into four
interdisciplinary research clusters. These clusters, as well as
selected research results, are highlighted on pages 16 through
21. Because of these expanding research programs, we received a large number of new research contracts and grants
during the 2006-2007 academic year, and our total research
expenditure was around $10 million.
Also included in this report is a sampling of recent publications authored by our faculty that showcases the wide range of
research activities in the department (pages 22 to 27). When
it comes to measuring the impact of such research publications, citations are a commonly used metric. We’ve included an analysis (page 28) of the citation record of our faculty
members, and are very pleased to see that the department
stands out among the very best in terms of various metrics—
total citations, top citation rankings in various fields, and the
recently introduced h-index.
After several years of decline and stabilization, we are now
seeing a significant increase (around 70%) in our undergraduate enrollment, with 133 incoming freshmen and 72 transferring students starting in fall 2007. The total undergraduate
population is 568, with 132 B.S. degrees awarded in the past
academic year. Our graduate enrollment has also increased,
with 304 students (over 60% in the Ph.D. program), and 46
M.S. and 27 Ph.D. degrees awarded. Many of our recent
Ph.D. graduates have embarked on new careers at major universities, leading research laboratories, large industry leaders
and promising start-ups (page 32).
Our faculty received many diverse prizes, honors and awards
during 2006-2007. Among these were the Anita Borg
Women of Vision Award, a Lifetime Contribution Award,
a Northrop Grumman Excellence in Teaching Award, and a
Sloan Fellowship. Additionally, three of our faculty members
received honorary doctorates, and four were elected to Fellow
in organizations such as the Association for the Advancement
of Artificial Intelligence (Adnan Darwiche), the Biomedical
Engineering Society (Joseph DiStefano), the Association for
Computing Machinery (Lixia Zhang), and the prestigious
American Academy of Arts and Sciences (Deborah Estrin).
These recognitions are highlighted on page 31.
The department’s industrial affiliate program has also grown
significantly in the past year (page 37), and both the department and its member companies have been enriched by the
close interaction. This year, we are also offering a pilot program for affiliate gold members to propose and mentor senior student projects under the departmental honor program.
We encourage interested parties to contact chair@cs.ucla.edu
for more details.
Finally, I want to take this opportunity to thank the department’s faculty, staff, students and alumni; our federal, state
and industrial sponsors; and our many other collaborators for
their hard work and contributions. Their efforts have culminated in the great success we’ve experienced in this past year.
Jason (Jingsheng) Cong
Chair, Computer Science Department
September 2007
Department Statistics
CS Department Mission Statement
The Computer Science Department strives for excellence in creating, applying, and imparting knowledge in
computer science and engineering through comprehensive educational programs, research in collaboration with
industry and government, dissemination through scholarly publications, and service to professional societies, the
community, the state, and the nation.
Percentage of Graduate Students Per CS Field
Software Systems
17%
Artificial Intelligence
Computational Systems
12%
Biology
3%
Computer Networks
20%
Information & Data
Management
13%
Graphics & Vision
Computer System
12%
Architecture & CAD
Computer Science Theory
17%
6%
Faculty and Staff
Ladder Faculty
Joint Faculty
Emeriti Faculty
Adjunct Faculty
Department Staff
Undergraduate Students
36
5
11
6
15.5
Students Enrolled
Applicants (06/07)
Admitted (06/07)
New Enrolled
Avg Freshman GPA
505
1509
342
109
4.14
Graduate Students
Students Enrolled
Applicants (06/07)
Admitted (06/07)
New Enrolled
Acceptance Rate
283
729
215
97
45%
1
New Faculty
P
Professor
Tony F. Chan
JJoint Appointments: Mathematics & Bioengineering Departments
P
PhD—Stanford University, 1978
http://www.math.ucla.edu/~chan/
h
T
ony Chan joined the faculty of UCLA’s Computer Science Department in July 2007, while
also holding joint appointments with the Mathematics and Bioengineering Departments. A member
of UCLA’s faculty since 1986, he served as chair of
the Mathematics Department from 1997 to 2000,
as director of the Institute for Pure and Applied
Mathematics (IPAM) from 2000 to 2001, and as
dean of Physical Sciences from 2001 to 2006. His
current research interests include mathematical image processing and computer vision, VLSI physical
design and computational brain mapping.
Professor Chan received his B.S. and M.S. degrees
(engineering) from CalTech and his Ph.D. (computer science) from Stanford University. Prior to
joining UCLA, he taught at Yale and worked at
CalTech as a research fellow. He has published
over 200 papers and, according to ISIHighlyCited.
com, is among the most highly cited mathematicians.
As one of IPAM’s founders and directors, Professor Chan’s vision was to promote collaborations
between the mathematical sciences and the general
scientific and engineering disciplines. In his role
as dean of Physical Sciences, he had oversight of
more than 1600 faculty, graduate, and undergraduate students, and $70M in annual federal research
2
support. Currently, he is on temporary leave from
UCLA (2006 to 2008) while serving as assistant
director of the Directorate for Mathematical and
Physical Sciences at the National Science Foundation. The MPS Directorate encompasses five divisions—Astronomy, Chemistry, Materials Research,
Mathematical Sciences and Physics—and is the largest of NSF’s directorates, with an annual budget of
just over $1B.
Professor Chan is an active member of many scientific societies, including the Society of Industrial &
Applied Mathematics (a member of the Board of
Trustees), the American Mathematical Society, and
the Institute of Electrical & Electronic Engineers.
He has served on the editorial boards of many
journals in mathematics and is one of three editorsin-chief of Numerisch Mathematik. He is a former
member of NSF’s Mathematical and Physical Sciences Advisory Committee, is a current member of
the U.S. National Committee on Mathematics, and
represented the U.S. at the 2006 General Assembly
of the International Mathematics Union in Spain.
Additionally, Professor Chan has served on many
advisory committees for well-known scientific centers such as the Lawrence Livermore National Lab
and the Hausdorf Center for Math in Bonn.
New Faculty
Professor Mani Srivastava
Joint Appointment with the Electrical Engineering Department
PhD—University of California, Berkeley
http://www.ee.ucla.edu/~mbs/
M
ani Srivastava joined the faculty of UCLA’s
Computer Science Department in July 2007.
This is our first joint appointment with the Electrical Engineering Department where Professor
Srivastava has been a faculty member since 1997
and currently serves as the vice chair of graduate
affairs. Additionally, he is affiliated with the NSFsponsored Science and Technology Center for
Embedded Networked Sensing (CENS) where he
co-leads research in the systems area.
Professor Srivastava received his B.Tech. in electrical engineering from the Indian Institute of
Technology, Kanpur, and his M.S. and Ph.D. in
electrical engineering and computer science from
the University of California, Berkeley. His graduate work was in hardware-software co-design of
embedded and signal processing systems. After
finishing his graduate studies, he was with AT&T/
Lucent Bell Laboratories Research Division for
nearly five years where his work focused on wireless multimedia systems and mobile computing.
At UCLA Professor Srivastava’s research has been
at the intersection of wireless networking and embedded systems, focusing on energy-aware communications and computing, pervasive embedded
networked sensing, embedded software platforms
and tools, low-power wireless systems, and applications in medical, entertainment, personal, social,
and urban contexts. His research spans the technology, algorithms, and systems range, and has a
strong experimental thrust. Much of his research
has historically involved collaboration with various faculty members from the Computer Science
Department, particularly through the umbrella of
CENS. His current major research efforts include
network architecture support for participatory urban sensing applications, distributed image sensing
networks, and information and system integrity in
sensor networks. More details on his research can
be found at the web site for his Networked and
Embedded Systems Laboratory (NESL), http://
nesl.ee.ucla.edu.
Professor Srivastava’s research has been widely
published, and he is a co-inventor on several patents in wireless networking. Over the years he has
also received numerous awards and honors—the
President of India Gold Medal, the NSF CAREER
Award, the Okawa Foundation Grant, and awards
at various top conferences for best paper, demonstration, and design competitions. He has served as
program chair of ACM MobiHoc, ACM SenSys,
and IEEE/ACM IPSN. Additionally, he has been
on the editorial boards of IEEE Transactions on Mobile Computing and ACM Transactions on Sensor Networks, and served as the editor-in-chief of the ACM
Mobile Computing and Communications Review.
3
R
E
S
E
A
R
C
H
C
E
Center for Autonomous Intelligent Networks and Systems (CAINS)
http://www.cains.cs.ucla.edu
Lead Sponsors
Office of Naval Research (ONR)
National Science Foundation (NSF)
UCLA Director:
Scientific Board: (UCLA)
(ONR)
Mario Gerla
Rajive Bagrodia, Babak Daneshrad, Leonard Kleinrock,
Izhak Rubin, Mani Srivastava, John Villasenor
Clifford Anderson
The Center for Autonomous Intelligent Networks and Systems (CAINS) was established in 2001, with six laboratories
in the Computer Science and Electrical Engineering Departments of UCLA’s Henry Samueli School of Engineering
and Applied Science.
The Center’s mission is to serve as a forum for intelligent agent researchers and visionaries from academia, industry,
and government, with an interdisciplinary focus on such fields as engineering, medicine, biology and the social sciences. Information and technology will be exchanged through symposia, seminars, and short courses, and through
collaboration in joint research projects sponsored by the government and industry.
Many research projects are underway, including one that involves the development of technologies enabling unmanned
autonomous vehicles (UAVs) to communicate and behave in an intelligent, coordinated fashion without direct human
interaction. Current laboratory research includes work in the following areas:
Video network transport
Vision-based localization
Ad hoc multi-hop networking
Vehicular networks
Dynamic unmanned backbone
Mobile sensor platforms
Systolic OFDM radios
Adaptive transceivers
N
T
E
R
4
Collaborations:
• Biology-inspired systems (USC, Caltech)
• UAV navigation systems (UCB, MIT,
ACR)
• Learning systems (SRI)
• Mobile sensor platforms (Istituto Boella,
Torino)
• Autonomous agent-based systems (Univ.
of Trento, Italy)
• Large-scale disruption-tolerant wireless
networks (Boeing).
• Advanced MIMO systems (Raytheon)
Center for Embedded Networked Sensing (CENS)
R
E
S
E
A
R
C
http://research.cens.ucla.edu
Lead Sponsor: National Science Foundation (NSF)
Director: Deborah Estrin, 3531H Boelter Hall, UCLA – destrin@cs.ucla.edu
Deputy Director: Greg Pottie, 56-174G Engineering IV, UCLA – pottie@ee.ucla.edu
Administrative Director: David Avery, 3563 Boelter Hall, UCLA – avery@ucla.edu
Program Development Director: Jeff Goldman, 3563 Boelter Hall, UCLA – jgoldman@cens.ucla.edu
The Center for Embedded Networked Sensing (CENS) is a National Science Foundation Science and
Technology Center dedicated to developing wireless sensing systems and applying this revolutionary
technology to critical scientific and societal applications.
Expanding on the concept of the Internet, these large-scale distributed systems, composed of stationary and
robotic smart wireless sensors, are revealing previously unobservable phenomena and providing new insights
into the physical world.
At the heart of the Center are faculty, students, and staff drawn from a wide spectrum of disciplines: computer
science, electrical engineering, civil and environmental engineering, biology, and statistics. To date, this
team has developed and deployed some truly innovative systems:
H
• A disruption-tolerant long-haul network of seismometers that spans a transect across Mexico.
• The cable-based robotic sensing platform—NIMS, which can determine chemical fluxes across rivers
and characterize light patterns in the forest.
• A low-power wireless imaging system—Cyclops, that is being used to study bird nesting behavior.
• A unique web-accessible, searchable repository for sensor streams—SensorBase.
C
CENS includes multi-disciplinary research spanning information technology, science applications, education
and legal/social implications. CENS academic partner institutions include the University of Southern
California, UC Riverside, UC Merced, Caltech, and Loyola Marymount University.
E
Technologies
N
T
E
• Multi-scale actuated sensing
systems
• Systems infrastructure
• Micro/nano sensor
technology
• Statistics and data practice
Applications
• Terrestrial ecology observing
systems
• Aquatic microbial observing
systems
• Contaminant observation and
management
• Seismology
• Urban sensing
Education
• Pre-college science education
• Graduate and undergraduate
curriculum/programs
• Research internships for undergraduates and high school
students
• Education research
R
5
Center for Information & Computation Security
(CICS)
R
http://www.cs.ucla.edu/security
E
Director: Rafail Ostrovsky (rafail@cs.ucla.edu)
Associate Director: Amit Sahai (sahai@cs.ucla.edu)
S
E
A
R
C
H
C
E
N
T
he Center for Information & Computation Security (CICS) was founded in UCLA's Henry Samueli School of
Engineering and Applied Science in the fall of 2003 under the directorship of Professor Rafail Ostrovsky. In
2004 Professor Amit Sahai joined the leadership team to serve as associate director. Headquartered within the Computer Science Department, the Center's mission is to promote all aspects of research and education in cryptography
and computer security.
The Center explores novel techniques for securing both national and private-sector information infrastructures across
various network-based and wireless platforms, as well as wide-area networks. The inherent challenge in this work is
to provide guarantees of privacy and survivability under malicious and coordinated attacks. Meeting this challenge
is especially complex because solutions must achieve several conflicting goals. While making applications more accessible, ubiquitous, and widespread, any solution must also be resilient against a wide range of both internal and
external coordinated attacks, simultaneously providing strong privacy and security guarantees to both individuals and
organizations. The Center’s research directions include the following:
• Developing state-of-the-art cryptographic algorithms, definitions, and proofs of security.
• Developing novel cryptographic applications, such as new electronic voting protocols, identification
schemes, encryption schemes, data-rights management schemes, privacy-preserving data mining, searching on encrypted data, and searching with privacy.
• Developing the security mechanisms underlying a “clean-slate” design for a next-generation secure Internet.
• Developing novel biometric-based models and tools, such as encryption and identification schemes
based on fingerprint scans.
• Exploring the interplay of cryptography and security with other fields, including algorithms, complexity
theory, networks, communication complexity, machine learning, compiler and language design, operating systems, hardware design, and distributed computing.
The Center promotes both long-term foundational work and short-term applied research to support the development of cryptographic foundations and critical security tools and techniques. It has a cross-disciplinary nature and
an active research program.
T
E
R
Photos by Yves Rubin
6
Faculty: Artificial Intelligence
Adnan Darwiche, Professor, Ph.D.
(Stanford) 1993
Probabilistic and logical reasoning and
its applications, including diagnosis,
planning, and system design and analysis.
Richard Korf, Professor, Ph.D.
(CMU) 1983
Problem-solving, heuristic search,
planning and parallel processing in artificial intelligence.
Michael Dyer, Professor, Ph.D. (Yale)
1982
Processing and acquisition of natural
language through symbolic, connectionist and genetic algorithm techniques.
Judea Pearl, Emeritus Professor,
Ph.D. (Polytechnic Institute of Brooklyn) 1965
Artificial intelligence and knowledge
representation,
probabilistic and
causal reasoning, nonstandard logics,
and learning strategies.
Faculty: Computer System Architecture & CAD
Tony F. Chan, Professor, Ph.D. (Stanford) 1978
PDE methods in image processing,
computer vision and computer graphics, VLSI CAD, multigrid/domain
decomposition algorithms, iterative
and Krylov subspace methods, parallel algorithms. (Joint appointment with
Mathematics & Bioengineering)
Miodrag Potkonjak, Professor, Ph.D.
(Berkeley) 1991
Complex distributed systems, including embedded systems, communication designs, computer-aided design,
ad hoc sensor networks, computational security, electronic commerce, and
intellectual property protection.
Jason (Jingsheng) Cong, Professor and
Chair, Ph.D. (UIUC) 1990
Computer-aided design of VLSI circuits, computer architecture and reconfigurable systems, fault-tolerant designs
of VLSI systems, design and analysis of
algorithms.
Glenn Reinman, Assistant Professor,
Ph.D. (UCSD) 2001
Processor architecture design and optimization, speculative execution, profile-guided optimizations, techniques
to find and exploit instruction-level
parallelism.
Milos Ercegovac, Professor, Ph.D.
(UIUC) 1975
Computer arithmetic and hardwareoriented algorithms, design of digital
and reconfigurable systems.
Majid Sarrafzadeh, Professor, Ph.D.
(UIUC) 1987
Embedded and reconfigurable computing, VLSI CAD, and design and
analysis of algorithms.
7
Faculty: Computer System Architecture & CAD
Yuval Tamir, Associate Professor,
Ph.D. (UC Berkeley) 1985
Computer systems, parallel and distributed systems, software systems,
computer architecture, dependable
systems, virtualization, cluster computing, multicore architectures, interconnection networks and switches,
reconfigurable systems.
Faculty: Computational Systems Biology
Joseph DiStefano III, Professor (also
Prof. of Medicine and Biomedical
Engineering), Ph.D. (UCLA) 1966
Integrative, data-driven systems biology. Multi-level dynamic biosystems
modeling. Focus on disease (cancer,
HCV, diabetes, neuroendocrine)
process dynamics and optimal therapies. Internet-based intelligent software for life sciences research.
Boris Kogan, Adjunct Professor,
Ph.D. (Moscow Institute of Automation and Telemechanics) 1945
Simulation of dynamic phenomena in
excitable biological tissues, massively
parallel multiprocessor systems.
Eleazar Eskin, Assistant Professor,
Ph.D. (Columbia) 2002
Computational biology and bioinformatics — specifically, analysis of human variation and its relation to complex disease. (Joint appointment with
Department of Human Genetics)
D. Stott Parker, Professor, Ph.D.
(UIUC) 1978
Knowledge-based modeling and databases, stream processing, logic programming, rewriting, and systems for
constraint processing.
Faculty: Graphics & Vision
Petros Faloutsos, Assistant Professor,
Ph.D. (Toronto, Canada) 2002
Computer graphics, physics-based
animation, robotics, biomechanics.
8
Stanley Osher, Professor, Ph.D.
(NYU) 1966
Image science, scientific computing,
level set methods. (Joint appointment
with the Mathematics Department)
Faculty: Graphics & Vision
Stefano Soatto, Professor, Ph.D.
(Caltech) 1996
Research in computer vision.
Song-Chun Zhu, Professor, Ph.D.
(Harvard) 1996
Computer vision, statistical modeling
and computing, machine learning.
(Joint appointment with UCLA Department of Statistics)
Demetri Terzopoulos, Chancellor’s
Professor, Ph.D. (MIT) 1984
Computer graphics, computer vision,
medical image analysis, computeraided design, artificial intelligence/
life.
Faculty: Information & Data Management
Alfonso Cardenas, Professor, Ph.D.
(UCLA) 1969
Database management, distributed
heterogeneous and multimedia (text,
image/picture, voice) systems, information systems planning, development methodologies, medical informatics, legal, intellectual property
issues, and software engineering.
Richard Muntz, Professor, Ph.D.
(Princeton) 1969
Distributed and parallel database systems, temporal data models and query processing, knowledge discovery in
database systems, and computer performance evaluation.
Junghoo (John) Cho, Assistant Professor, Ph.D. (Stanford) 2002
Internet search engines, database
systems, information management
systems, and digital libraries. Development of new algorithms and techniques to manage large-scale data on
the Internet.
Carlo Zaniolo, Professor, Ph.D.
(UCLA) 1976
Knowledge-based systems, database
systems, non-monotonic reasoning,
spatio/temporal reasoning, and scientific databases.
Wesley Chu, Professor, Ph.D. (Stanford) 1966
Distributed processing and distributed database systems, and intelligent
information systems.
9
Faculty: Computer Networks
Deborah Estrin, Professor, Ph.D.
(MIT) 1985
Wireless sensing systems, Internet
architecture and protocols, with particular applications to environmental
sensing applications. (Joint appointment with the Electrical Engineering
Department)
Songwu Lu, Associate Professor,
Ph.D. (UIUC) 1999
Wireless networking, mobile computing, network security, sensor networks, network middleware.
Mario Gerla, Professor, Ph.D.
(UCLA) 1973
Performance evaluation, design and
control of distributed computer
communication systems, and highspeed computer networks (B-ISDN
and optical).
Mani B. Srivastava, Professor, Ph.D.
(UC Berkeley), 1992
Low-power and energy-aware embedded systems, wireless sensor and actuator networks, mobile and wireless
computing and networking, pervasive
computing. (Joint appointment with
Electrical Engineering)
Leonard Kleinrock, Distinguished
Professor, Ph.D (MIT) 1963
Queueing theory, networking (including packet switching, packet radio, local area (LAN), broadband, and peerto-peer), nomadic computing and
intelligent agents.
Lixia Zhang, Professor, Ph.D. (MIT)
1989
Internet architecture, principles in
network protocol designs, security
and resiliency in global scale systems.
Faculty: Software Systems
10
Rajive Bagrodia, Professor, Ph.D.
(U. Texas, Austin) 1987
Wireless
networks,
mobile
computing and communications,
network simulation and analysis,
parallel and distributed computing.
Todd Millstein, Assistant Professor,
Ph.D. (U. Washington), 2003
Programming languages and language
design, compilation, software model
checking, formal methods, and database systems.
Paul Eggert, SOE Lecturer, Ph.D.
(UCLA) 1980
Software design and engineering,
programming language design and
implementation, and software internationalization.
Jens Palsberg, Professor, Ph.D. (University of Aarhus, Denmark) 1992
Compilers, embedded systems, programming languages, software engineering, and information security.
Faculty: Software Systems
Eddie Kohler, Assistant Professor,
Ph.D. (MIT) 2001
Operating systems, software architecture, network measurement,
network protocol design, and programming language techniques for
improving systems software.
David Smallberg, SOE Lecturer,
M.S. (UCLA) 1978
Computer science education, programming languages, generic programming, student software analysis.
Rupak Majumdar, Assistant Professor, Ph.D. (Berkeley) 2003
Formal verification and control
of reactive, real-time, hybrid, and
probabilistic systems; software verification and programming languages; game theoretic problems in verification; logic and automata theory.
Faculty: Computer Science Theory
Eliezer Gafni, Associate Professor,
Ph.D. (MIT) 1982
Distributed algorithms, mathematical programming with application
to distributed routing and control
of data networks, and computer science theory.
Rafail Ostrovsky, Professor, Ph.D.
(MIT) 1992
All aspects of theory of computation,
especially cryptography and security,
distributed algorithms, high-dimensional search, and routing and flow
control in communication networks.
Sheila Greibach, Professor, Ph.D.
(Harvard) 1963
Algorithms and computational complexity, complex program schemes
and semantics, formal languages,
automata theory, computability.
Amit Sahai, Associate Professor,
Ph.D. (MIT) 2000
Theoretical computer science, primarily foundations of cryptography and
computer security.
Adam Meyerson, Assistant Professor, Ph.D. (Stanford) 2002
Approximation algorithms, randomized algorithms, online algorithms,
theoretical problems in networks
and databases.
11
12
Adjunct Faculty
Joint Appointment Faculty
Emeriti Faculty
Leon Alkalai
Alan Kay
Boris Kogan
Gerald Popek
Peter Reiher
M. Y. Sanadidi
Tony Chan
Eleazar Eskin
Stanley J. Osher
Mani Srivastava
Song-Chun Zhu
Algirdas Avizienis
Bertram Bussell
Jack Carlyle
Gerald Estrin
Thelma Estrin
Leonard Kleinrock
Allen Klinger
Michel Melkanoff
Judea Pearl
David Rennels
Jacques Vidal
Featured Faculty
Junghoo (John) Cho
T path to our destination is not always a straight one.
The
We go down the wrong road, we get lost, we turn back.
W
Maybe it doesn't matter which road we embark on.
M
Maybe what matters is that we embark.
M
Barbara Hall, Northern Exposure, Rosebud, 1993
W
e were very pleased when, in 2001, Professor Junghoo (John) Cho accepted
the Computer Science Department’s offer of a faculty position, bringing with
him an exemplary background that includes an undergraduate degree from Seoul National University, a Ph.D. from Stanford University and a reputation as an outstanding
researcher. In July 2007, John was promoted to associate professor with tenure.
John’s research lies in the field of Internet information systems—especially in the areas
of evolution, management, retrieval and mining of information on the World Wide
Web. His research goal is to make it truly easy for people to share, access and understand large-scale digital information.
Currently, John is working on projects that will answer some highly relevant questions:
• Search-Engine Bias—Are we biased by what search engines process and present?
What kind of and how much bias can search engines introduce?
• WebArchive—Can we develop enabling technologies to archive the history of the
Web, so that our future generations are able to access the Web of today?
• BlogoCenter—How can we leverage the rich body of information that is being produced by millions of individuals every day on the Web? Can we build a central
portal for these Web logs (or blogs in short) where users can easily access, mine
and retrieve new high-quality content?
In addition to John’s groundbreaking information systems research, he has, in his
brief six years with the department, received numerous honors and awards—including
the National Science Foundation’s CAREER Award in 2004, the IBM Faculty Award
in 2005, and in 2006, both the Okawa Foundation Research Award and the Northrop
Grumman Excellence in Teaching Award. Additionally, John is an editor of IEEE
Internet Computing and serves on the program committees of top international conferences, such as SIGMOD, VLDB and WWW.
13
Featured Faculty
Demetri Terzopoulos
Eureka!
Archimedes
A
cademy Award winner Demetri Terzopoulos has been a faculty member since 2005 and
holds the esteemed position of Chancellor's Professor of Computer Science. He is a Fellow of
the IEEE, a Fellow of the Royal Society of Canada, and a member of the European Academy of
Sciences.
After receiving his Ph.D. in EECS (artificial intelligence) from MIT in 1984, Demetri joined MIT’s
Artificial Intelligence Lab, and later became a program leader for the Schlumberger Corporation.
Still later, he became an academic, joining the University of Toronto as a tenured professor in the
departments of Computer Science and Electrical & Computer Engineering, where he continues
to hold status-only appointments. Before coming to UCLA, Demetri held the Lucy and Henry
Moses Professorship in Science at New York University and was professor of computer science
and mathematics at NYU’s Courant Institute of Mathematical Sciences. He has been a visiting
professor at IBM, Intel, HP, NEC, Schlumberger, and the University of Paris-Dauphine.
Demetri is one of the most highly-cited authors in engineering and computer science. His scholarly work includes over 300 publications, primarily in computer graphics, computer vision, medical image analysis, computer-aided design, and artificial intelligence/life. It includes the volumes
Real-Time Computer Vision (Cambridge Univ. Press), Animation and Simulation (Springer-Verlag),
Deformable Models in Medical Image Analysis (IEEE CS Press), and the forthcoming Artificial Life for
Computer Graphics (Morgan & Claypool). He has given hundreds of invited talks around the world,
including approximately 80 distinguished lectures and keynote/plenary addresses. Additionally,
Demetri has been called upon to serve on DARPA, NSF, and NIH advisory committees, on the
Presidential Scientific Advisory Board of the Max Plank Institute for Informatics in Germany, and
as chair of the program committees for the major conferences in his fields of expertise.
The Academy of Motion Picture Arts and Sciences recognized Demetri with a 2005 Academy
Award for Technical Achievement for his pioneering work on realistic cloth simulation for motion pictures. He is the recipient of numerous other awards, prizes and citations, among them a
1987 award from the American Association for Artificial Intelligence, a 1996 award from NICOGRAPH, two awards from Computers and Graphics in 2002, citations from the International
Medical Informatics Association in 1999 and 2003, a citation from SAE International in 2006,
and awards from the International Digital Media Foundation in 1994 and from Ars Electronica
(the premier competition for creative work with digital media) in 1995. He is famous in the computer vision and medical imaging communities for co-inventing the influential algorithm known as
“snakes” for which he received a Marr Prize citation from the IEEE in 1987. In 1998 the Canadian Image Processing and Pattern Recognition Society cited him for his “outstanding contributions
to research and education in image understanding.”
14
Featured Faculty
Lixia Zhang
The principle of science, the definition, almost, is the following: the test
of all knowledge is experiment. Experiment is the sole judge of scientific
o
"truth.” But what is the source of knowledge? Where do the laws that are
"t
to be tested come from? Experiment, itself, helps to produce these laws,
in the sense that it gives us hints.
B also needed is imagination to create from these hints the great genBut
eeralizations—to guess at the wonderful, simple, but very strange patterns
beneath them all, and then to experiment to check again whether we have
b
made the right guess.
m
Richard Feynman, Lectures on Physics
I
n the fulfillment of her multiple roles as dedicated teacher, eminent scholar and renowned
researcher, it is little wonder that this quotation is one of Professor Lixia Zhang’s favorites: it
very much exemplifies her professional and philosophical approach to those very roles.
After receiving a Ph.D. from MIT in 1989, Lixia spent seven years with the Xerox Palo Alto
Researcher Center conducting Internet-related research that included analyzing TCP traffic
dynamics and enabling integrated services support over the Internet. The design of RSVP—an
Internet standard signaling protocol—is one of her most well-known achievements. We were
very pleased when Lixia decided to join UCLA’s Computer Science Department in January
1996, bringing with her a wealth of scientific expertise.
Professor Lixia Zhang is the latest ACM Fellow in the department. Her research projects at
UCLA have included the design of a global-scale web caching system, the Internet Distance
Map Service, robust data delivery over large-scale sensor networks, wireless network security,
and fault tolerance of the Internet routing infrastructure—all of which share a common focus
on identifying the design principles for large-scale autonomous systems. Currently, Lixia and
her students from the Internet Research Lab are tackling resiliency and security issues in the
Internet infrastructure—such as those found in the global routing system and Domain Names
System (DNS). Under the NSF FIND program, her team is also working on the design of a
new Internet architecture, dubbed “eFIT” (enabling Future Internet innovations through Transit wire), to ensure future Internet innovations.
Always active in the Internet community, Lixia presently serves on the Internet Architecture
Board (IAB) and co-chairs the Routing Research Group under the Internet Research Task
Force (IRTF). In the past, she has served as vice chair of ACM SIGCOMM, co-chair of IEEE
Communication Society Internet Technical Committee, associate editor for ACM Computer
Communication Review, and member of the editorial board for IEEE/ACM Transactions on Networking.
Lixia was elected to IEEE Fellow in 2005 and ACM Fellow in 2006 for her contributions to the
architecture and signaling protocols in packet switched networks.
15
Internet Technologies Cluster
T
he concept of packet networking was successfully
demonstrated for the first time in 1969 at UCLA (the first
node in the ARPANET), sowing the seeds for the creation
of today’s modern Internet. Four decades later, the term
“networking” means much more than switching packets on wires.
Networking and the Internet have become an essential fabric of
our society and the support for vital applications ranging from
electronic mail, distributed databases, multimedia streaming, file
sharing, command and control systems, homeland security and
distributed computing. Since the early ARPANET days, UCLA
has maintained a position of prominence and is now one of the
most active centers of Internet research in the nation. The key to
the success of the Internet Technologies Cluster at UCLA is the
excellence, multidisciplinary expertise and collaboration history
of its faculty. The cluster hosts the key technologies that will
shape the future of the Internet. These technologies include:
•
•
•
•
•
•
•
Internet protocols (e.g., routing, DNS, overlays, peer-topeer, etc.), targeting better quality-of-service guarantees
along with scalability and robustness.
Advanced modular processor (software and hardware)
designs aimed at scalability, fault tolerance and low energy
consumption.
Wireless protocols coupled with programmable radios/
antennas and adaptive modulation and encoding techniques
to enable the interconnection of wireless networks and
mobile customers with the wired Internet.
Distributed applications (e.g., multimedia, sensor fields,
databases, peer-to-peer, etc.) that can efficiently utilize
network and computing resources.
Network security strategies for the protection of resources
from attacks and for the enforcement of privacy.
Analytic models and methods for the optimal design and
systematic evaluation of protocols and algorithms.
Simulation models and tools for performance evaluation/
prediction that are essential for the design/implementation
cycle.
Our research skills are distributed over multiple departments (CS,
EE, and MAE) within the Henry Samueli School of Engineering
and Applied Sciences (HSSEAS). They are brought together
by collaborative projects that implement integrated networked
system designs and distributed applications in school-wide
centers and testbeds—CENS (embedded networked sensing),
CAINS (autonomous intelligent networks), CICS (information
and computation security), and WHYNET (wireless hybrid
network testbed). These resources are not only an asset for
research and education in HSSEAS, but are shared with other
schools and industry. This provides a bridge with external
research communities and an opportunity for expanded
collaboration.
16
Embedded Systems Cluster
A
n embedded system is a computer-based system that
interacts with its environment. Embedded systems range
from cell phones to radars and sonars, from biomedical and
automotive devices to nuclear plants and missile controllers.
More than 99 percent of all computer systems are embedded.
The embedded systems field is on the verge of a revolution due
to the convergence of computation, communication, sensing,
actuating, and embedded power production technologies. This
poses numerous challenges to self-recovering systems, security
and privacy, location-aware computing, low-cost and low-power
design, and many other areas of research.
At UCLA the embedded systems research emphasis is on
sensor networks, computer-aided design of embedded systems,
reconfigurable/programmable embedded systems, design of
low-power systems, architectural and compiler techniques for
embedded systems, and Internet-based embedded systems.
Several large research groups here at UCLA emphasize
embedded systems research. One of these groups, the Center
for Embedded Networked Sensing (CENS), is an important
focal point for embedded computing research in Southern
California.
Intelligent Algorithms & Systems
Cluster
R
esearch efforts in this cluster are spread over a wide
spectrum—from the very theoretical to the very practical.
Topics covered by research in this cluster include artificial
intelligence, vision, graphics, optimization
algorithms,
distributed
computing, cryptography, computational
complexity, and computational economics. There are also
efforts geared toward mathematical formalizations of various
aspects of living systems and intelligence, including belief
revision, causality, multi-agent coordination, biomechanics and
motor control, behavior simulation, expressive facial animation
and visual speech, and human simulation. Finally, there are
efforts that focus on building systems for experimental and realworld use in a variety of application areas, including intelligent
interfaces, interactive game technologies, motion picture
special effects, verification, diagnosis, 3D reconstruction, visual
recognition, and visual motion estimation.
UCLA has a long tradition of research in intelligent algorithms
and systems, having pioneered developments in some of the
most influential areas, including commonsense reasoning,
heuristic search, and distributed computing. For example,
the foundations of probabilistic commonsense reasoning
were established at UCLA and have led to probabilistic
graphical models that currently underlie a significant portion
of the research on intelligent systems. Moreover, some of the
most influential methods in heuristic search were developed
here and are currently in common daily use in a variety of
optimization problems. Finally, much of the groundwork for
the modern theory of distributed computing was developed by
UCLA researchers.
Software Systems Cluster
T
he Software Systems Cluster is a diverse and energetic
group of faculty and students working to develop the
programming languages, tools, and systems to meet the software
challenges and opportunities of today and tomorrow. We have
a broad array of ongoing research activities that span the entire
spectrum of software systems, including programming language
design and implementation, software engineering, computeraided verification, database systems, parallel and distributed
systems, operating systems, and embedded systems.
The Software Systems Cluster has reached critical mass with
several new faculty hires in the past three years. As a result,
the cluster is poised for large-scale collaboration, both within
the cluster and with other clusters or centers, departments and
institutions.
A good example of such collaboration is our NSF-funded project
to improve the quality of event-driven software—something
our society increasingly depends on for diverse applications—
including Web servers, sensor networks, medical implants,
and fly-by-wire systems. Members of the Software Systems
Cluster, in collaboration with researchers from the Center
for Embedded Networked Sensing, are developing better
languages, analysis tools, compilers, and operating systems for
event-driven programs. UCLA's Software Systems Cluster has
the unique strengths and resources to make a significant impact
in this area.
Photos by Yves Rubin
17
Research Highlights—Mobile Networked Cars
D
uring large-scale catastrophes like September 11th and hurricane Katarina, communication infrastructures
are most often destroyed, and lifelines are suddenly completely cut off for emergency personnel. Mario
Gerla, Giovanni Pau and a team of researchers are working on a project that addresses this crucial issue. And
public agencies, such as the California Department of Transportation, are paying close attention to the results of
their research.
Today, in order to use the Internet or a cell phone in a moving car, a tower or other stationary access point must be
within range. However, a mobile network of cars
can bypass this problem by connecting vehicles
to one another and creating a mobile Internet using standard radio protocols combined with wireless LAN (local area network) technology.
For less than $1000 per vehicle, this project team
turns specially equipped cars into mobile networks that enable one car to transmit signals to
an entire fleet of cars in the same wireless network. Cars traveling within 100 to 300 meters of
one another can connect, and can create a network, car by car, over a wide range. As cars fall
out of range and drop out of the network, other
node-equipped cars can join in to receive or send
signals. Police cars, ambulances and hazardous
materials response units are likely to be the first
users of these mobile networks.
There are unlimited uses for this new communications strategy. In a wartime situation, for example, drivers in networked vehicles could access
information about dangers within or near their
mobile network—such as the presence of smoke
or radiation from a dirty bomb—or could coordinate escape routes in the event of an attack.
And, on a closer-to-home note, on our crowded
Southern California highways, accidents could be
prevented if drivers had access to pertinent, realtime information about collisions or changes in
traffic patterns ahead.
Professor Mario Gerla (left) and graduate researcher Giovanni Pau
hold components.
Copyright © Photo by Reed Hutchinson
18
Research Highlights—New Electronic Security Breakthrough
O
ne of the greatest challenges in electronic security has been to provide verifiability
and privacy at the same time—for example, to prove you hold an odd number without
revealing anything about the actual number or
about yourself. This is called a “non-interactive
zero-knowledge proof” (NIZK). Professors Rafail
Ostrovsky and Amit Sahai, along with postdoctoral
scholar Jens Groth, have created the first highly
efficient constructions of NIZKs, with potential
applications that range from e-cash to electronic
voting to anonymous whistle blowing, and to digital
signatures and other safeguards. In each case, these
users will be able to send a message that a recipient
recognizes as valid, and they can do this without
revealing their identifies or any other personal
information.
To achieve this remarkable result, this team of
researchers used pairing-based cryptography, drawing on algebraic geometric techniques
from numbers theory. Besides protecting a user’s identity, the NIZK also guarantees that a
user’s secrets are mathematically safe regardless of the diligence of a potential hacker—even
one with unlimited computational power.
The work of Groth, Ostrovsky, and Sahai has revolutionized cryptographic proofs—the
fundamental building blocks for countless security applications. The impact on the field of
cryptography is significant, and will enable the use of non-interactive zero-knowledge proofs
in multiple practical settings.
19
Research Highlights—3D Integrated Circuit Design
hree-dimensional integrated circuits (3D-IC) are integrated circuits with multiple active
device layers stacked into a monolithic structure. 3D-IC technologies offer the potential
to significantly reduce interconnect wire length, which in turn will reduce power consumption and interconnect delays, and improve system performance. Device layers in a 3D-IC can
be connected using through-the-silicon vias (TS vias) or RF interconnects. Professor Jason
Cong’s research group at UCLA has developed a complete thermal-aware physical design
flow for 3D-ICs, including 3D floorplanning, placement, and global routing, plus thermal-via
planning and interfaces to commercial detailed routing tools. The entire design flow is interfaced with the OpenAccess design database (graphically depicted below).
3D Tapeout
Research groups led by Professors Frank Chang (EE) and Jason Cong (CS) have designed
and fabricated a 3D test chip called “OpenRISC 3D.” This experimental 3D-IC implementation is based on the OpenRISC design, and it has been sent to MIT’s Lincoln Lab for
tape-out as part of the 3DM2 project funded by DARPA. The design extends OpenRISC
to include L2 cache slices and an arbitrated bus interface between L2 slices and the cores; it
was prototyped on the Xilinx XUP FPGA board. The design is partitioned into three tiers:
the bottom tier for on-chip memory, the middle tier for the L2 cache, and the top tier for the
L1 cache and core.
Top Tier: L1-Cache & Core
T
Future work will include promising features like RF interconnects, multicore network-onchip systems, and further refinement of the 3D physical design flow for performance and
signal integrity optimization (joint work with IBM under a DARPA contract).
Layers &
Design Rules
(LEF)
Cell & Via
definitions
(LEF)
ThermalThermal-Driven
3D Floorplanner
3D
OpenAccess
Bottom Tier: On-Chip
Memory
Technology Lib
ThermalThermal-Driven
3D Placer
Reference Lib
Design
Netlist
(HDL or DEF)
3D Global Router
Tier
Export
Layout
(GDSII)
Tier
Import
2D OA
ThermalThermal-Via Planner
Detailed Routing
by SoC Encounter
3D Integrated Circuit
20
Middle Tier: L2-Cache
Research Highlights—Automated Reasoning Group Wins Gold Medal in 2007
International SAT Competition
T
he Boolean satisfiability problem (SAT) is one of the most important problems in computer science for both theoretical and practical reasons. On the theoretical side, SAT was the very first problem shown to be in the class of
NP-complete problems—a class that contains many difficult problems of interest to computer science and its applications.
Intuitively, this means that SAT is difficult and general enough to be used by theorists as a baseline for measuring the difficulty of computer science problems. For example, it is a common practice to demonstrate the computational difficulty
of a problem by showing that it is as hard as SAT.
On the practical side, SAT solvers have evolved over the last two decades into some of the most widely used generalpurpose problem solvers. In particular, real-world problems are commonly transformed into SAT problems, which are
then solved using SAT engines. This includes problems from the domains of scheduling, planning, register allocation,
software and hardware verification, automated testing, and automated theorem proving.
One of the main driving forces behind recent advancements in SAT solving is the international SAT competition that
is held every other year and draws dozens of competitors from all over the world. Each competition involves the evaluation of SAT solvers on many difficult problems (approximately 900 in 2007), where the performance of each solver is
measured by the number of problems it can solve within the allocated time, and also by the time it takes to solve each
problem. The competition is divided according to the nature of problems used, with the main category corresponding to
industrial benchmarks (the other two categories are handcrafted and random problems).
This year the RSat solver, developed by Professor Adnan Darwiche and researchers from his Automated Reasoning
Group at UCLA, won the gold medal for the industrial benchmark competition held as part of the 10th International
Conference on the Theory and Applications of Satisfiability Testing (Lisbon, Portugal). The Automated Reasoning
Group is also well known for its development of probabilistic reasoning systems, including the SamIam system which has
been downloaded thousands of times by institutions all over the world. Last year, the group was the only team to solve all
problem instances at the International Evaluation of Exact Probabilistic Reasoning Systems (Boston, USA).
For more information about RSat and other reasoning systems developed by the Automated Reasoning Group, please
visit the group’s website at http://reasoning.cs.ucla.edu.
21
Selected Publications *
Z. Xu and R. Bagrodia, “GPU-Accelerated
Evaluation Platform for High Fidelity
Network Modeling,” Proceedings of 21st
Workshop on Principles of Advanced and
Distributed Simulation (PADS), June 2007.
M. Varshney and R. Bagrodia,“Performance
Implication of Environmental Mobility on
Wireless Networks,” 26th Annual IEEE
Conference on Computer Communication
(INFOCOM), May 2007.
Z. Ji, M. Varshney, J. Zhou, and R.
Bagrodia, “Point-Casting Service in
Wireless Networks,” 26th Annual IEEE
Conference on Computer Communication
(INFOCOM), May 2007.
M. Varshney, D. Xu, M. Srivatava, and R.
Bagrodia, “SenQ: A Scalable Simulation
and Emulation Environment for Sensor
Networks,” IEEE/ACM Conference on
Information Processing in Sensor Networks
(IPSN), Track on Sensor Platform, Tools and
Design Methods for Network Embedded
Systems (SPOTS), April 2007.
R. K. Pon, A. F. Cárdenas, D. Buttler,
and T. Critchlow, “iScore: Measuring the
Interestingness of Articles in a Limited User
Environment,” Proceedings of the IEEE
Symposium on Computational Intelligence
and Data Mining 2007, Honolulu, HI, pp.
354-361, April 2007.
22
K. C. Sia, J. Cho, and H.-K. Cho, “Efficient
Monitoring Algorithm for Fast News
Alerts,” IEEE Transactions on Knowledge
and Data Engineering, 19(7), 2007.
A. Ntoulas and J. Cho, “Pruning Policies
for Two-Tiered Inverted Index with
Correctness Guarantee,” Proceedings of
the 30th Annual International ACM SIGIR
Conference, 2007.
R. B. Almeida, B. Mozafari, and J. Cho, “On
the Evolution of Wikipedia,” Proceedings
of the International Conference onWeblogs
and Social Media, 2007.
K. C. Sia, J. Cho, K. Hino, Y. Chi, S.
Zhu, and Belle Tseng, “Monitoring RSS
Feeds Based on User Browsing Pattern,”
ProceedingsoftheInternationalConference
on Weblogs and Social Media, 2007.
Y. Chen, L. H. Pedersen, W. W. Chu, and
J. Olsen, “Drug Exposure Side Effects
from Mining Pregnancy Data,” SIGKDD
Explorations, Volume 9, Issue 1, June 2007.
Special Issue on Data Mining for Health
Informatics. Guest Editors: Raymond Ng
and Jian Pei.
S. Park, S.-W. Kim, and W. W. Chu,
“SBASS: Segment Based Approach
for Subsequence Search in Sequence
Databases,” International Journal of
Computer Science & Engineering, 2007.
D. A. Aoyama, J. T. Hsiao, A. F. Cárdenas,
and R. K. Pon, “TimeLine and Visualization
of Multiple-Data Sets and the Visualization
Querying Challenge,” Journal of Visual
Languages and Computing (2007), Vol. 18,
pp. 1-21, February 2007.
S. Liu and W. W. Chu, “CoXML: A
Cooperative XML Query Answering
System,” 8th International Conference on
Web-Age Information Management, June
2007.
S. Chan, R. K. Pon, and A. F. Cárdenas,
“Visualization and Clustering of Author
Social Networks,” 2006 Distributed
Multimedia Systems Conference, Grand
Canyon, AZ, pp. 174-180, August 2006.
Z. Liu and W. W. Chu, “Knowledge-Based
Query Expansion to Support ScenarioSpecific Retrieval of Medical Free Text,”
Information Retrieval, Springer, 10(2):173202, 2007.
P. G. Ipeirotis, A. Ntoulas, J. Cho, and
L. Gravano, “Modeling and Managing
Content Changes in Text Databases,” ACM
Transactions on Database Systems, 32(3),
2007.
W. Mao and W. W. Chu, “The PhraseBased Vector Space Model for Automatic
Retrieval of Free-Text Medical Documents,”
Data & Knowledge Engineering, 61(1), pp.
7-92, 2007.
7/2006 - 6/2007
J. Cong and K. Minkovich, “Optimality
Study of Logic Synthesis for LUT-Based
FPGAs,” IEEE Transactions on ComputerAided Design of Integrated Circuits and
Systems, Volume 26, Number 2, pp. 230239, February 2007.
J. Cong, G. Han, and W. Jiang, “Synthesis of
an Application-Specific Soft Multiprocessor
System,” Proceedings of the 15th ACM,
SIGDA International Symposium on Field
Gate Arrays, Monterey, CA, pp. 99-107,
February 2007.
J. Cong, G. Luo, J. Wei, and Y. Zhang,
“Thermal-Aware 3D IC Placement via
Transformation,” Proceedings of the 12th
Asian and South Pacific Design Automation
Conference (ASP-DAC 2007), Yokohama,
Japan, pp. 780-785, January 2007.
D. Chen, J. Cong, and P. Pan, “FPGA Design
Automation: A Survey,” Foundations and
Trends in Electronic Design Automation,
Vol. 1, No. 3, pp. 195-330, November
2006.
J. Cong, Y. Fan, and W. Jiang, “PlatformBased Resource Binding Using a
Distributed Register-FileMicroarchitecture,”
Proceedings of ACM/IEEE International
Conference on Computer Aided Design,
San Jose, CA, November 2006.
A. Choi, M. Chavira and A. Darwiche,
“Node Splitting: A Scheme for Generating
Upper Bounds in Bayesian Networks,”
Proceedings of the 23rd Conference on
Uncertainty in Artificial Intelligence (UAI),
Vancouver, BC, July 2007.
K. Pipatsrisawat and A. Darwiche, “A
Lightweight Component Caching Scheme
for Satisfiability Solvers,” Proceedings of
Tenth International Conference on Theory
and Applications of Satisfiability Testing
(SAT), Lisbon, Portugal, May 2007.
M. Chavira and A. Darwiche, “Compiling
Bayesian Networks Using Variable
Elimination,” Proceedings of the 20th
International Joint Conference on Artificial
Intelligence (IJCAI), Hyderabad, India,
January 2007.
Selected Publications
J. Huang and A. Darwiche, “The Language
of Search,” Journal of Artificial Intelligence
Research, Volume 29, pp. 191-219, 2007.
A. Choi and A. Darwiche, “A Variational
Approach for Approximating Bayesian
Networks by Edge Deletion,” Proceedings
of the 22nd Conference on Uncertainty in
Artificial Intelligence (UAI), Cambridge,
MA, July 2006.
S. Hori, I. Kurland and J. J. DiStefano
III, “Role of Endosomal Trafficking
Dynamics on the Regulation of Hepatic
Insulin Receptor Activity: Models for Fao
Cells,” Annals of Biomedical Engineering,
34(5):879-92, 2006.
G. Z. Ferl, V. Kenanova, A. M. Wu,
and J. J. DiStefano III, “A TwoTiered Physiologically-Based Model
for Dually Labeled Single Chain Fv-Fc
Antibody Fragments,” Molecular Cancer
Therapeutics, 5(6):1550-1558, 2006.
S. Russell and J. J. DiStefano III,
“W3MAMCAT:
A Worldwide Web
Based Expert System For Mammillary
& Catenary Compartmental Modeling &
Distinguishability,” Computer Methods
and Programs in Biomedicine, 83:34-42,
July 2006.
M. Eisenberg, M. Samuels, and J. J.
DiStefano III, “Bioequivalence and
Hormone Replacement Studies via
Feedback Control Simulations,” Thyroid,
16(12): 1-14, December 2006.
M. D. Ercegovac and J.-M. Muller,
“Arithmetic Processor for Solving
Tridiagonal Systems of Linear Equations,”
Proceedings of 40th Asilomar Conference
on Signals, Systems and Computers, pp.
337-340, 2006.
P. Dormiani and M. D. Ercegovac,
“Interconnection Scheme for Networks of
Online Modules,” Proceedings of SPIE on
Advanced Signal Processing Algorithms,
Architectures, and Implementations XII,
pp. 1-12, 2006.
7/2006 - 6/2007
R. McIlhenny and M. D. Ercegovac,
“On the Design of an On-line Complex
Householder Transform,” Procceedings
of 40th Asilomar Conference on Signals,
Systems and Computers, pp. 318-322,
2006.
S. Reddy, A. Parker, J. Hyman, J. Burke, M.
Hansen and D. Estrin, “Image Browsing,
Processing, and Clustering for Participatory
Sensing: Lessons From a DietSense
Prototype,”FourthWorkshop on Embedded
Networked Sensor (EmNets), June 2007.
J. C. Bajard, S. Duquesne, M. D.
Ercegovac, and N. Meloni, “Study of RNS
Representation and Modular Products
Summation,” Proceedings of SPIE on
Advanced Signal Processing Algorithms,
Architectures, and Implementations XII,
pp. 631304-1:11, 2006.
T. Abdelzaher, Y. Anokwa, P. Boda, J.
Burke, D. Estrin, L. Guibas, A. Kansal,
S. Madden, and J. Reich, “Mobiscopes
for Human Spaces,” IEEE Pervasive
ComputingMobileandUbiquitousSystems,
Vol. 6, No. 2, April - June 2007.
M. D. Ercegovac, “Omnipresence of
Tesla’s Work and Ideas,” 6th International
Symposium Nikola Tesla, pp. 251-56,
October 2006.
N. Zaitlen, H. M. Kang, E. Eskin, and
E. Halperin, “Leveraging the HapMap
Correlation Structure in Association
Studies,” American Journal of Human
Genetics, 80(4):683-91, 2007.
E. Corona, B. Raphael, and E. Eskin,
“Identification of Deletion Polymorphisms
from Haplotypes,” Proceedings of Eleventh
Annual Conference on Research in
Computational Biology (RECOMB-2007),
Oakland, CA, April 2007.
S. O’Rourke, N. Zaitlen, N. Jojic, and E.
Eskin, “Reconstructing the Phylogeny
of Mobile Elements,” Proceedings of
Eleventh Annual Conference on Research
in Computational Biology (RECOMB2007), Oakland, CA, April 2007.
C. Ye and E. Eskin, “Discovering Tightly
Regulated and Differentially Expressed
Gene Sets in Whole Genome Expression
Data,” Bioinformatics 23(2): pp. 84-90.
Special Issue of Proceedings of the 5th
European Conference on Computational
Biology (ECCB-2006), Eilat, Israel:
January 2007.
E. Eskin, E. Halperin, and R. Sharan,
“A Note on Optimally Phasing Long
Genomic Regions Using Local Haplotype
Predictions,” Journal of Bioinformatics
and Computational Biology, Vol. 4, No. 3,
pp. 639-647, 2006.
D. Estrin, “Reflections on Wireless
Sensing Systems: From Ecosystems to
Human Systems,” IEEE Radio and Wireless
Symposium, Long Beach CA, January
2007.
B. Greenstein, C. Mar, A. Pesterev, S.
Farshchi, E. Kohler, J. Judy, and D. Estrin,
“Capturing High-Frequency Phenomena
Using a Bandwidth-Limited Sensor
Network,” ACM SenSys, November 1-3,
2006.
L. Girod, M. Lukac, V. Trifa, and D.
Estrin, “The Design and Implementation
of a Self-Calibrating Distributed Acoustic
Sensing Platform,” Proceedings of Fourth
ACM Conference on Embedded Networked
Sensor Systems, ACM/SenSys, October
2006.
T. Yeh, P. Faloutsos, S. Patel, and G.
Reinman, “ParallAX: An Architecture
for Real-Time Physics,” 34th Annual
International Symposium on Computer
Architecture, June 2007.
A. Shapiro, M. Kallmann, and P. Faloutsos,
“Interactive Motion Correction and
Object Manipulation,” ACM SIGGRAPH,
Symposium on Interactive 3D Graphics
and Games, pp. 137-144, April 2007.
T. Yeh, P. Faloutsos, and G. Reinman,
“Enabling Real-Time Physics Simulation
in Future Interactive Entertainment,” ACM
SIGGRAPH Video Game Symposium,
2006.
23
Selected Publications
Peer-to-Peer Networks With Clustered
Demands,” IEEE Journal on Selected Areas
in Communications, Vol. 25, No. 1, January
2007.
E. Kohler, S. Floyd, and M. Handley,
“Designing DCCP: Congestion Control
Without Reliability,” SIGCOMM 2006,
August 2006.
A. Shapiro, Y. Cao, and P. Faloutsos, “Style
Components,” Proceedings of Graphics
Interface 2006, pp. 33-40, 2006.
S. Das, S. Tewari, and L. Kleinrock, “The
Case for Servers in a Peer-to-Peer World,”
Proceedings of IEEE ICC 2006, Istanbul,
Turkey, June 2006.
S. Jung, U. Lee, A. Chang, D.-K. Cho,
and M. Gerla, “BlueTorrent: Cooperative
Content Sharing for Bluetooth Users,”
Percom 2007, White Planes, NY, March
2007. (Best Paper Award)
S. Tewari and L. Kleinrock, “Optimal
Search Performance in Unstructured
Peer-to-Peer Networks With Clustered
Demands,” Proceedings of IEEE ICC 2006,
Istanbul, Turkey, June 2006.
A. Fukunaga and R. E. Korf, “Bin
Completion Algorithms for Multicontainer
Packing, Knapsack, and Covering
Problems,” Journal of Artificial Intelligence
Research, Vol. 28, pp. 393-429, March
2007.
J.-S. Park, D. S. Lun, Y. Yi, M. Gerla,
and M. Medard, “CodeCast: A Network
Coding Based Ad Hoc Multicast Protocol,”
IEEE Wireless Commnications Magazine,
February 2007.
R. Samade and B. Kogan, “Calcium
Alternans in Cardiac Cell Mathematical
Models,”Proceedings of 2007 International
Conference
on
Bioinformatics
&
Computational Biology, Vol II, pp. 473479, June 2007.
A. Majkowska, V. Zordan, and P.
Faloutsos, “Automatic Splicing for Hand
and Body Animations,” ACM SIGGRAPH/
Eurographics Symposium on Computer
Animation, pp. 309-316, 2006.
U. Lee, E. Magistretti, B. Zhou, M. Gerla,
P. Bellavista, and A. Corradi, “MobEyes:
Smart Mobs for Urban Monitoring with a
Vehicular Sensor Network,” IEEE Vehicular
Communications Magazine, November
2006.
C. E. Palazzi, M. Roccetti, S. Ferretti, G.
Pau, and M. Gerla, “Online Games on
Wheels: Fast Game Event Delivery in
Vehicular Ad-hoc Networks,” V2VCOM
2007, Istanbul, Turkey, June 2007.
G. Marfia, G. Pau, E. Giordano, E. D. Sena
and M. Gerla, “VANET: On Mobility
Scenarios and Urban Infrastructure. A Case
Study,” Move 2007 (joint with Infocom
2007), Anchorage, AK, May 2007.
G. Marfia, A. Sentivelli, S. Tewari, M.
Gerla, and L. Kleinrock, “Will IPTV
Ride the Peer-to-Peer Stream?,” IEEE
Communications Magazine Special Issue
on Peer-to-Peer Streaming, June 2007.
S. Tewari and L. Kleinrock, “Analytical
Model for BitTorrent-based Live Video
Streaming,” Proceedings of IEEE NIME
2007 Workshop, Las Vegas, NV, January
2007.
S. Tewari and L. Kleinrock, “Optimal
Search Performance in Unstructured
24
7/2006 - 6/2007
P. K. C. Wang and B. Y. Kogan, “Parametric
Study of the Noble’s Action Potential
Model for Cardiac Purkinje Fibers,” Chaos,
Solutions and Fractals 33, pp. 1048-1063,
2007.
R. B. Huffaker, J. N. Weiss, and B. Kogan,
“Effects of Early After Depolarizations on
Reentry in Cardiac Tissue: a Simulation
Study,” American Journal of Physiology,
Heart and Circulatory Physiology,
292:H3089-3102, 2007.
A. Legout, N. Liogkas, E. Kohler, and L.
Zhang, “Clustering and Sharing Incentives
in BitTorrent Systems,” SIGMETRICS
2007, June 2007.
M. Krohn, E. Kohler, and M. Frans
Kaashoek, “Events Can Make Sense,”
USENIX 2007, June 2007.
B. Greenstein, C. Mar, A. Pesterev, S.
Farshchi, E. Kohler, J. Judy, and D. Estrin,
“Capturing High-Frequency Phenomena
Using a Bandwidth-Limited Sensor
Network,” SenSys ‘06, November 2006.
N. Zeldovich, S. Boyd-Wickizer, E. Kohler,
and D. Mazières, “Making Information
Flow Explicit in HiStar,” OSDI 2006,
November 2006.
R. E. Korf and A. Felner, “Recent Progress
in Heuristic Search: A Case Study of the
Four-peg Towers of Hanoi Problem,”
Proceedings of the International Joint
Conference on Artificial Intelligence
(IJCAI-07), Hyderabad, India, pp. 23-39,
January 2007.
M. Emmi, J. S. Fischer, R. Jhala, and
R. Majumdar, “Lock Allocation,” in
POPL 2007: Principles of Programming
Languages, ACM Press, pp. 291-296,
January 2007.
R. Jhala and R. Majumdar, “Interprocedural
Analysis of Asynchronous Programs,”
POPL 2007: Principles of Programming
Languages, ACM Press, pp. 339-350,
January 2007.
D. Kapur, R. Majumdar, and C. G.
Zarba, “Interpolation for Data Structures,”
SIGSOFT FSE 2006: Foundations of
Software Engineering, ACM Press, pp.
105-116, November 2006.
R. Jhala and R. Majumdar, “Bit Level
Types for High Level Reasoning,” SIGSOFT
FSE 2006: Foundations of Software
Engineering, ACM Press, pp. 128-140,
November 2006.
R. Jhala, R. Majumdar, and R.-G. Xu,
“Structural Invariants,” SAS 2006: Static
Analysis Symposium, Springer-Verlag, pp.
71-87, September 2006.
D. Kempe, A. Meyerson, N. Solanki, and R.
Chellappa, “Pricing of Partially Compatible
Products,” ACM Conference on Electronic
Commerce (ACM EC) 2007.
Selected Publications
S. Koenig, C. Tovey, M. Lagoudakis, E.
Markakis, D. Kempe, P. Keskinocak, A.
Kleywegt, A. Meyerson, and S. Jain, “The
Power of Sequential Single-Item Auctions
for Agent Coordination,” National
Conference on Artificial Intelligence
(AAAI) 2006.
D. Carroll, A. Goel, and A. Meyerson,
“Embedding Bounded Bandwidth Graphs
into L1,” International Colloquium on
Automata, Languages, and Programming
(ICALP) 2006.
B. Chin and T. Millstein, “Responders:
Language Support for Interactive
Applications,” European Conference on
Object-Oriented Programming (ECOOP
2006), Nantes, France, July 2006.
N. Kothari, R. Gummadi, T. Millstein,
and R. Govindan, “Reliable and Efficient
Programming Abstractions for Wireless
Sensor Networks,” Proceedings of the ACM
SIGPLAN Conference on Programming
Language Design and Implementation
(PLDI 2007), San Diego, CA, June 2007.
R. Gummadi, N. Kothari, T. Millstein, and
R. Govindan, “Declarative Failure Recovery
for Sensor Networks,” Proceedings of the
Sixth International Conference on AspectOriented Software Development (AOSD
2007), Vancouver, British Columbia,
March 2007.
C. Andreae, J. Noble, S. Markstrum, and T.
Millstein, “A Framework for Implementing
Pluggable Type Systems,” Proceedings
of the Conference on Object-Oriented
Programming, Systems, Languages, and
Applications (OOPSLA 2006), Portland,
OR, October 2006.
A. Warth, M. Stanojevic, and T. Millstein,
“Statically Scoped Object Adaptation with
Expanders,”Proceedings of the Conference
onObject-OrientedProgramming,Systems,
Languages, and Applications (OOPSLA
2006), Portland, OR, October 2006.
Y. Ishai, E. Kushilevitz, and R. Ostrovsky,
“Efficient Arguments without Short PCPs,”
IEEE Conference on Computational
Complexity, pp. 278-291, 2007.
7/2006 - 6/2007
R. Ostrovsky and W. E. Skeith III,
“A Survey of Single-Database Private
Information Retrieval: Techniques and
Applications,” Public Key Cryptography,
pp. 393-411, 2007.
R.-L. Hsiao and D. S. Parker, “The GOBASE:
An Information Management System for
Gene Ontology,” Symposium on Statistical
and Scientific Database Management
(SSDBM’06), September 2006.
Y. Ishai, E. Kushilevitz, R. Ostrovsky, and
A. Sahai, “Zero-Knowledge from Secure
Multiparty Computation,” STOC, pp. 2130, 2007.
H.-C. Yang, D. S. Parker, and R.-L. Hsiao,
“The Holodex: Integrating Summarization
with the Index,” Symposium on Statistical
and Scientific Database Management
(SSDBM’06), September 2006.
R. Curtmola, J. A. Garay, S. Kamara, and
R. Ostrovsky, “Searchable Symmetric
Encryption: Improved Definitions and
Efficient Constructions,” ACM Conference
on Computer and Communications
Security, pp. 79-88, 2006.
J. Groth, R. Ostrovsky, and A. Sahai, “Noninteractive Zaps and New Techniques for
NIZK,” CRYPTO, pp. 97-111, 2006.
B. L. Titzer, J. Auerbach, D. F. Bacon, and
J. Palsberg, “The ExoVM System for
Automatic VM and Application Reduction,”
Proceedings of PLDI’07, ACM SIGPLAN
Conference on Programming Language
Design and Implementation, San Diego,
CA, June 2007.
T. Zhao, J. Palsberg, and J. Vitek, “TypeBased Confinement,” Journal of Functional
Programming, 16(1):83-128, 2006.
K.-H. Chang, Y.-K. Kwon, and D. S.
Parker, “Finding Minimal Sets of
Informative Genes in Microarray Data,”
Proceedings International Symposium on
Bioinformatics Research and Applications
(ISBRA’07), 2007.
D. S. Parker, R.-L. Hsiao, Y. Xing, A. Resch,
and C. Lee, “Solving the Problem of TransGenomic Query with Alignment Tables,”
IEEE Transactions on Computational
Biology and Bioinformatics, DOI 10.1109/
TCBB.2007.1073, 2007.
H.-C. Yang, A. Dasdan, R.-L. Hsiao,
and D. S. Parker, “Map-Reduce-Merge:
Simplified Relational Data Processing
on Large Clusters,” Proceedings ACM
International Conference on Management
of Data (SIGMOD’07), June 2007.
I. Shpitser and J. Pearl, “Identification
of Joint Interventional Distributions
in Recursive Semi-Markovian Causal
Models,” Proceedings of the TwentyFirst National Conference on Artificial
Intelligence, Boston, MA, AAAI Press, pp.
1219-1226, July 2006.
J. Tian, C. Kang, and J. Pearl, “A
Characterization
of
Interventional
Distributions in Semi-Markovian Causal
Models,” Proceedings of the TwentyFirst National Conference on Artificial
Intelligence, Boston, MA, AAAI Press, pp.
1239-1244, July 2006.
I. Shpitser and J. Pearl, “Identification of
Conditional Interventional Distributions,”
in R. Dechter and T.S. Richardson (Eds.),
Proceedings of the Twenty-Second
Conference on Uncertainty in Artificial
Intelligence, pp. 437-444, Corvallis, OR,
2006. (Co-winner of UAI-2006 Best
Student Paper)
C. Brito and J. Pearl, “Graphical Condition
for Identification in Recursive SEM,” in
R. Dechter and T. S. Richardson (Eds.),
ProceedingsoftheTwenty-SecondConference
on Uncertainty in Artificial Intelligence, pp.
47-54, Corvallis, OR, 2006.
M. Drinic, D. Kirovski, S. Megerian, and
M. Potkonjak, “Latency-Guided On-Chip
Bus Network Design,” IEEE Transactions
of Computer-Aided Design of Integrated
Circuits and Systems, Vol 25, No. 12, pp.
2663-2673, December 2006.
J. Feng, G. Qu, and M. Potkonjak, “ActuatorBased Infield Sensor Calibration,” IEEE
Sensors Journal, Vol. 6, No. 6, pp. 15711579, December 2006.
25
Selected Publications
J. Feng, G. Qu, and M. Potkonjak,
“Kernel Density Estimation-Based Data
Correlation,” IEEE Sensors Journal, Vol.
6, No. 4, pp. 974-981, August 2006.
F. Koushanfar, N. Taft, and M. Potkonjak,
“Sleeping Coordination for Comprehensive
Sensing Using Isotonic Regression and
Domatic Partitions,” IEEE Infocom,
Barcelona, Spain, April 2006.
J. Feng, L. Girod, and M. Potkonjak,
“Location Discovery Using Data-Driven
Statistical Error Modeling,” IEEE Infocom,
Barcelona, Spain, April 2006.
P. Reiher, S. K. Makki, N. Pissinou,
K. Makki, M. Burmester, T. Van, and T.
Ghosh, “Research Directions in Security
and Privacy for Mobile and Wireless
Networks,” chapter in Mobile and Wireless
Security and Privacy (Ed. S. K. Makki,
P. Reiher, K. Makki, N. Pissinou, and S.
Makki), Springer Verlag, 2007.
V. Ramakrishna, K. Eustice, and P. Reiher,
“Negotiating Agreements Using Policies
in Ubiquitous Computing Scenarios,”
IEEE International Conference on ServiceOriented Computing and Applications
(SOCA) 2007, June 2007.
C. Weddle, M. Oldham, J. Qian, A. Wang,
P. Reiher, and G. Kuenning, “PARAID:
A Gear-Shifting Power Aware RAID,”
Proceedings of the Fifth USENIX Conference
on File and Storage Technologies (FAST),
February 2007.
A. Wang, P. Reiher, G. Popek, and G.
Kuenning, “The Conquest File System:
Better Performance Through a Disk/RAM
Hybrid File System,” ACM Transactions
on Storage, Vol. 3, No. 2, pp. 1-40, 2006.
G. Oikonomu, J. Mirkovic, P. Reiher, M.
Robinson, “A Framework for Collaborative
DDoS Defense,” Annual Computer Security
Applications Conference, December 2006.
T. Yeh, P. Faloutsos, S. Patel, and G.
Reinman, “ParallAX: An Architecture
for Real-Time Physics,” 34th Annual
International Symposium on Computer
Architecture, June 2007.
26
Y. Ma, Z. Li, J. Cong, X. Hong, G. Reinman,
S. Dong, and Q. Zhou, “Micro-Architecture
Pipelining Optimization with ThroughputAware Floorplanning,” 12th Asia and South
Pacific Automation Conference, January
2007.
A. Shayesteh, G. Reinman, N. Jouppi,
S. Sair, and T. Sherwood, “Improving the
Performance and Power Efficiency of
Shared Helpers in CMPs,” International
Conference on Compilers, Architecture,
and Synthesis for Embedded Systems,
October 2006.
7/2006 - 6/2007
H. Shimonishi, M. Sanadidi, and T. Murase,
“Assessing The Interaction Among Legacy
and High Speed TCP Protocols,” PFLDnet
2007, Marina Del Rey, CA, Februay 2007.
H. Shimonishi, T. Hama, M. Sanadidi,
M. Gerla, and T. Murase, “TCP Westwood
with Low Priority for QOS Overlay,”
IEICE Transactions on Communications,
Special Issue on Networking Technologies
for Overlay Networks, September 2006.
V. Moshnyaga, H. Vo, G. Reinman, and
M. Potkonjak, “Handheld System Energy
Reduction by OS-Driven Refresh,” Power
and Timing Modeling, Optimization, and
Simulation (PATMOS), September 2006.
R. Jafari, H. Noshadi, S. Ghiasi, and M.
Sarrafzadeh, “Adaptive Electrocardiogram
FeatureExtractiononDistributedEmbedded
Systems,” IEEE Transactions on Parallel
and Distributed Systems, Special Issue on
High Performance Computational Biology
(TPDS), Vol. 17, No. 8, pp. 1-11, August
2006.
G. Reinman and G. Pitigoi-Aron,
“Trace Cache Miss Tolerance for Deeply
Pipelined Superscalar Processors,” in IET
Proceedings on Computers and Digital
Techniques, September 2006.
S. Nakatake, Z. Karimi, T. Taghavi, and
M. Sarrafzadeh, “Block Placement
to Ensure Channel Routability,” ACM
Great Lakes Symposium on VLSI
(GLSVLSI), Maggiore, Italy, March 2007.
J. Bethencourt, A. Sahai and B. Waters,
“Ciphertext-Policy Attribute-Based Encryption,”
IEEE Symposium on Security and Privacy, pp.
321-334, 2007.
A. Nahapetian, P. Lombardo, A.
Acquaviva,
L.
Benini,
and
M.
Sarrafzadeh, “Dynamic Reconfiguration
in Sensor Networks with Regenerative
Energy Sources,” Design Automation and
Test Europe, Nice, France, April 2007.
Y. Ishai, E. Kushilevitz, R. Ostrovsky, and
A. Sahai, “Zero-Knowledge from Secure
Multiparty Computation,” STOC 2007, pp.
21-30, 2006.
V. Goyal, O. Pandey, A. Sahai, and B.
Waters, “Attribute-Based Encryption for
Fine-Grained Access Control of Encrypted
Data,” ACM Conference on Computer and
Communications Security, pp. 89-98, 2006.
Y. Ishai, E. Kushilevitz, R. Ostrovsky, and
A. Sahai, “Cryptography from Anonymity,”
FOCS, pp. 239-248, 2006.
B. Barak, M. Prabhakaran, and A.
Sahai, “Concurrent Non-Malleable Zero
Knowledge,” FOCS, pp. 345-354, 2006.
G. Marfia, C. Palazzi, G. Pau, M. Gerla, M.
Sanadidi, and M. Roccetti, “TCP Libra:
Exploring RTT-Fairness for TCP,” IFIP
Networking 2007, Atlanta, GA, May 2007.
T. Taghavi, A. Nahapetian, and M.
Sarrafzadeh, “System Level Estimation
of Interconnect Length in the Presence of
IP Blocks,” IEEE International Symposium
on Quality Electronic Design (ISQED),
San Jose, CA, March 2007.
T. Massey, T. Gao, M. Welsh, J. Sharp,
and M. Sarrafzadeh, “The Design of a
Decentralized Electronic Triage System,”
American Medical Informatics Association
(AMIA), Washington, DC, November
2006.
S. Manay, D. Cremers, B.-W. Hong, A.
Yezzi, and S. Soatto, “Integral Invariants
for Shape Matching,” IEEE Transactions on
Pattern Analysis an Machine Intelligence,
28 (10), pp. 1602-1618, 2006.
Selected Publications
D. Cremers, S. J. Osher, and S. Soatto,
“Kernel Density Estimation and Intrinsic
Alignment
for
Knowledge-Driven
Segmentation: Teaching Level Sets to
Walk,” International Journal of Computer
Vision, 69(3), pp. 335-351, 2006.
R. Vidal, Y. Ma, S. Soatto, and S. Sastry,
“Two-View Multibody Structure from
Motion,”International Journal of Computer
Vision, 68(1), pp. 7-25, 2006.
P. Favaro and S. Soatto, 3-D Shape
Estimation and Image Restoration:
Exploiting Defocus and Motion Blur,
Springer Verlag, ISBN 1846281768,
December 2006.
A. Duci, A. Yezzi, S. Soatto, and K. Rocha,
“Harmonic Embedding for Linear Shape
Analysis with Application to Eulerian
Thickness Estimation,” Journal of
Mathematical Imaging and Vision, 25(3),
pp. 341-352, October 2006.
F. Qureshi, D. Terzopoulos, “Surveillance
in Virtual Reality: System Design and
Multicamera Control,” Proceedings IEEE
Conference on Computer Vision and
Pattern Recognition (CVPR’07), pp. 1-8,
June 2007.
W. Shao and D. Terzopoulos, “Populating
Reconstructed
Archaeological
Sites
with Autonomous Virtual Humans,”
Proceedings 6th International Conference
on Intelligent Virtual Agents (IVA 06),
Marina Del Rey, CA, August 2006. In
Intelligent Virtual Agents, Lecture Notes in
Artificial Intelligence, Vol. 4133, J. Gratch
et al. (eds.), Springer-Verlag, Berlin, pp.
420-433, 2006.
F. Qureshi and D. Terzopoulos,
“Surveillance Camera Scheduling: A
Virtual Vision Approach,” Multimedia
Systems, 12(3), pp. 269-283, December
2006. (VSSN 2005 Outstanding Paper)
J. Kim, S. Kim, H. Ko, and D. Terzopoulos,
“Fast GPU Computation of the Mass
Properties of a General Shape and its
Application to Buoyancy Simulation,” The
Visual Computer, 22(9-11), pp. 856-864,
September 2006.
S.-H. Lee and D. Terzopoulos, “Heads
up! Biomechanical Modeling and
Neuromuscular Control of the Neck,” ACM
Transactions on Graphics, 25(3), pp. 11881198, August 2006. (Proceedings ACM
SIGGRAPH 06 Conference, Boston, MA,
August, 2006.)
Y. Bai, F. Wang, P. Liu, C. Zaniolo, and S.
Liu, “RFID Data Processing with a Data
Stream Query Language,” Proceedings
ICDE, pp. 1184-1193, 2007.
7/2006 - 6/2007
R. Oliveira, B. Zhang, and L. Zhang,
“Observing the Evolution of Internet AS
Topology,” ACM SIGCOMM, August
2007.
V. Pappas, D. Massey, and L. Zhang,
“Enhancing DNS Resilience against Denial
of Service Attacks,” IEEE/IFIP Dependable
Systems and Networks (DSN), June 2007.
L. Wang, D. Massey, and L. Zhang,
“Persistent Detection and Recovery of State
Inconsistencies,” Computer Networks, Vol.
51, No. 6, pp. 1444-1458, April 2007.
R. Oliveira, B. Zhang, D. Pei, R. IzhakRatzin, and L. Zhang, “Quantifying Path
Exploration in the Internet,” ACM Internet
Measurement Conference 2006, November
2006.
M. Lad, D. Massey, and L. Zhang,
“Visualizing Internet Routing Changes,”
IEEE Transactions on Visualization and
Computer Graphics, November 2006.
Y. Bai, H. Thakkar, H. Wang, and C.
Zaniolo,
“Optimizing
Timestamp
Management in Data Stream Management
Systems,” Proceedings ICDE, pp. 13341338, 2007.
X. Zhou, F. Wang, and C. Zaniolo,
“Efficient Temporal Coalescing Query
Support in Relational Database Systems,”
Proceedings DEXA, pp. 676-686, 2006.
Y. Bai, H. Thakkar, H. Wang, C. Luo, and
C. Zaniolo, “A Data Stream Language
and System Designed for Power and
Extensibility,” Proceedings CIKM, pp.
337-346, 2006.
* Publications have been limited to five per faculty.
Photos by Yves Rubin
27
Computer Science Department Flies High in Citation Ranking
Citations are often statistically a strong indicator of the
strength of research programs, and recently there has been
a proliferation of citation databases. These databases include Citeseer (http://citeseer.ist.psu.edu/), Google Scholar
(http://scholar.google.com/), and Microsoft Libra (http://
libra.msra.cn/). Using these modern citation databases, the
department embarked upon an initial analysis of its citation
ranking, with the understanding that these databases might
be incomplete and even sometimes inaccurate; e.g., a fairly
common problem in these databases is that one person may
have several entries, depending how his/her name is listed,
thus reducing the total citation count. That aside, the results
of our analysis have proved to be very positive.
The most common ranking method is one that is based on
the total number of times a paper is cited. Several of our
faculty have remarkably high rankings: Deborah Estrin is
ranked 11th by Libra and 30th by Citeseer; Lixia Zhang is
ranked 29th and 15th, and Demetri Terzopoulos 113th and
87th. Additionally, two of our emeriti faculty have excellent rankings: Judea Pearl is ranked as the 90th most-cited
researcher by Libra and as the 40th in Citeseer; Leonard
Kleinrock is ranked 233rd and 213th, respectively. We have
three faculty listed in the first 300 most-cited in Libra, and
four more in the first 1,000 by Citeseer.
Microsoft Libra also provides useful information that ranks
researchers in each subfield of computer science. UCLA’s
Computer Science Department is also doing very well by
this metric. For example, in software Jens Palsberg ranks
in the first hundred most-cited, and so do Richard Muntz,
Lixia Zhang and Deborah Estrin in operating systems. Our
hardware and architecture group has a very strong citation
record, with three faculty members in the top 40—Jason
Cong, Miodrag Potkonjak, and Majid Sarrafzadeh (ranked
3rd, 11th, and 38th, respectively). The networking and
communications group is our most highly cited research
group. In fact, this group is, by a significant margin, the
most cited networking group in the world. Deborah Estin,
Lixia Zhang, Mario Gerla, and Leonard Kleinrock are the
2nd, 4th, 21st, and 37th most-cited researchers in networking. We also have an excellent ranking in several artificial
intelligence fields and vision, multimedia, and graphics. For
example, Judea Pearl is the most-cited AI author and 22nd
most-cited researcher in machine learning. Richard Korf is
among the 100 most-cited AI authors. Demetri Terzopoulos is the 8th most-cited author in graphics, 11th in vision,
and 20th in multimedia. Our multimedia strength is further
augmented by Richard Muntz and Deborah Estrin. Both
are ranked among the 100 most-cited researchers in that
28
area. Carlo Zaniolo is among the 100 most-cited researchers in databases, and Rajive Bagrodia is the 18th most-cited
author in simulation. Our record is even better in several
other emerging and fast-growing areas. For example, Rafail
Ostrovsky is one of the 50 most-cited researchers in cryptography, Jungho Cho one of the 100 most-cited authors in
WWW, and Deborah Estrin and Miodrag Potkonjak are
among the 25 most-cited authors in embedded systems.
Another popular criterion is based on the h-index.1 The hindex indicates that an author has at least n papers, each with
at least n citations. Several of our faculty have very high hnumbers. For example, Deborah Estrin is currently ranked
2nd in the field of computer science.2 Mario Gerla, Judea
Pearl, Demetri Terzopoulos, Lixia Zhang, and our recently
appointed joint CS/Math faculty member Stanley Osher all
have h-indices above 50. Further, no other computer science department has as many faculty listed within the top-20
highest h-index ranking.3
Finally, and perhaps most importantly, many of our junior
faculty have very strong citation records. The h-index metric
does not consider the age factor, and this puts junior faculty
at a disadvantage. Yet a number of our junior faculty have
very high h-numbers. For example, according to Google
Scholar, the h-index for Songwu Lu is 30, Eleazar Eskin and
Amit Sahai 23, Rupak Majumdar 18, Eddlie Kohler 17, and
Todd Millstein 14.
In conclusion, the UCLA Computer Science Department is
very proud to have such a large group of highly active and
productive members whose publications have made a significant impact on the research community. Our citation
record is among the best in the nation.
1
2
3
J. E. Hirsch, “An index to quantify an individual’s scientific
research output,” PNAS 102(46):16569-16572, November
15, 2005.
P. Ball, “Achievements index climbs the ranks,” Nature,
Vol 448:737, August 16, 2007.
See http://www.cs.ucla.edu/~palsberg/h-number.htm.
Contracts & Grants Awarded: 2006-2007
Government
Title
Faculty
U.S. Army
Center for Advance Surgical and Interventional Technology (CASIT)
Petros Faloutsos
Army Research Laboratory
Exploratory Study of Performance Benefits Associated with a Substantially
Increased Interconnect Resource in Digital Information Processing
Miodrag Potkonjak
Design, Verification & Test of Integrated Gigascale Systems
Jason Cong
Active Vision for Dynamic 3D Battlespace
Stefano Soatto
Learning to Recognize for Visual Surveillance
Stefano Soatto
Defense Advanced Research
Projects Agency
Air Force Office of Scientific
Research
Office of Naval Research
National Aeronautics & Space
Administration
Advanced Reasoning for ISHM
Adnan Darwiche
National Science Foundation
Sensor Internet Sharing
Blogo Center: Infrastructure for Collecting, Mining, and Accessing Blogs
Platforms for Future Embedded Systems
Estimating Haplogype Frequencies
New Diections in Cryptographic Proof Systems
Building the Next Generation Global Routing Monitoring Systems
Optimization and Games in Inter-Domain Routing
Joint Models of Photometric, Geometric & Dynamic Characteristics of Video
Imagery for Segmentation, Classification & Synthesis, Including Layers
Frontier Opportunities in Computing for Underrepresented Students (FOCUS)
John Cho
John Cho
Jason Cong
Eleazar Eskin
Amit Sahai
Lixia Zhang
Lixia Zhang
Stefano Soattoa
Stefano Soatto
Cardenas/Smallberg
National Insitutes of Health
Program Project Grant (Medical School)
Hypothesis Web
Center for Computational Biology
Adnan Darwiche
Parker/Chu
Stefano Soatto
Industry
Title
Faculty
Semiconductor Research
Corp.
Physical Synthesis for Power Under Process Variation
Jason Cong
Stanford Research Institute
Cyber-Threat Analysis
Amit Sahai
STMicroelectronics
Mesh Networks: Ad Hoc Backbone Design & Management
Mario Gerla
Xerox Corp
Secure Cryptographic Protocols from Anonymity
Rafail Ostrovsky
Broadata.Com
Ultra-High-Speed Transport Protocol and Architecture
Mario Gerla
Hughes
Systems Biology Development
Joseph DiStefano
IBM
Thermal-Driven & Timing-Driven Floor Planning & Placement
Networks and Information Sciences International Technology Alliance
Jason Cong
Mario Gerla
Altera Corp/Magma Design/
Xilinx Inc.
Synthesis and Optimization for Gigascale (UC Micro)
Jason Cong
STMicroeletronics
Online Arithmetic Approach to Floating-Point Operations on Massively Parallel Fixed-Point Units (UC Micro)
Milos Ercegovac
29
Contracts & Grants Awarded: 2006-2007
Industry
Sun Microsystems
Cisco Systems
Academic Institutions
Title
Understanding the Global Routing System and the Internet
Topology Evolution
A BGP Visualization and Diagnosis Toolset for Internet
Operators
Title
Faculty
Lixia Zhang
L:ixia Zhang
Faculty
UC Discovery
High-Performance Transpacific Transport
Medy Sanadidi
University of Princeton
New Directions in Learning and Clustering
Amit Sahai
University of Virginia
Error-Free Robust and Trusted Giga-Scale Electronics
Miodrag Potkonjak
UCLA Faculty Resesearch Program
Protecting Private Information in Online Social Network
Wesley Chu
UCLA Faculty Research Program
Drug Exposure Side Effects from Mining Pregnancy Data
Wesley Chu (Co-PI)
UC Santa Barbara
Management & Analysis of Environmental Observatory Data
using the Kepler Scientific Workflow System
Deborah Estrin
Photos by Yves Rubin
30
Highlights & Awards
John Cho—2006 Northrop Grumman Excellence in Teaching Award for his commitment to
high teaching standards and inclusion of up-to-date topics to assist students in bridging their
understanding from theory to real-world applications.
Adnan Darwiche and graduate student Knot Pipatsrisawat—2007 first place gold medal winners in the 2007 International SAT competition for their satisfiability solver, Rsat. • 2007
election to Fellow of the Association for the Advancement of Artifical Intelligence (AAAI) for
significant contributions to the development and application of both probabilistic and logical
methods in automated reasoning.
Joseph DiStefano—2006 induction as Senior Fellow of the Biomedical Engineering Society
for his exceptional achievement and accomplishment in a specific field of interest within biomedical engineering.
Deborah Estrin—2007 Women of Vision award from the Anita Borg Institute, in recognition of her significant contributions to technology innovation. • 2007 election to Fellow of the
American Academy of Arts and Sciences for preeminent contributions to her discipline and
to society at large.
Gerald Estrin—2006 Lifetime Contribution Award from the Henry Samueli School of Engineering in recognition of his long commitment to the School and to the fields of engineering
and computer science.
Jens Groth—2007 Chancellor’s Award for Postdoctoral Research for his work (with Rafail
Ostrovsky and Amit Sahai) in the area of new non-interactive zero-knowledge proofs.
Alan Kay—2007 Honoris Causa Degree in Informatica from the University of Pisa, Italy, for his
contributions to the development of the personal computer and object-oriented programming.
Boris Kogan and graduate student Ray Huffaker—2007 Poster of Excellence Award (2nd
place) for their poster, “Effects of Early Afterdepolarizations on Reentry in Cardiac Tissue.”
Eddie Kohler—2007 Sloan Research Fellowship from the Alfred P. Sloan Foundation, in
recognition of faculty who show the most outstanding promise toward making fundamental
contributions to new knowledge.
Leonard Kleinrock—2007 Honorary Doctorate of Humane Letters from the University of
Judaism, Los Angeles.
Rafail Ostrovsky—2007 Plenary Invited Speaker, International Workshop on Practices &
Theory in Public Key Cryptography, China, 2007. • 2006 Xerox Innovation Faculty Award.
• 2006 Xerox Distinguished Lecture Series Invited Speaker.
Judea Pearl—2007 Honorary Doctor of Science from the University of Toronto in recognition of his groundbreaking contributions to the field of computer science and his efforts to
promote cross-cultural dialogue and reconciliation.
Lixia Zhang—2006 election to Fellow of the Association for Computing Machinery (ACM)
for contributions to protocol designs for packet switched networks.
Photos by Yves Rubin
31
Doctoral Student Placement: Academic Year 2006-2007
32
Ph.D. Student
Academia/Industry
Title
Advisor
Chen Avin
Ben Gurion University
Assistant Professor
Judea Pearl
Philip Lewis Brisk
Swiss Inst. Tech. Lausanne
Postdoc
Majid Sarrafzadeh
Christine Hueifang Chih
Aerospace Corp.
Member Technical Staff
D. Stott Parker
Yiping Fan
Auto ESL Design Tech.
Co-Founder & Engr Director
Jason Cong
Alex Fukunaga
Tokyo Institute Technology
Assistant Professor
Richard Korf
Benjamin Greenstein
Intel
Member Technical Staff
Deborah Estrin
Christian Grothoff
University of Denver
Assistant Professor
Jens Palsberg
Roozbeh Jafari
University of Texas
Assistant Professor
Majid Sarrafzadeh
Zhengrong Ji
Google
Member Technical Staff
Rajive Bagroida
Eren Kursun
IBM
Member Technical Staff
Glenn Reinman
Li Lao
Google
Member Technical Staff
Mario Gerla
Yan Nei Law
Bioinformatic Institute
Postdoc - Singapore
Carlo Zaniolo
Ming Li
Ask.Com
Member Technical Staff
Yuval Tamir
Yizhou Lin
Magma Design Automation
Member Technical Staff
Jason Cong
Shaorong Liu
IBM - Almaden
Member Technical Staff
Wesley Chu
Yongxiang Liu
Nvidia Graphics
GPU Architect
Glenn Reinman
Xiaoqiao Meng
NEC Labs
Research Staff Member
Songwu Lu
Alexandros Ntoulas
Microsoft
Member Technical Staff
Deborah Estrin
Vasileios Pappas
IBM Research
Member Technical Staff
Lixia Zhang
Joon Sang Park
Hong-IK University
Assistant Professor
Mario Gerla
Anahita Shayesteh
Intel
Member Technical Staff
Glenn Reinman
Athanasios Stathopoulos
UCLA
Postdoc
John Cho
Tony Sun
Packet Motions
Sr. Software Engineer
Mario Gerla
Saurabh Tewari
Yahoo
Member of Technical Staff
Leonard Kleinrock
Shailesh Vaya
IIT Madras
Visiting Professor
Rafail Ostrovsky
Hanbiao Wang
St. Jude Medical
Researcher
Deborah Estrin
Michael Joseph William
Boeing
Researcher
Michael Dyer
Jennifer Lee Wong
SUNY
Assistant Professor
Miodrag Potkonjak
Min Xie
KBC Financial Products
Development
Jason Cong
Guang Yang
Yahoo
Member Technical Staff
Mario Gerla
Hao Yang
IBM Research
Member Technical Staff
Songwu Lu
Hung-Chih Yang
Yahoo
Member Technical Staff
D. Stoff Parker
Yan Zhang
Magma Design Automation
Member Technical Staff
Jason Cong
Zhiru Zhang
Auto ESL Design Tech.
Co-Founder & Engr Director
Jason Cong
Junlan Zhou
Microsoft
Member Technical Staff
Rajive Bagrodia
Xin Zhou
Teradata
Software Engineer
Carlo Zaniolo
Computer Science Department Alumni Advisory Board
Mission Statement: To promote the communication, growth, and shared activities of UCLA Computer Science Department alumni, faculty and students.
The Board has represented the department’s several generations of alumni since its foundation in the fall of 1969, and its
composition reflects the major fields of computer science.
The Board will meet on a quarterly basis and, in keeping with its mission, will be involved in a number of activities—including
the department's Annual Research Review, the career panel and job interview workshop for graduating students, the Rose
Bowl pre-game tailgate party for UCLA’s homecoming football game, and other activities that are posted on the department’s
alumni web site (http://www.cs.ucla.edu/csd/people/alumni).
Mr. Ric Pozo (Alumni Chair)
Director, Space & Airborne Systems Center
Raytheon Company, El Segundo, CA
Carey Nachenberg
Symantec Fellow, VP
Symantec Corporation, Northridge, CA
Braulio Estrada, Analyst
Accenture (formerly Andersen Consulting)
El Segundo, CA
Maria H. (Lolo) Penedo, Ph.D.
NGMS Technical Fellow
Northrop Grumman, Carson, CA
Dr. Don Calhoun
Former Executive Director
Hughes Electronics, Redondo Beach, CA
Mr. John Rosati
Managing Director, XRoads Solutions
Group, Los Angeles, CA
Dr. William R. Goodin, Manager
Short Course Program
UCLA Extension, Los Angeles, CA
Dr. James Winchester
Avionic Products Inc.
Beverly Hills, CA
Mr. Andrew J. Louie
Vice President of Information Technology
Iris International, Chatsworth, CA
Dr. Behzad Zamanzadeh, Engineering
Director, Domain Match, Yahoo Inc.
El Segundo, CA
Dr. Alfonso Cardenas (Faculty Chair)
UCLA Computer Science Department
Mr. David Smallberg (Faculty Co-Chair)
UCLA Computer Science Department
33
Undergraduate Program
T
he Computer Science Department offers B.S. degrees both in computer
science and in computer science and engineering. The B.S. in computer
science and engineering is designed to accommodate those students who desire
a strong foundation in computer science but who also have a strong interest in
computer system hardware. Both majors are approved by the Accreditation
Board for Engineering and Technology (ABET).
program
The Computer Science & Engineering undergraduate
program educational objectives are that our alumni:
• Make valuable technical contributions to design,
development, and production in their practice
of computer science and related engineering or
application areas, particularly in software systems and
algorithmic methods.
• Make valuable technical contributions to design,
development, and production in their practice of
computer science and computer engineering in
related engineering areas or application areas, and at
the interface of computers and physical systems.
• Demonstrate strong communication skills and the
ability to function effectively as part of a team.
• Demonstrate strong communication skills and the
ability to function effectively as part of a team.
• Demonstrate a sense of societal and ethical responsibility
in their professional endeavors.
• Demonstrate a sense of societal and ethical
responsibility in their professional endeavors.
• Engage in professional development or post-graduate
education to pursue flexible career paths amid future
technological changes.
• Engage in professional development or postgraduate education to pursue flexible career paths
amid future technological changes.
The Computer Science undergraduate
educational objectives are that our alumni:
The department has an undergraduate advisory board consisting of representatives from industry, other academic institutions,
alumni, and students. The board meets twice a year to review the computer science program and refine the department’s goals
and program objectives.
Undergraduate Program Advisory Board Members
Shaun Ahmagian, UCLA CS Undergraduate
Leon Alkalai, JPL & UCLA CS Dept
Joseph Bannister, USC, ISI
Peter Blankenship, Northrop Grumman
Philip Brisk, UCLA CS Grad Student
Doug Caldwell, Ecliptic Enterprises
Jon Canon, Windows Microsoft
Paul Eggert, UCLA CS Dept
Ryan Kastner, UCSB
Pekka Kostamma, Teradata
Geoff Kuenning, Harvey Mudd College
34
Ani Nahapetian, UCLA CS Grad Student
Ross Stewart Niebergall, Raytheon
Nima Nikzad, UCLA CS Undergraduate
Joseph Ou-Yang, IBM
David Rennels, UCLA CS Dept
John Rosati, XRoads Solutions
Mike Sievers, Time Logic, Inc.
Akhilesh Singhania, UCLA EE Undergraduate
David Smallberg, UCLA CS Dept
Mike Todd, Google
Behzadeh Zamazadeh, Reuters America
Programs and Annual Events
Industrial Affiliate Program
Jon Postel Lecturer Series
Annual Research Review
The Computer Science Department is committed to maintaining
strong ties to industry, collaborating on state-of-the-art research, and
engaging in a mutually beneficial
exchange of information regarding
advances in technology. The department’s Industrial Affiliate Program facilitates these goals while
also providing many benefits to its
affiliate members. These benefits
include such services as attention to
member recruiting needs (including
student listings, resumes, and on-site
interviews), facilitating summer internships, invitations to the department’s Annual Research Review
and Distinguished Lecturer Series,
reprints of relevant in-house technical reports and conference papers,
and hosting industrial visitors. For
details, see: http://www.cs.ucla.edu/
csd/research/affiliates/list.html.
The Jon Postel Lecturer Series is
dedicated to the memory of Dr.
Jon Postel—an alumnus of UCLA’s
Computer Science Department, a
quiet and gentle man, a brilliant and
dedicated scientist who made many
key contributions to the formative
days of the ARPANET. Each year
the Computer Science Department
hosts a series of lectures by worldrenowned scientists in academia and
industry, covering a broad range of
topics that are timely and relevant to
today’s high-technology world.
Each spring, the Computer Science
Department participates in the Annual Research Review—an event
sponsored by the Henry Samueli
School of Engineering and Applied
Science that showcases research
results from all seven of the departments within the engineering
school. This year’s Review was especially successful, with about 400
people attending or participating.
In addition to the many technical
presentations and panel discussions
by faculty and distinguished guests,
a significant portion of each year’s
review is devoted to a very large
and successful poster session that
attracts many enthusiastic visitors.
Here, our emerging Ph.D. students
have an opportunity to describe
their research results to faculty and
classmates, as well as to industrial
guests who are often scouting for
talented researchers who desire careers in industry.
Amgen
2007-2008 Lecturers
Douglas Comer
Cisco Systems/Purdue University
Lessons Learned from
the Internet Project
October 4, 2007
Rajeev Alur
University of Pennsylvania
Architecture-Aware Analysis of
Concurrent Software
November 8, 2007
Google
Magma Design Automation, Inc.
Mauro Sentinelli
Northrop Grumman MS-TSD
Northrop Grumman MS-SRD
Raytheon
Samsung Electronics Co., Ltd
Sony
Sun Microsystems Labs, Inc.
Toshiba
Mentor Graphics
Symantec
Russell H. Taylor
Johns Hopkins University
Medical Robotics and ComputerAssisted Surgery
January 15, 2008
Stan Zdonik
Brown University
Data Management for New
Applications
May 1, 2008
John Gregory Morrisett
Harvard University
An Ultimate Type System
May 6, 2008
Lectures from previous years can be
viewed at http://www.cs.ucla.edu/csd/
research/postel2006.html
35
Graduate Student Life
The University of California, Los Angeles, encompasses
over 419 acres in the foothills of the Santa Monica
mountains, and boasts near-perfect weather all year
around. Its architecture, theaters, concert halls,
museums, libraries, and sculpture and botanical gardens
supply the setting for everything from the ancient to the
avant-garde. Since its inception, the University has been
dedicated to preserving the past and creating the future.
The Computer Science Department is helping to create
that future with internationally recognized research in all
areas within the many fields of computer science. Our current achievements and those of the past, such as our key role in
the birth of the Internet 38 years ago, attract graduate applicants from every region in the United States, and indeed, from all
over the world.
In addition to campus aesthetics and the challenging intellectual climate, there are other challenges for our students to face—
such as the highly competitive basketball games between faculty and student teams, and the ever-popular softball games that
take place during the Computer Science Department’s annual picnic event.
36
Industrial Affiliate Membership Program
Basic Membership in the Computer Science Department’s Industrial Affiliate Program entitles member companies
to many rewarding benefits:
• Customized assistance to member’s recruiting needs, including, but not limited to:
•
•
•
Graduate student listings and resumes (with degree objectives, expected date of graduation, etc.) in the areas of
interest to the member company.
On-site job interviews.
One technical talk per year at the department-wide seminar series to highlight member company’s research and
technology.
•
Interaction with faculty members in areas of interest: research collaboration, reference checking, summer
internships, and consulting.
•
Invitation to Annual Research Review hosted by the department and the Henry Samueli School of Engineering
and Applied Science, with up to five free admissions. Students and faculty showcase their current research, and
the Review provides a superb venue for the exchange of ideas between affiliate members and our
faculty/researchers.
• Invitation to attend the Computer Science Department’s Jon Postel Distinguished Lectures Series.
• In-house research reports and technical publications, and additional information on specific topics in computer science,
as available and on request.
The basic industrial affiliate membership fee is $10,000 per year. Through mutual agreement between the affiliate member
and the department, a faculty member will be assigned to serve as a liaison for the program.
Gold Membership in the Computer Science Department’s Industrial Affiliate Program entitles member companies to
all of the benefits provided under the basic membership, but in addition, gives these companies valuable opportunities for
an even closer liaison with the Computer Science Department and the School of Engineering:
• Close ties with a specified research laboratory or research center, including regular visits to facilitate exchange of
technology, research results, etc.
• Departmental visitor status (for up to 12 months) for one representative from the member company. This will
include office space in a specified laboratory/center and full access to our computer facilities, libraries, and other
research resources. Visitor will also be entitled to attend all classes and lectures and to freely interact with our faculty
and students.
• Position on the department’s Advisory Board, providing valuable input and receiving feedback concerning our
educational and research directions.
• Participation in the undergraduate senior-year project program, in which member companies can propose year-long
projects for teams of three to four students (under supervision of faculty advisor).
The industrial affiliate gold membership is $50,000 per year. Through mutual agreement between the affiliate member
and the department, the faculty director of the specified research laboratory or center is assigned to serve as a liaison for
the program.
37