A Pastoral Care Teacher's Theory of Action, Interactive Thinking and Effective Teaching Practice

Through the employment of a hybrid research model blending concept mapping and stimulated recall methodologies, this study explored the nature of a Pastoral Care Teacher's theory of action; the relationship between those beliefs and ideals and interactive thinking; and specific actions in effectively teaching a Pastoral Care issue. In undertaking the research a group of Year Eight boys at the Anglican Church Grammar School (Churchie) provided the context. The study shows that: (i) the teacher possessed a broad knowledge and understanding of the nature of Pastoral Care at Churchie; and (ii) the lessons undertaken, the pedagogy employed, and the knowledge elicited closely resembled the teacher's philosophies and thinking.     

Expectations,observations, and violations: Comparing their effects on course ratings

Knowledgeable observers generally agree that students can give reasonably unbiased assessments of their classes, as long as proper instruments and procedures are used. These same observers agree, however, that more research is needed to understand the subtle dynamics which affect evaluations. Students' expectations (obtained on the first day) and the violation of these expectations are two possible factors. Their effects on students' final interest and future intentions are compared with students' actual reports of the class given at the end of the semester (n=196). Regression analysis using a simultaneous entry of expectations, expectancy violations, and final reports shows that students' reports at the end of the course account for almost all of the explained variance in the course rating items.     

Quantum algorithms: A?survey of some recent results

Quantum algorithms are a field of growing interest within the theoretical computer science as well as the physics community. Surprisingly, although the number of researchers working on the subject is ever-increasing, the number of quantum algorithms found so far is quite small. In fact, the task of designing new quantum algorithms has been proven to be extremely difficult. In this paper we give an overview of the known quantum algorithms and briefly describe the underlying ideas. Roughly, the algorithms presented are divided into hidden subgroup type algorithms and in amplitude amplification type algorithms. While the former deal with problems of group-theoretical nature and have the promise to yield strong separations of classical and quantum algorithms, the latter have been proved to be a prolific source of algorithms in which a polynomial speed-up as compared to classical algorithms can be achieved. We also discuss quantum algorithms which do not fall under these two categories and give a survey of techniques of general interest in quantum computing such as adiabatic computing, lower bounds for quantum algorithms, and quantum interactive proofs.