ORCID Profile
0000-0001-7751-6679
Current Organisation
Hashemite University
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Publisher: IEEE
Date: 04-2014
Publisher: Inderscience Publishers
Date: 2014
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: Association of Computer, Communication and Education for National Triumph Social and Welfare Society (ACCENTS)
Date: 30-11-2018
Publisher: Global Vision Press
Date: 30-04-2015
Publisher: Inderscience Publishers
Date: 2013
Publisher: MDPI AG
Date: 10-12-2019
DOI: 10.3390/INFO10120391
Abstract: The main aim of this paper is to identify critical success factors (CSFs) and investigate whether they are the same or not across different project organization structures. The organization structures under the study are: functional, project, and matrix. The study is based on a survey that was conducted on a large number of software projects in Jordan. To rank success factors (SFs) and identify critical ones, we use the importance index of SFs, which is calculated based on the likelihood and impact across different structures. For deeper analysis, we carry out statistical experiments with an ANOVA test and Spearman’s rank correlation test. Analysis results of an ANOVA test partially indicates that the values of the SF importance index are slightly different across the three organization structures. Moreover, the Spearman’s rank correlation test results show a high degree of correlation of the SF importance index between the function and project organization structures and a low degree of correlation between the function and matrix organization structures.
Publisher: IEEE
Date: 12-2008
Publisher: Informa UK Limited
Date: 17-09-2019
Publisher: Institute of Advanced Engineering and Science
Date: 08-2023
DOI: 10.11591/IJECE.V13I4.PP4441-4451
Abstract: span lang="EN-US" Predicting the reading difficulty level of English texts is a critical process for second language education and assessment. Reading difficulty level is concerned with the problem of matching a reader’s proficiency and the appropriate text. The reading difficulty level or readability assessment is the process for predicting the reading grade level required from an input text or document, which corresponds to the reader and to the materials. Students in Jordan at their academic levels find obstacles in finding relevant readable data for any subject at their levels. This paper is intended to introduce a model that foretells the reading difficulty level of a given text in terms of a student's ability to read and understand English as a non-native English speaker in Jordanian schools. In this paper, Jordanian students were classified into four categories according to their knowledge of English. The prediction of the reading difficulty level is achieved by using a modern statistical model that is situated on the Bayes model. The model compares the given text with some standard predefined text that strongly reflects the ability to read and understand English text. The accuracy of the proposed model was tested using the hold-out method. The overall prediction accuracy was 75.9%. /span
Publisher: ACM
Date: 23-08-2019
Publisher: IEEE
Date: 04-2016
Publisher: Inderscience Publishers
Date: 2018
Publisher: Inderscience Publishers
Date: 2020
Publisher: Deanship of Scientific Research
Date: 2020
Publisher: Inderscience Publishers
Date: 2020
Publisher: Elsevier BV
Date: 09-2018
Publisher: IGI Global
Date: 10-2014
DOI: 10.4018/IJITWE.2014100104
Abstract: In this paper, the authors present a robust three-dimensional fingerprint algorithm for verification, indexing, and identification. The core idea behind our technique is to apply the eigen-decomposition to the mesh Laplacian matrix, and then compute minimum spanning trees (MST) of several concentrations of the mesh shape structure. The fixed size hash vector of a 3D mesh is defined in terms of the MST values and number of the initial patches. The extensive experimental results on several 3D meshes prove the uniqueness of the extracted hash vectors and the robustness of the proposed technique against the most common attacks including distortion-less attacks, compression, noise, smoothing, scaling, rotation as well as mixtures of these attacks.
Publisher: IEEE
Date: 10-2008
Publisher: Springer Science and Business Media LLC
Date: 26-03-2011
Publisher: Springer International Publishing
Date: 03-11-2015
Publisher: IEEE
Date: 2006
Publisher: Springer Berlin Heidelberg
Date: 2005
DOI: 10.1007/11552413_170
Publisher: IEEE
Date: 2008
Publisher: SAGE Publications
Date: 10-2016
Abstract: Several routing algorithms have been proposed for efficient routing in mobile ad hoc networks, most of them consider mobile nodes embedded in two-dimensional environments. However, in reality, these networks are embedded in three-dimensional environments. Usually, two-dimensional routing algorithms have several assumptions that are not valid for three-dimensional spaces. In this article, we propose four different randomized geographic-based routing algorithms that have the following properties: (1) nearly guaranteed delivery rate, by using randomize route to overcome local minimum problems (2) low overhead, by extracting a virtual backbone of the network and then conducting the routing algorithms over the extracted backbone to decrease the search space (3) low path dilation, by hybridizing the new algorithms with progress-based routing which have very low path dilation and (4) works in three-dimensional environment. The first algorithm 3DRanDom chooses the next neighbor randomly from a dominating set of the network (extracted locally). The second algorithm 3DRanDomProb extracts a dominating set and sends to one of the resulted neighbors randomly with more probability for the nodes closer to the destination. The third algorithm G_3DRanDomProb tries to progress as much as possible to the destination, if the progress is not possible, the algorithm switches to 3DRanDomProb. The fourth algorithm G_3DRanDomProb_G uses progress-based routing as much as possible, then it switches to 3DRanDomProb until it overcomes the local minimum problem and then goes back to progress-based routing. We show experimentally that these hybrid randomized routing algorithms on three-dimensional mobile ad hoc networks can achieve nearly guaranteed delivery while discovering routes significantly closer in length to the shortest path and with low overhead.
No related grants have been discovered for Ahmed Fawzi Otoom.