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

Sustainable plant protection and the economy of plant crops worldwide depend heavily on the health of agriculture. In the modern world, one of the main factors influencing economic growth is the quality of agricultural produce. The need for future crop protection and production is growing as disease-affected plants have caused considerable agricultural losses in several crop categories. The crop yield must be increased while preserving food quality and security and having the most negligible negative environmental impact. To overcome these obstacles, early discovery of satisfactory plants is critical. The use of Advances in Intelligent Systems and information computer science effectively helps find more efficient and low-cost solutions. Thi

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

The research seeks to examine the ability of fifth preparatory students in solving a mathematical problem in relation to system thinking. To this end, the researcher chose (140) fifth preparatory students from four-different secondary schools in Kirkuk city for the academic year (2016-2017). Two tests were adopted to collect study data: a test of (5) items about skills in solving math problem designed by (Al-raihan, 2006); and a test of system thinking skills designed by the researcher himself consisted of (14) items. It was divided into four skills (analyzing the main system to subsystems, eliminating all inner gaps of system, identifying the inner connection of system, and reorganizing the system). The findings indicated a good ability

        In this paper, double Sumudu and double Elzaki transforms methods are used to compute the numerical solutions for some types of fractional order partial differential equations with constant coefficients and explaining the efficiently of the method by illustrating some numerical examples that are computed by using  Mathcad 15.and graphic in Matlab R2015a.

This study proposes a hybrid predictive maintenance framework that integrates the Kolmogorov-Arnold Network (KAN) with Short-Time Fourier Transform (STFT) for intelligent fault diagnosis in industrial rotating machinery. The method is designed to address challenges posed by non-linear and non-stationary vibration signals under varying operational conditions. Experimental validation using the FALEX multispecimen test bench demonstrated a high classification accuracy of 97.5%, outperforming traditional models such as SVM, Random Forest, and XGBoost. The approach maintained robust performance across dynamic load scenarios and noisy environments, with precision and recall exceeding 95%. Key contributions include a hardware-accelerated K