Background: Recent implant surgical approach aims to cause less trauma, invasiveness and pain as much as possible and to reduce patient and surgeon discomfort, time of surgery and time needed for functional implant loading. Flapless surgical techniques considered recently as one of the most popular techniques that may achieve these aims especially enhancing osseointegration and subsequently implant stability within less time than the traditional flapped surgical technique. So this study aimed to make a comparison between flapped and flapless surgical techniques in resulted implant stability according to resonance frequency analysis RFA and in duration of surgical operation. Materials and methods: A total of 26 patients with 41 implants (o

Background: The aim of this study was to evaluate and compare the apical microleakage around retrograde cavities prepared with ultrasonic technique and filled with (Biodentineâ„¢) Materials and methods: 40 extracted single rooted human permanent maxillary teeth with mature apices were selected. The roots were prepared chemo-mechanically using k-files with crown-down technique and then obturated with lateral condensation gutta-percha technique. Teeth were divided into four main groups according to the cavity preparation method either manual or ultrasonic technique: Group A (n=10): A class I retrograde cavity at root end was prepared with traditional handpeice equipped and placement of Biodentine with manual condensation. Group B (n=10):

Markov chains are an application of stochastic models in operation research, helping the analysis and optimization of processes with random events and transitions. The method that will be deployed to obtain the transient solution to a Markov chain problem is an important part of this process. The present paper introduces a novel Ordinary Differential Equation (ODE) approach to solve the Markov chain problem. The probability distribution of a continuous-time Markov chain with an infinitesimal generator at a given time is considered, which is a resulting solution of the Chapman-Kolmogorov differential equation. This study presents a one-step second-derivative method with better accuracy in solving the first-order Initial Value Problem

The research aims to get acquainted with the evaluation of the reality of the application of the curriculum axis from among the eight Iraqi academic accreditation standards in a sample of governmental and private universities and colleges in Iraq and to identify the main and secondary reasons for it as well as to provide proposed mechanisms and procedures to help reduce gaps, If the research problem is represented in the weak availability of the requirements of the curriculum axis in universities and colleges (the study sample) due to the weak documentation and successful implementation of them and interest in them is still below the level of ambition, In order to arrive at scientific facts, the researchers adopted the comparativ

In general, path-planning problem is one of most important task in the field of robotics. This paper describes the path-planning problem of mobile robot based on various metaheuristic algorithms. The suitable collision free path of a robot must satisfies certain optimization criteria such as feasibility, minimum path length, safety and smoothness and so on. In this research, various three approaches namely, PSO, Firefly and proposed hybrid FFCPSO are applied in static, known environment to solve the global path-planning problem in three cases. The first case used single mobile robot, the second case used three independent mobile robots and the third case applied three follow up mobile robot.  Simulation results, whi

     Binary relations or interactions among bio-entities, such as proteins, set up the essential part of any living biological system. Protein-protein interactions are usually structured in a graph data structure called "protein-protein interaction networks" (PPINs). Analysis of PPINs into complexes tries to lay out the significant knowledge needed to answer many unresolved questions, including how cells are organized and how proteins work. However, complex detection problems fall under the category of non-deterministic polynomial-time hard (NP-Hard) problems due to their computational complexity. To accommodate such combinatorial explosions, evolutionary algorithms (EAs) are proven effective alternatives to heuristics in solvin

A new modified differential evolution algorithm DE-BEA, is proposed to improve the reliability of the standard DE/current-to-rand/1/bin by implementing a new mutation scheme inspired by the bacterial evolutionary algorithm (BEA). The crossover and the selection schemes of the DE method are also modified to fit the new DE-BEA mechanism. The new scheme diversifies the population by applying to all the individuals a segment based scheme that generates multiple copies (clones) from each individual one-by-one and applies the BEA segment-wise mechanism. These new steps are embedded in the DE/current-to-rand/bin scheme. The performance of the new algorithm has been compared with several DE variants over eighteen benchmark functions including sever

Addressed the problem of the research is marked: (Performing processors for the time between Impressionism and superrealism) the concept of time and how to submit artwork. The search came in four sections: general framework for research and identified the research problem and the need for him. With an indication of the importance of his presence. Then determine the research objectives of (detection processors performing to the concept of time in works of art in each of Impressionism and superrealism. And a comparison between them to reveal similarities and differences), followed by the establishment of boundaries Find three (objectivity, the temporal and spatial) were then determine the terms related to the title. Then provide the theore