A ‘cost-per-wear’ model based on contact lens replacement frequency

Purpose: The aim was to construct and advise on the use of a cost-per-wear model based on contact lens replacement frequency, to form an equitable basis for cost comparison. ---------- Methods: The annual cost of professional fees, contact lenses and solutions when wearing daily, two-weekly and monthly replacement contact lenses is determined in the context of the Australian market for spherical, toric and multifocal prescription types. This annual cost is divided by the number of times lenses are worn per year, resulting in a ‘cost-per-wear’. The model is presented graphically as the cost-per-wear versus the number of times lenses are worn each week for daily replacement and reusable (two-weekly and monthly replacement) lenses.---------- Results: The cost-per-wear for two-weekly and monthly replacement spherical lenses is almost identical but decreases with increasing frequency of wear. The cost-per-wear of daily replacement spherical lenses is lower than for reusable spherical lenses, when worn from one to four days per week but higher when worn six or seven days per week. The point at which the cost-per-wear is virtually the same for all three spherical lens replacement frequencies (approximately AUD$3.00) is five days of lens wear per week. A similar but upwardly displaced (higher cost) pattern is observed for toric lenses, with the cross-over point occurring between three and four days of wear per week (AUD$4.80). Multifocal lenses have the highest price, with cross-over points for daily versus two-weekly replacement lenses at between four and five days of wear per week (AUD$5.00) and for daily versus monthly replacement lenses at three days per week (AUD$5.50).---------- Conclusions: This cost-per-wear model can be used to assist practitioners and patients in making an informed decision in relation to the cost of contact lens wear as one of many considerations that must be taken into account when deciding on the most suitable lens replacement modality.

A robust structure and motion replacement for bundle adjustment

This paper demonstrates the application of a robust form of pose estimation and scene reconstruction using data from camera images. We demonstrate results that suggest the ability of the algorithm to rival methods of RANSAC based pose estimation polished by bundle adjustment in terms of solution robustness, speed and accuracy, even when given poor initialisations. Our simulated results show the behaviour of the algorithm in a number of novel simulated scenarios reflective of real world cases that show the ability of the algorithm to handle large observation noise and difficult reconstruction scenes. These results have a number of implications for the vision and robotics community, and show that the application of visual motion estimation on robotic platforms in an online fashion is approaching real-world feasibility.

Lineage replacement accompanying duplication and rapid fixation of an RNA element in the nsP3 gene in a species of alphavirus

A sequence of thirty-six nucleotides in the nsP3 gene of Ross River virus (RRV), coding for the amino acid sequence HADTVSLDSTVS, was duplicated some time between 1969 and 1979 coinciding with the appearance of a new lineage of this virus and with a major outbreak of Epidemic Polyarthritis among residents of the Pacific Islands. This lineage of RRV continues to circulate throughout Australia and both earlier lineages, which lacked the duplicated element, now are extinct. Multiple copies of several other elements also were observed in this region of the nsP3 gene in all lineages of RRV. Multiple copies of one of these, coding for the amino acid sequence P*P*PR, were detected in the C-terminal region of the nsP3 protein of all alphaviruses except those of African origin. The fixation of duplications and insertions in 3' region of nsP3 genes from all lineages of alphaviruses, suggests they provide some fitness advantage

Reliability analysis and economic equipment replacement appraisal for substation and sub-transmission systems with explicit inclusion of non-repairable failures

The modern society has come to expect the electrical energy on demand, while many of the facilities in power systems are aging beyond repair and maintenance. The risk of failure is increasing with the aging equipments and can pose serious consequences for continuity of electricity supply. As the equipments used in high voltage power networks are very expensive, economically it may not be feasible to purchase and store spares in a warehouse for extended periods of time. On the other hand, there is normally a significant time before receiving equipment once it is ordered. This situation has created a considerable interest in the evaluation and application of probability methods for aging plant and provisions of spares in bulk supply networks, and can be of particular importance for substations. Quantitative adequacy assessment of substation and sub-transmission power systems is generally done using a contingency enumeration approach which includes the evaluation of contingencies, classification of the contingencies based on selected failure criteria. The problem is very complex because of the need to include detailed modelling and operation of substation and sub-transmission equipment using network flow evaluation and to consider multiple levels of component failures. In this thesis a new model associated with aging equipment is developed to combine the standard tools of random failures, as well as specific model for aging failures. This technique is applied in this thesis to include and examine the impact of aging equipments on system reliability of bulk supply loads and consumers in distribution network for defined range of planning years. The power system risk indices depend on many factors such as the actual physical network configuration and operation, aging conditions of the equipment, and the relevant constraints. The impact and importance of equipment reliability on power system risk indices in a network with aging facilities contains valuable information for utilities to better understand network performance and the weak links in the system. In this thesis, algorithms are developed to measure the contribution of individual equipment to the power system risk indices, as part of the novel risk analysis tool. A new cost worth approach was developed in this thesis that can make an early decision in planning for replacement activities concerning non-repairable aging components, in order to maintain a system reliability performance which economically is acceptable. The concepts, techniques and procedures developed in this thesis are illustrated numerically using published test systems. It is believed that the methods and approaches presented, substantially improve the accuracy of risk predictions by explicit consideration of the effect of equipment entering a period of increased risk of a non-repairable failure.

Perioperative mortality after hemiarthroplasty related to fixation method : a study based on the Australian Orthopaedic Association National Joint Replacement Registry

Background and purpose: The appropriate fixation method for hemiarthroplasty of the hip as it relates to implant survivorship and patient mortality is a matter of ongoing debate. We examined the influence of fixation method on revision rate and mortality.----- ----- Methods: We analyzed approximately 25,000 hemiarthroplasty cases from the AOA National Joint Replacement Registry. Deaths at 1 day, 1 week, 1 month, and 1 year were compared for all patients and among subgroups based on implant type.----- ----- Results: Patients treated with cemented monoblock hemiarthroplasty had a 1.7-times higher day-1 mortality compared to uncemented monoblock components (p < 0.001). This finding was reversed by 1 week, 1 month, and 1 year after surgery (p < 0.001). Modular hemiarthroplasties did not reveal a difference in mortality between fixation methods at any time point.----- ----- Interpretation: This study shows lower (or similar) overall mortality with cemented hemiarthroplasty of the hip.

Maximum recovery after knee replacement - the MARKER study rationale and protocol

Background There is little scientific evidence to support the usual practice of providing outpatient rehabilitation to patients undergoing total knee replacement surgery (TKR) immediately after discharge from the orthopaedic ward. It is hypothesised that the lack of clinical benefit is due to the low exercise intensity tolerated at this time, with patients still recovering from the effects of major orthopaedic surgery. The aim of the proposed clinical trial is to investigate the clinical and cost effectiveness of a novel rehabilitation strategy, consisting of an initial home exercise programme followed, approximately six weeks later, by higher intensity outpatient exercise classes. Methods/Design In this multicentre randomised controlled trial, 600 patients undergoing primary TKR will be recruited at the orthopaedic pre-admission clinic of 10 large public and private hospitals in Australia. There will be no change to the medical or rehabilitative care usually provided while the participant is admitted to the orthopaedic ward. After TKR, but prior to discharge from the orthopaedic ward, participants will be randomised to either the novel rehabilitation strategy or usual rehabilitative care as provided by the hospital or recommended by the orthopaedic surgeon. Outcomes assessments will be conducted at baseline (pre-admission clinic) and at 6 weeks, 6 months and 12 months following randomisation. The primary outcomes will be self-reported knee pain and physical function. Secondary outcomes include quality of life and objective measures of physical performance. Health economic data (health sector and community service utilisation, loss of productivity) will be recorded prospectively by participants in a patient diary. This patient cohort will also be followed-up annually for five years for knee pain, physical function and the need or actual incidence of further joint replacement surgery. Discussion The results of this pragmatic clinical trial can be directly implemented into clinical practice. If beneficial, the novel rehabilitation strategy of utilising outpatient exercise classes during a later rehabilitation phase would provide a feasible and potentially cost-effective intervention to optimise the physical well-being of the large number of people undergoing TKR.

Acetabular impaction grafting in total hip replacement

Background and purpose: Acetabular impaction grafting has been shown to have excellent results, but concerns regarding its suitability for larger defects have been highlighted. We report the use of this technique in a large cohort of patients with the aim of better understanding the limitations of the technique. Methods: We investigated a consecutive group of 339 cases of impaction grafting of the cup with morcellised impacted allograft bone for survivorship and mechanisms for early failure. Results: Kaplan Meier survival was 89.1% (95% CI 83.2 to 95.0%) at 5.8 years for revision for any reason, and 91.6% (95% CI 85.9 to 97.3%) for revision for aseptic loosening of the cup. Of the 15 cases revised for aseptic cup loosening, nine were large rim mesh reconstructions, two were fractured Kerboull-Postel plates, two were migrating cages, one medial wall mesh failure and one impaction alone failed. Interpretation: In our series, results were disappointing where a large rim mesh or significant reconstruction was required. In light of these results, our technique has changed in that we now use predominantly larger chips of purely cancellous bone, 8-10 mm3 in size, to fill the cavity and larger diameter cups to better fill the mouth of the reconstructed acetabulum. In addition we now make greater use of i) implants made of a highly porous in-growth surface to constrain allograft chips and ii) bulk allografts combined with cages and morcellised chips in cases with very large segmental and cavitary defects.

Adaptive cache aware multiprocessor scheduling framework

Computer resource allocation represents a significant challenge particularly for multiprocessor systems, which consist of shared computing resources to be allocated among co-runner processes and threads. While an efficient resource allocation would result in a highly efficient and stable overall multiprocessor system and individual thread performance, ineffective poor resource allocation causes significant performance bottlenecks even for the system with high computing resources. This thesis proposes a cache aware adaptive closed loop scheduling framework as an efficient resource allocation strategy for the highly dynamic resource management problem, which requires instant estimation of highly uncertain and unpredictable resource patterns. Many different approaches to this highly dynamic resource allocation problem have been developed but neither the dynamic nature nor the time-varying and uncertain characteristics of the resource allocation problem is well considered. These approaches facilitate either static and dynamic optimization methods or advanced scheduling algorithms such as the Proportional Fair (PFair) scheduling algorithm. Some of these approaches, which consider the dynamic nature of multiprocessor systems, apply only a basic closed loop system; hence, they fail to take the time-varying and uncertainty of the system into account. Therefore, further research into the multiprocessor resource allocation is required. Our closed loop cache aware adaptive scheduling framework takes the resource availability and the resource usage patterns into account by measuring time-varying factors such as cache miss counts, stalls and instruction counts. More specifically, the cache usage pattern of the thread is identified using QR recursive least square algorithm (RLS) and cache miss count time series statistics. For the identified cache resource dynamics, our closed loop cache aware adaptive scheduling framework enforces instruction fairness for the threads. Fairness in the context of our research project is defined as a resource allocation equity, which reduces corunner thread dependence in a shared resource environment. In this way, instruction count degradation due to shared cache resource conflicts is overcome. In this respect, our closed loop cache aware adaptive scheduling framework contributes to the research field in two major and three minor aspects. The two major contributions lead to the cache aware scheduling system. The first major contribution is the development of the execution fairness algorithm, which degrades the co-runner cache impact on the thread performance. The second contribution is the development of relevant mathematical models, such as thread execution pattern and cache access pattern models, which in fact formulate the execution fairness algorithm in terms of mathematical quantities. Following the development of the cache aware scheduling system, our adaptive self-tuning control framework is constructed to add an adaptive closed loop aspect to the cache aware scheduling system. This control framework in fact consists of two main components: the parameter estimator, and the controller design module. The first minor contribution is the development of the parameter estimators; the QR Recursive Least Square(RLS) algorithm is applied into our closed loop cache aware adaptive scheduling framework to estimate highly uncertain and time-varying cache resource patterns of threads. The second minor contribution is the designing of a controller design module; the algebraic controller design algorithm, Pole Placement, is utilized to design the relevant controller, which is able to provide desired timevarying control action. The adaptive self-tuning control framework and cache aware scheduling system in fact constitute our final framework, closed loop cache aware adaptive scheduling framework. The third minor contribution is to validate this cache aware adaptive closed loop scheduling framework efficiency in overwhelming the co-runner cache dependency. The timeseries statistical counters are developed for M-Sim Multi-Core Simulator; and the theoretical findings and mathematical formulations are applied as MATLAB m-file software codes. In this way, the overall framework is tested and experiment outcomes are analyzed. According to our experiment outcomes, it is concluded that our closed loop cache aware adaptive scheduling framework successfully drives co-runner cache dependent thread instruction count to co-runner independent instruction count with an error margin up to 25% in case cache is highly utilized. In addition, thread cache access pattern is also estimated with 75% accuracy.