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.
New compounds containing heterocyclic units have been synthesized. These compounds include 2-amino 5- phenyl-1,3,4-thiadiazole (1) as starting material to prepare the Schiff bases 2N[3-nitrobenzylidene -2 hydroxy benzylidene and 4-N,N-dimethyl aminobenzylidene] -5-phenyl-1,3,4-thiadiazole (2abc) , 2N[3-nitrophenyl, 2-hydroxyphenyl or 4-N,N-dimethylaminophenyl] 3-]2-amino-5-phenyl-1,3,4-thiadiazole]-2,3-dihydro-[1,3]oxazepine-benzo-4,7-dione] (3abc), 2N[3-nitrophenyl,2-hydroxyphenyl,4-N,N-dimethylaminophenyl]-3-[2-amino-5-phenyl-1,3,4-thiadiazole-2-yl]-2,3-dihydro-[1,3]oxazepine-4,7-dione[(4abc), 2-N-[3-nitrophenyl, 2-hydroxyphenyl or 4-N,N-dimethylaminophenyl]-3-[2-amino-5-phenyl-1,3,4-thiadiazole-2yl]-1,2,3-trihydro-benzo-[1,2-e][1,3] diaz
... Show Morein this article, we present a definition of k-generalized map independent of non-expansive map and give infinite families of non-expansive and k-generalized maps new iterative algorithms. Such algorithms are also studied in the Hilbert spaces as the potential to exist for asymptotic common fixed point.
Clinical keratoconus (KCN) detection is a challenging and time-consuming task. In the diagnosis process, ophthalmologists must revise demographic and clinical ophthalmic examinations. The latter include slit-lamb, corneal topographic maps, and Pentacam indices (PI). We propose an Ensemble of Deep Transfer Learning (EDTL) based on corneal topographic maps. We consider four pretrained networks, SqueezeNet (SqN), AlexNet (AN), ShuffleNet (SfN), and MobileNet-v2 (MN), and fine-tune them on a dataset of KCN and normal cases, each including four topographic maps. We also consider a PI classifier. Then, our EDTL method combines the output probabilities of each of the five classifiers to obtain a decision b
Sensitive information of any multimedia must be encrypted before transmission. The dual chaotic algorithm is a good option to encrypt sensitive information by using different parameters and different initial conditions for two chaotic maps. A dual chaotic framework creates a complex chaotic trajectory to prevent the illegal use of information from eavesdroppers. Limited precisions of a single chaotic map cause a degradation in the dynamical behavior of the communication system. To overcome this degradation issue in, a novel form of dual chaos map algorithm is analyzed. To maintain the stability of the dynamical system, the Lyapunov Exponent (LE) is determined for the single and dual maps. In this paper, the LE of the single and dual maps
... Show MoreThis paper develops the work of Mary Florence et.al. on centralizer of semiprime semirings and presents reverse centralizer of semirings with several propositions and lemmas. Also introduces the notion of dependent element and free actions on semirings with some results of free action of centralizer and reverse centralizer on semiprime semirings and some another mappings.
Number theorists believe that primes play a central role in Number theory and that solving problems related to primes could lead to the resolution of many other unsolved conjectures, including the prime k-tuples conjecture. This paper aims to demonstrate the existence of this conjecture for admissible k-tuples in a positive proportion. The authors achieved this by refining the methods of “Goldston, Pintz and Yildirim” and “James Maynard” for studying bounded gaps between primes and prime k-tuples. These refinements enabled to overcome the previous limitations and restrictions and to show that for a positive proportion of admissible k-tuples, there is the existence of the prime k-tuples conjecture holding for each “k”. The sig
... Show MoreThe focus of this article, reviewed a generalized of contraction mapping and nonexpansive maps and recall some theorems about the existence and uniqueness of common fixed point and coincidence fixed-point for such maps under some conditions. Moreover, some schemes of different types as one-step schemes ,two-step schemes and three step schemes (Mann scheme algorithm, Ishukawa scheme algorithm, noor scheme algorithm, .scheme algorithm, scheme algorithm Modified scheme algorithm arahan scheme algorithm and others. The convergence of these schemes has been studied .On the other hands, We also reviewed the convergence, valence and stability theories of different types of near-plots in convex metric space.
This research aims to shed light on the geography of Shatt Al-Gharraf, one of the main branches of the Tigris River south of the sedimentary plain, where the changes exposed by this Shatt (river) were followed by a set of old and modern maps, which date back to the years(3000 BC, 1771 AD, 1810 AD, 1944 AD, 1959 AD, 2009 AD, 2017 AD).Through this research, Shatt al-Gharrafwas found to be an integrated river in terms of the geomorphological phenomena of the rivers (river meanders, river islands, marshes, and estuary). Besides, it was exposed to several changes especially itsdownstream in the Euphrates. It was previously flowing into the Euphrates but due to a number of factors such as the shortage of water in the Tigris River in recent yea
... Show More