R. Sousa, F. Ramos, Antonio Alexandre Moura Costa, Giovanni Calheiros, H. Almeida, A. Perkusich, A. F. Martins
{"title":"A recommendation approach for digital TV systems based on multimodal features","authors":"R. Sousa, F. Ramos, Antonio Alexandre Moura Costa, Giovanni Calheiros, H. Almeida, A. Perkusich, A. F. Martins","doi":"10.1145/2554850.2555154","DOIUrl":"https://doi.org/10.1145/2554850.2555154","url":null,"abstract":"Digital TV content providers are becoming widespread, with hundreds of programs available each day. The information overload makes difficult for the user to find programs of interest. To help the user, Recommendation Systems (RS) are a popular path. However, applying RS to some environments is not easy, either due to the lack or insufficiency of data to create accurate recommendations. In Digital TV domain, the main information available to make recommendations is the Electronic Program Guide (EPG) that is limited, containing only reduced textual data, making difficult to get an accurate recommendation using standard techniques. In this work we introduce a multimodal approach to recommend Digital TV programs, combining EPG text and visual information. We experimentally demonstrated that using multimodal features improved accuracy when compared with RS standard approaches.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133784367","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Srinivas Pinisetty, Yliès Falcone, Thierry Jéron, H. Marchand
{"title":"Runtime enforcement of regular timed properties","authors":"Srinivas Pinisetty, Yliès Falcone, Thierry Jéron, H. Marchand","doi":"10.1145/2554850.2554967","DOIUrl":"https://doi.org/10.1145/2554850.2554967","url":null,"abstract":"Runtime enforcement is a verification/validation technique aiming at correcting (possibly incorrect) executions of a system of interest. In this paper, we consider enforcement monitoring for systems with timed specifications (modeled as timed automata). We consider runtime enforcement of any regular timed property specified by a timed automaton. To ease their design and their correctness-proof, enforcement mechanisms are described at several levels: enforcement functions that specify the input-output behavior, constraints that should be satisfied by such functions, enforcement monitors that implement an enforcement function as a transition system, and enforcement algorithms that describe the implementation of enforcement monitors. The feasibility of enforcement monitoring for timed properties is validated by prototyping the synthesis of enforcement monitors.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"86 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133652230","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A hierarchical model for traceability between requirements and architecture","authors":"Jeho Oh, Sungwon Kang","doi":"10.1145/2554850.2554984","DOIUrl":"https://doi.org/10.1145/2554850.2554984","url":null,"abstract":"This paper presents a formal traceability model that describes the linkage between requirements and architecture. This model creates a hierarchical structure of describing how the architecture is decomposed recursively level by level thereby making the trace creation scalable. The proposed traceability model enables the architect to establish and understand the traces over different decomposition levels in a consistent manner. Benefits of the proposed model are demonstrated with a nontrivial case study.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133678952","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A test framework for large scale declarative queries: preliminary results","authors":"Amin Mesmoudi, Mohand-Said Hacid","doi":"10.1145/2554850.2555102","DOIUrl":"https://doi.org/10.1145/2554850.2555102","url":null,"abstract":"This paper presents preliminary results of experiments conducted on PT1.11 and PT1.22 data sets in order to compare the performances of both centralized and distributed database management systems. As for centralized systems, we deployed three different DBMSs: Mysql, Postgresql and DBMS-X (a commercial relational database). Regarding distributed systems, we deployed HadoopDB and Hive. The goal of these experiments is to report on the ability of these systems to support large scale declarative Queries.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122210826","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
E. Kühn, Stefan Craß, Gerson Joskowicz, Martin Novak
{"title":"Flexible modeling of policy-driven upstream notification strategies","authors":"E. Kühn, Stefan Craß, Gerson Joskowicz, Martin Novak","doi":"10.1145/2554850.2555153","DOIUrl":"https://doi.org/10.1145/2554850.2555153","url":null,"abstract":"We present the advantages of a new coordination model termed \"Peer Model\" for the design of coordination strategies and introduce new extensions for the modeling of time and reference. The motivating example is the wireless, reliable, and timely upstream propagation of events about approaching trains, detected by sensors, to a rail crossing. Embedded wireless nodes along the tracks propagate the events upstream. The Peer Model provides flexibility, as new requirements do not demand a complete re-design and reimplementation of notification strategies, which is achieved by means of high-level abstractions, modularization, and patterns with exchangeable policies.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116801925","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A parameter-free label propagation algorithm using bipartite heterogeneous networks for text classification","authors":"R. G. Rossi, A. Lopes, S. O. Rezende","doi":"10.1145/2554850.2554901","DOIUrl":"https://doi.org/10.1145/2554850.2554901","url":null,"abstract":"A bipartite heterogeneous network is one of the simplest ways to represent a textual document collection. In such case, the network consists of two types of vertices, representing documents and terms, and links connecting terms to the documents. Transductive algorithms are usually applied to perform classification of networked objects. This type of classification is usually applied when few labeled examples are available, which may be worthwhile for practical situations. Nevertheless, for existing transductive algorithms users have to set several parameters that significantly affect the classification accuracy. In this paper, we propose a parameter-free algorithm for transductive classification of textual data, referred to as LPBHN (Label Propagation using Bipartite Heterogeneous Networks). LPBHN uses a bipartite heterogeneous network to perform the classification task. The proposed algorithm presents accuracy equivalent or higher than state-of-the-art algorithms for transductive classification in heterogeneous or homogeneous networks.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116823852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Cloud adoption: prioritizing obstacles and obstacles resolution tactics using AHP","authors":"S. Zardari, R. Bahsoon, A. Ekárt","doi":"10.1145/2554850.2555067","DOIUrl":"https://doi.org/10.1145/2554850.2555067","url":null,"abstract":"The enormous potential of cloud computing for improved and cost-effective service has generated unprecedented interest in its adoption. However, a potential cloud user faces numerous risks regarding service requirements, cost implications of failure and uncertainty about cloud providers' ability to meet service level agreements. These risks hinder the adoption of cloud. We extend the work on goal-oriented requirements engineering (GORE) and obstacles for informing the adoption process. We argue that obstacles prioritisation and their resolution is core to mitigating risks in the adoption process. We propose a novel systematic method for prioritising obstacles and their resolution tactics using Analytical Hierarchy Process (AHP). We provide an example to demonstrate the applicability and effectiveness of the approach. To assess the AHP choice of the resolution tactics we support the method by stability and sensitivity analysis.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131909587","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A model-based approach to test automation for context-aware mobile applications","authors":"Tobias Griebe, V. Gruhn","doi":"10.1145/2554850.2554942","DOIUrl":"https://doi.org/10.1145/2554850.2554942","url":null,"abstract":"Current testing tools for mobile applications do not provide sufficient support for context-aware application testing. In addition to regular input vectors (e.g. touch events, text entry) context parameters must be considered (e.g. accelerometer data interpreted as shake gestures, GPS location data, etc.). A multitude of possible application faults resulting from these additional context parameters requires an appropriately selected set of test cases. In this paper, we propose a model-based approach to improve the testing of context-aware mobile applications by deducing test cases from design-time system models. Using a custom-built version of the calabash-android testing framework enhanced by an arbitrary context parameter facility, our approach to test case generation and automated execution is validated on a context-aware mobile application.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134304809","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ting Liu, Yuhong Gui, Yanan Sun, Yang Liu, Yao Sun, Feng Xiao
{"title":"SEDE: state estimation-based dynamic encryption scheme for smart grid communication","authors":"Ting Liu, Yuhong Gui, Yanan Sun, Yang Liu, Yao Sun, Feng Xiao","doi":"10.1145/2554850.2555033","DOIUrl":"https://doi.org/10.1145/2554850.2555033","url":null,"abstract":"The vision of smart grid relies heavily on the communication technologies as they provide a desirable infrastructure for real-time measurement, transmission, decision and control. But various attacks such as eavesdropping, information tampering and malicious control command injection that are hampering the communication in Internet, would impose great threat on the security and stability of smart grids. In this paper, a State Estimation-based Dynamic Encryption (SEDE) scheme is proposed to secure the communication in smart grid. Several states of power system are employed as the common secrets to generate a symmetric key at both sides, which are measured on the terminals and calculated on the control center using state estimation. The advantages of SEDE are 1) the common secrets, used to generate symmetric key, are never exchanged in the network due to the state estimation, that observably improves the security of SEDE; 2) the measurement and state estimation are the essential functions on the terminals and control center in power system; 3) the functions, applied to encrypt and decrypt data, are simple and easy-implemented, such as XOR, Hash, rounding, etc. Thus, SEDE is considered as an inherent, light-weight and high-security encryption scheme for smart gird. In the experiments, SEDE is simulated on a 4-bus power system to demonstrate the process of state estimation, key generation and error correction.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134473494","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An energy-aware service composition framework for service-oriented wireless sensor networks","authors":"Tao Wang, Ke Zhang, Lianglun Cheng","doi":"10.1145/2554850.2555086","DOIUrl":"https://doi.org/10.1145/2554850.2555086","url":null,"abstract":"Unlike the web services which are software-based and supported with adequate resources, service composition in wireless sensor network is affected by the limited power supply, residual memory and computational ability of the heterogeneous sensor node. In this paper, we proposed an energy-aware service composition framework for developing various applications in the service-oriented heterogeneous wireless sensor network. We have exploited two different energy-aware metrics: energy-aware load-balancing and overall energy consumption. With both the metrics, we have formulated the process of energy-aware sensor service composition into a combinatorial optimization problem and proposed an improved discrete particle swarm optimization (IDPSO) algorithm to compute the optimal service route. Through simulation of energy-aware service composition, we demonstrate that the performance of the service route given by IDPSO is approximately equal to the best service route searched out by the exhaustive composition algorithm. The experiment results have shown that our proposed method is able to reduce the energy consumption, prolong the lifetime of the sensor network and provide stable service composition for various applications.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133117586","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}