Cloud computing is a newly developed concept that aims to provide computing resources in the most effective and economical manner. The fundamental idea of cloud computing is to share computing resources among a user group. Cloud computing security is a collection of control-based techniques and strategies that intends to comply with regulatory compliance rules and protect cloud computing-related information, data apps, and infrastructure. On the other hand, data integrity is a guarantee that the digital data are not corrupted, and that only those authorized people can access or modify them (i.e., maintain data consistency, accuracy, and confidence). This review presents an overview of cloud computing concepts, its importance in many applications, and tools that can be used for providing the integrity and security to the data located in the cloud environment.
Transport is a problem and one of the most important mathematical methods that help in making the right decision for the transfer of goods from sources of supply to demand centers and the lowest possible costs, In this research, the mathematical model of the three-dimensional transport problem in which the transport of goods is not homogeneous was constructed. The simplex programming method was used to solve the problem of transporting the three food products (rice, oil, paste) from warehouses to the student areas in Baghdad, This model proved its efficiency in reducing the total transport costs of the three products. After the model was solved in (Winqsb) program, the results showed that the total cost of transportation is (269,
... Show MoreThis research investigates new glasses which are best suitable for design of optical systems
working in the infrared region between 1.01 to 2.3μm. This work is extended to Oliva & Gennari
(1995,1998) research in which they found that the best known achromatic pairs are (BAF2-IRG2; SRF2-
IRG3; BAF2-IRG7; CAF2-IRGN6; BAF2-SF56A and BAF2-SF6). Schott will most probably stop the
production of these very little used and commercially uninteresting IRG glasses. In this work equally
good performances can be obtained by coupling BAF2, SRF2&CAF2 with standard glasses from Schott
or Ohara Company. The best new achromatic pairs found are (SRF2-S-TIH10; CAF2-S-LAL9; CAF2-SLAL13
and CAF2-S-BAH27). These new achromatic pai
The oyster ??????? (planned) (Pallas) of lesions that have entered Iraq recently became spyware severe damage in more than a station from power plants in Iraq, including the power plant in Mussayab Vamahar accumulates in pipes cooling and disrupts their work Vtafrtf heat systems cooling and thereby determiningefficiency and lead to added cost many cleaning or replacement of damaged parts
Graph is a tool that can be used to simplify and solve network problems. Domination is a typical network problem that graph theory is well suited for. A subset of nodes in any network is called dominating if every node is contained in this subset, or is connected to a node in it via an edge. Because of the importance of domination in different areas, variant types of domination have been introduced according to the purpose they are used for. In this paper, two domination parameters the first is the restrained and the second is secure domination have been chosn. The secure domination, and some types of restrained domination in one type of trees is called complete ary tree are determined.
In this research, we introduce and study the concept of fibrewise bitopological spaces. We generalize some fundamental results from fibrewise topology into fibrewise bitopological space. We also introduce the concepts of fibrewise closed bitopological spaces,(resp., open, locally sliceable and locally sectionable). We state and prove several propositions concerning with these concepts. On the other hand, we extend separation axioms of ordinary bitopology into fibrewise setting. The separation axioms we extend are called fibrewise pairwise T_0 spaces, fibrewise pairwise T_1 spaces, fibrewise pairwise R_0 spaces, fibrewise pairwise Hausdorff spaces, fibrewise pairwise functionally Hausdorff spaces, fibrewise pairwise regular spaces, fibrewise
... Show MoreThe bandwidth requirements of telecommunication network users increased rapidly during the last decades. Optical access technologies must provide the bandwidth demand for each user. The passive optical access networks (PONs) support a maximum data rate of 100 Gbps by using the Orthogonal Frequency Division Multiplexing (OFDM) technique in the optical access network. In this paper, the optical broadband access networks with many techniques from Time Division Multiplexing Passive Optical Networks (TDM PON) to Orthogonal Frequency Division Multiplex Passive Optical Networks (OFDM PON) are presented. The architectures, advantages, disadvantages, and main parameters of these optical access networks are discussed and reported which have many ad
... Show MoreThis article investigates Iraq wars presentation in literature and media. The first section investigates the case of the returnees from the war and their experience, their trauma and final presentation of that experience. The article also investigates how trauma and fear is depicted to create an optimized image and state of fear that could in turn show Iraqi society as a traumatized society. Critics such as Suzie Grogan believes that the concept of trauma could expand to influence societies rather than one individual after exposure to trauma of being involved in wars and different major conflicts. This is reflected in Iraq as a country that was subjected to six comprehensive conflicts in its recent history, i.e. less than half a century; th
... Show MoreThis paper introduces a relationship between the independence of polynomials associated with the links of the network, and the Jacobian determinant of these polynomials. Also, it presents a way to simplify a given communication network through an algorithm that splits the network into subnets and reintegrates them into a network that is a general representation or model of the studied network. This model is also represented through a combination of polynomial equations and uses Groebner bases to reach a new simplified network equivalent to the given network, which may make studying the ability to solve the problem of network coding less expensive and much easier.
Let be a ring. Given two positive integers and , an module is said to be -presented, if there is an exact sequence of -modules with is -generated. A submodule of a right -module is said to be -pure in , if for every -Presented left -module the canonical map is a monomorphism. An -module has the -pure intersection property if the intersection of any two -pure submodules is again -pure. In this paper we give some characterizations, theorems and properties of modules with the -pure intersection property.