Contamination of surface and groundwater with excessive concentrations of fluoride is of significant health hazard. Adsorption of fluoride onto waste materials of no economic value could be a potential approach for the treatment of fluoride-bearing water. This experimental and modeling study was devoted to investigate for the first the fluoride removal using unmodified waste granular brick (WGB) in a fixed bed running in continuous mode. Characterization of WGB was carried out by FT-IR, SEM, and EDX analysis. The batch mode experiments showed that they were affected by several parameters including contact time, initial pH, and sorbent dosage. The best values of these parameters that provided maximum removal percent (82%) with the in

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

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. 

Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are

LK Abood, RA Ali, M Maliki, International Journal of Science and Research, 2015 - Cited by 2