Background: This review aims to discuss various canine retraction techniques using frictionless mechanics. Methods: Between 1930 and February 2022, searches were conducted about various canine retraction techniques using fixed orthodontic appliances in various databases, including PubMed Central, Science Direct, Wiley Online Library, the Cochrane Library, Textbooks, Google Scholar, Research Gate, and manual searching. Results: After removing the duplicate articles, publications that described how to use archwires to perform canine retraction with the archwires were included. Conclusions: The pros and cons of various canine retraction techniques using archwires were thoroughly discussed. T-loop is the preferred spring of all because of its characteristics
Background: The demand for better esthetic during orthodontic treatment has increased nowadays, so orthodontists starting using esthetic arch wires, brackets and ligatures.Tooth colored brackets were introduced in different types of materials. Sapphire ceramic brackets are one type of esthetic brackets and their color stability remains the main concern for the clinicians and patients at the same time. The present study design to evaluate the effect of three different staining materials (pepsi, black tea and cigarette smoke) on the stainability of sapphire ceramic brackets bonded with three types of light cure orthodontic adhesives which include: Resilience, Enlight and Transbond. Materials and Methods: The sample consisted of three hundre
... Show MoreAbstract
The multiple linear regression model of the important regression models used in the analysis for different fields of science Such as business, economics, medicine and social sciences high in data has undesirable effects on analysis results . The multicollinearity is a major problem in multiple linear regression. In its simplest state, it leads to the departure of the model parameter that is capable of its scientific properties, Also there is an important problem in regression analysis is the presence of high leverage points in the data have undesirable effects on the results of the analysis , In this research , we present some of
... Show MoreClassification of imbalanced data is an important issue. Many algorithms have been developed for classification, such as Back Propagation (BP) neural networks, decision tree, Bayesian networks etc., and have been used repeatedly in many fields. These algorithms speak of the problem of imbalanced data, where there are situations that belong to more classes than others. Imbalanced data result in poor performance and bias to a class without other classes. In this paper, we proposed three techniques based on the Over-Sampling (O.S.) technique for processing imbalanced dataset and redistributing it and converting it into balanced dataset. These techniques are (Improved Synthetic Minority Over-Sampling Technique (Improved SMOTE), Border
... Show MoreIn this paper, the methods of weighted residuals: Collocation Method (CM), Least Squares Method (LSM) and Galerkin Method (GM) are used to solve the thin film flow (TFF) equation. The weighted residual methods were implemented to get an approximate solution to the TFF equation. The accuracy of the obtained results is checked by calculating the maximum error remainder functions (MER). Moreover, the outcomes were examined in comparison with the 4th-order Runge-Kutta method (RK4) and good agreements have been achieved. All the evaluations have been successfully implemented by using the computer system Mathematica®10.
Optimizing system performance in dynamic and heterogeneous environments and the efficient management of computational tasks are crucial. This paper therefore looks at task scheduling and resource allocation algorithms in some depth. The work evaluates five algorithms: Genetic Algorithms (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Firefly Algorithm (FA) and Simulated Annealing (SA) across various workloads achieved by varying the task-to-node ratio. The paper identifies Finish Time and Deadline as two key performance metrics for gauging the efficacy of an algorithm, and a comprehensive investigation of the behaviors of these algorithms across different workloads was carried out. Results from the experiment
... Show MoreBacterial meningitis is a leading cause of illness and death worldwide. It is crucial for clinical and public health care, as well as disease control, to identify the meningitis-causing agent promptly. Between June 2021-February 2022, a total of 100 cerebrospinal fluid (CSF) and blood samples were collected from suspected cases of meningitis admitted to Raparin Paediatric Teaching Hospital, Erbil city-Iraq. Cytochemical, cultural, and biochemical tests were conducted, and confirmed by molecular techniques. Bacterial culture findings were positive in 7% of CSF samples and just one positive among blood samples. The most common pathogens found by cultural characteristics and VITEK 2 Compact System were Staphylococcus sciuri in two
... Show MoreThe advancement of digital technology has increased the deployment of wireless sensor networks (WSNs) in our daily life. However, locating sensor nodes is a challenging task in WSNs. Sensing data without an accurate location is worthless, especially in critical applications. The pioneering technique in range-free localization schemes is a sequential Monte Carlo (SMC) method, which utilizes network connectivity to estimate sensor location without additional hardware. This study presents a comprehensive survey of state-of-the-art SMC localization schemes. We present the schemes as a thematic taxonomy of localization operation in SMC. Moreover, the critical characteristics of each existing scheme are analyzed to identify its advantages
... Show MoreTwo unsupervised classifiers for optimum multithreshold are presented; fast Otsu and k-means. The unparametric methods produce an efficient procedure to separate the regions (classes) by select optimum levels, either on the gray levels of image histogram (as Otsu classifier), or on the gray levels of image intensities(as k-mean classifier), which are represent threshold values of the classes. In order to compare between the experimental results of these classifiers, the computation time is recorded and the needed iterations for k-means classifier to converge with optimum classes centers. The variation in the recorded computation time for k-means classifier is discussed.