In this paper waste natural material (date seed) and polymer particles(UF) were used for investigation of  removal dye of the potassium permanganate. Also study effect some variables such as pH, dye concentration and adsorbent concentration on dye removal. 15 experimental runs were done using  the itemized conditions designed established on the Box-Wilson design employed to optimize dye removal. The optimum conditions for the dye removal were found: (pH) 12, (dye con.) 2.38 ppm, (adsorbant con.) 0.0816 gm for date seed with 95.22% removal and for UF (pH) 12, (dye con.) 18 ppm, (adsorbant con.) 0.2235 gm with 91.43%. The value of R-square was 85.47%  for Date seed  and (88.77%) for UF.

In this paper, we derive and prove the stability bounds of the momentum coefficient µ and the learning rate ? of the back propagation updating rule in Artificial Neural Networks .The theoretical upper bound of learning rate ? is derived and its practical approximation is obtained

Efficient and cost-effective drilling of directional wells necessitates the implementation of best drilling practices and advanced techniques to optimize drilling operations. Failure to adequately consider drilling risks can result in inefficient drilling operations and non-productive time (NPT). Although advanced drilling techniques may be expensive, they offer promising technical solutions for mitigating drilling risks. This paper aims to demonstrate the effectiveness of advanced drilling techniques in mitigating risks and improving drilling operations when compared to conventional drilling techniques. Specifically, the advanced drilling techniques employed in Buzurgan Oil Field, including vertical drilling with mud motor, managed pres

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

For several applications, it is very important to have an edge detection technique matching human visual contour perception and less sensitive to noise. The edge detection algorithm describes in this paper based on the results obtained by Maximum a posteriori (MAP) and Maximum Entropy (ME) deblurring algorithms. The technique makes a trade-off between sharpening and smoothing the noisy image. One of the advantages of the described algorithm is less sensitive to noise than that given by Marr and Geuen techniques that considered to be the best edge detection algorithms in terms of matching human visual contour perception.

Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh

An Optimal Algorithm for HTML Page Building Process