Publications

  • May 2021 - Empirical Software Engineering Journal

    The Timetable Problem is one of the complex problems faced in any university in the world. It is a highly-constrained ...

    Given the competitive mobile app market, developers must be fullyaware of users’ needs, satisfy users’ requirements, combat apps of similar func-tionalities (i.e.,competing apps), and thus stay ahead of the competition. Whileit is easy to track the overall user ratings of competing apps, such informationfails to provide actionable insights for developers to improve their apps overthe competing apps [2]. Thus, developers still need to read reviews from alltheir interested competing apps and summarize the advantages and disadvan-tages of each app. Such a manual process can be tedious and even infeasiblewith thousands of reviews posted daily.

    To help developers compare users’ opinions among competing apps onhigh-level features, such as the main functionalities and the main characteristics ofan app, we propose a review analysis approach namedFeatCompare. Feat-Compare can automatically identify high-level features mentioned in user re-views without any manually annotated resource. Then, FeatCompare creates acomparative table that summarizes users’ opinions for each identified featureacross competing apps. FeatCompare features a novel neural network-basedmodel namedGlobal-Local sensitiveFeatureExtractor (GLFE), which ex-tends Attention-based Aspect Extraction (ABAE), a state-of-the-art modelfor extracting high-level features from reviews. We evaluate the effectivenessof GLFE on 480 manually annotated reviews sampled from five groups of com-peting apps. Our experiment results show that GLFE achieves a precision of79%-82% and recall of 74%-77% in identifying the high-level features asso-ciated with reviews and outperforms ABAE by 14.7% on average. We alsoconduct a case study to demonstrate the usage scenarios of FeatCompare. A survey with 107 mobile app developers shows that more than 70% of developersagree that FeatCompare is of great benefit.

    Click here to read the full paper

  • August 2018 - Knowledge-Based and Intelligent Information & Engineering Systems

    The Timetable Problem is one of the complex problems faced in any university in the world. It is a highly-constrained ...

    The Timetable Problem is one of the complex problems faced in any university in the world. It is a highly-constrained combinatorial problem that seeks to find a possible scheduling for the university course offerings. There are many algorithms and approaches adopted to solve this problem, but one of the effective approaches to solve it is the use of meta-heuristics. Genetic algorithms were successfully useful to solve many optimization problems including the university Timetable Problem. In this paper, we analyse the Genetic Algorithm approach for graph colouring corresponding to the timetable problem. The GA method is implemented in java, and the improvement of the initial solution is exhibited by the results of the experiments based on the specified constraints and requirements.

    Click here to read the full paper

  • March 2019 - IEEE International Arab Conference on Information Technology

    The Knapsack Problem (KP) is one of the most studied combinatorial problems. There are many variations of the problem. There are many variations of the problem along with many real life applications...

    The Knapsack Problem (KP) is one of the most studied combinatorial problems. There are many variations of the problem along with many real life applications. KP seeks to select some of the available items with the maximal total weight in a way that does not exceed a given maximum limit L. Knapsack problems have been used to tackle real life problem belonging to a variety of fields including cryptography and applied mathematics. In this paper, we consider the different instances of Knapsack Problem along with its applications and various approaches to solve the problem.

    Click here to read the full paper

  • May 2017 - International Conference on Enterprise Information Systems

    Privacy and anonymity are important concepts in the field of communication. Internet users seek to adopt protective measures to ensure the privacy and ...

    Privacy and anonymity are important concepts in the field of communication. Internet users seek to adopt protective measures to ensure the privacy and security of the data transmitted over the network. Encryption is one technique to secure critical information and protect its confidentiality. Although there exist many encryption algorithms, hiding the identity of the sender can only be achieved through an anonymous network. Different classifications of anonymous networks exist. Latency level and system model architecture are two essential criteria. In this paper, we present a description of a set of anonymous systems including NetCamo, TOR, I2P and many others. We will show how these systems work and contrast the advantages and disadvantages of each one of them.

    Click here to read the full paper