Search

This paper proposes a new image hashing method, which uses histogram reconstruction to solve the problem of the histogram not being sensitive to the change of pixel position, while ensuring the robustness of the hashing algorithm against common content preservation attacks (such as blurring, noise addition and rotation). The proposed algorithm can resist arbitrary angles of rotation, possibly because the reconstructed histogram leverages the rotational symmetry and its own invariance to rotation operations. We measure the similarity between different images by calculating the Hamming distance of the hash vectors of different images. Our experiments show that the proposed method performs well in robustness and discrimination compared with other established algorithms. In addition, we conduct a receiver operating characteristic curve analysis to further verify the superior overall performance of our image hash method. [ABSTRACT FROM AUTHOR]

Multi-attribute group decision making is widely used in the real world, and many scholars have done a lot of research on it. The public's focus on emergencies can provide an important reference for emergency handling decision making in the social media big data environment. Due to the complexity of emergency handling decision making, the asymmetry of user evaluation information is easy to cause the loss of important information. It is very important to mine valuable information for decision making through online reviews. Then, a generalized extended hybrid distance measure method between the probabilistic linguistic term sets is proposed. Based on this, an extended GDMD-PROMETHEE large-scale multi-attribute group decision-making method is proposed as well, which can be used to decision making under symmetric information and asymmetric information. Firstly, web crawler technology is used to explore the topics of public concern of emergency handling on social media platforms, and use k -means cluster analysis to classify the crawling variables, then the attributes and subjective weights of emergency handling plans are obtained by TF-IDF and Word2vec technology. Secondly, in order to better retain the linguistic evaluation information from decision-makers, a new generalized probabilistic hybrid distance measure method based on Hamming distance is proposed. Considering the difference of decision makers' evaluation, the objective weight of decision makers is calculated by combining the maximum deviation method with the new extended hybrid Euclidean distance. On this basis, the comprehensive weights of the attributes are calculated by combining subjective and objective factors. Meanwhile, this paper realizes the distance measures and information fusion of probabilistic linguistic term sets under cumulative prospect theory, and the ranking results of the emergency handling plans based on the extended GDMD-PROMETHEE algorithm are given. Finally, the feasibility and effectiveness of the extended GDMD-PROMETHEE algorithm are verified by the case study of the explosion accident handling decision making of Shanghai "6.18" Petrochemical, and the comparative analyses between the several traditional algorithms demonstrate the extended GDMD-PROMETHEE algorithm is more scientific and superior in this paper. [ABSTRACT FROM AUTHOR]

In this article, we investigate the formation of reversible cyclic codes (i.e., its codewords forms a symmetry) over the ring S = F 2 + u F 2 + u 2 F 2 , where u 3 = 0 . We find a unique set of generators for cyclic codes over S and classify reversible cyclic codes to their generators. The dual reversible cyclic codes are studied as well. Moreover, we provide some examples of reversible cyclic codes. [ABSTRACT FROM AUTHOR]

A hypercube is a graph whose nodes can be labeled by binary vectors such that the distance between the binary addresses in the graph is the Hamming distance. Due to the symmetry of the hypercube, one usually considers the graph embedded in the hypercube proportionally in distance, meaning that the l 1 -graphs. In this paper, we determine the l 1 -embeddability of hypertrees and unicyclic hypergraphs. [ABSTRACT FROM AUTHOR]

With regard to the interval number-based uncertain multi-attribute decision making problem, in which the attribute weights are unknown and there is no preference on decision-making alternative objects, this paper presents a new decision-making approach. In this method, Hamming distance firstly is used to define the Hamming similarity degree of normative interval numbers, and the Hamming similarity degree of decision-making alternative objects, and then the Hamming similarity superiority relation theory to the comparison of interval numbers is proposed and some relevant results are obtained. Thus, by drawing on the idea of deviations maximization, an interval number-based decision-making object Hamming similarity programming model (IN-DMOHSPM) is established to calculate and solve the weight vector of attributes. Next, all of the selected alternative objects set is screened and sorted by using the overall Hamming similarity degree of each decision-making object compared with the ideal optimal object, and a new algorithm of Hamming similarity programming model for interval number-based multiple attribute decision-making objects is presented. Finally, the feasibility and utility of this model used in this paper are demonstrated by a numerical example. [ABSTRACT FROM AUTHOR]

Particle swarm optimization (PSO) is a promising method for feature selection. When using PSO to solve the feature selection problem, the probability of each feature being selected and not being selected is the same in the beginning and is optimized during the evolutionary process. That is, the feature selection probability is optimized from symmetry (i.e., 50% vs. 50%) to asymmetry (i.e., some are selected with a higher probability, and some with a lower probability) to help particles obtain the optimal feature subset. However, when dealing with large-scale features, PSO still faces the challenges of a poor search performance and a long running time. In addition, a suitable representation for particles to deal with the discrete binary optimization problem of feature selection is still in great need. This paper proposes a compressed-encoding PSO with fuzzy learning (CEPSO-FL) for the large-scale feature selection problem. It uses the N-base encoding method for the representation of particles and designs a particle update mechanism based on the Hamming distance and a fuzzy learning strategy, which can be performed in the discrete space. It also proposes a local search strategy to dynamically skip some dimensions when updating particles, thus reducing the search space and reducing the running time. The experimental results show that CEPSO-FL performs well for large-scale feature selection problems. The solutions obtained by CEPSO-FL contain small feature subsets and have an excellent performance in classification problems. [ABSTRACT FROM AUTHOR]

Aristotelian diagrams visualize the logical relations among a finite set of objects. These diagrams originated in philosophy, but recently, they have also been used extensively in artificial intelligence, in order to study (connections between) various knowledge representation formalisms. In this paper, we develop the idea that Aristotelian diagrams can be fruitfully studied as geometrical entities. In particular, we focus on four polyhedral Aristotelian diagrams for the Boolean algebra B4, viz. the rhombic dodecahedron, the tetrakis hexahedron, the tetraicosahedron and the nested tetrahedron. After an in-depth investigation of the geometrical properties and interrelationships of these polyhedral diagrams, we analyze the correlation (or lack thereof) between logical (Hamming) and geometrical (Euclidean) distance in each of these diagrams. The outcome of this analysis is that the Aristotelian rhombic dodecahedron and tetrakis hexahedron exhibit the strongest degree of correlation between logical and geometrical distance; the tetraicosahedron performs worse; and the nested tetrahedron has the lowest degree of correlation. Finally, these results are used to shed new light on the relative strengths and weaknesses of these polyhedral Aristotelian diagrams, by appealing to the congruence principle from cognitive research on diagram design. [ABSTRACT FROM AUTHOR]

The similarity patterns of the genetic code result from similar codons encoding similar messages. We develop a new mathematical model to analyze these patterns. The physicochemical characteristics of amino acids objectively quantify their differences and similarities; the Hamming metric does the same for the 64 codons of the codon set. (Hamming distances equal the number of different codon positions: AAA and AAC are at 1-distance; codons are maximally at 3-distance.) The CodonPolytope, a 9-dimensional geometric object, is spanned by 64 vertices that represent the codons and the Euclidian distances between these vertices correspond one-to-one with intercodon Hamming distances. The CodonGraph represents the vertices and edges of the polytope; each edge equals a Hamming 1-distance. The mirror reflection symmetry group of the polytope is isomorphic to the largest permutation symmetry group of the codon set that preserves Hamming distances. These groups contain 82,944 symmetries. Many polytope symmetries coincide with the degeneracy and similarity patterns of the genetic code. These code symmetries are strongly related with the face structure of the polytope with smaller faces displaying stronger code symmetries. Splitting the polytope stepwise into smaller faces models an early evolution of the code that generates this hierarchy of code symmetries. The canonical code represents a class of 41,472 codes with equivalent symmetries; a single class among an astronomical number of symmetry classes comprising all possible codes. [ABSTRACT FROM AUTHOR]

Neutrosophic sets have been recognized as an effective approach in solving complex decision-making (DM) problems, mainly when such problems are related to uncertainties, as published in numerous articles thus far. The use of the three membership functions that can be used to express accuracy, inaccuracy, and indeterminacy during the evaluation of alternatives in multiple-criteria DM can be said to be a significant advantage of these sets. By utilizing these membership functions, neutrosophic sets provide an efficient and flexible approach to the evaluation of alternatives, even if DM problems are related to uncertainty and predictions. On the other hand, the TOPSIS method is a prominent multiple-criteria decision-making method used so far to solve numerous decision-making problems, and many extensions of the TOPSIS method are proposed to enable the use of different types of fuzzy as well as neutrosophic sets. Therefore, a novel extension of the TOPSIS method adapted for the use of single-valued neutrosophic sets was considered in this paper. [ABSTRACT FROM AUTHOR]

Decision making under uncertainty describes situations that consider a profound lack of knowledge, where the functional form is completely unknown, and often, the relevant input and output variables are unknown as well. Data, being the vital input of decision making, contain a dissimilar level of imprecision that necessitates different approaches for making a proper and legitimate decision. In this article, we propose the concept of the intuitionistic type-2 fuzzy set (IT2FS). Several arithmetic operations on IT2FS such as union, intersection, complement, containment, etc., are defined, and the related algebraic properties of IT2FS are also studied. Subsequently, we define two new operators, namely the necessity operator and the possibility operator, to convert an IT2FS into an ordinary T2FS, and then discuss some of their basic properties. Moreover, in this study, two distance measures, the Hamming distance and Euclidian distance of IT2FS, are proposed, and their applications are illustrated with an example. [ABSTRACT FROM AUTHOR]

It is well known that there are some unfavorable shortcomings in the ordinary operational rules (OORs) of intuitionistic fuzzy number (IFN), and there exists a close and forceful connection between the intuitionistic fuzzy set (IFS) and Dempster-Shafer Theory (DST). We can utilize this relationship to present a transparent and fruitful semantic framework for IFS in terms of DST. In the framework of DST, an IFN can be converted into a basic probability assignment (BPA) and operations on IFNs can be represented as operations on a belief interval (BI), which can break away from the revealed shortcomings of the OORs of the IFN. Although there are many operators to aggregate the IFN, the operator to aggregate the BPA is rare. The Maclaurin symmetric mean (MSM) operator has the advantage of considering interrelationships among any number of attributes. The power average (PA) operator can reduce the influences of extreme evaluation values. In addition, for measuring the difference between IFNs, we replace the Hamming distance and Euclidean distance with the Jousselme distance (JD). In this paper, we develop an intuitionistic fuzzy power MSM (IFPMSMDST) operator and an intuitionistic fuzzy weighted power MSM (IFPWMSMDST) operator in the framework of the DST and provide their favorable properties. Then, we propose a novel method based on the proposed operators to solve multi-attribute decision-making (MADM) problems without intermediate defuzzification when their attributes and weights are both IFNs. Finally, some examples are utilized to demonstrate that the proposed methods outperform the previous ones. [ABSTRACT FROM AUTHOR]

Information measures play an important role in the interval neutrosophic sets (INS) theory. The main purpose of this paper is to study the similarity and entropy of INS and its application in multi-attribute decision-making. We propose a new inclusion relation between interval neutrosophic sets where the importance of the three membership functions may be different. Then, we propose the axiomatic definitions of the similarity measure and entropy of the interval neutrosophic set (INS) based on the new inclusion relation. Based on the Hamming distance, cosine function and cotangent function, some new similarity measures and entropies of INS are constructed. Finally, based on the new similarity and entropy, we propose a multi-attribute decision-making method and illustrate that these new similarities and entropies are reasonable and effective. [ABSTRACT FROM AUTHOR]

Making predictions according to historical values has long been regarded as common practice by many researchers. However, forecasting solely based on historical values could lead to inevitable over-complexity and uncertainty due to the uncertainties inside, and the random influence outside, of the data. Consequently, finding the inherent rules and patterns of a time series by eliminating disturbances without losing important details has long been a research hotspot. In this paper, we propose a novel forecasting model based on multi-valued neutrosophic sets to find fluctuation rules and patterns of a time series. The contributions of the proposed model are: (1) using a multi-valued neutrosophic set (MVNS) to describe the fluctuation patterns of a time series, the model could represent the fluctuation trend of up, equal, and down with degrees of truth, indeterminacy, and falsity which significantly preserve details of the historical values; (2) measuring the similarities of different fluctuation patterns by the Hamming distance could avoid the confusion caused by incomplete information from limited samples; and (3) introducing another related time series as a secondary factor to avoid warp and deviation in inferring inherent rules of historical values, which could lead to more comprehensive rules for further forecasting. To evaluate the performance of the model, we explored the Taiwan Stock Exchange Capitalization Weighted Stock Index (TAIEX) as the major factor we forecast, and the Dow Jones Index as the secondary factor to facilitate the predicting of the TAIEX. To show the universality of the model, we applied the proposed model to forecast the Shanghai Stock Exchange Composite Index (SHSECI) as well. [ABSTRACT FROM AUTHOR]

Interval neutrosophic fuzzy decision making is an important part of decision making under uncertainty, which is based on preference order. In this study, a new multi-valued interval neutrosophic fuzzy multiple attribute decision making method has been developed by integrating the DEMATEL (decision making trial and evaluation laboratory) method and the TOPSIS (the technique for order preference by similarity to an ideal solution) method. Evaluation values are given in the form of multi-valued interval neutrosophic fuzzy values. By using DEMATEL, dependencies among attributes can be modeled, and attribute weights are determined. The normalized Euclidean distance and the normalized Hamming distance between multi-valued interval neutrosophic fuzzy values are defined. Alternatives are ranked by using the TOPSIS method based on the distance measures. The truck selection problem in the logistics industry is presented to illustrate the feasibility and practical advantages of the proposed method. Some comparisons of the new method with other methods are also made. [ABSTRACT FROM AUTHOR]