𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[ACM Press the Fifth Balkan Conference in Informatics - Novi Sad, Serbia (2012.09.16-2012.09.20)] Proceedings of the Fifth Balkan Conference in Informatics on - BCI '12 - Recent advances delivered by HTML 5 in mobile cloud computing applications

✍ Scribed by Xinogalos, Stelios; Psannis, Kostas E.; Sifaleras, Angelo


Book ID
127346621
Publisher
ACM Press
Year
2012
Weight
186 KB
Category
Article
ISBN
1450312403

No coin nor oath required. For personal study only.

✦ Synopsis


With the explosive growth of the mobile applications and emerging of Cloud Computing (CC) concept, Mobile Cloud Computing (MCC) has been introduced to be a potential technology for mobile services. MCC refers to an infrastructure where both the data storage and the data processing happen outside of the mobile device. One of the technologies that will advance MCC is the latest version of the WebΒ΄s markup language, HTML 5. In this paper, we present a survey of new HTML 5 features with a focus on the enhancement of the current MCC limitations. Specifically, we present the most important features of HTML 5 organized in different categories and their contribution in the deployment of MCC applications. Finally, the results of the research carried out on evaluating HTML 5 in terms of a wide range of applications and specifications are reviewed.


πŸ“œ SIMILAR VOLUMES


[ACM Press the Fifth Balkan Conference i
✍ Armenska, Jasmina; Zdravkova, Katerina πŸ“‚ Article πŸ“… 2012 πŸ› ACM Press βš– 213 KB

Question Answering Systems (QAS) are an important research topic triggered and at the same time stimulated by the immense amount of texts available in digital form. As the quantity of natural language information increases, the necessity of new methods to precisely retrieve the exact information fro

[ACM Press the Fifth Balkan Conference i
✍ Ε trbac-SaviΔ‡, Svetlana; TomaΕ‘eviΔ‡, Milo πŸ“‚ Article πŸ“… 2012 πŸ› ACM Press βš– 278 KB

The AVL and red-black trees are the suboptimal variants of the binary search trees which can achieve the logarithmic performance of the search operation withot an excessive cost of the optimal balancing. After presenting a brief theoretical background, the paper comparatively evaluates the performan