An approach ton-mode components analysis

As an extension of Lastovicka's four-mode components analysis ann-mode components analysis is developed. Using a convenient notation, both a canonical and a least squares solution are derived. The relation between both solutions and their computational aspects are discussed.The first draft was written while Wansbeek was with the Netherlands Central Bureau of Statistics. We thank Jaap Verhees for performing the computations and for many discussions on the subject, John Lastovicka for kindly making available his data to us, and the Editor, the referees, Jeroen Weesie and Pieter Kroonenberg for their useful comments.     

A contribution to the study of the metric and Euclidean structures of dissimilarities

This paper is concerned with the geometric properties of dissimilarity coefficients defined on finite sets and especially with their Euclidean nature. We present several particular transformations which preserve Euclideanarity and we complete, through the study of a one-parameter family, the current knowledge of the metric and Euclidean structure of coefficients based on binary data. These results are directly deduced from two theorems which prove the positive semi-definite status of some quadratic forms which play a large role in some definitions of dissimilarity commonly used.The authors wish to thank B. Fichet for his helpful suggestions, the associate Editor and an anonymous reviewer for comments and highly constructive criticisms on earlier drafts of the paper.     

Convergence properties of an iterative procedure of ipsatizing and standardizing a data matrix,with applications to parafac/candecomp preprocessing

Centering a matrix row-wise and rescaling it column-wise to a unit sum of squares requires an iterative procedure. It is shown that this procedure converges to a stable solution. This solution need not be centered row-wise if the limiting point of the interations is a matrix of rank one. The results of the present paper bear directly on several types of preprocessing methods in Parafac/Candecomp.     

Constrained multidimensional unfolding of confusion matrices: Goal point and slide vector models

Two constrained multidimensional unfolding models, the goal point and slide vector models, are proposed for analyzing confusion matrices. In both models, the row and column stimuli are expressed as two sets of points in a low-dimensional space, where the difference vector connecting a column point to the corresponding row point indicates the change in the stimulus representation through a cognitive process. The difference vector is constrained by the hypothesis that the trend in the representational change is invariant across stimuli: the goal point model constrains all difference vectors to point toward a single point, and the slide vector model constrains all difference vectors to be parallel to each other. In both models the coordinates of points are estimated by the maximum-likelihood method. Examples illustrate that the two models allow us to examine hypotheses about invariant trends in representational changes and to grasp such trends from the resulting configurations.     

Quasivarieties Generated by Simple MV-algebras

In this paper we show that the quasivariety generated by an infinite simple MV-algebra only depends on the rationals which it contains. We extend this property to arbitrary families of simple MV-algebras.     

Offending Patterns of Serial Sex Offenders: Escalation,De‐escalation,and Consistency of Sexually Intrusive and Violent Behaviours

A series of stranger sexual assaults poses considerable obstacles for law enforcement officials. One such preoccupation is concerned with whether or not the offender will escalate in the severity of his behaviours with subsequent victims. The current study uses transition matrices to address whether or not the offending patterns of 72 serial stranger sex offenders change from one victim to the next as it pertains to their sexual acts and level of physical force used during the crime. Findings indicate that stability, specifically the offender's intrusive sexual acts and use of physical force, and versatility are present in this sample's offending patterns. To explain changes in offending patterns between victims, multinomial regression analyses indicate that situational factors and modus operandi strategies are important considerations. Implications for investigations are discussed. Copyright © 2013 John Wiley & Sons, Ltd.     

高血压病患者双向转诊临床路径的效果效益评价

为了评价高血压病患者双向转诊临床路径的效果效益,采用病例查阅、专家咨询、现场考察、试点研究、个人访谈等方法,评价试验组和对照组高血压患者双向转诊临床路径的效果效益.结果显示,试验组首次就诊时间和再次就诊率与对照组间差异有统计学意义(P＜0.05);两组间医疗费用和对医护人员服务态度满意率差异有统计学意义(P＜0.05);两组间治疗效果差异无统计学意义(P＞0.05),提示实施高血压病患者双向转诊临床路径有很好的社会和经济效益.     

Rough Sets and 3-Valued Logics

In the paper we explore the idea of describing Pawlak’s rough sets using three-valued logic, whereby the value t corresponds to the positive region of a set, the value f — to the negative region, and the undefined value u — to the border of the set. Due to the properties of the above regions in rough set theory, the semantics of the logic is described using a non-deterministic matrix (Nmatrix). With the strong semantics, where only the value t is treated as designated, the above logic is a “common denominator” for Kleene and Łukasiewicz 3-valued logics, which represent its two different “determinizations”. In turn, the weak semantics—where both t and u are treated as designated—represents such a “common denominator” for two major 3-valued paraconsistent logics. We give sound and complete, cut-free sequent calculi for both versions of the logic generated by the rough set Nmatrix. Then we derive from these calculi sequent calculi with the same properties for the various “determinizations” of those two versions of the logic (including Łukasiewicz 3-valued logic). Finally, we show how to embed the four above-mentioned determinizations in extensions of the basic rough set logics obtained by adding to those logics a special two-valued “definedness” or “crispness” operator.     

The generalized Logit-Linear Item Response Model for Binary-Designed Items

This paper introduces the generalized logit-linear item response model (GLLIRM), which represents the item-solving process as a series of dichotomous operations or steps. The GLLIRM assumes that the probability function of the item response is a logistic function of a linear composite of basic parameters which describe the operations, and the coefficients depend on three design matrices X, Y and Z. The GLLIRM provides a tool for testing hypotheses on the item-solving process and generalizes existing models. An empirical application is included, in which the model is applied to evaluate sources of difficulty and pairwise item interactions in a logical analysis test. This research was supported by the Comunidad de Madrid grant CCG06-UAM/ESP-0043.     

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.