Academic & Scientific Articles

Permanent URI for this communityhttp://dl.cerist.dz/handle/CERIST/3

Browse

Filters

Settings

End date: 2015Has files: Yes

Search Results

Now showing 1 - 10 of 520
  • Thumbnail Image
    Item
    La production scientifique nationale : Enjeux et urgence
    (CERIST, 2014-06-22) BERROUK, Said
    Tout le monde s’accorde sur l’importance de la réalisation d’une base de données nationale regroupant la production scientifique nationale. Deux objectifs principaux guident cette tendance. La visibilité et l’accès au marché de l’information.
  • Thumbnail Image
    Item
    Networked Wireless Sensors, Active RFID, and Handheld Devices for Modern Car Park Management: WSN, RFID, and Mob Devs for Car Park Management
    (IGI Global, 2015-07-01) Djenouri, Djamel; Karbab, Elmouatezbillah; Boulkaboul, Sahar; Bagula, Antoine
    Networked wireless sensors, actuators, RFID, and mobile computing technologies are explored in this paper on the quest for modern car park management systems with sophisticated services over the emerging internet of things (IoT), where things such as ubiquitous handheld computers, smart ubiquitous sensors, RFID readers and tags are expected to be interconnected to virtually form networks that enable a variety of services. After an overview of the literature, the authors propose a scalable and lowcost car parking framework (CPF) based on the integration of aforementioned technologies. A preliminary prototype implementation has been performed, as well as experimentation of some modules of the proposed CPF. The results demonstrate proof of concept, and particularly reveal that the proposed approach for WSN deployment considerably reduces the cost and energy consumption compared to existing solutions.
  • Thumbnail Image
    Item
    Minimum redundancy and maximum relevance for single and multi-document Arabic text summarization
    (Elsevier, 2014-12) Oufaida, Houda; Nouali, Omar; Blache, Philippe
    Automatic text summarization aims to produce summaries for one or more texts using machine techniques. In this paper, we propose a novel statistical summarization system for Arabic texts. Our system uses a clustering algorithm and an adapted discriminant analysis method: mRMR (minimum redundancy and maximum relevance) to score terms. Through mRMR analysis, terms are ranked according to their discriminant and coverage power. Second, we propose a novel sentence extraction algorithm which selects sentences with top ranked terms and maximum diversity. Our system uses minimal language-dependant processing: sentence splitting, tokenization and root extraction. Experimental results on EASC and TAC 2011 MultiLingual datasets showed that our proposed approach is competitive to the state of the art systems.
  • Thumbnail Image
    Item
    Automatic Construction of Ontology from Arabic Texts
    (Université Djillali LIABES Sidi-Bel-Abbès, 2012-04-29) Mazari, Ahmed Cherif; Aliane, Hassina; Alimazighi, Zaia
    The work which will be presented in this paper is related to the building of an ontology of domain for the Arabic linguistics. We propose an approach of automatic construction that is using statistical techniques to extract elements of ontology from Arabic texts. Among these techniques we use two; the first is the "repeated segment" to identify the relevant terms that denote the concepts associated with the domain and the second is the "co-occurrence" to link these new concepts extracted to the ontology by hierarchical or non- hierarchical relations. The processing is done on a corpus of Arabic texts formed and prepared in advance.
  • Thumbnail Image
    Item
    A Graph Approach for Enhancing Process Models Matchmaking
    (IEEE, 2015-06-27) Belhoul, Yacine; Yahiaoui, Saïd; Haddad, Mohammed; Gater, Ahmed; Kheddouci, Hamamache; Bouzeghoub, Mokrane
    Recent attempts have been done to measure similarity of process models based on graph matching. This problem is known to be difficult and its computational complexity is exponential. Thus, heuristics should be proposed to obtain approximations. Spectral graph matching methods, in particular eigenvalue-based projections, are know to be fast but they lost some quality in the obtained matchmaking. In this paper, we propose a graph approach for the problem of inexact matching of process models. Our approach combines a spectral graph matching method and a string comparator based algorithm in order to improve the quality of process models matchmaking. The proposed method performs the matchmaking at both structural and semantic levels. Experimentation is provided to show the performance of our method to rank a collection of process models according to a particular user query, compared to previous work.
  • Thumbnail Image
    Item
    Coloring based approach for matching unrooted and/or unordered trees
    (Elsevier, 2013-04) Yahiaoui, Saïd; Haddad, Mohammed; Effantin, Brice; Kheddouci, Hamamache
    We consider the problem of matching unrooted unordered labeled trees, which refers to the task of evaluating the distance between trees. One of the most famous formalizations of this problem is the computation of the edit distance defined as the minimum-cost sequence of edit operations that transform one tree into another. Unfortunately, this problem has been proved to be NP-complete. In this paper, we propose a new algorithm to measure distance between unrooted unordered labeled trees. This algorithm uses a specific graph coloring to decompose the trees into small components (stars and bistars). Then, it determines a distance between two trees by computing the edit distance between their components. We prove that the proposed distance is a pseudo-metric and we analyze its time complexity. Our experimental evaluations on large synthetic and real world datasets confirm our analytical results and suggest that the distance we propose is accurate and its algorithm is scalable.
  • Thumbnail Image
    Item
    Big Data : Concepts et Cas d’utilisation
    (CERIST, 2015-06-15) Amrane, Abdesalam
    Dans ce rapport nous décrivons l'écosystème Big Data, le contexte et les cas d'utilisation sont présentés. par la suite nous détaillons les technologies matérielles et logicielles nécessaires (stockage, traitement parallèle, virtualisation, …).
  • Thumbnail Image
    Item
    Installation et configuration d’une solution de détection d’intrusions sans fil (Kismet)
    (CERIST, 2011-06) Lounis, Karim; Babakhouya, Abdelaziz; Nouali-Taboudjemat, Nadia
    Les réseaux sans fil (Wi-Fi, norme 802.11) offrent plusieurs avantages ; notamment en terme de mobilité, coût, débit et facilité de déploiement. Cependant, ils sont par nature plus sensibles aux problèmes de sécurité. Les mécanismes de sécurité (WEP, WPA, WPA2) ne permettent pas de se prévenir contre tous les problèmes de sécurité. En effet, les bornes Wi-Fi restent toujours vulnérables aux intrusions : attaque de déni de service, rogue AP, attaque de dé-authentification. Dans cette optique, il est conseillé de surveiller régulièrement l'activité du point d'accès sans fil afin de détecter les activités anormales sur le réseau et de les signaler sous forme d’ALERTES. Ce rapport présent les détails techniques d’installation et de configuration d’une solution de détection d’intrusion pour un réseau Wi-Fi. Cette solution se base sur des logiciels open source (Linux, Kismet, OPENWRT, DD-WRT, SWATCH) et une série de matériels sans fil (routeur Linksys WRT54GL et carte réseau sans fil).
  • Thumbnail Image
    Item
    Locating Emergency Responders using Mobile Wireless Sensor Networks
    (CERIST, 2012-07) Benkhelifa, Imane; Nouali-Taboudjemat, Nadia
    L'intervention d'urgence dans la gestion des catastrophes en utilisant les réseaux de capteurs sans fils est devenue récemment un intérêt de nombreux chercheurs du monde entier. Cet intérêt provient du nombre croissant de catastrophes et de crises (naturelles ou humaines) qui touchent des millions de vies ainsi que l'utilisation facile des nouvelles technologies pas cher. Ce document arrive avec un algorithme pour localiser les intervenants d'urgence et les secouristes en utilisant capteurs attachés aux secouristes. La solution proposée est très efficace et rapidement déployable et ne nécessite aucune infrastructure préinstallé. La solution est basée sur la prédiction des déplacements des secouristes en se basant sur des estimations de position précédentes. L'évaluation de notre solution montre que notre technique prend avantage de la prédiction d'une manière plus efficace que les solutions précédentes.
  • Thumbnail Image
    Item
    A review on Privacy and Anonymity in electronic communications
    (Conference Procedings, 2006-10-25) Benmeziane, Souad; Badache, Nadjib
    Current Internet networking protocols provide no support to ensure the privacy of communication endpoints. An adversary can determine which addresses have asked for which services. Anonymity is now increasingly important for networked applications. This paper overviews the concept of anonymity in electronic communications, vectors for a privacy invasion, and proposed solutions. Solutions are examined from the perspective of attacks which can be reasonably expected against these systems. Particular attention is paid to mobile agents systems and how to hide the itinerary of the agent.