Eucharistic rituals in Catholic primary schools in the Archdiocese of Brisbane : a study of administrators' conceptions

The focus of this study is the celebration of Eucharist in Catholic primary schools within the Archdiocese of Brisbane. The context of the contemporary Australian Catholic primary school embodies certain 'problematical realities' in relation to the time-honoured way in which school Eucharistic rituals have been celebrated. These contemporary realities raise a number of issues that impact on school celebrations of Eucharist. The purpose of this study is to explore administrators' differing conceptions of school Eucharistic rituals in an attempt to investigate some of these issues and assist members of individual school communities as they strive to make celebrations of Eucharist appropriate and meaningful for the group gathered. The phenomenographic research approach was adopted, as it is well suited to the purpose of this study and the nature of the research question. Phenomenography is essentially a study of variation. It attempts to map the 'whole' phenomenon under investigation by describing on equal terms all conceptions of the phenomenon and establishing an ordered relationship among them. The purpose of this study and the nature of the research question necessitate an approach that allows the identification and description of the different ways in which administrators' experience school Eucharistic rituals. Accordingly, phenomenography was selected. Members of the Administration Team, namely the principal, the APRE (Assistant to the Principal Religious Education) and, in larger primary schools, the AP A (Assistant to the Principal Administration) share responsibility for leading change in Catholic primary schools in the Archdiocese of Brisbane. In practice, however, principals delegate the role of leading the development of the school's religion program and providing leadership in the religious life of the school community to the APRE (Brisbane Catholic Education, 1997). Informants in this study are nineteen APREs from a variety of Catholic primary schools in the Archdiocese of Brisbane. These APREs come from schools across the archdiocese, rather than from within one particular region. Several significant findings resulted from this study. Firstly, the data show that there are significant differences in how APREs' experience school Eucharistic rituals, although the number of these qualitatively different conceptions is quite limited. The study identifies and describes six distinct yet related conceptions of school Eucharistic rituals. The logical relationship among these conceptions (the outcome space) is presented in the form of a diagram with accompanying explication. The variation among the conceptions is best understood and described in terms of three dimensions of the role of Eucharist in the Catholic primary school and is represented on the model of the outcome space. Individual transcripts suggest that individual APREs tend to emphasise some conceptions more than others. It is the contention of the present study that change in the practice of school Eucharistic rituals is unlikely to occur until all of a school community's conceptions are brought out into the open and articulated. As leaders of change, APREs need to be alerted to their own biases and become aware of alternative ways of conceiving school Eucharistic ritual. It is proposed that the different categories of description and dimensions, represented by the model of the outcome space, can be used to help in the process of articulating a school community's conceptions of Eucharist, with the APRE as facilitator of this process. As a result, the school community develops a better understanding of why their particular school does what it does in relation to school Eucharistic rituals.

Compliant cryptologic protocols

Literally, the word compliance suggests conformity in fulfilling official requirements. The thesis presents the results of the analysis and design of a class of protocols called compliant cryptologic protocols (CCP). The thesis presents a notion for compliance in cryptosystems that is conducive as a cryptologic goal. CCP are employed in security systems used by at least two mutually mistrusting sets of entities. The individuals in the sets of entities only trust the design of the security system and any trusted third party the security system may include. Such a security system can be thought of as a broker between the mistrusting sets of entities. In order to provide confidence in operation for the mistrusting sets of entities, CCP must provide compliance verification mechanisms. These mechanisms are employed either by all the entities or a set of authorised entities in the system to verify the compliance of the behaviour of various participating entities with the rules of the system. It is often stated that confidentiality, integrity and authentication are the primary interests of cryptology. It is evident from the literature that authentication mechanisms employ confidentiality and integrity services to achieve their goal. Therefore, the fundamental services that any cryptographic algorithm may provide are confidentiality and integrity only. Since controlling the behaviour of the entities is not a feasible cryptologic goal,the verification of the confidentiality of any data is a futile cryptologic exercise. For example, there exists no cryptologic mechanism that would prevent an entity from willingly or unwillingly exposing its private key corresponding to a certified public key. The confidentiality of the data can only be assumed. Therefore, any verification in cryptologic protocols must take the form of integrity verification mechanisms. Thus, compliance verification must take the form of integrity verification in cryptologic protocols. A definition of compliance that is conducive as a cryptologic goal is presented as a guarantee on the confidentiality and integrity services. The definitions are employed to provide a classification mechanism for various message formats in a cryptologic protocol. The classification assists in the characterisation of protocols, which assists in providing a focus for the goals of the research. The resulting concrete goal of the research is the study of those protocols that employ message formats to provide restricted confidentiality and universal integrity services to selected data. The thesis proposes an informal technique to understand, analyse and synthesise the integrity goals of a protocol system. The thesis contains a study of key recovery,electronic cash, peer-review, electronic auction, and electronic voting protocols. All these protocols contain message format that provide restricted confidentiality and universal integrity services to selected data. The study of key recovery systems aims to achieve robust key recovery relying only on the certification procedure and without the need for tamper-resistant system modules. The result of this study is a new technique for the design of key recovery systems called hybrid key escrow. The thesis identifies a class of compliant cryptologic protocols called secure selection protocols (SSP). The uniqueness of this class of protocols is the similarity in the goals of the member protocols, namely peer-review, electronic auction and electronic voting. The problem statement describing the goals of these protocols contain a tuple,(I, D), where I usually refers to an identity of a participant and D usually refers to the data selected by the participant. SSP are interested in providing confidentiality service to the tuple for hiding the relationship between I and D, and integrity service to the tuple after its formation to prevent the modification of the tuple. The thesis provides a schema to solve the instances of SSP by employing the electronic cash technology. The thesis makes a distinction between electronic cash technology and electronic payment technology. It will treat electronic cash technology to be a certification mechanism that allows the participants to obtain a certificate on their public key, without revealing the certificate or the public key to the certifier. The thesis abstracts the certificate and the public key as the data structure called anonymous token. It proposes design schemes for the peer-review, e-auction and e-voting protocols by employing the schema with the anonymous token abstraction. The thesis concludes by providing a variety of problem statements for future research that would further enrich the literature.

A Delphi study to validate an advanced practice nursing tool

Aim This paper is a report of a study conducted to validate an instrument for measuring advanced practice nursing role delineation in an international contemporary health service context using the Delphi technique. Background Although most countries now have clear definitions and competency standards for nurse practitioners, no such clarity exists for many advanced practice nurse roles, leaving healthcare providers uncertain whether their service needs can or should be met by an advanced practice nurse or a nurse practitioner. The validation of a tool depicting advanced practice nursing is essential for the appropriate deployment of advanced practice nurses. This paper is the second in a three-phase study to develop an operational framework for assigning advanced practice nursing roles. Method An expert panel was established to review the activities in the Strong Model of Advanced Practice Role Delineation tool. Using the Delphi technique, data were collected via an on-line survey through a series of iterative rounds in 2008. Feedback and statistical summaries of responses were distributed to the panel until the 75% consensus cut-off was obtained. Results After three rounds and modification of five activities, consensus was obtained for validation of the content of this tool. Conclusion The Strong Model of Advanced Practice Role Delineation tool is valid for depicting the dimensions of practice of the advanced practice role in an international contemporary health service context thereby having the potential to optimize the utilization of the advanced practice nursing workforce.