Eduardo H. M. Pena, Marcos V. O. de Assis, M. L. Proença
{"title":"Anomaly Detection Using Forecasting Methods ARIMA and HWDS","authors":"Eduardo H. M. Pena, Marcos V. O. de Assis, M. L. Proença","doi":"10.1109/SCCC.2013.18","DOIUrl":"https://doi.org/10.1109/SCCC.2013.18","url":null,"abstract":"Understanding the normal operation of IP networks is a common step in building a solution for automatic detection of network anomalies. Toward this end, we analyze the usage of two different approaches: the AutoRegressive Integrated Moving Average (ARIMA) model and an improvement of the traditional Holt-winters method. We use both models for traffic characterization, called Digital Signature of Network Segment using Flow analysis (DSNSF), and volume anomaly or outliers detection. The DSNSFs obtained by the presented models are compared to the actual traffic of bits and packets of a real network environment and then subjected to specific evaluations in order to measure its accuracy. The presented models are capable of providing feedback through its predictive capabilities and hence provide an early warning system.","PeriodicalId":182181,"journal":{"name":"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128853745","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":"Digital Image Processing by a Parallel Selective Model","authors":"H. Shishido, R. Gonçalves, A. F. Silva","doi":"10.1109/SCCC.2013.20","DOIUrl":"https://doi.org/10.1109/SCCC.2013.20","url":null,"abstract":"The digital image processing has been used on many research segments as an instrument for pattern recognition and image filtering. However, depending on the image size and filtering type, the response time can take forever. In this context, this work shows a parallel selective model of a digital image processing algorithm. Two selection and three estimation policies are proposed in conjunction with the algorithm. The basic idea is to select the pixels that will be processed and reduce the execution time even if there is an acceptable loss of quality. The results confirm the advantages of the parallel selective model where the performance reaches 6.39 and the efficiency 80% in the cases evaluated in this work.","PeriodicalId":182181,"journal":{"name":"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125980406","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":"Testing MapReduce Programs: A Mapping Study","authors":"Luiz Carlos Camargo, S. Vergilio","doi":"10.1109/SCCC.2013.10","DOIUrl":"https://doi.org/10.1109/SCCC.2013.10","url":null,"abstract":"The MapReduce (MR) programming model is widely used in the development of parallel applications involving large data sets. Many research papers focus on quality attributes associated to the environments that execute MR programs. However, the test of such programs can be considered a challenger and an open research subject. Considering this fact, this paper presents results from a mapping study about testing of MR programs. The mapping searched by papers related to MR program test, which were analyzed according to the following dimensions: purpose, tools and environments, testing techniques, and criteria and types of fault. The achieved outcomes serve as motivation to stimulate and direct future research in this field.","PeriodicalId":182181,"journal":{"name":"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128940876","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":"Mobile Application Monitoring","authors":"Sebastian Vasquez, J. Simmonds","doi":"10.1109/SCCC.2013.16","DOIUrl":"https://doi.org/10.1109/SCCC.2013.16","url":null,"abstract":"To date, there are more than 800.000 applications available on each of the two largest mobile application markets (Google Play and Apple App Store), each reporting around 40 billion downloads in total. At this scale, it is impossible to analyze each application for malware behavior before making them available for download. Vendors mostly rely on user feedback to remove malware from their marketplaces, so it can take a while for these applications to be removed. In practice, users must be very careful when picking which applications to install. Moreover, it can be hard to detect a malware application once it is installed, unless the application has noticeable side-effects. To improve this situation, we propose a framework for performing runtime monitoring of mobile applications against behavioral correctness properties. These properties specify forbidden and desired interactions between applications and the phone's resources as sequences of events. The user can then determine which applications to uninstall based on which properties they violate. We have implemented a prototype of this framework for the Android operating system. In this first version of the framework, the user must specify the properties to be monitored directly as automata.","PeriodicalId":182181,"journal":{"name":"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127935395","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 Feasibility Analysis for the Application of Design Patterns in Search Based Product Line Design","authors":"Giovani Guizzo, T. Colanzi, S. Vergilio","doi":"10.1109/SCCC.2013.8","DOIUrl":"https://doi.org/10.1109/SCCC.2013.8","url":null,"abstract":"Design patterns have been successfully applied in the Search Based Software Engineering (SBSE) field to improve software architectures regarding some design principles, such as cohesion, coupling and reusability. However, we did not find, in the SBSE literature, approaches exploring the application of design patterns in software Product Line Architectures (PLAs). In this sense, this paper presents results from a feasibility analysis, conducted with GoF (Gang of Four) patterns, to verify their applicability in the context of a search-based approach for PLA design. The analysis considered the pattern structure, consequences of use according to some architectural metrics, flexibility and automation aspects. As a result, this paper also introduces a metamodel representation for scopes that are suitable to receive the design patterns application.","PeriodicalId":182181,"journal":{"name":"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116722617","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. A. Amaral, L. Mendes, Eduardo H. M. Pena, B. Zarpelão, M. L. Proença
{"title":"Network Anomaly Detection by IP Flow Graph Analysis: A DDoS Attack Case Study","authors":"A. A. Amaral, L. Mendes, Eduardo H. M. Pena, B. Zarpelão, M. L. Proença","doi":"10.1109/SCCC.2013.14","DOIUrl":"https://doi.org/10.1109/SCCC.2013.14","url":null,"abstract":"This paper introduces a novel approach for anomaly detection. The solution consists of an automatic detection system that operates without the need of network administrator intervention. Network IP flows are modeled by a graph and Tsallis entropy is applied in order to detect anomalies. Furthermore, our solution can extract and present detailed information from the network traffic. It provides to the network administrator a wide view of the damages that network anomalies cause. In order to evaluate the effectiveness of the proposed solution, it was used real data collected from a DDoS attack.","PeriodicalId":182181,"journal":{"name":"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121333315","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":"New Version of Davies-Bouldin Index for Clustering Validation Based on Cylindrical Distance","authors":"Juan Carlos Rojas Thomas, M. Peñas, M. Mora","doi":"10.1109/SCCC.2013.29","DOIUrl":"https://doi.org/10.1109/SCCC.2013.29","url":null,"abstract":"This paper presents a new version of Davies-Bouldin index for clustering validation through the use of a new distance based on density. This new distance, called cylindrical distance, is used as a similarity measurement between the means of the clusters, in order to overcome the limitations of the Euclidean distance. The cylindrical distance takes into account the distribution of the data set, using this information to estimate the densities along line segments that connect the centroids. In this way, the index gets a more accurate measurement of separation between clusters, improving its performance.","PeriodicalId":182181,"journal":{"name":"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129324852","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":"Parallel Lepp-Bisection Algorithm over Distributed Memory Systems","authors":"Pedro A. Rodríguez, M. Rivara","doi":"10.1109/SCCC.2013.32","DOIUrl":"https://doi.org/10.1109/SCCC.2013.32","url":null,"abstract":"We discuss a parallel Lepp-bisection algorithm for two-dimensional mesh refinement over distributed memory systems. We discuss the subdivision of the mesh and the management of interface refinement and communication. We also study the empirical algorithm behavior.","PeriodicalId":182181,"journal":{"name":"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131179881","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}
Miguel A. Alvarez-Carmona, J. A. Carrasco-Ochoa, J. Martínez-Trinidad
{"title":"Combining Techniques to Find the Number of Bins for Discretization","authors":"Miguel A. Alvarez-Carmona, J. A. Carrasco-Ochoa, J. Martínez-Trinidad","doi":"10.1109/SCCC.2013.11","DOIUrl":"https://doi.org/10.1109/SCCC.2013.11","url":null,"abstract":"In different problems and for different reasons, it is necessary to work with fully discretized domains. Commonly, continuous attributes are discretized in bins, but determining a suitable number of bins is a difficult task. In this paper, some ways for combining different techniques to estimate the number of bins for discretization are proposed and evaluated for both clustering and supervised classification tasks.","PeriodicalId":182181,"journal":{"name":"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128573077","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 Approach Based on Language Ontology and Serious Play Methodologies to Improve the Participation and Validation of Enterprise Architecture Structural Models","authors":"F. Sanhueza","doi":"10.1109/SCCC.2013.22","DOIUrl":"https://doi.org/10.1109/SCCC.2013.22","url":null,"abstract":"In the definition of Enterprise Architecture (EA) business and technology specialists participate, being the former the ones who know models of their endeavor and to whom the EA models are not natural and include complex issues that only the specialists understand. The detection of any inconsistency or gap can take place, in the worst case, during the implementation of technological solutions or, in more fortunate cases, at earlier stages. Counting with tools that facilitate mutual understanding using alternative models that bring closer team competences and the convergence of ideas and interests of both groups, is a challenge. This proposal presents how language ontology combined with strategy construction models of Lego Serious play in real time are a contribution in the definition and implementation of Enterprise Architecture. The validation is ratified with two projects, each one having made progress on its own: one with the Municipality de Cuenca, Ecuador, and the other with the General Coordination of Transantiago.","PeriodicalId":182181,"journal":{"name":"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116422585","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}