Publications

Export 165 results:
Sort by: [ Author  (Desc)] Title Type Year
A B C D [E] F G H I J K L M N O P Q R S T U V W X Y Z   [Show ALL]
E
Elhoseny, M., Alaa Tharwat, X. Yuan, and A. E. Hassanien, "Optimizing K-coverage of mobile WSNs", Expert Systems with Applications, vol. 92, 2018. AbstractWebsite

Recently, Wireless Sensor Networks (WSNs) are widely used for monitoring and tracking applications. Sensor mobility adds extra flexibility and greatly expands the application space. Due to the limited energy and battery lifetime for each sensor, it can remain active only for a limited amount of time. To avoid the drawbacks of the classical coverage model, especially if a sensor died, K-coverage model requires at least k sensor nodes monitor any target to consider it covered. This paper proposed a new model that uses the Genetic Algorithm (GA) to optimize the coverage requirements in WSNs to provide continuous monitoring of specified targets for longest possible time with limited energy resources. Moreover, we allow sensor nodes to move to appropriate positions to collect environmental information. Our model is based on the continuous and variable speed movement of mobile sensors to keep all targets under their cover all times. To further prove that our proposed model is better than other related work, a set of experiments in different working environments and a comparison with the most related work are conducted. The improvement that our proposed method achieved regarding the network lifetime was in a range of 26%–41.3% using stationary nodes while it was in a range of 29.3%–45.7% using mobile nodes. In addition, the network throughput is improved in a range of 13%–17.6%. Moreover, the running time to form the network structure and switch between nodes’ modes is reduced by 12%.

Elhoseny, M., N. Metawa, and A. E. Hassanien, "An automated information system to ensure quality in higher education institutions", 2016 12th International Computer Engineering Conference (ICENCO), , Cairo, 28-29 Dec. 2016. Abstract

Despite the great efforts to assure quality in higher education institutions, the ambiguity of its related concepts and requirements constitute a big challenge when trying to implement it as an automated information system. The present work introduces a framework for an automated information system that manages the quality assurance in higher educations institutions. The aim of designing such a system is to provide an automation tool that avoids unnecessary and redundant tasks associated to quality in higher education institutions. In addition, the proposed system helps all higher education stockholders to handle and monitor their tasks. Moreover, it aims to help the quality assurance center in a higher education institution to apply its qualitys standards, and to make sure that they are being maintained and enhanced. This information system contains a core module and 17 sub-modules, which are described in this paper.

Elharir, E., N. El-Bendary, and A. E. Hassanien, "Bio-inspired optimization for feature set dimensionality reduction", 3rd International Conference on Advances in Computational Tools for Engineering Applications (ACTEA),, Beirut, Lebanon, 13-15 July , 2016. Abstract

In this paper, two novel bio-inspired optimization algorithms; namely Dragonfly Algorithm (DA) and Grey Wolf Optimizer (GWO), have been applied for fulfilling the goal of feature set dimensional reduction. The proposed classification system has been tested via solving the problem of Electromyography (EMG) signal classification with optimal features subset selection. The obtained experimental results showed that the GWO based Support Vector Machines (SVM) classification algorithm has achieved an accuracy of 93.22% using 31% of the total extracted features. It also outperformed both the typical SVM algorithm, with no feature set optimization, and the DA based optimized feature set SVM classification, for the tested EMG dataset.

Elghamrawy, S., and Aboul Ella Hassa, "A Partitioning Framework for Cassandra NoSQL Database using Rendezvous Hashing", Journal of Supercomputing (SUPE), Springer , vol. pp 1–22, 2017. AbstractWebsite

Due to the gradual expansion in data volume used in social networks and cloud computing, the term “Big data” has appeared with its challenges to store the immense datasets. Many tools and algorithms appeared to handle the challenges of storing big data. NoSQL databases, such as Cassandra and MongoDB, are designed with a novel data management system that can handle and process huge volumes of data. Partitioning data in NoSQL databases is considered one of the critical challenges in database design. In this paper, a MapReduce Rendezvous Hashing-Based Virtual Hierarchies (MR-RHVH) framework is proposed for scalable partitioning of Cassandra NoSQL database. The MapReduce framework is used to implement MR-RHVH on Cassandra to enhance its performance in highly distributed environments. MR-RHVH distributes the nodes to rendezvous regions based on a proposed Adopted Virtual Hierarchies strategy. Each region is responsible for a set of nodes. In addition, a proposed bloom filter evaluator is used to ensure the accurate allocation of keys to nodes in each region. Moreover, a number of experiments were performed to evaluate the performance of MR-RHVH framework, using YCSB for database benchmarking. The results show high scalability rate and less time consuming for MR-RHVH framework over different recent systems.

Elbedwehy, M. N., M. E. Ghoneim, A. E. Hassanien, and A. T. Azar, "A computational knowledge representation model for cognitive computers", Neural Computing and Application , vol. June 2014, 2014. AbstractWebsite

The accumulating data are easy to store but the ability of understanding and using it does not keep track with its growth. So researches focus on the nature of knowledge processing in the mind. This paper proposes a semantic model (CKRMCC) based on cognitive aspects that enables cognitive computer to process the knowledge as the human mind and find a suitable representation of that knowledge. In cognitive computer, knowledge processing passes through three major stages: knowledge acquisition and encoding, knowledge representation, and knowledge inference and validation. The core of CKRMCC is knowledge representation, which in turn proceeds through four phases: prototype formation phase, discrimination phase, generalization phase, and algorithm development phase. Each of those phases is mathematically formulated using the notions of real-time process algebra. The performance efficiency of CKRMCC is evaluated using some datasets from the well-known UCI repository of machine learning datasets. The acquired datasets are divided into training and testing data that are encoded using concept matrix. Consequently, in the knowledge representation stage, a set of symbolic rule is derived to establish a suitable representation for the training datasets. This representation will be available in a usable form when it is needed in the future. The inference stage uses the rule set to obtain the classes of the encoded testing datasets. Finally, knowledge validation phase is validating and verifying the results of applying the rule set on testing datasets. The performances are compared with classification and regression tree and support vector machine and prove that CKRMCC has an efficient performance in representing the knowledge using symbolic rules.

Elbedwehy, M. N., M. E. Ghoneim, and A. E. Hassanien, "Computational model for artificial learning using fonnal concept analysis", Computer Engineering & Systems (ICCES), 2013 8th International Conference on: IEEE, pp. 9–14, 2013. Abstract
n/a
Elbedwehy, M. N., M. E. Ghoneim, A. E. Hassanien, and A. T. Azar, "A computational knowledge representation model for cognitive computers", Neural Computing and Applications, vol. 25, no. 7-8: Springer London, pp. 1517–1534, 2014. Abstract
n/a
Elbedwehy, M. N., H. M. Zawbaa, N. Ghali, and A. E. Hassanien, "Detection of heart disease using binary particle swarm optimization", Computer Science and Information Systems (FedCSIS), 2012 Federated Conference on: IEEE, pp. 177–182, 2012. Abstract
n/a
Elbedwehy, M. N., H. M. Zawbaa, N. Ghali, and A. E. Hassanien, "Detection of heart disease using binary particle swarm optimization", Computer Science and Information Systems (FedCSIS), 2012 Federated Conference on: IEEE, pp. 177–182, 2012. Abstract
n/a
Elbedwehy, M. N., H. M. Zawbaa, N. Ghali, and A. E. Hassanien, "Detection of Heart Disease using Binary Particle Swarm Optimization", IEEE Federated Conference on Computer Science and Information Systems, Wroclaw - Poland, pp. 199–204, 2012. Abstractdetection_of_heart_disease_using_binary_particle.pdf

This article introduces a computer-aided diagnosis
system of the heart valve disease using binary particle swarm
optimization and support vector machine, in conjunction with
K-nearest neighbor and with leave-one-out cross-validation. The
system was applied in a representative heart dataset of 198
heart sound signals, which come both from healthy medical cases
and from cases suffering from the four most usual heart valve
diseases: aortic stenosis (AS), aortic regurgitation (AR), mitral
stenosis (MS) and mitral regurgitation (MR). The introduced
approach starts with an algorithm based on binary particle
swarm optimization to select the most weighted features. This
is followed by performing support vector machine to classify
the heart signals into two outcome: healthy or having a heart
valve disease, then its classified the having a heart valve disease
into four outcomes: aortic stenosis (AS), aortic regurgitation
(AR), mitral stenosis (MS) and mitral regurgitation (MR). The
experimental results obtained, show that the overall accuracy
offered by the employed approach is high compared with other
techniques.

Elbedwehy, M. N., M. E. Ghoneim, A. E. Hassanien, and A. T. Azar, "A computational knowledge representation model for cognitive computers", Neural Computing and Application (Springer), vol. In press, 2014.
Elbedwehy, M. N., M. E. Ghoneim, and A. E. Hassanien, "Computational model for artificial learning using fonnal concept analysis", Computer Engineering & Systems (ICCES), 2013 8th International Conference on: IEEE, pp. 9–14, 2013. Abstract
n/a
abd elaziz, M., A. A. Ewees, and A. E. Hassanien, "Multi-objective whale optimization algorithm for content-based image retrieval", Download PDF Multimedia Tools and Applications, 2018. AbstractWebsite

In the recent years, there are massive digital images collections in many fields of our life, which led the technology to find methods to search and retrieve these images efficiently. The content-based is one of the popular methods used to retrieve images, which depends on the color, texture and shape descriptors to extract features from images. However, the performance of the content-based image retrieval methods depends on the size of features that are extracted from images and the classification accuracy. Therefore, this problem is considered as a multi-objective and there are several methods that used to manipulate it such as NSGA-II and NSMOPSO. However, these methods have drawbacks such as their time and space complexity are large since they used traditional non-dominated sorting methods. In this paper, a new non-dominated sorting based on multi-objective whale optimization algorithm is proposed for content-based image retrieval (NSMOWOA). The proposed method avoids the drawbacks in other non-dominated sorting multi-objective methods that have been used for content-based image retrieval through reducing the space and time complexity. The results of the NSMOWOA showed a good performance in content-based image retrieval problem in terms of recall and precision.

abd elaziz, M., A. A. Ewees, and A. E. Hassanien, "Hybrid Swarms Optimization Based Image Segmentation", Hybrid Soft Computing for Image Segmentation: Springer International Publishing, pp. 1–21, 2016. Abstract
n/a
abd elaziz, M., and A. E. Hassanien, "Modified cuckoo search algorithm with rough sets for feature selection", Neural Computing and Applications: Springer London, pp. 1–10, 2016. Abstract
n/a
abd elaziz, M., and A. E. Hassanien, "Modified cuckoo search algorithm with rough sets for feature selection", Download PDF Neural Computing and Applications, vol. 29, issue 4, pp. 925–934, 2018. AbstractWebsite

In this paper, a modified cuckoo search algorithm with rough sets is presented to deal with high dimensionality data through feature selection. The modified cuckoo search algorithm imitates the obligate brood parasitic behavior of some cuckoo species in combination with the Lévy flight behavior of some birds. The modified cuckoo search uses the rough sets theory to build the fitness function that takes the number of features in reduct set and the classification quality into account. The proposed algorithm is tested and validated benchmark on several benchmark datasets drawn from the UCI repository and using different evaluation criteria as well as a further analysis is carried out by means of the Analysis of Variance test. In addition, the proposed algorithm is experimentally compared with the existing algorithms on discrete datasets. Finally, two learning algorithms, namely K-nearest neighbors and support vector machines are used to evaluate the performance of the proposed approach. The results show that the proposed algorithm can significantly improve the classification performance.

abd elaziz, M., A. A. Ewees, and A. E. Hassanien, "Whale Optimization Algorithm and Moth-Flame Optimization for Multilevel Thresholding Image Segmentation", Expert Systems with Applications, 2017. AbstractWebsite

Determining the optimal thresholding for image segmentation has got more attention in recent years since it has many applications. There are several methods used to find the optimal thresholding values such as Otsu and Kapur based methods. These methods are suitable for bi-level thresholding case and they can be easily extended to the multilevel case, however, the process of determining the optimal thresholds in the case of multilevel thresholding is time-consuming. To avoid this problem, this paper examines the ability of two nature inspired algorithms namely: Whale Optimization Algorithm (WOA) and Moth-Flame Optimization (MFO) to determine the optimal multilevel thresholding for image segmentation. The MFO algorithm is inspired from the natural behavior of moths which have a special navigation style at night since they fly using the moonlight, whereas, the WOA algorithm emulates the natural cooperative behaviors of whales. The candidate solutions in the adapted algorithms were created using the image histogram, and then they were updated based on the characteristics of each algorithm. The solutions are assessed using the Otsu’s fitness function during the optimization operation. The performance of the proposed algorithms has been evaluated using several of benchmark images and has been compared with five different swarm algorithms. The results have been analyzed based on the best fitness values, PSNR, and SSIM measures, as well as time complexity and the ANOVA test. The experimental results showed that the proposed methods outperformed the other swarm algorithms; in addition, the MFO showed better results than WOA, as well as provided a good balance between exploration and exploitation in all images at small and high threshold numbers.

abd elaziz, M., and A. E. Hassanien, "An improved social spider optimization algorithm based on rough sets for solving minimum number attribute reduction problem,", Neural Computing and Applications, 2017 , 2017. AbstractWebsite

The minimum number attribute reduction problem is an important issue when dealing with huge amounts of data. The problem of minimum attribute reduction is formally known to be as an NP complete nonlinearly constrained optimization problem. Social spider optimization algorithm is a new meta-heuristic algorithm of the swarm intelligence field to global solution. The social spider optimization algorithm is emulates the behavior of cooperation between spiders based on the biological laws of the cooperative colony. Inspired by the social spiders, in this paper, an improved social spider algorithm for the minimal reduction problem was proposed. In the proposed algorithm, the fitness function depends on the rough sets dependency degree and it takes into a consideration the number of selected features. For each spider, the fitness function is computed and compared with the global best fitness value. If the current value is better, then the global best fitness is replaced with it and its position became the reduct set. Then, the position of each spider is updated according to its type. This process is repeated until the stopping criterion is satisfied. To validate the proposed algorithm, several real clinical medical datasets which are available from the UCI Machine Learning Repository were used to compute the performance of the proposed algorithm. The experimental results illustrate that the proposed algorithm is superior to state-of-the-art swarm-based in terms of classification accuracy while limiting number of features.

abd elaziz, M., Y. S. Moemen, A. E. Hassanien, and S. Xiong, "Quantitative Structure-Activity Relationship Model for HCVNS5B inhibitors based on an Antlion Optimizer-Adaptive Neuro-Fuzzy Inference System, ", Scientific report (Nature) , vol. 1506, 2018. Abstract

The global prevalence of hepatitis C Virus (HCV) is approximately 3% and one-fifth of all HCV carriers live in the Middle East, where Egypt has the highest global incidence of HCV infection. Quantitative structure-activity relationship (QSAR) models were used in many applications for predicting the potential effects of chemicals on human health and environment. The adaptive neuro-fuzzy inference system (ANFIS) is one of the most popular regression methods for building a nonlinear QSAR model. However, the quality of ANFIS is influenced by the size of the descriptors, so descriptor selection methods have been proposed, although these methods are affected by slow convergence and high time complexity. To avoid these limitations, the antlion optimizer was used to select relevant descriptors, before constructing a nonlinear QSAR model based on the PIC50 and these descriptors using ANFIS. In our experiments, 1029 compounds were used, which comprised 579 HCVNS5B inhibitors (PIC50 < ~14) and 450 non-HCVNS5B inhibitors (PIC50 > ~14). The experimental results showed that the proposed QSAR model obtained acceptable accuracy according to different measures, where R2 was 0.952 and 0.923 for the training and testing sets, respectively, using cross-validation, while R2 LOO
was 0.8822 using leave-one-out (LOO).

abd elaziz, M., and A. E. Hassanien, "Modified cuckoo search algorithm with rough sets for feature selection,", Neural Computing and Applications,, pp. pp.1-10, 2017, 2017. AbstractWebsite

In this paper, a modified cuckoo search algorithm with rough sets is presented to deal with high dimensionality data through feature selection. The modified cuckoo search algorithm imitates the obligate brood parasitic behavior of some cuckoo species in combination with the Lévy flight behavior of some birds. The modified cuckoo search uses the rough sets theory to build the fitness function that takes the number of features in reduct set and the classification quality into account. The proposed algorithm is tested and validated benchmark on several benchmark datasets drawn from the UCI repository and using different evaluation criteria as well as a further analysis is carried out by means of the Analysis of Variance test. In addition, the proposed algorithm is experimentally compared with the existing algorithms on discrete datasets. Finally, two learning algorithms, namely K-nearest neighbors and support vector machines are used to evaluate the performance of the proposed approach. The results show that the proposed algorithm can significantly improve the classification performance.

El-Sehiemy, R. A., Mostafa Abdelkhalik El-hosseini, and A. E. Hassanien, "Multiobjective real-coded genetic algorithm for economic/environmental dispatch problem", Studies in Informatics and Control, vol. 22, no. 2, pp. 113–122, 2013. Abstract
n/a
El-Sehiemy, R. A., Mostafa Abdelkhalik El-hosseini, and A. E. Hassanien, "Multiobjective real-coded genetic algorithm for economic/environmental dispatch problem", Studies in Informatics and Control, vol. 22, no. 2, pp. 113–122, 2013. Abstract
n/a
El-Sehiemy, R. A., Mostafa Abdelkhalik El-hosseini, and A. E. Hassanien, "Volume 22• Issue 2• 2013", Studies in Informatics and Control-ICI Bucharest, 2013. Abstract
n/a
El-Said, S. A., H. M. A. Atta, and A. E. Hassanien, "Interactive soft tissue modelling for virtual reality surgery simulation and planning", International Journal of Computer Aided Engineering and Technology, vol. 9, no. 1: Inderscience Publishers (IEL), pp. 38–61, 2017. Abstract
n/a
El-Said, S. A., H. M. A. Atta, and A. E. Hassanien, " Interactive soft tissue modelling for virtual reality surgery simulation and planning,", Int. J. Computer Aided Engineering and Technology, Inderscience, , vol. 9, issue 1, pp. pp. 38-61, 2017. AbstractWebsite

While most existing virtual reality-based surgical simulators in the literature use linear deformation models, soft-tissues exhibit geometric and material nonlinearities that should be taken into account for realistic modelling of the deformations. In this paper, an interactive soft tissue model (ISTM) which enables flexible, accurate and robust simulation of surgical interventions on virtual patients is proposed. In ISTM, simulating the tool-tissue interactions using nonlinear dynamic analysis is formulated within a total Lagrangian framework, and the energy function is modified by adding a term in order to achieve material incompressibility. The simulation results show that ISTM increases the stability and eliminates integration errors in the dynamic solution, decreases calculation costs by a factor of 5-7, and leads to very stable and sufficiently accurate results. From the simulation results it can be concluded that the proposed model can successfully create acceptable soft tissue models and generate realistically visual effects of surgical simulation.

Tourism