Arabic calligraphy has great importance in the printing designs that are often on the written character-based to perform functional goals and to achieve some of the aesthetic values ​​in design work, has led major developments in the field of computer manufacturing and design software for the design and layout to increase to deal with the programmed character for the purposes of typesetting has confronted this Find the Arab character programmed for the purposes of typesetting for the detection of the most important design interventions that underwent the Arabic letter written to turn it into a programmed image intended for the purposes of the printing and typesetting has been addressed in the context of which the theoretical types of

One of the most important methodologies in operations research (OR) is the linear programming problem (LPP). Many real-world problems can be turned into linear programming models (LPM), making this model an essential tool for today's financial, hotel, and industrial applications, among others. Fuzzy linear programming (FLP) issues are important in fuzzy modeling because they can express uncertainty in the real world. There are several ways to tackle fuzzy linear programming problems now available. An efficient method for FLP has been proposed in this research to find the best answer. This method is simple in structure and is based on crisp linear programming. To solve the fuzzy linear programming problem (FLPP), a new ranking function (R

The purpose of this paper is to introduce and study the concepts of fuzzy generalized open sets, fuzzy generalized closed sets, generalized continuous fuzzy proper functions and prove results about these concepts.

The traveling salesman problem (TSP) is a well-known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. In this paper we exploit the TSP to evaluate the minimum total cost (distance or time) for Iraqi cities. So two main methods are investigated to solve this problem; these methods are; Dynamic Programming (DP) and Branch and Bound Technique (BABT). For the BABT, more than one lower and upper bounds are be derived to gain the best one. The results of BABT are completely identical to DP, with less time for number of cities (n), 5 ≤ n ≤ 25. These results proof the efficiency of BABT compared with so

0

This research is concerned with the study of (the aesthetic of constructive relations in linear composition) with what distinguished Arabic calligraphy through the style and artistic method in its construction, and the specifications it carries that enabled it to pay attention to building formations to achieve in its total linear ranges aesthetic values and relationships. Through the research, the models and the exploratory study that he obtained, the researcher was able to raise the research problem in the first chapter according to the following question: What is the aesthetic of constructive relations in linear formation?
The importance of the research in achieving the aesthetics of the formations, which is a wide field according t

  In this paper we shall generalize fifth explicit Runge-Kutta Feldberg(ERKF(5)) and Continuous explicit Runge-Kutta (CERK) method using shooting method to solve second order boundary value problem  which can be reduced to order one.These methods we shall call them as shooting Continuous Explicit Runge-Kutta method, the results are computed using matlab program.

            In this paper, the Normality set  will be investigated. Then, the study highlights some concepts properties and important results. In addition, it will prove that every operator with normality set has non trivial invariant subspace of  .

Artificial fish swarm algorithm (AFSA) is one of the critical swarm intelligent algorithms. In this
paper, the authors decide to enhance AFSA via diversity operators (AFSA-DO). The diversity operators will
be producing more diverse solutions for AFSA to obtain reasonable resolutions. AFSA-DO has been used to
solve flexible job shop scheduling problems (FJSSP). However, the FJSSP is a significant problem in the
domain of optimization and operation research. Several research papers dealt with methods of solving this
issue, including forms of intelligence of the swarms. In this paper, a set of FJSSP target samples are tested
employing the improved algorithm to confirm its effectiveness and evaluate its ex