Development of an objective structured clinical examination (OSCE) to assess formulation and extemporaneous dispensing skills in MPharm undergraduates

Background: The use of Objective Structured Clinical Examination (OSCE) in Pharmacy has been explored; however this is the first attempt in Queen’s University School of Pharmacy, Belfast to assess students via this method in a module where chemistry is the main discipline.

Aims: To devise an OSCE to assess undergraduate ability to check extemporaneously dispensed products for clinical and formulation errors. This activity also aims to consider whether it is a viable method of assessment in such a science-based class, from a staff and student perspective.

Method: Students rotated around a number of stations, performing a check of the product, corresponding prescription and formulation record sheet detailing the theory behind the formulation. They were assessed on their ability to spot intentional mistakes at each one.

Results: Of the 79 students questioned, 95% indicated that OSCE made them aware of the importance of the clinical check carried out by the pharmacist. Nearly all of the undergraduates (72 out of 79) felt that OSCE made them aware of the type of mistakes that students make in class. Most (5 out of 7) of the academic team members strongly agreed that it made students aware of ‘point of dispensing’ checks carried out by pharmacists, in addition to helping them to prepare for their exam.

Conclusion: OSCE assesses both scientific and formulation skills, and has increased the diversity of assessment of this module, bringing with it many additional benefits for the undergraduates since it measures their ability to exercise professional judgement in a time- constrained environment and, in this way, mirrors the conditions many pharmacists work within.

Orthogonal space-time block coded rate-adaptive modulation with outdated feedbasck

Abstract-Channel state information (CSI) at the transmitter can be used to adapt transmission rate or antenna gains in multi-antenna systems. We propose a rate-adaptive M-QAM scheme equipped with orthogonal space-time block coding with simple outdated, finite-rate feedback over independent flat fading channels. We obtain closed-form expressions for the average BER and throughput for our scheme, and analyze the effects of possibly delayed feedback on the performance gains. We derive optimal switching thresholds maximizing the average throughput under average and outage BER constraints with outdated feedback. Our numerical results illustrate the immunity of our optimal thresholds to delayed feedback.

The Forgiving Graph:A distributed data structure for low stretch under adversarial attack

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick "repairs," which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions,without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes v and w whose distance would have been - in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most - log n in the actual graph, where n is the total number of vertices seen so far. Similarly, at any point, a node v whose degreewould have been d in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from Hayes et al. (2008) in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase; 2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions; 3) it requires only a very simple and minimal initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network. © Springer-Verlag 2012.

Citizenship and Structured Dependency: the implications of policy design for senior political power

This paper argues that the structured dependency thesis must be extended to incorporate political power. It outlines a political framework of analysis with which to identify who gains and who loses from social policy. I argue that public policy for older people is a product not only of social structures but also of political decision-making. The Schneider and Ingram (1993) ‘ target populations’ model is used to investigate how the social construction of groups as dependent equates with lower levels of influence on policy making. In United Kingdom and European research, older people are identified as politically quiescent, but conversely in the United States seniors are viewed as one of the most influential and cohesive interest groups in the political culture. Why are American seniors perceived as politically powerful, while older people in Europe are viewed as dependent and politically weak? This paper applies the ‘target populations’ model to senior policy in the Republic of Ireland to investigate how theoretical work in the United States may be used to identify the significance of senior power in policy development. I conclude that research must recognise the connections between power, politics and social constructions to investigate how state policies can influence the likelihood that seniors will resist structured dependency using political means.