[Date Prev][Date Next][Date Index]
CSLI Calendar, Wednesday, 15 August 2007, vol. 22:48
CSLI CALENDAR OF PUBLIC EVENTS
______________________________________________________________________
15 AUGUST 2007 Stanford Vol. 22, No. 48
______________________________________________________________________
A weekly publication of the
Center for the Study of Language and Information (CSLI)
Stanford University, Cordura Hall, Stanford, CA 94305-4101
http://www-csli.stanford.edu/
____________
ACTIVITIES FROM 15 AUGUST 2007 TO 25 AUGUST 2007
WEDNESDAY, 15 AUGUST 2007
all day 13th ACM SIGKDD International Conference [15-Aug-07]
on Knowledge Discovery and Data Mining
San Jose, CA
http://www.kdd2007.com/
6:00pm Silicon Valley Web Guild [15-Aug-07]
Google, 1600 Amphitheatre Pkwy., Building 43
"The Future of Online Platforms"
Ismael Ghalimi, CEO, Intalio
Mark Trang, Director of ISV Marketing, SalesForce.com
Chris Schalk, Google Developer Programs, Google
Chuck Mortimore, Director of Platform Services, Rearden Commerce
http://www.webguild.org/
Abstract below
THURSDAY, 16 AUGUST 2007
4:00pm SRI AI Seminar Series [16-Aug-07]
EJ228, SRI International
"CleanTAX:
An Infrastructure for Reasoning about Biological Taxonomies"
David Thau
UC Davis
http://www.ai.sri.com/seminars/
Abstract below
4:00pm PARC Forum [16-Aug-07]
George Pake Auditorium at PARC
"Pandemic Influenza: Prospects for an H5 Vaccine"
Harry Greenberg
Medicine, Microbiology and Immunology, Stanford
http://www.parc.com/forum/
4:15pm CSLI Seminar on Computational Learning and Adaptation
Cordura Hall 100
"Towards a general framework for data mining"
Saso Dzeroski
Knowledge Technologies, Jozef Stefan Institute, Slovenia
http://cll.stanford.edu/scla/schedule.shtml
Abstract below
FRIDAY, 17 AUGUST 2007
11:00am UC Berkeley Ear Club [17-Aug-07]
3105 Tolman Hall (Berkeley)
"Auditory temporal processing and aging -- redefining presbycusis"
Kathy Pichora-Fuller
Psychology, University of Toronto
http://ear.berkeley.edu/ear-club-schedule.html
3:30pm SRI CSL Seminar Series [17-Aug-07]
EK255, SRI International
"Delegation in searchable encryptions"
Elaine Runting Shi
Carnegie Mellon University
http://www.csl.sri.com/
Abstract below
7:00pm Long Now Foundation Talk [17-Aug-07]
Cowell Theatre, Fort Mason Center, San Francisco
"The Deep History of the Information Age"
Alex Wright
New York Times
author "Glut: Mastering Information Through the Ages"
http://www.longnow.org/
MONDAY, 20 AUGUST 2007
4:00pm UC Berkeley Ear Club [20-Aug-07]
3105 Tolman Hall (Berkeley)
"Exploring the perceptual organization of sound"
Brian Roberts
Psychology, Aston University - Birmingham, UK
http://ear.berkeley.edu/ear-club-schedule.html
TUESDAY, 21 AUGUST 2007
all day Stanford High Performance Computing Conference III [21-Aug-07]
Wallenberg Hall
"Software development and research computing"
http://hpcc.stanford.edu
Information below
WEDNESDAY, 22 AUGUST 2007
THURSDAY, 23 AUGUST 2007
10:00am SRI AI Seminar Series [23-Aug-07]
EJ291, SRI International
"VGRAM: Improving Performance of Approximate Queries on String
Collections Using Variable-Length Grams"
Chen Li
UC Irvine
http://www.ai.sri.com/seminars/
Abstract below
4:00pm PARC Forum [23-Aug-07]
George Pake Auditorium at PARC
"Recent Developments in Modular Self-reconfigurable Robots"
Mark Yim
University of of Pennsylvania
http://www.parc.com/forum/
Abstract below
4:00pm SRI AI Seminar Series [23-Aug-07]
EJ228, SRI International
"Navigating in Planning Search Spaces:
why it is useful to have a backbone"
Blazej Bulka
SRI AI
http://www.ai.sri.com/seminars/
Abstract below
FRIDAY, 24 AUGUST 2007
SATURDAY, 25 AUGUST 2007
all day 4th annual Bay Area Memory Meeting (BAMM4) [25-Aug-07]
Genetics and Plant Biology Bldg. (UC Berkeley)
http://psychology.stanford.edu/~wagner/BAMM/Bamm_2007.html
Information below
____________
Stanford Blood Center: Shortage of O-, O+, A-, A+, B+, 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. Remember the usual supply of vic^H^H^Hstudents is gone for
the summer. The Blood Center is also raising money for a new
bloodmobile.
____________
SILICON VALLEY WEB GUILD
on Thursday, 15 August 2007, 6:00pm
Google, 1600 Amphitheatre Parkway, Building 43, Mountain View
http://www.webguild.org/
"The Future of Online Platforms"
Ismael Ghalimi, CEO, Intalio
Mark Trang, Director of ISV Marketing, SalesForce.com
Chris Schalk, Google Developer Programs, Google
Chuck Mortimore, Director of Platform Services, Rearden Commerce
Salesforce.com, Google Developer Network, Intalio Over the past year,
there's been an explosion of new online applications and services
resulting in new "mashups" and web-based business models. This has
changed the economics of the Internet as developers now benefit from
reduced development times through sharing and re-use of components and
accelerated go-to-market channels. Come hear from a panel of experts
of industry leaders as they weigh in on issues surrounding innovative
technologies that will drive the next evolution of the web.
____________
SRI AI SEMINAR SERIES
on Thursday, 16 August 2007, 4:00pm - 5:30pm
EJ228, SRI International
http://www.ai.sri.com/seminars/
"CleanTAX:
An Infrastructure for Reasoning about Biological Taxonomies"
David Thau
UC Davis
Data are often classified taxonomically. When differences in
nomenclature occur, multiple taxonomies relating to the same
underlying data may arise. Integrating data that have been classified
using different taxonomies often requires inter-taxonomy relational
information. Given a set of taxonomic constraints, these relations may
lead to unintended consequences, or may create inconsistencies in the
data. We propose a logic-based framework for analyzing taxonomies, and
articulations between them. Specifically, a taxonomy T is viewed as a
set of first-order formulas constraining the possible interpretations
of names and concepts in T. The formalization of taxonomies T via our
FOL language allows us to clarify (a) what it means for T to be
consistent, (b) to be inconsistent, (c) whether a new relationship
between two taxa, and (d) whether two taxonomies T1, T2 from different
authorities, together with a taxonomy mapping (articulation) from a
third authority, are mutually consistent.
We illustrate our logic-based formalization and an accompanying
architecture supporting automated reasoning using examples involving
the classification of a genus of plants. We describe the user
requirements for the task of data curation in this context, and
demonstrate the utility of our architecture by discovering
inconsistencies and unstated implications in the data set.
About the Speaker: Dave Thau is a PhD graduate student in the Database
Lab at the University of California at Davis. He works primarily with
Bertram Lud\"ascher, focusing on scientific data management. Prior to
starting at UC Davis, Dave consulted on a variety of ecology and
biodiversity informatics related projects, including SEEK (scientific
environment for ecological knowledge) project, DiGIR (Distributed
Generic Information Retrieval), AntWeb, and the All Species
project. Dave holds Masters degrees in Computer Science and Psychology
from the University of Michigan at Ann Arbor.
____________
CSLI SEMINAR ON COMPUTATIONAL LEARNING AND ADAPTATION
on Wednesday, 16 August 2007, 4:15pm to 5:30pm
Cordura Hall 100
http://cll.stanford.edu/scla/schedule.shtml
"Towards a general framework for data mining"
Saso Dzeroski
Knowledge Technologies, Jozef Stefan Institute, Slovenia
In this talk, I will address the ambitious task of formulating a
general framework for data mining. To begin, I will discuss the
requirements that such a framework should fulfill: it should elegantly
handle different types of data, different data mining tasks, and
different types of patterns/models. I will also discuss data mining
languages and what they should support, such as the design and
implementation of data mining algorithms and their composition into
nontrivial multistep knowledge discovery scenarios relevant for
practical application. I will proceed by laying out some basic
concepts, starting with (structured) data and generalizations (e.g.,
patterns and models) and continuing with data mining tasks and basic
components of data mining algorithms (i.e., refinement operators,
distances, features, and kernels). Next, I will discuss how to use
these concepts to formulate constraint-based data mining tasks and
design generic data mining algorithms. Finally, I will discuss how
these components fit in the overall framework and, in particular, into
a language for data mining and knowledge discovery.
____________
SRI CSL SEMINAR SERIES
on Friday, 17 August 2007, 3:30pm - 4:30pm
EK255, SRI International
http://www.csl.sri.com/
"Delegation in searchable encryptions"
Elaine Runting Shi
Carnegie Mellon University
Recently, researchers have proposed searchable encryption schemes that
allow us to address the following problem. Suppose network gateways
submit network traces to an audit log repository. Due to the presence
of privacy sensitive information, the logs are stored in encrypted
format at the repository, and only a trusted authority holds the
secret key. Suppose now a research team (a.k.a., an auditor) has been
assigned to audit the logs and study the behavior of recent Internet
worms. The authority computes a token (a.k.a. a partial decryption
key) and gives it out to the auditor, such that the auditor can
decrypt all entries satisfying certain characteristics pertaining to
attack traffic. However, all irrelevant entries still remain secret
to the auditor.
In this work, we consider the role of delegation in these searchable
encryption systems. Suppose that the research team mentioned above is
composed of several different research groups from different
institutions. Each group is in charge of studying a different type of
worm originating from a different geographic location. For example,
team A studies SQL Slammer worm originating from Asia. The head of the
research project can now compute a sub-token for team A, allowing it
to decrypt all entries having port number 1434 and IP addresses from
Asia. This process is called delegation. Through delegation, a party
owning a token can autonomously compute a sub-token, allowing someone
to evaluate from the ciphertexts a subset of information enabled by
the parent token.
We give a general definition for delegateable searchable
encryption. We then give an efficient and proveably secure
construction for conjunctive queries.
____________
STANFORD HIGH PERFORMANCE COMPUTING CONFERENCE III
on Tuesday, 21 August 2007, 8:00am - 5:00pm
Wallenberg Hall
http://hpcc.stanford.edu
"Software development and research computing"
The focus this year is software development and research computing;
bringing together system managers, researchers, developers,
computational scientists and industry affiliates to discuss recent
developments and future advancement in High Performance Computing.
Some of the highlights are:
* Compiler and debugging training
* MPI programming
* Multi-Core Technology
* Accelerators
* Power & Cooling
The detailed agenda and registration information will be posted to the
conference web site in the coming weeks: http://hpcc.stanford.edu
Lunch and refreshments provided throughout the day. The conference is
free of charge to Stanford affiliates, non-Stanford academic and
research institutions.
Please contact Steve Jones stevejones@stanford.edu for further
information.
____________
SRI AI SEMINAR SERIES
on Thursday, 23 August 2007, 10:00am
EJ291, SRI International
http://www.ai.sri.com/seminars/
"VGRAM: Improving Performance of Approximate Queries on String
Collections Using Variable-Length Grams"
Chen Li
UC Irvine
Many applications have the emerging need to answer approximate string
queries efficiently. Such a query can ask for strings that are similar
to a given string, such as "names similar to Schwarzenegger" and
"telephone numbers similar to 412-0964," where "similar to" uses a
predefined, domain-specific function to specify the similarity between
strings, such as edit distance. We will report our recent results on
solving related problems. We will focus on a new technique, called
VGRAM. It improves those algorithms that use fixed-length grams, which
are substrings of a string used as signatures to identify similar
strings. The main idea of VGRAM is to judiciously choose high-quality
grams of variable lengths from a collection of strings to support
queries on the collection. We give a full specification of this
technique, including how to select high-quality grams from the
collection, how to generate variable-length grams for a string based
on the preselected grams, and what is the relationship between the
similarity of the gram sets of two strings and their edit distance. A
primary advantage of the technique is that it can be adopted by a
plethora of approximate string algorithms without the need to modify
them substantially. We present our extensive experiments on real data
sets to evaluate the technique, and show the significant performance
improvements on three existing algorithms. Related results have
appeared in recent VLDB papers.
About the Speaker: About the Speaker: Chen Li is an associate
professor in the Department of Computer Science at the University of
California, Irvine. He received his Ph.D. degree in Computer Science
from Stanford University in 2001, and his M.S. and B.S. in Computer
Science from Tsinghua University, China, in 1996 and 1994,
respectively. He received a National Science Foundation CAREER Award
in 2003. He is currently a part-time Visiting Research Scientist at
Google. His research interests are in the fields of database and
information systems, including data cleansing, data integration and
sharing, data warehousing, and data privacy.
____________
PARC FORUM
on Thursday, 23 August 2007, 4:00pm - 5:00pm
George Pake Auditorium, PARC
http://www.parc.com/forum/
"Recent Developments in Modular Self-reconfigurable Robots"
Mark Yim
University of of Pennsylvania
Modular Self-Reconfigurable robots have been in development for many
years. These are robot systems that are made up of many repeated
modules that can be rearranged to form different shapes and perform a
variety of tasks. As these systems increase the number of modules
they promise to be
1) low cost from economies of scale and batch fabrication
2) robust from redundancy and self-repair abilities
3) versatile from being able to adopt different shapes to suit the need
While not there yet, this talk will present progress towards these
promises. More specifically, this talk will include recent
developments in the dynamic control of modular systems with large
degrees of freedom, designs for scaling up the number of modules in
system, applications for space and the search for life, and
self-reassembly after explosion.
About the speaker: Mark Yim joined the Department of Mechanical
Engineering and Applied Mechanics at U Penn in the fall of 2004 where
he is Gabel Family Term Junior Professor of Mechanical Engineering,
Associate Professor, MEAM Undergraduate Curriculum Chair and Associate
Faculty Director of the Weiss Tech House. Prior to this, he was a
Principal Scientist at the Palo Alto Research Center where he
established a group developing modular self-reconfigurable robots.
His other research interests include biologically inspired mechanism,
haptics for virtual reality, and most recently flying robots. Honors
include induction as a World Technology Network Fellow; IEEE Robotics
and Automation Distinguished Lecturer, and induction to MIT's
Technology Review TR100 in 1999. He has over 30 patents issued
(perhaps most prominent are ones related to the Sony Playstation and
Microsoft Xbox joypad vibration control which have recently been ruled
over $100,000,000 in litigation and settlements) and over 50
publications.
____________
FOURTH ANNUAL BAY AREA MEMORY MEETING (BAMM4)
on Saturday, 25 August 2007, all day
Genetics and Plant Biology Bldg. (UC Berkeley)
http://psychology.stanford.edu/~wagner/BAMM/Bamm_2007.html
We are pleased to announce that the fourth annual Bay Area Memory
Meeting (BAMM!) will be held on Saturday, August 25th at the
University of California, Berkeley. BAMM! brings together
investigators studying memory and cognitive control from the peninsula
(Stanford & UC Santa Cruz), city (UCSF), east bay (UC Berkeley and
Martinez VA), and valley (UC Davis). This year's BAMM! may also
include labs from Southern California. The objectives of BAMM! are to:
(1) foster communication and an exchange of ideas between scientists
in the bay area who study memory and cognitive control, and
(2) provide a forum in which students and postdocs can present their
research and build relationships with faculty and peers beyond
their local institution.
Hosting of BAMM! will rotate annually, providing an additional
opportunity for researchers to visit the various labs in the area.
See web page for registration information.
http://psychology.stanford.edu/~wagner/BAMM/Bamm_2007.html
Schedule
9:00 Arrival and breakfast refreshments
9:25- 9:30 Opening comments
9:30-10:30 Talk Session 1
9:30- 9:50 Steve Kennerley, UC Berkeley
"Neurons in the frontal lobe encode an abstract
representation of choice value"
9:50-10:10 Rob Blumenfeld, UC Davis
"Neural and behavioral distinctions between item-specific
and relational memory encoding"
10:10-10:30 Rosanna Olsen, Stanford
"High-resolution fMRI of medial temporal lobe during
delayed-match-to-sample"
10:30-11:30 Poster Session 1 (w/ refreshments)
*Crystal L. Cook Reeck (Stanford)
*Dana De Master (UC Davis)
*Sandrine Duverne (UC Irvine)
*Hiroki Hayama (UC Irvine)
*Pedro M. Paz-Alonso (UC Davis)
*Anne Richards (UC Davis)
*Tracy H. Wang (UC Irvine)
*Maheen M. Adamson (VA Palo Alto HCS/Stanford)
11:30-12:30 Talk Session 2
11:30-11:50 Jessy Lancaster, UC Santa Cruz
"Implicit knowledge of biomechanics and its effects
on human motion perception"
11:50-12:10 Francesca Fortenbaugh, UC Berkeley
"The peripheral visual field and spatial representations:
What you have now affects what you remember"
12:10-12:30 Kristen Lyons, UC Davis
"The development of metamemory monitoring in early childhood"
12:30- 2:00 Lunch
2:00- 3:00 Talk Session 3
2:00- 2:20 Deborah Hannula, UC Davis
"Medial temporal lobe contributions to the expression of
eye-movement-based relational memory effects"
2:20- 2:40 Janice Chen, Stanford
"Associative retrieval and mismatch signals in the CA
fields of human hippocampus"
2:40- 3:00 Bradley Buchsbaum, UC Berkeley
"Neural mechanisms underlying auditory-verbal sequence learning"
3:00- 4:00 Poster Session 2 (w/ refreshments)
*Rui S. Costa (UC Davis)
*Lauren J. Gottlieb (UC Irvine)
*Ellen C. Klostermann (UC Berkeley)
*Adriane Mayda (UC Davis)
*Liz Race (Stanford)
*Shanti Shanker (Stanford)
*Jessica Wilson (UC Berkeley)
*Weiwei Zhang (UC Davis)
4:00- 5:20 Talk Session 4
4:00- 4:20 Diane Marian, UC Berkeley
"The emotional monster: Effects of context on memory for
emotional expression"
4:20- 4:40 Linda Murray, UC Davis
"The effects of complexity on source memory ROCs"
4:40- 5:00 Colleen Parks, UC Davis
"Testing the threshold nature of recollection using a
second-choice procedure"
5:00- 5:20 Bernadette Guimberteau, UC Berkeley
"What is the role of the prefrontal cortex in learning
and remembering? Searching for insights using a new model
of learning with the tower of Hanoi"
____________
SRI AI SEMINAR SERIES
on Tuesday, 14 *Month* 2007, 4:00pm - 5:30pm
EJ228, SRI International
http://www.ai.sri.com/seminars/
"Navigating in Planning Search Spaces:
why it is useful to have a backbone"
Blazej Bulka
SRI AI
In a classical automated planning setting, a planner is given
information about the current state of the world, the definitions of
available actions, and a set of goals that should be achieved. The
planners task is to determine which actions will lead to the
accomplishment of the goals. A planner may be created to reason for
only a single domain (domain-dependent planner; e.g., a planner that
is designed solely to create an itinerary for air travel) or for a
whole class of domains (domain-independent planner). Although
domain-independent planners are more flexible than domain-dependent
ones, they are also slower than domain-dependent planners, which use
specialized algorithms. One of the reasons for this difference is that
these algorithms already embed the result of human reasoning and
analysis of the problem (e.g., finding recurring patterns within the
problem or discovering similarities to another known
problem). Enabling domain-independent planners to perform this type of
reasoning themselves may lead to significant performance improvements.
I propose to use previous experience and proactive analysis to create
a planning backbone, which is a library of plans based on the topology
of the underlying structure of the domain and other features of the
search space. To enable the construction of the backbone, I identify
a number of features that can be used to characterize search spaces
and state spaces. Particular attention is given to topological
features, which provide important information about the internal
structure and patterns within the problem. Although
domain-independent planners can plan in multiple domains, in practice,
they are typically used to produce many plans in any given domain.
Therefore, the proposed solution will be efficient, because the
additional computational cost can be amortized across multiple
planning episodes in the same domain.
____________
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
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://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