Strong and ∆-convergence for a two-step iteration process utilizing asymptotically nonexpansive and total asymptotically nonexpansive noneslf mappings in the CAT(0) spaces have been studied. As well, several strong convergence theorems under semi-compact and condition (M) have been proved. Our results improve and extend numerous familiar results from the existing literature.
يهدف البحث إلى تحضير سلسلة جديدة من معقدات العناصر الانتقالية ثنائية التكافؤ (الكوبلت, النيكل, النحاس, الخارصين ,الكادميوم والزئبق) مع المركبات الحلقية غير المتجانسة (L1) و(L2) والمشتقة من تفاعل 2,1- فينيلين ثنائي امين وسايكلوهكسان -2,1-ثنائي امين مع المركب الوسطي (Pr) على التوالي. شخصت المعقدات ذات الصيغة العامة :- [M(L1or L2)Cl2] بواسطة طيف الرنين النووي المغناطيسي البروتوني والكربوني وقيا
... Show MoreThe challenges facing today's multi-customer and this is due to the multiplicity of products and speed in launching new products so search came to reveal the reveal the of the new product classification standards through a relationship (good products, low interest products, useful products and products desired) and the customer emotionally blackmail through deportation (fear, obligation and guilt). dentified the problem of the research in several questions focused on the nature of the relationship between the variables of research, and for that outline supposedly to search it expresses the head of one hypothesis and branched out of which four hypotheses subset, but in order to ensure the validity of the ass
... Show MorePhenoxathiin was prepared by the reaction of diphenyl ether with sulfur in the presence of anhydrous aluminum chloride. This work comprised the synthesis of new phenoxathiin derivatives containing heterocyclic moieties. These heterocyclic compounds were synthesized in three groups. The first group was made up of 2-(oxoalken-1-yl) phenoxathiin derivatives (3a-3j) obtained from the reaction of 2-acetylphenoxathiin with different aromatic aldehyde in the presence of sodium hydroxide. The other two groups involved compounds produced from the reaction of (3a-3j) with hydrazine hydrate in acetic acid to get 2-(1-acetyl pyrazolin-3-yl) phenoxathiin derivatives (4a-4j), and phenyl hydrazine in the presence of piperidine to afford 2-(1-phenyl pyrazo
... Show MoreSimplification of new fashion design methods
In this work, we introduce a new kind of perfect mappings, namely j-perfect mappings and j-ω-perfect mappings. Furthermore we devoted to study the relationship between j-perfect mappings and j-ω-perfect mappings. Finally, certain theorems and characterization concerning these concepts are studied; j = , δ, α, pre, b, β
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.
A new technique for embedding image data into another BMP image data is presented. The image data to be embedded is referred to as signature image, while the image into which the signature image is embedded is referred as host image. The host and the signature images are first partitioned into 8x8 blocks, discrete cosine transformed “DCT”, only significant coefficients are retained, the retained coefficients then inserted in the transformed block in a forward and backward zigzag scan direction. The result then inversely transformed and presented as a BMP image file. The peak signal-to-noise ratio (PSNR) is exploited to evaluate the objective visual quality of the host image compared with the original image.
Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph Kn, Complete bipartite graph Km,n and Complete tripartite graph Kl,m,n. It has also been studied how the lucky number changes whi
... Show MoreMany of the elementary transformations of determinants which are used in their evaluation and in the solution of linear equations may by expressed in the notation of matrices. In this paper, some new interesting formulas of special matrices are introduced and proved that the determinants of these special matrices have the values zero. All formulation has been coded in MATLAB 7.