Research on arithmetic operations over generalized orthopair fuzzy sets

The four fundamental operations of arithmetic for real (and complex) numbers are well known to everybody and quite often used in our daily life. And they have been extended to classical and generalized fuzzy environments with the demand of practical applications. In this paper, we present the arithmetic operations, including addition, subtraction, multiplication, and division operations, over -rung orthopair membership grades, where subtraction and division operations are both defined in two different ways. One is by solving the equation involving addition or multiplication operations, whereas the other is by determining the infimum or supremum of solutions of the corresponding inequality. Not all of -rung orthopairs can be performed by the former method but by the latter method, and it is proved that the former is a special case of the latter. Moreover, the elementary properties of arithmetic operations as well as mixed operations are extensively investigated. Finally, these arithmetic operations are pointwise defined on -rung orthopair fuzzy sets in which the membership degree of each element is a -rung orthopair.     

TDBF: Two-dimensional belief function

How to efficiently handle uncertain information is still an open issue. In this paper, a new method to deal with uncertain information, named as two-dimensional belief function (TDBF), is presented. A TDBF has two components, T = (), both and are classical belief functions, while is a measure of reliable of . The definition of TDBF and the discounting algorithm are proposed. Compared with the classical discounting model, the proposed TDBF is more flexible and reasonable. Numerical examples are used to show the efficiency and application of the proposed method.     

Linguistic-induced ordered weighted averaging operator for multiple attribute group decision-making

To solve the problems of making decision with uncertain and imprecise information, Zadeh proposed the concept of Z-number as an ordered pair, the first component of which is a restriction of variable, and the second one is a measure of reliability of the first component. But the decision-makers’ confidence in decision-making was neglected. In this paper, firstly, we present a new method to evaluate and rank -numbers based on the operations of trapezoidal Type 2 fuzzy numbers and generalized trapezoidal fuzzy numbers. Then, linguistic-induced ordered weighted averaging operator and linguistic combined weighted averaging aggregation operator are developed to solve multiple attribute group decision-making problems. And we analyze the main properties of them by utilizing some operational laws of fuzzy linguistic variables. Finally, a numerical example is provided to illustrate the rationality of the proposed method.     

Some q-rung orthopair uncertain linguistic aggregation operators and their application to multiple attribute group decision making

q-Rung orthopair fuzzy sets (q-ROFSs), originally presented by Yager, are a powerful fuzzy information representation model, which generalize the classical intuitionistic fuzzy sets and Pythagorean fuzzy sets and provide more freedom and choice for decision makers (DMs) by allowing the sum of the $q\mathrm{t}\mathrm{h}$ power of the membership and the $q\mathrm{t}\mathrm{h}$ power of the nonmembership to be less than or equal to 1. In this paper, a new class of fuzzy sets called q-rung orthopair uncertain linguistic sets (q-ROULSs) based on the q-ROFSs and uncertain linguistic variables (ULVs) is proposed, and this can describe the qualitative assessment of DMs and provide them more freedom in reflecting their belief about allowable membership grades. On the basis of the proposed operational rules and comparison method of q-ROULSs, several q-rung orthopair uncertain linguistic aggregation operators are developed, including the q-rung orthopair uncertain linguistic weighted arithmetic average operator, the q-rung orthopair uncertain linguistic ordered weighted average operator, the q-rung orthopair uncertain linguistic hybrid weighted average operator, the q-rung orthopair uncertain linguistic weighted geometric average operator, the q-rung orthopair uncertain linguistic ordered weighted geometric operator, and the q-rung orthopair uncertain linguistic hybrid weighted geometric operator. Then, some desirable properties and special cases of these new operators are also investigated and studied, in particular, some existing intuitionistic fuzzy aggregation operators and Pythagorean fuzzy aggregation operators are proved to be special cases of these new operators. Furthermore, based on these proposed operators, we develop an approach to solve the multiple attribute group decision making problems, in which the evaluation information is expressed as q-rung orthopair ULVs. Finally, we provide several examples to illustrate the specific decision-making steps and explain the validity and feasibility of two methods by comparing with other methods.     

New logarithmic operational laws and their aggregation operators for Pythagorean fuzzy set and their applications

The aim of this paper is to develop some new logarithm operational laws (LOL) with real number base for the Pythagorean fuzzy sets. Some properties of LOL have been studied and based on these, various weighted averaging and geometric operators have been developed. Then, we utilized it to solve the decision-making problems. The validity of the proposed method is demonstrated with a numerical example and compared the results with the several existing approaches result. Finally, the influences of logarithmic operation and the selection of the logarithmic base in practice are discussed.     

Pythagorean fuzzy Dombi aggregation operators and its applications in multiple attribute decision-making

The operations of -norm and -conorm, developed by Dombi, were generally known as Dombi operations, which may have a better expression of application if they are presented in a new form of flexibility within the general parameter. In this paper, we use Dombi operations to create a few Pythagorean fuzzy Dombi aggregation operators: Pythagorean fuzzy Dombi weighted average operator, Pythagorean fuzzy Dombi order weighted average operator, Pythagorean fuzzy Dombi hybrid weighted average operator, Pythagorean fuzzy Dombi weighted geometric operator, Pythagorean fuzzy Dombi order weighted geometric operator, and Pythagorean fuzzy Dombi hybrid weighted geometric operator. The distinguished feature of these proposed operators is examined. At that point, we have used these operators to build up a model to remedy the multiple attribute decision-making issues under Pythagorean fuzzy environment. Ultimately, a realistic instance is stated to substantiate the created model and to exhibit its applicability and viability.     

Some preference relations based on q-rung orthopair fuzzy sets

As a generalization of intuitionistic fuzzy sets and Pythagorean fuzzy sets, $q$-rung orthopair fuzzy sets provide decision makers more flexible space in expressing their opinions. Preference relations have received widespread acceptance as an efficient tool in representing decision makers’ preference over alternatives in the decision-making process. In this paper, some new preference relations are investigated based on the $q$-rung orthopair fuzzy sets. First, a novel score function is presented for ranking $q$-rung orthopair fuzzy numbers. Second, $q$-rung orthopair fuzzy preference relation, consistent $q$-rung orthopair fuzzy preference relation, incomplete $q$-rung orthopair fuzzy preference relation, consistent incomplete $q$-rung orthopair fuzzy preference relation, and acceptable incomplete $q$-rung orthopair fuzzy preference relation are defined. In the end, based on the new score function and these preference relations, some algorithms are constructed for ranking and selection of the decision-making alternatives.     

Direct synthesis of reduced order H controllers for a class of multivariable plants

Given an nth order, -control input, p-measured output generalized plant, this article proposes a simple, direct approach to design an output feedback H controller with order satisfying for , or for . For this purpose, the output feedback H control problem is transformed into an H state feedback problem for an augmented generalized system. A class of plants for which this transformation always exists and the ensuing controller has order as above, is identified. As a result, for such plants, the reduced order H controller gains are found just by solving a simple linear matrix inequality problem used in state feedback based H control. The efficacy of the proposed approach is studied on some benchmark examples.     

Fermatean fuzzy linguistic set and its application in multicriteria decision making

In this paper, we propose the concept of Fermatean fuzzy linguistic term sets based on linguistic term sets and Fermatean fuzzy sets. The basic operational laws, the score function, and the accuracy function of Fermatean fuzzy linguistic numbers are provided. Then we propose the Fermatean fuzzy linguistic weighted aggregation operator, the Fermatean fuzzy linguistic weighted geometric operator, and the Fermatean fuzzy linguistic distance measures. Furthermore, we extend the TOPSIS method to the proposed distance measures, and the ranking of alternatives is obtained under a Fermatean fuzzy linguistic environment. An example is provided to illustrate the feasibility and effectiveness of the proposed method, and a comparison with the existing method is also analyzed. Finally, the sensitivity analysis of the parameter in the proposed distance measure is also discussed.     

A new -gain analysis framework for discrete-time switched systems based on predictive Lyapunov function

The work proposes the pre--gain analysis framework based on the newly raised nonweighted pre--gain performance index and predictive Lyapunov function, which is devoted to nonweighted -gain analysis and relevant control of discrete-time switched systems under mode-dependent average dwell time. This also provides new ideas for other disturbance-related studies. To begin with, the predictive Lyapunov function is established for switched nonlinear systems in the sense of better reflecting future system dynamics and future external disturbances. Hence, it is achievable to develop less conservative stability and nonweighted pre--gain criteria for switched linear systems. Further, a new disturbance-output expression is devised to match with the nonweighted pre--gain, whose function is to estimate and optimize the traditional nonweighted -gain of the underlying system through discussions. Then, a solvable condition is formulated to seek the piecewise time-dependent gains of switching controller in a convex structure, ensuring the global uniform exponential stability with nonweighted pre--gain and thereby attaining much smaller non-weighted -gain. Finally, the simulation comprised of a circuit system and a numerical example manifests the impressive potential of the obtained results for the purpose of preferable disturbance attenuation performances.     

Some Dombi aggregation of Q-rung orthopair fuzzy numbers in multiple-attribute decision making

The operations of $t$-norm (TN) and $t$-conorm (TCN), developed by Dombi, are generally known as Dombi operations, which have an advantage of flexibility within the working behavior of parameter. In this paper, we use Dombi operations to construct a few Q-rung orthopair fuzzy Dombi aggregation operators: Q-rung orthopair fuzzy Dombi weighted average operator, Q-rung orthopair fuzzy Dombi order weighted average operator, Q-rung orthopair fuzzy Dombi hybrid weighted average operator, Q-rung orthopair fuzzy Dombi weighted geometric operator, Q-rung orthopair fuzzy Dombi order weighted geometric operator, and Q-rung orthopair fuzzy Dombi hybrid weighted geometric operator. The different features of these proposed operators are reviewed. At that point, we have used these operators to build up a model to solve the multiple-attribute decision making issues under Q-rung orthopair fuzzy environment. Ultimately, a realistic instance is stated to substantiate the created model and to exhibit its applicability and viability.     

PAS: A new powerful and simple quantum computing simulator

In recent years, many researchers have been using CPU for quantum computing simulation. However, in reality, the simulation efficiency of the large-scale simulator is low on a single node. Therefore, striving to improve the simulator efficiency on a single node has become a serious challenge that many researchers need to solve. After many experiments, we found that much computational redundancy and frequent memory access are important factors that hinder the efficient operation of the CPU. This paper proposes a new powerful and simple quantum computing simulator: PAS (power and simple). Compared with existing simulators, PAS introduces four novel optimization methods: efficient hybrid vectorization, fast bitwise operation, memory access filtering, and quantum tracking. In the experiment, we tested the QFT (quantum Fourier transform) and RQC (random quantum circuits) of 21 to 30 qubits and selected the state-of-the-art simulator QuEST (quantum exact simulation toolkit) as the benchmark. After experiments, we have concluded that PAS compared with QuEST can achieve a mean speedup of (QFT), (RQC) (up to , ) on the Intel Xeon E5-2670 v3 CPU.     

Linear-time algorithms for eliminating claws in graphs

Since many -complete graph problems are polynomial-time solvable when restricted to claw-free graphs, we study the problem of determining the distance of a given graph to a claw-free graph, considering vertex elimination a measure. Claw-free Vertex Deletion (CFVD) consists of determining the minimum number of vertices to be removed from a graph such that the resulting graph is claw-free. Although CFVD is -hard in general and recognizing claw-free graphs is still a challenge, where the current best deterministic algorithm for a graph G consists of performing executions of the best algorithm for matrix multiplication, we present linear-time algorithms for CFVD on weighted block graphs and weighted graphs with bounded treewidth. Furthermore, we show that this problem on forests can be solved in linear time by a simpler algorithm, and we determine the exact values for full k-ary trees. On the other hand, we show that CFVD is -hard even when the input graph is a split graph. We also show that the problem is hard to be approximated within any constant factor better than 2, assuming the unique games conjecture.     

Another view on q‐rung orthopair fuzzy sets

In this paper, two new approaches have been presented to view q‐rung orthopair fuzzy sets. In the first approach, these can viewed as L‐fuzzy sets, whereas the second approach is based on the notion of orbits. Uncertainty index is the quantity , which remains constant for all points in an orbit. Certain operators can be defined in q‐ROF sets, which affect when applied to some q‐ROF sets. Operators , , and have been defined. It is studied that how these operators affect when applied to some q‐ROF set A.     

q-Rung orthopair fuzzy Choquet integral aggregation and its application in heterogeneous multicriteria two-sided matching decision making

In the real decision making, $q$-rung orthopair fuzzy sets ($q$-ROFSs) as a novel effective tool can depict and handle uncertain information in a broader perspective. Considering the interrelationships among the criteria, this paper extends Choquet integral to the $q$-rung orthopair fuzzy environment and further investigates its application in multicriteria two-sided matching decision making. To determine the fuzzy measures used in Choquet integral, we first define a pair of $q$-rung orthopair fuzzy entropy and cross-entropy. Then, by utilizing $\lambda$-fuzzy measure theory, we propose an entropy-based method to calculate the fuzzy measures upon criteria. Furthermore, we discuss $q$-rung orthopair fuzzy Choquet integral operator and its properties. Thus, with the aid of $q$-rung orthopair fuzzy Choquet integral, we consider the preference heterogeneity of the matching subjects and further explore the corresponding generalized model and approach for the two-sided matching. Finally, a simulated example of loan market matching is given to illustrate the validity and applicability of our proposed approach.     

Stubborn state estimation for nonlinear distributed parameter systems subject to measurement outliers

In this article, the state estimation problem is investigated for a class of distributed parameter systems (DPSs). In order to estimate the state of DPSs, we give a partition of spatial interval with a finite sequence and, on each subinterval, one sensor is placed to receive the measurements from the DPS. Due to the unexpected environment changes, the measurements will probably contain some outliers. To eliminate the effects of the possibly occurring outliers, we construct a stubborn state estimator where the innovation is constrained by a saturation function. By using Lyapunov functional, Wirtinger inequality and piecewise integration, some sufficient conditions are obtained under which the resulting estimation error system is exponentially stable and the performance requirement is satisfied. According to the obtained analysis results, the desired state estimator is designed in terms of the solution to a set of matrix inequalities. Finally, a numerical simulation example is given to verify the effectiveness of the proposed state estimation scheme.     

Sparse control for continuous-time systems

In this survey article, we give a comprehensive review of sparse control for continuous-time systems, called maximum hands-off control. The maximum hands-off control is the optimal control, for which we introduce fundamental properties such as necessary conditions, existence, and equivalence to the optimal control. We also show an efficient numerical computation algorithm for the maximum hands-off control based on the time discretization and ADMM (alternating direction method of multipliers). A numerical example is shown with an available MATLAB program.     

Stabilization of the planar vertical take-off and landing using nonlinear feedback control

This article presents a new control strategy for the well-known problem of the planar vertical take-off and landing. The total thrust is computed using a nonlinear feedback compensation so that the altitude reaches the desired altitude. The horizontal position x is then controlled by choosing the orientation angle as a smooth saturation function of x and . A proof of convergence is presented using a Lyapunov approach. The proposed control strategy is successfully tested in numerical simulations.