Skip Navigation Links Home : MemberDetails
Name : Shakir Mahmood AlFarraji

Academic Rank: Associate Professor

Administrative Position : Head of Department

Office 7406       Ext No 7200

Email :

Specialization: Computer Science

Graduate Of: University of Technology

Download CV






    Oklahome State University
    United States of America
    University of Technology

  • Journal Paper

      Shakir M. Hussain, a, " Key Based Random Permutation (KBRP) " , "Journal of Computer Science",Vol.2,No.5, Science Publivation, NY, USA, 06/01/2006 Abstract:
      This study introduces a method for generating a particular permutation P of a given size of N! permutations from a given key. This method computes a unique permutation for size since it takes the same key; therefore, the same permutation can be computed each the same key and size are applied. The name of random permutation comes from the the probability of getting this permutation is 1 out of N! possible permutations. Beside permutation can not be guessed because of its generating method that is depending on a given key and size. Download

      Hussain Al-Bahadili,, " An adaptive character wordlength algorithm for data compression " , "An International Journal Computer & Mathematics with application",Vol.55,No.6, Elsevier Ltd., USA, 03/01/2008 Abstract:
      Hussain Al-Bahadili and Shakir M. This paper presents a new and efficient data compression algorithm, namely, the adaptive character wordlength (ACW) algorithm, which can be used as complementary algorithm to statistical compression techniques. In such techniques, the characters in the source file are converted to a binary code, where the most common characters in the file have the shortest binary codes, and the least common have the longest; the binary codes are generated based on the estimated probability of the character within the file. Then, the binary coded file is compressed using 8 bits character wordlength. In this new algorithm, an optimum character wordlength, b, is calculated, where b>8, so that the compression ratio is increased by a factor of b/8. In order to validate this algorithm, it is used as a complement algorithm to Huffman code to compress a source file having 10 characters with different probabilities, and these characters are randomly distributed within the source file. The results obtained and the factors that affect the optimum value of b are discussed, and, finally, conclusions are presented. Download

      Shakir M. Hussain, a, " A Password-Based Key Derivation Algorithm Using the KBRP Method " , "American Journal of Applied Sciences",Vol.5,No.7, Science Publications, NY, USA, 02/07/2008 Abstract:
      This study presents a new efficient password-based strong key derivation algorithm using the key based random permutation the KBRP method. The algorithm consists of five steps, the first three steps are similar to those formed the KBRP method. The last two steps are added to derive a key and to ensure that the derived key has all the characteristics of a strong key. In order to demonstrate the efficiency of the algorithm, a number of keys are derived using various passwords of different content and length. The features of the derived keys show a good agreement with all characteristics of strong keys. In addition, they are compared with features of keys generated using the WLAN strong key generator v2.2 by Warewolf Labs. Download

      Shakir M. Hussain, a, " A Non-Exchanged Password Scheme for Password-Based Authentication in Client-Server Systems " , "American Journal of Applied Sciences",Vol.5,No.12, Science Publications, NY, USA, 12/01/2008 Abstract:
      The password-based authentication is widely used in client-server systems. This research presents a non-exchanged password scheme for password-based authentication. This constructs a Digital Signature (DS) that is derived from the user password. The digital is then exchanged instead of the password itself for the purpose of authentication. Therefore, we refer to it as a Password-Based Digital Signature (PBDS) scheme. It consists of three phases, in the first phase a password-based Permutation (P) is computed using the Key Random Permutation (KBRP) method. The second phase utilizes P to derive a Key (K) Password-Based Key Derivation (PBKD) algorithm. The third phase uses P and K to gene the exchanged DS. The scheme has a number of features that shows its advantages over password authentication approaches. Download

      Shakir M. Hussain, G, " Economic Efficiency Analysis for Information Technology in Developing Countries " , "American Journal of Applied Sciences ",Vol.5,No.10, Science Publications, NY, USA, 01/10/2009 Abstract:
      The introduction of Information Technology (IT) to government institutions in developing countries bears a great deal of risk of failure. The lack of qualified personnel, lack of financial support and the lack of planning and proper justification are just few of the causes of projects failure. Study presented in this study focused on the justification issue of IT projects through the application of Cost Benefit Analysis (CBA) as part of a comprehensive Economic Efficiency Analysis (EEA) of IT Projects, thus providing management with a decision making tool which highlights existing and future problems and reduces the risk of failure. Approach: Cost-Benefit Analysis (CBA) based on Economic Efficiency Analysis (EEA) was performed on selected IT projects from ministries and key institutions in the government of Jordan using a well established approach employed by the Federal Government of Germany (KBSt approach). The approach was then modified and refined to suit the needs of developing countries so that it captured all the relevant elements of cost and benefits both quantitatively and qualitatively and includes a set of guidelines for data collection strategy. Results: When IT projects were evaluated using CBA, most cases yielded negative Net Present Value (NPV), even though, some cases showed some reduction in operation cost starting from the third year of project life. However, when the CBA was applied as a part of a comprehensive EEA by introducing qualitative aspects and urgency criteria, proper justification for new projects became feasible. Conclusion: The modified EEA represented a systematic approach which was well suited for the government of Jordan as a developing country. This approach was capable of dealing with the justification issue, evaluation of existing systems and the urgency of replacing legacy systems. This study explored many of the challenges and inherited problems existing in the public sectors of developing countries which can not simply be resolved by the introduction of IT projects, but rather require more comprehensive solutions. Download

      Shakir M. Hussain, H, " Performance Evaluation of the TSS Node Authentication Scheme in Noisy MANETs " , "International Journal of Network Security",Vol.12,No.3, , , 01/05/2011 Abstract:
      This paper presents a description and performance evaluation of the threshold secret sharing (TSS) node authentication scheme for self-securing ad hoc wireless networks suffering from high packetloss due to presence of noise and node mobility, which are referred to as noisy MANETs. In order to evaluate the performance of the TSS scheme in noisy MANETs, a number of simulations were carried-out to investigate the variation of the authentication success ratio against the threshold secret share for various node densities, node speeds, and noise-levels. Simulation results demonstrated that, for certain threshold secret share, presence of noise inflicts significant reduction in the authentication success ratio, while node mobility inflicts no or insignificant effect. The outcomes of these simulations are so important to facilitate efficient network management. Download

      Hussein Al-Bahadili,, " A Bit-Level Text Compression Scheme Based on ACW Algorithm " , "International Journal of AUTOMATION AND COMPUTING (IJAC) ",Vol.7,No.1, Springer, USA, 01/02/2010 Abstract:
      This paper presents a description and performance evaluation of a new bit-level, lossless, adaptive, and asymmetric data compression scheme that is based on the adaptive character wordlength (ACW(n)) algorithm. The proposed scheme enhances the compression ratio of the ACW(n) algorithm by dividing the binary sequence into a number of subsequences (s), each of them satisfying the condition that the number of decimal values (d) of the n-bit length characters is equal to or less than 256. Therefore, the new scheme is referred to as ACW(n,s), where n is the adaptive character wordlength and s is the number of subsequences. The new scheme was used to compress a number of text files from standard corpora. The obtained results demonstrate that the ACW(n,s) scheme achieves higher compression ratio than many widely used compression algorithms and it achieves a competitive performance compared to state-of-the-art compression tools. Download

      Ghassan F. Issa, Sha, " A Framework for Building an Interactive Satellite TV Based M-Learning Environment " , "International Journal of Interactive Mobile Technologies.",Vol.4,No.3, , , 01/07/2010 Abstract:
      This paper presents a description of an interactive satellite TV based mobile learning (STV-ML) framework, in which a satellite TV station is used as an integral part of a comprehensive interactive mobile learning (MLearning) environment. The proposed framework assists in building a reliable, efficient, and cost-effective environment to meet the growing demands of M-Learning all over the world, especially in developing countries. It utilizes recent advances in satellite reception, broadcasting technologies, and interactive TV to facilitate the delivery of gigantic learning materials. This paper also proposed a simple and flexible three-phase implementation methodology which includes construction of earth station, expansion of broadcasting channels, and developing true user interactivity. The proposed framework and implementation methodology ensure the construction of a true, reliable, and cost effective M-Learning system that can be used efficiently and effectively by a wide range of users and educational institutions to deliver ubiquitous learning. Download

      Shakir M. Hussain, G, " Unified M-Learning Model through Interactive Education Satellite: A Proposal for an Arab Homeland Education Satellite " , "International Journal of Interactive Mobile Technologies ",Vol.5,No.2, iJIM, , 04/01/2011 Abstract:
      In this paper, we propose a unified and interactive mobile learning (M-Learning) model to help with expanding and spreading education in the Arab Homeland countries. The model utilizes a new competitive spot beam satellite communication technology, which enables efficient channel allocation, where communication channels can be allocated to specific and precise areas. The proposed model is referred to as the interactive Arab education satellite (IAESat).The communication satellite can efficiently and effectively cover the entire Arab Homeland and reaches a wide area and mobile users that cannot be reached otherwise. The model implements existing interactivity components to enhance the learning process and meet international standards in education. Download

      Shakir M. Hussain, H, " INVESTIGATING THE EFFECT OF NOISE-LEVEL ON PROBABILISTIC BROADCAST IN NOISY MANETS " , "International Journal of Computer Networks & Communications",Vol.3,No.4, AIRCCSE, , 07/30/2011 Abstract:
      Wireless communication channels in mobile ad hoc network (MANETs) suffer from high packet-loss due to presence of noise. This paper presents a detail description of a simulation model that can be used to evaluate the performance of probabilistic broadcast for flooding in noisy environment. In this model, the noise-level is represented by a generic name, probability of reception (pc) (0_ pc _1), where pc=1 for noiseless and pc<1 for noisy. The effect of noise is determined randomly by generating a random number x (0_x<1); if x_pc means the packet is successfully delivered to the receiving node, otherwise, unsuccessful delivery occurs. The proposed model is implemented on a MANET simulator, namely, MANSim. In order to investigate the effect of noise on the performance of probabilistic broadcast in noisy MANETs, four scenarios were simulated. The main conclusions of these scenarios are: The performance of probabilistic broadcast decreases with decreasing pc. The percentage relative change in performance decreases with increasing nodes retransmission probability, number of nodes, and nodes radio transmission range. The various nodes speed has insignificant effect on the performance. Download

      Shakir M. Hussain, G, " DEVELOPMENT AND PERFORMANCE EVALUATION OF A LAN-BASED EDGE-DETECTION TOOL " , "International Journal on Soft Computing",Vol.3,No.1, IJSC, India, 02/29/2012 Abstract:
      This paper presents a description and performance evaluation of an efficient and reliable edge-detection tool that utilize the growing computational power of local area networks (LANs). It is therefore referred to as LAN-based edge detection (LANED) tool. The processor-farm methodology is used in porting the sequential edge-detection calculations to run efficiently on the LAN. In this methodology, each computer on the LAN executes the same program independently from other computers, each operating on different part of the total data. It requires no data communication other than that involves in forwarding input data/results between the LAN computers. LANED uses the Java parallel virtual machine (JPVM) data communication library to exchange data between computers. For equivalent calculations, the computation times on a single computer and a LAN of various number of computers, are estimated, and the resulting speedup and parallelization efficiency, are computed. The estimated results demonstrated that parallelization efficiencies achieved vary between 87% to 60% when the number of computers on the LAN varies between 2 to 5 computers connected through 10/100 Mbps Ethernet switch. Download

      Ghassan Issa, Shakir, " Competition-Based Learning: A Model for the Integration of Competitions with Project-Based Learning using Open Source LMS " , "International Journal of Information and Communication Technology Education (IJICTE)",Vol.10,No.37, IGI Publishing, , 04/06/2013 Abstract:
      In an effort to enhance the learning process in higher education, a new model for Competition-Based Learning (CBL) is presented. The new model utilizes two well-known learning models, namely, the Project-Based Learning (PBL) and competitions. The new model is also applied in a networked environment with emphasis on collective learning as well as collective outcomes. The new model, which is referred to as CBL, provides educators with an alternative solution to overcome many of student's deficiencies associated with traditional learning practices; such as lack of motivation, lack of self esteem, insufficient practical and real-life experience, and inadequate team work practices. The new CBL model makes a clear distinction between PBL and competitions and CBL. It avoids the disadvantages of competitions, while at the same time gaining from the many benefits of PBL. Identification features of CBL, components of CBL, as well as advantages are presented. An open source Learning Management System (LMS), namely, Moodle is used for the implementation of a networked environment to support CBL. Keywords: Project-Based Learning; Competitions; Competition-Based Learning; Networked Learning; Collective learning; Constructivism; Group Learning; Open Source Learning Management System.

  • Conference paper

      Shakir M. Hussain, a, " The Use of User Response Time for Remote Password Authentication " , "CSIT 2006",Vol.,No., Applied Science private University, Amman, Jordan, 05/04/2006 Abstract:
      This paper presents a new password authentication method, which is, in addition to depending on matching each password element, it also depends on the time that a user takes (response time) for entering each password element. The t-distribution test is used to examine the input time of each password element with the time limits, which are stored in the system database, for that particular password element. The test is carried out on each password element and the password is accepted when the test is passed for all the password elements or be set to accept some failure. Download

      Shakir M. Hussainand, " DES Enhancement Using Key-Based Randomized Initial Permutation " , "SAM2008",Vol.,No., CSREA Press, Las Vegas, Nevada, USA, 07/14/2008

      Shakir M. Hussain, H, " Threshold Secret Sharing Authentication Scheme in Noisy Mobile Ad Hoc Networks " , "ICWN2009",Vol.,No., CSREA Press, Las Vegas, Nevada, USA, 07/13/2009

      Hussein Al-Bahadili,, " A Web Search Engine Model Based on Index-Query Bit-Level Compression " , "ISWSA '10: Proceedings of the 1st International Conference on Intelligent Semantic Web-Services and Applications ",Vol.,No., ACM, Amman, Jordan, 01/06/2010 Abstract:
      In this paper, we propose a new web search engine model based on index-query bit-level compression. The model incorporates two bit-level compression layers both implemented at the back-end processor (server) side, one layer resides after the indexer acting as a second compression layer to generate a double compressed index, and the second layer be located after the query parser for query compression to enable bit-level compressed index-query search. This contributes to reducing the size of the index file as well as reducing disk I/O overheads, and consequently yielding higher retrieval rate and performance. The data compression scheme used in this model is the adaptive character wordlength (ACW(n,s)) scheme, which is an asymmetric, lossless, bit-level scheme that permits compressed index-query search. Results investigating the performance of the ACW(n,s) scheme is presented and discussed Download
  • Event Calendar
    <October 2016>