[Date Prev][Date Next][Date Index]
CSLI Calendar, 29 March 2000, vol. 15:24
C S L I C A L E N D A R O F P U B L I C E V E N T S
______________________________________________________________________
29 March 2000 Stanford Vol. 15, No.24
______________________________________________________________________
A weekly publication of the
Center for the Study of Language and Information (CSLI)
Stanford University, Ventura Hall, Stanford, CA 94305-4115
____________
ACTIVITIES FROM 29 MARCH TO 7 APRIL 2000
WEDNESDAY, 29 MARCH
12:45pm Stanford Distributed Systems Seminar
McCullough Building: 150
TRIAD: A Scalable, Deployable NAT-based
Internet Architecture
David Cheriton
Stanford University
http://netseminar.stanford.edu
Abstract below
4:00pm Geometric Analysis Seminar
Building 380:381T
Total Curvatures of Holonomic Links
Tobias Ekholm
Stanford University
http://math.stanford.edu/html/seminars.html
4:15pm Broad Area Colloquium For
AI-Geometry-Graphics-Robotics-Vision
TCseq201, Lecture Hall B
Computer Modeling of Human Movement Abnormalities
Scott Delp
Biomechanical Engineering Division
Mechanical Engineering Department
Stanford University
http://robotics.stanford.edu/ba-colloquium/
Abstract below
4:15pm Computer Systems Laboratory Colloquium
Gates Computer Science Building: B03 (NEC Auditorium)
The MAJC Processor Architecture
Marc Tremblay
Distinguished Engineer, Sun Microsystems, Inc.
http://www.stanford.edu/class/ee380
Abstract below
THURSDAY, 30 MARCH
4:00pm Xerox PARC Forum
George Pake Auditorium at Xerox PARC
AspectJ(tm) OR
How to Use Aspect-Oriented Programming to Solve Common
Modularity Problems in Java(tm) Programs.
Gregor Kiczales
University of British Columbia & AspectJ.org
http://www.parc.xerox.com/forum
Abstract below
4:15pm US Japan Technology Management Center
Skilling Auditorium
Challenges and Opportunities in
Integration of Photonics and Electronics
David Miller
http://fuji.Stanford.edu/seminars/spring00/
Abstract below
FRIDAY, 31 MARCH
12:00pm Logic Lunch
Building 380:383N
Computational Logic in Support of Mathematics:
Why and How.
Ursula Martin
University of St. Andrews, Visiting SRI
http://www-logic.stanford.edu/seminars.html
Abstract below
12:30pm CS547: Stanford Seminar on People,
Computers, and Design
Gates B03 (NEC Classroom)
Engagement
Marney Morris
Animatrix
http://pcd.stanford.edu/seminar
Abstract below
2:30pm Informal Geometry and Topology Seminar
Building 380:383N
Obstructions to Embedding 2-Spheres in 4-Manifolds
Rob Schneiderman
UC Berkeley
http://math.stanford.edu/html/seminars.html
3:00pm Applied Math Seminar
Building 380:380C
Stochastic Fluid Flows and Wiener Chaos
B. Rozovsky
USC
http://math.stanford.edu/html/seminars.html
3:15pm Infolab Seminar
201 T-Seq
Pathway/Genome Databases and Software Tools
Peter D. Karp, Ph.D.
Bioinformatics Research Group
SRI International
http://www-db.stanford.edu/dbseminar/dbseminar.html
Abstract below
3:15pm Philosophy Colloquia
Building 90:92Q
Desires, Emotions and Virtues
Simon Blackburn
University of North Carolina, Chapel Hill
http://www-philosophy.stanford.edu/
3:30pm Semantics and Pragmatics Lecture
Building 460:126
Information Packaging, Canonicity, and Iconicity
Enric Vallduvi
Universitat Pompeu Fabra, Barcelona
http://www-linguistics.stanford.edu/Linguistics
SATURDAY, 1 APRIL
1:00pm Special Symposium
TCseq 200
Will Spiritual Robots Replace Humanity by 2100?
Various Speakers
http://www.stanford.edu/dept/symbol/index.html
Abstract below
MONDAY, 3 APRIL
2:15pm CSLI Talk
Cordura 100
Japanese Particles
Melanie Siegel
DFKI, Saarbruecken, Germany
http://www-csli.stanford.edu/
Abstract below
2:30pm ICSI Talk
Main Lecture Hall at ICSI (Berkeley)
Rule-Extraction From Trained Artificial Neural Networks
for Data Mining and Natural Language Processing
Joachim Diederich
Machine Learning Research Centre
http://www.icsi.berkeley.edu/location.html
Abstract below
7:00pm Stanford Presidential Lecture
Pigott Hall, Bldg 260:252
Context-Sensitivity and Its Feedback: The
Two-Sidedness of Humanistic Discourse
Wolfgang Iser
Literary Theorist
http://prelectur.stanford.edu/calendar/
TUESDAY, 4 APRIL
4:00PM Stanford Presidential Lecture
Pigott Hall, Bldg 260:252
Open Discussion
Wolfgang Iser
Literary Theorist
http://prelectur.stanford.edu/calendar/
WEDNESDAY, 5 APRIL
4:15pm Broad Area Colloquium For
AI-Geometry-Graphics-Robotics-Vision
TCseq201, Lecture Hall B
How Common Sense Might Work
Kenneth D. Forbus
Qualitative Reasoning Group
Northwestern University
http://robotics.stanford.edu/ba-colloquium/
Abstract below
4:15pm Computer Systems Laboratory Colloquium
Gates Computer Science Building: B03 (NEC Auditorium)
Identity in a Networked World
Pierluigi Zappacosta and Vance Bjorn
Digital Persona Inc.
http://www.stanford.edu/class/ee380
Abstract below
4:15pm CS531: SCCM Seminar
Gates B12
Grobner Bases
Bernd Sturmfels
UC Berkeley, Department of Mathematics
http://www-sccm.stanford.edu/nflash/nf-seminars.html
THURSDAY, 6 APRIL
4:00pm Xerox PARC Forum
George Pake Auditorium at Xerox PARC
Characters Everywhere"
Barbara Hayes-Roth
Computer Science Department, Stanford &
Extempo Systems, Inc.
http://www.parc.xerox.com/forum
4:15pm Stanford Algorithms Seminar
Gates Building 498
Approximate Sequence Nearest Neighbors
S. Cenk Sahinalp
Case Western
http://Theory.Stanford.EDU/~aflb/
Abstract below
4:15pm US Japan Technology Management Center
Skilling Auditorium
The Tera Era
Waguih Ishak
Agilent Technologies Labs
http://fuji.Stanford.edu/seminars/spring00/
____________
STANFORD DISTRIBUTED SYSTEMS SEMINAR
on Wednesday, 29 March 2000, 12:45pm
McCullough Building: 150
http://netseminar.stanford.edu
TRIAD: A Scalable, Deployable NAT-based Internet Architecture
David Cheriton
Stanford University
Network address translation (NAT) has become an important technology
in the Internet, supporting address reuse, addressing autonomy,
transparent redirect, endpoint concealment and other uses. However,
NAT has a number of deficiencies, like breaking the original Internet
architecture and conflicting with end-to-end reliability and
security. TRIAD is a proposed architecture that solves these problems
with NAT. It bases identification on DNS names, restoring end-to-end
semantics by using a name-based pseudo-header, and extending the
inter-realm addressing with a "shim" protocol on top of IPv4. We claim
that TRIAD is scalable and incrementally deployable in the current
Internet. It also raises the question of whether we really need to go
through the challenging transition to IPv6 in order to scale the
Internet. This talk describes TRIAD and our implementation/results to
date.
For more info see: http://www-dsg.stanford.edu/papers/triad/triad.html
David Cheriton is a faculty member in the Computer Science Department
at Stanford University.
____________
BROAD AREA COLLOQUIUM FOR
AI-GEOMETRY-GRAPHICS-ROBOTICS-VISION
on Wednesday, 29 March 2000, 4:15pm
TCseq201, Lecture Hall B
http://robotics.stanford.edu/ba-colloquium/
Computer Modeling of Human Movement Abnormalities
Scott Delp
Biomechanical Engineering Division
Mechanical Engineering Department
Stanford University
The outcomes of surgeries performed to correct movement abnormalities
are unpredictable and sometimes unsuccessful. This problem exists
because: (i) the biomechanical causes of the abnormal movement
patterns are unclear, (ii) the effects of common surgical procedures
on muscle function are not understood, and (iii) the development and
testing of new operative techniques rely almost entirely on clinical
trials (i.e., trying surgeries on patients) in which the means to
quantify surgical changes or predict postoperative results do not
exist. I believe that the design of improved treatments will proceed
more effectively if computer models are developed that can help
explain the underlying causes of movement abnormalities and the
functional consequences of surgical interventions. This presentation
will describe a computer simulations that provides insight into the
mechanics several movement abnormalities. The presentation will also
review the results of simulations that demonstrate the utility of
computer-assisted design of corrective surgical procedures.
About the Speaker:
Scott Delp received the Ph.D. in mechanical engineering from Stanford
University in 1990. For the next eight years he held a faculty
position at Northwestern University, where he was jointly appointed
between the Medical and Engineering Schools. Scott moved to Stanford
this year as an Associate Professor in the newly formed Biomechanical
Engineering Division in the Mechanical Engineering Department.
Scott has established the Digital Human Lab at Stanford to focus on
the development and testing of human movement simulations. These
simulations are used to study mechanisms of neuromuscular diseases,
design surgeries and medical devices, guide the performance of
surgery, and educate engineers, medical students, and surgical
residents. Scott has received numerous awards for his work, including
the Young Scientist Award from the American Society of Biomechanics, a
National Young Investigator Award from NSF, and a TRP award for which
he was honored at a White House ceremony with President Clinton.
____________
COMPUTER SYSTEMS LABORATORY COLLOQUIUM
on Wednesday, 29 March 2000, 4:15pm
Gates Computer Science Building: B03 (NEC Auditorium)
http://www.stanford.edu/class/ee380
The MAJC Processor Architecture
Marc Tremblay
Distinguished Engineer, Sun Microsystems, Inc.
The MAJC (pronounced "magic") processor architecture was created based
on the assumption that Java will be the dominant platform for
internet/ intranet computing in enterprise and consumer markets. The
architecture was therefore derived based on a broad set of
applications representative of current and future workloads. These
differ dramatically from the benchmarks used in the 70's and 80's for
defining CISC and RISC processors. For instance, MAJC focuses on
"throughput computing" where the throughput of multiple applications
is as important as (if not more important than) the latency of a
single application. Examples of target applications are
multi-threaded Java and C++ applications found on Webservers, Mail
servers, Application servers, thin clients, etc.
Also, digital data types and their associated operations, needed for
the handling of digital communication, or for encryption (secure
servers, VPN, and e-commerce transactions), or for compression of
digital contents, or for processing digitized analog signals, are
given as much importance in MAJC as traditional data types (integer
and float), and traditional operations (add and subtract). Functional
units therefore operate on "data" much like methods operate on object
fields, almost irrespective of data types.
High Instruction-Level Parallelism (ILP) is reached by issuing
multiple instructions per cycle (VLIW ISA) that operate on operands
originating from a large unified register file. ILP also gets a boost
from traditional techniques such as predication, speculation, branch
filtering, load positioning, etc. More importantly, support for
higher levels of parallelism, namely thread-level parallelism (TLP) is
provided. TLP and Space Time Computing, a form of speculative multi-
threading, drove many architecture decisions and their impact is
reflected in the ISA and in the micro-architecture of the first MAJC
processor.
Besides covering the MAJC architecture, details will be given during
the talk of the MAJC-5200, a VLIW Multi-Processor System-On-a-Chip
with support for Space Time Computing.
About the Speaker:
Marc Tremblay is a Distinguished Engineer leading some of the high-
performance microprocessor research and development at Sun
Microsystems. As the Chief Architect of the MAJC program, he is
responsible for the creation and implementation a new family of
microprocessors tailored to the Java computing environment, to
processing new-media applications, and to addressing Service Provider
application throughput. Prior to his current responsibilities, he was
an architect for Sun's UltraSPARC I and II microprocessors. He also
started and was architect of the picoJava processor core.
Marc holds a M.S. and Ph.D. in Computer Science from UCLA and a
B.S. in Physics Engineering from Laval University in Canada. He holds
17 patents and has 60 more outstanding in various areas of computer
architecture. He is the Co-Chair of the Hot Chips 2000 Conference.
____________
XEROX PARC FORUM
on Thursday, 30 March 2000, 4:00pm to 5:00pm
George Pake Auditorium at Xerox PARC
http://www.parc.xerox.com/forum
AspectJ(tm) OR
How to Use Aspect-Oriented Programming to Solve Common
Modularity Problems in Java(tm) Programs.
Gregor Kiczales
University of British Columbia & AspectJ.org
Object-oriented programming has given us a simple and powerful model
for software development. We break our systems down into objects,
each of which implements a part of the system; together the objects
produce the whole behavior we desire. When it works, the
object-oriented approach leads to designs and implementations with
clean natural modularity. We can reason about and modify a system
entirely in terms of the object-based modularity. But many important
system behaviors are not the responsibility of a single class of
object. Instead, these concerns crosscut the object structure and, as
a result, their implementation ends up being spread across multiple
classes. Examples of crosscutting concerns include: optimal update
mechanisms, resource sharing, multi-object initialization, consistency
enforcement and display look and feel. Aspect-oriented programming
enables programmers to capture crosscutting concerns in
clearly-defined separate program entities called aspects. AspectJ is
a smooth integration of aspect-oriented programming with Java.
AspectJ programs are Java platform compatible. Using AspectJ it is
possible to solve a number of common modularity problems in simple and
powerful ways.
Gregor Kiczales is leader of the Xerox PARC group that has developed
aspect-oriented programming and AspectJ. He is also Professor of
Computer Science at the University of British Columbia. The focus of
his research is enabling programmers to write programs that, as much as
possible, look like their design. Previously he worked on open
implementation, metaobject protocols and the CLOS object-oriented
programming language.
This Forum is OPEN to the public. Refreshments will be served from
3:45 to 4:00.
____________
US JAPAN TECHNOLOGY MANAGEMENT CENTER
on Thursday, 30 March 2000, 4:15pm to 5:30pm
Skilling Auditorium
http://fuji.Stanford.edu/seminars/spring00/
Challenges and Opportunities in
Integration of Photonics and Electronics
David Miller
Though both are very important for handling information, optics and
electronics are largely separate technologies. If we could
successfully join optics, optoelectronics, and mainstream electronics
efficiently in large numbers at the level of the electronic chips, we
could make "smart" optical systems and extend the communications
abilities of optics to the electronic chips and modules. This talk
will look at the difficulties of such integration, and some of the
possible approaches and the resulting opportunities.
Speaker Bio: http://www-ee.stanford.edu/~dabm/biography.html
____________
LOGIC LUNCH
on Friday, 31 March 2000, 12:00pm
Building 380:383N
http://www-logic.stanford.edu/seminars.html
Computational Logic in Support of Mathematics: Why and How.
Ursula Martin
University of St. Andrews, Visiting SRI
Over the past few years I have been engaged in reassessing
computational logic on the light of the needs of working
mathematicians and users of mathematics: I argue that a new approach
is needed if we are to be of value to this community.
As an example I present recent work on computational logic tools to
support the symbolic analysis of differential equations in computer
algebra systems like MAPLE or Mathematica. Computer algebra systems
implement algorithms for differential rings and fields, rather than
notions involving limits, and hence are unreliable in matters
involving analysis rather than algebra, particularly where parameters
are involved. We consider the problems inherent in using a computer
algebra system to investigate differential equations, and describe how
we have solved some of them by means of calls from MAPLE to a
continuity checker and a library of facts about elementary functions
which we have implemented in PVS.
http://www.csl.sri.com/~ursula
____________
CS547: STANFORD SEMINAR ON PEOPLE, COMPUTERS, AND DESIGN
on Friday, 31 March 2000, 12:30pm to 2:00pm
Gates B03 (NEC Classroom)
http://pcd.stanford.edu/seminar
Engagement
Marney Morris
Animatrix
The heart of effective interactive design is engagement. To capture
the users attention and maintain their interest, it is important to
understand who they are and to anticipate what they will
appreciate. Marney will be showing examples of engagement that have
proved effective over the years, and will talk about a process for
developing engaging projects.
Marney Morris is the founder of Animatrix, an interactive design firm
based in San Francisco. Since 1984, Animatrix has shipped over 300
projects for clients like AT&T, Clinique, The Limited, Kodak, Domino's
Pizza, Hewlett Packard, Microsoft, Chase Manhattan Bank and the Walt
Disney Company. Animatrix created the classic 'Guided Tour for the
Macintosh' for Apple Computer. In Animatrix also began publishing
SprocketWorks(TM), a new way of interactive learning.
____________
INFOLAB SEMINAR
on Friday, 31 March 2000, 3:15pm to 4:30pm
201 T-Seq
http://www-db.stanford.edu/dbseminar/dbseminar.html
Pathway/Genome Databases and Software Tools
Peter D. Karp, Ph.D.
Bioinformatics Research Group
SRI International
One revolution sweeping molecular biology is the high-throughput
generation of massive amounts of experimental data, such as by the
human genome project. A second revolution is changing the substrate of
biological information from the biological literature to structured
databases. A pathway/genome database (DB) integrates information about
the genome, proteins, and biochemical pathways of an organism. For
example, the EcoCyc DB describes the full genome and metabolic-pathway
complement of E. coli. EcoCyc is the first DB to describe the full
biochemical network of an organism, and is used by thousands of
scientists for tasks ranging from metabolic engineering of bacteria to
analysis of other bacterial genomes.
The Pathway Tools software developed in conjunction with EcoCyc
includes algorithms for interrogation, visualization, editing, and WWW
publishing of pathway/genome DBs. The EcoCyc project has been a rich
environment for computer-science and bioinformatics research. The talk
will describe several computational contributions of the project
including (a) the Ocelot object/relational database manager, (b) a
reusable, schema-driven object-database editor, (c) a system for
dynamically translating X-windows into HTML and GIF images, (d)
hierarchical graph-layout algorithms for displaying the cellular
biochemical network, and (e) algorithms for prediction and analysis of
cellular biochemical networks.
http://ecocyc.DoubleTwist.com/ecocyc/
Biography:
Peter D. Karp received the Ph.D. degree in Computer Science from
Stanford University in 1989. He was a postdoctoral fellow at
the National Center for Biotechnology Information at the National
Institutes of Health. He was a vice president at DoubleTwist Inc, a
bioinformatics company. He has spent seven years at the Artificial
Intelligence Center at SRI International, where he now directs a
bioinformatics research group. His research interests include
knowledge representation and database systems, machine learning,
scientific databases, and computing with biochemical networks.
____________
SPECIAL SYMPOSIUM
on Saturday, 1 April 2000, 1:00pm to 5:30pm
TCseq 200
http://www.stanford.edu/dept/symbol/index.html
Will Spiritual Robots Replace Humanity by 2100?
Various Speakers
A Stanford Symposium organized by Douglas Hofstadter, which is free and
open to the public.
Primary speakers:
Ray Kurzweil (inventor of reading machine for
the blind, electronic keyboards, etc., and author
of "The Age of Spiritual Machines")
Hans Moravec (a pioneer of mobile robot
research, and author of "Robot: Mere Machine
to Transcendent Mind")
Bill Joy (co-founder of, and chief scientist at,
SUN Microsystems)
John Holland (inventor of genetic algorithms,
and artificial-life pioneer; professor of computer
science and psychology at the U. of Michigan)
Panel members:
Ralph Merkle (well-known computer scientist
and one of today's top figures in the explosive
field of nanotechnology)
Kevin Kelly (editor at "Wired" magazine and
author of "Out of Control", a study of
bio-technological hybrids)
Frank Drake (distinguished radio-astronomer
and head of the SETI Institute -- Search for
Extraterrestrial Intelligence)
John Koza (inventor of genetic programming,
a rapidly expanding branch of artificial
intelligence)
Symposium organizer and panel moderator:
Douglas Hofstadter (professor of cognitive
science at Indiana; author of "Godel, Escher,
Bach", "Fluid Concepts and Creative
Analogies", etc.)
In 1999, two distinguished computer scientists, Ray Kurzweil and Hans
Moravec, came out independently with serious books that proclaimed
that in the coming century, our own computational technology, marching
to the exponential drum of Moore's Law and more general laws of
bootstrapping, leapfrogging, positive-feedback progress, will outstrip
us intellectually and spiritually, becoming not only deeply creative
but deeply emotive, thus usurping from us humans our self-appointed
position as "the highest product of evolution".
These two books (and several others that appeared at about the same
time) are not the works of crackpots; they have been reviewed at the
highest levels of the nation's press, and often very favorably. But
the scenarios they paint are surrealistic, science-fiction-like, and
often shocking.
According to Kurzweil and Moravec, today's human researchers, drawing
on emerging research areas such as artificial life, artificial
intelligence, nanotechnology, virtual reality, genetic algorithms,
genetic programming, and optical, DNA, and quantum computing (as well
as other areas that have not yet been dreamt of), are striving,
perhaps unwittingly, to render themselves obsolete -- and in this
strange endeavor, they are being aided and abetted by the very
entities that would replace them (and you and me): superpowerful
computers that are relentlessly becoming tinier and tinier and faster
and faster, month after month after month.
Where will it all lead? Will we soon pass the spiritual baton to
software minds that will swim in virtual realities of a thousand sorts
that we cannot even begin to imagine? Will uploading and downloading
of full minds onto the Web become a commonplace? Will thinking take
place at silicon speeds, millions of times greater than carbon speeds?
Will our children -- or perhaps our grandchildren -- be the last
generation to experience "the human condition"? Will immortality take
over from mortality? Will personalities blur and merge and
interpenetrate as the need for biological bodies and brains recedes
into the past? What is to come?
To treat these disorienting themes with the seriousness they deserve
at the dawn of the new millennium, cognitive scientist Douglas
Hofstadter has drawn together a blue-ribbon panel of experts in all
the areas concerned, including the authors of the two books cited. On
Saturday, April 1 (take the date as you will), three main speakers and
five additional panelists will publicly discuss and debate what the
computational and technological future holds for humanity. The forum
will be held from 1 PM till 5:30 PM, and audience participation will
be welcome in the final third of the program.
____________
CSLI TALK
on Monday, 3 April 2000, 2:15pm
Cordura 100
http://www-csli.stanford.edu/
Japanese Particles
Melanie Siegel
DFKI, Saarbruecken, Germany
Particles fulfill several distinct central roles in the Japanese
language. They can mark arguments as well as adjuncts, can be
functional or have semantic functions. There is, however, no
straightforward matching from particles to functions; e.g., GA can
mark the subject, the object or an adjunct of a sentence. Particles
can cooccur. Verbal arguments that could be identified by particles
can be eliminated in the Japanese sentence. And finally, in spoken
language particles are often omitted. A proper treatment of particles
is thus necessary to make an analysis of Japanese sentences possible.
Our treatment is based on an empirical investigation of 800 dialogues.
We set up a type hierarchy of particles motivated by their
subcategorizational and modificational behaviour. This type hierarchy
is part of the Japanese syntax in Verbmobil.
____________
ICSI TALK
on Monday, 3 April 2000, 2:30pm to 4:00pm
Main Lecture Hall at ICSI (Berkeley)
http://www.icsi.berkeley.edu/location.html
Rule-Extraction From Trained Artificial Neural Networks
for Data Mining and Natural Language Processing
Joachim Diederich
Machine Learning Research Centre
It is becoming increasingly apparent that without some form of
explanation capability, the full potential of trained Artificial
Neural Networks (ANNs) may not be realised. This seminar gives an
overview of techniques developed to redress this situation.
Specifically the seminar focuses on mechanisms, procedures, and
algorithms designed to insert knowledge into ANNs (knowledge
initialisation), extract rules from trained ANNs (rule extraction),
and utilise ANNs to refine existing rule bases (rule refinement). The
seminar also introduces a taxonomy for classifying the various
techniques, discusses their modus operandi, and delineates criteria
for evaluating their efficacy. Finally, results from data mining and
natural language processing experiments will be presented.
This talk will be held in the Main Lecture Hall at ICSI. 1947 Center
Street, Sixth Floor, Berkeley, CA 94704-1198 (On Center between Milvia
and Martin Luther King Jr. Way)
____________
BROAD AREA COLLOQUIUM FOR
AI-GEOMETRY-GRAPHICS-ROBOTICS-VISION
on Wednesday, 5 April 2000, 4:15pm
TCseq201, Lecture Hall B
http://robotics.stanford.edu/ba-colloquium/
How Common Sense Might Work
Kenneth D. Forbus
Qualitative Reasoning Group
Northwestern University
This talk describes how a combination of analogical and
first-principles reasoning, relying heavily on qualitative
representations, might provide a computational model of common sense
reasoning. I discuss some of the psychological and computational
support for this approach, and illustrate how it can be used in
building new kinds of applications, including educational software.
About the Speaker:
Ken Forbus is a Professor of Computer Science and Education. Before
coming to Northwestern, Prof. Forbus was the head of the Artificial
Intelligence group at the Beckman Institute at the University of
Illinois at Urbana-Champaign. Prof. Forbus received his Ph.D. from MIT
in 1984 in Artificial Intelligence, received an NSF PYI award in 1987,
and was elected a AAAI Fellow in 1992. His interest in the
construction of intelligent tutoring systems and learning environments
stems in part from his experience working on the STEAMER Project at
Bolt, Beranek, and Newman in the 1980s.
____________
COMPUTER SYSTEMS LABORATORY COLLOQUIUM
on Wednesday, 5 April 2000, 4:15pm
Gates Computer Science Building: B03 (NEC Auditorium)
http://www.stanford.edu/class/ee380
Identity in a Networked World
Pierluigi Zappacosta and Vance Bjorn
Digital Persona Inc.
An increasing number of meaningful social interactions are taking
place through the intermediation of computers. The World Wide Web has
given this trend a global reach that makes it possible for individuals
in distant corners of the world to engage in spontaneous
interactions. One of the remaining obstacles to an even larger
adoption of web-enabled transactions is the lack of convenient digital
identities and of convenient ways to authenticate.
In this talk we discuss the issue of identity, as it transitions from
the real world to the digital world, and demonstrate two
biometrics-based authentication systems, recently announced by Digital
Persona, one designed for "inside-the-firewall" transactions and
the other for transactions over the web. We finally discuss some of
the underlying technical components of these systems and some of the
challenges encountered during their development.
About the speaker:
Pierluigi Zappacosta is Chairman of Digital Persona. Previously he was
a founder of Logitech, where he worked over a 16-year period in
various roles, including President and CEO. He holds an MS in Computer
Science from Stanford University and a Laurea in Electrical
Engineering from the Universita di Roma, Italy.
Vance Bjorn is Chief Technology Officer of Digital Persona. He
received his undergraduate and graduate degrees from the Electrical
Engineering department at Caltech where he specialized in computation
and neural systems (CNS). In starting DigitalPersona he went on leave
from his studies as a National Department of Defense graduate fellow
at the MIT AI Lab.
____________
STANFORD ALGORITHMS SEMINAR
on Thursday, 6 April 2000, 4:15pm
Gates Building 498
http://Theory.Stanford.EDU/~aflb/
Approximate Sequence Nearest Neighbors
S. Cenk Sahinalp
Case Western
We study sequence nearest neighbors problem. Let D be a database of n
sequences; we would like to preprocess D so that given any on-line
query sequence Q we can quickly find a sequence S in D for which
d(S,Q) < d(S,T) for any other sequence T in D. Here d(S,Q) denotes the
distance between sequences S and Q, and is defined to be the minimum
number of edit operations needed to transform one to another (all edit
operations will be reversible so that d(S,T) = d(T,S) for any two
sequences T and S). These operations correspond to the notion of
similarity between sequences in intended application. Such edit
operations include character edits (inserts, replacements, deletes
etc), block edits (moves, copies, deletes, reversals) and block
numerical transformations (scaling by an additive or a multiplicative
constant). We present the first known efficient algorithm for
``approximate'' nearest neighbor search for sequences with
preprocessing time and space polynomial in size of D and query time
near-linear in size of Q. We assume the distance d(S,T) between two
sequences S and T is the minimum number of character edits and block
operations needed to transform one to the other; the approximation
factor we achieve is O(log l log*^2 l), where l is the size of the
longest sequence in D.
Joint work with S. Muthukrishnan.
____________
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. 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://nntp.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
____________