
[Date Prev][Date Next][Date Index]
CSLI Calendar, Wednesday, 24 October 2007, vol. 23:8
CSLI CALENDAR OF PUBLIC EVENTS
______________________________________________________________________
24 OCTOBER 2007 Stanford Vol. 23, No. 8
______________________________________________________________________
A weekly publication of the
Center for the Study of Language and Information (CSLI)
a subdivision of H-Star, http://hstar.stanford.edu/
Stanford University, Cordura Hall, Stanford, CA 94305-4101
http://www-csli.stanford.edu/
____________
ACTIVITIES FROM 24 OCTOBER 2007 TO 2 NOVEMBER 2007
WEDNESDAY, 24 OCTOBER 2007
12:15pm Psychology Developmental Brownbags [24-Oct-07]
Jordan Hall 420:102
"Pretense-Reality distinction in children and adults"
Deborah Henderson
Stanford University
http://www-psych.stanford.edu/events_developmental.html
3:30pm SRI CCB Seminar Series [24-Oct-07]
AE201, SRI International
"The Genomic Nosology as a Foundation For Medical Evolutionary
Discovery"
Joel Dudley
Stanford University
mi .. at .. ai.sri.com
4:15pm EE380: Computer Systems Lab Colloquium [24-Oct-07]
Gates B03 (NEC Auditorium)
"Self-Improving Artificial Intelligence and the Future of Computation"
Steve Omohundro
Self-Aware Systems
http://ee380.stanford.edu/contents.html
Abstract below
THURSDAY, 25 OCTOBER 2007
9:00am Life in Motion Symposium [25-Oct-07]
Clark Center Auditorium
https://simtk.org/home/lifeinmotion
http://biox.stanford.edu/news/symposiums
Information below
12 noon CSLI CogLunch [25-Oct-07]
Cordura Hall 100
"Gödel, Nagel, Minds and Machines"
Solomon Feferman
Math, Stanford University
http://www-csli.stanford.edu/events/Coglunch/
Abstract below
12:15pm Stanford Networking Seminar [25-Oct-07]
Packard 101
"Rethinking Data Centers"
Chuck Thacker
Technical Fellow, Microsoft Research
http://netseminar.stanford.edu/
4:00pm PARC Forum [25-Oct-07]
George Pake Auditorium at PARC
"Inventing the Ink Jet Printer"
Edmond Kyser
http://www.parc.com/forum/
4:00pm UC Berkeley CIS Seminar [25-Oct-07]
Soda Hall 320 (UC Berkeley)
"Low Regret Algorithms for Multi-armed Bandits and MDPs"
Ambuj Tewari
UC Berkeley
http://www.cs.berkeley.edu/~ambuj/
http://www.cs.berkeley.edu/~rakhlin/cis-seminar
Abstract below
4:15pm SSP10: Symbolic Systems Forum [25-Oct-07]
Bldg. 380:380C (Math Corner)
"Let's Improve Machine Learning"
Oliver Selfridge
MIT Media Lab and BBN Technologies
http://symsys.stanford.edu/ssp_events
Abstract below
4:15pm Information Systems Seminar [25-Oct-07]
Packard 202
"Equi-energy sampling and its applications"
Wing Hung Wong
Stanford University
http://www.stanford.edu/group/wonglab/
http://isl.stanford.edu/colloquium.html
Abstract below
4:15pm Fundamental Themes in Neuroscience Seminar [25-Oct-07]
Munzer Auditorium, Beckman
"The Evolution of Primate Color Vision"
Jeremy Nathans
John Hopkins
http://www.mbg.jhmi.edu/FacultyDetails.asp?PersonID=372
http://nis-seminars.stanford.edu/
4:30pm Stanford Security Seminar [25-Oct-07]
Gates 4B center area (opposite 490)
"Attacks On the Netscape Browser plus Security Response
Philosophy and Methods"
Jim Roskind
Roskind Consulting
http://theory.stanford.edu/seclab/sem.html
Abstract below
FRIDAY, 26 OCTOBER 2007
11:00am UC Berkeley ICBS Colloquium [26-Oct-07]
Tolman 5101 (Berkeley)
"Boolean Maps and Visual Awareness."
Hal Pashler
Psychology, UC San Diego
http://icbs.berkeley.edu/
12:30pm CS547: Human-Computer Interaction Seminar [26-Oct-07]
Gates B01
"Designing a Health Care Interface"
Paul Tang
Palo Alto Medical Foundation
http://hci.stanford.edu/cs547/
Abstract below
2:00pm Stanford Tech Briefing [26-Oct-07]
Turing Auditorium, Polya Hall
"Podcasts, iTunes, and U !"
Mark Branom plus a panel
http://techbriefings.stanford.edu/
3:00pm Berkeley Information Access Seminar [26-Oct-07]
107 South Hall (Berkeley)
"The 1989 Loma Prieta Earthquake: Post-disaster Information Ecologies"
Megan Flynn
Berkeley
http://courses.ischool.berkeley.edu/i296a-1/f07/schedule.html
Abstract below
3:15pm Friday Cognitive Seminar [26-Oct-07]
Jordan Hall 420:050
"High-resolution fMRI of the medial temporal lobe during
delayed-match-to-sample"
Rosanna Olsen
Stanford University
http://www-psych.stanford.edu/events_cognitive.html
3:30pm Stanford Semantics and Pragmatics Workshop [26-Oct-07]
Margaret Jacks Hall 460:126
"Modeling and Explaining Similarity"
Patrick Pantel
USC Information Sciences Institute
http://www.patrickpantel.com/
http://www-linguistics.stanford.edu/semgroup/
Abstract below
SATURDAY, 27 OCTOBER 2007
all day Biomedical Computation at Stanford 2007 (BCATS) [27-Oct-07]
Cubberley Auditorium
http://bcats.stanford.edu/html/bcats-home.html
Information below
MONDAY, 29 OCTOBER 2007
12 noon Ethics@Noon [29-Oct-07]
Bldg. 60:61H
"Living into Leadership: A Journey Into Ethics"
Bowen "Buzz" McCoy
former partner of Morgan Stanley
http://www.stanford.edu/dept/EIS/lectures_ethics.html
3:45pm Social Lab [29-Oct-07]
Bldg. 160:326
"Violent Video Game Effects on Children and Adolescents"
Craig Anderson
Iowa State University
http://www-psych.stanford.edu/events_social.html
4:00pm UC Berkeley Ear Club [29-Oct-07]
3105 Tolman Hall (Berkeley)
"Binaural processing for robust automatic speech recognition"
Rich Stern
Computer Science, Carnegie Mellon U.
http://ear.berkeley.edu/ear-club-schedule.html
4:00pm UC Berkeley Linguistics Department Colloquium [29-Oct-07]
1 182 Dwinelle (Berkeley)
"Studying grammaticalization with diachronically-ordered
corpus data: it's more than counting words"
Martin Hilpert
International Computer Science Institute (ICSI)
http://linguistics.berkeley.edu/events/
Abstract below
TUESDAY, 30 OCTOBER 2007
4:15pm Mathematical Logic Seminar [30-Oct-07]
Bldg. 420:042
"Three dynamic topological logics and their very different
complexities"
David Fernandez
Stanford
http://www-logic.stanford.edu/
Abstract below
5:15pm Linguistics Department Colloquium [30-Oct-07]
Margaret Jacks Hall 460:126
"The Logical and Empirical Foundations of Baker's Learnability
Paradox"
Elizabeth Coppock
Linguistics, Stanford University
http://www-linguistics.stanford.edu/colloq/
Abstract below
WEDNESDAY, 31 OCTOBER 2007 - Halloween
10:00am IT Open House [31-Oct-07]
McCaw Hall, Arrillaga Alumni Center
http://itopenhouse.stanford.edu
12:15pm Psychology Developmental Brownbags [31-Oct-07]
Jordan Hall 420:102
"The clairvoyant in the crib:
prediction and learning in childhood and beyond"
Michael Ramscar
Stanford University
http://www-psych.stanford.edu/events_developmental.html
4:15pm EE380: Computer Systems Lab Colloquium [31-Oct-07]
Gates B03 (NEC Auditorium)
"The Challenges of Implementing Matlab(R)"
Randy Allen
Catalytic Inc
http://ee380.stanford.edu/contents.html
Abstract below
THURSDAY, 1 NOVEMBER 2007
8:45am Stanford University Oral Examination [1-Nov-07]
Packard 101
"Adaptive Interaction Techniques for Sharing and Reusing
Design Resources"
Brian Andrew Lee
PhD Student, HCI Group, Computer Science
http://graphics.stanford.edu/~balee/
http://cs.stanford.edu/calendar/abstract.php?eventId=2873
Abstract below
3:30pm Bio-X "Talks in English" [1-Nov-07]
Clark Center S360
"Bioengineering technology applied to the hard problems of psychiatry"
Karl Deisseroth
Bioengineering
http://biox.stanford.edu/news/tie.html
3:30pm Stanford Networking Seminar [1-Nov-07]
Packard 101
Title to be announced
Jonathan Turner
Washington University
http://www.arl.wustl.edu/~jst/
http://netseminar.stanford.edu/
4:00pm PARC Forum [1-Nov-07]
George Pake Auditorium at PARC
"Reinventing the media businesses"
John Warnock
Co-chairman of the Board of Directors of Adobe Systems, Inc.
http://www.parc.com/forum/
Abstract below
4:00pm UC Berkeley CIS Seminar [1-Nov-07]
Soda Hall 320 (UC Berkeley)
Title to be announced
Stuart Russell
UC Berkeley
http://www.cs.berkeley.edu/~russell/
http://www.cs.berkeley.edu/~rakhlin/cis-seminar
4:15pm SSP10: Symbolic Systems Forum [1-Nov-07]
Bldg. 380:380C (Math Corner)
"Are Emotions Beneficial or Detrimental for Human Decision Making?"
Baba Shiv
Graduate School of Business
http://symsys.stanford.edu/ssp_events
Abstract below
4:15pm Information Systems Seminar [1-Nov-07]
Packard 101
"An Information-theoretic view of Stochastic Resonance"
Venkat Anantharam
EECS Department, UC Berkeley
http://isl.stanford.edu/colloquium.html
Abstract below
4:15pm Fundamental Themes in Neuroscience Seminar [1-Nov-07]
Munzer Auditorium, Beckman
"Analog and Digital Intracortical Synaptic Communication"
David McCormick
Yale University
http://nis-seminars.stanford.edu/
FRIDAY, 2 NOVEMBER 2007
9:00am Stanford University Oral Examination [2-Nov-07]
Packard 101
"Supporting the Visualization and Analysis of Network Events"
Doantam Phan
HCI Group, Computer Science
http://graphics.stanford.edu/~dphan/
http://cs.stanford.edu/calendar/abstract.php?eventId=2872
Abstract below
12 noon Ethics@Noon [2-Nov-07]
Bldg. 100:101K
"Equity vs. Adequacy:
The State and the Distribution of K-12 Educational Opportunities"
Bill Koski
Stanford Law
http://www.stanford.edu/dept/EIS/lectures_ethics.html
Abstract below
12:30pm CS547: Human-Computer Interaction Seminar [2-Nov-07]
Gates B01
"`It's like a fire. You just have to move on':
Toward adaptive services for personal archiving"
Cathy Marshall
Microsoft Research
http://hci.stanford.edu/cs547/
Abstract below
2:00pm GRAI Seminar [2-Nov-07]
Gates 104
"Mesh-based Marker-less Motion Capture"
Edilson de Aguiar
MPI Informatik
http://cs.stanford.edu/people/theobalt/GRAI.html
2:15pm Stanford University Oral Examination [2-Nov-07]
Packard 101
"Designing Interactions that Combine Pen, Paper, and Computer"
Ron B. Yeh
HCI Group, Computer Science
http://graphics.stanford.edu/~ronyeh/
http://cs.stanford.edu/calendar/abstract.php?eventId=2871
Abstract below
3:00pm Berkeley Information Access Seminar [2-Nov-07]
107 South Hall (Berkeley)
Title to be announced
John Willinsky
Stanford
http://courses.ischool.berkeley.edu/i296a-1/f07/schedule.html
3:30pm Linguistics Department Colloquium [2-Nov-07]
Margaret Jacks Hall 460:126
"Clause Structure and Argument Realization in Tongan:
Evidence from Clitics"
Douglas Ball
Stanford
http://www-linguistics.stanford.edu/colloq/
4:30pm Stanford Security Seminar [2-Nov-07]
Gates 4B center area (opposite 490)
"The Drives Project: From Disk Forensics to Media Exploitation"
Simson Garfinkel
http://www.simson.net/cv
http://theory.stanford.edu/seclab/sem.html
Abstract below
____________
Stanford Blood Center: Shortage of O-, O+, A-, A+, B+, and AB-. For
an appointment: http://bloodcenter.stanford.edu/ or call 650-723-7831.
It only takes an hour of your time and you get free cookies. The
Blood Center is also raising money for a new bloodmobile; they need
$200,000 and have $80,000 so far.
____________
EE380: COMPUTER SYSTEMS LAB COLLOQUIUM
on Wednesday, 24 October 2007, 4:15pm to 5:30pm
Gates B03 (NEC Auditorium)
http://ee380.stanford.edu/contents.html
"Self-Improving Artificial Intelligence and the Future of Computation"
Steve Omohundro
Self-Aware Systems
We are on the verge of a radical new paradigm for both computer
software and hardware. "Self-improving systems" will have detailed
models of their own designs and will improve themselves by learning
from their own operation. They will continuously adapt themselves to
the tasks they need to perform. Eventually they will be able to
improve every aspect of themselves: their programs, programming
languages, specification logics, instruction sets, and hardware
architectures. In this talk we present fundamental principles that
underlie the operation of this kind of system. We show that they will
be governed by a fundamental microeconomic theory first developed by
von Neumann in 1944. This leads to a universal "Resource Balance
Principle" by which they will optimally allocate resources to their
subsystems, modules, and subprograms. It also provides the rational
basis by which they will select the timing and amount of effort to
devote to tasks like program compilation and data
compression. Self-improvement of hardware will push toward reversible
computation and atomically precise physical structures. We conclude
with a discussion of some of the broader social implications of this
kind of system.
About the speaker: Steve Omohundro is president and founder of
Self-Aware Systems, a think tank working to build wisdom into emerging
technologies. He has degrees in Physics and Mathematics from Stanford
and a Ph.D. in physics from Berkeley. He co-developed the StarLisp
programming language for the Connection Machine at Thinking
Machines. He was a computer science professor at the University of
Illinois at Champaign/Urbana and co-founded the Center for Complex
Systems Research there. He wrote the 3D graphics portion of
Mathematica as one of the original 7 developers for Wolfram
Research. At the International Computer Science Institute in Berkeley
he led an international team in developing the Sather language. There
and at the NEC Research Institute in Princeton he developed a number
of novel machine learning algorithms and built systems to read lips,
control robots, and learn grammars. More information and contact info
is available at: http://selfawaresystems.com/ and
http://steveomohundro.com/
____________
LIFE IN MOTION SYMPOSIUM
on Thursday, 25 October 2007, 9:00am-5:00pm
Clark Center Auditorium
http://biox.stanford.edu/news/symposiums
https://simtk.org/home/lifeinmotion
"Life in Motion Symposium"
Bio-X has teamed up with Stanford's National NIH Center for Physics
based Simulation of Biological Structures to hold a symposium
entitled, "Life in Motion". The goal of this symposium is to educate
students and scientists from different disciplines about the exciting
uses of simulations driven by the laws of physics and mechanics across
a range of scales, from molecules to organisms. The talks will be
presented by a series of experts and innovators from around the
world. Life in Motion will include a Poster session where Stanford
graduate students and postdoctoral fellows will present their
research.
SPEAKERS -
Mimi R. Koehl, University of California Berkeley
Robert J. Full, University of California Berkeley
Joachim Frank, HHMI
John R. Hutchinson, The Royal Veterinary College, Univ. of London
Klaus Schulten, University of Illinois at Urbana-Champaign
Claire J. Tomlin, Stanford University and University of California, Berkeley
Roger D. Kamm, MIT
Jessica K. Hodgins, Carnegie Mellon University
Vijay S. Pande, Stanford University
Demetri Terzopoulos, University of California, Los Angeles
For More Information:
http://simtk.org/home/lifeinmotion
http://biox.stanford.edu/news/symposiums
____________
CSLI COGLUNCH
on Thursday, 25 October 2007, 12 noon - 1:00pm
Cordura Hall 100
http://www-csli.stanford.edu/events/Coglunch/
"Gödel, Nagel, Minds and Machines"
Solomon Feferman
Math, Stanford University
Just fifty years ago, Ernest Nagel and Kurt Gödel became involved in a
serious imbroglio about the possible inclusion of Gödel's original
work on incompleteness in the book, Gödel's Proof, then being written
by Nagel with James R. Newman. What led to the conflict were some
unprecedented demands that Gödel made over the use of his material and
his involvement in the contents of the book--demands that resulted in
an explosive reaction on Nagel's part. In the end the proposal came to
naught. But the story is of interest because of what was basically at
issue, namely their provocative related but contrasting views on the
possible significance of Gödel's theorems for minds vs. machines in
the development of mathematics. That is our point of departure for the
attempts by Gödel, and later Lucas and Penrose, to establish
definitive consequences of those theorems, attempts which--as we shall
see--depend on highly idealized and problematic assumptions about
minds, machines and mathematics. In particular, I shall argue that
there is a fundamental equivocation involved in those assumptions that
needs to be reexamined. In conclusion, that will lead us to a new way
of looking at how the mind works in deriving mathematics that
straddles the mechanist and anti-mechanist viewpoints.
____________
UC BERKELEY CIS SEMINAR
on Thursday, 25 October 2007, 4:00pm-5:00pm
Soda Hall 320 (UC Berkeley)
http://www.cs.berkeley.edu/~rakhlin/cis-seminar
"Low Regret Algorithms for Multi-armed Bandits and MDPs"
Ambuj Tewari
UC Berkeley
http://www.cs.berkeley.edu/~ambuj/
While taking actions in an unknown probabilistic environment one faces
the well-known exploration vs. exploitation trade-off. On the one
hand, we would like to exploit our current knowledge of the
environment to choose actions that have been rewarding in the past.
On the other hand, we would like to explore actions that have not been
taken before as they might be potentially rewarding. The notion of
regret measures how much worse we perform compared to someone who has
complete knowledge of the environment. Achieving low regret in a rich
class of environments can be taken to be a sign of successfully making
the exploration vs. exploitation trade-off.
In this talk, I will describe algorithms for multi-armed bandit
problems and Markov decision processes (MDPs) that achieve low regret
over time. Even when started with absolutely no knowledge of the
environment they are faced with, these algorithms incur regret that
grows only logarithmically with time.
The `optimism in the face of uncertainty' heuristic is a common
feature of all these algorithms. After reviewing some known bandit
algorithms, I will show how the heuristic can be used to derive a new
algorithm, called Optimistic Linear Programming (OLP), that achieves
low regret in any irreducible MDP. OLP is closely related to an
algorithm proposed by Burnetas and Katehakis with four key
differences: OLP is simpler, it does not require knowledge of the
supports of transition probabilities, the proof of the regret bound is
simpler, but its regret bound is a constant factor larger than the
regret of their algorithm. OLP is also similar in flavor to an
algorithm recently proposed by Auer and Ortner. But OLP is simpler and
its regret bound has a better dependence on the size of the MDP.
(Joint work with Peter Bartlett.)
____________
SSP10: SYMBOLIC SYSTEMS FORUM
on Thursday, 25 October 2007, 4:15pm
Bldg. 380:380C (Math Corner)
http://symsys.stanford.edu/ssp_events
"Let's Improve Machine Learning"
Oliver Selfridge
MIT Media Lab and BBN Technologies
Today, in Artificial Intelligence (AI), Machine Learning is a vigorous
and flourishing field. I believe that we can and ought to do more. My
overall recommendation for ML is that now we should find out how to
produce cognitive software that can be at least partly educated
instead of having to be carefully programmed. The software must be
able to learn not only how to accomplish the top level desired task,
but also how to check and improve its performance on a continuing
basis at many different levels.
There are four main topics in human learning that are mainly not even
considered in most of ML. The first is what I have termed purpose
structure; which means that software should care! The idea of purpose
structures is to build software out of modules each of which has a
success function, so that changes in them can be assessed to assure
continuing improvement. The second topic is: how are the conclusions
of ML in a piece of cognitive software to be remembered, so that what
has been learned can be applicable again in later and perhaps different
circumstances? The third topic is that anything learned by people is
rarely handled as an isolated and independent piece of knowledge;
rather, it is embedded in a structure of some conceptual models. The
fourth topic is: how are the conclusions of ML in a piece of cognitive
software to be shared with other cognitive agents?...what kind of
languages should be used? ~W for most of what we know we learned from
others, not from our own experiences.
None of those general topics has been much faced in AI, let alone in
ML. On top of that, the cognitive software must work in environments
that are continually changing at all levels, including the overall
standards of success. We need to analyze those points and put them in
some kind of order so as to be able to analyze and attack them. Then
we can propose a program that will diverge ~E and then we can take the
one less traveled by~E perhaps that will make all the difference! And
perhaps we can then break new boundaries in AI.
____________
INFORMATION SYSTEMS SEMINAR
on Thursday, 25 October 2007, 4:15pm-5:15pm
Packard 202
http://isl.stanford.edu/colloquium.html
"Equi-energy sampling and its applications"
Wing Hung Wong
Stanford University
http://www.stanford.edu/group/wonglab/
We will review the method of equi-energy sampling for Monte Carlo
simulation. Based on an energy-temperature duality, this method can
provide estimates of micro-canonical as well as canonical averages. We
will discuss how the equi-energy sampler can be exploited to obtain
certain global information about a distribution (such as a posterior
distribution) that is otherwise hard to extract.
About the Speaker: Wing Hung Wong received B.A. degrees in Mathematics
and Statistics from the University of California, Berkeley in 1976,
the M.S. and Ph.D. degrees in Statistics and the M.S. degree in
Computer Science from the University of Wisconsin, Madison in 1978 and
1980 respectively. He was a Professor at the University of Chicago
(1980-1994), at the Chinese University of Hong Kong (1994-1997), at
the University of California, Los Angeles (1997-2000), and at Harvard
University (2000-2004), before becoming a joint Professor in the
Department of Statistics and the Department of Health Research and
Policy at Stanford University. He is a Fellow of the Institute of
Mathematical Statistics, the American Statistical Association, the
American Association for the Advancement of Science. He is also a
Rustagi and Neyman lecturer. Dr. Wong's lab develops methods and
software for the analysis of the data from high throughput genomics
projects. They have developed the software package dChip for the
analysis of data from high-density DNA arrays that contain hundreds of
thousands of DNA probes.
____________
STANFORD SECURITY SEMINAR
on Thursday, 25 October 2007, 4:30pm
Gates 4B center area (opposite 490)
http://theory.stanford.edu/seclab/sem.html
"Attacks On the Netscape Browser plus Security Response
Philosophy and Methods"
Jim Roskind
Roskind Consulting
The Netscape Communicator client was deployed on millions of
desktops. It was also subject to attacks that attempted to gain
unauthorized access to data on the client's computers, if not complete
control of the computer. This talk discusses a broad range of examples
of attacks that have been proposed against the Communicator
application along with ways that the application evolved to block
them.
Although the talk discusses numerous actual attacks across the history
of Netscape, it also works to abstract elements of attacks, and show
how they assemble to form exploits. The start of the talk, first
presented in RSA2001, discusses 6 noteworthy historical attacks. The
attacks include DNS False Advertising (not, DNS compromise!), Java
class verifier vulnerability to a multi-thread attack, JavaScript
Language feature creating a cache handling vulnerability, Java symbol
table overrun, FILE: URL facilitating invasion of privacy, and
insufficient HTML escaping browser side (not server side!).
As a bonus (not presented in RSA2001), a more generic discussion of
issues surrounding security responses to identified security bugs is
presented. The resolution to some of the above problems reveals that
security patching is significantly different from software bug repair,
and that fact needs to be used by response teams. The discussion
ranges from problems caused by a lengthily QA cycle (and avoiding
thrashing when bug inter-arrival/discovery time is smaller than a QA
cycle), to why a bugs bounty is helpful (but why a bounty that is too
large is actually problematic). Also presented is a proposed method to
prevent reverse engineering of security patches (by distributing
encrypted(??) patches). The method can also automate identification of
*which* if any existing patch is critical during an attack, and it can
accelerate and even automate patch deployment of the critical
patch(es).
____________
CS547: HUMAN-COMPUTER INTERACTION SEMINAR
on Friday, 26 October 2007, 12:30-2:00pm
Gates B01
http://hci.stanford.edu/cs547/
"Designing a Health Care Interface"
Paul Tang
Palo Alto Medical Foundation
Even more fragmented than American health care is the management of
health care information. Faced with a barrage of poorly organized
health information, physicians and other clinicians must sift through
uninspired displays to glean pearls of information necessary to make
clinical decisions. Ineffective displays can lead to delays in care
or inappropriate decisions. The human-computer interface can either
shroud or reveal the important elements of patient information and
integrate it with domain knowledge bearing on the decisions at
hand. Beyond the walls of health care institutions, patients and
consumers will be the recipients and users of primary health
information. New tools for information gathering from patients and for
information rendering to patients must be developed in order to
activate patients to become fully informed and fully empowered members
of their health care team.
About the Speaker: Paul Tang, M.D., M.S., is an internist and vice
president, chief medical information officer at the Palo Alto Medical
Foundation (PAMF). He is also associate clinical professor at the
University of California, San Francisco (UCSF) School of Medicine. At
PAMF, Dr. Tang is responsible for clinical information systems,
including an enterprise-wide electronic health record system and an
integrated personal health record system.
Dr. Tang received his B.S. and M.S. degrees in electrical engineering
from Stanford University and his M.D. degree from the UCSF School of
Medicine. He completed his residency in internal medicine at Stanford
University and is board certified in internal medicine.
____________
BERKELEY INFORMATION ACCESS SEMINAR
on Friday, 26 October 2007, 3:00pm - 5:00pm
107 South Hall (Berkeley)
http://courses.ischool.berkeley.edu/i296a-1/f07/schedule.html
"The 1989 Loma Prieta Earthquake: Post-disaster Information Ecologies"
Megan Flynn
Berkeley
My research proposes to look at what I am calling "post-disaster
information ecologies" after the 1989 Loma Prieta Earthquake by
examining the information infrastructure. Disasters represent a
particularly interesting site for research, and particularly research
about "information" because of the paucity of information after a
disaster. People simply need information to make sense of what has
happened and to understand the most appropriate actions to take. I
will look at several cases of the information infrastructure (such as
radio, telephone, and building annotation) from Loma Prieta. There are
three questions which my dissertation proposes to address about this
case:
1. How do people make sense of their environment after a disaster
using the information infrastructure?
2. How is the information infrastructure influenced by formal and
informal social structures?
3. Why is it problematic to try to understand how "information"
"works" after a disaster without looking at the ways in which
information infrastructure is shaped by and shapes social
worlds?
____________
STANFORD SEMANTICS AND PRAGMATICS WORKSHOP
on Friday, 26 October 2007, 3:30pm
Margaret Jacks Hall 460:126
http://www-linguistics.stanford.edu/semgroup/
"Modeling and Explaining Similarity"
Patrick Pantel
USC Information Sciences Institute
http://www.patrickpantel.com/
Similarity modeling is a key task in computational lexical semantics
for finding word senses, concepts, paraphrases, topics, and
distributional synonyms, just to name a few. Missing, however, are
ways to automatically provide explanations of why a system finds two
elements similar. In this talk, we will survey the state of the art in
large-scale semantic similarity modeling, focusing on methods for
mapping problem statements to feature representations, information
theoretic feature weighting, comparison measures, and clustering
algorithms. Then, we will present our recent work on automatically
finding explanations for why elements are similar and discuss plans
for using these to build an interactive similarity platform.
____________
BIOMEDICAL COMPUTATION AT STANFORD 2007 (BCATS)
on Saturday, 27 October 2007, all day
Cubberley Auditorium
http://bcats.stanford.edu/html/bcats-home.html
Now in its eighth year, the Biomedical Computation at Stanford
symposium provides an open, interdisciplinary forum for Stanford
students and post-docs to share their latest work in computational
biology and medicine with others from Stanford and beyond.
BCATS was originally organized to bring together and integrate the
diverse work done across Stanford in all fields related to biomedical
computation; after seven years, BCATS has become an important part of
the Stanford biomedical computation community.
BCATS welcomes presentations from all domains of computerized and
computer-aided biology and medicine, broadly conceived. Topics will
include:
* Bioinformatics, Biostatistics and Computational Biology
* Computational Genomics and Systems Biology
* Biomechanical Simulation, Modeling and Robotics
* Medical Informatics
* Structural Biology and Chemistry
* Biomedical Imaging
Keynote Addresses
Gerard A. Ateshian, PhD
Professor of Mechanical Engineering and Biomedical Engineering
Columbia University
http://www.columbia.edu/~ga29
Douglas A. Lauffenburger, PhD
Uncas and Helen Whitaker Professor of Bioengineering
Director of the Biological Engineering Division
Massachusetts Institute of Technology
http://web.mit.edu/dallab/
Pavel A. Pevzner, PhD
Ronald R. Taylor Professor of Computer Science
University of California, San Diego
http://www.cse.ucsd.edu/~ppevzner/
Peter K. Sorger, PhD
Professor of Systems Biology
Harvard Medical School
http://sysbio.med.harvard.edu/faculty/sorger/
Volunteer for BCATS
BCATS is looking for volunteers to help on the day of the conference
(Oct 27) or the day before (Oct 26). Registration is free for BCATS
volunteers. For more information, see web page.
Registration for the conference includes conference materials,
breakfast, lunch, snacks, and refreshments during the Industry
Reception. Note that early registration is free for all Stanford
students, faculty and staff (you must bring your Stanford ID on the
day of the conference).
Early Registration Registration
Stanford Affiliated free* $10
Non-Stanford Students $10 $20
Not Stanford Affiliated $75 $150
* Early registration deadline is October 19, 11:59p.m.
http://bcats.stanford.edu/html/bcats-submit-registration.html
____________
UC BERKELEY LINGUISTICS DEPARTMENT COLLOQUIUM
on Monday, 29 October 2007, 4:00pm
182 Dwinelle (Berkeley)
http://linguistics.berkeley.edu/events/
"Studying grammaticalization with diachronically-ordered
corpus data: it's more than counting words"
Martin Hilpert
International Computer Science Institute (ICSI)
Recent years have seen an increased use of corpora in
grammaticalization studies (Lindquist & Mair 2004, Lenker &
Meurman-Solin 2007, amongst many others). Newly available resources
such as the Penn Parsed Corpora of Historical English (Kroch et al.
2004), the Diachronic Corpus of Present-Day Spoken English (Aarts &
Wallis 2007), or even the search settings in commercial search engines
allow the analysis of diachronically-ordered data. These resources
hold great potential for the study of grammaticalization, but so far
much of it has gone unexplored: many studies that use diachronic
corpora restrict themselves to simple frequency counts; few of these
studies state hypotheses in such a way that frequency counts can
actually settle the research question. In this talk, I will discuss
some ideas how diachronically-ordered corpus data can be put to
use. There will be counting of words, but there will be more than
that.
____________
MATHEMATICAL LOGIC SEMINAR
on Tuesday, 30 October 2007, 4:15pm
Bldg. 420:048
http://www-logic.stanford.edu/
"Three dynamic topological logics
and their very different complexities"
David Fernandez
Stanford
Dynamic Topological Logic (DTL) is a tri-modal system for reasoning
about dynamical systems and their short- and long-term behavior. The
intended semantics are defined over dynamical systems, which are pairs
<X,f> composed of a topological space X and a function f acting on X.
Different logics arise depending on the assumptions we make of the
space X and the function f. Surprisingly, the computational complexity
of these logics may vary wildly as we modify these assumptions. For
example, it has been shown that if we consider the class of systems
where X is arbitrary but f is a homeomorphism, the resulting DTL is
not axiomatizable. It has also been shown that DTL of continuous
functions is undecidable; however, I will show that this logic is
recursively enumerable. Further, I will discuss minimal spaces, which
are dynamical systems where the orbit of every point is dense; in this
setting we get decidability. In this talk I will compare the three
systems, and show what makes them so different despite their apparent
similarities.
____________
LINGUISTICS DEPARTMENT COLLOQUIUM
on Tuesday, 30 October 2007, 5:15pm
Margaret Jacks Hall 460:126
http://www-linguistics.stanford.edu/colloq/
"The Logical and Empirical Foundations
of Baker's Learnability Paradox"
Elizabeth Coppock
Linguistics, Stanford University
(Dissertation Proposal Talk)
The learnability paradox known as Baker's Paradox (Pinker 1989, in
reference to Baker 1979) arises whenever it appears that there are
arbitrary exceptions to a productive rule. For instance, although new
verbs can be productively extended to the double object construction
when they enter English (e.g. text me the address), certain transfer
of possession verbs still cannot be used in this construction
(e.g. *donate the library a book). Several authors, including Baker
(1981), and more recently Culicover (1999) and Goldberg (2006), assume
that such restrictions are arbitrary and conclude that the learner
must be conservative and attentive. I question this conclusion on
both the logical level and the empirical level. On the logical level,
I attempt to clarify, and provide a modern perspective on, the
consequences of the existence or non- existence of arbitrary
exceptions for learning. On the empirical level, I question the
claimed existence of arbitrary restrictions in several domains: the
double object construction, the attributive adjective construction,
and preposition pied-piping and stranding. In all of these domains, I
argue that the relevant restrictions follow from general principles.
I conclude that learning them does not require attentiveness to the
use of particular words in (these) particular constructions.
Baker, C. L. (1979). Syntactic theory and the projection problem.
Linguistic Inquiry, 10:533-581.
Culicover, P. W. (1999). Syntactic Nuts: Hard cases, Syntactic
theory, and Language acquisition. Oxford University Press, Oxford.
Goldberg, A. (2006). Constructions at Work. Oxford University Press.
Pinker, S. (1989). Learnability and cognition: the acquisition of
argument structure. MIT Press, Cambridge, MA.
____________
EE380: COMPUTER SYSTEMS LAB COLLOQUIUM
on Wednesday, 31 October 2007, 4:15pm to 5:30pm
Gates B03 (NEC Auditorium)
http://ee380.stanford.edu/contents.html
"The Challenges of Implementing Matlab(R)"
Randy Allen
Catalytic Inc
http://www.catalyticinc.com/
Forces of change assail the world of electronic systems design. The
complexity of new applications leaps ahead by factors and orders, not
percentages. The number of gates available on a chip is now large
enough to where just counting them, much less designing them, is a
problem. Irate iPhone purchasers are painfully aware that
time-to-market pressure continues to intensify, and the cost of
developing new ASICs is one of the few things rising faster than the
cost of Stanford tuition.
What will arise from the confluence of these forces? Complexity will
be handled by a move to higher-level languages that express
applications at a level more suitable to human understanding. Less
effort will be focused on product differentiation though
highly-customized ASICs; more effort will be focused on
differentiation through intellectual property running on programmable
systems. Because the high-level representation of an algorithm will be
not be implementation-specific, it can be more easily retargeted to
new or different systems. A leading indicator of this change is the
world of signal processing, where virtually all development is
initially done in MATLAB then manually translated into C for
implementation.
Catalytic, Inc. was founded with the goal of filling a void in this
new order of system design by automating the implementation of
languages such as MATLAB, where "implementation" as a general rule
means "compiling into efficient C code". Such compiled code can be
used to accelerate simulation performance, or to tie algorithms into
larger simulation platforms, or as a basis for a product
implementation, or potentially for parallelized performance. This talk
discusses some of the compiler optimization challenges presented by a
naturally-interpreted, dynamically-typed, vector-centric language such
as MATLAB, and how compiler theory can be both extended or stretched
to accommodate these overly-hyphenated challenges.
About the speaker: Randy Allen has over 20 years of software and
compiler development experience in startup companies, advanced
technology divisions, and research organizations. Prior to founding
Catalytic, he served as Vice President of Engineering at CynApps, Vice
President of Performance Engineering at Chronologic Simulation,
Executive Director of Software Development at Kubota/Ardent Computer,
and Director in the Advanced Technology Group at Synopsys.
Randy Allen is coauthor of the book Optimizing Compilers for Modern
Architectures. He has authored or coauthored 15 conference and journal
papers on compiler optimization, restructuring compilers, and hardware
simulation. Randy received his A.B. Summa Cum Laude in Chemistry from
Harvard University and his M.A. and Ph.D. in Mathematical Sciences
from Rice University.
____________
STANFORD UNIVERSITY ORAL EXAMINATION
on Thursday, 1 November 2007, 8:45am
Packard 101
http://cs.stanford.edu/calendar/abstract.php?eventId=2873
"Adaptive Interaction Techniques for Sharing and Reusing
Design Resources"
Brian Andrew Lee
PhD Student, HCI Group, Computer Science
http://graphics.stanford.edu/~balee/
Today's designers generate content both on paper and online. Designers
spread their work over physical and digital media, each of which has
powerful -- but distinct -- sets of affordances. Recent work suggests
that augmented paper interfaces can marry the ubiquity of paper
interactions with the ease of search, annotation, and presentation
afforded by digital representation. This dissertation examines novel
ways to support and augment the practice of design through sharing and
reappropriation of digitally captured design content.
The thesis of this dissertation is that an ecology for design that
integrates augmented paper and digital tools can facilitate
collaboration between designers and improve the visibility of design
resources . Our contributions are twofold: we study actual use of
augmented paper tools for capture and access of design content, and we
design selection and presentation algorithms for proactive display of
design materials.
To investigate the potential value of augmented tools for design, we
developed the iDeas design ecology, which integrates physical
notebooks with a digital faceted metadata browser that offers explicit
annotation and sharing mechanisms, and conducted four studies with
student design teams. Our findings indicate that while there are
clear benefits to use, such as increased excerpting and sharing of
design material, naïve sharing mechanisms carry significant perceived
costs to adoption, including privacy concerns, which depress usage.
The findings from these studies motivated our second tool, Adaptive
Ideas, which explores the use of implicit sharing mechanisms to
improve visibility of example design resources. We describe an
optimization-based approach to selecting and presenting design
material adaptively, using decision-theoretic selection, designer
specification, and end-user preference as inputs. Results from two
laboratory studies of an example-based web page builder indicate that
proactive presentation of examples is useful in helping designers
explore and understand spaces of design alternatives.
____________
PARC FORUM
on Thursday, 1 November 2007, 4:00pm - 5:00pm
George Pake Auditorium, PARC
http://www.parc.com/forum/
"Reinventing the media businesses"
John Warnock
Co-chairman of the Board of Directors of Adobe Systems, Inc.
The media businesses (newspapers, television, movies, music, book
publishing) are all facing daunting challenges as the Internet grows,
and the advertising models shift. This talk will informally cover
observations about the trends in these businesses and why it is so
difficult for established companies to reinvent themselves.
About the Speaker: John E. Warnock is Co-chairman of the Board of
Directors of Adobe Systems, Inc., a company he co-founded in 1982 with
Charles Geschke. Dr. Warnock was President of Adobe for his first two
years, and Chairman and CEO for his remaining 16 years at
Adobe. Warnock has pioneered the development of world-renowned
graphics, publishing, Web and electronic document technologies that
have revolutionized the field of publishing and visual
communication. Dr. Warnock holds six patents.
____________
SSP10: SYMBOLIC SYSTEMS FORUM
on Thursday, 1 November 2007, 4:15pm
Bldg. 380:380C (Math Corner)
http://symsys.stanford.edu/ssp_events
"Are Emotions Beneficial or Detrimental for Human Decision Making?"
Baba Shiv
Graduate School of Business
For centuries, philosophers and thinkers have debated whether emotions
are beneficial or detrimental to human decision making. The general
consensus viewpoint that pervaded the centuries was that emotions are
like wild-horses that need to be reined in, that good decisions are
those that are made devoid of emotion. Our recent understanding of the
working of the human brain points to a diametrically opposite
viewpoint, that emotions not only exert important influences on
decision making but also might actually be essential for and
fundamental to making advantageous decisions. In this presentation,
Professor Shiv will (1) highlight some of the startling and
counter-intuitive insights being unraveled on the workings of the
human brain and then (2) get to the "so what?" of these findings for
individual decision making.
____________
INFORMATION SYSTEMS SEMINAR
on Thursday, 1 November 2007, 4:15pm-5:15pm
Packard 101
http://isl.stanford.edu/colloquium.html
"An Information-theoretic view of Stochastic Resonance"
Venkat Anantharam
EECS Department, UC Berkeley
We discuss the phenomenon of stochastic resonance. We use this term to
refer to situations where the introduction of noise can enhance the
ability of a system to perceive weak signals in the environment. This
is the case, for instance, in the standard example of the periodically
forced Langevin equation studied by Benzi et al. and others.
Here we adopt an information theoretic viewpoint, evaluating the
quality of enhancement of the weak signal via the mutual information
rate between the signal and the observations. Viewing what would be
considered noise in stochastic resonance as an open loop control, and
using Markov decision theory techniques, we formulate and study an
optimal control problem: how best to choose the control in order to
maximize this mutual information rate.
The corresponding dynamic programming recursion is unorthodox and its
study is interesting. The eventual result is that the optimal control
involves the conditional law of certain conditional laws associated to
the dynamics. Further, the optimal control may be chosen as a
deterministic function of
this law of laws.
About the Speaker: Venkat Anantharam received his B.Tech in Electrical
Engineering from the Indian Institute of Technology, 1980, a M.S. in
EE from UC Berkeley, 1982, a M.A. in Mathematics, UC Berkeley, 1983,
a C.Phil in Mathematics, UC Berkeley, 1984 and a Ph.D. in EE, UC
Berkeley, 1986. Prior to joining the faculty of EECS in 1994, he was a
member of the faculty at Cornell University.
____________
STANFORD UNIVERSITY ORAL EXAMINATION
on Friday, 2 November 2007, 9:00am
Packard 101
http://cs.stanford.edu/calendar/abstract.php?eventId=2872
"Supporting the Visualization and Analysis of Network Events"
Doantam Phan
HCI Group, Computer Science
http://graphics.stanford.edu/~dphan/
The flow of traffic among computers on the Internet and the exchange
of goods between countries are examples of causally connected
measurable events in a network. Understanding the behavior of such
networks often requires the ability to discover temporal connections
among the events in a large data set. One challenge is that the volume
of data makes it difficult to explore the data and organize the events
into a narrative sequence. This dissertation contributes new
interactive visualization techniques for analyzing, organizing, and
presenting network event data at multiple levels of detail for the
purpose of forensic analysis - tracking down causal sequences of
importance.
The first contribution is a technique that supports event analysis,
called progressive multiples. Our techniques are instantiated in a
system for network incident investigation, Isis, which we validated
with a long-term collaboration and deployment with the principal
network analyst of the EE and CS departments. The second contribution
is a technique for automatically generating flow maps, which present
summaries of network topology and behavior at a higher level than
event plots and timelines. Our technique has been adopted by a diverse
group of users to depict the flow of computer networks, documents, and
international ecological trade.
____________
ETHICS@NOON
on Friday, 2 November 2007, 12 noon
Bldg. 100:101K
http://www.stanford.edu/dept/EIS/lectures_ethics.html
"Equity vs. Adequacy:
The State and the Distribution of K-12 Educational Opportunities"
Bill Koski
Stanford Law
http://www.law.stanford.edu/directory/profile/36/William%20Koski/
In the wake of recent school finance litigation and in response to
demands for greater accountability for student outcomes, many states
have begun to develop policies and educational finance mechanisms that
will ensure that all children receive an "adequate" education. Though
prompted by pragmatic political concerns and frequently touted as
creating greater equality of educational opportunity, such
adequacy-oriented reforms may not ensure educational equity and may
not fulfill the obligation of the state to provide equality of
educational opportunity. This discussion considers the purposes of
education both as a public good from which all derive benefit and a
private good from which its possessor derives benefit. This analysis
suggests that the states interest in providing education as a public
good to ensure social cohesion, a vibrant economy, and a civic-minded
populace would require that all receive an adequate education and that
an equal education may indeed be inefficient. On the other hand, given
that education is also a private good with strong positional and
competitive aspects, one might argue that the state has an obligation
to ensure that education is provided in such a manner to ensure
equality and fairness in competitions for postsecondary admissions and
the labor market. This real tension between adequacy and equity from
the states perspective will be the focus of the conversation.
____________
CS547: HUMAN-COMPUTER INTERACTION SEMINAR
on Friday, 2 November 2007, 12:30-2:00pm
Gates B01
http://hci.stanford.edu/cs547/
"`It's like a fire. You just have to move on':
Toward adaptive services for personal archiving"
Cathy Marshall
Microsoft Research
Most of us engage in magical thinking when it comes to the long term
fate of our digital stuff. This magical thinking may manifest itself
in several ways: technological optimism ("JPEG is so common; why would
it stop working?"), radical ephemeralism ("It's like a fire: you just
have to move on"), or simply a gap between principals and practice ("I
should move my novel off of that zip disk while the drive still works,
but I'm too busy right now"). At this point, a strategy that hinges on
benign neglect and lots of copies seems to be the best we can hope
for.
For the last few years, with various collaborators, I have tried to
understand the current state of personal digital archiving in practice
with the aim of designing services for the long-term storage,
preservation, and access of digital belongings. Our studies have not
only confirmed that experienced computer users have accumulated a
substantial amount of digital stuff that they care about, but also
that they have already lost irreplaceable artifacts such as photos,
creative efforts, research data, and important records. Although
informants report digital safekeeping strategies, they are neither
able to implement them consistently, nor will these strategies address
many of the real problems associated with archiving. I will discuss
four central themes of personal digital archiving and some additional
challenges introduced by home computing environments. I'll also talk
about how these themes relate to emerging institutional archiving
technologies, best practices, and information policies.
This talk will reveal how far we've gotten on our quixotic mission
and why we won't give up, even in the face of adversity,
table-pounding, and social ostracism.
About the Speaker: Cathy Marshall is a Senior Researcher at Microsoft
Corporation. Her research on personal digital libraries lies in the
disciplinary interstices of computer science, information science, and
the humanities. She was a long-time member of the research staff at
Xerox PARC and is an affiliate of the Center for the Study of Digital
Libraries at Texas A&M University. She has delivered keynote addresses
at the WWW and Hypertext Conferences as well as at CNI and other
library and information science venues. She has served as Program
Chair for the IEEE/ACM Joint Conference on Digital Libraries (twice)
and for the ACM Hypertext Conference. Her homepage is
http://www.csdl.tamu.edu/~marshall ; there you will find her
publications, her blog, her contact information, and how she is
related to Elvis.
____________
STANFORD UNIVERSITY ORAL EXAMINATION
on Friday, 2 November 2007, 2:15pm
Packard 101
http://cs.stanford.edu/calendar/abstract.php?eventId=2871
"Designing Interactions that Combine Pen, Paper, and Computer"
Ron B. Yeh
HCI Group, Computer Science
http://graphics.stanford.edu/~ronyeh/
Pen and paper are powerful tools for visualizing designs, penning
music, and communicating through the written language. This coupling
is mobile, flexible, graspable, and robust. By adding computation, we
can add in the power of technology, including search, redundancy, and
remote collaboration. The introduction of digital pens that capture a
person's handwriting has now made it feasible to augment paper with
computation. We refer to these as paper + digital interfaces.
Developing paper + digital interfaces is challenging. Programmers need
to abstract input into high-level events, coordinate interactions
across time, and manage output on devices. This is difficult, because
interface programmers are accustomed to working with graphical
applications that provide real-time feedback on a single display.
We created PaperToolkit to help programmers build applications with
digital pens and paper. PaperToolkit introduces abstractions and tools
to enhance development and testing of these interfaces. We evaluated
the toolkit through extended use in research projects, a class
deployment with 17 teams (69 students) and an analysis of the source
code produced by those teams. The evaluation found the abstractions
and tools to be highly effective.
Beyond PaperToolkit, this work includes ButterflyNet, a paper notebook
that automatically structures field data, and GIGAprints, large paper
prints that support collaboration and visual search. Using
PaperToolkit, these inspiring applications could have been built in
much less time. The toolkit is open source, and is used today in
research laboratories around the world, including labs at LRI Paris,
University of Siegen, Darmstadt University of
Technology, and at Stanford University.
____________
STANFORD SECURITY SEMINAR
on Friday, 2 November 2007, 4:30pm
Gates 4B center area (opposite 490)
http://theory.stanford.edu/seclab/sem.html
"The Drives Project: From Disk Forensics to Media Exploitation"
Simson Garfinkel
http://www.simson.net/cv
Forensic techniques the data on a hard drive can reveal who broke into
a computer system, what was done, and the perpetrators. Hard drives
have proved so useful that they are now routinely seized or imaged in
DoD, intelligence, law enforcement, and even civil actions.
But analyzing the information a hard drive today takes the time of a
skilled analyst; today's tools lack significant automation and
intelligence, and frequently crash. As a result there is a large
backlog of hard drives waiting to be analyzed; important information
is easily missed or not analyzed for months after it is acquired.
This talk discusses the work to date of the Drives Project, a 9-year
(and counting) effort that is creating a large-scale collection of
real disk drive images, open source tools, and new techniques for
automatically processing data recovered from disk drives and other
kinds of storage devices. Today the Drives Project has assembled a
corpus of more than 1000 forensically interesting images from hard
drives and USB storage devices that were collected all over the
world. We have created open source formats, tools and algorithms for
automatically analyzing this data in bulk and rapidly producing
answers to questions that are relevant to the Defense, Intelligence
and Law Enforcement communities. The Project is now in the process of
dramatically expanding the global reach of data being acquired
and exploring new research opportunities for using this data.
About the Speaker: Simson L. Garfinkel is an Associate Professor at
the Naval Postgraduate School in Monterey, California, and a fellow at
the Center for Research on Computation and Society at Harvard
University.
Dr. Garfinkel has research interests in computer forensics, the
emerging field of usability and security, and privacy. Garfinkel is
the author or co-author of fourteen books on computing. He is perhaps
best known for his book Database Nation: The Death of Privacy in the
21st Century. Garfinkel's most successful book, Practical UNIX and
Internet Security (co-authored with Gene Spafford), has sold more than
250,000 copies in more than a dozen languages since the first edition
was published in 1991.
Garfinkel received three Bachelor of Science degrees from MIT in 1987,
a Master's of Science in Journalism from Columbia University in 1988,
and a Ph.D. in Computer Science from MIT in 2005.
____________
END MATERIAL
The CSLI Calendar appears weekly on most Wednesdays throughout the
year. Announcements, abstracts, and other information to appear in
the Calendar should be submitted to the editor, who reserves the right
to decide what does or does not go in the calendar
mailto:incalendar@csli.stanford.edu
Requests to be added to the mailing list should be sent to
majordomo@csli.stanford.edu. With the lines in the body of the text
of either
subscribe csli-calendar
for the long form or
subscribe csli-short-calendar for the short form (i.e., no
abstracts). To unsubscribe use the word unsubscribe instead of
subscribe. Problems with subscribing or unsubscribing should be sent
to owner-csli-calendar@csli.stanford.edu
The full current issue is at
http://cslicalendar.stanford.edu/current.shtml
and the archives at
http://cslicalendar.stanford.edu/Archive/
People on many of the CSLI computers can type 'help csli-calendar' to
see the current issue.
The CSLI Calendar is also posted each week to the su.events usenet
newsgroup (only available from computers on the Stanford network)
Information about CSLI's research program is available at
http://www-csli.stanford.edu/
For maps to the Stanford University rooms see
http://cslicalendar.stanford.edu/locations.shtml