A simplification of a result by zellini on the maximal rank of symmetric three-way arrays

Zellini (1979, Theorem 3.1) has shown how to decompose an arbitrary symmetric matrix of ordern ×n as a linear combination of 1/2n(n+1) fixed rank one matrices, thus constructing an explicit tensor basis for the set of symmetricn ×n matrices. Zellini's decomposition is based on properties of persymmetric matrices. In the present paper, a simplified tensor basis is given, by showing that a symmetric matrix can also be decomposed in terms of 1/2n(n+1) fixed binary matrices of rank one. The decomposition implies that ann ×n ×p array consisting ofp symmetricn ×n slabs has maximal rank 1/2n(n+1). Likewise, an unconstrained INDSCAL (symmetric CANDECOMP/PARAFAC) decomposition of such an array will yield a perfect fit in 1/2n(n+1) dimensions. When the fitting only pertains to the off-diagonal elements of the symmetric matrices, as is the case in a version of PARAFAC where communalities are involved, the maximal number of dimensions can be further reduced to 1/2n(n–1). However, when the saliences in INDSCAL are constrained to be nonnegative, the tensor basis result does not apply. In fact, it is shown that in this case the number of dimensions needed can be as large asp, the number of matrices analyzed.     

Decompositions and biplots in three-way correspondence analysis

In this paper correspondence analysis for three-way contingency tables is presented using three-way generalisations of the singular value decomposition. It is shown that in combination with Lancaster's (1951) additive decomposition of interactions in three-way tables, a detailed analysis is possible of the deviations from independence. Finally, biplots are shown to produce powerful graphical representations of the results from three-way correspondence analyses. An example from child development is used to illustrate the theoretical developments.     

Spatial compatibility of signal-response position in pointing

Two experiments are reported in which, by means of a pointing task, we studied the stimulus-position effect, i.e. the inverted U-shape form of the reaction-time function in relation to stimulus position in tasks in which stimuli and/or responses are arranged in a horizontal array. The response consisted of aiming the index finger from a central starting point at a target area on a screen. Reaction time was the main dependent variable. The spatial relation between the position of the imperative signal and the position of the response was manipulated by varying the spatial S-R compatibility and physical distance that separated the positions of stimulus and response. The stimulus-position effect was shown to depend on the compatibility of the S-R relation (Exp. 1). In Exp. 2 it was found that the modulation of the stimulus-position effect by spatial compatibility disappeared completely when the distance between the positions of stimulus and response was reduced. None of the experiments revealed that the stimulus position effect depended on signal discriminability, which renders an interpretation of this effect in terms of perceptual processes unlikely. We argue that the attentional model of spatial coding provides the most reasonable explanation of the obtained reaction-time patterns.     

Boundary regulation in family and personal systems: Perceptions of late adolescents

Examination of boundary regulation can provide family therapists with a framework to describe both the functioning of family systems and personal systems (i.e., the intrapsychic functioning of individual family members). In the present study, late adolescents' perceptions of boundary regulation within their family systems (i.e., ratings of family health, communication, leadership, expressiveness, cohesion, and family conflict) were related to regulation of their personal boundaries (i.e., self-reported personal competence, distress, and patterns of defense mechanism use). In addition, personal system variables reliably discriminated between adolescents who described their families as psychologically healthy versus psychologically unhealthy.     

Fourier analysis of movement patterns in pigeons

Fourier analysis describes the amount of variation in a time series by partitioning it into sinusoids of different amplitudes and wavelengths and quantifying the extent to which these waves are synchronized. The importance of a given wave is represented by its contribution to the explained variance of the time series. To illustrate its potential application to the study of movement, Fourier analysis was used to quantify the movement patterns of 2 pigeons on a variable-interval (VI) and a variable-time (VT) schedule of reinforcement. For comparison, the movements of 2 pigeons that did not receive reinforcement were similarly analyzed. Characteristic frequencies were higher during VI than during VT, and relatively low during nonreinforcement. We concluded that Fourier analysis can be used to represent movement patterns compactly, study their periodicity, stereotypy, and resonance, and assist in computer simulations and models of movement.     

Cartesian or condillacian linguistics?

This paper intends to deal with Condillacian Linguistics. Although the Condillacian philosophy of mind and analysis of language were the most important in the late eighteenth century, none of them is mentioned in Chomsky's work (1966, Cartesian Linguistics). It would be useful for the history of Western thought if Chomsky's monumental error were generally recognized and if Condillacian Linguistics were at last to find the place it rightly deserves. The main thesis of Condillac's linguistic ideas (language is the first step in the analysis of thought) is briefly presented with reference to its context and consequences.     

A generalization of Kristof's theorem on the trace of certain matrix products

Kristof has derived a theorem on the maximum and minimum of the trace of matrix products of the form \(X_1 \hat \Gamma _1 X_2 \hat \Gamma _2 \cdots X_n \hat \Gamma _n\) where the matrices \(\hat \Gamma _i\) are diagonal and fixed and theX _i vary unrestrictedly and independently over the set of orthonormal matrices. The theorem is a useful tool in deriving maxima and minima of matrix trace functions subject to orthogonality constraints. The present paper contains a generalization of Kristof's theorem to the case where theX _i are merely required to be submatrices of orthonormal matrices and to have a specified maximum rank. The generalized theorem contains the Schwarz inequality as a special case. Various examples from the psychometric literature, illustrating the practical use of the generalized theorem, are discussed.     

Some clarifications of the CANDECOMP algorithm applied to INDSCAL

Carroll and Chang have claimed that CANDECOMP applied to symmetric matrices yields equivalent coordinate matrices, as needed for INDSCAL. Although this claim has appeared to be valid for all practical purposes, it has gone without a rigorous mathematical footing. The purpose of the present paper is to clarify CANDECOMP in this respect. It is shown that equivalent coordinate matrices are not granted at global minima when the symmetric matrices are not Gramian, or when these matrices are Gramian but the solution not globally optimal.Part of this research has been supported by The Netherlands Organization for Scientific Research (NWO), PSYCHON-grant (560-267-011).     

Does awareness of speech as a sequence of phones arise spontaneously?

It was found that illiterate adults could neither delete nor add a phone at the beginning of a non-word; but these tasks were rather easily performed by people with similar environment and childhood experiences, who learned to read rudimentarily as adults. Awareness of speech as a sequence of phones is thus not attained spontaneously in the course of general cognitive growth, but demands some specific training, which, for most persons, is probably provided by learning to read in the alphabetic system.