Extraction of copper (Cu) from aqueous solution utilizing Liquid Membrane technology (LM) is more effective than precipitation method that forms sludge and must be disposed of in landfills. In this work, we have formulated a liquid surfactant membrane (LSM) that uses kerosene oil as the main diluent of LSM to remove copper ions from the aqueous waste solution through di- (2-ethylhexyl) phosphoric acid - D2EHPA- as a carrier. This technique displays several advantages including one-stage extraction and stripping process, simple operation, low energy requirement, and. In this study, the LSM process was used to transport Cu (II) ions from the feed phase to the stripping phase, which was prepared, using H₂SO₄. For LSM p

Background. “Polyetheretherketone (PEEK)” is a biocompatible, high-strength polymer that is well-suited for use in dental applications due to its unique properties. However, achieving good adhesion between PEEK and hydrophilic materials such as dental adhesives or cement can be challenging. Also, this hydrophobicity may affect the use of PEEK as an implant material. Surface treatment or conditioning is often necessary to improve surface properties. The piranha solution is the treatment of choice to be explored for this purpose. Methods. PEEK disks of 10 mm diameter and 2 mm thickness were used in this study. Those samples were divided into five groups (each group has five samples). The first is the control group, in which no

Coated sand (CS) filter media was investigated to remove phenol and 4-nitrophenol from aqueous solutions in batch experiments. Local sand was subjected to surface modification as impregnated with iron. The influence of process variables represented by solution pH value, contact time, initial concentration and adsorbent dosage on removal efficiency of phenol and 4-nitrophenol onto CS was studied. Batch studies were performed to evaluate the adsorption process, and it was found that the Langmuir isotherm effectively fits the experimental data for the adsorbates better than the Freundlich model with the CS highest adsorption capacity of 0.45 mg/g for 4-nitrophenol and 0.25 mg/g for phenol. The CS was found to adsorb 85% of 4-nitrophenol and

The aim of this paper is to present a method for solving high order ordinary differential equations with two point's boundary condition, we propose semi-analytic technique using two-point oscillatory interpolation to construct polynomial solution. The original problem is concerned using two-point oscillatory interpolation with the fit equal numbers of derivatives at the end points of an interval [0 , 1] . Also, many examples are presented to demonstrate the applicability, accuracy and efficiency of the method by comparing with conventional methods.

      Long memory analysis is one of the most active areas in econometrics and time series where various methods have been introduced to identify and estimate the long memory parameter in partially integrated time series. One of the most common models used to represent time series that have a long memory is the ARFIMA (Auto Regressive Fractional Integration Moving Average Model) which diffs are a fractional number called the fractional parameter. To analyze and determine the ARFIMA model, the fractal parameter must be estimated. There are many methods for fractional parameter estimation. In this research, the estimation methods were divided into indirect methods, where the Hurst parameter is estimated fir

In this paper, a method based on modified adomian decomposition method for solving Seventh order integro-differential equations (MADM). The distinctive feature of the method is that it can be used to find the analytic solution without transformation of boundary value problems. To test the efficiency of the method presented two examples are solved by proposed method.

Oscillation criteria are obtained for all solutions of the first-order linear delay differential equations with positive and negative coefficients where we established some sufficient conditions so that every solution of (1.1) oscillate. This paper generalized the results in [11]. Some examples are considered to illustrate our main results.

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

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall