Omar Adwan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Omar Adwan has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
Ammar Huneiti
The University of Jordan
2 shared publicationsAbeer Abu Zayed
The University of Jordan
1 shared publication- Ahmad Sharieh
Department of Computer Science, King Abdullah II School of Information Technology, The University of Jordan, Amman 11942, Jordan
1 shared publication - Ammar Al-Huneiti
University of Jordan
1 shared publication - Ammar M. Huneiti
Department of Computer Information Systems The University of Jordan Amman Jordan
1 shared publication Anwar M. Bashiti
The University of Jordan, King Abdullah II School for Information Technology, Information Technology Department
1 shared publication
Latest Publications
- Open Access
- 1 December 2023
- Published by Institute of Advanced Engineering and Science in IAES International Journal of Artificial Intelligence (IJ-AI)
- Vol. 12 (4) , 1628-1635
Efficient method for finding nearest neighbors in flocking behaviors using k-dimensional trees
Flocking is a behavior where a group of objects travel, move or collaborate together. By learning more about flocking behavior, we might be able to apply this knowledge in different contexts such as computer graphics, games, and education. A key steppingstone for understanding flocking behavior is to be able to simulate it. However, simulating behaviors of large numbers of objects is highly compute-intensive task because of the n-squared complexity of nearest neighbor for separating n objects. The work in this paper presents an efficient nearest neighbor method based on the k-dimensional trees (KD trees). To evaluate the proposed approach, we apply it using Unity-3D game engine, together with other conventional nearest neighbor methods. The Unity-3D game simulation engine allows users to utilize interaction design tools for programming and animating flocking behaviors. Results showed that the proposed approach outperform other conventional nearest neighbor approaches. The proposed approach can be used to enhance digital games quality and simulations.
- 1 December 2023
- Published by Institute of Advanced Engineering and Science in IAES International Journal of Artificial Intelligence (IJ-AI)
- Vol. 12 (4) , 1628-1635
Open AccessEfficient method for finding nearest neighbors in flocking behaviors using k-dimensional trees
Flocking is a behavior where a group of objects travel, move or collaborate together. By learning more about flocking behavior, we might be able to apply this knowledge in different contexts such as computer graphics, games, and education. A key steppingstone for understanding flocking behavior is to be able to simulate it. However, simulating behaviors of large numbers of objects is highly compute-intensive task because of the n-squared complexity of nearest neighbor for separating n objects. The work in this paper presents an efficient nearest neighbor method based on the k-dimensional trees (KD trees). To evaluate the proposed approach, we apply it using Unity-3D game engine, together with other conventional nearest neighbor methods. The Unity-3D game simulation engine allows users to utilize interaction design tools for programming and animating flocking behaviors. Results showed that the proposed approach outperform other conventional nearest neighbor approaches. The proposed approach can be used to enhance digital games quality and simulations.
- Open Access
- 2 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 6185-6196
Parallel Ant Colony Optimization Algorithm for Finding the Shortest Path for Mountain Climbing
The problem of finding the shortest path between two nodes is a common problem that requires a solution in many applications like games, robotics, and real-life problems. Since its deals with a large number of possibilities. Therefore, parallel algorithms are suitable to solve this optimization problem that has attracted a lot of researchers from both industry and academia to find the optimal path in terms of runtime, speedup, efficiency, and cost compared to sequential algorithms. In mountain climbing, finding the shortest path from the start node under the mountain to reach the destination node is a fundamental operator, and there are some interesting issues to be studied in mountain climbing that cannot be found in a traditional two-dimensional space search. We present a parallel Ant Colony Optimization (ACO) to find the shortest path in the mountain climbing problem using Apache Spark. The proposed algorithm guarantees the security of the selected path by applying some constraints that take into account the secure slop angle for the path. A generated dataset with variable sizes is used to evaluate the proposed algorithm in terms of runtime, speedup, efficiency, and cost. The experimental results show that the parallel ACO algorithm significantly ( p < 0.05) outperformed the best sequential ACO. On the other hand, parallel ACO algorithm compared with one of the most recent research from the literature for finding the best path for mountain climbing problems using parallel A* algorithm with Apache Spark. The parallel ACO algorithm with Spark significantly outperformed the parallel A* algorithm.
- 2 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 6185-6196
Open AccessParallel Ant Colony Optimization Algorithm for Finding the Shortest Path for Mountain Climbing
The problem of finding the shortest path between two nodes is a common problem that requires a solution in many applications like games, robotics, and real-life problems. Since its deals with a large number of possibilities. Therefore, parallel algorithms are suitable to solve this optimization problem that has attracted a lot of researchers from both industry and academia to find the optimal path in terms of runtime, speedup, efficiency, and cost compared to sequential algorithms. In mountain climbing, finding the shortest path from the start node under the mountain to reach the destination node is a fundamental operator, and there are some interesting issues to be studied in mountain climbing that cannot be found in a traditional two-dimensional space search. We present a parallel Ant Colony Optimization (ACO) to find the shortest path in the mountain climbing problem using Apache Spark. The proposed algorithm guarantees the security of the selected path by applying some constraints that take into account the secure slop angle for the path. A generated dataset with variable sizes is used to evaluate the proposed algorithm in terms of runtime, speedup, efficiency, and cost. The experimental results show that the parallel ACO algorithm significantly ( p < 0.05) outperformed the best sequential ACO. On the other hand, parallel ACO algorithm compared with one of the most recent research from the literature for finding the best path for mountain climbing problems using parallel A* algorithm with Apache Spark. The parallel ACO algorithm with Spark significantly outperformed the parallel A* algorithm.
- Open Access
- 14 August 2020
- Published by International Association of Online Engineering (IAOE) in International Journal of Emerging Technologies in Learning (iJET)
- Vol. 15 (15) , 79-93
Twitter Sentiment Analysis Approaches: A Survey
Twitter is one of the most popular microblogging and social networking platforms where massive instant messages (i.e. tweets) are posted every day. Twitter sentiment analysis tackles the problem of analyzing users’ tweets in terms of thoughts, interests and opinions in a variety of contexts and domains. Such analysis can be valuable for several researchers and applications that require understanding people views about a particular topic or event. The study carried out in this paper provides an overview of the algorithms and approaches that have been used for sentiment analysis in twitter. The reviewed articles are categories into four categories based on the approach they use. Furthermore, we discuss directions for future research on how twitter sentiment analysis approaches can utilize theories and technologies from other fields such cognitive science, semantic Web, big data and visualization.
- 14 August 2020
- Published by International Association of Online Engineering (IAOE) in International Journal of Emerging Technologies in Learning (iJET)
- Vol. 15 (15) , 79-93
Open AccessTwitter Sentiment Analysis Approaches: A Survey
Twitter is one of the most popular microblogging and social networking platforms where massive instant messages (i.e. tweets) are posted every day. Twitter sentiment analysis tackles the problem of analyzing users’ tweets in terms of thoughts, interests and opinions in a variety of contexts and domains. Such analysis can be valuable for several researchers and applications that require understanding people views about a particular topic or event. The study carried out in this paper provides an overview of the algorithms and approaches that have been used for sentiment analysis in twitter. The reviewed articles are categories into four categories based on the approach they use. Furthermore, we discuss directions for future research on how twitter sentiment analysis approaches can utilize theories and technologies from other fields such cognitive science, semantic Web, big data and visualization.
- Open Access
- 31 December 2019
- Published by Academy and Industry Research Collaboration Center (AIRCC) in Signal & Image Processing : An International Journal
- Vol. 10 (6) , 1-7
Efficient Method to find Nearest Neighbours in Flocking Behaviours
- 31 December 2019
- Published by Academy and Industry Research Collaboration Center (AIRCC) in Signal & Image Processing : An International Journal
- Vol. 10 (6) , 1-7
Open AccessEfficient Method to find Nearest Neighbours in Flocking Behaviours
- Open Access
- 31 October 2019
- Published by Academy and Industry Research Collaboration Center (AIRCC) in Signal & Image Processing : An International Journal
- Vol. 10 (5) , 29-38
Robust Image Watermarking Method using Wavelet Transform
- 31 October 2019
- Published by Academy and Industry Research Collaboration Center (AIRCC) in Signal & Image Processing : An International Journal
- Vol. 10 (5) , 29-38
Open AccessRobust Image Watermarking Method using Wavelet Transform
- Open Access
- 30 May 2019
- Published by International Association of Online Engineering (IAOE) in International Journal of Emerging Technologies in Learning (iJET)
- Vol. 14 (10) , 217-241
An Investigation of Microsoft Azure and Amazon Web Services from Users’ Perspectives
Cloud computing is one of the paradigms that have undertaken to deliver the utility computing concept. It views computing as a utility similar to water and electricity. We aim in this paper to make an investigation of two highly efficacious Cloud platforms: Microsoft Azure (Azure) and Amazon Web Services (AWS) from users’ perspectives the point of view of users. We highlight and compare in depth the features of Azure and AWS from users’ perspectives. The features which we shall focus on include (1) Pricing, (2) Availability, (3) Confidentiality, (4) Secrecy, (5) Tier Account and (6) Service Level Agreement (SLA). The study shows that Azure is more appropriate when considering Pricing and Availability (Error Rate) while AWS is more appropriate when considering Tier account. Our user survey study and its statistical analysis agreed with the arguments made for each of the six comparisons factors.
- 30 May 2019
- Published by International Association of Online Engineering (IAOE) in International Journal of Emerging Technologies in Learning (iJET)
- Vol. 14 (10) , 217-241
Open AccessAn Investigation of Microsoft Azure and Amazon Web Services from Users’ Perspectives
Cloud computing is one of the paradigms that have undertaken to deliver the utility computing concept. It views computing as a utility similar to water and electricity. We aim in this paper to make an investigation of two highly efficacious Cloud platforms: Microsoft Azure (Azure) and Amazon Web Services (AWS) from users’ perspectives the point of view of users. We highlight and compare in depth the features of Azure and AWS from users’ perspectives. The features which we shall focus on include (1) Pricing, (2) Availability, (3) Confidentiality, (4) Secrecy, (5) Tier Account and (6) Service Level Agreement (SLA). The study shows that Azure is more appropriate when considering Pricing and Availability (Error Rate) while AWS is more appropriate when considering Tier account. Our user survey study and its statistical analysis agreed with the arguments made for each of the six comparisons factors.
- Open Access
- 26 January 2019
- Published by Canadian Center of Science and Education in Modern Applied Science
- Vol. 13 (2) , p258
Extracting Interesting Regions and Trips from Taxi Trajectory Data
The increasing availability of cutting-edge location-acquisition technologies such as GPS devices, has led to the generation of huge datasets of spatial trajectories. These trajectories store important information regarding the movement of people, vehicles, robots, animals, users of social networks, etc. Many research initiatives have applied data mining techniques in order to extract useful knowledge from this data. An important, and yet complicated, pre-processing step in mining patterns from trajectory data, is the identification of the Regions of Interest (RoI) that have been collectively navigated by a set of trajectories. The RoI’s are being manually and subjectively pre-defined by a group of experts as popular regions, regardless of the actual behaviour of the moving objects. This research emphasizes the usefulness of applying an unsupervised machine learning technique, namely Self Organizing Map (SOM), in order to identify the RoI’s associated with a trajectory dataset depending on the moving objects’ behaviour. The research experiments were conducted using 180 thousand of the trajectories generated by 442 taxis running in the city of Porto, in Portugal, and they demonstrate the ability of SOM in identifying the RoI’s and interesting taxi trips within the city.
- 26 January 2019
- Published by Canadian Center of Science and Education in Modern Applied Science
- Vol. 13 (2) , p258
Open AccessExtracting Interesting Regions and Trips from Taxi Trajectory Data
The increasing availability of cutting-edge location-acquisition technologies such as GPS devices, has led to the generation of huge datasets of spatial trajectories. These trajectories store important information regarding the movement of people, vehicles, robots, animals, users of social networks, etc. Many research initiatives have applied data mining techniques in order to extract useful knowledge from this data. An important, and yet complicated, pre-processing step in mining patterns from trajectory data, is the identification of the Regions of Interest (RoI) that have been collectively navigated by a set of trajectories. The RoI’s are being manually and subjectively pre-defined by a group of experts as popular regions, regardless of the actual behaviour of the moving objects. This research emphasizes the usefulness of applying an unsupervised machine learning technique, namely Self Organizing Map (SOM), in order to identify the RoI’s associated with a trajectory dataset depending on the moving objects’ behaviour. The research experiments were conducted using 180 thousand of the trajectories generated by 442 taxis running in the city of Porto, in Portugal, and they demonstrate the ability of SOM in identifying the RoI’s and interesting taxi trips within the city.
- Open Access
- 16 April 2018
- Published by Canadian Center of Science and Education in Modern Applied Science
- Vol. 12 (5) , 22
Policy Based Approach for Information Transfer over Mobile ad hoc Network using Messages Privacy Control
Ad Hoc networks are a set of wireless mobile communication nodes (stations, users) that exchange information between different nodes in a dynamic environment. The mobile infrastructure help to form the dynamic network structure. Nodes communicate and send information between each other and with the centralized access points without interference. Each node acts both as a router to information or as an end user node that receive the sent information. Information dissemination between different nodes may face lake of security due to accidental or unauthorized message forward to illegal third party. This paper proposes a policy based approach for information transfer over Mobile ad hoc network (MANET) using messages privacy control where the creator of the message determines the nodes that should receive the message and deny sending the message to other nodes. Each message is sent in combination with a policy which controls its sending behavior at the receiver side. The policy is applied at the application level. A simulation of the proposed approach has been programmed to perform experimental case studies. The results have proven the efficiency of the proposed approach in securing the privacy of information transfer.
- 16 April 2018
- Published by Canadian Center of Science and Education in Modern Applied Science
- Vol. 12 (5) , 22
Open AccessPolicy Based Approach for Information Transfer over Mobile ad hoc Network using Messages Privacy Control
Ad Hoc networks are a set of wireless mobile communication nodes (stations, users) that exchange information between different nodes in a dynamic environment. The mobile infrastructure help to form the dynamic network structure. Nodes communicate and send information between each other and with the centralized access points without interference. Each node acts both as a router to information or as an end user node that receive the sent information. Information dissemination between different nodes may face lake of security due to accidental or unauthorized message forward to illegal third party. This paper proposes a policy based approach for information transfer over Mobile ad hoc network (MANET) using messages privacy control where the creator of the message determines the nodes that should receive the message and deny sending the message to other nodes. Each message is sent in combination with a policy which controls its sending behavior at the receiver side. The policy is applied at the application level. A simulation of the proposed approach has been programmed to perform experimental case studies. The results have proven the efficiency of the proposed approach in securing the privacy of information transfer.
- 9 January 2017
- Published by SAGE Publications in Journal of Information Science
- Vol. 44 (2) , 230-247
Feature engineering for detecting spammers on Twitter: Modelling and analysis
Twitter is a social networking website that has gained a lot of popularity around the world in the last decade. This popularity made Twitter a common target for spammers and malicious users to spread unwanted advertisements, viruses and phishing attacks. In this article, we review the latest research works to determine the most effective features that were investigated for spam detection in the literature. These features are collected to build a comprehensive data set that can be used to develop more robust and accurate spammer detection models. The new data set is tested using popular classifiers (Naive Bayes, support vector machines, multilayer perceptron neural networks, Decision Trees, Random forests and k-Nearest Neighbour). The prediction performance of these classifiers is evaluated and compared based on different evaluation metrics. Moreover, a further analysis is carried out to identify the features that have higher impact on the accuracy of spam detection. Three different techniques are used and compared for this analysis: change of mean square error (CoM), information gain (IG) and Relief-F method. Top five features identified by each technique are used again to build the detection models. Experimental results show that most of the developed classifiers obtained high evaluation results based on the comprehensive data set constructed in this work. Experiments also reveal the important role of some features like the reputation of the account, average length of the tweet, average mention per tweet, age of the account, and the average time between posts in the process of identifying spammers in the social network.
- 9 January 2017
- Published by SAGE Publications in Journal of Information Science
- Vol. 44 (2) , 230-247
Feature engineering for detecting spammers on Twitter: Modelling and analysis
Twitter is a social networking website that has gained a lot of popularity around the world in the last decade. This popularity made Twitter a common target for spammers and malicious users to spread unwanted advertisements, viruses and phishing attacks. In this article, we review the latest research works to determine the most effective features that were investigated for spam detection in the literature. These features are collected to build a comprehensive data set that can be used to develop more robust and accurate spammer detection models. The new data set is tested using popular classifiers (Naive Bayes, support vector machines, multilayer perceptron neural networks, Decision Trees, Random forests and k-Nearest Neighbour). The prediction performance of these classifiers is evaluated and compared based on different evaluation metrics. Moreover, a further analysis is carried out to identify the features that have higher impact on the accuracy of spam detection. Three different techniques are used and compared for this analysis: change of mean square error (CoM), information gain (IG) and Relief-F method. Top five features identified by each technique are used again to build the detection models. Experimental results show that most of the developed classifiers obtained high evaluation results based on the comprehensive data set constructed in this work. Experiments also reveal the important role of some features like the reputation of the account, average length of the tweet, average mention per tweet, age of the account, and the average time between posts in the process of identifying spammers in the social network.
- Open Access
- 1 January 2017
- Published by The Science and Information Organization in International Journal of Advanced Computer Science and Applications
- Vol. 8 (12)
A New Parallel Matrix Multiplication Algorithm on Tree-Hypercube Network using Iman1 Supercomputer
- 1 January 2017
- Published by The Science and Information Organization in International Journal of Advanced Computer Science and Applications
- Vol. 8 (12)
Open AccessA New Parallel Matrix Multiplication Algorithm on Tree-Hypercube Network using Iman1 Supercomputer