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

This research takes up address the practical side by taking case studies for construction projects that include the various Iraqi governorates, as it includes conducting a field survey to identify the impact of parametric costs on construction projects and compare them with what was reached during the analysis and the extent of their validity and accuracy, as well as adopting the approach of personal interviews to know the reality of the state of construction projects. The results showed, after comparing field data and its measurement in construction projects for the sectors (public and private), the correlation between the expected and actual cost change was (97.8%), and this means that the data can be adopted in the re

The precise classification of DNA sequences is pivotal in genomics, holding significant implications for personalized medicine. The stakes are particularly high when classifying key genetic markers such as BRAC, related to breast cancer susceptibility; BRAF, associated with various malignancies; and KRAS, a recognized oncogene. Conventional machine learning techniques often necessitate intricate feature engineering and may not capture the full spectrum of sequence dependencies. To ameliorate these limitations, this study employs an adapted UNet architecture, originally designed for biomedical image segmentation, to classify DNA sequences.The attention mechanism was also tested LONG WITH u-Net architecture to precisely classify DNA sequences

<p><span>This research deals with the feasibility of a mobile robot to navigate and discover its location at unknown environments, and then constructing maps of these navigated environments for future usage. In this work, we proposed a modified Extended Kalman Filter- Simultaneous Localization and Mapping (EKF-SLAM) technique which was implemented for different unknown environments containing a different number of landmarks. Then, the detectable landmarks will play an important role in controlling the overall navigation process and EKF-SLAM technique’s performance. MATLAB simulation results of the EKF-SLAM technique come with better performance as compared with an odometry approach performance in terms of measuring the

An encryption system needs unpredictability and randomness property to maintain information security during transmission and storage. Although chaotic maps have this property, they have limitations such as low Lyapunov exponents, low sensitivity and limited chaotic regions. The paper presents a new improved skewed tent map to address these problems. The improved skew tent map (ISTM) increases the sensitivity to initial conditions and control parameters. It has uniform distribution of output sequences. The programs for ISTM chaotic behavior were implemented in MATLAB R2023b. The novel ISTM produces a binary sequence, with high degree of complexity and good randomness properties. The performance of the ISTM generator shows effective s