Social rules and attributions in the personnel selection interview

The study investigated the social rules applicable to selection interviews, and the attributions ions made by interviewers in response to rule-breaking behaviours by candidates. Sixty personnel specialists (31 males and 29 females) participated in the main study which examined their perceptions of social rules and attributions about rule breaking in their work experience. They listened to audiotapes of actual selection interviews, and made judgments about hireability communication competence, and specific social rules. Results indicated that interview rules could be categorized into two groups: specific interview presentation skills and general interpersonal competence. While situational attributions were more salient in explaining the breaking of general interpersonal competence rules, internal attributions (ability, effort) were more salient explanations for the breaking of more specific interview rules (with the exception of the preparation rule where lack of effort was the most likely explanation for rule breaking). Candidates previously judged as competent communicators were rated more favourably on both global and specific measures of rule-following competence, as well as on hireability. The theoretical and practical implications of combining social rules and attribution theory in the study of selection interviews are discussed.

The myth of the nation: Historiography of New Zealand architecture since 1907

This paper considers the relationship between the recent historiography (of the last quarter century) of “New Zealand architecture” and the historical notion of “New Zealand-ness” invoked in contemporary architecture. It argues that a more recent programmatic uptake of post-War discussions on national identity and regional specificity has fed the tendencies of practicing architects to defer to history in rhetorical defences of their work: the beach-side mansion as a contemporary expression of the 1950s bach; a formal modernism divorced from the social discourse adherent to the historical moment that it “restates”; and so on. The paper will consider instances in the historiography of New Zealand architecture where historians have compounded, consciously or accidentally, a problem that is systemic to the uses made by architects of historical knowledge (in the most general examples), identifying the difficulties of relying upon the tentative conclusions of an under-studied field in developing principles of contemporary architectural practice under the banners of New Zealand-ness, regionalism, or localism, or with reference to icons of New Zealand architectural history. At the heart of this paper is a reflection on historiographical responsibility in presenting knowledge of a national past to an audience that is eager to transform that knowledge into principles of contemporary production. What, the paper asks, is the historical basis for speaking of a New Zealand architecture? Can we speak of a national history of architecture distinct from a regional history, or from an international history of architecture?

Practical parallel coset enumeration

Coset enumeration is a most important procedure for investigating finitely presented groups. We present a practical parallel procedure for coset enumeration on shared memory processors. The shared memory architecture is particularly interesting because such parallel computation is both faster and cheaper. The lower cost comes when the program requires large amounts of memory, and additional CPU's. allow us to lower the time that the expensive memory is being used. Rather than report on a suite of test cases, we take a single, typical case, and analyze the performance factors in-depth. The parallelization is achieved through a master-slave architecture. This results in an interesting phenomenon, whereby the CPU time is divided into a sequential and a parallel portion, and the parallel part demonstrates a speedup that is linear in the number of processors. We describe an early version for which only 40% of the program was parallelized, and we describe how this was modified to achieve 90% parallelization while using 15 slave processors and a master. In the latter case, a sequential time of 158 seconds was reduced to 29 seconds using 15 slaves.

Computational chemistry on Fujitsu vector-parallel processors: Development and performance of applications software

In this and a preceding paper, we provide an introduction to the Fujitsu VPP range of vector-parallel supercomputers and to some of the computational chemistry software available for the VPP. Here, we consider the implementation and performance of seven popular chemistry application packages. The codes discussed range from classical molecular dynamics to semiempirical and ab initio quantum chemistry. All have evolved from sequential codes, and have typically been parallelised using a replicated data approach. As such they are well suited to the large-memory/fast-processor architecture of the VPP. For one code, CASTEP, a distributed-memory data-driven parallelisation scheme is presented. (C) 2000 Published by Elsevier Science B.V. All rights reserved.

Retaining rural and remote area nurses - The Queensland, Australia experience

Because higher-than-average turnover rates for nurses who work in remote and rural areas are the norm, the authors conducted a study to identify professional and personal factors that influenced rural nurses' decisions to resign. Using a mail survey, the authors gathered qualitative and quantitative data from nurses who had resigned from rural and remote areas in Queensland, Australia. Their findings, categorized into professional and rural influences, highlight the importance of work force planning strategies that capitalize on the positive aspects of rural and remote area practice, to retain nurses in nonmetropolitan areas.

Alternatives for parallel Krylov subspace basis computation

Numerical methods related to Krylov subspaces are widely used in large sparse numerical linear algebra. Vectors in these subspaces are manipulated via their representation onto orthonormal bases. Nowadays, on serial computers, the method of Arnoldi is considered as a reliable technique for constructing such bases. However, although easily parallelizable, this technique is not as scalable as expected for communications. In this work we examine alternative methods aimed at overcoming this drawback. Since they retrieve upon completion the same information as Arnoldi's algorithm does, they enable us to design a wide family of stable and scalable Krylov approximation methods for various parallel environments. We present timing results obtained from their implementation on two distributed-memory multiprocessor supercomputers: the Intel Paragon and the IBM Scalable POWERparallel SP2. (C) 1997 by John Wiley & Sons, Ltd.