组块紧密性导致组块破解困难：部件类型还是交错关系？

本研究的目的是澄清“组块紧密性为何导致组块破解困难”。研究基于汉字减法任务,也即让被试从一个源汉字中移动一个目标部件从而得到一个新汉字,在三个实验中检验了部件类型和交错关系的作用。结果显示,交错条件比非交错条件解答率更低反应时更长;而部件类型效应则主要体现在非交错条件的反应时指标上。结果提示,组块紧密性导致了组块破解困难,这主要取决于空间交错关系;相对的,部件类型作用较小。     

顿悟式组块破解的时间进程：ERP研究

本研究旨在探讨顿悟式组块破解的信息加工机制及神经动态变化。被试完成汉字拆解任务,也即从一个源汉字中移动部件从而得到有效汉字。研究操纵部件之间在空间交错背景下的类别关系：同类（移动部件和剩余部件都是汉字）和异类（移动部件是笔画,剩余部件是汉字）。与此同时记录事件相关电位变化。结果显示,同类条件比异类条件引发了更大的N2波动和减小的LPC波动。早期的N2效应可能提示了组块破解过程中的识别困难,而晚期的LPC效应可能提示了组块破解过程中的知觉转换困难。     

Regularized Partial and/or Constrained Redundancy Analysis

Methods of incorporating a ridge type of regularization into partial redundancy analysis (PRA), constrained redundancy analysis (CRA), and partial and constrained redundancy analysis (PCRA) were discussed. The usefulness of ridge estimation in reducing mean square error (MSE) has been recognized in multiple regression analysis for some time, especially when predictor variables are nearly collinear, and the ordinary least squares estimator is poorly determined. The ridge estimation method was extended to PRA, CRA, and PCRA, where the reduced rank ridge estimates of regression coefficients were obtained by minimizing the ridge least squares criterion. It was shown that in all cases they could be obtained in closed form for a fixed value of ridge parameter. An optimal value of the ridge parameter is found by G-fold cross validation. Illustrative examples were given to demonstrate the usefulness of the method in practical data analysis situations. We thank Jim Ramsay for his insightful comments on an earlier draft of this paper. The work reported in this paper is supported by Grants 10630 from the Natural Sciences and Engineering Research Council of Canada to the first author.     

Principal component analysis with external information on both subjects and variables

A method for structural analysis of multivariate data is proposed that combines features of regression analysis and principal component analysis. In this method, the original data are first decomposed into several components according to external information. The components are then subjected to principal component analysis to explore structures within the components. It is shown that this requires the generalized singular value decomposition of a matrix with certain metric matrices. The numerical method based on the QR decomposition is described, which simplifies the computation considerably. The proposed method includes a number of interesting special cases, whose relations to existing methods are discussed. Examples are given to demonstrate practical uses of the method.The work reported in this paper was supported by grant A6394 from the Natural Sciences and Engineering Research Council of Canada to the first author. Thanks are due to Jim Ramsay, Haruo Yanai, Henk Kiers, and Shizuhiko Nishisato for their insightful comments on earlier versions of this paper. Jim Ramsay, in particular, suggested the use of the QR decomposition, which simplified the presentation of the paper considerably.     

Gleaning in the field of dual scaling

Some historical background and preliminary technical information are first presented, and then a number of hidden, but important, methodological aspects of dual scaling are illustrated and discussed: normed versus projected weights, the amount of information accounted for by each solution, a perfect solution to the problem of multidimensional unfolding, multidimensional quantification space, graphical display, number-of-option problems, option standardization versus item standardization, and asymmetry of symmetric (dual) scaling. Contrary to the common perception that dual scaling and similar quantification methods are now mathematically transparent, the present study demonstrates how much more needs to be clarified for routine use of the method to arrive at valid conclusions. Data analysis must be carried out in such a way that common sense, intuition and sound logic will prevail.Presidential Address delivered at the Annual Meeting of the Psychometric Society, Banff Centre for Conferences, Banff, Alberta, Canada, June 27–30, 1996. The work has been supported in part by a grant from the Natural Sciences and Engineering Research Council of Canada. I am grateful to Ira Nishisato for his comments, Ingram Olkin and Yoshio Takane for important references, and Liqun Xu for computational help.     

Parallel processing of whole words and morphemes in visual word recognition

Models of morphological processing make different predictions about whether morphologically complex written words are initially decomposed and recognized on the basis of their morphemic subunits or whether they can directly be accessed as whole words and at what point semantics begin to influence morphological processing. In this study, we used unprimed and masked primed lexical decision to compare truly suffixed (darkest) and pseudosuffixed words (glossary) with within-boundary (d ra kest/g ol ssary) to across-boundary (dar ek st/glos as ry) letter transpositions. Significant transposed-letter similarity effects were found independently of the morphological position of the letter transposition, demonstrating that, in English, morphologically complex whole-word representations can be directly accessed at initial word processing stages. In a third masked primed lexical decision experiment, the same materials were used in the context of stem target priming, and it was found that truly suffixed primes facilitate the recognition of their stem-target (darkest–DARK) to the same extent as pseudosuffixed primes (glossary–GLOSS), which is consistent with theories of early morpho-orthographic decomposition. Taken together, our findings provide evidence for both whole-word access and morphological decomposition at initial stages of visual word recognition and are discussed in the context of a hybrid account.     

Letter transpositions within morphemes and across morpheme boundaries

Recent evidence has revealed conflicting results regarding the influence of letter transpositions during the recognition of morphologically complex words. While some studies suggest that the disruption of the morpheme boundary through across-boundary transpositions (e.g., darnkess) leads to the absence of masked transposed-letter (TL) priming, other studies have found that TL priming occurs independently of whether or not letters have been transposed across the boundary. We conducted three experiments to test whether the difference between TL- within and TL-across priming is modulated by (a) the transposition of internal versus external letters of the stem (Experiment 1), (b) the overall proportion of affixed trials (Experiment 2), or (c) the relative frequency between prime and target (Experiment 3). The results revealed equal TL-within and TL-across boundary priming across all three experiments, which adds to previous findings suggesting that across-boundary transpositions do not interfere with the recognition of morphologically complex words.     

The crystallographic structure of λ transition-alumina compared with the periodic antiphase boundary structure of a Ga2O3-rich Mg gallate

One of the high-temperature metastable phases found in the MgGa₂O₄–Ga₂O₃ system is the ε_Mg non-stoichiometric Mg gallate. It has a one-dimensional periodic antiphase boundary (PAPB) structure based on the spinel structure. The APBs are parallel to the {3?1?0} planes and the APB vectors are of the 1/4?1 1 0? type when referred to the spinel structure. This generally leads to the existence of 12 monoclinic twin variants in the studied samples. By comparing the X-ray or electronic diffraction patterns of both phases, it will be shown that the recently discovered?λ?transition-alumina has the same type of structure.