Outranking-Based Interactive Exploration of a Set of Multicriteria Alternatives

Interactive procedures are very effective for exploring sets of alternatives with a view to finding the best compromise alternative. In this paper we consider the interactive exploration of implicitly or explicitly given large sets of alternatives. Upon review of classical interactive procedures, which usually assume a utility function preference model, we distinguish three typical operations used in various interactive procedures: contraction of the explored set, exploration of some neighbourhood of a current alternative and reduction of a sample of the explored set. After pointing out some areas for improvement in the traditional procedures, we describe three interactive procedures performing the three operations respectively using an outranking relation preference model. Owing to the proposed ways of building and exploiting the outranking relation, the weak points of the traditional procedures can be overcome. Finally we solve an exemplary problem using all three procedures. © 1997 John Wiley & Sons, Ltd.     

Asymptotic learning of alphanumeric coding in autobiographical memory

Studies of autobiographical memory have shown that observed levels of incidental learning are often relatively low. Do low levels of retention result simply from a low learning rate, or is learning also asymptotic? To address this question, it is necessary to trace performance over a large number of learning opportunities, and this was carried out in the context of the recent development of widespread texting behaviour. It was found that memory for the alphanumeric layout of a phone improved as a function of sending approximately the first 500 texts, but then the improvement stopped. The incidence of memory error was incompatible with a simple power-law relation but was modelled closely by an asymptotic relation. It is suggested that this pattern reflects a movement towards automaticity in the primary task which progressively closes down the possibility that incidental learning can occur.     

训练方法对不同创造力水平儿童创造力发展的影响

采用修订的威廉斯创造性思维量表筛选出创造力水平低和创造力水平高的两组儿童,随机分配到头脑风暴法训练组、强制联想法训练组和控制组,分别进行5周的创造力训练。结果显示,在创造力的开放性和精密性维度上,头脑风暴法对创造力水平低的儿童的创造力提高具有显著的效应;两种训练方法对高创造力水平儿童的创造力成绩提高不起作用。儿童的创造力训练应考虑个体原有的创造力水平之间的差异和方法的有效性。     

态度结构一致性及其对态度和行为的影响

态度结构一致性指态度的情感或认知成分与总体态度的一致程度以及态度的情感与认知成分两者间的一致程度。本文介绍了结构一致性的界定和操作方法,回顾了结构一致性对态度和行为的影响,包括其在态度形成中的作用以及对态度可获得性和态度-行为关系的影响。同时指出未来研究应关注各种结构一致性的交互,将结构一致性研究推广到群体水平,并进一步应用于社会预警研究。     

汉语句子-图片信息整合的眼动测量

采用眼球追踪-分析法考察了“句子-图片”验证范式下句图信息整合过程中句式和语义关系类型的作用。实验结果表明：（1）汉语句子-图片信息整合过程中,句图继时呈现没有消除语义失配效应,注视次数、总注视时间显著增加,瞳孔直径扩大。语义失配会显著干扰句法难度低的句式的句图信息整合。（2）句式影响句子-图片信息的整合过程,注视次数、总注视时间、瞳孔直径随句法难度增加而增加。（3）汉语句图信息整合过程中,语义失配效应受句式影响,表现出任务的特异性,这说明成分比较模型不具有一般性     

Revisiting dispersion in count data item response theory models: The Conway–Maxwell–Poisson counts model

Count data naturally arise in several areas of cognitive ability testing, such as processing speed, memory, verbal fluency, and divergent thinking. Contemporary count data item response theory models, however, are not flexible enough, especially to account for over- and underdispersion at the same time. For example, the Rasch Poisson counts model (RPCM) assumes equidispersion (conditional mean and variance coincide) which is often violated in empirical data. This work introduces the Conway–Maxwell–Poisson counts model (CMPCM) that can handle underdispersion (variance lower than the mean), equidispersion, and overdispersion (variance larger than the mean) in general and specifically at the item level. A simulation study revealed satisfactory parameter recovery at moderate sample sizes and mostly unbiased standard errors for the proposed estimation approach. In addition, plausible empirical reliability estimates resulted, while those based on the RPCM were biased downwards (underdispersion) and biased upwards (overdispersion) when the simulation model deviated from equidispersion. Finally, verbal fluency data were analysed and the CMPCM with item-specific dispersion parameters fitted the data best. Dispersion parameter estimates indicated underdispersion for three out of four items. Overall, these findings indicate the feasibility and importance of the suggested flexible count data modelling approach.     

Combining diversity and dispersion criteria for anticlustering: A bicriterion approach

Most partitioning methods used in psychological research seek to produce homogeneous groups (i.e., groups with low intra-group dissimilarity). However, there are also applications where the goal is to provide heterogeneous groups (i.e., groups with high intra-group dissimilarity). Examples of these anticlustering contexts include construction of stimulus sets, formation of student groups, assignment of employees to project work teams, and assembly of test forms from a bank of items. Unfortunately, most commercial software packages are not equipped to accommodate the objective criteria and constraints that commonly arise for anticlustering problems. Two important objective criteria for anticlustering based on information in a dissimilarity matrix are: a diversity measure based on within-cluster sums of dissimilarities; and a dispersion measure based on the within-cluster minimum dissimilarities. In many instances, it is possible to find a partition that provides a large improvement in one of these two criteria with little (or no) sacrifice in the other criterion. For this reason, it is of significant value to explore the trade-offs that arise between these two criteria. Accordingly, the key contribution of this paper is the formulation of a bicriterion optimization problem for anticlustering based on the diversity and dispersion criteria, along with heuristics to approximate the Pareto efficient set of partitions. A motivating example and computational study are provided within the framework of test assembly.     

On Modal Logics Characterized by Models with Relative Accessibility Relations: Part II

This work is divided in two papers (Part I and Part II). In Part I, we introduced the class of Rare-logics for which the set of terms indexing the modal operators are hierarchized in two levels: the set of Boolean terms and the set of terms built upon the set of Boolean terms. By investigating different algebraic properties satisfied by the models of the Rare-logics, reductions for decidability were established by faithfully translating the Rare-logics into more standard modal logics (some of them contain the universal modal operator).In Part II, we push forward the results from Part I. For Rare-logics with nominals (present at the level of formulae and at the level of modal expressions), we show that the constructions from Part I can be extended although it is technically more involved. We also characterize a class of standard modal logics for which the universal modal operator can be eliminated as far as satifiability is concerned. Although the previous results have a semantic flavour, we are also able to define proof systems for Rare-logics from existing proof systems for the corresponding standard modal logics. Last, but not least, decidability results for Rare-logics are established uniformly, in particular for information logics derived from rough set theory.Since this paper is the continuation of Part I, we do not recall here the definitions of Part I although we refer to them.     

Doing Sociology in The Age of Globalization

The emergence of processes of globalization has gone hand in hand with a theoretical “crisis” in sociology. According to an increasing number of scholars, “global society” has transformed the “social” to such an extent that classical sociological theory and that of the nineteenth century no longer seem adequate for conceptualizing not only the “new society,” but (human) society as such. The very distinction between human and non-human society has gone lost. In this context, is it still possible to formulate a “theory of society” and what form should such a theory take?