Conferences, Lectures, & Seminars
Events for October
-
Declarative Data Services: This Is Your Data on SOA Dr. Michael Carey - BEA Systems, Inc.
Thu, Oct 11, 2007 @ 04:00 PM - 05:30 PM
Thomas Lord Department of Computer Science
Conferences, Lectures, & Seminars
AbstractWith the current push towards service-oriented architectures (SOA) and process orientation, data seems to be getting lost in the SOA shuffle. At the end of the day, however, most real applications are still about data, and service-oriented applications are no different in this regard. In this talk, we will argue that data services are a critical piece of the SOA application puzzle. The talk will present an approach to SOA data modeling that involves defining a network of related data services. It will also make the case for taking a declarative approach to defining such services, an approach inspired by the success of declarative query languages in the database world. The talk will demonstrate how the proposed approach enables a level of highly performant service composition (and reuse) that is simply
not attainable through other, more traditional approaches. Along the way, the talk will identify industry standards from W3C and other consortia that can be combined to provide a standards-based foundation for data services. It will end with a brief discussion of open problems that contain opportunities for academic research contributions.Biography
Michael J. Carey is a Senior Engineering Director on the AquaLogic side of BEA Sytems, Inc. Dr. Carey is currently the chief architect for BEA's AquaLogic Data Services Platform product. Prior to joining BEA in 2001, Dr. Carey spent a dozen years on the University of Wisconsin-Madison computer science faculty, five years as an IBM Almaden database researcher and research manager, and a year and a half working under various inflated titles at an e-commerce software startup, Propel Software. Dr. Carey is an ACM Fellow, a member of the National Academy of Engineering, and a past recipient of the ACM SIGMOD Edgar F. Codd Innovations Award and the ACM SIGMOD Contributions Award. He has co-authored over one hundred conference and journal articles on topics related to database management systems and
middleware.Location: Seaver Science Library (SSL) - 150
Audiences: Everyone Is Invited
Contact: Jason Dziegielewski
-
CS Colloquia: The Price of Stability for Network Design
Tue, Oct 16, 2007 @ 04:00 PM - 05:30 PM
Thomas Lord Department of Computer Science
Conferences, Lectures, & Seminars
Title: The Price of Stability for Network Design
Speaker: Prof. Elliot Anshelevich(RPI)ABSTRACT:
Network design is a fundamental problem for which it is important to
understand the effects of strategic behavior. Given a collection of
self-interested agents who want to form a network connecting certain
endpoints, the set of stable solutions (the Nash equilibria) may look quite
different from the centrally enforced optimum. We study the price of
stability, i.e. the quality of the best Nash equilibrium compared to the
optimum network cost. The best Nash equilibrium solution has a natural meaning
of stability in this context: it is the optimal solution that can be proposed
from which no user will "deviate".We consider two versions of this game: one where agents may divide the cost of
the edges they use in any manner they desire, and one where the cost of each
such edge is divided equally between the agents whose connections make use of
it. In the first version, determining whether or not a Nash equilibrium exists
is NP-complete. However, when the goal of each player is to connect a terminal
to a common source, we prove that there is a Nash equilibrium as cheap as the
optimal network, and give a polynomial time algorithm to find a
(1+epsilon)-approximate Nash equilibrium that does not cost much more. In the
second version, however, a Nash equilibrium always exists and can be achieved
via best-response dynamics. In this version we can show a tight bound of O(log
k) on the price of stability (where k is the number of agents). I will discuss
these results and possibly mention some extensions as well.This is joint work with: Bugra Caskurlu, Anirban Dasgupta, Jon Kleinberg, Eva
Tardos, Tom Wexler, and Tim RoughgardenBIO:
Elliot Anshelevich is an Assistant Professor in Computer Science at
Rensselaer Polytechnic Institute. He received his Ph.D. from Cornell
University in 2005, working under the direction of Jon Kleinberg and Eva
Tardos. After receiving the NSF Postdoctoral Fellowship in Mathematics, he
spent a year at Princeton University working with Moses Charikar. His research
interests focus on algorithms for large decentralized networks, including
networks with strategic agents. Particular interests include: network design
problems, algorithmic game theory, local and decentralized routing algorithms,
approximation algorithms, graph algorithms, and information propagation in
both social and computer networks.
Location: Seaver Science Library (SSL) - 150
Audiences: Everyone Is Invited
Contact: CS Colloquia
-
CS Colloquia: Filtering Spam with Behavioral Blacklisting
Tue, Oct 23, 2007 @ 04:00 PM - 05:30 PM
Thomas Lord Department of Computer Science
Conferences, Lectures, & Seminars
Title: Filtering Spam with Behavioral BlacklistingSpeaker: Prof. Nick Feamster(GATECH)ABSTRACT:
Spam filters often use the reputation of an IP address (or IP address
range) to classify email senders. This approach worked well when most
spam originated from senders with fixed IP addresses, but
spam today is also sent from IP addresses for which blacklist
maintainers have outdated or inaccurate information (or no information
at all). Spam campaigns also involve many senders, reducing the amount
of spam any particular IP address sends to a single domain; this method
allows spammers to stay ''under the radar''. The dynamism of any
particular IP address begs for blacklisting techniques that
automatically adapt as the senders of spam change.We present SpamTracker, a spam filtering system that uses a new technique
called behavioral blacklisting to classify email senders based on their
sending behavior rather than their identity. Spammers cannot evade
SpamTracker merely by using ''fresh'' IP addresses because blacklisting
decisions are based on sending patterns, which tend to remain more invariant.
SpamTracker uses fast clustering algorithms that react quickly to changes in
sending patterns. We evaluate SpamTracker's ability to classify spammers using
email logs for over 115 email domains; we find that SpamTracker can correctly
classify many spammers missed by current filtering techniques.BIO:
Nick Feamster is an assistant professor in the College of Computing at Georgia
Tech. He received his Ph.D. in Computer science from MIT in 2005, and his S.B.
and M.Eng. degrees in Electrical Engineering and Computer Science from MIT in
2000 and 2001, respectively. His research focuses on many aspects of computer
networking and networked systems, including the design, measurement, and
analysis of network routing protocols, network security, anonymous
communication systems, and adaptive streaming media protocols. His honors
include award papers at SIGCOMM 2006 (network-level behavior of spammers), the
NSDI 2005 conference (fault detection in router configuration), Usenix
Security 2002 (circumventing web censorship using Infranet), and Usenix
Security 2001 (web cookie analysis). He is also the recipient of an IBM
Faculty Award.Location: Seaver Science Library (SSL) - 150
Audiences: Everyone Is Invited
Contact: CS Colloquia
-
CS Colloquia: Autonomous Planetary Exploration using Irregular Triangular Mesh
Thu, Oct 25, 2007 @ 04:00 PM - 05:30 PM
Thomas Lord Department of Computer Science
Conferences, Lectures, & Seminars
Title: Autonomous Planetary Exploration using Irregular Triangular MeshSpeaker: Dr. Ioannis Rekleitis (CSA)ABSTRACT:
In this talk, I am going to present work done
at the Canadian Space Agency. In particular, our approach to planetary
exploration together with the challenges we face is going to be discussed.
Our objective is autonomous over-the-horizon navigation using a laser
based vision sensor. With the term over-the-horizon, we mean locations
beyond the sensor's reach. Central to our efforts is the task of
developing the autonomous capabilities of space robotic systems and in
particular of planetary rovers. In order for a rover to be fully
autonomous it has to be able to sense its environment, reason about the
terrain it faces, plan a path, and navigate safely along the planned
trajectory. In order to avoid the problems of harsh lighting conditions
and to produce scientific valuable topographical maps in medium scale, we
have selected the use of a laser based vision sensor. In this part of the
talk I am going to present our successful autonomous
experiments in over-the-horizon navigation in CSA's Mars-like terrain.BIO:
Ioannis Rekleitis is currently a Visiting Fellow at the Canadian Space Agency
and Adjunct Professor at the School of Computer Science, McGill University.
Between 2002
and 2003, he was a Postdoctoral Fellow at the Carnegie Mellon University
in the Sensor Based Planning Lab with Professor Howie Choset. He was
granted his Ph.D. from the School of Computer Science, McGill University,
Montreal, Quebec, Canada in 2002 under the supervision of Professors
Gregory Dudek and Evangelos Milios. Thesis title: "Cooperative
Localization and Multi-Robot Exploration". He finished his M.Sc. in McGill
University in the field of Computer Vision in 1995. He was granted his
B.Sc. in 1991 from the Department of Informatics, University of Athens,
Greece. His Research has focused on mobile robotics and in particular in
the area of cooperating intelligent agents with application to multi-robot
cooperative localization, mapping, exploration and coverage. His interests
extend to computer vision and sensor networks.Location: Seaver Science Library (SSL) - 150
Audiences: Everyone Is Invited
Contact: CS Colloquia
