Queensland diabetic foot hospitalisations (2005-10) : in what state is our foot hospital problem?

Background Diabetes foot complications are a leading cause of overall avoidable hospital admissions. Since 2006, the Queensland Diabetes Clinical Network has implemented programs aimed at reducing diabetes-related hospitalisation. The aim of this retrospective observational study was to determine the incidence of diabetes foot-related hospital admissions in Queensland from 2005 to 2010. Methods Data on all primary diabetes foot-related admissions in Queensland from 2005-2010 was obtained using diabetes foot-related ICD-10-AM (hospital discharge) codes. Queensland diabetes foot-related admission incidences were calculated using general population data from the Australian Bureau of Statistics. Furthermore, diabetes foot-related sub-group admissions were analysed. Chi-squared tests were used to assess changes in admissions over time. Results Overall, 24,917 diabetes foot-related admissions occurred, resulting in the use of 260,085 bed days or 1.4% of all available Queensland hospital bed days (18,352,152). The primary reasons for these admissions were foot ulcers (49.8%), cellulitis (20.7%), peripheral vascular disease (17.8%) and osteomyelitis (3.8%). The diabetes foot-related admission incidence among the general population (per 100,000) reduced by 22% (103.0 in 2005, to 80.7 in 2010, p < 0.001); bed days decreased by 18% (1,099 to 904, p < 0.001). Conclusion Diabetes foot complications appear to be the primary reason for 1.4 out of every 100 hospital beds used in Queensland. There has been a significant reduction in the incidence of diabetes foot-related admissions in Queensland between 2005 and 2010. This decrease has coincided with a corresponding decrease in amputations and the implementation of several diabetes foot clinical programs throughout Queensland.

Retooling Asian-Pacific teachers to promote creativity, innovation and problem solving in science classrooms

This paper reports on a Professional Learning Programme undertaken by primary school teachers in China that aimed to facilitate the development of ‘adaptive expertise’ in using technology to facilitate innovative science teaching and learning such as that envisaged by the Chinese Ministry of Education’s (2010–2020) education reforms. The study found that the participants made substantial progress towards the development of adaptive expertise manifested not only by advances in the participants’ repertoires of pedagogical content knowledge but also in changes to their levels of confidence and identities as teachers. By the end of the programme, the participants had coalesced into a professional learning community that readily engaged in the sharing, peer review, reuse and adaption, and collaborative design of innovative science learning and assessment activities. The findings from the study indicate that those engaged in the development of Professional Learning Programmes in Asia-Pacific nations need to take cognizance of certain cultural factors and traditions idiosyncratic to the educational systems. This is reflected in the amended set of principles to inform the design and implementation of professional learning programmes presented in the concluding sections of the paper.

"What's the problem?" One teacher's response to conflict in an early childhood classroom

Scholars in Context: Prospects and Transitions is an edited collection of papers from Face to Face, the 1996 University of Queensland Graduate School of Education Postgraduate Conference. It presents current research undertaken in one of Australia's largest and leading centres for postgraduate research in education. The book is divided into three sections: classrooms through different lenses, in which a variety of classroom related issues are addressed through a range of frameworks; the big picture: global issues, which provides national and international perspectives on policy and cultural issues in a range of education sectors; and framing the individual: perspectives and insights, which includes different strands of research into individuals' development in the context of families and schools. Scholars in Context: Prospects and Transitions demonstrates how current researchers maintain a commitment to innovation and rigour, despite the current uncertainties that bedevil higher education. The work presented here makes a significant contribution to many fields of education research. The range of issues this collection addresses, the variety of theoretical and analytical perspectives adopted, and the scholarship evidenced in each contribution, make this text a valuable compendium of very recent work in education research.

A hybrid genetic algorithm for the energy-efficient virtual machine placement problem in data centers

Server consolidation using virtualization technology has become an important technology to improve the energy efficiency of data centers. Virtual machine placement is the key in the server consolidation technology. In the past few years, many approaches to the virtual machine placement have been proposed. However, existing virtual machine placement approaches consider the energy consumption by physical machines only, but do not consider the energy consumption in communication network, in a data center. However, the energy consumption in the communication network in a data center is not trivial, and therefore should be considered in the virtual machine placement. In our preliminary research, we have proposed a genetic algorithm for a new virtual machine placement problem that considers the energy consumption in both physical machines and the communication network in a data center. Aiming at improving the performance and efficiency of the genetic algorithm, this paper presents a hybrid genetic algorithm for the energy-efficient virtual machine placement problem. Experimental results show that the hybrid genetic algorithm significantly outperforms the original genetic algorithm, and that the hybrid genetic algorithm is scalable.

Mobility and out-of-home activities of older people living in suburban environments : ‘Because I'm a driver, I don't have a problem'

Governments are challenged by the need to ensure that ageing populations stay active and engaged as they age. Therefore, it is critical to investigate the role of mobility in older people's engagement in out-of-home activities, and to identify the experiences they have within their communities. This research investigates the use of transportation by older people and its implications for their out-of-home activities within suburban environments. The qualitative, mixed-method approach employs data collection methods which include a daily travel diary (including a questionnaire), Global Positioning System (GPS) tracking and semi-structured interviews with older people living in suburban environments in Brisbane, Australia. Results show that older people are mobile throughout the city, and their car provides them with that opportunity to access desired destinations. This ability to drive allows older people to live independently and to assist others who do not drive, particularly where transport alternatives are not as accessible. The ability to transport goods and other people is a significant advantage of the private car over other transport options. People with no access to private transportation who live in low-density environments are disadvantaged when it comes to participation within the community. Further research is needed to better understand the relationship between transportation and participation within the community environment, to assist policy makers and city and transportation planners to develop strategies for age-friendly environments within the community.

Leadership in problem-oriented policing

Purpose – The purpose of this paper is to explore the role of leadership in problem-oriented policing (POP). Design/methodology/approach – This paper uses interrupted time series models to isolate the impact on crime trends of a transformational leader's efforts to spearhead the implementation of a program of POP, called the problem solving model (PSM), in a southern state in Australia. Findings – This paper finds that the PSM led directly to an impact on overall crime, with a significant reduction in crimes per 100,000 persons per year after the introduction of the PSM. The majority of the overall crime drop attributable to implementation of POP was driven by reductions in property crime. It was noted that the leadership influence of the PSM was not effective in reducing all types of crime. Crimes against the person where not affected by the introduction of the PSM and public nuisance crimes largely followed the forecasted, upward trajectory. Practical implications – The driver behind the PSM was Commissioner Hyde and the success of the PSM is largely attributable to his strong commitment to transformational leadership and a top-down approach to implementation. These qualities encapsulate the original ideas behind POP that Goldstein (1979, 2003), back in 1979, highlighted as critical for the success of future POP programs. Social implications – Reducing crime is an important part of creating safe communities and improving quality of life for all citizens. This research shows that successful implementation of the PSM within South Australia under the strong leadership of Commissioner Hyde was a major factor in reducing property crime and overall crime rates. Originality/value – This paper is valuable because it demonstrates the link between strong leadership in policing, the commissioner's vision for POP and how his vision then translated into widespread adoption of POP. The study empirically shows that the statewide adoption of POP led to significant reductions in crime, particularly property crime.

On the hardness of the sum of K mins problem

The sum of k mins protocol was proposed by Hopper and Blum as a protocol for secure human identification. The goal of the protocol is to let an unaided human securely authenticate to a remote server. The main ingredient of the protocol is the sum of k mins problem. The difficulty of solving this problem determines the security of the protocol. In this paper, we show that the sum of k mins problem is NP-Complete and W[1]-Hard. This latter notion relates to fixed parameter intractability. We also discuss the use of the sum of k mins protocol in resource-constrained devices.

Stagnancy in Indonesia’s reformed state asset management policies and practices : a wicked problem?

The policies and regulations governing the practice of state asset management have emerged as an urgent question among many countries worldwide for there is heightened awareness of the complex and crucial role that state assets play in public service provision. Indonesia is an example of such country, introducing a ‘big-bang’ reform in state asset management laws, policies, regulations, and technical guidelines. Indonesia exemplified its enthusiasm in reforming state asset management policies and practices through the establishment of the Directorate General of State Assets in 2006. The Directorate General of State Assets have stressed the new direction that it is taking state asset management laws and policies through the introduction of Republic of Indonesia Law Number 38 Year 2008, which is an amended regulation overruling Republic of Indonesia Law Number 6 Year 2006 on Central/Regional Government State Asset Management. Law number 38/2008 aims to further exemplify good governance principles and puts forward a ‘the highest and best use of assets’ principle in state asset management. The purpose of this study is to explore and analyze specific contributing influences to state asset management practices, answering the question why innovative state asset management policy implementation is stagnant. The methodology of this study is that of qualitative case study approach, utilizing empirical data sample of four Indonesian regional governments. Through a thematic analytical approach this study provides an in-depth analysis of each influencing factors to state asset management reform. Such analysis suggests the potential of an ‘excuse rhetoric’; whereby the influencing factors identified are a smoke-screen, or are myths that public policy makers and implementers believe in, as a means to ex-plain stagnant implementation of innovative state asset management practice. Thus this study offers deeper insights of the intricate web that influences state as-set management innovative policies to state asset management policy makers; to be taken into consideration in future policy writing.

A coding approach to the multicast stream authentication problem

We study the multicast stream authentication problem when an opponent can drop, reorder and introduce data packets into the communication channel. In such a model, packet overhead and computing efficiency are two parameters to be taken into account when designing a multicast stream protocol. In this paper, we propose to use two families of erasure codes to deal with this problem, namely, rateless codes and maximum distance separable codes. Our constructions will have the following advantages. First, our packet overhead will be small. Second, the number of signature verifications to be performed at the receiver is O(1). Third, every receiver will be able to recover all the original data packets emitted by the sender despite losses and injection occurred during the transmission of information.

A flexible optimisation model for the railway crew scheduling problem

Addressing the Crew Scheduling Problem (CSP) in transportation systems can be too complex to capture all details. The designed models usually ignore or simplify features which are difficult to formulate. This paper proposes an alternative formulation using a Mixed Integer Programming (MIP) approach to the problem. The optimisation model integrates the two phases of pairing generation and pairing optimisation by simultaneously sequencing trips into feasible duties and minimising total elapsed time of any duty. Crew scheduling constraints in which the crew have to return to their home depot at the end of the shift are included in the model. The flexibility of this model comes in the inclusion of the time interval of relief opportunities, allowing the crew to be relieved during a finite time interval. This will enhance the robustness of the schedule and provide a better representation of real-world conditions.

An algebraic analysis of trivium ciphers based on the boolean satisfiability problem

Trivium is a stream cipher candidate of the eStream project. It has successfully moved into phase three of the selection process under the hardware category. No attacks faster than the exhaustive search have so far been reported on Trivium. Bivium-A and Bivium-B are simplified versions of Trivium that are built on the same design principles but with two registers. The simplified design is useful in investigating Trivium type ciphers with a reduced complexity and provides insight into effective attacks which could be extended to Trivium. This paper focuses on an algebraic analysis which uses the boolean satisfiability problem in propositional logic. For reduced variants of the cipher, this analysis recovers the internal state with a minimal amount of keystream observations.

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.

A new grouping genetic algorithm for the MapReduce placement problem in cloud computing

MapReduce is a computation model for processing large data sets in parallel on large clusters of machines, in a reliable, fault-tolerant manner. A MapReduce computation is broken down into a number of map tasks and reduce tasks, which are performed by so called mappers and reducers, respectively. The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation. From the computational point of view, the mappers/reducers placement problem is a generation of the classical bin packing problem, which is NPcomplete. Thus, in this paper we propose a new grouping genetic algorithm for the mappers/reducers placement problem in cloud computing. Compared with the original one, our grouping genetic algorithm uses an innovative coding scheme and also eliminates the inversion operator which is an essential operator in the original grouping genetic algorithm. The new grouping genetic algorithm is evaluated by experiments and the experimental results show that it is much more efficient than four popular algorithms for the problem, including the original grouping genetic algorithm.

Secure computation of the vector dominance problem

Suppose two parties, holding vectors A = (a 1,a 2,...,a n ) and B = (b 1,b 2,...,b n ) respectively, wish to know whether a i  > b i for all i, without disclosing any private input. This problem is called the vector dominance problem, and is closely related to the well-studied problem for securely comparing two numbers (Yao’s millionaires problem). In this paper, we propose several protocols for this problem, which improve upon existing protocols on round complexity or communication/computation complexity.