How to get really smart: Modeling retest and training effects in ability testing using computer-generated figural matrix items

The interpretation of retest scores is problematic because they are potentially affected by measurement and predictive bias, which impact construct validity, and because their size differs as a function of various factors. This paper investigates the construct stability of scores on a figural matrices test and models retest effects at the level of the individual test taker as a function of covariates (simple retest vs. training, use of identical vs. parallel retest forms, and general mental ability). A total of N = 189 subjects took two tests of matrix items that were automatically generated according to a strict construction rationale. Between test administrations, participants in the intervention groups received training, while controls did not. The Rasch model fit the data at both time points, but there was a lack of item difficulty parameter invariance across time. Training increased test performance beyond simple retesting, but there was no large difference between the identical and parallel retest forms at the individual level. Individuals varied greatly in how they profited from retest experience, training, and the use of identical vs. parallel retest forms. The results suggest that even with carefully designed tasks, it is problematic to directly compare scores from initial tests and retests. Test administrators should emphasize learning potential instead of state level assessment, and inter-individual differences with regard to test experience should be taken into account when interpreting test results.     

Unconscious phantasy as a structural principle and organizer of mental life: The evolution of a concept from Freud to Klein and some of her successors

Starting with Freud's discovery of unconscious phantasy as a means of accessing his patients’ internal world, the author discusses the evolution of the concept in the work of Melanie Klein and some of her successors. Whereas Freud sees phantasy as a wish fulfilling imagination, dominated by primary process functioning and kept apart from reality testing, Klein understands phantasies as a structural function and organizer of mental life. From their very beginnings they involve object relations and gradually evolve from primitive body‐near experiences to images and symbolic representations. With her concept of projective identification in particular, Klein anticipates the communicative function of unconscious phantasies. They are at the basis of processes of symbolization, but may also be put into the service of complex defensive operations. The author traces the further evolution of the concept from the contributions of S. Isaacs, the theories of thinking proposed by W.R. Bion and R. Money‐Kyrle, Hanna Segal's ideas on symbolization and reparation all the way to the latest approaches by R. Britton, J. Steiner and others, including the understanding of transference and counter‐transference as a ‘total situation’. Points of contact with Freud are to be found particularly in connection with his concept of ‘primal phantasies’. In the author's view, the idea of the transmission and communicative potential of unconscious phantasies enabled these authors to overcome the solipsistic origins of drive theory in favour of a notion in which unconscious phantasies both set down the coordinates of the inner world and form and reflect the matrix of inter‐subjective relations.     

On the Closure Properties of the Class of Full G-models of a Deductive System

In this paper we consider the structure of the class FGModS of full generalized models of a deductive system S from a universal-algebraic point of view, and the structure of the set of all the full generalized models of S on a fixed algebra A from the lattice-theoretical point of view; this set is represented by the lattice FACS_s A of all algebraic closed-set systems C on A such that (A, C) ε FGModS. We relate some properties of these structures with tipically logical properties of the sentential logic S. The main algebraic properties we consider are the closure of FGModS under substructures and under reduced products, and the property that for any A the lattice FACS_s A is a complete sublattice of the lattice of all algebraic closed-set systems over A. The logical properties are the existence of a fully adequate Gentzen system for S, the Local Deduction Theorem and the Deduction Theorem for S. Some of the results are established for arbitrary deductive systems, while some are found to hold only for deductive systems in more restricted classes like the protoalgebraic or the weakly algebraizable ones. The paper ends with a section on examples and counterexamples. Dedicated to the memory of Willem Johannes Blok     

Selfextensional Logics with a Conjunction

A logic is selfextensional if its interderivability (or mutual consequence) relation is a congruence relation on the algebra of formulas. In the paper we characterize the selfextensional logics with a conjunction as the logics that can be defined using the semilattice order induced by the interpretation of the conjunction in the algebras of their algebraic counterpart. Using the charactrization we provide simpler proofs of several results on selfextensional logics with a conjunction obtained in [13] using Gentzen systems. We also obtain some results on Fregean logics with conjunction.This paper is a version of the invited talk at the conference Trends in Logic III, dedicated to the memory of A. MOSTOWSKI, H. RASIOWA and C. RRAUSZER, and held in Warsaw and Ruciane-Nida from 23rd to 25th September 2005.     

Heuristic Implementation of Dynamic Programming for Matrix Permutation Problems in Combinatorial Data Analysis

Dynamic programming methods for matrix permutation problems in combinatorial data analysis can produce globally-optimal solutions for matrices up to size 30×30, but are computationally infeasible for larger matrices because of enormous computer memory requirements. Branch-and-bound methods also guarantee globally-optimal solutions, but computation time considerations generally limit their applicability to matrix sizes no greater than 35×35. Accordingly, a variety of heuristic methods have been proposed for larger matrices, including iterative quadratic assignment, tabu search, simulated annealing, and variable neighborhood search. Although these heuristics can produce exceptional results, they are prone to converge to local optima where the permutation is difficult to dislodge via traditional neighborhood moves (e.g., pairwise interchanges, object-block relocations, object-block reversals, etc.). We show that a heuristic implementation of dynamic programming yields an efficient procedure for escaping local optima. Specifically, we propose applying dynamic programming to reasonably-sized subsequences of consecutive objects in the locally-optimal permutation, identified by simulated annealing, to further improve the value of the objective function. Experimental results are provided for three classic matrix permutation problems in the combinatorial data analysis literature: (a) maximizing a dominance index for an asymmetric proximity matrix; (b) least-squares unidimensional scaling of a symmetric dissimilarity matrix; and (c) approximating an anti-Robinson structure for a symmetric dissimilarity matrix. We are extremely grateful to the Associate Editor and two anonymous reviewers for helpful suggestions and corrections.     

认知诊断评价中测验结构的优化设计

Q矩阵是认知诊断评价的基础和核心要素, 它反映了测验的构念和内容设计, 直接影响着测验诊断分类的效果。本文采用Monte Carlo模拟, 研究了6种属性层级关系下, 不同的Q矩阵设计对于认知诊断效果的影响。用模式判准率的均值和标准差分别从分类准确性和稳定性的角度来评价诊断效果。实验结果表明：(1) 不同属性层级关系下, 分类准确性会随着测验长度的增加而提高, 但当测验长度增加到一定程度时, 会出现“天花板效应”; (2) Q矩阵中R*的个数(NR*)会影响测验的分类准确性及稳定性：NR*越大, 测验的分类稳定性越高, 当测验长度为属性个数的整数倍, 且NR*为测验长度相对属性个数的最大奇数倍时分类准确性最高; (3) Q矩阵中除R*以外的项目考察的属性个数会随着属性层级关系的不同对测验的分类准确性和稳定性产生不同的影响。根据实验结果, 本研究提出了进行诊断评价时Q矩阵优化设计的一些建议。     

The Suszko Operator. Part I.

The paper is conceived as a first study on the Suszko operator. The purpose of this paper is to indicate the existence of close relations holding between the properties of the Suszko operator and the structural properties of the model class for various sentential logics. The emphasis is put on generality both of the results and methods of tackling the problems that arise in the theory of this operator. The attempt is made here to develop the theory for non-protoalgebraic logics.     

Identifying a Reordering of Rows and Columns for Multiple Proximity Matrices Using Multiobjective Programming

This paper is concerned with a problem where K (n×n) proximity matrices are available for a set of n objects. The goal is to identify a single permutation of the n objects that provides an adequate structural fit, as measured by an appropriate index, for each of the K matrices. A multiobjective programming approach for this problem, which seeks to optimize a weighted function of the K indices, is proposed, and illustrative examples are provided using a set of proximity matrices from the psychological literature. These examples show that, by solving the multiobjective programming model under different weighting schemes, the quantitative analyst can uncover information about the relationships among the matrices and often identify one or more permutations that provide good to excellent index values for all matrices.     

采用理想点方法检验生活取向测验及其修订版的单维性

该文从项目反应过程出发,认为可能是由于原有的维度分析方法将生活取向测验（LOT）及其修订版（LOT-R）这两个测验的项目反应理想点过程错误地限定为优势过程,导致两个测验违背单维性的结论;进而采用主成分分析的未旋转成分负荷散点图和对应分析的维度分数散点图,并结合项目相关矩阵法验证LOT和LOT-R的维度。结果显示LOT-R的单维性得到了验证,LOT由于包含两个测量应对的项目而导致违背单维性。最后作者提出应该与理想点过程相一致的心理计量学模型对LOT-R的数据进行分析。     

Tatsuoka 矩阵理论的修正

K .K.Tatsuoka和她同事开发的规则空间模型（RSM）是一种在国内外有较大影响的认知诊断模型,但是Tatsuoka的RSM中 矩阵理论存在缺陷和错误,这些失误使得RSM中用布尔描述函数（BDF）计算被试理想项目反应模式（IRP）的方法缺乏理论依据。这里揭示了Tatsuoka的 矩阵理论的缺陷和错误并引进既不使用BDF又便于应用的计算IRP的方法;接着还介绍一种由可达阵计算简化 阵的方法,该方法显示了可达阵在构造认知诊断测验的重要性。这些结果对丰富 矩阵理论及正确使用RSM进行认知诊断有一定的意义