The aim of this research is to study some types of fibrewise fuzzy topological spaces. The six major goals are explored in this thesis. The very first goal, introduce and study the notions types of fibrewise topological spaces, namely fibrewise fuzzy j-topological spaces, Also, we introduce the concepts of fibrewise j-closed fuzzy topological spaces, fibrewise j-open fuzzy topological spaces, fibrewise locally sliceable fuzzy j-topological spaces and fibrewise locally sectionable fuzzy j-topological spaces. Furthermore, we state and prove several Theorems concerning these concepts, where j={δ,θ,α,p,s,b,β} The second goal is to introduce weak and strong forms of fibrewise fuzzy ω-topological spaces, namely the fibrewise fuz

     The result involution graph of a finite group , denoted by  is an undirected simple graph whose vertex set is the whole group  and two distinct vertices are adjacent if their product is an involution element. In this paper, result involution graphs for all Mathieu groups and connectivity in the graph are studied. The diameter, radius and girth of this graph are also studied. Furthermore, several other graph properties are obtained.

Background: Inflammation of the brain parenchyma brought on by a virus is known as viral encephalitis. It coexists frequently with viral meningitis and is the most prevalent kind of encephalitis.

Objectives: To throw light on viral encephalitis, its types, epidemiology, symptoms and complications.

Results: Although it can affect people of all ages, viral infections are the most prevalent cause of viral encephalitis, which is typically seen in young children and old people. Arboviruses, rhabdoviruses, enteroviruses, herpesviruses, retroviruses, orthomyxoviruses, orthopneumoviruses, and coronaviruses are just a few of the viruses that have been known to cause encephalitis.

     The Syriac language is one of the ancient Semitic languages that appeared in the first century AD. It is currently used in a number of cities in Iraq, Turkey, and others. In this research paper, we tried to apply the work of  Ali and Mahmood 2020  on the letters and words in the Syriac language to find a new encoding for them and increase the possibility of reading the message by other people.

<p class="0abstract">The rapidly growing 3D content exchange over the internet makes securing 3D content became a very important issue. The solution for this issue is to encrypting data of 3D content, which included two main parts texture map and 3D models. The standard encryption methods such as AES and DES are not a suitable solution for 3D applications due to the structure of 3D content, which must maintain dimensionality and spatial stability. So, these problems are overcome by using chaotic maps in cryptography, which provide confusion and diffusion by providing uncorrelated numbers and randomness. Various works have been applied in the field of 3D content-encryption based on the chaotic system. This survey will attempt t

  The aim of this paper is to introduce a new type of proper mappings called semi-p-proper mapping by using semi-p-open sets, which is weaker than the proper mapping. Some properties and characterizations of this type of mappings are given.

The main objective of controlling companies Concentration is to prevent their potential anti-competitive effects on the competitive structure of the relevant market, in order to protect freedom of competition in it. In this context, it is necessary to verify that these operations do not impede effective competition or reduce it significantly by making it less than it was before, it is necessary to Anticipate all the effects In order to achieve the goal of controlling on it and revealing their potential restrictive effects. So there must be Auditing Norms that enable the authorities entrusted with the protection of competition and the prevention of monopolistic practices to evaluate these effects and determine their positive and negative as

in this paper the notion of threshold relations by using resemblance relation are introduced to get a similarity relation from a resemnblance relation R