Gene microarray classification problems are considered a challenge task since the datasets contain few number of samples with high number of genes (features). The genes subset selection in microarray data play an important role for minimizing the computational load and solving classification problems. In this paper, the Correlation-based Feature Selection (CFS) algorithm is utilized in the feature selection process to reduce the dimensionality of data and finding a set of discriminatory genes. Then, the Decision Table, JRip, and OneR are employed for classification process. The proposed approach of gene selection and classification is tested on 11 microarray datasets and the performances of the filtered datasets are compared with the original datasets. The experimental results showed that CFS can effectively screen irrelevant, redundant, and noisy features. In addition, the results for all datasets proved that the proposed approach with a small number of genes can achieve high prediction accuracy and fast computational speed. Considering the average accuracy for all the analysis of microarray data, the JRip achieved the best result as compared to Decision Table, and OneR classifier. The proposed approach has a remarkable impact on the classification accuracy especially when the data is complicated with multiple classes and high number of genes.

Structured population in evolutionary algorithms (EAs) is an important research track where an individual only interacts with its neighboring individuals in the breeding step. The main rationale behind this is to provide a high level of diversity to overcome the genetic drift. Cellular automata concepts have been embedded to the process of EA in order to provide a decentralized method in order to preserve the population structure. Harmony search (HS) is a recent EA that considers the whole individuals in the breeding step. In this paper, the cellular automata concepts are embedded into the HS algorithm to come up with a new version called cellular harmony search (cHS). In cHS, the population is arranged as a two-dimensional toroidal grid, where each individual in the grid is a cell and only interacts with its neighbors. The memory consideration and population update are modified according to cellular EA theory. The experimental results using benchmark functions show that embedding the cellular automata concepts with HS processes directly affects the performance. Finally, a parameter sensitivity analysis of the cHS variation is analyzed and a comparative evaluation shows the success of cHS.

No abstract

Preparing an optimal exam timetable in universities is challenging for head of departments, especially for colleges with multiple number of departments, courses, and students. Harmony search algorithm is used by many researchers to solve this problem but none of them could get an optimal solution. In this paper, a new algorithm which is called optimised harmony search algorithm with distributed selections is proposed by optimising the harmony search algorithm and the genetic algorithm. The new algorithm could satisfy hard, soft, and general constraints and generate an optimal exam timetable for a huge number of courses and students. The proposed algorithm is implemented and applied on Jadara University, the algorithm uses an upper triangular matrix to reduce relationships and memory usage, a three-dimensional matrix to ease the exams timetable management a deterministic number generators to eliminate timeslots conflicts, and backtracking algorithm to enhance the population selections. Lecturers and students’ feedback showed a good satisfaction as well the system results.

The services of the Video on Demand (VoD) are currently based on the developments of the technology of the digital video and the network’s high speed. The files of the video are retrieved from many viewers according to the permission, which is given by VoD services. The remote VoD servers conduct this access. A server permits the user to choose videos anywhere/anytime in order to enjoy a unified control of the video playback. In this paper, a novel adaptive method is produced in order to deliver various facilities of the VoD to all mobile nodes that are moving within several networks. This process is performed via mobility modules within the produced method since it applies a seamless playback technique for retrieving the facilities of the VoD through environments of heterogeneous networks. The main components comprise two servers, which are named as the GMF and the LMF. The performance of the simulation is tested for checking clients’ movements through different networks with different sizes and speeds, which are buffered in the storage. It is found to be proven from the results that the handoff latency has various types of rapidity. The method applies smooth connections and delivers various facilities of the VoD. Meantime, the mobile device transfers through different networks. This implies that the system transports video segments easily without encountering any notable effects.In the experimental analysis for the Slow movements mobile node handoff latency (8 Km/hour or 4 m/s) ,the mobile device’s speed reaches 4m/s, the delay time ranges from 1 to 1.2 seconds in the proposed system, while the MobiVoD system ranges from 1.1 to 1.5. In the proposed technique reaches 1.1026 seconds forming the required time of a mobile device that is switching from a single network to its adjacent one. while the handoff termination average in the MobiVoD reaches 1.3098 seconds. Medium movement mobile node handoff latency (21 Km/ hour or 8 m/s) The average handoff time for the proposed system reaches 1.1057 seconds where this implies that this technique can seamlessly provide several segments of a video segments regardless of any encountered problems. while the average handoff time for the MobiVoD reaches 1.53006623 seconds. Furthermore, Fast movement mobile node handoff latency (390 Km/ hour or 20 m/s). The average time latency of the proposed technique reaches 1.0964 seconds, while the MobiVoD System reaches to 1.668225 seconds.