{"title":"Algorithms and systems for data mining: A survey","authors":"Adil Jad Allah Eddib, M. E. Mohajir, M. Chahhou","doi":"10.1109/CIST.2014.7016603","DOIUrl":"https://doi.org/10.1109/CIST.2014.7016603","url":null,"abstract":"There are many algorithms and systems for mining data that are being constantly developed and improved by research communities and industrial organizations worldwide, but choosing the most adequate and with the most optimal results for the problem at hand remains a main concern and a critical decision to make. This paper inspects the most used algorithms and systems for data mining in order to point out their similarities and differences, their advantages and drawbacks, and define for each algorithm or system the situations it is best suited for.","PeriodicalId":106483,"journal":{"name":"2014 Third IEEE International Colloquium in Information Science and Technology (CIST)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122179219","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 holonic extension of the i∗ framework","authors":"Wahb Louaqad, M. E. Mohajir","doi":"10.1109/CIST.2014.7016586","DOIUrl":"https://doi.org/10.1109/CIST.2014.7016586","url":null,"abstract":"Facing complex systems, i* needs mechanism of managing complexity and granularity. This paper proposes a holonic architecture to address this weakness of i*. Our solution is based on the business unit, business services and business goal as basic granules that encapsulates the intentional units, intentions, goals of the organization. The architecture is based on three conceptual levels which are the business view, process view and task view. for each level of conceptualization a model of dependence between intentional units and a rational model. So our solution preserves the socio-intentional aspect of i*.","PeriodicalId":106483,"journal":{"name":"2014 Third IEEE International Colloquium in Information Science and Technology (CIST)","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132585166","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 XML database for modern standard Arabic (MSA) verbs generated from triliteral roots","authors":"Youssef Tahir","doi":"10.1109/CIST.2014.7016637","DOIUrl":"https://doi.org/10.1109/CIST.2014.7016637","url":null,"abstract":"In this paper, we present an exhaustive database for Modern Standard Arabic (MSA) verbs generated from trilateral roots. This database is initially represented as a root-pattern matrix listing rows of all recognized roots and columns of all verb patterns in MSA. The intersection of each row and column contains an index indicating the compatibility of the aforementioned root-pattern pair. This index refers also to a list of morpho-syntactic characteristics of the generated verb. We later converted the database into the more flexible XML format. The aim for our approach is twofold: with the objective of building an exhaustive list, we opted for automatic generation of all possible trilateral roots in the Arabic alphabet and subsequent filtering of roots not recognized in the literature; secondly, converting the database into XML creates a highly versatile resource for easy integration in Arabic NLP applications.","PeriodicalId":106483,"journal":{"name":"2014 Third IEEE International Colloquium in Information Science and Technology (CIST)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129001811","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}
Imane Daha, Mouna Elmachkour, Ismail Berrada, A. Kobbane
{"title":"Green opportunistic access for CRN with selfish users using coalitional game approach in partition form","authors":"Imane Daha, Mouna Elmachkour, Ismail Berrada, A. Kobbane","doi":"10.1109/CIST.2014.7016658","DOIUrl":"https://doi.org/10.1109/CIST.2014.7016658","url":null,"abstract":"We study energy conservation and system performance of decentralized cognitive radio network with cognitive users. Every cognitive radio (CR) user needs to sense the channel to send data, if the channel is unoccupied by a licensed user only one winner transmits its data. Hence, all other users waste their energy in sensing the licensed bands and in negotiating the resource access without managing to transmit data packets. We formulate the sensing-energy tradeoff problem for distributed cognitive radio network as a coalition formation game. Our contribution is to apply the coalitional game design to the most important phases of cognitive radio network (CRN): sensing and data transmission. The concept of coalitional game may enforce the cooperative behavior of CR users in order to improve the system performance (energy and delay.). The network is modeled using a coalitional game in partition form with non transferable utility (NTU). After forming coalitions, no CR user in those coalitions aim to change its position. Indeed, the members of this coalition will cooperate both in sensing and access phases to improve system performance. The selfish behavior becomes evident when the cognitive users are constrained to send their data in a short delay and with a minimum of energy consumption. Our proposed algorithm explains how the selfish atittude of the cognitive user leds to join the coalition that increases its individual gain, and tacitly to improve the performance of the entire system.","PeriodicalId":106483,"journal":{"name":"2014 Third IEEE International Colloquium in Information Science and Technology (CIST)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123645758","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":"Elasticity and scalability centric quality model for the cloud","authors":"Alfath Abdeladim, Salah Baïna, Karim Baïna","doi":"10.1109/CIST.2014.7016607","DOIUrl":"https://doi.org/10.1109/CIST.2014.7016607","url":null,"abstract":"Cloud computing seems to be the most logical shift in terms of Information Technology after Internet, Social Networking. Despite the potential benefits that cloud computing offers, the model brings new issues, challenges, and needs in term of SLA formalization, Quality of Service (QoS) evaluation due to the heterogeneous resources and to the special features it implies, such as Elasticity and Scalability. In the scope of this paper we focus on the Elasticity and Scalability attributes to assess their impact on the QoS. The paper provides a multi-lenses overview that can help both cloud consumers and potential business application's owners to understand, analyze, and evaluate important aspects related to Scalability and Elasticity capabilities. We determine and analyze the key features of these characteristics and derive metrics that evaluate the cloud elasticity-centric capabilities. We present a specific quality model for those two characteristics derived from their sub-attributes.","PeriodicalId":106483,"journal":{"name":"2014 Third IEEE International Colloquium in Information Science and Technology (CIST)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124553238","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}
Youssef Baddi, Mohamed Dâfir Ech-Cherif El Kettani
{"title":"Multiple active cores-based shared multicast tree for mobile IPv6 environment","authors":"Youssef Baddi, Mohamed Dâfir Ech-Cherif El Kettani","doi":"10.1109/CIST.2014.7016650","DOIUrl":"https://doi.org/10.1109/CIST.2014.7016650","url":null,"abstract":"Due to the progress of network multimedia technology, internet research community proposed many different multicast routing protocols to support efficient realtime multimedia application such as, IPTV, videoconferencing, group games. These applications require a multicast routing protocol in which packets arrive to multicast receivers with minimum delay and delay variation. These applications are more important with arrival of mobile IPv6 protocol with mobile receivers and sources with continuous access. Nevertheless, the design of multicast protocols does not take into account that group members may be mobile. Dynamic group members and sources can rapidly affect quality of both routing protocol scheme and multicast tree used. The key idea of this work is to make the handover of multicast members transparent and a quick recovery mechanism to maintain an optimal multicast tree, by using MACT-MIPv6 architecture based on multicast routing protocol with Shared Multiple Active Cores Multicast Tree to hide the mobility of mobile multicast members from the main multicast delivery tree. Simulation results show that good performance is achieved in terms of handoff latency, end-to-end delay, tree construction delay and others metrics.","PeriodicalId":106483,"journal":{"name":"2014 Third IEEE International Colloquium in Information Science and Technology (CIST)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121635372","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 dynamic multi-criteria routing algorithm based in centrality measures for WSNs","authors":"E. H. Fouad, Leghris Charekaoui, K. Douzi","doi":"10.1109/CIST.2014.7016652","DOIUrl":"https://doi.org/10.1109/CIST.2014.7016652","url":null,"abstract":"The challenges posed by the deployment and routing in sensor networks, are a superset of those found in wireless ad hoc networks. An example of these specific requirements is the limited energy supply and batteries which usually irreplaceable and not rechargeable. In order to maximize the lifetime of the network, the protocols need to be designed from the beginning with the objective to manage efficiently many characteristics and requirements like fault tolerance, scalability, production costs and others. In this paper, we present our new adaptive multi-criteria routing algorithm. Our approach provides a routing mechanism, which considers the best path based on the evaluation of the topological metrics (centrality measures) of neighbouring nodes, according to an automatically varying criteria set. These criteria are controlled and supervised dynamically by the root node (The Sink). In response to changes in the network state, criteria and application-defined goals, the best path between each node and the Sink will be called.","PeriodicalId":106483,"journal":{"name":"2014 Third IEEE International Colloquium in Information Science and Technology (CIST)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122752005","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":"Rotated Haar-Like features at generic angles for objects detection","authors":"M. Oualla, A. Sadiq, S. Mbarki","doi":"10.1109/CIST.2014.7016645","DOIUrl":"https://doi.org/10.1109/CIST.2014.7016645","url":null,"abstract":"This paper propose a new approch to detect rotated object at distinct angles using the Viola-Jones detector. Our idea is based on three key points: The first is to propose a method allowing finding possible angles to rotate a normal Haar-Like feature, without destroy its sides. The tangent of each angle equal to an rational number i.e. each angle equal to arctan(Y/X) where Y and X are integers. The second point is manifested by the use of this rational number to determine the pixels forming the sides of the feature. In the latter, we propose a solution that makes use of this rational number to approximate the Integral image of a rotated feature at a generic angle.","PeriodicalId":106483,"journal":{"name":"2014 Third IEEE International Colloquium in Information Science and Technology (CIST)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122893443","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}
Ouahilal Meryem, Jellouli Ismail, El-Mohajir Mohammed
{"title":"A comparative study of predictive algorithms for time series forecasting","authors":"Ouahilal Meryem, Jellouli Ismail, El-Mohajir Mohammed","doi":"10.1109/CIST.2014.7016596","DOIUrl":"https://doi.org/10.1109/CIST.2014.7016596","url":null,"abstract":"Forecasting is an important activity in economics, finance, marketing and various other domains like environmental and social sciences. There are several methods for making forecasts, but they all fall into two categories: causal methods and time series methods. In many cases, predictive algorithms implementing time series are good candidates for forecasting. In this paper we run a comparative study of three of these algorithms: Linear Regression, Support Vector Machines and Multilayer Perceptron in order to determine their performances in term of implementing times series for predictive systems. To assess the performance of these algorithms, we have conducted experiments over four representative datasets. The results exhibit that linear regression produced the best forecasts. The other two algorithms show a good behavior as well.","PeriodicalId":106483,"journal":{"name":"2014 Third IEEE International Colloquium in Information Science and Technology (CIST)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125229437","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}
Mohammed Fihri, O. Mohamed, Abdelhalim Hnini, Abdellah Ezzati
{"title":"Efficiency evaluation of routing protocols for Vanet","authors":"Mohammed Fihri, O. Mohamed, Abdelhalim Hnini, Abdellah Ezzati","doi":"10.1109/CIST.2014.7016655","DOIUrl":"https://doi.org/10.1109/CIST.2014.7016655","url":null,"abstract":"Today the world is moving towards wireless system. Wireless networks are gaining popularity to its peak today, as the users want wireless connectivity irrespective of their geographic position. Vehicular ad-hoc networks (VANETs) are considered to be the special application of infrastructure-less wireless Mobile ad-hoc network (MANET). In these networks, vehicles are used as nodes. In this paper, we examine and analyze the performance of Ad-hoc On-Demand (AODV), Dynamic Source Routing (DSR) and Destination-Sequenced Distance Vector (DSDV) routing in terms of Packet Delivery Ratio, Average End to End Delay, Latency and Throughput. The objective of this study is to find the best routing protocol over all circumstances. Based on our validated results, AODV performs the best among all evaluated protocols.","PeriodicalId":106483,"journal":{"name":"2014 Third IEEE International Colloquium in Information Science and Technology (CIST)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127318260","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}