String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed

The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul

In many applications such as production, planning, the decision maker is important in optimizing an objective function that has fuzzy ratio two functions which can be handed using fuzzy fractional programming problem technique. A special class of optimization technique named fuzzy fractional programming problem is considered in this work when the coefficients of objective function are fuzzy. New ranking function is proposed and used to convert the data of the fuzzy fractional programming problem from fuzzy number to crisp number so that the shortcoming when treating the original fuzzy problem can be avoided. Here a novel ranking function approach of ordinary fuzzy numbers is adopted for ranking of triangular fuzzy numbers with simpler an

High vehicular mobility causes frequent changes in the density of vehicles, discontinuity in inter-vehicle communication, and constraints for routing protocols in vehicular ad hoc networks (VANETs). The routing must avoid forwarding packets through segments with low network density and high scale of network disconnections that may result in packet loss, delays, and increased communication overhead in route recovery. Therefore, both traffic and segment status must be considered. This paper presents real-time intersection-based segment aware routing (RTISAR), an intersection-based segment aware algorithm for geographic routing in VANETs. This routing algorithm provides an optimal route for forwarding the data packets toward their destination

In this work, the relationship between the ionospheric parameters (Maximum Usable Frequency (MUF), Lowest Usable Frequency (LUF) and Optimum working Frequency (OWF)) has been studied for the ionosphere layer over the Iraqi zone. The capital Baghdad (44.42oE, 33.32oN) has been selected to represent the transmitter station and many other cities that spread over Iraqi region have represented as receiver stations. The REC533 communication model considered as one of the modern radio broadcasting version of ITU has been used to calculate the LUF parameter, while the MUF and OWF ionospheric parameters have been generated using ASAPS international communication model which represents one of the most advanced  and accurate HF sky wave prop

In this work, the relationship between the ionospheric parameters (Maximum Usable Frequency (MUF), Lowest Usable Frequency (LUF) and Optimum working Frequency (OWF)) has been studied for the ionosphere layer over the Iraqi zone. The capital Baghdad (44.42^oE, 33.32^oN) has been selected to represent the transmitter station and many other cities that spread over Iraqi region have represented as receiver stations. The REC533 communication model considered as one of the modern radio broadcasting version of ITU has been used to calculate the LUF parameter, while the MUF and OWF ionospheric parameters have been generated using ASAPS international communication model which represents one of the most advanced  and