2009
Autores
Clarke, D; Proença, J;
Publicação
Proceedings 2nd Interaction and Concurrency Experience: Structured Interactions, ICE 2009, Bologna, Italy, 31st August 2009.
Abstract
2009
Autores
Huang, R; Yang, Q; Pei, J; Gama, J; Meng, X; Li, X;
Publicação
ADMA
Abstract
2009
Autores
Gonçalves, V; Ballon, P;
Publicação
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
Autores
Alves, R; Ribeiro, J; Belo, O;
Publicação
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
Autores
Clarke, D; Proenca, J; Lazovik, A; Arbab, F;
Publicação
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
Autores
Gama, J; Rodrigues, PP;
Publicação
Encyclopedia of Data Warehousing and Mining, Second Edition (4 Volumes)
Abstract
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.