Asking the critical questions: An evaluation of social work students' experiences in an international placement

Preparing social work students for the demands of changing social environments and to promote student mobility and interest in overseas employment opportunities have resulted in an increasing demand for international social work placements. The literature describes numerous examples of social work programmes that offer a wide variety of international placements. However, research about the actual benefit of undertaking an overseas placement is scant with limited empirical evidence on the profile of students participating, their experience of the tasks offered, the supervisory practice and the outcomes for students' professional learning and career. This study contributes to the existing body of literature by exploring the relevance of international field placements for students and is unique in that it draws its sample from students who have graduated so provides a distinctive perspective in which to compare their international placement with their other placement/s as well as evaluating what were the benefits and drawbacks for them in terms of their careers, employment opportunities and current professional practice.

Factors facilitating or constraining the fieldwork practicum experience for culturally and linguistically diverse student teachers in Queensland schools

Increasing numbers of Culturally And Linguistically Diverse (CALD) students, both from the international and domestic sectors are undertaking teacher education programs at Australian universities. While many have positive practicum experiences, there are a significant number who experience difficulties. Little work has been done on viewing this situation from a sociocultural perspective where learning is seen as a form of socialisation into the different beliefs, values and practices of the new community, the placement school. This study argues that all student teachers, particularly pre-service CALD teachers, require active learning communities to become successful. Using perspectives derived from situated learning (Lave & Wenger, 1991) and community of practice theory (Wenger, 1998) this study illustrates the processes of learning and identity development and the factors that facilitate or constrain the practicum experience for CALD pre-service teachers. This study adopts a methodology that is grounded in narrative inquiry, with in-depth interview techniques used to explore CALD teachers’ experiences of their fieldwork practicum and their attempts to participate and practice successfully. The data derived from fourteen in-depth narratives of pre-service CALD teachers is analysed from a sociocultural perspective. The practicum for these students is an experience of legitimate peripheral participation in a community of practice (the practicum school), and the complex nature of the social experience as they engaged in building their professional identity as a teacher is discussed. This analysis is used to propose recommendations and strategies at the faculty and school levels to support positive learning and practicum experiences for this group of student teachers.

Gateways placement in backbone wireless mesh networks

This paper presents a novel algorithm for the gateway placement problem in Backbone Wireless Mesh Networks (BWMNs). Different from existing algorithms, the new algorithm incrementally identifies gateways and assigns mesh routers to identified gateways. The new algorithm can guarantee to find a feasible gateway placement satisfying Quality-of-Service (QoS) constraints, including delay constraint, relay load constraint and gateway capacity constraint. Experimental results show that its performance is as good as that of the best of existing algorithms for the gateway placement problem. But, the new algorithm can be used for BWMNs that do not form one connected component, and it is easy to implement and use.

Enabling authentic collaborative education in an online environment : the QUT Virtual Law Placement

This paper explores an innovative model for work-integrated learning using a virtual paradigm – The Virtual Law Placement Unit at Queensland University of Technology (QUT) Australia. It builds upon the conceptual model previously explored at WACE 2007 and provides an account of the lessons learned from the pilot offering of the unit which was conducted and evaluated in 2008. ----- The Virtual Placement Unit offers students the opportunity to complete an authentic workplace task under the guidance of a real-life workplace supervisor, where student-student communication and student-supervisor communication is all conducted virtually (and potentially asynchronously) to create an engaging but flexible learning environment using a combination of Blackboard and SharePoint technologies. This virtual experience is pioneering in the sense that it enables law students to access an unprecedented range of law graduate destination workplaces and projects, including international and social justice placements, absent the constraints traditionally associated with arranging physical placements. ----- All aspects of this unit have been designed in conjunction with community partners with a view to balancing student learning objectives with community needs through co-operative education. This paper will also explore how the implementation of the project is serving to strengthen those partnerships with the wider community, simultaneously addressing the community engagement agenda of the University and enabling students to engage meaningfully with local, national and international community partners in the real world of work.

A cooperative coevolutionary algorithm for the composite SaaS Placement Problem in the Cloud

Cloud computing has become a main medium for Software as a Service (SaaS) hosting as it can provide the scalability a SaaS requires. One of the challenges in hosting the SaaS is the placement process where the placement has to consider SaaS interactions between its components and SaaS interactions with its data components. A previous research has tackled this problem using a classical genetic algorithm (GA) approach. This paper proposes a cooperative coevolutionary algorithm (CCEA) approach. The CCEA has been implemented and evaluated and the result has shown that the CCEA has produced higher quality solutions compared to the GA.

Supervising clinical placement

Internship and practicum are the pinnacle of the therapist training experience. During these fieldwork experiences trainees are challenged to apply what they have learned in coursework and research to a real-life workplace situation. Internship is where the rigorous science of the profession and the imperfect art of the practice intersect and trainees begin to develop clinical wisdom. The trainee therapist being prepared for their responsibilities who has a successful relationship with their supervisor can optimise the gains from this integrated experience. In this chapter, an introduction to supervised internship or practicum encounters is provided with the trainee therapist and future supervisor squarely in mind.

Optimising meritocratic advantage with the International Baccalaureate Diploma in Australian schools

This paper explores two of the tensions Tarc (2009) identifies in the history of the International Baccalaureate (IB) Diploma: firstly between its design for meritocratic competition and its internationalist vision; and secondly between the IB as a global commodity and its localised interpretations. Using data from three case studies of Australian schools offering both the IB Diploma and the local government curriculum, and student responses to an online survey across 26 such schools, the analysis shows how choices behind the IB’s growing popularity foreground strategies for optimising meritocratic competition. Framed through Bourdieu’s concepts of field and ‘rules of the game’, the analysis shows how students act on their own comparative analyses of each curriculum to optimise their chances to access desirable university pathways within the local rules of the game for university placement. Schools are shown to offer the IB Diploma to recruit and retain academically ambitious students by pooling their relative advantage in different local ecologies. Students are shown to carefully evaluate the benefits and costs of the IB choice. The conclusion reflects on how the choice of the IB Diploma for meritocratic advantage by some might change conditions for others not choosing it.

Composite SaaS placement and resource optimization in Cloud computing using evolutionary algorithms

Software as a Service (SaaS) is gaining more and more attention from software users and providers recently. This has raised many new challenges to SaaS providers in providing better SaaSes that suit everyone needs at minimum costs. One of the emerging approaches in tackling this challenge is by delivering the SaaS as a composite SaaS. Delivering it in such an approach has a number of benefits, including flexible offering of the SaaS functions and decreased cost of subscription for users. However, this approach also introduces new problems for SaaS resource management in a Cloud data centre. We present the problem of composite SaaS resource management in Cloud data centre, specifically on its initial placement and resource optimization problems aiming at improving the SaaS performance based on its execution time as well as minimizing the resource usage. Our approach differs from existing literature because it addresses the problems resulting from composite SaaS characteristics, where we focus on the SaaS requirements, constraints and interdependencies. The problems are tackled using evolutionary algorithms. Experimental results demonstrate the efficiency and the scalability of the proposed algorithms.

Evolutionary placement of continuously operating reference stations of network Real-Time Kinematic

Network RTK (Real-Time Kinematic) is a technology that is based on GPS (Global Positioning System) or more generally on GNSS (Global Navigation Satellite System) observations to achieve centimeter-level accuracy positioning in real time. It is enabled by a network of Continuously Operating Reference Stations (CORS). CORS placement is an important problem in the design of network RTK as it directly affects not only the installation and running costs of the network RTK, but also the Quality of Service (QoS) provided by the network RTK. In our preliminary research on the CORS placement, we proposed a polynomial heuristic algorithm for a so-called location-based CORS placement problem. From a computational point of view, the location-based CORS placement is a largescale combinatorial optimization problem. Thus, although the heuristic algorithm is efficient in computation time it may not be able to find an optimal or near optimal solution. Aiming at improving the quality of solutions, this paper proposes a repairing genetic algorithm (RGA) for the location-based CORS placement problem. The RGA has been implemented and compared to the heuristic algorithm by experiments. Experimental results have shown that the RGA produces better quality of solutions than the heuristic algorithm.

A simulated annealing algorithm for energy efficient virtual machine placement

Improving energy efficiency has become increasingly important in data centers in recent years to reduce the rapidly growing tremendous amounts of electricity consumption. The power dissipation of the physical servers is the root cause of power usage of other systems, such as cooling systems. Many efforts have been made to make data centers more energy efficient. One of them is to minimize the total power consumption of these servers in a data center through virtual machine consolidation, which is implemented by virtual machine placement. The placement problem is often modeled as a bin packing problem. Due to the NP-hard nature of the problem, heuristic solutions such as First Fit and Best Fit algorithms have been often used and have generally good results. However, their performance leaves room for further improvement. In this paper we propose a Simulated Annealing based algorithm, which aims at further improvement from any feasible placement. This is the first published attempt of using SA to solve the VM placement problem to optimize the power consumption. Experimental results show that this SA algorithm can generate better results, saving up to 25 percentage more energy than First Fit Decreasing in an acceptable time frame.

Optimal distributed generation placement in radial distribution systems

Distributed generation (DG) resources are commonly used in the electric systems to obtain minimum line losses, as one of the benefits of DG, in radial distribution systems. Studies have shown the importance of appropriate selection of location and size of DGs. This paper proposes an analytical method for solving optimal distributed generation placement (ODGP) problem to minimize line losses in radial distribution systems using loss sensitivity factor (LSF) based on bus-injection to branch-current (BIBC) matrix. The proposed method is formulated and tested on 12 and 34 bus radial distribution systems. The classical grid search algorithm based on successive load flows is employed to validate the results. The main advantages of the proposed method as compared with the other conventional methods are the robustness and no need to calculate and invert large admittance or Jacobian matrices. Therefore, the simulation time and the amount of computer memory, required for processing data especially for the large systems, decreases.

A more efficient and effective heuristic algorithm for the MapReduce placement problem in cloud computing

The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation in cloud computing. From the computational point of view, the mappers/reducers placement problem is a generalization of the classical bin packing problem, which is NP-complete. Thus, in this paper we propose a new heuristic algorithm for the mappers/reducers placement problem in cloud computing and evaluate it by comparing with other several heuristics on solution quality and computation time by solving a set of test problems with various characteristics. The computational results show that our heuristic algorithm is much more efficient than the other heuristics. Also, we verify the effectiveness of our heuristic algorithm by comparing the mapper/reducer placement for a benchmark problem generated by our heuristic algorithm with a conventional mapper/reducer placement. The comparison results show that the computation using our mapper/reducer placement is much cheaper while still satisfying the computation deadline.