Normal Operators Similar to Irreducible Operators

A complete characterization of normal operators which are similar to irreducible operators and some related results are given.

Dombi-Normalized Weighted Bonferroni Mean Operators with Novel Multiple-Valued Complex Neutrosophic Uncertain Linguistic Sets and Their Application in Decision Making

Although fuzzy set concepts have evolved,neutrosophic sets are attractingmore attention due to the greater power of the structure of neutrosophic sets.The ability to account for components that are true,false or neither true nor false is useful in the resolution of real-life problems.However,simultaneous variations render neutrosophic sets unsuitable in specific circumstances.To enable the management of these sorts of issues,we combine the principle of multi-valued neutrosophic uncertain linguistic sets and complex fuzzy sets to develop the principle of multivalued complex neutrosophic uncertain linguistic sets.Multi-valued complex neutrosophic uncertain linguistic sets can contain grades of truth,abstinence,and falsity,and uncertain linguistic terms,which are expressed as complex numbers whose real and imaginary parts are limited to the unit interval.Some important Dombi laws are elaborated along with Bonferroni mean operators,which offer a flexible general structure with modifiable factors.Bonferroni means aggregation operators perform a significant role in conveying the magnitude level of options and characteristics.To determine relationships among any number of attributes,we develop multi-valued complex neutrosophic uncertain linguistic Dombi-normalized weighted Bonferroni mean operators and discuss their important properties with some special cases.By using these laws,we can deploy themulti-attribute decisionmaking(MADM)technique using the novel principle of multi-valued complex neutrosophic uncertain linguistic sets.To determine the power and flexibility of the elaborated approach,we resolve some numerical examples based on the proposed operator.Finally,the work is validated with the help of comparative analysis,a discussion of its advantages,and geometric expressions of the elaborated theories.

A Self-Adapting and Efficient Dandelion Algorithm and Its Application to Feature Selection for Credit Card Fraud Detection

A dandelion algorithm(DA) is a recently developed intelligent optimization algorithm for function optimization problems. Many of its parameters need to be set by experience in DA,which might not be appropriate for all optimization problems. A self-adapting and efficient dandelion algorithm is proposed in this work to lower the number of DA's parameters and simplify DA's structure. Only the normal sowing operator is retained;while the other operators are discarded. An adaptive seeding radius strategy is designed for the core dandelion. The results show that the proposed algorithm achieves better performance on the standard test functions with less time consumption than its competitive peers. In addition, the proposed algorithm is applied to feature selection for credit card fraud detection(CCFD), and the results indicate that it can obtain higher classification and detection performance than the-state-of-the-art methods.

Duality between Bessel Functions and Chebyshev Polynomials in Expansions of Functions

In expansions of arbitrary functions in Bessel functions or Spherical Bessel functions, a dual partner set of polynomials play a role. For the Bessel functions, these are the Chebyshev polynomials of first kind and for the Spherical Bessel functions the Legendre polynomials. These two sets of functions appear in many formulas of the expansion and in the completeness and (bi)-orthogonality relations. The analogy to expansions of functions in Taylor series and in moment series and to expansions in Hermite functions is elaborated. Besides other special expansion, we find the expansion of Bessel functions in Spherical Bessel functions and their inversion and of Chebyshev polynomials of first kind in Legendre polynomials and their inversion. For the operators which generate the Spherical Bessel functions from a basic Spherical Bessel function, the normally ordered (or disentangled) form is found.

On Two Natural Extensions of n-normality

A bounded linear operator T on a complex Hilbert space H is called n-normal if T^(*)T^(n)=T^(n)T^(*).By Fuglede’s theorem T is n-normal if and only if T^(n)is normal.Let k,n∈N.Then a bounded linear operator T is said to be of typeⅠk-quasi-n-normal if T^(*k){T^(*)T^(n)-T^(n)T^(*)}T^(k)=0,and T is said to be of typeⅡk-quasi-n-normal if T^(*k){T^(*n)T^(n)-T^(n)T^(*n)}T^(k)=0.1-quasi-n-normal is called quasi-n-normal.We shall show that(1)typeⅠquasi-2-normal and typeⅡquasi-2-normal are different classes;(2)the intersection of the class of typeⅠquasi-2-normal and the class of typeⅡquasi-2-normal is equal to the class of 2-normal.We also give some examples of type I k-quasi-n-normal and typeⅡk-quasi-n-normal.We also show that Weyl’s theorem holds for this class of operators and every k-quasi-n-normal operator has a non trivial invariant subspace.

Generalized n-idempotents and Hyper-generalized n-idempotents

For an integer n ≥2, we say that an operator A is an n-idempotent if A^n = A; A is a generalized n-idempotent if A^n = A^＊; A is a hyper-generalized n. idempotent if A^n = A^＋. The set of all n-idempotents, all generalized n-idempotents and all hyper-generalized n-idempotents are denoted by In（H）, gIn（H） and HgIn（H）, respectively. In this note, we obtain a chain of proper inclusions gIn（H） belong to HgIn（H） belong to In＋2（H）.

Simulations of the Performance of Maximum Power Point Tracking Algorithms Based on Experimental Data According to the Topologies of DC-DC Converters

Maximum Power Point Tracking (MPPT) algorithms are now widely used in PV systems independently of the weather conditions. In function of the application, a DC-DC converter topology is chosen without any previous performance test under normal weather conditions. This paper proposes an experimental evaluation of MPPT algorithms according to DC-DC converters topologies, under normal operation conditions. Four widely used MPPT algorithms i.e. Perturb and Observe (P & O), Hill Climbing (HC), Fixed step Increment of Conductance (INCF) and Variable step Increment of Conductance (INCV) are implemented using two topologies of DC-DC converters i.e. buck and boost converters. As input variables to the PV systems, recorded irradiance and temperature, and extracted photovoltaic parameters (ideality factor, series resistance and reverse saturation current) were used. The obtained results show that buck converter has a lot of power losses when controlled by each of the four MPPT algorithms. Meanwhile, boost converter presents a stable output power during the whole day. Once more, the results show that INCV algorithm has the best performance.

Commuting Structure Jacobi Operator for Real Hypersurfaces in Complex Two-plane Grassmannians

We classify real hypersurfaces in complex two-plane Grassmannians whose structure Jacobi operator commutes either with any other Jacobi operator or with the normal Jacobi operator.