Faisal Alkhateeb

Hybridizing Harmony Search algorithm with different mutation operators for continuous problems

Abstract Harmony Search (HS) is a recent EA inspired by musical improvisation process to seek a pleasing harmony. Mutation is a vital component used in Evolutionary Algorithms (EA) where a value in the population is randomly selected to be altered to improve the evolution process. The original HS algorithm applies an operation similar to mutation during the random consideration operator. During random selection operator a value within the range of the decision variable is selected randomly to explore different areas in the search space. This paper aims at experimentally evaluating the performance of HS algorithm after replacing the random consideration operator in the original HS with five different mutation methods. The different variations of HS are experimented on standard benchmark functions in terms of final obtained solution and convergence speed. The results show that using polynomial mutation improves the performance of the HS algorithm for most of the used functions.

The design of RIA accessibility evaluation tool

Most of the accessibility evaluation tools available check the accessibility of static traditional web pages (e.g., web pages encoded with only HTML) according to the accessibility guidelines (e.g., WCAG). There is an increased need to check the accessibility of Rich Internet Applications (RIAs) using automatic tools. In this paper, we present a conceptual framework for automatic evaluation of accessibility of rich Internet contents. The framework includes: web robot, RIA events controller, WAI-ARIA accessibility specifications, evaluator, and results handler. An example to demonstrate how the framework can be applied has been presented in detail.

A semantic data validation service for web applications

An Input validation can be a critical issue. Typically, a little attention is paid to it in a web development project, because overenthusiastic validation can tend to cause failures in the software, and can also break the security upon web applications such as an unauthorized access to data. Now, it is estimated the web application vulnerabilities (such as XSS or SQL injection) for more than two thirds of the reported web security vulnerabilities. In this paper, we start with a case study of the bypassing data validation and security vulnerabilities such as SQL injection and then go on to discuss the merits of a number of common data validation techniques. We also review the different solutions to date to provide data validation techniques in ecommerce applications. From this analysis, a new data validation service which is based upon semantic web Technologies, has been designed and implemented to prevent the web security vulnerabilities at the application level and to secure the web system even if the input validation modules are bypassed. Our semantic architecture consists of the following components: RDFa annotation for elements of web pages, interceptor, RDF extractor, RDF parser, and data validator. The experimental results of the pilot study indicate that the proposed data validation service might provide a detection, and prevention of some web application attacks.

Constrained regular expressions for answering RDF-path queries modulo RDFS

The standard SPARQL query language is currently defined for querying RDF graphs without RDFS semantics. Several extensions of SPARQL to RDFS semantics have been proposed. In this paper, we discuss extensions of SPARQL that use regular expressions to navigate RDF graphs and may be used to answer queries considering RDFS semantics. In particular, we present and compare nSPARQL and our proposal CPSPARQL. We show that CPSPARQL is expressive enough to answer full SPARQL queries modulo RDFS. Finally, we compare the expressiveness and complexity of both nSPARQL and the corresponding frag- ment of CPSPARQL, that we call cpSPARQL. We show that both languages have the same complexity through cpSPARQL, being a proper extension of SPARQL graph patterns, is more expressive than nSPARQL.

The Use of Location Based Services for Very Fast and Precise Accidents' Reporting and Locating

Most people are stressed out and overstrained after accidents even if no one is hurt. Consequently, they may face some difficulty in reporting the accident to the police and civil defense, or they may provide them with inaccurate information about the location of the accident. Moreover, even if they were able to provide the necessary information it may take them some time to deliver it to a human counterpart and hence it will take the police and civil defense more time to reach the accident location in the appropriate time to rescue people. This paper proposes the use of location based services to develop a system that can be used easily to report and locate an accident more quickly and precisely.

Feature: A secure wifi system for wireless networks: an experimental evaluation

Many web-based organisations have been penetrated through unsecured Internet sessions over TCP/IP networks. These unsecured sessions are targeted by hackers to illegally capture sensitive information. Securing these sessions, especially across wireless networks, is crucial. Here we examine a novel method of securing the data transmitted over wireless networks - a secure wifi (sWiFi) system.

Annotations, Collaborative Tagging, and Searching Mathematics in E-Learning

This paper presents a new framework for adding semantics into e-learning system. The proposed approach relies on two principles. The first principle is the automatic addition of semantic information when creating the mathematical contents. The second principle is the collaborative tagging and annotation of the e-learning contents and the use of an ontology to categorize the e-learning contents. The proposed system encodes the mathematical contents using presentation MathML with RDFa annotations. The system allows students to highlight and annotate specific parts of the e-learning contents. The objective is to add meaning into the e-learning contents, to add relationships between contents, and to create a framework to facilitate searching the contents. This semantic information can be used to answer semantic queries (e.g., SPARQL) to retrieve information request of a user. This work is implemented as an embedded code into Moodle e-learning system.

Bees_ Ants Based Routing Algorithm

In this paper we propose a novel routing algorithm called Bees Ants algorithm. This algorithm is a combination of Ant colony based Routing Algorithm (ARA) and BeeHive based Routing Algorithm. The proposed routing algorithm depends on splitting the network into two parts; one is a fixed network and the other is a mobile ad hoc network (MANET), then applying the Ant colony based Routing Algorithm on the mobile part and the BeeHive based Routing Algorithm on the fixed one. After comparing the proposed algorithm with the ARA algorithm, it shows promising results in terms of propagation delay, queue delay, and number of hops.

A Multi Agent-Based System for Securing University Campus: Design and Architecture

A multi-agent system (MAS) is a system composed of multiple interacting intelligent agents. Multi-agent systems can be used to solve problems which are difficult or impossible for an individual agent or monolithic system to solve. In this paper, we propose a security system based on multi agents and wireless sensors to secure the buildings and faculties of a University campus.

Hybridizing Harmony Search Algorithm with Multi-Parent Crossover to Solve Real World Optimization Problems

Harmony search algorithm (HSA) is a recent evolutionary algorithm used to solve several optimization problems. The algorithm mimics the improvisation behaviour of a group of musicians to find a good harmony. Several variations of HSA have been proposed to enhance its performance. In this paper, a new variation of HSA that uses multi-parent crossover is proposed (HSA-MPC). In this technique three harmonies are used to generate three new harmonies that will replace the worst three solution vectors in the harmony memory (HM). The algorithm has been applied to solve a set of eight real world numerical optimization problems (1-8) introduced for IEEE-CEC2011 evolutionary algorithm competition. The experimental results of the proposed algorithm are compared with the original HSA, and two variations of HSA: global best HSA and tournament HSA. The HSA-MPC almost always shows superiority on all test problems.