THE GOLEM LEGEND AND THE ENIGMA OF FACEBOOK

We are easily misguided as to the true nature of Facebook, and tend to treat it simply as a powerful technological instrument in the service of human intentions. We can, however, gain a better picture of it through recourse to the Jewish tradition of the golem, an image of human beings, created by them in a re-enactment of their own creation by God. It turns into a magic servant in modernity with an inherent dynamic running between its human and its subhuman characteristics. This dynamic is the main cause behind its becoming uncontrollable. In like manner, what is subhuman in Facebook serves its masters and functions under their total control, but also empowers Facebook's increasingly human operation, an algorithm-based capability which raises growing doubts about what counts as human. Facebook implies the crisis of humanity which coincides with the “death of God,” that is, the obsolescence of the idea of a divine creator.     

Does nondirectional signalization of target distance contribute to navigation in the Morris water maze?

The possibility that rats can navigate in the Morris water maze by reducing the difference between the memorized platform scene and the current sensory input was tested in nine blind rats. A computerized videosystem monitored the rats' movements in the pool and converted the rat-target distance into tones the frequency of which increased in 64 equal steps from 120 Hz at 128 cm to 7680 Hz at 0 cm. During 15 days of training to find a fixed platform position from different starting points (12 trials per day) average escape latencies decreased from 39.0 to 25.4 s. The performance significantly deteriorated when the acoustic distance signalization was omitted and/or when the target position was changed form trial to trial. It is concluded that blind rats solved the task by simultaneously employing search strategy based on position responses, mapping using acoustic background beacons, and distance reduction navigation. It is argued that the various strategies are additive and that their relative significance depends of the conditions of the experiment.     

Generalized approaches to the maxbet problem and the maxdiff problem,with applications to canonical correlations

Van de Geer has reviewed various criteria for transforming two or more matrices to maximal agreement, subject to orthogonality constraints. The criteria have applications in the context of matching factor or configuration matrices and in the context of canonical correlation analysis for two or more matrices. The present paper summarizes and gives a unified treatment of fully general computational solutions for two of these criteria, Maxbet and Maxdiff. These solutions will be shown to encompass various well-known methods as special cases. It will be argued that the Maxdiff solution should be preferred to the Maxbet solution whenever the two criteria coincide. Horst's Maxcor method will be shown to lack the property of monotone convergence. Finally, simultaneous and successive versions of the Maxbet and Maxdiff solutions will be treated as special cases of a fully flexible approach where the columns of the rotation matrices are obtained in successive blocks.The author is obliged to Henk Kiers for computational assistance and helpful comments.     

Extraversion and task properties as determinants of incidental recall

The present research investigated in a dual task design the effects of extraversion level and structural task properties on the recall of an incidentally learned text. First, the hypothetical relation between arousal level and attentional selectivity was tested. Second, the relation between structural levels in the text and recall of text elements was studied. It was found that (a) extraverts performed significantly better on incidental recall compared to introverts; (b) the nuclear sentences at the top of the hierarchical structure were the best recalled sentences, independently of arousal level; (c) the effect of differences in arousal on recall was only significant in case of the top sentences. The effect was absent in case of specificúsecondary sentences.     

Alternating least squares algorithms for simultaneous components analysis with equal component weight matrices in two or more populations

Millsap and Meredith (1988) have developed a generalization of principal components analysis for the simultaneous analysis of a number of variables observed in several populations or on several occasions. The algorithm they provide has some disadvantages. The present paper offers two alternating least squares algorithms for their method, suitable for small and large data sets, respectively. Lower and upper bounds are given for the loss function to be minimized in the Millsap and Meredith method. These can serve to indicate whether or not a global optimum for the simultaneous components analysis problem has been attained.Financial support by the Netherlands organization for scientific research (NWO) is gratefully acknowledged.     

Least-squares approximation of an improper correlation matrix by a proper one

An algorithm is presented for the best least-squares fitting correlation matrix approximating a given missing value or improper correlation matrix. The proposed algorithm is based upon a solution for Mosier's oblique Procrustes rotation problem offered by ten Berge and Nevels. A necessary and sufficient condition is given for a solution to yield the unique global minimum of the least-squares function. Empirical verification of the condition indicates that the occurrence of non-optimal solutions with the proposed algorithm is very unlikely. A possible drawback of the optimal solution is that it is a singular matrix of necessity. In cases where singularity is undesirable, one may impose the additional nonsingularity constraint that the smallest eigenvalue of the solution be , where is an arbitrary small positive constant. Finally, it may be desirable to weight the squared errors of estimation differentially. A generalized solution is derived which satisfies the additional nonsingularity constraint and also allows for weighting. The generalized solution can readily be obtained from the standard unweighted singular solution by transforming the observed improper correlation matrix in a suitable way.