[Date Prev][Date Next][Date Index]
CSLI Calendar, Wednesday, 9 June 2004, vol. 19:39
CSLI CALENDAR OF PUBLIC EVENTS
______________________________________________________________________
9 June 2004 Stanford Vol. 19, No. 39
______________________________________________________________________
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 9 JUNE 2004 TO 18 JUNE 2004
WEDNESDAY, 9 JUNE 2004
12:15pm Senior Project Software Faire
Wallenberg Hall
Computer Science Senior Project Course
http://www.stanford.edu/class/cs194/faire/
Information below
5:30pm Syntax Workshop
Margaret Jacks 460:126
"State-deriving suffixes in Pima"
Eric Jackson
UCLA
http://www-linguistics.stanford.edu/sssg/
Abstract below
THURSDAY, 10 JUNE 2004
4:00pm PARC Forum
George Pake Auditorium at PARC
"Computer Networks & Packet Switch Design"
Balaji Prabhakar
Stanford
http://www.parc.com/forum/
Abstract below
4:15pm Information Systems Seminar
Packard 101
"Universal Minimax Discrete Denoising under Channel Uncertainty"
Styrmir Sigurjonson
Stanford University
http://isl.stanford.edu/groups/seminar/
Abstract below
7:00pm Computer History Museum Lecture
Computer History Museum (1401 N. Shoreline Blvd., Mountain View)
"Then and Now: Computer Graphics in Games"
Jordan Mechner, Prince of Persia
Rand Miller, Myst
Will Wright, SimCity
Vince Broady, CNET Networks
http://www.computerhistory.org/events/
Abstract below
(RSVP required)
SUNDAY, 13 JUNE 2004
9:30am Stanford Commencement
Stanford Stadium
Sandra Day O'Connor
United States Supreme Court
http://commencement.stanford.edu/
open to the public and free
THURSDAY, 17 JUNE 2004
12 noon Tech Express Brownbag
Hartley Conference room, Mitchell Earth Sciences
"My computer is driving me crazy!"
Mark Branon
ITSS, Stanford
(Tech Express events are aimed at the Stanford Community)
http://www.stanford.edu/group/itss-customer/ip/techexpress/
Abstract below
4:00pm PARC Forum
George Pake Auditorium at PARC
"Bioinformatics & Genomics"
Gerard Manning
Salk Institute
http://www.parc.com/forum/
7:00pm SDForum Distinguished Speaker Series
George Pake Auditorium at PARC
"Envisioning the Connected World"
Jerry Fiddler
Founder, Board Member - Wind River
http://www.windriver.com/
(registration and fee required, see web page)
http://www.sdforum.org/dss/
____________
Stanford Blood Center status: Shortage of O-, O+, A-, A+, and AB-.
For an appointment: http://bloodcenter.stanford.edu/ or call
650-723-7831. It only takes an hour of your time. With the students
gone blood will likely be in short supply.
____________
SENIOR PROJECT SOFTWARE FAIRE
on Wednesday, 9 June 2004, 12:15pm - 5:00pm
Wallenberg Hall
http://www.stanford.edu/class/cs194/faire/
What is the Software Faire?
In CS194, Stanford's Senior Project Course, student teams design and
implement a significant software project of their own choosing. It is
the capstone course--a chance for them to show us what they have
learned and demonstrate that they can work with the intensity that
will be required after graduation. At the end of the quarter, we hold
a Software Faire. It's like a small trade show, with nonstop
demonstrations of all the projects. It's a fun event, with lots of
people and prizes for the best projects. The students get very excited
about showing off their work, especially to visitors from industry.
Who is invited?
Everyone is invited to attend the Faire. This is a great opportunity
for people outside of Stanford to see what our seniors in Computer
Science are capable of producing in a short 10 weeks!
What are the projects like?
The projects cover a very wide range of topics. See
http://www.stanford.edu/class/cs194/faire/projects.html
for examples from this and previous years.
____________
SYNTAX WORKSHOP
on Wednesday, 9 June 2004, 5:30pm
Margaret Jacks Hall 460:126
http://www-linguistics.stanford.edu/sssg/
"State-deriving suffixes in Pima"
Eric Jackson
UCLA
A number of proposals in lexical semantics have claimed that certain
causative and inchoative events are related to states; these types of
events correspond to the causation of a state, or the coming to hold
of a state. (Dowty 1979, Rappaport Hovav and Levin 1998, among others)
The linguistic objects which correspond to such eventualities are
typically given an analysis in which the event-denoting forms are
derived from the state-denoting forms. This talk will present data on
two suffixes of O'odham (Tepiman, Southern Uto-Aztecan) which appear
to work in the opposite direction: the stems they attach to denote
events, while the suffixed forms denote states; at least a subset of
these appear to be states which entail a past event, and may therefore
be compositionally derived. The effect of these suffixes resembles
that of morphological alternations in a number of other languages, and
the applicability to the O'odham data of the analyses for two such
alternations - the German state passive (Kratzer 2000) and the
Chichewa stative (Dubinsky and Simango 1996) - will be discussed,
focusing on the introduction of external arguments and the entailment
of a past event. Little work has been done on this type of alternation
within the framework of Distributed Morphology (Halle and Marantz
1993); the mechanisms available within this framework to analyze such
alternations will also be discussed.
References
Dowty, David. 1979. Word Meaning and Montague Grammar. Boston: D. Reidel.
Dubinsky, Stanley, and Silvester Ron Simango. 1996. Passive and
Stative in Chichewa: Evidence for Modular Distinctions in Grammar.
Language 72, 749-781.
Halle, Morris and Alec Marantz. 1993. Distributed Morphology and the
Pieces of Inflection. In K. Hale and S.J. Keyser, eds., The View from
Building 20: Essays in Linguistics in honor of Sylvain Bromberger,
Cambridge: MIT Press, 111-176.
Kratzer, Angelika. 2000. Building Statives. Berkeley Linguistics
Society 26.
Rappaport Hovav, Malka and Beth Levin. 1998. Building Verb Meanings.
In Miriam Butt and Wilhelm Geuder, eds, The Projection of Arguments.
Stanford: CSLI.
____________
PARC FORUM
on Thursday, 10 June 2004, 4:00pm - 5:00pm
George Pake Auditorium, PARC
http://www.parc.com/forum/
"Computer Networks & Packet Switch Design"
Balaji Prabhakar
Stanford University
The Internet is a challenging environment to design algorithms for:
there is a lot of work to do and not enough time to do it in. For
example, the time available to switch packets at a router in the
Internet core is roughly 50 ns. It is very challenging to design good
scheduling algorithms that operate at this speed. Thus, Internet
algorithms need to be simple enough to be implementable, but
sophisticated enough to perform well. Randomized algorithms are
particularly well-suited for this task because they base decisions on
a small random sample of the state rather than the whole state. This
considerably simplifies the implementation.
In this talk I will illustrate the use of randomization in devising
simple, high-performance network algorithms; specifically for switch
scheduling, web caching, and bandwidth partitioning.
About the Speaker: Balaji Prabhakar is with the Departments of
Electrical Engineering and Computer Science at Stanford University. He
is currently interested in network algorithms, scalable network
performance prediction, wireless networks and information theory. He
is a Fellow of the Alfred P. Sloan Foundation, and has received the
NSF CAREER award, the Erlang Prize from the INFORMS Applied
Probability Society, and the Rollo Davidson Prize from the University
of Cambridge. He is a co-recipient of two best paper awards: at Hot
Interconnects 2002 and at Infocom 2004.
____________
INFORMATION SYSTEMS SEMINAR
on Thursday, 10 June 2004, 4:15pm-5:15pm
Packard 101
http://isl.stanford.edu/groups/seminar/
"Universal Minimax Discrete Denoising under Channel Uncertainty"
Styrmir Sigurjonson
Stanford University
The goal of a denoising algorithm is to recover a signal from its
noise-corrupted observations. Perfect recovery is seldom possible, and
performance is measured under a given fidelity criterion. For discrete
signals corrupted by a *known* discrete memoryless channel, the DUDE
algorithm was recently shown to perform this task practically and
asymptotically optimally, with no knowledge of statistical properties
of the signal.
This talk will address the scenario where, in addition to the lack of
knowledge of the source statistics, there is also uncertainty in the
channel characteristics. We propose a family of denoisers and
establish their universal asymptotic optimality under a minimax
criterion we argue appropriate for this setting. The proposed schemes
can be implemented computationally efficiently. Preliminary
experimental results that seem to be indicative of the potential of
these schemes to do well on real data will also be presented.
The talk is based on joint work with George Gemelos and Tsachy
Weissman.
____________
COMPUTER HISTORY MUSEUM LECTURE
on Thursday, 10 June 2004, 7:00pm - 8;30pm
Computer History Museum (1401 N. Shoreline Blvd., Mountain View)
http://www.computerhistory.org/events/
(RSVP required, see web page below)
http://www.computerhistory.org/nvidia_06102004/
($10 donation suggested)
"Then and Now: Computer Graphics in Games"
Jordan Mechner, Prince of Persia
Rand Miller, Myst
Will Wright, SimCity
with
Vince Broady, CNET Networks
Besides being a lot of fun to play, video games are also a major
driver of innovation in computer graphics. Join us for a fascinating
evening with three famous game designers -- Jordan Mechner (Prince of
Persia), Rand Miller (Myst), and Will Wright (SimCity) . who will
discuss how their games have pushed the boundaries of graphics
development over the years. Moderated by Vince Broady of CNET
GameSpot, the panelists will show and tell how their games have helped
move us from simple pixel painting to lavish 3-D simulation. Before
the panel, members of the Museum are invited to interact with the
first-ever display of the Museum's collection of computer games and
artifacts, and see examples of the absolute cutting edge in computer
graphics, courtesy of nVidia, the evening's corporate sponsor.
If you enjoy video games, then you won't want to miss this exciting
combination of creative talent, historical collections, and
cutting-edge demos. If video games are not your passion, then come
learn about how they have been responsible for exciting innovations in
computing history. In either case, prepare to have fun!
____________
TECH EXPRESS BROWNBAG
on Thursday, 17 June 2003, 12 noon - 1:00pm
Hartley Conference room, Mitchell Earth Sciences
(Tech Express events are aimed at the Stanford Community)
http://www.stanford.edu/group/itss-customer/ip/techexpress/
"My computer is driving me crazy!"
Mark Branom
ITSS, Stanford
Sick of spam? Irritated by popup boxes? Bothered by computer viruses?
Worried about spyware and adware (and what are they anyway)? Mark
Branom will give you some simple tips and tricks on how to deal with
these pesky annoyances that we experience every day.
The Tech Express is a series of user-friendly brown-bag sessions on
computing at Stanford. These sessions, held from 12:00 to 1:00 P.M and
led by knowledgeable ITSS staff, are intended to meet the needs of
Stanford staff, but are open to everyone, including faculty and
students. No registration is required - come by and learn something
new! Bring your lunch! Bring your questions!
____________
SDFORUM DISTINGUISHED SPEAKER SERIES
on Thursday, 17 June 2004, 6:30pm
Computer History Museum, 1401 Shoreline Blvd, Mountain View
http://www.sdforum.org/dss/
(there is a fee for non-SDForum members, see web page)
"Envisioning the Connected World"
Jerry Fiddler
Founder, Board Member - Wind River
In the not-too-distant future, the majority of electronic devices will
be connected via the Internet or wireless protocols, bringing
convenience and simplicity to daily living, but adding layers of
technology and complexity to devices we use everyday. Jerry Fiddler
will offer a glimpse to his vision of the future: "The Connected
World." He will discuss how this "world system" will evolve through
the convergence of multiple technologies resulting in one, giant
interoperable system. The audience will learn that the road to the
connected world is wide open, and that today marks the beginning of a
new era in the embedded industry.
About the Speaker: Jerry Fiddler is founder and member of the board of
Wind River. Since its establishment in 1981 in a Berkeley garage, Wind
River has grown to become the leading provider of embedded software
worldwide. Fiddler sits on several corporate boards, including
Tensilica, Axis, Crossbow and Nanochip, as well as a number of
advisory and non-profit boards. He has worked actively both with
students and in an advisory capacity at a number of universities,
including University of California, Berkeley, Wharton, and University
of Illinois. He was also a member of the first NRC national study of
networked embedded systems. He received a BA in music and photography,
and an MS in computer science, both from University of Illinois.
____________
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
____________