Abstract

 This research deals will the declared production planning operation in the general company of planting oils, which have  great role in production operations management who had built mathematical model for correct non-linear programming according to discounting operation during raw materials or half-made materials purchasing operation which concentration of six main products by company but discount included just three products of raw materials, and there were six months taken from the 1^st half of 2014 as a planning period has been chosen . Simulated annealing algorithm  application on non-linear model which been more difficulty than possible solution when imposed restric

       Legislative language is characterized by its complexity, specifically in the process of translating statutory terms from two quite different languages, and from totally two different legal systems as from Spanish into Arabic. The present study stresses the process of translating legislative terms used in Spanish wills into Arabic through high lightening the polysemy of such mentioned terms and explaining their use in other legislative grounds.  Additionally, the present study elucidates, analyzes, underlines the difficulty and looks for the most appropriate procedures and techniques of translating some of the prominent inheritance expressions taking in account the legislative dif

This paper focuses on developing a self-starting numerical approach that can be used for direct integration of higher-order initial value problems of Ordinary Differential Equations. The method is derived from power series approximation with the resulting equations discretized at the selected grid and off-grid points. The method is applied in a block-by-block approach as a numerical integrator of higher-order initial value problems. The basic properties of the block method are investigated to authenticate its performance and then implemented with some tested experiments to validate the accuracy and convergence of the method.

This paper includes the application of Queuing theory with of Particle swarm algorithm or is called (Intelligence swarm) to solve the problem of The queues and developed for General commission for taxes /branch Karkh center in the service stage of the Department of calculators composed of six  employees , and it was chosen queuing model is a single-service channel  M / M / 1 according to the nature of the circuit work mentioned above and it will be divided according to the letters system for each employee, and  it was composed of data collection times (arrival time , service time, departure time)

 A mixture model is used to model data that come from more than one component. In recent years, it became an effective tool in drawing inferences about the complex data that we might come across in real life. Moreover, it can represent a tremendous confirmatory tool in classification observations based on similarities amongst them. In this paper, several mixture regression-based methods were conducted under the assumption that the data come from a finite number of components. A comparison of these methods has been made according to their results in estimating component parameters. Also, observation membership has been inferred and assessed for these methods. The results showed that the flexible mixture model outperformed the others

Metaheuristics under the swarm intelligence (SI) class have proven to be efficient and have become popular methods for solving different optimization problems. Based on the usage of memory, metaheuristics can be classified into algorithms with memory and without memory (memory-less). The absence of memory in some metaheuristics will lead to the loss of the information gained in previous iterations. The metaheuristics tend to divert from promising areas of solutions search spaces which will lead to non-optimal solutions. This paper aims to review memory usage and its effect on the performance of the main SI-based metaheuristics. Investigation has been performed on SI metaheuristics, memory usage and memory-less metaheuristics, memory char

Among the metaheuristic algorithms, population-based algorithms are an explorative search algorithm superior to the local search algorithm in terms of exploring the search space to find globally optimal solutions. However, the primary downside of such algorithms is their low exploitative capability, which prevents the expansion of the search space neighborhood for more optimal solutions. The firefly algorithm (FA) is a population-based algorithm that has been widely used in clustering problems. However, FA is limited in terms of its premature convergence when no neighborhood search strategies are employed to improve the quality of clustering solutions in the neighborhood region and exploring the global regions in the search space. On the

 A mixture model is used to model data that come from more than one component. In recent years, it became an effective tool in drawing inferences about the complex data that we might come across in real life. Moreover, it can represent a tremendous confirmatory tool in classification observations based on similarities amongst them. In this paper, several mixture regression-based methods were conducted under the assumption that the data come from a finite number of components. A comparison of these methods has been made according to their results in estimating component parameters. Also, observation membership has been inferred and assessed for these methods. The results showed that the flexible mixture model outperformed the