Background: The posterior slope of the articular eminence of completely edentulous patients compared to patients with maintained occlusion shows significant flattening. This study aimed to correlate between the flattening of the posterior slope of the articular eminence, with dental status, age, genders, on both sides using computed tomography. Materials and Methods: The sample of the present study was a total of 117 Iraqi subjects, who admitted to the maxillofacial department at Al-Sadr Teaching Hospital in Al-Najaf city. The examination was performed on CT scanner; the eminence inclination was measured in two methods using sagittal section. Results: Clinically, the inclination of articular eminence was higher in edentulous subjects than i

The purpose of this research is to a treatment the impact of Views outliers to the estimators of a distributed arrival and service to the theory of queues and estimate the distribution parameters depending on the robust estimators, and when he was outliers greatest impact in the process of estimating the both distributions mentioned parameters, it was necessary to use way to test that does these data contain abnormal values ​​or not? it was used the method ( Tukey ) for this purpose and is of the most popular ways to discover the outliers , it shows that there are views abnormal (outliers ) in the estimators of each of the distributional arrival and service, which have a significant impact on the calculation of these estimato

This article proposes a new strategy based on a hybrid method that combines the gravitational search algorithm (GSA) with the bat algorithm (BAT) to solve a single-objective optimization problem. It first runs GSA, followed by BAT as the second step. The proposed approach relies on a parameter between 0 and 1 to address the problem of falling into local research because the lack of a local search mechanism increases intensity search, whereas diversity remains high and easily falls into the local optimum. The improvement is equivalent to the speed of the original BAT. Access speed is increased for the best solution. All solutions in the population are updated before the end of the operation of the proposed algorithm. The diversification f

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 this paper a system is designed on an FPGA using a Nios II soft-core processor, to detect the colour of a specific surface and moving a robot arm accordingly. The surface being detected is bounded by a starting mark and an ending mark, to define the region of interest. The surface is also divided into sections as rows and columns and each section can have any colour. Such a system has so many uses like for example warehouses or even in stores where their storing areas can be divided to sections and each section is coloured and a robot arm collects objects from these sections according to the section’s colour also the robot arm can organize objects in sections according to the section’s colour.

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.

MK Al-Janabi, NA Nasir, RK Jaber, AO Oleiwe, Iraqi Postgraduate Medical Journal, 2018 - Cited by 7

The Internet image retrieval is an interesting task that needs efforts from image processing and relationship structure analysis. In this paper, has been proposed compressed method when you need to send more than a photo via the internet based on image retrieval. First, face detection is implemented based on local binary patterns. The background is notice based on matching global self-similarities and compared it with the rest of the image backgrounds. The propose algorithm are link the gap between the present image indexing technology, developed in the pixel domain, and the fact that an increasing number of images stored on the computer are previously compressed by JPEG at the source. The similar images are found and send a few images inst