This paper develops a fuzzy multi-objective model for solving aggregate production planning problems that contain multiple products and multiple periods in uncertain environments. We seek to minimize total production cost and total labor cost. We adopted a new method that utilizes a Zimmermans approach to determine the tolerance and aspiration levels. The actual performance of an industrial company was used to prove the feasibility of the proposed model. The proposed model shows that the method is useful, generalizable, and can be applied to APP problems with other parameters.

Motifs template is the input for many bioinformatics systems such codons finding, transcription, transaction, sequential pattern miner, and bioinformatics databases analysis. The size of motifs arranged from one base up to several Mega bases, therefore, the typing errors increase according to the size of motifs. In addition, when the structures motifs are submitted to bioinformatics systems, the specifications of motifs components are required, i.e. the simple motifs, gaps, and the lower bound and upper bound of each gap. The motifs can be of DNA, RNA, or Protein. In this research, a motif parser and visualization module is designed depending on a proposed a context free grammar, CFG, and colors human recognition system. GFC describes the m

Given a binary matrix, finding the maximum set of columns such that the resulting submatrix has the Consecutive Ones Property (C1P) is called the Consecutive Ones Submatrix (C1S) problem. There are solution approaches for it, but there is also a room for improvement. Moreover, most of the studies of the problem use exact solution methods. We propose an evolutionary approach to solve the problem. We also suggest a related problem to C1S, which is the Consecutive Blocks Minimization (CBM). The algorithm is then performed on real-world and randomly generated matrices of the set covering type.  

Verrucae vulgares are commonly encountered. The present work is designed in an attempt to build a systematic procedure for treating warts by carbon dioxide laser regarding dose parameters, application parameters and laser safety.
Patients and Methods: The study done in the department of dermatology in Al-Najaf Teaching Hospital in Najaf, Iraq. Forty-two patients completed the study and follow up period for 3 months. Recalcitrant and extensive warts were selected to enter the study. Carbon dioxide laser in a continuous mode, in non-contact application, with 1 mm spot size was used. The patients were divided into two groups. The first group of patients consisted of 60 lesions divided to 6 equal groups, in whom we use different outputs a

This paper presents a hybrid metaheuristic algorithm which is Harmony-Scatter Search (HSS). The HSS provides Scatter Search (SS) with random exploration for search space of problem and more of diversity and intensification for promising solutions. The SS and HSS have been tested on Traveling Salesman Problem. A computational experiment with benchmark instances is reported. The results demonstrate that the HSS algorithm produce better performance than original Scatter Search algorithm. The HSS in the value of average fitness is 27.6% comparing with original SS. In other hand the elapsed time of HSS is larger than the original SS by small value. The developed algorithm has been compared with other algorithms for the same problem, and the r

The present study aimed to identify teaching problems which facing the teachers for first three grades classes, and if these problems different according to some variables teacher qualification, experience period, class grade). The study sample consist of (137 )

 female teachers who teach the first three grades in Braimy city in Oman, teachers spread in five government schools. Both researchers developed questionnaire to measure problems faced by the mentioned teachers, consist of 50 questions distributed into 4 dimensions (teacher, students, the curriculum, the evaluations), Also researchers checked questionnaire validity and stability. The results indicate to: The most common probl

       In this work, we prove that the triple linear partial differential equations (PDEs) of elliptic type (TLEPDEs) with a given classical continuous boundary control vector (CCBCVr) has a unique "state" solution vector (SSV)  by utilizing the Galerkin's method (GME). Also, we prove the existence of a classical continuous boundary optimal control vector (CCBOCVr) ruled by the TLEPDEs. We study the existence solution for the triple adjoint equations (TAJEs) related with the triple state equations (TSEs). The Fréchet derivative (FDe) for the objective function is derived. At the end we prove the necessary "conditions" theorem (NCTh) for optimality for the problem.

In this paper we find the exact solution of Burger's equation after reducing it to Bernoulli equation. We compare this solution with that given by Kaya where he used Adomian decomposition method, the solution given by chakrone where he used the Variation iteration method (VIM)and the solution given by Eq(5)in the paper of M. Javidi. We notice that our solution is better than their solutions.

     Optimization is the task of minimizing or maximizing an objective function f(x) parameterized by x. A series of effective numerical optimization methods have become popular for improving the performance and efficiency of other methods characterized by high-quality solutions and high convergence speed. In recent years, there are a lot of interest in hybrid metaheuristics, where more than one method is ideally combined into one new method that has the ability to solve many problems rapidly and efficiently. The basic concept of the proposed method is based on the addition of the acceleration part of the Gravity Search Algorithm (GSA) model in the Firefly Algorithm (FA) model and creating new individuals. Some stan