The research aims to identify: 1-Designing a test to measure the movement compatibility of the eye and the leg for the students of the Faculty of Physical Education and Sports Sciences, Samarra University. 2-Codification (setting scores and standard levels) for the results of the motor compatibility test for the eye and the leg for students of the Faculty of Physical Education and Sports Sciences, Samarra University. The researchers reached the some following conclusions: 1-A test to measure the movement compatibility of the eye and the leg for the students of the Faculty of Physical Education and Sports Sciences. 2-There is a discrepancy in the standard levels of the research sample.

We propose a new method for detecting the abnormality in cerebral tissues present within Magnetic Resonance Images (MRI). Present classifier is comprised of cerebral tissue extraction, image division into angular and distance span vectors, acquirement of four features for each portion and classification to ascertain the abnormality location. The threshold value and region of interest are discerned using operator input and Otsu algorithm. Novel brain slices image division is introduced via angular and distance span vectors of sizes 24˚ with 15 pixels. Rotation invariance of the angular span vector is determined. An automatic image categorization into normal and abnormal brain tissues is performed using Support Vector Machine (SVM). St

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

We define L-contraction mapping in the setting of D-metric spaces analogous to L-contraction mappings [1] in complete metric spaces. Also, give a definition for general D- matric spaces.And then prove the existence of fixed point for more general class of mappings in generalized D-metric spaces.

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

The pancreatic ductal adenocarcinoma (PDAC), which represents over 90% of pancreatic cancer cases,
has the highest proliferative and metastatic rate in comparison to other pancreatic cancer compartments. This
study is designed to determine whether small nucleolar RNA, H/ACA box 64 (snoRNA64) is associated with
pancreatic cancer initiation and progression. Gene expression data from the Gene Expression Omnibus (GEO)
repository have shown that snoRNA64 expression is reduced in primary and metastatic pancreatic cancer as
compared to normal tissues based on statistical analysis of the in Silico analysis. Using qPCR techniques,
pancreatic cancer cell lines include PK-1, PK-8, PK-4, and Mia PaCa-2 with differ