[Date Prev][Date Next][Date Index]
CSLI Calendar, Wednesday, 5 November 2003, vol. 19:10
CSLI CALENDAR OF PUBLIC EVENTS
______________________________________________________________________
5 November 2003 Stanford Vol. 19, No. 10
______________________________________________________________________
A weekly publication of the
Center for the Study of Language and Information (CSLI)
Stanford University, Ventura Hall, Stanford, CA 94305-4115
http://www-csli.stanford.edu/
____________
ACTIVITIES FROM 5 NOVEMBER 2003 TO 14 NOVEMBER 2003
WEDNESDAY, 5 NOVEMBER 2003
12 noon Psychology Developmental Brownbags
Bldg. 420:286
"The brain bases of dyslexia"
John Gabrieli
Stanford University
http://www-psych.stanford.edu/news.html#dev_brownbag
3:00pm History of Science Colloquium
Bldg. 200:105
"Ways of Knowing:
Reconfiguring the Relations of Science, Art and Museums"
John Pickstone
Wellcome Unit, and Centre for the History of Science,
Technology & Medicine, University of Manchester
http://www.stanford.edu/dept/HPS/colloquia.html
4:15pm EE380: Computer Systems Lab Colloquium
Gates B03 (NEC Auditorium)
"The New Forensics:
Corporate Fraud and the Discovery of Electronic Evidence"
Joseph S. ("Joe") Anastasi
Deloitte Toche Tohmatsu
http://ee380.stanford.edu/contents.html
Abstract below
THURSDAY, 6 NOVEMBER 2003
11:00am SRI AI Seminar Series
EK225, SRI International
"A Socio-Technical Perspective on Creating Web-based
Collaborative Applications"
Alison Lee
IBM TJ Watson Research Center
http://www.ai.sri.com/seminars/
Abstract below
12:15pm Stanford Networking Seminar
Packard 202
"Threshold Prefetching Considered Harmful"
Mike Dahlin
University of Texas at Austin
http://netseminar.stanford.edu/
3:00pm Reuters Foundation Digital Vision Program Seminar
email for location mailto:digitalvision@csli.stanford.edu
Claude M. Leglise
http://reuters.stanford.edu/seminar_speakers.html
3:30pm UC Berkeley Cognition, Brain, and Behavior Colloquium
3105 Tolman (Berkeley)
"Functional Properties of Neural Circuits for Vision"
Marty Usrey
UC Davis
http://psychology.berkeley.edu/admin/colloquia.html
4:00pm PARC Forum
George Pake Auditorium at PARC
"How Arc Alley Became Silicon Valley"
Thomas H. Lee
Stanford University
http://www.parc.com/forum/
Abstract below
4:10pm UC Berkeley Philosophy Department Colloquium
Howison Philosophy Library, (305 Moses Hall) (Berkeley)
"The Interiority of Mind and the Publicity of Meaning"
Barry Smith
Birkbeck School of Philosophy
http://philosophy.berkeley.edu/html/events/deptevents.html
4:15pm CSLI Seminar on Computational Learning and Adaptation
Cordura Hall, room 100
"Spectral Learning: Extending Spectral Clustering to Classification"
Dan Klein
Computer Science, Stanford
http://cll.stanford.edu/scla.html
Abstract below
4:15pm SSP10: Symbolic Systems Forum
Bldg. 380:380C (Math Corner)
"Simulating motion in language and thought"
Teenie Matlock
Psychology, Stanford
http://symsys.stanford.edu:8081/ssp-dynamic/servlet/ssp_events
Abstract below
4:15pm Information Systems Seminar
Packard 101
"When Network Theorists Think Like Leeches"
Greg Wornell
MIT
http://isl.stanford.edu/groups/seminar/
Abstract below
4:15pm Fundamental Themes in Neuroscience Seminar
Munzer Auditorium, Beckman B060
"'Interactions between Glutamate Transporters and Metabotropic
Glutamate'
Receptors at Excitatory Synapses in the Cerebellar Cortex"
Thomas Otis
UCLA Medical School, Neurobiology Department
http://www-med.stanford.edu/sbrc/calendar/
FRIDAY, 7 NOVEMBER 2003
10:00am SRI AI Seminar Series
EJ291, SRI International
"Turning Probabilistic Reasoning into Programming"
Avi Pfeffer
Harvard University
http://www.ai.sri.com/seminars/
Abstract below
10:30am SRI STAR-Lab Seminars
EJ 124 (SRI International)
"Modeling Spontaneous Speech"
Peter Heeman
Oregon Health & Science University
http://www.speech.sri.com/cgi-bin/run-cpp?private/seminars.html.cpp
Abstract below
12 noon Ethics@Noon
Bldg. 100:101k
"Who Owns Life?"
David Magnus
Center for Biomedical Ethics
http://www.stanford.edu/dept/EIS/noon.htm
12 noon Diversity in Language Seminar
Bldg. 260:252 German Studies Library
"A Typological Perspective of the Chinese Serial Verb Constructions"
Chaofen Sun
Asian Languages, Stanford
http://dlcl.stanford.edu/research/workgroups/diversity.html
Abstract below
12:30pm CS547: Human-Computer Interaction Seminar
Gates B01
"Motivations for Invention"
Tom Zimmerman
IBM Almaden Research
http://www.almaden.ibm.com/cs/people/zimmerman/tzim.html
http://www-pcd.stanford.edu/cs547/
Abstract below
1:30pm Computer Science Talk
Packard 202
"Bluespec: Why Chip Design Can't Be Left to EE's"
Arvind
MIT
Abstract below
3:00pm Logical Methods in the Humanities
Baker Room, Stanford Humanities Center
"Convergence in the Philosophy of Mathematics"
Ed Zalta
CSLI/Stanford
http://www-logic.stanford.edu/seminars.html
Abstract below
3:30pm Linguistics Department Colloquium
Margaret Jacks Hall 460:126
"Drift in Evolutionary Phonology: Patterns of Austronesian Syncope"
Juliette Blevins
University of California, Berkeley
http://www-linguistics.stanford.edu/colloq/
Abstract below
MONDAY, 10 NOVEMBER 2003
3:30pm Social Lab
Jordan Hall 420:050
"Self-Verification Processes At The Collective Level of
Self-Definition"
Serena Chen
Psychology, University of California at Berkeley
http://www-psych.stanford.edu/news.html#social_lab
4:15pm CS528: Broad Area Colloquium in AI,
Geometry, Graphics, Robotics, and Vision
TCSeq 200
"Modeling by Drawing"
Adam Finkelstein
Princeton/Pixar
http://graphics.stanford.edu/courses/cs528/
Abstract below
TUESDAY, 11 NOVEMBER 2003
12 noon Semantics and Pragmatics Workshop
Margaret Jacks Hall 460:126
"Some foundational issues for a Construction Grammar. Mutual
definition and cluster concepts"
Arnold Zwicky
Stanford
http://www-linguistics.stanford.edu/semgroup/
Abstract below
3:00pm CSLI/EPGY Tea
Cordura Greenhouse
4:15pm Logic Seminar
Bldg. 380:380F (math corner)
"Concluding talk on decision methods for arithmetical
universal-existential sentences"
Jesse Alama and Patrick Girard
Stanford
http://www-logic.stanford.edu/seminars.html
4:15pm SNRC Industry Seminar
Gates B03
"Application Design for Real-time, Embedded Sensor Networks"
Asuman S\"unb\"ul
Kestrel Institute
http://snrc.stanford.edu/events/industry-seminar/
Abstract below
4:30pm Stanford Security Seminar
Gates 4B center area (opposite 490)
"Honeyd - A Virtual Honeypot Framework"
Neils Provos
Google
http://theory.stanford.edu/seclab/sem.html
7:00pm Emerging Technology Group
SAP, 3475 Deer Creek Road, Bldg. B demo room
"Intellectual Property Protection"
Florian Pestoni
IBM Almaden
http://www.sdforum.org/
(there is a fee for non-SDForum members, see web page)
Abstract below
WEDNESDAY, 12 NOVEMBER 2003
12 noon Psychology Developmental Brownbags
Bldg. 420:286
"Processing action: Discerning structure that actors produce"
Dare Baldwin
University of Oregon
http://www-psych.stanford.edu/news.html#dev_brownbag
4:00pm GSB Talk
Littlefield 103
"A Contract and Balancing Mechanism for Sharing Capacity in a
Communication Network"
Richard Steinberg
University of Cambridge and Stanford University
http://gobi.stanford.edu/facultybios/bio.asp?ID=380
4:15pm EE380: Computer Systems Lab Colloquium
Gates B03 (NEC Auditorium)
"The Skynet Virus: Why it is Unstoppable, How to Stop It"
Marc Steigler
Hewlett Packard
http://ee380.stanford.edu/contents.html
Abstract below
THURSDAY, 13 NOVEMBER 2003
12:15pm CSLI CogLunch
Cordura Hall, Room 100
"On the relation between rhythm perception and production: a
Bayesian model"
Peter Desain
http://www-csli.stanford.edu/events/Coglunch/
Abstract below
3:00pm Reuters Foundation Digital Vision Program Seminar
email for location mailto:digitalvision@csli.stanford.edu
Lee Thorn
http://reuters.stanford.edu/seminar_speakers.html
4:15pm CSLI Seminar on Computational Learning and Adaptation
Cordura Hall, room 100
Title to be announced
Dharmednra S. Modha
IBM Almaden Research Center
http://cll.stanford.edu/scla.html
4:15pm SSP10: Symbolic Systems Forum
Bldg. 380:380C (Math Corner)
"The Return of Moral Fictionalism
Nadeem Hussain
Philosophy Department
http://symsys.stanford.edu:8081/ssp-dynamic/servlet/ssp_events
Abstract below
4:15pm Information Systems Seminar
Packard 101
"Capacity Of Ultra Wide Band Systems With Spreading Signals"
Dana Porrat
UC Berkeley
http://isl.stanford.edu/groups/seminar/
4:15pm Fundamental Themes in Neuroscience Seminar
Munzer Auditorium, Beckman B060
"Signaling Mechanisms that Control Axon Guidance in Drosophila"
David Van Vactor
Harvard Medical School, DFCI, Harvard Cancer Center, Harvard
Center for Neurodegeneration and Repair
http://www-med.stanford.edu/sbrc/calendar/
FRIDAY, 14 NOVEMBER 2003
11:00am Berkeley Institute of Cognitive and Brain Seminar
Tolman 5101 (Berkeley)
"Deciding What Counts: Children's Individuation of Objects and Events"
Laura Wagner
Psychology, Wellesley College
http://socrates.berkeley.edu:4247/seminar.html
12:30pm CS547: Human-Computer Interaction Seminar
Gates B01
"A Next-Generation Consumer Photo Application:
Challenges in Creating a Simple Yet Powerful User Experience"
Michael Slater
Adobe
http://www-pcd.stanford.edu/cs547/
Abstract below
3:15pm Philosophy Department Colloquium
Bldg. 90:92Q
"Expressivism, Deflationism, and Correspondence"
Patricia Marino
Stanford University
http://www-philosophy.stanford.edu/ce.html
3:15pm Friday Cognitive Seminar
Jordan Hall 420:100
Title to be announced
David Sears
http://www-psych.stanford.edu/news.html#frisem
SATURDAY, 15 NOVEMBER 2003
1:00pm Human Mind: Cognition
Bldg. 320:105
Herb Clark, Psychology
Daniel Schwartz, Education
Barbara Tversky, Psychology
http://continuingstudies.stanford.edu/course/EVT58.asp
____________
Stanford Blood Center status: Shortage of O+, O-, AB+, AB-, and A-.
For an appointment: http://bloodcenter.stanford.edu/ or call
650-723-7831. It only takes an hour of your time.
____________
ANNOUNCEMENT
Special CSLI Tea on 18 November 2003
Starting at 4:00pm after the Tea on November 18, Dr. Murakami from
KDDI will be speaking. Please join us.
"For Innovation toward a Ubiquitous Solution Company
- Technological Issues in KDDI"
Dr. Hitomi Murakami
Vice President, General Manager
IT Development Division, KDDI
The telecommunication world is now drastically changing to ubiquitous
access and networking. KDDI aims to become a ubiquitous solution
company by setting "mobile networking technology" as a core competence
of the business and responding to the customer*s further reliance and
satisfaction.
The presentation will begin with an overview of the telecommunications
business environment in Japan and current KDDI approach, followed by
an examination of key technological issues;
1. to improve KDDI's existing services,
2. to develop new killer applications for KDDI's network platform, and
3. to create new business markets.
I will specify requirements for future telecommunications services and
outline KDDI's technical solutions.
____________
ANNOUNCEMENT
Symposium in honor of Solomon Feferman
Stanford, January 17-18
A symposium in honor of Solomon Feferman on the occasion of his
retirement will take place at Stanford University for a full day on
Saturday, January 17, 2004, and on the morning of January 18. There
will be a banquet dinner in the evening on the first day.
Talks will be given by John Etchemendy, Dana Scott, Dagfinn Follesdal,
Rick Sommer, Grisha Mints, Wilfried Sieg, Paolo Mancosu, Carolyn
Talcott, Ian Mason, Thomas Hofweber, and Michael Rathjen. The location
will be Cordura Hall.
Program Committee: Dagfinn Follesdal, Grigori Mints (chair), Richard Sommer
See http://www.stanford.edu/~sommer/Feferman04.html for more details.
____________
EE380: COMPUTER SYSTEMS LAB COLLOQUIUM
on Wednesday, 5 November 2003, 4:15pm to 5:30pm
NEC Auditorium (B03), Gates Computer Science Building
http://ee380.stanford.edu/contents.html
"The New Forensics --
Corporate Fraud and the Discovery of Electronic Evidence"
Joe Anastasi
Deloitte -- Forensics Investigations and Disputes Global Practice Leader
Corporate Fraud is alive and well -- and so is the business of
investigating it.
Joe Anastasi, author of The New Forensics: Investigating Corporate
Fraud and the Theft of Intellectual Property, will share his insights
into his investigations of white-collar crime and cybercrime. Via
business forensics, vignettes, and actual crime reports, Anastasi will
describe how digital detectives use sophisticated tools, such as
"adaptive pattern-recognition software" (spawned from NSA and CIA
predecessor applications), to shine the light on such shady dealings
as the theft of trade secrets and money laundering. Anastasi will also
cover the use of data mining as an investigative tool, and the use of
sophisticated anomaly-detection software to ferret out fraud.
About the speaker: Joe Anastasi serves as the Global Leader of
Deloitte's Forensics Investigation practice, which operates several
cybercrime computer forensics labs located around the world. He is a
member of the High Tech Crime Investigation Association, the
Association of Certified Fraud Examiners, and is a Diplomate Member of
the American College of Forensic Examiners.
He has testified as an expert witness in over fifty matters, one of
which involved a breach of contract involving over $4 billion in
mortgage-backed securities, and in another involving the aborted
acquisition of a telecom operation in a transaction believed valued in
excess of $4 billion. He has testified in trials involving corporate
securities fraud; international corporate asset-stripping and
money-laundering schemes (including alleged penny stock
'pump-and-dump' scams); fraudulent conveyances; the development of
alter ego theories (i.e., piercing of the 'corporate veil'); and cases
involving the alleged theft of trade secrets and other intellectual
property matters. His trial testimony has covered investigation of
alleged improper revenue recognition schemes, international
check-kiting schemes and other forensic investigations.
He is the author of numerous works, including "The New Forensics:
Investigating Corporate Fraud and the Theft of Intellectual Property",
John Wiley & Sons, Inc., 2003.
____________
SRI AI SEMINAR SERIES
on Thursday, 6 November 2003, 11:000am
EK255, SRI International
http://www.ai.sri.com/seminars/
"A Socio-Technical Perspective on
Creating Web-based Collaborative Applications"
Alison Lee
IBM TJ Watson Research Center
Building applications that support collaboration and social
interaction from the ground up requires balancing social, user
interface, and technical concerns. The Web provides building blocks
that make it easy to rapidly develop such applications but lacks
socio-technical elements. Using the design of three social
applications, I will illustrate the importance and describe examples
of socio-technical components that present the social context, provide
visibility of people and activities, facilitate common ground among
participants, and promote social interaction and organization. I will
also examine the impact of these socio-technical requirements on the
infrastructure, the application model, and the content and data
management capabilities of a Social Web. Then, I will discuss
directions for future work on a Social Web; one that supports
large-scale online interactions and collaborations for scientific
computing, business, and discretionary, ad hoc, and recreational
social organization purposes.
About the Speaker: Alison Lee is a Research Staff Member at the IBM TJ
Watson Research Center. She is exploring paradigms, solutions, and
systems that productively combine usability, social and computational
capabilities. As a Member of Technical Staff at NYNEX Science and
Technology, she created tools and methodologies to support telephone
operators and to facilitate communication among distributed
teams. Alison received her Ph.D. from the Department of Computer
Science at the University of Toronto in 1992. She has published
extensively at HCI, Web, and information systems conferences. She has
also jointly taught many tutorials on Web-based collaborative
applications.
____________
PARC FORUM
on Thursday, 6 November 2003, 4:00pm - 5:00pm
George Pake Auditorium, PARC
http://www.parc.com/forum/
"How Arc Alley Became Silicon Valley"
Thomas H. Lee
Stanford University
Most technology histories of this region mark "time zero" as the birth
of Hewlett-Packard on 1 January 1939. Then Shockley arrives in 1955.
Three years later, the IC gets invented, and the history of Silicon
Valley unfolds in earnest. Stanford and Berkeley are somehow involved
in Important Ways, orchards disappear, spinoffs beget spinoffs, and
boom and bust cycles of ever-increasing amplitude appear as constant
companions.
What's less well known are the many other important tech milestones
that precede "time zero" of the standard story:
- First ship-to-shore wireless communications in the U.S. (from the
Cliff House in San Francisco, in 1899);
- First regularly scheduled radio broadcasts (by Stanford dropout "Doc"
Herrold), from San Jose;
- First ground-to-aircraft radio, demonstrated at the Tanforan racetrack
in San Bruno;
- First VC-funded electronics startup (Federal Telegraph, founded by
Stanford graduate Cyril Elwell, with funding from Stanford president
David Starr Jordan and others; it counted among its employees future
"Father of Silicon Valley" Fred Terman, and first Stanford EE PhD
and future Berkeley EE dept. chair Leonard Fuller);
- Discovery of electronic amplification by Lee de Forest at Federal
Telegraph in Palo Alto;
- First megawatt-level continuous wave transmitters (using arc
technology, by Federal Telegraph);
- First demonstration of electronic television, by Philo Farnsworth at
his San Francisco lab on Green Street.
The talk will begin with a quiz ("Who *really* invented radio?") to
prime the pump, and end with a light-speed overview of developments
after Farnsworth, up to the founding of Fairchild.
About the Speaker: Thomas H. Lee received the S.B., S.M. and
Sc.D. degrees in electrical engineering, all from the Massachusetts
Institute of Technology in 1983, 1985, and 1990, respectively.
He joined Analog Devices in 1990 where he was primarily engaged in the
design of high-speed clock recovery devices. In 1992, he joined Rambus
Inc. in Mountain View, CA where he developed high-speed analog
circuitry for 500 megabyte/s CMOS DRAMs.
He has also contributed to the development of PLLs in the StrongARM,
Alpha and AMD K6/K7/K8 microprocessors. Since 1994, he has been a
Professor of Electrical Engineering at Stanford University where his
research focus has been on gigahertz-speed wireline and wireless
integrated circuits built in conventional silicon technologies,
particularly CMOS.
He has twice received the "Best Paper" award at the International
Solid-State Circuits Conference, co-authored a "Best Student Paper" at
ISSCC, was awarded the Best Paper prize at CICC, and is a Packard
Foundation Fellowship recipient.
He is an IEEE Distinguished Lecturer of both the Solid-State Circuits
and Microwave Societies. He holds 33 U.S. patents and authored "The
Design of CMOS Radio-Frequency Integrated Circuits," Cambridge Press,
1998. He is a co-author of three additional books on RF circuit
design, and also cofounded Matrix Semiconductor.
____________
CSLI SEMINAR ON COMPUTATIONAL LEARNING AND ADAPTATION
on Thursday, 6 November 2003, 4:15pm to 5:30pm
Cordura 100
http://cll.stanford.edu/scla.html
"Spectral Learning: Extending Spectral Clustering to Classification"
Dan Klein
Stanford University
http://www.stanford.edu/~danklein/
Spectral clustering methods use the eigenvectors of similarity
matrices to detect cluster structure. These methods have traditionally
been applied to fully unsupervised pattern detection problems, but we
extend the general approach to incorporate supervisory information. In
this talk, I'll first give an overview of how basic spectral
clustering methods work. I'll also discuss the relationship between
spectral clustering and more well-known eigenvector-based methods,
such as latent semantic analysis (LSA) and principal component
analysis (PCA). I'll then describe a simple, easy-to-implement
spectral algorithm which, in the absence of supervisory information,
reduces to spectral clustering. When supervisory information is
available, however, we incorporate it by modifying the input
similarity matrix before clustering. Then, the same kind of
representational transformation used in spectral clustering can be
used for classification. This approach performs comparably to other
spectral clustering algorithms in unsupervised cases, and, in a
partially supervised text categorization setting, has achieved high
accuracy on the categorization of thousands of documents given only a
few dozen labeled training examples.
____________
SSP10: SYMBOLIC SYSTEMS FORUM
on Thursday, 6 November 2003, 4:15pm
Bldg. 380:380C (Math Corner)
http://symsys.stanford.edu:8081/ssp-dynamic/servlet/ssp_events
"Simulating motion in language and thought"
Teenie Matlock
Psychology, Stanford
In everyday talk, people use motion language, such as go, run, or
move, when they are describing things that have little or nothing to
do with motion. They say, "The mountain range goes from Canada to
Mexico," or "The table runs along the wall," when neither the mountain
range nor the table moves. Or they say, "The meeting has been moved
forward two days," or "The session runs until 8," when there is no
observable motion. My presentation addresses the following questions:
Why do people use motion language to describe static scenes and
abstract domains? What's going on during processing?
About the Speaker: Teenie Matlock is a post-doctoral researcher in the
lab of Herbert Clark in the Psychology department. She received her
Ph.D in Psychology at UC Santa Cruz, where she did work on the
relationship between spatial language and spatial thought. She has
published on metaphor and conceptual knowledge , as well as her
current interest, fictive motion (using motion verbs to describe
situations where motion is absent).
____________
INFORMATION SYSTEMS SEMINAR
on Thursday, 6 November 2003, 4:15pm
Packard 101
http://isl.stanford.edu/groups/seminar/
"When Network Theorists Think Like Leeches"
Greg Wornell
MIT
Many networks are overprovisioned in one or more resources. The
associated surpluses can often be exploited to create parasitic bit
pipes by opportunistic resource scavenging algorithms. By examining
some associated fundamental limits, we investigate the degree to which
global resource efficiency is possible when such scavenging is subject
to the required transparency constraints. While bandwidth scavenging
may be what first comes to mind, we focus on the equally important
cases in which there are surpluses in channel quality (which can
allow, e.g., a form of energy scavenging at the physical layer) or
content fidelity (which can be exploited through requantization at the
application layer). In both cases, we show suitably designed
scavenging algorithms can be at least nearly globally efficient. In
the process, we analyze a meaningful game-theoretic model for the
successive degradation problem of transcoding. More generally, our
analysis also provides other insights for designers of practical
source codes and channel codes.
Based on recent joint work with Aaron Cohen, Stark Draper, and Emin
Martinian, as well as earlier joint work with Brian Chen.
About the Speaker: Greg Wornell has been on the MIT faculty since
1991, where he is Professor in the EECS department. He did his
graduate work also at MIT in EECS, and his undergraduate work at the
University of British Columbia. His research interests span a variety
of aspects of signal processing, information theory, and digital
communication, and include algorithms and architectures for wireless
and sensor networks, broadband systems, and multimedia environments.
____________
SRI AI SEMINAR SERIES
on Friday, 7 November 2003, 10:00am
EJ291, SRI International
http://www.ai.sri.com/seminars/
"Turning Probabilistic Reasoning into Programming"
Avi Pfeffer
Harvard University
http://www.eecs.harvard.edu/~avi/
Uncertainty is ubiquitous in the real world, and probability provides
a sound way to reason under uncertainty. This fact has led to a
plethora of probabilistic representation languages such as Bayesian
networks, hidden Markov models and stochastic context-free grammars.
More recently, we have developed new probabilistic languages that
reason at the level of object, such as object-oriented Bayesian
networks and probabilistic relational models. The wide variety of
languages leads to the question of whether a general purpose
probabilistic modeling language can be developed that encompasses all
of them. This talk will describe IBAL, an attempt at developing such a
language. After presenting the IBAL language, motivating
considerations for the inference algorithm will be discussed, and the
mechanism for IBAL inference will be described.
____________
SRI STAR-LAB SEMINAR
on Friday, 7 November 2003, 10:30am
EJ 124 (SRI International)
http://www.speech.sri.com/cgi-bin/run-cpp?private/seminars.html.cpp
"Modeling spontaneous speech"
Peter Heeman
In spontaneous speech, speakers segment their speech into intonational
phrases, and make repairs to what they are saying. However,
techniques for understanding spontaneous speech tend to treat these
events as noise, in the same manner as they handle out-of-grammar
constructions and misrecognitions. In our approach, we advocate that
these events should be explicitly modeled, and that they must be
resolved early in the processing stream. We put forward a statistical
language model, which can be used during speech recognition, that
models these events. This not only improves speech recognition
perplexity and POS tagging, but also results in much richer output
from the recognizer, with speech repairs resolved and intonational
phrase boundaries identified. Syntactic and semantic processing can
thus focus on dealing with out-of-grammar constructions and
misrecognitions.
About the speaker: Dr. Peter Heeman is an assistant professor at the
OGI School of Science and engineering at the Oregon Health & Science
University. He is a member of the Center for Spoken Language
Understanding and the Center for Human Computer
Communication. Dr. Heeman does research on the automatic recognition
of spontaneous speech, which contains disfluencies, and intonational
phrases. He also conducts research on dialogue management and spoken
dialogue systems. Dr. Heeman received his Ph.D. from the University
of Rochester in 1997, his Masters of Science from the University of
Toronto in 1991, and has worked at CNET France Telecom and at ATR,
Japan.
____________
DIVERSITY IN LANGUAGE SEMINAR
on Friday, 7 November 2003, 12 noon
Bldg. 260:252 German Studies Library
http://dlcl.stanford.edu/research/workgroups/diversity.html
"Chinese Clause Linkage: A Typological Perspective"
Chaofen Sun
Asian Languages
The relation between two verb phrases in a serial-verb construction can
be conceived as a form of clause linkage, and degree of syntactic
linkage has been correlated with degree of semantic connection (Lehmann
1988, Givon 2002). Furthermore, crosslinguistically there are two
generally recognized diachronic routes along which two clauses can be
integrated. One is desententialization of the subordinate clause into a
nominal phrase; the other is grammaticalization of the main verb
governing the subordinate clause (Lehmann 1988). Givon (2002: 79) claims
that !H... in serial-verb languages, on the other hand, where clause
integration arises diachronically from clause-chaining and no strong
finiteness gradation exists between main and subordinate clause, the
very same semantic event combinations yield incomplete clause-union.
Although the correlation between syntax and semantics appears to be
corroborated by Chinese clause linkage, inconsistent with Givon's claim,
Chinese as a language without strong finiteness gradation has yielded
nearly complete clause-union analogous to the above two types of clause
union.
My discussion will focus on a hybrid kind of clause linkage which
embodies some characteristics of the two types given above. Hansell
(1993) shows that Chinese serial-verb constructions can differ
substantially in terms of tightness of syntactic linkage and show how
a subordinate clause can be integrated with the main verb along the
line of co-lexicalization in Givon's framework. But a close
examination of the distributional properties of some manipulative
verbs reveals that subordinate clauses behave differently in terms of
negation and aspectual marking depending on the illocutionary force
asserted by the main verb. Hansell's indiscriminate treatment of the
Chinese pivotal construction (or directive causative (Shibatani 1974))
misses this generalization. As a matter of fact, grammaticalization of
these main verbs does not lead to serial-verb compounding at
all. Instead, this type of grammaticalization yields a periphrastic
structure, (grammaticalized) V + N + V, in which a grammaticalized
manipulative verb becomes an implicative causative marker. In this
process, a subordinate clause with strong overlapping (sharing of the
causee argument with the main verb) is, first of all, deprived of its
own illocutionary force and depends totally on the force asserted in
the main clause, thus showing some degree of desententialization in
Lehmann's framework. But such a change does not affect either the main
verb or the subordinate verb's ability to take aspect markers, i.e., a
perfective marker can be optionally suffixed to either the main or
subordinate verb in Chinese. This then allows a subordinate verb to
retain its verbal status and to ultimately assume the main verb status
when the two clauses are tightly integrated. Then, although the
illocutionary force of the main verb over its subordinate clause may
become lost as a result of semantic bleaching in the course of
grammaticalization, its older semantic scope over the linked clauses
lives to tell the tale through its implicative nature. Moreover, such
implicative nature is interestingly shared by nearly all of the
Chinese case markers like BA, passive, instrument, associative,
comparative, etc. Therefore, this kind of clause union may have a far
more significant impact on Chinese grammar in general.
____________
CS547: HUMAN-COMPUTER INTERACTION SEMINAR
on Friday, 7 November 2003, 12:30-2:00pm
Gates B01
http://www-pcd.stanford.edu/cs547/
"Motivations for Invention"
Tom Zimmerman
IBM Almaden Research
http://www.almaden.ibm.com/cs/people/zimmerman/tzim.html
It is often said that "Necessity is the Mother of Invention". However
for me Fantasy is a more fertile parent for innovation. I have spent
the past 25+ years hooking people to machines, exploring the
interaction of bits and flesh, brains and computation, sensation and
experience, entertainment and education. Beyond describing the
highlights of my inventions I would like to examine the motivation
behind them. I shall discuss the essential archetypes required for
successfully deploying ideas (Designer, Engineer, and Entrepreneur),
motivation (fun, easy, makes money), criteria for museum exhibits
(practical, fun to look at, interactive), and sources of inspiration
for teaching science (principles, phenomena, and raw material).
About the Speaker: Thomas G. Zimmerman is an inventor and educator,
exploring the frontiers of human-computer interaction at the IBM
Almaden Research Center. His 15 patents cover position tracking, user
input, wireless communication, music training, biometrics and
encryption. His Data Glove invention established the field of Virtual
Reality, selling over one million units. His electric field PAN
invention sends data through the human body, exchanging electronic
business cards with a handshake, and prevents air bags from injuring
children in the Honda Accord. His New Zealand airport deployment of
802.11b WLAN equipped PDAs enabled passengers to self check-in and
board. Mr. Zimmerman promotes science literacy with appearances on
Discovery TV Canada and interactive exhibits installed at the
Exploratorium, National Geographic Society and Great Lakes Science
Center. He received his B.S. in Humanities and Engineering and M.S.
in Media Science from MIT.
____________
COMPUTER SCIENCE TALK
on Friday, 7 November 2003, 1:30pm
Packard 202
"Bluespec: Why Chip Design Can't Be Left to EE's"
Arvind
MIT
A 5M-gate ASIC is common place in 180nm technology today. We may see
50M to 100M-gate ASICs within a decade as technology improves to sub
90nm. (Fully custom-designed microprocessors are, of course, much
denser and faster then ASICs but also require dramatically more design
resources). Numerous problems related to process and design need to
be solved before such large chips will become commonplace. Some of
these problems, e.g., leaky transistors, porous oxide, controlling
multiple Vt's are clearly in the domain of EE's but computer
scientists are much better equipped to solve the new problems related
to the design-in-the-large. Large designs have to be conceived and
executed in terms of a hierarchy of blocks. The hierarchy cannot be
constructed in an ad hoc manner but should use some method of
composition systematically. Bluespec is a language/methodology that
promotes correctness-by-construction. Its underlying execution model
is based on atomic actions on state elements (flip-flops, registers,
...), i.e., any legal behavior is explainable in a terms of a sequence
of atomic actions on the state. Bluespec has facilities for expressing
highly parameterized modules ("generic classes" in the language sense)
and an expressive language to compose modules. The expressivity of the
language has no limits because its semantics are orthogonal to
hardware execution semantics - the source program is turned into a
flat interconnection of modules by "static elaboration" during the
compile phase. In this talk I will present Bluespec via examples and
show some of the designs done so far.
Bluespec is a joint work of people at MIT and Sandburst Corporation.
About the Speaker: Arvind is the Johnson Professor of Computer Science
and Engineering at the Massachusetts Institute of Technology. As the
Founder and President of Sandburst, a fabless semiconductor company,
Arvind led the Company from its inception in June 2000 until his
return to MIT in August 2002. His work at MIT on high-level
specification and description of architectures and protocols using
Term Rewriting Systems (TRSs), encompassing hardware synthesis as well
as verification, laid the foundations for Sandburst and more recently
Bluespec Inc. Previously, he contributed to the development of dynamic
dataflow architectures, and together with Dr R.S.Nikhil published the
book "Implicit Parallel Programming in pH". Arvind is an IEEE Fellow
and was awarded the Charles Babbage Outstanding Scientist Award in
1994. He has received the Distinguished Alumni Awards from the Indian
Institute of Technology, Kanpur, and the University of Minnesota.
____________
LOGICAL METHODS IN THE HUMANITIES
on Friday, 7 November 2003, 3:00pm - 5:00pm
Baker Room, Stanford Humanities Center
http://www-logic.stanford.edu/seminars.html
"Convergence in the Philosophy of Mathematics"
Ed Zalta
CSLI/Stanford
The Platonist answer to the question, "What is mathematical language
about?", is that it is about abstract individuals (such as zero, the
null set, omega, etc.) and abstract relations (successor, membership,
group addition, etc.). One way to make this answer precise is to
provide a formal, background theory of abstract individuals and
abstract relations. I review one such formal theory and explain the
special way in which the language and theorems of arbitrary
mathematical theories can be interpreted in this formalism. (A full
analysis is developed in my paper "Neologicism? An Ontological
Reduction of Mathematics to Metaphysics", Erkenntnis, vol. 53, nos.
1-2 (2000), 219-265.)
However, it turns out that the background formalism for abstracta
itself is subject to interpretation. The Platonistic interpretation is
just one of (at least) four ways of interpreting the theory. I'll
explain how one can develop fictionalist, structuralist, and
inferentialist interpretations of the formalism. Since each
interpretation offers us a clear, but different, answer to our initial
question, the resulting analysis not only offers a way to make these
philosophies of mathematics more precise, but also unifies them in a
new and unsuspected way. (It also has the consequence that no matter
how the mathematicians decide to extend mathematics with new axioms or
mathematical foundations, the philosopher will have something to say
about the mathematical language used in the extension.)
____________
LINGUISTICS DEPARTMENT COLLOQUIUM
on Friday, 7 November 2003, 3:30pm
Margaret Jacks Hall, Room 460:126
http://www-linguistics.stanford.edu/colloq/
"Drift in Evolutionary Phonology:
Patterns of Austronesian Syncope"
Juliette Blevins
University of California, Berkeley
http://socrates.berkeley.edu/~jblevins/
Recurrent changes in related languages which can not be attributed to
chance, universals or diffusion, have been categorized as instances of
drift. In this talk two robust cases of drift in the Austronesian
language family are identified. In the first case, general syncope of
short unstressed vowels in VC_CV contexts is common in certain
subgroups, but absent in others. In the second case, syncope of
unstressed vowels between identical consonants is common where general
syncope is absent, and rare where general syncope is found. I argue
that the most significant structural feature in predicting general
syncope is the pre-existence of closed syllables. This analysis
follows from a more general hypothesis regarding the role of sound
patterns in determining sound change at the level of the individual
language learner. The same general hypothesis may also be able to
account for the distribution of geminate-producing syncope, once
pre-existing segmental length contrasts are taken into consideration.
The general model makes predictions which go beyond drift: general
structure-preservation effects in sound change like that seen for
syncope in Austronesian are associated with cases where ambiguity in
phonological analysis of phonetic tokens is not subject to innate
perceptual biases. To the extent that these predictions are upheld,
this account of drift contributes to a general and restrictive theory
of sound change.
____________
CS528: BROAD AREA COLLOQUIUM FOR
AI-GEOMETRY-GRAPHICS-VISION-ROBOTICS
on Monday, 10 November 2003, 4:15pm
TCSeq 200
http://graphics.stanford.edu/courses/cs528/
"Modeling by Drawing"
Adam Finkelstein
Computer Science Department, Princeton University
Today's desktop graphics technology can soundly outperform the million
dollar 3D graphics workstation of a decade ago. However, this
revolution in 3D performance has had only a modest impact on people's
lives. One reason is that the average person does not create 3D
content -- it's too difficult with existing tools. This might explain
why the most noticeable impact of 3D graphics is entertainment: the
game and movie industries can afford to hire trained experts to
painstakingly create beautifully-detailed scenes.
Why should it be so hard to create 3D content? After all, many of us
find it easy to sketch out a rough illustration of using a pencil or
chalk board. As palmtop and tablet-PC devices are beginning to
proliferate, we should be able to use such devices to sketch out our
ideas at a coffee shop, the way we might use a napkin today. School
teachers, architects, clothing and industrial designers, and story
tellers should be able to easily create illustrations involving 3D
shapes by somehow sketching with a computer.
In this talk I will describe our own efforts and those of others to
make such applications possible. I will argue that a key enabling
technology is "non-photorealistic rendering" (NPR). This relatively
new field of computer graphics seeks to leverage principles that
artists and illustrators have developed over many centuries for
conveying information. I will survey NPR research, and describe some
of the challenges and new directions for the field.
About the Speaker: Adam Finkelstein is an associate professor of
computer science at Princeton University. His research interests in
computer graphics include non-photorealistic rendering,
multiresolution techniques, animation, and applications of computer
graphics in art. He received his Ph.D. from the University of
Washington in 1996. From 1987 to 1990, he was a software engineer at
Tibco where he wrote software for people who trade stock. He was an
undergraduate student at Swarthmore College (class of 1987) where he
studied (occasionally) physics and computer science.
____________
STANFORD SEMANTICS AND PRAGMATICS WORKSHOP
on Tuesday, 11 November 2003, 12 noon
Margaret Jacks Hall 460:126
http://www-linguistics.stanford.edu/semgroup/
"Some foundational issues for a Construction Grammar.
Mutual definition and cluster concepts"
Arnold Zwicky
Stanford
The central problem of syntax is how the composition of an expression
is related to its distribution. All the conceptual apparatus of syntax
arises from trying to describe how the internal syntax and the
external syntax of expressions fit together. Internally, expressions
are constructed around central words (heads, in Bloomfield's sense);
the category of an expression is the category of its head word.
Externally, the distribution of an expression is a matter of the
syntactic functions it can serve.
In this picture, the basic concepts of syntax are two kinds of
categories: classes of words (L-categories) and classes of expressions
(F-categories, the extensions of syntactic functions), which are
connected to one another via syntactic rules. Customarily, the
inventories of L-categories and F-categories are taken to be
universals, and also to be associated with prototypical meanings--for
L-categories, with prototypical denotations; for F-categories, with
prototypical semantic or pragmatic roles. So, members of the
L-category N prototypically denote objects and serve as the heads of
expressions that are, among other things, eligible to serve as members
of the F-category Subject, prototypically associated with the Agent
semantic role and the Topic pragmatic role.
A constructional approach to syntax allows for a rather different view
of L-categories and F-categories, in which they are not given
universally or associated with meaning directly, but instead stand in
a relationship of language-particular mutual definition with each
other and with constructions themselves, and receive their meanings by
virtue of the semantics and pragmatics associated with particular
constructions. Each construction has a number of "slots" associated
with it, some of which must be filled by words and some by phrases
(expressions not limited to words); for each word slot, there is then
an L-category, and for each phrase slot an F-category. (See Croft
(2001) for a version of this approach.)
The obvious objection is that the number of L-categories and
F-categories, so defined, is just enormous. For instance, what counts
as a Subject in inverted clauses in English is not quite the same as
what counts as a Subject in uninverted clauses; these are then,
literally, different F-categories.
To show how this difficulty can be resolved, I consider paradigm
classes in languages with rich inflectional systems. If we define a
paradigm class in terms of the applicable morphological rules, then
Latin has an enormous number of noun declensions. However, there is a
very high degree of association between the applicability of different
morphological rules, with the result that there is a small number of
"rule clusters" (the major declension classes), with most nouns
falling in one of them.
So it is with L-categories and F-categories. There is a high degree of
clustering here. Yes, there are words with mixed or intermediate
properties, and words with exceptional or idiosyncratic properties,
but most words belong in one of a small number of clusters, which are
the major parts of speech for the language in question.
____________
SNRC INDUSTRY SEMINAR
on Tuesday, 11 November 2003, 4:15pm
Gates B03
http://snrc.stanford.edu/events/industry-seminar/
"Application Design for Real-time, Embedded Sensor Networks"
Dr. Asuman S\"unb\"ul
Kestrel Institute
When we look at the current technology, we will observe a strong
divergence away from traditional computing. While the emphasis of
traditional computing involves a certain kind of more or less
``fixed'' networks, its more future oriented counterpart is a
collection of mostly mobile, tiny devices which may be equipped with
sensors, actuators and radio. Typical examples are e.g. swarm type
systems, ubiquitous computing, biologically inspired or network
embedded systems.
The application design for those environments are considerably
different than their traditional counterparts. There is no centralized
processor to guide the global strategy towards good solutions. The
system has to be capable of accomplishing difficult tasks in dynamic
and varied environments without any external guidance or control and
with no central coordination. Further, they vary in terms of network
connectivity, available power, available sensors and reliability of
sensor data.
This talk will give an insight of ongoing work in the CONSONA project
at Kestrel Institute. Distributed problem solving techniques will be
presented that are based on a concept of refinement transformations
from abstract constraint specifications to executable code.
About the Speaker: Since 2001, Dr. Asuman S\"unb\"ul is working for
Kestrel Institute, Palo Alto. She has received a PhD. and Diploma
with summa cum laude from the Computer Science Department at the
Technical University Berlin.
From 1998-2001 she has received stipendium from the German Research
Association as a fellow of the Berlin Brandenburg Graduate School for
Distributed Information Systems During that period, she conducted part
of her research studies in cooperation with the Fraunhofer Institute
in Berlin. Her research on software architecture and network embedded
systems has been awarded with the "Best Paper Award" at the
International Conference for Integrated Process Design (Dallas, June
2000). She has received the EAST (European Association of Software
Technology) Award in Pasadena in June 2002.
From 1996-1997 she was a research fellow at the International Computer
Science Institute (ICSI) in Berkeley at the AI group. She is founding
board member of ForTIA, the Formal Techniques Industry Association, an
initiative of the "Formal Methods Europe" consortium. Among other
activities, she is reviewer, PC member, session organizer,
distinguished lecturer and keynote speaker on various international
conferences.
____________
EMERGING TECHNOLOGY GROUP
on Tuesday, 11 November 2003, 7:00pm
SAP, 3475 Deer Creek Road, Palo Alto, Bldg. B demo room
http://tinyurl.com/tdfa
http://www.sdforum.org/
(there is a fee for non-SDForum members, see web page)
"Presentation: Intellectual Property Protection"
Florian Pestoni
IBM Almaden
With the advent of consumer grade digital technology, content such as
music and movies is no longer bound to the physical media that carries
it. This presents new challenges to content owners, who want to
protect their intellectual property while at the same time extracting
economic benefit from it. On the other hand, consumers want ease of
use and convenience.
In this talk, I will describe some of the existing and proposed
solutions, which represent different trade-offs between the needs of
the parties involved. While technology such as cryptography plays an
important role in this space, a complete solution usually relies on
legal and policy aspects; I will touch upon some of these issues to
give you a complete picture of this very complex space.
About the Speaker: Florian Pestoni is a software engineer at IBM
Almaden Research Center. His research interests include technical and
business aspects of digital media distribution. He represents IBM in
several standards activities. Pestoni received an MS in electrical
engineering from the University of Buenos Aires and an MBA from the
University of California, Berkeley. Contact him at
fpestoni@almaden.ibm.com.
____________
EE380: COMPUTER SYSTEMS LAB COLLOQUIUM
on Wednesday, 12 November 2003, 4:15pm to 5:30pm
NEC Auditorium (B03), Gates Computer Science Building
http://ee380.stanford.edu/contents.html
"The Skynet Virus:
Why It Is Unstoppable, How To Stop It"
Marc Stiegler
Hewlett Packard
In Terminator 3, the SkyNet AI distributes itself globally, becoming
invulnerable to destruction, by exploiting the fundamental failure of
computer security. it then destroys the world when it gains control of
America's nuclear missiles. While this is a considerably more serious
disaster than any wrought so far by cyber-crackers, cyber-terrorists,
or cyber-warriors, the flaws that make SkyNet unstoppable are the same
flaws that make crackers, terrorists, and warriors possible. The same
fix that eliminates crackers can terminate the Terminators.
This presentation starts by examining in detail the fundamental flaw
in computer security today--the ludicrously excessive authority
granted to even silly programs like Barbie Fashion Designer. We go on
to see how the Principle of Least Authority (also known as the
Principle of Least Privilege), once ubiquitously applied, can end the
madness while simultaneously making the user interface to security
simpler than it is today.
About the speaker: Mr. Stiegler is currently a Visiting Scholar at
Hewlett-Packard. Previous to this appointment, as COO of Combex Inc.,
Mr. Stiegler led a DARPA research contract to build a working
prototype of a capability secure desktop that is invulnerable to
traditional computer viruses and trojan horses. Mr. Stiegler designed
and implemented the application launch framework for the desktop,
developing new forms of user interface/security integration that allow
people to safely use even virus-ridden applications without having to
work with even the normal litany of foolish security dialog boxes,
passwords, and certificates. This desktop was later demonstrated in
Mr. Stiegler's presentation, "Exploiting Virus-Laden Software", for
the O'Reilly Emerging Technology Conference in 2002.
Highlights of Stiegler's earlier works include serving as VP of
Engineering for Autodesk, and winning the Software Publisher's
Association Best New Business Software Award for DecideRight in
1996. His sf novel Earthweb depicts a future in which a mature Web,
with advanced features such as bidirectional links and idea futures,
becomes the underpinning fabric of global society.
____________
CSLI COGLUNCH
on Thursday, 13 November 2003, 12:15pm-1:30pm
Cordura Hall, Room 100
http://www-csli.stanford.edu/events/Coglunch/
"On the relation between rhythm perception and production:
a Bayesian model"
Peter Desain
Nijmegen University
Ecological psychology posed the relation between perception and action
in the environment. Newer cognitive theories postulate an intimate
link via mental representations used by both processes. In music the
coding of a rhythm into an observable temporal pattern by the
performer and the subsequent decoding by the listener is thus supposed
to be veridical. However, experiments show that rhythms are not always
produced in accordance with their perceived identity, which is
evidence against a direct perception-action coupling. Using Bayes rule
to formalize competition between mental representations and
non-uniform exposure in a meta-analysis, the contrast almost
disappears. This suggests an optimal adaptation of our perceptual
system to the environment, and it removes the apparent empirical
counterevidence against perception-action theories.
About the Speaker: Peter Desain is part of the 'Music, Mind, Machine'
group at Nijmegen University in The Netherlands. He is visiting this
year at CSLI and CCRMA.
____________
SSP10: SYMBOLIC SYSTEMS FORUM
on Thursday, 13 November 2003, 4:15pm
Bldg. 380:380C (Math Corner)
http://symsys.stanford.edu:8081/ssp-dynamic/servlet/ssp_events
"The Return of Moral Fictionalism"
Nadeem Hussain
Philosophy, Stanford University
I have argued elsewhere that Nietzsche should be interpreted as
providing an error theory of existing evaluative discourse and
proposing, for some, a fictionalist replacement--in the current
jargon: "revolutionary fictionalism". This interpretation gains some
support from Nietzsche's historical context: Strauss and Feuerbach's
readings of Christianity, Lange's "Standpoint of the Ideal", and the
views of early positivists like Mach and Avenarius. Logical
positivism involved a rejection of such error-theoretic and
fictionalist strategies. The return of naturalism has perhaps not
surprisingly brought with it a contemporary resurgence of error
theories and fictionalisms about various domains including
mathematics, modality and unobservables. Within contemporary
metaethics, though, John Mackie has been essentially the lone
representative of error theory and no sustained attempt had been made
to defend fictionalism--revolutionary or hermeneutic--for ethics and
morality. This seems to be changing rapidly. After summarizing some
of the benefits of fictionalism, I argue that error theoretic and
fictionalist accounts of the evaluative face some serious problems
whose difficulty has not been fully appreciated in the current
resurgence. These problems are both hard versions of problems that
arise for fictionalism in general and, perhaps more importantly,
problems specific to the deployment of an error theory and
fictionalism for ethical discourse.
About the Speaker: Nadeem Hussain is an Assistant Professor of
Philosophy at Stanford University. He specializes in metaethics,
philosophy of action and 19th Century German philosophy. His other
areas of interest include political philosophy and medieval Islamic
philosophy. He is currently writing on the role of reasons in
practical reflection, the influences of positivism on Nietzsche's
metaphysics and epistemology, and fictionalism in both contemporary
metaethics and Nietzsche's accounts of valuing.
____________
CS547: HUMAN-COMPUTER INTERACTION SEMINAR
on Friday, 14 November 2003, 12:30-2:00pm
Gates B01
http://www-pcd.stanford.edu/cs547/
"A Next-Generation Consumer Photo Application:
Challenges in Creating a Simple Yet Powerful User Experience"
Michael Slater
Adobe
Making it easy for consumers to manage their digital photos is a
surprisingly challenging problem. People need a way to easily collect
and search thousands of photos, and to then share and print them how
they want. As photo collections become larger and the things people
want to do with their photos more diverse, the challenge becomes even
greater. By providing a single integrated solution, the complexity of
using multiple applications with the file system as their only common
element can be eliminated.
In this talk, I'll describe the design ideas and tradeoffs that went
into Adobe's Photoshop Album 2.0 (
http://www.adobe.com/photoshopalbum/ ), the recently released
successor to the first-generation version of this photo manager. I'll
show how the design has evolved from a tablet appliance design at a
startup, through two generations of PC software, and some of the
things we've learned along the way. I'll explore the challenges of
meeting the needs of diverse classes of users, balancing simplicity
and flexibility, and getting users to adopt new paradigms.
About the Speaker: Michael Slater is director of technology strategy
for the Digital Imaging and Video Business Unit at Adobe Systems,
where he guides new technology evaluations and seeks external
technologies to enhance Adobe's future products. He was previously
chairman of Fotiva, Inc, a company he cofounded (originally called
PhotoTablet) to fulfill his vision for a new software approach that
would support the mass-market adoption of digital photography. He is
the author of the forthcoming book, The Photoshop Album Book:
Enjoying Digital Photography, to be published in December.
Before founding Fotiva, he was founder and President of MicroDesign
Resources, where he created the Microprocessor Report newsletter and
Microprocessor Forum and Embedded Processor Forum conferences. In
addition to his role at MDR, Michael was a columnist and contributor
for many computer industry publications. Before founding MDR, he was
an independent engineering consultant and an R&D engineer at Hewlett
Packard.
____________
END MATERIAL
The CSLI Calendar appears weekly on Wednesdays throughout the academic
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). Problems with subscribing or
unsubscribing should be sent to
owner-csli-calendar@csli.stanford.edu.
The full current issue is at
http://www-csli.stanford.edu/Archive/calendar/current.shtml
and the archives at
http://www-csli.stanford.edu/Archive/calendar/
People on most of the CSLI computers can type 'help csli-calendar' to
see the current issue.
The CSLI Calendar is also posted each week to
news://nntp-csli.stanford.edu/csli.bboard.
and
news://news.stanford.edu/su.events
Information about CSLI's research program is available at
http://www-csli.stanford.edu/
For maps to the Stanford University campus see
http://www.stanford.edu/home/visitors/maps.html
____________