Voici les éléments 21-40 de 763

  • One-Step Clustering Protocol for Periodic Traffic Wireless Sensor Networks 

    Nassima, Merabtine; Djamel, Djenouri; Zegour, Djamel-Eddine; Lamini, Elseddik; Rima, Bellal; Imene, Ghaoui; Nabila, Dahlal
    In : (IEEE, Newark, NJ, USA, 2017-04)
    A new centralized clustering protocol for periodic traffic wireless sensor networks is proposed in this paper. The proposed protocol uses one-step off-line cluster computation algorithm, where all the clustering schemes and their respective durations are calculated by the base station (BS) once at the network initialization. ...
  • Data Mining-Based Decomposition for Solving the MAXSAT Problem: Toward a New Approach 

    Djenouri, Youcef; Habbas, Zineb; Djenouri, Djamel
    In : (IEEE, 2017-06)
    A new approach decomposes a MAXSAT instance and then applies clustering via data mining decomposition techniques, with every cluster resulting from the decomposition separately solved to construct a partial solution. All partial solutions are then merged to build the global solution.
  • Optimal Placement of Relay Nodes Over Limited Positions in Wireless Sensor Networks 

    Bagaa, Miloud; Cheli, Ali; Djenouri, Djamel; Taleb, Tarik; Balasingham, Ilangko; Kansanen, Kimmo
    In : (IEEE, 2017-04)
    This paper tackles the challenge of optimally placing relay nodes (RNs) in wireless sensor networks given a limited set of positions. The proposed solution consists of: 1) the usage of a realistic physical layer model based on a Rayleigh blockfading channel; 2) the calculation of the signal-to-interferenceplus- noise ...
  • Energy-Aware Constrained Relay Node Deployment for Sustainable Wireless Sensor Networks 

    Djenouri, Djamel; Bagaa, Miloud
    In : (IEEE, 2017-03)
    This paper considers the problem of communication coverage for sustainable data forwarding in wireless sensor networks, where an energy-aware deployment model of relay nodes (RNs) is proposed. The model used in this paper considers constrained placement and is different from the existing one-tiered and two-tiered models. ...
  • A Concise Forwarding Information Base for Scalable and Fast Name Lookups 

    Yu, Ye; Belazzougui, Djamal; Qian, Chen; Zhang, Qin
    In : (IEEE, Toronto, Ontario, Canada, 2017-11-30)
    Forwarding information base (FIB) scalability and its lookup speed are fundamental problems of numerous net- work technologies that uses location-independent network names. In this paper we present a new network algorithm, Othello Hashing, and its application of a FIB design called Concise, which uses very little ...
  • A stochastic local search combined with support vector machine for web services classification 

    LAACHEMI, Abdelouahab; BOUGHACI, Dalila
    In : Rapports de recherche internes, (CERIST, Alger, 2016-04)
    In this paper, we are interested in the Web service classification. We propose a classification method that first uses a stochastic local search (SLS) meta-heuristic for feature selection then call the Support Vector Machine (SVM) to do the classification task. The proposed method that combines SLS and SVM for Web service ...
  • Big Data : Concepts et Cas d’utilisation 

    AMRANE, Abdesalam
    In : Rapports de recherche internes, (CERIST, Alger, 2015-06-15)
    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, …).
  • Les plateformes Big Data 

    AMRANE, Abdesalam
    In : Rapports de recherche internes, (CERIST, Alger, 2017-05-15)
    Avec la croissance exponentielle du volume de données et la nécessité de l'analyse de ces données, la conception et la mise en œuvre d’une plateforme d'analyse de données Big Data pour gérer, stocker et extraire des prévisions de toutes les données numériques devient primordiale. Une variété de plateformes de Big Data ...
  • Fast Label Extraction in the CDAWG 

    Belazzougui, Djamal; Cunial, Fabio
    In : (Springer, Palerme, Italie, 2017-09-06)
    The compact directed acyclic word graph (CDAWG) of a string T of length n takes space proportional just to the number e of right extensions of the maximal repeats of T, and it is thus an appealing index for highly repetitive datasets, like collections of genomes from similar species, in which e grows significantly more ...
  • A Framework for Space-Efficient String Kernels 

    Belazzougui, Djamal; Cunial, Fabio
    In : (Springer, 2017-02-17)
    String kernels are typically used to compare genome-scale sequences whose length makes alignment impractical, yet their computation is based on data structures that are either space-inefficient, or incur large slowdowns. We show that a number of exact kernels on pairs of strings of total length n, like the k-mer kernel, ...
  • Flexible Indexing of Repetitive Collections 

    Belazzougui, Djamal; Cunial, Fabio; Gagie, Travis; Prezza, Nicola; Raffinot, Mathieu
    In : (Springer, Turku, Finlande., 2017-06-07)
    Highly repetitive strings are increasingly being amassed by genome sequencing experiments, and by versioned archives of source code and webpages. We describe practical data structures that support count- ing and locating all the exact occurrences of a pattern in a repetitive text, by combining the run-length encoded ...
  • Representing the Suffix Tree with the CDAWG 

    Belazzougui, Djamal; Cunial, Fabio
    In : (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Varsovie, 2017-07-04)
    Given a string T, it is known that its suffix tree can be represented using the compact directed acyclic word graph (CDAWG) with e_T arcs, taking overall O(e_T+e_REV(T)) words of space, where REV(T) is the reverse of T, and supporting some key operations in time between O(1) and O(log(log(n))) in the worst case. This ...
  • New Technique to Deal With Verbose Queries in Social Book Search 

    Chaa, Messaoud; Nouali, Omar; Bellot, Patrice
    In : Rapports de recherche internes, (CERIST, Alger, 2017)
    Verbose query reduction and query term weighting are automatic techniques to deal with verbose queries.
  • New GPU-based Swarm Intelligence Approach For Reducing Big Association Rules Space 

    Djenouri, Youcef; Bendjoudi, Ahcène; Djenouri, Djamel; Belhadi, Asma; Nouali-Taboudjemat, Nadia
    In : Rapports de recherche internes, (CERIST, Alger, 2017-06-14)
    This paper deals with exploration and mining of association rules in big data, with the big challenge of increasing computation time. We propose a new approach based on meta-rules discovery that gives to the user the summary of the rules’ space through a meta-rules representation. This allows the user to decide about ...
  • An Approach to Improve Business Process Models Reuse Using LinkedIn Social Network 

    Khider, Hadjer; benna, Amel; Meziane, Abdelkrim; Hammoudi, Slimane
    In : (Springer International Publishing AG 2017, Editors: Rocha, Á., Correia, A.M., Adeli, H., Reis, L.P., Costanzo, S. (Eds.), Porto Santo Island, Portugal, 2017-04)
    Business process (BP) modeling is an important stage in Business Process Management (BPM) lifecycle. However, modeling BP from scratch is fallible task, complex, time-consuming and error prone task. One of the promising solutions to these issues is the reuse of BP models. BP reusability during the BP modeling stage can ...
  • A framework for space-efficient read clustering in metagenomic samples 

    Alanko, Jarno; Cunial, Fabio; Belazzougui, Djamal; Mäkinen, Veli
    In : (BioMed Central, 2017-03-14)
    Background: A metagenomic sample is a set of DNA fragments, randomly extracted from multiple cells in an environment, belonging to distinct, often unknown species. Unsupervised metagenomic clustering aims at partitioning a metagenomic sample into sets that approximate taxonomic units, without using reference genomes. ...
  • Binarization of document images with various object sizes 

    Hadjadj, Zineb; Meziane, Abdelkrim
    In : (IEEE, Nancy, France, 2017-04)
    There are a lot of document image binarization techniques that try to differentiate between foreground and background but many of them fail to correctly detect all the text pixels because of degradations. In this paper, a new binarization method for document images is presented. The proposed method is based on the most ...
  • Proposition d'un nouveau modèle de recherche sociale 

    Bessai Mechmache, Fatma Zohra; Hammouche, Karima; Alimazighi, Zaia
    In : Rapports de recherche internes, (CERIST, Alger, 2017-04-20)
    Dans ce rapport nous proposons un nouveau modèle de recherche d’information sociale. Ce modèle enrichit la structure du réseau en introduisant l’utilisateur comme une entité du réseau social. L’importance d’une entité dépendra de la structure du réseau et de la proximité sémantique entre les différentes entités composant ...
  • Intégration de l’utilisateur dans un modèle de recherche sociale 

    Bessai Mechmache, Fatma Zohra; Hammouche, Karima; Alimazighi, Zaia
    In : (Al Hoceima, Maroc, 2017-05)
    Dans cet article nous proposons un nouveau modèle de recherche d’information sociale basé sur un ordonnancement conjoint des documents, des auteurs et des utilisateurs d’un réseau bibliographique dans un réseau hétérogène. Ce modèle enrichit la structure du réseau en introduisant l’utilisateur comme une entité du réseau ...
  • Les Manuscrits Arabes Anciens En Ligne : Pratiques et Recommandations 

    Habbak, Noureddine; Meziane, Abdelkrim
    In : Rapports de recherche internes, (CERIST, Alger, 2017-04-10)
    Les technologies de l’information ont révolutionné la bibliothèque classique. Aujourd’hui, de nombreuses bibliothèques passent au monde numérique. L’accès aux documents qui ont tendance à se détériorer rapidement et qui sont très demandés tels que les manuscrits arabes anciens, devient de plus en plus simple, ce qui ...