[Date Prev][Date Next][Date Index]
CSLI Calendar, 5 January 2000, vol. 15:13
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
______________________________________________________________________
5 January 2000 Stanford Vol. 15, No.13
______________________________________________________________________
A weekly publication of the
Center for the Study of Language and Information (CSLI)
Stanford University, Ventura Hall, Stanford, CA 94305-4115
____________
ACTIVITIES FROM 5 JANUARY TO 15 JANUARY 2000
WEDNESDAY, 5 JANUARY
3:45pm Stanford Psychology Colloquium
Building 420:041
How To Talk About Semantics and Mean It
Michael Ramscar
University of Edinburgh
http://matia.stanford.edu/html/talks.html#colloq
4:15pm EE380: Computer Systems Laboratory Colloquium
NEC Auditorium, Gates B03
Internet Voting in Public Elections
David Jefferson
Compaq Systems
http://www.stanford.edu/class/ee380/
Abstract below
THURSDAY, 6 JANUARY
4:00pm Xerox PARC Forum
George Pake Auditorium at Xerox PARC
Imaging Information in DNA with Optical
Tweezers and Femtofluidic Devices
Stephen Quake
Department of Applied Physics, Caltech
http://www.parc.xerox.com/forum
Abstract below
4:15pm Stanford Algorithms Seminar
Gates 498
The Effects of Connection Duration on
Network Performance
Matthew Andrews
Bell Labs
http://Theory.Stanford.EDU/~aflb/
Abstract below
4:15pm Stanford Math Department Colloquium
Building 380:380W
Random Surfaces Interacting with a Wall
Erwin Bolthausen
University of Zurich
http://math.stanford.edu/html/seminars.html
Abstract below
FRIDAY, 7 JANUARY
12:30pm CS547: Stanford Seminar on People, Computers,
and Design
Gates B01
People Centric Processing or
Better CHI with Signal Computation
Malcolm Slaney
Interval Research
http://pcd.stanford.edu/seminar
Abstract below
3:00pm Applied Math Seminar
Building 380:380C
Mathematical Analysis of Geophysical Balance Models
Don Jones
Arizona State University
http://math.stanford.edu/html/seminars.html
4:15pm Stanford Algorithms Seminar
Gates 498
A PTAS for the Multiple Knapsack Problem
Chandra Chekuri
Bell Labs
http://Theory.Stanford.EDU/~aflb/1999-00.html#1999-00.4
Abstract below
MONDAY, 10 JANUARY
4:15pm Probability & Stochastic Processes Seminar
Sequoia Hall 200
A Multiclass Queue in Heavy Traffic with Throughput Time
Constraints: Asymptotically Optimal Dynamic Controls
Erica Lee Plambeck
Stanford University
http://www-stat.stanford.edu/~amir/prob-seminar/
Abstract below
TUESDAY, 11 JANUARY
4:15pm Statistics Seminar
Sequoia Hall 200
Apportionment of Seat in Proportional Representation
Systems: A Majorization Comparison of Divisor Methods
Ingram Olkin
Stanford University
http://www-stat.stanford.edu/seminars/seminars.html
Abstract below
WEDNESDAY, 12 JANUARY
2:00pm CSLI Lecture
Cordura 100
Robust Semantics for Dialogue Using
Flat Structures
David Milward
SRI International, Cambridge
Abstract below
4:15pm CS528: Broad Area Colloquium
TCseq201 (Lecture Hall B)
Trends in Computer Vision for NASA and
DoD Mobile Robot Programs
Larry Matthies
JPL
http://robotics.stanford.edu/ba-colloquium/
Abstract below
4:15pm EE380: Computer Systems Laboratory Colloquium
NEC Auditorium, Gates B03
VMware's Virtual Platform Technology
Mendel Rosenblum
VMware Inc.
http://www.stanford.edu/class/ee380/
Abstract below
THURSDAY, 13 JANUARY
12:45pm Stanford Networking Seminar
Gates 104
Networking Non-PC Devices
Using BlueSky and Bluetooth
Pravin Bhagwat
Mobile Networking Group
IBM, Thomas J. Watson Research Center
http://netseminar.stanford.edu/sessions/2000-01-13.html
Abstract below
4:00pm Xerox PARC Forum
George Pake Auditorium at Xerox PARC
Astrobionics: Tools and Technologies for Space Life
Sciences and Astrobiology Applications
John W. Hines
Fundamental Biology Research Program,
NASA-Ames Research Center
http://www.parc.xerox.com/ops/projects/forum/
4:15pm Stanford Algorithms Seminar
Gates 498
Approximation Algorithms for the Vertex Cover
Problem in Graphs and Hypergraphs
Eran Halperin
Tel Aviv University
http://Theory.Stanford.EDU/~aflb/1999-00.html#1999-00.4
Abstract below
FRIDAY, 14 JANUARY
12:30pm CS547: Human-Computer Interaction Seminar
Gates B01
The Importance of Homes in Technology Research
Debby Hindus
Interval Research
http://hci.stanford.edu/cs547/
Abstract below
____________
EE380: COMPUTER SYSTEMS LABORATORY COLLOQUIUM
on Wednesday, 5 January 2000, 4:15pm
NEC Auditorium, Gates B03
http://www.stanford.edu/class/ee380/
Internet Voting in Public Elections
David Jefferson
Compaq Systems
In recent months public interest has been growing in systems for
online voting, online voter registration, and online petition
signing. The Secretary of State of California recently appointed a
task force to study the issues, and a report will be published in the
second week in January, 2000, available via the Secretary of State's
page[1]. This talk will summarize the technical issues addressed in
that report.
Security, privacy, failure tolerance, and availability are the primary
technical issues that must be addressed in any Internet voting system,
and this talk will touch upon them all.
One major conclusion is that remote Internet voter registration
systems are not recommended . Until such time as there are strong
online human identification mechanisms widely available, along with
ways to verify citizenship, age, and residency, any system for online
voter registration is vulnerable to malicious, automated creation of
an arbitrary number of phony voters.
Another conclusion is that Internet voting systems (as opposed to
voter registration) must be divided into two fundamental classes:
(a) those in which the election officials control the voting
infrastructure on the client side, including the client machines,
their software, and the LANs they are connected to, and
(b) those in which the voter or a 3rd party controls the client
environment, e.g. voting from PCs at home, office, university,
hotel, etc.
Systems of type (a) are technically managable today, and may appear in
California as soon as November, 2000, at least on a trial basis. On
the other hand, systems of type (b) are vulnerable to Trojan horse
attacks for which there are today no good technical solutions that are
both effective and convenient enough for voters. Such systems should
not be fielded until there is progress on the fundamental problem of
managing malicious code.
About the speaker:
David Jefferson is a Senior Member of the Research Staff at Compaq's
Systems Research Center in Palo Alto. He is also the chair of the
Technical Committee of the California Secretary of State's Task Force
on Internet Voting, and a member of the Board of Directors of the
California Voter Foundation (www.calvoter.org). He has been very
active in issues at the intersection of elections and the Internet for
over five years with DEC and Compaq. Before that he worked in the
fields of parallel discrete event simulation, parallel operating
systems, synchronization, artificial life, and robotics on the
faculties of computer science at USC and UCLA. He holds a B.S. in
mathematics from Yale University and a Ph.D. in computer science from
Carnegie-Mellon University.
Contact information:
David Jefferson
Compaq Systems Research Center (SRC)
131 Lytton Ave.
Palo Alto, CA 94301
650-853-2140
jefferson@pa.dec.com
____________
XEROX PARC FORUM
on Thursday, 6 January 2000, 4:00pm to 5:00pm
George Pake Auditorium at Xerox PARC
http://www.parc.xerox.com/forum
Imaging Information in DNA with Optical
Tweezers and Femtofluidic Devices
Stephen Quake
Department of Applied Physics, Caltech
Single molecule techniques, especially those using light, have become
powerful tools to study the physical and informatic properties of DNA.
It is now relatively straightforward to use fluorescence optical
techniques to image single molecules, and to use radiation pressure
("optical tweezers") to trap and manipulate molecules. In my group we
have been using DNA as a model polymer system to investigate questions
in polymer dynamics using imaging and force spectroscopy experiments.
We have also developed single molecule chip-based analytic techniques
as a fast and sensitive replacement for PCR and gel electrophoresis in
order to assay the sequence information in DNA. In the course of this
project we have developed novel valve and pump components for on-chip
fluidic manipulation.
Biography: Stephen Quake is an Associate Professor of Applied Physics
at the California Institute of Technology. He studied physics (BS
1991) and mathematics (MS 1991) at Stanford University before earning
his doctorate in physics from Oxford University (1994) as a Marshall
scholar. Prior to joining Caltech in 1996, he spent two years as a
post-doc in Steven Chu's group at Stanford University. His general
interests include functional genomics, biophysics and polymer physics.
Recently he has been developing methods of single molecule detection
and manipulation, and combining these techniques with microfluidic
devices for ultra-sensitive biotechnology and biodetection. He was
named a Packard Fellow in 1999.
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.
From Page Mill Road, turn South on Foothill Expressway, then right on
Hillview, and take the second entrance to the right. Park in the large
parking lot and enter the auditorium at the upper level of the
building. The auditorium is located to the left of and down the
stairs from the main entrance.
There is a map to PARC at:
http://www.parc.xerox.com/images/maptoparc.gif.
____________
STANFORD ALGORITHMS SEMINAR
on Thursday, 6 January 2000, 4:15 pm
Gates 498
http://Theory.Stanford.EDU/~aflb/
The Effects of Connection Duration on
Network Performance
Matthew Andrews
Bell Labs
In this talk we examine the dependence of network performance on the
duration of the connections. If the connections have a short duration
then the paths can change rapidly, thereby making it more difficult to
achieve good performance. We begin by showing that the FIFO scheduling
discipline can create network instability even if the connections are
fixed (and hence have infinite duration). This extends an earlier
result which states that FIFO can be unstable if the connection
durations are short. We then consider the Generalized Processor
Sharing (GPS) discipline and show that it can be unstable if the
connection durations are short. This is in contrast to the fixed
connection case where GPS is known to be stable and have good delay
properties. For the case of short durations, the best known delay
bounds are exponential in the maximum path length of a connection. We
show that in fact, the standard method for deriving delay bounds can
only give exponential bounds in this case. We also show that a large
class of scheduling disciplines can produce exponential delays.
This work is joint with Lisa Zhang and will be presented at SODA '00.
____________
STANFORD MATH DEPARTMENT COLLOQUIUM
on Thursday, 6 January 2000, 4:15pm
Building 380:380W
http://math.stanford.edu/html/seminars.html
Random Surfaces Interacting with a Wall
Erwin Bolthausen
University of Zurich
We consider so-called gradient models of random surfaces which are
also interacting with a "hard wall" via local repulsion or (and)
attraction. The gradient models are random fields with long range
correlations. These long range dependencies are to a large extent
responsible for the special effects observed in these models. We
discuss in particular the so called entropic repulsion and the wetting
transition.
____________
CS547: STANFORD SEMINAR ON PEOPLE, COMPUTERS,
AND DESIGN
on Friday, 7 January 2000, 12:30pm to 2:00pm
Gates B01
http://pcd.stanford.edu/seminar
People Centric Processing or
Better CHI with Signal Computation
Malcolm Slaney
Interval Research
One of the most difficult problems in computer science is recognizing
and synthesizing the full range of human behavior. It is important to
allow humans to deal with computers on human terms. I will describe
several techniques that my colleagues and I have developed that use
signal computation to improve human-computer interaction. I will talk
about algorithms that sense human behavior (BabyEars), entertain our
senses (audio morphing and Magic Mirror), synthesize realistic humans
(Video Rewrite) and improve human perception (Mach1 and auditory scene
analysis). We call this style of computation people-centric
processing.
Malcolm Slaney is a signal processor at Interval Research, where he
looks for new ways to use lots of CPU cycles. He received his PhD in
Electrical Engineering from Purdue University for his work on
diffraction tomography algorithms. Since then he has worked on
modeling the auditory system, automatic speech recognition,
architectures for image processing, computational environments for
signal processing, and lots of wonderful ways to create, modify,
characterize, abuse and display audio and video signals. He also
organizes the Stanford CCRMA Hearing Seminar.
____________
STANFORD ALGORITHMS SEMINAR
on Friday, 7 January 2000, 4:15pm
Gates 498
http://Theory.Stanford.EDU/~aflb/1999-00.html#1999-00.4
A PTAS for the Multiple Knapsack Problem
Chandra Chekuri
Bell Labs
The Multiple Knapsack problem (MKP) is a natural and well known
generalization of the single knapsack problem and is defined as
follows. We are given a set of items and bins (knapsacks) such that
each item has a profit and a size associated with it, and each bin has
its own capacity constraint. The goal is to pack items into the bins
so as to maximize the profit of packed items. MKP is a special case of
the Generalized Assignment problem (GAP) where the profit and the size
of an item can vary based on the bin that it is assigned to. GAP is
APX-hard and a $2$-approximation for it is implicit in the work of
Shmoys and Tardos. Thus far, this was also the best known
approximation for MKP. We will present a polynomial time approximation
scheme (PTAS) for MKP. The main technical idea underlying our scheme
is an approximation-preserving reduction from a general instance of
MKP with $n$ itmes to an instance with $n$ itmes and $O(\log n)$
distinct sizes and profits. We also discuss the complexity of simple
generalizations of MKP which turn out to be APX-hard.
Joint work with Sanjeev Khanna.
____________
STATISTICS SEMINAR
on Tuesday, 11 January 2000, 4:15pm
Sequoia Hall 200
http://www-stat.stanford.edu/seminars/seminars.html
Apportionment of Seat in Proportional Representation
Systems: A Majorization Comparison of Divisor Methods
Ingram Olkin
Stanford University
Proportional representation is applied to such problems as the
apportionment of a number of seats to each party proportionally to the
number of votes received, or the apportionment of a number of seats to
each constituency proportionally to its population. From the inception
of the proportional representation movement it has been an issue
whether larger parties are favored at the cost of smaller parties in
one apportionment of seats as compared to another apportionment. A
number of methods have been proposed and used in countries with a
proportional representation system. These methods exhibit regularity
of order that captures the preferential treatment of larger versus
smaller parties. This order, namely majorization, permits the
comparison of seat allocation in two apportionments. For divisor
methods, we show that one method is majorized by another method if and
only if their signpost ratios are increasing. This criterion is
satisfied for the divisor methods with power mean rounding, and the
divisor methods with stationary rounding. Majorization places the five
traditional apportionment methods in the order as they are known to
favor larger parties over smaller parties: Adams, Dean, Hill, Webster,
and Jefferson.
(Joint work with A.W. Marshall and F. Pukelsheim)
____________
PROBABILITY & STOCHASTIC PROCESSES SEMINAR
on Monday, 10 January 2000, 4:15pm
Sequoia Hall 200
http://www-stat.stanford.edu/~amir/prob-seminar/
A Multiclass Queue in Heavy Traffic with Throughput Time
Constraints: Asymptotically Optimal Dynamic Controls
Erica Lee Plambeck
Stanford University
Consider a single-server queueing system with K job classes, each
having its own renewal input process and its own general service time
distribution. Further suppose the queue is in heavy traffic, meaning
that its traffic intensity parameter is near the critical value of
one. A system manager must decide whether or not to accept new jobs
as they arrive, and also the order in which to serve jobs that are
accepted. The goal is to minimize penalties associated with rejecting
jobs, subject to upper bound constraints on the throughput times for
accepted jobs; both the penalty for rejecting a job and the bound on
the throughput time may depend on job class. This problem formulation
does not make sense in a conventional queueing model, because
throughput times are random variables, but we show that the
formulation is meaningful in an asymptotic sense, as one approaches
the heavy traffic limit under diffusion scaling. Moreover, using a
method developed recently by Bramson and Williams, we prove that a
relatively simple dynamic control policy is asymptotically optimal in
this framework. Our proposed policy rejects jobs from one particular
class when the server's nominal workload is above a threshold value,
accepting all other arrivals; and the sequencing rule for accepted
jobs is one that maintains near equality of the relative backlogs for
different classes, defined in a natural sense.
____________
CSLI LECTURE
on Wednesday, 12 January 2000, 2:00pm
Cordura 100
Robust Semantics for Dialogue Using
Flat Structures
David Milward
SRI International, Cambridge
Dialogue utterances are rarely sentences and are often
fragmentary. This talk discusses some of the assumptions made by
shallow and deep approaches when mapping from a word lattice to an
output suitable for e.g. database query. The talk advocates an
alternative approach using a 'flat' semantic representation where the
recursive structure is encoded implicitly via indexing. The aim is to
keep the robustness of shallow or keyword-based approaches, whilst
retaining the generality and formal nature of a full semantics. The
talk will be accompanied by a demo of a speech input system.
____________
CS528: BROAD AREA COLLOQUIUM
on Wednesday, 12 January 2000, 4:15pm to 5:15pm
TCseq201 (Lecture Hall B)
http://robotics.stanford.edu/ba-colloquium/
Trends in Computer Vision for NASA and
DoD Mobile Robot Programs
Larry Matthies
Jet Propulsion Laboratory
California Institute of Technology
NASA and DoD are both funding substantial levels of mobile robot
research at present. A key hold-up in both domains has been the very
limited ability of robots to sense their environment; however,
progress in this area is accelerating considerably. I will survey this
progress in three programs that we participate in at JPL: (1)
planetary rover research, funded by NASA, (2) portable mobile robots
for urban reconnaissance, funded by DARPA, and (3) cross-country
mobile robots for reconnaissance in mechanized infantry battalions,
funded by the U.S. Army. Autonomous obstacle detection and position
estimation are core problems in all of these programs. I will discuss
the state of the art and open issues for these problems in each of the
above programs, including a discussion of roles played by real-time
stereo vision algorithms, compact scanning laser range finders,
multispectral cameras, night vision, and visual feature
tracking. NASA's goal is to return samples from Mars by 2008;
autonomous rovers are central to achieving this goal and the above
technologies are key enablers of the level of autonomy required. For
Earth-based applications in DoD and elsewhere, maturation of these
technologies may lead to fieldable mobile robots within 10 to 15
years.
_____________
EE380: COMPUTER SYSTEMS LABORATORY COLLOQUIUM
on Wednesday, 12 January, 4:15pm
NEC Auditorium, Gates B03
http://www.stanford.edu/class/ee380/
VMware's Virtual Platform Technology
Mendel Rosenblum
VMware Inc.
VMware's Virtual Platform is a software system that allows multiple
operating systems environments to be run concurrently on a standard
x86 PC. By adapting some new twists to 1960s virtual machine monitors,
the Virtual Platform provides virtualization of the non-virtualizable
Intel x86 processor. It also handles the large diversity of hardware
available for the PC platform. The resulting system features both high
performance and high portability and also ease of installation.
In this presentation I will describe the main challenges of
implementing a virtual machine monitor for the commodity x86 PC as
well as some of the solutions to these problems as implemented in
VMware's Virtual Platform.
About the speaker:
Mendel Rosenblum is a founder and Chief Scientist of VMware Inc., a
startup company that has developed the Virtual Platform technology
described in this talk. He is also an Associate Professor of Computer
Science at Stanford University. He has led a number of research
projects including the Disco scalable virtual machine monitor, the
SimOS complete machine simulation environment, and the Hive scalable
operating system. Dr. Rosenblum received a BA in Math from the
University of Virginia (1984) and a MS (1989) and PhD (1992) in
Computer Science from UC Berkeley. He is a 1992 recipient of the
National Science Foundation's National Young Investigator award and a
1994 recipient of an Alfred P. Sloan Foundation Research
Fellowship. He was a co-winner of the 1992 ACM Doctoral Dissertation
Award for his work on log-structured file systems.
Contact information:
Mendel Rosenblum
3145 Porter Drive, Bldg. F
Palo Alto, CA 94304
USA
(650)-475-5214
(650)-475-5001
mendel@vmware.com
____________
STANFORD NETWORKING SEMINAR
on Thursday, 13 January 2000, 12:45pm
Gates 104
http://netseminar.stanford.edu/sessions/2000-01-13.html
Networking Non- Devices
Using BlueSky and Bluetooth
Pravin Bhagwat
Mobile Networking Group
IBM, Thomas J. Watson Research Center
The BlueSky project aims at providing a low-cost, low-power, indoor
wireless networking solution for non-PC devices such as palmtop
computers, cell phones, digital cameras, and computer peripherals. In
this talk, I will describe our design rationale and implementation
experience of building two variants of the BlueSky system. The first
BlueSky prototype was built using a radio module from a cordless
phone. Users can plug-in the BlueSky adapter into the serial port of
their palmtop devices and access networking services over the cordless
link. An attractive feature of the system is that it enables MobileIP
style seamless roaming without requiring any changes to the networking
stack of palmtop devices. The next version of the BlueSky system is
being built on top of Bluetooth. Bluetooth is an emerging, low-power,
short range RF wireless technology which is aimed at eliminating
cables between devices. In principle, using Bluetooth radio modules it
should be possible to form an ad hoc network of devices, but the
techniques for forming such networks have not been fully explored
yet. I will present our initial results which include a technique for
characterizing Bluetooth network topologies, algorithms for
self-organization, and a method for routing packets over Bluetooth ad
hoc networks. I will conclude the talk with a discussion of open
problems in this area.
About the speaker:
Pravin Bhagwat is a member of research staff at IBM Thomas J. Watson
Research Center, New York. Since joining IBM in 1995, he has worked on
a number of topics including mobile computing, networking protocols,
proxies, and firewalls. He is the designer of BlueSky, an indoor
wireless networking system for palmtop computers, and the co-inventor
of TCP splicing, a technique for building fast application layer
proxies. He actively serves on program committees of mobile computing
and networking conferences and and has published several technical
papers in the area of mobile computing and networking. He has a
Ph.D. in computer science from the University of Maryland, College
Park. He also holds an adjunct faculty appointment in the electrical
engineering department at Polytechnic University, Westchester Campus,
NY.
____________
STANFORD ALGORITHMS SEMINAR
on Thursday, 13 January 2000, 4:15pm
Gates 498
http://Theory.Stanford.EDU/~aflb/1999-00.html#1999-00.4
Approximation Algorithms for the Vertex Cover
Problem in Graphs and Hypergraphs
Eran Halperin
Tel Aviv University
We present improved algorithms for finding small vertex covers in
bounded degree graphs and hyprgraphs. We use semidefinite programming
to relax the problems, and introduce new rounding techniques for these
relaxations. On graphs with maximum degree at most \Delta, the
algorithm achieves a performance ratio of roughly 2 - 2 \ln\ln \Delta
/ \ln \Delta for large \Delta, which improves the previously known
ratio of 2 - (\ln \Delta + O(1)) / \Delta obtained by Halldorsson and
Radhakrishnan. Using similar techniques, we also present improved
approximations for the vertex cover problem in hypergraphs. For
k-uniform hypergraphs with n vertices, we achieve a ratio of roughly k
- (k-1)\ln\ln n / \ln n for large n, and for k-uniform hypergraphs
with maximum degree at most \Delta, the algorithm achieves a ratio of
roughly k - k(k-1)\ln\ln \Delta / \ln \Delta for large \Delta.
____________
CS547: HUMAN-COMPUTER INTERACTION SEMINAR
on Friday, 14 January 2000, 12:30pm to 2:00pm
Gates B01
http://hci.stanford.edu/cs547/
The Importance of Homes in Technology Research
Debby Hindus
Interval Research
In this talk, I will argus for the importance of home-related research
on technology. Several important differences between researching homes
and researching workplaces are described, and several issues in
conducting home-related research are discussed in the context of
specific research efforts. Ways to advance home-related research as a
discipline are presented, including an existing course on technology
design with a home focus.
Debby Hindus has been a Member of the Research Staff at Interval
Research Corporation in Palo Alto, CA, since 1992. Her current
research interests include broadband applications in the home and
wireless techologies. Ms. Hindus has co-authored several studies of
novel communications technology for workplaces and homes. In 1999,
Ms. Hindus taught a new Stanford course on The Design of Domestic and
Consumer Technologies. Earlier research addressed a new kind of
computer-mediated communication, the audio space, and the design of
user interactions within an audio space. Ms. Hindus holds an MS degree
from the MIT Media Lab and a BSCS degree from the University of
Michigan. While in the Media Lab's Speech Research group, her work
focused on innovative speech applications for interacting with
computers.
____________
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.
____________