CERIST

Algiers, Algeria
Algiers, Algeria

Time filter

Source Type

Aliradi R.,University of Science and Technology Houari Boumediene | Bouzera N.,University of Abderrahmane Mira de Béjaïa | Meziane A.,CERIST | Belkhir A.,University of Science and Technology Houari Boumediene
Proceedings - 2013 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IATW 2013 | Year: 2013

Facial features determination is essential in many applications such as personal identification several approaches have been proposed, but an effective method for face detection is still a research problem. In this paper we focus on a recent method called the support vector machines (SVM) has been adapted and applied to the problem of pattern recognition such as face detection. The idea information of the skin color is used to reduce the search region and the main idea based on SVM is to project the data input space (belonging to two different classes) non-linearly separable in a larger space called feature space so that data are linearly separable. About fusion a non-parametric model is applied for the segmentation of the pixels of skin color. This last is used to reduce area of research within the image. However the SVMs help us to find exactly the faces in the segmented area. We implemented the SVM using a RBF kernel as a classification technique for face detection by block" approach of considering the face as a set of components (eyes, nose and mouth). The method succeeds in locating facial features in the facial region exactly and is insensitive to face deformation. The method is executable in a reasonably short time. © 2013 IEEE.


Bagaa M.,CERIST | Taleb T.,Aalto University | Ksentini A.,University of Rennes 1
2015 IEEE Global Communications Conference, GLOBECOM 2015 | Year: 2015

One important objective of 5G mobile networks is to accommodate a diverse and ever-creasing number of user equipment (UEs). Coping with the massive signaling overhead expected from UEs is an important hurdle to tackle to achieve this objective. In this paper, we propose three solutions that aim for finding optimal distributions of tracking areas (TAs) in the form of TA lists (TALs) and assigning them to UEs, with the objectives of minimizing two conflicting metrics, namely paging overhead and tracking area update (TAU) overhead. Two solutions favors one objective than the other. The third one incorporates a novel scheme, dubbed Fair and Optimal TAL Assignment (FOTA), based on Nash bargaining game theory. FOTA improves overall network performance minimizing overhead due to both paging and TAU messages, taking into account the behavior and mobility features of UEs. The performance of proposed schemes are evaluated via simulations and the obtained results demonstrate their feasibility and ability in achieving their design goals, improving network performance by minimizing cost associated with paging and TAU. © 2015 IEEE.


Taleb T.,Aalto University | Bagaa M.,CERIST | Ksentini A.,University of Rennes 1
IEEE International Conference on Communications | Year: 2015

Cloud offerings represent a promising solution for mobile network operators to cope with the surging mobile traffic. The concept of carrier cloud has therefore emerged as an important topic of inquiry. For a successful carrier cloud, algorithms for optimal placement of Virtual Network Functions (VNFs) on federated cloud are of crucial importance. In this paper, we introduce different VNF placement algorithms for carrier cloud with two main design goals: i) minimizing path between users and their respective data anchor gateways and ii) optimizing their sessions' mobility. The two design goals effectively represent two conflicting objectives, that we deal with considering the mobility features and service usage behavioral patterns of mobile users, in addition to the mobile operators' cost in terms of the total number of instantiated VNFs to build a Virtual Network Infrastructure (VNI). Different solutions are evaluated based on different metrics and encouraging results are obtained. © 2015 IEEE.


Alduraibi F.,University of Maryland, Baltimore | Lasla N.,CERIST | Younis M.,University of Maryland, Baltimore
2016 IEEE International Conference on Communications, ICC 2016 | Year: 2016

Wireless sensor networks have become an attractive choice for many monitoring applications in an unattended setups; some of these applications such as pipeline, railroad and highways monitoring require the sensors to be placed in a linear topology. These sensors need to be placed as far apart while still maintaining a minimum required coverage in order to minimize the required node count and reduce cost. In this paper, we present three optimization models for determining the node density that varies in the objective. The first opts to achieve a desired level of detection fidelity while minimizing the number of deployed sensors. The second model considers the scenario with a constrained node count and determines the position of the available nodes such that the coverage is maximized. In the third model, we strive to minimize the number of deployed nodes when the desired fidelity is not uniform and some locations require higher coverage than others. The proposed optimization formulations are generic in nature and can be applied to any sensor coverage model. The three optimization models are validated through implementation using an attenuated disc coverage model where the detectability of a sensor is inversely proportional to the distance. © 2016 IEEE.


Boudebza S.,Jijel University | Azouaou F.,Ecole Nationale Superieure dInformatique | Nouali O.,CERIST
Proceedings - 2015 International Conference on Future Internet of Things and Cloud, FiCloud 2015 and 2015 International Conference on Open and Big Data, OBD 2015 | Year: 2015

Social networks have recently gained a growing interest on the web. Traditional formalisms for representing social networks are static and suffer from the lack of semantics. In this paper, we explore the use of semantic web technologies to support the representation of dynamic social networks. Therefore, we develop the Sem Temp ontology which aligns and extends existing ontologies, such as FOAF, SIOC, SKOS and OWL-Time to provide a temporal and semantically rich description of social data. We also present some modeling examples to illustrate how our ontology can be used to effectively model dynamic social network data. © 2015 IEEE.


Bagaa M.,CERIST | Younis M.,University of Maryland Baltimore County | Ouadjaout A.,CERIST | Badache N.,CERIST
IEEE International Conference on Communications | Year: 2013

In wireless sensor networks, in-network data aggregation filters out redundant sensor readings in order to reduce the energy and bandwidth consumed in disseminating the data to the base-station. In this paper, we investigate the problem of reliable collection of aggregated data with minimal latency. The aim is to form an aggregation tree such that there are k disjoint paths from each node to the base-station and find a collision-free schedule for node transmissions so that the aggregated data reaches the base-station in minimal time. We propose a novel algorithm for Reliable and Timely dissemination of Aggregated Data (RTAD). RTAD intertwines the formation of the aggregation tree and the allocation of time slots to nodes, and assigns parents to the individual nodes in order to maximize time slot reuse. The simulation results show that RTAD outperforms competing algorithms in the literature. © 2013 IEEE.


Belazzougui D.,CERIST | Karkkainen J.,Aalto University | Kempa D.,Aalto University | Puglisi S.J.,Aalto University
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2016

Simple and fast decoding is one of the main advantages of LZ77-type text encoding used in many popular file compressors such as gzip and 7zip. With the recent introduction of external memory algorithms for Lempel-Ziv factorization there is a need for external memory LZ77 decoding but the standard algorithm makes random accesses to the text and cannot be trivially modified for external memory computation. We describe the first external memory algorithms for LZ77 decoding, prove that their I/O complexity is optimal, and demonstrate that they are very fast in practice, only about three times slower than in-memory decoding (when reading input and writing output is included in the time). © Springer International Publishing Switzerland 2016.


Lasla N.,CERIST | Derhab A.,King Saud University | Ouadjaout A.,CERIST | Bagaa M.,CERIST | Challal Y.,Laboratoire Of Methodes Of Conception Des Systemes Lmcs
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2014

In this paper, we propose a novel secure routing protocol named Secure Multi-pAths Routing for wireless sensor neTworks (SMART) as well as its underlying key management scheme named Extended Two-hop Keys Establishment (ETKE). The proposed framework keeps consistent routing topology by protecting the hop count information from being forged. It also ensures a fast detection of inconsistent routing information without referring to the sink node. We analyze the security of the proposed scheme as well as its resilience probability against the forged hop count attack. We have demonstrated through simulations that SMART outperforms a comparative solution in literature, i.e., SeRINS, in terms of energy consumption. © 2014 Springer International Publishing Switzerland.


Bagaa M.,CERIST | Derhab A.,CERIST | Lasla N.,CERIST | Ouadjaout A.,CERIST | Badache N.,CERIST
Proceedings - IEEE INFOCOM | Year: 2012

This paper focuses on data aggregation scheduling problem in wireless sensor networks (WSNs), to minimize time latency. Prior works on this problem have adopted a structured approach, in which a tree-based structure is used as an input for the scheduling algorithm. As the scheduling performance mainly depends on the supplied aggregation tree, such an approach cannot guarantee optimal performance. To address this problem, we propose approaches based on Semi-structured Topology (DAS-ST) and Unstructured Topology (DAS-UT). The approaches are based on two key design features, which are: (1) simultaneous execution of aggregation tree construction and scheduling, and (2) parent selection criteria that maximize the choices of parents for each node and maximize time slot reuse. We prove that the latency of DAS-ST is upper-bounded by (⌊ 2π/arcos(1/1+ε)⌋ + 4) R + Δ - 4, where R is the network radius, Δ is the maximum node degree, and 0.05 < ε ≤ 1. Simulations results show that DAS-UT outperforms DAS-ST and four competitive state-of-the-art aggregation scheduling algorithms in terms of latency and network lifetime. © 2012 IEEE.


Al-Nemrat A.,ACE Inc | Benzaid C.,CERIST
Proceedings - 14th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2015 | Year: 2015

The Internet can be a double-edged sword. While offering a range of benefits, it also provides an opportunity for criminals to extend their work to areas previously unimagined. Every country faces the same challenges regarding the fight against cybercrime and how to effectively promote security for its citizens and organisations. The main aim of this study is to introduce and apply a data-mining technique (decision-tree) to cybercrime profiling. This paper also aims to draw attention to the growing number of cybercrime victims, and the relationship between online behaviour and computer victimisation. This study used secondhand data collected for a study was carried out using Jordan a s a case study to investigate whether or not individuals effectively protect themselves against cybercrime, and to examine how perception of law influences actions towards incidents of cybercrime. In Jordan, cybercafe's have become culturally acceptable alternatives for individuals wishing to access the Internet in private, away from the prying eyes of society. © 2015 IEEE.

Loading CERIST collaborators
Loading CERIST collaborators