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

Research summary

Perhaps the methods of mask that Arab poets resorted to in our time are due to the conditions of oppression and political and social repression that the Arab poet suffered from; So he strived to circumvent it, and it became a justification for hiding behind it. The research is available on a number of topics that lead to the definition of the mask technique and the beginning of its prevalence in Arabic literature after the Second World War, especially in recent decades by benefiting from historical stories, fairy tales and legends of all kinds. As well as defining the mask idiomatically and linguistically, and the beginning of its use in ancient religious rituals, and the special place it had in Greek plays. Poets

The way used to estimate the fuzzy reliability differs according to the nature of the information of failure time which has been dealt in this research.The information of failure times has no probable distribution to explain it , in addition it has fuzzy quality.The research includes fuzzy reliability estimation of three periods ,the first one from 1986 to 2013,the second one from 2013 to 2033 while the third one from 2033 to 2066 .Four failure time have been chosen to identify the membership function of fuzzy trapezoid represented in the pervious years after taking in consideration the estimation of most researchers, proffional    geologists and the technician who is incharge of maintaining of Mosul Dam project. B

Some problems want to be solved in image compression to make the process workable and more efficient. Much work had been done in the field of lossy image compression based on wavelet and Discrete Cosine Transform (DCT). In this paper, an efficient image compression scheme is proposed, based on a common encoding transform scheme; It consists of the following steps: 1) bi-orthogonal (tab 9/7) wavelet transform to split the image data into sub-bands, 2) DCT to de-correlate the data, 3) the combined transform stage's output is subjected to scalar quantization before being mapped to positive, 4) and LZW encoding to produce the compressed data. The peak signal-to-noise (PSNR), compression ratio (CR), and compression gain (CG) measures were used t

This research aims to reveal the quality standards available in press images published in the news sites, the Iraqi News Agency and Al-Mada Press for the period from: 1/9/2019, to: 30/9/2019. The research is a descriptive research, in which the researcher relied on the survey methodology to achieve its objectives. The research reached a number of results, most notably the weak role of photojournalists in the websites and the adoption of those the Internet as a source for obtaining press images published with news and reports through its pages, as well as the neglect of the standard Description/Comment below the press images, which plays an important function in explaining and interpreting them for users.

The segmentation of aerial images using different clustering techniques offers valuable insights into interpreting and analyzing such images. By partitioning the images into meaningful regions, clustering techniques help identify and differentiate various objects and areas of interest, facilitating various applications, including urban planning, environmental monitoring, and disaster management. This paper aims to segment color aerial images to provide a means of organizing and understanding the visual information contained within the image for various applications and research purposes. It is also important to look into and compare the basic workings of three popular clustering algorithms: K-Medoids, Fuzzy C-Mean (FCM), and Gaussia

Information hiding strategies have recently gained popularity in a variety of fields. Digital audio, video, and images are increasingly being labelled with distinct but undetectable marks that may contain a hidden copyright notice or serial number, or even directly help to prevent unauthorized duplication. This approach is extended to medical images by hiding secret information in them using the structure of a different file format. The hidden information may be related to the patient. In this paper, a method for hiding secret information in DICOM images is proposed based on Discrete Wavelet Transform (DWT). Firstly. segmented all slices of a 3D-image into a specific block size and collecting the host image depend on a generated key

This paper exclusively deals with medical encounters. . Structurally and thematically, it manifests itself in five parts. The First part deals with medical encounters as well as essential speech activities which cover (a) frames (certain types of talk) (b) the patient’s account and the patient’s story or more precisely the patient telling his story and (c) the act of questioning the patient. The Second part revolves round genre and register. The former, in most cases, suggests that the format of medical encounters is conversational. With register; we have a converse reality that restrictively tries to narrow things and give them a certain flavor. The Third part realizes the technicalities of medical encounters (a) the setting of an inte

In this paper, a compression system with high synthetic architect is introduced, it is based on wavelet transform, polynomial representation and quadtree coding. The bio-orthogonal (tap 9/7) wavelet transform is used to decompose the image signal, and 2D polynomial representation is utilized to prune the existing high scale variation of image signal. Quantization with quadtree coding are followed by shift coding are applied to compress the detail band and the residue part of approximation subband. The test results indicate that the introduced system is simple and fast and it leads to better compression gain in comparison with the case of using first order polynomial approximation.