The new type of paranormal operators that have been defined in this study on the Hilbert space, is paranormal operators. In this paper we introduce and discuss some properties of this concept such as: the sum and product of two paranormal, the power of paranormal. Further, the relationships between the paranormal operators and other kinds of paranormal operators have been studied.
This paper is concerned with introducing and studying the first new approximation operators using mixed degree system and second new approximation operators using mixed degree system which are the core concept in this paper. In addition, the approximations of graphs using the operators first lower and first upper are accurate then the approximations obtained by using the operators second lower and second upper sincefirst accuracy less then second accuracy. For this reason, we study in detail the properties of second lower and second upper in this paper. Furthermore, we summarize the results for the properties of approximation operators second lower and second upper when the graph G is arbitrary, serial 1, serial 2, reflexive, symmetric, tra
... Show MoreThe reliability of optical sources is strongly dependent on the degradation and device characteristics are critically dependent on temperature. The degradation behaviours and reliability test results for the laser diode device (Sony-DL3148-025) will be presented .These devices are usually highly reliable. The degradation behaviour was exhibited in several aging tests, and device lifetimes were then estimated. The temperature dependence of 0.63?m lasers was studied. An aging test with constant light power operation of 5mW was carried out at 10, 25, 50 and 70°C for 100hours. Lifetimes of the optical sources have greatly improved, and these optical sources can be applied to various types of transmission systems. Within this degradation range,
... Show MoreLet
Multiplicative inverse in GF (2 m ) is a complex step in some important application such as Elliptic Curve Cryptography (ECC) and other applications. It operates by multiplying and squaring operation depending on the number of bits (m) in the field GF (2 m ). In this paper, a fast method is suggested to find inversion in GF (2 m ) using FPGA by reducing the number of multiplication operations in the Fermat's Theorem and transferring the squaring into a fast method to find exponentiation to (2 k ). In the proposed algorithm, the multiplicative inverse in GF(2 m ) is achieved by number of multiplications depending on log 2 (m) and each exponentiation is operates in a single clock cycle by generating a reduction matrix for high power of two ex
... Show MoreIn this paper, we investigate prime near – rings with two sided α-n-derivations
satisfying certain differential identities. Consequently, some well-known results
have been generalized. Moreover, an example proving the necessity of the primness
hypothesis is given.
The main purpose of this work is to introduce the concept of higher N-derivation and study this concept into 2-torsion free prime ring we proved that:Let R be a prime ring of char. 2, U be a Jordan ideal of R and be a higher N-derivation of R, then , for all u U , r R , n N .
Necessary and sufficient conditions for the operator equation I AXAX n  ï€* , to have a real positive definite solution X are given. Based on these conditions, some properties of the operator A as well as relation between the solutions X andAare given.
In this paper the centralizing and commuting concerning skew left -derivations and skew left -derivations associated with antiautomorphism on prime and semiprime rings were studied and the commutativity of Lie ideal under certain conditions were proved.
Suppose that is a finite group and is a non-empty subset of such that and . Suppose that is the Cayley graph whose vertices are all elements of and two vertices and are adjacent if and only if . In this paper, we introduce the generalized Cayley graph denoted by that is a graph with vertex set consists of all column matrices which all components are in and two vertices and are adjacent if and only if , where is a column matrix that each entry is the inverse of similar entry of and is matrix with all entries in , is the transpose of and . In this paper, we clarify some basic properties of the new graph and assign the structure of when is complete graph , complete bipartite graph and complete
... Show More