Background: Blood group system and the ability to taste phenylthiocarbamide (PTC) are the most studied traits in human genetics which have been extensively used in describing genetic variations among human populations around the world that may had an effect on dental caries. The aims of present study were to investigate the caries experience among students with different bitter taste threshold in relation to blood type. Materials and Methods: The sample of present study includes dental students female aged19-21 years. The diagnosis of dental caries was done according to the criteria of Manjia et al, 1989 recording decayed lesion by severity (D1-4) MFS. Furthermore, bitter taste sensitivity was measured according to PTC (phenylthiocarbamid

The goal (purpose) from using development technology that require mathematical procedure related with high Quality & sufficiency of solving complex problem called Dynamic Programming with in recursive method (forward & backward) through  finding series of associated decisions for reliability function of Pareto distribution estimator by using two approach Maximum likelihood & moment .to conclude optimal policy

Rate of penetration plays a vital role in field development process because the drilling operation is expensive and include the cost of equipment and materials used during the penetration of rock and efforts of the crew in order to complete the well without major problems. It’s important to finish the well as soon as possible to reduce the expenditures. So, knowing the rate of penetration in the area that is going to be drilled will help in speculation of the cost and that will lead to optimize drilling outgoings. In this research, an intelligent model was built using artificial intelligence to achieve this goal.  The model was built using adaptive neuro fuzzy inference system to predict the rate of penetration in

Abstract

Much attention has been paid for the use of robot arm in various applications. Therefore, the optimal path finding has a significant role to upgrade and guide the arm movement. The essential function of path planning is to create a path that satisfies the aims of motion including, averting obstacles collision, reducing time interval, decreasing the path traveling cost and satisfying the kinematics constraints. In this paper, the free Cartesian space map of 2-DOF arm is constructed to attain the joints variable at each point without collision. The D*algorithm and Euclidean distance are applied to obtain the exact and estimated distances to the goal respectively. The modified Particle Swarm Optimization al

The subject of an valuation of quality of construction projects is one of the topics which it becomes necessary of the absence of the quantity standards in measuring the control works and the quality valuation standards in constructional projects. In the time being it depends on the experience of the workers which leads to an apparent differences in the valuation.

The idea of this research came to put the standards to evaluate the quality of the projects in a special system depending on quantity scale nor quality specifying in order to prepare an expert system “ Crystal “ to apply this special system to able the engineers to valuate the quality of their projects easily and in more accurate ways.

conventional FCM algorithm does not fully utilize the spatial information in the image. In this research, we use a FCM algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership functions in the neighborhood of each pixel under consideration. The advantages of the method are that it is less
sensitive to noise than other techniques, and it yields regions more homogeneous than those of other methods. This technique is a powerful method for noisy image segmentation. 

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith