The special branch : governing mentalities through alternative-site placement

"…one should try to locate power at the extreme points of its exercise, where it is always less legal in character." (Foucault, 1980, p.97) Studies of schooling practices as techniques deriving from a particular art of governing that Foucault (2003b) called ‘governmentality’ have shown how psychopathologising discourses work to construct particular student-subjects and legitimise various practices of exclusion (Gram, 2007b). Here I extend this work to consider the use of alternative-site placement as an intensification in response to governmentality being put ‘at risk’. Governing ‘at a distance’ conjures an illusion of individual freedom which relies on the production of subjects who ‘choose’ to make choices that are consistent with the aspirations of government. In this chapter, it is argued that the designation of a child as ‘disorderly’ legitimises the intrusion of state into the private domain of the family via the Trojan horse of early intervention. This is enabled by the psy-sciences, whose technologies and aims amount to the moral retraining of ‘improper’ future-citizens who, in choosing to choose otherwise, threaten to make visible invisible relations of power. Alternative-site placement in special schools running intensive behaviour modification programs allows for a ‘redoubled insistence’ (Ewald, 1992) of these norms and limits that a ‘disorderly’ child threatens to transgress.

A Memetic Algorithm for the location-based continuously operating reference stations placement problem in Network Real-Time Kinematic

Network Real-Time Kinematic (NRTK) is a technology that can provide centimeter-level accuracy positioning services in real time, and it is enabled by a network of Continuously Operating Reference Stations (CORS). The location-oriented CORS placement problem is an important problem in the design of a NRTK as it will directly affect not only the installation and operational cost of the NRTK, but also the quality of positioning services provided by the NRTK. This paper presents a Memetic Algorithm (MA) for the location-oriented CORS placement problem, which hybridizes the powerful explorative search capacity of a genetic algorithm and the efficient and effective exploitative search capacity of a local optimization. Experimental results have shown that the MA has better performance than existing approaches. In this paper we also conduct an empirical study about the scalability of the MA, effectiveness of the hybridization technique and selection of crossover operator in the MA.

Effectiveness of electrocardiographic guidance in CVAD tip placement

Background International standard practice for the correct confirmation of the central venous access device is the chest X-ray. The intracavitary electrocardiogram-based insertion method is radiation-free, and allows real-time placement verification, providing immediate treatment and reduced requirement for post-procedural repositioning. Methods Relevant databases were searched for prospective randomised controlled trials (RCTs) or quasi RCTs that compared the effectiveness of electrocardiogram-guided catheter tip positioning with placement using surface-anatomy-guided insertion plus chest X-ray confirmation. The primary outcome was accurate catheter tip placement. Secondary outcomes included complications, patient satisfaction and costs. Results Five studies involving 729 participants were included. Electrocardiogram-guided insertion was more accurate than surface anatomy guided insertion (odds ratio: 8.3; 95% confidence interval (CI) 1.38; 50.07; p=0.02). There was a lack of reporting on complications, patient satisfaction and costs. Conclusion The evidence suggests that intracavitary electrocardiogram-based positioning is superior to surface-anatomy-guided positioning of central venous access devices, leading to significantly more successful placements. This technique could potentially remove the requirement for post-procedural chest X-ray, especially during peripherally inserted central catheter (PICC) line insertion.

Are dietetics educators' attitudes to assessment a barrier to expanding placement opportunities? Results of a Delphi study

Aim Assessment of entry-level health professionals is complex, especially in the work-based setting, placing additional pressures on these learning environments. The present study aims to gain understanding and ideally consensus regarding the setting for assessment of all elements of competence for entry-level dietitians across Australia. Methods Seventy-five experienced academic and practitioner assessors were invited to participate in an online Delphi survey. The 166 entry-level performance criteria of the competency standards for dietitians formed the basis of the questions in the survey, with rating on which ones could be assessed in the practice setting, those which could be assessed in a classroom/university setting and which could be assessed in either setting. Forty-three of 75 invited assessors responded to the first round of the Delphi. A second modified survey was sent to the 43 participants with 34 responding. Results Consensus was achieved for the assessment setting for 86 (52%) of the performance criteria after two rounds of surveying. The majority of these performance criteria achieved consensus at round one (n = 44) and were deemed to be best assessed in the practice setting (n = 55). This study highlighted the perspectives of assessors and their preference for the work-based setting for assessment. Conclusions To reduce the focus on work-based settings as the only place for competence-based assessment of health professionals, there is a need to support individual and organisational change through challenging existing norms around assessment.

A penalty-based genetic algorithm for the migration cost-aware virtual machine placement problem in cloud data centers

In the past few years, the virtual machine (VM) placement problem has been studied intensively and many algorithms for the VM placement problem have been proposed. However, those proposed VM placement algorithms have not been widely used in today's cloud data centers as they do not consider the migration cost from current VM placement to the new optimal VM placement. As a result, the gain from optimizing VM placement may be less than the loss of the migration cost from current VM placement to the new VM placement. To address this issue, this paper presents a penalty-based genetic algorithm (GA) for the VM placement problem that considers the migration cost in addition to the energy-consumption of the new VM placement and the total inter-VM traffic flow in the new VM placement. The GA has been implemented and evaluated by experiments, and the experimental results show that the GA outperforms two well known algorithms for the VM placement problem.

Factors influencing radiation therapy student clinical placement satisfaction

Introduction Radiation therapy students at Queensland University of Technology (QUT) attend clinical placements at five different clinical departments with varying resources and support strategies. This study aimed to determine the relative availability and perceived importance of different factors affecting student support while on clinical placement. The purpose of the research was to inform development of future support mechanisms to enhance radiation therapy students’ experience on clinical placement. Methods This study used anonymous Likert-style surveys to gather data from years 1 and 2 radiation therapy students from QUT and clinical educators from Queensland relating to availability and importance of support mechanisms during clinical placements in a semester. Results The study findings demonstrated student satisfaction with clinical support and suggested that level of support on placement influenced student employment choices. Staff support was perceived as more important than physical resources; particularly access to a named mentor, a clinical educator and weekly formative feedback. Both students and educators highlighted the impact of time pressures. Conclusions The support offered to radiation therapy students by clinical staff is more highly valued than physical resources or models of placement support. Protected time and acknowledgement of the importance of clinical education roles are both invaluable. Joint investment in mentor support by both universities and clinical departments is crucial for facilitation of effective clinical learning.

Benefits of blended learning for the first year medical imaging students in preparation for clinical placement

Although there is a plethora of definitions of blended learning, the underlying distinguishing feature is the combination of traditional content delivery and the utilisation of technology. Within Medical Imaging undergraduate education there is evidence of advantages and increased student engagement when utilising a blended learning approach. Although the embedding of technology has been proven to be a useful teaching tool, “Educators should tailor their teaching media to learner’s needs rather than assume that web based learning is intrinsically superior”. This study aims to determine which clinical learning tools are perceived to be the most useful to the student in preparing them for placements.

“What are they really doing?” An exploration of student learning activities in field placement

Social work students consistently identify their field placement as having the most impact on their learning. Despite this, research on learning activities used during placement and the impact on practice competency and social work identity is limited. This is the second paper from a research study exploring student experiences of learning on placement. Data were gathered from 263 social work students about 14 key learning activities they experienced during placement. The more regularly students engaged in learning activities with their social work supervisor, the more likely they were to report a sense of social work identity and feelings of practice competence. However, the regular use of learning activities varied widely between placements. Surprisingly, approximately half the students did not regularly have the opportunity to observe social work practice, have their practice observed, or to link social work theory and the Code of Ethics to their practice with their social work supervisor.

A study of placement algorithms through trial interchange of logic modules

Based on trial interchanges, this paper develops three algorithms for the solution of the placement problem of logic modules in a circuit. A significant decrease in the computation time of such placement algorithms can be achieved by restricting the trial interchanges to only a subset of all the modules in a circuit. The three algorithms are simulated on a DEC 1090 system in Pascal and the performance of these algorithms in terms of total wirelength and computation time is compared with the results obtained by Steinberg, for the 34-module backboard wiring problem. Performance analysis of the first two algorithms reveals that algorithms based on pairwise trial interchanges (2 interchanges) achieve a desired placement faster than the algorithms based on trial N interchanges. The first two algorithms do not perform better than Steinberg's algorithm1, whereas the third algorithm based on trial pairwise interchange among unconnected pairs of modules (UPM) and connected pairs of modules (CPM) performs better than Steinberg's algorithm, both in terms of total wirelength (TWL) and computation time.

Pole placement in multi-input systems via elementary transformations

This paper is concerned with the development of an algorithm for pole placement in multi-input dynamic systems. The algorithm which uses a series of elementary transformations is believed to be simpler, computationally more efficient and numerically stable when compared with earlier methods. In this paper two methods have been presented.

Pole placement in multi-input systems via elementary transformations

This paper is concerned with the development of an algorithm for pole placement in multi-input dynamic systems. The algorithm which uses a series of elementary transformations is believed to be simpler, computationally more efficient and numerically stable when compared with earlier methods. In this paper two methods have been presented.

A Novel Cache Architecture and Placement Framework for Packet Forwarding Engines

Packet forwarding is a memory-intensive application requiring multiple accesses through a trie structure. With the requirement to process packets at line rates, high-performance routers need to forward millions of packets every second with each packet needing up to seven memory accesses. Earlier work shows that a single cache for the nodes of a trie can reduce the number of external memory accesses. It is observed that the locality characteristics of the level-one nodes of a trie are significantly different from those of lower level nodes. Hence, we propose a heterogeneously segmented cache architecture (HSCA) which uses separate caches for level-one and lower level nodes, each with carefully chosen sizes. Besides reducing misses, segmenting the cache allows us to focus on optimizing the more frequently accessed level-one node segment. We find that due to the nonuniform distribution of nodes among cache sets, the level-one nodes cache is susceptible t high conflict misses. We reduce conflict misses by introducing a novel two-level mapping-based cache placement framework. We also propose an elegant way to fit the modified placement function into the cache organization with minimal increase in access time. Further, we propose an attribute preserving trace generation methodology which emulates real traces and can generate traces with varying locality. Performanc results reveal that our HSCA scheme results in a 32 percent speedup in average memory access time over a unified nodes cache. Also, HSC outperforms IHARC, a cache for lookup results, with as high as a 10-fold speedup in average memory access time. Two-level mappin further enhances the performance of the base HSCA by up to 13 percent leading to an overall improvement of up to 40 percent over the unified scheme.

First report of Vialaea minutella in Australia, its association with mango branch dieback and systematic placement of Vialaea in the Xylariales

Vialaea minutella was consistently isolated from infected mango trees showing branch dieback symptoms in northern Queensland. The fungus was identified by morphology and confirmed with molecular sequence data. This is the first report of V. minutella in Australia. The systematic position of Vialaea was confirmed to be in the Xylariales based on reconstructed LSU sequence data.

Theoretical results of QoS-guaranteed resource scaling for cloud-based MapReduce

Quality of Service (QoS) is a new issue in cloud-based MapReduce, which is a popular computation model for parallel and distributed processing of big data. QoS guarantee is challenging in a dynamical computation environment due to the fact that a fixed resource allocation may become under-provisioning, which leads to QoS violation, or over-provisioning, which increases unnecessary resource cost. This requires runtime resource scaling to adapt environmental changes for QoS guarantee. Aiming to guarantee the QoS, which is referred as to hard deadline in this work, this paper develops a theory to determine how and when resource is scaled up/down for cloud-based MapReduce. The theory employs a nonlinear transformation to define the problem in a reverse resource space, simplifying the theoretical analysis significantly. Then, theoretical results are presented in three theorems on sufficient conditions for guaranteeing the QoS of cloud-based MapReduce. The superiority and applications of the theory are demonstrated through case studies.