The aim of this research is to investigation the optimization of the machining parameters (spindle speed, feed rate, depth of cut, diameter of cutter and number of flutes of cutter) of surface roughness for free-form surface of composite material (Aluminum 6061 reinforced boron carbide) by using HSS uncoated flat end mill cutters which are rare use of the free-form surface. Side milling (profile) is the method used in this study by CNC vertical milling machine. The purpose of using ANFIS to obtain the better prediction of surface roughness values and decreased of the error prediction value and get optimum machining parameters by using Taguchi method for the best surface roughness at spindle speed 4500 r.p.m, 920mm/rev feed rate, 0.6mm de

Background: Dental caries is one of the most significant problems in world health care. Restoring carious primary teeth is one of the major treatment goals for Children, and the light activated resin restoration materials like composite, resin-modified glass ionomer and polyacid-modified which was introduced in dentistry in 1970, widely used in clinical dentistry but its application increased dramatically in recent years because of its biocompatibility, color matching, good adhesive properties of its resemblance in physical and mechanical aspects to tooth. The aim of this study: To evaluate the microleakage of Polyacid-Modified Composite resin Compared to Flowable Hybrid Composite and Resin-Modified Glass ionomer cement. Materials and me

 A new technique in cultivation by installing membrane sheet below the crop’s root zone was helped to save irrigation water in the root zone, less farm losses, increasing the field water use efficiency and water productivity. In this paper, the membrane sheet was installed below the root zone of zucchini during the summer growing season 2017 in open field.  This research was carried out in a private field in Babil governorate at Sadat Al Hindiya Township reached 72 km from Baghdad. Surface trickle irrigation system was used for irrigation process. Two treatment plots were used, treatment plot T1 using membrane sheet and treatment plot T2 without using the membrane sheet. The applied irrigation water, time of

This paper presents a hybrid approach for solving null values problem; it hybridizes rough set theory with intelligent swarm algorithm. The proposed approach is a supervised learning model. A large set of complete data called learning data is used to find the decision rule sets that then have been used in solving the incomplete data problem. The intelligent swarm algorithm is used for feature selection which represents bees algorithm as heuristic search algorithm combined with rough set theory as evaluation function. Also another feature selection algorithm called ID3 is presented, it works as statistical algorithm instead of intelligent algorithm. A comparison between those two approaches is made in their performance for null values estima

The primary objective of this paper is to introduce a new concept of fibrewise topological spaces on D is named fibrewise multi- topological spaces on D. Also, we entroduce the concepts of multi-proper, fibrewise multi-compact, fibrewise locally multi-compact spaces, Moreover, we study relationships between fibrewise multi-compact (resp., locally multi-compac) space and some fibrewise multi-separation axioms.

This article proposes a new strategy based on a hybrid method that combines the gravitational search algorithm (GSA) with the bat algorithm (BAT) to solve a single-objective optimization problem. It first runs GSA, followed by BAT as the second step. The proposed approach relies on a parameter between 0 and 1 to address the problem of falling into local research because the lack of a local search mechanism increases intensity search, whereas diversity remains high and easily falls into the local optimum. The improvement is equivalent to the speed of the original BAT. Access speed is increased for the best solution. All solutions in the population are updated before the end of the operation of the proposed algorithm. The diversification f