[Date Prev][Date Next][Date Index]
CSLI Calendar, Wednesday, 2 July 2003, vol. 18:40
CSLI CALENDAR OF PUBLIC EVENTS
______________________________________________________________________
2 July 2003 Stanford Vol. 18, No. 40
______________________________________________________________________
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 2 JULY 2003 TO 12 JULY 2003
WEDNESDAY, 2 JULY 2003
4:00pm SRI AI Seminar Series
EJ228, SRI International
"SPARK (SRI Procedural Agent Realization Kit)"
David Morley
SRI
http://www.ai.sri.com/seminars/
Note change in date from last week's calendar
Abstract below
FRIDAY, 4 JULY 2003 - University Holiday
TUESDAY, 8 JULY 2003
7:00pm Emerging Technology Group
Cubberley Community Center, H-1, 4000 Middlefield, Palo Alto
"Wireless Digital Picture Frames (the WallFlower Systems Story)"
Gordon Clyne
Wallflower Systems
http://www.wallflower-systems.com/
"Smart Dust and TinyOS, Self-Configuring Wireless Sensor Networks"
Mike Horton and Alan Broad
Crossbow
http://www.xbox.com/
http://www.sdforum.org/
(there is a fee for non-SDForum members, see web page)
Abstracts below
WEDNESDAY, 9 JULY 2003
2:00pm Semantics and Pragmatics Workshop
Margaret Jacks Hall 460:126
"Components of the meaning of imperatives:
A case study in clause typing"
Paul Portner
Georgetown University
http://www-linguistics.stanford.edu/semgroup/
THURSDAY, 10 JULY 2003
10:00am EE Talk
Packard 101
"From Shannon To TCP: Solving Nonlinear Problems in
Communication Systems Using Geometric Programming and Dualities"
Mung Chiang
EE, Stanford University
http://www.stanford.edu/~chiangm/
http://snrc.stanford.edu/events/industry-seminar/
Abstract below
4:00pm PARC Forum
George Pake Auditorium at PARC
"Modular Robotics"
Mark Yim
PARC
http://www.parc.com/forum/
SATURDAY, 12 JULY 2003
3:30pm Berkeley Intel Research Seminar
Intel Research Berkeley, 2150 Shattuck, Ste. 1300
"Talking Phones: A Cultural Account of an Information and
Communication Technologies"
Genevieve Bell
Intel Research
http://buffy.eecs.berkeley.edu/Seminars/
____________
Stanford Blood Center status: shortage of O+, O-, A-, A+, B+, and
AB+. For an appointment: http://bloodcenter.stanford.edu/ or call
650-723-7831. It only takes an hour of your time.
____________
ANNOUNCEMENT
In case any of you missed the news, the United States Government now
has a 'Do Not Call' registry for personal phone numbers. You can
remove your numbers at http://www.donotcall.gov/ or by phoning
1-888-382-1222 (must call from the number you wish to place on the
list). Note that this won't affect all telemarketers; politicians,
charities, telephone surveyors, or companies with which you already
have a business relationship are exempt (or for that matter those who
are already breaking the law by leaving solicitations on answering
machines aren't likely to obey this one).
____________
ANNOUNCEMENT
STANFORD CHILD LANGUAGE RESEARCH FORUM
16-17 April 2004 (Friday-Sunday)
http://www-linguistics.stanford.edu/~clrf/
Topic: Constructions in Early Acquisition
How do children learn constructions--noun phrases, verb phrases, and
other phrase types? Do they begin with specific lexical items in a
construction and use only those? To what extent do they build from
'verb islands' or 'noun islands' in early constructions? Which
constructions emerge first? What criteria should we use in
establishing productivity? What makes constructions easy vs. hard to
acquire? Can children's bases for inferences about the relevant noun
or verb meanings be identified? Are there consistent patterns across
children in the acquisition of constructions? re there differences
from one verb type to another, or from intransitive to transitive?
Are differences attributable to differences in frequencies in
child-directed speech? What cross- linguistic comparisons are
available? Which constructions have been considered in studies of
children's early syntactic forms?
***
The Organizing Committee for the Stanford Child Language Research
Forum made several changes a few years ago. As a result, CLRF now
meets every two years, and focuses on one specific topic at each
meeting for the papers and posters. Constructions is the topic for
2004.
Abstracts are due on or before January 1, 2004; submitters will be
informed of all decisions by February 15, 2004.
Format for abstracts:
1. one page, double-spaced, font-size 12, with TITLE and ABSTRACT
but no identification of author;
2. one page, with the abstract/poster title, name, affiliation,
full mailing address, and email.
Send both pages to: CLRF-2002 Organizing Committee
Department of Linguistics
Margaret Jacks Hall, Bldg 460
Stanford University
Stanford, CA 94305-2150, USA
Check the CLRF website for information about registration, hotels,
and any further announcements about the meeting,
http://www-linguistics.stanford.edu/~clrf/
____________
SRI AI SEMINAR SERIES
on Wednesday, 2 July 2003, 4:00pm - 5:30pm
EJ228, SRI International
http://www.ai.sri.com/seminars/
"SPARK (SRI Procedural Agent Realization Kit)"
David Morley
Artificial Intelligence Center, SRI International
This talk will provide an overview of SPARK (SRI Procedural Agent
Realization Kit), a new procedural reasoning framework under
development at the A.I. Center. SPARK is strongly influenced by PRS
and shares the same Belief Desire Intention (BDI) model of
rationality, however SPARK adds important capabilities absent in PRS.
These include support for development of large-scale agent
applications, principled representation of procedures that will enable
validation and automated synthesis, and flexibility in the delivery
platform, including the potential to run on PDAs and mobile platforms.
About the Speaker: David Morley joined the A.I. Center in 2000 and
works on BDI agent systems in the Representation and Reasoning
Group. Before joining SRI, he worked at Australian Artificial
Intelligence Institute and in 1999 received his PhD from the
University of Melbourne, Australia.
____________
EMERGING TECHNOLOGY GROUP
on Tuesday, 8 July 2003, 7:00pm
Cubberley Community Center, H-1, 4000 Middlefield, Palo Alto
http://www.sdforum.org/
(there is a fee for non-SDForum members, see web page)
7:00 Pizza, networking, and small-talk
7:15 Gordon begins speaking
7:45 Mike and Alan begin speaking.
"Wireless Digital Picture Frames (the WallFlower Systems Story)"
Gordon Clyne
Wallflower Systems
http://www.wallflower-systems.com/
A brief, light hearted Insight into todays startup companies and their
challenges will lead into a discussion of the potential value of the
new product, and a demonstration. Attendees with 802 equipped laptops
are encouraged to bring them and participate.
About the Speaker: Gordon Clyne, a 25 year veteran of the computer
industry with many years at networking companies in Europe, 8 years at
Apple locations around the world, seven years in the valley, most
recently at Palm, is now at a new startup, Wallflower systems, doing
the sort of things that he has always been keen on, like recycling,
high tech, software, imaging, wireless and creative talents in what
can only be described as a unique blend of both modern technology and
hand crafted products.
"Smart Dust and TinyOS, Self-Configuring Wireless Sensor Networks"
Mike Horton, CEO Crossbow
Alan Broad, Chief Engineer, Crossbow
http://www.xbox.com/
The talk will be an overview of TinyOS, an embedded operating system
developed at UC Berkeley for programming wireless sensor networks,
including theory and examples.
About the Speaker: Mike Horton graduated from UC Berkeley 1996 with an
MSEE focusing in use of MEMS sensor technology. He started Crossbow
immediately thereafter to focus on making sensors more ubiquitous.
____________
EE TALK
on Thursday, 10 July 2003, 10:00am-10:50am
Packard 101
"From Shannon To TCP:
Solving Nonlinear Problems in Communication Systems
Using Geometric Programming and Dualities"
Mung Chiang
EE, Stanford University
http://www.stanford.edu/~chiangm/
We use the principles of Lagrange duality and Shannon duality, and a
special type of convex optimization called geometric program, to solve
several nonlinear problems in communication systems.
We show that the information theoretic limits of channel capacity and
rate distortion can be obtained through Lagrange dual problems, in the
form of geometric programs. Lagrange duality provides a rigorous
characterization of Shannon duality between transmission and
compression in the discrete memoryless case, and can be used to easily
generate bounds. We also consider a more sophisticated model of
transmission and compression with state. By putting the known answers
to eight special cases into a common form, we extend Shannon duality
to cases with state information. The common form also solves the more
general problems where state information at the sender and the
receiver are different but correlated.
We then turn to a network communication system, where limited
resources are allocated to competing user demands. We provide a
flexible form of generalized proportionally fair allocation, which can
be interpreted as the result of a relative entropy minimization. We
show how geometric programs can efficiently optimize such allocations
under various nonlinear Quality of Service constraints. This
methodology is applied to processor sharing, admission control, and a
suite of wireless network power control problems. Continuing to the
coupling effect between meeting user demands in transport layer and
regulating bandwidth supply in physical layer, we distributively solve
a geometric program that balances TCP congestion control with power
control to improve energy efficiency in wireless multihop networks.
____________
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
____________