{"title":"Student research abstract: android malware detection based on Kullback-Leibler divergence","authors":"Vanessa N. Cooper","doi":"10.1145/2554850.2555186","DOIUrl":"https://doi.org/10.1145/2554850.2555186","url":null,"abstract":"A recent study shows that more than 50% of mobile devices running Google's Android mobile operating system (OS) have unpatched vulnerabilities, opening them up to malicious applications and malware attacks. The starting point of becoming a potential victim due to malware is to allow the installation of applications without knowing in advance the operations that an application can perform. In particular, many recent reports suggest that malware applications caused unwanted billing by sending SMS messages to premium numbers without the knowledge of the victim [1, 2]. Given that, there is a need for techniques to identify malicious behaviors of applications before installing them.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"99 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":"116680152","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}
Sang-Wook Kim, Ki-Nam Kim, Seok-Ho Yoon, Sunju Park
{"title":"Sampling in online social networks","authors":"Sang-Wook Kim, Ki-Nam Kim, Seok-Ho Yoon, Sunju Park","doi":"10.1145/2554850.2554907","DOIUrl":"https://doi.org/10.1145/2554850.2554907","url":null,"abstract":"In this paper, we propose a new graph sampling method for online social networks that achieves the following. First, a sample graph should reflect the ratio between the number of nodes and the number of edges of the original graph. Second, a sample graph should reflect the topology of the original graph. Third, sample graphs should be consistent with each other when they are sampled from the same original graph. The proposed method employs two techniques: hierarchical community extraction and densification power law. The proposed method partitions the original graph into a set of communities to preserve the topology of the original graph. It also uses the densification power law which captures the ratio between the number of nodes and the number of edges in online social networks. In experiments, we use several real-world online social networks, create sample graphs using the existing methods and ours, and analyze the differences between the sample graph by each sampling method and the original graph.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"1 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":"129416788","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 optimal device selection for user satisfaction of content sharing","authors":"Jiamei Tang, Paul Kim, Sangwook Kim","doi":"10.1145/2554850.2559920","DOIUrl":"https://doi.org/10.1145/2554850.2559920","url":null,"abstract":"With the paradigm from one-user-one-device to multi-device-one-user, people frequently switch between different devices to satisfy constant changes. The ultimate goal of researches about computing across multiple devices is to help people move hands-free across various devices. However, it is still a challenge to decide the most optimum device for a task under a certain environment. This paper proposes an optimal device selection for content sharing considering user satisfaction.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"109 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":"129606257","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":"Cooperative kernel: online memory test platform using inter-kernel context switch and memory isolation","authors":"Heekwon Park, Dongwook Kang, Jongmoo Choi","doi":"10.1145/2554850.2554972","DOIUrl":"https://doi.org/10.1145/2554850.2554972","url":null,"abstract":"In this paper, we propose a novel memory test platform that is based on the commodity operating systems such as Linux and MS Windows. The proposed memory test platform namely coKernel(cooperative Kernel) provides a facility to examine the entire physical memory, even the region occupied by the test program and operation system. To accomplish this facility, we devise several new techniques including multiple kernel instances, memory isolation, interkernel context switch and kernel hibernation. The multiple kernel instances and memory isolation make it possible to access the whole physical memory cells, while the inter-kernel context switch and kernel hibernation enables to modify memory contents as the way whatever a test program desire. Real implementation based experimental results have shown that the platform supports full memory test coverage with a reasonable overhead. For instance, the inter-kernel context switch and kernel hibernation takes less than 7 seconds on a system equipped with 32GB DRAM, which is quite small compared with the execution time of a test program.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"1 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":"128691879","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}
Andrew Kinai, R. Bryant, Aisha Walcott-Bryant, Eric Mibuari, Komminist Weldemariam, O. Stewart
{"title":"Traffic 411: a traffic congestion routing and awareness platform for Nairobi","authors":"Andrew Kinai, R. Bryant, Aisha Walcott-Bryant, Eric Mibuari, Komminist Weldemariam, O. Stewart","doi":"10.1145/2554850.2555148","DOIUrl":"https://doi.org/10.1145/2554850.2555148","url":null,"abstract":"According to UN-HABITAT, the city of Nairobi loses half a million USD daily due to congestion on roads designed for a city 10 times smaller. To address the traffic congestion problem in Nairobi, we develop a platform called Traffic 411 that provides drivers with real-time traffic and routing information. Traffic 411 incorporates locally relevant context (such as references to landmarks) to predict congestion and create traffic awareness. Our work extends a novel approach called Frugal Innovation developed at the IBM Tokyo Research Lab (TRL), where Web cameras covering only 3.5% of the roads in Nairobi are used to estimate traffic conditions. We deployed the Traffic 411 platform in Nairobi and our initial evaluation indicates that Traffic 411 enhances the driving experience and can be deployed in similar cities.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"138 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":"128723474","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}
Yalong Yang, Ning Dou, Shuai Zhao, Zhichao Yang, Kang Zhang, Quang Vinh Nguyen
{"title":"Visualizing large hierarchies with drawer trees","authors":"Yalong Yang, Ning Dou, Shuai Zhao, Zhichao Yang, Kang Zhang, Quang Vinh Nguyen","doi":"10.1145/2554850.2554870","DOIUrl":"https://doi.org/10.1145/2554850.2554870","url":null,"abstract":"Enclosure partitioning approaches, such as Treemaps, have proved their effectiveness in visualizing large hierarchical structures within a compact and limited display area. Most of the Treemaps techniques do not use node-links to show the structural relations. This paper presents a new tree visualization approach known as Drawer-Tree that can be used to present the structure, organization and interrelation of big data. By utilizing the display space with traditional node-link visualization, we have developed a novel method for visualizing tree structures with high scalability. The name \"drawer\" is a metaphor that helps people understand the visualization.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"1 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":"128278373","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}
Diego Elias, Rivalino Matias, M. Fernandes, Lucio Borges de Araujo
{"title":"Experimental and theoretical analyses of memory allocation algorithms","authors":"Diego Elias, Rivalino Matias, M. Fernandes, Lucio Borges de Araujo","doi":"10.1145/2554850.2555149","DOIUrl":"https://doi.org/10.1145/2554850.2555149","url":null,"abstract":"In this paper, we present an experimental study to compare six user-level memory allocators. In addition, we compare the experimental results with the asymptotic analyses of the evaluated algorithms. The experimental results show that parallelism affects negatively the investigated allocators. The theoretical analysis of the execution time demonstrated that all evaluated allocators show linear complexity with respect to the number of allocations.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"62 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":"128710679","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}
Gonçalo Antunes, Marzieh Bakhshandeh, Rudolf Mayer, J. Borbinha, A. Caetano
{"title":"Ontology-based enterprise architecture model analysis","authors":"Gonçalo Antunes, Marzieh Bakhshandeh, Rudolf Mayer, J. Borbinha, A. Caetano","doi":"10.1145/2554850.2555176","DOIUrl":"https://doi.org/10.1145/2554850.2555176","url":null,"abstract":"An enterprise architecture provides views on heterogeneous domains, such as business processes, people, business rules, application components, and technological infrastructure. These views are defined according to specific concerns and need to be expressed with an adequate description language. This entails integrating the description languages as a means to address the multiple concerns but raises the challenge of keeping the models coherent, consistent and traceable. This work describes an application of ontology engineering to enterprise architecture. The contribution is an extensible architecture description language that includes an upper ontology that can be integrated with multiple domain-specific ontologies, each focusing on different concerns. The resulting integrated models can be automatically analysed.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"96 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":"124645333","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":"Translating event-B to JML-specified Java programs","authors":"V. Rivera, Néstor Cataño","doi":"10.1145/2554850.2554897","DOIUrl":"https://doi.org/10.1145/2554850.2554897","url":null,"abstract":"We present a translation from Event-B machines to JML-specified Java class implementations and the EventB2Java Rodin plug-in that automates the translation. Producing JML specifications in addition to Java implementations enables users to write bespoke implementations that can then be checked for correctness using existing JML tools. We have validated the proposed translation by applying the EventB-2Java tool to various programs and systems.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"52 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":"126813097","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}
A. Pal, A. Visvanathan, A. Choudhury, Aniruddha Sinha
{"title":"Improved heart rate detection using smart phone","authors":"A. Pal, A. Visvanathan, A. Choudhury, Aniruddha Sinha","doi":"10.1145/2554850.2554888","DOIUrl":"https://doi.org/10.1145/2554850.2554888","url":null,"abstract":"Smart Phone based health care is a very recent topic and various methods for detection of heart rate are available. Reflective photoplethysmography (PPG) is used to measure heart rate of a person while placing the finger on the camera of a smart phone. In this paper, authors have proposed the usage of certain signal processing components to enhance the performance while retaining low complexity. Overlapping window based approach improves the accuracy of the solution. Post processing components are implemented in both time and frequency domain to detect the erroneous signals and remove false positives. Results indicate that, by additionally employing the above components, more than 50% improvement in heart rate detection accuracy is achieved as compared to a standard spectral based approach.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"52 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":"130602357","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}