In this paper, we deal with games of fuzzy payoffs problem while there is uncertainty in data. We use the trapezoidal membership function to transform the data into fuzzy numbers and utilize the three different ranking function algorithms. Then we compare between these three ranking algorithms by using trapezoidal fuzzy numbers for the decision maker to get the best gains

An advertisement is a form of communication intended to promote the sale of a product or service, influence public opinion, gain political support, or to elicit some other response. It consists of various type, including style, target audience, geographic scope, medium, or purpose. An advertisement should catch a person's attention and quickly create a memorable impression. The main aim of the present paper is to investigate the phonological problems of translating English international TV advertisements into Arabic. It deals with the most common and popular TV advertisements. The importance of such advertisements lies not in its information content rather than in the achievement of the desired impact on the receivers. When translating such

The purpose of this paper is to solve the stochastic demand for the unbalanced transport problem using heuristic algorithms to obtain the optimum solution, by minimizing the costs of transporting the gasoline product for the Oil Products Distribution Company of the Iraqi Ministry of Oil. The most important conclusions that were reached are the results prove the possibility of solving the random transportation problem when the demand is uncertain by the stochastic programming model. The most obvious finding to emerge from this work is that the genetic algorithm was able to address the problems of unbalanced transport, And the possibility of applying the model approved by the oil products distribution company in the Iraqi Ministry of Oil to m

Let G be a graph, each edge e of which is given a weight w(e). The shortest path problem is a path of minimum weight connecting two specified vertices a and b, and from it we have a pre-topology. Furthermore, we study the restriction and separators in pre-topology generated by the shortest path problems. Finally, we study the rate of liaison in pre-topology between two subgraphs. It is formally shown that the new distance measure is a metric

• The problem of infertility considers one of the chronic problem a which faced the
  individual & families equally . This problem causes a negative effects in psychological ,
  social and development fields. The infertility contributes in weakening the human
  development, when the human development has become as a centre point which centered
  about individual preparing , rehabilitation, training and knowledge toreach to the required
  excellence.
  We think that , the infertility destroys the socially development; therefore the socially and
  scientific institutions are working hard to find successful solution to resolve the problem
  infertility through sophisticated and scientific methods. This problem

DBN Rashid, IMPAT: International Journal of Research in Humanities, Arts, and Literature, 2016 - Cited by 5

Among a variety of approaches introduced in the literature to establish duality theory, Fenchel duality was of great importance in convex analysis and optimization. In this paper we establish some conditions to obtain classical strong Fenchel duality for evenly convex optimization problems defined in infinite dimensional spaces. The objective function of the primal problem is a family of (possible) infinite even convex functions. The strong duality conditions we present are based on the consideration of the epigraphs of the c-conjugate of the dual objective functions and the ε-c-subdifferential of the primal objective functions.

It is well- known that the distinguished scholastic journal is a crucial cornerstone, which contributes to the scientific integrity of a particular academic institution. The establishment of the Al-Kindy College of Medicine (AKCM), University of Baghdad, in 1998 urged the need to issue Al-Kindy College Medical Journal (KCMJ).

In this paper, a fast lossless image compression method is introduced for compressing medical images, it is based on splitting the image blocks according to its nature along with using the polynomial approximation to decompose image signal followed by applying run length coding on the residue part of the image, which represents the error caused by applying polynomial approximation. Then, Huffman coding is applied as a last stage to encode the polynomial coefficients and run length coding. The test results indicate that the suggested method can lead to promising performance.