[Date Prev][Date Next][Date Index]
CSLI Calendar, Wednesday, 8 August 2007, vol. 22:47
CSLI CALENDAR OF PUBLIC EVENTS
______________________________________________________________________
8 AUGUST 2007 Stanford Vol. 22, No. 47
______________________________________________________________________
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 8 AUGUST 2007 TO 17 AUGUST 2007
WEDNESDAY, 8 AUGUST 2007
3:30pm SRI CSL Seminar Series [8-Aug-07]
EK255, SRI International
"Building Extended Canonizers by Graph-Based Deduction"
Christelle Scharff
Pace University, New York
http://www.csl.sri.com/
Abstract below
6:30pm SF Bay ACM Data Mining SIG [8-Aug-07]
SAP LABS, Building D, 3410 Hillview Avenue, Palo Alto, CA
"Bringing Data into the Web's Fabric: The Swivel Approach"
Joseph M. Hellerstein
Computer Science, UC Berkeley
Sara Wood
Swivel
http://sfbayacm.org/dmsig.php
Abstract below
THURSDAY, 9 AUGUST 2007
11:00am SRI CSL Seminar Series [9-Aug-07]
EK255, SRI International
"Eureka: A Framework for Automated Dissection of Malware"
Monirul Islam Sharif
Georgia Institute of Technology
http://www.csl.sri.com/
Abstract below
4:00pm SRI AI Seminar Series [9-Aug-07]
EJ228, SRI International
"Preference-based Search with Suggestions"
Paolo Viappiani
Ecole Polytechnique Federale Lausanne
http://www.ai.sri.com/seminars/
Abstract below
4:00pm PARC Forum [9-Aug-07]
George Pake Auditorium at PARC
"Radio Frequency Identification (RFID): The Fuss and the Facts"
Sanjay Sarma
Mechanical Engineering, MIT and CTO of OAT Systems
http://www.parc.com/forum/
SUNDAY, 12 AUGUST 2007
all day 13th ACM SIGKDD International Conference [12-Aug-07]
on Knowledge Discovery and Data Mining
San Jose, CA
http://www.kdd2007.com/
MONDAY, 13 AUGUST 2007
all day 13th ACM SIGKDD International Conference [13-Aug-07]
on Knowledge Discovery and Data Mining
San Jose, CA
http://www.kdd2007.com/
TUESDAY, 14 AUGUST 2007
all day 13th ACM SIGKDD International Conference [14-Aug-07]
on Knowledge Discovery and Data Mining
San Jose, CA
http://www.kdd2007.com/
7:30pm BayCHI [14-Aug-07]
George Pake Auditorium at PARC
"By the Numbers: How I built a Web 2.0, User-Generated
Content, Citizen Journalism, Long-Tail, Social Media Site for
$12,107.09"
Guy Kawasaki
Truemors and Garage Technology Ventures
http://www.truemors.com/
http://www.garage.com/
http://www.baychi.org/program/
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/
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/
____________
Stanford Blood Center: Shortage of O-, O+, A-, A+, 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.
____________
SRI CSL SEMINAR SERIES
on Wednesday, 8 August 2007, 3:30pm - 4:30pm
EK255, SRI International
http://www.csl.sri.com/
"Building Extended Canonizers by Graph-Based Deduction"
Christelle Scharff
Pace University, New York
We consider the problem of efficiently building extended canonizers,
which are capable of solving the uniform word problem for some
first-order theories. These reasoning artifacts have been introduced
in previous work to solve the lack of modularity of Shostak
combination schema while retaining its efficiency. It is known that
extended canonizers can be modularly combined to solve the uniform
word problem in unions of theories. Unfortunately, little is known
about efficiently implementing such canonizers for component theories,
especially those of interest for verification like, e.g., those of
uninterpreted function symbols or lists.
In this talk, we will present how we adapted and combined work on
rewriting-based decision procedures for satisfiability in first-order
theories and SER graphs, a graph-based method defined for abstract
congruence closure. Our goal is to build graph-based extended
canonizers for theories which are relevant for verification. Based on
graphs our approach addresses implementation issues that were lacking
in previous rewriting-based decision procedure approaches and which
are important to argue the viability of extended canonizers.
____________
SF BAY ACM DATA MINING SIG
on Wednesday, 8 August 2007, 6:30pm - 9:00pm
SAP LABS, Building D, 3410 Hillview Avenue, Palo Alto, CA
http://sfbayacm.org/dmsig.php
"Bringing Data into the Web's Fabric: The Swivel Approach"
Joseph M. Hellerstein
Computer Science, UC Berkeley
Sara Wood
Swivel
The Web is awash in textual information on every topic imaginable. But
the amount of hard data that can be usefully accessed on the Web
remains remarkably small, despite the potential for an Internet of
people and their computers to exploit data in ways that can improve
their health, happiness and bottom line.
Swivel is a site where users explore, publish, compare, visualize,
share and discuss data. Swivel combines web technologies and user
enthusiasm to liberate data from its traditional vaults, allowing
people to discover and share insights in that data.
The breadth of data sets and variety of interactions at Swivel raise
new opportunities and challenges in Data Mining, social networking,
data visualization and human-computer interaction. In this talk, we
outline the concepts that underlie Swivel, and highlight selected
technical challenges that seem ripe for investigation by the Data
Mining community. As a community site for data enthusiasts, we are
also interested in dialog about the role Swivel can play in
accelerating innovation in the Data Mining arena more generally.
About the Speakers: Joseph M. Hellerstein is a Professor of Computer
Science at the University of California, Berkeley, specializing in
data management and networking systems. He received his Ph.D. from the
University of Wisconsin in 1995, an M.S. from UC Berkeley in 1992, and
an A.B. from Harvard in 1990. Hellerstein's research has been
recognized via awards including an Alfred P. Sloan Research
Fellowship, MIT Technology Review's inaugural TR100 list of young
leaders, and two ACM-SIGMOD Test of Time awards. Key ideas from his
research have been incorporated into commercial and open-source
database software released by IBM, Oracle, and PostgreSQL. He has also
held industrial posts including Director of Intel Research Berkeley,
and Chief Scientist of Cohera Corporation. He currently chairs the
Technical Advisory Board of Swivel.
Sara Wood is the Chief Data Officer for Swivel. Sara has spent the
better part of the last decade at institutions working with some of
the world's most important data: the World Health Organization,
Harvard School of Public Health, the UN and UNDP. Previous to that she
worked for a number of technology companies and research
organizations, including web startups such as Salon.com, where she
helped to solve emerging issues of content and data management on the
web.
____________
SRI CSL SEMINAR SERIES
on Thursday, 9 August 2007, 11:00am
EK255, SRI International
http://www.csl.sri.com/
"Eureka: A Framework for Automated Dissection of Malware"
Monirul Islam Sharif
Georgia Institute of Technology
Recent malware analysis approaches have focused more on dynamic
analysis methods due to various obfuscations that impede static
analysis, such as packing, control-flow obfuscation and
anti-disassembly, etc. While dynamic analysis can overcome these
obfuscations and provide behavioral information, if enabled, static
analysis can provide a more complete view of malware program
structure, system interaction behavior and malicious capabilities.
In this talk, we will introduce Eureka, a framework developed at SRI
for automated dissection of malware that defeats many of the existing
obfuscations and enables static analysis. As part of Eureka, we
introduce a novel unpacking technique based on coarse grained
execution tracing. The new unpacking approach provides significantly
better success than previous techniques on a large corpus of recent
malware. We have made several API resolution methods to deter
control-flow obfuscations that try to hide system interaction in the
code. In the automated framework, we use structural analysis of
malware code and develop a micro ontology for automated classification
of malcode api calls. Our system automatically builds annotated call
graphs that illustrate the structural inter-relationship of malware
features. Eureka shows promising results on the live malware binaries
captured on SRI's honeynet. The live results are now publicly
accessible from Cyber-TA's malware infection analysis pages.
About the Speaker: Monirul is a PhD student at Georgia Tech whose
interests lie in the use of program analysis techiques for systems
security. He is primarily focused on malware analysis and detection
techniques. He has also worked on static analysis for host based
intrusion detection systems.
____________
SRI AI SEMINAR SERIES
on Thursday, 9 August 2007, 4:00pm - 5:30pm
EJ228, SRI International
http://www.ai.sri.com/seminars/
"Preference-based Search with Suggestions"
Paolo Viappiani
Ecole Polytechnique Federale Lausanne
Preference-based search is the problem of finding the most preferred
item among a large collection. The most popular methods for
preference-based search are based on question answering, and only a
minority of people manages to find their most preferred item. In this
talk we present new mixed-initiative tools using example-critiquing
and suggestions that, according to user studies, dramatically increase
decision accuracy.
We also consider the problem of preference-based search for
configurable products, where online electronic catalogs can be modeled
by Constraint Satisfaction Problems. We show how the generation of the
displayed examples can be formulated as a single optimization problem
and solved sufficiently fast for practical applications.
Finally we discuss a strategy for producing suggestions that exploit
prior knowledge of preference distributions and can adapt the
displayed examples to users' reactions.
About the Speaker: Paolo Viappiani is an assistant and PhD candidate
at the Artificial Intelligence Laboratory of the Ecole Polytechnique
Federale de Lausanne (EPFL). His thesis is advised by
Prof. Faltings and focus on personalized search tools. His research is
conducted in collaboration with the Human Computer Interaction group
directed by Prof. Pu, in the same institute. He holds a Master degree
(Laurea) in Computer Engineering from the "Politecnico di Milano",
Italy and is a member of AAAI and AI*IA (Italian association for
Artificial Intelligence). His interests include reasoning about
uncertainty, constraints and preferences. More details can be found at
http://people.epfl.ch/paolo.viappiani
____________
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
environoment 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.
____________
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.
____________
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