In this paper, we present a concept of nC- symmetric operator as follows: Let A be a bounded linear operator on separable complex Hilbert space , the operator A is said to be nC-symmetric if there exists a positive number n (n such that CAn = A*ⁿ C (An = C A*ⁿ C). We provide an example and study the basic properties of this class of operators. Finally, we attempt to describe the relation between nC-symmetric operator and some other operators such as Fredholm and self-adjoint operators.
Let be an infinite dimensional separable complex Hilbert space and let , where is the Banach algebra of all bounded linear operators on . In this paper we prove the following results. If is a operator, then 1. is a hypercyclic operator if and only if D and for every hyperinvariant subspace of . 2. If is a pure, then is a countably hypercyclic operator if and only if and for every hyperinvariant subspace of . 3. has a bounded set with dense orbit if and only if for every hyperinvariant subspace of , .
Wireless sensor network (WSN) security is an important component for protecting data from an attacker. For improving security, cryptography technologies are divided into two kinds: symmetric and asymmetric. Therefore, the implementation of protocols for generating a secret key takes a long time in comparison to the sensor’s limitations, which decrease network throughput because they are based on an asymmetric method. The asymmetric algorithms are complex and decrease network throughput. In this paper, an encryption symmetric secret key in wireless sensor networks (WSN) is proposed. In this work, 24 experiments are proposed, which are encryption using the AES algorithm in the cases of 1 key, 10 keys, 25 keys, and 50 keys. I
... Show MoreThe principal goal guiding any designed encryption algorithm must be security against unauthorized attackers. Within the last decade, there has been a vast increase in the communication of digital computer data in both the private and public sectors. Much of this information has a significant value; therefore it does require the protection by design strength algorithm to cipher it. This algorithm defines the mathematical steps required to transform data into a cryptographic cipher and also to transform the cipher back to the original form. The Performance and security level is the main characteristics that differentiate one encryption algorithm from another. In this paper suggested a new technique to enhance the performance of the Data E
... Show MoreThroughout this paper we study the properties of the composition operator
C
p1 o
p2 o…o
pn induced by the composition of finite numbers of special
automorphisms of U,
pi (z) i
i
p z
1 p z
Such that pi U, i 1, 2, …, n, and discuss the relation between the product of
finite numbers of automorphic composition operators on Hardy space H2 and some
classes of operators.
A complex number is called an extended eigenvalue for an operator on a Hilbert space H if there exists a nonzero operator such that: such is called an extended eigenoperator corresponding to. The goal of this paper is to calculate extended eigenvalues and extended eigenoperators for the weighted unilateral (Forward and Backward) shift operators. We also find an extended eigenvalues for weighted bilateral shift operator. Moreover, the closedness of extended eigenvalues for the weighted unilateral (Forward and Backward) shift operators under multiplication is proven.
Recently, in 2014 [1] the authors introduced a general family of summation integral Baskakov-type operators ( ) . In this paper, we investigate approximation properties of partial sums for this general family.
In this paper we offer two new subclasses of an open unit disk of r-fold symmetric bi-univalent functions. The Taylor-Maclaurin coefficients have their coefficient bounds calculated. Furthermore, for functions in , we have solved Fekete- functional issues. For the applicable classes, there are also a few particular special motivator results.
Steganography is defined as hiding confidential information in some other chosen media without leaving any clear evidence of changing the media's features. Most traditional hiding methods hide the message directly in the covered media like (text, image, audio, and video). Some hiding techniques leave a negative effect on the cover image, so sometimes the change in the carrier medium can be detected by human and machine. The purpose of suggesting hiding information is to make this change undetectable. The current research focuses on using complex method to prevent the detection of hiding information by human and machine based on spiral search method, the Structural Similarity Index Metrics measures are used to get the accuracy and quality
... Show More