Cookies Policy
The website need some cookies and similar means to function. If you permit us, we will use those means to collect data on your visits for aggregated statistics to improve our service. Find out More
Accept Reject
  • Menu
Publications

2009

Coordination via Interaction Constraints I: Local Logic

Authors
Clarke, D; Proença, J;

Publication
Proceedings 2nd Interaction and Concurrency Experience: Structured Interactions, ICE 2009, Bologna, Italy, 31st August 2009.

Abstract

2009

Advanced Data Mining and Applications, 5th International Conference, ADMA 2009, Beijing, China, August 17-19, 2009. Proceedings

Authors
Huang, R; Yang, Q; Pei, J; Gama, J; Meng, X; Li, X;

Publication
ADMA

Abstract

2009

An exploratory analysis of software as a service and platform as a service models for mobile operators

Authors
Gonçalves, V; Ballon, P;

Publication
2009 13th International Conference on Intelligence in Next Generation Networks: Beyond the Bit Pipes, ICIN 2009

Abstract
The environments of software development and software provision are shifting to Web-based platforms supported by Platform/Software as a Service (PaaS/SaaS) models. By elaborating on these concepts, their benefits and risks, mobile operators' experiments with these models are analysed and similarities are identified. This paper will argue that mobile operators' mobile web services are shifting from SaaS to PaaS models and there is equally an opportunity for mobile operators to identify additional sources of revenue by exposing network functionalities through Web-based service platforms. However, analysed platforms incorporate fragmentation at several levels and are likely to face future challenges in order to succeed. © 2009 IEEE.

2009

Mining significant change patterns in multidimensional spaces

Authors
Alves, R; Ribeiro, J; Belo, O;

Publication
IJBIDM

Abstract
In this paper, we present a new OLAP Mining method for exploring interesting trend patterns. Our main goal is to mine the most (TOP-K) significant changes in Multidimensional Spaces (MDS) applying a gradient-based cubing strategy. The challenge is then finding maximum gradient regions, which maximises the task of detecting TOP-K gradient cells. Several heuristics are also introduced to prune MDS efficiently. In this paper, we motivate the importance of the proposed model, and present an efficient and effective method to compute it by: • evaluating significant changes by means of pushing gradient search into the partitioning process • measuring Gradient Regions (GR) spreadness for data cubing • measuring Periodicity Awareness (PA) of a change, assuring that it is a change pattern and not only an isolated event • devising a Rank Gradient-based Cubing to mine significant change patterns in MDS. Copyright © 2009, Inderscience Publishers.

2009

Deconstructing R eo

Authors
Clarke, D; Proenca, J; Lazovik, A; Arbab, F;

Publication
Electronic Notes in Theoretical Computer Science

Abstract
Coordination in R eo emerges from the composition of the behavioural constraints of the primitives, such as channels, in a component connector. Understanding and implementing R eo, however, has been challenging due to interaction of the channel metaphor, which is an inherently local notion, and the non-local nature of constraint propagation imposed by composition. In this paper, the channel metaphor takes a back seat, and we focus on the behavioural constraints imposed by the composition of primitives, and phrase the semantics of R eo as a constraint satisfaction problem. Not only does this provide a clear intensional description of the behaviour of R eo connectors in terms of synchronisation and data flow constraints, it also paves the way for new implementation techniques based on constraint propagation and satisfaction. In fact, decomposing R eo into constraints provides a new computational model for connectors, which we extend to model interaction with an unknown external world beyond what is currently possible in R eo.

2009

Data Streams

Authors
Gama, J; Rodrigues, PP;

Publication
Encyclopedia of Data Warehousing and Mining, Second Edition (4 Volumes)

Abstract

  • 3793
  • 4502