Towards a transdisciplinary approach to integrating dance in a middle school curriculum

Within Queensland middle schools the implementation of an integrated curriculum has been challenging for many practitioners. In working to enhance dance learning in a Queensland middle school this research has focused on how dance can be integrated using a transdisciplinary approach. The research has investigated and reflected on the teaching and learning strategies used to integrate dance and has identified the key issues and challenges associated with the complex nature of an integrated curriculum in this context. Action research was used to review, plan for and implement integrated curriculum approaches and give insight into the external and internal challenges within the practice. This research has identified challenges associated with sustaining the integrity of dance as a subject area when integration requires designing curricula that go across key learning area boundaries. It has also revealed working within an integrated curriculum requires using common planning principles that focus on the students’ problem solving skills, making connections with the concepts, topics or ideas from the unit of work. The discussion of ways of working highlights a set of values, strategies or attributes a dance teacher can use while working within this middle school context. These include making collaborative partnerships and showing a willingness to work outside your area of expertise. For the school community, it outlines issues for attention and recommendations to assist in implementing dance while using a transdisciplinary approach. These recommended steps include embedding opportunities for teachers to partake in common planning, and time for professional development around transdisciplinary learning and Arts education.

Optimal allocation strategies for the dark pool problem

We study the problem of allocating stocks to dark pools. We propose and analyze an optimal approach for allocations, if continuous-valued allocations are allowed. We also propose a modification for the case when only integer-valued allocations are possible. We extend the previous work on this problem to adversarial scenarios, while also improving on their results in the iid setup. The resulting algorithms are efficient, and perform well in simulations under stochastic and adversarial inputs.

Stochastic regularization method for backward Cauchy problem in Banach spaces

We consider a stochastic regularization method for solving the backward Cauchy problem in Banach spaces. An order of convergence is obtained on sourcewise representative elements.

An epistemic community as influencer and implementer in local government accounting in Australia

This paper adopts an epistemic community framework to explicate the dual role of epistemic communities as influencers of accounting policy within regulatory space and as implementers who effect change within the domain of accounting. The context is the adoption and implementation of fair value accounting within local government in New South Wales (NSW). The roles and functions of Australian local government are extensive, and include the development and maintenance of infrastructure, provision of recreational facilities, certain health and community services, buildings, cultural facilities, and in some cases, water and sewerage (Australian Local Government Association, 2009). The NSW state Department of Local Government (DLG) is responsible for legislation and policy development to ensure that local councils are able to deliver ‘quality services to their communities in a sustainable manner’ (DLG, 2008c). These local councils receive revenue from various sources including property rates, government grants and user-pays service provision. In July 2006 the DLG issued Circular 06-453 to councils (DLG, 2006c), mandating the staged adoption of fair value measurement of infrastructure assets. This directive followed the policy of NSW State Treasury (NSW Treasury, 2007),4 and an independent inquiry into the financial sustainability of local councils (LGSA, 2006). It was an attempt to resolve the inconsistency in public sector asset valuation in NSW Local Governments, and to provide greater usefulness and comparability of financial statements.5 The focus of this study is the mobilization of accounting change by the DLG within this wider political context. When a regulatory problem arises, those with political power seek advice from professionals with relevant skill and expertise (Potter, 2005). This paper explores the way in which professionals diffuse accounting ‘problems’ and the associated accounting solutions ‘across time and space’ (Potter, 2005, p. 277). The DLG’s fair value accounting policy emanated from a ‘regulatory space’ (Hancher and Moran, 1989)6 as a result of negotiations between many parties, including accounting and finance professionals. Operating within the local government sector, these professionals were identified by the DLG as being capable of providing helpful input. They were also responsible for the implementation of the new olicy within local councils. Accordingly they have been dentified as an pistemic community with the ability to ranslate regulatory power by changing he domain of ccounting (Potter, 2005, p. 278).7 The paper is organised as follows. The background to the LG’s decision to require the introduction of fair value accounting for infrastructure assets is explored. Following this, the method of the study is described, and the epistemic community framework outlined. In the next sections, evidence of the influencing and implementing roles of epistemic groups is provided. Finally, conclusions are drawn about the significance of these groups both within regulatory space in developing accounting regulation, and in embedding change within the domain of accounting.

The undirected feedback vertex set problem has a Poly(k) Kernel

Resolving a noted open problem, we show that the Undirected Feedback Vertex Set problem, parameterized by the size of the solution set of vertices, is in the parameterized complexity class Poly(k), that is, polynomial-time pre-processing is sufficient to reduce an initial problem instance (G, k) to a decision-equivalent simplified instance (G', k') where k' � k, and the number of vertices of G' is bounded by a polynomial function of k. Our main result shows an O(k11) kernelization bound.

Developing a model of embedding academic numeracy in university programs : a case study from nursing

This is a study of the academic numeracy of nursing students. This study develops a theoretical model for the design and delivery of university courses in academic numeracy. The following objectives are addressed: 1. To investigate nursing students' current knowledge of academic numeracy; 2. To investigate how nursing students’ knowledge and skills in academic numeracy can be enhanced using a developmental psychology framework; and 3. To utilise data derived from meeting objectives 1 and 2 to develop a theoretical model to embed academic numeracy in university programs. This study draws from Valsiner’s Human Development Theory (Valsiner, 1997, 2007). It is a quasi-experimental intervention case study (Faltis, 1997) and takes a multimethod approach using pre- and post-tests; observation notes; and semi-structured teaching sessions to document a series of microgenetic studies of student numeracy. Each microgenetic study is centered on the lived experience of students becoming more numerate. The method for this section is based on Vygotsky’s double stimulation (Valsiner, 2000a; 2007). Data collection includes interviews on students’ past experience with mathematics; their present feelings and experiences and how these present feelings and experiences are transformed. The findings from this study have provided evidence that the course developed for nursing students, underpinned by an appropriate framework, does improve academic numeracy. More specifically, students improved their content knowledge of and confidence in mathematics in areas that were directly related to their degree. The study used Valsiner’s microgenetic approach to development to trace the course as it was being taught and two students’ personal academic numeracy journeys. It highlighted particularly troublesome concepts, then outlined scaffolding and pathways used to develop understanding. This approach to academic numeracy development was summarised into a four-faceted model at the university, program, course and individual level. This model can be applied successfully to similar contexts. Thus the thesis advances both theory and practice in this under-researched and under-theorised area.

LEGO robotics : an authentic problem solving tool?

With the current curriculum focus on correlating classroom problem solving lessons to real-world contexts, are LEGO robotics an effective problem solving tool? This present study was designed to investigate this question and to ascertain what problem solving strategies primary students engaged with when working with LEGO robotics and whether the students were able to effectively relate their problem solving strategies to real-world contexts. The qualitative study involved 23 Grade 6 students participating in robotics activities at a Brisbane primary school. The study included data collected from researcher observations of student problem solving discussions, collected software programs, and data from a student completed questionnaire. Results from the study indicated that the robotic activities assisted students to reflect on the problem solving decisions they made. The study also highlighted that the students were able to relate their problem solving strategies to real-world contexts. The study demonstrated that while LEGO robotics can be considered useful problem solving tools in the classroom, careful teacher scaffolding needs to be implemented in regards to correlating LEGO with authentic problem solving. Further research in regards to how teachers can best embed realworld contexts into effective robotics lessons is recommended.

Developing work-integrated learning curricula for the creative industries : embedding stakeholder perspectives

It is now widely recognised that the creative industries constitute an important and growing global economic sector (Cunningham, 2007). Career development programs for the creative industries sector are an international priority (Guile, 2007) which faces several key challenges. These challenges relate to the unique nature of the creative industries. In the creative industries it is thus of critical importance that tertiary work-integrated learning programs focus on more than just training students to become employees: they must also focus on developing the experience and employability of students who will undertake non-conventional career paths. One challenge for work-integrated learning programs in the creative industries is that there is little professional tradition of internships; many employers are not experienced in work-integrated learning participation, and many academics are not familiar with work-integrated learning. This paper reports on the results of an evaluative research program undertaken one year after the launch of the Queensland University of Technology’s (Brisbane, Australia) Creative Industries Transitions to New Professional Environments work-integrated learning program, focusing particularly on key themes and issues identified in interviews with the program’s industry partners and academic staff.

A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem

In practice, parallel-machine job-shop scheduling (PMJSS) is very useful in the development of standard modelling approaches and generic solution techniques for many real-world scheduling problems. In this paper, based on the analysis of structural properties in an extended disjunctive graph model, a hybrid shifting bottleneck procedure (HSBP) algorithm combined with Tabu Search metaheuristic algorithm is developed to deal with the PMJSS problem. The original-version SBP algorithm for the job-shop scheduling (JSS) has been significantly improved to solve the PMJSS problem with four novelties: i) a topological-sequence algorithm is proposed to decompose the PMJSS problem into a set of single-machine scheduling (SMS) and/or parallel-machine scheduling (PMS) subproblems; ii) a modified Carlier algorithm based on the proposed lemmas and the proofs is developed to solve the SMS subproblem; iii) the Jackson rule is extended to solve the PMS subproblem; iv) a Tabu Search metaheuristic algorithm is embedded under the framework of SBP to optimise the JSS and PMJSS cases. The computational experiments show that the proposed HSBP is very efficient in solving the JSS and PMJSS problems.

Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem

For the shop scheduling problems such as flow-shop, job-shop, open-shop, mixed-shop, and group-shop, most research focuses on optimizing the makespan under static conditions and does not take into consideration dynamic disturbances such as machine breakdown and new job arrivals. We regard the shop scheduling problem under static conditions as the static shop scheduling problem, while the shop scheduling problem with dynamic disturbances as the dynamic shop scheduling problem. In this paper, we analyze the characteristics of the dynamic shop scheduling problem when machine breakdown and new job arrivals occur, and present a framework to model the dynamic shop scheduling problem as a static group-shop-type scheduling problem. Using the proposed framework, we apply a metaheuristic proposed for solving the static shop scheduling problem to a number of dynamic shop scheduling benchmark problems. The results show that the metaheuristic methodology which has been successfully applied to the static shop scheduling problems can also be applied to solve the dynamic shop scheduling problem efficiently.

A fast tabu search algorithm for the group shop scheduling problem

Three types of shop scheduling problems, the flow shop, the job shop and the open shop scheduling problems, have been widely studied in the literature. However, very few articles address the group shop scheduling problem introduced in 1997, which is a general formulation that covers the three above mentioned shop scheduling problems and the mixed shop scheduling problem. In this paper, we apply tabu search to the group shop scheduling problem and evaluate the performance of the algorithm on a set of benchmark problems. The computational results show that our tabu search algorithm is typically more efficient and faster than the other methods proposed in the literature. Furthermore, the proposed tabu search method has found some new best solutions of the benchmark instances.

Metaheuristics for the mixed shop scheduling problem

In this paper, three metaheuristics are proposed for solving a class of job shop, open shop, and mixed shop scheduling problems. We evaluate the performance of the proposed algorithms by means of a set of Lawrence’s benchmark instances for the job shop problem, a set of randomly generated instances for the open shop problem, and a combined job shop and open shop test data for the mixed shop problem. The computational results show that the proposed algorithms perform extremely well on all these three types of shop scheduling problems. The results also reveal that the mixed shop problem is relatively easier to solve than the job shop problem due to the fact that the scheduling procedure becomes more flexible by the inclusion of more open shop jobs in the mixed shop.

A comparative study of algorithms for the flowshop scheduling problem

In this paper, we propose three meta-heuristic algorithms for the permutation flowshop (PFS) and the general flowshop (GFS) problems. Two different neighborhood structures are used for these two types of flowshop problem. For the PFS problem, an insertion neighborhood structure is used, while for the GFS problem, a critical-path neighborhood structure is adopted. To evaluate the performance of the proposed algorithms, two sets of problem instances are tested against the algorithms for both types of flowshop problems. The computational results show that the proposed meta-heuristic algorithms with insertion neighborhood for the PFS problem perform slightly better than the corresponding algorithms with critical-path neighborhood for the GFS problem. But in terms of computation time, the GFS algorithms are faster than the corresponding PFS algorithms.