[Date Prev][Date Next][Date Index]
CSLI Calendar, 12 January 2000, vol. 15:14
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
______________________________________________________________________
12 January 2000 Stanford Vol. 15, No.14
______________________________________________________________________
A weekly publication of the
Center for the Study of Language and Information (CSLI)
Stanford University, Ventura Hall, Stanford, CA 94305-4115
____________
ACTIVITIES FROM 12 JANUARY TO 22 JANUARY 2000
WEDNESDAY, 12 JANUARY
2:00pm CSLI Lecture
Cordura 100
Robust Semantics for Dialogue Using
Flat Structures
David Milward
SRI International, Cambridge
Abstract below
4:00pm Working Seminar in Homology Theory
Building 380:383N
Applications of Configuration Spaces in Engineering
Jim Milgram
Stanford University
http://math.stanford.edu/html/seminars.html
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
4:15pm ME297: Design Theory and Methodology Seminar
Building 560
Thoughts in Creation: Conversations
with Designers
Takashi Kiriyama
The University of Tokyo
http://design.stanford.edu/Courses/me297/#1/12
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
2:30pm Distinguished Visiting Lecture Series (II)
(Math Department)
Building 380:383N
Floer Homology for Monopoles
Tomasz Mrowka
MIT
http://math.stanford.edu/html/seminars.html
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/
Abstract below
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
3:00pm Applied Math Seminar
Building 380:380C
Ridgelets and Curvelets: New Multiresolution
Tools for the Representation of Images with Edges
Emmanuel J. Candes
Stanford University
http://math.stanford.edu/html/seminars.html
3:15pm Philosophy Colloquium
Building 90:92Q
A Nietzschean Theory of Practical Reasons
Nadeem Hussain
University of Michigan
http://www-philosophy.stanford.edu/
TUESDAY, 18 JANUARY
12:00pm Archimides Project (CSLI)
Cordura 100
Dance and Technology: Humanizing the Web
John Simmons
Showlab
http://www-csli.stanford.edu/arch/simmons.htm
Abstract below
4:15pm Probability and Stochastic Processes Seminar
Sequoia Hall
Compound Poisson Approximation for
Markov Chains, with Extensions
Torkel Erhardsson
http://www-stat.stanford.edu/~amir/prob-seminar/
Abstract below
WEDNESDAY, 19 JANUARY
4:15pm Broad Area Colloquium
TCseq201 (Lecture Hall B)
Learning Bayesian Networks
David Heckerman
Microsoft Research
http://robotics.stanford.edu/ba-colloquium/#Schedule
Abstract below
4:15pm EE380: Computer Systems Laboratory Colloquium
NEC Auditorium, Gates B03
SUN's Star Office
Marco Boerrios
SUN Microsystems
http://www.stanford.edu/class/ee380/
4:15pm Statistics Seminar
Sequoia Hall 200
Minimax Deconvolution in MirrorWavelet Bases
Stephanie Mallat
Ecole Polytechnique, Paris
http://www-stat.stanford.edu/seminars/seminars.html
Abstract below
THURSDAY, 20 JANUARY
12:00pm Archimides Project (CSLI)
Cordura 100
A Practical System for Creating Collective IQ
John Simmons
ShowLab
http://www-csli.stanford.edu/arch/simmons.htm
Abstract below
4:00pm Xerox PARC Forum
George Pake Auditorium at Xerox PARC
Airborne personalized travel using "Skycar Volantors"
Paul Moller
Moller International
http://www.parc.xerox.com/ops/projects/forum/
4:15pm Stanford Algorithms Seminar
Gates 498
Testing and Spot-Checking of Data Streams
Martin Strauss
AT&T Research
http://Theory.Stanford.EDU/~aflb/1999-00.html
Abstract below
FRIDAY, 21 JANUARY
12:30pm CS547: Human-Computer Interaction Seminar
Gates B01
Conversation Map: An Interface for Very
Large-Scale Conversations
Warren Sack
MIT Media Lab
http://hci.stanford.edu/cs547/
3:15pm Philosophy Colloquium
Building 90:92Q
On Differing Modally
Karen Bennett
University of Michigan
http://www-philosophy.stanford.edu/
3:30pm Stanford Linguistics Colloquium
Building 460:126
Constituting Morality and Accountability in Girls'
Social Organization through Embodied Language
Practices
Marjorie Goodwin
University of California, Los Angeles
http://www-linguistics.stanford.edu/Linguistics/colloq/
Abstract below
____________
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
____________
ME297: DESIGN THEORY AND METHODOLOGY SEMINAR
on Wednesday, 12 January 2000, 4:15pm to 5:10pm
Building 560
http://design.stanford.edu/Courses/me297/#1/12
Thoughts in Creation: Conversations with Designers
Takashi Kiriyama
The University of Tokyo
It is interesting to listen to designers describe the thoughts behind
their creative work. Although such thoughts largely rely on the
context and hardly can be generalized, one can employ some notions
developed in design studies to investigate the thoughts in an effort
to discover useful lessons for future practices. Conversations with
designers bring new insights to the study of design, and actually some
designers consider it as a useful opportunity to clear their minds and
thus motivate further creations. Over the last two years I have been
running a course called abduction@work (named after C.S. Peirce's
study on creation) for undergraduates at the University of Tokyo. In
the course I invite designers of various fields from architecture
to commercial film production to have a discussion with students
and me. I found common words from design studies, like experiment and
discovery, were useful in discussing design thoughts. But less common
words like establishing a style, producing oneself, and creating an
environment for facilitating the growth of concept were also
useful. In this talk, I will try to bring a summary of interesting
discussions we had in the course. Biography: Takashi Kiriyama is a
visiting Fulbright scholar at CDR, Stanford University. He is
associate professor of Research into Artifacts, Center for Engineering
(RACE), The University of Tokyo. His research interests include design
theory, human-computer interaction, and learning technologies. For
his projects and publications, see http://cdr.stanford.edu/~kiriyama
____________
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.
____________
XEROX PARC FORUM
on Thursday, 13 January 2000, 4:00pm
George Pake Auditorium at Xerox PARC
http://www.parc.xerox.com/ops/projects/forum/
Astrobionics: Tools and Technologies for Space Life
Sciences and Astrobiology Applications
John W. Hines
Fundamental Biology Research Program,
NASA-Ames Research Center
As we enter the era of the International Space Station, and begin to
consider longer duration space travel to other planets, it is
essential that NASA's Biological Space Initiatives develop and apply
the latest advances in technology. New developments in areas such as
nanoscale devices, MEMS, biosensors, gene arrays, biomimetics,
materials science, robotics, advanced optics, wireless communications,
and intelligent, distributed, autonomous information management
systems are just a few of the elements in the arsenal of available and
emerging technologies. When coupled with traditional monitoring and
control platforms, these will provide an important capability for
advancing our understanding and exploration of space. Concurrent with
the development and utilization of these advanced biological and
biomedical technologies for spaceflight missions is their use for
terrestrial applications such as medical monitoring and diagnosis.
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, 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 Speech Research group, her work
focused on innovative speech applications for interacting with
computers.
____________
ARCHIMIDES PROJECT (CSLI)
on Tuesday, 18 January 2000, 12:00pm
Cordura 100
http://www-csli.stanford.edu/arch/simmons.htm
Dance and Technology: Humanizing the Web
John Simmons
Showlab
To help develop a system that delivers interactive 3D human animation
over the Internet in real-time, television producer John Simmons
observed and incorporated several processes developed in the world of
modern dance. Simmons gives an illustrated overview of what he learned
from some of America's leading dancers and choreographers, and
suggests a practical framework for Dance+Technology collaborations in
the areas of linguistics, communication, artificial intelligence and
human-computer interaction. Simmons' animation system is currently
being used by the Archimedes Project to develop an American Sign
Language synthesizer. Joining the discussion are Emilie and Carl Flink,
dancers with the Jose Limon Dance Company, and Tony Kramer from the
Stanford Dance Division.
_____________
PROBABILITY AND STOCHASTIC PROCESSES SEMINAR
Sequoia Hall
http://www-stat.stanford.edu/~amir/prob-seminar/
Compound Poisson Approximation for
Markov Chains, with Extensions
Torkel Erhardsson
Consider a stationary Harris recurrent Markov chain in discrete time
having a stationary distribution q. Let A be a measurable set of
states that is ``rare'' in the sense that q(A) is small. What can be
said about the distribution of the number L(n) of visits to the set A
by the chain up to time n?
In this talk we will give a bound for the total variation distance
between the distribution of L(n) and an approximating compound Poisson
distribution. The bound is derived using Stein's method, regenerative
properties of Harris recurrent Markov chains, and couplings. The
bound is frequently of the order of q(A) log(n q(A)), and depends only
on much studied quantities like hitting probabilities and expected
hitting times. If the state space is finite, the bound can be
numerically computed by solving a few systems of linear equations.
It will be briefly mentioned how the above results can be extended to
compound Poisson approximation for the accumulated rewards of
stationary renewal-reward processes in discrete or continuous time. If
time permits, the results will be applied to a simple example: the
number of overlapping runs of 1s in a Markov chain on the state space
{0,1}.
____________
BROAD AREA COLLOQUIUM
on Wednesday, 19 January 2000, 4:15pm to 5:15pm
TCseq201 (Lecture Hall B)
http://robotics.stanford.edu/ba-colloquium/#Schedule
Learning Bayesian Networks
David Heckerman
Microsoft Research
For two decades, Bayesian networks--also known as directed acyclic
graphical models, belief networks, and causal networks--have been used
in intelligent systems with a fair amount of success. With few
exceptions, system builders have constructed Bayesian networks by
directly encoding the knowledge of experts. Data sets have rarely been
used in the construction process. One drawback of this knowledge-based
approach is that knowledge elicitation can be expensive. More
recently, however, researchers have developed techniques for
constructing Bayesian networks (both parameters and structure) from a
combination of expert knowledge and data. These methods can
significantly reduce the cost of building an intelligent system in
domains where data is readily available. In addition, these techniques
can be used to identify causal relationships from non-experimental
data--an important breakthrough for science. I my talk, I will
describe several applications of this work being addressed at
Microsoft and briefly review the technology.
About the Speaker:
David Heckerman is a Senior Researcher at Microsoft Research and
manager of the Machine Learning and Applied Statistics Group. He is a
co-creator of Answer Wizard for Office 95, Office Assistant for Office
97, troubleshooters for online support and Windows 98, and Intelligent
Cross Sell for Commerce Server. Heckerman received his Ph.D. and
M.D. degrees from Stanford University.
____________
STATISTICS SEMINAR
on Wednesday, 19 January 2000, 4:15pm
Sequoia Hall 200
http://www-stat.stanford.edu/seminars/seminars.html
Minimax Deconvolution in MirrorWavelet Bases
Stephanie Mallat
Ecole Polytechnique, Paris
Thresholding algorithms in an orthonormal basis are studied to
estimate signals degraded by a linear operator whose inverse is not
bounded. Deconvolutions with transfer functions having a zero at high
frequencies are examples of such unstable inverse problems. A ``mirror
wavelet'' basis is constructed to obtain a deconvolution risk
asymptotically equivalent to the minimax risk for bounded variation
signals. This mirror wavelet thresholding estimator is currently used
by the French spatial agency to restore satellite images.
____________
ARCHIMIDES PROJECT (CSLI)
on Thursday, 20 January 2000, 12:00pm
Cordura 100
http://www-csli.stanford.edu/arch/simmons.htm
A Practical System for Creating Collective IQ
John Simmons
ShowLab
Simmons presents a working system for creating Collective IQ in the
form of a scaleable online community built around a new library of
open technologies and a full range of collaborative tools that are
web-delivered and web-administered. On a Unix platform, Simmons
combines AOLServer, Oracle 8i, the ArsDigita Community System with
custom features that allow the user to navigate the library and
measure the participation of community members. The system's
coordination technology works with 3 types of content: library content
gathered and presented by ShowLab, collaborative contributions added
to the site by community members, and finely tuned feedback &
instructions to encourage forward progress. The online environment can
be used for rapidly expanding a multidisciplinary research group,
developing new products, designing new business models, assembling a
technology portfolio for a new venture, or for distance learning.
____________
STANFORD ALGORITHMS SEMINAR
on Thursday, 20 January 2000, 4:15pm
Gates 498
http://Theory.Stanford.EDU/~aflb/1999-00.html
Testing and Spot-Checking of Data Streams
Martin Strauss
AT&T Research
We consider the tasks of testing and spot-checking for data
streams. These testers and spot-checkers are potentially useful in
real-time or near real-time applications that process huge
datasets. Crucial aspects of the computational model include the space
complexity of the testers and spot-checkers (ideally much lower than
the size of the input stream) and the number of passes that the tester
or spot-checker must make over the input stream (ideally one, because
the original stream may be too large to store for a second pass). A
sampling-tester [Goldreich-Goldwasser-Ron] for a property P samples
some (but usually not all) of its input and, with high probability,
outputs PASS if the input has property P and FAIL if the input is
far from having P, for an appropriate sense of "far." A
streaming-tester for a property P of one or more input streams takes
as input one or more data streams and, with high probability, outputs
PASS if the streams have property P and FAIL if the streams are far
from having P. A sampling-tester can make its samples in any order; a
streaming-tester sees the input from left to right. We consider the
groupedness property (a natural relaxation of the sortedness
property). We also revisit the sortedness property, first considered
in [Ergun-Kannan-Kumar-Rubinfeld-Viswanathan] in the context of
sampling spot-checkers, and the property of detecting whether one
stream is a permutation of another (either directly or via the
SORTED-SUPERSET property, a technical property that is equivalent to
PERMUTATION under some conditions). We show that there are properties
efficiently testable by a streaming-tester but not by a
sampling-tester and other (promise) problems for which the reverse is
true.
This talk presents joint work with Joan Feigenbaum, Sampath Kannan,
and Mahesh Viswanathan. It will appear at the SODA'00 conference. A
full paper is available.
____________
STANFORD LINGUISTICS COLLOQUIUM
on Friday, 21 January 2000, 3:30pm
Building 460:126
http://www-linguistics.stanford.edu/Linguistics/colloq/
Constituting Morality and Accountability in Girls'
Social Organization through Embodied Language Practices
Marjorie Goodwin
University of California, Los Angeles
It has been consistently argued that gender differences exist in moral
development, with boys displaying a greater grasp of complex rules,
while girls reputedly live in simpler social worlds marked by
harmony. Piaget's work on children's games posited a less developed
legal sense in girls than in boys and continued with Gilligan's
portrayal of females speaking in "a different voice." My presentation
challenges the notion that girls have little concern with issues of
justice by examining the embodied multi-modal forms of argumentation
which occur in the midst of girls' games such as hop scotch, four
square, and jump rope. Turn shape, intonation, body positioning and
accounts are all critical to the construction of stance. Players can
make use of heightened pitch, vowel lengthening, and raised volume to
vocally highlight opposition in the preface of opposition turns. Girls
evaluate the conduct of their fellow players and form judgments of
their character based on the way they handle themselves in game
disputes. A second part of the talk examines how girls practice forms
of exclusion, constructing a "tagalong" girl as deviant, in the midst
of activities such as games , ritual insult sequences, and telling
stories. While traditional studies of morality have studied what
people can propositionalize, I argue that by examining the practices
that make up the life world of a particular group we can investigate
how morality is lodged within the actions and stances that girls take
up in interaction with their peers. This study is based on fieldwork
conducted among a number of different groups of comparable ages,
including a peer group of fifth grade working class second generation
Spanish/English speakers and Asian-American girls in a downtown Los
Angeles school, a clique of girls of diversity ethnicities and social
classes in a middle class neighborhood of Los Angeles followed over
three years (fourth to sixth grade), and Black working class fifth
grade girls from Philadelphia and the rural South.
____________
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.
____________