Publications

  • 2018
    Hamida Labidi, Khaled Hassine, Fethi Mguis

    Genetic Algorithm for Solving a Dynamic Vehicle Routing Problem with Time Windows

    This paper proposes a genetic algorithm to solve the dynamic vehicle routing problem with time windows, presented at HPCS 2018., 2018

    Abstract

    The Vehicle Routing Problem (VRP) introduced by Dantzing and Ranser (1959) is a prominent combinatorial optimization problem. Over the last several decades, many variants of the multi-constrained vehicle routing problem have been studied and a class of problems known as rich vehicle routing problem (RVRPs), has been formed. This work is about solving a variant of RVRP with dynamically changing orders and time windows constraints. In the real world application, during the working day, new orders often occur dynamically and need to be integrated into the routes planing. A Genetic Algorithm (GA) with a simple heuristic is proposed to solve the dynamic vehicle routing problem with time windows. The performance is tested on Solomon’s benchmark with different percentage of the orders revealed to the algorithm during operation time.

    Hamdi Ouechtati, Nadia Ben Azzouna, Lamjed Ben Said

    Towards a self-adaptive access control middleware for the Internet of Things

    In 2018 International Conference on Information Networking (ICOIN) (pp. 545-550). IEEE., 2018

    Abstract

    In order to cope with certain challenges posed by IoT environment and device capacity, a Self-Adaptive access control model is needed to resolve security and privacy issues. The use of complex encryption algorithms is infeasible due to the volatile nature of IoT environment and pervasive devices with limited resources. In this paper, we propose an access control middleware for the Internet of Things. The latter is an extension of the ABAC model in order to take into account the subject behavior and the trust value in the decision making process. In this work, we introduce a dynamic adaptation process of access control rules based on the risk value, the policies and rule sets which can effectively improve the security of IoT applications and produce more efficient access control mechanisms for the Internet of Things.

    Kalthoum Rezgui, Hédia Sellemi, Khaled Ghédira

    Towards a common and semantic representation of e-portfolios

    -, 2018

    Abstract

    Since the early 1980s, a paradigm shift, caused by the work undertaken in the field of cognitive psychology, has occurred. This shift is known as the move from teacher-centered instruction to learner-centered or learning-centered instruction, and emphasizes the importance of building new knowledge on previous ones, interacting with peers, making meaningful and reflective learning and being engaged in his own path to foster learning. This new vision of teaching has created a need for new learning and assessment instruments that are better adapted to these pedagogical realities. In this context, the electronic portfolio or e-portfolio is one of the most versatile and effective tools that have been proposed for this purpose. More specifically, the interest in e-portfolios has grown considerably with the emergence of the competency-based approach and portfolio-based competency assessments. The purpose of this paper is to describe a semantic-based representation of e-portfolios, defined on the basis of official e-portfolio standards and specifications. Moreover, a comparative study of several well-known e-portfolio solutions has been carried out based on different facets, such as functional features, technical and organizational features. The objective is to identify those features that are mostly supported by e-portfolio solution providers and accordingly to gain a fairly accurate idea of the common structure of e-portfolios. In addition, the authors take advantage of an already implemented ontological model describing competency-related characteristics of learners and learning objects and combine it with the e-portfolio ontology, with a view to support a more reliable and authentic competency assessment.

    Kalthoum Rezgui, Hédia Sellemi

    A Semantic Web Architecture for Competency-Based Lifelong Learning Support Systems

    -, 2018

    Abstract

    In this paper, we present a semantic Web architecture of a competency-based lifelong learning support system which falls within the scope of lifelong learning and attempts to deal with the issue of competency tracking, management, and development in learning networks. In particular, the proposed system aims to track learners’ competencies in learning networks and to provide them with different competency assessment procedures, such as learner positioning, competency gap analysis, and competency profile matching. In addition, it integrates a personalized learning path generator module that enables learners fill the gap between available and expected competencies. This system is currently under construction and will include semantic Web services capabilities for supporting automatic matchmaking tasks.

    Kalthoum Rezgui, Hédia Sellemi

    Modeling competencies in competency-based learning: Classification and cartography

    -, 2018

    Abstract

    Despite the importance of competency modeling for both individuals and organizations, there is a lack of a comprehensive literature review and a cartography for it. This paper aims to provide an in-depth overview of different approaches to competency modeling reported in the field of technology-enhanced com petency-based learning. This literature review is complemented by an additional overview of related initiatives toward modeling intended learning outcomes, learning opportunities, achieved learning outcome profiles of learners and competency maps. In addition, a cartography illustrating the relationships between some important models is proposed. The main purpose of this work is to provide researchers with a comprehensive review of the current status in this field as well as to highlight ongoing issues and challenges that need to be addressed.

    Soumaya Moussa, Saoussen Bel Haj Kacem

    A Fuzzy Unified Framework for Imprecise Knowledge

    In: Hartmann, S., Ma, H., Hameurlain, A., Pernul, G., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2018. Lecture Notes in Computer Science(), vol 11030., 2018

    Abstract

    When building Knowledge-Based Systems, we are often faced with vague data. The formers are generally modeled and treated using fuzzy logic, which is based on fuzzy set theory, or using symbolic multi-valued logic, which is based on multi-set theory. To provide a unified framework to handle simultaneously both types of information, we propose in this paper a new approach to translate multi-valued knowledge into fuzzy knowledge. For that purpose, we put forward a symbolictofuzzy conversion method to automatically generate fuzzy sets from an initial multi-set. Once unified, handling heterogeneous knowledge become feasible. We apply our proposal in Rule-Based Systems where an approximate reasoning is required in their inference engine. Once new facts are deduced and in order to make the translation completely transparent for the user, we also provide a fuzzytosymbolic conversion method. Its purpose is to restore the original knowledge type if they were multi-valued. Our proposal offer a high flexibility to the user to reason regardless to the knowledge type. In addition, it is an alternative to overcome the modeling shortcoming of abstract data by taking advantage of a rigorous mathematical framework of fuzzy logic. A numerical study is finally provided to illustrate the potential application of the proposed methodology.

    Marwa Hammami, Slim Bechikh, Chih Cheng-Hung, Lamjed Ben Said

    A Multi-objective Hybrid Filter-Wrapper Evolutionary Approach for Feature Selection.

    Memetic Computing (IF: 5.9). 11(2), 193-208., 2018

    Abstract

    Feature selection is an important pre-processing data mining task, which can reduce the data dimensionality and improve not
    only the classification accuracy but also the classifier efficiency. Filters use statistical characteristics of the data as the evaluation
    measure rather than using a classification algorithm. On the contrary, the wrapper process is computationally expensive
    because the evaluation of every feature subset requires running the classifier on the datasets and computing the accuracy
    from the obtained confusion matrix. In order to solve this problem, we propose a hybrid tri-objective evolutionary algorithm
    that optimizes two filter objectives, namely the number of features and the mutual information, and one wrapper objective
    corresponding to the accuracy. Once the population is classified into different non-dominated fronts, only feature subsets
    belonging to the first (best) one are improved using the indicator-based multi-objective local search. Our proposed hybrid
    algorithm, named Filter-Wrapper-based Nondominated Sorting Genetic Algorithm-II, is compared against several multiobjective and single-objective feature selection algorithms on eighteen benchmark datasets having different dimensionalities.
    Experimental results show that our proposed algorithm gives competitive and better results with respect to existing algorithms.

    Marwa Hammami, Slim Bechikh, Chih Cheng-Hung, Lamjed Ben Said

    A Multi-objective Hybrid Filter-Wrapper Approach For Feature Construction On High-Dimensional Data Using GP.

    Proceedings of the IEEE Congress on Evolutionary Computation. pp 1-8, 2018

    Abstract

    Feature selection and construction are important
    pre-processing techniques in data mining. They may allow
    not only dimensionality reduction but also classifier accuracy
    and efficiency improvement. These two techniques are of great
    importance especially for the case of high-dimensional data.
    Feature construction for high-dimensional data is still a very
    challenging topic. This can be explained by the large search space
    of feature combinations, whose size is a function of the number of
    features. Recently, researchers have used Genetic Programming
    (GP) for feature construction and the obtained results were
    promising. Unfortunately, the wrapper evaluation of each feature
    subset, where a feature can be constructed by a combination
    of features, is computationally intensive since such evaluation
    requires running the classifier on the data sets. Motivated by
    this observation, we propose, in this paper, a hybrid multiobjective evolutionary approach for efficient feature construction
    and selection. Our approach uses two filter objectives and one
    wrapper objective corresponding to the accuracy. In fact, the
    whole population is evaluated using two filter objectives. However,
    only non-dominated (best) feature subsets are improved using an
    indicator-based local search that optimizes the three objectives
    simultaneously. Our approach has been assessed on six highdimensional datasets and compared with two existing prominent
    GP approaches, using three different classifiers for accuracy
    evaluation. Based on the obtained results, our approach is shown
    to provide competitive and better results compared with two
    competitor GP algorithms tested in this study

    Wissem Inoubli, Sabeur Aridhi, Haithem Mezni, Mondher Maddouri, Engelbert Mephu Nguifo

    A Comparative Study on Streaming Frameworks for Big Data

    VLDB 2018-44th International Conference on Very Large Data Bases: Workshop LADaS-Latin American Data Science, 2018

    Abstract

    Recently, increasingly large amounts of data are generated from a variety of sources. Existing data processing technologies are not suitable to cope with the huge amounts of generated data. Yet, many research works focus on streaming in Big Data, a task referring to the processing of massive volumes of structured/unstructured streaming data. Recently proposed streaming frameworks for Big Data applications help to store, analyze and process the continuously captured data. In this paper, we discuss the challenges of Big Data and we survey existing streaming frameworks for Big Data. We also present an experimental evaluation and a comparative study of the most popular streaming platforms.

  • Mohamed Amin Hajji, Haithem Mezni

    A composite particle swarm optimization approach for the composite SaaS placement in cloud environment

    Soft Computing, 2017

    Abstract

    Cloud computing has emerged as a new powerful service delivery model to cope with resource challenges and to offer on-demand various types of services (e.g., software, storage, network). One of the most popular service models is Software as a Service (SaaS). To allow flexibility and reusability, SaaS can be offered in a composite form, where a set of interacting application and data components cooperate to form a higher-level functional SaaS. However, this approach introduces new challenges to resource management in the cloud, especially finding the optimal placement for SaaS components to have the best possible SaaS performance. SaaS Placement Problem (SPP) refers to this challenge of determining which servers in the cloud’s data center can host which components without violating SaaS constraints. Most existing SPP approaches only addressed homogenous SaaS components placement and only considered one type of constraints (i.e., resource constraint). In addition, none of them has considered the objective of maintaining a good machine performance by minimizing the resource usage for the hosting machines. To allow finding the optimal placement of a composite SaaS, we adopt a new variation of PSO called ’Particle Swarm Optimization with Composite Particle (PSO-CP).’ In the proposed PSO-CP-based approach, each composite particle in the swarm represents a candidate SaaS placement scheme. Composite particles adopt a collective behavior to explore and evaluate the search space (i.e., data center) and adjust their structures by collaborating with other composite or independent particles (i.e., servers). The implementation and experimental results show the feasibility and efficiency of the proposed approach.