Informatica

A complex spherical fuzzy set (CSFS) is a generalization of the spherical fuzzy set (SFS) to express the two-dimensional ambiguous information in which the range of positive, neutral and negative degrees occurs in the complex plane with the unit disk. Considering the vital importance of the concept of CSFSs which is gaining massive attention in the research area of two-dimensional uncertain information, we aim to establish a novel methodology for multi-criteria group decision-making (MCGDM). This methodology allows us to calculate both the weights of the decision-makers (DMs) and the weights of the criteria objectively. For this goal, we first introduce a new entropy measure function that measures the fuzziness degree associated with a CSFS to compute the unknown criteria weights in this methodology. Then, we present an innovative Complex Proportional Assessment (COPRAS) method based on the proposed entropy measure in the complex spherical fuzzy environment. Besides, we solve a strategic supplier selection problem which is very important to maximize the efficiency of the trading companies. Finally, we present some comparative analyses with some existing methods in different set theories, including the entropy measures, to show the feasibility and usefulness of the proposed method in the decision-making process.

As the tourism and mobile internet develop, car sharing is becoming more and more popular. How to select an appropriate car sharing platform is an important issue to tourists. The car sharing platform selection can be regarded as a kind of multi-attribute group decision making (MAGDM) problems. The probabilistic linguistic term set (PLTS) is a powerful tool to express tourists’ evaluations in the car sharing platform selection. This paper develops a probabilistic linguistic group decision making method for selecting a suitable car sharing platform. First, two aggregation operators of PLTSs are proposed. Subsequently, a fuzzy entropy and a hesitancy entropy of a PLTS are developed to measure the fuzziness and hesitancy of a PLTS, respectively. Combining the fuzzy entropy and hesitancy entropy, a total entropy of a PLTS is generated. Furthermore, a cross entropy between PLTSs is proposed as well. Using the total entropy and cross entropy, DMs’ weights and attribute weights are determined, respectively. By defining preference functions with PLTSs, an improved PL-PROMETHEE approach is developed to rank alternatives. Thereby, a novel method is proposed for solving MAGDM with PLTSs. A car sharing platform selection is examined at length to show the application and superiority of the proposed method.

This paper reviews the existing definitions and formulas of entropy for interval-valued intuitionistic fuzzy sets (IVIFSs) and demonstrates that they cannot fully capture the uncertainty of IVIFSs. Then considering both fuzziness and intuitionism of IVIFSs, we introduce a novel axiomatic definition of entropy for IVIFSs and develop several entropy formulas. Example analyses show that the developed entropy formulas can fully reflect both fuzziness and intuitionism of IVIFSs. Furthermore, based on the entropy formulas of IVIFSs, a method is proposed to solve multi-attribute decision making problems with IVIFSs. Additionally, an investment alternative selection example is provided to validate the practicality and effectiveness of the method.

Generating sequences of random numbers or bits is a necessity in many situations (cryptography, modeling, simulations, etc…). Those sequences must be random in the sense that their behavior should be unpredictable. For example, the security of many cryptographic systems depends on the generation of unpredictable values to be used as keys. Since randomness is related to the unpredictable property, it can be described in probabilistic terms, studying the randomness of a sequence by means of a hypothesis test. A new statistical test for randomness of bit sequences is proposed in the paper. The created test is focused on determining the number of different fixed length patterns that appear along the binary sequence. When ‘few’ distinct patterns appear in the sequence, the hypothesis of randomness is rejected. On the contrary, when ‘many’ different patterns appear in the sequence, the hypothesis of randomness is accepted.

The development of Lithuanian HMM/ANN speech recognition system, which combines artificial neural networks (ANNs) and hidden Markov models (HMMs), is described in this paper. A hybrid HMM/ANN architecture was applied in the system. In this architecture, a fully connected three‐layer neural network (a multi‐layer perceptron) is trained by conventional stochastic back‐propagation algorithm to estimate the probability of 115 context‐independent phonetic categories and during recognition it is used as a state output probability estimator. The hybrid HMM/ANN speech recognition system based on Mel Frequency Cepstral Coefficients (MFCC) was developed using CSLU Toolkit. The system was tested on the VDU isolated‐word Lithuanian speech corpus and evaluated on a speaker‐independent ∼750 distinct isolated‐word recognition task. The word recognition accuracy obtained was about 86.7%.