• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

ORACON: an adaptive model for contexts prediction

Rosa, João Henrique da 28 February 2013 (has links)
Submitted by Maicon Juliano Schmidt (maicons) on 2015-05-07T16:24:42Z No. of bitstreams: 1 João Henrique da Rosa.pdf: 3385861 bytes, checksum: f01fdf2a57917563fe8036952b98c2b8 (MD5) / Made available in DSpace on 2015-05-07T16:24:42Z (GMT). No. of bitstreams: 1 João Henrique da Rosa.pdf: 3385861 bytes, checksum: f01fdf2a57917563fe8036952b98c2b8 (MD5) Previous issue date: 2013-01-01 / CNPQ – Conselho Nacional de Desenvolvimento Científico e Tecnológico / Contexts prediction has been receiving considerable attention in the last years. Furthermore, this area seems to be the next logical step in context-aware computing, which, until a few years ago, had been concerned more with the present and the past temporal dimensions. There are many works regarding models for contexts prediction. Nevertheless, most of them employ the same algorithm for all cases. In other words, we did not find any approach that automatically decides the best prediction method according to the situation. Therefore, we propose the ORACON model. ORACON adapts itself in order to apply the best algorithm to the case. Moreover, the model supports other important aspects of ubicomp, such as, context formal representation and privacy. In this thesis, we describe the ORACON design and evaluate the model through two experiments, one using real data and the other employing simulated information.

Page generated in 0.1156 seconds