DHHFL-MABAC Approach based on DHHFLDM-LCME for Multi-criteria Group Decision Making Involving Sewage Treatment Company Selection

With the continuous acceleration of urban construction and development, ecological governance has become an important part of our green life. Therefore, how to select the appropriate governance company in the complex decision-making environment is very important. A double hierarchy hesitant fuzzy linguistic multi-attributive border approximation area method (DHHFL-MABAC) is proposed in this paper, which is based on distance measure and comprehensive weight. DHHFL-MABAC method not only considers the potential loss, but also has simple calculation and stable results. The double hierarchy hesitant fuzzy linguistic distance measure based on least common multiple (DHHFLDM-LCME) is proposed, which reduces the loss of original information and makes the result more accurate. Binary contrast method is proposed and combined with entropy weight to obtain comprehensive weight, which makes the determined weight more reasonable. Finally, this method is applied to the case selected by the sewage treatment company and proved its effectiveness.

The Compromise Ratio Method With Intuitionistic Fuzzy Distance for FMAGDM

The compromise ratio method (CRM) is an effective method to solve multiple attribute group decision making (MAGDM). Distance measure of intuitionistic fuzzy (IF) numbers (IFNs) is important for CRM. In this paper, according to the IF distance of IFNs, an extended compromise ratio method (CRM) is developed for (MAGDM) problems which attribute weights and evaluation values of alternatives on attributes are expressed in linguistic variables parameterized using TIFNs. Finally, the effectiveness and practicability of the extended CRM with IF distance are demonstrated by solving a software selection problem.

Constraint-based Diversification of JOP Gadgets

Modern software deployment process produces software that is uniform, and hence vulnerable to large-scale code-reuse attacks, such as Jump-Oriented Programming (JOP) attacks. Compiler-based diversification improves the resilience and security of software systems by automatically generating different assembly code versions of a given program. Existing techniques are efficient but do not have a precise control over the quality, such as the code size or speed, of the generated code variants. This paper introduces Diversity by Construction (DivCon), a constraint-based compiler approach to software diversification. Unlike previous approaches, DivCon allows users to control and adjust the conflicting goals of diversity and code quality. A key enabler is the use of Large Neighborhood Search (LNS) to generate highly diverse assembly code efficiently. For larger problems, we propose a combination of LNS with a structural decomposition of the problem. To further improve the diversification efficiency of DivCon against JOP attacks, we propose an application-specific distance measure tailored to the characteristics of JOP attacks. We evaluate DivCon with 20 functions from a popular benchmark suite for embedded systems. These experiments show that DivCon's combination of LNS and our application-specific distance measure generates binary programs that are highly resilient against JOP attacks (they share between 0.15% to 8% of JOP gadgets) with an optimality gap of 10%. Our results confirm that there is a trade-off between the quality of each assembly code version and the diversity of the entire pool of versions. In particular, the experiments show that DivCon is able to generate binary programs that share a very small number of gadgets, while delivering near-optimal code. For constraint programming researchers and practitioners, this paper demonstrates that LNS is a valuable technique for finding diverse solutions. For security researchers and software engineers, DivCon extends the scope of compiler-based diversification to performance-critical and resource-constrained applications.

New Extended Topsis Method Based On The Entropy Measure And Picture Fuzzy Rough Set Information And Their Application In Decision Support System

In this article, we shall introduce a novel technique for order preference by similarity to ideal solution (TOPSIS)-based methodology to resolve multicriteria group decision-making problems within picture fuzzy environment, where the weights information of both the decision makers (DMs) and criteria are completely unknown. First, we briefly review the definition of picture fuzzy sets (PFS), score function and accuracy function of PFRSs and their basic operational laws. In addition, defined the generalized distance measure for PFRSs based on picture fuzzy rough entropy measure to compute the unknown weights information. Secondly, the picture fuzzy information based decision-making technique for multiple attribute group decision making (MAGDM) is established and all computing steps are simply depicted. In our presented model, it's more accuracy and effective for considering the conflicting attributes. Finally, an illustrative example with robot selection is provided to demonstrate the effectiveness of the proposed picture fuzzy decision support approaches, together with comparison results discussion, proving that its results are feasible and credible.

A Combined Interval Type-2 Fuzzy MCDM Framework for the Resilient Supplier Selection Problem

Selecting the most resilient supplier is a crucial problem for organizations and managers in the supply chain. However, due to the inherited high degree of uncertainty in real-life projects, developing a decision-making framework in a crisp or fuzzy environment may not present accurate or reliable results for the managers. For this reason, it is better to evaluate the potential suppliers in an Interval Type-2 Fuzzy (IT2F) environment for better dealing with this ambiguity. This study developed an improved combined IT2F Best Worst Method (BWM) and IT2F technique for Order Preference by Similarity to Ideal Solution (TOPSIS) model “Atieh Sazan” Co. as a case study, such that the IT2FBWM was employed for obtaining the weight of criteria. The IT2FTOPSIS was utilized for ranking the potential suppliers based on Hamming distance measure. In both phases, the opinions of experts as IT2F linguistic terms were employed for weighting the criteria and obtaining the relative importance of the alternatives in terms of the evaluative criteria. After obtaining the final results, the proposed model was validated by replacing Analytical Hierarchy Process (AHP) and Simple Additive Weighting (SAW) approaches separately instead of BWM for weighting the criteria. After executing both new models, it was found that the final ranking was similar to the final ranking of the proposed model, representing the reliability and accuracy of the obtained results. Moreover, it was concluded that the resilient criteria of “Reorganization” and “Redundancy” are the most determinant measures for selecting the best supplier rather than measures in the Iranian Construction Industry.

Kernel Distance Measures for Time Series, Random Fields and Other Structured Data

This paper introduces kdiff, a novel kernel-based measure for estimating distances between instances of time series, random fields and other forms of structured data. This measure is based on the idea of matching distributions that only overlap over a portion of their region of support. Our proposed measure is inspired by MPdist which has been previously proposed for such datasets and is constructed using Euclidean metrics, whereas kdiff is constructed using non-linear kernel distances. Also, kdiff accounts for both self and cross similarities across the instances and is defined using a lower quantile of the distance distribution. Comparing the cross similarity to self similarity allows for measures of similarity that are more robust to noise and partial occlusions of the relevant signals. Our proposed measure kdiff is a more general form of the well known kernel-based Maximum Mean Discrepancy distance estimated over the embeddings. Some theoretical results are provided for separability conditions using kdiff as a distance measure for clustering and classification problems where the embedding distributions can be modeled as two component mixtures. Applications are demonstrated for clustering of synthetic and real-life time series and image data, and the performance of kdiff is compared to competing distance measures for clustering.

A new divergence measure of interval-valued pythagorean fuzzy sets and its application

As the extension of the Fuzzy sets (FSs) theory, the Interval-valued Pythagorean Fuzzy Sets (IVPFS) was introduced which play an important role in handling the uncertainty. The Pythagorean fuzzy sets (PFSs) proposed by Yager in 2013 can deal with more uncertain situations than intuitionistic fuzzy sets because of its larger range of describing the membership grades. How to measure the distance of Interval-valued Pythagorean fuzzy sets is still an open issue. Jensen–Shannon divergence is a useful distance measure in the probability distribution space. In order to efficiently deal with uncertainty in practical applications, this paper proposes a new divergence measure of Interval-valued Pythagorean fuzzy sets,which is based on the belief function in Dempster–Shafer evidence theory, and is called IVPFSDM distance. It describes the Interval-Valued Pythagorean fuzzy sets in the form of basic probability assignments (BPAs) and calculates the divergence of BPAs to get the divergence of IVPFSs, which is the step in establishing a link between the IVPFSs and BPAs. Since the proposed method combines the characters of belief function and divergence, it has a more powerful resolution than other existing methods.

T-Spherical Fuzzy Rough Interactive Power Heronian Mean Aggregation Operators for Multiple Attribute Group Decision-Making

In this article, to synthesize the merits of interaction operational laws (IOLs), rough numbers (RNs), power average (PA) and Heronian mean (HM), a new notion of T-spherical fuzzy rough numbers (T-SFRNs) is first introduced to describe the intention of group experts accurately and take the interaction between individual experts into account with complete and symmetric information. The distance measure and ordering rules of T-SFRNs are proposed, and the IOLs of T-SFRNs are extended. Next, the PA and HM are combined based on the IOLs of T-SFRNs, and the T-Spherical fuzzy rough interaction power Heronian mean operator and its weighted form are proposed. These aggregation operators can accurately express both individual and group uncertainty using T-SFRNs, capture the interaction among membership degree, abstinence degree and non-membership degree of T-SFRNs by employing IOLs, ensure the overall balance of variable values by the PA in the process of information fusion, and realize the interrelationship between attribute variables by the HM. Several properties and special cases of these aggregation operators are further presented and discussed. Subsequently, a new approach for dealing with T-spherical fuzzy multiple attribute group decision-making problems based on proposed aggregation operator is developed. Lastly, in order to validate the feasibility and reasonableness of the proposed approach, a numerical example is presented, and the superiorities of the proposed method are illustrated by describing a sensitivity analysis and a comparative analysis.