Intuitionistic fuzzy-valued neutrosophic multi-sets and numerical applications to classification

A single-valued neutrosophic multi-set is characterized by a sequence of truth membership degrees, a sequence of indeterminacy membership degrees and a sequence of falsity membership degrees. Nature of a single-valued neutrosophic multi-set allows us to consider multiple information in the truth, indeterminacy and falsity memberships which is pretty useful in multi-criteria group decision making. In this paper, we consider sequences of intuitionistic fuzzy values instead of numbers to define the concept of intuitionistic fuzzy-valued neutrosophic multi-set. In this manner, such a set gives more powerful information. We also present some set theoretic operations and a partial order for intuitionistic fuzzy-valued neutrosophic sets and provide some algebraic operations between intuitionistic fuzzy-valued neutrosophic values. Then, we develop two types of weighted aggregation operators with the help of intuitionistic fuzzy t-norms and t-conorms. By considering some well-known additive generators of ordinary t-norms, we give the Algebraic weighted arithmetic and geometric aggregation operators and the Einstein weighted arithmetic and geometric aggregation operators that are the particular cases of the weighted aggregation operators defined via general t-norms and t-conorms. We also define a simplified neutrosophic valued similarity measure and we use a score function for simplified neutrosophic values to rank similarities of intuitionistic fuzzy-valued neutrosophic multi-values. Finally, we give an algorithm to solve classification problems using intuitionistic fuzzy-valued neutrosophic multi-values and proposed aggregation operators and we apply the theoretical part of the paper to a real classification problem.

A New Approach Towards Intuitionistic Fuzzy Multisets

In this paper a new definition of Intuitionistic fuzzy multisets (IFMS) has been introduced. Algebraic operations on these intuitionistic fuzzy multisets are defined and their properties under these algebraic operations are studied. The author has also introduced a new notion of complement for an IFMS in which the complement of the original set is also an IFMS. The notion of distance and similarity between two IFMS’s has been defined and their properties have also been studied here. An application of IFMS in solving a medical diagnosis problem has been provided at the end.

Lagrange-multiplier regularization of eigenproblem for Jx

We solve the eigenproblem of the angular momentum $$J_x$$ J x by directly dealing with the non-diagonal matrix unlike the conventional approach rotating the trivial eigenstates of $$J_z$$ J z . Characteristic matrix is reduced into a tri-diagonal form following Narducci–Orszag rescaling of the eigenvectors. A systematic reduction formalism with recurrence relations for determinants of any dimension greatly simplifies the computation of tri-diagonal matrices. Thus the secular determinant is intrinsically factorized to find the eigenvalues immediately. The reduction formalism is employed to find the adjugate of the characteristic matrix. Improving the recently introduced Lagrange-multiplier regularization, we identify that every column of that adjugate matrix is indeed the eigenvector. It is remarkable that the approach presented in this work is completely new and unique in that any information of $$J_z$$ J z is not required and only algebraic operations are involved. Collapsing of the large amount of determinant calculation with the recurrence relation has a wide variety of applications to other tri-diagonal matrices appearing in various fields. This new formalism should be pedagogically useful for treating the angular momentum problem that is central to quantum mechanics course.

ESSM: Formal Analysis Framework for Protocol to Support Algebraic Operations and More Attack Capabilities

The strand space model has been proposed as a formal method for verifying the security goals of cryptographic protocols. However, only encryption and decryption operations and hash functions are currently supported for the semantics of cryptographic primitives. Therefore, we establish the extended strand space model (ESSM) framework to describe algebraic operations and advanced threat models. Based on the ESSM, we add algebraic semantics, including the Abelian group and the XOR operation, and a threat model based on algebraic attacks, key-compromise impersonation attacks, and guess attacks. We implement our model using the automatic analysis tool, Scyther. We demonstrate the effectiveness of our framework by analysing several protocols, in particular a three-factor agreement protocol, with which we can identify new attacks while providing trace proofs.

Complex Numbers for Relativistic Operations

When presenting special relativity, it is customary to single out the so-called paradoxes. One of these paradoxes is the formal occurrence of speeds exceeding the speed of light. An essential part of such paradoxes arises from the incompleteness of the relativistic calculus of velocities. In special relativity, the additive group is used for velocities. However, the use of only group operations imposes artificial restrictions on possible computations. Naive expansion to vector space is usually done by using non-relativistic operations. We propose to consider arithmetic operations in the special theory of relativity in the framework of the Cayley–Klein model for projective spaces. We show that such paradoxes do not arise in the framework of the proposed relativistic extension of algebraic operations.

Generalizing the Algebra of Throws to Rank-3 Matroids

<p>The algebra of throws is a geometric construction which reveals the underlying algebraic operations of addition and multiplication in a projective plane. In Desarguesian projective planes, the algebra of throws is a well-defined, commutative and associative binary operation. However, when we consider an analogous operation in a more general point-line configuration that comes from rank-3 matroids, none of these properties are guaranteed. We construct lists of forbidden configurations which give polynomial time checks for certain properties. Using these forbidden configurations, we can check whether a configuration has a group structure under this analogous operation. We look at the properties of configurations with such a group structure, and discuss their connection to the jointless Dowling geometries.</p>

Generalizing the Algebra of Throws to Rank-3 Matroids

<p>The algebra of throws is a geometric construction which reveals the underlying algebraic operations of addition and multiplication in a projective plane. In Desarguesian projective planes, the algebra of throws is a well-defined, commutative and associative binary operation. However, when we consider an analogous operation in a more general point-line configuration that comes from rank-3 matroids, none of these properties are guaranteed. We construct lists of forbidden configurations which give polynomial time checks for certain properties. Using these forbidden configurations, we can check whether a configuration has a group structure under this analogous operation. We look at the properties of configurations with such a group structure, and discuss their connection to the jointless Dowling geometries.</p>

Belief and Possibility Belief Interval-Valued N-Soft Set and Their Applications in Multi-Attribute Decision-Making Problems

In this research article, we motivate and introduce the concept of possibility belief interval-valued N-soft sets. It has a great significance for enhancing the performance of decision-making procedures in many theories of uncertainty. The N-soft set theory is arising as an effective mathematical tool for dealing with precision and uncertainties more than the soft set theory. In this regard, we extend the concept of belief interval-valued soft set to possibility belief interval-valued N-soft set (by accumulating possibility and belief interval with N-soft set), and we also explain its practical calculations. To this objective, we defined related theoretical notions, for example, belief interval-valued N-soft set, possibility belief interval-valued N-soft set, their algebraic operations, and examined some of their fundamental properties. Furthermore, we developed two algorithms by using max-AND and min-OR operations of possibility belief interval-valued N-soft set for decision-making problems and also justify its applicability with numerical examples.

Diagrammar of physical and fake particles and spectral optical theorem

We prove spectral optical identities in quantum field theories of physical particles (defined by the Feynman iϵ prescription) and purely virtual particles (defined by the fakeon prescription). The identities are derived by means of purely algebraic operations and hold for every (multi)threshold separately and for arbitrary frequencies. Their major significance is that they offer a deeper understanding on the problem of unitarity in quantum field theory. In particular, they apply to “skeleton” diagrams, before integrating on the space components of the loop momenta and the phase spaces. In turn, the skeleton diagrams obey a spectral optical theorem, which gives the usual optical theorem for amplitudes, once the integrals on the space components of the loop momenta and the phase spaces are restored. The fakeon prescription/projection is implemented by dropping the thresholds that involve fakeon frequencies. We give examples at one loop (bubble, triangle, box, pentagon and hexagon), two loops (triangle with “diagonal”, box with diagonal) and arbitrarily many loops. We also derive formulas for the loop integrals with fakeons and relate them to the known formulas for the loop integrals with physical particles.

A Decision-Making Approach Based on Score Matrix for Pythagorean Fuzzy Soft Set

Pythagorean fuzzy soft set (PFSS) is the most powerful and effective extension of Pythagorean fuzzy sets (PFS) which deals with the parametrized values of the alternatives. It is also a generalization of intuitionistic fuzzy soft set (IFSS) which provides us better and precise information in the decision-making process comparative to IFSS. The core objective of this work is to construct some algebraic operations for PFSS such as OR-operation, AND-operation, and necessity and possibility operations. Furthermore, some fundamental properties have been established for PFSS utilizing the developed operations. Moreover, a decision-making technique has been offered for PFSS based on a score matrix. To demonstrate the validity of the proposed approach, a numerical example has been presented. Finally, to ensure the practicality of the established approach, a comprehensive comparative analysis has been presented. The obtained results show that our developed approach is most effective and delivers better information comparative to prevailing techniques.