[Date Prev][Date Next][Date Index]
CSLI Calendar, Wednesday, 9 January 2008, vol. 23:16
CSLI CALENDAR OF PUBLIC EVENTS
______________________________________________________________________
9 JANUARY 2008 Stanford Vol. 23, No. 16
______________________________________________________________________
A weekly publication of the
Center for the Study of Language and Information (CSLI)
a subdivision of H-STAR, http://hstar.stanford.edu/
Stanford University, Cordura Hall, Stanford, CA 94305-4101
http://www-csli.stanford.edu/
____________
ACTIVITIES FROM 9 JANUARY 2008 TO 18 JANUARY 2008
WEDNESDAY, 9 JANUARY 2008
12:30pm Computer Science Talk [9-Jan-08]
AI Lab Fishbowl, Gates
"Coordination Mechanisms for Dynamic Multi-Agent Environments"
David C. Parkes
School of Engineering and Applied Sciences, Harvard University
Abstract below
3:30pm SRI CCB Seminar Series [9-Jan-08]
AE201, SRI International
"About Pathway Logic"
Carolyn Talcott
CSL, SRI
Abstract below
3:45pm Psychology Department Colloquium [9-Jan-08]
Jordan Hall 420:041
"Cognitive Limitations in Visual Perception and Memory"
Yuhong Jiang
University of Minnesota
http://www-psych.stanford.edu/events_colloquium.html
4:15pm EE380: Computer Systems Lab Colloquium [9-Jan-08]
Gates B01
"Tracking the Internet into the 21st Century"
Vinton G. Cerf
Google
http://ee380.stanford.edu/contents.html
Abstract below
6:30pm SF Bay ACM Data Mining SIG [9-Jan-08]
SAP LABS, Building D, 3410 Hillview Avenue, Palo Alto, CA
"Learning in Networks: from Spiking Neural Nets to Graphs"
Victor Miagkikh
Machine Learning Specialist, Cisco Systems, Inc.
http://sfbayacm.org/dmsig.php
Abstract below
THURSDAY, 10 JANUARY 2008
11:00am SRI AI Seminar Series [10-Jan-08]
EJ228, SRI International
"Automated Aides for Generating Scientific Insights"
Lawrence Hunter
University of Colorado at Denver
http://compbio.uchsc.edu/Hunter/
http://www.ai.sri.com/seminars/
Abstract below
3:45pm Psychology Department Colloquium [10-Jan-08]
Jordan Hall 420:041
"The Neuroscience of Social Connection"
John Cacioppo,
University of Chicago
http://www-psych.stanford.edu/events_colloquium.html
4:00pm PARC Forum [10-Jan-08]
George Pake Auditorium at PARC
"Social Dynamics in the Age of the Web"
Bernardo Huberman
HP Labs
http://www.hpl.hp.com/research/idl/people/huberman/
http://www.parc.com/forum/
Abstract below
4:15pm SSP10: Symbolic Systems Forum [10-Jan-08]
Bldg. 380:380C (Math Corner)
"Online Identity Theft and Internet Fraud"
John Mitchell
Computer Science, Stanford
http://symsys.stanford.edu/ssp_events
Abstract below
FRIDAY, 11 JANUARY 2008
12:30pm CS547: Human-Computer Interaction Seminar [11-Jan-08]
Gates B01
"Supporting the Visualization and Analysis of Network Events"
Doantam Phan
Computer Science, Stanford
http://hci.stanford.edu/cs547/
Abstract below
4:15pm CS545: Stanford-HP InfoSeminar [11-Jan-08]
Gates B03
"The five-minute rule twenty years later, and how flash memory
changes the rules"
Goetz Graefe
HP
http://infolab.stanford.edu/infoseminar/
Abstract below
8:00pm Mobile Phone Orchestra of CCRMA (Mo-PhOrCC) [11-Jan-08]
CCRMA Stage
http://ccrma.stanford.edu/concerts/c_schedule.html
MONDAY, 14 JANUARY 2008
12 noon Work, Technology and Organization Colloquium [14-Jan-08]
Terman 217
Title to be announced
Sinan Aral
Information, Operations and Management Sciences, NYU Leonard
N. Stern School of Business
http://www.stanford.edu/group/WTO/
TUESDAY, 15 JANUARY 2008
4:15pm ENGR110/210: Perspectives in Assistive Technology [15-Jan-08]
Meyer Library 124
"Universal Design & Designing for Accessibility"
Molly F. Story
Human Spectrum Design
http://www.stanford.edu/class/engr110/
WEDNESDAY, 16 JANUARY 2008
4:15pm EE380: Computer Systems Lab Colloquium [16-Jan-08]
Gates B01
Title to be announced
Dan Ingalls
SUN Microsystems
http://ee380.stanford.edu/contents.html
7:00pm San Francisco Ask A Scientist [16-Jan-08]
Axis Cafe, 1201 8th Street (btw. 16th & Irwin) San Francisco
"Where Did Language Come From?"
Terry Deacon
Biological Anthropology and Linguistics, UC Berkeley
http://anthropology.berkeley.edu/deacon.html
http://www.askascientistsf.com/
THURSDAY, 17 JANUARY 2008
12 noon CSLI CogLunch [17-Jan-08]
Cordura Hall 100
"Computation as Grammaticalization"
John Kadvany
Policy and Decision Science
http://www.johnkadvany.com/
http://www-csli.stanford.edu/events/Coglunch/
Abstract below
4:00pm PARC Forum [17-Jan-08]
George Pake Auditorium at PARC
"FREE: The past and future of a radical price"
Chris Anderson
Wired Magazine
http://www.parc.com/forum/
4:15pm SSP10: Symbolic Systems Forum [17-Jan-08]
Bldg. 380:380C (Math Corner)
Title to be announced
John Willinsky
http://symsys.stanford.edu/ssp_events
FRIDAY, 18 JANUARY 2008
12:30pm CS547: Human-Computer Interaction Seminar [18-Jan-08]
Gates B01
"How good Google searchers get to be that way"
Dan Russell
Google
http://hci.stanford.edu/cs547/
3:30pm Stanford Semantics and Pragmatics Workshop [18-Jan-08]
Margaret Jacks Hall 460:126
"Computing Linguistically-based Textual Inferences"
Danny Bobrow, Cleo Condoravdi, Lauri Karttunen, Tracy Holloway King,
Valeria de Paiva, and Annie Zaenen
PARC Natural Language Group
http://www-linguistics.stanford.edu/semgroup/
4:15pm CS545: Stanford-HP InfoSeminar [18-Jan-08]
Gates B03
"MonetDB/X100: a (very) fast column-store"
Peter Boncz
CWI
http://infolab.stanford.edu/infoseminar/
Abstract below
____________
Stanford Blood Center: Shortage of O+, O-, A-, B-, and AB-. For an
appointment: http://bloodcenter.stanford.edu/ or call 650-723-7831.
It only takes an hour of your time and you get free cookies.
____________
NOTES
Welcome back to the new year. CCRMA is starting off this Friday with
"an experimental ensemble concert featuring music performed on mobile
electronic devices including laptop computers and mobile phones. Far
beyond ring-tones, these interactive musical works take advantage of
the unique technological capabilities of today's hardware, turning
computer keyboards, touch-screens and built-in accelerometers into
powerful musical control systems." This is one concert where you
won't escape the mobile phones. Free, see
http://ccrma.stanford.edu/concerts/c_schedule.html for more
information.
Female computer science (or related fields) students (grad and
undergrad) may be interested in applying for the expenses paid 3 day
Google Workshop for Women Engineers in February. See
http://www.google.com/jobs/students/workshopforwomen
____________
ANNOUNCEMENT
Sixth Media X Annual Meeting
3-4 March 2008
Arrillaga Alumni Center
Stanford University
http://mediax.stanford.edu/invitation.html
Transformative Insights:
Participation, Collaboration and Virtual Worlds for Sustainability,
Medicine and Education
The challenges of the 21st Century are new, diverse, and urgent.
The 6th Media X Annual Meeting examines three broad topical areas,
plus three capabilities of rapid IT evolution. Stimulating, challenging,
provocative -- and above all, valuable and transformative!
Interdisciplinary research is vital to develop, understand and harness
nuanced learning from the edges into insights that transform new
solutions. Transformative insights from scholars and practitioners
together inform the development, application, usability, and adoption
of Information Technology (IT) and interactive media for renewal and
change.
Early Bird Registration (through January 31, 2008): $395.
Registration: $495.
Media X Members: $295.
Faculty: $145.
Students: $95.
Scholarships available to the first 100 students.
Registration information at http://mediax.stanford.edu/invitation.html
____________
COURSE ANNOUNCEMENTS
PHIL 352B Set Theory
(same as MATH 292B)
TTh 12:35-2:05 room 380-380W
First meeting January 8
Instructor: Sergei Tupailo
sergei.tupailo stanford.edu
This is a continuation of PHIL 352A / MATH 292A, in the Winter quarter
devoted exclusively to Constructibility and Forcing, i.e. Chapters VI,
VII and VIII of Kunen's book. First, in ZF we build the class L of
constructible sets, study its main properties, and show that ZF+AC+GCH
are true in L. Going into forcing, we will follow the general
approach based on partial orders.
I hope to go as far as the beginnings of iterated forcing, to the
extent of showing how GCH can be violated, in a prescribed manner, on
a finite set of regular cardinals.
Text: required
Kenneth Kunen, Set Theory: An Introduction to Independence Proofs,
Elsevier, 1980
Some copies are on reserve in Tanner Library and Math. Library
There will be one homework assignment (which you can think of as a
"take-home midterm"), devoted to Constructibility, and a take-home
final, about Forcing only.
Prerequisites: PHIL 352A / MATH 292A, or MATH 161, or PHIL 160A,B, or
equivalents, or consent of the instructor.
Phil. 354, Winter 2008
Topics in Logic: An Introduction to Proof Mining
TTh 2:15-3:30, 260-311A, FIRST MEETING January 10
Instructor: Grigori Mints
Course requirements: one homework plus two presentations
Tentative CONTENTS: Introduction. Effective and non-effective
proofs. Various meanings of "constructive": effective, predicative,
constructible. Constructions contained in effective proofs. BHK
interpretation. Some non-constructive principles. Construction of
counterexamples. Specker sequence. Finitary statements, Hard and soft
analysis, functional interpretations. Monotone and continuous
functionals, monotone functional interpretation. Proof mining.
Student presentations. Each of the topics is presented by two
students. U. Kohlenbach, EACTS paper. Constructivity at
FOM. Constructivity at conferences. Identity and similarity of
proofs. Examples of proof mining. Proof assistants and onstruction of
complete proofs. Additional topics.
____________
COMPUTER SCIENCE TALK
on 9 January 2008, 12:30pm
AI Lab Fishbowl, Gates
"Coordination Mechanisms for Dynamic Multi-Agent Environments"
David C. Parkes
School of Engineering and Applied Sciences, Harvard University
Computational mechanism design (CMD) seeks to understand how to design
games that induce desirable outcomes in multi-agent systems despite
private information, self-interest and limited computational
resources. CMD finds application in many settings, from allocating
wireless spectrum and airport landing slots, to Internet advertising,
to expressive sourcing in the supply chain, to allocating shared
computational resources. In meeting the demands for CMD in these rich
domains, we often need to bridge from the classic theory of economic
mechanism design to the practice of deployable, scalable mechanisms.
Of particular interest is the problem of designing coordination
mechanisms for dynamic environments, with agent arrivals and
departures and agents that experience changes to local information
(e.g., about preferences or capabilities), or more generally changes
to their local state. We can conceptualize these systems as
loosely-coupled Markov Decision Processes (MDPs), with each agent's
local problem modeled as a privately known and privately observable
MDP and constraints on joint action profiles. This formulation also
allows for environments in which agents are learning about their value
for resources with "information-state MDPs" modeling Bayesian-optimal
learning. I sketch a sequence of models for dynamic coordination
problems, and an overview of how the family of Groves mechanisms can
be generalized to these environments. In offering some remarks about
computational challenges and opportunities in these domains, I will
also outline a complementary direction in "computational ironing",
which dynamically modifies online stochastic combinatorial
optimization algorithms to provide them with appropriate monotonicity
properties, and therefore make them non-manipulable. Time permitting,
I will touch on some directions for future work.
Joint work with Ruggiero Cavallo, Quang Duong, and Satinder Singh.
____________
SRI CCB SEMINAR SERIES
on Wednesday, 9 January 2008, 3:30pm
AE201, SRI International
Huaiyu Mi <mi AI.SRI.COM>
"About Pathway Logic"
Carolyn Talcott
CSL, SRI
Pathway Logic is a formal methods modeling and analysis framework for
molecular and cellular processes. Reactions and related information
are curated and stored in a knowledge base represented using the
rewriting logic language Maude. The Pathway Logic Assistant provides a
graphical interface for browsing and analyzing reaction networks.
Pathways are assembled as answers to queries rather than being
pre-defined.
For background, we will give a brief introduction to Pathway Logic and
the use of the Pathway Logic Assistant. Then we will describe several
case studies, including a model of cellular signaling in response to
Egf stimulation; curated metabolic models and progress towards
importing Biocyc PGDBs into Pathway Logic; and an application to sleep
research.
____________
EE380: COMPUTER SYSTEMS LAB COLLOQUIUM
on Wednesday, 9 January 2008, 4:15pm to 5:30pm
Gates B01
http://ee380.stanford.edu/contents.html
"Tracking the Internet into the 21st Century"
Vinton G. Cerf
Google
Cerf will briefly review some key events in the history of the
Internet, examine recent statistics, consider technical drivers and
research issues still to be explored, look at current applications and
their implications for social and economic effects and finish up with
some future challenges and an update on the interplanetary extension
of the Internet.
About the Speaker: Vint Cerf is VP and Chief Internet Evangelist of
Google. He served as the chairman of the Internet Corporation for
Assigned Names and Numbers from 2000-2007, was the founding President
of the Internet Society, worked as Senior Vice President at MCI, VP of
the Corporation for National Research Initiatives, developed MCI Mail,
and led the Internetting research program at the Defense Advanced
Research Projects Agency from 1976-1982. He and Robert E. Kahn
developed the architecture and basic protocols of the Internet in 1973
and have received many awards for their work on various aspects of the
Internet.
____________
SF BAY ACM DATA MINING SIG
on Wednesday, 9 January 2008, 6:30pm - 9:00pm
SAP LABS, Building D, 3410 Hillview Avenue, Palo Alto, CA
http://sfbayacm.org/dmsig.php
"Learning in Networks: from Spiking Neural Nets to Graphs"
Victor Miagkikh
Machine Learning Specialist, Cisco Systems, Inc.
Hebbian learning is a well know principal of unsupervised learning in
networks: if two events happen "close in time" then the strength of
connection between the network nodes producing those events
increases. Is this a complete set of learning axioms? Given a
reinforcement signal (reward) for a sequence of actions we can add
another axiom: "reward controls plasticity". Thus, we get a
reinforcement learning algorithm that could be used for training
spiking neural networks (SNN). The author will demonstrate the utility
of this algorithm on a maze learning problem. Can these learning
principles be applied not only to neural, but also to other kinds of
networks? Yes, in fact we will see their application to economical
influence networks for portfolio optimization. Then, if time allows,
we consider another application: social networks for a movie
recommendation engine, and other causality inducing principles instead
of "close in time". By the end of the talk the author hopes that the
audience would agree that the "reward controls plasticity" principle
is a vital learning axiom.
About the Speaker: Victor V. Miagkikh received his Engineering Diploma
degree in Computer Engineering from Taganrog State University of Radio
Engineering, Russia in 1994. He received his M.S. in Computer Science
from Michigan State University in 1998. He is a Ph.D. candidate in
Computer Science at Michigan State University, and working towards a
certificate in data mining at Stanford University. He is a Machine
Learning Specialist with Cisco Systems, Inc. (Ironport business
unit). His current research is focusing on spam detection and
reputation filtering algorithms. Victor also worked in research and
development of Procter & Gamble, Inc. and Fair Isaac, Inc. Among his
awards: Presidential Scholarship for Study Abroad, and King-Size Red
Diploma (the best graduate of the department). His research interest
are machine learning, artificial intelligence, spam detection,
reinforcement learning, neural networks, genetic algorithms, fuzzy
logic, social networks, reputation systems, multi aspect graph
theoretical modeling, collaborative filtering, network analysis,
econometric and psychometric modeling. His publications could be
found here: http://www.msu.edu/~miagkikh/
____________
SRI AI SEMINAR SERIES
on Thursday, 10 January 2008, 11:00am
EJ228, SRI International
http://www.ai.sri.com/seminars/
"Automated Aides for Generating Scientific Insights"
Lawrence Hunter
University of Colorado at Denver
http://compbio.uchsc.edu/Hunter/
The profusion of high-throughput instruments and the explosion of new
results in the scientific literature, particularly in molecular
biomedicine, is both a blessing and a curse to the bench
researcher. Even knowledgable and experienced scientists can benefit
from computational tools that help navigate this vast and rapidly
evolving terrain. However, effective design and implementation of
computational tools that genuinely facilitate the generation of novel
and significant scientific insights remains poorly understood. In this
talk, I will describe a set of efforts that combines natural language
processing for information extraction and graphical network models for
semantic data integration into a system that has recently played a
pivotal role in making a significant discovery, and also discuss how
it might be possible to compare and evaluate such systems.
____________
PARC FORUM
on Thursday, 10 January 2008, 4:00pm - 5:00pm
George Pake Auditorium, PARC
http://www.parc.com/forum/
"Social Dynamics in the Age of the Web"
Bernardo Huberman
HP Labs
http://www.hpl.hp.com/research/idl/people/huberman/
The web mediates interactions among distant people on a scale that was
never possible in the physical world. From vast social networks, to
grass-root amateur creativity and the creation of encyclopedic
knowledge, a collective intelligence is at work in ways that differ
from traditional communities in style, intensity and effectiveness of
interaction. I will present the results of several studies of social
dynamics in the web, as well as mechanisms we have designed to access
this collective intelligence while improving users experiences with
digital content.
About the Speaker: Bernardo Huberman is a Senior HP Fellow and the
Director of the Information Dynamics Lab at Hewlett Packard
Laboratories. He is also a Consulting Professor in the Department of
Applied Physics at Stanford University. Before joining HP Labs he
worked for many years at Xerox PARC. For the past eight years his
research has concentrated on the phenomenon of Web, with an emphasis
on the design of novel mechanisms for discovering and aggregating
information.
____________
SSP10: SYMBOLIC SYSTEMS FORUM
on Thursday, 10 January 2008, 4:15pm
Bldg. 380:380C (Math Corner)
http://symsys.stanford.edu/ssp_events
"Online Identity Theft and Internet Fraud"
John Mitchell
Computer Science, Stanford
Computers and the Internet have changed business, education,
entertainment and recreation dramatically over the past two
decades. However, the rise of web transactions and electronic commerce
have presented opportunities for criminal activities such as online
identity theft and fraud. In this lecture and discussion, we will look
at some of the recent trends in phishing, fraud, bot networks, and
prevention techniques.
About the Speaker: Prof. Mitchell's research interests: Computer
security: access control, network protocols and software system
security. Programming languages, type systems, object systems, and
formal methods. Applications of mathematical logic to computer
science.
____________
CS547: HUMAN-COMPUTER INTERACTION SEMINAR
on Friday, 11 January 2008, 12:30-2:00pm
Gates B01
http://hci.stanford.edu/cs547/
"Supporting the Visualization and Analysis of Network Events"
Doantam Phan
Computer Science, Stanford
The flow of traffic among computers on the Internet and the exchange
of goods between countries are examples of causally connected
measurable events in a network. Understanding the behavior of such
networks often requires the ability to discover temporal connections
among the events in a large data set. One challenge is that the volume
of data makes it difficult to explore the data and organize the events
into a narrative sequence. This dissertation contributes new
interactive visualization techniques for analyzing, organizing, and
presenting network event data at multiple levels of detail for the
purpose of forensic analysis - tracking down causal sequences of
importance.
The first contribution is a technique that supports event analysis,
called progressive multiples. Our techniques are instantiated in a
system for network incident investigation, Isis, which we validated
with a long-term collaboration and deployment with the principal
network analyst of the EE and CS departments. The second contribution
is a technique for automatically generating flow maps, which present
summaries of network topology and behavior at a higher level than
event plots and timelines. Our technique has been adopted by a
diverse group of users to depict the flow of computer networks,
documents, and international ecological trade.
About the Speaker: Doantam Phan has recently completed his Ph.D. in
Computer Science at Stanford University. He studies Human-Computer
Interaction, and was advised by Terry Winograd.
____________
CS545: STANFORD-HP INFOSEMINAR
on Friday, 11 January 2008, 4:15pm - 5:30pm
Gates B03
http://infolab.stanford.edu/infoseminar/
"The five-minute rule twenty years later, and how flash memory
changes the rules"
Goetz Graefe
HP
In 1987, Gray and Putzolo presented the five-minute rule, which was
reviewed and renewed ten years later in 1997. With the advent of flash
memory in the gap between traditional RAM main memory and traditional
disk systems, the five-minute rule now applies to large pages
appropriate for today's disks and their fast transfer bandwidths, and
it also applies to flash disks holding small pages appropriate for
their fast access latency.
Flash memory fills the gap between RAM and disks in terms of many
metrics: acquisition cost, access latency, transfer bandwidth, spatial
density, and power consumption. Thus, within a few years, flash memory
will likely be used heavily in operating systems, file systems, and
database systems.
The basic software architectures for exploiting flash in these systems
are called "extended buffer pool" and "extended disk" here. Based on
the characteristics of these software architectures, an argument is
presented why operating systems and file systems on one hand and
database systems on the other hand will best benefit from flash memory
by employing different software architectures.
About the Speaker: Goetz Graefe has participated in research and
development of database systems for more than 20 years, with a focus
on query processing and indexing and with a brief interlude focused on
transactional memory. Some of his research has found its way into
database server products by Tandem (now HP), Informix (now IBM),
Microsoft, and several others.
____________
CSLI COGLUNCH
on Thursday, 17 January 2008, 12 noon - 1:00pm
Cordura Hall 100
http://www-csli.stanford.edu/events/Coglunch/
"Computation as Grammaticalization"
John Kadvany
Policy and Decision Science
http://www.johnkadvany.com/
Almost regardless of one's linguistic theory, a natural problem is the
relationship between the linguistic and mathematical infinite, or that
between linguistic and mathematical recursion -- What depends on what?
This talk frames that problem as one of constructing mathematical
computation from weaker recursive patterns typical of natural
languages. A thought experiment is used to describe the formalization
of computational rules or arithmetical axioms using only orally-based
natural language capabilities, motivated by two accomplishments of
ancient Indian mathematics and linguistics. One accomplishment is the
expression of positional value using versified Sanskrit number words
in addition to orthodox inscribed numerals. The second is Panini's
invention, around the 5th century BCE, of a formal grammar for spoken
Sanskrit, and expressed in oral verse extending Sanskrit through its
own grammatical structure. Panini's formalism uses recursive methods
rediscovered in the 20th century by Emil Post, whose technique of
rewrite rules is now ubiquitous in programming language design and
generative linguistics. The Sanskrit positional number compounds and
Panini's formal system are construed as linguistic grammaticalizations
relying on tacit cognitive models of symbolic form. The thought
experiment shows that universal computation can be constructed from
natural language skills, and also suggests that intentional
capabilities needed for language use play a role in all computational
models. Thus mathematical computation is a cognitive technology
extending generic skills associated with language structure, usage and
change. The talk summarizes "Positional Value and Linguistic
Recursion," appearing in the Journal of Indian Philosophy December
2007.
About the speaker: John Kadvany received his PhD from the Group in
Logic and Methodology of Science at UC Berkeley with a thesis on the
work of Imre Lakatos. He has worked for many years on environmental
risk problems, first at Applied Decision Analysis in Menlo Park and
currently as an independent consultant with Policy and Decision
Science. Continuing his interests in the philosophy of science and
mathematics, in 2001 he published Imre Lakatos and the Guises of
Reason (Duke UP), mostly an intellectual history of Lakatos'
historicist ideas and their sources in Lakatos' Hungarian past. He has
also written on comparative risk, risk communication, and the
quantification of uncertainty. The ideas behind the CogSci talk form
part of a broader study of the infinite using linguistic theory and
cognitive science.
____________
CS545: STANFORD-HP INFOSEMINAR
on Friday, 18 January 2008, 4:15pm - 5:30pm
Gates B03
http://infolab.stanford.edu/infoseminar/
"MonetDB/X100: a (very) fast column-store"
Peter Boncz
CWI
MonetDB/X100 is a second-generation column-store prototyped at CWI,
targeted at analysis-heavy data management tasks such as data
warehousing and information retrieval.
In this overview talk I will outline the research challenges, novel
techniques and results from this project. The ideal is to close the
existing performance gap between hand-coded applications and database
systems using architecture-conscious techniques, and by carefully
exploiting the bandwidth strengths of modern hardware (and avoiding its
latency weaknesses).
The novel techniques presented encompass expressing relational
operators as vector operations, lightweight compression on the border
between CPU cache and RAM, sequential-access optimized database design
and I/O bandwidth sharing.
____________
END MATERIAL
The CSLI Calendar appears weekly on most Wednesdays throughout the
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
sympa@lists-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). You will be asked to confirm
the subscription in either case. To unsubscribe use the word
unsubscribe instead of subscribe. Problems with subscribing or
unsubscribing should be sent to incalendar@csli.stanford.edu
The full current issue is at
http://cslicalendar.stanford.edu/current.shtml
and the archives at
http://cslicalendar.stanford.edu/Archive/
People on many of the CSLI computers can type 'help csli-calendar' to
see the current issue.
The CSLI Calendar is also posted each week to the su.events usenet
newsgroup (only available from computers on the Stanford network)
Information about CSLI's research program is available at
http://www-csli.stanford.edu/
For maps to the Stanford University rooms see
http://cslicalendar.stanford.edu/locations.shtml