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

In this paper, a new third kind Chebyshev wavelets operational matrix of derivative is presented, then the operational matrix of derivative is applied for solving optimal control problems using, third kind Chebyshev wavelets expansions. The proposed method consists of reducing the linear system of optimal control problem into a system of algebraic equations, by expanding the state variables, as a series in terms of third kind Chebyshev wavelets with unknown coefficients. Example to illustrate the effectiveness of the method has been presented.

Prostheses are used as an alternative to organs lost from the body. Flex-Foot Cheetah is considered one of the lower limb prostheses used in high-intensity activities such as running. This research focused on testing two samples of Flex-Foot Cheetah manufactured of two various materials (carbon, glass) with polyester and compare between them to find the foot with the best performance in running on the level of professional athlete. In the numerical analysis, the maximum principal stress, maximum principal elastic strain, strain energy; finally, the blade total deformation were calculated for both feet. In experimental work, the load-deflection test was done for foot to calculate the bending the results were very close to

Iris research is focused on developing techniques for identifying and locating relevant biometric features, accurate segmentation and efficient computation while lending themselves to compression methods. Most iris segmentation methods are based on complex modelling of traits and characteristics which, in turn, reduce the effectiveness of the system being used as a real time system. This paper introduces a novel parameterized technique for iris segmentation. The method is based on a number of steps starting from converting grayscale eye image to a bit plane representation, selection of the most significant bit planes followed by a parameterization of the iris location resulting in an accurate segmentation of the iris from the origin

In this paper, we present multiple bit error correction coding scheme based on extended Hamming product code combined with type II HARQ using shared resources for on chip interconnect. The shared resources reduce the hardware complexity of the encoder and decoder compared to the existing three stages iterative decoding method for on chip interconnects. The proposed method of decoding achieves 20% and 28% reduction in area and power consumption respectively, with only small increase in decoder delay compared to the existing three stage iterative decoding scheme for multiple bit error correction. The proposed code also achieves excellent improvement in residual flit error rate and up to 58% of total power consumption compared to the other err

This paper describes the problem of online autonomous mobile robot path planning, which is consisted of finding optimal paths or trajectories for an autonomous mobile robot from a starting point to a destination across a flat map of a terrain, represented by a 2-D workspace. An enhanced algorithm for solving the problem of path planning using Bacterial Foraging Optimization algorithm is presented. This nature-inspired metaheuristic algorithm, which imitates the foraging behavior of E-coli bacteria, was used to find the optimal path from a starting point to a target point. The proposed algorithm was demonstrated by simulations in both static and dynamic different environments. A comparative study was evaluated between the developed algori

An experiment was carried out in the fields of Agriculture College-Baghdad University during spring and autumn of 2015 by using a randomized complete blocks design with three replications. The first season hybridization was established among three pure cultivars of cowpea (Vigna uniguiculata L.) which: Ramshorn, California black eye and Rahawya in full diallel crosses according to Griffing with first method and fixed model (3 parents+ 3 diallel hybrids +3 reciprocal hybrids) and a comparison experiment was in autumn season. The result of statistical analysis showed that there was a significant difference among the parents and their hybrids for all the studied characters. The parent 1 was the higher for root nodules number , leaf number, pod

This research aims to solve the problem of selection using clustering algorithm, in this research optimal portfolio is formation using the single index model, and the real data are consisting from the stocks Iraqi Stock Exchange in the period 1/1/2007 to 31/12/2019. because the data series have missing values ,we used the two-stage missing value compensation method, the knowledge gap was inability the portfolio models to reduce The estimation error , inaccuracy of the cut-off rate and the Treynor ratio combine stocks into the portfolio that caused to decline in their performance, all these problems required employing clustering technic to data mining and regrouping it within clusters with similar characteristics to outperform the portfolio