{"title":"Harnessing the unknown in advanced metering infrastructure traffic","authors":"Valentin Tudor, M. Almgren, M. Papatriantafilou","doi":"10.1145/2695664.2695725","DOIUrl":"https://doi.org/10.1145/2695664.2695725","url":null,"abstract":"The Advanced Metering Infrastructure (AMI), a key component for smart grids, is expanding with more installed devices. Due to security and privacy concerns, the communication between these devices is encrypted, making it more secure against malicious third parties but also obscuring the ability of the network owner to detect any misbehaving user or equipment. We are investigating how to balance the need for confidentiality with the need to monitor the AMI. More specifically, we develop one important component for an AMI Intrusion Detection System (IDS), which can accurately determine the individual commands (but not their content) sent between AMI devices even when they are sent over an encrypted channel or in a protocol that the IDS cannot parse. We explain our methodology and propose features which summarize traffic characteristics. We conduct a feasibility study based on representative protocols in AMI and demonstrate the real utility of this IDS component. Our results are validated experimentally using two different datasets containing realistic traffic captured from two different AMI testbeds.","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116240243","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}
D. Min, Taegyu Hwang, Joonhyouk Jang, Yookun Cho, Jiman Hong
{"title":"An efficient backup-recovery technique to process large data in distributed key-value store","authors":"D. Min, Taegyu Hwang, Joonhyouk Jang, Yookun Cho, Jiman Hong","doi":"10.1145/2695664.2696015","DOIUrl":"https://doi.org/10.1145/2695664.2696015","url":null,"abstract":"As the demand for the high-speed processing of mass data increases, the use of in-memory systems is increasing. In-memory systems enable data to be accessed in memory, thereby allowing for its high-speed processing. However, as the size and volume of the data increases, its recovery speed from a replicated server gets slower. In this paper, we propose a backup-recovery technique allowing quick recovery by distributing and replicating data onto various slave servers and recovering them data from the simultaneously during disaster recovery. We realized the proposed technique using Redis, an open source distributed memory system. The results showed that the equal key distribution and recovery performance with the proposed technique was improved by 51.4%.","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116439792","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":"Dynamic associativity management using utility based way-sharing","authors":"Shirshendu Das, H. Kapoor","doi":"10.1145/2695664.2695783","DOIUrl":"https://doi.org/10.1145/2695664.2695783","url":null,"abstract":"The non-uniform distribution of memory accesses of todays applications affect the performance of cache memories. Due to such non-uniform accesses some sets of large sized caches are used heavily while some other sets are used lightly. This paper presents a technique WS-DAM, to dynamically increase the associativity of the heavily used sets without increasing the cache size. The heavily used sets can use the idle ways of the lightly used sets to distribute the load. A limited number of ways from every lightly used set are reserved for the heavily used sets. To search a block in a heavily used set, both: the set and the entire reserve area is searched. To reduce the cost of searching the entire reserve storage an additional tag-array is used. During execution the sets are re-categorized at intervals. The proposed technique needs much lesser storage, area and power overhead as compared to the other similar techniques. It improves both miss rate and CPI by 14.46% and 6.63% respectively as compared to an existing technique called V-Way. WS-DAM is also compared with another existing proposal called CMP-VR and it improves the performance by 9% and 4.20% in terms of miss-rate and CPI respectively.","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122595541","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}
Nick Papoulias, M. Denker, Stéphane Ducasse, L. Fabresse
{"title":"Reifying the reflectogram: towards explicit control for implicit reflection","authors":"Nick Papoulias, M. Denker, Stéphane Ducasse, L. Fabresse","doi":"10.1145/2695664.2695883","DOIUrl":"https://doi.org/10.1145/2695664.2695883","url":null,"abstract":"Reflective facilities in OO languages are used both for implementing language extensions (such as AOP frameworks) and for supporting new programming tools and methodologies (such as object-centric debugging and message-based profiling). Yet controlling the run-time behavior of these reflective facilities introduces several challenges, such as computational overhead, the possibility of metarecursion and an unclean separation of concerns between base and meta-level. In this paper we present five dimensions of meta-level control from related literature that try to remedy these problems. These dimensions are namely: temporal and spatial control, placement control, level control and identity control. We argue that the reification of the descriptive notion of the reflectogram, can unify the control of meta-level execution in all these five dimensions. We present a model for the reification of the reflectogram and validate our approach through a prototype implementation in the Pharo programming environment. Finally we detail a case-study on run-time tracing illustrating our approach.","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121991598","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":"Design pattern detection using FINDER","authors":"Haneen Dabain, A. Manzer, Vassilios Tzerpos","doi":"10.1145/2695664.2695900","DOIUrl":"https://doi.org/10.1145/2695664.2695900","url":null,"abstract":"This paper introduces the FINDER tool that detects 22 out of 23 GoF design patterns in Java systems using fine-grained static analysis. FINDER extracts static facts from the system at hand. These facts are then evaluated against the design pattern detection scripts to produce a list of design pattern candidates. The tool has been evaluated by applying it to several open source systems. In this paper, we present one such case study that compares FINDER to other existing design pattern detection tools.","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129620080","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":"On the similarities between control based and behavior based visual servoing","authors":"Benjamin Fonooni, T. Hellström","doi":"10.1145/2695664.2695949","DOIUrl":"https://doi.org/10.1145/2695664.2695949","url":null,"abstract":"Robotics is tightly connected to both artificial intelligence (AI) and control theory. Both AI and control based robotics are active and successful research areas, but research is often conducted by well separated communities. In this paper, we compare the two approaches in a case study for the design of a robot that should move its arm towards an object with the help of camera data. The control based approach is a model-free version of Image Based Visual Servoing (IBVS), which is based on mathematical modeling of the sensing and motion task. The AI approach, here denoted Behavior-Based Visual Servoing (BBVS), contains elements that are biologically plausible and inspired by schema-theory. We show how the two approaches lead to very similar solutions, even identical given a few simplifying assumptions. This similarity is shown both analytically and numerically. However, in a simple picking task with a 3 DoF robot arm, BBVS shows significantly higher performance than the IBVS approach, partly because it contains more manually tuned parameters. While the results obviously do not apply to all tasks and solutions, it illustrates both strengths and weaknesses with both approaches, and how they are tightly connected and share many similarities despite very different starting points and methodologies.","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129849857","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}
Daniel E. Krutz, Samuel A. Malachowsky, Emad Shihab
{"title":"Examining the effectiveness of using concolic analysis to detect code clones","authors":"Daniel E. Krutz, Samuel A. Malachowsky, Emad Shihab","doi":"10.1145/2695664.2695929","DOIUrl":"https://doi.org/10.1145/2695664.2695929","url":null,"abstract":"During the initial construction and subsequent maintenance of an application, duplication of functionality is common, whether intentional or otherwise. This replicated functionality, known as a code clone, has a diverse set of causes and can have moderate to severe adverse effects on a software project in a variety of ways. A code clone is defined as multiple code fragments that produce similar results when provided the same input. While there is an array of powerful clone detection tools, most suffer from a variety of drawbacks including, most importantly, the inability to accurately and reliably detect the more difficult clone types. This paper presents a new technique for detecting code clones based on concolic analysis, which uses a mixture of concrete and symbolic values to traverse a large and diverse portion of the source code. By performing concolic analysis on the targeted source code and then examining the holistic output for similarities, code clone candidates can be consistently identified. We found that concolic analysis was able to accurately and reliably discover all four types of code clones with an average precision of .8, recall of .91, F-score of .85 and an accuracy of .99.","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128473127","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":"Force model of a robotic particle chain for 3d displays","authors":"Matteo Lasagni, K. Römer","doi":"10.1145/2695664.2695932","DOIUrl":"https://doi.org/10.1145/2695664.2695932","url":null,"abstract":"We aim to construct a 3D screen -- an initially at 2D surface that can fold into the third dimension to display arbitrary three dimensional surface shapes. Our approach is based on chains of robotic particles that can be individually actuated to fold into a desired curve. This paper contributes a computational model of the forces acting on the robotic particles. Experimental results show that the model accurately predicts reality. The model forms the core of force-minimizing planning algorithms that compute a folding sequence approximating a given target curve while minimizing the actuation forces. The model is also instrumental for simulation tools that allow to study forces while executing a given folding sequence.","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128382522","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":"Identification of embedded control units by state encoding and power consumption analysis","authors":"Edward Jung, Cédric Marchand, L. Bossuet","doi":"10.1145/2695664.2695963","DOIUrl":"https://doi.org/10.1145/2695664.2695963","url":null,"abstract":"We propose non-destructive embedding and verification methods for protecting the intellectual properties of an embedded control unit. The proposed methods do not require augmenting the original finite state machine which specifies the control unit. Experimental results show the feasibility of the methods.","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128549837","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}
Italo Carlo Lopes Silva, P. Brito, B. Neto, E. Costa, Andre Almeida Silva
{"title":"A decision-making tool to support architectural designs based on quality attributes","authors":"Italo Carlo Lopes Silva, P. Brito, B. Neto, E. Costa, Andre Almeida Silva","doi":"10.1145/2695664.2695928","DOIUrl":"https://doi.org/10.1145/2695664.2695928","url":null,"abstract":"The success of a software project is strongly related with architectural design. However, designing the right Software Architecture is a very subjective task and takes a long time, being much influenced by architect's experience and the quality of requirements engineering. This architectural knowledge, usually, is not documented, since it is considered tacit knowledge of architects or other stakeholders, and eventually dissipates. The objective of this paper is to present a tool that supports young architects by recommending a suitable architectural style, based on the system's requirements, particularly the quality attributes of the system. The tool encompasses both trade-off resolution over quality attributes and recommendation of architectural styles based on quality attributes. The proposed solution has been evaluated in the context of a specific domain of Learning Management System (LMS), in order to illustrate the tool support in the execution of an architectural design process.","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130332938","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}