Ethnic In-Group Favoritism Among Minority and Majority Groups: Testing the Self-Esteem Hypothesis Among Preadolescents

The self-esteem hypothesis in intergroup relations, as proposed by social identity theory (SIT), states that successful intergroup discrimination enhances momentary collective self-esteem. This hypothesis is a source of continuing controversy. Furthermore, although SIT is increasingly used to account for children’s group attitudes, few studies have examined the hypothesis among children. In addition, the hypothesis’s generality makes it important to study among children from different ethnic groups. The present study, conducted among Dutch and Turkish preadolescents, examined momentary collective self-feelings as a consequence of ethnic group evaluations. The results tended to support the self-esteem hypothesis. In-group favoritism was found to have a self-enhancing effect among participants high in ethnic identification. This result was found for ethnic majority (Dutch) and minority (Turkish) participants.

Who is to blame? The relationship between ingroup identification and relative deprivation is moderated by ingroup attributions

Contradictory evidence can be found in the literature about whether ingroup identification and perceived relative deprivation are positively or negatively related. Indeed, theoretical arguments can be made for both effects. It was proposed that the contradictory findings can be explained by considering a hitherto unstudied moderator: The extent to which deprivation is attributed to the ingroup. It was hypothesised that identification would only have a negative impact on deprivation, and that deprivation would only have a negative impact on identification, if ingroup attributions are high. To test this, attributions to the ingroup were experimentally manipulated among British student participants (N = 189) who were asked about their perceived deprivation vis-à-vis German students, yield ing support for the hypotheses

Generation of eigenstates using the phase-estimation algorithm

The phase estimation algorithm is so named because it allows the estimation of the eigenvalues associated with an operator. However it has been proposed that the algorithm can also be used to generate eigenstates. Here we extend this proposal for small quantum systems, identifying the conditions under which the phase estimation algorithm can successfully generate eigenstates. We then propose an implementation scheme based on an ion trap quantum computer. This scheme allows us to illustrate two simple examples, one in which the algorithm effectively generates eigenstates, and one in which it does not.Comment: 5 pages, 3 Figures, RevTeX4 Introduction expanded, typos correcte

Effect of Body Mass Index on pregnancy outcomes in nulliparous women delivering singleton babies

Peer reviewedPublisher PD

Beyond Prejudice as Simple Antipathy: Hostile and Benevolent Sexism Across Cultures

The authors argue that complementary hostile and benevolent componen:s of sexism exist ac ro.ss cultures. Male dominance creates hostile sexism (HS). but men's dependence on women fosters benevolent sexism (BS)-subjectively positive attitudes that put women on a pedestal but reinforce their subordination. Research with 15,000 men and women in 19 nations showed that (a) HS and BS are coherenl constructs th at correlate positively across nations, but (b) HS predicts the ascription of negative and BS the ascription of positive traits to women, (c) relative to men, women are more likely to reject HS than BS. especially when overall levels of sexism in a culture are high, and (d) national averages on BS and HS predict gender inequal ity across nations. These results challenge prevailing notions of prejudice as an antipathy in that BS (an affectionate, patronizing ideology) reflects inequality and is a cross-culturally pervasive complement to HS

Molecular Beams

Contains research objectives, summary of research and reports on eight research projects.Joint Services Electronics Programs (U. S. Army, U. S. Navy, and U. S. Air Force) under Contract DAAB07-71-C-030

Quantum Algorithms for Fermionic Simulations

We investigate the simulation of fermionic systems on a quantum computer. We show in detail how quantum computers avoid the dynamical sign problem present in classical simulations of these systems, therefore reducing a problem believed to be of exponential complexity into one of polynomial complexity. The key to our demonstration is the spin-particle connection (or generalized Jordan-Wigner transformation) that allows exact algebraic invertible mappings of operators with different statistical properties. We give an explicit implementation of a simple problem using a quantum computer based on standard qubits.Comment: 38 pages, 2 psfigur