{"title":"A Framework for Monitoring and Mitigating Malicious Attacks in Structured P2P Overlay Networks","authors":"Zied Trifa, Maher Khemakhem","doi":"10.1109/aiccsa.2017.224","DOIUrl":"https://doi.org/10.1109/aiccsa.2017.224","url":null,"abstract":"Structured p2p overlay networks are vulnerable to malicious nodes which can control more than one identities. In such situation, they can mediate and monitor most overlay traffic. The decentralized and dynamic nature of such systems makes the detection of these nodes a very difficult task. In this paper we present a framework for monitoring and mitigating malicious attacks. We argued that monitoring traffic allows us to identify suspicious behavior. Our key idea is to divide the overlay into zones to reduce the number of monitors and capture traffic without disruption the routing protocol. Our solution generates measurements on the whole network and provides a Preset profile, finding a set of peers with malicious behavior that do not follow this profile. Evaluation shows that our framework has a good performance and can detect malicious nodes that are intended to malign the overlay.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127111751","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 Adaptive Genetic Algorithm for the Capacitated Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints","authors":"Ines Sbai, Olfa Limam, S. Krichen","doi":"10.1109/AICCSA.2017.18","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.18","url":null,"abstract":"In this paper, we present a generalisation of the Capacitated Vehicle Routing problem where customer demand is composed of two-dimensional weighted items, with a time windows, called 2L-CVRPTW. The objective consists in designing a set of trips, starting and terminating at a central depot, minimizing the total transportation cost with a homogenous fleet of vehicles based on a depot node. Items in each vehicle trip must satisfy the two-dimensional orthogonal packing constraint. In literature, several exact and approximate approaches was proposed to find the best and the most feasible solution to the problem. In this paper, we use an adaptive genetic algorithm (GA) to solve the 2L-CVRPTW using an ordered crossover operator. The effectiveness of our approach was demonstrated through experiments on benchmark instances. The results showed that our proposed approach is competitive in terms of the quality of the solutions found.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127225731","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":"ECTD: Evidential Clustering and Case Types Detection for Case Base Maintenance","authors":"S. B. Ayed, Zied Elouedi, E. Lefevre","doi":"10.1109/AICCSA.2017.163","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.163","url":null,"abstract":"The key factor for the success of Case Based Reasoning (CBR) systems is the quality of their case bases as well as the time spent in case retrieval process which is mainly depending on case bases' size. Indeed, the speed of the retrieval process is seriously decreasing when the case base becomes so heavy. To vouch for case bases' quality, a maintenance process must be provided. Hence, a field for Case Base Maintenance (CBM) emerges. However, a lot of works in CBM field suffers from some limitations and they generally reduce case base's competence during maintenance, especially when cases involving imprecise or uncertain information. To deal with these problems, we propose, in this paper, a new CBM approach named ECTD, Evidential Clustering and case Types Detection for case base maintenance, which is able to manage imperfection in cases by using belief function theory. The key idea of ECTD approach is to use machine learning technique, more accurately the evidential c-means (ECM). Then, it divides cases relative to the different partitions of clusters into four types so that we can subsequently perform the case base maintenance.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129989388","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":"Investigation of Possibilities to Detect Malware Using Existing Tools","authors":"Ömer Aslan, R. Samet","doi":"10.1109/AICCSA.2017.24","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.24","url":null,"abstract":"Malware stands for malicious software, which is installed on a computer system without the knowledge of the system owner. It performs malicious actions such as stealing confidential information and allowing remote code execution, and it can cause denial of service. Recently, malware creators started to publish new malware, which can bypass anti-malware software, intrusion detection systems (IDS) and sandbox execution. Due to this evasion, the protection of computer networks and computerized systems against these programs has become one of the biggest challenges in the information security realm. This paper proposes a methodology to learn the well-known malware analysis and detection tools, to implement these tools on well-known malware and benign programs and to compare the obtained results. Further, this research will suggest to users how to analyze and detect existing and unknown malware. In a test case, 100 malware and 100 benign program samples were collected from different sources and analyzed under different versions of Windows machines. The test results indicated that it is almost impossible to detect malware by only using one tool. Using static and dynamic analysis tools together increased accuracy and the detection rate. The test results also showed that dynamic malware analysis tools outperformed static analysis tools.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131027450","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":"Impact of Sink Mobility on Quality of Service Performance and Energy Consumption in Wireless Sensor Network with Cluster Based Routing Protocols","authors":"Abdelbari Ben Yagouta, Maher Jabberi, B. Gouissem","doi":"10.1109/AICCSA.2017.198","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.198","url":null,"abstract":"Wireless Sensor Network (WSN) is a network with limited power sensing devices with a communications infrastructure for monitoring physical or environmental conditions. The main concern of WSN is the energy consumption especially during routing of collected data to sink. In this context, cluster based routing protocols have shown considerable conservation of energy by reducing the number of transmitter nodes. On the other hand, the optimal deployment of the sink in the controlled field can also conserve network energy by reducing distances between the emitting nodes and the sink. However, deploy a sink in the middle of the controlled field is almost impossible for WSN applications such as battlefield control, the control of seismic, volcanic and toxic zone. Several works have shown that the use of a mobile sink can save this situation, by providing energy conservation similar to a sink centered in the field. However, these works did not focus on the impact of sink mobility on quality of service metrics, which is of considerable importance especially for real-time applications. In this paper, we will study the impact of sink mobility on energy consumption and QoS metrics in WSN with hierarchical routing protocols under various scenarios. Simulation results have shown that sink mobility improves energy consumption, throughput, reliability and packets latency, compared to a sink located outside the field, and may even give better results than a centered sink. Nevertheless, with high node densities and high packet rate, latency and reliability abruptly degrade.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130777016","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":"Maximizing the Parallelism Degree for Optimal Computing of Matrix Chain Products","authors":"Khaoula Bezzina, Z. Mahjoub","doi":"10.1109/AICCSA.2017.132","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.132","url":null,"abstract":"We are interested in a specific combinatorial optimization problem solved by an exact dynamic programming algorithm (DPA), namely the matrix chain product problem (MCPP) with two of its variants i.e. the standard (ST) one where the matrices are rectangular and the variant were the matrices are square and either dense or triangular (DT). Solving the MCPP consists in first determining an optimal parenthesization (OP) minimizing the number of required operations then computing the product matrix (PM) according to the OP which may be represented by a binary in-tree (BiT) where each node corresponds to a matrix product and is weighted by the number of required operations. Our aim is to design an efficient parallel computing of the PM. It turns out that, given an OP and the associated BiT, the cost of a critical path (CCP) is equal to the minimal cost of a parallel computing of the PM and the width of the BiT corresponds to the parallelism degree i.e. the number of required processors. It is within this scope that we propose a modified DPA based on a heuristic approach aiming to deter-mining a particular OP by maximizing the width of the associated BiT which leads to minimize its height hence the CCP. Our contribution is validated by achieving a series of experiments following a preliminary phase were we check for each input chain the existence of several OPs. Each obtained OP exhibiting the maximal parallelism degree is compared with a set of other OPs obtained in the ST variant of the MCPP by a particular approach determining several OPs and in the DT variant by specific exact greedy algorithms.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130797497","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 Driven Approach for Modelling and Running Flexible Cloud Service Workflows","authors":"Imen Ben Fraj, Y. Hlaoui, L. BenAyed","doi":"10.1109/AICCSA.2017.88","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.88","url":null,"abstract":"Cloud computing is a new model for deploying and executing flexible workflow composed of cloud services. One of the expected facilities of Cloud environments is flexibility at different levels. In this paper, we propose a Model-Driven Approach (MDA) for the specification and the execution of cloud service flexible workflow applications. We define two flexibility patterns based on BPMN(Business Process Model and Notation) that deals with changes of resource requirements for workflow. The workflows are built on an abstract level, using a BPMN model for the specification of the cloud service workflow structure based on flexibility patterns, and the state-chart diagram for the specification of the cloud service workflow behavior. The execution process is supervised by a control system which is responsible for making decisions on the execution of the workflow based on the behavior of the engine defined by the state-chart diagram.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128855140","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":"Co-scheduling Data and Task for a Data-Driven Distribution of Data-Intensive Applications","authors":"M. Labidi, M. Jemni, Maher Khemakhem","doi":"10.1109/AICCSA.2017.225","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.225","url":null,"abstract":"In distributed computing, data scheduling is becoming an important field of research with the emergence of Big Data. High level features provided by software data scheduler often rely on data management policies – possibly user-defined – such as fault tolerance, multi-protocol file transfer, reliable and multi-tenant storage, security and data privacy, locality-aware data distribution etc. Nowadays, to execute data-intensive applications, such advanced features become necessary, and this means that data and task schedulers are capable to cooperate closely. In this paper, we propose a data driven cooperative platform by combining two existing middleware: XtremWeb-HEP, as the task scheduler, and BitDew, as the data scheduler. Taking advantage of both middleware, our solution allows user to select the suitable data scheduling strategy as well as the adequate task granularity which provide the optimal data distribution. To evaluate the efficiency of our approach, we compare different strategies of scheduling tasks and data and prove the efficiency of the cooperation of data and task schedulers to execute data-intensive applications.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122211248","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}
Celio Trois, Daniel Weingaertner, Diego Pasqualin, Edemir Maciel, E. Almeida, Fabiano Silva, Hegler C. Tissot, L. C. E. Bona, M. Castilho, Marcos Didonet Del Fabro, M. Sunyé
{"title":"Transparency Meets Management: A Monitoring and Evaluating Tool for Governmental Projects","authors":"Celio Trois, Daniel Weingaertner, Diego Pasqualin, Edemir Maciel, E. Almeida, Fabiano Silva, Hegler C. Tissot, L. C. E. Bona, M. Castilho, Marcos Didonet Del Fabro, M. Sunyé","doi":"10.1109/AICCSA.2017.17","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.17","url":null,"abstract":"The Brazilian government is maintaining several digital inclusion projects, providing computers and Internet connection to developing regions around the country. However, these projects can only succeed if they are constantly assessed; namely, the projects infrastructure deployment must be closely monitored and evaluated. In this paper, we introduce a system called SIMMC, which is currently monitoring and evaluating more than 4,500 computing devices from Brazilian digital inclusion projects. This system is innovative because, in addition to being used by the government for managing and expanding its projects, the collected data is also publicly available on a web page, allowing the citizens to follow the projects' deployment. We describe the SIMMC architecture, reporting some techniques used to optimize its data analysis processes, and describe how the information acquired and presented by the system has been used to enable public administration overhaul and improve efficiency on the project management, as well as its strategic use for security, theft, and defrauding.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127552162","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}
M. Alsmirat, Ethar El-Qawasmeh, M. Al-Ayyoub, N. Damer, Y. Jararweh
{"title":"Building an Image Database for Studying Image Retargeting","authors":"M. Alsmirat, Ethar El-Qawasmeh, M. Al-Ayyoub, N. Damer, Y. Jararweh","doi":"10.1109/AICCSA.2017.209","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.209","url":null,"abstract":"Modern electronic devices(such as TVs, laptops, and mobile devices) come with a huge variety in screen sizes, resolutions, and aspect ratios. Image retargeting is a technique to retarget or (resize) an image to better utilize the viewing device screen and to protect the main content of the image. Different retargeting techniques have been proposed in the literature that mainly utilizes one of the following main techniques: cropping, seam carving, and scale and stretch. The current problem of image retargeting is that it is very hard to determine the best technique to use on an image to get a target dimension. To apply techniques such as machine learning to determine the best technique to perform image retargeting, an annotated image set is needed to perform the training step. In this work, we build and annotate an image set that is suitable to develop such advance retargeting techniques. We build a dataset that include 500 original images. We apply 4 different retargeting techniques to get two different sizes. The resulting image set contains 4000 images annotated by three people. We also analyze the annotation results to get useful remarks from the annotators perceptual point of view.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131459736","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}