Fuzzy Logic Programming and Fuzzy Control

We show that it is possible to base fuzzy control on fuzzy logic programming. Indeed, we observe that the class of fuzzy Herbrand interpretations gives a semantics for fuzzy programs and we show that the fuzzy function associated with a fuzzy system of IF-THEN rules is the fuzzy Herbrand interpretation associated with a suitable fuzzy program.     

Multidimensional adaptive testing with constraints on test content

The case of adaptive testing under a multidimensional response model with large numbers of constraints on the content of the test is addressed. The items in the test are selected using a shadow test approach. The 0–1 linear programming model that assembles the shadow tests maximizes posterior expected Kullback-Leibler information in the test. The procedure is illustrated for five different cases of multidimensionality. These cases differ in (a) the numbers of ability dimensions that are intentional or should be considered as nuisance dimensions and (b) whether the test should or should not display a simple structure with respect to the intentional ability dimensions.     

Cultural Lens on Mental Illness: Four Clients Share Their Perspectives

People served by mental health providers represent diverse cultural groups. In-depth qualitative interviews were used to collect data to examine: “How do people, diagnosed with a mental illness, perceive their experience in a partial care mental health program from the perspective of their cultural context?” Four participants described cultural identities that included ethnic, health status, and sexual orientation identities. The participants' way of participating in the world was often in conflict with cultural values and expectations of the family and counselors. Cultural competence must include understanding how complex, multiple cultural contexts interact and influence a person's participation in the therapeutic process.     

Combined Effects of Movement Velocity and Duration on Programming Time: Spijkers (1989) Revisited

The goal of the present study was to determine the combined effects of movement velocity and duration on motor programming. Subjects were submitted to a two-choice reaction time task that could be completed by aiming movements differing in the mean velocity at which they were to be produced as well as by their movement time. The results of the present study indicate that, in each pair of responses used, the responses having the higher mean velocity were initiated faster than those having the lower mean velocity. Contrary to Spijkers' (1989) study, the different movement time pairings did not modify the effect of movement velocity on response programming time. Moreover, the same pattern of results was observed whether or not the subjects were permitted to visually guide their ongoing movement. Thus, Spijkers' proposition, that the type of control one may use to guide an aiming movement needs to be determined before movement initiation can take place, was not confirmed.     

Motor Programming When Sequencing Multiple Elements of the Same Duration

Motor programming at the self-select paradigm was adopted in 2 experiments to examine the processing demands of independent processes. One process (INT) is responsible for organizing the internal features of the individual elements in a movement (e.g., response duration). The 2nd process (SEQ) is responsible for placing the elements into the proper serial order before execution. Participants in Experiment 1 performed tasks involving 1 key press or sequences of 4 key presses of the same duration. Implementing INT and SEQ was more time consuming for key-pressing sequences than for single key-press tasks. Experiment 2 examined whether the INT costs resulting from the increase in sequence length observed in Experiment 1 resulted from independent planning of each sequence element or via a separate "multiplier" process that handled repetitions of elements of the same duration. Findings from Experiment 2, in which participants performed single key presses or double or triple key sequences of the same duration, suggested that INT is involved with the independent organization of each element contained in the sequence. Researchers offer an elaboration of the 2-process account of motor programming to incorporate the present findings and the findings from other recent sequence-learning research.     

Regressive Imagery in Creative Problem‐Solving: Comparing Verbal Protocols of Expert and Novice Visual Artists and Computer Programmers

We applied computer‐based text analyses of regressive imagery to verbal protocols of individuals engaged in creative problem‐solving in two domains: visual art (23 experts, 23 novices) and computer programming (14 experts, 14 novices). Percentages of words involving primary process and secondary process thought, plus emotion‐related words, were tabulated. Visual art protocols were higher in primary process thought and emotion‐related words; those from programming were higher in secondary process thought. Almost no main effects of expertise or interactions were found. Correlations between the measures (particularly those involving emotion‐related words) also varied as a function of task. This pattern suggests cognitive processes vary considerably across different creative problem‐solving tasks or domains, and that a more domain‐specific approach to creative cognition may be advisable. Further implications for integrating and consolidating some extant lines of creativity research are discussed.     

Divergence Behaviour of the Successive Geometric Mean Method of Pairwise Comparison Matrix Generation for a Multiple Stage,Multiple Objective Optimization Problem

This paper focuses on the divergence behaviour of the successive geometric mean (SGM) method used to generate pairwise comparison matrices while solving a multiple stage, multiple objective (MSMO) optimization problem. The SGM method can be used in the matrix generation phase of our three‐phase methodology to obtain pairwise comparison matrix at each stage of an MSMO optimization problem, which can be subsequently used to obtain the weight vector at the corresponding stage. The weight vectors across the stages can be used to convert an MSMO problem into a multiple stage, single objective (MSSO) problem, which can be solved using dynamic programming‐based approaches. To obtain a practical set of non‐dominated solutions (also referred to as Pareto optimal solutions) to the MSMO optimization problem, it is important to use a solution approach that has the potential to allow for a better exploration of the Pareto optimal solution space. To accomplish a more exhaustive exploration of the Pareto optimal solution space, the weight vectors that are used to scalarize the MSMO optimization problem into its corresponding MSSO optimization problem should vary across the stages. Distinct weight vectors across the stages are tied directly with distinct pairwise comparison matrices across the stages. A pairwise comparison matrix generation method is said to diverge if it can generate distinct pairwise comparison matrices across the stages of an MSMO optimization problem. In this paper, we demonstrate the SGM method's divergence behaviour when the three‐phase methodology is used in conjunction with an augmented high‐dimensional, continuous‐state stochastic dynamic programming method to solve a large‐scale MSMO optimization problem. Copyright © 2013 John Wiley & Sons, Ltd.     

Evaluating Fund Performance by Compromise Programming with Linear‐Quadratic Composite Metric: An Actual Case on The CaixaBank in Spain

This paper proposes an additive measure on the basis of compromise programming to evaluate fund performance from multiple criteria, of which the most usual are profitability and risk. This proposal is motivated by the fact that compromise programming is a sound decision support model to obtain scores of alternatives by minimizing weighted distances to an ideal point, the weights reflecting the investor's preferences for the criteria. To define the distance objective function, the linear‐quadratic composite metric is used, which combines advantages of linear and non‐linear objective functions. A critical advantage of compromise programming for fund performance evaluation is that the model can be extended to more than two financial criteria while other measures currently used (either ratio‐based or leverage‐based measures) only consider two criteria, say, profitability and risk. In the application, three investor's profiles are defined, which involve different weighting systems and lead to different fund rankings. These rankings are compared with domination relationships, the latter formulating if a fund is dominated or non‐dominated by convex combinations of other funds. Numerical tables are provided with data, computational process and results, which are analysed. Copyright © 2012 John Wiley & Sons, Ltd.     

The Stochastic Goal Programming Model: Theory and Applications

Supported by a network of researchers and practitioners, the goal programming (GP) model is alive today more than ever and is continually fed with theoretical developments and new applications with resounding success. The standard formulation of the GP model was introduced in the earliest of 1960s, and since then, important extensions and numerous applications have been proposed. One of these variants is the stochastic GP model that deals with the uncertainty of some decision‐making situations by using stochastic calculus. In such a situation, the decision maker is not able to assess with certainty the different parameters. However, he or she can provide some information regarding the likelihood of occurrence of the decision‐making parameter values. The aim of this paper is to highlight the main methodological developments of the stochastic GP model and to present an overview of its applications in several domains. Copyright © 2012 John Wiley & Sons, Ltd.