• List of Articles


      • Open Access Article

        1 - ‎A Novel Technique for Solving the Uncertainty under the Environment of Neutrosophic Theory of Choice
        Tabasam Rashid Aamir Mehboob Ismat Beg
        ‎When it comes to solving dynamic‎ ‎programming challenges‎, ‎it is essential to have a well-structured ‎‎‎‎decision theory‎. ‎As a result‎, ‎the decision-makers must operate in a‎ ‎dynamically complicated environment where appropriate and rapid‎ ‎reaction in a cooperat More
        ‎When it comes to solving dynamic‎ ‎programming challenges‎, ‎it is essential to have a well-structured ‎‎‎‎decision theory‎. ‎As a result‎, ‎the decision-makers must operate in a‎ ‎dynamically complicated environment where appropriate and rapid‎ ‎reaction in a cooperative way is the fundamental key to effectively‎ ‎completing the task‎. ‎We express a theory of decision modeling and‎ ‎axiomatizing a decision-making process‎. ‎The payoffs and‎ ‎probabilities are represented with simplified neutrosophic sets‎. ‎We‎ ‎therefore‎, ‎provide the theory of choice with the implementation of‎ ‎simplified neutrosophic sets‎. ‎By exploiting the idea of pure‎ ‎strategy‎, ‎we introduce two steps‎: ‎in the first step‎, ‎for each‎ ‎attractive point‎, ‎some particular event is selected that can bring‎ ‎about a relatively neutrosophic upper payoff with a relatively‎ ‎neutrosophic upper probability or a relatively neutrosophic lower‎ ‎payoff with a relatively neutrosophic upper probability‎. ‎A‎ ‎decision-maker selects the most favored attractive point in the‎ ‎second stage‎, ‎based on the focus on all attractive points‎. ‎Neutrosophic focus theory has been introduced to improve overall‎ ‎performance with more flexibility in complex decision-making‎. ‎The‎ ‎approach suggested in this work has been implemented in a real-life‎ ‎example to determine its effectiveness‎. ‎The proposed method is shown to‎ ‎be the most useful for ranking scenarios and addressing dynamic‎ ‎programming problems in decision-making‎. Manuscript profile
      • Open Access Article

        2 - ‎Proposing a Conceptual Model of Critical Success Factors in Lean Production Using Interpretive Structural Modeling and Fuzzy MICMAC Analysis
        Mazdak Khodadadi Karimvand Hadi Shirouyehzad Farhad Hosseinzadeh Lotfi
        Since companies are inclined to implement lean production‎, ‎researchers have proposed a number of fundamental success factors to facilitate the implementation of this production approach‎. ‎This study analyzes the critical success factors (CSFs) in lean production extr More
        Since companies are inclined to implement lean production‎, ‎researchers have proposed a number of fundamental success factors to facilitate the implementation of this production approach‎. ‎This study analyzes the critical success factors (CSFs) in lean production extracted from 14 review studies‎. ‎The interpretive structural modeling approach is utilized to analyze the impact of these critical success factors on one another‎. ‎The aim is to enhance insights into lean production and facilitate informed decision-making‎. ‎In this article‎, ‎a seven-tiered model is presented‎. ‎According to the conceptual model of success factors in lean production‎, ‎leadership is positioned at the base of the model and serves as the origin for other factors‎. ‎It should be regarded as the foremost critical success factor in lean production‎. ‎When establishing lean production systems‎, ‎organizations and senior managers should focus on higher levels and critical success factors that underlie the model‎. ‎Subsequently‎, ‎nonfuzzy and fuzzy driving and dependence power analyses were conducted that the fuzzy matrix cross-reference multiplication applied to a classification (MICMAC) analysis provides deeper insights into the analysis of driving and dependence power‎. ‎The fuzzy matrix cross-reference multiplication applied to a classification analysis helped identify some key factors that are highly effective for successfully implementing lean manufacturing‎. Manuscript profile
      • Open Access Article

        3 - ‎Shannon Entropy Analysis of Serum C-Terminal Agrin Fragment as a Biomarker for Kidney Function‎: ‎Reference‎ ‎Ranges‎, ‎Healing Sequences and Insights
        Mehmet Sengonul
        This article focuses on evaluating the success or failure of kidney transplantation using Shannon entropy‎, ‎fuzzy sets‎, ‎and Scaf‎. ‎The data for Scaf references used in this study for both healthy individuals and kidney transplant recipients have been collected from More
        This article focuses on evaluating the success or failure of kidney transplantation using Shannon entropy‎, ‎fuzzy sets‎, ‎and Scaf‎. ‎The data for Scaf references used in this study for both healthy individuals and kidney transplant recipients have been collected from the relevant literature‎. ‎For both groups‎, ‎Scaf's Shannon entropy values have been calculated using an appropriate probability density function and formulation‎, ‎and sequences have been generated for CAF and Scr biomarkers from entropy values‎, ‎with findings interpreted‎. ‎These sequences are called healing sequences‎. ‎A case study demonstrating whether the transplant procedure was successful or unsuccessful was presented using sequences that we refer to as healing sequences‎. ‎In this context‎, ‎the utilization of mathematical tools such as fuzzy sets‎, ‎Shannon entropy‎, ‎and reference intervals becomes evident‎. ‎These tools provide a systematic and quantitative approach to assessing the outcomes of kidney transplantation‎. ‎By leveraging the principles of Shannon entropy‎, ‎we gain insights into the degree of unpredictability and fuzziness associated with biomarker values‎, ‎which can be indicative of the transplant's success‎. ‎Furthermore‎, ‎the concept of healing sequences provides a valuable framework for tracking the progression of patients post-transplantation‎. ‎By monitoring changes in CAF and Scr biomarkers over time‎, ‎healthcare professionals can make informed decisions and interventions to ensure the well-being of kidney transplant recipients‎. Manuscript profile
      • Open Access Article

        4 - ‎Triangle Algebras and Relative Co-annihilators
        Emile Djomgoue Nana Ariane GABRIEL Tallee Kakeu Blaise Bleriot Koguep Njionou Celestin Lele
        Triangle algebras are an important variety of residuated lattices enriched with two approximation‎ ‎operators as well as a third angular point (different from 0 and 1)‎. ‎They provide a well-defined mathematical framework for formalizing the use of closed intervals deri More
        Triangle algebras are an important variety of residuated lattices enriched with two approximation‎ ‎operators as well as a third angular point (different from 0 and 1)‎. ‎They provide a well-defined mathematical framework for formalizing the use of closed intervals derived from a bounded lattice as truth values‎, ‎with a set of structured axioms‎. ‎This paper introduces the concept of relative co-annihilator of a subset within the framework of triangle algebras‎. ‎As filters of triangle algebras‎, ‎these relative co-annihilators are explored and some of their properties and characterizations are given‎. ‎A meaningful contribution of this work lies in its proof that the relative co-annihilator of a subset $T$ with respect to another subset $Y$ in a triangle algebra $\mathcal{L}$ inherits specific filter's characteristics of $Y$‎. ‎More precisely‎, ‎if $Y$ is a Boolean filter of the second kind‎, ‎then the co-annihilator of $T$ with respect to $Y$ is also a Boolean filter of the second kind‎. ‎The same statement applies when we replace the Boolean filter of the second kind with an implicative filter‎, ‎pseudo complementation filter‎, ‎Boolean filter‎, ‎prime filter‎, ‎prime filter of the third kind‎, ‎pseudo-prime filter‎, ‎or involution filter‎, ‎respectively‎. ‎Finally‎, ‎we establish some conditions under which the co-annihilator of $T$ relative to $Y$ is a prime filter of the second kind‎. Manuscript profile
      • Open Access Article

        5 - ‎Fuzzy Implication Operators Applied to Country Health‎ ‎Preparation
        John Mordeson Sunil Mathew Aswathi Prabhath
        We use a new method to determine a fuzzy similarity measure using fuzzy implication operators‎. ‎We use this method to determine the fuzzy similarity between the two rankings of countries involving health security and health care‎. ‎We then find a fuzzy similarity of co More
        We use a new method to determine a fuzzy similarity measure using fuzzy implication operators‎. ‎We use this method to determine the fuzzy similarity between the two rankings of countries involving health security and health care‎. ‎We then find a fuzzy similarity of countries involving the two rankings of countries with respect to national disaster‎ ‎and political disaster‎. Manuscript profile
      • Open Access Article

        6 - ‎A New Approach to Define the Number of Clusters for Partitional Clustering Algorithms
        Huliane Silva Benjamın Ren Callejas Bedregal Anne Canuto Thiago Batista Ronildo Moura
        ‎Data clustering consists of grouping similar objects according to some characteristic‎. ‎In the literature‎, ‎there are several clustering algorithms‎, ‎among which stands out the Fuzzy C-Means (FCM)‎, ‎one of the most discussed algorithms‎, ‎being used in different ap More
        ‎Data clustering consists of grouping similar objects according to some characteristic‎. ‎In the literature‎, ‎there are several clustering algorithms‎, ‎among which stands out the Fuzzy C-Means (FCM)‎, ‎one of the most discussed algorithms‎, ‎being used in different applications‎. ‎Although it is a simple and easy to manipulate clustering method‎, ‎the FCM requires as its initial parameter the number of clusters‎. ‎Usually‎, ‎this information is unknown‎, ‎beforehand and this becomes a relevant problem in the data cluster analysis process‎. ‎In this context‎, ‎this work proposes a new methodology to determine the number of clusters of partitional algorithms‎, ‎using subsets of the original data in order to define the number of clusters‎. ‎This new methodology‎, ‎is intended to reduce the side effects of the cluster definition phase‎, ‎possibly making the processing time faster and decreasing the computational cost‎. ‎To evaluate the proposed methodology‎, ‎different cluster validation indices will be used to evaluate the quality of the clusters obtained by the FCM algorithms and some of its variants‎, ‎when applied to different databases‎. ‎Through the empirical analysis‎, ‎we can conclude that the results obtained in this article are promising‎, ‎both from an experimental point of view and from a statistical point of view‎. Manuscript profile
      • Open Access Article

        7 - ‎Enhancing Big Data Governance Framework Implementation Using Novel Fuzzy Frank Operators‎: ‎An Application to MADM Process
        Hamza Iftikhar Faisal  Mehmood
        In today's data-driven landscape‎, ‎to ensure continuous survival and betterment‎, ‎the implementation of a robust Big Data Governance Framework (BDGF) is imperative for organizations to effectively manage and harness the potential of their vast data resources‎. ‎The BD More
        In today's data-driven landscape‎, ‎to ensure continuous survival and betterment‎, ‎the implementation of a robust Big Data Governance Framework (BDGF) is imperative for organizations to effectively manage and harness the potential of their vast data resources‎. ‎The BDGF serves no purpose when implemented in a random manner‎. ‎This article delves into the complex decision-making challenges that emerge in the context of implementation of the BDGF under uncertain conditions‎. ‎Specifically‎, ‎we aim to analyze and evaluate the BDGF performance using the Multi-Attribute Decision-Making (MADM) techniques aiming to address the intricacies of big data governance uncertainties‎. ‎To achieve our objectives‎, ‎we explore the application of Frank operators within the framework of complex picture fuzzy (CPF) sets (CPFs)‎. ‎We introduce complex picture fuzzy Frank weighted averaging (CPFFWA) and complex picture fuzzy Frank ordered weighted averaging (CPFFOWA) operators to enable more accurate implementation of the BDGF‎. ‎Additionally‎, ‎we rigorously examine the reliability of these newly proposed fuzzy Frank (FF) operators (FFAOs)‎, ‎taking into consideration essential properties such as idempotency‎, ‎monotonicity‎, ‎and boundedness‎. ‎To illustrate the practical applicability of our approach‎, ‎we present a case study that highlights the decision-making challenges encountered in the implementation of the BDGF‎. ‎Subsequently‎, ‎we conduct a comprehensive numerical example to assess various BDGF implementation options using the MADM technique based on complex picture fuzzy Frank aggregation (CPFFA) operators‎. ‎Furthermore‎, ‎we perform a comprehensive comparative assessment of our proposed methodology‎, ‎emphasizing the significance of the novel insights and results derived‎. ‎In conclusion‎, ‎this research article offers a unique and innovative perspective on decision-making within the realm of the BDGF‎. ‎By employing the CPFFWA and the CPFFOWA operators‎, ‎organizations can make well-informed decisions to optimize their BDGF implementations‎, ‎mitigate uncertainties‎, ‎and harness the full potential of their data assets in an ever-evolving data landscape‎. ‎This work contributes to the advancement of decision support systems for big data governance (BDG)‎, ‎providing valuable insights for practitioners and scholars alike‎. Manuscript profile
      • Open Access Article

        8 - ‎New elements in Hilbert algebras
        Ardavan Najafi
        In this paper‎, ‎the notion of commutator of elements of a Hilbert algebra are introduced and some properties are given‎. ‎The notions of involution element and Engel element in Hilbert algebras are introduced‎. ‎Many different characterizations of them are given‎. ‎The More
        In this paper‎, ‎the notion of commutator of elements of a Hilbert algebra are introduced and some properties are given‎. ‎The notions of involution element and Engel element in Hilbert algebras are introduced‎. ‎Many different characterizations of them are given‎. ‎Then‎, ‎left (right) $k$-Engel elements as a natural generalization of commutators are introduced‎, ‎and we discuss Engel elements‎, ‎which is defined by left and right commutators‎. ‎Finally‎, ‎we will also study relationships between these elements‎. Manuscript profile
      • Open Access Article

        9 - ‎A “Journey” from Traditional to Fuzzy Methods of Decision-Making
        Michael Gr. Voskoglou
        ‎Decision-making (DM) is one of the most important components of human cognition‎. ‎Starting with a review of the traditional criteria for DM‎, ‎this work presents also a method for the verification of a decision‎, ‎a step of the DM process which‎, ‎due to its special i More
        ‎Decision-making (DM) is one of the most important components of human cognition‎. ‎Starting with a review of the traditional criteria for DM‎, ‎this work presents also a method for the verification of a decision‎, ‎a step of the DM process which‎, ‎due to its special interest‎, ‎is usually examined separately from its other steps‎. ‎Frequently in everyday life‎, ‎however‎, ‎the data of a DM problem are vague and characterized by uncertainty‎. ‎In such cases the traditional techniques for DM‎, ‎which are based on principles of the bivalent logic (yes-no)‎, ‎cannot help effectively in making the right decision‎. ‎The first who introduced principles of the fuzzy sets theory in DM were Bellman and Zadeh in 1970 and an example is given here illustrating their fuzzy criterion for DM‎. ‎Also‎, ‎among the several fuzzy methods proposed later by other researchers for a more effective DM‎, ‎a hybrid method is developed here for parametric multiple-criteria DM using soft sets and grey numbers (or intuitionistic fuzzy sets‎, ‎or neutrosophic sets) as tools‎, ‎which improves an earlier method proposed by Maji et al‎. ‎in 2002‎. ‎All the DM approaches presented in this paper are illustrated with everyday practical examples‎. Manuscript profile
      • Open Access Article

        10 - Stable Topology on Ideals for Residuated Lattices
        Ariane GABRIEL Tallee Kakeu Luc E. Diekouam Blaise Bleriot Koguep N. Celestin Lele Daniel Akume
        Residuated lattices are the major algebraic counterpart of logics without contraction rule, as they are more generalized logic systems including important classes of algebras such as Boolean algebras, MV-algebras, BL-algebras, Stonean residuated lattices, MTL-algebras a More
        Residuated lattices are the major algebraic counterpart of logics without contraction rule, as they are more generalized logic systems including important classes of algebras such as Boolean algebras, MV-algebras, BL-algebras, Stonean residuated lattices, MTL-algebras and De Morgan residuated lattices among others, on which filters and ideals are sets of provable formulas. This paper presents a meaningful exploration of the topological properties of prime ideals of residuated lattices. Our primary objective is to endow the set of prime ideals with the stable topology, a topological framework that proves to be more refined than the well-known Zariski topology. To achieve this, we introduce and investigate the concept of pure ideals in the general framework of residuated lattices. These pure ideals are intimately connected to the notion of annihilator in residuated lattices, representing precisely the pure elements of quantales. In addition, we establish a relation between pure ideals and pure filters within a residuated lattice, even though these concepts are not dual notions. Furthermore, thanks to the concept of pure ideals, we provide a rigorous description of the open sets within the stable topology. We introduce the i-local residuated lattices along with their properties, demonstrating that they coincide with local residuated lattices. The findings presented in this study represent an extension beyond previous work conducted in the framework of lattices, and classes of residuated lattices. Manuscript profile
      • Open Access Article

        11 - A TOPSIS-Based Improved Weighting Approach With Evolutionary Computation
        Mithat Zeydan Murat  Güngör Burak Urazel
        Although optimization of weighted objectives is ubiquitous in production scheduling, the literature concerning the determination of weights used in these objectives is scarce. Authors usually suppose that weights are given in advance, and focus on the solution methods f More
        Although optimization of weighted objectives is ubiquitous in production scheduling, the literature concerning the determination of weights used in these objectives is scarce. Authors usually suppose that weights are given in advance, and focus on the solution methods for the specific problem at hand. However, weights directly settle the class of optimal solutions, and are of utmost importance in any practical scheduling problem. In this study, we propose a new weighting approach for single machine scheduling problems. First, factor weights to be used in customer evaluation are found by solving a nonlinear optimization problem using the covariance matrix adaptation evolutionary strategy (CMAES) under fuzzy environment that takes a pairwise comparison matrix as input. Next, customers are sorted using the technique for order of preference by similarity to ideal solution (TOPSIS) by means of which job weights are obtained. Finally, taking these weights as an input, a total weighted tardiness minimization problem is solved by using mixed-integer linear programming to find the best job sequence. This combined methodology may help companies make robust schedules not based purely on subjective judgment, find the best compromise between customer satisfaction and business needs, and thereby ensure profitability in the long run. Manuscript profile
      • Open Access Article

        12 - Families of Fuzzy Sets and Lattice Isomorphisms Preparation
        John Mordeson Sunil Mathew
        In this paper, we discuss how theoretical results from one family of fuzzy sets can be carried over immediately to another family of fuzzy sets by the use of lattice isomorphisms. We also show that these families can occur naturally and that applications may not necessa More
        In this paper, we discuss how theoretical results from one family of fuzzy sets can be carried over immediately to another family of fuzzy sets by the use of lattice isomorphisms. We also show that these families can occur naturally and that applications may not necessarily be carried over using these isomorphisms. We illustrate this using techniques from the study of human trafficking and its analysis using mathematics of uncertainty. We also consider the new definition of fuzzy set provided by Trillas and de Soto. Manuscript profile