International Journal Papers

Permanent URI for this collectionhttp://dl.cerist.dz/handle/CERIST/17

Browse

Filters

Settings

End date: 2019

Search Results

Now showing 1 - 10 of 103
  • 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
    DIEDA: discriminative information based on exponential discriminant analysis combined with local features representation for face and kinship verification
    (Springer, 2018-01-30) Aliradi, Rachid; Belkhir, Abdelkader; Ouamane, Abdelmalik; Elmaghraby , Adel S.
    Face and kinship verification using facial images is a novel and challenging problem in computer vision. In this paper, we propose a new system that uses discriminative information, which is based on the exponential discriminant analysis (DIEDA) combined with multiple scale descriptors. The histograms of different patches are concatenated to form a high dimensional feature vector, which represents a specific descriptor at a given scale. The projected histograms for each zone use the cosine similarity metric to reduce the feature vector dimensionality. Lastly, zone scores corresponding to various descriptors at different scales are fused and verified by using a classifier. This paper exploits discriminative side information for face and kinship verification in the wild (image pairs are from the same person or not). To tackle this problem, we take examples of the face samples with unlabeled kin relations from the labeled face in the wild dataset as the reference set. We create an optimized function by minimizing the interclass samples (with a kin relation) and maximizing the neighboring interclass samples (without a kinship relation) with the DIEDA approach. Experimental results on three publicly available face and kinship datasets show the superior performance of the proposed system over other state-of-the-art techniques.
  • Thumbnail Image
    Item
    A critical review of quality of service models in mobile ad hoc networks
    (Inderscience Enterprises Ltd, 2019) Bouchama, Nadir; Aïssani, Djamil; Djellab, Natalia; Nouali-Taboudjemat, Nadia
    Quality of service (QoS) provisioning in mobile ad hoc networks (MANETs) consists of providing a complex functionality in a harsh environment where resources are scarce. Thus, it is very challenging to build an efficient solution to address this issue. The proposed solutions in the literature are broadly classified into four categories, namely: QoS routing protocols, QoS signalling, QoS-aware MAC protocols and QoS models, which are the main concern of our study. The contribution of this paper is threefold: Firstly, we propose a set of guidelines to deal with the challenges facing QoS models design in ad hoc networks. Secondly, we propose a new taxonomy for QoS models in ad hoc networks. Finally, we provide an in-depth survey and discussion of the most relevant proposed frameworks.
  • 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
    Lifetime-Aware Backpressure : A New Delay-Enhanced Backpressure-Based Routing Protocol
    (IEEE, 2019-03) Kabou, Abdelbaset; Nouali-Taboudjemat, Nadia; Djahel, Soufiene; Yahiaoui, Saïd; Nouali, Omar
    Dynamic backpressure is a highly desirable family of routing protocols known for their attractive mathematical properties. However, these protocols suffer from a high end-to-end delay making them inefficient for real-time traffic with strict end-to-end delay requirements. In this paper, we address this issue by proposing a new adjustable and fully distributed backpressure-based scheme with low queue management complexity, named Lifetime-Aware Backpressure (LTA-BP). The novelty in the proposed scheme consists in introducing the urgency level as a new metric for service differentiation among the competing traffic flows in the network. Our scheme not just significantly improves the quality of service provided for real-time traffic with stringent end-to-end delay constraints, but interestingly protects also the flows with softer delay requirements from being totally starved. The proposed scheme has been evaluated and compared against other state-of-the-art routing protocol, using computer simulation, and the obtained results show its superiority in terms of the achieved end-to-end delay and throughput.
  • 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
    A framework for space-efficient variable-order Markov models
    (Oxford University Press, 2019-11-15) Cunial, Fabio; Alanko, Jarno; Belazzougui, Djamal
    Motivation: Markov models with contexts of variable length are widely used in bioinformatics for representing sets of sequences with similar biological properties. When models contain many long contexts, existing implementations are either unable to handle genome-scale training datasets within typical memory budgets, or they are optimized for specific model variants and are thus inflexible. Results: We provide practical, versatile representations of variable-order Markov models and of interpolated Markov models, that support a large number of context-selection criteria, scoring functions, probability smoothing methods, and interpolations, and that take up to four times less space than previous implementations based on the suffix array, regardless of the number and length of contexts, and up to ten times less space than previous trie-based representations, or more, while matching the size of related, state-of-the-art data structures from Natural Language Processing. We describe how to further compress our indexes to a quantity related to the redundancy of the training data, saving up to 90% of their space on very repetitive datasets, and making them become up to sixty times smaller than previous implementations based on the suffix array. Finally, we show how to exploit constraints on the length and frequency of contexts to further shrink our compressed indexes to half of their size or more, achieving data structures that are a hundred times smaller than previous implementations based on the suffix array, or more. This allows variable-order Markov models to be used with bigger datasets and with longer contexts on the same hardware, thus possibly enabling new applications. Availability and implementation: https://github.com/jnalanko/VOMM
  • Thumbnail Image
    Item
    Multiple Benefits through Smart Home Energy Management Solutions—A Simulation-Based Case Study of a Single-Family-House in Algeria and Germany
    (mdpi, 2019-04-23) Ringel, Marc; Laidi, Roufaida; Djenouri, Djamel
    From both global and local perspectives, there are strong reasons to promote energy efficiency. These reasons have prompted leaders in the European Union (EU) and countries of the Middle East and North Africa (MENA) to adopt policies to move their citizenry toward more efficient energy consumption. Energy efficiency policy is typically framed at the national, or transnational level. Policy makers then aim to incentivize microeconomic actors to align their decisions with macroeconomic policy. We suggest another path towards greater energy efficiency: Highlighting individual benefits at microeconomic level. By simulating lighting, heating and cooling operations in a model single-family home equipped with modest automation, we show that individual actors can be led to pursue energy efficiency out of enlightened self-interest. We apply simple-to-use, easily, scalable impact indicators that can be made available to homeowners and serve as intrinsic economic, environmental and social motivators for pursuing energy efficiency. The indicators reveal tangible homeowner benefits realizable under both the market-based pricing structure for energy in Germany and the state-subsidized pricing structure in Algeria. Benefits accrue under both the continental climate regime of Germany and the Mediterranean regime of Algeria, notably in the case that cooling energy needs are considered. Our findings show that smart home technology provides an attractive path for advancing energy efficiency goals. The indicators we assemble can help policy makers both to promote tangible benefits of energy efficiency to individual homeowners, and to identify those investments of public funds that best support individual pursuit of national and transnational energy goals.
  • Thumbnail Image
    Item
    Machine Learning for Smart Building Applications: Review and Taxonomy
    (ACM, 2019-03) Djenouri, Djamel; Laidi, Roufaida; Djenouri, Youcef; Balasingham, Ilangko
    The use of machine learning (ML) in smart building applications is reviewed in this paper. We split existing solutions into two main classes, occupant-centric vs. energy/devices centric. The first class groups solutions that use ML for aspects related to the occupants, including (1) occupancy estimation and identification, (2) activity recognition, and (3) estimating preferences and behavior. The second class groups solutions that use ML to estimate aspects related either to energy or devices. They are divided into three categories, (1) energy profiling and demand estimation, (2) appliances profiling and fault detection, and (3) inference on sensors. Solutions in each category are presented, discussed and compared, as well as open perspectives and research trends. Compared to related state-of-the-art survey papers, the contribution herein is to provide a comprehensive and holistic review from the ML perspectives rather than architectural and technical aspects of existing building management systems. This is by considering all types of ML tools, buildings, and several categories of applications, and by structuring the taxonomy accordingly. The paper ends with a summary discussion of the presented works, with focus on lessons learned, challenges, open and future directions of research in this field.
  • Thumbnail Image
    Item
    Machine Learning for Smart Building Applications: Review and Taxonomy
    (ACM, 2019-03) Djenouri, Djamel; Laidi, Roufaida; Djenouri, Youcef; Balasingham, Ilangko
    The use of machine learning (ML) in smart building applications is reviewed in this paper. We split existing solutions into two main classes, occupant-centric vs. energy/devices centric. The first class groups solutions that use ML for aspects related to the occupants, including (1) occupancy estimation and identification, (2) activity recognition, and (3) estimating preferences and behavior. The second class groups solutions that use ML to estimate aspects related either to energy or devices. They are divided into three categories, (1) energy profiling and demand estimation, (2) appliances profiling and fault detection, and (3) inference on sensors. Solutions in each category are presented, discussed and compared, as well as open perspectives and research trends. Compared to related state-of-the-art survey papers, the contribution herein is to provide a comprehensive and holistic review from the ML perspectives rather than architectural and technical aspects of existing building management systems. This is by considering all types of ML tools, buildings, and several categories of applications, and by structuring the taxonomy accordingly. The paper ends with a summary discussion of the presented works, with focus on lessons learned, challenges, open and future directions of research in this field.