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.

A new modified differential evolution algorithm DE-BEA, is proposed to improve the reliability of the standard DE/current-to-rand/1/bin by implementing a new mutation scheme inspired by the bacterial evolutionary algorithm (BEA). The crossover and the selection schemes of the DE method are also modified to fit the new DE-BEA mechanism. The new scheme diversifies the population by applying to all the individuals a segment based scheme that generates multiple copies (clones) from each individual one-by-one and applies the BEA segment-wise mechanism. These new steps are embedded in the DE/current-to-rand/bin scheme. The performance of the new algorithm has been compared with several DE variants over eighteen benchmark functions including sever

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 CAⁿ = A*^ⁿ C (Aⁿ = 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.

      The modern systems that have been based upon the hash function are more suitable compared to the conventional systems; however, the complicated algorithms for the generation of the invertible functions have a high level of time consumption. With the use of the GAs, the key strength is enhanced, which results in ultimately making the entire algorithm sufficient. Initially, the process of the key generation is performed by using the results of n-queen problem that is solved by the genetic algorithm, with the use of a random number generator and through the application of the GA operations. Ultimately, the encryption of the data is performed with the use of the Modified Reverse Encryption Algorithm (MREA). It was noticed that the

      In this work, the performance of single-mode optical fibers (SMFs) for ultraviolet (UV) radiation monitoring and dosimetry applications is presented. In particular, this work will focus on the Radiation-Induced Absorption (RIA) phenomena in the Near-Infrared domain (NIR). Such phenomena play a very important role in the sensing mechanism for SMF. Single mode fibers with a diameter of 50 µm were used for this purpose. These fibers were dipped into germanium (Ge) solution with different concentrations (1, 3, and 5 wt%) to produce the sensing part of the sensor. For all optical fiber sensors under investigation, the results indicated the dependence of the RIA on the applied UV radiation energy. Also, a redshi

In this paper we introduce a new class of operators on Hilbert space. We
call the operators in this class, n,m- powers operators. We study this class
of operators and give some of their basic properties.

The possible effect of the collective motion in heavy nuclei has been investigated in the framework of Nilson model. This effect has been searched realistically by calculating the level density, which plays a significant role in the description of the reaction cross sections in the statistical nuclear theory. The nuclear level density parameter for some deformed radioisotopes of (even- even) target nuclei (Dy, W and Os) is calculated, by taking into consideration the collective motion for excitation modes for the observed nuclear spectra near the neutron binding energy. The method employed in the present work assumes equidistant spacing of the collective coupled state bands of the considered isotopes. The present calculated results for f

This paper proposes feedback linearization control (FBLC) based on function approximation technique (FAT) to regulate the vibrational motion of a smart thin plate considering the effect of axial stretching. The FBLC includes designing a nonlinear control law for the stabilization of the target dynamic system while the closedloop dynamics are linear with ensured stability. The objective of the FAT is to estimate the cubic nonlinear restoring force vector using the linear parameterization of weighting and orthogonal basis function matrices. Orthogonal Chebyshev polynomials are used as strong approximators for adaptive schemes. The proposed control architecture is applied to a thin plate with a large deflection that stimulates the axial loadin

Artificial fish swarm algorithm (AFSA) is one of the critical swarm intelligent algorithms. In this
paper, the authors decide to enhance AFSA via diversity operators (AFSA-DO). The diversity operators will
be producing more diverse solutions for AFSA to obtain reasonable resolutions. AFSA-DO has been used to
solve flexible job shop scheduling problems (FJSSP). However, the FJSSP is a significant problem in the
domain of optimization and operation research. Several research papers dealt with methods of solving this
issue, including forms of intelligence of the swarms. In this paper, a set of FJSSP target samples are tested
employing the improved algorithm to confirm its effectiveness and evaluate its ex

Background and Aim: due to the rapid growth of data communication and multimedia system applications, security becomes a critical issue in the communication and storage of images. This study aims to improve encryption and decryption for various types of images by decreasing time consumption and strengthening security. Methodology: An algorithm is proposed for encrypting images based on the Carlisle Adams and Stafford Tavares CAST block cipher algorithm with 3D and 2D logistic maps. A chaotic function that increases the randomness in the encrypted data and images, thereby breaking the relation sequence through the encryption procedure, is introduced. The time is decreased by using three secure and private S-Boxes rather than using si