[Date Prev][Date Next][Date Index]
CSLI Calendar, 19 January 2000, vol. 15:15
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
______________________________________________________________________
19 January 2000 Stanford Vol. 15, No.15
______________________________________________________________________
A weekly publication of the
Center for the Study of Language and Information (CSLI)
Stanford University, Ventura Hall, Stanford, CA 94305-4115
____________
ACTIVITIES FROM 19 JANUARY TO 29 JANUARY 2000
WEDNESDAY, 19 JANUARY
3:45pm Psychology Colloquium
Building 420:041
Theory of Mind and Word Learning:
Social, Cognitive and Neurobiological Perspectives
Mark Sabbagh
University of Michigan
http://matia.stanford.edu/html/talks.html#colloq
4:00pm Working Seminar in Homotropy Theory
Building 380:383N
Applications of Configuration Spaces in Engineering
Jim Milgram
Stanford
http://math.stanford.edu/html/seminars.html
4:00pm Geometric Analysis Seminar
Building 380:381T
Asymptotically Simple Spacetimes
Helmut Friedrich
Max Planck Institut, Germany
http://math.stanford.edu/html/seminars.html
4:15pm Broad Area Colloquium
TCseq201 (Lecture Hall B)
Learning Bayesian Networks
David Heckerman
Microsoft Research
http://robotics.stanford.edu/ba-colloquium/#Schedule
Abstract below
4:15pm EE380: Computer Systems Laboratory Colloquium
NEC Auditorium, Gates B03
Star Office Software
Phil Parkman
SUN Microsystems
http://www.stanford.edu/class/ee380/
Abstract below
4:15pm Statistics Seminar
Sequoia Hall 200
Minimax Deconvolution in MirrorWavelet Bases
Stephanie Mallat
Ecole Polytechnique, Paris
http://www-stat.stanford.edu/seminars/seminars.html
Abstract below
4:15pm Stanford Computer Forum
TCseq103
High Performance Computing and Trends:
Connecting Computational Requirements with
Computing Resources
Jack Dongarra
University of Tennessee and ORNL
http://www-forum.stanford.edu/
Abstract below
THURSDAY, 20 JANUARY
4:00pm Xerox PARC Forum
George Pake Auditorium at Xerox PARC
Airborne personalized travel using "Skycar Volantors"
Paul Moller
Moller International
http://www.parc.xerox.com/ops/projects/forum/
Abstract below
4:15pm Math Department Colloquium
Building 380:380W
TBA
Stephane Mallat
Ecole Polytechnique-Curant Institute
http://math.stanford.edu/html/seminars.html
4:15pm Stanford Algorithms Seminar
Gates 498
Testing and Spot-Checking of Data Streams
Martin Strauss
AT&T Research
http://Theory.Stanford.EDU/~aflb/1999-00.html
Abstract below
5:30pm The Stanford University Mathematical Organization
Lecture
Building 380:380C
Combinatorial Game Theory
Ted Hwa
http://math.stanford.edu/html/seminars.html
5:30pm Faculty Talks
Cantor Arts Center Auditorium
Making Mountains: Mini-Fujis, Cultic Salvation,
and the Simulacrum in Edo Japan
Melinda Takeuchi
Department of Art and Art History
Stanford University
http://www.stanford.edu/dept/ccva/program.html
FRIDAY, 21 JANUARY
12:30pm CS547: Human-Computer Interaction Seminar
Gates B01
Conversation Map: An Interface for Very
Large-Scale Conversations
Warren Sack
MIT Media Lab
http://hci.stanford.edu/cs547/
Abstract below
1:00pm Special University Oral Examination
Gates 104
Query and Data Mapping across Heterogeneous
Information Sources
Chen-Chuan Kevin Chang
Digital Libraries Project, Database Group
Stanford University
http://www-db.stanford.edu/~kevin
Abstract below
2:30pm Distinguished Visiting Lecture Series
Building 380:383N
Floer Homology for Monopoles
Tomasz Mrowka
MIT
http://math.stanford.edu/html/seminars.html
3:00pm Applied Math Seminar
Building 380:380C
Optimization of Renormalization Group Flow
Senben Liao
National Chung-Cheng University, R.O.C.
http://math.stanford.edu/html/seminars.html
3:15pm Philosophy Colloquium
Building 90:92Q
On Differing Modally
Karen Bennett
University of Michigan
http://www-philosophy.stanford.edu/
3:30pm Stanford Linguistics Colloquium
Building 460:126
Constituting Morality and Accountability in Girls'
Social Organization through Embodied Language
Practices
Marjorie Goodwin
University of California, Los Angeles
http://www-linguistics.stanford.edu/Linguistics/colloq/
Abstract below
MONDAY, 24 JANUARY
4:15pm Probability and Stochastic Processes Seminar
Sequoia Hall 200
Some Recent Results for Random Walks
in Random Environment
Alain-Sol Sznitman
http://www-stat.stanford.edu/~amir/prob-seminar/
Abstract below
TUESDAY, 25 JANUARY
3:15pm Stanford Learning Lab Presentation
Press Warehouse, Staff Training Room
Swiss Education System and the
Fachhochschul-Reform
Walter Schnueriger
Visiting Professor, Business Administration
Zurcher Hochschule Winterthur
http://sll.stanford.edu/index.shtml
Abstract below
WEDNESDAY, 26 JANUARY
12:00pm Award-Winning Teachers on Teaching
Hartley Conference Center, Mitchell Earth
Sciences Building
How to Give an Academic Job Talk
Michele Marincovich
Assistant Vice Provost and Director, CTL
http://www-ctl.stanford.edu/events.html
3:45pm Psychology Colloquium
Building 420:041
Learning to Learn Words: A Functional and
Developmental Account of the Object Bias
Jesse Snedeker
University of Pennsylvania
http://matia.stanford.edu/html/talks.html#colloq
4:15pm Broad Area Colloquium
TCseq201 (Lecture Hall B)
Simulation-Based Medical Planning for Cardiovascular
Disease
Charles A. Taylor
Stanford University
http://robotics.stanford.edu/ba-colloquium/#Schedule
Abstract below
4:15pm EE380: Computer Systems Laboratory Colloquium
NEC Auditorium, Gates B03
Internet TV
David Schwartz
Len Kain
ImaginOn
http://www.stanford.edu/class/ee380/
Abstract below
7:00pm The Art, Technology and Culture Colloquium
Kroeber Hall 160 (at UC Berkeley)
Print is Flat and Code is Deep:
Rethinking Signifiers in New Media
Katherine Hayles
UCLA
http://ieor.berkeley.edu/~goldberg/lecs/
THURSDAY, 27 JANUARY
11:00am The International Computer Science Institute
ICSI 607
A Generic Scheme for the Recording of
Interactive Media Streams
Volker Hilt
University of Mannheim
http://www.icsi.berkeley.edu/talks/
Abstract below
12:15pm Stanford Networking Seminar
Gates 104
Application Outsourcing: The Next Big Thing
on the Internet
Peter Newman
Ensim Corporation
http://netseminar.stanford.edu/
Abstract below
4:15pm Stanford Algorithms Seminar
Gates 498
Gomory-Hu Algorithms: an Experimental Study.
Andrew Goldberg
Intertrust STAR Labs
http://Theory.Stanford.EDU/~aflb/1999-00.html
Abstract below
FRIDAY, 28 JANUARY
12:30pm CS547: Human-Computer Interaction Seminar
Gates B01
Advanced Interface Design for Ease of Use
Tony Temple
IBM
http://hci.stanford.edu/cs547/
3:15pm Friday Cognitive Seminar
Building 420:100
Mental Animation
Mary Hegarty
http://matia.stanford.edu/html/talks.html#frisem
3:15pm Philosophy Department Colloquium
Building 90:92Q
TBA
Dirk van Dalen
University of Utrecht
http://www-philosophy.stanford.edu/ce.html
____________
BROAD AREA COLLOQUIUM
on Wednesday, 19 January 2000, 4:15pm to 5:15pm
TCseq201 (Lecture Hall B)
http://robotics.stanford.edu/ba-colloquium/#Schedule
Learning Bayesian Networks
David Heckerman
Microsoft Research
For two decades, Bayesian networks--also known as directed acyclic
graphical models, belief networks, and causal networks--have been used
in intelligent systems with a fair amount of success. With few
exceptions, system builders have constructed Bayesian networks by
directly encoding the knowledge of experts. Data sets have rarely been
used in the construction process. One drawback of this knowledge-based
approach is that knowledge elicitation can be expensive. More
recently, however, researchers have developed techniques for
constructing Bayesian networks (both parameters and structure) from a
combination of expert knowledge and data. These methods can
significantly reduce the cost of building an intelligent system in
domains where data is readily available. In addition, these techniques
can be used to identify causal relationships from non-experimental
data--an important breakthrough for science. I my talk, I will
describe several applications of this work being addressed at
Microsoft and briefly review the technology.
About the Speaker:
David Heckerman is a Senior Researcher at Microsoft Research and
manager of the Machine Learning and Applied Statistics Group. He is a
co-creator of Answer Wizard for Office 95, Office Assistant for Office
97, troubleshooters for online support and Windows 98, and Intelligent
Cross Sell for Commerce Server. Heckerman received his Ph.D. and
M.D. degrees from Stanford University.
____________
EE380: COMPUTER SYSTEMS LABORATORY COLLOQUIUM
on Wednesday, 19 January 2000, 4:15pm
NEC Auditorium, Gates B03
Star Office Software
http://www.stanford.edu/class/ee380/
Phil Parkman
Director of Operations, Webtop and Applications
Software
SUN Microsystems
StarOffice from Sun Microsystems, Inc. is a powerful and easy-to-use
office productivity suite, available on Linux, Windows, Solaris and
OS/2. StarOffice's complete set of tools includes word processing,
spreadsheet, presentations, graphics, database, mail, scheduling and
more, all delivered to the user in an integrated desktop environment.
With StarOffice, Sun extends the .com business model to include
productivity applications backed by Sun's comprehensive support
services and training. It is available as a free download to users,
service providers and educational institutions.
Now, users no longer have to pay application licensing fees in order
to gain access to a rich suite of productivity applications.
StarOffice software is a major component of Sun's vision of "anyone,
anytime, anywhere on any device" enterprise network computing. And
users, tempted by feature rich applications including the forthcoming
StarOffice Portal software, are finding new freedom. The ultimate dot
com application, StarPortal[tm] software is poised to change the way
people compute, delivering office productivity applications in a
web-based model.
Sun is changing the rules on we how we work, taking office software
into the dot-com age.
About the speaker:
For more than two decades, Phil Parkman has exercised his technical
expertise in the computer industry through a variety of field and
marketing positions. Now, as director of operations for the Webtop and
Applications Software group at Sun Microsystems, Parkman is taking his
expertise one step further by assisting Sun in its efforts to dot com
the enterprise. In his current position, Parkman is responsible for
the day-to-day operations of StarOffice, Sun's premium office
productivity suite.
Prior to working on StarOffice, Parkman used his technical expertise
to successfully lead Sun's technical team through its most recognized
product and technology launches, including the launch of Java, the
JavaStation, Netra j, and the Ultra 1, 5 and 10 workstations. In
addition, Parkman managed Sun's participation in the 1994 World Cup.
Before joining Sun Microsystems, Parkman worked for some of the
earliest workstation companies including Massachusetts Computer Co.
Parkman is a graduate of the University of California, Davis in
Systems Analysis.
____________
STATISTICS SEMINAR
on Wednesday, 19 January 2000, 4:15pm
Sequoia Hall 200
http://www-stat.stanford.edu/seminars/seminars.html
Minimax Deconvolution in MirrorWavelet Bases
Stephanie Mallat
Ecole Polytechnique, Paris
Thresholding algorithms in an orthonormal basis are studied to
estimate signals degraded by a linear operator whose inverse is not
bounded. Deconvolutions with transfer functions having a zero at high
frequencies are examples of such unstable inverse problems. A ``mirror
wavelet'' basis is constructed to obtain a deconvolution risk
asymptotically equivalent to the minimax risk for bounded variation
signals. This mirror wavelet thresholding estimator is currently used
by the French spatial agency to restore satellite images.
____________
STANFORD COMPUTER FORUM
on Wednesday, 19 January 2000, 4:15pm
TCseq103
http://www-forum.stanford.edu/
High Performance Computing and Trends:
Connecting Computational Requirements with
Computing Resources
Jack Dongarra
University of Tennessee and ORNL
This talk will provide an overview of high performance computing and
presents a system, called NetSolve, that allows users to access
computational resources, such as hardware and software, distributed
across the network. This project has been motivated by the need for
an easy-to-use, efficient mechanism for using computational resources
remotely. Ease of use is obtained as a result of different
interfaces, some of which do not require any programming effort from
the user. Good performance is ensured by a load-balancing policy that
enables NetSolve to use the computational resource available as
efficiently as possible. NetSolve offers the ability to look for
computational resources on a network, choose the best one available,
solve a problem (with retry for fault-tolerance) and return the answer
to the user.This talk will provide an overview of high performance
computing and presents a system, called NetSolve, that allows users to
access computational resources, such as hardware and software,
distributed across the network. This project has been motivated by
the need for an easy-to-use, efficient mechanism for using
computational resources remotely. Ease of use is obtained as a result
of different interfaces, some of which do not require any programming
effort from the user. Good performance is ensured by a load-balancing
policy that enables NetSolve to use the computational resource
available as efficiently as possible. NetSolve offers the ability to
look for computational resources on a network, choose the best one
available, solve a problem (with retry for fault-tolerance) and return
the answer to the user. Good performance is ensured by a
load-balancing policy that enables NetSolve to use the computational
resource available as efficiently as possible. NetSolve offers the
ability to look for computational resources on a network, choose the
best one available, solve a problem (with retry for fault-tolerance)
and return the answer to the user. In addition the ATLAS
(Automatically Tuned Linear Algebra Software) project will be
reviewed.
____________
XEROX PARC FORUM
on Wednesday, 20 January 2000, 4:00pm
George Pake Auditorium at Xerox PARC
http://www.parc.xerox.com/ops/projects/forum/
Airborne personalized travel using "Skycar Volantors"
Paul Moller
Moller International
The world's airspace is the greatest under-used natural resource at
our disposal to address transportation needs. The Skycar Volantor
offers a 3-D solution to 2-D urban traffic congestion. Moller
International is building a wingless, ducted-fan skycar powered by
efficient, low-emission rotary engines that is cheaper, faster, and
cleaner than a Ferrari. Unlike the automobile revolution of this
century, the airways of the future will not be made of tar and gravel,
but from ones and zeros flowing through global positioning systems,
wireless networks, and skycar autopilots to enable pushbutton air
transportation.
This Forum is OPEN to the public.
Refreshments will be served from 3:45 to 4:00.
The George Pake Auditorium is located at Xerox PARC, 3333 Coyote Hill
Road in Palo Alto, off of Page Mill Road.
____________
STANFORD ALGORITHMS SEMINAR
on Thursday, 20 January 2000, 4:15pm
Gates 498
http://Theory.Stanford.EDU/~aflb/1999-00.html
Testing and Spot-Checking of Data Streams
Martin Strauss
AT&T Research
We consider the tasks of *testing* and *spot-checking* for *data
streams*. These testers and spot-checkers are potentially useful in
real-time or near real-time applications that process huge
datasets. Crucial aspects of the computational model include the space
complexity of the testers and spot-checkers (ideally much lower than
the size of the input stream) and the number of passes that the tester
or spot-checker must make over the input stream (ideally one, because
the original stream may be too large to store for a second pass). A
sampling-tester [Goldreich-Goldwasser-Ron] for a property P samples
some (but usually not all) of its input and, with high probability,
outputs PASS if the input has property P and FAIL if the input is
*far* from having P, for an appropriate sense of "far." A
streaming-tester for a property P of one or more input streams takes
as input one or more data streams and, with high probability, outputs
PASS if the streams have property P and FAIL if the streams are far
from having P. A sampling-tester can make its samples in any order; a
streaming-tester sees the input from left to right. We consider the
*groupedness property* (a natural relaxation of the sortedness
property). We also revisit the sortedness property, first considered
in [Ergun-Kannan-Kumar-Rubinfeld-Viswanathan] in the context of
sampling spot-checkers, and the property of detecting whether one
stream is a permutation of another (either directly or via the
SORTED-SUPERSET property, a technical property that is equivalent to
PERMUTATION under some conditions). We show that there are properties
efficiently testable by a streaming-tester but not by a
sampling-tester and other (promise) problems for which the reverse is
true.
This talk presents joint work with Joan Feigenbaum, Sampath Kannan,
and Mahesh Viswanathan. It will appear at the SODA'00 conference. A
full paper is available.
____________
CS547: HUMAN-COMPUTER INTERACTION SEMINAR
on Friday, 21 January 2000, 12:30pm to 2:00pm
Gates B01
http://hci.stanford.edu/cs547/
Conversation Map: An Interface for Very
Large-Scale Conversations
Warren Sack
MIT Media Lab
Conversation Map is a newsgroup browser that is designed to make it
easier for participants to understand and reflect on very large-scale
conversations like large, electronic-mail lists or busy, Usenet
newsgroups.
In principle the Conversation Map system can be used just like a usual
electronic news or mail program (e.g., Eudora, RN, or Netscape
Messenger). The main difference is that the Conversation Map system
analyzes the content and the relationships between messages and then
uses the results of the analysis to create a graphical interface. With
the graphical interface, a participant can see the social and semantic
relationships that have emerged over the course of the discussion. The
Conversation Map system computes and then graphs out who is "talking"
to whom, what they are "talking" about, and the central terms and
possible metaphors of the conversation.
Warren Sack is a Ph.D. student and research assistant at the MIT Media
Laboratory in the Machine Understanding Group and a collaborator at
the MIT Center for Advanced Visual Studies in the Interrogative Design
Group.
____________
SPECIAL UNIVERSITY ORAL EXAMINATION
on Friday, 21 January 2000, 1:00pm
Gates 104
http://www-db.stanford.edu/~kevin
Query and Data Mapping across Heterogeneous
Information Sources
Chen-Chuan Kevin Chang
Digital Libraries Project, Database Group
Stanford University
The Internet has brought together information sources worldwide.
Integrating such heterogeneous and autonomous sources is challenging
because of their non-uniform query languages and data representations.
To help users uniformly query over different sources and access
desired data, we have developed an integration system for optimally
mapping queries and data across disparate contexts. Such translation
technique is essential for many important applications that require
querying sources and analyzing data on the web, such as
meta-searching, e-commerce (comparison shopping), and web mining.
This talk will start with an overview of the integration system, which
consists of query translation, post-filtering, and data translation.
I will then focus on the query translator, the core of our framework.
In particular, I will present how we define a customizable metric of
closeness that combines both precision and recall, and how our general
algorithms handle inter-constraint dependencies correctly to guarantee
optimal mappings under virtually any closeness criteria. I will then
discuss how to adopt this query mapping machinery for data translation
by developing the modeling of data as conjunctive queries. Finally, I
will report our system prototype and some of the experimental results
for the post-filtering cost associated with query translation.
For more information, please refer to:
http://www-db.stanford.edu/~kevin/thesis.html
____________
STANFORD LINGUISTICS COLLOQUIUM
on Friday, 21 January 2000, 3:30pm
Building 460:126
http://www-linguistics.stanford.edu/Linguistics/colloq/
Constituting Morality and Accountability in Girls'
Social Organization through Embodied Language Practices
Marjorie Goodwin
University of California, Los Angeles
It has been consistently argued that gender differences exist in moral
development, with boys displaying a greater grasp of complex rules,
while girls reputedly live in simpler social worlds marked by
harmony. Piaget's work on children's games posited a less developed
legal sense in girls than in boys and continued with Gilligan's
portrayal of females speaking in "a different voice." My presentation
challenges the notion that girls have little concern with issues of
justice by examining the embodied multi-modal forms of argumentation
which occur in the midst of girls' games such as hop scotch, four
square, and jump rope. Turn shape, intonation, body positioning and
accounts are all critical to the construction of stance. Players can
make use of heightened pitch, vowel lengthening, and raised volume to
vocally highlight opposition in the preface of opposition turns. Girls
evaluate the conduct of their fellow players and form judgments of
their character based on the way they handle themselves in game
disputes. A second part of the talk examines how girls practice forms
of exclusion, constructing a "tagalong" girl as deviant, in the midst
of activities such as games , ritual insult sequences, and telling
stories. While traditional studies of morality have studied what
people can propositionalize, I argue that by examining the practices
that make up the life world of a particular group we can investigate
how morality is lodged within the actions and stances that girls take
up in interaction with their peers. This study is based on fieldwork
conducted among a number of different groups of comparable ages,
including a peer group of fifth grade working class second generation
Spanish/English speakers and Asian-American girls in a downtown Los
Angeles school, a clique of girls of diversity ethnicities and social
classes in a middle class neighborhood of Los Angeles followed over
three years (fourth to sixth grade), and Black working class fifth
grade girls from Philadelphia and the rural South.
____________
PROBABILITY AND STOCHASTIC PROCESSES SEMINAR
on Monday, 24 January 2000, 4:15pm
Sequoia Hall 200
http://www-stat.stanford.edu/~amir/prob-seminar/
Some Recent Results for Random Walks
in Random Environment
Alain-Sol Sznitman
Random walks in random environment are a basic model of random motions
in a random medium. They have been extensively studied in the
one-dimensional case, but there are so far few results in higher
dimension. In this talk we shall describe some of the progresses
which have occurred over the last couple of years in the study
multi-dimensional random walks in a random environment with a
ballistic nature.
____________
STANFORD LEARNING LAB PRESENTATION
on Tuesday, 25 January 2000, 3:15pm to 4:30pm
Press Warehouse, Staff Training Room
http://sll.stanford.edu/index.shtml
Swiss Education System and the
Fachhochschul-Reform
Walter Schnueriger
Visiting Professor, Business Administration
Zurcher Hochschule Winterthur
The Swiss educational system has its roots in the needs of the
traditional "Industrial Society". The universities - especially the
schools of science and engineering - were mostly founded in the
nineteenth century following German examples. With its focus on
professional apprenticeship, it has for more than a century
successfully answered the need for well educated and skillfully
trained craftsmen and specialists. Today, 80 percent of Swiss students
still pursue professional training after nine years of primary and
secondary school, and only 20 percent enter a university directly from
secondary school.
But interests and needs have changed. The need for graduates with an
excellent theoretical background, methodical knowledge and
communication aptitude is growing, as the demand for traditional
craftmanship declines. Like Germany earlier, Switzerland has chosen to
develop a new type of university, especially designed for the needs of
young and gifted professionals, the Universities of Applied Sciences
("Fachhochschulen"). By combining and upgrading polytechnic schools,
seven such universities have been founded.The Zurich University of
Applied Sciences in Winterthur is the largest and by far most
developed and integrated of this kind. Schnueriger will show how,
building upon its capabilities in teaching and research, Winterhur is
developing a fruitful collaboration with surrounding businesses and
society.
Walter Schnueriger is Professor of Business and Management at the
Zurich University of Applied Sciences at Winterhur (ZHW). His teaching
tasks and scientific interests are in Operations Management and
Project Management. He has headed the Department of Business and
Management during the last 10 years and led this school in the merger
that formed the new Fachhochschule. Walter Schnueriger has an M.S. in
Chemistry of ETH Zurich and a M. in Economics and Management of the
University Zurich. He worked for 15 years in different industrial
management and consulting jobs, among them as a vice president in a
pulp and paper company.
____________
BROAD AREA COLLOQUIUM
on Wednesday, 26 January 2000, 4:15pm to 5:15pm
TCseq201 (Lecture Hall B)
Simulation-Based Medical Planning for Cardiovascular
Disease
http://robotics.stanford.edu/ba-colloquium/#Schedule
Charles A. Taylor
Assistant Professor of Research
Department of Surgery
Department of Mechanical Engineering
School of Engineering (by courtesy)
Stanford University
The current paradigm for surgery planning for the treatment of
cardiovascular disease relies exclusively on diagnostic imaging data
to define the present state of the patient, empirical data to evaluate
the efficacy of prior treatments for similar patients, and the
judgement of the surgeon to decide on a preferred treatment. The
individual variability and inherent complexity of human biological
systems is such that diagnostic imaging and empirical data alone are
insufficient to predict the outcome of a given treatment for an
individual patient. We have proposed a new paradigm of predictive
medicine in which the physician utilizes computational tools to
construct and evaluate a combined anatomic/physiologic model to
predict the outcome of alternative treatment plans for an individual
patient. We are implementing the predictive medicine paradigm in
software systems developed for Simulation-Based Medical Planning.
These systems provide an integrated set of tools to test hypotheses
regarding the effect of alternate treatment plans on blood flow in the
cardiovascular system of an individual patient. They combine
internet-based user interfaces developed using Java and VRML, image
segmentation, geometric solid modeling, automatic finite element mesh
generation, computational fluid dynamics and scientific visualization
techniques. Progress in developing and validating these methods will
be presented in addition to broader issues related to applying
computer simulation methods in biomedical engineering and sciences.
About the Speaker:
Professor Taylor received his B.S. degree in Mechanical Engineering in
1987 from Rensselaer Polytechnic Institute. He then joined the
Engineering Physics Laboratory at GE Research & Development Center in
Schenectady, New York where he worked on projects ranging from polymer
process modeling to aircraft engine design. He received his
M.S. degree in Mechanical Engineering in 1991 and his M.S. Degree in
Mathematics in 1992 from Rensselaer Polytechnic Institute. He entered
the Ph.D. program in the Division of Applied Mechanics at Stanford in
1992 and earned his Ph.D. degree in 1996 for his work on finite
element modeling of blood flow. He was co-advised by Professor Tom
Hughes and Professor Chris Zarins, Chief of Vascular Surgery at
Stanford. Dr. Taylor joined the faculty in 1997 as an Assistant
Professor (Research) in the Department of Surgery and holds a courtesy
appointment in the Department of Mechanical Engineering. He founded
and currently directs the Stanford Cardiovascular Biomechanics
Laboratory and is particularly interested in the application of
computational and advanced imaging methods to the study of the
cardiovascular system. He is internationally recognized for the
development of simulation-based surgery planning methods.
____________
EE380: COMPUTER SYSTEMS LABORATORY COLLOQUIUM
on Wednesday, 26 January 2000, 4:15pm
NEC Auditorium, Gates B03
http://www.stanford.edu/class/ee380/
Internet TV
David Schwartz
Len Kain
ImaginOn
A single home system that fully merges television programming, home
theater, games, telephony, productivity software and the Internet is
on the horizon. Most of the bits and pieces needed on the hardware
side are done. Better high bandwidth connectivity is being installed
at a rapid rate, and the software needed to glue it all together is
nearly here.
ImaginOn's Internet Television "Station in a Box", ImOm.comTV,
demonstrates Internet Television with capabilities beyond those of
HDTV or set top television boxes today. Internet television must offer
substantial benefits over ordinary Television to gain acceptance. There
are economic, technical, and regulatory issues that must be resolved
to bring the benefits of Internet Television to the general
public. The talk today will discuss the challenges and how we are
meeting them at ImaginOn.
About the speakers:
David M. Schwartz and Len Kain are the founders of ImaginOn,
Inc. David Schwartz serves as the CEO and Chairman of the
company. Prior to ImaginOn, David was Vice President of New Media
Systems & Technology at Atari Corporation, where he headed the Jaguar
CD development group. Before going to Atari, David directed the
software team at Tandy Research that developed the first erasable CD
recorder/player. In 1983, Schwartz started Compusonics Corporation,
which went public in 1984. David received a Bachelor of Arts in
Architecture from Carnegie Mellon University, has been granted twelve
US Patents for his inventions and published numerous technical papers.
Len Kain serves as ImaginOn's Vice President of Engineering. Prior to
ImaginOn, Len has spent 14 years in various engineering and management
positions in the computer field at Compression Labs, Telebit,
Compusonics and Lockheed. Len holds a Bachelors Degree in Engineering
from Stevens Institute of Technology in New Jersey, a Master's Degree
in Electrical Engineering from Stanford University, and an MBA from
the University of Phoenix.
_____________
THE INTERNATIONAL COMPUTER SCIENCE INSTITUTE
on Thursday, 27 January 2000, 11:00am to 12:30pm
ICSI 607
http://www.icsi.berkeley.edu/talks/
A Generic Scheme for the Recording of Interactive Media Streams
Volker Hilt
University of Mannheim
Interactive media streams with real-time characteristics, such as
those produced by shared whiteboards, distributed Java applets or
shared VRML viewers, are rapidly gaining importance. Current solutions
to the recording of interactive media streams are limited to one
specific application (e.g. one specific shared whiteboard). In this
talk I will present our generic recording service which enables the
recording and playback of this new class of media. To facilitate
generic recording we have defined the Application Level Real-Time
Protocol for Interactive Media (RTP/I) which covers common aspects of
the interactive media class in analogy to the RTP protocol for audio
and video. Based on the RTP/I protocol we have introduced a
generalized recording service that enables the recording and playback
of arbitrary interactive media
A paper regarding the topic of this talk is available at
http://www.informatik.uni-mannheim.de/~hilt/publications/IntMediaRecPaper.ps.gz
____________
STANFORD NETWORKING SEMINAR
on Thursday, 27 January 2000, 12:15pm to 1:45pm
Gates 104
http://netseminar.stanford.edu/
Application Outsourcing: The Next Big Thing
on the Internet
Peter Newman
Ensim Corporation
The current model for application distribution is deeply
flawed. Customers are forced to keep track of the latest version of
each software package, to size their desktop machines to have
sufficient power to deal with anticipated application load, and to
painfully recover from hardware failures. These problems disappear
overnight when applications are outsourced to Application Service
Providers (ASPs). Potentially, the shift of applications from
desktops to ASPs is as powerful and disruptive as the introduction of
the World Wide Web. However, ASPs too face severe scaling problems in
providing outsourced services to tens of thousands of customers. In
this talk, we will outline these problems and describe a novel
approach to solving them.
About the speaker:
Peter Newman is the Chief Scientific Officer at Ensim, a Silicon
Valley startup enabling the automated deployment of managed
services. He was one of the early members of Ipsilon Networks,
inventors of IP Switching. Earlier noble failures include designing
the first ATM switch to fail commercially and ATM congestion control
in the Traffic Management Group of the ATM Forum. In a former life he
was a research fellow at the Computer Laboratory of the University of
Cambridge where in 1989 he received a PhD for research in fast packet
switch design.
____________
STANFORD ALGORITHMS SEMINAR
on Thursday, 27 January 2000, 4:15pm
Gates 498
http://Theory.Stanford.EDU/~aflb/1999-00.html
Gomory-Hu Algorithms: an Experimental Study.
Andrew Goldberg
Intertrust STAR Labs
Gomory-Hu trees, which represent all pair-wise cuts in an undirected
graph, have important applications, in particular in reliability
theory. In theory, the best algorithms for the problem require n-1
minimum s-t cut computations, where n is the number of vertices in the
graph. We conduct an experimental study of two algorithms for the
problem, one due to Gomory and Hu and another one due to Gusfield. We
show that although obtaining an efficient implementation of the former
algorithm is not easy, such an implementation is more robust than a
good implementation of Gusfield's algorithm. We also introduce
heuristics which in further improve robustness of the Gomory-Hu
algorithm.
This is joint work with Kostas Tsioutsiouliklis (Princeton University)
____________
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/csli/Archive/calendar/current.html
and the archives at
http://www-csli.stanford.edu/csli/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.
____________