Choosing an appropriate impression material is a challenge for many dentists, yet an essential component to provide an excellent clinical outcome and improve productivity and profit. The purpose of present study was to compare wettability, tear strength and dimensional accuracy of three elastomeric impression materials, with the same consistencies (light-body). Three commercially available light body consistency and regular set 3M ESPE Express polyvinylsiloxane (PVS), 3M ESPE Permadyne polyether (PE), and Identium (ID), impression materials were comparedTear strength test, contact angle test and linear dimensional accuracy were evaluated for three elastic impression material. Among the three experimental groups PE impression materia

This paper is concerned with studying the numerical solution for the discrete classical optimal control problem (NSDCOCP) governed by a variable coefficients nonlinear hyperbolic boundary value problem (VCNLHBVP). The DSCOCP is solved by using the Galerkin finite element method (GFEM) for the space variable and implicit finite difference scheme (GFEM-IFDS) for the time variable to get the NS for the discrete weak form (DWF) and for the discrete adjoint weak form (DSAWF) While, the gradient projection method (GRPM), also called the gradient method (GRM), or the Frank Wolfe method (FRM) are used to minimize the discrete cost function (DCF) to find the DSCOC. Within these three methods, the Armijo step option (ARMSO) or the optimal step opt

This research (The families of martyrs, victims of terrorism, war operations and military mistakes opinion about Al- Shuhada`a Establishment ) came to know and diagnose the mental image the martyrs victims of terrorism carries about the performance of Al- Shuhada`a Establishment and the services it provides to them, and to monitor the contents of that image that they had regarding their privileges and rights that Al- Shuhada`a Establishment supposed to give it to them, according to their law. The research problem was represented by the main question: (What is the image of Al- Shuhada`a Establishment among the families of martyrs, victims of terrorism, war operations and military mistakes), and this research was classified within the d

A skip list data structure is really just a simulation of a binary search tree. Skip lists algorithm are simpler, faster and use less space. this data structure conceptually uses parallel sorted linked lists. Searching in a skip list is more difficult than searching in a regular sorted linked list. Because a skip list is a two dimensional data structure, it is implemented using a two dimensional network of nodes with four pointers. the implementation of the search, insert and delete operation taking a time of upto . The skip list could be modified to implement the order statistic operations of RANKand SEARCH BY RANK while maintaining the same expected time. Keywords:skip list , parallel linked list , randomized algorithm , rank.

This paper deals with testing a numerical solution for the discrete classical optimal control problem governed by a linear hyperbolic boundary value problem with variable coefficients. When the discrete classical control is fixed, the proof of the existence and uniqueness theorem for the discrete solution of the discrete weak form is achieved. The existence theorem for the discrete classical optimal control and the necessary conditions for optimality of the problem are proved under suitable assumptions. The discrete classical optimal control problem (DCOCP) is solved by using the mixed Galerkin finite element method to find the solution of the discrete weak form (discrete state). Also, it is used to find the solution for the discrete adj

Let G be a graph with p vertices and q edges and  be an injective function, where k is a positive integer. If the induced edge labeling   defined by for each is a bijection, then the labeling f is called an odd Fibonacci edge irregular labeling of G. A graph which admits an odd Fibonacci edge irregular labeling is called an odd Fibonacci edge irregular graph. The odd Fibonacci edge irregularity strength ofes(G) is the minimum k for which G admits an odd Fibonacci edge irregular labeling. In this paper, the odd Fibonacci edge irregularity strength for some subdivision graphs and graphs obtained from vertex identification is determined.

      A new approach presented in this study to determine the optimal edge detection threshold value. This approach is base on extracting small homogenous blocks from unequal mean targets. Then, from these blocks we generate small image with known edges (edges represent the lines between the contacted blocks). So, these simulated edges can be assumed as true edges .The true simulated edges, compared with the detected edges in the small generated image is done by using different thresholding values. The comparison based on computing mean square errors between the simulated edge image and the produced edge image from edge detector methods. The mean square error computed for the total edge image (Er), for edge regio

The trichomes and chemical composition of three species of the genus Salvia wild-grown (Salvia lanigera, Salvia spinosa) and cultured (Salvia officinalis) were studied in the Anbar governate, the chemical components of the stem and leaves were studied by Gas chromatography–mass spectrometry(GC-MS), in addition to studying the trichomes of the epidermis in the stem and leaves (upper and lower epidermis) by Light microscope. Important differences appeared to us in the chemical study, where it was found that some compounds were found in species without others, which gives them taxonomic importance, also, the trichomes were important in distinguishing the studied species, the species S. spinosa was distinguished by the presence of gla

  This paper deals with numerical approximations of a one-dimensional semilinear parabolic equation with a gradient term. Firstly, we derive the semidiscrete problem of the considered problem and discuss its convergence and blow-up properties. Secondly, we propose both Euler explicit and implicit finite differences methods with a non-fixed time-stepping procedure to estimate the numerical blow-up time of the considered problem. Finally, two numerical experiments are given to illustrate the efficiency, accuracy, and numerical order of convergence of the proposed schemes.