Transition pedagogy : a third generation approach to FYE : a case study of policy and practice for the higher education sector

Current research and practice related to the first year experience (FYE) of commencing higher education students are still mainly piecemeal rather than institution-wide with institutions struggling to achieve cross-institutional integration, coordination and coherence of FYE policy and practice. Drawing on a decade of FYE-related research including an ALTC Senior Fellowship and evidence at a large Australian metropolitan university, this paper explores how one institution has addressed that issue by tracing the evolution and maturation of strategies that ultimately conceptualize FYE as “everybody's business.” It is argued that, when first generation co-curricular and second generation curricular approaches are integrated and implemented through an intentionally designed curriculum by seamless partnerships of academic and professional staff in a whole-of-institution transformation, we have a third generation approach labelled here as transition pedagogy. It is suggested that transition pedagogy provides the optimal vehicle for dealing with the increasingly diverse commencing student cohorts by facilitating a sense of engagement, support and belonging. What is presented here is an example of transition pedagogy in action.

Embedding 'philosophy in the classroom' in pre-service teacher education

The holistic conception of the troika, as described in the first chapter, centres on the relationship between the implicit and explicit teaching of values the nurturing of the specific dimensions of quality teaching and the opportunity to ‘walk the talk’ of the values education program through aspects such as practical citizenship (Lovat, Toomey, Clement, Crotty & Nielsen, 2009). It is proposed in this chapter that the conception can be realized through the embedding of Philosophy in the Classroom within pre-service teaching programs. The troika, a Russian sleigh with three horses, only function well when there is complete synergy and balance between all Classroom is a scaffold for ensuring that all three elements of the troika, namely, quality teaching, values education and service learning in the form of education for citizenship, exist within the classroom to achieve an optimal learning, growth and wellbeing for all students. For this to be more widely accomplished Philosophy in the Classroom and discusses how it constitutes a successful synergy and balance of the troika for effective teaching. It then proposes how it might be embedded into pre-service teacher education.

Understanding the optimal learning environment in palliative care

The learning experiences of student nurses undertaking clinical placement are reported widely, however little is known about the learning experiences of health professionals undertaking continuing professional development (CPD) in a clinical setting, especially in palliative care. The aim of this study, which was conducted as part of the national evaluation of a professional development program involving clinical attachments with palliative care services (The Program of Experience in the Palliative Approach [PEPA]), was to explore factors influencing the learning experiences of participants over time. Thirteen semi-structured, one-to-one telephone interviews were conducted with five participants throughout their PEPA experience. The analysis was informed by the traditions of adult, social and psychological learning theories and relevant literature. The participants' learning was enhanced by engaging interactively with host site staff and patients, and by the validation of their personal and professional life experiences together with the reciprocation of their knowledge with host site staff. Self-directed learning strategies maximised the participants' learning outcomes. Inclusion in team activities aided the participants to feel accepted within the host site. Personal interactions with host site staff and patients shaped this social/cultural environment of the host site. Optimal learning was promoted when participants were actively engaged, felt accepted and supported by, and experienced positive interpersonal interactions with, the host site staff.

Inhibitors to optimal project portfolio selection

The selection of projects and programs of work is a key function of both public and private sector organisations. Ideally, projects and programs that are selected to be undertaken are consistent with strategic objectives for the organisation; will provide value for money and return on investment; will be adequately resourced and prioritised; will not compete with general operations for resources and not restrict the ability of operations to provide income to the organisation; will match the capacity and capability of the organisation to deliver; and will produce outputs that are willingly accepted by end users and customers. Unfortunately,this is not always the case. Possible inhibitors to optimal project portfolio selection include: processes that are inconsistent with the needs of the organisation; reluctance to use an approach that may not produce predetermined preferences; loss of control and perceived decision making power; reliance on quantitative methods rather than qualitative methods for justification; ineffective project and program sponsorship; unclear project governance, processes and linkage to business strategies; ignorance, taboos and perceived effectiveness; inadequate education and training about the processes and their importance.

Contributing factors to optimal project portfolio selection

A modified Delphi approach has been applied in this study to investigate best practice and to determine the factors that contribute to optimal selection of projects. There are various standards and practices that some may recognise as representing best practice in this area. Many of these have similar characteristics and this study has found no single best practice. The study identified the factors that contribute to the optimal selection of projects as: culture, process, knowledge of the business, knowledge of the work, education, experience, governance, risk awareness, selection of players, preconceptions, and time pressures. All these factors were found to be significant; to be appropriate to public sector organisations, private sector organisations and government owned corporations; and to have a strong linkage to research on strategic decision making. These factors can be consolidated into two underlying factors of organisation culture and leadership.

The optimal frequency of aquatic physiotherapy for individuals with chronic musculoskeletal pain: a randomised controlled trial

Purpose: To establish whether there was a difference in health-related quality of life (HRQoL) in people with chronic musculoskeletal disorders (PwCMSKD) after participating in a multimodal physiotherapy program (MPP) either two or three sessions a week. Methods: Total of 114 PwCMSKD participated in this prospective randomised controlled trial. An individualised MPP, consisting of exercises for mobility, motor-control, muscle strengthening, cardiovascular training, and health education, was implemented either twice a week (G2: n = 58) or three times a week) (G3: n = 56) for 1 year. Outcomes: HRQoL physical and mental health state (PHS/MHS), Roland Morris disability Questionnaire (RMQ), Neck-Disability-Index (NDI) and Western Ontario and McMaster Universities’ Arthritis Index (WOMAC) were used to measure outcomes of MPP for people with chronic low back pain, chronic neck pain and osteoarthritis, respectively. Measures were taken at baseline, 8 weeks (8 w), 6 months (6 m), and 1 year (1 y) after starting the programme. Results: No statistically significant differences were found between the two groups (G2 and G3), except in NDI at 8 w (−3.34, (CI 95%: −6.94/0.84, p = 0.025 (scale 0–50)). All variables showed improvement reaching the following values (from baseline to 1 y) G2: PHS: 57.72 (baseline: 41.17; (improvement: 16.55%), MHS: 74.51 (baseline: 47.46, 27.05%), HRQoL 0.90 (baseline: 0.72, 18%)), HRQoL-VAS 84.29 (baseline: 58.04, 26.25%), RMQ 4.15 (baseline: 7.85, 15.42%), NDI 3.96 (baseline: 21.87, 35.82%), WOMAC 7.17 (baseline: 25.51, 19.10%). G3: PHS: 58.64 (baseline: 39.75, 18.89%), MHS: 75.50 (baseline: 45.45, (30.05%), HRQoL 0.67 (baseline: 0.88, 21%), HRQoL-VAS 86.91 (baseline: 52.64, 34.27%), RMQ 4.83 (baseline: 8.93, 17.08%), NDI 4.91 (baseline: 23.82, 37.82%), WOMAC 6.35 (baseline: 15.30, 9.32%). Conclusions: No significant differences between the two groups were found in the outcomes of a MPP except in the NDI at 8 weeks, but both groups improved in all variables during the course of 1 year under study.

Optimal management of agricultural systems

To remain competitive, many agricultural systems are now being run along business lines. Systems methodologies are being incorporated, and here evolutionary computation is a valuable tool for identifying more profitable or sustainable solutions. However, agricultural models typically pose some of the more challenging problems for optimisation. This chapter outlines these problems, and then presents a series of three case studies demonstrating how they can be overcome in practice. Firstly, increasingly complex models of Australian livestock enterprises show that evolutionary computation is the only viable optimisation method for these large and difficult problems. On-going research is taking a notably efficient and robust variant, differential evolution, out into real-world systems. Next, models of cropping systems in Australia demonstrate the challenge of dealing with competing objectives, namely maximising farm profit whilst minimising resource degradation. Pareto methods are used to illustrate this trade-off, and these results have proved to be most useful for farm managers in this industry. Finally, land-use planning in the Netherlands demonstrates the size and spatial complexity of real-world problems. Here, GIS-based optimisation techniques are integrated with Pareto methods, producing better solutions which were acceptable to the competing organizations. These three studies all show that evolutionary computation remains the only feasible method for the optimisation of large, complex agricultural problems. An extra benefit is that the resultant population of candidate solutions illustrates trade-offs, and this leads to more informed discussions and better education of the industry decision-makers.

Optimal simultaneous maximum a posterioriestimation of states, noise statistics and parameters I. Algorithm

The simultaneous state and parameter estimation problem for a linear discrete-time system with unknown noise statistics is treated as a large-scale optimization problem. The a posterioriprobability density function is maximized directly with respect to the states and parameters subject to the constraint of the system dynamics. The resulting optimization problem is too large for any of the standard non-linear programming techniques and hence an hierarchical optimization approach is proposed. It turns out that the states can be computed at the first levelfor given noise and system parameters. These, in turn, are to be modified at the second level.The states are to be computed from a large system of linear equations and two solution methods are considered for solving these equations, limiting the horizon to a suitable length. The resulting algorithm is a filter-smoother, suitable for off-line as well as on-line state estimation for given noise and system parameters. The second level problem is split up into two, one for modifying the noise statistics and the other for modifying the system parameters. An adaptive relaxation technique is proposed for modifying the noise statistics and a modified Gauss-Newton technique is used to adjust the system parameters.

Supporting sleep in early care and education: An assessment of observed sleep-times using a sleep practices optimality index

Aim: The aim was to investigate whether the sleep practices in early childhood education (ECE) settings align with current evidence on optimal practice to support sleep. Background: Internationally, scheduled sleep times are a common feature of daily schedules in ECE settings, yet little is known about the degree to which care practices in these settings align with the evidence regarding appropriate support of sleep. Methods: Observations were conducted in 130 Australian ECE rooms attended by preschool children (Mean = 4.9 years). Of these rooms, 118 had daily scheduled sleep times. Observed practices were scored against an optimality index, the Sleep Environment and Practices Optimality Score, developed with reference to current evidence regarding sleep scheduling, routines, environmental stimuli, and emotional climate. Cluster analysis was applied to identify patterns and prevalence of care practices in the sleep time. Results: Three sleep practices types were identified. Supportive rooms (36%) engaged in practices that maintained regular schedules, promoted routine, reduced environmental stimulation, and maintained positive emotional climate. The majority of ECE rooms (64%), although offering opportunity for sleep, did not engage in supportive practices: Ambivalent rooms (45%) were emotionally positive but did not support sleep; Unsupportive rooms (19%) were both emotionally negative and unsupportive in their practices. Conclusions: Although ECE rooms schedule sleep time, many do not adopt practices that are supportive of sleep. Our results underscore the need for education about sleep supporting practice and research to ascertain the impact of sleep practices in ECE settings on children’s sleep health and broader well-being.

Minimizing buffer requirements under rate-optimal schedule in regular dataflow networks

Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dataflow graphs have been widely regarded as a powerful programming model for DSP applications. In this paper we propose a method to minimize buffer storage requirement in constructing rate-optimal compile-time (MBRO) schedules for multi-rate dataflow graphs. We demonstrate that the constraints to minimize buffer storage while executing at the optimal computation rate (i.e. the maximum possible computation rate without storage constraints) can be formulated as a unified linear programming problem in our framework. A novel feature of our method is that in constructing the rate-optimal schedule, it directly minimizes the memory requirement by choosing the schedule time of nodes appropriately. Lastly, a new circular-arc interval graph coloring algorithm has been proposed to further reduce the memory requirement by allowing buffer sharing among the arcs of the multi-rate dataflow graph. We have constructed an experimental testbed which implements our MBRO scheduling algorithm as well as (i) the widely used periodic admissible parallel schedules (also known as block schedules) proposed by Lee and Messerschmitt (IEEE Transactions on Computers, vol. 36, no. 1, 1987, pp. 24-35), (ii) the optimal scheduling buffer allocation (OSBA) algorithm of Ning and Gao (Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, SC, Jan. 10-13, 1993, pp. 29-42), and (iii) the multi-rate software pipelining (MRSP) algorithm (Govindarajan and Gao, in Proceedings of the 1993 International Conference on Application Specific Array Processors, Venice, Italy, Oct. 25-27, 1993, pp. 77-88). Schedules generated for a number of random dataflow graphs and for a set of DSP application programs using the different scheduling methods are compared. The experimental results have demonstrated a significant improvement (10-20%) in buffer requirements for the MBRO schedules compared to the schedules generated by the other three methods, without sacrificing the computation rate. The MBRO method also gives a 20% average improvement in computation rate compared to Lee's Block scheduling method.

Register Allocation and Optimal Spill code Scheduling in Software Pipelined Loops using 0-1 Integer Linear Programming Formulation

In achieving higher instruction level parallelism, software pipelining increases the register pressure in the loop. The usefulness of the generated schedule may be restricted to cases where the register pressure is less than the available number of registers. Spill instructions need to be introduced otherwise. But scheduling these spill instructions in the compact schedule is a difficult task. Several heuristics have been proposed to schedule spill code. These heuristics may generate more spill code than necessary, and scheduling them may necessitate increasing the initiation interval. We model the problem of register allocation with spill code generation and scheduling in software pipelined loops as a 0-1 integer linear program. The formulation minimizes the increase in initiation interval (II) by optimally placing spill code and simultaneously minimizes the amount of spill code produced. To the best of our knowledge, this is the first integrated formulation for register allocation, optimal spill code generation and scheduling for software pipelined loops. The proposed formulation performs better than the existing heuristics by preventing an increase in II in 11.11% of the loops and generating 18.48% less spill code on average among the loops extracted from Perfect Club and SPEC benchmarks with a moderate increase in compilation time.

Emulating Optimal Replacement with a Shepherd Cache

The inherent temporal locality in memory accesses is filtered out by the L1 cache. As a consequence, an L2 cache with LRU replacement incurs significantly higher misses than the optimal replacement policy (OPT). We propose to narrow this gap through a novel replacement strategy that mimics the replacement decisions of OPT. The L2 cache is logically divided into two components, a Shepherd Cache (SC) with a simple FIFO replacement and a Main Cache (MC) with an emulation of optimal replacement. The SC plays the dual role of caching lines and guiding the replacement decisions in MC. Our pro- posed organization can cover 40% of the gap between OPT and LRU for a 2MB cache resulting in 7% overall speedup. Comparison with the dynamic insertion policy, a victim buffer, a V-Way cache and an LRU based fully associative cache demonstrates that our scheme performs better than all these strategies.

Minimal residual method provides optimal regularization parameter for diffuse optical tomography

The inverse problem in the diffuse optical tomography is known to be nonlinear, ill-posed, and sometimes under-determined, requiring regularization to obtain meaningful results, with Tikhonov-type regularization being the most popular one. The choice of this regularization parameter dictates the reconstructed optical image quality and is typically chosen empirically or based on prior experience. An automated method for optimal selection of regularization parameter that is based on regularized minimal residual method (MRM) is proposed and is compared with the traditional generalized cross-validation method. The results obtained using numerical and gelatin phantom data indicate that the MRM-based method is capable of providing the optimal regularization parameter. (C) 2012 Society of Photo-Optical Instrumentation Engineers (SPIE). DOI: 10.1117/1.JBO.17.10.106015]

Data-resolution based optimal choice of minimum required measurements for image-guided diffuse optical tomography

Image-guided diffuse optical tomography has the advantage of reducing the total number of optical parameters being reconstructed to the number of distinct tissue types identified by the traditional imaging modality, converting the optical image-reconstruction problem from underdetermined in nature to overdetermined. In such cases, the minimum required measurements might be far less compared to those of the traditional diffuse optical imaging. An approach to choose these optimally based on a data-resolution matrix is proposed, and it is shown that such a choice does not compromise the reconstruction performance. (C) 2013 Optical Society of America

A LSQR-type method provides a computationally efficient automated optimal choice of regularization parameter in diffuse optical tomography

Purpose: Developing a computationally efficient automated method for the optimal choice of regularization parameter in diffuse optical tomography. Methods: The least-squares QR (LSQR)-type method that uses Lanczos bidiagonalization is known to be computationally efficient in performing the reconstruction procedure in diffuse optical tomography. The same is effectively deployed via an optimization procedure that uses the simplex method to find the optimal regularization parameter. The proposed LSQR-type method is compared with the traditional methods such as L-curve, generalized cross-validation (GCV), and recently proposed minimal residual method (MRM)-based choice of regularization parameter using numerical and experimental phantom data. Results: The results indicate that the proposed LSQR-type and MRM-based methods performance in terms of reconstructed image quality is similar and superior compared to L-curve and GCV-based methods. The proposed method computational complexity is at least five times lower compared to MRM-based method, making it an optimal technique. Conclusions: The LSQR-type method was able to overcome the inherent limitation of computationally expensive nature of MRM-based automated way finding the optimal regularization parameter in diffuse optical tomographic imaging, making this method more suitable to be deployed in real-time. (C) 2013 American Association of Physicists in Medicine. http://dx.doi.org/10.1118/1.4792459]