TheP system: A scheme for organizing Pavlovian procedures

The present paper introduces theP system as a scheme for organizing Pavlovian procedures in an orderly and comprehensive manner. The system is defined by three temporal variables and three restrictions on their possible values. It can be used to define all standard temporal variables—namely, stimulus duration, interstimulus interval, trace interval, and intertrial interval—as well as variables C and T of scalar expectancy theory. The system also permits the definition of new independent variables through combinations of the basic temporal parameters. We exemplify this possibility by defining two ratios of temporal intervals. These ratios lead to a space where traditional Pavlovian arrangements (viz., simultaneous, forward-trace, forward-delay, backward) become points on a continuum, and optimal conditions across different experimental preparations become equivalent. Finally, the system can be used to define contingency variables such asp(US/CS),p(US/～CS), and the phi coefficient (φ). In this manner, an organization of different kinds of Pavlovian procedures is achieved on the basis of a single parametric scheme. Such an organization facilitates establishing procedural and theoretical relationships between temporal and contingency variables. The paper concludes with a discussion of certain limitations of the system and other related issues     

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.     

Authenticity as a foundational principle of medical ethics

Increasingly, contemporary medical ethicists have become aware of the need to explicate a foundation for their various models of applied ethics. Many of these theories are inspired by the apparent incompatibility of patient autonomy and provider beneficence. The principle of patient autonomy derives its current primacy to a large extent from its legal origins. However, this principle seems at odds with the clinical reality. In the bioethical literature, the notion of authenticity has been proposed as an alternative foundational principle to autonomy. This article examines this proposal in reference to various existentialist philosophers (Heidegger, Sartre, Camus and Marcel). It is concluded that the principle of autonomy fails to do what it is commonly supposed to do: provide a criterion of distinction that can be invoked to settle moral controversies between patients and providers. The existentialist concept of authenticity is more promising in at least one crucial respect: It acknowledges that the essence of human life disappears from sight if life's temporal character is reduced to a series of present decisions and actions. This also implies that the very quest for a criterion that allows physicians to distinguish between sudden, unexpected decisions of their patients to be or not to be respected, without recourse to the patient's past or future, is erroneous.     

Local and global factors of similarity in visual search

Effects of the similarity between target and distractors in a visual search task were investigated in several experiments. Both familiar (numerals and letters) and unfamiliar (connected figures in a 5 × 5 matrix) stimuli were used. The observer had to report on the presence or absence of a target among a variable number of homogeneous distractors as fast and as accurately as possible. It was found that physical difference had the same clear effect on processing time far familiar and for unfamiliar stimuli: processing time decreased monotonically with increasing physical difference. Distractors unrelated to the target and those related to the target by a simple transformation (180° rotation, horizontal or vertical reflection) were also compared, while the physical difference was kept constant. For familiar stimuli, transformational relatedness increased processing time in comparison with that fort unrelated stimulus pairs. It was further shown in a scaling experiment that this effect could be accounted for by the amount of perceived similarity of the target-distractor pairs. For unfamiliar stimuli, transformational relatedness did have a smaller and less pronounced effect. Various comparable unrelated distractors resulted in a full range of processing times. Results from a similarity scaling experiment correlated well with the outcome of the experiments with unfamiliar stimuli. These results are interpreted in terms of an underlying continuum of perceived similarity as the basis of the speed of visual search, rather than a dichotomy of parallel versus serial processing.     

Some uniqueness results for PARAFAC2

Whereas the unique axes properties of PARAFAC1 have been examined extensively, little is known about uniqueness properties for the PARAFAC2 model for covariance matrices. This paper is concerned with uniqueness in the rank two case of PARAFAC2. For this case, Harshman and Lundy have recently shown, subject to mild assumptions, that PARAFAC2 is unique when five (covariance) matrices are analyzed. In the present paper, this result is sharpened. PARAFAC2 is shown to be usually unique with four matrices. With three matrices it is not unique unless a certain additional assumption is introduced. If, for instance, the diagonal matrices of weights are constrained to be non-negative, three matrices are enough to have uniqueness in the rank two case of PARAFAC2. The authors are obliged to Richard Harshman for stimulating this research, and to the Associate Editor and reviewers for suggesting major improvements in the presentation.