In this paper, the effective computational method (ECM) based on the standard monomial polynomial has been implemented to solve the nonlinear Jeffery-Hamel flow problem. Moreover, novel effective computational methods have been developed and suggested in this study by suitable base functions, namely Chebyshev, Bernstein, Legendre, and Hermite polynomials. The utilization of the base functions converts the nonlinear problem to a nonlinear algebraic system of equations, which is then resolved using the Mathematica^®12 program. The development of effective computational methods (D-ECM) has been applied to solve the nonlinear Jeffery-Hamel flow problem, then a comparison between the methods has been shown. Furthermore, the maximum

The experiment aimed to compare different methods of measuring the Feed pellet durability through the effect of pellet die speeds and the particle size (mill sieve holes diameter). Feed pellet durability was studied in four different ways: pellet direct measurement (%), pellet lengths (%), pellet water absorption (%), pellet durability by drop box device (%), pellet durability by air pressure device (%). Three pellet die speeds 280, 300, and 320 rpm, three mill sieve holes diameter 2, 4, and 6 mm, have been used. The results showed that increasing the pellet die speeds from 280 to 300 then to 320 rpm led to a significant decrease in the feed pellet durability by direct measurement, drop box device, and air pressure device, while pel

Bootstrap is one of an important re-sampling technique which has given the attention of  researches recently. The presence of outliers in the original data set may cause serious problem to the classical bootstrap when the percentage of outliers are higher than the original one. Many methods are proposed to overcome this problem such  Dynamic Robust Bootstrap for LTS (DRBLTS) and Weighted Bootstrap with Probability (WBP). This paper try to show the accuracy of parameters estimation by comparison the results of both methods. The bias , MSE and RMSE are considered. The criterion of the accuracy is based on the RMSE value since the method that provide us RMSE value smaller than other is con

Passive optical network (PON) is a point to multipoint, bidirectional, high rate optical network for data communication. Different standards of PONs are being implemented, first of all PON was ATM PON (APON) which evolved in Broadband PON (BPON). The two major types are Ethernet PON (EPON) and Gigabit passive optical network (GPON). PON with these different standards is called xPON. To have an efficient performance for the last two standards of PON, some important issues will considered. In our work we will integrate a network with different queuing models such M/M/1 and M/M/m model. After analyzing IPACT as a DBA scheme for this integrated network, we modulate cycle time, traffic load, throughput, utilization and overall delay

Two unsupervised classifiers for optimum multithreshold are presented; fast Otsu and k-means. The unparametric methods produce an efficient procedure to separate the regions (classes) by select optimum levels, either on the gray levels of image histogram (as Otsu classifier), or on the gray levels of image intensities(as k-mean classifier), which are represent threshold values of the classes. In order to compare between the experimental results of these classifiers, the computation time is recorded and the needed iterations for k-means classifier to converge with optimum classes centers. The variation in the recorded computation time for k-means classifier is discussed.

Optimizing system performance in dynamic and heterogeneous environments and the efficient management of computational tasks are crucial. This paper therefore looks at task scheduling and resource allocation algorithms in some depth. The work evaluates five algorithms: Genetic Algorithms (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Firefly Algorithm (FA) and Simulated Annealing (SA) across various workloads achieved by varying the task-to-node ratio. The paper identifies Finish Time and Deadline as two key performance metrics for gauging the efficacy of an algorithm, and a comprehensive investigation of the behaviors of these algorithms across different workloads was carried out. Results from the experiment