[Date Prev][Date Next][Date Index]
CSLI Calendar, Wednesday, 27 August 2003, vol. 18:48
CSLI CALENDAR OF PUBLIC EVENTS
______________________________________________________________________
27 August 2003 Stanford Vol. 18, No. 48
______________________________________________________________________
A weekly publication of the
Center for the Study of Language and Information (CSLI)
Stanford University, Ventura Hall, Stanford, CA 94305-4115
http://www-csli.stanford.edu/
____________
ACTIVITIES FROM 27 AUGUST 2003 TO 5 SEPTEMBER 2003
WEDNESDAY, 27 AUGUST 2003
3:00pm Special University Oral Examination
Gates B12 (note change in location)
"Algorithms for Data Stream Systems"
Mayur Datar
Computer Science
http://www.stanford.edu/~datar/
Abstract below
4:00pm Berkeley EECS Colloquium
306 Soda Hall (Berkeley)
"Sustaining the Silicon Revolution in the 21st Century"
Tsu-Jae King
EECS Dept., UC Berkeley
http://buffy.eecs.berkeley.edu/Seminars/
MONDAY, 1 SEPTEMBER 2003 - University Holiday
WEDNESDAY, 3 SEPTEMBER 2003
4:00pm UC Berkeley Psychology Colloquium
3105 Tolman (Berkeley)
"International Psychology: Challenges and Prospects"
Kurt Pawlik
Emeritus Professor, University of Hamburg, Germany
http://psychology.berkeley.edu/admin/colloquia.html
____________
Stanford Blood Center status: critical shortage of A+, A-, and B+;
shortage of O+, O-, B-, AB+, and AB-. For an appointment:
http://bloodcenter.stanford.edu/ or call 650-723-7831. It only takes
an hour of your time.
____________
MEDIA-X REQUEST FOR PROPOSALS
deadline 14 September 2003
Restricted to Stanford Principal Investigators
The Media X Program at Stanford University announces availability of
funding for research about interactive technologies related to sensing
and control. Proposals may be for funding up to $75K for one year.
The aim of this initiative is to promote innovative research on the
integration of technology and the understanding of human psychology
and social behavior that can lead to new technologies that enable
natural interaction with information and physical world. Proposed
research should address issues related to fundamental technologies and
human uses and effects.
One criterion for funding of Media X research is relevance to the
interests of corporate sponsors. While all applications in the
general area of sensing and control will be considered, the following
are examples of research topics of special interest to Media X
partners: Biometrics (including facial recognition of age and gender
based on expressions and behavioral assessment and relationship to
consumer behavior); Sensing - Sensors (including applications in
acoustics, optics, visions, RF, biochemical, and physiological sensors
that mimic visual inspection for impurities and foreign material by
humans in food and beverage processing); Sensor Networks (including
models and new applications for sensor networks); and MEMS and NEMS
(including RF MEMS, NEMS for novel wireless and optical devices).
Proposals of no more than five pages (including all personnel
information and the budget) should be submitted electronically in PDF
format by September 14, 2003, and sent to Keith Devlin at:
devlin@csli.stanford.edu
Please note that Media X projects are subject to various constraints
and are selected according to specific criteria. For complete
information about preparing your proposal see:
http://mediax.stanford.edu/globals/faculty/guidelines.html
For general information about Media X see: http://mediax.stanford.edu/
For help with issues not addressed in the above sources, contact Keith
Devlin by electronic mail.
Awards will be announced by September 23, 2003. Funding will be
available immediately thereafter.
____________
SPECIAL UNIVERSITY ORAL EXAMINATION
on Wednesday, 27 August 2003, 3:00pm
Gates B12
Refreshments served at 2:45pm
http://www.stanford.edu/~datar/
"Algorithms for Data Stream Systems"
Mayur Datar
Computer Science, Stanford University
In a growing number of information processing applications, data takes
the form of "continuous data streams" rather than traditional stored
databases. These applications share several distinguishing features
like the need for real time analysis, huge volumes of data, and
unpredictable and bursty data arrivals. These applications have
spawned a considerable and growing body of research into data stream
processing, ranging from algorithms for data streams to full-fledged
data stream systems. In this talk, I will present some of my work in
this area.
In the first part of my talk, I will present algorithms for the
"sliding window model". In the sliding window model, at any given time
only the last N elements (window size) of the data stream are
considered pertinent for answering queries. We have developed a novel
data structure called Exponential Histograms that can be used to solve
a large class of problems in the sliding window model efficiently,
namely using small space and query/update time. I will explain this
data structure with the help of a simple problem: Count the number of
1's from the last N data elements of 0's and 1's.
In the second part, I will talk about some of the work that I have
done in actually building a general purpose data stream management
system (DSMS) at Stanford. My focus has been on developing algorithms
for runtime resource allocation problems in a DSMS. I will talk about
one such algorithm for online operator scheduling in DSMS that
minimizes the total memory usage of the system.
____________
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
____________