{"title":"A Trust Reputation Architecture for Cloud Computing Environment","authors":"Luís Felipe Bilecki, Adriano Fiorese","doi":"10.1109/AICCSA.2017.31","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.31","url":null,"abstract":"Cloud computing provides computational resources (processing, storage, software, network) to users in a scalable and dynamic way over the Internet. The use of these resources are impacted by issues related to privacy, security and trust. In this sense, this paper presents a trust reputation architecture applied in the cloud computing environment. The reputed trust is based on two trust indicators: objective and subjective ones. The objective trust indicator is based on the historical QoS indicators of a cloud provider. Then, the subjective trust indicator is composed of the users' feedbacks to the cloud providers. In order to evaluate the proposed architecture, simulations were performed using a P2P Network Simulator in order to emulate cloud providers and their clients. The evaluation results show the architecture applicability with low overhead.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"297 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":"115023348","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":"Community Detection in Social Network with Node Attributes Based on Formal Concept Analysis","authors":"Nourhene Khediri, Wafa Karoui","doi":"10.1109/AICCSA.2017.200","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.200","url":null,"abstract":"As far as social networks are concerned, new applications appear to analyze them. Community detection is one of the most important issues. It allows to understand the structure of complex networks and to extract useful information from the detected communities. Users have usually a social interaction with their friends because of their common interests or their similar profiles. In this paper, attributed graphs are considered, where entities of the network are described using attributes with several modalities. Then, we propose an hybrid approach based on Formal Concept Analysis (FCA) for community detection in social network with node attributes. This method, called ACDC (Attributed Community Detection based on Concepts), combines the structure of the network and the attributes of the nodes. ACDC, semantically and statically, partitions an assigned graph into k densely connected communities, using maximal cliques, with homogeneous attribute values derived from FCA. Experimental results demonstrate the effectiveness of ACDC through comparison with the state-of-the-art graph clustering and methods. Our method provides also more meaningful communities than conventional methods that consider only relationship information.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"8 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":"115259284","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":"LTKA-AC: Lightweight and Trusted Key Agreement Based on IBE with Anonymous Communication","authors":"Sarra Jebri, M. Abid, A. Bouallègue","doi":"10.1109/AICCSA.2017.27","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.27","url":null,"abstract":"The key agreement protocol is essential to secure communication between communicating entities. However, the new constrained devices such as smart sensors do not support the existing key agreement due to the computation overheads. In addition, ensuring trust between entities is a challenge task in the network. In this paper, a light-weighted and trusted key agreement protocol is proposed between anonymous users. It guarantees safe communication with light computation cost. The new designed protocol is based on Identity Based Encryption (IBE); Private Key Generator (PKG) and Pseudonym Based Cryptography (PBC). Moreover, an evaluation of performance related to security and cost is discussed to prove the protocol's efficiency sheet.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"69 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":"121935594","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":"Semi Supervised Relevance Learning for Feature Selection on High Dimensional Data","authors":"Afef Ben Brahim, Alexandros Kalousis","doi":"10.1109/AICCSA.2017.192","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.192","url":null,"abstract":"Nowadays, the advanced technologies make amounts of data growing in a fast paced way. In many application fields, this trend concerns specially dimensions of the data. It is the case where features are about thousands and tens of thousands, while the number of instances is much smaller. This phenomenon is known as the curse of dimensionality and it results in modest classification performance and feature selection instability. In order to deal with this issue, we propose a new feature selection approach that makes use of background knowledge about some dimensions known to be more relevant, as a means of directing the feature selection process. In this approach, prior knowledge about some features is used to learn new relevant features by a semi supervised approach. Experiments on three high dimensional data sets show promising results on both classification performance and stability of feature selection.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"73 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":"129198717","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}
Aljia Bouzidi, N. Haddar, Mounira Ben-Abdallah, K. Haddar
{"title":"Deriving Use Case Models from BPMN Models","authors":"Aljia Bouzidi, N. Haddar, Mounira Ben-Abdallah, K. Haddar","doi":"10.1109/AICCSA.2017.49","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.49","url":null,"abstract":"Business process models (BPMs) describe tasks achieved by business workers to reach business goals. With the advancements in the Information Technology (IT), the use of software systems as a support for the business process becomes increasingly dominant and critical. Ideally, software design starts with acquiring knowledge from the BPMs to understand the current context (as-is-system), to outline the target system (to-be-system) and to identify the user requirements (URs) that fulfill business goals. Nevertheless, often the modeling of business processes (BPs) and of ISs are carried out separately. This leads to a misalignment between them. Although, years of research have gone into seeking tools that support business process aligned with IS, the transition of business process to IS modeling is still highly manual and the alignment of BPMs and information system models (ISMs) is still far from reach.To bridge the gap between BPMs and ISMs we propose, in this paper, a MDA approach named BPMN2UC to generate UML use cases (UCs) that represent URs towards the IS. To do this, we first carry out pre-treatments on the BPMN model to allow for a quasi-automatic UC generation. Then, we propose a set of transformation rules based on the semantics of BPMN and UML modeling elements. In addition to UC diagram, we generate also a textual description for each generated complex UC in order to help the system designer to understand its scenarios. To improve our approach, we apply it on a case study. Also, our approach is implemented with EMF tools and our transformation rules are specified by ATLAS Transformation Language (ATL) for generating the UC diagram and Acceleo Templates principle to generate the textual descriptions of complex UCs.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"41 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":"123959327","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 New Approximate Reasoning for Multi-bases Symbolic Data","authors":"Saoussen Bel Hadj Kacem","doi":"10.1109/AICCSA.2017.16","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.16","url":null,"abstract":"Approximate reasoning aims to manage knowledge imprecision in the inference process. It is a generalization of the Modus Ponens of classical logic. Originally, it is defined in fuzzy logic context, where knowledge are modeled by a quantitative way. We are interested in this paper to approximate reasoning in the symbolic multi-valued logic context. This logic allows presenting imprecise knowledge in a qualitative way, where every predicate is modeled by a multi-set. In order to express imprecision, each multi-set is associated to a scale base of ordered symbolic degrees. In a previous work where a symbolic approximate reasoning has been defined, it has been assumed that all multi-sets of the inference schema have the same scale base. This has the disadvantage to prevent free definition of knowledge. For that, we propose in this paper a new approximate reasoning which can infer with multi-sets having different scale bases. Our solution consists of interfacing all the multi-sets in order to avoid information loss.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"32 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":"124029040","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":"FPMIPv6-S: A New Mobility Management Protocol for Wireless Sensor Networks","authors":"A. Berguiga, H. Youssef","doi":"10.1109/AICCSA.2017.142","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.142","url":null,"abstract":"wireless sensor networks (WSNs) are f nding application in numerous f elds. For many of these applications, some or all of the sensor nodes are mobile. Mobility management in WSNs is a challenging and has been the subject of intensive research.In this paper, we propose an IP-based mobility management protocol named Fast handover Proxy Mobile IPv6 for Sensor networks (FPMIPv6-S). FPMIPv6-S provides network-based mobility support for 6LoWPAN WSN when a sensor node moves between two Personal Area Networks (PANs). It is an improved version of the PMIPv6 protocol proposed for mobility management in IPv6 networks. FPMIPv6-S messages are carried by RPL protocol.We integrated the FPMIPv6-S protocol in the NS-3 simulator and performed a thorough performance comparison of FPMIPv6- S and RPL. Simulation results of the proposed protocol shows signif cantly improved performance with respect to three QoS criteria: (1) the packet loss rate; (2) and the Throughput.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"20 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":"123493015","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}
Houda Khlif, Hatem Hadj Kacem, S. Hernández, A. Kacem
{"title":"A Validation Approach for Quasi-Synchronous Checkpointing Algorithms in HPC Systems","authors":"Houda Khlif, Hatem Hadj Kacem, S. Hernández, A. Kacem","doi":"10.1109/AICCSA.2017.128","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.128","url":null,"abstract":"High Performance Computing (HPC) has seen prodigious growth over the past few years and fault tolerance solutions have been incorporated into HPC systems. The most commonly used technique for fault tolerance in HPC is checkpointing. Processes achieve fault tolerance by saving local checkpoint periodically during execution. When a failure occurs, the previously saved global checkpoint can be used to restart the computation from an intermediate state. Quasi-Synchronous Checkpointing (QSC) is atractive because it allows finding consistent global checkpoints without an extra message overhead. QSC algorithms are classified into: Strictly Z-Path Free, Z-Path Free and Z-Cycle Free. Z-paths and Z-cycles are undesirable patterns that can give rise to inconsistent system states. QSC algorithms are often evaluated with regard to performance, generally through simulation. However, few works have been designed to validate their correctnes. Our approach validates if a QSC algorithm is correct by modeling its execution into a graph and then verifying over this graph if the algorithm is exempt from undesirable patterns. QSC is based on the Happened-Before Relation (HBR) introduced by Lamport. One main problem linked to the HBR is the combinatorial state explosion. Nevertheless, for a HPC system modeled with a HBR graph, the computational cost for the identification of such patterns becomes prohibitively high. In this paper, we define a set of transformation rules oriented towards the detection of the undesirable patterns over a graph derived from the causal order set abstraction (CAOS) which is equivalent to a HBR graph, but it drastically reduces the statespace of a system.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"67 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":"121785049","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":"Adaptive Task Mapping and Scheduling for Reconfigurable Distributed Embedded Energy Harvesting Systems","authors":"Wiem Housseyni, O. Mosbahi, M. Khalgui","doi":"10.1109/AICCSA.2017.191","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.191","url":null,"abstract":"As with the requirements of high-performance and flexible computing, reconfigurable computing systems have become a subject of a great deal of research. Reconfigurable computing systems have to deal with unpredictable events from the environment such as arrival of new tasks, and hardware or software failures, by adapting the task allocation and scheduling, in order to maintain the system feasibility and performance. This paper presents a novel adaptive approach to address the real-time task scheduling issue in reconfigurable multiprocessor embedded systems based on energy harvesting with the consideration of system performance optimization. An energy efficient offline task mapping and scheduling algorithm is proposed to balance the workload in the multiprocessor embedded system. In order to optimize the system performance and to guarantee the system correctness in the presence of reconfiguration scenarios, a distributed control system is built to process a task migration. A cost function to evaluate the energy and time overheads of tasks migration is proposed. Extensive performance evaluations show the effectiveness of the proposed approach in terms of deadline miss ratio, and the energy gain compared with the related stateof-the-art techniques.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"50 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":"114806411","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. Ayadi, Oussama Ghorbel, M. BenSaleh, A. Obeid, M. Abid
{"title":"Data Classification in Water Pipeline Based on Wireless Sensors Networks","authors":"A. Ayadi, Oussama Ghorbel, M. BenSaleh, A. Obeid, M. Abid","doi":"10.1109/AICCSA.2017.129","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.129","url":null,"abstract":"Pipelines constitute one of the most important ways to transport large amounts of water through long distance. However, existing damage detection methods do not well in monitoring pipelines due to the harsh environmental condition. for this reason, current systems need to be more automated, efficient and accurate for continuous supervising about damage. For this purpose, Wireless Sensors Networks (WSN) have been brought into the research community in the context of monitoring water pipeline. In this paper, we have discussed the task amounts to provide low-cost and real-time damage detection technique. Our proposed technique is based on Fisher discriminant analysis (FDA) coupled with Support Vector Machine (SVM). We aim to recognize data as normal or outlier to identify specific events based on WSN implemented in a water pipeline. Moreover, we have compared our adopted approach with other four classifiers including Bayesian Network, Neural Network, K-Nearest Neighbors and Decision Tree. Thus, the suggested technique is validated in terms of accuracy and training time.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"193 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":"124293847","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}