Ethnic and Gender Differences in Applicants' Decision‐Making Processes: An Application of the Theory of Reasoned Action

Although a growing proportion of the new entrants into the workforce consist of women and ethnic minorities, relatively little is known about the recruitment and job choice processes of these applicant groups. Therefore, this study investigated cultural and gender differences in job application decision processes among 191 job seekers looking for temporary employment. The theory of reasoned action (TRA) was found to be a valid framework to explain job application decisions, although gender differences existed in the strength of the relations. Job attractiveness and perceived person–organization fit added to the prediction of job application intention over and beyond the TRA variables.     

Predicting compulsive Internet use: it's all about sex!

The objective of this research was to assess the predictive power of various Internet applications on the development of compulsive Internet use (CIU). The study has a two-wave longitudinal design with an interval of 1 year. The first measurement contained 447 adult heavy Internet users who used the Internet at least 16 h per week and had Internet access at home for at least 1 year. For the second measurement, all participants were invited again, of whom 229 responded. By means of an online questionnaire, the respondents were asked about the time spent on various Internet applications and CIU. On a cross-sectional basis, gaming and erotica seem the most important Internet applications related to CIU. On a longitudinal basis, spending a lot of time on erotica predicted an increase in CIU 1 year later. The addictive potential of the different applications varies; erotica appears to have the highest potential.     

A method of weighing qualitative preference axioms

A method is developed for determining the absolute and relative strengths of qualitative preference axioms in normative Bayesian decision theory. These strengths are calculated for the three most common qualitative axioms; transitivity, the sure-thing principle, and dominance. The relative strength of the latter two axioms with respect to transitivity is calculated for special cases, and a bound is derived which is applicable to a larger class of decision problems. Possible implications of this theoretical work for decision heuristics are discussed.     

A monotonically convergent algorithm for orthogonal congruence rotation

Brokken has proposed a method for orthogonal rotation of one matrix such that its columns have a maximal sum of congruences with the columns of a target matrix. This method employs an algorithm for which convergence from every starting point is not guaranteed. In the present paper, an iterative majorization algorithm is proposed which is guaranteed to converge from every starting point. Specifically, it is proven that the function value converges monotonically, and that the difference between subsequent iterates converges to zero. In addition to the better convergence properties, another advantage of the present algorithm over Brokken's one is that it is easier to program. The algorithms are compared on 80 simulated data sets, and it turned out that the new algorithm performed well in all cases, whereas Brokken's algorithm failed in almost half the cases. The derivation of the algorithm is given in full detail because it involves a series of inequalities that can be of use to derive similar algorithms in different contexts.This research has been made possible by a fellowship from the Royal Netherlands Academy of Arts and Sciences to the first author. The authors are obliged to Willem J. Heiser and Jos M. F. ten Berge for useful comments on an earlier version of this paper.     

Loglinear multidimensional IRT models for polytomously scored items

A loglinear IRT model is proposed that relates polytomously scored item responses to a multidimensional latent space. The analyst may specify a response function for each response, indicating which latent abilities are necessary to arrive at that response. Each item may have a different number of response categories, so that free response items are more easily analyzed. Conditional maximum likelihood estimates are derived and the models may be tested generally or against alternative loglinear IRT models.Hank Kelderman is currently affiliated with Vrije Universiteit, Amsterdam.We thank Linda Vodegel-Matzen of the Division of Developmental Psychology of the University of Amsterdam for making available the data used in the example in this article.     

Some clarifications of the TUCKALS2 algorithm applied to the IDIOSCAL problem

Kroonenberg and de Leeuw have suggested fitting the IDIOSCAL model by the TUCKALS2 algorithm for three-way components analysis. In theory, this is problematic because TUCKALS2 produces two possibly different coordinate matrices, that are useless for IDIOSCAL unless they are equal. Kroonenberg has claimed that, when IDIOSCAL is fitted by TUCKALS2, the resulting coordinate matrices will be identical. In the present paper, this claim is proven valid when the data matrices are semidefinite. However, counterexamples for indefinite matrices are also constructed, by examining the global minimum in the case where the data matrices have the same eigenvectors. Similar counterexamples have been considered by ten Berge and Kiers in the related context of CANDECOMP/PARAFAC to fit the INDSCAL model.     

Constrained DEDICOM

The DEDICOM method for the analysis of asymmetric data tables gives representations that are identified only up to a nonsingular transformation. To identify solutions it is proposed to impose subspace constraints on the stimulus coefficients. Most attention is paid to the case where different subspace constraints are imposed on different dimensions. The procedures are discussed both for the case where the complete table is fitted, and for cases where only offdiagonal elements are fitted. The case where the data table is skew-symmetric is treated separately as well.The research of H. A. L. Kiers has been made possible by a fellowship of the Royal Netherlands Academy of Arts and Sciences. The research of Y. Takane has been supported by the Natural Sciences and Engineering Research Council of Canada, grant number A6394, and by the McGill-IBM Cooperative Grant. The authors are obliged to Richard A. Harshman for helpful comments on an earlier version.     

A monotonically convergent algorithm for factals

Takane, Young, and de Leeuw proposed a procedure called FACTALS for the analysis of variables of mixed measurement levels (numerical, ordinal, or nominal). Mooijaart pointed out that their algorithm does not necessarily converge, and Nevels proposed a new algorithm for the case of nominal variables. In the present paper it is shown that Nevels' procedure is incorrect, and a new procedure for handling nominal variables is proposed. In addition, a procedure for handling ordinal variables is proposed. Using these results, a monotonically convergent algorithm is constructed for FACTALS of any mixture of variables.The authors are obliged to Jos ten Berge for stimulating comments on an earlier version of this paper. The research of H. A. L. Kiers has been made possible by a fellowship of the Royal Netherlands Academy of Arts and Sciences. The research of Y. Takane has been supported by the Natural Sciences and Engineering Research Council of Canada, grant number A6394, and by the McGill-IBM Cooperative Grant.     

Processing novel compounds: Evidence for interactive meaning activation of ambiguous nouns

In three experiments, the meaning activation of ambiguous nouns in novel nominal compounds was investigated. Ambiguous nouns were unbalanced homographs occurring as the second members of the compound. Meaningful interpretations of the compounds were based on either the dominant or the subordinate meaning of the ambiguous noun. In Experiment 1, visually presented novel compounds serving as primes were followed at varying intervals by targets associatively related to distinct meanings of the ambiguous noun. In a lexical decision task, facilitation effects were found only for targets related to the meaning that was relevant for the interpretation of the compound. Experiment 2 showed that interactive activation could not be attributed to differences in semantic relatedness between the first members of compounds and targets. Experiment 3 demonstrated equal intralexical relatedness between members for both types of compounds. It is proposed that interactive activation may facilitate the interpretation of the novel compound. Compatible meaning aspects of the nouns may become more strongly activated, and incompatible meaning aspects may not become activated. The selection of meaning aspects relevant for interpretation would thereby be simplified.