In this work,  the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt

Background: The purpose of this study was to evaluate and compare centering ability and canal transportation of simulated S-shaped canals instrumented with four different types of rotary nickel-titanium systems. Materials and Methods: Forty simulated S-shaped canals in resin blocks were divided into four groups of ten each and were instrumented to an apical size 25 by different instrumentation technique using ProTaper Universal files (group A), ProTaperNext (group B), Reciproc (group C) and WaveOne (group D).Centering ability and canal transportation was measured at (11) measuring points from D0 to D10 bysuperimposion of the pre- and post-operative images obtained by using digital camera in standardized manner. An assessment of the canals

The goals of endodontic preparation were to shape and clean the space of the root canal and remove microorganisms, affected dentin and pulp, the apical foramen and the canal curve should be protected from being transported during endodontic canal preparation. The aim of this study was to evaluate the curve straightening of curved root canals and apical transportation after preparation with four rotary systems. Forty mesial roots of the lower 1st molars teeth only the mesiobuccal canals were used, these roots were immersed into cold clear acrylic , the teeth roots divided into four groups according to rotary system used for preparation of the canals (ten roots for each group):. group I: ProTaper Next rotary system, group II: IRaCe Plus rotar

Let
be a dynamical system,
is said to be topological transitive if for every pair of non-empty open set
, there exists
such that
. We introduce and investigate a new definition of topological transitive by using the nation N-open subset and we called N-transitive and prove the equivalent definitions of this new definition.

This research aims to analyse the problem of organizations in general and universities in particular, in dealing with �quality subjects� in a world where these organizations face the risks of becoming side lined and possibly vanished without looking for solutions that allow them to move in an open arena where change becomes the key to those solutions. Change here must be strategic and planning must adopts a way for organizations to develop mechanisms to manage change itself. Management leaders play a central role in achieving the principle required to chart new trends for universities in dealing with quality as a strategy that allows excellence and competition in light of the success of the processes of change. Change through reengineer

The necessities of steganography methods for hiding secret message into images have been ascend. Thereby, this study is to generate a practical steganography procedure to hide text into image. This operation allows the user to provide the system with both text and cover image, and to find a resulting image that comprises the hidden text inside. The suggested technique is to hide a text inside the header formats of a digital image. Least Significant Bit (LSB) method to hide the message or text, in order to keep the features and characteristics of the original image are used. A new method is applied via using the whole image (header formats) to hide the image. From the experimental results, suggested technique that gives a higher embe

A network (or formally a graph) can be described by a set of nodes and a set of edges connecting these nodes. Networks model many real-world phenomena in various research domains, such as biology, engineering and sociology. Community mining is discovering the groups in a network where individuals group of membership are not explicitly given. Detecting natural divisions in such complex networks is proved to be extremely NP-hard problem that recently enjoyed a considerable interest. Among the proposed methods, the field of evolutionary algorithms (EAs) takes a remarkable interest. To this end, the aim of this paper is to present the general statement of community detection problem in social networks. Then, it visits the problem as an optim

Artificial pancreas is simulated to handle Type I diabetic patients under intensive care by automatically controlling the insulin infusion rate. A Backstepping technique is used to apply the effect of PID controller to blood glucose level since there is no direct relation between insulin infusion (the manipulated variable) and glucose level in Bergman’s system model subjected to an oral glucose tolerance test by applying a meal translated into a disturbance. Backstepping technique is usually recommended to stabilize and control the states of Bergman's class of nonlinear systems. The results showed a very satisfactory behavior of glucose deviation to a sudden rise represented by the meal that increase the blood glucose