This study focuses on producing wood-plastic composites using unsaturated polyester resin reinforced with Pistacia vera shell particles and wood industry waste powder. Composites with reinforcement ratios of 0%, 20%, 30%, and 40% were prepared and tested for thermal conductivity, impact strength, hardness, and compressive strength. The results revealed that thermal conductivity increases with reinforcement, while maintaining good thermal insulation, reaching a peak value of 0.633453 W/m·K. Hardness decreased with increased reinforcement, reaching a minimum nominal hardness value of 0.9479. Meanwhile, impact strength and compressive strength improved, with peak values of 14.103 k/m² and 57.3864568 MPa, respectively. The main aim is to manu

Two molecular imprinted polymer (MIP) membranes for Levofloxacin (LEV) were prepared based on PVC matrix. The imprinted polymers were prepared by polymerization of styrene (STY) as monomer, N,N methylene di acrylamide as a cross linker ,benzoyl peroxide (BPO) as an initiator and levofloxacin as a template. Di methyl adepate (DMA) and acetophenone (AOPH) were used as plasticizers , the molecular imprinted membranes and the non molecular imprinted membranes were prepared.  The slopes and detection limits of the liquid electrodes ranged from -21.96 – -19.38 mV/decade and 2×10^-4M- 4×10^-4M, and Its response time was around 1 minute, respectively. The liquid  electrodes were packed with 0.1 M standar

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process

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

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

This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t

In this research a new system identification algorithm is presented for obtaining an optimal set of mathematical models for system with perturbed coefficients, then this algorithm is applied practically by an “On Line System Identification Circuit”, based on real time speed response data of a permanent magnet DC motor. Such set of mathematical models represents the physical plant against all variation which may exist in its parameters, and forms a strong mathematical foundation for stability and performance analysis in control theory problems.