In this paper, some relations between the flows and the Enveloping Semi-group were studied. It allows to associate some properties on the topological compactification to any pointed flows. These relations enable us to study a number of the properties of the principles of flows corresponding with using algebric properties. Also in this paper proofs to some theorems of these relations are given.

Throughout this paper S will be denote a monoids with zero. In this paper, we introduce the concept of En- prime subact, where a proper subact B of a right S- act As is called En- prime subact if for any endomorphism f of As and a As with f(a)S⊆ Bimplies that either a B or f(As) ⊆ B. The right S-act As is called En-prime if the zero subact of As is En-prime subact. Some various properties of En-prime subact are considered, and also we study some relationships between En-prime subact and some other concepts such as prime subact and maximal subact. 

In this paper, a new idea to configure a special graph from the discrete topological space is given. Several properties and bounds of this topological graph are introduced. Such that if the order of the non-empty set equals two, then the topological graph is isomorphic to the complete graph. If the order equals three, then the topological graph is isomorphic to the complement of the cycle graph. Our topological graph has  complete induced subgraphs with order  or more. It also has a cycle subgraph. In addition, the clique number is obtained. The topological graph is proved simple, undirected, connected graph. It has no pendant vertex, no isolated vertex and no cut vertex. The minimum and maximum degrees are evaluated. So , the radius 

Our active aim in this paper is to prove the following Let Ŕ be a ring having an
idempotent element e(e  0,e 1) . Suppose that R is a subring of Ŕ which
satisfies:
(i) eR  R and Re  R .
(ii) xR  0 implies x  0 .
(iii ) eRx  0 implies x  0( and hence Rx  0 implies x  0) .
(iv) exeR(1 e)  0 implies exe  0 .
If D is a derivable map of R satisfying D(R )  R ;i, j 1,2. ij ij Then D is
additive. This extend Daif's result to the case R need not contain any non-zero
idempotent element.

The main objective of this study is to describe the preparation of topographic maps using the Surfer software. A total of 159 regularly distributed Ground Control Points (GCPs) were collected with the use of the Differential Global Positioning System (DGPS). Seven methods (Contour Map, Post Map, 3D Surface Map, 3D Wireframe Maps, Grid Vector-1 Map, Color Relief Map, and Shaded Relief Maps) at the Surfer environment were used to prepare the topographic maps at the Mukhtar Village near the Al-Fallujah City. Contour lines with other features were superimposed on the DEM layer, which refers to the topography of the terrain inside this study area. The accuracy of the database's results was estimated, essential maps were given, and the re

Let
be a dynamical system,
is said to be topological transitive if for every pair of non-empty open set
, there exists
such that
. We introduce and investigate a new definition of topological transitive by using the nation N-open subset and we called N-transitive and prove the equivalent definitions of this new definition.

      Nowadays, 3D content is becoming an essential part of multimedia applications, when the 3D content is not protected, hackers may attack and steal it. This paper introduces a proposed scheme that provides high protection for 3D content by implementing multiple levels of security with preserving the original size using weight factor (w). First level of security is implemented by encrypting the texture map based on a 2D Logistic chaotic map. Second level is implemented by shuffling vertices (confusion) based on a 1D Tent chaotic map. Third level is implemented by modifying the vertices values (diffusion) based on a 3D Lorenz chaotic map. Results illustrate that the proposed scheme is completely deform the entire 3D content accord

  With the fast progress of information technology and the computer networks, it becomes very easy to reproduce and share the geospatial data due to its digital styles. Therefore, the usage of geospatial data suffers from various problems such as data authentication, ownership proffering, and illegal copying ,etc. These problems can represent the big challenge to future uses of the geospatial data. This paper introduces a new watermarking scheme to ensure the copyright protection of the digital vector map. The main idea of proposed scheme is based on transforming  the digital map to frequently domain using the Singular Value Decomposition (SVD) in order to determine suitable areas to insert the watermark data.

Encryption of data is translating data to another shape or symbol which enables people only with an access to the secret key or a password that can read it. The data which are encrypted are generally referred to as cipher text, while data which are unencrypted are known plain text. Entropy can be used as a measure which gives the number of bits that are needed for coding the data of an image. As the values of pixel within an image are dispensed through further gray-levels, the entropy increases. The aim of this research is to compare between CAST-128 with proposed adaptive key and RSA encryption methods for video frames to determine the more accurate method with highest entropy. The first method is achieved by applying the "CAST-128" and

An adaptive fuzzy weighted linear regression model in which the output is based
on the position and entropy of quadruple fuzzy numbers had dealt with. The solution
of the adaptive models is established in terms of the iterative fuzzy least squares by
introducing a new suitable metric which takes into account the types of the influence
of different imprecisions. Furthermore, the applicability of the model is made by
attempting to estimate the fuzzy infant mortality rate in Iraq using a selective set of
inputs.