Update: Sorry about that -- didn't realize this got posted initially with no content.
As Steve pointed out in comments, the votes were close. After tallying the online voting with in-attendance votes (from those who didn't make the online poll before it closed), Todor made a strong comeback but Ian Wakeman et. al. finally triumphed with a 9-7 edge. Congratulations to them, and we look forward to seeing you all again next year.
Friday, November 30, 2007
Workshop Kick-off
The workshop is finally kicking off with Steve Neely providing the introductory remarks. We've added a new poll to the side of the blog -- please participate and vote for the best paper!! The candidates (pre-selected by program committee) are from Wakeman et. al., and Dimitrov et. al.
Both these papers received identical ratings during the review process -- the "winner" will be announced at the end of the workshop..
Both these papers received identical ratings during the review process -- the "winner" will be announced at the end of the workshop..
Monday, November 19, 2007
About the "1 minute madness" ...
As you may have noticed in the workshop program, we have a final 30-minute plenary discussion to close out the workshop. In order to make this as interactive and useful as possible, we decided to preface this with a 20-minute session called "1-minute madness". Some of you may have seen this forum before at other workshops. Basically, this is a soapbox of sorts -- anyone (presenters, organizers, attendees) is welcome to participate and provide fodder for the follow-up discussion. The idea is to make a 1-minute pitch about a topic of interest. You may elect to use slides or not - if the former, a single slide is ideal but you can use your discretion here.
For convenience, here are some possible 'themes' for the pitch. These are suggestions only:
For convenience, here are some possible 'themes' for the pitch. These are suggestions only:
- Research in a nutshell. What problem are you trying to solve? Why is it important? What makes your solution novel?
- Hot Topics. What should the MPAC community's next big research challenge be? Why?
- Experience Lessons. Share pitfalls and perspectives gained from practical experience with MPAC technology.
- Rants & Raves. Pick any topic of interest to the MPAC community. Educate. Advocate. Question. Debate.
Sunday, November 18, 2007
3.4 Reconciling Privacy and Security in Pervasive Computing (The Case for Pseudonymous Group Membership)
Ian Wakeman, University of Sussex
Dan Chalmers, University of Sussex
Michael Fry, University of Sydney
Abstract:
In this paper, we outline an approach to the identification of entities for access control that is based on the membership of groups, rather than individuals. By using group membership as a level of indirection between the individual and the system, we can increase privacy and provide incentives for better behaviour. Privacy comes from the use of pseudonyms generated within the group and which can be authenticated as belonging to the group. The incentives for better behaviour come from the continuous nature of groups - members may come and go, but the group lives on, and groups are organised so as to ensure group-longevity, and prevent actions which may harm the group’s reputation. We present a novel pseudonym generation mechanism suitable for use in groups without a centralised administration. Finally, we argue that the use of group membership as the basis for formulating policies on interaction is more efficient for disconnected operation, facilitating proxies and the efficient storage of revoked membership and distrusted organisations within bloom filters for small memory footprints.
ACM Copyright Notice Copyright © by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org.
Dan Chalmers, University of Sussex
Michael Fry, University of Sydney
Abstract:
In this paper, we outline an approach to the identification of entities for access control that is based on the membership of groups, rather than individuals. By using group membership as a level of indirection between the individual and the system, we can increase privacy and provide incentives for better behaviour. Privacy comes from the use of pseudonyms generated within the group and which can be authenticated as belonging to the group. The incentives for better behaviour come from the continuous nature of groups - members may come and go, but the group lives on, and groups are organised so as to ensure group-longevity, and prevent actions which may harm the group’s reputation. We present a novel pseudonym generation mechanism suitable for use in groups without a centralised administration. Finally, we argue that the use of group membership as the basis for formulating policies on interaction is more efficient for disconnected operation, facilitating proxies and the efficient storage of revoked membership and distrusted organisations within bloom filters for small memory footprints.
ACM Copyright Notice Copyright © by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org.
3.3 Evaluating a Middleware for Crossmedia Games
Fernando Trinta, University of Fortaleza
Davi Pedrosa, Federal University of Pernambuco
Carlos Ferraz, Federal University of Pernambuco
Geber Ramalho, Federal University of Pernambuco
Abstract:
Crossmedia games are a genre of pervasive gaming where a single game instance can be played with a variety of heterogeneous devices that support di erent forms of players' participation and deliver di erent game experiences. In this paper, we present the PM2G initiative, a Service-Oriented Architecture aiming at supporting crossmedia games' development and execution. Due to their relevance in this document, Content Adaptation and Interaction Adaptation Services are detailed. We also present a case study, a game called Pervasive Wizards, which is used to validate our architecture. Finally, we also present some performance results obtained in our experiments.
ACM Copyright Notice Copyright © by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org.
Davi Pedrosa, Federal University of Pernambuco
Carlos Ferraz, Federal University of Pernambuco
Geber Ramalho, Federal University of Pernambuco
Abstract:
Crossmedia games are a genre of pervasive gaming where a single game instance can be played with a variety of heterogeneous devices that support di erent forms of players' participation and deliver di erent game experiences. In this paper, we present the PM2G initiative, a Service-Oriented Architecture aiming at supporting crossmedia games' development and execution. Due to their relevance in this document, Content Adaptation and Interaction Adaptation Services are detailed. We also present a case study, a game called Pervasive Wizards, which is used to validate our architecture. Finally, we also present some performance results obtained in our experiments.
ACM Copyright Notice Copyright © by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org.
3.2 SPS: A Middleware for Multi-User Sensor Systems
Salman Taherian, University of Cambridge
Jean Bacon, University of Cambridge
Abstract:
With the increased realisation of the benefits of studying environmental data, sensor networks are rapidly scaling in size, heterogeneity of data, and applications. In this paper, we present a State-based Publish/Subscribe (SPS) framework for sensor systems with many distributed and independent application clients. SPS provides a state-based information deduction model that is suited to many classes of sensor network applications. State Maintenance Components (SMCs) are introduced that are simple in operation, flexible in placement, and decomposable for distributed processing. Publish/Subscribe communication forms the core messaging component of the framework. SPS uses the decoupling feature of Pub/Sub and extends this across the SMCs to support a more flexible and dynamic system structure. Our evaluation, using real sensor data, shows that SPS is expressive in capturing conditions, and scalable in performance.
ACM Copyright Notice Copyright © by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org.
Jean Bacon, University of Cambridge
Abstract:
With the increased realisation of the benefits of studying environmental data, sensor networks are rapidly scaling in size, heterogeneity of data, and applications. In this paper, we present a State-based Publish/Subscribe (SPS) framework for sensor systems with many distributed and independent application clients. SPS provides a state-based information deduction model that is suited to many classes of sensor network applications. State Maintenance Components (SMCs) are introduced that are simple in operation, flexible in placement, and decomposable for distributed processing. Publish/Subscribe communication forms the core messaging component of the framework. SPS uses the decoupling feature of Pub/Sub and extends this across the SMCs to support a more flexible and dynamic system structure. Our evaluation, using real sensor data, shows that SPS is expressive in capturing conditions, and scalable in performance.
ACM Copyright Notice Copyright © by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org.
Subscribe to:
Posts (Atom)