Mariam Abd Alfattah Itriq

University of Jordan | UJ · BIT

SMS (Short Message Service) is a mean of communication between people which can either be spam or ham. SMS spam is a major concern since it is annoying and many people do not like to receive it. In this paper, deep learning and random forest machine learning algorithms are used to determine the most important features that can be used as input to c...

String matching is a fundamental problem in computer science and has been extensively studied. Searching for all occurrences of a pattern in a text is a fundamental problem in many applications, like natural language processing, information retrieval, pattern recognition and computational biology. Many string matching algorithms are existing and wo...

Pattern matching is a very important topic in computer science. It has been used in various applications such as information retrieval, virus scanning, DNA sequence analysis, data mining, machine learning, network security and pattern recognition. This paper has presented a new pattern matching algorithm—Enhanced ERS-A, which is an improvement over...

This paper presents an efficient pattern matching algorithm (FSW). FSW improves the searching process for a pattern in a text. It scans the text with the help of four sliding windows. The windows are equal to the length of the pattern, allowing multiple alignments in the searching process. The text is divided into two parts; each part is scanned fr...

Pattern matching is a very important topic in computer science. It has been used in various applications such as information retrieval, virus scanning, DNA sequence analysis, data mining, machine learning, network security and pattern recognition. This paper has presented a new pattern matching algorithm—Enhanced ERS-A, which is an improvement over...

The efficiency and performance of Distributed Database Management Systems (DDBMS) is mainly measured by its proper design and by network communication cost between sites. Fragmentation and distribution of data are the major design issues of the DDBMS. In this paper, we propose new approach that integrates both fragmentation and data allocation in o...

Pattern matching algorithms have many applications that cover a wide range including information retrieval, text processing, DNA sequence analysis and pattern recognition. In this paper, we propose a new algorithm ERS-A, that made enhancements on both two sliding windows (TSW) and Fast Pattern Matching (RS-A) algorithms. In ERS-A and TSW algorithms...

Pattern matching algorithms have many applications that cover a wide range including information retrieval, text processing, DNA sequence analysis and pattern recognition. In this paper, we propose a new algorithm ERS-A, that made enhancements on both two sliding windows (TSW) and Fast Pattern Matching (RS-A) algorithms. In ERS-A and TSW algorithms...

Existing mutual exclusion algorithms for distributed systems are not well suitable for mobile system, because of several limitations: small memory, a relatively slow processor, low power batteries, and communicate over low bandwidth wireless communication links. In this paper, we adapted the DRS mutual exclusion algorithm applying it on the infrast...

Existing mutual exclusion algorithms for distributed systems are not well suitable for mobile system, because of several limitations: small memory, a relatively slow processor, low power batteries, and communicate over low bandwidth wireless communication links. In this paper, we adapted the DRS mutual exclusion algorithm applying it on the infrast...

Abstract: In this paper, we propose a string matching algorithm - Enhanced Two Sliding Windows (ETSW), which made an improvement on the Two Sliding Windows algorithm (TSW). The TSW algorithm scans the text from both sides simultaneously using two sliding windows. The ETSW algorithm enhances the TSW’s process by utilizing the idea of the two slid...

In this paper, we propose a string matching algorithm -Enhanced Two Sliding Windows (ETSW), which made an improvement on the Two Sliding Windows algorithm (TSW). The TSW algorithm scans the text from both sides simultaneously using two sliding windows. The ETSW algorithm enhances the TSW's process by utilizing the idea of the two sliding windows an...

A mobile host has small memory, relatively slow processor, low power batteries, andcommunicate over low bandwidth wireless communication links. Existing mutual exclusion algorithmsfor distributed systems are not enough for mobile systems because of several limitations. In this study, amutual exclusion algorithm that is more suitable for mobile comp...

In this research, we propose a fast pattern matching algorithm: The Two Sliding Windows (TSW) algorithm. The algorithm makes use of two sliding windows, each window has a size that is equal to the pattern length. Both windows slide in parallel over the text until the first occurrence of the pattern is found or until both windows reach the middle of...