Hiding technique for dynamic encryption text using encoding table and symmetric encryption method (AES algorithm) is presented in this paper. The encoding table is generated dynamically from MSB of the cover image points that used as the first phase of encryption. The Harris corner point algorithm is applied on cover image to generate the corner points which are used to generate dynamic AES key to second phase of text encryption. The embedded process in the LSB for the image pixels except the Harris corner points for more robust. Experimental results have demonstrated that the proposed scheme have embedding quality, error-free text recovery, and high value in PSNR.
The present work includes the preparation and characterization of{Co(II) , Ni(II), Pd(II), Fe(III) , Ru(III),Rh(III), Os(III) , Ir(III) , Pt(IV) and VO(IV)}complexes of a new ligand 4-[(1-phenyl-2,3-dimethyl-3-pyrozoline-5-one)azo]-N,N-dimethylanline (PAD). The product (PAD) was isolated,studies and characterized by phsical measurements,i.e., (FT-IR), (UV) Spectroscopy and elemental analysis(C.H.N). The prepared complexes were identified and their structural geometric were suggested in solid state by using flame atomic absorption, elemental analysis(C.H.N), (FT-IR) and (UV-Vis) Spectroscopy, as well as magnetic susceptibility and conductivity measurements . The study of the nature of the complexes formed in( ethanolic solution) following t
... Show MoreSome metal ions (Mn
+2
, Fe
+2
,Co
+2
,Ni
+2
,Cu
+2
, Cd
+2
and Hg
+2
) complexes of N-acetyl
Tryptophan( AcetrpH) and (2, 2′-bipyridine) (2, 2′-Bipy)have been synthesized and then
characterized on the basis of their FT-IR, UV-Vis spectroscopy, magneticsuscptibity
conductivity measurements and atomic absorption;from the results obtained and the propsed
molecular structure for these complexes as octahedral geometry,the following general formula
has been given for the prepared complexes.
[M
+n
(Acetrp)2(2, 2′-Bipy)].
Where M= Mn
+2
, Fe
+2
,Co
+2
,Ni
+2
,Cu
+2
, Cd
+2
,Hg
+2
(Acetrp)
-=Ligand ion(N-acetyl
A space X is named a πp – normal if for each closed set F and each π – closed set F’ in X with F ∩ F’ = ∅, there are p – open sets U and V of X with U ∩ V = ∅ whereas F ⊆ U and F’ ⊆ V. Our work studies and discusses a new kind of normality in generalized topological spaces. We define ϑπp – normal, ϑ–mildly normal, & ϑ–almost normal, ϑp– normal, & ϑ–mildly p–normal, & ϑ–almost p-normal and ϑπ-normal space, and we discuss some of their properties.
In this work the concept of semi-generalized regular topological space was introduced and studied via semi generalized open sets. Many properties and results was investigated and studied, also it was shown that the quotient space of semi-generalized regular topological space is not, in general semi-generalizedspace.
By use the notions pre-g-closedness and pre-g-openness we have generalized a class of separation axioms in topological spaces. In particular, we presented in this paper new types of regulαrities, which we named ρgregulαrity and Sρgregulαrity. Many results and properties of both types have been investigated and have illustrated by examples.
The main purpose of this paper, is to introduce a topological space , which is induced by reflexive graph and tolerance graph , such that may be infinite. Furthermore, we offered some properties of such as connectedness, compactness, Lindelöf and separate properties. We also study the concept of approximation spaces and get the sufficient and necessary condition that topological space is approximation spaces.
The primary objective of this paper, is to introduce eight types of topologies on a finite digraphs and state the implication between these topologies. Also we used supra open digraphs to introduce a new types for approximation rough digraphs.
In this thesis, we introduce eight types of topologies on a finite digraphs and state the implication between these topologies. Also we studied some pawlak's concepts and generalization rough set theory, we introduce a new types for approximation rough digraphs depending on supra open digraphs. In addition, we present two various standpoints to define generalized membership relations, and state the implication between it, to classify the digraphs and help for measure exactness and roughness of digraphs. On the other hand, we define several kinds of fuzzy digraphs. We also introduce a topological space, which is induced by reflexive graph and tolerance graphs, such that the graph may be infinite. Furthermore, we offered some properties of th
... Show More