CSLI (Center For The Study Of Language
And Information)
CSLI Menu (Current Page: Events) Archive of CSLI Calendars pointers to events in the bay area Stanford Events Calendar Coglunch Current CSLI Calendar CSLI Events information about CSLI CSLI people CSLI industrial affiliates publications research home
[Date Prev][Date Next][Date Index]

CSLI Calendar, Wednesday, 23 June 2004, vol. 19:41




                    CSLI CALENDAR OF PUBLIC EVENTS
______________________________________________________________________

23 June 2004                    Stanford               Vol. 19, No. 41
______________________________________________________________________

                     A weekly publication of the
       Center for the Study of Language and Information (CSLI)
      Stanford University, Cordura Hall, Stanford, CA 94305-4115
                    http://www-csli.stanford.edu/
                             ____________

             ACTIVITIES FROM 23 JUNE 2004 TO 2 JULY 2004

THURSDAY, 24 JUNE 2004
11:00am Music 319: CCRMA Hearing Seminar
        CCRMA Library, The Knoll
        "Motion-tracked binaural"
        Richard O. Duda 
        UC Davis
        http://mambo.ucsc.edu/psl/ccrmas/ccrmas.html
        Abstract below

 4:00pm SRI AI Seminar Series
        EJ228, SRI International
        "Measuring Information Transmission for Team Decision Making"
        Timothy W. Rauenbusch 
        Harvard University
        http://www.ai.sri.com/seminars/
        Abstract below

 4:00pm PARC Forum
        George Pake Auditorium at PARC
        "Particle Accelerators & Feedback Systems"
        John Fox 
        Stanford Linear Accelerator Center
        http://www.parc.com/forum/

MONDAY, 28 JUNE 2004
 7:00pm Computer History Museum Lecture
        Computer History Museum (1401 N. Shoreline Blvd., Mountain View)
        "The Mars Exploration Rover Project - 
        How Spirit and Opportunity Got to Mars"
        Peter C Theisinger
        NASA
        http://www.computerhistory.org/events/

THURSDAY, 1 JULY 2004
11:00am Music 319: CCRMA Hearing Seminar
        CCRMA Library, The Knoll
        "Auditory-evoked laughter"
        David Huron
        http://mambo.ucsc.edu/psl/ccrmas/ccrmas.html
                             ____________

Stanford Blood Center status: Shortage of O+, B-, and AB-.
For an appointment: http://bloodcenter.stanford.edu/ or call
650-723-7831.  It only takes an hour of your time.
                             ____________

                   MUSIC 319: CCRMA HEARING SEMINAR
                  on Thursday, 24 June 2004, 11:00am
                       CCRMA Library, The Knoll
             http://mambo.ucsc.edu/psl/ccrmas/ccrmas.html

Dick Duda has been working on various aspects of binaural sound, along
with Ralph Algazi at UC Davis, for many years.  Their latest effort
allows them to reproduce accurate spatial sounds and play them back
over headphones to listeners.  Just back from successful
demonstrations at AES, come hear how they create accurate spatial
sounds *without* HRTFs (head-related transfer functions). 

Bring both of your ears, and come think about new ways to create a
binaural sensation.  Demos will follow the talk!!!!
 - Malcolm

   "MTB -- A New Method For Capturing and Rendering Spatial Sound"
                           Richard O. Duda
                 CIPIC Interface Laboratory, UC Davis

The two standard methods for capturing live spatial sound with
microphone arrays attempt either to reconstruct the incoming wave
field or to reproduce the sound pressure at the eardrums. The various
surround-sound systems usually use loudspeakers to provide approximate
wave field synthesis, and the effect of the listener's head is
automatically accounted for by immersing the listener in the sound
field.  Unfortunately, exact wave field reconstruction requires a very
large number of channels.  Binaural or dummy-head recordings, which
need only two channels, usually use headphones to provide separate
signals directly to the ears.  Here the effect of the listener's head
is approximately accounted for by the corresponding dummy head.
Unfortunately, binaural recordings do not account for the dynamic
effects that occur when listeners turn their heads, and the sonic
world turns whenever the listener turns. 

We describe a new approach that provides a different tradeoff between
bandwidth requirements and spatial fidelity.  Our new method -- called
MTB for Motion-Tracked Binaural --  is a generalization of binaural
recordings that uses more than two channels so that it can capture the
dynamic effects generated by the listener's motion and stabilize the
acoustic field.  The result, which is best heard over headphones, is
highly realistic reproduction of spatial sound with modest bandwidth
requirements.  The method requires interpolation between microphone
signals, and the properties of different interpolation methods will be
presented and demonstrated. 
                             ____________

                        SRI AI SEMINAR SERIES
              on Thursday, 24 June 2004, 4:00pm - 5:30pm
                       EJ228, SRI International
                  http://www.ai.sri.com/seminars/

    "Measuring Information Transmission for Team Decision Making"
                        Timothy W. Rauenbusch
                          Harvard University

A fundamental problem in designing multiagent systems is to select
algorithms that make correct group decisions effectively. Typically,
each individual in a group has private, relevant information and
making a correct group decision requires that private information be
communicated. When there is limited communication bandwidth or
potential for delays in communication, it is important to select the
algorithm for making group decisions that requires least
communication. In this talk, I will describe the benefits of
quantifying information transmitted by measuring the entropy of
messages to find algorithms for decision making that minimize use of
bandwidth. I will show the results of the analysis of information
content of a diverse group of center-based algorithms, including
several types of auctions, for making group decisions. I will present
a new data structure, the dialogue tree, that compactly represents
complex interactions between individuals and show how it is used to
measure the information transmitted by an algorithm. The talk will
demonstrate that the amount of communication required by an algorithm
is highly dependent on factors of the multiagent system's environment,
such as team size, error tolerance, and the likelihood that a given
agent can perform a particular task. No single algorithm guarantees
the least communication in all environments. A system designer must
consider both coordination and revelation when choosing an algorithm.
I show that systems that implement an unsuitable algorithm for
decision making incur significant costs for wasted communication.

About the Speaker: Timothy Rauenbusch received his Ph.D. in Computer
Science from Harvard University in June 2004. His thesis was entitled
Measuring Information Transmission for Team Decision Making. His
research has focused on the development and analysis of algorithms for
team decision making. He has also worked to develop computer systems
that support negotiation among people. Tim received his undergraduate
degrees in Finance and Computer Science (Summa cum Laude) from the
University of Pennsylvania in 1996. At Penn, he received the General
Alumni Society's Student Award of Merit in part for writing the Quick
Start Manual for Eniac, the world's first general-purpose digital
computer. Before returning to research, Tim worked on Wall Street as
an investment banker. Tim was a visitor at SRI during academic year
2001-2002.
                             ____________

                             END MATERIAL

The CSLI Calendar appears weekly on Wednesdays throughout the academic
year.  Announcements, abstracts, and other information to appear in
the Calendar should be submitted to the editor, who reserves the right
to decide what does or does not go in the calendar
mailto:incalendar@csli.stanford.edu

Requests to be added to the mailing list should be sent to
majordomo@csli.stanford.edu.  With the lines in the body of the text
of either
 subscribe csli-calendar
for the long form or
 subscribe csli-short-calendar
for the short form (i.e., no abstracts).  Problems with subscribing or
unsubscribing should be sent to
owner-csli-calendar@csli.stanford.edu.

The full current issue is at
http://www-csli.stanford.edu/Archive/calendar/current.shtml
and the archives at
http://www-csli.stanford.edu/Archive/calendar/

People on most of the CSLI computers can type 'help csli-calendar' to
see the current issue.

The CSLI Calendar is also posted each week to
news://nntp-csli.stanford.edu/csli.bboard.
and
news://news.stanford.edu/su.events

Information about CSLI's research program is available at
http://www-csli.stanford.edu/

For maps to the Stanford University campus see
http://www.stanford.edu/home/visitors/maps.html
                             ____________