This paper include the problem of segmenting an image into regions represent (objects), segment this object by define boundary between two regions using a connected component labeling. Then develop an efficient segmentation algorithm based on this method, to apply the algorithm to image segmentation using different kinds of images, this algorithm consist four steps at the first step convert the image gray level the are applied on the image, these images then in the second step convert to binary image, edge detection using Canny edge detection in third Are applie the final step is images. Best segmentation rates are (90%) obtained when using the developed algorithm compared with (77%) which are obtained using (ccl) before enhancement.

Excessive torque and drag can be critical limitation during drilling highly deviated oil wells. Using the modeling is regarded as an invaluable process to assist in well planning and to predict and prevent drilling problems. Identify which problems lead to excessive torque and drag to prevent cost losses and equipment damage. Proper modeling data is highly important for knowing and prediction hole problems may occur due to torque and drag and select the best method to avoid these problems related to well bore and drill string. In this study, Torque and drag well plan program from landmark worldwide programming group (Halliburton Company) used to identify hole problems.one deviated well in Zubair oil fields named, ZB-250 selected for

Excessive torque and drag can be critical limitation during drilling highly deviated oil wells. Using the modeling is regarded as an invaluable process to assist in well planning and to predict and prevent drilling problems. Identify which problems lead to excessive torque and drag to prevent cost losses and equipment damage. Proper modeling data is highly important for knowing and prediction hole problems may occur due to torque and drag and select the best method to avoid these problems related to well bore and drill string. In this study, Torque and drag well plan program from landmark worldwide programming group (Halliburton Company) used to identify hole problems.one deviated well in Zubair oil fields named, ZB-250 selected for anal

       In this paper we offer two new subclasses of an open unit disk of r-fold symmetric bi-univalent functions. The Taylor-Maclaurin coefficients  have their coefficient bounds calculated. Furthermore, for functions in , we have solved Fekete-  functional issues. For the applicable classes, there are also a few particular special motivator results.

     . Suppose that  is the Cayley graph whose vertices are all elements of  and two vertices  and  are adjacent if and only if . In this paper,we introduce the generalized Cayley graph denoted by  which is a graph with a vertex set consisting of all column matrices  in which all components are in  and two vertices  and  are adjacent if and only if , where  is a column matrix that each entry is the inverse of the similar entry of  and  is  matrix with all entries in  ,  is the transpose of  and  and m . We aim to provide some basic properties of the new graph and determine the structure of  when  is a complete graph  for every , and n, m  .

Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i

Facial emotion recognition finds many real applications in the daily life like human robot interaction, eLearning, healthcare, customer services etc. The task of facial emotion recognition is not easy due to the difficulty in determining the effective feature set that can recognize the emotion conveyed within the facial expression accurately. Graph mining techniques are exploited in this paper to solve facial emotion recognition problem. After determining positions of facial landmarks in face region, twelve different graphs are constructed using four facial components to serve as a source for sub-graphs mining stage using gSpan algorithm. In each group, the discriminative set of sub-graphs are selected and fed to Deep Belief Network (DBN) f

In this work, laboratory experiments were carried out to verify direct contact membrane distillation system’s performance in highly saline water desalination. The study included the investigation of various operating conditions, like feed flow rate, temperature and concentration of NaCl solution and their impact on the permeation flux were discussed. 16 cm² of a flat sheet membrane module with commercial poly-tetra-fluoroethylene (PTFE) membrane, which has 0.22 μm pore size, 96 µm thickness and 78% average porosity, was used. A high salt rejection factor was obtained greater than 99.9%, and the permeation flux up to 17.27 kg/m².h was achieved at 65°C for hot feed side and 20°C for cold side stream.

With the continuous downscaling of semiconductor processes, the growing power density and thermal issues in multicore processors become more and more challenging, thus reliable dynamic thermal management (DTM) is required to prevent severe challenges in system performance. The accuracy of the thermal profile, delivered to the DTM manager, plays a critical role in the efficiency and reliability of DTM, different sources of noise and variations in deep submicron (DSM) technologies severely affecting the thermal data that can lead to significant degradation of DTM performance. In this article, we propose a novel fault-tolerance scheme exploiting approximate computing to mitigate the DSM effects on DTM efficiency. Approximate computing in hardw