The aim of this paper is to propose an efficient three steps iterative method for finding the zeros of the nonlinear equation f(x)=0 . Starting with a suitably chosen , the method generates a sequence of iterates converging to the root. The convergence analysis is proved to establish its five order of convergence. Several examples are given to illustrate the efficiency of the proposed new method and its comparison with other methods.

Gaslift reactors are employed in several bioapplications due to their characteristics of cost-effectiveness and high efficiency. However, the nutrient and thermal gradient is one of the obstacles that stand in the way of its widespread use in biological applications. The diagnosis, analysis, and tracking of fluid paths in external draft tube gaslift bioreactor-type are the main topics of the current study. Several parameters were considered to assess the mixing efficiency such as downcomer-to-rizer diameter ratio (Ded/Dr), the position of the diffuser to the height of bioreactor ratio (Pd/Lr), and gas bubble size (Db). The multiple regression of liquid velocity indicates the optimal setting: Ded/Dr is (0.5), Pd/Lr is (0.02), and Db

Gaslift reactors are employed in several bioapplications due to their characteristics of cost-effectiveness and high efficiency. However, the nutrient and thermal gradient is one of the obstacles that stand in the way of its widespread use in biological applications. The diagnosis, analysis, and tracking of fluid paths in external draft tube gaslift bioreactor-type are the main topics of the current study. Several parameters were considered to assess the mixing efficiency such as downcomer-to-rizer diameter ratio (Ded/Dr), the position of the diffuser to the height of bioreactor ratio (Pd/Lr), and gas bubble size (Db). The multiple regression of liquid velocity indicates the optimal setting: Ded/Dr is (0.5), Pd/Lr is (0.02), and Db

In the past two decades, maritime transport traffic has increased, especially in the case of container flow. The BAP (Berth Allocation Problem) (BAP) is a main problem to optimize the port terminals. The current manuscript explains the DBAP problems in a typical arrangement that varies from the conventional separate design station, where each berth can simultaneously accommodate several ships when their entire length is less or equal to length. Be a pier, serve. This problem was then solved by crossing the Red Colobuses Monkey Optimization (RCM) with the Genetic Algorithm (GA). In conclusion, the comparison and the computational experiments are approached to demonstrate the effectiveness of the proposed method contrasted with other

To ensure that a software/hardware product is of sufficient quality and functionality, it is essential to conduct thorough testing and evaluations of the numerous individual software components that make up the application. Many different approaches exist for testing software, including combinatorial testing and covering arrays. Because of the difficulty of dealing with difficulties like a two-way combinatorial explosion, this brings up yet another problem: time. Using client-server architectures, this research introduces a parallel implementation of the TWGH algorithm. Many studies have been conducted to demonstrate the efficiency of this technique. The findings of this experiment were used to determine the increase in speed and co

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).

The application of the test case prioritization method is a key part of system testing intended to think it through and sort out the issues early in the development stage. Traditional prioritization techniques frequently fail to take into account the complexities of big-scale test suites, growing systems and time constraints, therefore cannot fully fix this problem. The proposed study here will deal with a meta-heuristic hybrid method that focuses on addressing the challenges of the modern time. The strategy utilizes genetic algorithms alongside a black hole as a means to create a smooth tradeoff between exploring numerous possibilities and exploiting the best one. The proposed hybrid algorithm of genetic black hole (HGBH) uses the

The aim of this research is to use robust technique by trimming, as the analysis of maximum likelihood (ML) often fails in the case of outliers in the studied phenomenon. Where the (MLE) will lose its advantages because of the bad influence caused by the Outliers. In order to address this problem, new statistical methods have been developed so as not to be affected by the outliers. These methods have robustness or resistance. Therefore, maximum trimmed likelihood: (MTL) is a good alternative to achieve more results. Acceptability and analogies, but weights can be used to increase the efficiency of the resulting capacities and to increase the strength of the estimate using the maximum weighted trimmed likelihood (MWTL). In order to perform t