Modeling data acquisition systems (DASs) can support the vehicle industry in the development and design of sophisticated driver assistance systems. Modeling DASs on the basis of multiple criteria is considered as a multicriteria decision-making (MCDM) problem. Although literature reviews have provided models for DASs, the issue of imprecise, unclear, and ambiguous information remains unresolved. Compared with existing MCDM methods, the robustness of the fuzzy decision by opinion score method II (FDOSM II) and fuzzy weighted with zero inconsistency II (FWZIC II) is demonstrated for modeling the DASs. However, these methods are implemented in an intuitionistic fuzzy set environment that restricts the ability of experts to provide mem

The main objective of this work is to introduce and investigate fixed point (F. p) theorems for maps that satisfy contractive conditions in weak partial metric spaces (W.P.M.S), and give some new generalization of the fixed point theorems of Mathews and Heckmann. Our results extend, and unify a multitude of (F. p) theorems and generalize some results in (W.P.M.S). An example is given as an illustration of our results.

  In this paper, the concept of normalized duality mapping has introduced in real convex modular spaces. Then, some of its properties have shown which allow dealing with results related to the concept of uniformly smooth convex real modular spaces. For multivalued mappings defined on these spaces, the convergence of a two-step type iterative sequence to a fixed point is proved

We define L-contraction mapping in the setting of D-metric spaces analogous to L-contraction mappings [1] in complete metric spaces. Also, give a definition for general D- matric spaces.And then prove the existence of fixed point for more general class of mappings in generalized D-metric spaces.

      Throughout this paper, a generic iteration algorithm for a finite family of total asymptotically quasi-nonexpansive maps in uniformly convex Banach space is suggested. As well as weak / strong convergence theorems of this algorithm to a common fixed point are established. Finally, illustrative numerical example by using Matlab is presented.

We introduce the notion of interval value fuzzy ideal of TM-algebra as a generalization of a fuzzy ideal of TM-algebra and investigate some basic properties. Interval value fuzzy ideals and T-ideals are defined and several examples are presented. The relation between interval value fuzzy ideal and fuzzy T-ideal is studied. Abstract We introduce the notion of interval value fuzzy ideal of TM-algebra as a generalization of a fuzzy ideal of TM-algebra and investigate some basic properties. Interval value fuzzy ideals and T- ideals are defined and several examples are presented. The relation between interval value fuzzy ideal and fuzzy T-ideal is studied.

Abstract. Nano-continuous mappings have a wide range of applications in pure and applied sciences. This paper aims to study and investigate new types of mappings, namely nano-para-compact, completely nano-regular, nano-para-perfect, and countably nano-para-perfect mappings in nano-topological spaces using nano-open sets. We introduce several properties and basic characterizations related to these mappings, which are essential for proving our main results. Additionally, we discuss the relationships among these types of mappings in nano-topological spaces. We also introduce the concept of nano-Ti-mapping, where i = 0, 1, 2, nano-neighborhood separated, and nano-functionally separated, along with various other definitions. We explore the relat

This paper discusses the limitation of both Sequence Covering Array (SCA) and Covering Array (CA) for testing reactive system when the order of parameter-values is sensitive. In doing so, this paper proposes a new model to take the sequence values into consideration. Accordingly, by superimposing the CA onto SCA yields another type of combinatorial test suite termed Multi-Valued Sequence Covering Array (MVSCA) in a more generalized form. This superimposing is a challenging process due to NP-Hardness for both SCA and CA. Motivated by such a challenge, this paper presents the MVSCA with a working illustrative example to show the similarities and differences among combinatorial testing methods. Consequently, the MVSCA is a