Search

Two critical tasks in multi-criteria group decision making (MCGDM) are to describe criterion values and to aggregate the described information to generate a ranking of alternatives. A flexible and superior tool for the first task is q-rung orthopair fuzzy number (qROFN) and an effective tool for the second task is aggregation operator. So far, nearly thirty different aggregation operators of qROFNs have been presented. Each operator has its distinctive characteristics and can work well for specific purpose. However, there is not yet an operator which can provide desirable generality and flexibility in aggregating criterion values, dealing with the heterogeneous interrelationships among criteria, and reducing the influence of extreme criterion values. To provide such an aggregation operator, Muirhead mean operator, power average operator, partitioned average operator, and Archimedean T-norm and T-conorm operations are concurrently introduced into q-rung orthopair fuzzy sets, and an Archimedean power partitioned Muirhead mean operator of qROFNs and its weighted form are presented and a MCGDM method based on the weighted operator is proposed in this paper. The generalised expressions of the two operators are firstly defined. Their properties are explored and proved and their specific expressions are constructed. On the basis of the specific expressions, a method for solving the MCGDM problems based on qROFNs is then designed. Finally, the feasibility and effectiveness of the method is demonstrated via a numerical example, a set of experiments, and qualitative and quantitative comparisons. [ABSTRACT FROM AUTHOR]

Managing the biodiversity extinction crisis requires wise decision-making processes able to account for the limited resources available. In most decision problems in conservation biology, several conflicting objectives have to be taken into account. Most methods used in conservation either provide suboptimal solutions or use strong assumptions about the decision-maker’s preferences. Our paper reviews some of the existing approaches to solve multi-objective decision problems and presents new multi-objective linear programming formulations of two multi-objective optimization problems in conservation, allowing the use of a reference point approach. Reference point approaches solve multi-objective optimization problems by interactively representing the preferences of the decision-maker with a point in the criteria (objectives) space, called the reference point. We modelled and solved the following two problems in conservation: a dynamic multi-species management problem under uncertainty and a spatial allocation resource management problem. Results show that the reference point method outperforms classic methods while illustrating the use of an interactive methodology for solving combinatorial problems with multiple objectives. The method is general and can be adapted to a wide range of ecological combinatorial problems. [ABSTRACT FROM AUTHOR]

Muirhead mean (MM) is a well-known aggregation operator which can consider interrelationships among any number of arguments assigned by a variable vector. Besides, it is a universal operator since it can contain other general operators by assigning some special parameter values. However, the MM can only process the crisp numbers. Inspired by the MM’ advantages, the aim of this paper is to extend MM to process the intuitionistic fuzzy numbers (IFNs) and then to solve the multi-attribute group decision making (MAGDM) problems. Firstly, we develop some intuitionistic fuzzy Muirhead mean (IFMM) operators by extending MM to intuitionistic fuzzy information. Then, we prove some properties and discuss some special cases with respect to the parameter vector. Moreover, we present two new methods to deal with MAGDM problems with the intuitionistic fuzzy information based on the proposed MM operators. Finally, we verify the validity and reliability of our methods by using an application example, and analyze the advantages of our methods by comparing with other existing methods. [ABSTRACT FROM AUTHOR]

Humans and other animals are able to discover underlying statistical structure in their environments and exploit it to achieve efficient and effective performance. However, such structure is often difficult to learn and use because it is obscure, involving long-range temporal dependencies. Here, we analysed behavioural data from an extended experiment with rats, showing that the subjects learned the underlying statistical structure, albeit suffering at times from immediate inferential imperfections as to their current state within it. We accounted for their behaviour using a Hidden Markov Model, in which recent observations are integrated with evidence from the past. We found that over the course of training, subjects came to track their progress through the task more accurately, a change that our model largely attributed to improved integration of past evidence. This learning reflected the structure of the task, decreasing reliance on recent observations, which were potentially misleading. [ABSTRACT FROM AUTHOR]

Linguistic neutrosophic numbers (LNNs) can easily describe the incomplete and indeterminate information by the truth, indeterminacy, and falsity linguistic variables (LVs), and the Hamy mean (HM) operator is a good tool to deal with multiple attribute group decision making (MAGDM) problems because it can capture the interrelationship among the multi-input arguments. Motivated by these ideas, we develop linguistic neutrosophic HM (LNHM) operator and weighted linguistic neutrosophic HM (WLNHM) operator. Some desirable properties and special cases of two operators are discussed in detail. Furthermore, considering the situation in which the decision makers (DMs) can’t give the suitable weight of each attribute directly from various reasons, we propose the concept of entropy for linguistic neutrosophic set (LNS) to obtain the attribute weight vector objectively, and then the method for MAGDM problems with LNNs is proposed, and some examples are used to illustrate the effectiveness and superiority of the proposed method by comparing with the existing methods. [ABSTRACT FROM AUTHOR]

Decision-making in the real world presents the challenge of requiring flexible yet prompt behavior, a balance that has been characterized in terms of a trade-off between a slower, prospective goal-directed model-based (MB) strategy and a fast, retrospective habitual model-free (MF) strategy. Theory predicts that flexibility to changes in both reward values and transition contingencies can determine the relative influence of the two systems in reinforcement learning, but few studies have manipulated the latter. Therefore, we developed a novel two-level contingency change task in which transition contingencies between states change every few trials; MB and MF control predict different responses following these contingency changes, allowing their relative influence to be inferred. Additionally, we manipulated the rate of contingency changes in order to determine whether contingency change volatility would play a role in shifting subjects between a MB and MF strategy. We found that human subjects employed a hybrid MB/MF strategy on the task, corroborating the parallel contribution of MB and MF systems in reinforcement learning. Further, subjects did not remain at one level of MB/MF behaviour but rather displayed a shift towards more MB behavior over the first two blocks that was not attributable to the rate of contingency changes but rather to the extent of training. We demonstrate that flexibility to contingency changes can distinguish MB and MF strategies, with human subjects utilizing a hybrid strategy that shifts towards more MB behavior over blocks, consequently corresponding to a higher payoff. [ABSTRACT FROM AUTHOR]

We present a method to solve the binding problem by using a quantum algorithm for the retrieval of associations from associative memory during visual scene analysis. The problem is solved by mapping the information representing different objects into superposition by using entanglement and Grover’s amplification algorithm. [ABSTRACT FROM AUTHOR]

The Other-Race Effect (ORE) is the robust and well-established finding that people are generally poorer at facial recognition of individuals of another race than of their own race. Over the past four decades, much research has focused on the ORE because understanding this phenomenon is expected to elucidate fundamental face processing mechanisms and the influence of experience on such mechanisms. Several recent studies of the ORE in which the eye-movements of participants viewing own- and other-race faces were tracked have, however, reported highly conflicting results regarding the presence or absence of differential patterns of eye-movements to own- versus other-race faces. This discrepancy, of course, leads to conflicting theoretical interpretations of the perceptual basis for the ORE. Here we investigate fixation patterns to own- versus other-race (African and Chinese) faces for Caucasian participants using different analysis methods. While we detect statistically significant, though subtle, differences in fixation pattern using an Area of Interest (AOI) approach, we fail to detect significant differences when applying a spatial density map approach. Though there were no significant differences in the spatial density maps, the qualitative patterns matched the results from the AOI analyses reflecting how, in certain contexts, Area of Interest (AOI) analyses can be more sensitive in detecting the differential fixation patterns than spatial density analyses, due to spatial pooling of data with AOIs. AOI analyses, however, also come with the limitation of requiring a priori specification. These findings provide evidence that the conflicting reports in the prior literature may be at least partially accounted for by the differences in the statistical sensitivity associated with the different analysis methods employed across studies. Overall, our results suggest that detection of differences in eye-movement patterns can be analysis-dependent and rests on the assumptions inherent in the given analysis. [ABSTRACT FROM AUTHOR]