[Date Prev][Date Next][Date Index]
CSLI Calendar, Wednesday, 15 January 2003, vol. 18:16
CSLI CALENDAR OF PUBLIC EVENTS
______________________________________________________________________
15 January 2003 Stanford Vol. 18, No. 16
______________________________________________________________________
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 15 JANUARY 2003 TO 24 JANUARY 2003
WEDNESDAY, 15 JANUARY 2003
3:00pm Reuters Foundation Digital Vision Program Seminar
mailto:digitalvision@csli.stanford.edu for location
Brian Tucker
GeoHazards International
http://reuters.stanford.edu/seminar_speakers.html
Information below
3:45pm Psychology Department Colloquium
Jordan Hall 420:041
Childhood Anxiety: Parent-Child Communication as a Change Mechanism
Jeffrey Woods
UCLA
(Developmental Job Candidate)
http://www-psych.stanford.edu/news.html
4:15pm EE380: Computer Systems Lab Colloquium
Gates B03 (NEC Auditorium)
Complex Event Processing: An Essential Technology for Instant
Insight into the Operation of Enterprise Information Systems
David Luckham
Electrical Engineering, Stanford
http://ee380.stanford.edu/contents.html
Abstract below
THURSDAY, 16 JANUARY 2003
11:00am Music 319: CCRMA Hearing Seminar
CCRMA Library, The Knoll
Initial meeting
http://mambo.ucsc.edu/psl/ccrmas/ccrmas.html
Information below
12 noon CSLI CogLunch
Cordura Hall, Room 100
Mirror Neurons, Simulation Semantics, and the Neural Theory of Language
George Lakoff
UC Berkeley
http://www-csli.stanford.edu/events/Coglunch/
Abstract below
4:00pm PARC Forum
George Pake Auditorium at PARC
The Speech Level Singing Method
- Tools and Tricks for Artistic Vocal Development
Dave Stroud
Professional Vocal Instructor
http://www.parc.com/forum/
4:15pm CSLI Seminar on Computational Learning and Adaptation
Cordura Hall, room 100
Genes, tumors, and Bayes Nets: Improving the specificity of
biological signal detection in microarray analysis
Olga Troyanskaya
Medical Informatics, Stanford
http://cll.stanford.edu/scla.html
Abstract below
4:15pm SSP10: Symbolic Systems Forum
Bldg. 380:380C (Math Corner)
Considerations Regarding Human-Level Artificial Intelligence
Nils J. Nilsson
Robotics Laboratory, Computer Science, Stanford
http://symsys.stanford.edu:8081/ssp-dynamic/servlet/ssp_events
Abstract below
4:15pm History of Science Colloquium
Bldg. 200:307
Metaphors and Bacteria under the Microscope: A Doctoral Study in
the Field of Philosophy and Early Bacteriology"
Marianna Haenseler
visiting from the University of Zurich
http://www.stanford.edu/dept/HPS/colloquia.html
4:15pm Neurobiology of Disease Seminar Series
Munzer Auditorium, Beckman B060
Sleep, Narcolepsy and Hypocretins
Emmanuel Mignot
Stanford University
http://www-med.stanford.edu/sbrc/calendar/
FRIDAY, 17 JANUARY 2003
12 noon Logical Methods in the Humanities
Bldg. 380:383N (math corner)
Some Logical Properties of Natural Language Quantifiers
Edward Keenan
University of California, Los Angeles
http://www-logic.stanford.edu/seminars.html
Abstract below
12:30pm CS547: Human-Computer Interaction Seminar
Gates B03
The How And Why of Google UI
Marissa Mayer
Google
http://www-pcd.stanford.edu/cs547/
3:15pm Philosophy Department Colloquium
Bldg. 90:92Q
Unity of Consciousness and the Self
David Rosenthal
CUNY
http://www-philosophy.stanford.edu/ce.html
3:30pm Linguistics Department Colloquium
Margaret Jacks Hall 460:126
The search for historical African American English:
Evidence from Mississippi-in-Africa
John Victor Singler
New York University
http://www-linguistics.stanford.edu/colloq/
Abstract below
4:15pm CS545: Database Seminar
Gates B12
The Evolution of Business Integration: from Data to Process
Dale Skeen
Vitria Technologies
http://www-db.stanford.edu/dbseminar/
Abstract below
MONDAY, 20 JANUARY 2003 - UNIVERSITY HOLIDAY
TUESDAY, 21 JANUARY 2003
4:15pm Logic Seminar
Bldg. 380:381T (math corner)
Complexity of semi-algebraic propositional proof systems
Edward A. Hirsch
Steklov Institute of Mathematics, St. Petersburg
http://www-logic.stanford.edu/seminars.html
Abstract below
6:30pm Film
Cubberley Auditorium
Ada Byron Lovelace: To Dream Tomorrow
directed by John Fuegi and Jo Francis
(free, reception followed by film at 7:00pm)
http://www.computer.org/annals/an2002/extras/a405602x.htm
WEDNESDAY, 22 JANUARY 2003
10:00am UC Berkeley Seminar
Intel Research Berkeley, 2150 Shattuck, Ste 1300 (UC Berkeley)
IrisNet: Building Internet-Scale Sensor Using Brilliant Rocks
Phillip B. Gibbons
Intel Research Pittsburgh
http://buffy.eecs.berkeley.edu/Seminars/
3:00pm Reuters Foundation Digital Vision Program Seminar
email for location mailto:digitalvision@csli.stanford.edu
Chris Handley
Chief Information Officer, Stanford University
http://reuters.stanford.edu/seminar_speakers.html
3:45pm Psychology Department Colloquium
Jordan Hall 420:041
Functional MRI of visual cortex:
Binocular rivalry, perceptual learning, and letter recognition
Steve Engel
UCLA
http://www-psych.stanford.edu/news.html
4:15pm EE380: Computer Systems Lab Colloquium
Gates B03 (NEC Auditorium)
Solving High Technology Crime
San Francisco Electronic Crimes Task Force
http://ee380.stanford.edu/contents.html
Abstract below
THURSDAY, 23 JANUARY 2003
12:15pm Stanford Networking Seminar
Gates 104
Clarifying the Fundamentals of HTTP
Jeff Mogul
HP Labs
http://netseminar.stanford.edu/
Abstract below
4:00pm Personality Seminar
Jordan Hall 420:100
Title to be announced
Larissa Tiedens,
Stanford GSB
http://www-psych.stanford.edu/news.html#person_lab
4:00pm PARC Forum
George Pake Auditorium at PARC
20,000 Bytes Under the Sea
Emory Kristof
Photographer-in-Residence, National Geographic Society
http://www.parc.com/forum/
4:00pm UC Berkeley CIS Seminar
Soda Hall 310 (UC Berkeley)
Generalized Principal Component Analysis (GPCA): an analytic
approach to segmentation of static and dynamics scenes
Rene Vidal
UC Berkeley
http://www.cs.berkeley.edu/~eyal/cis-seminar
Abstract below
4:15pm CSLI Seminar on Computational Learning and Adaptation
Cordura Hall, room 100
Boosting with Averaged Weight Vectors
Nikunj Oza
Computational Science Division, NASA Ames Research Center
http://cll.stanford.edu/scla.html
Abstract below
4:15pm SSP10: Symbolic Systems Forum
Bldg. 380:380C (Math Corner)
Instructive Signals in the Brain
Jennifer Raymond
Neurobiology, Stanford University
http://sbrc.stanford.edu/faculty/sbrc_fac_list/raymond.html
http://symsys.stanford.edu:8081/ssp-dynamic/servlet/ssp_events
Abstract below
4:15pm Neurobiology of Disease Seminar Series
Munzer Auditorium, Beckman B060
Insights into the Neuropathology of Schizophrenia
Edward G. Jones
UC Davis
http://www-med.stanford.edu/sbrc/calendar/
FRIDAY, 24 JANUARY 2003
12:30pm CS547: Human-Computer Interaction Seminar
Gates B03
Issues in Personalizing Shared Ubiquitous Devices
David Hilbert and Jonathan Trevor
FX Palo Alto Laboratory
http://www-pcd.stanford.edu/cs547/
3:15pm Friday Cognitive Seminar
Jordan Hall 420:100
Perception of Action
Elizabetta Zibetti
http://www-psych.stanford.edu/news.html#frisem
3:30pm Semantics and Pragmatics Workshop
Margaret Jacks Hall 460:126
Thoughts on semantic universals and semantic variation
Lisa Matthewson
British Columbia
http://www-linguistics.stanford.edu/semgroup/
Abstract below
4:15pm CS545: Database Seminar
Gates B12
Incremental Validation of XML Databases
Yannis Papakonstantinou
U.C. San Diego
http://www-db.stanford.edu/dbseminar/
Abstract below
____________
Stanford Blood Center status: Critical shortage of O+, O-, and A+; a
shortage of 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
The Media X Program at Stanford University announces availability of
funding for research about interactive technologies related to
learning and training. Proposals may be for funding of up to $75K for
one year. Multi-year projects will be considered, but funding will be
allocated only one year at a time.
The aim of this initiative is to promote research on the integration
of technology and an understanding of human psychology and social
behavior in the hope of creating innovations in learning and training
for enhancing understanding and performance.
Proposed research should address issues related to fundamental
technologies and human uses and effects, and be theoretically
generative. Examples of relevant research topics include but are not
limited to socially engaging learning guides, immersive technology
relevant to learning environments, training simulations, application
of gaming technologies to learning and training, and conversational
interfaces related to learning environments.
Proposals of no more than five pages should be submitted
electronically in PDF format by January 31, 2003 and sent to Keith
Devlin at:
devlin@csli.stanford.edu
Proposal should include a description of the proposed project and how
the project relates to a larger program of research, vita for faculty
and/or senior research staff who will work on the project, and a
detailed budget. Expenses may include (but are not limited to)
research assistants and/or post docs, travel, equipment, data
collection expenses, and faculty and research staff salaries.
Media X had adopted a standard format ("Quadchart") for describing
funded projects on its website. See
http://mediax.stanford.edu/projects/fidget.html
for an example. Your proposal cover page should provide four short
paragraphs that could form the basis of a quadchart for your proposal,
if funded. (Quadchart formatting is not required.)
Selection will be based on the scientific merit of the proposed
project and on any current or possible applications of the research
that may be of interest to industrial sponsors of Media X research, so
proposers should address both issues in their proposals. Project PIs
must be full-time Stanford employees.
Awards will be announced by February 21. Funding will be available
immediately thereafter.
For information about Media X see: http://mediax.stanford.edu/
Address inquiries about budget arrangements by electronic mail to
Najwa Salame at salame@csli.stanford.edu.
Address all other inquiries by electronic mail to Keith Devlin at
devlin@csli.stanford.edu.
Please note: In order to process applications within our tight time
frame, only proposals submitted electronically in PDF format can be
accepted. The five page limit includes the budget and any vita
information.
____________
REUTERS FOUNDATION DIGITAL VISION PROGRAM SEMINAR
on Wednesday, 15 January 2003, 3:00pm-4:30pm
email to check location and time mailto:digitalvision@csli.stanford.edu
http://reuters.stanford.edu/seminar_speakers.html
Brian Tucker
MacArthur Fellow, Disaster Prevention Specialist /
Seismologist, Founder and President GeoHazards International
Brian Tucker is a seismologist whose work focuses on preventing
readily available disasters in the world's poorest countries by using
affordable civil engineering practices. He founded GeoHazards
International (GHI) after recognizing that multi-story residences,
schools, hospitals, stores, and offices built from adobe, stone, or
unreinforced masonry in many regions of the world are death traps when
earthquakes strike. GHI is the only not-for-profit, non-governmental
agency dedicated to preventing structural failures in developing
countries. Tucker works on-site with local governments, artisans, and
citizens to implement cost-effective measures to construct or upgrade
schools and other public service buildings and to educate residents
about damage-prevention measures. He is an expert at adapting
techniques used by developed countries in risk mitigation projects so
that they fit within the social, political, and economic constraints
of at-risk communities in the developing world. GHI's principal focus
on schools is particularly important because their typically poor
construction makes them a common source for earthquake casualties. His
current work to develop and apply a Global Earthquake Risk Index is
designed both to estimate risk and to motivate risk-reduction
measures. His efforts have dramatically reduced the potential for
death and injury to children and others from earthquakes in vulnerable
cities around the world.
Brian Tucker received a B.A. (1967) from Pomona College, a Ph.D.
(1975) from the Scripps Institution of Oceanography at the University
of California, San Diego, and an M.A. (1991) in Public Policy from
Harvard University. Tucker served as Principal and Supervising
Geologist at the California Division of Mines and Geology (1982-1992).
In 1991, he founded GeoHazards International. Tucker is a consulting
professor in the Department of Civil Engineering at Stanford
University, and is a member of the editorial board of The Journal of
Earthquake Engineering as well as the board of the World Seismic
Safety Initiative.
____________
EE380: COMPUTER SYSTEMS LAB COLLOQUIUM
on Wednesday, 15 January 2003, 4:15pm to 5:30pm
NEC Auditorium (B03), Gates Computer Science Building
http://ee380.stanford.edu/contents.html
Complex Event Processing:
An Essential Technology for Instant Insight into the Operations of
Enterprise Information Systems
David Luckham
Electrical Engineering, Stanford
"Instant Insight is a breakthrough analysis of electronic commerce
you keep secret and use to beat rivals" - Grover Ferguson (Chief
Scientist, Accenture - Wall Street Journal, Sept 27 2002) .
The enterprise information technology (IT) infrastructure has been
called "an event-driven nervous system". Complex Event Processing
(CEP) is an emerging technology for coping in realtime with the tasks
of managing the IT infrastructures of large electronic enterprises.
This includes a spectrum of management tasks such as effective control
of eBusiness supply chains, monitoring internet-based enterprise
collaborations by means of high level business events, autonomous
regulation of eMarketplaces, and Cyber defense of our national IT
infrastructures. At present we do none of these tasks well. And
effective solutions to any of them present an enormous business
opportunity.
All of these management tasks have in common the need to aggregate
high level intelligence from the lower layers of the enterprise
nervous system. CEP is a technology to track causality between events,
and to aggregate complex high level events from sets of lower level
events. CEP enables us to understand what activities are taking place
in our IT systems. That is, we gain instant insight into how those
activities will affect critical functionality of the enterprise. Only
then can we take effective action, or succinctly and correctly express
automated rules to manage the electronic enterprise.
This seminar will deal with the WHY and WHAT of CEP: why there is a
need for new technologies to manage electronic enterprises, and what
those technologies must enable us to do. The basic concepts of CEP
will be introduced, including basic events and complex events, common
relationships between events, event patterns and hierarchies of
events.
The HOW of CEP, how to build it, will be deferred to other
discussions.
About the speaker: David Luckham has held faculty and invited faculty
positions in mathematics, computer science and electrical engineering
at eight major universities in Europe and the United States. He was
one of the founders of Rational Software Inc. in 1981, supplying both
the company's initial software product and the software team that
founded the company. He has been an invited lecturer, keynote speaker,
panelist, and USA delegate at many international conferences and
congresses. Currently, he is Professor Emeritus of Electrical
Engineering, Stanford University. His research and consulting
activities in software technology include multi-processing,
event-based simulation languages and systems, and Complex Event
Processing. He has published four books and over 100 technical papers;
two ACM/IEEE Best Paper Awards, several of his papers are now in
historical anthologies and book collections. His latest book, "The
Power of Events", deals with the foundations of complex event
processing in distributed enterprise systems.
____________
MUSIC 319: CCRMA HEARING SEMINAR
on Thursday, 16 January 2003, 11:00am
CCRMA Library, The Knoll
http://mambo.ucsc.edu/psl/ccrmas/ccrmas.html
(From Malcolm Slaney)
The Hearing Seminar (Music 319) returns to Stanford.
I wanted to let students know that they can take Music 319 for one or
more hours of credit this winter quarter. One hour of credit for
attending most lectures. More hours for extra work. Send me email
(Malcolm Slaney, malcolm@ieee.org), or stop by the CCRMA library next
Thursday at 11AM to get things started. Sign up now.
We've got a great set of speakers lined up for the quarter. I think
these are all wonderful people, each with something interesting to
teach those of us interested in audio. As usual with the Hearing
Seminar, we expect great discussions and lots of good audio.
Malcolm Slaney (IBM) Audio clustering/semantic retrieval
David Huron (OSU) Musical Expectations
Eric Baugh (Hitachi) Disk Drive Noise
Bernard Mont-Reynaud (Sony) High-end audio equipment
Karon MacLean (UBC) Haptic Icons (related to earcons)
Brent Edwards (SoundID) Speech Enhancement
Richard Duda (UCDavis) TBD (Binaural sound)
And a bunch more ideas that I can't announce yet.
If you want to hear about these talks, add yourself to the mailing
list by sending email to
hearing-seminar-request@ccrma.stanford.edu
with the word subscribe in the message.
Keep your Thursday mornings open (at 11AM). See you at CCRMA. Bring your
favorite set of ears.
____________
CSLI COGLUNCH
on Thursday, 16 January 2003, 12 noon-1:30pm
Cordura Hall, Room 100
http://www-csli.stanford.edu/events/Coglunch/
The Brain's Concepts
Mirror Neurons, Simulation Semantics, and the Neural Theory of Language
George Lakoff
Linguistics, University of California, Berkeley
A discussion of recent collaborative work with Vittorio Gallese (of
the mirror neuron group in Parma) on the direct role of the
sensory-motor system in characterizing concepts - including abstract
concepts like freedom, love, or causation.
The talk is set with the Neural Theory of Language now being developed
at Berkeley. It discusses how semantics can be based on neural
simulation, with neural computational models provided via
Feldman-Narayanan structured connectionist models, and natural
language semantics provided via cognitive semantics.
There are two parts to the talk. The first contradicts the idea that
all concepts are "abstractions" in the sense that they must be
represented in the brain independently of the sensory-motor system.
It traces thoroughly through one example where enough is known about
the neuroscience, the neural computation, and the linguistics to
argue that the brain's sensory-motor system can fully characterize
the properties of the given concept.
The second part takes up the role of conceptual metaphors and "Cogs"
in adapting the sensory-motor system to characterize the meanings of
abstract concepts. The idea of "Cogs" is new, and central to how the
sensory-motor system can characterize the semantics of grammar.
Included is the idea of "dissociative learning" - the use of neural
inhibition to produce conceptual and linguistic generalizations from
exemplars.
The point of the talk is to cash out the idea of embodied meaning,
presented in the speaker's earlier work and underlying current
research on the neural theory of language.
Talk starts at 12:10pm. Burritos will be available for purchase at
noon if you forget your lunch.
____________
CSLI SEMINAR ON COMPUTATIONAL LEARNING AND ADAPTATION
on Thursday, 16 January 2003, 4:15pm to 5:30pm
Cordura 100
http://cll.stanford.edu/scla.html
Genes, tumors, and Bayes Nets: Improving the specificity of
biological signal detection in microarray analysis
Olga Troyanskaya
Biomedical Informatics and Genetics, Stanford
Microarray analysis allows for large-scale exploration of gene
expression by taking a snap shot of the cell at a specific point in
time. Such datasets may provide insight into fundamental biological
questions as well as address clinical issues such as diagnosis and
therapy selection. The resulting data are complex and challenging to
analyze without sophisticated computational tools. This seminar will
highlight the issue of improving the specificity of biological signal
detection from microarray data. I will present robust and accurate
algorithms for missing value estimation for microarray data and for
identification of differentially expressed genes from gene expression
datasets. This talk will also address gene function prediction and
present a Bayesian framework for integrated analysis of gene
expression data with datasets from other high-throughput biological
data sources.
____________
SSP10: SYMBOLIC SYSTEMS FORUM
on Thursday, 16 January 2003, 4:15pm
Bldg. 380:380C (Math Corner)
http://symsys.stanford.edu:8081/ssp-dynamic/servlet/ssp_events
Considerations Regarding Human-Level Artificial Intelligence
Nils J. Nilsson
Robotics Laboratory, Computer Science, Stanford University
http://www.robotics.stanford.edu/users/nilsson/bio.html
AI researchers have several overlapping objectives. Among these are:
to build systems that aid humans in intellectual tasks; to build
agents that can function autonomously in circumscribed domains; to
build a general science of intelligence as manifested in animals,
humans, and machines; and to build versatile agents with human-level
intelligence or beyond. Some considerations regarding human-level AI
are described in my essay available at:
http://www.robotics.stanford.edu/users/nilsson/hlai.ps
Participants in this SSP Forum will be encouraged to discuss with the
author the claims made in the essay.
About the speaker: Nils J. Nilsson, Kumagai Professor of Engineering
(Emeritus) in the Department of Computer Science at Stanford
University, received his PhD degree in Electrical Engineering from
Stanford in 1958. He spent twenty-three years at the Artificial
Intelligence Center of SRI International working on statistical and
neural-network approaches to pattern recognition, co-inventing the A*
heuristic search algorithm and the STRIPS automatic planning system,
directing work on the integrated mobile robot, SHAKEY, and
collaborating in the development of the PROSPECTOR expert system. He
has published five textbooks on artificial intelligence. Professor
Nilsson returned to Stanford in 1985 as the Chairman of the Department
of Computer Science, a position he held until August 1990. Besides
teaching courses on artificial intelligence and on machine learning,
he has conducted research on flexible robots that are able to react to
dynamic worlds, plan courses of action, and learn from experience.
Professor Nilsson served on the editorial boards of the journal
Artificial Intelligence and of the Journal of Artificial Intelligence
Research. He was an Area Editor for the Journal of the Association for
Computing Machinery. He is a past-president and Fellow of the
American Association for Artificial Intelligence and is also a Fellow
of the American Association for the Advancement of Science. He was a
founding director of Morgan Kaufmann Publishers, Inc. In 1993, he was
elected a foreign member of the Royal Swedish Academy of Engineering
Sciences.
____________
LOGICAL METHODS IN THE HUMANITIES
on Friday, 17 January 2003, 12 noon-1:15pm
Math Corner 380:383N
http://www-logic.stanford.edu/seminars.html
Some Logical Properties of Natural Language Quantifiers
Edward Keenan
University of California, Los Angeles
We discuss and illustrate (some of) the following logical properties
of quantification in natural language (NL):
1. Natural classes of NL Determiners: intersective (INT; generalized
existential), co-intersective (CO-INT; generalized universal),
proportional; "presuppositional"
2. The fundamental role of the (co-)intersective classes:
(1) the boolean closure of INT union CO-INT is the set of
conservative (CONS) quantifiers;
(2) CONS is a universal property of NL quantifiers (with possibly
two exceptions): CONS (Keenan) + EXTENSIONS (Van Benthem) =
Domain Independence
(3) a quantifier is sortally reducible iff it is intersective or
co-intersective (so restricting the range of "the variable" is
an essential feature of NL quantification, given the existence
of non-((CO)-INT quantifiers).
3. Non-Fregean Quantifiers:
(1) n>1-ary quantifiers that are not reducible to iterated
application of unary quantifiers.
(2) A new entailment paradigm for reducible quantifiers
4. Characterizing syntactic classes of NPs:
(1) Those licensing nagative polarity items are the monotone
decreasing NPs
(2) Those occurring in Existential There Ss are those built from
CONS(2) Dets
(3) DPs occurring in the post of- position in partitives are those
denoting principal filters
Reading: E.L. Keenan "Some Properties of Natural Language
Quantifiers" in Linguistics and Philosophy vol 25: Nos 5-6. pp. 627-654
____________
LINGUISTICS DEPARTMENT COLLOQUIUM
on Friday, 17 January 2003, 3:30pm
Margaret Jacks Hall, Room 460:126
http://www-linguistics.stanford.edu/colloq/
The search for historical African American English:
Evidence from Mississippi-in-Africa
John Victor Singler
New York University
What can the language in enclaves today in the African American
diaspora tell us about the history of African American English (AAE)?
My talk focuses on the language of the descendants of the 16,000
African Americans who immigrated to Liberia in the nineteenth century.
It concentrates on the Liberian Settler English of Sinoe (LSE-S), a
county that was originally established as Mississippi-in-Africa in
1838.
Recognizing the provenance of particular features in LSE-S is rarely
problematic. For example, the distribution of LSE-S features both in
other varieties of English and within LSE-S itself makes it possible
to identify (a) below as a feature that the Sinoe Settlers brought
with them from America and (b) as a post-immigration borrowing.
a. The habitual AUX 'dor'
'Government pay me for true. I dor get check.'
b. The non-punctual AUX 'de'
'Every year, it de be a disease comes on the chicken.'
However, to extrapolate historical AAE from a modern variety from an
African American diaspora enclave, one must consider two sociohistorical
questions:
1. What kind of AAE did the original African American emigrants speak?
2. What factors in the history of a particular enclave community might
have moved that community's language away from the language that the
original emigrants had brought with them from the US?
(It is their failure to provide historically informed answers to
these two questions that crucially undermines the work on African
American enclave varieties in the Dominican Republic and Canada by
Poplack (2000) and Poplack & Tagliamonte (2001).) I present the
demographics of the original Sinoe Settlers (80% came from the Lower
South) and then argue that the forces and factors likely to push LSE-S
closer to Standard English, while not non-existent, were weaker than
was true elsewhere. At the same time, I argue that ongoing hostility
between the Sinoe Settlers and their indigenous neighbors as well as
the status differential between the two groups sharply limited
influence upon LSE-S from local languages -- including the pidginized
English vernacular of the West African coast.
I apply the LSE-S evidence to the two controversies that dominate the
study of African American English: the convergence/divergence and
creolization/dialectology debates.
____________
CS545: DATABASE SEMINAR
on Friday, 17 January 2003, 4:15pm - 5:15pm
Gates B12
http://www-db.stanford.edu/dbseminar/
The Evolution of Business Integration: from Data to Process
Dale Skeen
Vitria Technologies
From synchronizing your PDA to the semantic web, the problems of
integration are pervasive and limit the usefulness of complex
computing systems. Traditionally, research has focused on integrating
data semantics, but with the rise of Internet e-business and Web
Services, attention is turning more toward orchestrating and
integrating behaviors (a "business process") toward a common goal
across multiple parties. In this seminar, we discuss how integration
technology has evolved to support these new objectives. We will also
discuss the future of integration in face of the ultimate integration
objective: supporting large-scale collaborative networks of trading
partners that are capable of dynamic discovery, integration, and
adaptation.
About the speaker: Dale Skeen is co-founder and CTO of Vitria
Technology, a pioneer in integration technology. He has over 15 years
experience in designing and integrating large-scale, distributed
computing systems for some of the world's largest corporations. Prior
to Vitria, Skeen co-founded TIBCO, where he served as Chief
Scientist. Skeen has held faculty positions at Cornell University and
the University of California, Berkeley, where he received his Ph.D. in
distributed database systems.
____________
LOGIC SEMINAR
on Friday, 21 January 2003, 4:15pm-5:30pm
Math Corner 380:381T
http://www-logic.stanford.edu/seminars.html
Complexity of semi-algebraic propositional proof systems
Edward A. Hirsch
Steklov Institute of Mathematics, St. Petersburg
We study proof systems for propositional formulas encoded by
polynomial inequalities. These proof systems turn out to be rather
strong: there are short semi-algebraic proofs of the propositional
pigeon-hole principle, Tseitin's tautologies and other "hard"
formulas. On the other hand, we are able to demonstrate exponential
lower bounds on the proof size in some of these systems.
____________
EE380: COMPUTER SYSTEMS LAB COLLOQUIUM
on Wednesday, 22 January 2003, 4:15pm to 5:30pm
NEC Auditorium (B03), Gates Computer Science Building
http://ee380.stanford.edu/contents.html
Solving High Technology Crime
Academic Partnership in Crime Fighting
Participants To Be Announced
San Francisco Electronic Crimes Task Force
The San Francisco Electronic Crimes Task Force seeks to engage the
academic community to help us address the technology crimes affecting
our community, our corporate partners and law enforcement. The crimes
affecting our corporate partners include computer hacking,
intellectual property crimes (criminal trademark and copyright
infringement) and identity theft. These crimes are costing the high
technology community billions of dollars and stunting the acceptance
and growth of these technologies to support our economy. Antiquated
investigative methods and poor individual accountability for Internet
communications are some of the greatest challenges facing law
enforcement. The solution to some of these challenges may lie within
the academic community.
The talk will focus on several brief case studies relating our
greatest challenges in fighting high technology crime. Each case study
will be presented by a law enforcement agent and/or corporate partner
of the task force.
About the speaker: The San Francisco Electronic Crimes Task Force is a
group of Federal, state, local investigators and corporate partners,
lead by the U.S. Secret Service, focused on attacking high technology
crime affecting Bay Area companies, locally and globally. The task
force is part of the Secret Service's nation-wide network of
electronic crimes task forces, see http://www.ectaskforce.org .
____________
STANFORD NETWORKING SEMINAR
on Thursday, 23 January 2003, 12:40pm (lunch 12:15pm)
Gates 104
http://netseminar.stanford.edu/
Clarifying the Fundamentals of HTTP
Jeff Mogul
HP Labs
The simplicity of HTTP was a major factor in the success of the Web.
However, as both the protocol and its uses have evolved, HTTP has
grown complex. This complexity results in numerous problems, including
confused implementors, interoperability failures, difficulty in
extending the protocol, and a long specification without much
documented rationale.
Many of the problems with HTTP can be traced to unfortunate choices
about fundamental definitions and models. I will analyze the current
(HTTP/1.1) protocol design, showing how it fails in certain cases, and
how to improve these fundamentals. Some problems with HTTP can be
fixed simply by adopting new models and terminology, allowing us to
think more clearly about implementations and extensions. Other
problems require explicit (but compatible) protocol changes.
About the speaker: Jeffrey C. Mogul received an S.B. from the
Massachusetts Institute of Technology in 1979, an M.S. from Stanford
University in 1980, and his PhD from the Stanford University Computer
Science Department in 1986. Dr. Mogul has been an active participant
in the Internet community, and is the author or co-author of several
Internet Standards; he contributed extensively to the HTTP/1.1
specification. From 1986 to 2002, he was a researcher at Digital's
(and Compaq's) Western Research Laboratory, and is now at HP Labs,
working on network and operating systems issues for large-scale
computer systems, and on improving performance of the Internet and the
World Wide Web. Jeff is a Fellow of the ACM, and a member of Sigma Xi
and CPSR. He was Program Committee Chair for the Winter 1994 USENIX
Technical Conference, the IEEE TCOS Sixth Workshop on Hot Topics in
Operating Systems, and the Second Workshop on Industrial Experiences
with Systems Software.
____________
UC BERKELEY CIS SEMINAR
on Thursday, 23 January 2003, 4:00pm
Soda Hall 310 (UC Berkeley)
http://www.cs.berkeley.edu/~eyal/cis-seminar
Generalized Principal Component Analysis (GPCA):
An analytic approach to segmentation of static and dynamics scenes
Rene Vidal
UC Berkeley
Segmentation is usually though of as a "chicken-and-egg" problem. In
order to estimate a mixture of models one needs to first segment the
data and in order to segment the data one needs to know the model for
each class. Therefore, segmentation is usually solved in two-stages
(1) data clustering and (2) model fitting, or else iteratively using
the Expectation Maximization (EM) algorithm.
In this talk, we will show that for a wide class of segmentation
problems (mixtures of subspaces, eigenvector segmentation, mixtures of
affine models, mixtures of fundamental matrices), the
"chicken-and-egg" dilemma can be completely solved using
algebraic-geometric techniques. In fact it is possible to use all the
data simultaneously to recover all the models without previously
segmenting the data. In the absence of noise this can be done in
polynomial time using linear techniques. Furthermore the solution is
closed form if and only if the number of groups is less than or equal
to 4. In the presence of zero-mean Gaussian noise, the algebraic
solution leads to an optimal objective function that depends on the
model parameters and not on the segmentation of the data.
We present applications on intensity and motion (3D and affine) based
image segmentation, and compare with K-means and EM.
____________
CSLI SEMINAR ON COMPUTATIONAL LEARNING AND ADAPTATION
on Thursday, 23 January 2003, 4:15pm to 5:30pm
Cordura 100
http://cll.stanford.edu/scla.html
Boosting with Averaged Weight Vectors
Nikunj C. Oza
Computational Sciences Division, NASA Ames Research Center
AdaBoost is a well-known ensemble learning algorithm that constructs
its constituent or base models in sequence. A key step in AdaBoost is
constructing a distribution over the training examples to create each
base model. This distribution, represented as a vector, is constructed
to be orthogonal to the vector of mistakes made by the previous base
model in the sequence. The idea is to make the next base model's
errors uncorrelated with those of the previous model. Some researchers
have pointed out the intuition that it is probably better to construct
a distribution that is orthogonal to the mistake vectors of all the
previous base models, but that this is not always possible. We present
an algorithm that attempts to come as close as possible to this goal
in an efficient manner. We present results demonstrating significant
improvement over AdaBoost and the Totally Corrective boosting
algorithm, which also attempts to satisfy this goal.
____________
SSP10: SYMBOLIC SYSTEMS FORUM
on Thursday, 23 January 2003, 4:15pm
Bldg. 380:380C (Math Corner)
http://symsys.stanford.edu:8081/ssp-dynamic/servlet/ssp_events
Instructive Signals in the Brain
Jennifer Raymond
Neurobiology, Stanford University
http://sbrc.stanford.edu/faculty/sbrc_fac_list/raymond.html
Learning involves a change or set of changes in the brain. What are
the neural events that trigger such changes? Which neurons carry the
instructive signals that guide the cellular events underlying
learning? We are using a simple motor learning task as an
experimental system for exploring these questions.
____________
STANFORD SEMANTICS AND PRAGMATICS WORKSHOP
on Friday, 24 January 2003, 3:30pm
Margaret Jacks Hall 460:126
http://www-linguistics.stanford.edu/semgroup/
Thoughts on semantic universals and semantic variation
Lisa Matthewson
British Columbia
This talk tackles the following two-part question: What is universal
in semantics, and how can semantics vary cross-linguistically? Based
partly on two specific case studies (determiners and tense in Lillooet
Salish), and partly on conceptual reasoning, I'll put forward the
three claims in (1).
(1) i. In both syntax and semantics, our null hypothesis should be
that all languages are identical.
ii. Semantic variation is not necessarily tied to syntactic
variation; the former exists even in the absence of the latter.
iii. A theory that admits semantic parameters is more restrictive
than one which doesn't.
The basic idea is that semantic theory should not abdicate to
syntactic theory all responsibility for setting limits on variation.
Once we admit that semantics can vary in ways which do not necessarily
derive from differing syntactic structures, we can begin to articulate
constraints on semantic variation; we will then end up with a more
restricted theory of both semantics and syntax. Finally, the case
studies will also lead to the substantive claim given in (2).
(2) The inventory of functional projections is invariant
cross-linguistically; the lexical semantics of functional heads
varies cross-linguistically.
____________
CS545: DATABASE SEMINAR
on Friday, 24 January 2003, 4:15pm - 5:15pm
Gates B12
http://www-db.stanford.edu/dbseminar/
Incremental Validation of XML Databases
Yannis Papakonstantinou
U.C. San Diego
We discuss algorithmic and systems issues on the incremental schema
validation of XML databases with respect to DTDs, XML Schemas and
XQuery's type system under updates consisting of element tag
renamings, insertions and deletions. For DTDs we provide a worst-case
O(m log n) incremental validation algorithm using an auxiliary
structure of size O(n), where n is the size of the document and m is
the number of updates. Note that a brute force solution requires O(n)
steps: following an update, we run the updated lists of elements
through automatons that correspond to regular expressions in the
DTD. For XML Schemas and XQuery types, the problem is harder, since an
update to a single node may have global repercussions for the typing
of the tree. We provide a worst-case O(m log^2 n) algorithm that is
based on the use of tree automata and an O(n) auxiliary data
structure. Next we provide experimental results showing that for real
DTDs the worst case is relatively rare. Furthermore, we provide an
alternative auxiliary structure consisting of only a schema-dependent
set of counters for each list of elements in the database. This
auxiliary structure enables O(1) incremental validation in most cases,
using an algorithm that exploits a form of "locality".
About the speaker: Yannis Papakonstantinou serves on the Faculty of
Computer Science and Engineering at the University of California, San
Diego, since 1996. His research is in the intersection of database and
Internet technologies. Yannis has published over forty five research
articles in scientific conferences and journals, given tutorials at
major conferences, and served on journal editorial boards and program
committees for numerous international conferences and symposiums. He
was the co-Chair of WebDB 2002, is the General Chair of ACM SIGMOD
2003 and the Vice PC Chair for the "XML, Metadata and Semistructured
Data" track of IEEE ICDE 2004. In 1998, Yannis received the NSF CAREER
award for his work on integrating heterogeneous data. In 2000 Yannis
founded Enosys Software, which built the first generally available
distributed XQuery processor, along with software for XML-based
integration of distributed sources. Yannis holds a Diploma of
Electrical Engineering from the National Technical University of
Athens and MS and Ph.D. in Computer Science from Stanford University
(1997).
____________
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
____________