Results of exposure larvae of the most important predator in the integrated pest management , the green lacewings, Chrysoperla carnea (Stephens) to various densities of fig moth Ephestia cautella eggs showed increasing in the number of consumed prey at decreasing rate of increasing prey density where curve slope consumption decreased gradually until leveling off. These specifications concurred with type II functional response that predators appear towards varied densities of its preys ,that was confirm by logistic regression between the proportion of prey eaten in relation to prey offered . Third larval instars of the predator showed attack rate (a) of 4.85. This was greater than the second larval instar (3.58). Handling time (Th) per

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

The paper aims to propose Teaching Learning based Optimization (TLBO) algorithm to solve 3-D packing problem in containers. The objective which can be presented in a mathematical model is optimizing the space usage in a container. Besides the interaction effect between students and teacher, this algorithm also observes the learning process between students in the classroom which does not need any control parameters. Thus, TLBO provides the teachers phase and students phase as its main updating process to find the best solution. More precisely, to validate the algorithm effectiveness, it was implemented in three sample cases. There was small data which had 5 size-types of items with 12 units, medium data which had 10 size-types of items w

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

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

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 removal of commercial orange G dye from its aqueous solution by adsorption on tobacco leaves (TL) was studied in respect to different factor that affected the adsorption process. These factors including the tobacco leaves does, period of orange G adsorption, pH, and initial orange G dye concentration .Different types of isotherm models were used to describe the orange G dye adsorption onto the tobacco leaves. The experimental results were compared using Langmuir, and frundlich adsorption isotherm, the constants for these two isotherm models was determined. The results fitted frundlich model with value of correlation coefficient equal to (0.981). The capacity of adsorption for the orange G dye was carried out using various kinetic models

NEACADEMY's JOURNALS